2 * This file is part of cparser.
3 * Copyright (C) 2007-2008 Matthias Braun <matze@braunis.de>
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License
7 * as published by the Free Software Foundation; either version 2
8 * of the License, or (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
27 #include "diagnostic.h"
28 #include "format_check.h"
34 #include "type_hash.h"
36 #include "lang_features.h"
38 #include "adt/bitfiddle.h"
39 #include "adt/error.h"
40 #include "adt/array.h"
42 /** if wchar_t is equal to unsigned short. */
43 bool opt_short_wchar_t =
50 //#define PRINT_TOKENS
51 #define MAX_LOOKAHEAD 2
54 declaration_t *old_declaration;
56 unsigned short namespc;
59 typedef struct argument_list_t argument_list_t;
60 struct argument_list_t {
62 argument_list_t *next;
65 typedef struct gnu_attribute_t gnu_attribute_t;
66 struct gnu_attribute_t {
67 gnu_attribute_kind_t kind; /**< The kind of the GNU attribute. */
68 gnu_attribute_t *next;
69 bool invalid; /**< Set if this attribute had argument errors, */
70 bool have_arguments; /**< True, if this attribute has arguments. */
74 atomic_type_kind_t akind;
75 long argument; /**< Single argument. */
76 argument_list_t *arguments; /**< List of argument expressions. */
80 typedef struct declaration_specifiers_t declaration_specifiers_t;
81 struct declaration_specifiers_t {
82 source_position_t source_position;
83 unsigned char declared_storage_class;
84 unsigned char alignment; /**< Alignment, 0 if not set. */
85 unsigned int is_inline : 1;
86 unsigned int deprecated : 1;
87 decl_modifiers_t modifiers; /**< declaration modifiers */
88 gnu_attribute_t *gnu_attributes; /**< list of GNU attributes */
89 const char *deprecated_string; /**< can be set if declaration was marked deprecated. */
90 symbol_t *get_property_sym; /**< the name of the get property if set. */
91 symbol_t *put_property_sym; /**< the name of the put property if set. */
96 * An environment for parsing initializers (and compound literals).
98 typedef struct parse_initializer_env_t {
99 type_t *type; /**< the type of the initializer. In case of an
100 array type with unspecified size this gets
101 adjusted to the actual size. */
102 declaration_t *declaration; /**< the declaration that is initialized if any */
103 bool must_be_constant;
104 } parse_initializer_env_t;
106 typedef declaration_t* (*parsed_declaration_func) (declaration_t *declaration);
108 static token_t token;
109 static token_t lookahead_buffer[MAX_LOOKAHEAD];
110 static int lookahead_bufpos;
111 static stack_entry_t *environment_stack = NULL;
112 static stack_entry_t *label_stack = NULL;
113 static scope_t *global_scope = NULL;
114 static scope_t *scope = NULL;
115 static declaration_t *last_declaration = NULL;
116 static declaration_t *current_function = NULL;
117 static switch_statement_t *current_switch = NULL;
118 static statement_t *current_loop = NULL;
119 static statement_t *current_parent = NULL;
120 static ms_try_statement_t *current_try = NULL;
121 static goto_statement_t *goto_first = NULL;
122 static goto_statement_t *goto_last = NULL;
123 static label_statement_t *label_first = NULL;
124 static label_statement_t *label_last = NULL;
125 static translation_unit_t *unit = NULL;
126 static struct obstack temp_obst;
128 #define PUSH_PARENT(stmt) \
129 statement_t *const prev_parent = current_parent; \
130 current_parent = (stmt);
131 #define POP_PARENT ((void)(current_parent = prev_parent))
133 static source_position_t null_position = { NULL, 0 };
135 /* symbols for Microsoft extended-decl-modifier */
136 static const symbol_t *sym_align = NULL;
137 static const symbol_t *sym_allocate = NULL;
138 static const symbol_t *sym_dllimport = NULL;
139 static const symbol_t *sym_dllexport = NULL;
140 static const symbol_t *sym_naked = NULL;
141 static const symbol_t *sym_noinline = NULL;
142 static const symbol_t *sym_noreturn = NULL;
143 static const symbol_t *sym_nothrow = NULL;
144 static const symbol_t *sym_novtable = NULL;
145 static const symbol_t *sym_property = NULL;
146 static const symbol_t *sym_get = NULL;
147 static const symbol_t *sym_put = NULL;
148 static const symbol_t *sym_selectany = NULL;
149 static const symbol_t *sym_thread = NULL;
150 static const symbol_t *sym_uuid = NULL;
151 static const symbol_t *sym_deprecated = NULL;
152 static const symbol_t *sym_restrict = NULL;
153 static const symbol_t *sym_noalias = NULL;
155 /** The token anchor set */
156 static unsigned char token_anchor_set[T_LAST_TOKEN];
158 /** The current source position. */
159 #define HERE (&token.source_position)
161 static type_t *type_valist;
163 static statement_t *parse_compound_statement(bool inside_expression_statement);
164 static statement_t *parse_statement(void);
166 static expression_t *parse_sub_expression(unsigned precedence);
167 static expression_t *parse_expression(void);
168 static type_t *parse_typename(void);
170 static void parse_compound_type_entries(declaration_t *compound_declaration);
171 static declaration_t *parse_declarator(
172 const declaration_specifiers_t *specifiers, bool may_be_abstract);
173 static declaration_t *record_declaration(declaration_t *declaration);
175 static void semantic_comparison(binary_expression_t *expression);
177 #define STORAGE_CLASSES \
185 #define TYPE_QUALIFIERS \
190 case T__forceinline: \
191 case T___attribute__:
193 #ifdef PROVIDE_COMPLEX
194 #define COMPLEX_SPECIFIERS \
196 #define IMAGINARY_SPECIFIERS \
199 #define COMPLEX_SPECIFIERS
200 #define IMAGINARY_SPECIFIERS
203 #define TYPE_SPECIFIERS \
218 case T___builtin_va_list: \
223 #define DECLARATION_START \
228 #define TYPENAME_START \
233 * Allocate an AST node with given size and
234 * initialize all fields with zero.
236 static void *allocate_ast_zero(size_t size)
238 void *res = allocate_ast(size);
239 memset(res, 0, size);
243 static declaration_t *allocate_declaration_zero(void)
245 declaration_t *declaration = allocate_ast_zero(sizeof(declaration_t));
246 declaration->type = type_error_type;
247 declaration->alignment = 0;
252 * Returns the size of a statement node.
254 * @param kind the statement kind
256 static size_t get_statement_struct_size(statement_kind_t kind)
258 static const size_t sizes[] = {
259 [STATEMENT_INVALID] = sizeof(invalid_statement_t),
260 [STATEMENT_EMPTY] = sizeof(empty_statement_t),
261 [STATEMENT_COMPOUND] = sizeof(compound_statement_t),
262 [STATEMENT_RETURN] = sizeof(return_statement_t),
263 [STATEMENT_DECLARATION] = sizeof(declaration_statement_t),
264 [STATEMENT_IF] = sizeof(if_statement_t),
265 [STATEMENT_SWITCH] = sizeof(switch_statement_t),
266 [STATEMENT_EXPRESSION] = sizeof(expression_statement_t),
267 [STATEMENT_CONTINUE] = sizeof(statement_base_t),
268 [STATEMENT_BREAK] = sizeof(statement_base_t),
269 [STATEMENT_GOTO] = sizeof(goto_statement_t),
270 [STATEMENT_LABEL] = sizeof(label_statement_t),
271 [STATEMENT_CASE_LABEL] = sizeof(case_label_statement_t),
272 [STATEMENT_WHILE] = sizeof(while_statement_t),
273 [STATEMENT_DO_WHILE] = sizeof(do_while_statement_t),
274 [STATEMENT_FOR] = sizeof(for_statement_t),
275 [STATEMENT_ASM] = sizeof(asm_statement_t),
276 [STATEMENT_MS_TRY] = sizeof(ms_try_statement_t),
277 [STATEMENT_LEAVE] = sizeof(leave_statement_t)
279 assert(kind <= sizeof(sizes) / sizeof(sizes[0]));
280 assert(sizes[kind] != 0);
285 * Returns the size of an expression node.
287 * @param kind the expression kind
289 static size_t get_expression_struct_size(expression_kind_t kind)
291 static const size_t sizes[] = {
292 [EXPR_INVALID] = sizeof(expression_base_t),
293 [EXPR_REFERENCE] = sizeof(reference_expression_t),
294 [EXPR_CONST] = sizeof(const_expression_t),
295 [EXPR_CHARACTER_CONSTANT] = sizeof(const_expression_t),
296 [EXPR_WIDE_CHARACTER_CONSTANT] = sizeof(const_expression_t),
297 [EXPR_STRING_LITERAL] = sizeof(string_literal_expression_t),
298 [EXPR_WIDE_STRING_LITERAL] = sizeof(wide_string_literal_expression_t),
299 [EXPR_COMPOUND_LITERAL] = sizeof(compound_literal_expression_t),
300 [EXPR_CALL] = sizeof(call_expression_t),
301 [EXPR_UNARY_FIRST] = sizeof(unary_expression_t),
302 [EXPR_BINARY_FIRST] = sizeof(binary_expression_t),
303 [EXPR_CONDITIONAL] = sizeof(conditional_expression_t),
304 [EXPR_SELECT] = sizeof(select_expression_t),
305 [EXPR_ARRAY_ACCESS] = sizeof(array_access_expression_t),
306 [EXPR_SIZEOF] = sizeof(typeprop_expression_t),
307 [EXPR_ALIGNOF] = sizeof(typeprop_expression_t),
308 [EXPR_CLASSIFY_TYPE] = sizeof(classify_type_expression_t),
309 [EXPR_FUNCNAME] = sizeof(funcname_expression_t),
310 [EXPR_BUILTIN_SYMBOL] = sizeof(builtin_symbol_expression_t),
311 [EXPR_BUILTIN_CONSTANT_P] = sizeof(builtin_constant_expression_t),
312 [EXPR_BUILTIN_PREFETCH] = sizeof(builtin_prefetch_expression_t),
313 [EXPR_OFFSETOF] = sizeof(offsetof_expression_t),
314 [EXPR_VA_START] = sizeof(va_start_expression_t),
315 [EXPR_VA_ARG] = sizeof(va_arg_expression_t),
316 [EXPR_STATEMENT] = sizeof(statement_expression_t),
318 if (kind >= EXPR_UNARY_FIRST && kind <= EXPR_UNARY_LAST) {
319 return sizes[EXPR_UNARY_FIRST];
321 if (kind >= EXPR_BINARY_FIRST && kind <= EXPR_BINARY_LAST) {
322 return sizes[EXPR_BINARY_FIRST];
324 assert(kind <= sizeof(sizes) / sizeof(sizes[0]));
325 assert(sizes[kind] != 0);
330 * Allocate a statement node of given kind and initialize all
333 static statement_t *allocate_statement_zero(statement_kind_t kind)
335 size_t size = get_statement_struct_size(kind);
336 statement_t *res = allocate_ast_zero(size);
338 res->base.kind = kind;
339 res->base.parent = current_parent;
344 * Allocate an expression node of given kind and initialize all
347 static expression_t *allocate_expression_zero(expression_kind_t kind)
349 size_t size = get_expression_struct_size(kind);
350 expression_t *res = allocate_ast_zero(size);
352 res->base.kind = kind;
353 res->base.type = type_error_type;
358 * Creates a new invalid expression.
360 static expression_t *create_invalid_expression(void)
362 expression_t *expression = allocate_expression_zero(EXPR_INVALID);
363 expression->base.source_position = token.source_position;
368 * Creates a new invalid statement.
370 static statement_t *create_invalid_statement(void)
372 statement_t *statement = allocate_statement_zero(STATEMENT_INVALID);
373 statement->base.source_position = token.source_position;
378 * Allocate a new empty statement.
380 static statement_t *create_empty_statement(void)
382 statement_t *statement = allocate_statement_zero(STATEMENT_EMPTY);
383 statement->base.source_position = token.source_position;
388 * Returns the size of a type node.
390 * @param kind the type kind
392 static size_t get_type_struct_size(type_kind_t kind)
394 static const size_t sizes[] = {
395 [TYPE_ATOMIC] = sizeof(atomic_type_t),
396 [TYPE_COMPLEX] = sizeof(complex_type_t),
397 [TYPE_IMAGINARY] = sizeof(imaginary_type_t),
398 [TYPE_BITFIELD] = sizeof(bitfield_type_t),
399 [TYPE_COMPOUND_STRUCT] = sizeof(compound_type_t),
400 [TYPE_COMPOUND_UNION] = sizeof(compound_type_t),
401 [TYPE_ENUM] = sizeof(enum_type_t),
402 [TYPE_FUNCTION] = sizeof(function_type_t),
403 [TYPE_POINTER] = sizeof(pointer_type_t),
404 [TYPE_ARRAY] = sizeof(array_type_t),
405 [TYPE_BUILTIN] = sizeof(builtin_type_t),
406 [TYPE_TYPEDEF] = sizeof(typedef_type_t),
407 [TYPE_TYPEOF] = sizeof(typeof_type_t),
409 assert(sizeof(sizes) / sizeof(sizes[0]) == (int) TYPE_TYPEOF + 1);
410 assert(kind <= TYPE_TYPEOF);
411 assert(sizes[kind] != 0);
416 * Allocate a type node of given kind and initialize all
419 * @param kind type kind to allocate
420 * @param source_position the source position of the type definition
422 static type_t *allocate_type_zero(type_kind_t kind, const source_position_t *source_position)
424 size_t size = get_type_struct_size(kind);
425 type_t *res = obstack_alloc(type_obst, size);
426 memset(res, 0, size);
428 res->base.kind = kind;
429 res->base.source_position = *source_position;
434 * Returns the size of an initializer node.
436 * @param kind the initializer kind
438 static size_t get_initializer_size(initializer_kind_t kind)
440 static const size_t sizes[] = {
441 [INITIALIZER_VALUE] = sizeof(initializer_value_t),
442 [INITIALIZER_STRING] = sizeof(initializer_string_t),
443 [INITIALIZER_WIDE_STRING] = sizeof(initializer_wide_string_t),
444 [INITIALIZER_LIST] = sizeof(initializer_list_t),
445 [INITIALIZER_DESIGNATOR] = sizeof(initializer_designator_t)
447 assert(kind < sizeof(sizes) / sizeof(*sizes));
448 assert(sizes[kind] != 0);
453 * Allocate an initializer node of given kind and initialize all
456 static initializer_t *allocate_initializer_zero(initializer_kind_t kind)
458 initializer_t *result = allocate_ast_zero(get_initializer_size(kind));
465 * Free a type from the type obstack.
467 static void free_type(void *type)
469 obstack_free(type_obst, type);
473 * Returns the index of the top element of the environment stack.
475 static size_t environment_top(void)
477 return ARR_LEN(environment_stack);
481 * Returns the index of the top element of the label stack.
483 static size_t label_top(void)
485 return ARR_LEN(label_stack);
489 * Return the next token.
491 static inline void next_token(void)
493 token = lookahead_buffer[lookahead_bufpos];
494 lookahead_buffer[lookahead_bufpos] = lexer_token;
497 lookahead_bufpos = (lookahead_bufpos+1) % MAX_LOOKAHEAD;
500 print_token(stderr, &token);
501 fprintf(stderr, "\n");
506 * Return the next token with a given lookahead.
508 static inline const token_t *look_ahead(int num)
510 assert(num > 0 && num <= MAX_LOOKAHEAD);
511 int pos = (lookahead_bufpos+num-1) % MAX_LOOKAHEAD;
512 return &lookahead_buffer[pos];
516 * Adds a token to the token anchor set (a multi-set).
518 static void add_anchor_token(int token_type)
520 assert(0 <= token_type && token_type < T_LAST_TOKEN);
521 ++token_anchor_set[token_type];
524 static int save_and_reset_anchor_state(int token_type)
526 assert(0 <= token_type && token_type < T_LAST_TOKEN);
527 int count = token_anchor_set[token_type];
528 token_anchor_set[token_type] = 0;
532 static void restore_anchor_state(int token_type, int count)
534 assert(0 <= token_type && token_type < T_LAST_TOKEN);
535 token_anchor_set[token_type] = count;
539 * Remove a token from the token anchor set (a multi-set).
541 static void rem_anchor_token(int token_type)
543 assert(0 <= token_type && token_type < T_LAST_TOKEN);
544 --token_anchor_set[token_type];
547 static bool at_anchor(void)
551 return token_anchor_set[token.type];
555 * Eat tokens until a matching token is found.
557 static void eat_until_matching_token(int type)
561 case '(': end_token = ')'; break;
562 case '{': end_token = '}'; break;
563 case '[': end_token = ']'; break;
564 default: end_token = type; break;
567 unsigned parenthesis_count = 0;
568 unsigned brace_count = 0;
569 unsigned bracket_count = 0;
570 while (token.type != end_token ||
571 parenthesis_count != 0 ||
573 bracket_count != 0) {
574 switch (token.type) {
576 case '(': ++parenthesis_count; break;
577 case '{': ++brace_count; break;
578 case '[': ++bracket_count; break;
581 if (parenthesis_count > 0)
591 if (bracket_count > 0)
594 if (token.type == end_token &&
595 parenthesis_count == 0 &&
609 * Eat input tokens until an anchor is found.
611 static void eat_until_anchor(void)
613 if (token.type == T_EOF)
615 while (token_anchor_set[token.type] == 0) {
616 if (token.type == '(' || token.type == '{' || token.type == '[')
617 eat_until_matching_token(token.type);
618 if (token.type == T_EOF)
624 static void eat_block(void)
626 eat_until_matching_token('{');
627 if (token.type == '}')
632 * eat all token until a ';' is reached or a stop token is found.
634 static void eat_statement(void)
636 eat_until_matching_token(';');
637 if (token.type == ';')
641 #define eat(token_type) do { assert(token.type == token_type); next_token(); } while (0)
644 * Report a parse error because an expected token was not found.
647 #if defined __GNUC__ && __GNUC__ >= 4
648 __attribute__((sentinel))
650 void parse_error_expected(const char *message, ...)
652 if (message != NULL) {
653 errorf(HERE, "%s", message);
656 va_start(ap, message);
657 errorf(HERE, "got %K, expected %#k", &token, &ap, ", ");
662 * Report a type error.
664 static void type_error(const char *msg, const source_position_t *source_position,
667 errorf(source_position, "%s, but found type '%T'", msg, type);
671 * Report an incompatible type.
673 static void type_error_incompatible(const char *msg,
674 const source_position_t *source_position, type_t *type1, type_t *type2)
676 errorf(source_position, "%s, incompatible types: '%T' - '%T'",
681 * Expect the the current token is the expected token.
682 * If not, generate an error, eat the current statement,
683 * and goto the end_error label.
685 #define expect(expected) \
687 if (UNLIKELY(token.type != (expected))) { \
688 parse_error_expected(NULL, (expected), NULL); \
689 add_anchor_token(expected); \
690 eat_until_anchor(); \
691 if (token.type == expected) \
693 rem_anchor_token(expected); \
699 static void set_scope(scope_t *new_scope)
702 scope->last_declaration = last_declaration;
706 last_declaration = new_scope->last_declaration;
710 * Search a symbol in a given namespace and returns its declaration or
711 * NULL if this symbol was not found.
713 static declaration_t *get_declaration(const symbol_t *const symbol,
714 const namespace_t namespc)
716 declaration_t *declaration = symbol->declaration;
717 for( ; declaration != NULL; declaration = declaration->symbol_next) {
718 if (declaration->namespc == namespc)
726 * pushs an environment_entry on the environment stack and links the
727 * corresponding symbol to the new entry
729 static void stack_push(stack_entry_t **stack_ptr, declaration_t *declaration)
731 symbol_t *symbol = declaration->symbol;
732 namespace_t namespc = (namespace_t) declaration->namespc;
734 /* replace/add declaration into declaration list of the symbol */
735 declaration_t *iter = symbol->declaration;
737 symbol->declaration = declaration;
739 declaration_t *iter_last = NULL;
740 for( ; iter != NULL; iter_last = iter, iter = iter->symbol_next) {
741 /* replace an entry? */
742 if (iter->namespc == namespc) {
743 if (iter_last == NULL) {
744 symbol->declaration = declaration;
746 iter_last->symbol_next = declaration;
748 declaration->symbol_next = iter->symbol_next;
753 assert(iter_last->symbol_next == NULL);
754 iter_last->symbol_next = declaration;
758 /* remember old declaration */
760 entry.symbol = symbol;
761 entry.old_declaration = iter;
762 entry.namespc = (unsigned short) namespc;
763 ARR_APP1(stack_entry_t, *stack_ptr, entry);
766 static void environment_push(declaration_t *declaration)
768 assert(declaration->source_position.input_name != NULL);
769 assert(declaration->parent_scope != NULL);
770 stack_push(&environment_stack, declaration);
774 * Push a declaration of the label stack.
776 * @param declaration the declaration
778 static void label_push(declaration_t *declaration)
780 declaration->parent_scope = ¤t_function->scope;
781 stack_push(&label_stack, declaration);
785 * pops symbols from the environment stack until @p new_top is the top element
787 static void stack_pop_to(stack_entry_t **stack_ptr, size_t new_top)
789 stack_entry_t *stack = *stack_ptr;
790 size_t top = ARR_LEN(stack);
793 assert(new_top <= top);
797 for(i = top; i > new_top; --i) {
798 stack_entry_t *entry = &stack[i - 1];
800 declaration_t *old_declaration = entry->old_declaration;
801 symbol_t *symbol = entry->symbol;
802 namespace_t namespc = (namespace_t)entry->namespc;
804 /* replace/remove declaration */
805 declaration_t *declaration = symbol->declaration;
806 assert(declaration != NULL);
807 if (declaration->namespc == namespc) {
808 if (old_declaration == NULL) {
809 symbol->declaration = declaration->symbol_next;
811 symbol->declaration = old_declaration;
814 declaration_t *iter_last = declaration;
815 declaration_t *iter = declaration->symbol_next;
816 for( ; iter != NULL; iter_last = iter, iter = iter->symbol_next) {
817 /* replace an entry? */
818 if (iter->namespc == namespc) {
819 assert(iter_last != NULL);
820 iter_last->symbol_next = old_declaration;
821 if (old_declaration != NULL) {
822 old_declaration->symbol_next = iter->symbol_next;
827 assert(iter != NULL);
831 ARR_SHRINKLEN(*stack_ptr, (int) new_top);
834 static void environment_pop_to(size_t new_top)
836 stack_pop_to(&environment_stack, new_top);
840 * Pop all entries on the label stack until the new_top
843 * @param new_top the new stack top
845 static void label_pop_to(size_t new_top)
847 stack_pop_to(&label_stack, new_top);
850 static int get_akind_rank(atomic_type_kind_t akind)
855 static int get_rank(const type_t *type)
857 assert(!is_typeref(type));
858 /* The C-standard allows promoting enums to int or unsigned int (see § 7.2.2
859 * and esp. footnote 108). However we can't fold constants (yet), so we
860 * can't decide whether unsigned int is possible, while int always works.
861 * (unsigned int would be preferable when possible... for stuff like
862 * struct { enum { ... } bla : 4; } ) */
863 if (type->kind == TYPE_ENUM)
864 return get_akind_rank(ATOMIC_TYPE_INT);
866 assert(type->kind == TYPE_ATOMIC);
867 return get_akind_rank(type->atomic.akind);
870 static type_t *promote_integer(type_t *type)
872 if (type->kind == TYPE_BITFIELD)
873 type = type->bitfield.base_type;
875 if (get_rank(type) < get_akind_rank(ATOMIC_TYPE_INT))
882 * Create a cast expression.
884 * @param expression the expression to cast
885 * @param dest_type the destination type
887 static expression_t *create_cast_expression(expression_t *expression,
890 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST_IMPLICIT);
892 cast->unary.value = expression;
893 cast->base.type = dest_type;
899 * Check if a given expression represents the 0 pointer constant.
901 static bool is_null_pointer_constant(const expression_t *expression)
903 /* skip void* cast */
904 if (expression->kind == EXPR_UNARY_CAST
905 || expression->kind == EXPR_UNARY_CAST_IMPLICIT) {
906 expression = expression->unary.value;
909 /* TODO: not correct yet, should be any constant integer expression
910 * which evaluates to 0 */
911 if (expression->kind != EXPR_CONST)
914 type_t *const type = skip_typeref(expression->base.type);
915 if (!is_type_integer(type))
918 return expression->conste.v.int_value == 0;
922 * Create an implicit cast expression.
924 * @param expression the expression to cast
925 * @param dest_type the destination type
927 static expression_t *create_implicit_cast(expression_t *expression,
930 type_t *const source_type = expression->base.type;
932 if (source_type == dest_type)
935 return create_cast_expression(expression, dest_type);
938 typedef enum assign_error_t {
940 ASSIGN_ERROR_INCOMPATIBLE,
941 ASSIGN_ERROR_POINTER_QUALIFIER_MISSING,
942 ASSIGN_WARNING_POINTER_INCOMPATIBLE,
943 ASSIGN_WARNING_POINTER_FROM_INT,
944 ASSIGN_WARNING_INT_FROM_POINTER
947 static void report_assign_error(assign_error_t error, type_t *orig_type_left,
948 const expression_t *const right,
950 const source_position_t *source_position)
952 type_t *const orig_type_right = right->base.type;
953 type_t *const type_left = skip_typeref(orig_type_left);
954 type_t *const type_right = skip_typeref(orig_type_right);
959 case ASSIGN_ERROR_INCOMPATIBLE:
960 errorf(source_position,
961 "destination type '%T' in %s is incompatible with type '%T'",
962 orig_type_left, context, orig_type_right);
965 case ASSIGN_ERROR_POINTER_QUALIFIER_MISSING: {
966 type_t *points_to_left
967 = skip_typeref(type_left->pointer.points_to);
968 type_t *points_to_right
969 = skip_typeref(type_right->pointer.points_to);
971 /* the left type has all qualifiers from the right type */
972 unsigned missing_qualifiers
973 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
974 warningf(source_position,
975 "destination type '%T' in %s from type '%T' lacks qualifiers '%Q' in pointer target type",
976 orig_type_left, context, orig_type_right, missing_qualifiers);
980 case ASSIGN_WARNING_POINTER_INCOMPATIBLE:
981 warningf(source_position,
982 "destination type '%T' in %s is incompatible with '%E' of type '%T'",
983 orig_type_left, context, right, orig_type_right);
986 case ASSIGN_WARNING_POINTER_FROM_INT:
987 warningf(source_position,
988 "%s makes integer '%T' from pointer '%T' without a cast",
989 context, orig_type_left, orig_type_right);
992 case ASSIGN_WARNING_INT_FROM_POINTER:
993 warningf(source_position,
994 "%s makes integer '%T' from pointer '%T' without a cast",
995 context, orig_type_left, orig_type_right);
999 panic("invalid error value");
1003 /** Implements the rules from § 6.5.16.1 */
1004 static assign_error_t semantic_assign(type_t *orig_type_left,
1005 const expression_t *const right)
1007 type_t *const orig_type_right = right->base.type;
1008 type_t *const type_left = skip_typeref(orig_type_left);
1009 type_t *const type_right = skip_typeref(orig_type_right);
1011 if (is_type_pointer(type_left)) {
1012 if (is_null_pointer_constant(right)) {
1013 return ASSIGN_SUCCESS;
1014 } else if (is_type_pointer(type_right)) {
1015 type_t *points_to_left
1016 = skip_typeref(type_left->pointer.points_to);
1017 type_t *points_to_right
1018 = skip_typeref(type_right->pointer.points_to);
1019 assign_error_t res = ASSIGN_SUCCESS;
1021 /* the left type has all qualifiers from the right type */
1022 unsigned missing_qualifiers
1023 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
1024 if (missing_qualifiers != 0) {
1025 res = ASSIGN_ERROR_POINTER_QUALIFIER_MISSING;
1028 points_to_left = get_unqualified_type(points_to_left);
1029 points_to_right = get_unqualified_type(points_to_right);
1031 if (is_type_atomic(points_to_left, ATOMIC_TYPE_VOID) ||
1032 is_type_atomic(points_to_right, ATOMIC_TYPE_VOID)) {
1036 if (!types_compatible(points_to_left, points_to_right)) {
1037 return ASSIGN_WARNING_POINTER_INCOMPATIBLE;
1041 } else if (is_type_integer(type_right)) {
1042 return ASSIGN_WARNING_POINTER_FROM_INT;
1044 } else if ((is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) ||
1045 (is_type_atomic(type_left, ATOMIC_TYPE_BOOL)
1046 && is_type_pointer(type_right))) {
1047 return ASSIGN_SUCCESS;
1048 } else if ((is_type_compound(type_left) && is_type_compound(type_right))
1049 || (is_type_builtin(type_left) && is_type_builtin(type_right))) {
1050 type_t *const unqual_type_left = get_unqualified_type(type_left);
1051 type_t *const unqual_type_right = get_unqualified_type(type_right);
1052 if (types_compatible(unqual_type_left, unqual_type_right)) {
1053 return ASSIGN_SUCCESS;
1055 } else if (is_type_integer(type_left) && is_type_pointer(type_right)) {
1056 return ASSIGN_WARNING_INT_FROM_POINTER;
1059 if (!is_type_valid(type_left) || !is_type_valid(type_right))
1060 return ASSIGN_SUCCESS;
1062 return ASSIGN_ERROR_INCOMPATIBLE;
1065 static expression_t *parse_constant_expression(void)
1067 /* start parsing at precedence 7 (conditional expression) */
1068 expression_t *result = parse_sub_expression(7);
1070 if (!is_constant_expression(result)) {
1071 errorf(&result->base.source_position,
1072 "expression '%E' is not constant\n", result);
1078 static expression_t *parse_assignment_expression(void)
1080 /* start parsing at precedence 2 (assignment expression) */
1081 return parse_sub_expression(2);
1084 static type_t *make_global_typedef(const char *name, type_t *type)
1086 symbol_t *const symbol = symbol_table_insert(name);
1088 declaration_t *const declaration = allocate_declaration_zero();
1089 declaration->namespc = NAMESPACE_NORMAL;
1090 declaration->storage_class = STORAGE_CLASS_TYPEDEF;
1091 declaration->declared_storage_class = STORAGE_CLASS_TYPEDEF;
1092 declaration->type = type;
1093 declaration->symbol = symbol;
1094 declaration->source_position = builtin_source_position;
1096 record_declaration(declaration);
1098 type_t *typedef_type = allocate_type_zero(TYPE_TYPEDEF, &builtin_source_position);
1099 typedef_type->typedeft.declaration = declaration;
1101 return typedef_type;
1104 static string_t parse_string_literals(void)
1106 assert(token.type == T_STRING_LITERAL);
1107 string_t result = token.v.string;
1111 while (token.type == T_STRING_LITERAL) {
1112 result = concat_strings(&result, &token.v.string);
1119 static const char *const gnu_attribute_names[GNU_AK_LAST] = {
1120 [GNU_AK_CONST] = "const",
1121 [GNU_AK_VOLATILE] = "volatile",
1122 [GNU_AK_CDECL] = "cdecl",
1123 [GNU_AK_STDCALL] = "stdcall",
1124 [GNU_AK_FASTCALL] = "fastcall",
1125 [GNU_AK_DEPRECATED] = "deprecated",
1126 [GNU_AK_NOINLINE] = "noinline",
1127 [GNU_AK_NORETURN] = "noreturn",
1128 [GNU_AK_NAKED] = "naked",
1129 [GNU_AK_PURE] = "pure",
1130 [GNU_AK_ALWAYS_INLINE] = "always_inline",
1131 [GNU_AK_MALLOC] = "malloc",
1132 [GNU_AK_WEAK] = "weak",
1133 [GNU_AK_CONSTRUCTOR] = "constructor",
1134 [GNU_AK_DESTRUCTOR] = "destructor",
1135 [GNU_AK_NOTHROW] = "nothrow",
1136 [GNU_AK_TRANSPARENT_UNION] = "transparent_union",
1137 [GNU_AK_COMMON] = "common",
1138 [GNU_AK_NOCOMMON] = "nocommon",
1139 [GNU_AK_PACKED] = "packed",
1140 [GNU_AK_SHARED] = "shared",
1141 [GNU_AK_NOTSHARED] = "notshared",
1142 [GNU_AK_USED] = "used",
1143 [GNU_AK_UNUSED] = "unused",
1144 [GNU_AK_NO_INSTRUMENT_FUNCTION] = "no_instrument_function",
1145 [GNU_AK_WARN_UNUSED_RESULT] = "warn_unused_result",
1146 [GNU_AK_LONGCALL] = "longcall",
1147 [GNU_AK_SHORTCALL] = "shortcall",
1148 [GNU_AK_LONG_CALL] = "long_call",
1149 [GNU_AK_SHORT_CALL] = "short_call",
1150 [GNU_AK_FUNCTION_VECTOR] = "function_vector",
1151 [GNU_AK_INTERRUPT] = "interrupt",
1152 [GNU_AK_INTERRUPT_HANDLER] = "interrupt_handler",
1153 [GNU_AK_NMI_HANDLER] = "nmi_handler",
1154 [GNU_AK_NESTING] = "nesting",
1155 [GNU_AK_NEAR] = "near",
1156 [GNU_AK_FAR] = "far",
1157 [GNU_AK_SIGNAL] = "signal",
1158 [GNU_AK_EIGTHBIT_DATA] = "eightbit_data",
1159 [GNU_AK_TINY_DATA] = "tiny_data",
1160 [GNU_AK_SAVEALL] = "saveall",
1161 [GNU_AK_FLATTEN] = "flatten",
1162 [GNU_AK_SSEREGPARM] = "sseregparm",
1163 [GNU_AK_EXTERNALLY_VISIBLE] = "externally_visible",
1164 [GNU_AK_RETURN_TWICE] = "return_twice",
1165 [GNU_AK_MAY_ALIAS] = "may_alias",
1166 [GNU_AK_MS_STRUCT] = "ms_struct",
1167 [GNU_AK_GCC_STRUCT] = "gcc_struct",
1168 [GNU_AK_DLLIMPORT] = "dllimport",
1169 [GNU_AK_DLLEXPORT] = "dllexport",
1170 [GNU_AK_ALIGNED] = "aligned",
1171 [GNU_AK_ALIAS] = "alias",
1172 [GNU_AK_SECTION] = "section",
1173 [GNU_AK_FORMAT] = "format",
1174 [GNU_AK_FORMAT_ARG] = "format_arg",
1175 [GNU_AK_WEAKREF] = "weakref",
1176 [GNU_AK_NONNULL] = "nonnull",
1177 [GNU_AK_TLS_MODEL] = "tls_model",
1178 [GNU_AK_VISIBILITY] = "visibility",
1179 [GNU_AK_REGPARM] = "regparm",
1180 [GNU_AK_MODE] = "mode",
1181 [GNU_AK_MODEL] = "model",
1182 [GNU_AK_TRAP_EXIT] = "trap_exit",
1183 [GNU_AK_SP_SWITCH] = "sp_switch",
1184 [GNU_AK_SENTINEL] = "sentinel"
1188 * compare two string, ignoring double underscores on the second.
1190 static int strcmp_underscore(const char *s1, const char *s2)
1192 if (s2[0] == '_' && s2[1] == '_') {
1193 size_t len2 = strlen(s2);
1194 size_t len1 = strlen(s1);
1195 if (len1 == len2-4 && s2[len2-2] == '_' && s2[len2-1] == '_') {
1196 return strncmp(s1, s2+2, len2-4);
1200 return strcmp(s1, s2);
1204 * Allocate a new gnu temporal attribute.
1206 static gnu_attribute_t *allocate_gnu_attribute(gnu_attribute_kind_t kind)
1208 gnu_attribute_t *attribute = obstack_alloc(&temp_obst, sizeof(*attribute));
1209 attribute->kind = kind;
1210 attribute->next = NULL;
1211 attribute->invalid = false;
1212 attribute->have_arguments = false;
1218 * parse one constant expression argument.
1220 static void parse_gnu_attribute_const_arg(gnu_attribute_t *attribute)
1222 expression_t *expression;
1223 add_anchor_token(')');
1224 expression = parse_constant_expression();
1225 rem_anchor_token(')');
1227 attribute->u.argument = fold_constant(expression);
1230 attribute->invalid = true;
1234 * parse a list of constant expressions arguments.
1236 static void parse_gnu_attribute_const_arg_list(gnu_attribute_t *attribute)
1238 argument_list_t **list = &attribute->u.arguments;
1239 argument_list_t *entry;
1240 expression_t *expression;
1241 add_anchor_token(')');
1242 add_anchor_token(',');
1244 expression = parse_constant_expression();
1245 entry = obstack_alloc(&temp_obst, sizeof(entry));
1246 entry->argument = fold_constant(expression);
1249 list = &entry->next;
1250 if (token.type != ',')
1254 rem_anchor_token(',');
1255 rem_anchor_token(')');
1259 attribute->invalid = true;
1263 * parse one string literal argument.
1265 static void parse_gnu_attribute_string_arg(gnu_attribute_t *attribute,
1268 add_anchor_token('(');
1269 if (token.type != T_STRING_LITERAL) {
1270 parse_error_expected("while parsing attribute directive",
1271 T_STRING_LITERAL, NULL);
1274 *string = parse_string_literals();
1275 rem_anchor_token('(');
1279 attribute->invalid = true;
1283 * parse one tls model.
1285 static void parse_gnu_attribute_tls_model_arg(gnu_attribute_t *attribute)
1287 static const char *const tls_models[] = {
1293 string_t string = { NULL, 0 };
1294 parse_gnu_attribute_string_arg(attribute, &string);
1295 if (string.begin != NULL) {
1296 for(size_t i = 0; i < 4; ++i) {
1297 if (strcmp(tls_models[i], string.begin) == 0) {
1298 attribute->u.value = i;
1302 errorf(HERE, "'%s' is an unrecognized tls model", string.begin);
1304 attribute->invalid = true;
1308 * parse one tls model.
1310 static void parse_gnu_attribute_visibility_arg(gnu_attribute_t *attribute)
1312 static const char *const visibilities[] = {
1318 string_t string = { NULL, 0 };
1319 parse_gnu_attribute_string_arg(attribute, &string);
1320 if (string.begin != NULL) {
1321 for(size_t i = 0; i < 4; ++i) {
1322 if (strcmp(visibilities[i], string.begin) == 0) {
1323 attribute->u.value = i;
1327 errorf(HERE, "'%s' is an unrecognized visibility", string.begin);
1329 attribute->invalid = true;
1333 * parse one (code) model.
1335 static void parse_gnu_attribute_model_arg(gnu_attribute_t *attribute)
1337 static const char *const visibilities[] = {
1342 string_t string = { NULL, 0 };
1343 parse_gnu_attribute_string_arg(attribute, &string);
1344 if (string.begin != NULL) {
1345 for(int i = 0; i < 3; ++i) {
1346 if (strcmp(visibilities[i], string.begin) == 0) {
1347 attribute->u.value = i;
1351 errorf(HERE, "'%s' is an unrecognized model", string.begin);
1353 attribute->invalid = true;
1356 static void parse_gnu_attribute_mode_arg(gnu_attribute_t *attribute)
1358 /* TODO: find out what is allowed here... */
1360 /* at least: byte, word, pointer, list of machine modes
1361 * __XXX___ is interpreted as XXX */
1362 add_anchor_token(')');
1364 if (token.type != T_IDENTIFIER) {
1365 expect(T_IDENTIFIER);
1368 /* This isn't really correct, the backend should provide a list of machine
1369 * specific modes (according to gcc philosophy that is...) */
1370 const char *symbol_str = token.v.symbol->string;
1371 if (strcmp_underscore("QI", symbol_str) == 0 ||
1372 strcmp_underscore("byte", symbol_str) == 0) {
1373 attribute->u.akind = ATOMIC_TYPE_CHAR;
1374 } else if (strcmp_underscore("HI", symbol_str) == 0) {
1375 attribute->u.akind = ATOMIC_TYPE_SHORT;
1376 } else if (strcmp_underscore("SI", symbol_str) == 0
1377 || strcmp_underscore("word", symbol_str) == 0
1378 || strcmp_underscore("pointer", symbol_str) == 0) {
1379 attribute->u.akind = ATOMIC_TYPE_INT;
1380 } else if (strcmp_underscore("DI", symbol_str) == 0) {
1381 attribute->u.akind = ATOMIC_TYPE_LONGLONG;
1383 warningf(HERE, "ignoring unknown mode '%s'", symbol_str);
1384 attribute->invalid = true;
1388 rem_anchor_token(')');
1392 attribute->invalid = true;
1396 * parse one interrupt argument.
1398 static void parse_gnu_attribute_interrupt_arg(gnu_attribute_t *attribute)
1400 static const char *const interrupts[] = {
1407 string_t string = { NULL, 0 };
1408 parse_gnu_attribute_string_arg(attribute, &string);
1409 if (string.begin != NULL) {
1410 for(size_t i = 0; i < 5; ++i) {
1411 if (strcmp(interrupts[i], string.begin) == 0) {
1412 attribute->u.value = i;
1416 errorf(HERE, "'%s' is not an interrupt", string.begin);
1418 attribute->invalid = true;
1422 * parse ( identifier, const expression, const expression )
1424 static void parse_gnu_attribute_format_args(gnu_attribute_t *attribute)
1426 static const char *const format_names[] = {
1434 if (token.type != T_IDENTIFIER) {
1435 parse_error_expected("while parsing format attribute directive", T_IDENTIFIER, NULL);
1438 const char *name = token.v.symbol->string;
1439 for(i = 0; i < 4; ++i) {
1440 if (strcmp_underscore(format_names[i], name) == 0)
1444 if (warning.attribute)
1445 warningf(HERE, "'%s' is an unrecognized format function type", name);
1450 add_anchor_token(')');
1451 add_anchor_token(',');
1452 parse_constant_expression();
1453 rem_anchor_token(',');
1454 rem_anchor_token('(');
1457 add_anchor_token(')');
1458 parse_constant_expression();
1459 rem_anchor_token('(');
1463 attribute->u.value = true;
1466 static void check_no_argument(gnu_attribute_t *attribute, const char *name)
1468 if (!attribute->have_arguments)
1471 /* should have no arguments */
1472 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1473 eat_until_matching_token('(');
1474 /* we have already consumed '(', so we stop before ')', eat it */
1476 attribute->invalid = true;
1480 * Parse one GNU attribute.
1482 * Note that attribute names can be specified WITH or WITHOUT
1483 * double underscores, ie const or __const__.
1485 * The following attributes are parsed without arguments
1510 * no_instrument_function
1511 * warn_unused_result
1528 * externally_visible
1536 * The following attributes are parsed with arguments
1537 * aligned( const expression )
1538 * alias( string literal )
1539 * section( string literal )
1540 * format( identifier, const expression, const expression )
1541 * format_arg( const expression )
1542 * tls_model( string literal )
1543 * visibility( string literal )
1544 * regparm( const expression )
1545 * model( string leteral )
1546 * trap_exit( const expression )
1547 * sp_switch( string literal )
1549 * The following attributes might have arguments
1550 * weak_ref( string literal )
1551 * non_null( const expression // ',' )
1552 * interrupt( string literal )
1553 * sentinel( constant expression )
1555 static decl_modifiers_t parse_gnu_attribute(gnu_attribute_t **attributes)
1557 gnu_attribute_t *head = *attributes;
1558 gnu_attribute_t *last = *attributes;
1559 decl_modifiers_t modifiers = 0;
1560 gnu_attribute_t *attribute;
1562 eat(T___attribute__);
1566 if (token.type != ')') {
1567 /* find the end of the list */
1569 while (last->next != NULL)
1573 /* non-empty attribute list */
1576 if (token.type == T_const) {
1578 } else if (token.type == T_volatile) {
1580 } else if (token.type == T_cdecl) {
1581 /* __attribute__((cdecl)), WITH ms mode */
1583 } else if (token.type == T_IDENTIFIER) {
1584 const symbol_t *sym = token.v.symbol;
1587 parse_error_expected("while parsing GNU attribute", T_IDENTIFIER, NULL);
1594 for(i = 0; i < GNU_AK_LAST; ++i) {
1595 if (strcmp_underscore(gnu_attribute_names[i], name) == 0)
1598 gnu_attribute_kind_t kind = (gnu_attribute_kind_t)i;
1601 if (kind == GNU_AK_LAST) {
1602 if (warning.attribute)
1603 warningf(HERE, "'%s' attribute directive ignored", name);
1605 /* skip possible arguments */
1606 if (token.type == '(') {
1607 eat_until_matching_token(')');
1610 /* check for arguments */
1611 attribute = allocate_gnu_attribute(kind);
1612 if (token.type == '(') {
1614 if (token.type == ')') {
1615 /* empty args are allowed */
1618 attribute->have_arguments = true;
1623 case GNU_AK_VOLATILE:
1628 case GNU_AK_NOCOMMON:
1630 case GNU_AK_NOTSHARED:
1631 case GNU_AK_NO_INSTRUMENT_FUNCTION:
1632 case GNU_AK_WARN_UNUSED_RESULT:
1633 case GNU_AK_LONGCALL:
1634 case GNU_AK_SHORTCALL:
1635 case GNU_AK_LONG_CALL:
1636 case GNU_AK_SHORT_CALL:
1637 case GNU_AK_FUNCTION_VECTOR:
1638 case GNU_AK_INTERRUPT_HANDLER:
1639 case GNU_AK_NMI_HANDLER:
1640 case GNU_AK_NESTING:
1644 case GNU_AK_EIGTHBIT_DATA:
1645 case GNU_AK_TINY_DATA:
1646 case GNU_AK_SAVEALL:
1647 case GNU_AK_FLATTEN:
1648 case GNU_AK_SSEREGPARM:
1649 case GNU_AK_EXTERNALLY_VISIBLE:
1650 case GNU_AK_RETURN_TWICE:
1651 case GNU_AK_MAY_ALIAS:
1652 case GNU_AK_MS_STRUCT:
1653 case GNU_AK_GCC_STRUCT:
1656 case GNU_AK_CDECL: modifiers |= DM_CDECL; goto no_arg;
1657 case GNU_AK_FASTCALL: modifiers |= DM_FASTCALL; goto no_arg;
1658 case GNU_AK_STDCALL: modifiers |= DM_STDCALL; goto no_arg;
1659 case GNU_AK_UNUSED: modifiers |= DM_UNUSED; goto no_arg;
1660 case GNU_AK_USED: modifiers |= DM_USED; goto no_arg;
1661 case GNU_AK_PURE: modifiers |= DM_PURE; goto no_arg;
1662 case GNU_AK_ALWAYS_INLINE: modifiers |= DM_FORCEINLINE; goto no_arg;
1663 case GNU_AK_DLLIMPORT: modifiers |= DM_DLLIMPORT; goto no_arg;
1664 case GNU_AK_DLLEXPORT: modifiers |= DM_DLLEXPORT; goto no_arg;
1665 case GNU_AK_PACKED: modifiers |= DM_PACKED; goto no_arg;
1666 case GNU_AK_NOINLINE: modifiers |= DM_NOINLINE; goto no_arg;
1667 case GNU_AK_NORETURN: modifiers |= DM_NORETURN; goto no_arg;
1668 case GNU_AK_NOTHROW: modifiers |= DM_NOTHROW; goto no_arg;
1669 case GNU_AK_TRANSPARENT_UNION: modifiers |= DM_TRANSPARENT_UNION; goto no_arg;
1670 case GNU_AK_CONSTRUCTOR: modifiers |= DM_CONSTRUCTOR; goto no_arg;
1671 case GNU_AK_DESTRUCTOR: modifiers |= DM_DESTRUCTOR; goto no_arg;
1672 case GNU_AK_DEPRECATED: modifiers |= DM_DEPRECATED; goto no_arg;
1674 case GNU_AK_ALIGNED:
1675 /* __align__ may be used without an argument */
1676 if (attribute->have_arguments) {
1677 parse_gnu_attribute_const_arg(attribute);
1681 case GNU_AK_FORMAT_ARG:
1682 case GNU_AK_REGPARM:
1683 case GNU_AK_TRAP_EXIT:
1684 if (!attribute->have_arguments) {
1685 /* should have arguments */
1686 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1687 attribute->invalid = true;
1689 parse_gnu_attribute_const_arg(attribute);
1692 case GNU_AK_SECTION:
1693 case GNU_AK_SP_SWITCH:
1694 if (!attribute->have_arguments) {
1695 /* should have arguments */
1696 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1697 attribute->invalid = true;
1699 parse_gnu_attribute_string_arg(attribute, &attribute->u.string);
1702 if (!attribute->have_arguments) {
1703 /* should have arguments */
1704 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1705 attribute->invalid = true;
1707 parse_gnu_attribute_format_args(attribute);
1709 case GNU_AK_WEAKREF:
1710 /* may have one string argument */
1711 if (attribute->have_arguments)
1712 parse_gnu_attribute_string_arg(attribute, &attribute->u.string);
1714 case GNU_AK_NONNULL:
1715 if (attribute->have_arguments)
1716 parse_gnu_attribute_const_arg_list(attribute);
1718 case GNU_AK_TLS_MODEL:
1719 if (!attribute->have_arguments) {
1720 /* should have arguments */
1721 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1723 parse_gnu_attribute_tls_model_arg(attribute);
1725 case GNU_AK_VISIBILITY:
1726 if (!attribute->have_arguments) {
1727 /* should have arguments */
1728 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1730 parse_gnu_attribute_visibility_arg(attribute);
1733 if (!attribute->have_arguments) {
1734 /* should have arguments */
1735 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1737 parse_gnu_attribute_model_arg(attribute);
1741 if (!attribute->have_arguments) {
1742 /* should have arguments */
1743 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1745 parse_gnu_attribute_mode_arg(attribute);
1748 case GNU_AK_INTERRUPT:
1749 /* may have one string argument */
1750 if (attribute->have_arguments)
1751 parse_gnu_attribute_interrupt_arg(attribute);
1753 case GNU_AK_SENTINEL:
1754 /* may have one string argument */
1755 if (attribute->have_arguments)
1756 parse_gnu_attribute_const_arg(attribute);
1759 /* already handled */
1763 check_no_argument(attribute, name);
1766 if (attribute != NULL) {
1768 last->next = attribute;
1771 head = last = attribute;
1775 if (token.type != ',')
1789 * Parse GNU attributes.
1791 static decl_modifiers_t parse_attributes(gnu_attribute_t **attributes)
1793 decl_modifiers_t modifiers = 0;
1796 switch(token.type) {
1797 case T___attribute__:
1798 modifiers |= parse_gnu_attribute(attributes);
1804 if (token.type != T_STRING_LITERAL) {
1805 parse_error_expected("while parsing assembler attribute",
1806 T_STRING_LITERAL, NULL);
1807 eat_until_matching_token('(');
1810 parse_string_literals();
1815 case T_cdecl: modifiers |= DM_CDECL; break;
1816 case T__fastcall: modifiers |= DM_FASTCALL; break;
1817 case T__stdcall: modifiers |= DM_STDCALL; break;
1820 /* TODO record modifier */
1821 warningf(HERE, "Ignoring declaration modifier %K", &token);
1825 default: return modifiers;
1832 static designator_t *parse_designation(void)
1834 designator_t *result = NULL;
1835 designator_t *last = NULL;
1838 designator_t *designator;
1839 switch(token.type) {
1841 designator = allocate_ast_zero(sizeof(designator[0]));
1842 designator->source_position = token.source_position;
1844 add_anchor_token(']');
1845 designator->array_index = parse_constant_expression();
1846 rem_anchor_token(']');
1850 designator = allocate_ast_zero(sizeof(designator[0]));
1851 designator->source_position = token.source_position;
1853 if (token.type != T_IDENTIFIER) {
1854 parse_error_expected("while parsing designator",
1855 T_IDENTIFIER, NULL);
1858 designator->symbol = token.v.symbol;
1866 assert(designator != NULL);
1868 last->next = designator;
1870 result = designator;
1878 static initializer_t *initializer_from_string(array_type_t *type,
1879 const string_t *const string)
1881 /* TODO: check len vs. size of array type */
1884 initializer_t *initializer = allocate_initializer_zero(INITIALIZER_STRING);
1885 initializer->string.string = *string;
1890 static initializer_t *initializer_from_wide_string(array_type_t *const type,
1891 wide_string_t *const string)
1893 /* TODO: check len vs. size of array type */
1896 initializer_t *const initializer =
1897 allocate_initializer_zero(INITIALIZER_WIDE_STRING);
1898 initializer->wide_string.string = *string;
1904 * Build an initializer from a given expression.
1906 static initializer_t *initializer_from_expression(type_t *orig_type,
1907 expression_t *expression)
1909 /* TODO check that expression is a constant expression */
1911 /* § 6.7.8.14/15 char array may be initialized by string literals */
1912 type_t *type = skip_typeref(orig_type);
1913 type_t *expr_type_orig = expression->base.type;
1914 type_t *expr_type = skip_typeref(expr_type_orig);
1915 if (is_type_array(type) && expr_type->kind == TYPE_POINTER) {
1916 array_type_t *const array_type = &type->array;
1917 type_t *const element_type = skip_typeref(array_type->element_type);
1919 if (element_type->kind == TYPE_ATOMIC) {
1920 atomic_type_kind_t akind = element_type->atomic.akind;
1921 switch (expression->kind) {
1922 case EXPR_STRING_LITERAL:
1923 if (akind == ATOMIC_TYPE_CHAR
1924 || akind == ATOMIC_TYPE_SCHAR
1925 || akind == ATOMIC_TYPE_UCHAR) {
1926 return initializer_from_string(array_type,
1927 &expression->string.value);
1930 case EXPR_WIDE_STRING_LITERAL: {
1931 type_t *bare_wchar_type = skip_typeref(type_wchar_t);
1932 if (get_unqualified_type(element_type) == bare_wchar_type) {
1933 return initializer_from_wide_string(array_type,
1934 &expression->wide_string.value);
1944 assign_error_t error = semantic_assign(type, expression);
1945 if (error == ASSIGN_ERROR_INCOMPATIBLE)
1947 report_assign_error(error, type, expression, "initializer",
1948 &expression->base.source_position);
1950 initializer_t *const result = allocate_initializer_zero(INITIALIZER_VALUE);
1951 result->value.value = create_implicit_cast(expression, type);
1957 * Checks if a given expression can be used as an constant initializer.
1959 static bool is_initializer_constant(const expression_t *expression)
1961 return is_constant_expression(expression)
1962 || is_address_constant(expression);
1966 * Parses an scalar initializer.
1968 * § 6.7.8.11; eat {} without warning
1970 static initializer_t *parse_scalar_initializer(type_t *type,
1971 bool must_be_constant)
1973 /* there might be extra {} hierarchies */
1975 if (token.type == '{') {
1976 warningf(HERE, "extra curly braces around scalar initializer");
1980 } while (token.type == '{');
1983 expression_t *expression = parse_assignment_expression();
1984 if (must_be_constant && !is_initializer_constant(expression)) {
1985 errorf(&expression->base.source_position,
1986 "Initialisation expression '%E' is not constant\n",
1990 initializer_t *initializer = initializer_from_expression(type, expression);
1992 if (initializer == NULL) {
1993 errorf(&expression->base.source_position,
1994 "expression '%E' (type '%T') doesn't match expected type '%T'",
1995 expression, expression->base.type, type);
2000 bool additional_warning_displayed = false;
2001 while (braces > 0) {
2002 if (token.type == ',') {
2005 if (token.type != '}') {
2006 if (!additional_warning_displayed) {
2007 warningf(HERE, "additional elements in scalar initializer");
2008 additional_warning_displayed = true;
2019 * An entry in the type path.
2021 typedef struct type_path_entry_t type_path_entry_t;
2022 struct type_path_entry_t {
2023 type_t *type; /**< the upper top type. restored to path->top_tye if this entry is popped. */
2025 size_t index; /**< For array types: the current index. */
2026 declaration_t *compound_entry; /**< For compound types: the current declaration. */
2031 * A type path expression a position inside compound or array types.
2033 typedef struct type_path_t type_path_t;
2034 struct type_path_t {
2035 type_path_entry_t *path; /**< An flexible array containing the current path. */
2036 type_t *top_type; /**< type of the element the path points */
2037 size_t max_index; /**< largest index in outermost array */
2041 * Prints a type path for debugging.
2043 static __attribute__((unused)) void debug_print_type_path(
2044 const type_path_t *path)
2046 size_t len = ARR_LEN(path->path);
2048 for(size_t i = 0; i < len; ++i) {
2049 const type_path_entry_t *entry = & path->path[i];
2051 type_t *type = skip_typeref(entry->type);
2052 if (is_type_compound(type)) {
2053 /* in gcc mode structs can have no members */
2054 if (entry->v.compound_entry == NULL) {
2058 fprintf(stderr, ".%s", entry->v.compound_entry->symbol->string);
2059 } else if (is_type_array(type)) {
2060 fprintf(stderr, "[%zu]", entry->v.index);
2062 fprintf(stderr, "-INVALID-");
2065 if (path->top_type != NULL) {
2066 fprintf(stderr, " (");
2067 print_type(path->top_type);
2068 fprintf(stderr, ")");
2073 * Return the top type path entry, ie. in a path
2074 * (type).a.b returns the b.
2076 static type_path_entry_t *get_type_path_top(const type_path_t *path)
2078 size_t len = ARR_LEN(path->path);
2080 return &path->path[len-1];
2084 * Enlarge the type path by an (empty) element.
2086 static type_path_entry_t *append_to_type_path(type_path_t *path)
2088 size_t len = ARR_LEN(path->path);
2089 ARR_RESIZE(type_path_entry_t, path->path, len+1);
2091 type_path_entry_t *result = & path->path[len];
2092 memset(result, 0, sizeof(result[0]));
2097 * Descending into a sub-type. Enter the scope of the current
2100 static void descend_into_subtype(type_path_t *path)
2102 type_t *orig_top_type = path->top_type;
2103 type_t *top_type = skip_typeref(orig_top_type);
2105 assert(is_type_compound(top_type) || is_type_array(top_type));
2107 type_path_entry_t *top = append_to_type_path(path);
2108 top->type = top_type;
2110 if (is_type_compound(top_type)) {
2111 declaration_t *declaration = top_type->compound.declaration;
2112 declaration_t *entry = declaration->scope.declarations;
2113 top->v.compound_entry = entry;
2115 if (entry != NULL) {
2116 path->top_type = entry->type;
2118 path->top_type = NULL;
2121 assert(is_type_array(top_type));
2124 path->top_type = top_type->array.element_type;
2129 * Pop an entry from the given type path, ie. returning from
2130 * (type).a.b to (type).a
2132 static void ascend_from_subtype(type_path_t *path)
2134 type_path_entry_t *top = get_type_path_top(path);
2136 path->top_type = top->type;
2138 size_t len = ARR_LEN(path->path);
2139 ARR_RESIZE(type_path_entry_t, path->path, len-1);
2143 * Pop entries from the given type path until the given
2144 * path level is reached.
2146 static void ascend_to(type_path_t *path, size_t top_path_level)
2148 size_t len = ARR_LEN(path->path);
2150 while (len > top_path_level) {
2151 ascend_from_subtype(path);
2152 len = ARR_LEN(path->path);
2156 static bool walk_designator(type_path_t *path, const designator_t *designator,
2157 bool used_in_offsetof)
2159 for( ; designator != NULL; designator = designator->next) {
2160 type_path_entry_t *top = get_type_path_top(path);
2161 type_t *orig_type = top->type;
2163 type_t *type = skip_typeref(orig_type);
2165 if (designator->symbol != NULL) {
2166 symbol_t *symbol = designator->symbol;
2167 if (!is_type_compound(type)) {
2168 if (is_type_valid(type)) {
2169 errorf(&designator->source_position,
2170 "'.%Y' designator used for non-compound type '%T'",
2176 declaration_t *declaration = type->compound.declaration;
2177 declaration_t *iter = declaration->scope.declarations;
2178 for( ; iter != NULL; iter = iter->next) {
2179 if (iter->symbol == symbol) {
2184 errorf(&designator->source_position,
2185 "'%T' has no member named '%Y'", orig_type, symbol);
2188 if (used_in_offsetof) {
2189 type_t *real_type = skip_typeref(iter->type);
2190 if (real_type->kind == TYPE_BITFIELD) {
2191 errorf(&designator->source_position,
2192 "offsetof designator '%Y' may not specify bitfield",
2198 top->type = orig_type;
2199 top->v.compound_entry = iter;
2200 orig_type = iter->type;
2202 expression_t *array_index = designator->array_index;
2203 assert(designator->array_index != NULL);
2205 if (!is_type_array(type)) {
2206 if (is_type_valid(type)) {
2207 errorf(&designator->source_position,
2208 "[%E] designator used for non-array type '%T'",
2209 array_index, orig_type);
2213 if (!is_type_valid(array_index->base.type)) {
2217 long index = fold_constant(array_index);
2218 if (!used_in_offsetof) {
2220 errorf(&designator->source_position,
2221 "array index [%E] must be positive", array_index);
2224 if (type->array.size_constant == true) {
2225 long array_size = type->array.size;
2226 if (index >= array_size) {
2227 errorf(&designator->source_position,
2228 "designator [%E] (%d) exceeds array size %d",
2229 array_index, index, array_size);
2235 top->type = orig_type;
2236 top->v.index = (size_t) index;
2237 orig_type = type->array.element_type;
2239 path->top_type = orig_type;
2241 if (designator->next != NULL) {
2242 descend_into_subtype(path);
2251 static void advance_current_object(type_path_t *path, size_t top_path_level)
2253 type_path_entry_t *top = get_type_path_top(path);
2255 type_t *type = skip_typeref(top->type);
2256 if (is_type_union(type)) {
2257 /* in unions only the first element is initialized */
2258 top->v.compound_entry = NULL;
2259 } else if (is_type_struct(type)) {
2260 declaration_t *entry = top->v.compound_entry;
2262 entry = entry->next;
2263 top->v.compound_entry = entry;
2264 if (entry != NULL) {
2265 path->top_type = entry->type;
2269 assert(is_type_array(type));
2273 if (!type->array.size_constant || top->v.index < type->array.size) {
2278 /* we're past the last member of the current sub-aggregate, try if we
2279 * can ascend in the type hierarchy and continue with another subobject */
2280 size_t len = ARR_LEN(path->path);
2282 if (len > top_path_level) {
2283 ascend_from_subtype(path);
2284 advance_current_object(path, top_path_level);
2286 path->top_type = NULL;
2291 * skip until token is found.
2293 static void skip_until(int type)
2295 while (token.type != type) {
2296 if (token.type == T_EOF)
2303 * skip any {...} blocks until a closing bracket is reached.
2305 static void skip_initializers(void)
2307 if (token.type == '{')
2310 while (token.type != '}') {
2311 if (token.type == T_EOF)
2313 if (token.type == '{') {
2321 static initializer_t *create_empty_initializer(void)
2323 static initializer_t empty_initializer
2324 = { .list = { { INITIALIZER_LIST }, 0 } };
2325 return &empty_initializer;
2329 * Parse a part of an initialiser for a struct or union,
2331 static initializer_t *parse_sub_initializer(type_path_t *path,
2332 type_t *outer_type, size_t top_path_level,
2333 parse_initializer_env_t *env)
2335 if (token.type == '}') {
2336 /* empty initializer */
2337 return create_empty_initializer();
2340 type_t *orig_type = path->top_type;
2341 type_t *type = NULL;
2343 if (orig_type == NULL) {
2344 /* We are initializing an empty compound. */
2346 type = skip_typeref(orig_type);
2348 /* we can't do usefull stuff if we didn't even parse the type. Skip the
2349 * initializers in this case. */
2350 if (!is_type_valid(type)) {
2351 skip_initializers();
2352 return create_empty_initializer();
2356 initializer_t **initializers = NEW_ARR_F(initializer_t*, 0);
2359 designator_t *designator = NULL;
2360 if (token.type == '.' || token.type == '[') {
2361 designator = parse_designation();
2362 goto finish_designator;
2363 } else if (token.type == T_IDENTIFIER && look_ahead(1)->type == ':') {
2364 /* GNU-style designator ("identifier: value") */
2365 designator = allocate_ast_zero(sizeof(designator[0]));
2366 designator->source_position = token.source_position;
2367 designator->symbol = token.v.symbol;
2372 /* reset path to toplevel, evaluate designator from there */
2373 ascend_to(path, top_path_level);
2374 if (!walk_designator(path, designator, false)) {
2375 /* can't continue after designation error */
2379 initializer_t *designator_initializer
2380 = allocate_initializer_zero(INITIALIZER_DESIGNATOR);
2381 designator_initializer->designator.designator = designator;
2382 ARR_APP1(initializer_t*, initializers, designator_initializer);
2384 orig_type = path->top_type;
2385 type = orig_type != NULL ? skip_typeref(orig_type) : NULL;
2390 if (token.type == '{') {
2391 if (type != NULL && is_type_scalar(type)) {
2392 sub = parse_scalar_initializer(type, env->must_be_constant);
2396 if (env->declaration != NULL) {
2397 errorf(HERE, "extra brace group at end of initializer for '%Y'",
2398 env->declaration->symbol);
2400 errorf(HERE, "extra brace group at end of initializer");
2403 descend_into_subtype(path);
2405 add_anchor_token('}');
2406 sub = parse_sub_initializer(path, orig_type, top_path_level+1,
2408 rem_anchor_token('}');
2411 ascend_from_subtype(path);
2415 goto error_parse_next;
2419 /* must be an expression */
2420 expression_t *expression = parse_assignment_expression();
2422 if (env->must_be_constant && !is_initializer_constant(expression)) {
2423 errorf(&expression->base.source_position,
2424 "Initialisation expression '%E' is not constant\n",
2429 /* we are already outside, ... */
2433 /* handle { "string" } special case */
2434 if ((expression->kind == EXPR_STRING_LITERAL
2435 || expression->kind == EXPR_WIDE_STRING_LITERAL)
2436 && outer_type != NULL) {
2437 sub = initializer_from_expression(outer_type, expression);
2439 if (token.type == ',') {
2442 if (token.type != '}') {
2443 warningf(HERE, "excessive elements in initializer for type '%T'",
2446 /* TODO: eat , ... */
2451 /* descend into subtypes until expression matches type */
2453 orig_type = path->top_type;
2454 type = skip_typeref(orig_type);
2456 sub = initializer_from_expression(orig_type, expression);
2460 if (!is_type_valid(type)) {
2463 if (is_type_scalar(type)) {
2464 errorf(&expression->base.source_position,
2465 "expression '%E' doesn't match expected type '%T'",
2466 expression, orig_type);
2470 descend_into_subtype(path);
2474 /* update largest index of top array */
2475 const type_path_entry_t *first = &path->path[0];
2476 type_t *first_type = first->type;
2477 first_type = skip_typeref(first_type);
2478 if (is_type_array(first_type)) {
2479 size_t index = first->v.index;
2480 if (index > path->max_index)
2481 path->max_index = index;
2485 /* append to initializers list */
2486 ARR_APP1(initializer_t*, initializers, sub);
2489 if (env->declaration != NULL)
2490 warningf(HERE, "excess elements in struct initializer for '%Y'",
2491 env->declaration->symbol);
2493 warningf(HERE, "excess elements in struct initializer");
2497 if (token.type == '}') {
2501 if (token.type == '}') {
2506 /* advance to the next declaration if we are not at the end */
2507 advance_current_object(path, top_path_level);
2508 orig_type = path->top_type;
2509 if (orig_type != NULL)
2510 type = skip_typeref(orig_type);
2516 size_t len = ARR_LEN(initializers);
2517 size_t size = sizeof(initializer_list_t) + len * sizeof(initializers[0]);
2518 initializer_t *result = allocate_ast_zero(size);
2519 result->kind = INITIALIZER_LIST;
2520 result->list.len = len;
2521 memcpy(&result->list.initializers, initializers,
2522 len * sizeof(initializers[0]));
2524 DEL_ARR_F(initializers);
2525 ascend_to(path, top_path_level+1);
2530 skip_initializers();
2531 DEL_ARR_F(initializers);
2532 ascend_to(path, top_path_level+1);
2537 * Parses an initializer. Parsers either a compound literal
2538 * (env->declaration == NULL) or an initializer of a declaration.
2540 static initializer_t *parse_initializer(parse_initializer_env_t *env)
2542 type_t *type = skip_typeref(env->type);
2543 initializer_t *result = NULL;
2546 if (is_type_scalar(type)) {
2547 result = parse_scalar_initializer(type, env->must_be_constant);
2548 } else if (token.type == '{') {
2552 memset(&path, 0, sizeof(path));
2553 path.top_type = env->type;
2554 path.path = NEW_ARR_F(type_path_entry_t, 0);
2556 descend_into_subtype(&path);
2558 add_anchor_token('}');
2559 result = parse_sub_initializer(&path, env->type, 1, env);
2560 rem_anchor_token('}');
2562 max_index = path.max_index;
2563 DEL_ARR_F(path.path);
2567 /* parse_scalar_initializer() also works in this case: we simply
2568 * have an expression without {} around it */
2569 result = parse_scalar_initializer(type, env->must_be_constant);
2572 /* § 6.7.5 (22) array initializers for arrays with unknown size determine
2573 * the array type size */
2574 if (is_type_array(type) && type->array.size_expression == NULL
2575 && result != NULL) {
2577 switch (result->kind) {
2578 case INITIALIZER_LIST:
2579 size = max_index + 1;
2582 case INITIALIZER_STRING:
2583 size = result->string.string.size;
2586 case INITIALIZER_WIDE_STRING:
2587 size = result->wide_string.string.size;
2590 case INITIALIZER_DESIGNATOR:
2591 case INITIALIZER_VALUE:
2592 /* can happen for parse errors */
2597 internal_errorf(HERE, "invalid initializer type");
2600 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
2601 cnst->base.type = type_size_t;
2602 cnst->conste.v.int_value = size;
2604 type_t *new_type = duplicate_type(type);
2606 new_type->array.size_expression = cnst;
2607 new_type->array.size_constant = true;
2608 new_type->array.size = size;
2609 env->type = new_type;
2617 static declaration_t *append_declaration(declaration_t *declaration);
2619 static declaration_t *parse_compound_type_specifier(bool is_struct)
2621 gnu_attribute_t *attributes = NULL;
2622 decl_modifiers_t modifiers = 0;
2629 symbol_t *symbol = NULL;
2630 declaration_t *declaration = NULL;
2632 if (token.type == T___attribute__) {
2633 modifiers |= parse_attributes(&attributes);
2636 if (token.type == T_IDENTIFIER) {
2637 symbol = token.v.symbol;
2640 namespace_t const namespc =
2641 is_struct ? NAMESPACE_STRUCT : NAMESPACE_UNION;
2642 declaration = get_declaration(symbol, namespc);
2643 if (declaration != NULL) {
2644 if (declaration->parent_scope != scope &&
2645 (token.type == '{' || token.type == ';')) {
2647 } else if (declaration->init.complete &&
2648 token.type == '{') {
2649 assert(symbol != NULL);
2650 errorf(HERE, "multiple definitions of '%s %Y' (previous definition at %P)",
2651 is_struct ? "struct" : "union", symbol,
2652 &declaration->source_position);
2653 declaration->scope.declarations = NULL;
2656 } else if (token.type != '{') {
2658 parse_error_expected("while parsing struct type specifier",
2659 T_IDENTIFIER, '{', NULL);
2661 parse_error_expected("while parsing union type specifier",
2662 T_IDENTIFIER, '{', NULL);
2668 if (declaration == NULL) {
2669 declaration = allocate_declaration_zero();
2670 declaration->namespc =
2671 (is_struct ? NAMESPACE_STRUCT : NAMESPACE_UNION);
2672 declaration->source_position = token.source_position;
2673 declaration->symbol = symbol;
2674 declaration->parent_scope = scope;
2675 if (symbol != NULL) {
2676 environment_push(declaration);
2678 append_declaration(declaration);
2681 if (token.type == '{') {
2682 declaration->init.complete = true;
2684 parse_compound_type_entries(declaration);
2685 modifiers |= parse_attributes(&attributes);
2688 declaration->modifiers |= modifiers;
2692 static void parse_enum_entries(type_t *const enum_type)
2696 if (token.type == '}') {
2698 errorf(HERE, "empty enum not allowed");
2702 add_anchor_token('}');
2704 if (token.type != T_IDENTIFIER) {
2705 parse_error_expected("while parsing enum entry", T_IDENTIFIER, NULL);
2707 rem_anchor_token('}');
2711 declaration_t *const entry = allocate_declaration_zero();
2712 entry->storage_class = STORAGE_CLASS_ENUM_ENTRY;
2713 entry->type = enum_type;
2714 entry->symbol = token.v.symbol;
2715 entry->source_position = token.source_position;
2718 if (token.type == '=') {
2720 expression_t *value = parse_constant_expression();
2722 value = create_implicit_cast(value, enum_type);
2723 entry->init.enum_value = value;
2728 record_declaration(entry);
2730 if (token.type != ',')
2733 } while (token.type != '}');
2734 rem_anchor_token('}');
2742 static type_t *parse_enum_specifier(void)
2744 gnu_attribute_t *attributes = NULL;
2745 declaration_t *declaration;
2749 if (token.type == T_IDENTIFIER) {
2750 symbol = token.v.symbol;
2753 declaration = get_declaration(symbol, NAMESPACE_ENUM);
2754 } else if (token.type != '{') {
2755 parse_error_expected("while parsing enum type specifier",
2756 T_IDENTIFIER, '{', NULL);
2763 if (declaration == NULL) {
2764 declaration = allocate_declaration_zero();
2765 declaration->namespc = NAMESPACE_ENUM;
2766 declaration->source_position = token.source_position;
2767 declaration->symbol = symbol;
2768 declaration->parent_scope = scope;
2771 type_t *const type = allocate_type_zero(TYPE_ENUM, &declaration->source_position);
2772 type->enumt.declaration = declaration;
2774 if (token.type == '{') {
2775 if (declaration->init.complete) {
2776 errorf(HERE, "multiple definitions of enum %Y", symbol);
2778 if (symbol != NULL) {
2779 environment_push(declaration);
2781 append_declaration(declaration);
2782 declaration->init.complete = true;
2784 parse_enum_entries(type);
2785 parse_attributes(&attributes);
2792 * if a symbol is a typedef to another type, return true
2794 static bool is_typedef_symbol(symbol_t *symbol)
2796 const declaration_t *const declaration =
2797 get_declaration(symbol, NAMESPACE_NORMAL);
2799 declaration != NULL &&
2800 declaration->storage_class == STORAGE_CLASS_TYPEDEF;
2803 static type_t *parse_typeof(void)
2810 add_anchor_token(')');
2812 expression_t *expression = NULL;
2815 switch(token.type) {
2816 case T___extension__:
2817 /* This can be a prefix to a typename or an expression. We simply eat
2821 } while (token.type == T___extension__);
2825 if (is_typedef_symbol(token.v.symbol)) {
2826 type = parse_typename();
2828 expression = parse_expression();
2829 type = expression->base.type;
2834 type = parse_typename();
2838 expression = parse_expression();
2839 type = expression->base.type;
2843 rem_anchor_token(')');
2846 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF, &expression->base.source_position);
2847 typeof_type->typeoft.expression = expression;
2848 typeof_type->typeoft.typeof_type = type;
2855 typedef enum specifiers_t {
2856 SPECIFIER_SIGNED = 1 << 0,
2857 SPECIFIER_UNSIGNED = 1 << 1,
2858 SPECIFIER_LONG = 1 << 2,
2859 SPECIFIER_INT = 1 << 3,
2860 SPECIFIER_DOUBLE = 1 << 4,
2861 SPECIFIER_CHAR = 1 << 5,
2862 SPECIFIER_SHORT = 1 << 6,
2863 SPECIFIER_LONG_LONG = 1 << 7,
2864 SPECIFIER_FLOAT = 1 << 8,
2865 SPECIFIER_BOOL = 1 << 9,
2866 SPECIFIER_VOID = 1 << 10,
2867 SPECIFIER_INT8 = 1 << 11,
2868 SPECIFIER_INT16 = 1 << 12,
2869 SPECIFIER_INT32 = 1 << 13,
2870 SPECIFIER_INT64 = 1 << 14,
2871 SPECIFIER_INT128 = 1 << 15,
2872 SPECIFIER_COMPLEX = 1 << 16,
2873 SPECIFIER_IMAGINARY = 1 << 17,
2876 static type_t *create_builtin_type(symbol_t *const symbol,
2877 type_t *const real_type)
2879 type_t *type = allocate_type_zero(TYPE_BUILTIN, &builtin_source_position);
2880 type->builtin.symbol = symbol;
2881 type->builtin.real_type = real_type;
2883 type_t *result = typehash_insert(type);
2884 if (type != result) {
2891 static type_t *get_typedef_type(symbol_t *symbol)
2893 declaration_t *declaration = get_declaration(symbol, NAMESPACE_NORMAL);
2894 if (declaration == NULL ||
2895 declaration->storage_class != STORAGE_CLASS_TYPEDEF)
2898 type_t *type = allocate_type_zero(TYPE_TYPEDEF, &declaration->source_position);
2899 type->typedeft.declaration = declaration;
2905 * check for the allowed MS alignment values.
2907 static bool check_alignment_value(long long intvalue)
2909 if (intvalue < 1 || intvalue > 8192) {
2910 errorf(HERE, "illegal alignment value");
2913 unsigned v = (unsigned)intvalue;
2914 for(unsigned i = 1; i <= 8192; i += i) {
2918 errorf(HERE, "alignment must be power of two");
2922 #define DET_MOD(name, tag) do { \
2923 if (*modifiers & tag) warningf(HERE, #name " used more than once"); \
2924 *modifiers |= tag; \
2927 static void parse_microsoft_extended_decl_modifier(declaration_specifiers_t *specifiers)
2929 decl_modifiers_t *modifiers = &specifiers->modifiers;
2932 if (token.type == T_restrict) {
2934 DET_MOD(restrict, DM_RESTRICT);
2936 } else if (token.type != T_IDENTIFIER)
2938 symbol_t *symbol = token.v.symbol;
2939 if (symbol == sym_align) {
2942 if (token.type != T_INTEGER)
2944 if (check_alignment_value(token.v.intvalue)) {
2945 if (specifiers->alignment != 0)
2946 warningf(HERE, "align used more than once");
2947 specifiers->alignment = (unsigned char)token.v.intvalue;
2951 } else if (symbol == sym_allocate) {
2954 if (token.type != T_IDENTIFIER)
2956 (void)token.v.symbol;
2958 } else if (symbol == sym_dllimport) {
2960 DET_MOD(dllimport, DM_DLLIMPORT);
2961 } else if (symbol == sym_dllexport) {
2963 DET_MOD(dllexport, DM_DLLEXPORT);
2964 } else if (symbol == sym_thread) {
2966 DET_MOD(thread, DM_THREAD);
2967 } else if (symbol == sym_naked) {
2969 DET_MOD(naked, DM_NAKED);
2970 } else if (symbol == sym_noinline) {
2972 DET_MOD(noinline, DM_NOINLINE);
2973 } else if (symbol == sym_noreturn) {
2975 DET_MOD(noreturn, DM_NORETURN);
2976 } else if (symbol == sym_nothrow) {
2978 DET_MOD(nothrow, DM_NOTHROW);
2979 } else if (symbol == sym_novtable) {
2981 DET_MOD(novtable, DM_NOVTABLE);
2982 } else if (symbol == sym_property) {
2986 bool is_get = false;
2987 if (token.type != T_IDENTIFIER)
2989 if (token.v.symbol == sym_get) {
2991 } else if (token.v.symbol == sym_put) {
2993 errorf(HERE, "Bad property name '%Y'", token.v.symbol);
2998 if (token.type != T_IDENTIFIER)
3001 if (specifiers->get_property_sym != NULL) {
3002 errorf(HERE, "get property name already specified");
3004 specifiers->get_property_sym = token.v.symbol;
3007 if (specifiers->put_property_sym != NULL) {
3008 errorf(HERE, "put property name already specified");
3010 specifiers->put_property_sym = token.v.symbol;
3014 if (token.type == ',') {
3021 } else if (symbol == sym_selectany) {
3023 DET_MOD(selectany, DM_SELECTANY);
3024 } else if (symbol == sym_uuid) {
3027 if (token.type != T_STRING_LITERAL)
3031 } else if (symbol == sym_deprecated) {
3033 if (specifiers->deprecated != 0)
3034 warningf(HERE, "deprecated used more than once");
3035 specifiers->deprecated = 1;
3036 if (token.type == '(') {
3038 if (token.type == T_STRING_LITERAL) {
3039 specifiers->deprecated_string = token.v.string.begin;
3042 errorf(HERE, "string literal expected");
3046 } else if (symbol == sym_noalias) {
3048 DET_MOD(noalias, DM_NOALIAS);
3050 warningf(HERE, "Unknown modifier %Y ignored", token.v.symbol);
3052 if (token.type == '(')
3056 if (token.type == ',')
3063 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
3065 type_t *type = NULL;
3066 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3067 type_modifiers_t modifiers = TYPE_MODIFIER_NONE;
3068 unsigned type_specifiers = 0;
3069 bool newtype = false;
3070 bool saw_error = false;
3072 specifiers->source_position = token.source_position;
3075 specifiers->modifiers
3076 |= parse_attributes(&specifiers->gnu_attributes);
3077 if (specifiers->modifiers & DM_TRANSPARENT_UNION)
3078 modifiers |= TYPE_MODIFIER_TRANSPARENT_UNION;
3080 switch(token.type) {
3083 #define MATCH_STORAGE_CLASS(token, class) \
3085 if (specifiers->declared_storage_class != STORAGE_CLASS_NONE) { \
3086 errorf(HERE, "multiple storage classes in declaration specifiers"); \
3088 specifiers->declared_storage_class = class; \
3092 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
3093 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
3094 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
3095 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
3096 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
3101 add_anchor_token(')');
3102 parse_microsoft_extended_decl_modifier(specifiers);
3103 rem_anchor_token(')');
3108 switch (specifiers->declared_storage_class) {
3109 case STORAGE_CLASS_NONE:
3110 specifiers->declared_storage_class = STORAGE_CLASS_THREAD;
3113 case STORAGE_CLASS_EXTERN:
3114 specifiers->declared_storage_class = STORAGE_CLASS_THREAD_EXTERN;
3117 case STORAGE_CLASS_STATIC:
3118 specifiers->declared_storage_class = STORAGE_CLASS_THREAD_STATIC;
3122 errorf(HERE, "multiple storage classes in declaration specifiers");
3128 /* type qualifiers */
3129 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
3131 qualifiers |= qualifier; \
3135 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3136 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3137 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3138 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3139 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3140 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3141 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3142 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3144 case T___extension__:
3149 /* type specifiers */
3150 #define MATCH_SPECIFIER(token, specifier, name) \
3153 if (type_specifiers & specifier) { \
3154 errorf(HERE, "multiple " name " type specifiers given"); \
3156 type_specifiers |= specifier; \
3160 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
3161 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
3162 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
3163 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
3164 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
3165 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
3166 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
3167 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
3168 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
3169 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
3170 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
3171 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
3172 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
3173 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
3174 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
3175 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
3177 case T__forceinline:
3178 /* only in microsoft mode */
3179 specifiers->modifiers |= DM_FORCEINLINE;
3184 specifiers->is_inline = true;
3189 if (type_specifiers & SPECIFIER_LONG_LONG) {
3190 errorf(HERE, "multiple type specifiers given");
3191 } else if (type_specifiers & SPECIFIER_LONG) {
3192 type_specifiers |= SPECIFIER_LONG_LONG;
3194 type_specifiers |= SPECIFIER_LONG;
3199 type = allocate_type_zero(TYPE_COMPOUND_STRUCT, HERE);
3201 type->compound.declaration = parse_compound_type_specifier(true);
3205 type = allocate_type_zero(TYPE_COMPOUND_UNION, HERE);
3206 type->compound.declaration = parse_compound_type_specifier(false);
3207 if (type->compound.declaration->modifiers & DM_TRANSPARENT_UNION)
3208 modifiers |= TYPE_MODIFIER_TRANSPARENT_UNION;
3212 type = parse_enum_specifier();
3215 type = parse_typeof();
3217 case T___builtin_va_list:
3218 type = duplicate_type(type_valist);
3222 case T_IDENTIFIER: {
3223 /* only parse identifier if we haven't found a type yet */
3224 if (type != NULL || type_specifiers != 0) {
3225 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
3226 * declaration, so it doesn't generate errors about expecting '(' or
3228 switch (look_ahead(1)->type) {
3235 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
3238 errorf(HERE, "discarding stray %K in declaration specifier", &token);
3243 goto finish_specifiers;
3247 type_t *const typedef_type = get_typedef_type(token.v.symbol);
3248 if (typedef_type == NULL) {
3249 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
3250 * declaration, so it doesn't generate 'implicit int' followed by more
3251 * errors later on. */
3252 token_type_t const la1_type = (token_type_t)look_ahead(1)->type;
3257 errorf(HERE, "%K does not name a type", &token);
3260 if (la1_type == '*')
3261 goto finish_specifiers;
3265 goto finish_specifiers;
3270 type = typedef_type;
3274 /* function specifier */
3276 goto finish_specifiers;
3283 atomic_type_kind_t atomic_type;
3285 /* match valid basic types */
3286 switch(type_specifiers) {
3287 case SPECIFIER_VOID:
3288 atomic_type = ATOMIC_TYPE_VOID;
3290 case SPECIFIER_CHAR:
3291 atomic_type = ATOMIC_TYPE_CHAR;
3293 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
3294 atomic_type = ATOMIC_TYPE_SCHAR;
3296 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
3297 atomic_type = ATOMIC_TYPE_UCHAR;
3299 case SPECIFIER_SHORT:
3300 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
3301 case SPECIFIER_SHORT | SPECIFIER_INT:
3302 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3303 atomic_type = ATOMIC_TYPE_SHORT;
3305 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
3306 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3307 atomic_type = ATOMIC_TYPE_USHORT;
3310 case SPECIFIER_SIGNED:
3311 case SPECIFIER_SIGNED | SPECIFIER_INT:
3312 atomic_type = ATOMIC_TYPE_INT;
3314 case SPECIFIER_UNSIGNED:
3315 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
3316 atomic_type = ATOMIC_TYPE_UINT;
3318 case SPECIFIER_LONG:
3319 case SPECIFIER_SIGNED | SPECIFIER_LONG:
3320 case SPECIFIER_LONG | SPECIFIER_INT:
3321 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3322 atomic_type = ATOMIC_TYPE_LONG;
3324 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
3325 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3326 atomic_type = ATOMIC_TYPE_ULONG;
3329 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3330 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3331 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
3332 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3334 atomic_type = ATOMIC_TYPE_LONGLONG;
3335 goto warn_about_long_long;
3337 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3338 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3340 atomic_type = ATOMIC_TYPE_ULONGLONG;
3341 warn_about_long_long:
3342 if (warning.long_long) {
3343 warningf(&specifiers->source_position,
3344 "ISO C90 does not support 'long long'");
3348 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
3349 atomic_type = unsigned_int8_type_kind;
3352 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
3353 atomic_type = unsigned_int16_type_kind;
3356 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
3357 atomic_type = unsigned_int32_type_kind;
3360 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
3361 atomic_type = unsigned_int64_type_kind;
3364 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
3365 atomic_type = unsigned_int128_type_kind;
3368 case SPECIFIER_INT8:
3369 case SPECIFIER_SIGNED | SPECIFIER_INT8:
3370 atomic_type = int8_type_kind;
3373 case SPECIFIER_INT16:
3374 case SPECIFIER_SIGNED | SPECIFIER_INT16:
3375 atomic_type = int16_type_kind;
3378 case SPECIFIER_INT32:
3379 case SPECIFIER_SIGNED | SPECIFIER_INT32:
3380 atomic_type = int32_type_kind;
3383 case SPECIFIER_INT64:
3384 case SPECIFIER_SIGNED | SPECIFIER_INT64:
3385 atomic_type = int64_type_kind;
3388 case SPECIFIER_INT128:
3389 case SPECIFIER_SIGNED | SPECIFIER_INT128:
3390 atomic_type = int128_type_kind;
3393 case SPECIFIER_FLOAT:
3394 atomic_type = ATOMIC_TYPE_FLOAT;
3396 case SPECIFIER_DOUBLE:
3397 atomic_type = ATOMIC_TYPE_DOUBLE;
3399 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
3400 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3402 case SPECIFIER_BOOL:
3403 atomic_type = ATOMIC_TYPE_BOOL;
3405 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
3406 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
3407 atomic_type = ATOMIC_TYPE_FLOAT;
3409 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3410 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3411 atomic_type = ATOMIC_TYPE_DOUBLE;
3413 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3414 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3415 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3418 /* invalid specifier combination, give an error message */
3419 if (type_specifiers == 0) {
3421 specifiers->type = type_error_type;
3426 if (warning.implicit_int) {
3427 warningf(HERE, "no type specifiers in declaration, using 'int'");
3429 atomic_type = ATOMIC_TYPE_INT;
3432 errorf(HERE, "no type specifiers given in declaration");
3434 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
3435 (type_specifiers & SPECIFIER_UNSIGNED)) {
3436 errorf(HERE, "signed and unsigned specifiers given");
3437 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3438 errorf(HERE, "only integer types can be signed or unsigned");
3440 errorf(HERE, "multiple datatypes in declaration");
3442 atomic_type = ATOMIC_TYPE_INVALID;
3445 if (type_specifiers & SPECIFIER_COMPLEX &&
3446 atomic_type != ATOMIC_TYPE_INVALID) {
3447 type = allocate_type_zero(TYPE_COMPLEX, &builtin_source_position);
3448 type->complex.akind = atomic_type;
3449 } else if (type_specifiers & SPECIFIER_IMAGINARY &&
3450 atomic_type != ATOMIC_TYPE_INVALID) {
3451 type = allocate_type_zero(TYPE_IMAGINARY, &builtin_source_position);
3452 type->imaginary.akind = atomic_type;
3454 type = allocate_type_zero(TYPE_ATOMIC, &builtin_source_position);
3455 type->atomic.akind = atomic_type;
3458 } else if (type_specifiers != 0) {
3459 errorf(HERE, "multiple datatypes in declaration");
3462 /* FIXME: check type qualifiers here */
3464 type->base.qualifiers = qualifiers;
3465 type->base.modifiers = modifiers;
3467 type_t *result = typehash_insert(type);
3468 if (newtype && result != type) {
3472 specifiers->type = result;
3477 static type_qualifiers_t parse_type_qualifiers(void)
3479 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3482 switch(token.type) {
3483 /* type qualifiers */
3484 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3485 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3486 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3487 /* microsoft extended type modifiers */
3488 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3489 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3490 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3491 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3492 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3500 static declaration_t *parse_identifier_list(void)
3502 declaration_t *declarations = NULL;
3503 declaration_t *last_declaration = NULL;
3505 declaration_t *const declaration = allocate_declaration_zero();
3506 declaration->type = NULL; /* a K&R parameter list has no types, yet */
3507 declaration->source_position = token.source_position;
3508 declaration->symbol = token.v.symbol;
3511 if (last_declaration != NULL) {
3512 last_declaration->next = declaration;
3514 declarations = declaration;
3516 last_declaration = declaration;
3518 if (token.type != ',') {
3522 } while (token.type == T_IDENTIFIER);
3524 return declarations;
3527 static type_t *automatic_type_conversion(type_t *orig_type);
3529 static void semantic_parameter(declaration_t *declaration)
3531 /* TODO: improve error messages */
3532 source_position_t const* const pos = &declaration->source_position;
3534 switch (declaration->declared_storage_class) {
3535 case STORAGE_CLASS_TYPEDEF:
3536 errorf(pos, "typedef not allowed in parameter list");
3539 /* Allowed storage classes */
3540 case STORAGE_CLASS_NONE:
3541 case STORAGE_CLASS_REGISTER:
3545 errorf(pos, "parameter may only have none or register storage class");
3549 type_t *const orig_type = declaration->type;
3550 /* §6.7.5.3(7): Array as last part of a parameter type is just syntactic
3551 * sugar. Turn it into a pointer.
3552 * §6.7.5.3(8): A declaration of a parameter as ``function returning type''
3553 * shall be adjusted to ``pointer to function returning type'', as in 6.3.2.1.
3555 type_t *const type = automatic_type_conversion(orig_type);
3556 declaration->type = type;
3558 if (is_type_incomplete(skip_typeref(type))) {
3559 errorf(pos, "incomplete type '%T' not allowed for parameter '%Y'",
3560 orig_type, declaration->symbol);
3564 static declaration_t *parse_parameter(void)
3566 declaration_specifiers_t specifiers;
3567 memset(&specifiers, 0, sizeof(specifiers));
3569 parse_declaration_specifiers(&specifiers);
3571 declaration_t *declaration = parse_declarator(&specifiers, /*may_be_abstract=*/true);
3576 static declaration_t *parse_parameters(function_type_t *type)
3578 declaration_t *declarations = NULL;
3581 add_anchor_token(')');
3582 int saved_comma_state = save_and_reset_anchor_state(',');
3584 if (token.type == T_IDENTIFIER) {
3585 symbol_t *symbol = token.v.symbol;
3586 if (!is_typedef_symbol(symbol)) {
3587 type->kr_style_parameters = true;
3588 declarations = parse_identifier_list();
3589 goto parameters_finished;
3593 if (token.type == ')') {
3594 type->unspecified_parameters = 1;
3595 goto parameters_finished;
3598 declaration_t *declaration;
3599 declaration_t *last_declaration = NULL;
3600 function_parameter_t *parameter;
3601 function_parameter_t *last_parameter = NULL;
3604 switch(token.type) {
3608 goto parameters_finished;
3611 case T___extension__:
3613 declaration = parse_parameter();
3615 /* func(void) is not a parameter */
3616 if (last_parameter == NULL
3617 && token.type == ')'
3618 && declaration->symbol == NULL
3619 && skip_typeref(declaration->type) == type_void) {
3620 goto parameters_finished;
3622 semantic_parameter(declaration);
3624 parameter = obstack_alloc(type_obst, sizeof(parameter[0]));
3625 memset(parameter, 0, sizeof(parameter[0]));
3626 parameter->type = declaration->type;
3628 if (last_parameter != NULL) {
3629 last_declaration->next = declaration;
3630 last_parameter->next = parameter;
3632 type->parameters = parameter;
3633 declarations = declaration;
3635 last_parameter = parameter;
3636 last_declaration = declaration;
3640 goto parameters_finished;
3642 if (token.type != ',') {
3643 goto parameters_finished;
3649 parameters_finished:
3650 rem_anchor_token(')');
3653 restore_anchor_state(',', saved_comma_state);
3654 return declarations;
3657 restore_anchor_state(',', saved_comma_state);
3661 typedef enum construct_type_kind_t {
3666 } construct_type_kind_t;
3668 typedef struct construct_type_t construct_type_t;
3669 struct construct_type_t {
3670 construct_type_kind_t kind;
3671 construct_type_t *next;
3674 typedef struct parsed_pointer_t parsed_pointer_t;
3675 struct parsed_pointer_t {
3676 construct_type_t construct_type;
3677 type_qualifiers_t type_qualifiers;
3680 typedef struct construct_function_type_t construct_function_type_t;
3681 struct construct_function_type_t {
3682 construct_type_t construct_type;
3683 type_t *function_type;
3686 typedef struct parsed_array_t parsed_array_t;
3687 struct parsed_array_t {
3688 construct_type_t construct_type;
3689 type_qualifiers_t type_qualifiers;
3695 typedef struct construct_base_type_t construct_base_type_t;
3696 struct construct_base_type_t {
3697 construct_type_t construct_type;
3701 static construct_type_t *parse_pointer_declarator(void)
3705 parsed_pointer_t *pointer = obstack_alloc(&temp_obst, sizeof(pointer[0]));
3706 memset(pointer, 0, sizeof(pointer[0]));
3707 pointer->construct_type.kind = CONSTRUCT_POINTER;
3708 pointer->type_qualifiers = parse_type_qualifiers();
3710 return (construct_type_t*) pointer;
3713 static construct_type_t *parse_array_declarator(void)
3716 add_anchor_token(']');
3718 parsed_array_t *array = obstack_alloc(&temp_obst, sizeof(array[0]));
3719 memset(array, 0, sizeof(array[0]));
3720 array->construct_type.kind = CONSTRUCT_ARRAY;
3722 if (token.type == T_static) {
3723 array->is_static = true;
3727 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
3728 if (type_qualifiers != 0) {
3729 if (token.type == T_static) {
3730 array->is_static = true;
3734 array->type_qualifiers = type_qualifiers;
3736 if (token.type == '*' && look_ahead(1)->type == ']') {
3737 array->is_variable = true;
3739 } else if (token.type != ']') {
3740 array->size = parse_assignment_expression();
3743 rem_anchor_token(']');
3746 return (construct_type_t*) array;
3751 static construct_type_t *parse_function_declarator(declaration_t *declaration)
3754 if (declaration != NULL) {
3755 type = allocate_type_zero(TYPE_FUNCTION, &declaration->source_position);
3757 unsigned mask = declaration->modifiers & (DM_CDECL|DM_STDCALL|DM_FASTCALL|DM_THISCALL);
3759 if (mask & (mask-1)) {
3760 const char *first = NULL, *second = NULL;
3762 /* more than one calling convention set */
3763 if (declaration->modifiers & DM_CDECL) {
3764 if (first == NULL) first = "cdecl";
3765 else if (second == NULL) second = "cdecl";
3767 if (declaration->modifiers & DM_STDCALL) {
3768 if (first == NULL) first = "stdcall";
3769 else if (second == NULL) second = "stdcall";
3771 if (declaration->modifiers & DM_FASTCALL) {
3772 if (first == NULL) first = "fastcall";
3773 else if (second == NULL) second = "fastcall";
3775 if (declaration->modifiers & DM_THISCALL) {
3776 if (first == NULL) first = "thiscall";
3777 else if (second == NULL) second = "thiscall";
3779 errorf(&declaration->source_position, "%s and %s attributes are not compatible", first, second);
3782 if (declaration->modifiers & DM_CDECL)
3783 type->function.calling_convention = CC_CDECL;
3784 else if (declaration->modifiers & DM_STDCALL)
3785 type->function.calling_convention = CC_STDCALL;
3786 else if (declaration->modifiers & DM_FASTCALL)
3787 type->function.calling_convention = CC_FASTCALL;
3788 else if (declaration->modifiers & DM_THISCALL)
3789 type->function.calling_convention = CC_THISCALL;
3791 type = allocate_type_zero(TYPE_FUNCTION, HERE);
3794 declaration_t *parameters = parse_parameters(&type->function);
3795 if (declaration != NULL) {
3796 declaration->scope.declarations = parameters;
3799 construct_function_type_t *construct_function_type =
3800 obstack_alloc(&temp_obst, sizeof(construct_function_type[0]));
3801 memset(construct_function_type, 0, sizeof(construct_function_type[0]));
3802 construct_function_type->construct_type.kind = CONSTRUCT_FUNCTION;
3803 construct_function_type->function_type = type;
3805 return &construct_function_type->construct_type;
3808 static void fix_declaration_type(declaration_t *declaration)
3810 decl_modifiers_t declaration_modifiers = declaration->modifiers;
3811 type_modifiers_t type_modifiers = declaration->type->base.modifiers;
3813 if (declaration_modifiers & DM_TRANSPARENT_UNION)
3814 type_modifiers |= TYPE_MODIFIER_TRANSPARENT_UNION;
3816 if (declaration->type->base.modifiers == type_modifiers)
3819 type_t *copy = duplicate_type(declaration->type);
3820 copy->base.modifiers = type_modifiers;
3822 type_t *result = typehash_insert(copy);
3823 if (result != copy) {
3824 obstack_free(type_obst, copy);
3827 declaration->type = result;
3830 static construct_type_t *parse_inner_declarator(declaration_t *declaration,
3831 bool may_be_abstract)
3833 /* construct a single linked list of construct_type_t's which describe
3834 * how to construct the final declarator type */
3835 construct_type_t *first = NULL;
3836 construct_type_t *last = NULL;
3837 gnu_attribute_t *attributes = NULL;
3839 decl_modifiers_t modifiers = parse_attributes(&attributes);
3842 while (token.type == '*') {
3843 construct_type_t *type = parse_pointer_declarator();
3853 /* TODO: find out if this is correct */
3854 modifiers |= parse_attributes(&attributes);
3857 if (declaration != NULL)
3858 declaration->modifiers |= modifiers;
3860 construct_type_t *inner_types = NULL;
3862 switch(token.type) {
3864 if (declaration == NULL) {
3865 errorf(HERE, "no identifier expected in typename");
3867 declaration->symbol = token.v.symbol;
3868 declaration->source_position = token.source_position;
3874 add_anchor_token(')');
3875 inner_types = parse_inner_declarator(declaration, may_be_abstract);
3876 /* All later declarators only modify the return type, not declaration */
3878 rem_anchor_token(')');
3882 if (may_be_abstract)
3884 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
3885 /* avoid a loop in the outermost scope, because eat_statement doesn't
3887 if (token.type == '}' && current_function == NULL) {
3895 construct_type_t *p = last;
3898 construct_type_t *type;
3899 switch(token.type) {
3901 type = parse_function_declarator(declaration);
3904 type = parse_array_declarator();
3907 goto declarator_finished;
3910 /* insert in the middle of the list (behind p) */
3912 type->next = p->next;
3923 declarator_finished:
3924 /* append inner_types at the end of the list, we don't to set last anymore
3925 * as it's not needed anymore */
3927 assert(first == NULL);
3928 first = inner_types;
3930 last->next = inner_types;
3938 static void parse_declaration_attributes(declaration_t *declaration)
3940 gnu_attribute_t *attributes = NULL;
3941 decl_modifiers_t modifiers = parse_attributes(&attributes);
3943 if (declaration == NULL)
3946 declaration->modifiers |= modifiers;
3947 /* check if we have these stupid mode attributes... */
3948 type_t *old_type = declaration->type;
3949 if (old_type == NULL)
3952 gnu_attribute_t *attribute = attributes;
3953 for ( ; attribute != NULL; attribute = attribute->next) {
3954 if (attribute->kind != GNU_AK_MODE || attribute->invalid)
3957 atomic_type_kind_t akind = attribute->u.akind;
3958 if (!is_type_signed(old_type)) {
3960 case ATOMIC_TYPE_CHAR: akind = ATOMIC_TYPE_UCHAR; break;
3961 case ATOMIC_TYPE_SHORT: akind = ATOMIC_TYPE_USHORT; break;
3962 case ATOMIC_TYPE_INT: akind = ATOMIC_TYPE_UINT; break;
3963 case ATOMIC_TYPE_LONGLONG: akind = ATOMIC_TYPE_ULONGLONG; break;
3965 panic("invalid akind in mode attribute");
3969 = make_atomic_type(akind, old_type->base.qualifiers);
3973 static type_t *construct_declarator_type(construct_type_t *construct_list,
3976 construct_type_t *iter = construct_list;
3977 for( ; iter != NULL; iter = iter->next) {
3978 switch(iter->kind) {
3979 case CONSTRUCT_INVALID:
3980 internal_errorf(HERE, "invalid type construction found");
3981 case CONSTRUCT_FUNCTION: {
3982 construct_function_type_t *construct_function_type
3983 = (construct_function_type_t*) iter;
3985 type_t *function_type = construct_function_type->function_type;
3987 function_type->function.return_type = type;
3989 type_t *skipped_return_type = skip_typeref(type);
3990 if (is_type_function(skipped_return_type)) {
3991 errorf(HERE, "function returning function is not allowed");
3992 type = type_error_type;
3993 } else if (is_type_array(skipped_return_type)) {
3994 errorf(HERE, "function returning array is not allowed");
3995 type = type_error_type;
3997 type = function_type;
4002 case CONSTRUCT_POINTER: {
4003 parsed_pointer_t *parsed_pointer = (parsed_pointer_t*) iter;
4004 type_t *pointer_type = allocate_type_zero(TYPE_POINTER, &null_position);
4005 pointer_type->pointer.points_to = type;
4006 pointer_type->base.qualifiers = parsed_pointer->type_qualifiers;
4008 type = pointer_type;
4012 case CONSTRUCT_ARRAY: {
4013 parsed_array_t *parsed_array = (parsed_array_t*) iter;
4014 type_t *array_type = allocate_type_zero(TYPE_ARRAY, &null_position);
4016 expression_t *size_expression = parsed_array->size;
4017 if (size_expression != NULL) {
4019 = create_implicit_cast(size_expression, type_size_t);
4022 array_type->base.qualifiers = parsed_array->type_qualifiers;
4023 array_type->array.element_type = type;
4024 array_type->array.is_static = parsed_array->is_static;
4025 array_type->array.is_variable = parsed_array->is_variable;
4026 array_type->array.size_expression = size_expression;
4028 if (size_expression != NULL) {
4029 if (is_constant_expression(size_expression)) {
4030 array_type->array.size_constant = true;
4031 array_type->array.size
4032 = fold_constant(size_expression);
4034 array_type->array.is_vla = true;
4038 type_t *skipped_type = skip_typeref(type);
4039 if (is_type_atomic(skipped_type, ATOMIC_TYPE_VOID)) {
4040 errorf(HERE, "array of void is not allowed");
4041 type = type_error_type;
4049 type_t *hashed_type = typehash_insert(type);
4050 if (hashed_type != type) {
4051 /* the function type was constructed earlier freeing it here will
4052 * destroy other types... */
4053 if (iter->kind != CONSTRUCT_FUNCTION) {
4063 static declaration_t *parse_declarator(
4064 const declaration_specifiers_t *specifiers, bool may_be_abstract)
4066 declaration_t *const declaration = allocate_declaration_zero();
4067 declaration->source_position = specifiers->source_position;
4068 declaration->declared_storage_class = specifiers->declared_storage_class;
4069 declaration->modifiers = specifiers->modifiers;
4070 declaration->deprecated_string = specifiers->deprecated_string;
4071 declaration->get_property_sym = specifiers->get_property_sym;
4072 declaration->put_property_sym = specifiers->put_property_sym;
4073 declaration->is_inline = specifiers->is_inline;
4075 declaration->storage_class = specifiers->declared_storage_class;
4076 if (declaration->storage_class == STORAGE_CLASS_NONE
4077 && scope != global_scope) {
4078 declaration->storage_class = STORAGE_CLASS_AUTO;
4081 if (specifiers->alignment != 0) {
4082 /* TODO: add checks here */
4083 declaration->alignment = specifiers->alignment;
4086 construct_type_t *construct_type
4087 = parse_inner_declarator(declaration, may_be_abstract);
4088 type_t *const type = specifiers->type;
4089 declaration->type = construct_declarator_type(construct_type, type);
4091 parse_declaration_attributes(declaration);
4093 fix_declaration_type(declaration);
4095 if (construct_type != NULL) {
4096 obstack_free(&temp_obst, construct_type);
4102 static type_t *parse_abstract_declarator(type_t *base_type)
4104 construct_type_t *construct_type = parse_inner_declarator(NULL, 1);
4106 type_t *result = construct_declarator_type(construct_type, base_type);
4107 if (construct_type != NULL) {
4108 obstack_free(&temp_obst, construct_type);
4114 static declaration_t *append_declaration(declaration_t* const declaration)
4116 if (last_declaration != NULL) {
4117 last_declaration->next = declaration;
4119 scope->declarations = declaration;
4121 last_declaration = declaration;
4126 * Check if the declaration of main is suspicious. main should be a
4127 * function with external linkage, returning int, taking either zero
4128 * arguments, two, or three arguments of appropriate types, ie.
4130 * int main([ int argc, char **argv [, char **env ] ]).
4132 * @param decl the declaration to check
4133 * @param type the function type of the declaration
4135 static void check_type_of_main(const declaration_t *const decl, const function_type_t *const func_type)
4137 if (decl->storage_class == STORAGE_CLASS_STATIC) {
4138 warningf(&decl->source_position,
4139 "'main' is normally a non-static function");
4141 if (skip_typeref(func_type->return_type) != type_int) {
4142 warningf(&decl->source_position,
4143 "return type of 'main' should be 'int', but is '%T'",
4144 func_type->return_type);
4146 const function_parameter_t *parm = func_type->parameters;
4148 type_t *const first_type = parm->type;
4149 if (!types_compatible(skip_typeref(first_type), type_int)) {
4150 warningf(&decl->source_position,
4151 "first argument of 'main' should be 'int', but is '%T'", first_type);
4155 type_t *const second_type = parm->type;
4156 if (!types_compatible(skip_typeref(second_type), type_char_ptr_ptr)) {
4157 warningf(&decl->source_position,
4158 "second argument of 'main' should be 'char**', but is '%T'", second_type);
4162 type_t *const third_type = parm->type;
4163 if (!types_compatible(skip_typeref(third_type), type_char_ptr_ptr)) {
4164 warningf(&decl->source_position,
4165 "third argument of 'main' should be 'char**', but is '%T'", third_type);
4169 goto warn_arg_count;
4173 warningf(&decl->source_position, "'main' takes only zero, two or three arguments");
4179 * Check if a symbol is the equal to "main".
4181 static bool is_sym_main(const symbol_t *const sym)
4183 return strcmp(sym->string, "main") == 0;
4186 static declaration_t *internal_record_declaration(
4187 declaration_t *const declaration,
4188 const bool is_definition)
4190 const symbol_t *const symbol = declaration->symbol;
4191 const namespace_t namespc = (namespace_t)declaration->namespc;
4193 assert(symbol != NULL);
4194 declaration_t *previous_declaration = get_declaration(symbol, namespc);
4196 type_t *const orig_type = declaration->type;
4197 type_t *const type = skip_typeref(orig_type);
4198 if (is_type_function(type) &&
4199 type->function.unspecified_parameters &&
4200 warning.strict_prototypes &&
4201 previous_declaration == NULL) {
4202 warningf(&declaration->source_position,
4203 "function declaration '%#T' is not a prototype",
4204 orig_type, declaration->symbol);
4207 if (warning.main && is_type_function(type) && is_sym_main(symbol)) {
4208 check_type_of_main(declaration, &type->function);
4211 if (warning.nested_externs &&
4212 declaration->storage_class == STORAGE_CLASS_EXTERN &&
4213 scope != global_scope) {
4214 warningf(&declaration->source_position,
4215 "nested extern declaration of '%#T'", declaration->type, symbol);
4218 assert(declaration != previous_declaration);
4219 if (previous_declaration != NULL
4220 && previous_declaration->parent_scope == scope) {
4221 /* can happen for K&R style declarations */
4222 if (previous_declaration->type == NULL) {
4223 previous_declaration->type = declaration->type;
4226 const type_t *prev_type = skip_typeref(previous_declaration->type);
4227 if (!types_compatible(type, prev_type)) {
4228 errorf(&declaration->source_position,
4229 "declaration '%#T' is incompatible with '%#T' (declared %P)",
4230 orig_type, symbol, previous_declaration->type, symbol,
4231 &previous_declaration->source_position);
4233 unsigned old_storage_class = previous_declaration->storage_class;
4234 if (old_storage_class == STORAGE_CLASS_ENUM_ENTRY) {
4235 errorf(&declaration->source_position,
4236 "redeclaration of enum entry '%Y' (declared %P)",
4237 symbol, &previous_declaration->source_position);
4238 return previous_declaration;
4241 if (warning.redundant_decls &&
4243 previous_declaration->storage_class == STORAGE_CLASS_STATIC &&
4244 !(previous_declaration->modifiers & DM_USED) &&
4245 !previous_declaration->used) {
4246 warningf(&previous_declaration->source_position,
4247 "unnecessary static forward declaration for '%#T'",
4248 previous_declaration->type, symbol);
4251 unsigned new_storage_class = declaration->storage_class;
4253 if (is_type_incomplete(prev_type)) {
4254 previous_declaration->type = type;
4258 /* pretend no storage class means extern for function
4259 * declarations (except if the previous declaration is neither
4260 * none nor extern) */
4261 if (is_type_function(type)) {
4262 if (prev_type->function.unspecified_parameters) {
4263 previous_declaration->type = type;
4267 switch (old_storage_class) {
4268 case STORAGE_CLASS_NONE:
4269 old_storage_class = STORAGE_CLASS_EXTERN;
4272 case STORAGE_CLASS_EXTERN:
4273 if (is_definition) {
4274 if (warning.missing_prototypes &&
4275 prev_type->function.unspecified_parameters &&
4276 !is_sym_main(symbol)) {
4277 warningf(&declaration->source_position,
4278 "no previous prototype for '%#T'",
4281 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4282 new_storage_class = STORAGE_CLASS_EXTERN;
4291 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4292 new_storage_class == STORAGE_CLASS_EXTERN) {
4293 warn_redundant_declaration:
4294 if (!is_definition &&
4295 warning.redundant_decls &&
4296 strcmp(previous_declaration->source_position.input_name, "<builtin>") != 0) {
4297 warningf(&declaration->source_position,
4298 "redundant declaration for '%Y' (declared %P)",
4299 symbol, &previous_declaration->source_position);
4301 } else if (current_function == NULL) {
4302 if (old_storage_class != STORAGE_CLASS_STATIC &&
4303 new_storage_class == STORAGE_CLASS_STATIC) {
4304 errorf(&declaration->source_position,
4305 "static declaration of '%Y' follows non-static declaration (declared %P)",
4306 symbol, &previous_declaration->source_position);
4307 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4308 previous_declaration->storage_class = STORAGE_CLASS_NONE;
4309 previous_declaration->declared_storage_class = STORAGE_CLASS_NONE;
4311 goto warn_redundant_declaration;
4313 } else if (old_storage_class == new_storage_class) {
4314 errorf(&declaration->source_position,
4315 "redeclaration of '%Y' (declared %P)",
4316 symbol, &previous_declaration->source_position);
4318 errorf(&declaration->source_position,
4319 "redeclaration of '%Y' with different linkage (declared %P)",
4320 symbol, &previous_declaration->source_position);
4324 previous_declaration->modifiers |= declaration->modifiers;
4325 previous_declaration->is_inline |= declaration->is_inline;
4326 return previous_declaration;
4327 } else if (is_type_function(type)) {
4328 if (is_definition &&
4329 declaration->storage_class != STORAGE_CLASS_STATIC) {
4330 if (warning.missing_prototypes && !is_sym_main(symbol)) {
4331 warningf(&declaration->source_position,
4332 "no previous prototype for '%#T'", orig_type, symbol);
4333 } else if (warning.missing_declarations && !is_sym_main(symbol)) {
4334 warningf(&declaration->source_position,
4335 "no previous declaration for '%#T'", orig_type,
4340 if (warning.missing_declarations &&
4341 scope == global_scope && (
4342 declaration->storage_class == STORAGE_CLASS_NONE ||
4343 declaration->storage_class == STORAGE_CLASS_THREAD
4345 warningf(&declaration->source_position,
4346 "no previous declaration for '%#T'", orig_type, symbol);
4350 assert(declaration->parent_scope == NULL);
4351 assert(scope != NULL);
4353 declaration->parent_scope = scope;
4355 environment_push(declaration);
4356 return append_declaration(declaration);
4359 static declaration_t *record_declaration(declaration_t *declaration)
4361 return internal_record_declaration(declaration, false);
4364 static declaration_t *record_definition(declaration_t *declaration)
4366 return internal_record_declaration(declaration, true);
4369 static void parser_error_multiple_definition(declaration_t *declaration,
4370 const source_position_t *source_position)
4372 errorf(source_position, "multiple definition of symbol '%Y' (declared %P)",
4373 declaration->symbol, &declaration->source_position);
4376 static bool is_declaration_specifier(const token_t *token,
4377 bool only_specifiers_qualifiers)
4379 switch(token->type) {
4384 return is_typedef_symbol(token->v.symbol);
4386 case T___extension__:
4388 return !only_specifiers_qualifiers;
4395 static void parse_init_declarator_rest(declaration_t *declaration)
4399 type_t *orig_type = declaration->type;
4400 type_t *type = skip_typeref(orig_type);
4402 if (declaration->init.initializer != NULL) {
4403 parser_error_multiple_definition(declaration, HERE);
4406 bool must_be_constant = false;
4407 if (declaration->storage_class == STORAGE_CLASS_STATIC
4408 || declaration->storage_class == STORAGE_CLASS_THREAD_STATIC
4409 || declaration->parent_scope == global_scope) {
4410 must_be_constant = true;
4413 parse_initializer_env_t env;
4414 env.type = orig_type;
4415 env.must_be_constant = must_be_constant;
4416 env.declaration = declaration;
4418 initializer_t *initializer = parse_initializer(&env);
4420 if (env.type != orig_type) {
4421 orig_type = env.type;
4422 type = skip_typeref(orig_type);
4423 declaration->type = env.type;
4426 if (is_type_function(type)) {
4427 errorf(&declaration->source_position,
4428 "initializers not allowed for function types at declator '%Y' (type '%T')",
4429 declaration->symbol, orig_type);
4431 declaration->init.initializer = initializer;
4435 /* parse rest of a declaration without any declarator */
4436 static void parse_anonymous_declaration_rest(
4437 const declaration_specifiers_t *specifiers,
4438 parsed_declaration_func finished_declaration)
4442 declaration_t *const declaration = allocate_declaration_zero();
4443 declaration->type = specifiers->type;
4444 declaration->declared_storage_class = specifiers->declared_storage_class;
4445 declaration->source_position = specifiers->source_position;
4446 declaration->modifiers = specifiers->modifiers;
4448 if (declaration->declared_storage_class != STORAGE_CLASS_NONE) {
4449 warningf(&declaration->source_position,
4450 "useless storage class in empty declaration");
4452 declaration->storage_class = STORAGE_CLASS_NONE;
4454 type_t *type = declaration->type;
4455 switch (type->kind) {
4456 case TYPE_COMPOUND_STRUCT:
4457 case TYPE_COMPOUND_UNION: {
4458 if (type->compound.declaration->symbol == NULL) {
4459 warningf(&declaration->source_position,
4460 "unnamed struct/union that defines no instances");
4469 warningf(&declaration->source_position, "empty declaration");
4473 finished_declaration(declaration);
4476 static void parse_declaration_rest(declaration_t *ndeclaration,
4477 const declaration_specifiers_t *specifiers,
4478 parsed_declaration_func finished_declaration)
4480 add_anchor_token(';');
4481 add_anchor_token('=');
4482 add_anchor_token(',');
4484 declaration_t *declaration = finished_declaration(ndeclaration);
4486 type_t *orig_type = declaration->type;
4487 type_t *type = skip_typeref(orig_type);
4489 if (type->kind != TYPE_FUNCTION &&
4490 declaration->is_inline &&
4491 is_type_valid(type)) {
4492 warningf(&declaration->source_position,
4493 "variable '%Y' declared 'inline'\n", declaration->symbol);
4496 if (token.type == '=') {
4497 parse_init_declarator_rest(declaration);
4500 if (token.type != ',')
4504 ndeclaration = parse_declarator(specifiers, /*may_be_abstract=*/false);
4509 rem_anchor_token(';');
4510 rem_anchor_token('=');
4511 rem_anchor_token(',');
4514 static declaration_t *finished_kr_declaration(declaration_t *declaration)
4516 symbol_t *symbol = declaration->symbol;
4517 if (symbol == NULL) {
4518 errorf(HERE, "anonymous declaration not valid as function parameter");
4521 namespace_t namespc = (namespace_t) declaration->namespc;
4522 if (namespc != NAMESPACE_NORMAL) {
4523 return record_declaration(declaration);
4526 declaration_t *previous_declaration = get_declaration(symbol, namespc);
4527 if (previous_declaration == NULL ||
4528 previous_declaration->parent_scope != scope) {
4529 errorf(HERE, "expected declaration of a function parameter, found '%Y'",
4534 if (previous_declaration->type == NULL) {
4535 previous_declaration->type = declaration->type;
4536 previous_declaration->declared_storage_class = declaration->declared_storage_class;
4537 previous_declaration->storage_class = declaration->storage_class;
4538 previous_declaration->parent_scope = scope;
4539 return previous_declaration;
4541 return record_declaration(declaration);
4545 static void parse_declaration(parsed_declaration_func finished_declaration)
4547 declaration_specifiers_t specifiers;
4548 memset(&specifiers, 0, sizeof(specifiers));
4549 parse_declaration_specifiers(&specifiers);
4551 if (token.type == ';') {
4552 parse_anonymous_declaration_rest(&specifiers, append_declaration);
4554 declaration_t *declaration = parse_declarator(&specifiers, /*may_be_abstract=*/false);
4555 parse_declaration_rest(declaration, &specifiers, finished_declaration);
4559 static type_t *get_default_promoted_type(type_t *orig_type)
4561 type_t *result = orig_type;
4563 type_t *type = skip_typeref(orig_type);
4564 if (is_type_integer(type)) {
4565 result = promote_integer(type);
4566 } else if (type == type_float) {
4567 result = type_double;
4573 static void parse_kr_declaration_list(declaration_t *declaration)
4575 type_t *type = skip_typeref(declaration->type);
4576 if (!is_type_function(type))
4579 if (!type->function.kr_style_parameters)
4582 /* push function parameters */
4583 int top = environment_top();
4584 scope_t *last_scope = scope;
4585 set_scope(&declaration->scope);
4587 declaration_t *parameter = declaration->scope.declarations;
4588 for ( ; parameter != NULL; parameter = parameter->next) {
4589 assert(parameter->parent_scope == NULL);
4590 parameter->parent_scope = scope;
4591 environment_push(parameter);
4594 /* parse declaration list */
4595 while (is_declaration_specifier(&token, false)) {
4596 parse_declaration(finished_kr_declaration);
4599 /* pop function parameters */
4600 assert(scope == &declaration->scope);
4601 set_scope(last_scope);
4602 environment_pop_to(top);
4604 /* update function type */
4605 type_t *new_type = duplicate_type(type);
4607 function_parameter_t *parameters = NULL;
4608 function_parameter_t *last_parameter = NULL;
4610 declaration_t *parameter_declaration = declaration->scope.declarations;
4611 for( ; parameter_declaration != NULL;
4612 parameter_declaration = parameter_declaration->next) {
4613 type_t *parameter_type = parameter_declaration->type;
4614 if (parameter_type == NULL) {
4616 errorf(HERE, "no type specified for function parameter '%Y'",
4617 parameter_declaration->symbol);
4619 if (warning.implicit_int) {
4620 warningf(HERE, "no type specified for function parameter '%Y', using 'int'",
4621 parameter_declaration->symbol);
4623 parameter_type = type_int;
4624 parameter_declaration->type = parameter_type;
4628 semantic_parameter(parameter_declaration);
4629 parameter_type = parameter_declaration->type;
4632 * we need the default promoted types for the function type
4634 parameter_type = get_default_promoted_type(parameter_type);
4636 function_parameter_t *function_parameter
4637 = obstack_alloc(type_obst, sizeof(function_parameter[0]));
4638 memset(function_parameter, 0, sizeof(function_parameter[0]));
4640 function_parameter->type = parameter_type;
4641 if (last_parameter != NULL) {
4642 last_parameter->next = function_parameter;
4644 parameters = function_parameter;
4646 last_parameter = function_parameter;
4649 /* § 6.9.1.7: A K&R style parameter list does NOT act as a function
4651 new_type->function.parameters = parameters;
4652 new_type->function.unspecified_parameters = true;
4654 type = typehash_insert(new_type);
4655 if (type != new_type) {
4656 obstack_free(type_obst, new_type);
4659 declaration->type = type;
4662 static bool first_err = true;
4665 * When called with first_err set, prints the name of the current function,
4668 static void print_in_function(void)
4672 diagnosticf("%s: In function '%Y':\n",
4673 current_function->source_position.input_name,
4674 current_function->symbol);
4679 * Check if all labels are defined in the current function.
4680 * Check if all labels are used in the current function.
4682 static void check_labels(void)
4684 for (const goto_statement_t *goto_statement = goto_first;
4685 goto_statement != NULL;
4686 goto_statement = goto_statement->next) {
4687 declaration_t *label = goto_statement->label;
4690 if (label->source_position.input_name == NULL) {
4691 print_in_function();
4692 errorf(&goto_statement->base.source_position,
4693 "label '%Y' used but not defined", label->symbol);
4696 goto_first = goto_last = NULL;
4698 if (warning.unused_label) {
4699 for (const label_statement_t *label_statement = label_first;
4700 label_statement != NULL;
4701 label_statement = label_statement->next) {
4702 const declaration_t *label = label_statement->label;
4704 if (! label->used) {
4705 print_in_function();
4706 warningf(&label_statement->base.source_position,
4707 "label '%Y' defined but not used", label->symbol);
4711 label_first = label_last = NULL;
4715 * Check declarations of current_function for unused entities.
4717 static void check_declarations(void)
4719 if (warning.unused_parameter) {
4720 const scope_t *scope = ¤t_function->scope;
4722 if (is_sym_main(current_function->symbol)) {
4723 /* do not issue unused warnings for main */
4726 const declaration_t *parameter = scope->declarations;
4727 for (; parameter != NULL; parameter = parameter->next) {
4728 if (! parameter->used) {
4729 print_in_function();
4730 warningf(¶meter->source_position,
4731 "unused parameter '%Y'", parameter->symbol);
4735 if (warning.unused_variable) {
4739 static int determine_truth(expression_t const* const cond)
4742 !is_constant_expression(cond) ? 0 :
4743 fold_constant(cond) != 0 ? 1 :
4747 static bool noreturn_candidate;
4749 static void check_reachable(statement_t *const stmt)
4751 if (stmt->base.reachable)
4753 if (stmt->kind != STATEMENT_DO_WHILE)
4754 stmt->base.reachable = true;
4756 statement_t *last = stmt;
4758 switch (stmt->kind) {
4759 case STATEMENT_INVALID:
4760 case STATEMENT_EMPTY:
4761 case STATEMENT_DECLARATION:
4763 next = stmt->base.next;
4766 case STATEMENT_COMPOUND:
4767 next = stmt->compound.statements;
4770 case STATEMENT_RETURN:
4771 noreturn_candidate = false;
4774 case STATEMENT_IF: {
4775 if_statement_t const* const ifs = &stmt->ifs;
4776 int const val = determine_truth(ifs->condition);
4779 check_reachable(ifs->true_statement);
4784 if (ifs->false_statement != NULL) {
4785 check_reachable(ifs->false_statement);
4789 next = stmt->base.next;
4793 case STATEMENT_SWITCH: {
4794 switch_statement_t const *const switchs = &stmt->switchs;
4795 expression_t const *const expr = switchs->expression;
4797 if (is_constant_expression(expr)) {
4798 long const val = fold_constant(expr);
4799 case_label_statement_t * defaults = NULL;
4800 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
4801 if (i->expression == NULL) {
4806 if (i->first_case <= val && val <= i->last_case) {
4807 check_reachable((statement_t*)i);
4812 if (defaults != NULL) {
4813 check_reachable((statement_t*)defaults);
4817 bool has_default = false;
4818 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
4819 if (i->expression == NULL)
4822 check_reachable((statement_t*)i);
4829 next = stmt->base.next;
4833 case STATEMENT_EXPRESSION: {
4834 /* Check for noreturn function call */
4835 expression_t const *const expr = stmt->expression.expression;
4836 if (expr->kind == EXPR_CALL) {
4837 expression_t const *const func = expr->call.function;
4838 if (func->kind == EXPR_REFERENCE) {
4839 declaration_t const *const decl = func->reference.declaration;
4840 if (decl != NULL && decl->modifiers & DM_NORETURN) {
4846 next = stmt->base.next;
4850 case STATEMENT_CONTINUE: {
4851 statement_t *parent = stmt;
4853 parent = parent->base.parent;
4854 if (parent == NULL) /* continue not within loop */
4858 switch (parent->kind) {
4859 case STATEMENT_WHILE: goto continue_while;
4860 case STATEMENT_DO_WHILE: goto continue_do_while;
4861 case STATEMENT_FOR: goto continue_for;
4868 case STATEMENT_BREAK: {
4869 statement_t *parent = stmt;
4871 parent = parent->base.parent;
4872 if (parent == NULL) /* break not within loop/switch */
4875 switch (parent->kind) {
4876 case STATEMENT_SWITCH:
4877 case STATEMENT_WHILE:
4878 case STATEMENT_DO_WHILE:
4881 next = parent->base.next;
4882 goto found_break_parent;
4891 case STATEMENT_GOTO:
4892 next = stmt->gotos.label->init.statement;
4893 if (next == NULL) /* missing label */
4897 case STATEMENT_LABEL:
4898 next = stmt->label.statement;
4901 case STATEMENT_CASE_LABEL:
4902 next = stmt->case_label.statement;
4905 case STATEMENT_WHILE: {
4906 while_statement_t const *const whiles = &stmt->whiles;
4907 int const val = determine_truth(whiles->condition);
4910 check_reachable(whiles->body);
4915 next = stmt->base.next;
4919 case STATEMENT_DO_WHILE:
4920 next = stmt->do_while.body;
4923 case STATEMENT_FOR: {
4924 for_statement_t *const fors = &stmt->fors;
4926 if (fors->condition_reachable)
4928 fors->condition_reachable = true;
4930 expression_t const *const cond = fors->condition;
4932 cond == NULL ? 1 : determine_truth(cond);
4935 check_reachable(fors->body);
4940 next = stmt->base.next;
4944 case STATEMENT_MS_TRY:
4945 case STATEMENT_LEAVE:
4946 panic("unimplemented");
4949 while (next == NULL) {
4950 next = last->base.parent;
4952 noreturn_candidate = false;
4954 type_t *const type = current_function->type;
4955 assert(is_type_function(type));
4956 type_t *const ret = skip_typeref(type->function.return_type);
4957 if (warning.return_type &&
4958 !is_type_atomic(ret, ATOMIC_TYPE_VOID) &&
4959 is_type_valid(ret) &&
4960 !is_sym_main(current_function->symbol)) {
4961 warningf(&stmt->base.source_position,
4962 "control reaches end of non-void function");
4967 switch (next->kind) {
4968 case STATEMENT_INVALID:
4969 case STATEMENT_EMPTY:
4970 case STATEMENT_DECLARATION:
4971 case STATEMENT_EXPRESSION:
4973 case STATEMENT_RETURN:
4974 case STATEMENT_CONTINUE:
4975 case STATEMENT_BREAK:
4976 case STATEMENT_GOTO:
4977 case STATEMENT_LEAVE:
4978 panic("invalid control flow in function");
4980 case STATEMENT_COMPOUND:
4982 case STATEMENT_SWITCH:
4983 case STATEMENT_LABEL:
4984 case STATEMENT_CASE_LABEL:
4986 next = next->base.next;
4989 case STATEMENT_WHILE: {
4991 if (next->base.reachable)
4993 next->base.reachable = true;
4995 while_statement_t const *const whiles = &next->whiles;
4996 int const val = determine_truth(whiles->condition);
4999 check_reachable(whiles->body);
5005 next = next->base.next;
5009 case STATEMENT_DO_WHILE: {
5011 if (next->base.reachable)
5013 next->base.reachable = true;
5015 do_while_statement_t const *const dw = &next->do_while;
5016 int const val = determine_truth(dw->condition);
5019 check_reachable(dw->body);
5025 next = next->base.next;
5029 case STATEMENT_FOR: {
5031 for_statement_t *const fors = &next->fors;
5033 fors->step_reachable = true;
5035 if (fors->condition_reachable)
5037 fors->condition_reachable = true;
5039 expression_t const *const cond = fors->condition;
5041 cond == NULL ? 1 : determine_truth(cond);
5044 check_reachable(fors->body);
5050 next = next->base.next;
5054 case STATEMENT_MS_TRY:
5055 panic("unimplemented");
5060 next = stmt->base.parent;
5062 warningf(&stmt->base.source_position,
5063 "control reaches end of non-void function");
5067 check_reachable(next);
5070 static void check_unreachable(statement_t const* const stmt)
5072 if (!stmt->base.reachable &&
5073 stmt->kind != STATEMENT_DO_WHILE &&
5074 stmt->kind != STATEMENT_FOR &&
5075 (stmt->kind != STATEMENT_COMPOUND || stmt->compound.statements == NULL)) {
5076 warningf(&stmt->base.source_position, "statement is unreachable");
5079 switch (stmt->kind) {
5080 case STATEMENT_INVALID:
5081 case STATEMENT_EMPTY:
5082 case STATEMENT_RETURN:
5083 case STATEMENT_DECLARATION:
5084 case STATEMENT_EXPRESSION:
5085 case STATEMENT_CONTINUE:
5086 case STATEMENT_BREAK:
5087 case STATEMENT_GOTO:
5089 case STATEMENT_LEAVE:
5092 case STATEMENT_COMPOUND:
5093 if (stmt->compound.statements)
5094 check_unreachable(stmt->compound.statements);
5098 check_unreachable(stmt->ifs.true_statement);
5099 if (stmt->ifs.false_statement != NULL)
5100 check_unreachable(stmt->ifs.false_statement);
5103 case STATEMENT_SWITCH:
5104 check_unreachable(stmt->switchs.body);
5107 case STATEMENT_LABEL:
5108 check_unreachable(stmt->label.statement);
5111 case STATEMENT_CASE_LABEL:
5112 check_unreachable(stmt->case_label.statement);
5115 case STATEMENT_WHILE:
5116 check_unreachable(stmt->whiles.body);
5119 case STATEMENT_DO_WHILE:
5120 check_unreachable(stmt->do_while.body);
5121 if (!stmt->base.reachable) {
5122 expression_t const *const cond = stmt->do_while.condition;
5123 if (determine_truth(cond) >= 0) {
5124 warningf(&cond->base.source_position,
5125 "condition of do-while-loop is unreachable");
5130 case STATEMENT_FOR: {
5131 for_statement_t const* const fors = &stmt->fors;
5133 // if init and step are unreachable, cond is unreachable, too
5134 if (!stmt->base.reachable && !fors->step_reachable) {
5135 warningf(&stmt->base.source_position, "statement is unreachable");
5137 if (!stmt->base.reachable && fors->initialisation != NULL) {
5138 warningf(&fors->initialisation->base.source_position,
5139 "initialisation of for-statement is unreachable");
5142 if (!fors->condition_reachable && fors->condition != NULL) {
5143 warningf(&fors->condition->base.source_position,
5144 "condition of for-statement is unreachable");
5147 if (!fors->step_reachable && fors->step != NULL) {
5148 warningf(&fors->step->base.source_position,
5149 "step of for-statement is unreachable");
5153 check_unreachable(stmt->fors.body);
5157 case STATEMENT_MS_TRY:
5158 panic("unimplemented");
5161 if (stmt->base.next)
5162 check_unreachable(stmt->base.next);
5165 static void parse_external_declaration(void)
5167 /* function-definitions and declarations both start with declaration
5169 declaration_specifiers_t specifiers;
5170 memset(&specifiers, 0, sizeof(specifiers));
5172 add_anchor_token(';');
5173 parse_declaration_specifiers(&specifiers);
5174 rem_anchor_token(';');
5176 /* must be a declaration */
5177 if (token.type == ';') {
5178 parse_anonymous_declaration_rest(&specifiers, append_declaration);
5182 add_anchor_token(',');
5183 add_anchor_token('=');
5184 rem_anchor_token(';');
5186 /* declarator is common to both function-definitions and declarations */
5187 declaration_t *ndeclaration = parse_declarator(&specifiers, /*may_be_abstract=*/false);
5189 rem_anchor_token(',');
5190 rem_anchor_token('=');
5191 rem_anchor_token(';');
5193 /* must be a declaration */
5194 switch (token.type) {
5197 parse_declaration_rest(ndeclaration, &specifiers, record_declaration);
5201 parse_declaration_rest(ndeclaration, &specifiers, record_definition);
5205 /* must be a function definition */
5206 parse_kr_declaration_list(ndeclaration);
5208 if (token.type != '{') {
5209 parse_error_expected("while parsing function definition", '{', NULL);
5210 eat_until_matching_token(';');
5214 type_t *type = ndeclaration->type;
5216 /* note that we don't skip typerefs: the standard doesn't allow them here
5217 * (so we can't use is_type_function here) */
5218 if (type->kind != TYPE_FUNCTION) {
5219 if (is_type_valid(type)) {
5220 errorf(HERE, "declarator '%#T' has a body but is not a function type",
5221 type, ndeclaration->symbol);
5227 if (warning.aggregate_return &&
5228 is_type_compound(skip_typeref(type->function.return_type))) {
5229 warningf(HERE, "function '%Y' returns an aggregate",
5230 ndeclaration->symbol);
5233 /* § 6.7.5.3 (14) a function definition with () means no
5234 * parameters (and not unspecified parameters) */
5235 if (type->function.unspecified_parameters
5236 && type->function.parameters == NULL
5237 && !type->function.kr_style_parameters) {
5238 type_t *duplicate = duplicate_type(type);
5239 duplicate->function.unspecified_parameters = false;
5241 type = typehash_insert(duplicate);
5242 if (type != duplicate) {
5243 obstack_free(type_obst, duplicate);
5245 ndeclaration->type = type;
5248 declaration_t *const declaration = record_definition(ndeclaration);
5249 if (ndeclaration != declaration) {
5250 declaration->scope = ndeclaration->scope;
5252 type = skip_typeref(declaration->type);
5254 /* push function parameters and switch scope */
5255 int top = environment_top();
5256 scope_t *last_scope = scope;
5257 set_scope(&declaration->scope);
5259 declaration_t *parameter = declaration->scope.declarations;
5260 for( ; parameter != NULL; parameter = parameter->next) {
5261 if (parameter->parent_scope == &ndeclaration->scope) {
5262 parameter->parent_scope = scope;
5264 assert(parameter->parent_scope == NULL
5265 || parameter->parent_scope == scope);
5266 parameter->parent_scope = scope;
5267 if (parameter->symbol == NULL) {
5268 errorf(¶meter->source_position, "parameter name omitted");
5271 environment_push(parameter);
5274 if (declaration->init.statement != NULL) {
5275 parser_error_multiple_definition(declaration, HERE);
5278 /* parse function body */
5279 int label_stack_top = label_top();
5280 declaration_t *old_current_function = current_function;
5281 current_function = declaration;
5282 current_parent = NULL;
5284 statement_t *const body = parse_compound_statement(false);
5285 declaration->init.statement = body;
5288 check_declarations();
5289 if (warning.return_type ||
5290 warning.unreachable_code ||
5291 (warning.missing_noreturn && !(declaration->modifiers & DM_NORETURN))) {
5292 noreturn_candidate = true;
5293 check_reachable(body);
5294 if (warning.unreachable_code)
5295 check_unreachable(body);
5296 if (warning.missing_noreturn &&
5297 noreturn_candidate &&
5298 !(declaration->modifiers & DM_NORETURN)) {
5299 warningf(&body->base.source_position,
5300 "function '%#T' is candidate for attribute 'noreturn'",
5301 type, declaration->symbol);
5305 assert(current_parent == NULL);
5306 assert(current_function == declaration);
5307 current_function = old_current_function;
5308 label_pop_to(label_stack_top);
5311 assert(scope == &declaration->scope);
5312 set_scope(last_scope);
5313 environment_pop_to(top);
5316 static type_t *make_bitfield_type(type_t *base_type, expression_t *size,
5317 source_position_t *source_position)
5319 type_t *type = allocate_type_zero(TYPE_BITFIELD, source_position);
5321 type->bitfield.base_type = base_type;
5322 type->bitfield.size = size;
5327 static declaration_t *find_compound_entry(declaration_t *compound_declaration,
5330 declaration_t *iter = compound_declaration->scope.declarations;
5331 for( ; iter != NULL; iter = iter->next) {
5332 if (iter->namespc != NAMESPACE_NORMAL)
5335 if (iter->symbol == NULL) {
5336 type_t *type = skip_typeref(iter->type);
5337 if (is_type_compound(type)) {
5338 declaration_t *result
5339 = find_compound_entry(type->compound.declaration, symbol);
5346 if (iter->symbol == symbol) {
5354 static void parse_compound_declarators(declaration_t *struct_declaration,
5355 const declaration_specifiers_t *specifiers)
5357 declaration_t *last_declaration = struct_declaration->scope.declarations;
5358 if (last_declaration != NULL) {
5359 while(last_declaration->next != NULL) {
5360 last_declaration = last_declaration->next;
5365 declaration_t *declaration;
5367 if (token.type == ':') {
5368 source_position_t source_position = *HERE;
5371 type_t *base_type = specifiers->type;
5372 expression_t *size = parse_constant_expression();
5374 if (!is_type_integer(skip_typeref(base_type))) {
5375 errorf(HERE, "bitfield base type '%T' is not an integer type",
5379 type_t *type = make_bitfield_type(base_type, size, &source_position);
5381 declaration = allocate_declaration_zero();
5382 declaration->namespc = NAMESPACE_NORMAL;
5383 declaration->declared_storage_class = STORAGE_CLASS_NONE;
5384 declaration->storage_class = STORAGE_CLASS_NONE;
5385 declaration->source_position = source_position;
5386 declaration->modifiers = specifiers->modifiers;
5387 declaration->type = type;
5389 declaration = parse_declarator(specifiers,/*may_be_abstract=*/true);
5391 type_t *orig_type = declaration->type;
5392 type_t *type = skip_typeref(orig_type);
5394 if (token.type == ':') {
5395 source_position_t source_position = *HERE;
5397 expression_t *size = parse_constant_expression();
5399 if (!is_type_integer(type)) {
5400 errorf(HERE, "bitfield base type '%T' is not an "
5401 "integer type", orig_type);
5404 type_t *bitfield_type = make_bitfield_type(orig_type, size, &source_position);
5405 declaration->type = bitfield_type;
5407 /* TODO we ignore arrays for now... what is missing is a check
5408 * that they're at the end of the struct */
5409 if (is_type_incomplete(type) && !is_type_array(type)) {
5411 "compound member '%Y' has incomplete type '%T'",
5412 declaration->symbol, orig_type);
5413 } else if (is_type_function(type)) {
5414 errorf(HERE, "compound member '%Y' must not have function "
5415 "type '%T'", declaration->symbol, orig_type);
5420 /* make sure we don't define a symbol multiple times */
5421 symbol_t *symbol = declaration->symbol;
5422 if (symbol != NULL) {
5423 declaration_t *prev_decl
5424 = find_compound_entry(struct_declaration, symbol);
5426 if (prev_decl != NULL) {
5427 assert(prev_decl->symbol == symbol);
5428 errorf(&declaration->source_position,
5429 "multiple declarations of symbol '%Y' (declared %P)",
5430 symbol, &prev_decl->source_position);
5434 /* append declaration */
5435 if (last_declaration != NULL) {
5436 last_declaration->next = declaration;
5438 struct_declaration->scope.declarations = declaration;
5440 last_declaration = declaration;
5442 if (token.type != ',')
5452 static void parse_compound_type_entries(declaration_t *compound_declaration)
5455 add_anchor_token('}');
5457 while(token.type != '}' && token.type != T_EOF) {
5458 declaration_specifiers_t specifiers;
5459 memset(&specifiers, 0, sizeof(specifiers));
5460 parse_declaration_specifiers(&specifiers);
5462 parse_compound_declarators(compound_declaration, &specifiers);
5464 rem_anchor_token('}');
5466 if (token.type == T_EOF) {
5467 errorf(HERE, "EOF while parsing struct");
5472 static type_t *parse_typename(void)
5474 declaration_specifiers_t specifiers;
5475 memset(&specifiers, 0, sizeof(specifiers));
5476 parse_declaration_specifiers(&specifiers);
5477 if (specifiers.declared_storage_class != STORAGE_CLASS_NONE) {
5478 /* TODO: improve error message, user does probably not know what a
5479 * storage class is...
5481 errorf(HERE, "typename may not have a storage class");
5484 type_t *result = parse_abstract_declarator(specifiers.type);
5492 typedef expression_t* (*parse_expression_function) (unsigned precedence);
5493 typedef expression_t* (*parse_expression_infix_function) (unsigned precedence,
5494 expression_t *left);
5496 typedef struct expression_parser_function_t expression_parser_function_t;
5497 struct expression_parser_function_t {
5498 unsigned precedence;
5499 parse_expression_function parser;
5500 unsigned infix_precedence;
5501 parse_expression_infix_function infix_parser;
5504 expression_parser_function_t expression_parsers[T_LAST_TOKEN];
5507 * Prints an error message if an expression was expected but not read
5509 static expression_t *expected_expression_error(void)
5511 /* skip the error message if the error token was read */
5512 if (token.type != T_ERROR) {
5513 errorf(HERE, "expected expression, got token '%K'", &token);
5517 return create_invalid_expression();
5521 * Parse a string constant.
5523 static expression_t *parse_string_const(void)
5526 if (token.type == T_STRING_LITERAL) {
5527 string_t res = token.v.string;
5529 while (token.type == T_STRING_LITERAL) {
5530 res = concat_strings(&res, &token.v.string);
5533 if (token.type != T_WIDE_STRING_LITERAL) {
5534 expression_t *const cnst = allocate_expression_zero(EXPR_STRING_LITERAL);
5535 /* note: that we use type_char_ptr here, which is already the
5536 * automatic converted type. revert_automatic_type_conversion
5537 * will construct the array type */
5538 cnst->base.type = warning.write_strings ? type_const_char_ptr : type_char_ptr;
5539 cnst->string.value = res;
5543 wres = concat_string_wide_string(&res, &token.v.wide_string);
5545 wres = token.v.wide_string;
5550 switch (token.type) {
5551 case T_WIDE_STRING_LITERAL:
5552 wres = concat_wide_strings(&wres, &token.v.wide_string);
5555 case T_STRING_LITERAL:
5556 wres = concat_wide_string_string(&wres, &token.v.string);
5560 expression_t *const cnst = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
5561 cnst->base.type = warning.write_strings ? type_const_wchar_t_ptr : type_wchar_t_ptr;
5562 cnst->wide_string.value = wres;
5571 * Parse an integer constant.
5573 static expression_t *parse_int_const(void)
5575 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
5576 cnst->base.source_position = *HERE;
5577 cnst->base.type = token.datatype;
5578 cnst->conste.v.int_value = token.v.intvalue;
5586 * Parse a character constant.
5588 static expression_t *parse_character_constant(void)
5590 expression_t *cnst = allocate_expression_zero(EXPR_CHARACTER_CONSTANT);
5592 cnst->base.source_position = *HERE;
5593 cnst->base.type = token.datatype;
5594 cnst->conste.v.character = token.v.string;
5596 if (cnst->conste.v.character.size != 1) {
5597 if (warning.multichar && (c_mode & _GNUC)) {
5599 warningf(HERE, "multi-character character constant");
5601 errorf(HERE, "more than 1 characters in character constant");
5610 * Parse a wide character constant.
5612 static expression_t *parse_wide_character_constant(void)
5614 expression_t *cnst = allocate_expression_zero(EXPR_WIDE_CHARACTER_CONSTANT);
5616 cnst->base.source_position = *HERE;
5617 cnst->base.type = token.datatype;
5618 cnst->conste.v.wide_character = token.v.wide_string;
5620 if (cnst->conste.v.wide_character.size != 1) {
5621 if (warning.multichar && (c_mode & _GNUC)) {
5623 warningf(HERE, "multi-character character constant");
5625 errorf(HERE, "more than 1 characters in character constant");
5634 * Parse a float constant.
5636 static expression_t *parse_float_const(void)
5638 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
5639 cnst->base.type = token.datatype;
5640 cnst->conste.v.float_value = token.v.floatvalue;
5647 static declaration_t *create_implicit_function(symbol_t *symbol,
5648 const source_position_t *source_position)
5650 type_t *ntype = allocate_type_zero(TYPE_FUNCTION, source_position);
5651 ntype->function.return_type = type_int;
5652 ntype->function.unspecified_parameters = true;
5654 type_t *type = typehash_insert(ntype);
5655 if (type != ntype) {
5659 declaration_t *const declaration = allocate_declaration_zero();
5660 declaration->storage_class = STORAGE_CLASS_EXTERN;
5661 declaration->declared_storage_class = STORAGE_CLASS_EXTERN;
5662 declaration->type = type;
5663 declaration->symbol = symbol;
5664 declaration->source_position = *source_position;
5666 bool strict_prototypes_old = warning.strict_prototypes;
5667 warning.strict_prototypes = false;
5668 record_declaration(declaration);
5669 warning.strict_prototypes = strict_prototypes_old;
5675 * Creates a return_type (func)(argument_type) function type if not
5678 static type_t *make_function_2_type(type_t *return_type, type_t *argument_type1,
5679 type_t *argument_type2)
5681 function_parameter_t *parameter2
5682 = obstack_alloc(type_obst, sizeof(parameter2[0]));
5683 memset(parameter2, 0, sizeof(parameter2[0]));
5684 parameter2->type = argument_type2;
5686 function_parameter_t *parameter1
5687 = obstack_alloc(type_obst, sizeof(parameter1[0]));
5688 memset(parameter1, 0, sizeof(parameter1[0]));
5689 parameter1->type = argument_type1;
5690 parameter1->next = parameter2;
5692 type_t *type = allocate_type_zero(TYPE_FUNCTION, &builtin_source_position);
5693 type->function.return_type = return_type;
5694 type->function.parameters = parameter1;
5696 type_t *result = typehash_insert(type);
5697 if (result != type) {
5705 * Creates a return_type (func)(argument_type) function type if not
5708 * @param return_type the return type
5709 * @param argument_type the argument type
5711 static type_t *make_function_1_type(type_t *return_type, type_t *argument_type)
5713 function_parameter_t *parameter
5714 = obstack_alloc(type_obst, sizeof(parameter[0]));
5715 memset(parameter, 0, sizeof(parameter[0]));
5716 parameter->type = argument_type;
5718 type_t *type = allocate_type_zero(TYPE_FUNCTION, &builtin_source_position);
5719 type->function.return_type = return_type;
5720 type->function.parameters = parameter;
5722 type_t *result = typehash_insert(type);
5723 if (result != type) {
5730 static type_t *make_function_0_type(type_t *return_type)
5732 type_t *type = allocate_type_zero(TYPE_FUNCTION, &builtin_source_position);
5733 type->function.return_type = return_type;
5734 type->function.parameters = NULL;
5736 type_t *result = typehash_insert(type);
5737 if (result != type) {
5745 * Creates a function type for some function like builtins.
5747 * @param symbol the symbol describing the builtin
5749 static type_t *get_builtin_symbol_type(symbol_t *symbol)
5751 switch(symbol->ID) {
5752 case T___builtin_alloca:
5753 return make_function_1_type(type_void_ptr, type_size_t);
5754 case T___builtin_huge_val:
5755 return make_function_0_type(type_double);
5756 case T___builtin_nan:
5757 return make_function_1_type(type_double, type_char_ptr);
5758 case T___builtin_nanf:
5759 return make_function_1_type(type_float, type_char_ptr);
5760 case T___builtin_nand:
5761 return make_function_1_type(type_long_double, type_char_ptr);
5762 case T___builtin_va_end:
5763 return make_function_1_type(type_void, type_valist);
5764 case T___builtin_expect:
5765 return make_function_2_type(type_long, type_long, type_long);
5767 internal_errorf(HERE, "not implemented builtin symbol found");
5772 * Performs automatic type cast as described in § 6.3.2.1.
5774 * @param orig_type the original type
5776 static type_t *automatic_type_conversion(type_t *orig_type)
5778 type_t *type = skip_typeref(orig_type);
5779 if (is_type_array(type)) {
5780 array_type_t *array_type = &type->array;
5781 type_t *element_type = array_type->element_type;
5782 unsigned qualifiers = array_type->base.qualifiers;
5784 return make_pointer_type(element_type, qualifiers);
5787 if (is_type_function(type)) {
5788 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
5795 * reverts the automatic casts of array to pointer types and function
5796 * to function-pointer types as defined § 6.3.2.1
5798 type_t *revert_automatic_type_conversion(const expression_t *expression)
5800 switch (expression->kind) {
5801 case EXPR_REFERENCE: return expression->reference.declaration->type;
5802 case EXPR_SELECT: return expression->select.compound_entry->type;
5804 case EXPR_UNARY_DEREFERENCE: {
5805 const expression_t *const value = expression->unary.value;
5806 type_t *const type = skip_typeref(value->base.type);
5807 assert(is_type_pointer(type));
5808 return type->pointer.points_to;
5811 case EXPR_BUILTIN_SYMBOL:
5812 return get_builtin_symbol_type(expression->builtin_symbol.symbol);
5814 case EXPR_ARRAY_ACCESS: {
5815 const expression_t *array_ref = expression->array_access.array_ref;
5816 type_t *type_left = skip_typeref(array_ref->base.type);
5817 if (!is_type_valid(type_left))
5819 assert(is_type_pointer(type_left));
5820 return type_left->pointer.points_to;
5823 case EXPR_STRING_LITERAL: {
5824 size_t size = expression->string.value.size;
5825 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
5828 case EXPR_WIDE_STRING_LITERAL: {
5829 size_t size = expression->wide_string.value.size;
5830 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
5833 case EXPR_COMPOUND_LITERAL:
5834 return expression->compound_literal.type;
5839 return expression->base.type;
5842 static expression_t *parse_reference(void)
5844 expression_t *expression = allocate_expression_zero(EXPR_REFERENCE);
5846 reference_expression_t *ref = &expression->reference;
5847 symbol_t *const symbol = token.v.symbol;
5849 declaration_t *declaration = get_declaration(symbol, NAMESPACE_NORMAL);
5851 source_position_t source_position = token.source_position;
5854 if (declaration == NULL) {
5855 if (! strict_mode && token.type == '(') {
5856 /* an implicitly defined function */
5857 if (warning.implicit_function_declaration) {
5858 warningf(HERE, "implicit declaration of function '%Y'",
5862 declaration = create_implicit_function(symbol,
5865 errorf(HERE, "unknown symbol '%Y' found.", symbol);
5866 return create_invalid_expression();
5870 type_t *type = declaration->type;
5872 /* we always do the auto-type conversions; the & and sizeof parser contains
5873 * code to revert this! */
5874 type = automatic_type_conversion(type);
5876 ref->declaration = declaration;
5877 ref->base.type = type;
5879 /* this declaration is used */
5880 declaration->used = true;
5882 /* check for deprecated functions */
5883 if (warning.deprecated_declarations &&
5884 declaration->modifiers & DM_DEPRECATED) {
5885 char const *const prefix = is_type_function(declaration->type) ?
5886 "function" : "variable";
5888 if (declaration->deprecated_string != NULL) {
5889 warningf(&source_position,
5890 "%s '%Y' is deprecated (declared %P): \"%s\"", prefix,
5891 declaration->symbol, &declaration->source_position,
5892 declaration->deprecated_string);
5894 warningf(&source_position,
5895 "%s '%Y' is deprecated (declared %P)", prefix,
5896 declaration->symbol, &declaration->source_position);
5903 static bool semantic_cast(expression_t *expression, type_t *orig_dest_type)
5905 type_t *orig_type_right = expression->base.type;
5906 const type_t *dest_type = skip_typeref(orig_dest_type);
5907 const type_t *orig_type = skip_typeref(orig_type_right);
5909 if (!is_type_valid(dest_type) || !is_type_valid(orig_type))
5912 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
5913 if (dest_type == type_void)
5916 if (is_type_pointer(dest_type)) {
5917 /* only integer and pointer can be casted to pointer */
5918 if (! is_type_pointer(orig_type) && ! is_type_integer(orig_type)) {
5919 errorf(HERE, "cannot convert type '%T' to a pointer type", orig_type_right);
5923 else if (!is_type_scalar(dest_type)) {
5924 errorf(HERE, "conversion to non-scalar type '%T' requested", orig_dest_type);
5927 else if (!is_type_scalar(orig_type)) {
5928 errorf(HERE, "conversion from non-scalar type '%T' requested", orig_type_right);
5932 if (warning.cast_qual) {
5933 if (is_type_pointer(orig_type) &&
5934 is_type_pointer(dest_type)) {
5935 type_t *src = skip_typeref(orig_type->pointer.points_to);
5936 type_t *dst = skip_typeref(dest_type->pointer.points_to);
5937 unsigned missing_qualifiers
5938 = src->base.qualifiers & ~dst->base.qualifiers;
5939 if (missing_qualifiers != 0) {
5941 "cast discards qualifiers '%Q' in pointer target type of '%T'",
5942 missing_qualifiers, orig_type_right);
5949 static expression_t *parse_compound_literal(type_t *type)
5951 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
5953 parse_initializer_env_t env;
5955 env.declaration = NULL;
5956 env.must_be_constant = false;
5957 initializer_t *initializer = parse_initializer(&env);
5960 expression->compound_literal.initializer = initializer;
5961 expression->compound_literal.type = type;
5962 expression->base.type = automatic_type_conversion(type);
5968 * Parse a cast expression.
5970 static expression_t *parse_cast(void)
5972 source_position_t source_position = token.source_position;
5974 type_t *type = parse_typename();
5976 /* matching add_anchor_token() is at call site */
5977 rem_anchor_token(')');
5980 if (token.type == '{') {
5981 return parse_compound_literal(type);
5984 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
5985 cast->base.source_position = source_position;
5987 expression_t *value = parse_sub_expression(20);
5989 if (! semantic_cast(value, type))
5992 cast->base.type = type;
5993 cast->unary.value = value;
5997 return create_invalid_expression();
6001 * Parse a statement expression.
6003 static expression_t *parse_statement_expression(void)
6005 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6007 statement_t *statement = parse_compound_statement(true);
6008 expression->statement.statement = statement;
6009 expression->base.source_position = statement->base.source_position;
6011 /* find last statement and use its type */
6012 type_t *type = type_void;
6013 const statement_t *stmt = statement->compound.statements;
6015 while (stmt->base.next != NULL)
6016 stmt = stmt->base.next;
6018 if (stmt->kind == STATEMENT_EXPRESSION) {
6019 type = stmt->expression.expression->base.type;
6022 warningf(&expression->base.source_position, "empty statement expression ({})");
6024 expression->base.type = type;
6030 return create_invalid_expression();
6034 * Parse a parenthesized expression.
6036 static expression_t *parse_parenthesized_expression(void)
6039 add_anchor_token(')');
6041 switch(token.type) {
6043 /* gcc extension: a statement expression */
6044 return parse_statement_expression();
6048 return parse_cast();
6050 if (is_typedef_symbol(token.v.symbol)) {
6051 return parse_cast();
6055 expression_t *result = parse_expression();
6056 rem_anchor_token(')');
6061 return create_invalid_expression();
6064 static expression_t *parse_function_keyword(void)
6069 if (current_function == NULL) {
6070 errorf(HERE, "'__func__' used outside of a function");
6073 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6074 expression->base.type = type_char_ptr;
6075 expression->funcname.kind = FUNCNAME_FUNCTION;
6080 static expression_t *parse_pretty_function_keyword(void)
6082 eat(T___PRETTY_FUNCTION__);
6084 if (current_function == NULL) {
6085 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
6088 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6089 expression->base.type = type_char_ptr;
6090 expression->funcname.kind = FUNCNAME_PRETTY_FUNCTION;
6095 static expression_t *parse_funcsig_keyword(void)
6099 if (current_function == NULL) {
6100 errorf(HERE, "'__FUNCSIG__' used outside of a function");
6103 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6104 expression->base.type = type_char_ptr;
6105 expression->funcname.kind = FUNCNAME_FUNCSIG;
6110 static expression_t *parse_funcdname_keyword(void)
6112 eat(T___FUNCDNAME__);
6114 if (current_function == NULL) {
6115 errorf(HERE, "'__FUNCDNAME__' used outside of a function");
6118 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6119 expression->base.type = type_char_ptr;
6120 expression->funcname.kind = FUNCNAME_FUNCDNAME;
6125 static designator_t *parse_designator(void)
6127 designator_t *result = allocate_ast_zero(sizeof(result[0]));
6128 result->source_position = *HERE;
6130 if (token.type != T_IDENTIFIER) {
6131 parse_error_expected("while parsing member designator",
6132 T_IDENTIFIER, NULL);
6135 result->symbol = token.v.symbol;
6138 designator_t *last_designator = result;
6140 if (token.type == '.') {
6142 if (token.type != T_IDENTIFIER) {
6143 parse_error_expected("while parsing member designator",
6144 T_IDENTIFIER, NULL);
6147 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6148 designator->source_position = *HERE;
6149 designator->symbol = token.v.symbol;
6152 last_designator->next = designator;
6153 last_designator = designator;
6156 if (token.type == '[') {
6158 add_anchor_token(']');
6159 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6160 designator->source_position = *HERE;
6161 designator->array_index = parse_expression();
6162 rem_anchor_token(']');
6164 if (designator->array_index == NULL) {
6168 last_designator->next = designator;
6169 last_designator = designator;
6181 * Parse the __builtin_offsetof() expression.
6183 static expression_t *parse_offsetof(void)
6185 eat(T___builtin_offsetof);
6187 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6188 expression->base.type = type_size_t;
6191 add_anchor_token(',');
6192 type_t *type = parse_typename();
6193 rem_anchor_token(',');
6195 add_anchor_token(')');
6196 designator_t *designator = parse_designator();
6197 rem_anchor_token(')');
6200 expression->offsetofe.type = type;
6201 expression->offsetofe.designator = designator;
6204 memset(&path, 0, sizeof(path));
6205 path.top_type = type;
6206 path.path = NEW_ARR_F(type_path_entry_t, 0);
6208 descend_into_subtype(&path);
6210 if (!walk_designator(&path, designator, true)) {
6211 return create_invalid_expression();
6214 DEL_ARR_F(path.path);
6218 return create_invalid_expression();
6222 * Parses a _builtin_va_start() expression.
6224 static expression_t *parse_va_start(void)
6226 eat(T___builtin_va_start);
6228 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6231 add_anchor_token(',');
6232 expression->va_starte.ap = parse_assignment_expression();
6233 rem_anchor_token(',');
6235 expression_t *const expr = parse_assignment_expression();
6236 if (expr->kind == EXPR_REFERENCE) {
6237 declaration_t *const decl = expr->reference.declaration;
6239 return create_invalid_expression();
6240 if (decl->parent_scope == ¤t_function->scope &&
6241 decl->next == NULL) {
6242 expression->va_starte.parameter = decl;
6247 errorf(&expr->base.source_position,
6248 "second argument of 'va_start' must be last parameter of the current function");
6250 return create_invalid_expression();
6254 * Parses a _builtin_va_arg() expression.
6256 static expression_t *parse_va_arg(void)
6258 eat(T___builtin_va_arg);
6260 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
6263 expression->va_arge.ap = parse_assignment_expression();
6265 expression->base.type = parse_typename();
6270 return create_invalid_expression();
6273 static expression_t *parse_builtin_symbol(void)
6275 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_SYMBOL);
6277 symbol_t *symbol = token.v.symbol;
6279 expression->builtin_symbol.symbol = symbol;
6282 type_t *type = get_builtin_symbol_type(symbol);
6283 type = automatic_type_conversion(type);
6285 expression->base.type = type;
6290 * Parses a __builtin_constant() expression.
6292 static expression_t *parse_builtin_constant(void)
6294 eat(T___builtin_constant_p);
6296 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
6299 add_anchor_token(')');
6300 expression->builtin_constant.value = parse_assignment_expression();
6301 rem_anchor_token(')');
6303 expression->base.type = type_int;
6307 return create_invalid_expression();
6311 * Parses a __builtin_prefetch() expression.
6313 static expression_t *parse_builtin_prefetch(void)
6315 eat(T___builtin_prefetch);
6317 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_PREFETCH);
6320 add_anchor_token(')');
6321 expression->builtin_prefetch.adr = parse_assignment_expression();
6322 if (token.type == ',') {
6324 expression->builtin_prefetch.rw = parse_assignment_expression();
6326 if (token.type == ',') {
6328 expression->builtin_prefetch.locality = parse_assignment_expression();
6330 rem_anchor_token(')');
6332 expression->base.type = type_void;
6336 return create_invalid_expression();
6340 * Parses a __builtin_is_*() compare expression.
6342 static expression_t *parse_compare_builtin(void)
6344 expression_t *expression;
6346 switch(token.type) {
6347 case T___builtin_isgreater:
6348 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
6350 case T___builtin_isgreaterequal:
6351 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
6353 case T___builtin_isless:
6354 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
6356 case T___builtin_islessequal:
6357 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
6359 case T___builtin_islessgreater:
6360 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
6362 case T___builtin_isunordered:
6363 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
6366 internal_errorf(HERE, "invalid compare builtin found");
6369 expression->base.source_position = *HERE;
6373 expression->binary.left = parse_assignment_expression();
6375 expression->binary.right = parse_assignment_expression();
6378 type_t *const orig_type_left = expression->binary.left->base.type;
6379 type_t *const orig_type_right = expression->binary.right->base.type;
6381 type_t *const type_left = skip_typeref(orig_type_left);
6382 type_t *const type_right = skip_typeref(orig_type_right);
6383 if (!is_type_float(type_left) && !is_type_float(type_right)) {
6384 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6385 type_error_incompatible("invalid operands in comparison",
6386 &expression->base.source_position, orig_type_left, orig_type_right);
6389 semantic_comparison(&expression->binary);
6394 return create_invalid_expression();
6399 * Parses a __builtin_expect() expression.
6401 static expression_t *parse_builtin_expect(void)
6403 eat(T___builtin_expect);
6405 expression_t *expression
6406 = allocate_expression_zero(EXPR_BINARY_BUILTIN_EXPECT);
6409 expression->binary.left = parse_assignment_expression();
6411 expression->binary.right = parse_constant_expression();
6414 expression->base.type = expression->binary.left->base.type;
6418 return create_invalid_expression();
6423 * Parses a MS assume() expression.
6425 static expression_t *parse_assume(void)
6429 expression_t *expression
6430 = allocate_expression_zero(EXPR_UNARY_ASSUME);
6433 add_anchor_token(')');
6434 expression->unary.value = parse_assignment_expression();
6435 rem_anchor_token(')');
6438 expression->base.type = type_void;
6441 return create_invalid_expression();
6445 * Parse a microsoft __noop expression.
6447 static expression_t *parse_noop_expression(void)
6449 source_position_t source_position = *HERE;
6452 if (token.type == '(') {
6453 /* parse arguments */
6455 add_anchor_token(')');
6456 add_anchor_token(',');
6458 if (token.type != ')') {
6460 (void)parse_assignment_expression();
6461 if (token.type != ',')
6467 rem_anchor_token(',');
6468 rem_anchor_token(')');
6471 /* the result is a (int)0 */
6472 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
6473 cnst->base.source_position = source_position;
6474 cnst->base.type = type_int;
6475 cnst->conste.v.int_value = 0;
6476 cnst->conste.is_ms_noop = true;
6481 return create_invalid_expression();
6485 * Parses a primary expression.
6487 static expression_t *parse_primary_expression(void)
6489 switch (token.type) {
6490 case T_INTEGER: return parse_int_const();
6491 case T_CHARACTER_CONSTANT: return parse_character_constant();
6492 case T_WIDE_CHARACTER_CONSTANT: return parse_wide_character_constant();
6493 case T_FLOATINGPOINT: return parse_float_const();
6494 case T_STRING_LITERAL:
6495 case T_WIDE_STRING_LITERAL: return parse_string_const();
6496 case T_IDENTIFIER: return parse_reference();
6497 case T___FUNCTION__:
6498 case T___func__: return parse_function_keyword();
6499 case T___PRETTY_FUNCTION__: return parse_pretty_function_keyword();
6500 case T___FUNCSIG__: return parse_funcsig_keyword();
6501 case T___FUNCDNAME__: return parse_funcdname_keyword();
6502 case T___builtin_offsetof: return parse_offsetof();
6503 case T___builtin_va_start: return parse_va_start();
6504 case T___builtin_va_arg: return parse_va_arg();
6505 case T___builtin_expect:
6506 case T___builtin_alloca:
6507 case T___builtin_nan:
6508 case T___builtin_nand:
6509 case T___builtin_nanf:
6510 case T___builtin_huge_val:
6511 case T___builtin_va_end: return parse_builtin_symbol();
6512 case T___builtin_isgreater:
6513 case T___builtin_isgreaterequal:
6514 case T___builtin_isless:
6515 case T___builtin_islessequal:
6516 case T___builtin_islessgreater:
6517 case T___builtin_isunordered: return parse_compare_builtin();
6518 case T___builtin_constant_p: return parse_builtin_constant();
6519 case T___builtin_prefetch: return parse_builtin_prefetch();
6520 case T__assume: return parse_assume();
6522 case '(': return parse_parenthesized_expression();
6523 case T___noop: return parse_noop_expression();
6526 errorf(HERE, "unexpected token %K, expected an expression", &token);
6527 return create_invalid_expression();
6531 * Check if the expression has the character type and issue a warning then.
6533 static void check_for_char_index_type(const expression_t *expression)
6535 type_t *const type = expression->base.type;
6536 const type_t *const base_type = skip_typeref(type);
6538 if (is_type_atomic(base_type, ATOMIC_TYPE_CHAR) &&
6539 warning.char_subscripts) {
6540 warningf(&expression->base.source_position,
6541 "array subscript has type '%T'", type);
6545 static expression_t *parse_array_expression(unsigned precedence,
6551 add_anchor_token(']');
6553 expression_t *inside = parse_expression();
6555 expression_t *expression = allocate_expression_zero(EXPR_ARRAY_ACCESS);
6557 array_access_expression_t *array_access = &expression->array_access;
6559 type_t *const orig_type_left = left->base.type;
6560 type_t *const orig_type_inside = inside->base.type;
6562 type_t *const type_left = skip_typeref(orig_type_left);
6563 type_t *const type_inside = skip_typeref(orig_type_inside);
6565 type_t *return_type;
6566 if (is_type_pointer(type_left)) {
6567 return_type = type_left->pointer.points_to;
6568 array_access->array_ref = left;
6569 array_access->index = inside;
6570 check_for_char_index_type(inside);
6571 } else if (is_type_pointer(type_inside)) {
6572 return_type = type_inside->pointer.points_to;
6573 array_access->array_ref = inside;
6574 array_access->index = left;
6575 array_access->flipped = true;
6576 check_for_char_index_type(left);
6578 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
6580 "array access on object with non-pointer types '%T', '%T'",
6581 orig_type_left, orig_type_inside);
6583 return_type = type_error_type;
6584 array_access->array_ref = create_invalid_expression();
6587 rem_anchor_token(']');
6588 if (token.type != ']') {
6589 parse_error_expected("Problem while parsing array access", ']', NULL);
6594 return_type = automatic_type_conversion(return_type);
6595 expression->base.type = return_type;
6600 static expression_t *parse_typeprop(expression_kind_t const kind,
6601 source_position_t const pos,
6602 unsigned const precedence)
6604 expression_t *tp_expression = allocate_expression_zero(kind);
6605 tp_expression->base.type = type_size_t;
6606 tp_expression->base.source_position = pos;
6608 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
6610 if (token.type == '(' && is_declaration_specifier(look_ahead(1), true)) {
6612 add_anchor_token(')');
6613 type_t* const orig_type = parse_typename();
6614 tp_expression->typeprop.type = orig_type;
6616 type_t const* const type = skip_typeref(orig_type);
6617 char const* const wrong_type =
6618 is_type_incomplete(type) ? "incomplete" :
6619 type->kind == TYPE_FUNCTION ? "function designator" :
6620 type->kind == TYPE_BITFIELD ? "bitfield" :
6622 if (wrong_type != NULL) {
6623 errorf(&pos, "operand of %s expression must not be %s type '%T'",
6624 what, wrong_type, type);
6627 rem_anchor_token(')');
6630 expression_t *expression = parse_sub_expression(precedence);
6632 type_t* const orig_type = revert_automatic_type_conversion(expression);
6633 expression->base.type = orig_type;
6635 type_t const* const type = skip_typeref(orig_type);
6636 char const* const wrong_type =
6637 is_type_incomplete(type) ? "incomplete" :
6638 type->kind == TYPE_FUNCTION ? "function designator" :
6639 type->kind == TYPE_BITFIELD ? "bitfield" :
6641 if (wrong_type != NULL) {
6642 errorf(&pos, "operand of %s expression must not be expression of %s type '%T'", what, wrong_type, type);
6645 tp_expression->typeprop.type = expression->base.type;
6646 tp_expression->typeprop.tp_expression = expression;
6649 return tp_expression;
6651 return create_invalid_expression();
6654 static expression_t *parse_sizeof(unsigned precedence)
6656 source_position_t pos = *HERE;
6658 return parse_typeprop(EXPR_SIZEOF, pos, precedence);
6661 static expression_t *parse_alignof(unsigned precedence)
6663 source_position_t pos = *HERE;
6665 return parse_typeprop(EXPR_ALIGNOF, pos, precedence);
6668 static expression_t *parse_select_expression(unsigned precedence,
6669 expression_t *compound)
6672 assert(token.type == '.' || token.type == T_MINUSGREATER);
6674 bool is_pointer = (token.type == T_MINUSGREATER);
6677 expression_t *select = allocate_expression_zero(EXPR_SELECT);
6678 select->select.compound = compound;
6680 if (token.type != T_IDENTIFIER) {
6681 parse_error_expected("while parsing select", T_IDENTIFIER, NULL);
6684 symbol_t *symbol = token.v.symbol;
6685 select->select.symbol = symbol;
6688 type_t *const orig_type = compound->base.type;
6689 type_t *const type = skip_typeref(orig_type);
6691 type_t *type_left = type;
6693 if (!is_type_pointer(type)) {
6694 if (is_type_valid(type)) {
6695 errorf(HERE, "left hand side of '->' is not a pointer, but '%T'", orig_type);
6697 return create_invalid_expression();
6699 type_left = type->pointer.points_to;
6701 type_left = skip_typeref(type_left);
6703 if (type_left->kind != TYPE_COMPOUND_STRUCT &&
6704 type_left->kind != TYPE_COMPOUND_UNION) {
6705 if (is_type_valid(type_left)) {
6706 errorf(HERE, "request for member '%Y' in something not a struct or "
6707 "union, but '%T'", symbol, type_left);
6709 return create_invalid_expression();
6712 declaration_t *const declaration = type_left->compound.declaration;
6714 if (!declaration->init.complete) {
6715 errorf(HERE, "request for member '%Y' of incomplete type '%T'",
6717 return create_invalid_expression();
6720 declaration_t *iter = find_compound_entry(declaration, symbol);
6722 errorf(HERE, "'%T' has no member named '%Y'", orig_type, symbol);
6723 return create_invalid_expression();
6726 /* we always do the auto-type conversions; the & and sizeof parser contains
6727 * code to revert this! */
6728 type_t *expression_type = automatic_type_conversion(iter->type);
6730 select->select.compound_entry = iter;
6731 select->base.type = expression_type;
6733 type_t *skipped = skip_typeref(iter->type);
6734 if (skipped->kind == TYPE_BITFIELD) {
6735 select->base.type = skipped->bitfield.base_type;
6741 static void check_call_argument(const function_parameter_t *parameter,
6742 call_argument_t *argument)
6744 type_t *expected_type = parameter->type;
6745 type_t *expected_type_skip = skip_typeref(expected_type);
6746 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
6747 expression_t *arg_expr = argument->expression;
6749 /* handle transparent union gnu extension */
6750 if (is_type_union(expected_type_skip)
6751 && (expected_type_skip->base.modifiers
6752 & TYPE_MODIFIER_TRANSPARENT_UNION)) {
6753 declaration_t *union_decl = expected_type_skip->compound.declaration;
6755 declaration_t *declaration = union_decl->scope.declarations;
6756 type_t *best_type = NULL;
6757 for ( ; declaration != NULL; declaration = declaration->next) {
6758 type_t *decl_type = declaration->type;
6759 error = semantic_assign(decl_type, arg_expr);
6760 if (error == ASSIGN_ERROR_INCOMPATIBLE
6761 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
6764 if (error == ASSIGN_SUCCESS) {
6765 best_type = decl_type;
6766 } else if (best_type == NULL) {
6767 best_type = decl_type;
6771 if (best_type != NULL) {
6772 expected_type = best_type;
6776 error = semantic_assign(expected_type, arg_expr);
6777 argument->expression = create_implicit_cast(argument->expression,
6780 /* TODO report exact scope in error messages (like "in 3rd parameter") */
6781 report_assign_error(error, expected_type, arg_expr, "function call",
6782 &arg_expr->base.source_position);
6786 * Parse a call expression, ie. expression '( ... )'.
6788 * @param expression the function address
6790 static expression_t *parse_call_expression(unsigned precedence,
6791 expression_t *expression)
6794 expression_t *result = allocate_expression_zero(EXPR_CALL);
6795 result->base.source_position = expression->base.source_position;
6797 call_expression_t *call = &result->call;
6798 call->function = expression;
6800 type_t *const orig_type = expression->base.type;
6801 type_t *const type = skip_typeref(orig_type);
6803 function_type_t *function_type = NULL;
6804 if (is_type_pointer(type)) {
6805 type_t *const to_type = skip_typeref(type->pointer.points_to);
6807 if (is_type_function(to_type)) {
6808 function_type = &to_type->function;
6809 call->base.type = function_type->return_type;
6813 if (function_type == NULL && is_type_valid(type)) {
6814 errorf(HERE, "called object '%E' (type '%T') is not a pointer to a function", expression, orig_type);
6817 /* parse arguments */
6819 add_anchor_token(')');
6820 add_anchor_token(',');
6822 if (token.type != ')') {
6823 call_argument_t *last_argument = NULL;
6826 call_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
6828 argument->expression = parse_assignment_expression();
6829 if (last_argument == NULL) {
6830 call->arguments = argument;
6832 last_argument->next = argument;
6834 last_argument = argument;
6836 if (token.type != ',')
6841 rem_anchor_token(',');
6842 rem_anchor_token(')');
6845 if (function_type == NULL)
6848 function_parameter_t *parameter = function_type->parameters;
6849 call_argument_t *argument = call->arguments;
6850 if (!function_type->unspecified_parameters) {
6851 for( ; parameter != NULL && argument != NULL;
6852 parameter = parameter->next, argument = argument->next) {
6853 check_call_argument(parameter, argument);
6856 if (parameter != NULL) {
6857 errorf(HERE, "too few arguments to function '%E'", expression);
6858 } else if (argument != NULL && !function_type->variadic) {
6859 errorf(HERE, "too many arguments to function '%E'", expression);
6863 /* do default promotion */
6864 for( ; argument != NULL; argument = argument->next) {
6865 type_t *type = argument->expression->base.type;
6867 type = get_default_promoted_type(type);
6869 argument->expression
6870 = create_implicit_cast(argument->expression, type);
6873 check_format(&result->call);
6875 if (warning.aggregate_return &&
6876 is_type_compound(skip_typeref(function_type->return_type))) {
6877 warningf(&result->base.source_position,
6878 "function call has aggregate value");
6883 return create_invalid_expression();
6886 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
6888 static bool same_compound_type(const type_t *type1, const type_t *type2)
6891 is_type_compound(type1) &&
6892 type1->kind == type2->kind &&
6893 type1->compound.declaration == type2->compound.declaration;
6897 * Parse a conditional expression, ie. 'expression ? ... : ...'.
6899 * @param expression the conditional expression
6901 static expression_t *parse_conditional_expression(unsigned precedence,
6902 expression_t *expression)
6904 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
6906 conditional_expression_t *conditional = &result->conditional;
6907 conditional->base.source_position = *HERE;
6908 conditional->condition = expression;
6911 add_anchor_token(':');
6914 type_t *const condition_type_orig = expression->base.type;
6915 type_t *const condition_type = skip_typeref(condition_type_orig);
6916 if (!is_type_scalar(condition_type) && is_type_valid(condition_type)) {
6917 type_error("expected a scalar type in conditional condition",
6918 &expression->base.source_position, condition_type_orig);
6921 expression_t *true_expression = expression;
6922 bool gnu_cond = false;
6923 if ((c_mode & _GNUC) && token.type == ':') {
6926 true_expression = parse_expression();
6927 rem_anchor_token(':');
6929 expression_t *false_expression = parse_sub_expression(precedence);
6931 type_t *const orig_true_type = true_expression->base.type;
6932 type_t *const orig_false_type = false_expression->base.type;
6933 type_t *const true_type = skip_typeref(orig_true_type);
6934 type_t *const false_type = skip_typeref(orig_false_type);
6937 type_t *result_type;
6938 if (is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
6939 is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
6940 if (!is_type_atomic(true_type, ATOMIC_TYPE_VOID)
6941 || !is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
6942 warningf(&conditional->base.source_position,
6943 "ISO C forbids conditional expression with only one void side");
6945 result_type = type_void;
6946 } else if (is_type_arithmetic(true_type)
6947 && is_type_arithmetic(false_type)) {
6948 result_type = semantic_arithmetic(true_type, false_type);
6950 true_expression = create_implicit_cast(true_expression, result_type);
6951 false_expression = create_implicit_cast(false_expression, result_type);
6953 conditional->true_expression = true_expression;
6954 conditional->false_expression = false_expression;
6955 conditional->base.type = result_type;
6956 } else if (same_compound_type(true_type, false_type)) {
6957 /* just take 1 of the 2 types */
6958 result_type = true_type;
6959 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
6960 type_t *pointer_type;
6962 expression_t *other_expression;
6963 if (is_type_pointer(true_type) &&
6964 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
6965 pointer_type = true_type;
6966 other_type = false_type;
6967 other_expression = false_expression;
6969 pointer_type = false_type;
6970 other_type = true_type;
6971 other_expression = true_expression;
6974 if (is_null_pointer_constant(other_expression)) {
6975 result_type = pointer_type;
6976 } else if (is_type_pointer(other_type)) {
6977 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
6978 type_t *to2 = skip_typeref(other_type->pointer.points_to);
6981 if (is_type_atomic(to1, ATOMIC_TYPE_VOID) ||
6982 is_type_atomic(to2, ATOMIC_TYPE_VOID)) {
6984 } else if (types_compatible(get_unqualified_type(to1),
6985 get_unqualified_type(to2))) {
6988 warningf(&conditional->base.source_position,
6989 "pointer types '%T' and '%T' in conditional expression are incompatible",
6990 true_type, false_type);
6994 type_t *const copy = duplicate_type(to);
6995 copy->base.qualifiers = to1->base.qualifiers | to2->base.qualifiers;
6997 type_t *const type = typehash_insert(copy);
7001 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7002 } else if (is_type_integer(other_type)) {
7003 warningf(&conditional->base.source_position,
7004 "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7005 result_type = pointer_type;
7007 type_error_incompatible("while parsing conditional",
7008 &expression->base.source_position, true_type, false_type);
7009 result_type = type_error_type;
7012 /* TODO: one pointer to void*, other some pointer */
7014 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7015 type_error_incompatible("while parsing conditional",
7016 &conditional->base.source_position, true_type,
7019 result_type = type_error_type;
7022 conditional->true_expression
7023 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7024 conditional->false_expression
7025 = create_implicit_cast(false_expression, result_type);
7026 conditional->base.type = result_type;
7029 return create_invalid_expression();
7033 * Parse an extension expression.
7035 static expression_t *parse_extension(unsigned precedence)
7037 eat(T___extension__);
7039 /* TODO enable extensions */
7040 expression_t *expression = parse_sub_expression(precedence);
7041 /* TODO disable extensions */
7046 * Parse a __builtin_classify_type() expression.
7048 static expression_t *parse_builtin_classify_type(const unsigned precedence)
7050 eat(T___builtin_classify_type);
7052 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7053 result->base.type = type_int;
7056 add_anchor_token(')');
7057 expression_t *expression = parse_sub_expression(precedence);
7058 rem_anchor_token(')');
7060 result->classify_type.type_expression = expression;
7064 return create_invalid_expression();
7067 static bool check_pointer_arithmetic(const source_position_t *source_position,
7068 type_t *pointer_type,
7069 type_t *orig_pointer_type)
7071 type_t *points_to = pointer_type->pointer.points_to;
7072 points_to = skip_typeref(points_to);
7074 if (is_type_incomplete(points_to)) {
7075 if (!(c_mode & _GNUC) || !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7076 errorf(source_position,
7077 "arithmetic with pointer to incomplete type '%T' not allowed",
7080 } else if (warning.pointer_arith) {
7081 warningf(source_position,
7082 "pointer of type '%T' used in arithmetic",
7085 } else if (is_type_function(points_to)) {
7086 if (!(c_mode && _GNUC)) {
7087 errorf(source_position,
7088 "arithmetic with pointer to function type '%T' not allowed",
7091 } else if (warning.pointer_arith) {
7092 warningf(source_position,
7093 "pointer to a function '%T' used in arithmetic",
7100 static void semantic_incdec(unary_expression_t *expression)
7102 type_t *const orig_type = expression->value->base.type;
7103 type_t *const type = skip_typeref(orig_type);
7104 if (is_type_pointer(type)) {
7105 if (!check_pointer_arithmetic(&expression->base.source_position,
7109 } else if (!is_type_real(type) && is_type_valid(type)) {
7110 /* TODO: improve error message */
7111 errorf(&expression->base.source_position,
7112 "operation needs an arithmetic or pointer type");
7115 expression->base.type = orig_type;
7118 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
7120 type_t *const orig_type = expression->value->base.type;
7121 type_t *const type = skip_typeref(orig_type);
7122 if (!is_type_arithmetic(type)) {
7123 if (is_type_valid(type)) {
7124 /* TODO: improve error message */
7125 errorf(&expression->base.source_position,
7126 "operation needs an arithmetic type");
7131 expression->base.type = orig_type;
7134 static void semantic_not(unary_expression_t *expression)
7136 type_t *const orig_type = expression->value->base.type;
7137 type_t *const type = skip_typeref(orig_type);
7138 if (!is_type_scalar(type) && is_type_valid(type)) {
7139 errorf(&expression->base.source_position,
7140 "operand of ! must be of scalar type");
7143 expression->base.type = type_int;
7146 static void semantic_unexpr_integer(unary_expression_t *expression)
7148 type_t *const orig_type = expression->value->base.type;
7149 type_t *const type = skip_typeref(orig_type);
7150 if (!is_type_integer(type)) {
7151 if (is_type_valid(type)) {
7152 errorf(&expression->base.source_position,
7153 "operand of ~ must be of integer type");
7158 expression->base.type = orig_type;
7161 static void semantic_dereference(unary_expression_t *expression)
7163 type_t *const orig_type = expression->value->base.type;
7164 type_t *const type = skip_typeref(orig_type);
7165 if (!is_type_pointer(type)) {
7166 if (is_type_valid(type)) {
7167 errorf(&expression->base.source_position,
7168 "Unary '*' needs pointer or arrray type, but type '%T' given", orig_type);
7173 type_t *result_type = type->pointer.points_to;
7174 result_type = automatic_type_conversion(result_type);
7175 expression->base.type = result_type;
7178 static void set_address_taken(expression_t *expression, bool may_be_register)
7180 if (expression->kind != EXPR_REFERENCE)
7183 declaration_t *const declaration = expression->reference.declaration;
7184 /* happens for parse errors */
7185 if (declaration == NULL)
7188 if (declaration->storage_class == STORAGE_CLASS_REGISTER && !may_be_register) {
7189 errorf(&expression->base.source_position,
7190 "address of register variable '%Y' requested",
7191 declaration->symbol);
7193 declaration->address_taken = 1;
7198 * Check the semantic of the address taken expression.
7200 static void semantic_take_addr(unary_expression_t *expression)
7202 expression_t *value = expression->value;
7203 value->base.type = revert_automatic_type_conversion(value);
7205 type_t *orig_type = value->base.type;
7206 if (!is_type_valid(orig_type))
7209 set_address_taken(value, false);
7211 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
7214 #define CREATE_UNARY_EXPRESSION_PARSER(token_type, unexpression_type, sfunc) \
7215 static expression_t *parse_##unexpression_type(unsigned precedence) \
7217 expression_t *unary_expression \
7218 = allocate_expression_zero(unexpression_type); \
7219 unary_expression->base.source_position = *HERE; \
7221 unary_expression->unary.value = parse_sub_expression(precedence); \
7223 sfunc(&unary_expression->unary); \
7225 return unary_expression; \
7228 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
7229 semantic_unexpr_arithmetic)
7230 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
7231 semantic_unexpr_arithmetic)
7232 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
7234 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
7235 semantic_dereference)
7236 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
7238 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
7239 semantic_unexpr_integer)
7240 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
7242 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
7245 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_type, unexpression_type, \
7247 static expression_t *parse_##unexpression_type(unsigned precedence, \
7248 expression_t *left) \
7250 (void) precedence; \
7252 expression_t *unary_expression \
7253 = allocate_expression_zero(unexpression_type); \
7254 unary_expression->base.source_position = *HERE; \
7256 unary_expression->unary.value = left; \
7258 sfunc(&unary_expression->unary); \
7260 return unary_expression; \
7263 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
7264 EXPR_UNARY_POSTFIX_INCREMENT,
7266 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
7267 EXPR_UNARY_POSTFIX_DECREMENT,
7270 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
7272 /* TODO: handle complex + imaginary types */
7274 /* § 6.3.1.8 Usual arithmetic conversions */
7275 if (type_left == type_long_double || type_right == type_long_double) {
7276 return type_long_double;
7277 } else if (type_left == type_double || type_right == type_double) {
7279 } else if (type_left == type_float || type_right == type_float) {
7283 type_left = promote_integer(type_left);
7284 type_right = promote_integer(type_right);
7286 if (type_left == type_right)
7289 bool const signed_left = is_type_signed(type_left);
7290 bool const signed_right = is_type_signed(type_right);
7291 int const rank_left = get_rank(type_left);
7292 int const rank_right = get_rank(type_right);
7294 if (signed_left == signed_right)
7295 return rank_left >= rank_right ? type_left : type_right;
7304 u_rank = rank_right;
7305 u_type = type_right;
7307 s_rank = rank_right;
7308 s_type = type_right;
7313 if (u_rank >= s_rank)
7316 /* casting rank to atomic_type_kind is a bit hacky, but makes things
7318 if (get_atomic_type_size((atomic_type_kind_t) s_rank)
7319 > get_atomic_type_size((atomic_type_kind_t) u_rank))
7323 case ATOMIC_TYPE_INT: return type_unsigned_int;
7324 case ATOMIC_TYPE_LONG: return type_unsigned_long;
7325 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
7327 default: panic("invalid atomic type");
7332 * Check the semantic restrictions for a binary expression.
7334 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
7336 expression_t *const left = expression->left;
7337 expression_t *const right = expression->right;
7338 type_t *const orig_type_left = left->base.type;
7339 type_t *const orig_type_right = right->base.type;
7340 type_t *const type_left = skip_typeref(orig_type_left);
7341 type_t *const type_right = skip_typeref(orig_type_right);
7343 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
7344 /* TODO: improve error message */
7345 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7346 errorf(&expression->base.source_position,
7347 "operation needs arithmetic types");
7352 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7353 expression->left = create_implicit_cast(left, arithmetic_type);
7354 expression->right = create_implicit_cast(right, arithmetic_type);
7355 expression->base.type = arithmetic_type;
7358 static void warn_div_by_zero(binary_expression_t const *const expression)
7360 if (warning.div_by_zero &&
7361 is_type_integer(expression->base.type) &&
7362 is_constant_expression(expression->right) &&
7363 fold_constant(expression->right) == 0) {
7364 warningf(&expression->base.source_position, "division by zero");
7369 * Check the semantic restrictions for a div/mod expression.
7371 static void semantic_divmod_arithmetic(binary_expression_t *expression) {
7372 semantic_binexpr_arithmetic(expression);
7373 warn_div_by_zero(expression);
7376 static void semantic_shift_op(binary_expression_t *expression)
7378 expression_t *const left = expression->left;
7379 expression_t *const right = expression->right;
7380 type_t *const orig_type_left = left->base.type;
7381 type_t *const orig_type_right = right->base.type;
7382 type_t * type_left = skip_typeref(orig_type_left);
7383 type_t * type_right = skip_typeref(orig_type_right);
7385 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
7386 /* TODO: improve error message */
7387 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7388 errorf(&expression->base.source_position,
7389 "operands of shift operation must have integer types");
7394 type_left = promote_integer(type_left);
7395 type_right = promote_integer(type_right);
7397 expression->left = create_implicit_cast(left, type_left);
7398 expression->right = create_implicit_cast(right, type_right);
7399 expression->base.type = type_left;
7402 static void semantic_add(binary_expression_t *expression)
7404 expression_t *const left = expression->left;
7405 expression_t *const right = expression->right;
7406 type_t *const orig_type_left = left->base.type;
7407 type_t *const orig_type_right = right->base.type;
7408 type_t *const type_left = skip_typeref(orig_type_left);
7409 type_t *const type_right = skip_typeref(orig_type_right);
7412 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
7413 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7414 expression->left = create_implicit_cast(left, arithmetic_type);
7415 expression->right = create_implicit_cast(right, arithmetic_type);
7416 expression->base.type = arithmetic_type;
7418 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
7419 check_pointer_arithmetic(&expression->base.source_position,
7420 type_left, orig_type_left);
7421 expression->base.type = type_left;
7422 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
7423 check_pointer_arithmetic(&expression->base.source_position,
7424 type_right, orig_type_right);
7425 expression->base.type = type_right;
7426 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
7427 errorf(&expression->base.source_position,
7428 "invalid operands to binary + ('%T', '%T')",
7429 orig_type_left, orig_type_right);
7433 static void semantic_sub(binary_expression_t *expression)
7435 expression_t *const left = expression->left;
7436 expression_t *const right = expression->right;
7437 type_t *const orig_type_left = left->base.type;
7438 type_t *const orig_type_right = right->base.type;
7439 type_t *const type_left = skip_typeref(orig_type_left);
7440 type_t *const type_right = skip_typeref(orig_type_right);
7441 source_position_t const *const pos = &expression->base.source_position;
7444 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
7445 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7446 expression->left = create_implicit_cast(left, arithmetic_type);
7447 expression->right = create_implicit_cast(right, arithmetic_type);
7448 expression->base.type = arithmetic_type;
7450 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
7451 check_pointer_arithmetic(&expression->base.source_position,
7452 type_left, orig_type_left);
7453 expression->base.type = type_left;
7454 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
7455 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
7456 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
7457 if (!types_compatible(unqual_left, unqual_right)) {
7459 "subtracting pointers to incompatible types '%T' and '%T'",
7460 orig_type_left, orig_type_right);
7461 } else if (!is_type_object(unqual_left)) {
7462 if (is_type_atomic(unqual_left, ATOMIC_TYPE_VOID)) {
7463 warningf(pos, "subtracting pointers to void");
7465 errorf(pos, "subtracting pointers to non-object types '%T'",
7469 expression->base.type = type_ptrdiff_t;
7470 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
7471 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
7472 orig_type_left, orig_type_right);
7477 * Check the semantics of comparison expressions.
7479 * @param expression The expression to check.
7481 static void semantic_comparison(binary_expression_t *expression)
7483 expression_t *left = expression->left;
7484 expression_t *right = expression->right;
7485 type_t *orig_type_left = left->base.type;
7486 type_t *orig_type_right = right->base.type;
7488 type_t *type_left = skip_typeref(orig_type_left);
7489 type_t *type_right = skip_typeref(orig_type_right);
7491 /* TODO non-arithmetic types */
7492 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
7493 /* test for signed vs unsigned compares */
7494 if (warning.sign_compare &&
7495 (expression->base.kind != EXPR_BINARY_EQUAL &&
7496 expression->base.kind != EXPR_BINARY_NOTEQUAL) &&
7497 (is_type_signed(type_left) != is_type_signed(type_right))) {
7499 /* check if 1 of the operands is a constant, in this case we just
7500 * check wether we can safely represent the resulting constant in
7501 * the type of the other operand. */
7502 expression_t *const_expr = NULL;
7503 expression_t *other_expr = NULL;
7505 if (is_constant_expression(left)) {
7508 } else if (is_constant_expression(right)) {
7513 if (const_expr != NULL) {
7514 type_t *other_type = skip_typeref(other_expr->base.type);
7515 long val = fold_constant(const_expr);
7516 /* TODO: check if val can be represented by other_type */
7520 warningf(&expression->base.source_position,
7521 "comparison between signed and unsigned");
7523 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7524 expression->left = create_implicit_cast(left, arithmetic_type);
7525 expression->right = create_implicit_cast(right, arithmetic_type);
7526 expression->base.type = arithmetic_type;
7527 if (warning.float_equal &&
7528 (expression->base.kind == EXPR_BINARY_EQUAL ||
7529 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
7530 is_type_float(arithmetic_type)) {
7531 warningf(&expression->base.source_position,
7532 "comparing floating point with == or != is unsafe");
7534 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
7535 /* TODO check compatibility */
7536 } else if (is_type_pointer(type_left)) {
7537 expression->right = create_implicit_cast(right, type_left);
7538 } else if (is_type_pointer(type_right)) {
7539 expression->left = create_implicit_cast(left, type_right);
7540 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
7541 type_error_incompatible("invalid operands in comparison",
7542 &expression->base.source_position,
7543 type_left, type_right);
7545 expression->base.type = type_int;
7549 * Checks if a compound type has constant fields.
7551 static bool has_const_fields(const compound_type_t *type)
7553 const scope_t *scope = &type->declaration->scope;
7554 const declaration_t *declaration = scope->declarations;
7556 for (; declaration != NULL; declaration = declaration->next) {
7557 if (declaration->namespc != NAMESPACE_NORMAL)
7560 const type_t *decl_type = skip_typeref(declaration->type);
7561 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
7568 static bool is_lvalue(const expression_t *expression)
7570 switch (expression->kind) {
7571 case EXPR_REFERENCE:
7572 case EXPR_ARRAY_ACCESS:
7574 case EXPR_UNARY_DEREFERENCE:
7582 static bool is_valid_assignment_lhs(expression_t const* const left)
7584 type_t *const orig_type_left = revert_automatic_type_conversion(left);
7585 type_t *const type_left = skip_typeref(orig_type_left);
7587 if (!is_lvalue(left)) {
7588 errorf(HERE, "left hand side '%E' of assignment is not an lvalue",
7593 if (is_type_array(type_left)) {
7594 errorf(HERE, "cannot assign to arrays ('%E')", left);
7597 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
7598 errorf(HERE, "assignment to readonly location '%E' (type '%T')", left,
7602 if (is_type_incomplete(type_left)) {
7603 errorf(HERE, "left-hand side '%E' of assignment has incomplete type '%T'",
7604 left, orig_type_left);
7607 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
7608 errorf(HERE, "cannot assign to '%E' because compound type '%T' has readonly fields",
7609 left, orig_type_left);
7616 static void semantic_arithmetic_assign(binary_expression_t *expression)
7618 expression_t *left = expression->left;
7619 expression_t *right = expression->right;
7620 type_t *orig_type_left = left->base.type;
7621 type_t *orig_type_right = right->base.type;
7623 if (!is_valid_assignment_lhs(left))
7626 type_t *type_left = skip_typeref(orig_type_left);
7627 type_t *type_right = skip_typeref(orig_type_right);
7629 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
7630 /* TODO: improve error message */
7631 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7632 errorf(&expression->base.source_position,
7633 "operation needs arithmetic types");
7638 /* combined instructions are tricky. We can't create an implicit cast on
7639 * the left side, because we need the uncasted form for the store.
7640 * The ast2firm pass has to know that left_type must be right_type
7641 * for the arithmetic operation and create a cast by itself */
7642 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7643 expression->right = create_implicit_cast(right, arithmetic_type);
7644 expression->base.type = type_left;
7647 static void semantic_divmod_assign(binary_expression_t *expression)
7649 semantic_arithmetic_assign(expression);
7650 warn_div_by_zero(expression);
7653 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
7655 expression_t *const left = expression->left;
7656 expression_t *const right = expression->right;
7657 type_t *const orig_type_left = left->base.type;
7658 type_t *const orig_type_right = right->base.type;
7659 type_t *const type_left = skip_typeref(orig_type_left);
7660 type_t *const type_right = skip_typeref(orig_type_right);
7662 if (!is_valid_assignment_lhs(left))
7665 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
7666 /* combined instructions are tricky. We can't create an implicit cast on
7667 * the left side, because we need the uncasted form for the store.
7668 * The ast2firm pass has to know that left_type must be right_type
7669 * for the arithmetic operation and create a cast by itself */
7670 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
7671 expression->right = create_implicit_cast(right, arithmetic_type);
7672 expression->base.type = type_left;
7673 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
7674 check_pointer_arithmetic(&expression->base.source_position,
7675 type_left, orig_type_left);
7676 expression->base.type = type_left;
7677 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
7678 errorf(&expression->base.source_position,
7679 "incompatible types '%T' and '%T' in assignment",
7680 orig_type_left, orig_type_right);
7685 * Check the semantic restrictions of a logical expression.
7687 static void semantic_logical_op(binary_expression_t *expression)
7689 expression_t *const left = expression->left;
7690 expression_t *const right = expression->right;
7691 type_t *const orig_type_left = left->base.type;
7692 type_t *const orig_type_right = right->base.type;
7693 type_t *const type_left = skip_typeref(orig_type_left);
7694 type_t *const type_right = skip_typeref(orig_type_right);
7696 if (!is_type_scalar(type_left) || !is_type_scalar(type_right)) {
7697 /* TODO: improve error message */
7698 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7699 errorf(&expression->base.source_position,
7700 "operation needs scalar types");
7705 expression->base.type = type_int;
7709 * Check the semantic restrictions of a binary assign expression.
7711 static void semantic_binexpr_assign(binary_expression_t *expression)
7713 expression_t *left = expression->left;
7714 type_t *orig_type_left = left->base.type;
7716 type_t *type_left = revert_automatic_type_conversion(left);
7717 type_left = skip_typeref(orig_type_left);
7719 if (!is_valid_assignment_lhs(left))
7722 assign_error_t error = semantic_assign(orig_type_left, expression->right);
7723 report_assign_error(error, orig_type_left, expression->right,
7724 "assignment", &left->base.source_position);
7725 expression->right = create_implicit_cast(expression->right, orig_type_left);
7726 expression->base.type = orig_type_left;
7730 * Determine if the outermost operation (or parts thereof) of the given
7731 * expression has no effect in order to generate a warning about this fact.
7732 * Therefore in some cases this only examines some of the operands of the
7733 * expression (see comments in the function and examples below).
7735 * f() + 23; // warning, because + has no effect
7736 * x || f(); // no warning, because x controls execution of f()
7737 * x ? y : f(); // warning, because y has no effect
7738 * (void)x; // no warning to be able to suppress the warning
7739 * This function can NOT be used for an "expression has definitely no effect"-
7741 static bool expression_has_effect(const expression_t *const expr)
7743 switch (expr->kind) {
7744 case EXPR_UNKNOWN: break;
7745 case EXPR_INVALID: return true; /* do NOT warn */
7746 case EXPR_REFERENCE: return false;
7747 /* suppress the warning for microsoft __noop operations */
7748 case EXPR_CONST: return expr->conste.is_ms_noop;
7749 case EXPR_CHARACTER_CONSTANT: return false;
7750 case EXPR_WIDE_CHARACTER_CONSTANT: return false;
7751 case EXPR_STRING_LITERAL: return false;
7752 case EXPR_WIDE_STRING_LITERAL: return false;
7755 const call_expression_t *const call = &expr->call;
7756 if (call->function->kind != EXPR_BUILTIN_SYMBOL)
7759 switch (call->function->builtin_symbol.symbol->ID) {
7760 case T___builtin_va_end: return true;
7761 default: return false;
7765 /* Generate the warning if either the left or right hand side of a
7766 * conditional expression has no effect */
7767 case EXPR_CONDITIONAL: {
7768 const conditional_expression_t *const cond = &expr->conditional;
7770 expression_has_effect(cond->true_expression) &&
7771 expression_has_effect(cond->false_expression);
7774 case EXPR_SELECT: return false;
7775 case EXPR_ARRAY_ACCESS: return false;
7776 case EXPR_SIZEOF: return false;
7777 case EXPR_CLASSIFY_TYPE: return false;
7778 case EXPR_ALIGNOF: return false;
7780 case EXPR_FUNCNAME: return false;
7781 case EXPR_BUILTIN_SYMBOL: break; /* handled in EXPR_CALL */
7782 case EXPR_BUILTIN_CONSTANT_P: return false;
7783 case EXPR_BUILTIN_PREFETCH: return true;
7784 case EXPR_OFFSETOF: return false;
7785 case EXPR_VA_START: return true;
7786 case EXPR_VA_ARG: return true;
7787 case EXPR_STATEMENT: return true; // TODO
7788 case EXPR_COMPOUND_LITERAL: return false;
7790 case EXPR_UNARY_NEGATE: return false;
7791 case EXPR_UNARY_PLUS: return false;
7792 case EXPR_UNARY_BITWISE_NEGATE: return false;
7793 case EXPR_UNARY_NOT: return false;
7794 case EXPR_UNARY_DEREFERENCE: return false;
7795 case EXPR_UNARY_TAKE_ADDRESS: return false;
7796 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
7797 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
7798 case EXPR_UNARY_PREFIX_INCREMENT: return true;
7799 case EXPR_UNARY_PREFIX_DECREMENT: return true;
7801 /* Treat void casts as if they have an effect in order to being able to
7802 * suppress the warning */
7803 case EXPR_UNARY_CAST: {
7804 type_t *const type = skip_typeref(expr->base.type);
7805 return is_type_atomic(type, ATOMIC_TYPE_VOID);
7808 case EXPR_UNARY_CAST_IMPLICIT: return true;
7809 case EXPR_UNARY_ASSUME: return true;
7811 case EXPR_BINARY_ADD: return false;
7812 case EXPR_BINARY_SUB: return false;
7813 case EXPR_BINARY_MUL: return false;
7814 case EXPR_BINARY_DIV: return false;
7815 case EXPR_BINARY_MOD: return false;
7816 case EXPR_BINARY_EQUAL: return false;
7817 case EXPR_BINARY_NOTEQUAL: return false;
7818 case EXPR_BINARY_LESS: return false;
7819 case EXPR_BINARY_LESSEQUAL: return false;
7820 case EXPR_BINARY_GREATER: return false;
7821 case EXPR_BINARY_GREATEREQUAL: return false;
7822 case EXPR_BINARY_BITWISE_AND: return false;
7823 case EXPR_BINARY_BITWISE_OR: return false;
7824 case EXPR_BINARY_BITWISE_XOR: return false;
7825 case EXPR_BINARY_SHIFTLEFT: return false;
7826 case EXPR_BINARY_SHIFTRIGHT: return false;
7827 case EXPR_BINARY_ASSIGN: return true;
7828 case EXPR_BINARY_MUL_ASSIGN: return true;
7829 case EXPR_BINARY_DIV_ASSIGN: return true;
7830 case EXPR_BINARY_MOD_ASSIGN: return true;
7831 case EXPR_BINARY_ADD_ASSIGN: return true;
7832 case EXPR_BINARY_SUB_ASSIGN: return true;
7833 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
7834 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
7835 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
7836 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
7837 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
7839 /* Only examine the right hand side of && and ||, because the left hand
7840 * side already has the effect of controlling the execution of the right
7842 case EXPR_BINARY_LOGICAL_AND:
7843 case EXPR_BINARY_LOGICAL_OR:
7844 /* Only examine the right hand side of a comma expression, because the left
7845 * hand side has a separate warning */
7846 case EXPR_BINARY_COMMA:
7847 return expression_has_effect(expr->binary.right);
7849 case EXPR_BINARY_BUILTIN_EXPECT: return true;
7850 case EXPR_BINARY_ISGREATER: return false;
7851 case EXPR_BINARY_ISGREATEREQUAL: return false;
7852 case EXPR_BINARY_ISLESS: return false;
7853 case EXPR_BINARY_ISLESSEQUAL: return false;
7854 case EXPR_BINARY_ISLESSGREATER: return false;
7855 case EXPR_BINARY_ISUNORDERED: return false;
7858 internal_errorf(HERE, "unexpected expression");
7861 static void semantic_comma(binary_expression_t *expression)
7863 if (warning.unused_value) {
7864 const expression_t *const left = expression->left;
7865 if (!expression_has_effect(left)) {
7866 warningf(&left->base.source_position,
7867 "left-hand operand of comma expression has no effect");
7870 expression->base.type = expression->right->base.type;
7873 #define CREATE_BINEXPR_PARSER(token_type, binexpression_type, sfunc, lr) \
7874 static expression_t *parse_##binexpression_type(unsigned precedence, \
7875 expression_t *left) \
7877 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
7878 binexpr->base.source_position = *HERE; \
7879 binexpr->binary.left = left; \
7882 expression_t *right = parse_sub_expression(precedence + lr); \
7884 binexpr->binary.right = right; \
7885 sfunc(&binexpr->binary); \
7890 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, semantic_comma, 1)
7891 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, semantic_binexpr_arithmetic, 1)
7892 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, semantic_divmod_arithmetic, 1)
7893 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, semantic_divmod_arithmetic, 1)
7894 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, semantic_add, 1)
7895 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, semantic_sub, 1)
7896 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, semantic_comparison, 1)
7897 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, semantic_comparison, 1)
7898 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, semantic_binexpr_assign, 0)
7900 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL,
7901 semantic_comparison, 1)
7902 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL,
7903 semantic_comparison, 1)
7904 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL,
7905 semantic_comparison, 1)
7906 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL,
7907 semantic_comparison, 1)
7909 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND,
7910 semantic_binexpr_arithmetic, 1)
7911 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR,
7912 semantic_binexpr_arithmetic, 1)
7913 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR,
7914 semantic_binexpr_arithmetic, 1)
7915 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND,
7916 semantic_logical_op, 1)
7917 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR,
7918 semantic_logical_op, 1)
7919 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT,
7920 semantic_shift_op, 1)
7921 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT,
7922 semantic_shift_op, 1)
7923 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN,
7924 semantic_arithmetic_addsubb_assign, 0)
7925 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN,
7926 semantic_arithmetic_addsubb_assign, 0)
7927 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN,
7928 semantic_arithmetic_assign, 0)
7929 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN,
7930 semantic_divmod_assign, 0)
7931 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN,
7932 semantic_divmod_assign, 0)
7933 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN,
7934 semantic_arithmetic_assign, 0)
7935 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN,
7936 semantic_arithmetic_assign, 0)
7937 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN,
7938 semantic_arithmetic_assign, 0)
7939 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN,
7940 semantic_arithmetic_assign, 0)
7941 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN,
7942 semantic_arithmetic_assign, 0)
7944 static expression_t *parse_sub_expression(unsigned precedence)
7946 if (token.type < 0) {
7947 return expected_expression_error();
7950 expression_parser_function_t *parser
7951 = &expression_parsers[token.type];
7952 source_position_t source_position = token.source_position;
7955 if (parser->parser != NULL) {
7956 left = parser->parser(parser->precedence);
7958 left = parse_primary_expression();
7960 assert(left != NULL);
7961 left->base.source_position = source_position;
7964 if (token.type < 0) {
7965 return expected_expression_error();
7968 parser = &expression_parsers[token.type];
7969 if (parser->infix_parser == NULL)
7971 if (parser->infix_precedence < precedence)
7974 left = parser->infix_parser(parser->infix_precedence, left);
7976 assert(left != NULL);
7977 assert(left->kind != EXPR_UNKNOWN);
7978 left->base.source_position = source_position;
7985 * Parse an expression.
7987 static expression_t *parse_expression(void)
7989 return parse_sub_expression(1);
7993 * Register a parser for a prefix-like operator with given precedence.
7995 * @param parser the parser function
7996 * @param token_type the token type of the prefix token
7997 * @param precedence the precedence of the operator
7999 static void register_expression_parser(parse_expression_function parser,
8000 int token_type, unsigned precedence)
8002 expression_parser_function_t *entry = &expression_parsers[token_type];
8004 if (entry->parser != NULL) {
8005 diagnosticf("for token '%k'\n", (token_type_t)token_type);
8006 panic("trying to register multiple expression parsers for a token");
8008 entry->parser = parser;
8009 entry->precedence = precedence;
8013 * Register a parser for an infix operator with given precedence.
8015 * @param parser the parser function
8016 * @param token_type the token type of the infix operator
8017 * @param precedence the precedence of the operator
8019 static void register_infix_parser(parse_expression_infix_function parser,
8020 int token_type, unsigned precedence)
8022 expression_parser_function_t *entry = &expression_parsers[token_type];
8024 if (entry->infix_parser != NULL) {
8025 diagnosticf("for token '%k'\n", (token_type_t)token_type);
8026 panic("trying to register multiple infix expression parsers for a "
8029 entry->infix_parser = parser;
8030 entry->infix_precedence = precedence;
8034 * Initialize the expression parsers.
8036 static void init_expression_parsers(void)
8038 memset(&expression_parsers, 0, sizeof(expression_parsers));
8040 register_infix_parser(parse_array_expression, '[', 30);
8041 register_infix_parser(parse_call_expression, '(', 30);
8042 register_infix_parser(parse_select_expression, '.', 30);
8043 register_infix_parser(parse_select_expression, T_MINUSGREATER, 30);
8044 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT,
8046 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT,
8049 register_infix_parser(parse_EXPR_BINARY_MUL, '*', 17);
8050 register_infix_parser(parse_EXPR_BINARY_DIV, '/', 17);
8051 register_infix_parser(parse_EXPR_BINARY_MOD, '%', 17);
8052 register_infix_parser(parse_EXPR_BINARY_ADD, '+', 16);
8053 register_infix_parser(parse_EXPR_BINARY_SUB, '-', 16);
8054 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, 15);
8055 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, 15);
8056 register_infix_parser(parse_EXPR_BINARY_LESS, '<', 14);
8057 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', 14);
8058 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, 14);
8059 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, 14);
8060 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, 13);
8061 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL,
8062 T_EXCLAMATIONMARKEQUAL, 13);
8063 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', 12);
8064 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', 11);
8065 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', 10);
8066 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, 9);
8067 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, 8);
8068 register_infix_parser(parse_conditional_expression, '?', 7);
8069 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', 2);
8070 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, 2);
8071 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, 2);
8072 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, 2);
8073 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, 2);
8074 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, 2);
8075 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN,
8076 T_LESSLESSEQUAL, 2);
8077 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN,
8078 T_GREATERGREATEREQUAL, 2);
8079 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN,
8081 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN,
8083 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN,
8086 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', 1);
8088 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-', 25);
8089 register_expression_parser(parse_EXPR_UNARY_PLUS, '+', 25);
8090 register_expression_parser(parse_EXPR_UNARY_NOT, '!', 25);
8091 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~', 25);
8092 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*', 25);
8093 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&', 25);
8094 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT,
8096 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT,
8098 register_expression_parser(parse_sizeof, T_sizeof, 25);
8099 register_expression_parser(parse_alignof, T___alignof__, 25);
8100 register_expression_parser(parse_extension, T___extension__, 25);
8101 register_expression_parser(parse_builtin_classify_type,
8102 T___builtin_classify_type, 25);
8106 * Parse a asm statement arguments specification.
8108 static asm_argument_t *parse_asm_arguments(bool is_out)
8110 asm_argument_t *result = NULL;
8111 asm_argument_t *last = NULL;
8113 while (token.type == T_STRING_LITERAL || token.type == '[') {
8114 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
8115 memset(argument, 0, sizeof(argument[0]));
8117 if (token.type == '[') {
8119 if (token.type != T_IDENTIFIER) {
8120 parse_error_expected("while parsing asm argument",
8121 T_IDENTIFIER, NULL);
8124 argument->symbol = token.v.symbol;
8129 argument->constraints = parse_string_literals();
8131 add_anchor_token(')');
8132 expression_t *expression = parse_expression();
8133 rem_anchor_token(')');
8135 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
8136 * change size or type representation (e.g. int -> long is ok, but
8137 * int -> float is not) */
8138 if (expression->kind == EXPR_UNARY_CAST) {
8139 type_t *const type = expression->base.type;
8140 type_kind_t const kind = type->kind;
8141 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
8144 if (kind == TYPE_ATOMIC) {
8145 atomic_type_kind_t const akind = type->atomic.akind;
8146 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8147 size = get_atomic_type_size(akind);
8149 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8150 size = get_atomic_type_size(get_intptr_kind());
8154 expression_t *const value = expression->unary.value;
8155 type_t *const value_type = value->base.type;
8156 type_kind_t const value_kind = value_type->kind;
8158 unsigned value_flags;
8159 unsigned value_size;
8160 if (value_kind == TYPE_ATOMIC) {
8161 atomic_type_kind_t const value_akind = value_type->atomic.akind;
8162 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8163 value_size = get_atomic_type_size(value_akind);
8164 } else if (value_kind == TYPE_POINTER) {
8165 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8166 value_size = get_atomic_type_size(get_intptr_kind());
8171 if (value_flags != flags || value_size != size)
8175 } while (expression->kind == EXPR_UNARY_CAST);
8179 if (!is_lvalue(expression)) {
8180 errorf(&expression->base.source_position,
8181 "asm output argument is not an lvalue");
8184 argument->expression = expression;
8187 set_address_taken(expression, true);
8190 last->next = argument;
8196 if (token.type != ',')
8207 * Parse a asm statement clobber specification.
8209 static asm_clobber_t *parse_asm_clobbers(void)
8211 asm_clobber_t *result = NULL;
8212 asm_clobber_t *last = NULL;
8214 while(token.type == T_STRING_LITERAL) {
8215 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
8216 clobber->clobber = parse_string_literals();
8219 last->next = clobber;
8225 if (token.type != ',')
8234 * Parse an asm statement.
8236 static statement_t *parse_asm_statement(void)
8240 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
8241 statement->base.source_position = token.source_position;
8243 asm_statement_t *asm_statement = &statement->asms;
8245 if (token.type == T_volatile) {
8247 asm_statement->is_volatile = true;
8251 add_anchor_token(')');
8252 add_anchor_token(':');
8253 asm_statement->asm_text = parse_string_literals();
8255 if (token.type != ':') {
8256 rem_anchor_token(':');
8261 asm_statement->outputs = parse_asm_arguments(true);
8262 if (token.type != ':') {
8263 rem_anchor_token(':');
8268 asm_statement->inputs = parse_asm_arguments(false);
8269 if (token.type != ':') {
8270 rem_anchor_token(':');
8273 rem_anchor_token(':');
8276 asm_statement->clobbers = parse_asm_clobbers();
8279 rem_anchor_token(')');
8283 if (asm_statement->outputs == NULL) {
8284 /* GCC: An 'asm' instruction without any output operands will be treated
8285 * identically to a volatile 'asm' instruction. */
8286 asm_statement->is_volatile = true;
8291 return create_invalid_statement();
8295 * Parse a case statement.
8297 static statement_t *parse_case_statement(void)
8301 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
8302 source_position_t *const pos = &statement->base.source_position;
8304 *pos = token.source_position;
8305 statement->case_label.expression = parse_expression();
8306 if (! is_constant_expression(statement->case_label.expression)) {
8307 errorf(pos, "case label does not reduce to an integer constant");
8308 statement->case_label.is_bad = true;
8310 long const val = fold_constant(statement->case_label.expression);
8311 statement->case_label.first_case = val;
8312 statement->case_label.last_case = val;
8315 if (c_mode & _GNUC) {
8316 if (token.type == T_DOTDOTDOT) {
8318 statement->case_label.end_range = parse_expression();
8319 if (! is_constant_expression(statement->case_label.end_range)) {
8320 errorf(pos, "case range does not reduce to an integer constant");
8321 statement->case_label.is_bad = true;
8323 long const val = fold_constant(statement->case_label.end_range);
8324 statement->case_label.last_case = val;
8326 if (val < statement->case_label.first_case) {
8327 statement->case_label.is_empty = true;
8328 warningf(pos, "empty range specified");
8334 PUSH_PARENT(statement);
8338 if (current_switch != NULL) {
8339 if (! statement->case_label.is_bad) {
8340 /* Check for duplicate case values */
8341 case_label_statement_t *c = &statement->case_label;
8342 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
8343 if (l->is_bad || l->is_empty || l->expression == NULL)
8346 if (c->last_case < l->first_case || c->first_case > l->last_case)
8349 errorf(pos, "duplicate case value (previously used %P)",
8350 &l->base.source_position);
8354 /* link all cases into the switch statement */
8355 if (current_switch->last_case == NULL) {
8356 current_switch->first_case = &statement->case_label;
8358 current_switch->last_case->next = &statement->case_label;
8360 current_switch->last_case = &statement->case_label;
8362 errorf(pos, "case label not within a switch statement");
8365 statement_t *const inner_stmt = parse_statement();
8366 statement->case_label.statement = inner_stmt;
8367 if (inner_stmt->kind == STATEMENT_DECLARATION) {
8368 errorf(&inner_stmt->base.source_position, "declaration after case label");
8375 return create_invalid_statement();
8379 * Parse a default statement.
8381 static statement_t *parse_default_statement(void)
8385 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
8386 statement->base.source_position = token.source_position;
8388 PUSH_PARENT(statement);
8391 if (current_switch != NULL) {
8392 const case_label_statement_t *def_label = current_switch->default_label;
8393 if (def_label != NULL) {
8394 errorf(HERE, "multiple default labels in one switch (previous declared %P)",
8395 &def_label->base.source_position);
8397 current_switch->default_label = &statement->case_label;
8399 /* link all cases into the switch statement */
8400 if (current_switch->last_case == NULL) {
8401 current_switch->first_case = &statement->case_label;
8403 current_switch->last_case->next = &statement->case_label;
8405 current_switch->last_case = &statement->case_label;
8408 errorf(&statement->base.source_position,
8409 "'default' label not within a switch statement");
8412 statement_t *const inner_stmt = parse_statement();
8413 statement->case_label.statement = inner_stmt;
8414 if (inner_stmt->kind == STATEMENT_DECLARATION) {
8415 errorf(&inner_stmt->base.source_position, "declaration after default label");
8422 return create_invalid_statement();
8426 * Return the declaration for a given label symbol or create a new one.
8428 * @param symbol the symbol of the label
8430 static declaration_t *get_label(symbol_t *symbol)
8432 declaration_t *candidate = get_declaration(symbol, NAMESPACE_LABEL);
8433 assert(current_function != NULL);
8434 /* if we found a label in the same function, then we already created the
8436 if (candidate != NULL
8437 && candidate->parent_scope == ¤t_function->scope) {
8441 /* otherwise we need to create a new one */
8442 declaration_t *const declaration = allocate_declaration_zero();
8443 declaration->namespc = NAMESPACE_LABEL;
8444 declaration->symbol = symbol;
8446 label_push(declaration);
8452 * Parse a label statement.
8454 static statement_t *parse_label_statement(void)
8456 assert(token.type == T_IDENTIFIER);
8457 symbol_t *symbol = token.v.symbol;
8460 declaration_t *label = get_label(symbol);
8462 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
8463 statement->base.source_position = token.source_position;
8464 statement->label.label = label;
8466 PUSH_PARENT(statement);
8468 /* if source position is already set then the label is defined twice,
8469 * otherwise it was just mentioned in a goto so far */
8470 if (label->source_position.input_name != NULL) {
8471 errorf(HERE, "duplicate label '%Y' (declared %P)",
8472 symbol, &label->source_position);
8474 label->source_position = token.source_position;
8475 label->init.statement = statement;
8480 if (token.type == '}') {
8481 /* TODO only warn? */
8483 warningf(HERE, "label at end of compound statement");
8484 statement->label.statement = create_empty_statement();
8486 errorf(HERE, "label at end of compound statement");
8487 statement->label.statement = create_invalid_statement();
8489 } else if (token.type == ';') {
8490 /* Eat an empty statement here, to avoid the warning about an empty
8491 * statement after a label. label:; is commonly used to have a label
8492 * before a closing brace. */
8493 statement->label.statement = create_empty_statement();
8496 statement_t *const inner_stmt = parse_statement();
8497 statement->label.statement = inner_stmt;
8498 if (inner_stmt->kind == STATEMENT_DECLARATION) {
8499 errorf(&inner_stmt->base.source_position, "declaration after label");
8503 /* remember the labels in a list for later checking */
8504 if (label_last == NULL) {
8505 label_first = &statement->label;
8507 label_last->next = &statement->label;
8509 label_last = &statement->label;
8516 * Parse an if statement.
8518 static statement_t *parse_if(void)
8522 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
8523 statement->base.source_position = token.source_position;
8525 PUSH_PARENT(statement);
8528 add_anchor_token(')');
8529 statement->ifs.condition = parse_expression();
8530 rem_anchor_token(')');
8533 add_anchor_token(T_else);
8534 statement->ifs.true_statement = parse_statement();
8535 rem_anchor_token(T_else);
8537 if (token.type == T_else) {
8539 statement->ifs.false_statement = parse_statement();
8546 return create_invalid_statement();
8550 * Check that all enums are handled in a switch.
8552 * @param statement the switch statement to check
8554 static void check_enum_cases(const switch_statement_t *statement) {
8555 const type_t *type = skip_typeref(statement->expression->base.type);
8556 if (! is_type_enum(type))
8558 const enum_type_t *enumt = &type->enumt;
8560 /* if we have a default, no warnings */
8561 if (statement->default_label != NULL)
8564 /* FIXME: calculation of value should be done while parsing */
8565 const declaration_t *declaration;
8566 long last_value = -1;
8567 for (declaration = enumt->declaration->next;
8568 declaration != NULL && declaration->storage_class == STORAGE_CLASS_ENUM_ENTRY;
8569 declaration = declaration->next) {
8570 const expression_t *expression = declaration->init.enum_value;
8571 long value = expression != NULL ? fold_constant(expression) : last_value + 1;
8573 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
8574 if (l->expression == NULL)
8576 if (l->first_case <= value && value <= l->last_case) {
8582 warningf(&statement->base.source_position,
8583 "enumeration value '%Y' not handled in switch", declaration->symbol);
8590 * Parse a switch statement.
8592 static statement_t *parse_switch(void)
8596 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
8597 statement->base.source_position = token.source_position;
8599 PUSH_PARENT(statement);
8602 add_anchor_token(')');
8603 expression_t *const expr = parse_expression();
8604 type_t * type = skip_typeref(expr->base.type);
8605 if (is_type_integer(type)) {
8606 type = promote_integer(type);
8607 } else if (is_type_valid(type)) {
8608 errorf(&expr->base.source_position,
8609 "switch quantity is not an integer, but '%T'", type);
8610 type = type_error_type;
8612 statement->switchs.expression = create_implicit_cast(expr, type);
8614 rem_anchor_token(')');
8616 switch_statement_t *rem = current_switch;
8617 current_switch = &statement->switchs;
8618 statement->switchs.body = parse_statement();
8619 current_switch = rem;
8621 if (warning.switch_default &&
8622 statement->switchs.default_label == NULL) {
8623 warningf(&statement->base.source_position, "switch has no default case");
8625 if (warning.switch_enum)
8626 check_enum_cases(&statement->switchs);
8632 return create_invalid_statement();
8635 static statement_t *parse_loop_body(statement_t *const loop)
8637 statement_t *const rem = current_loop;
8638 current_loop = loop;
8640 statement_t *const body = parse_statement();
8647 * Parse a while statement.
8649 static statement_t *parse_while(void)
8653 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
8654 statement->base.source_position = token.source_position;
8656 PUSH_PARENT(statement);
8659 add_anchor_token(')');
8660 statement->whiles.condition = parse_expression();
8661 rem_anchor_token(')');
8664 statement->whiles.body = parse_loop_body(statement);
8670 return create_invalid_statement();
8674 * Parse a do statement.
8676 static statement_t *parse_do(void)
8680 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
8681 statement->base.source_position = token.source_position;
8683 PUSH_PARENT(statement)
8685 add_anchor_token(T_while);
8686 statement->do_while.body = parse_loop_body(statement);
8687 rem_anchor_token(T_while);
8691 add_anchor_token(')');
8692 statement->do_while.condition = parse_expression();
8693 rem_anchor_token(')');
8701 return create_invalid_statement();
8705 * Parse a for statement.
8707 static statement_t *parse_for(void)
8711 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
8712 statement->base.source_position = token.source_position;
8714 PUSH_PARENT(statement);
8716 int top = environment_top();
8717 scope_t *last_scope = scope;
8718 set_scope(&statement->fors.scope);
8721 add_anchor_token(')');
8723 if (token.type != ';') {
8724 if (is_declaration_specifier(&token, false)) {
8725 parse_declaration(record_declaration);
8727 add_anchor_token(';');
8728 expression_t *const init = parse_expression();
8729 statement->fors.initialisation = init;
8730 if (warning.unused_value && !expression_has_effect(init)) {
8731 warningf(&init->base.source_position,
8732 "initialisation of 'for'-statement has no effect");
8734 rem_anchor_token(';');
8741 if (token.type != ';') {
8742 add_anchor_token(';');
8743 statement->fors.condition = parse_expression();
8744 rem_anchor_token(';');
8747 if (token.type != ')') {
8748 expression_t *const step = parse_expression();
8749 statement->fors.step = step;
8750 if (warning.unused_value && !expression_has_effect(step)) {
8751 warningf(&step->base.source_position,
8752 "step of 'for'-statement has no effect");
8755 rem_anchor_token(')');
8757 statement->fors.body = parse_loop_body(statement);
8759 assert(scope == &statement->fors.scope);
8760 set_scope(last_scope);
8761 environment_pop_to(top);
8768 rem_anchor_token(')');
8769 assert(scope == &statement->fors.scope);
8770 set_scope(last_scope);
8771 environment_pop_to(top);
8773 return create_invalid_statement();
8777 * Parse a goto statement.
8779 static statement_t *parse_goto(void)
8783 if (token.type != T_IDENTIFIER) {
8784 parse_error_expected("while parsing goto", T_IDENTIFIER, NULL);
8788 symbol_t *symbol = token.v.symbol;
8791 declaration_t *label = get_label(symbol);
8793 statement_t *statement = allocate_statement_zero(STATEMENT_GOTO);
8794 statement->base.source_position = token.source_position;
8796 statement->gotos.label = label;
8798 /* remember the goto's in a list for later checking */
8799 if (goto_last == NULL) {
8800 goto_first = &statement->gotos;
8802 goto_last->next = &statement->gotos;
8804 goto_last = &statement->gotos;
8810 return create_invalid_statement();
8814 * Parse a continue statement.
8816 static statement_t *parse_continue(void)
8818 statement_t *statement;
8819 if (current_loop == NULL) {
8820 errorf(HERE, "continue statement not within loop");
8821 statement = create_invalid_statement();
8823 statement = allocate_statement_zero(STATEMENT_CONTINUE);
8825 statement->base.source_position = token.source_position;
8833 return create_invalid_statement();
8837 * Parse a break statement.
8839 static statement_t *parse_break(void)
8841 statement_t *statement;
8842 if (current_switch == NULL && current_loop == NULL) {
8843 errorf(HERE, "break statement not within loop or switch");
8844 statement = create_invalid_statement();
8846 statement = allocate_statement_zero(STATEMENT_BREAK);
8848 statement->base.source_position = token.source_position;
8856 return create_invalid_statement();
8860 * Parse a __leave statement.
8862 static statement_t *parse_leave(void)
8864 statement_t *statement;
8865 if (current_try == NULL) {
8866 errorf(HERE, "__leave statement not within __try");
8867 statement = create_invalid_statement();
8869 statement = allocate_statement_zero(STATEMENT_LEAVE);
8871 statement->base.source_position = token.source_position;
8879 return create_invalid_statement();
8883 * Check if a given declaration represents a local variable.
8885 static bool is_local_var_declaration(const declaration_t *declaration)
8887 switch ((storage_class_tag_t) declaration->storage_class) {
8888 case STORAGE_CLASS_AUTO:
8889 case STORAGE_CLASS_REGISTER: {
8890 const type_t *type = skip_typeref(declaration->type);
8891 if (is_type_function(type)) {
8903 * Check if a given declaration represents a variable.
8905 static bool is_var_declaration(const declaration_t *declaration)
8907 if (declaration->storage_class == STORAGE_CLASS_TYPEDEF)
8910 const type_t *type = skip_typeref(declaration->type);
8911 return !is_type_function(type);
8915 * Check if a given expression represents a local variable.
8917 static bool is_local_variable(const expression_t *expression)
8919 if (expression->base.kind != EXPR_REFERENCE) {
8922 const declaration_t *declaration = expression->reference.declaration;
8923 return is_local_var_declaration(declaration);
8927 * Check if a given expression represents a local variable and
8928 * return its declaration then, else return NULL.
8930 declaration_t *expr_is_variable(const expression_t *expression)
8932 if (expression->base.kind != EXPR_REFERENCE) {
8935 declaration_t *declaration = expression->reference.declaration;
8936 if (is_var_declaration(declaration))
8942 * Parse a return statement.
8944 static statement_t *parse_return(void)
8946 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
8947 statement->base.source_position = token.source_position;
8951 expression_t *return_value = NULL;
8952 if (token.type != ';') {
8953 return_value = parse_expression();
8957 const type_t *const func_type = current_function->type;
8958 assert(is_type_function(func_type));
8959 type_t *const return_type = skip_typeref(func_type->function.return_type);
8961 if (return_value != NULL) {
8962 type_t *return_value_type = skip_typeref(return_value->base.type);
8964 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID)
8965 && !is_type_atomic(return_value_type, ATOMIC_TYPE_VOID)) {
8966 warningf(&statement->base.source_position,
8967 "'return' with a value, in function returning void");
8968 return_value = NULL;
8970 assign_error_t error = semantic_assign(return_type, return_value);
8971 report_assign_error(error, return_type, return_value, "'return'",
8972 &statement->base.source_position);
8973 return_value = create_implicit_cast(return_value, return_type);
8975 /* check for returning address of a local var */
8976 if (return_value != NULL &&
8977 return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
8978 const expression_t *expression = return_value->unary.value;
8979 if (is_local_variable(expression)) {
8980 warningf(&statement->base.source_position,
8981 "function returns address of local variable");
8985 if (!is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
8986 warningf(&statement->base.source_position,
8987 "'return' without value, in function returning non-void");
8990 statement->returns.value = return_value;
8994 return create_invalid_statement();
8998 * Parse a declaration statement.
9000 static statement_t *parse_declaration_statement(void)
9002 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9004 statement->base.source_position = token.source_position;
9006 declaration_t *before = last_declaration;
9007 parse_declaration(record_declaration);
9009 if (before == NULL) {
9010 statement->declaration.declarations_begin = scope->declarations;
9012 statement->declaration.declarations_begin = before->next;
9014 statement->declaration.declarations_end = last_declaration;
9020 * Parse an expression statement, ie. expr ';'.
9022 static statement_t *parse_expression_statement(void)
9024 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
9026 statement->base.source_position = token.source_position;
9027 expression_t *const expr = parse_expression();
9028 statement->expression.expression = expr;
9034 return create_invalid_statement();
9038 * Parse a microsoft __try { } __finally { } or
9039 * __try{ } __except() { }
9041 static statement_t *parse_ms_try_statment(void)
9043 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
9045 statement->base.source_position = token.source_position;
9048 ms_try_statement_t *rem = current_try;
9049 current_try = &statement->ms_try;
9050 statement->ms_try.try_statement = parse_compound_statement(false);
9053 if (token.type == T___except) {
9056 add_anchor_token(')');
9057 expression_t *const expr = parse_expression();
9058 type_t * type = skip_typeref(expr->base.type);
9059 if (is_type_integer(type)) {
9060 type = promote_integer(type);
9061 } else if (is_type_valid(type)) {
9062 errorf(&expr->base.source_position,
9063 "__expect expression is not an integer, but '%T'", type);
9064 type = type_error_type;
9066 statement->ms_try.except_expression = create_implicit_cast(expr, type);
9067 rem_anchor_token(')');
9069 statement->ms_try.final_statement = parse_compound_statement(false);
9070 } else if (token.type == T__finally) {
9072 statement->ms_try.final_statement = parse_compound_statement(false);
9074 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
9075 return create_invalid_statement();
9079 return create_invalid_statement();
9082 static statement_t *parse_empty_statement(void)
9084 if (warning.empty_statement) {
9085 warningf(HERE, "statement is empty");
9087 statement_t *const statement = create_empty_statement();
9093 * Parse a statement.
9094 * There's also parse_statement() which additionally checks for
9095 * "statement has no effect" warnings
9097 static statement_t *intern_parse_statement(void)
9099 statement_t *statement = NULL;
9101 /* declaration or statement */
9102 add_anchor_token(';');
9103 switch (token.type) {
9105 if (look_ahead(1)->type == ':') {
9106 statement = parse_label_statement();
9107 } else if (is_typedef_symbol(token.v.symbol)) {
9108 statement = parse_declaration_statement();
9110 statement = parse_expression_statement();
9114 case T___extension__:
9115 /* This can be a prefix to a declaration or an expression statement.
9116 * We simply eat it now and parse the rest with tail recursion. */
9119 } while (token.type == T___extension__);
9120 statement = parse_statement();
9124 statement = parse_declaration_statement();
9127 case ';': statement = parse_empty_statement(); break;
9128 case '{': statement = parse_compound_statement(false); break;
9129 case T___leave: statement = parse_leave(); break;
9130 case T___try: statement = parse_ms_try_statment(); break;
9131 case T_asm: statement = parse_asm_statement(); break;
9132 case T_break: statement = parse_break(); break;
9133 case T_case: statement = parse_case_statement(); break;
9134 case T_continue: statement = parse_continue(); break;
9135 case T_default: statement = parse_default_statement(); break;
9136 case T_do: statement = parse_do(); break;
9137 case T_for: statement = parse_for(); break;
9138 case T_goto: statement = parse_goto(); break;
9139 case T_if: statement = parse_if (); break;
9140 case T_return: statement = parse_return(); break;
9141 case T_switch: statement = parse_switch(); break;
9142 case T_while: statement = parse_while(); break;
9143 default: statement = parse_expression_statement(); break;
9145 rem_anchor_token(';');
9147 assert(statement != NULL
9148 && statement->base.source_position.input_name != NULL);
9154 * parse a statement and emits "statement has no effect" warning if needed
9155 * (This is really a wrapper around intern_parse_statement with check for 1
9156 * single warning. It is needed, because for statement expressions we have
9157 * to avoid the warning on the last statement)
9159 static statement_t *parse_statement(void)
9161 statement_t *statement = intern_parse_statement();
9163 if (statement->kind == STATEMENT_EXPRESSION && warning.unused_value) {
9164 expression_t *expression = statement->expression.expression;
9165 if (!expression_has_effect(expression)) {
9166 warningf(&expression->base.source_position,
9167 "statement has no effect");
9175 * Parse a compound statement.
9177 static statement_t *parse_compound_statement(bool inside_expression_statement)
9179 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
9180 statement->base.source_position = token.source_position;
9182 PUSH_PARENT(statement);
9185 add_anchor_token('}');
9187 int top = environment_top();
9188 scope_t *last_scope = scope;
9189 set_scope(&statement->compound.scope);
9191 statement_t **anchor = &statement->compound.statements;
9192 bool only_decls_so_far = true;
9193 while (token.type != '}' && token.type != T_EOF) {
9194 statement_t *sub_statement = intern_parse_statement();
9195 if (is_invalid_statement(sub_statement)) {
9196 /* an error occurred. if we are at an anchor, return */
9202 if (warning.declaration_after_statement) {
9203 if (sub_statement->kind != STATEMENT_DECLARATION) {
9204 only_decls_so_far = false;
9205 } else if (!only_decls_so_far) {
9206 warningf(&sub_statement->base.source_position,
9207 "ISO C90 forbids mixed declarations and code");
9211 *anchor = sub_statement;
9213 while (sub_statement->base.next != NULL)
9214 sub_statement = sub_statement->base.next;
9216 anchor = &sub_statement->base.next;
9219 if (token.type == '}') {
9222 errorf(&statement->base.source_position,
9223 "end of file while looking for closing '}'");
9226 /* look over all statements again to produce no effect warnings */
9227 if (warning.unused_value) {
9228 statement_t *sub_statement = statement->compound.statements;
9229 for( ; sub_statement != NULL; sub_statement = sub_statement->base.next) {
9230 if (sub_statement->kind != STATEMENT_EXPRESSION)
9232 /* don't emit a warning for the last expression in an expression
9233 * statement as it has always an effect */
9234 if (inside_expression_statement && sub_statement->base.next == NULL)
9237 expression_t *expression = sub_statement->expression.expression;
9238 if (!expression_has_effect(expression)) {
9239 warningf(&expression->base.source_position,
9240 "statement has no effect");
9246 rem_anchor_token('}');
9247 assert(scope == &statement->compound.scope);
9248 set_scope(last_scope);
9249 environment_pop_to(top);
9256 * Initialize builtin types.
9258 static void initialize_builtin_types(void)
9260 type_intmax_t = make_global_typedef("__intmax_t__", type_long_long);
9261 type_size_t = make_global_typedef("__SIZE_TYPE__", type_unsigned_long);
9262 type_ssize_t = make_global_typedef("__SSIZE_TYPE__", type_long);
9263 type_ptrdiff_t = make_global_typedef("__PTRDIFF_TYPE__", type_long);
9264 type_uintmax_t = make_global_typedef("__uintmax_t__", type_unsigned_long_long);
9265 type_uptrdiff_t = make_global_typedef("__UPTRDIFF_TYPE__", type_unsigned_long);
9266 type_wchar_t = make_global_typedef("__WCHAR_TYPE__", opt_short_wchar_t ? type_unsigned_short : type_int);
9267 type_wint_t = make_global_typedef("__WINT_TYPE__", type_int);
9269 type_intmax_t_ptr = make_pointer_type(type_intmax_t, TYPE_QUALIFIER_NONE);
9270 type_ptrdiff_t_ptr = make_pointer_type(type_ptrdiff_t, TYPE_QUALIFIER_NONE);
9271 type_ssize_t_ptr = make_pointer_type(type_ssize_t, TYPE_QUALIFIER_NONE);
9272 type_wchar_t_ptr = make_pointer_type(type_wchar_t, TYPE_QUALIFIER_NONE);
9274 /* const version of wchar_t */
9275 type_const_wchar_t = allocate_type_zero(TYPE_TYPEDEF, &builtin_source_position);
9276 type_const_wchar_t->typedeft.declaration = type_wchar_t->typedeft.declaration;
9277 type_const_wchar_t->base.qualifiers |= TYPE_QUALIFIER_CONST;
9279 type_const_wchar_t_ptr = make_pointer_type(type_const_wchar_t, TYPE_QUALIFIER_NONE);
9283 * Check for unused global static functions and variables
9285 static void check_unused_globals(void)
9287 if (!warning.unused_function && !warning.unused_variable)
9290 for (const declaration_t *decl = global_scope->declarations; decl != NULL; decl = decl->next) {
9292 decl->modifiers & DM_UNUSED ||
9293 decl->modifiers & DM_USED ||
9294 decl->storage_class != STORAGE_CLASS_STATIC)
9297 type_t *const type = decl->type;
9299 if (is_type_function(skip_typeref(type))) {
9300 if (!warning.unused_function || decl->is_inline)
9303 s = (decl->init.statement != NULL ? "defined" : "declared");
9305 if (!warning.unused_variable)
9311 warningf(&decl->source_position, "'%#T' %s but not used",
9312 type, decl->symbol, s);
9316 static void parse_global_asm(void)
9321 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
9322 statement->base.source_position = token.source_position;
9323 statement->asms.asm_text = parse_string_literals();
9324 statement->base.next = unit->global_asm;
9325 unit->global_asm = statement;
9334 * Parse a translation unit.
9336 static void parse_translation_unit(void)
9338 for (;;) switch (token.type) {
9341 case T___extension__:
9342 parse_external_declaration();
9353 /* TODO error in strict mode */
9354 warningf(HERE, "stray ';' outside of function");
9359 errorf(HERE, "stray %K outside of function", &token);
9360 if (token.type == '(' || token.type == '{' || token.type == '[')
9361 eat_until_matching_token(token.type);
9370 * @return the translation unit or NULL if errors occurred.
9372 void start_parsing(void)
9374 environment_stack = NEW_ARR_F(stack_entry_t, 0);
9375 label_stack = NEW_ARR_F(stack_entry_t, 0);
9376 diagnostic_count = 0;
9380 type_set_output(stderr);
9381 ast_set_output(stderr);
9383 assert(unit == NULL);
9384 unit = allocate_ast_zero(sizeof(unit[0]));
9386 assert(global_scope == NULL);
9387 global_scope = &unit->scope;
9389 assert(scope == NULL);
9390 set_scope(&unit->scope);
9392 initialize_builtin_types();
9395 translation_unit_t *finish_parsing(void)
9397 assert(scope == &unit->scope);
9399 last_declaration = NULL;
9401 assert(global_scope == &unit->scope);
9402 check_unused_globals();
9403 global_scope = NULL;
9405 DEL_ARR_F(environment_stack);
9406 DEL_ARR_F(label_stack);
9408 translation_unit_t *result = unit;
9415 lookahead_bufpos = 0;
9416 for(int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
9419 parse_translation_unit();
9423 * Initialize the parser.
9425 void init_parser(void)
9428 /* add predefined symbols for extended-decl-modifier */
9429 sym_align = symbol_table_insert("align");
9430 sym_allocate = symbol_table_insert("allocate");
9431 sym_dllimport = symbol_table_insert("dllimport");
9432 sym_dllexport = symbol_table_insert("dllexport");
9433 sym_naked = symbol_table_insert("naked");
9434 sym_noinline = symbol_table_insert("noinline");
9435 sym_noreturn = symbol_table_insert("noreturn");
9436 sym_nothrow = symbol_table_insert("nothrow");
9437 sym_novtable = symbol_table_insert("novtable");
9438 sym_property = symbol_table_insert("property");
9439 sym_get = symbol_table_insert("get");
9440 sym_put = symbol_table_insert("put");
9441 sym_selectany = symbol_table_insert("selectany");
9442 sym_thread = symbol_table_insert("thread");
9443 sym_uuid = symbol_table_insert("uuid");
9444 sym_deprecated = symbol_table_insert("deprecated");
9445 sym_restrict = symbol_table_insert("restrict");
9446 sym_noalias = symbol_table_insert("noalias");
9448 memset(token_anchor_set, 0, sizeof(token_anchor_set));
9450 init_expression_parsers();
9451 obstack_init(&temp_obst);
9453 symbol_t *const va_list_sym = symbol_table_insert("__builtin_va_list");
9454 type_valist = create_builtin_type(va_list_sym, type_void_ptr);
9458 * Terminate the parser.
9460 void exit_parser(void)
9462 obstack_free(&temp_obst, NULL);