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"
37 #include "walk_statements.h"
39 #include "adt/bitfiddle.h"
40 #include "adt/error.h"
41 #include "adt/array.h"
43 /** if wchar_t is equal to unsigned short. */
44 bool opt_short_wchar_t =
51 //#define PRINT_TOKENS
52 #define MAX_LOOKAHEAD 2
55 declaration_t *old_declaration;
57 unsigned short namespc;
60 typedef struct argument_list_t argument_list_t;
61 struct argument_list_t {
63 argument_list_t *next;
66 typedef struct gnu_attribute_t gnu_attribute_t;
67 struct gnu_attribute_t {
68 gnu_attribute_kind_t kind; /**< The kind of the GNU attribute. */
69 gnu_attribute_t *next;
70 bool invalid; /**< Set if this attribute had argument errors, */
71 bool have_arguments; /**< True, if this attribute has arguments. */
75 atomic_type_kind_t akind;
76 long argument; /**< Single argument. */
77 argument_list_t *arguments; /**< List of argument expressions. */
81 typedef struct declaration_specifiers_t declaration_specifiers_t;
82 struct declaration_specifiers_t {
83 source_position_t source_position;
84 unsigned char declared_storage_class;
85 unsigned char alignment; /**< Alignment, 0 if not set. */
86 unsigned int is_inline : 1;
87 unsigned int deprecated : 1;
88 decl_modifiers_t modifiers; /**< declaration modifiers */
89 gnu_attribute_t *gnu_attributes; /**< list of GNU attributes */
90 const char *deprecated_string; /**< can be set if declaration was marked deprecated. */
91 symbol_t *get_property_sym; /**< the name of the get property if set. */
92 symbol_t *put_property_sym; /**< the name of the put property if set. */
97 * An environment for parsing initializers (and compound literals).
99 typedef struct parse_initializer_env_t {
100 type_t *type; /**< the type of the initializer. In case of an
101 array type with unspecified size this gets
102 adjusted to the actual size. */
103 declaration_t *declaration; /**< the declaration that is initialized if any */
104 bool must_be_constant;
105 } parse_initializer_env_t;
107 typedef declaration_t* (*parsed_declaration_func) (declaration_t *declaration, bool is_definition);
109 /** The current token. */
110 static token_t token;
111 /** The lookahead ring-buffer. */
112 static token_t lookahead_buffer[MAX_LOOKAHEAD];
113 /** Position of the next token in the lookahead buffer. */
114 static int lookahead_bufpos;
115 static stack_entry_t *environment_stack = NULL;
116 static stack_entry_t *label_stack = NULL;
117 static stack_entry_t *local_label_stack = NULL;
118 /** The global file scope. */
119 static scope_t *file_scope = NULL;
120 /** The current scope. */
121 static scope_t *scope = NULL;
122 static declaration_t *last_declaration = NULL;
123 /** Point to the current function declaration if inside a function. */
124 static declaration_t *current_function = NULL;
125 static declaration_t *current_init_decl = NULL;
126 static switch_statement_t *current_switch = NULL;
127 static statement_t *current_loop = NULL;
128 static statement_t *current_parent = NULL;
129 static ms_try_statement_t *current_try = NULL;
130 static goto_statement_t *goto_first = NULL;
131 static goto_statement_t *goto_last = NULL;
132 static label_statement_t *label_first = NULL;
133 static label_statement_t *label_last = NULL;
134 /** current translation unit. */
135 static translation_unit_t *unit = NULL;
136 /** true if we are in a type property context (evaluation only for type. */
137 static bool in_type_prop = false;
138 /** true in we are in a __extension__ context. */
139 static bool in_gcc_extension = false;
140 static struct obstack temp_obst;
143 #define PUSH_PARENT(stmt) \
144 statement_t *const prev_parent = current_parent; \
145 ((void)(current_parent = (stmt)))
146 #define POP_PARENT ((void)(current_parent = prev_parent))
148 static source_position_t null_position = { NULL, 0 };
150 /** special symbol used for anonymous entities. */
151 static const symbol_t *sym_anonymous = NULL;
153 /* symbols for Microsoft extended-decl-modifier */
154 static const symbol_t *sym_align = NULL;
155 static const symbol_t *sym_allocate = NULL;
156 static const symbol_t *sym_dllimport = NULL;
157 static const symbol_t *sym_dllexport = NULL;
158 static const symbol_t *sym_naked = NULL;
159 static const symbol_t *sym_noinline = NULL;
160 static const symbol_t *sym_noreturn = NULL;
161 static const symbol_t *sym_nothrow = NULL;
162 static const symbol_t *sym_novtable = NULL;
163 static const symbol_t *sym_property = NULL;
164 static const symbol_t *sym_get = NULL;
165 static const symbol_t *sym_put = NULL;
166 static const symbol_t *sym_selectany = NULL;
167 static const symbol_t *sym_thread = NULL;
168 static const symbol_t *sym_uuid = NULL;
169 static const symbol_t *sym_deprecated = NULL;
170 static const symbol_t *sym_restrict = NULL;
171 static const symbol_t *sym_noalias = NULL;
173 /** The token anchor set */
174 static unsigned char token_anchor_set[T_LAST_TOKEN];
176 /** The current source position. */
177 #define HERE (&token.source_position)
179 /** true if we are in GCC mode. */
180 #define GNU_MODE ((c_mode & _GNUC) || in_gcc_extension)
182 static type_t *type_valist;
184 static statement_t *parse_compound_statement(bool inside_expression_statement);
185 static statement_t *parse_statement(void);
187 static expression_t *parse_sub_expression(unsigned precedence);
188 static expression_t *parse_expression(void);
189 static type_t *parse_typename(void);
191 static void parse_compound_type_entries(declaration_t *compound_declaration);
192 static declaration_t *parse_declarator(
193 const declaration_specifiers_t *specifiers, bool may_be_abstract);
194 static declaration_t *record_declaration(declaration_t *declaration, bool is_definition);
196 static void semantic_comparison(binary_expression_t *expression);
198 #define STORAGE_CLASSES \
206 #define TYPE_QUALIFIERS \
211 case T__forceinline: \
212 case T___attribute__:
214 #ifdef PROVIDE_COMPLEX
215 #define COMPLEX_SPECIFIERS \
217 #define IMAGINARY_SPECIFIERS \
220 #define COMPLEX_SPECIFIERS
221 #define IMAGINARY_SPECIFIERS
224 #define TYPE_SPECIFIERS \
239 case T___builtin_va_list: \
244 #define DECLARATION_START \
249 #define TYPENAME_START \
254 * Allocate an AST node with given size and
255 * initialize all fields with zero.
257 static void *allocate_ast_zero(size_t size)
259 void *res = allocate_ast(size);
260 memset(res, 0, size);
264 static declaration_t *allocate_declaration_zero(void)
266 declaration_t *declaration = allocate_ast_zero(sizeof(declaration_t));
267 declaration->type = type_error_type;
268 declaration->alignment = 0;
273 * Returns the size of a statement node.
275 * @param kind the statement kind
277 static size_t get_statement_struct_size(statement_kind_t kind)
279 static const size_t sizes[] = {
280 [STATEMENT_INVALID] = sizeof(invalid_statement_t),
281 [STATEMENT_EMPTY] = sizeof(empty_statement_t),
282 [STATEMENT_COMPOUND] = sizeof(compound_statement_t),
283 [STATEMENT_RETURN] = sizeof(return_statement_t),
284 [STATEMENT_DECLARATION] = sizeof(declaration_statement_t),
285 [STATEMENT_IF] = sizeof(if_statement_t),
286 [STATEMENT_SWITCH] = sizeof(switch_statement_t),
287 [STATEMENT_EXPRESSION] = sizeof(expression_statement_t),
288 [STATEMENT_CONTINUE] = sizeof(statement_base_t),
289 [STATEMENT_BREAK] = sizeof(statement_base_t),
290 [STATEMENT_GOTO] = sizeof(goto_statement_t),
291 [STATEMENT_LABEL] = sizeof(label_statement_t),
292 [STATEMENT_CASE_LABEL] = sizeof(case_label_statement_t),
293 [STATEMENT_WHILE] = sizeof(while_statement_t),
294 [STATEMENT_DO_WHILE] = sizeof(do_while_statement_t),
295 [STATEMENT_FOR] = sizeof(for_statement_t),
296 [STATEMENT_ASM] = sizeof(asm_statement_t),
297 [STATEMENT_MS_TRY] = sizeof(ms_try_statement_t),
298 [STATEMENT_LEAVE] = sizeof(leave_statement_t)
300 assert(kind <= sizeof(sizes) / sizeof(sizes[0]));
301 assert(sizes[kind] != 0);
306 * Returns the size of an expression node.
308 * @param kind the expression kind
310 static size_t get_expression_struct_size(expression_kind_t kind)
312 static const size_t sizes[] = {
313 [EXPR_INVALID] = sizeof(expression_base_t),
314 [EXPR_REFERENCE] = sizeof(reference_expression_t),
315 [EXPR_CONST] = sizeof(const_expression_t),
316 [EXPR_CHARACTER_CONSTANT] = sizeof(const_expression_t),
317 [EXPR_WIDE_CHARACTER_CONSTANT] = sizeof(const_expression_t),
318 [EXPR_STRING_LITERAL] = sizeof(string_literal_expression_t),
319 [EXPR_WIDE_STRING_LITERAL] = sizeof(wide_string_literal_expression_t),
320 [EXPR_COMPOUND_LITERAL] = sizeof(compound_literal_expression_t),
321 [EXPR_CALL] = sizeof(call_expression_t),
322 [EXPR_UNARY_FIRST] = sizeof(unary_expression_t),
323 [EXPR_BINARY_FIRST] = sizeof(binary_expression_t),
324 [EXPR_CONDITIONAL] = sizeof(conditional_expression_t),
325 [EXPR_SELECT] = sizeof(select_expression_t),
326 [EXPR_ARRAY_ACCESS] = sizeof(array_access_expression_t),
327 [EXPR_SIZEOF] = sizeof(typeprop_expression_t),
328 [EXPR_ALIGNOF] = sizeof(typeprop_expression_t),
329 [EXPR_CLASSIFY_TYPE] = sizeof(classify_type_expression_t),
330 [EXPR_FUNCNAME] = sizeof(funcname_expression_t),
331 [EXPR_BUILTIN_SYMBOL] = sizeof(builtin_symbol_expression_t),
332 [EXPR_BUILTIN_CONSTANT_P] = sizeof(builtin_constant_expression_t),
333 [EXPR_BUILTIN_PREFETCH] = sizeof(builtin_prefetch_expression_t),
334 [EXPR_OFFSETOF] = sizeof(offsetof_expression_t),
335 [EXPR_VA_START] = sizeof(va_start_expression_t),
336 [EXPR_VA_ARG] = sizeof(va_arg_expression_t),
337 [EXPR_STATEMENT] = sizeof(statement_expression_t),
338 [EXPR_LABEL_ADDRESS] = sizeof(label_address_expression_t),
340 if (kind >= EXPR_UNARY_FIRST && kind <= EXPR_UNARY_LAST) {
341 return sizes[EXPR_UNARY_FIRST];
343 if (kind >= EXPR_BINARY_FIRST && kind <= EXPR_BINARY_LAST) {
344 return sizes[EXPR_BINARY_FIRST];
346 assert(kind <= sizeof(sizes) / sizeof(sizes[0]));
347 assert(sizes[kind] != 0);
352 * Allocate a statement node of given kind and initialize all
355 static statement_t *allocate_statement_zero(statement_kind_t kind)
357 size_t size = get_statement_struct_size(kind);
358 statement_t *res = allocate_ast_zero(size);
360 res->base.kind = kind;
361 res->base.parent = current_parent;
362 res->base.source_position = token.source_position;
367 * Allocate an expression node of given kind and initialize all
370 static expression_t *allocate_expression_zero(expression_kind_t kind)
372 size_t size = get_expression_struct_size(kind);
373 expression_t *res = allocate_ast_zero(size);
375 res->base.kind = kind;
376 res->base.type = type_error_type;
381 * Creates a new invalid expression.
383 static expression_t *create_invalid_expression(void)
385 expression_t *expression = allocate_expression_zero(EXPR_INVALID);
386 expression->base.source_position = token.source_position;
391 * Creates a new invalid statement.
393 static statement_t *create_invalid_statement(void)
395 return allocate_statement_zero(STATEMENT_INVALID);
399 * Allocate a new empty statement.
401 static statement_t *create_empty_statement(void)
403 return allocate_statement_zero(STATEMENT_EMPTY);
407 * Returns the size of a type node.
409 * @param kind the type kind
411 static size_t get_type_struct_size(type_kind_t kind)
413 static const size_t sizes[] = {
414 [TYPE_ATOMIC] = sizeof(atomic_type_t),
415 [TYPE_COMPLEX] = sizeof(complex_type_t),
416 [TYPE_IMAGINARY] = sizeof(imaginary_type_t),
417 [TYPE_BITFIELD] = sizeof(bitfield_type_t),
418 [TYPE_COMPOUND_STRUCT] = sizeof(compound_type_t),
419 [TYPE_COMPOUND_UNION] = sizeof(compound_type_t),
420 [TYPE_ENUM] = sizeof(enum_type_t),
421 [TYPE_FUNCTION] = sizeof(function_type_t),
422 [TYPE_POINTER] = sizeof(pointer_type_t),
423 [TYPE_ARRAY] = sizeof(array_type_t),
424 [TYPE_BUILTIN] = sizeof(builtin_type_t),
425 [TYPE_TYPEDEF] = sizeof(typedef_type_t),
426 [TYPE_TYPEOF] = sizeof(typeof_type_t),
428 assert(sizeof(sizes) / sizeof(sizes[0]) == (int) TYPE_TYPEOF + 1);
429 assert(kind <= TYPE_TYPEOF);
430 assert(sizes[kind] != 0);
435 * Allocate a type node of given kind and initialize all
438 * @param kind type kind to allocate
439 * @param source_position the source position of the type definition
441 static type_t *allocate_type_zero(type_kind_t kind, const source_position_t *source_position)
443 size_t size = get_type_struct_size(kind);
444 type_t *res = obstack_alloc(type_obst, size);
445 memset(res, 0, size);
447 res->base.kind = kind;
448 res->base.source_position = *source_position;
453 * Returns the size of an initializer node.
455 * @param kind the initializer kind
457 static size_t get_initializer_size(initializer_kind_t kind)
459 static const size_t sizes[] = {
460 [INITIALIZER_VALUE] = sizeof(initializer_value_t),
461 [INITIALIZER_STRING] = sizeof(initializer_string_t),
462 [INITIALIZER_WIDE_STRING] = sizeof(initializer_wide_string_t),
463 [INITIALIZER_LIST] = sizeof(initializer_list_t),
464 [INITIALIZER_DESIGNATOR] = sizeof(initializer_designator_t)
466 assert(kind < sizeof(sizes) / sizeof(*sizes));
467 assert(sizes[kind] != 0);
472 * Allocate an initializer node of given kind and initialize all
475 static initializer_t *allocate_initializer_zero(initializer_kind_t kind)
477 initializer_t *result = allocate_ast_zero(get_initializer_size(kind));
484 * Free a type from the type obstack.
486 static void free_type(void *type)
488 obstack_free(type_obst, type);
492 * Returns the index of the top element of the environment stack.
494 static size_t environment_top(void)
496 return ARR_LEN(environment_stack);
500 * Returns the index of the top element of the global label stack.
502 static size_t label_top(void)
504 return ARR_LEN(label_stack);
508 * Returns the index of the top element of the local label stack.
510 static size_t local_label_top(void)
512 return ARR_LEN(local_label_stack);
516 * Return the next token.
518 static inline void next_token(void)
520 token = lookahead_buffer[lookahead_bufpos];
521 lookahead_buffer[lookahead_bufpos] = lexer_token;
524 lookahead_bufpos = (lookahead_bufpos+1) % MAX_LOOKAHEAD;
527 print_token(stderr, &token);
528 fprintf(stderr, "\n");
533 * Return the next token with a given lookahead.
535 static inline const token_t *look_ahead(int num)
537 assert(num > 0 && num <= MAX_LOOKAHEAD);
538 int pos = (lookahead_bufpos+num-1) % MAX_LOOKAHEAD;
539 return &lookahead_buffer[pos];
543 * Adds a token to the token anchor set (a multi-set).
545 static void add_anchor_token(int token_type)
547 assert(0 <= token_type && token_type < T_LAST_TOKEN);
548 ++token_anchor_set[token_type];
551 static int save_and_reset_anchor_state(int token_type)
553 assert(0 <= token_type && token_type < T_LAST_TOKEN);
554 int count = token_anchor_set[token_type];
555 token_anchor_set[token_type] = 0;
559 static void restore_anchor_state(int token_type, int count)
561 assert(0 <= token_type && token_type < T_LAST_TOKEN);
562 token_anchor_set[token_type] = count;
566 * Remove a token from the token anchor set (a multi-set).
568 static void rem_anchor_token(int token_type)
570 assert(0 <= token_type && token_type < T_LAST_TOKEN);
571 assert(token_anchor_set[token_type] != 0);
572 --token_anchor_set[token_type];
575 static bool at_anchor(void)
579 return token_anchor_set[token.type];
583 * Eat tokens until a matching token is found.
585 static void eat_until_matching_token(int type)
589 case '(': end_token = ')'; break;
590 case '{': end_token = '}'; break;
591 case '[': end_token = ']'; break;
592 default: end_token = type; break;
595 unsigned parenthesis_count = 0;
596 unsigned brace_count = 0;
597 unsigned bracket_count = 0;
598 while (token.type != end_token ||
599 parenthesis_count != 0 ||
601 bracket_count != 0) {
602 switch (token.type) {
604 case '(': ++parenthesis_count; break;
605 case '{': ++brace_count; break;
606 case '[': ++bracket_count; break;
609 if (parenthesis_count > 0)
619 if (bracket_count > 0)
622 if (token.type == end_token &&
623 parenthesis_count == 0 &&
637 * Eat input tokens until an anchor is found.
639 static void eat_until_anchor(void)
641 while (token_anchor_set[token.type] == 0) {
642 if (token.type == '(' || token.type == '{' || token.type == '[')
643 eat_until_matching_token(token.type);
648 static void eat_block(void)
650 eat_until_matching_token('{');
651 if (token.type == '}')
655 #define eat(token_type) do { assert(token.type == token_type); next_token(); } while (0)
658 * Report a parse error because an expected token was not found.
661 #if defined __GNUC__ && __GNUC__ >= 4
662 __attribute__((sentinel))
664 void parse_error_expected(const char *message, ...)
666 if (message != NULL) {
667 errorf(HERE, "%s", message);
670 va_start(ap, message);
671 errorf(HERE, "got %K, expected %#k", &token, &ap, ", ");
676 * Report a type error.
678 static void type_error(const char *msg, const source_position_t *source_position,
681 errorf(source_position, "%s, but found type '%T'", msg, type);
685 * Report an incompatible type.
687 static void type_error_incompatible(const char *msg,
688 const source_position_t *source_position, type_t *type1, type_t *type2)
690 errorf(source_position, "%s, incompatible types: '%T' - '%T'",
695 * Expect the the current token is the expected token.
696 * If not, generate an error, eat the current statement,
697 * and goto the end_error label.
699 #define expect(expected) \
701 if (UNLIKELY(token.type != (expected))) { \
702 parse_error_expected(NULL, (expected), NULL); \
703 add_anchor_token(expected); \
704 eat_until_anchor(); \
705 if (token.type == expected) \
707 rem_anchor_token(expected); \
713 static void scope_push(scope_t *new_scope)
716 scope->last_declaration = last_declaration;
717 new_scope->depth = scope->depth + 1;
719 new_scope->parent = scope;
722 last_declaration = new_scope->last_declaration;
725 static void scope_pop(void)
727 scope->last_declaration = last_declaration;
728 scope = scope->parent;
729 last_declaration = scope->last_declaration;
733 * Search a symbol in a given namespace and returns its declaration or
734 * NULL if this symbol was not found.
736 static declaration_t *get_declaration(const symbol_t *const symbol,
737 const namespace_t namespc)
739 declaration_t *declaration = symbol->declaration;
740 for( ; declaration != NULL; declaration = declaration->symbol_next) {
741 if (declaration->namespc == namespc)
749 * pushs an environment_entry on the environment stack and links the
750 * corresponding symbol to the new entry
752 static void stack_push(stack_entry_t **stack_ptr, declaration_t *declaration)
754 symbol_t *symbol = declaration->symbol;
755 namespace_t namespc = (namespace_t) declaration->namespc;
757 /* replace/add declaration into declaration list of the symbol */
758 declaration_t **anchor;
760 for (anchor = &symbol->declaration;; anchor = &iter->symbol_next) {
765 /* replace an entry? */
766 if (iter->namespc == namespc) {
767 declaration->symbol_next = iter->symbol_next;
771 *anchor = declaration;
773 /* remember old declaration */
775 entry.symbol = symbol;
776 entry.old_declaration = iter;
777 entry.namespc = (unsigned short) namespc;
778 ARR_APP1(stack_entry_t, *stack_ptr, entry);
782 * Push a declaration on the environment stack.
784 * @param declaration the declaration
786 static void environment_push(declaration_t *declaration)
788 assert(declaration->source_position.input_name != NULL);
789 assert(declaration->parent_scope != NULL);
790 stack_push(&environment_stack, declaration);
794 * Push a declaration on the global label stack.
796 * @param declaration the declaration
798 static void label_push(declaration_t *declaration)
800 declaration->parent_scope = ¤t_function->scope;
801 stack_push(&label_stack, declaration);
805 * Push a declaration of the local label stack.
807 * @param declaration the declaration
809 static void local_label_push(declaration_t *declaration)
811 assert(declaration->parent_scope != NULL);
812 stack_push(&local_label_stack, declaration);
816 * pops symbols from the environment stack until @p new_top is the top element
818 static void stack_pop_to(stack_entry_t **stack_ptr, size_t new_top)
820 stack_entry_t *stack = *stack_ptr;
821 size_t top = ARR_LEN(stack);
824 assert(new_top <= top);
828 for(i = top; i > new_top; --i) {
829 stack_entry_t *entry = &stack[i - 1];
831 declaration_t *old_declaration = entry->old_declaration;
832 symbol_t *symbol = entry->symbol;
833 namespace_t namespc = (namespace_t)entry->namespc;
835 /* replace/remove declaration */
836 declaration_t **anchor;
838 for (anchor = &symbol->declaration;; anchor = &iter->symbol_next) {
840 assert(iter != NULL);
841 /* replace an entry? */
842 if (iter->namespc == namespc)
846 /* Not all declarations adhere scopes (e.g. jump labels), so this
847 * correction is necessary */
848 if (old_declaration != NULL) {
849 old_declaration->symbol_next = iter->symbol_next;
850 *anchor = old_declaration;
852 *anchor = iter->symbol_next;
856 ARR_SHRINKLEN(*stack_ptr, (int) new_top);
860 * Pop all entries from the environment stack until the new_top
863 * @param new_top the new stack top
865 static void environment_pop_to(size_t new_top)
867 stack_pop_to(&environment_stack, new_top);
871 * Pop all entries from the global label stack until the new_top
874 * @param new_top the new stack top
876 static void label_pop_to(size_t new_top)
878 stack_pop_to(&label_stack, new_top);
882 * Pop all entries from the local label stack until the new_top
885 * @param new_top the new stack top
887 static void local_label_pop_to(size_t new_top)
889 stack_pop_to(&local_label_stack, new_top);
893 static int get_akind_rank(atomic_type_kind_t akind)
898 static int get_rank(const type_t *type)
900 assert(!is_typeref(type));
901 /* The C-standard allows promoting enums to int or unsigned int (see § 7.2.2
902 * and esp. footnote 108). However we can't fold constants (yet), so we
903 * can't decide whether unsigned int is possible, while int always works.
904 * (unsigned int would be preferable when possible... for stuff like
905 * struct { enum { ... } bla : 4; } ) */
906 if (type->kind == TYPE_ENUM)
907 return get_akind_rank(ATOMIC_TYPE_INT);
909 assert(type->kind == TYPE_ATOMIC);
910 return get_akind_rank(type->atomic.akind);
913 static type_t *promote_integer(type_t *type)
915 if (type->kind == TYPE_BITFIELD)
916 type = type->bitfield.base_type;
918 if (get_rank(type) < get_akind_rank(ATOMIC_TYPE_INT))
925 * Create a cast expression.
927 * @param expression the expression to cast
928 * @param dest_type the destination type
930 static expression_t *create_cast_expression(expression_t *expression,
933 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST_IMPLICIT);
935 cast->unary.value = expression;
936 cast->base.type = dest_type;
942 * Check if a given expression represents the 0 pointer constant.
944 static bool is_null_pointer_constant(const expression_t *expression)
946 /* skip void* cast */
947 if (expression->kind == EXPR_UNARY_CAST
948 || expression->kind == EXPR_UNARY_CAST_IMPLICIT) {
949 expression = expression->unary.value;
952 /* TODO: not correct yet, should be any constant integer expression
953 * which evaluates to 0 */
954 if (expression->kind != EXPR_CONST)
957 type_t *const type = skip_typeref(expression->base.type);
958 if (!is_type_integer(type))
961 return expression->conste.v.int_value == 0;
965 * Create an implicit cast expression.
967 * @param expression the expression to cast
968 * @param dest_type the destination type
970 static expression_t *create_implicit_cast(expression_t *expression,
973 type_t *const source_type = expression->base.type;
975 if (source_type == dest_type)
978 return create_cast_expression(expression, dest_type);
981 typedef enum assign_error_t {
983 ASSIGN_ERROR_INCOMPATIBLE,
984 ASSIGN_ERROR_POINTER_QUALIFIER_MISSING,
985 ASSIGN_WARNING_POINTER_INCOMPATIBLE,
986 ASSIGN_WARNING_POINTER_FROM_INT,
987 ASSIGN_WARNING_INT_FROM_POINTER
990 static void report_assign_error(assign_error_t error, type_t *orig_type_left,
991 const expression_t *const right,
993 const source_position_t *source_position)
995 type_t *const orig_type_right = right->base.type;
996 type_t *const type_left = skip_typeref(orig_type_left);
997 type_t *const type_right = skip_typeref(orig_type_right);
1000 case ASSIGN_SUCCESS:
1002 case ASSIGN_ERROR_INCOMPATIBLE:
1003 errorf(source_position,
1004 "destination type '%T' in %s is incompatible with type '%T'",
1005 orig_type_left, context, orig_type_right);
1008 case ASSIGN_ERROR_POINTER_QUALIFIER_MISSING: {
1009 type_t *points_to_left
1010 = skip_typeref(type_left->pointer.points_to);
1011 type_t *points_to_right
1012 = skip_typeref(type_right->pointer.points_to);
1014 /* the left type has all qualifiers from the right type */
1015 unsigned missing_qualifiers
1016 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
1017 warningf(source_position,
1018 "destination type '%T' in %s from type '%T' lacks qualifiers '%Q' in pointer target type",
1019 orig_type_left, context, orig_type_right, missing_qualifiers);
1023 case ASSIGN_WARNING_POINTER_INCOMPATIBLE:
1024 warningf(source_position,
1025 "destination type '%T' in %s is incompatible with '%E' of type '%T'",
1026 orig_type_left, context, right, orig_type_right);
1029 case ASSIGN_WARNING_POINTER_FROM_INT:
1030 warningf(source_position,
1031 "%s makes pointer '%T' from integer '%T' without a cast",
1032 context, orig_type_left, orig_type_right);
1035 case ASSIGN_WARNING_INT_FROM_POINTER:
1036 warningf(source_position,
1037 "%s makes integer '%T' from pointer '%T' without a cast",
1038 context, orig_type_left, orig_type_right);
1042 panic("invalid error value");
1046 /** Implements the rules from § 6.5.16.1 */
1047 static assign_error_t semantic_assign(type_t *orig_type_left,
1048 const expression_t *const right)
1050 type_t *const orig_type_right = right->base.type;
1051 type_t *const type_left = skip_typeref(orig_type_left);
1052 type_t *const type_right = skip_typeref(orig_type_right);
1054 if (is_type_pointer(type_left)) {
1055 if (is_null_pointer_constant(right)) {
1056 return ASSIGN_SUCCESS;
1057 } else if (is_type_pointer(type_right)) {
1058 type_t *points_to_left
1059 = skip_typeref(type_left->pointer.points_to);
1060 type_t *points_to_right
1061 = skip_typeref(type_right->pointer.points_to);
1062 assign_error_t res = ASSIGN_SUCCESS;
1064 /* the left type has all qualifiers from the right type */
1065 unsigned missing_qualifiers
1066 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
1067 if (missing_qualifiers != 0) {
1068 res = ASSIGN_ERROR_POINTER_QUALIFIER_MISSING;
1071 points_to_left = get_unqualified_type(points_to_left);
1072 points_to_right = get_unqualified_type(points_to_right);
1074 if (is_type_atomic(points_to_left, ATOMIC_TYPE_VOID) ||
1075 is_type_atomic(points_to_right, ATOMIC_TYPE_VOID)) {
1079 if (!types_compatible(points_to_left, points_to_right)) {
1080 return ASSIGN_WARNING_POINTER_INCOMPATIBLE;
1084 } else if (is_type_integer(type_right)) {
1085 return ASSIGN_WARNING_POINTER_FROM_INT;
1087 } else if ((is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) ||
1088 (is_type_atomic(type_left, ATOMIC_TYPE_BOOL)
1089 && is_type_pointer(type_right))) {
1090 return ASSIGN_SUCCESS;
1091 } else if ((is_type_compound(type_left) && is_type_compound(type_right))
1092 || (is_type_builtin(type_left) && is_type_builtin(type_right))) {
1093 type_t *const unqual_type_left = get_unqualified_type(type_left);
1094 type_t *const unqual_type_right = get_unqualified_type(type_right);
1095 if (types_compatible(unqual_type_left, unqual_type_right)) {
1096 return ASSIGN_SUCCESS;
1098 } else if (is_type_integer(type_left) && is_type_pointer(type_right)) {
1099 return ASSIGN_WARNING_INT_FROM_POINTER;
1102 if (!is_type_valid(type_left) || !is_type_valid(type_right))
1103 return ASSIGN_SUCCESS;
1105 return ASSIGN_ERROR_INCOMPATIBLE;
1108 static expression_t *parse_constant_expression(void)
1110 /* start parsing at precedence 7 (conditional expression) */
1111 expression_t *result = parse_sub_expression(7);
1113 if (!is_constant_expression(result)) {
1114 errorf(&result->base.source_position,
1115 "expression '%E' is not constant\n", result);
1121 static expression_t *parse_assignment_expression(void)
1123 /* start parsing at precedence 2 (assignment expression) */
1124 return parse_sub_expression(2);
1127 static type_t *make_global_typedef(const char *name, type_t *type)
1129 symbol_t *const symbol = symbol_table_insert(name);
1131 declaration_t *const declaration = allocate_declaration_zero();
1132 declaration->namespc = NAMESPACE_NORMAL;
1133 declaration->storage_class = STORAGE_CLASS_TYPEDEF;
1134 declaration->declared_storage_class = STORAGE_CLASS_TYPEDEF;
1135 declaration->type = type;
1136 declaration->symbol = symbol;
1137 declaration->source_position = builtin_source_position;
1138 declaration->implicit = true;
1140 record_declaration(declaration, false);
1142 type_t *typedef_type = allocate_type_zero(TYPE_TYPEDEF, &builtin_source_position);
1143 typedef_type->typedeft.declaration = declaration;
1145 return typedef_type;
1148 static string_t parse_string_literals(void)
1150 assert(token.type == T_STRING_LITERAL);
1151 string_t result = token.v.string;
1155 while (token.type == T_STRING_LITERAL) {
1156 result = concat_strings(&result, &token.v.string);
1163 static const char *const gnu_attribute_names[GNU_AK_LAST] = {
1164 [GNU_AK_CONST] = "const",
1165 [GNU_AK_VOLATILE] = "volatile",
1166 [GNU_AK_CDECL] = "cdecl",
1167 [GNU_AK_STDCALL] = "stdcall",
1168 [GNU_AK_FASTCALL] = "fastcall",
1169 [GNU_AK_DEPRECATED] = "deprecated",
1170 [GNU_AK_NOINLINE] = "noinline",
1171 [GNU_AK_NORETURN] = "noreturn",
1172 [GNU_AK_NAKED] = "naked",
1173 [GNU_AK_PURE] = "pure",
1174 [GNU_AK_ALWAYS_INLINE] = "always_inline",
1175 [GNU_AK_MALLOC] = "malloc",
1176 [GNU_AK_WEAK] = "weak",
1177 [GNU_AK_CONSTRUCTOR] = "constructor",
1178 [GNU_AK_DESTRUCTOR] = "destructor",
1179 [GNU_AK_NOTHROW] = "nothrow",
1180 [GNU_AK_TRANSPARENT_UNION] = "transparent_union",
1181 [GNU_AK_COMMON] = "common",
1182 [GNU_AK_NOCOMMON] = "nocommon",
1183 [GNU_AK_PACKED] = "packed",
1184 [GNU_AK_SHARED] = "shared",
1185 [GNU_AK_NOTSHARED] = "notshared",
1186 [GNU_AK_USED] = "used",
1187 [GNU_AK_UNUSED] = "unused",
1188 [GNU_AK_NO_INSTRUMENT_FUNCTION] = "no_instrument_function",
1189 [GNU_AK_WARN_UNUSED_RESULT] = "warn_unused_result",
1190 [GNU_AK_LONGCALL] = "longcall",
1191 [GNU_AK_SHORTCALL] = "shortcall",
1192 [GNU_AK_LONG_CALL] = "long_call",
1193 [GNU_AK_SHORT_CALL] = "short_call",
1194 [GNU_AK_FUNCTION_VECTOR] = "function_vector",
1195 [GNU_AK_INTERRUPT] = "interrupt",
1196 [GNU_AK_INTERRUPT_HANDLER] = "interrupt_handler",
1197 [GNU_AK_NMI_HANDLER] = "nmi_handler",
1198 [GNU_AK_NESTING] = "nesting",
1199 [GNU_AK_NEAR] = "near",
1200 [GNU_AK_FAR] = "far",
1201 [GNU_AK_SIGNAL] = "signal",
1202 [GNU_AK_EIGTHBIT_DATA] = "eightbit_data",
1203 [GNU_AK_TINY_DATA] = "tiny_data",
1204 [GNU_AK_SAVEALL] = "saveall",
1205 [GNU_AK_FLATTEN] = "flatten",
1206 [GNU_AK_SSEREGPARM] = "sseregparm",
1207 [GNU_AK_EXTERNALLY_VISIBLE] = "externally_visible",
1208 [GNU_AK_RETURN_TWICE] = "return_twice",
1209 [GNU_AK_MAY_ALIAS] = "may_alias",
1210 [GNU_AK_MS_STRUCT] = "ms_struct",
1211 [GNU_AK_GCC_STRUCT] = "gcc_struct",
1212 [GNU_AK_DLLIMPORT] = "dllimport",
1213 [GNU_AK_DLLEXPORT] = "dllexport",
1214 [GNU_AK_ALIGNED] = "aligned",
1215 [GNU_AK_ALIAS] = "alias",
1216 [GNU_AK_SECTION] = "section",
1217 [GNU_AK_FORMAT] = "format",
1218 [GNU_AK_FORMAT_ARG] = "format_arg",
1219 [GNU_AK_WEAKREF] = "weakref",
1220 [GNU_AK_NONNULL] = "nonnull",
1221 [GNU_AK_TLS_MODEL] = "tls_model",
1222 [GNU_AK_VISIBILITY] = "visibility",
1223 [GNU_AK_REGPARM] = "regparm",
1224 [GNU_AK_MODE] = "mode",
1225 [GNU_AK_MODEL] = "model",
1226 [GNU_AK_TRAP_EXIT] = "trap_exit",
1227 [GNU_AK_SP_SWITCH] = "sp_switch",
1228 [GNU_AK_SENTINEL] = "sentinel"
1232 * compare two string, ignoring double underscores on the second.
1234 static int strcmp_underscore(const char *s1, const char *s2)
1236 if (s2[0] == '_' && s2[1] == '_') {
1237 size_t len2 = strlen(s2);
1238 size_t len1 = strlen(s1);
1239 if (len1 == len2-4 && s2[len2-2] == '_' && s2[len2-1] == '_') {
1240 return strncmp(s1, s2+2, len2-4);
1244 return strcmp(s1, s2);
1248 * Allocate a new gnu temporal attribute.
1250 static gnu_attribute_t *allocate_gnu_attribute(gnu_attribute_kind_t kind)
1252 gnu_attribute_t *attribute = obstack_alloc(&temp_obst, sizeof(*attribute));
1253 attribute->kind = kind;
1254 attribute->next = NULL;
1255 attribute->invalid = false;
1256 attribute->have_arguments = false;
1262 * parse one constant expression argument.
1264 static void parse_gnu_attribute_const_arg(gnu_attribute_t *attribute)
1266 expression_t *expression;
1267 add_anchor_token(')');
1268 expression = parse_constant_expression();
1269 rem_anchor_token(')');
1271 attribute->u.argument = fold_constant(expression);
1274 attribute->invalid = true;
1278 * parse a list of constant expressions arguments.
1280 static void parse_gnu_attribute_const_arg_list(gnu_attribute_t *attribute)
1282 argument_list_t **list = &attribute->u.arguments;
1283 argument_list_t *entry;
1284 expression_t *expression;
1285 add_anchor_token(')');
1286 add_anchor_token(',');
1288 expression = parse_constant_expression();
1289 entry = obstack_alloc(&temp_obst, sizeof(entry));
1290 entry->argument = fold_constant(expression);
1293 list = &entry->next;
1294 if (token.type != ',')
1298 rem_anchor_token(',');
1299 rem_anchor_token(')');
1303 attribute->invalid = true;
1307 * parse one string literal argument.
1309 static void parse_gnu_attribute_string_arg(gnu_attribute_t *attribute,
1312 add_anchor_token('(');
1313 if (token.type != T_STRING_LITERAL) {
1314 parse_error_expected("while parsing attribute directive",
1315 T_STRING_LITERAL, NULL);
1318 *string = parse_string_literals();
1319 rem_anchor_token('(');
1323 attribute->invalid = true;
1327 * parse one tls model.
1329 static void parse_gnu_attribute_tls_model_arg(gnu_attribute_t *attribute)
1331 static const char *const tls_models[] = {
1337 string_t string = { NULL, 0 };
1338 parse_gnu_attribute_string_arg(attribute, &string);
1339 if (string.begin != NULL) {
1340 for(size_t i = 0; i < 4; ++i) {
1341 if (strcmp(tls_models[i], string.begin) == 0) {
1342 attribute->u.value = i;
1346 errorf(HERE, "'%s' is an unrecognized tls model", string.begin);
1348 attribute->invalid = true;
1352 * parse one tls model.
1354 static void parse_gnu_attribute_visibility_arg(gnu_attribute_t *attribute)
1356 static const char *const visibilities[] = {
1362 string_t string = { NULL, 0 };
1363 parse_gnu_attribute_string_arg(attribute, &string);
1364 if (string.begin != NULL) {
1365 for(size_t i = 0; i < 4; ++i) {
1366 if (strcmp(visibilities[i], string.begin) == 0) {
1367 attribute->u.value = i;
1371 errorf(HERE, "'%s' is an unrecognized visibility", string.begin);
1373 attribute->invalid = true;
1377 * parse one (code) model.
1379 static void parse_gnu_attribute_model_arg(gnu_attribute_t *attribute)
1381 static const char *const visibilities[] = {
1386 string_t string = { NULL, 0 };
1387 parse_gnu_attribute_string_arg(attribute, &string);
1388 if (string.begin != NULL) {
1389 for(int i = 0; i < 3; ++i) {
1390 if (strcmp(visibilities[i], string.begin) == 0) {
1391 attribute->u.value = i;
1395 errorf(HERE, "'%s' is an unrecognized model", string.begin);
1397 attribute->invalid = true;
1400 static void parse_gnu_attribute_mode_arg(gnu_attribute_t *attribute)
1402 /* TODO: find out what is allowed here... */
1404 /* at least: byte, word, pointer, list of machine modes
1405 * __XXX___ is interpreted as XXX */
1406 add_anchor_token(')');
1408 if (token.type != T_IDENTIFIER) {
1409 expect(T_IDENTIFIER);
1412 /* This isn't really correct, the backend should provide a list of machine
1413 * specific modes (according to gcc philosophy that is...) */
1414 const char *symbol_str = token.v.symbol->string;
1415 if (strcmp_underscore("QI", symbol_str) == 0 ||
1416 strcmp_underscore("byte", symbol_str) == 0) {
1417 attribute->u.akind = ATOMIC_TYPE_CHAR;
1418 } else if (strcmp_underscore("HI", symbol_str) == 0) {
1419 attribute->u.akind = ATOMIC_TYPE_SHORT;
1420 } else if (strcmp_underscore("SI", symbol_str) == 0
1421 || strcmp_underscore("word", symbol_str) == 0
1422 || strcmp_underscore("pointer", symbol_str) == 0) {
1423 attribute->u.akind = ATOMIC_TYPE_INT;
1424 } else if (strcmp_underscore("DI", symbol_str) == 0) {
1425 attribute->u.akind = ATOMIC_TYPE_LONGLONG;
1427 warningf(HERE, "ignoring unknown mode '%s'", symbol_str);
1428 attribute->invalid = true;
1432 rem_anchor_token(')');
1436 attribute->invalid = true;
1440 * parse one interrupt argument.
1442 static void parse_gnu_attribute_interrupt_arg(gnu_attribute_t *attribute)
1444 static const char *const interrupts[] = {
1451 string_t string = { NULL, 0 };
1452 parse_gnu_attribute_string_arg(attribute, &string);
1453 if (string.begin != NULL) {
1454 for(size_t i = 0; i < 5; ++i) {
1455 if (strcmp(interrupts[i], string.begin) == 0) {
1456 attribute->u.value = i;
1460 errorf(HERE, "'%s' is not an interrupt", string.begin);
1462 attribute->invalid = true;
1466 * parse ( identifier, const expression, const expression )
1468 static void parse_gnu_attribute_format_args(gnu_attribute_t *attribute)
1470 static const char *const format_names[] = {
1478 if (token.type != T_IDENTIFIER) {
1479 parse_error_expected("while parsing format attribute directive", T_IDENTIFIER, NULL);
1482 const char *name = token.v.symbol->string;
1483 for(i = 0; i < 4; ++i) {
1484 if (strcmp_underscore(format_names[i], name) == 0)
1488 if (warning.attribute)
1489 warningf(HERE, "'%s' is an unrecognized format function type", name);
1494 add_anchor_token(')');
1495 add_anchor_token(',');
1496 parse_constant_expression();
1497 rem_anchor_token(',');
1498 rem_anchor_token(')');
1501 add_anchor_token(')');
1502 parse_constant_expression();
1503 rem_anchor_token(')');
1507 attribute->u.value = true;
1510 static void check_no_argument(gnu_attribute_t *attribute, const char *name)
1512 if (!attribute->have_arguments)
1515 /* should have no arguments */
1516 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1517 eat_until_matching_token('(');
1518 /* we have already consumed '(', so we stop before ')', eat it */
1520 attribute->invalid = true;
1524 * Parse one GNU attribute.
1526 * Note that attribute names can be specified WITH or WITHOUT
1527 * double underscores, ie const or __const__.
1529 * The following attributes are parsed without arguments
1554 * no_instrument_function
1555 * warn_unused_result
1572 * externally_visible
1580 * The following attributes are parsed with arguments
1581 * aligned( const expression )
1582 * alias( string literal )
1583 * section( string literal )
1584 * format( identifier, const expression, const expression )
1585 * format_arg( const expression )
1586 * tls_model( string literal )
1587 * visibility( string literal )
1588 * regparm( const expression )
1589 * model( string leteral )
1590 * trap_exit( const expression )
1591 * sp_switch( string literal )
1593 * The following attributes might have arguments
1594 * weak_ref( string literal )
1595 * non_null( const expression // ',' )
1596 * interrupt( string literal )
1597 * sentinel( constant expression )
1599 static decl_modifiers_t parse_gnu_attribute(gnu_attribute_t **attributes)
1601 gnu_attribute_t *head = *attributes;
1602 gnu_attribute_t *last = *attributes;
1603 decl_modifiers_t modifiers = 0;
1604 gnu_attribute_t *attribute;
1606 eat(T___attribute__);
1610 if (token.type != ')') {
1611 /* find the end of the list */
1613 while (last->next != NULL)
1617 /* non-empty attribute list */
1620 if (token.type == T_const) {
1622 } else if (token.type == T_volatile) {
1624 } else if (token.type == T_cdecl) {
1625 /* __attribute__((cdecl)), WITH ms mode */
1627 } else if (token.type == T_IDENTIFIER) {
1628 const symbol_t *sym = token.v.symbol;
1631 parse_error_expected("while parsing GNU attribute", T_IDENTIFIER, NULL);
1638 for(i = 0; i < GNU_AK_LAST; ++i) {
1639 if (strcmp_underscore(gnu_attribute_names[i], name) == 0)
1642 gnu_attribute_kind_t kind = (gnu_attribute_kind_t)i;
1645 if (kind == GNU_AK_LAST) {
1646 if (warning.attribute)
1647 warningf(HERE, "'%s' attribute directive ignored", name);
1649 /* skip possible arguments */
1650 if (token.type == '(') {
1651 eat_until_matching_token(')');
1654 /* check for arguments */
1655 attribute = allocate_gnu_attribute(kind);
1656 if (token.type == '(') {
1658 if (token.type == ')') {
1659 /* empty args are allowed */
1662 attribute->have_arguments = true;
1666 case GNU_AK_VOLATILE:
1671 case GNU_AK_NOCOMMON:
1673 case GNU_AK_NOTSHARED:
1674 case GNU_AK_NO_INSTRUMENT_FUNCTION:
1675 case GNU_AK_WARN_UNUSED_RESULT:
1676 case GNU_AK_LONGCALL:
1677 case GNU_AK_SHORTCALL:
1678 case GNU_AK_LONG_CALL:
1679 case GNU_AK_SHORT_CALL:
1680 case GNU_AK_FUNCTION_VECTOR:
1681 case GNU_AK_INTERRUPT_HANDLER:
1682 case GNU_AK_NMI_HANDLER:
1683 case GNU_AK_NESTING:
1687 case GNU_AK_EIGTHBIT_DATA:
1688 case GNU_AK_TINY_DATA:
1689 case GNU_AK_SAVEALL:
1690 case GNU_AK_FLATTEN:
1691 case GNU_AK_SSEREGPARM:
1692 case GNU_AK_EXTERNALLY_VISIBLE:
1693 case GNU_AK_RETURN_TWICE:
1694 case GNU_AK_MAY_ALIAS:
1695 case GNU_AK_MS_STRUCT:
1696 case GNU_AK_GCC_STRUCT:
1699 case GNU_AK_CDECL: modifiers |= DM_CDECL; goto no_arg;
1700 case GNU_AK_FASTCALL: modifiers |= DM_FASTCALL; goto no_arg;
1701 case GNU_AK_STDCALL: modifiers |= DM_STDCALL; goto no_arg;
1702 case GNU_AK_UNUSED: modifiers |= DM_UNUSED; goto no_arg;
1703 case GNU_AK_USED: modifiers |= DM_USED; goto no_arg;
1704 case GNU_AK_PURE: modifiers |= DM_PURE; goto no_arg;
1705 case GNU_AK_CONST: modifiers |= DM_CONST; goto no_arg;
1706 case GNU_AK_ALWAYS_INLINE: modifiers |= DM_FORCEINLINE; goto no_arg;
1707 case GNU_AK_DLLIMPORT: modifiers |= DM_DLLIMPORT; goto no_arg;
1708 case GNU_AK_DLLEXPORT: modifiers |= DM_DLLEXPORT; goto no_arg;
1709 case GNU_AK_PACKED: modifiers |= DM_PACKED; goto no_arg;
1710 case GNU_AK_NOINLINE: modifiers |= DM_NOINLINE; goto no_arg;
1711 case GNU_AK_NORETURN: modifiers |= DM_NORETURN; goto no_arg;
1712 case GNU_AK_NOTHROW: modifiers |= DM_NOTHROW; goto no_arg;
1713 case GNU_AK_TRANSPARENT_UNION: modifiers |= DM_TRANSPARENT_UNION; goto no_arg;
1714 case GNU_AK_CONSTRUCTOR: modifiers |= DM_CONSTRUCTOR; goto no_arg;
1715 case GNU_AK_DESTRUCTOR: modifiers |= DM_DESTRUCTOR; goto no_arg;
1716 case GNU_AK_DEPRECATED: modifiers |= DM_DEPRECATED; goto no_arg;
1718 case GNU_AK_ALIGNED:
1719 /* __align__ may be used without an argument */
1720 if (attribute->have_arguments) {
1721 parse_gnu_attribute_const_arg(attribute);
1725 case GNU_AK_FORMAT_ARG:
1726 case GNU_AK_REGPARM:
1727 case GNU_AK_TRAP_EXIT:
1728 if (!attribute->have_arguments) {
1729 /* should have arguments */
1730 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1731 attribute->invalid = true;
1733 parse_gnu_attribute_const_arg(attribute);
1736 case GNU_AK_SECTION:
1737 case GNU_AK_SP_SWITCH:
1738 if (!attribute->have_arguments) {
1739 /* should have arguments */
1740 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1741 attribute->invalid = true;
1743 parse_gnu_attribute_string_arg(attribute, &attribute->u.string);
1746 if (!attribute->have_arguments) {
1747 /* should have arguments */
1748 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1749 attribute->invalid = true;
1751 parse_gnu_attribute_format_args(attribute);
1753 case GNU_AK_WEAKREF:
1754 /* may have one string argument */
1755 if (attribute->have_arguments)
1756 parse_gnu_attribute_string_arg(attribute, &attribute->u.string);
1758 case GNU_AK_NONNULL:
1759 if (attribute->have_arguments)
1760 parse_gnu_attribute_const_arg_list(attribute);
1762 case GNU_AK_TLS_MODEL:
1763 if (!attribute->have_arguments) {
1764 /* should have arguments */
1765 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1767 parse_gnu_attribute_tls_model_arg(attribute);
1769 case GNU_AK_VISIBILITY:
1770 if (!attribute->have_arguments) {
1771 /* should have arguments */
1772 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1774 parse_gnu_attribute_visibility_arg(attribute);
1777 if (!attribute->have_arguments) {
1778 /* should have arguments */
1779 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1781 parse_gnu_attribute_model_arg(attribute);
1785 if (!attribute->have_arguments) {
1786 /* should have arguments */
1787 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1789 parse_gnu_attribute_mode_arg(attribute);
1792 case GNU_AK_INTERRUPT:
1793 /* may have one string argument */
1794 if (attribute->have_arguments)
1795 parse_gnu_attribute_interrupt_arg(attribute);
1797 case GNU_AK_SENTINEL:
1798 /* may have one string argument */
1799 if (attribute->have_arguments)
1800 parse_gnu_attribute_const_arg(attribute);
1803 /* already handled */
1807 check_no_argument(attribute, name);
1810 if (attribute != NULL) {
1812 last->next = attribute;
1815 head = last = attribute;
1819 if (token.type != ',')
1833 * Parse GNU attributes.
1835 static decl_modifiers_t parse_attributes(gnu_attribute_t **attributes)
1837 decl_modifiers_t modifiers = 0;
1840 switch(token.type) {
1841 case T___attribute__:
1842 modifiers |= parse_gnu_attribute(attributes);
1848 if (token.type != T_STRING_LITERAL) {
1849 parse_error_expected("while parsing assembler attribute",
1850 T_STRING_LITERAL, NULL);
1851 eat_until_matching_token('(');
1854 parse_string_literals();
1859 case T_cdecl: modifiers |= DM_CDECL; break;
1860 case T__fastcall: modifiers |= DM_FASTCALL; break;
1861 case T__stdcall: modifiers |= DM_STDCALL; break;
1864 /* TODO record modifier */
1865 warningf(HERE, "Ignoring declaration modifier %K", &token);
1869 default: return modifiers;
1876 static void mark_decls_read(expression_t *expr, declaration_t *lhs_decl);
1878 static declaration_t *determine_lhs_decl(expression_t *const expr, declaration_t *lhs_decl)
1880 switch (expr->kind) {
1881 case EXPR_REFERENCE: {
1882 declaration_t *const decl = expr->reference.declaration;
1886 case EXPR_ARRAY_ACCESS: {
1887 expression_t *const ref = expr->array_access.array_ref;
1888 declaration_t * decl = NULL;
1889 if (is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1890 decl = determine_lhs_decl(ref, lhs_decl);
1893 mark_decls_read(expr->select.compound, lhs_decl);
1895 mark_decls_read(expr->array_access.index, lhs_decl);
1900 if (is_type_compound(skip_typeref(expr->base.type))) {
1901 return determine_lhs_decl(expr->select.compound, lhs_decl);
1903 mark_decls_read(expr->select.compound, lhs_decl);
1908 case EXPR_UNARY_DEREFERENCE: {
1909 expression_t *const val = expr->unary.value;
1910 if (val->kind == EXPR_UNARY_TAKE_ADDRESS) {
1912 return determine_lhs_decl(val->unary.value, lhs_decl);
1914 mark_decls_read(val, NULL);
1920 mark_decls_read(expr, NULL);
1925 #define DECL_ANY ((declaration_t*)-1)
1928 * Mark declarations, which are read. This is used to deted variables, which
1932 * x is not marked as "read", because it is only read to calculate its own new
1936 * x and y are not detected as "not read", because multiple variables are
1939 static void mark_decls_read(expression_t *const expr, declaration_t *lhs_decl)
1941 switch (expr->kind) {
1942 case EXPR_REFERENCE: {
1943 declaration_t *const decl = expr->reference.declaration;
1944 if (lhs_decl != decl && lhs_decl != DECL_ANY)
1950 // TODO respect pure/const
1951 mark_decls_read(expr->call.function, NULL);
1952 for (call_argument_t *arg = expr->call.arguments; arg != NULL; arg = arg->next) {
1953 mark_decls_read(arg->expression, NULL);
1957 case EXPR_CONDITIONAL:
1958 // TODO lhs_decl should depend on whether true/false have an effect
1959 mark_decls_read(expr->conditional.condition, NULL);
1960 if (expr->conditional.true_expression != NULL)
1961 mark_decls_read(expr->conditional.true_expression, lhs_decl);
1962 mark_decls_read(expr->conditional.false_expression, lhs_decl);
1966 if (lhs_decl == DECL_ANY && !is_type_compound(skip_typeref(expr->base.type)))
1968 mark_decls_read(expr->select.compound, lhs_decl);
1971 case EXPR_ARRAY_ACCESS: {
1972 expression_t *const ref = expr->array_access.array_ref;
1973 mark_decls_read(ref, lhs_decl);
1974 lhs_decl = determine_lhs_decl(ref, lhs_decl);
1975 mark_decls_read(expr->array_access.index, lhs_decl);
1980 mark_decls_read(expr->va_arge.ap, lhs_decl);
1983 case EXPR_UNARY_CAST:
1984 /* Special case: Use void cast to mark a variable as "read" */
1985 if (is_type_atomic(skip_typeref(expr->base.type), ATOMIC_TYPE_VOID))
1989 case EXPR_UNARY_DEREFERENCE:
1990 if (lhs_decl == DECL_ANY)
1994 case EXPR_UNARY_NEGATE:
1995 case EXPR_UNARY_PLUS:
1996 case EXPR_UNARY_BITWISE_NEGATE:
1997 case EXPR_UNARY_NOT:
1998 case EXPR_UNARY_TAKE_ADDRESS:
1999 case EXPR_UNARY_POSTFIX_INCREMENT:
2000 case EXPR_UNARY_POSTFIX_DECREMENT:
2001 case EXPR_UNARY_PREFIX_INCREMENT:
2002 case EXPR_UNARY_PREFIX_DECREMENT:
2003 case EXPR_UNARY_CAST_IMPLICIT:
2004 case EXPR_UNARY_ASSUME:
2006 mark_decls_read(expr->unary.value, lhs_decl);
2009 case EXPR_BINARY_ADD:
2010 case EXPR_BINARY_SUB:
2011 case EXPR_BINARY_MUL:
2012 case EXPR_BINARY_DIV:
2013 case EXPR_BINARY_MOD:
2014 case EXPR_BINARY_EQUAL:
2015 case EXPR_BINARY_NOTEQUAL:
2016 case EXPR_BINARY_LESS:
2017 case EXPR_BINARY_LESSEQUAL:
2018 case EXPR_BINARY_GREATER:
2019 case EXPR_BINARY_GREATEREQUAL:
2020 case EXPR_BINARY_BITWISE_AND:
2021 case EXPR_BINARY_BITWISE_OR:
2022 case EXPR_BINARY_BITWISE_XOR:
2023 case EXPR_BINARY_LOGICAL_AND:
2024 case EXPR_BINARY_LOGICAL_OR:
2025 case EXPR_BINARY_SHIFTLEFT:
2026 case EXPR_BINARY_SHIFTRIGHT:
2027 case EXPR_BINARY_COMMA:
2028 case EXPR_BINARY_ISGREATER:
2029 case EXPR_BINARY_ISGREATEREQUAL:
2030 case EXPR_BINARY_ISLESS:
2031 case EXPR_BINARY_ISLESSEQUAL:
2032 case EXPR_BINARY_ISLESSGREATER:
2033 case EXPR_BINARY_ISUNORDERED:
2034 mark_decls_read(expr->binary.left, lhs_decl);
2035 mark_decls_read(expr->binary.right, lhs_decl);
2038 case EXPR_BINARY_ASSIGN:
2039 case EXPR_BINARY_MUL_ASSIGN:
2040 case EXPR_BINARY_DIV_ASSIGN:
2041 case EXPR_BINARY_MOD_ASSIGN:
2042 case EXPR_BINARY_ADD_ASSIGN:
2043 case EXPR_BINARY_SUB_ASSIGN:
2044 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2045 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2046 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2047 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2048 case EXPR_BINARY_BITWISE_OR_ASSIGN: {
2049 if (lhs_decl == DECL_ANY)
2051 lhs_decl = determine_lhs_decl(expr->binary.left, lhs_decl);
2052 mark_decls_read(expr->binary.right, lhs_decl);
2057 determine_lhs_decl(expr->va_starte.ap, lhs_decl);
2063 case EXPR_CHARACTER_CONSTANT:
2064 case EXPR_WIDE_CHARACTER_CONSTANT:
2065 case EXPR_STRING_LITERAL:
2066 case EXPR_WIDE_STRING_LITERAL:
2067 case EXPR_COMPOUND_LITERAL: // TODO init?
2069 case EXPR_CLASSIFY_TYPE:
2072 case EXPR_BUILTIN_SYMBOL:
2073 case EXPR_BUILTIN_CONSTANT_P:
2074 case EXPR_BUILTIN_PREFETCH:
2076 case EXPR_STATEMENT: // TODO
2077 case EXPR_LABEL_ADDRESS:
2078 case EXPR_BINARY_BUILTIN_EXPECT:
2082 panic("unhandled expression");
2085 static designator_t *parse_designation(void)
2087 designator_t *result = NULL;
2088 designator_t *last = NULL;
2091 designator_t *designator;
2092 switch(token.type) {
2094 designator = allocate_ast_zero(sizeof(designator[0]));
2095 designator->source_position = token.source_position;
2097 add_anchor_token(']');
2098 designator->array_index = parse_constant_expression();
2099 rem_anchor_token(']');
2103 designator = allocate_ast_zero(sizeof(designator[0]));
2104 designator->source_position = token.source_position;
2106 if (token.type != T_IDENTIFIER) {
2107 parse_error_expected("while parsing designator",
2108 T_IDENTIFIER, NULL);
2111 designator->symbol = token.v.symbol;
2119 assert(designator != NULL);
2121 last->next = designator;
2123 result = designator;
2131 static initializer_t *initializer_from_string(array_type_t *type,
2132 const string_t *const string)
2134 /* TODO: check len vs. size of array type */
2137 initializer_t *initializer = allocate_initializer_zero(INITIALIZER_STRING);
2138 initializer->string.string = *string;
2143 static initializer_t *initializer_from_wide_string(array_type_t *const type,
2144 wide_string_t *const string)
2146 /* TODO: check len vs. size of array type */
2149 initializer_t *const initializer =
2150 allocate_initializer_zero(INITIALIZER_WIDE_STRING);
2151 initializer->wide_string.string = *string;
2157 * Build an initializer from a given expression.
2159 static initializer_t *initializer_from_expression(type_t *orig_type,
2160 expression_t *expression)
2162 /* TODO check that expression is a constant expression */
2164 /* § 6.7.8.14/15 char array may be initialized by string literals */
2165 type_t *type = skip_typeref(orig_type);
2166 type_t *expr_type_orig = expression->base.type;
2167 type_t *expr_type = skip_typeref(expr_type_orig);
2168 if (is_type_array(type) && expr_type->kind == TYPE_POINTER) {
2169 array_type_t *const array_type = &type->array;
2170 type_t *const element_type = skip_typeref(array_type->element_type);
2172 if (element_type->kind == TYPE_ATOMIC) {
2173 atomic_type_kind_t akind = element_type->atomic.akind;
2174 switch (expression->kind) {
2175 case EXPR_STRING_LITERAL:
2176 if (akind == ATOMIC_TYPE_CHAR
2177 || akind == ATOMIC_TYPE_SCHAR
2178 || akind == ATOMIC_TYPE_UCHAR) {
2179 return initializer_from_string(array_type,
2180 &expression->string.value);
2183 case EXPR_WIDE_STRING_LITERAL: {
2184 type_t *bare_wchar_type = skip_typeref(type_wchar_t);
2185 if (get_unqualified_type(element_type) == bare_wchar_type) {
2186 return initializer_from_wide_string(array_type,
2187 &expression->wide_string.value);
2197 assign_error_t error = semantic_assign(type, expression);
2198 if (error == ASSIGN_ERROR_INCOMPATIBLE)
2200 report_assign_error(error, type, expression, "initializer",
2201 &expression->base.source_position);
2203 initializer_t *const result = allocate_initializer_zero(INITIALIZER_VALUE);
2205 if (type->kind == TYPE_BITFIELD) {
2206 type = type->bitfield.base_type;
2209 result->value.value = create_implicit_cast(expression, type);
2215 * Checks if a given expression can be used as an constant initializer.
2217 static bool is_initializer_constant(const expression_t *expression)
2219 return is_constant_expression(expression)
2220 || is_address_constant(expression);
2224 * Parses an scalar initializer.
2226 * § 6.7.8.11; eat {} without warning
2228 static initializer_t *parse_scalar_initializer(type_t *type,
2229 bool must_be_constant)
2231 /* there might be extra {} hierarchies */
2233 if (token.type == '{') {
2234 warningf(HERE, "extra curly braces around scalar initializer");
2238 } while (token.type == '{');
2241 expression_t *expression = parse_assignment_expression();
2242 mark_decls_read(expression, NULL);
2243 if (must_be_constant && !is_initializer_constant(expression)) {
2244 errorf(&expression->base.source_position,
2245 "Initialisation expression '%E' is not constant\n",
2249 initializer_t *initializer = initializer_from_expression(type, expression);
2251 if (initializer == NULL) {
2252 errorf(&expression->base.source_position,
2253 "expression '%E' (type '%T') doesn't match expected type '%T'",
2254 expression, expression->base.type, type);
2259 bool additional_warning_displayed = false;
2260 while (braces > 0) {
2261 if (token.type == ',') {
2264 if (token.type != '}') {
2265 if (!additional_warning_displayed) {
2266 warningf(HERE, "additional elements in scalar initializer");
2267 additional_warning_displayed = true;
2278 * An entry in the type path.
2280 typedef struct type_path_entry_t type_path_entry_t;
2281 struct type_path_entry_t {
2282 type_t *type; /**< the upper top type. restored to path->top_tye if this entry is popped. */
2284 size_t index; /**< For array types: the current index. */
2285 declaration_t *compound_entry; /**< For compound types: the current declaration. */
2290 * A type path expression a position inside compound or array types.
2292 typedef struct type_path_t type_path_t;
2293 struct type_path_t {
2294 type_path_entry_t *path; /**< An flexible array containing the current path. */
2295 type_t *top_type; /**< type of the element the path points */
2296 size_t max_index; /**< largest index in outermost array */
2300 * Prints a type path for debugging.
2302 static __attribute__((unused)) void debug_print_type_path(
2303 const type_path_t *path)
2305 size_t len = ARR_LEN(path->path);
2307 for(size_t i = 0; i < len; ++i) {
2308 const type_path_entry_t *entry = & path->path[i];
2310 type_t *type = skip_typeref(entry->type);
2311 if (is_type_compound(type)) {
2312 /* in gcc mode structs can have no members */
2313 if (entry->v.compound_entry == NULL) {
2317 fprintf(stderr, ".%s", entry->v.compound_entry->symbol->string);
2318 } else if (is_type_array(type)) {
2319 fprintf(stderr, "[%zu]", entry->v.index);
2321 fprintf(stderr, "-INVALID-");
2324 if (path->top_type != NULL) {
2325 fprintf(stderr, " (");
2326 print_type(path->top_type);
2327 fprintf(stderr, ")");
2332 * Return the top type path entry, ie. in a path
2333 * (type).a.b returns the b.
2335 static type_path_entry_t *get_type_path_top(const type_path_t *path)
2337 size_t len = ARR_LEN(path->path);
2339 return &path->path[len-1];
2343 * Enlarge the type path by an (empty) element.
2345 static type_path_entry_t *append_to_type_path(type_path_t *path)
2347 size_t len = ARR_LEN(path->path);
2348 ARR_RESIZE(type_path_entry_t, path->path, len+1);
2350 type_path_entry_t *result = & path->path[len];
2351 memset(result, 0, sizeof(result[0]));
2356 * Descending into a sub-type. Enter the scope of the current
2359 static void descend_into_subtype(type_path_t *path)
2361 type_t *orig_top_type = path->top_type;
2362 type_t *top_type = skip_typeref(orig_top_type);
2364 type_path_entry_t *top = append_to_type_path(path);
2365 top->type = top_type;
2367 if (is_type_compound(top_type)) {
2368 declaration_t *declaration = top_type->compound.declaration;
2369 declaration_t *entry = declaration->scope.declarations;
2370 top->v.compound_entry = entry;
2372 if (entry != NULL) {
2373 path->top_type = entry->type;
2375 path->top_type = NULL;
2377 } else if (is_type_array(top_type)) {
2379 path->top_type = top_type->array.element_type;
2381 assert(!is_type_valid(top_type));
2386 * Pop an entry from the given type path, ie. returning from
2387 * (type).a.b to (type).a
2389 static void ascend_from_subtype(type_path_t *path)
2391 type_path_entry_t *top = get_type_path_top(path);
2393 path->top_type = top->type;
2395 size_t len = ARR_LEN(path->path);
2396 ARR_RESIZE(type_path_entry_t, path->path, len-1);
2400 * Pop entries from the given type path until the given
2401 * path level is reached.
2403 static void ascend_to(type_path_t *path, size_t top_path_level)
2405 size_t len = ARR_LEN(path->path);
2407 while (len > top_path_level) {
2408 ascend_from_subtype(path);
2409 len = ARR_LEN(path->path);
2413 static bool walk_designator(type_path_t *path, const designator_t *designator,
2414 bool used_in_offsetof)
2416 for( ; designator != NULL; designator = designator->next) {
2417 type_path_entry_t *top = get_type_path_top(path);
2418 type_t *orig_type = top->type;
2420 type_t *type = skip_typeref(orig_type);
2422 if (designator->symbol != NULL) {
2423 symbol_t *symbol = designator->symbol;
2424 if (!is_type_compound(type)) {
2425 if (is_type_valid(type)) {
2426 errorf(&designator->source_position,
2427 "'.%Y' designator used for non-compound type '%T'",
2431 top->type = type_error_type;
2432 top->v.compound_entry = NULL;
2433 orig_type = type_error_type;
2435 declaration_t *declaration = type->compound.declaration;
2436 declaration_t *iter = declaration->scope.declarations;
2437 for( ; iter != NULL; iter = iter->next) {
2438 if (iter->symbol == symbol) {
2443 errorf(&designator->source_position,
2444 "'%T' has no member named '%Y'", orig_type, symbol);
2447 if (used_in_offsetof) {
2448 type_t *real_type = skip_typeref(iter->type);
2449 if (real_type->kind == TYPE_BITFIELD) {
2450 errorf(&designator->source_position,
2451 "offsetof designator '%Y' may not specify bitfield",
2457 top->type = orig_type;
2458 top->v.compound_entry = iter;
2459 orig_type = iter->type;
2462 expression_t *array_index = designator->array_index;
2463 assert(designator->array_index != NULL);
2465 if (!is_type_array(type)) {
2466 if (is_type_valid(type)) {
2467 errorf(&designator->source_position,
2468 "[%E] designator used for non-array type '%T'",
2469 array_index, orig_type);
2474 long index = fold_constant(array_index);
2475 if (!used_in_offsetof) {
2477 errorf(&designator->source_position,
2478 "array index [%E] must be positive", array_index);
2479 } else if (type->array.size_constant) {
2480 long array_size = type->array.size;
2481 if (index >= array_size) {
2482 errorf(&designator->source_position,
2483 "designator [%E] (%d) exceeds array size %d",
2484 array_index, index, array_size);
2489 top->type = orig_type;
2490 top->v.index = (size_t) index;
2491 orig_type = type->array.element_type;
2493 path->top_type = orig_type;
2495 if (designator->next != NULL) {
2496 descend_into_subtype(path);
2505 static void advance_current_object(type_path_t *path, size_t top_path_level)
2507 type_path_entry_t *top = get_type_path_top(path);
2509 type_t *type = skip_typeref(top->type);
2510 if (is_type_union(type)) {
2511 /* in unions only the first element is initialized */
2512 top->v.compound_entry = NULL;
2513 } else if (is_type_struct(type)) {
2514 declaration_t *entry = top->v.compound_entry;
2516 entry = entry->next;
2517 top->v.compound_entry = entry;
2518 if (entry != NULL) {
2519 path->top_type = entry->type;
2522 } else if (is_type_array(type)) {
2523 assert(is_type_array(type));
2527 if (!type->array.size_constant || top->v.index < type->array.size) {
2531 assert(!is_type_valid(type));
2535 /* we're past the last member of the current sub-aggregate, try if we
2536 * can ascend in the type hierarchy and continue with another subobject */
2537 size_t len = ARR_LEN(path->path);
2539 if (len > top_path_level) {
2540 ascend_from_subtype(path);
2541 advance_current_object(path, top_path_level);
2543 path->top_type = NULL;
2548 * skip until token is found.
2550 static void skip_until(int type)
2552 while (token.type != type) {
2553 if (token.type == T_EOF)
2560 * skip any {...} blocks until a closing bracket is reached.
2562 static void skip_initializers(void)
2564 if (token.type == '{')
2567 while (token.type != '}') {
2568 if (token.type == T_EOF)
2570 if (token.type == '{') {
2578 static initializer_t *create_empty_initializer(void)
2580 static initializer_t empty_initializer
2581 = { .list = { { INITIALIZER_LIST }, 0 } };
2582 return &empty_initializer;
2586 * Parse a part of an initialiser for a struct or union,
2588 static initializer_t *parse_sub_initializer(type_path_t *path,
2589 type_t *outer_type, size_t top_path_level,
2590 parse_initializer_env_t *env)
2592 if (token.type == '}') {
2593 /* empty initializer */
2594 return create_empty_initializer();
2597 type_t *orig_type = path->top_type;
2598 type_t *type = NULL;
2600 if (orig_type == NULL) {
2601 /* We are initializing an empty compound. */
2603 type = skip_typeref(orig_type);
2606 initializer_t **initializers = NEW_ARR_F(initializer_t*, 0);
2609 designator_t *designator = NULL;
2610 if (token.type == '.' || token.type == '[') {
2611 designator = parse_designation();
2612 goto finish_designator;
2613 } else if (token.type == T_IDENTIFIER && look_ahead(1)->type == ':') {
2614 /* GNU-style designator ("identifier: value") */
2615 designator = allocate_ast_zero(sizeof(designator[0]));
2616 designator->source_position = token.source_position;
2617 designator->symbol = token.v.symbol;
2622 /* reset path to toplevel, evaluate designator from there */
2623 ascend_to(path, top_path_level);
2624 if (!walk_designator(path, designator, false)) {
2625 /* can't continue after designation error */
2629 initializer_t *designator_initializer
2630 = allocate_initializer_zero(INITIALIZER_DESIGNATOR);
2631 designator_initializer->designator.designator = designator;
2632 ARR_APP1(initializer_t*, initializers, designator_initializer);
2634 orig_type = path->top_type;
2635 type = orig_type != NULL ? skip_typeref(orig_type) : NULL;
2640 if (token.type == '{') {
2641 if (type != NULL && is_type_scalar(type)) {
2642 sub = parse_scalar_initializer(type, env->must_be_constant);
2646 if (env->declaration != NULL) {
2647 errorf(HERE, "extra brace group at end of initializer for '%Y'",
2648 env->declaration->symbol);
2650 errorf(HERE, "extra brace group at end of initializer");
2653 descend_into_subtype(path);
2655 add_anchor_token('}');
2656 sub = parse_sub_initializer(path, orig_type, top_path_level+1,
2658 rem_anchor_token('}');
2661 ascend_from_subtype(path);
2665 goto error_parse_next;
2669 /* must be an expression */
2670 expression_t *expression = parse_assignment_expression();
2672 if (env->must_be_constant && !is_initializer_constant(expression)) {
2673 errorf(&expression->base.source_position,
2674 "Initialisation expression '%E' is not constant\n",
2679 /* we are already outside, ... */
2680 type_t *const outer_type_skip = skip_typeref(outer_type);
2681 if (is_type_compound(outer_type_skip) &&
2682 !outer_type_skip->compound.declaration->init.complete) {
2683 goto error_parse_next;
2688 /* handle { "string" } special case */
2689 if ((expression->kind == EXPR_STRING_LITERAL
2690 || expression->kind == EXPR_WIDE_STRING_LITERAL)
2691 && outer_type != NULL) {
2692 sub = initializer_from_expression(outer_type, expression);
2694 if (token.type == ',') {
2697 if (token.type != '}') {
2698 warningf(HERE, "excessive elements in initializer for type '%T'",
2701 /* TODO: eat , ... */
2706 /* descend into subtypes until expression matches type */
2708 orig_type = path->top_type;
2709 type = skip_typeref(orig_type);
2711 sub = initializer_from_expression(orig_type, expression);
2715 if (!is_type_valid(type)) {
2718 if (is_type_scalar(type)) {
2719 errorf(&expression->base.source_position,
2720 "expression '%E' doesn't match expected type '%T'",
2721 expression, orig_type);
2725 descend_into_subtype(path);
2729 /* update largest index of top array */
2730 const type_path_entry_t *first = &path->path[0];
2731 type_t *first_type = first->type;
2732 first_type = skip_typeref(first_type);
2733 if (is_type_array(first_type)) {
2734 size_t index = first->v.index;
2735 if (index > path->max_index)
2736 path->max_index = index;
2740 /* append to initializers list */
2741 ARR_APP1(initializer_t*, initializers, sub);
2744 if (env->declaration != NULL)
2745 warningf(HERE, "excess elements in struct initializer for '%Y'",
2746 env->declaration->symbol);
2748 warningf(HERE, "excess elements in struct initializer");
2752 if (token.type == '}') {
2756 if (token.type == '}') {
2761 /* advance to the next declaration if we are not at the end */
2762 advance_current_object(path, top_path_level);
2763 orig_type = path->top_type;
2764 if (orig_type != NULL)
2765 type = skip_typeref(orig_type);
2771 size_t len = ARR_LEN(initializers);
2772 size_t size = sizeof(initializer_list_t) + len * sizeof(initializers[0]);
2773 initializer_t *result = allocate_ast_zero(size);
2774 result->kind = INITIALIZER_LIST;
2775 result->list.len = len;
2776 memcpy(&result->list.initializers, initializers,
2777 len * sizeof(initializers[0]));
2779 DEL_ARR_F(initializers);
2780 ascend_to(path, top_path_level+1);
2785 skip_initializers();
2786 DEL_ARR_F(initializers);
2787 ascend_to(path, top_path_level+1);
2792 * Parses an initializer. Parsers either a compound literal
2793 * (env->declaration == NULL) or an initializer of a declaration.
2795 static initializer_t *parse_initializer(parse_initializer_env_t *env)
2797 type_t *type = skip_typeref(env->type);
2798 initializer_t *result = NULL;
2801 if (is_type_scalar(type)) {
2802 result = parse_scalar_initializer(type, env->must_be_constant);
2803 } else if (token.type == '{') {
2807 memset(&path, 0, sizeof(path));
2808 path.top_type = env->type;
2809 path.path = NEW_ARR_F(type_path_entry_t, 0);
2811 descend_into_subtype(&path);
2813 add_anchor_token('}');
2814 result = parse_sub_initializer(&path, env->type, 1, env);
2815 rem_anchor_token('}');
2817 max_index = path.max_index;
2818 DEL_ARR_F(path.path);
2822 /* parse_scalar_initializer() also works in this case: we simply
2823 * have an expression without {} around it */
2824 result = parse_scalar_initializer(type, env->must_be_constant);
2827 /* § 6.7.5 (22) array initializers for arrays with unknown size determine
2828 * the array type size */
2829 if (is_type_array(type) && type->array.size_expression == NULL
2830 && result != NULL) {
2832 switch (result->kind) {
2833 case INITIALIZER_LIST:
2834 size = max_index + 1;
2837 case INITIALIZER_STRING:
2838 size = result->string.string.size;
2841 case INITIALIZER_WIDE_STRING:
2842 size = result->wide_string.string.size;
2845 case INITIALIZER_DESIGNATOR:
2846 case INITIALIZER_VALUE:
2847 /* can happen for parse errors */
2852 internal_errorf(HERE, "invalid initializer type");
2855 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
2856 cnst->base.type = type_size_t;
2857 cnst->conste.v.int_value = size;
2859 type_t *new_type = duplicate_type(type);
2861 new_type->array.size_expression = cnst;
2862 new_type->array.size_constant = true;
2863 new_type->array.size = size;
2864 env->type = new_type;
2872 static declaration_t *append_declaration(declaration_t *declaration);
2874 static declaration_t *parse_compound_type_specifier(bool is_struct)
2876 gnu_attribute_t *attributes = NULL;
2877 decl_modifiers_t modifiers = 0;
2884 symbol_t *symbol = NULL;
2885 declaration_t *declaration = NULL;
2887 if (token.type == T___attribute__) {
2888 modifiers |= parse_attributes(&attributes);
2891 if (token.type == T_IDENTIFIER) {
2892 symbol = token.v.symbol;
2895 namespace_t const namespc =
2896 is_struct ? NAMESPACE_STRUCT : NAMESPACE_UNION;
2897 declaration = get_declaration(symbol, namespc);
2898 if (declaration != NULL) {
2899 if (declaration->parent_scope != scope &&
2900 (token.type == '{' || token.type == ';')) {
2902 } else if (declaration->init.complete &&
2903 token.type == '{') {
2904 assert(symbol != NULL);
2905 errorf(HERE, "multiple definitions of '%s %Y' (previous definition at %P)",
2906 is_struct ? "struct" : "union", symbol,
2907 &declaration->source_position);
2908 declaration->scope.declarations = NULL;
2911 } else if (token.type != '{') {
2913 parse_error_expected("while parsing struct type specifier",
2914 T_IDENTIFIER, '{', NULL);
2916 parse_error_expected("while parsing union type specifier",
2917 T_IDENTIFIER, '{', NULL);
2923 if (declaration == NULL) {
2924 declaration = allocate_declaration_zero();
2925 declaration->namespc =
2926 (is_struct ? NAMESPACE_STRUCT : NAMESPACE_UNION);
2927 declaration->source_position = token.source_position;
2928 declaration->symbol = symbol;
2929 declaration->parent_scope = scope;
2930 if (symbol != NULL) {
2931 environment_push(declaration);
2933 append_declaration(declaration);
2936 if (token.type == '{') {
2937 declaration->init.complete = true;
2939 parse_compound_type_entries(declaration);
2940 modifiers |= parse_attributes(&attributes);
2943 declaration->modifiers |= modifiers;
2947 static void parse_enum_entries(type_t *const enum_type)
2951 if (token.type == '}') {
2953 errorf(HERE, "empty enum not allowed");
2957 add_anchor_token('}');
2959 if (token.type != T_IDENTIFIER) {
2960 parse_error_expected("while parsing enum entry", T_IDENTIFIER, NULL);
2962 rem_anchor_token('}');
2966 declaration_t *const entry = allocate_declaration_zero();
2967 entry->storage_class = STORAGE_CLASS_ENUM_ENTRY;
2968 entry->type = enum_type;
2969 entry->symbol = token.v.symbol;
2970 entry->source_position = token.source_position;
2973 if (token.type == '=') {
2975 expression_t *value = parse_constant_expression();
2977 value = create_implicit_cast(value, enum_type);
2978 entry->init.enum_value = value;
2983 record_declaration(entry, false);
2985 if (token.type != ',')
2988 } while (token.type != '}');
2989 rem_anchor_token('}');
2997 static type_t *parse_enum_specifier(void)
2999 gnu_attribute_t *attributes = NULL;
3000 declaration_t *declaration;
3004 if (token.type == T_IDENTIFIER) {
3005 symbol = token.v.symbol;
3008 declaration = get_declaration(symbol, NAMESPACE_ENUM);
3009 } else if (token.type != '{') {
3010 parse_error_expected("while parsing enum type specifier",
3011 T_IDENTIFIER, '{', NULL);
3018 if (declaration == NULL) {
3019 declaration = allocate_declaration_zero();
3020 declaration->namespc = NAMESPACE_ENUM;
3021 declaration->source_position = token.source_position;
3022 declaration->symbol = symbol;
3023 declaration->parent_scope = scope;
3026 type_t *const type = allocate_type_zero(TYPE_ENUM, &declaration->source_position);
3027 type->enumt.declaration = declaration;
3029 if (token.type == '{') {
3030 if (declaration->init.complete) {
3031 errorf(HERE, "multiple definitions of enum %Y", symbol);
3033 if (symbol != NULL) {
3034 environment_push(declaration);
3036 append_declaration(declaration);
3037 declaration->init.complete = true;
3039 parse_enum_entries(type);
3040 parse_attributes(&attributes);
3047 * if a symbol is a typedef to another type, return true
3049 static bool is_typedef_symbol(symbol_t *symbol)
3051 const declaration_t *const declaration =
3052 get_declaration(symbol, NAMESPACE_NORMAL);
3054 declaration != NULL &&
3055 declaration->storage_class == STORAGE_CLASS_TYPEDEF;
3058 static type_t *parse_typeof(void)
3065 add_anchor_token(')');
3067 expression_t *expression = NULL;
3069 bool old_type_prop = in_type_prop;
3070 bool old_gcc_extension = in_gcc_extension;
3071 in_type_prop = true;
3073 while (token.type == T___extension__) {
3074 /* This can be a prefix to a typename or an expression. */
3076 in_gcc_extension = true;
3078 switch (token.type) {
3080 if (is_typedef_symbol(token.v.symbol)) {
3081 type = parse_typename();
3083 expression = parse_expression();
3084 type = expression->base.type;
3089 type = parse_typename();
3093 expression = parse_expression();
3094 type = expression->base.type;
3097 in_type_prop = old_type_prop;
3098 in_gcc_extension = old_gcc_extension;
3100 rem_anchor_token(')');
3103 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF, &expression->base.source_position);
3104 typeof_type->typeoft.expression = expression;
3105 typeof_type->typeoft.typeof_type = type;
3112 typedef enum specifiers_t {
3113 SPECIFIER_SIGNED = 1 << 0,
3114 SPECIFIER_UNSIGNED = 1 << 1,
3115 SPECIFIER_LONG = 1 << 2,
3116 SPECIFIER_INT = 1 << 3,
3117 SPECIFIER_DOUBLE = 1 << 4,
3118 SPECIFIER_CHAR = 1 << 5,
3119 SPECIFIER_SHORT = 1 << 6,
3120 SPECIFIER_LONG_LONG = 1 << 7,
3121 SPECIFIER_FLOAT = 1 << 8,
3122 SPECIFIER_BOOL = 1 << 9,
3123 SPECIFIER_VOID = 1 << 10,
3124 SPECIFIER_INT8 = 1 << 11,
3125 SPECIFIER_INT16 = 1 << 12,
3126 SPECIFIER_INT32 = 1 << 13,
3127 SPECIFIER_INT64 = 1 << 14,
3128 SPECIFIER_INT128 = 1 << 15,
3129 SPECIFIER_COMPLEX = 1 << 16,
3130 SPECIFIER_IMAGINARY = 1 << 17,
3133 static type_t *create_builtin_type(symbol_t *const symbol,
3134 type_t *const real_type)
3136 type_t *type = allocate_type_zero(TYPE_BUILTIN, &builtin_source_position);
3137 type->builtin.symbol = symbol;
3138 type->builtin.real_type = real_type;
3140 type_t *result = typehash_insert(type);
3141 if (type != result) {
3148 static type_t *get_typedef_type(symbol_t *symbol)
3150 declaration_t *declaration = get_declaration(symbol, NAMESPACE_NORMAL);
3151 if (declaration == NULL ||
3152 declaration->storage_class != STORAGE_CLASS_TYPEDEF)
3155 type_t *type = allocate_type_zero(TYPE_TYPEDEF, &declaration->source_position);
3156 type->typedeft.declaration = declaration;
3162 * check for the allowed MS alignment values.
3164 static bool check_alignment_value(long long intvalue)
3166 if (intvalue < 1 || intvalue > 8192) {
3167 errorf(HERE, "illegal alignment value");
3170 unsigned v = (unsigned)intvalue;
3171 for (unsigned i = 1; i <= 8192; i += i) {
3175 errorf(HERE, "alignment must be power of two");
3179 #define DET_MOD(name, tag) do { \
3180 if (*modifiers & tag) warningf(HERE, #name " used more than once"); \
3181 *modifiers |= tag; \
3184 static void parse_microsoft_extended_decl_modifier(declaration_specifiers_t *specifiers)
3186 decl_modifiers_t *modifiers = &specifiers->modifiers;
3189 if (token.type == T_restrict) {
3191 DET_MOD(restrict, DM_RESTRICT);
3193 } else if (token.type != T_IDENTIFIER)
3195 symbol_t *symbol = token.v.symbol;
3196 if (symbol == sym_align) {
3199 if (token.type != T_INTEGER)
3201 if (check_alignment_value(token.v.intvalue)) {
3202 if (specifiers->alignment != 0)
3203 warningf(HERE, "align used more than once");
3204 specifiers->alignment = (unsigned char)token.v.intvalue;
3208 } else if (symbol == sym_allocate) {
3211 if (token.type != T_IDENTIFIER)
3213 (void)token.v.symbol;
3215 } else if (symbol == sym_dllimport) {
3217 DET_MOD(dllimport, DM_DLLIMPORT);
3218 } else if (symbol == sym_dllexport) {
3220 DET_MOD(dllexport, DM_DLLEXPORT);
3221 } else if (symbol == sym_thread) {
3223 DET_MOD(thread, DM_THREAD);
3224 } else if (symbol == sym_naked) {
3226 DET_MOD(naked, DM_NAKED);
3227 } else if (symbol == sym_noinline) {
3229 DET_MOD(noinline, DM_NOINLINE);
3230 } else if (symbol == sym_noreturn) {
3232 DET_MOD(noreturn, DM_NORETURN);
3233 } else if (symbol == sym_nothrow) {
3235 DET_MOD(nothrow, DM_NOTHROW);
3236 } else if (symbol == sym_novtable) {
3238 DET_MOD(novtable, DM_NOVTABLE);
3239 } else if (symbol == sym_property) {
3243 bool is_get = false;
3244 if (token.type != T_IDENTIFIER)
3246 if (token.v.symbol == sym_get) {
3248 } else if (token.v.symbol == sym_put) {
3250 errorf(HERE, "Bad property name '%Y'", token.v.symbol);
3255 if (token.type != T_IDENTIFIER)
3258 if (specifiers->get_property_sym != NULL) {
3259 errorf(HERE, "get property name already specified");
3261 specifiers->get_property_sym = token.v.symbol;
3264 if (specifiers->put_property_sym != NULL) {
3265 errorf(HERE, "put property name already specified");
3267 specifiers->put_property_sym = token.v.symbol;
3271 if (token.type == ',') {
3278 } else if (symbol == sym_selectany) {
3280 DET_MOD(selectany, DM_SELECTANY);
3281 } else if (symbol == sym_uuid) {
3284 if (token.type != T_STRING_LITERAL)
3288 } else if (symbol == sym_deprecated) {
3290 if (specifiers->deprecated != 0)
3291 warningf(HERE, "deprecated used more than once");
3292 specifiers->deprecated = 1;
3293 if (token.type == '(') {
3295 if (token.type == T_STRING_LITERAL) {
3296 specifiers->deprecated_string = token.v.string.begin;
3299 errorf(HERE, "string literal expected");
3303 } else if (symbol == sym_noalias) {
3305 DET_MOD(noalias, DM_NOALIAS);
3307 warningf(HERE, "Unknown modifier %Y ignored", token.v.symbol);
3309 if (token.type == '(')
3313 if (token.type == ',')
3320 static declaration_t *create_error_declaration(symbol_t *symbol, storage_class_tag_t storage_class)
3322 declaration_t *const decl = allocate_declaration_zero();
3323 decl->source_position = *HERE;
3324 decl->declared_storage_class = storage_class;
3325 decl->storage_class =
3326 storage_class != STORAGE_CLASS_NONE || scope == file_scope ?
3327 storage_class : STORAGE_CLASS_AUTO;
3328 decl->symbol = symbol;
3329 decl->implicit = true;
3330 record_declaration(decl, false);
3335 * Finish the construction of a struct type by calculating
3336 * its size, offsets, alignment.
3338 static void finish_struct_type(compound_type_t *type) {
3339 if (type->declaration == NULL)
3341 declaration_t *struct_decl = type->declaration;
3342 if (! struct_decl->init.complete)
3347 il_alignment_t alignment = 1;
3348 bool need_pad = false;
3350 declaration_t *entry = struct_decl->scope.declarations;
3351 for (; entry != NULL; entry = entry->next) {
3352 if (entry->namespc != NAMESPACE_NORMAL)
3355 type_t *m_type = skip_typeref(entry->type);
3356 if (! is_type_valid(m_type)) {
3357 /* simply ignore errors here */
3360 il_alignment_t m_alignment = m_type->base.alignment;
3361 if (m_alignment > alignment)
3362 alignment = m_alignment;
3364 offset = (size + m_alignment - 1) & -m_alignment;
3368 entry->offset = offset;
3369 size = offset + m_type->base.size;
3371 if (type->base.alignment != 0) {
3372 alignment = type->base.alignment;
3375 offset = (size + alignment - 1) & -alignment;
3379 if (warning.padded && need_pad) {
3380 warningf(&struct_decl->source_position,
3381 "'%#T' needs padding", type, struct_decl->symbol);
3383 if (warning.packed && !need_pad) {
3384 warningf(&struct_decl->source_position,
3385 "superfluous packed attribute on '%#T'",
3386 type, struct_decl->symbol);
3389 type->base.size = offset;
3390 type->base.alignment = alignment;
3394 * Finish the construction of an union type by calculating
3395 * its size and alignment.
3397 static void finish_union_type(compound_type_t *type) {
3398 if (type->declaration == NULL)
3400 declaration_t *union_decl = type->declaration;
3401 if (! union_decl->init.complete)
3405 il_alignment_t alignment = 1;
3407 declaration_t *entry = union_decl->scope.declarations;
3408 for (; entry != NULL; entry = entry->next) {
3409 if (entry->namespc != NAMESPACE_NORMAL)
3412 type_t *m_type = skip_typeref(entry->type);
3413 if (! is_type_valid(m_type))
3417 if (m_type->base.size > size)
3418 size = m_type->base.size;
3419 if (m_type->base.alignment > alignment)
3420 alignment = m_type->base.alignment;
3422 if (type->base.alignment != 0) {
3423 alignment = type->base.alignment;
3425 size = (size + alignment - 1) & -alignment;
3426 type->base.size = size;
3427 type->base.alignment = alignment;
3430 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
3432 type_t *type = NULL;
3433 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3434 type_modifiers_t modifiers = TYPE_MODIFIER_NONE;
3435 unsigned type_specifiers = 0;
3436 bool newtype = false;
3437 bool saw_error = false;
3438 bool old_gcc_extension = in_gcc_extension;
3440 specifiers->source_position = token.source_position;
3443 specifiers->modifiers
3444 |= parse_attributes(&specifiers->gnu_attributes);
3445 if (specifiers->modifiers & DM_TRANSPARENT_UNION)
3446 modifiers |= TYPE_MODIFIER_TRANSPARENT_UNION;
3448 switch (token.type) {
3451 #define MATCH_STORAGE_CLASS(token, class) \
3453 if (specifiers->declared_storage_class != STORAGE_CLASS_NONE) { \
3454 errorf(HERE, "multiple storage classes in declaration specifiers"); \
3456 specifiers->declared_storage_class = class; \
3460 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
3461 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
3462 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
3463 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
3464 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
3469 add_anchor_token(')');
3470 parse_microsoft_extended_decl_modifier(specifiers);
3471 rem_anchor_token(')');
3476 switch (specifiers->declared_storage_class) {
3477 case STORAGE_CLASS_NONE:
3478 specifiers->declared_storage_class = STORAGE_CLASS_THREAD;
3481 case STORAGE_CLASS_EXTERN:
3482 specifiers->declared_storage_class = STORAGE_CLASS_THREAD_EXTERN;
3485 case STORAGE_CLASS_STATIC:
3486 specifiers->declared_storage_class = STORAGE_CLASS_THREAD_STATIC;
3490 errorf(HERE, "multiple storage classes in declaration specifiers");
3496 /* type qualifiers */
3497 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
3499 qualifiers |= qualifier; \
3503 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3504 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3505 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3506 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3507 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3508 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3509 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3510 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3512 case T___extension__:
3514 in_gcc_extension = true;
3517 /* type specifiers */
3518 #define MATCH_SPECIFIER(token, specifier, name) \
3521 if (type_specifiers & specifier) { \
3522 errorf(HERE, "multiple " name " type specifiers given"); \
3524 type_specifiers |= specifier; \
3528 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
3529 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
3530 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
3531 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
3532 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
3533 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
3534 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
3535 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
3536 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
3537 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
3538 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
3539 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
3540 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
3541 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
3542 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
3543 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
3545 case T__forceinline:
3546 /* only in microsoft mode */
3547 specifiers->modifiers |= DM_FORCEINLINE;
3552 specifiers->is_inline = true;
3557 if (type_specifiers & SPECIFIER_LONG_LONG) {
3558 errorf(HERE, "multiple type specifiers given");
3559 } else if (type_specifiers & SPECIFIER_LONG) {
3560 type_specifiers |= SPECIFIER_LONG_LONG;
3562 type_specifiers |= SPECIFIER_LONG;
3567 type = allocate_type_zero(TYPE_COMPOUND_STRUCT, HERE);
3569 type->compound.declaration = parse_compound_type_specifier(true);
3570 finish_struct_type(&type->compound);
3574 type = allocate_type_zero(TYPE_COMPOUND_UNION, HERE);
3575 type->compound.declaration = parse_compound_type_specifier(false);
3576 if (type->compound.declaration->modifiers & DM_TRANSPARENT_UNION)
3577 modifiers |= TYPE_MODIFIER_TRANSPARENT_UNION;
3578 finish_union_type(&type->compound);
3582 type = parse_enum_specifier();
3585 type = parse_typeof();
3587 case T___builtin_va_list:
3588 type = duplicate_type(type_valist);
3592 case T_IDENTIFIER: {
3593 /* only parse identifier if we haven't found a type yet */
3594 if (type != NULL || type_specifiers != 0) {
3595 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
3596 * declaration, so it doesn't generate errors about expecting '(' or
3598 switch (look_ahead(1)->type) {
3605 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
3608 errorf(HERE, "discarding stray %K in declaration specifier", &token);
3613 goto finish_specifiers;
3617 type_t *const typedef_type = get_typedef_type(token.v.symbol);
3618 if (typedef_type == NULL) {
3619 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
3620 * declaration, so it doesn't generate 'implicit int' followed by more
3621 * errors later on. */
3622 token_type_t const la1_type = (token_type_t)look_ahead(1)->type;
3627 errorf(HERE, "%K does not name a type", &token);
3629 declaration_t *const decl =
3630 create_error_declaration(token.v.symbol, STORAGE_CLASS_TYPEDEF);
3632 type = allocate_type_zero(TYPE_TYPEDEF, HERE);
3633 type->typedeft.declaration = decl;
3637 if (la1_type == '*')
3638 goto finish_specifiers;
3643 goto finish_specifiers;
3648 type = typedef_type;
3652 /* function specifier */
3654 goto finish_specifiers;
3659 in_gcc_extension = old_gcc_extension;
3661 if (type == NULL || (saw_error && type_specifiers != 0)) {
3662 atomic_type_kind_t atomic_type;
3664 /* match valid basic types */
3665 switch(type_specifiers) {
3666 case SPECIFIER_VOID:
3667 atomic_type = ATOMIC_TYPE_VOID;
3669 case SPECIFIER_CHAR:
3670 atomic_type = ATOMIC_TYPE_CHAR;
3672 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
3673 atomic_type = ATOMIC_TYPE_SCHAR;
3675 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
3676 atomic_type = ATOMIC_TYPE_UCHAR;
3678 case SPECIFIER_SHORT:
3679 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
3680 case SPECIFIER_SHORT | SPECIFIER_INT:
3681 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3682 atomic_type = ATOMIC_TYPE_SHORT;
3684 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
3685 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3686 atomic_type = ATOMIC_TYPE_USHORT;
3689 case SPECIFIER_SIGNED:
3690 case SPECIFIER_SIGNED | SPECIFIER_INT:
3691 atomic_type = ATOMIC_TYPE_INT;
3693 case SPECIFIER_UNSIGNED:
3694 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
3695 atomic_type = ATOMIC_TYPE_UINT;
3697 case SPECIFIER_LONG:
3698 case SPECIFIER_SIGNED | SPECIFIER_LONG:
3699 case SPECIFIER_LONG | SPECIFIER_INT:
3700 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3701 atomic_type = ATOMIC_TYPE_LONG;
3703 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
3704 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3705 atomic_type = ATOMIC_TYPE_ULONG;
3708 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3709 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3710 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
3711 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3713 atomic_type = ATOMIC_TYPE_LONGLONG;
3714 goto warn_about_long_long;
3716 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3717 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3719 atomic_type = ATOMIC_TYPE_ULONGLONG;
3720 warn_about_long_long:
3721 if (warning.long_long) {
3722 warningf(&specifiers->source_position,
3723 "ISO C90 does not support 'long long'");
3727 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
3728 atomic_type = unsigned_int8_type_kind;
3731 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
3732 atomic_type = unsigned_int16_type_kind;
3735 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
3736 atomic_type = unsigned_int32_type_kind;
3739 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
3740 atomic_type = unsigned_int64_type_kind;
3743 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
3744 atomic_type = unsigned_int128_type_kind;
3747 case SPECIFIER_INT8:
3748 case SPECIFIER_SIGNED | SPECIFIER_INT8:
3749 atomic_type = int8_type_kind;
3752 case SPECIFIER_INT16:
3753 case SPECIFIER_SIGNED | SPECIFIER_INT16:
3754 atomic_type = int16_type_kind;
3757 case SPECIFIER_INT32:
3758 case SPECIFIER_SIGNED | SPECIFIER_INT32:
3759 atomic_type = int32_type_kind;
3762 case SPECIFIER_INT64:
3763 case SPECIFIER_SIGNED | SPECIFIER_INT64:
3764 atomic_type = int64_type_kind;
3767 case SPECIFIER_INT128:
3768 case SPECIFIER_SIGNED | SPECIFIER_INT128:
3769 atomic_type = int128_type_kind;
3772 case SPECIFIER_FLOAT:
3773 atomic_type = ATOMIC_TYPE_FLOAT;
3775 case SPECIFIER_DOUBLE:
3776 atomic_type = ATOMIC_TYPE_DOUBLE;
3778 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
3779 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3781 case SPECIFIER_BOOL:
3782 atomic_type = ATOMIC_TYPE_BOOL;
3784 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
3785 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
3786 atomic_type = ATOMIC_TYPE_FLOAT;
3788 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3789 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3790 atomic_type = ATOMIC_TYPE_DOUBLE;
3792 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3793 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3794 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3797 /* invalid specifier combination, give an error message */
3798 if (type_specifiers == 0) {
3803 if (warning.implicit_int) {
3804 warningf(HERE, "no type specifiers in declaration, using 'int'");
3806 atomic_type = ATOMIC_TYPE_INT;
3809 errorf(HERE, "no type specifiers given in declaration");
3811 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
3812 (type_specifiers & SPECIFIER_UNSIGNED)) {
3813 errorf(HERE, "signed and unsigned specifiers given");
3814 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3815 errorf(HERE, "only integer types can be signed or unsigned");
3817 errorf(HERE, "multiple datatypes in declaration");
3822 if (type_specifiers & SPECIFIER_COMPLEX) {
3823 type = allocate_type_zero(TYPE_COMPLEX, &builtin_source_position);
3824 type->complex.akind = atomic_type;
3825 } else if (type_specifiers & SPECIFIER_IMAGINARY) {
3826 type = allocate_type_zero(TYPE_IMAGINARY, &builtin_source_position);
3827 type->imaginary.akind = atomic_type;
3829 type = allocate_type_zero(TYPE_ATOMIC, &builtin_source_position);
3830 type->atomic.akind = atomic_type;
3833 } else if (type_specifiers != 0) {
3834 errorf(HERE, "multiple datatypes in declaration");
3837 /* FIXME: check type qualifiers here */
3839 type->base.qualifiers = qualifiers;
3840 type->base.modifiers = modifiers;
3842 type_t *result = typehash_insert(type);
3843 if (newtype && result != type) {
3847 specifiers->type = result;
3851 specifiers->type = type_error_type;
3855 static type_qualifiers_t parse_type_qualifiers(void)
3857 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3860 switch(token.type) {
3861 /* type qualifiers */
3862 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3863 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3864 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3865 /* microsoft extended type modifiers */
3866 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3867 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3868 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3869 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3870 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3879 * Parses an K&R identifier list and return a list of declarations.
3881 * @param last points to the last declaration in the list
3882 * @return the list of declarations
3884 static declaration_t *parse_identifier_list(declaration_t **last)
3886 declaration_t *declarations = NULL;
3887 declaration_t *last_declaration = NULL;
3889 declaration_t *const declaration = allocate_declaration_zero();
3890 declaration->type = NULL; /* a K&R parameter list has no types, yet */
3891 declaration->source_position = token.source_position;
3892 declaration->symbol = token.v.symbol;
3895 if (last_declaration != NULL) {
3896 last_declaration->next = declaration;
3898 declarations = declaration;
3900 last_declaration = declaration;
3902 if (token.type != ',') {
3906 } while (token.type == T_IDENTIFIER);
3908 *last = last_declaration;
3909 return declarations;
3912 static type_t *automatic_type_conversion(type_t *orig_type);
3914 static void semantic_parameter(declaration_t *declaration)
3916 /* TODO: improve error messages */
3917 source_position_t const* const pos = &declaration->source_position;
3919 switch (declaration->declared_storage_class) {
3920 case STORAGE_CLASS_TYPEDEF:
3921 errorf(pos, "typedef not allowed in parameter list");
3924 /* Allowed storage classes */
3925 case STORAGE_CLASS_NONE:
3926 case STORAGE_CLASS_REGISTER:
3930 errorf(pos, "parameter may only have none or register storage class");
3934 type_t *const orig_type = declaration->type;
3935 /* §6.7.5.3(7): Array as last part of a parameter type is just syntactic
3936 * sugar. Turn it into a pointer.
3937 * §6.7.5.3(8): A declaration of a parameter as ``function returning type''
3938 * shall be adjusted to ``pointer to function returning type'', as in 6.3.2.1.
3940 type_t *const type = automatic_type_conversion(orig_type);
3941 declaration->type = type;
3943 if (is_type_incomplete(skip_typeref(type))) {
3944 errorf(pos, "parameter '%#T' is of incomplete type",
3945 orig_type, declaration->symbol);
3949 static declaration_t *parse_parameter(void)
3951 declaration_specifiers_t specifiers;
3952 memset(&specifiers, 0, sizeof(specifiers));
3954 parse_declaration_specifiers(&specifiers);
3956 declaration_t *declaration = parse_declarator(&specifiers, /*may_be_abstract=*/true);
3962 * Parses a function type parameter list and return a list of declarations.
3964 * @param last point to the last element of the list
3965 * @return the parameter list
3967 static declaration_t *parse_parameters(function_type_t *type, declaration_t **last)
3969 declaration_t *declarations = NULL;
3972 add_anchor_token(')');
3973 int saved_comma_state = save_and_reset_anchor_state(',');
3975 if (token.type == T_IDENTIFIER &&
3976 !is_typedef_symbol(token.v.symbol)) {
3977 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
3978 if (la1_type == ',' || la1_type == ')') {
3979 type->kr_style_parameters = true;
3980 declarations = parse_identifier_list(last);
3981 goto parameters_finished;
3985 if (token.type == ')') {
3986 type->unspecified_parameters = 1;
3987 goto parameters_finished;
3990 declaration_t *declaration;
3991 declaration_t *last_declaration = NULL;
3992 function_parameter_t *parameter;
3993 function_parameter_t *last_parameter = NULL;
3996 switch(token.type) {
4000 goto parameters_finished;
4003 case T___extension__:
4005 declaration = parse_parameter();
4007 /* func(void) is not a parameter */
4008 if (last_parameter == NULL
4009 && token.type == ')'
4010 && declaration->symbol == NULL
4011 && skip_typeref(declaration->type) == type_void) {
4012 goto parameters_finished;
4014 semantic_parameter(declaration);
4016 parameter = obstack_alloc(type_obst, sizeof(parameter[0]));
4017 memset(parameter, 0, sizeof(parameter[0]));
4018 parameter->type = declaration->type;
4020 if (last_parameter != NULL) {
4021 last_declaration->next = declaration;
4022 last_parameter->next = parameter;
4024 type->parameters = parameter;
4025 declarations = declaration;
4027 last_parameter = parameter;
4028 last_declaration = declaration;
4032 goto parameters_finished;
4034 if (token.type != ',') {
4035 goto parameters_finished;
4041 parameters_finished:
4042 rem_anchor_token(')');
4045 restore_anchor_state(',', saved_comma_state);
4046 *last = last_declaration;
4047 return declarations;
4050 restore_anchor_state(',', saved_comma_state);
4055 typedef enum construct_type_kind_t {
4060 } construct_type_kind_t;
4062 typedef struct construct_type_t construct_type_t;
4063 struct construct_type_t {
4064 construct_type_kind_t kind;
4065 construct_type_t *next;
4068 typedef struct parsed_pointer_t parsed_pointer_t;
4069 struct parsed_pointer_t {
4070 construct_type_t construct_type;
4071 type_qualifiers_t type_qualifiers;
4074 typedef struct construct_function_type_t construct_function_type_t;
4075 struct construct_function_type_t {
4076 construct_type_t construct_type;
4077 type_t *function_type;
4080 typedef struct parsed_array_t parsed_array_t;
4081 struct parsed_array_t {
4082 construct_type_t construct_type;
4083 type_qualifiers_t type_qualifiers;
4089 typedef struct construct_base_type_t construct_base_type_t;
4090 struct construct_base_type_t {
4091 construct_type_t construct_type;
4095 static construct_type_t *parse_pointer_declarator(void)
4099 parsed_pointer_t *pointer = obstack_alloc(&temp_obst, sizeof(pointer[0]));
4100 memset(pointer, 0, sizeof(pointer[0]));
4101 pointer->construct_type.kind = CONSTRUCT_POINTER;
4102 pointer->type_qualifiers = parse_type_qualifiers();
4104 return (construct_type_t*) pointer;
4107 static construct_type_t *parse_array_declarator(void)
4110 add_anchor_token(']');
4112 parsed_array_t *array = obstack_alloc(&temp_obst, sizeof(array[0]));
4113 memset(array, 0, sizeof(array[0]));
4114 array->construct_type.kind = CONSTRUCT_ARRAY;
4116 if (token.type == T_static) {
4117 array->is_static = true;
4121 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
4122 if (type_qualifiers != 0) {
4123 if (token.type == T_static) {
4124 array->is_static = true;
4128 array->type_qualifiers = type_qualifiers;
4130 if (token.type == '*' && look_ahead(1)->type == ']') {
4131 array->is_variable = true;
4133 } else if (token.type != ']') {
4134 array->size = parse_assignment_expression();
4137 rem_anchor_token(']');
4141 return (construct_type_t*) array;
4144 static construct_type_t *parse_function_declarator(declaration_t *declaration)
4147 if (declaration != NULL) {
4148 type = allocate_type_zero(TYPE_FUNCTION, &declaration->source_position);
4150 unsigned mask = declaration->modifiers & (DM_CDECL|DM_STDCALL|DM_FASTCALL|DM_THISCALL);
4152 if (mask & (mask-1)) {
4153 const char *first = NULL, *second = NULL;
4155 /* more than one calling convention set */
4156 if (declaration->modifiers & DM_CDECL) {
4157 if (first == NULL) first = "cdecl";
4158 else if (second == NULL) second = "cdecl";
4160 if (declaration->modifiers & DM_STDCALL) {
4161 if (first == NULL) first = "stdcall";
4162 else if (second == NULL) second = "stdcall";
4164 if (declaration->modifiers & DM_FASTCALL) {
4165 if (first == NULL) first = "fastcall";
4166 else if (second == NULL) second = "fastcall";
4168 if (declaration->modifiers & DM_THISCALL) {
4169 if (first == NULL) first = "thiscall";
4170 else if (second == NULL) second = "thiscall";
4172 errorf(&declaration->source_position, "%s and %s attributes are not compatible", first, second);
4175 if (declaration->modifiers & DM_CDECL)
4176 type->function.calling_convention = CC_CDECL;
4177 else if (declaration->modifiers & DM_STDCALL)
4178 type->function.calling_convention = CC_STDCALL;
4179 else if (declaration->modifiers & DM_FASTCALL)
4180 type->function.calling_convention = CC_FASTCALL;
4181 else if (declaration->modifiers & DM_THISCALL)
4182 type->function.calling_convention = CC_THISCALL;
4184 type = allocate_type_zero(TYPE_FUNCTION, HERE);
4187 declaration_t *last;
4188 declaration_t *parameters = parse_parameters(&type->function, &last);
4189 if (declaration != NULL) {
4190 declaration->scope.declarations = parameters;
4191 declaration->scope.last_declaration = last;
4192 declaration->scope.is_parameter = true;
4195 construct_function_type_t *construct_function_type =
4196 obstack_alloc(&temp_obst, sizeof(construct_function_type[0]));
4197 memset(construct_function_type, 0, sizeof(construct_function_type[0]));
4198 construct_function_type->construct_type.kind = CONSTRUCT_FUNCTION;
4199 construct_function_type->function_type = type;
4201 return &construct_function_type->construct_type;
4204 static void fix_declaration_type(declaration_t *declaration)
4206 decl_modifiers_t declaration_modifiers = declaration->modifiers;
4207 type_modifiers_t type_modifiers = declaration->type->base.modifiers;
4209 if (declaration_modifiers & DM_TRANSPARENT_UNION)
4210 type_modifiers |= TYPE_MODIFIER_TRANSPARENT_UNION;
4212 if (declaration->type->base.modifiers == type_modifiers)
4215 type_t *copy = duplicate_type(declaration->type);
4216 copy->base.modifiers = type_modifiers;
4218 type_t *result = typehash_insert(copy);
4219 if (result != copy) {
4220 obstack_free(type_obst, copy);
4223 declaration->type = result;
4226 static construct_type_t *parse_inner_declarator(declaration_t *declaration,
4227 bool may_be_abstract)
4229 /* construct a single linked list of construct_type_t's which describe
4230 * how to construct the final declarator type */
4231 construct_type_t *first = NULL;
4232 construct_type_t *last = NULL;
4233 gnu_attribute_t *attributes = NULL;
4235 decl_modifiers_t modifiers = parse_attributes(&attributes);
4238 while (token.type == '*') {
4239 construct_type_t *type = parse_pointer_declarator();
4249 /* TODO: find out if this is correct */
4250 modifiers |= parse_attributes(&attributes);
4253 if (declaration != NULL)
4254 declaration->modifiers |= modifiers;
4256 construct_type_t *inner_types = NULL;
4258 switch(token.type) {
4260 if (declaration == NULL) {
4261 errorf(HERE, "no identifier expected in typename");
4263 declaration->symbol = token.v.symbol;
4264 declaration->source_position = token.source_position;
4270 add_anchor_token(')');
4271 inner_types = parse_inner_declarator(declaration, may_be_abstract);
4272 if (inner_types != NULL) {
4273 /* All later declarators only modify the return type, not declaration */
4276 rem_anchor_token(')');
4280 if (may_be_abstract)
4282 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
4287 construct_type_t *p = last;
4290 construct_type_t *type;
4291 switch(token.type) {
4293 type = parse_function_declarator(declaration);
4296 type = parse_array_declarator();
4299 goto declarator_finished;
4302 /* insert in the middle of the list (behind p) */
4304 type->next = p->next;
4315 declarator_finished:
4316 /* append inner_types at the end of the list, we don't to set last anymore
4317 * as it's not needed anymore */
4319 assert(first == NULL);
4320 first = inner_types;
4322 last->next = inner_types;
4330 static void parse_declaration_attributes(declaration_t *declaration)
4332 gnu_attribute_t *attributes = NULL;
4333 decl_modifiers_t modifiers = parse_attributes(&attributes);
4335 if (declaration == NULL)
4338 declaration->modifiers |= modifiers;
4339 /* check if we have these stupid mode attributes... */
4340 type_t *old_type = declaration->type;
4341 if (old_type == NULL)
4344 gnu_attribute_t *attribute = attributes;
4345 for ( ; attribute != NULL; attribute = attribute->next) {
4346 if (attribute->kind != GNU_AK_MODE || attribute->invalid)
4349 atomic_type_kind_t akind = attribute->u.akind;
4350 if (!is_type_signed(old_type)) {
4352 case ATOMIC_TYPE_CHAR: akind = ATOMIC_TYPE_UCHAR; break;
4353 case ATOMIC_TYPE_SHORT: akind = ATOMIC_TYPE_USHORT; break;
4354 case ATOMIC_TYPE_INT: akind = ATOMIC_TYPE_UINT; break;
4355 case ATOMIC_TYPE_LONGLONG: akind = ATOMIC_TYPE_ULONGLONG; break;
4357 panic("invalid akind in mode attribute");
4361 = make_atomic_type(akind, old_type->base.qualifiers);
4365 static type_t *construct_declarator_type(construct_type_t *construct_list,
4368 construct_type_t *iter = construct_list;
4369 for( ; iter != NULL; iter = iter->next) {
4370 switch(iter->kind) {
4371 case CONSTRUCT_INVALID:
4372 internal_errorf(HERE, "invalid type construction found");
4373 case CONSTRUCT_FUNCTION: {
4374 construct_function_type_t *construct_function_type
4375 = (construct_function_type_t*) iter;
4377 type_t *function_type = construct_function_type->function_type;
4379 function_type->function.return_type = type;
4381 type_t *skipped_return_type = skip_typeref(type);
4383 if (is_type_function(skipped_return_type)) {
4384 errorf(HERE, "function returning function is not allowed");
4385 } else if (is_type_array(skipped_return_type)) {
4386 errorf(HERE, "function returning array is not allowed");
4388 if (skipped_return_type->base.qualifiers != 0) {
4390 "type qualifiers in return type of function type are meaningless");
4394 type = function_type;
4398 case CONSTRUCT_POINTER: {
4399 parsed_pointer_t *parsed_pointer = (parsed_pointer_t*) iter;
4400 type = make_pointer_type(type, parsed_pointer->type_qualifiers);
4404 case CONSTRUCT_ARRAY: {
4405 parsed_array_t *parsed_array = (parsed_array_t*) iter;
4406 type_t *array_type = allocate_type_zero(TYPE_ARRAY, &null_position);
4408 expression_t *size_expression = parsed_array->size;
4409 if (size_expression != NULL) {
4411 = create_implicit_cast(size_expression, type_size_t);
4414 array_type->base.qualifiers = parsed_array->type_qualifiers;
4415 array_type->array.element_type = type;
4416 array_type->array.is_static = parsed_array->is_static;
4417 array_type->array.is_variable = parsed_array->is_variable;
4418 array_type->array.size_expression = size_expression;
4420 if (size_expression != NULL) {
4421 if (is_constant_expression(size_expression)) {
4422 array_type->array.size_constant = true;
4423 array_type->array.size
4424 = fold_constant(size_expression);
4426 array_type->array.is_vla = true;
4430 type_t *skipped_type = skip_typeref(type);
4432 if (is_type_incomplete(skipped_type)) {
4433 errorf(HERE, "array of incomplete type '%T' is not allowed", type);
4434 } else if (is_type_function(skipped_type)) {
4435 errorf(HERE, "array of functions is not allowed");
4442 type_t *hashed_type = typehash_insert(type);
4443 if (hashed_type != type) {
4444 /* the function type was constructed earlier freeing it here will
4445 * destroy other types... */
4446 if (iter->kind != CONSTRUCT_FUNCTION) {
4456 static declaration_t *parse_declarator(
4457 const declaration_specifiers_t *specifiers, bool may_be_abstract)
4459 declaration_t *const declaration = allocate_declaration_zero();
4460 declaration->source_position = specifiers->source_position;
4461 declaration->declared_storage_class = specifiers->declared_storage_class;
4462 declaration->modifiers = specifiers->modifiers;
4463 declaration->deprecated_string = specifiers->deprecated_string;
4464 declaration->get_property_sym = specifiers->get_property_sym;
4465 declaration->put_property_sym = specifiers->put_property_sym;
4466 declaration->is_inline = specifiers->is_inline;
4468 declaration->storage_class = specifiers->declared_storage_class;
4469 if (declaration->storage_class == STORAGE_CLASS_NONE &&
4470 scope != file_scope) {
4471 declaration->storage_class = STORAGE_CLASS_AUTO;
4474 if (specifiers->alignment != 0) {
4475 /* TODO: add checks here */
4476 declaration->alignment = specifiers->alignment;
4479 construct_type_t *construct_type
4480 = parse_inner_declarator(declaration, may_be_abstract);
4481 type_t *const type = specifiers->type;
4482 declaration->type = construct_declarator_type(construct_type, type);
4484 parse_declaration_attributes(declaration);
4486 fix_declaration_type(declaration);
4488 if (construct_type != NULL) {
4489 obstack_free(&temp_obst, construct_type);
4495 static type_t *parse_abstract_declarator(type_t *base_type)
4497 construct_type_t *construct_type = parse_inner_declarator(NULL, 1);
4499 type_t *result = construct_declarator_type(construct_type, base_type);
4500 if (construct_type != NULL) {
4501 obstack_free(&temp_obst, construct_type);
4507 static declaration_t *append_declaration(declaration_t* const declaration)
4509 if (last_declaration != NULL) {
4510 last_declaration->next = declaration;
4512 scope->declarations = declaration;
4514 last_declaration = declaration;
4519 * Check if the declaration of main is suspicious. main should be a
4520 * function with external linkage, returning int, taking either zero
4521 * arguments, two, or three arguments of appropriate types, ie.
4523 * int main([ int argc, char **argv [, char **env ] ]).
4525 * @param decl the declaration to check
4526 * @param type the function type of the declaration
4528 static void check_type_of_main(const declaration_t *const decl, const function_type_t *const func_type)
4530 if (decl->storage_class == STORAGE_CLASS_STATIC) {
4531 warningf(&decl->source_position,
4532 "'main' is normally a non-static function");
4534 if (!types_compatible(skip_typeref(func_type->return_type), type_int)) {
4535 warningf(&decl->source_position,
4536 "return type of 'main' should be 'int', but is '%T'",
4537 func_type->return_type);
4539 const function_parameter_t *parm = func_type->parameters;
4541 type_t *const first_type = parm->type;
4542 if (!types_compatible(skip_typeref(first_type), type_int)) {
4543 warningf(&decl->source_position,
4544 "first argument of 'main' should be 'int', but is '%T'", first_type);
4548 type_t *const second_type = parm->type;
4549 if (!types_compatible(skip_typeref(second_type), type_char_ptr_ptr)) {
4550 warningf(&decl->source_position,
4551 "second argument of 'main' should be 'char**', but is '%T'", second_type);
4555 type_t *const third_type = parm->type;
4556 if (!types_compatible(skip_typeref(third_type), type_char_ptr_ptr)) {
4557 warningf(&decl->source_position,
4558 "third argument of 'main' should be 'char**', but is '%T'", third_type);
4562 goto warn_arg_count;
4566 warningf(&decl->source_position, "'main' takes only zero, two or three arguments");
4572 * Check if a symbol is the equal to "main".
4574 static bool is_sym_main(const symbol_t *const sym)
4576 return strcmp(sym->string, "main") == 0;
4579 static declaration_t *record_declaration(
4580 declaration_t *const declaration,
4581 const bool is_definition)
4583 const symbol_t *const symbol = declaration->symbol;
4584 const namespace_t namespc = (namespace_t)declaration->namespc;
4586 assert(symbol != NULL);
4587 declaration_t *previous_declaration = get_declaration(symbol, namespc);
4589 type_t *const orig_type = declaration->type;
4590 type_t *const type = skip_typeref(orig_type);
4591 if (is_type_function(type) &&
4592 type->function.unspecified_parameters &&
4593 warning.strict_prototypes &&
4594 previous_declaration == NULL) {
4595 warningf(&declaration->source_position,
4596 "function declaration '%#T' is not a prototype",
4600 if (warning.main && is_type_function(type) && is_sym_main(symbol)) {
4601 check_type_of_main(declaration, &type->function);
4604 if (warning.nested_externs &&
4605 declaration->storage_class == STORAGE_CLASS_EXTERN &&
4606 scope != file_scope) {
4607 warningf(&declaration->source_position,
4608 "nested extern declaration of '%#T'", declaration->type, symbol);
4611 assert(declaration != previous_declaration);
4612 if (previous_declaration != NULL &&
4613 previous_declaration->parent_scope->is_parameter &&
4614 scope->depth == previous_declaration->parent_scope->depth + 1) {
4615 errorf(&declaration->source_position,
4616 "declaration '%#T' redeclares the parameter '%#T' (declared %P)",
4617 orig_type, symbol, previous_declaration->type, symbol,
4618 &previous_declaration->source_position);
4621 if (previous_declaration != NULL &&
4622 previous_declaration->parent_scope == scope) {
4623 /* can happen for K&R style declarations */
4624 if (previous_declaration->type == NULL) {
4625 previous_declaration->type = declaration->type;
4628 const type_t *prev_type = skip_typeref(previous_declaration->type);
4629 if (!types_compatible(type, prev_type)) {
4630 errorf(&declaration->source_position,
4631 "declaration '%#T' is incompatible with '%#T' (declared %P)",
4632 orig_type, symbol, previous_declaration->type, symbol,
4633 &previous_declaration->source_position);
4635 unsigned old_storage_class = previous_declaration->storage_class;
4636 if (old_storage_class == STORAGE_CLASS_ENUM_ENTRY) {
4637 errorf(&declaration->source_position,
4638 "redeclaration of enum entry '%Y' (declared %P)",
4639 symbol, &previous_declaration->source_position);
4640 return previous_declaration;
4643 if (warning.redundant_decls &&
4645 previous_declaration->storage_class == STORAGE_CLASS_STATIC &&
4646 !(previous_declaration->modifiers & DM_USED) &&
4647 !previous_declaration->used) {
4648 warningf(&previous_declaration->source_position,
4649 "unnecessary static forward declaration for '%#T'",
4650 previous_declaration->type, symbol);
4653 unsigned new_storage_class = declaration->storage_class;
4655 if (is_type_incomplete(prev_type)) {
4656 previous_declaration->type = type;
4660 /* pretend no storage class means extern for function
4661 * declarations (except if the previous declaration is neither
4662 * none nor extern) */
4663 if (is_type_function(type)) {
4664 if (prev_type->function.unspecified_parameters) {
4665 previous_declaration->type = type;
4669 switch (old_storage_class) {
4670 case STORAGE_CLASS_NONE:
4671 old_storage_class = STORAGE_CLASS_EXTERN;
4674 case STORAGE_CLASS_EXTERN:
4675 if (is_definition) {
4676 if (warning.missing_prototypes &&
4677 prev_type->function.unspecified_parameters &&
4678 !is_sym_main(symbol)) {
4679 warningf(&declaration->source_position,
4680 "no previous prototype for '%#T'",
4683 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4684 new_storage_class = STORAGE_CLASS_EXTERN;
4693 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4694 new_storage_class == STORAGE_CLASS_EXTERN) {
4695 warn_redundant_declaration:
4696 if (!is_definition &&
4697 warning.redundant_decls &&
4698 is_type_valid(prev_type) &&
4699 strcmp(previous_declaration->source_position.input_name, "<builtin>") != 0) {
4700 warningf(&declaration->source_position,
4701 "redundant declaration for '%Y' (declared %P)",
4702 symbol, &previous_declaration->source_position);
4704 } else if (current_function == NULL) {
4705 if (old_storage_class != STORAGE_CLASS_STATIC &&
4706 new_storage_class == STORAGE_CLASS_STATIC) {
4707 errorf(&declaration->source_position,
4708 "static declaration of '%Y' follows non-static declaration (declared %P)",
4709 symbol, &previous_declaration->source_position);
4710 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4711 previous_declaration->storage_class = STORAGE_CLASS_NONE;
4712 previous_declaration->declared_storage_class = STORAGE_CLASS_NONE;
4714 goto warn_redundant_declaration;
4716 } else if (is_type_valid(prev_type)) {
4717 if (old_storage_class == new_storage_class) {
4718 errorf(&declaration->source_position,
4719 "redeclaration of '%Y' (declared %P)",
4720 symbol, &previous_declaration->source_position);
4722 errorf(&declaration->source_position,
4723 "redeclaration of '%Y' with different linkage (declared %P)",
4724 symbol, &previous_declaration->source_position);
4729 previous_declaration->modifiers |= declaration->modifiers;
4730 previous_declaration->is_inline |= declaration->is_inline;
4731 return previous_declaration;
4732 } else if (is_type_function(type)) {
4733 if (is_definition &&
4734 declaration->storage_class != STORAGE_CLASS_STATIC) {
4735 if (warning.missing_prototypes && !is_sym_main(symbol)) {
4736 warningf(&declaration->source_position,
4737 "no previous prototype for '%#T'", orig_type, symbol);
4738 } else if (warning.missing_declarations && !is_sym_main(symbol)) {
4739 warningf(&declaration->source_position,
4740 "no previous declaration for '%#T'", orig_type,
4745 if (warning.missing_declarations &&
4746 scope == file_scope && (
4747 declaration->storage_class == STORAGE_CLASS_NONE ||
4748 declaration->storage_class == STORAGE_CLASS_THREAD
4750 warningf(&declaration->source_position,
4751 "no previous declaration for '%#T'", orig_type, symbol);
4755 assert(declaration->parent_scope == NULL);
4756 assert(scope != NULL);
4758 declaration->parent_scope = scope;
4760 environment_push(declaration);
4761 return append_declaration(declaration);
4764 static void parser_error_multiple_definition(declaration_t *declaration,
4765 const source_position_t *source_position)
4767 errorf(source_position, "multiple definition of symbol '%Y' (declared %P)",
4768 declaration->symbol, &declaration->source_position);
4771 static bool is_declaration_specifier(const token_t *token,
4772 bool only_specifiers_qualifiers)
4774 switch (token->type) {
4779 return is_typedef_symbol(token->v.symbol);
4781 case T___extension__:
4783 return !only_specifiers_qualifiers;
4790 static void parse_init_declarator_rest(declaration_t *declaration)
4794 type_t *orig_type = declaration->type;
4795 type_t *type = skip_typeref(orig_type);
4797 if (declaration->init.initializer != NULL) {
4798 parser_error_multiple_definition(declaration, HERE);
4801 bool must_be_constant = false;
4802 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
4803 declaration->storage_class == STORAGE_CLASS_THREAD_STATIC ||
4804 declaration->parent_scope == file_scope) {
4805 must_be_constant = true;
4808 if (is_type_function(type)) {
4809 errorf(&declaration->source_position,
4810 "function '%#T' is initialized like a variable",
4811 orig_type, declaration->symbol);
4812 orig_type = type_error_type;
4815 parse_initializer_env_t env;
4816 env.type = orig_type;
4817 env.must_be_constant = must_be_constant;
4818 env.declaration = current_init_decl = declaration;
4820 initializer_t *initializer = parse_initializer(&env);
4821 current_init_decl = NULL;
4823 if (!is_type_function(type)) {
4824 /* § 6.7.5 (22) array initializers for arrays with unknown size determine
4825 * the array type size */
4826 declaration->type = env.type;
4827 declaration->init.initializer = initializer;
4831 /* parse rest of a declaration without any declarator */
4832 static void parse_anonymous_declaration_rest(
4833 const declaration_specifiers_t *specifiers)
4837 if (specifiers->declared_storage_class != STORAGE_CLASS_NONE) {
4838 warningf(&specifiers->source_position,
4839 "useless storage class in empty declaration");
4842 type_t *type = specifiers->type;
4843 switch (type->kind) {
4844 case TYPE_COMPOUND_STRUCT:
4845 case TYPE_COMPOUND_UNION: {
4846 if (type->compound.declaration->symbol == NULL) {
4847 warningf(&specifiers->source_position,
4848 "unnamed struct/union that defines no instances");
4857 warningf(&specifiers->source_position, "empty declaration");
4861 #ifdef RECORD_EMPTY_DECLARATIONS
4862 declaration_t *const declaration = allocate_declaration_zero();
4863 declaration->type = specifiers->type;
4864 declaration->declared_storage_class = specifiers->declared_storage_class;
4865 declaration->source_position = specifiers->source_position;
4866 declaration->modifiers = specifiers->modifiers;
4867 declaration->storage_class = STORAGE_CLASS_NONE;
4869 append_declaration(declaration);
4873 static void parse_declaration_rest(declaration_t *ndeclaration,
4874 const declaration_specifiers_t *specifiers,
4875 parsed_declaration_func finished_declaration)
4877 add_anchor_token(';');
4878 add_anchor_token(',');
4880 declaration_t *declaration =
4881 finished_declaration(ndeclaration, token.type == '=');
4883 type_t *orig_type = declaration->type;
4884 type_t *type = skip_typeref(orig_type);
4886 if (type->kind != TYPE_FUNCTION &&
4887 declaration->is_inline &&
4888 is_type_valid(type)) {
4889 warningf(&declaration->source_position,
4890 "variable '%Y' declared 'inline'\n", declaration->symbol);
4893 if (token.type == '=') {
4894 parse_init_declarator_rest(declaration);
4897 if (token.type != ',')
4901 add_anchor_token('=');
4902 ndeclaration = parse_declarator(specifiers, /*may_be_abstract=*/false);
4903 rem_anchor_token('=');
4908 rem_anchor_token(';');
4909 rem_anchor_token(',');
4912 static declaration_t *finished_kr_declaration(declaration_t *declaration, bool is_definition)
4914 symbol_t *symbol = declaration->symbol;
4915 if (symbol == NULL) {
4916 errorf(HERE, "anonymous declaration not valid as function parameter");
4919 namespace_t namespc = (namespace_t) declaration->namespc;
4920 if (namespc != NAMESPACE_NORMAL) {
4921 return record_declaration(declaration, false);
4924 declaration_t *previous_declaration = get_declaration(symbol, namespc);
4925 if (previous_declaration == NULL ||
4926 previous_declaration->parent_scope != scope) {
4927 errorf(HERE, "expected declaration of a function parameter, found '%Y'",
4932 if (is_definition) {
4933 errorf(HERE, "parameter %Y is initialised", declaration->symbol);
4936 if (previous_declaration->type == NULL) {
4937 previous_declaration->type = declaration->type;
4938 previous_declaration->declared_storage_class = declaration->declared_storage_class;
4939 previous_declaration->storage_class = declaration->storage_class;
4940 previous_declaration->parent_scope = scope;
4941 return previous_declaration;
4943 return record_declaration(declaration, false);
4947 static void parse_declaration(parsed_declaration_func finished_declaration)
4949 declaration_specifiers_t specifiers;
4950 memset(&specifiers, 0, sizeof(specifiers));
4952 add_anchor_token(';');
4953 parse_declaration_specifiers(&specifiers);
4954 rem_anchor_token(';');
4956 if (token.type == ';') {
4957 parse_anonymous_declaration_rest(&specifiers);
4959 declaration_t *declaration = parse_declarator(&specifiers, /*may_be_abstract=*/false);
4960 parse_declaration_rest(declaration, &specifiers, finished_declaration);
4964 static type_t *get_default_promoted_type(type_t *orig_type)
4966 type_t *result = orig_type;
4968 type_t *type = skip_typeref(orig_type);
4969 if (is_type_integer(type)) {
4970 result = promote_integer(type);
4971 } else if (type == type_float) {
4972 result = type_double;
4978 static void parse_kr_declaration_list(declaration_t *declaration)
4980 type_t *type = skip_typeref(declaration->type);
4981 if (!is_type_function(type))
4984 if (!type->function.kr_style_parameters)
4987 add_anchor_token('{');
4989 /* push function parameters */
4990 size_t const top = environment_top();
4991 scope_push(&declaration->scope);
4993 declaration_t *parameter = declaration->scope.declarations;
4994 for ( ; parameter != NULL; parameter = parameter->next) {
4995 assert(parameter->parent_scope == NULL);
4996 parameter->parent_scope = scope;
4997 environment_push(parameter);
5000 /* parse declaration list */
5001 while (is_declaration_specifier(&token, false)) {
5002 parse_declaration(finished_kr_declaration);
5005 /* pop function parameters */
5006 assert(scope == &declaration->scope);
5008 environment_pop_to(top);
5010 /* update function type */
5011 type_t *new_type = duplicate_type(type);
5013 function_parameter_t *parameters = NULL;
5014 function_parameter_t *last_parameter = NULL;
5016 declaration_t *parameter_declaration = declaration->scope.declarations;
5017 for( ; parameter_declaration != NULL;
5018 parameter_declaration = parameter_declaration->next) {
5019 type_t *parameter_type = parameter_declaration->type;
5020 if (parameter_type == NULL) {
5022 errorf(HERE, "no type specified for function parameter '%Y'",
5023 parameter_declaration->symbol);
5025 if (warning.implicit_int) {
5026 warningf(HERE, "no type specified for function parameter '%Y', using 'int'",
5027 parameter_declaration->symbol);
5029 parameter_type = type_int;
5030 parameter_declaration->type = parameter_type;
5034 semantic_parameter(parameter_declaration);
5035 parameter_type = parameter_declaration->type;
5038 * we need the default promoted types for the function type
5040 parameter_type = get_default_promoted_type(parameter_type);
5042 function_parameter_t *function_parameter
5043 = obstack_alloc(type_obst, sizeof(function_parameter[0]));
5044 memset(function_parameter, 0, sizeof(function_parameter[0]));
5046 function_parameter->type = parameter_type;
5047 if (last_parameter != NULL) {
5048 last_parameter->next = function_parameter;
5050 parameters = function_parameter;
5052 last_parameter = function_parameter;
5055 /* § 6.9.1.7: A K&R style parameter list does NOT act as a function
5057 new_type->function.parameters = parameters;
5058 new_type->function.unspecified_parameters = true;
5060 type = typehash_insert(new_type);
5061 if (type != new_type) {
5062 obstack_free(type_obst, new_type);
5065 declaration->type = type;
5067 rem_anchor_token('{');
5070 static bool first_err = true;
5073 * When called with first_err set, prints the name of the current function,
5076 static void print_in_function(void)
5080 diagnosticf("%s: In function '%Y':\n",
5081 current_function->source_position.input_name,
5082 current_function->symbol);
5087 * Check if all labels are defined in the current function.
5088 * Check if all labels are used in the current function.
5090 static void check_labels(void)
5092 for (const goto_statement_t *goto_statement = goto_first;
5093 goto_statement != NULL;
5094 goto_statement = goto_statement->next) {
5095 /* skip computed gotos */
5096 if (goto_statement->expression != NULL)
5099 declaration_t *label = goto_statement->label;
5102 if (label->source_position.input_name == NULL) {
5103 print_in_function();
5104 errorf(&goto_statement->base.source_position,
5105 "label '%Y' used but not defined", label->symbol);
5108 goto_first = goto_last = NULL;
5110 if (warning.unused_label) {
5111 for (const label_statement_t *label_statement = label_first;
5112 label_statement != NULL;
5113 label_statement = label_statement->next) {
5114 const declaration_t *label = label_statement->label;
5116 if (! label->used) {
5117 print_in_function();
5118 warningf(&label_statement->base.source_position,
5119 "label '%Y' defined but not used", label->symbol);
5123 label_first = label_last = NULL;
5126 static void warn_unused_decl(declaration_t *decl, declaration_t *end, char const *const what)
5128 for (; decl != NULL; decl = decl->next) {
5133 print_in_function();
5134 warningf(&decl->source_position, "%s '%Y' is unused", what, decl->symbol);
5135 } else if (!decl->read) {
5136 print_in_function();
5137 warningf(&decl->source_position, "%s '%Y' is never read", what, decl->symbol);
5145 static void check_unused_variables(statement_t *const stmt, void *const env)
5149 switch (stmt->kind) {
5150 case STATEMENT_DECLARATION: {
5151 declaration_statement_t const *const decls = &stmt->declaration;
5152 warn_unused_decl(decls->declarations_begin, decls->declarations_end, "variable");
5157 warn_unused_decl(stmt->fors.scope.declarations, NULL, "variable");
5166 * Check declarations of current_function for unused entities.
5168 static void check_declarations(void)
5170 if (warning.unused_parameter) {
5171 const scope_t *scope = ¤t_function->scope;
5173 /* do not issue unused warnings for main */
5174 if (!is_sym_main(current_function->symbol)) {
5175 warn_unused_decl(scope->declarations, NULL, "parameter");
5178 if (warning.unused_variable) {
5179 walk_statements(current_function->init.statement, check_unused_variables, NULL);
5183 static int determine_truth(expression_t const* const cond)
5186 !is_constant_expression(cond) ? 0 :
5187 fold_constant(cond) != 0 ? 1 :
5191 static bool noreturn_candidate;
5193 static void check_reachable(statement_t *const stmt)
5195 if (stmt->base.reachable)
5197 if (stmt->kind != STATEMENT_DO_WHILE)
5198 stmt->base.reachable = true;
5200 statement_t *last = stmt;
5202 switch (stmt->kind) {
5203 case STATEMENT_INVALID:
5204 case STATEMENT_EMPTY:
5205 case STATEMENT_DECLARATION:
5207 next = stmt->base.next;
5210 case STATEMENT_COMPOUND:
5211 next = stmt->compound.statements;
5214 case STATEMENT_RETURN:
5215 noreturn_candidate = false;
5218 case STATEMENT_IF: {
5219 if_statement_t const* const ifs = &stmt->ifs;
5220 int const val = determine_truth(ifs->condition);
5223 check_reachable(ifs->true_statement);
5228 if (ifs->false_statement != NULL) {
5229 check_reachable(ifs->false_statement);
5233 next = stmt->base.next;
5237 case STATEMENT_SWITCH: {
5238 switch_statement_t const *const switchs = &stmt->switchs;
5239 expression_t const *const expr = switchs->expression;
5241 if (is_constant_expression(expr)) {
5242 long const val = fold_constant(expr);
5243 case_label_statement_t * defaults = NULL;
5244 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5245 if (i->expression == NULL) {
5250 if (i->first_case <= val && val <= i->last_case) {
5251 check_reachable((statement_t*)i);
5256 if (defaults != NULL) {
5257 check_reachable((statement_t*)defaults);
5261 bool has_default = false;
5262 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5263 if (i->expression == NULL)
5266 check_reachable((statement_t*)i);
5273 next = stmt->base.next;
5277 case STATEMENT_EXPRESSION: {
5278 /* Check for noreturn function call */
5279 expression_t const *const expr = stmt->expression.expression;
5280 if (expr->kind == EXPR_CALL) {
5281 expression_t const *const func = expr->call.function;
5282 if (func->kind == EXPR_REFERENCE) {
5283 declaration_t const *const decl = func->reference.declaration;
5284 if (decl != NULL && decl->modifiers & DM_NORETURN) {
5290 next = stmt->base.next;
5294 case STATEMENT_CONTINUE: {
5295 statement_t *parent = stmt;
5297 parent = parent->base.parent;
5298 if (parent == NULL) /* continue not within loop */
5302 switch (parent->kind) {
5303 case STATEMENT_WHILE: goto continue_while;
5304 case STATEMENT_DO_WHILE: goto continue_do_while;
5305 case STATEMENT_FOR: goto continue_for;
5312 case STATEMENT_BREAK: {
5313 statement_t *parent = stmt;
5315 parent = parent->base.parent;
5316 if (parent == NULL) /* break not within loop/switch */
5319 switch (parent->kind) {
5320 case STATEMENT_SWITCH:
5321 case STATEMENT_WHILE:
5322 case STATEMENT_DO_WHILE:
5325 next = parent->base.next;
5326 goto found_break_parent;
5335 case STATEMENT_GOTO:
5336 if (stmt->gotos.expression) {
5337 statement_t *parent = stmt->base.parent;
5338 if (parent == NULL) /* top level goto */
5342 next = stmt->gotos.label->init.statement;
5343 if (next == NULL) /* missing label */
5348 case STATEMENT_LABEL:
5349 next = stmt->label.statement;
5352 case STATEMENT_CASE_LABEL:
5353 next = stmt->case_label.statement;
5356 case STATEMENT_WHILE: {
5357 while_statement_t const *const whiles = &stmt->whiles;
5358 int const val = determine_truth(whiles->condition);
5361 check_reachable(whiles->body);
5366 next = stmt->base.next;
5370 case STATEMENT_DO_WHILE:
5371 next = stmt->do_while.body;
5374 case STATEMENT_FOR: {
5375 for_statement_t *const fors = &stmt->fors;
5377 if (fors->condition_reachable)
5379 fors->condition_reachable = true;
5381 expression_t const *const cond = fors->condition;
5383 cond == NULL ? 1 : determine_truth(cond);
5386 check_reachable(fors->body);
5391 next = stmt->base.next;
5395 case STATEMENT_MS_TRY: {
5396 ms_try_statement_t const *const ms_try = &stmt->ms_try;
5397 check_reachable(ms_try->try_statement);
5398 next = ms_try->final_statement;
5402 case STATEMENT_LEAVE: {
5403 statement_t *parent = stmt;
5405 parent = parent->base.parent;
5406 if (parent == NULL) /* __leave not within __try */
5409 if (parent->kind == STATEMENT_MS_TRY) {
5411 next = parent->ms_try.final_statement;
5419 while (next == NULL) {
5420 next = last->base.parent;
5422 noreturn_candidate = false;
5424 type_t *const type = current_function->type;
5425 assert(is_type_function(type));
5426 type_t *const ret = skip_typeref(type->function.return_type);
5427 if (warning.return_type &&
5428 !is_type_atomic(ret, ATOMIC_TYPE_VOID) &&
5429 is_type_valid(ret) &&
5430 !is_sym_main(current_function->symbol)) {
5431 warningf(&stmt->base.source_position,
5432 "control reaches end of non-void function");
5437 switch (next->kind) {
5438 case STATEMENT_INVALID:
5439 case STATEMENT_EMPTY:
5440 case STATEMENT_DECLARATION:
5441 case STATEMENT_EXPRESSION:
5443 case STATEMENT_RETURN:
5444 case STATEMENT_CONTINUE:
5445 case STATEMENT_BREAK:
5446 case STATEMENT_GOTO:
5447 case STATEMENT_LEAVE:
5448 panic("invalid control flow in function");
5450 case STATEMENT_COMPOUND:
5452 case STATEMENT_SWITCH:
5453 case STATEMENT_LABEL:
5454 case STATEMENT_CASE_LABEL:
5456 next = next->base.next;
5459 case STATEMENT_WHILE: {
5461 if (next->base.reachable)
5463 next->base.reachable = true;
5465 while_statement_t const *const whiles = &next->whiles;
5466 int const val = determine_truth(whiles->condition);
5469 check_reachable(whiles->body);
5475 next = next->base.next;
5479 case STATEMENT_DO_WHILE: {
5481 if (next->base.reachable)
5483 next->base.reachable = true;
5485 do_while_statement_t const *const dw = &next->do_while;
5486 int const val = determine_truth(dw->condition);
5489 check_reachable(dw->body);
5495 next = next->base.next;
5499 case STATEMENT_FOR: {
5501 for_statement_t *const fors = &next->fors;
5503 fors->step_reachable = true;
5505 if (fors->condition_reachable)
5507 fors->condition_reachable = true;
5509 expression_t const *const cond = fors->condition;
5511 cond == NULL ? 1 : determine_truth(cond);
5514 check_reachable(fors->body);
5520 next = next->base.next;
5524 case STATEMENT_MS_TRY:
5526 next = next->ms_try.final_statement;
5532 next = stmt->base.parent;
5534 warningf(&stmt->base.source_position,
5535 "control reaches end of non-void function");
5539 check_reachable(next);
5542 static void check_unreachable(statement_t* const stmt, void *const env)
5546 switch (stmt->kind) {
5547 case STATEMENT_DO_WHILE:
5548 if (!stmt->base.reachable) {
5549 expression_t const *const cond = stmt->do_while.condition;
5550 if (determine_truth(cond) >= 0) {
5551 warningf(&cond->base.source_position,
5552 "condition of do-while-loop is unreachable");
5557 case STATEMENT_FOR: {
5558 for_statement_t const* const fors = &stmt->fors;
5560 // if init and step are unreachable, cond is unreachable, too
5561 if (!stmt->base.reachable && !fors->step_reachable) {
5562 warningf(&stmt->base.source_position, "statement is unreachable");
5564 if (!stmt->base.reachable && fors->initialisation != NULL) {
5565 warningf(&fors->initialisation->base.source_position,
5566 "initialisation of for-statement is unreachable");
5569 if (!fors->condition_reachable && fors->condition != NULL) {
5570 warningf(&fors->condition->base.source_position,
5571 "condition of for-statement is unreachable");
5574 if (!fors->step_reachable && fors->step != NULL) {
5575 warningf(&fors->step->base.source_position,
5576 "step of for-statement is unreachable");
5582 case STATEMENT_COMPOUND:
5583 if (stmt->compound.statements != NULL)
5588 if (!stmt->base.reachable)
5589 warningf(&stmt->base.source_position, "statement is unreachable");
5594 static void parse_external_declaration(void)
5596 /* function-definitions and declarations both start with declaration
5598 declaration_specifiers_t specifiers;
5599 memset(&specifiers, 0, sizeof(specifiers));
5601 add_anchor_token(';');
5602 parse_declaration_specifiers(&specifiers);
5603 rem_anchor_token(';');
5605 /* must be a declaration */
5606 if (token.type == ';') {
5607 parse_anonymous_declaration_rest(&specifiers);
5611 add_anchor_token(',');
5612 add_anchor_token('=');
5613 add_anchor_token(';');
5614 add_anchor_token('{');
5616 /* declarator is common to both function-definitions and declarations */
5617 declaration_t *ndeclaration = parse_declarator(&specifiers, /*may_be_abstract=*/false);
5619 rem_anchor_token('{');
5620 rem_anchor_token(';');
5621 rem_anchor_token('=');
5622 rem_anchor_token(',');
5624 /* must be a declaration */
5625 switch (token.type) {
5629 parse_declaration_rest(ndeclaration, &specifiers, record_declaration);
5633 /* must be a function definition */
5634 parse_kr_declaration_list(ndeclaration);
5636 if (token.type != '{') {
5637 parse_error_expected("while parsing function definition", '{', NULL);
5638 eat_until_matching_token(';');
5642 type_t *type = ndeclaration->type;
5644 /* note that we don't skip typerefs: the standard doesn't allow them here
5645 * (so we can't use is_type_function here) */
5646 if (type->kind != TYPE_FUNCTION) {
5647 if (is_type_valid(type)) {
5648 errorf(HERE, "declarator '%#T' has a body but is not a function type",
5649 type, ndeclaration->symbol);
5655 if (warning.aggregate_return &&
5656 is_type_compound(skip_typeref(type->function.return_type))) {
5657 warningf(HERE, "function '%Y' returns an aggregate",
5658 ndeclaration->symbol);
5660 if (warning.traditional && !type->function.unspecified_parameters) {
5661 warningf(HERE, "traditional C rejects ISO C style function definition of function '%Y'",
5662 ndeclaration->symbol);
5664 if (warning.old_style_definition && type->function.unspecified_parameters) {
5665 warningf(HERE, "old-style function definition '%Y'",
5666 ndeclaration->symbol);
5669 /* § 6.7.5.3 (14) a function definition with () means no
5670 * parameters (and not unspecified parameters) */
5671 if (type->function.unspecified_parameters
5672 && type->function.parameters == NULL
5673 && !type->function.kr_style_parameters) {
5674 type_t *duplicate = duplicate_type(type);
5675 duplicate->function.unspecified_parameters = false;
5677 type = typehash_insert(duplicate);
5678 if (type != duplicate) {
5679 obstack_free(type_obst, duplicate);
5681 ndeclaration->type = type;
5684 declaration_t *const declaration = record_declaration(ndeclaration, true);
5685 if (ndeclaration != declaration) {
5686 declaration->scope = ndeclaration->scope;
5688 type = skip_typeref(declaration->type);
5690 /* push function parameters and switch scope */
5691 size_t const top = environment_top();
5692 scope_push(&declaration->scope);
5694 declaration_t *parameter = declaration->scope.declarations;
5695 for( ; parameter != NULL; parameter = parameter->next) {
5696 if (parameter->parent_scope == &ndeclaration->scope) {
5697 parameter->parent_scope = scope;
5699 assert(parameter->parent_scope == NULL
5700 || parameter->parent_scope == scope);
5701 parameter->parent_scope = scope;
5702 if (parameter->symbol == NULL) {
5703 errorf(¶meter->source_position, "parameter name omitted");
5706 environment_push(parameter);
5709 if (declaration->init.statement != NULL) {
5710 parser_error_multiple_definition(declaration, HERE);
5713 /* parse function body */
5714 int label_stack_top = label_top();
5715 declaration_t *old_current_function = current_function;
5716 current_function = declaration;
5717 current_parent = NULL;
5719 statement_t *const body = parse_compound_statement(false);
5720 declaration->init.statement = body;
5723 check_declarations();
5724 if (warning.return_type ||
5725 warning.unreachable_code ||
5726 (warning.missing_noreturn && !(declaration->modifiers & DM_NORETURN))) {
5727 noreturn_candidate = true;
5728 check_reachable(body);
5729 if (warning.unreachable_code)
5730 walk_statements(body, check_unreachable, NULL);
5731 if (warning.missing_noreturn &&
5732 noreturn_candidate &&
5733 !(declaration->modifiers & DM_NORETURN)) {
5734 warningf(&body->base.source_position,
5735 "function '%#T' is candidate for attribute 'noreturn'",
5736 type, declaration->symbol);
5740 assert(current_parent == NULL);
5741 assert(current_function == declaration);
5742 current_function = old_current_function;
5743 label_pop_to(label_stack_top);
5746 assert(scope == &declaration->scope);
5748 environment_pop_to(top);
5751 static type_t *make_bitfield_type(type_t *base_type, expression_t *size,
5752 source_position_t *source_position,
5753 const symbol_t *symbol)
5755 type_t *type = allocate_type_zero(TYPE_BITFIELD, source_position);
5757 type->bitfield.base_type = base_type;
5758 type->bitfield.size_expression = size;
5761 type_t *skipped_type = skip_typeref(base_type);
5762 if (!is_type_integer(skipped_type)) {
5763 errorf(HERE, "bitfield base type '%T' is not an integer type",
5767 bit_size = skipped_type->base.size * 8;
5770 if (is_constant_expression(size)) {
5771 long v = fold_constant(size);
5774 errorf(source_position, "negative width in bit-field '%Y'",
5776 } else if (v == 0) {
5777 errorf(source_position, "zero width for bit-field '%Y'",
5779 } else if (bit_size > 0 && (il_size_t)v > bit_size) {
5780 errorf(source_position, "width of '%Y' exceeds its type",
5783 type->bitfield.bit_size = v;
5790 static declaration_t *find_compound_entry(declaration_t *compound_declaration,
5793 declaration_t *iter = compound_declaration->scope.declarations;
5794 for( ; iter != NULL; iter = iter->next) {
5795 if (iter->namespc != NAMESPACE_NORMAL)
5798 if (iter->symbol == NULL) {
5799 type_t *type = skip_typeref(iter->type);
5800 if (is_type_compound(type)) {
5801 declaration_t *result
5802 = find_compound_entry(type->compound.declaration, symbol);
5809 if (iter->symbol == symbol) {
5817 static void parse_compound_declarators(declaration_t *struct_declaration,
5818 const declaration_specifiers_t *specifiers)
5820 declaration_t *last_declaration = struct_declaration->scope.declarations;
5821 if (last_declaration != NULL) {
5822 while (last_declaration->next != NULL) {
5823 last_declaration = last_declaration->next;
5828 declaration_t *declaration;
5830 if (token.type == ':') {
5831 source_position_t source_position = *HERE;
5834 type_t *base_type = specifiers->type;
5835 expression_t *size = parse_constant_expression();
5837 type_t *type = make_bitfield_type(base_type, size,
5838 &source_position, sym_anonymous);
5840 declaration = allocate_declaration_zero();
5841 declaration->namespc = NAMESPACE_NORMAL;
5842 declaration->declared_storage_class = STORAGE_CLASS_NONE;
5843 declaration->storage_class = STORAGE_CLASS_NONE;
5844 declaration->source_position = source_position;
5845 declaration->modifiers = specifiers->modifiers;
5846 declaration->type = type;
5848 declaration = parse_declarator(specifiers,/*may_be_abstract=*/true);
5850 type_t *orig_type = declaration->type;
5851 type_t *type = skip_typeref(orig_type);
5853 if (token.type == ':') {
5854 source_position_t source_position = *HERE;
5856 expression_t *size = parse_constant_expression();
5858 type_t *bitfield_type = make_bitfield_type(orig_type, size,
5859 &source_position, declaration->symbol);
5860 declaration->type = bitfield_type;
5862 /* TODO we ignore arrays for now... what is missing is a check
5863 * that they're at the end of the struct */
5864 if (is_type_incomplete(type) && !is_type_array(type)) {
5866 "compound member '%Y' has incomplete type '%T'",
5867 declaration->symbol, orig_type);
5868 } else if (is_type_function(type)) {
5869 errorf(HERE, "compound member '%Y' must not have function type '%T'",
5870 declaration->symbol, orig_type);
5875 /* make sure we don't define a symbol multiple times */
5876 symbol_t *symbol = declaration->symbol;
5877 if (symbol != NULL) {
5878 declaration_t *prev_decl
5879 = find_compound_entry(struct_declaration, symbol);
5881 if (prev_decl != NULL) {
5882 assert(prev_decl->symbol == symbol);
5883 errorf(&declaration->source_position,
5884 "multiple declarations of symbol '%Y' (declared %P)",
5885 symbol, &prev_decl->source_position);
5889 /* append declaration */
5890 if (last_declaration != NULL) {
5891 last_declaration->next = declaration;
5893 struct_declaration->scope.declarations = declaration;
5895 last_declaration = declaration;
5897 if (token.type != ',')
5907 static void parse_compound_type_entries(declaration_t *compound_declaration)
5910 add_anchor_token('}');
5912 while (token.type != '}') {
5913 if (token.type == T_EOF) {
5914 errorf(HERE, "EOF while parsing struct");
5917 declaration_specifiers_t specifiers;
5918 memset(&specifiers, 0, sizeof(specifiers));
5919 parse_declaration_specifiers(&specifiers);
5921 parse_compound_declarators(compound_declaration, &specifiers);
5923 rem_anchor_token('}');
5927 static type_t *parse_typename(void)
5929 declaration_specifiers_t specifiers;
5930 memset(&specifiers, 0, sizeof(specifiers));
5931 parse_declaration_specifiers(&specifiers);
5932 if (specifiers.declared_storage_class != STORAGE_CLASS_NONE) {
5933 /* TODO: improve error message, user does probably not know what a
5934 * storage class is...
5936 errorf(HERE, "typename may not have a storage class");
5939 type_t *result = parse_abstract_declarator(specifiers.type);
5947 typedef expression_t* (*parse_expression_function) (unsigned precedence);
5948 typedef expression_t* (*parse_expression_infix_function) (unsigned precedence,
5949 expression_t *left);
5951 typedef struct expression_parser_function_t expression_parser_function_t;
5952 struct expression_parser_function_t {
5953 unsigned precedence;
5954 parse_expression_function parser;
5955 unsigned infix_precedence;
5956 parse_expression_infix_function infix_parser;
5959 expression_parser_function_t expression_parsers[T_LAST_TOKEN];
5962 * Prints an error message if an expression was expected but not read
5964 static expression_t *expected_expression_error(void)
5966 /* skip the error message if the error token was read */
5967 if (token.type != T_ERROR) {
5968 errorf(HERE, "expected expression, got token '%K'", &token);
5972 return create_invalid_expression();
5976 * Parse a string constant.
5978 static expression_t *parse_string_const(void)
5981 if (token.type == T_STRING_LITERAL) {
5982 string_t res = token.v.string;
5984 while (token.type == T_STRING_LITERAL) {
5985 res = concat_strings(&res, &token.v.string);
5988 if (token.type != T_WIDE_STRING_LITERAL) {
5989 expression_t *const cnst = allocate_expression_zero(EXPR_STRING_LITERAL);
5990 /* note: that we use type_char_ptr here, which is already the
5991 * automatic converted type. revert_automatic_type_conversion
5992 * will construct the array type */
5993 cnst->base.type = warning.write_strings ? type_const_char_ptr : type_char_ptr;
5994 cnst->string.value = res;
5998 wres = concat_string_wide_string(&res, &token.v.wide_string);
6000 wres = token.v.wide_string;
6005 switch (token.type) {
6006 case T_WIDE_STRING_LITERAL:
6007 wres = concat_wide_strings(&wres, &token.v.wide_string);
6010 case T_STRING_LITERAL:
6011 wres = concat_wide_string_string(&wres, &token.v.string);
6015 expression_t *const cnst = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
6016 cnst->base.type = warning.write_strings ? type_const_wchar_t_ptr : type_wchar_t_ptr;
6017 cnst->wide_string.value = wres;
6026 * Parse an integer constant.
6028 static expression_t *parse_int_const(void)
6030 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
6031 cnst->base.source_position = *HERE;
6032 cnst->base.type = token.datatype;
6033 cnst->conste.v.int_value = token.v.intvalue;
6041 * Parse a character constant.
6043 static expression_t *parse_character_constant(void)
6045 expression_t *cnst = allocate_expression_zero(EXPR_CHARACTER_CONSTANT);
6047 cnst->base.source_position = *HERE;
6048 cnst->base.type = token.datatype;
6049 cnst->conste.v.character = token.v.string;
6051 if (cnst->conste.v.character.size != 1) {
6052 if (warning.multichar && GNU_MODE) {
6053 warningf(HERE, "multi-character character constant");
6055 errorf(HERE, "more than 1 characters in character constant");
6064 * Parse a wide character constant.
6066 static expression_t *parse_wide_character_constant(void)
6068 expression_t *cnst = allocate_expression_zero(EXPR_WIDE_CHARACTER_CONSTANT);
6070 cnst->base.source_position = *HERE;
6071 cnst->base.type = token.datatype;
6072 cnst->conste.v.wide_character = token.v.wide_string;
6074 if (cnst->conste.v.wide_character.size != 1) {
6075 if (warning.multichar && GNU_MODE) {
6076 warningf(HERE, "multi-character character constant");
6078 errorf(HERE, "more than 1 characters in character constant");
6087 * Parse a float constant.
6089 static expression_t *parse_float_const(void)
6091 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
6092 cnst->base.type = token.datatype;
6093 cnst->conste.v.float_value = token.v.floatvalue;
6100 static declaration_t *create_implicit_function(symbol_t *symbol,
6101 const source_position_t *source_position)
6103 type_t *ntype = allocate_type_zero(TYPE_FUNCTION, source_position);
6104 ntype->function.return_type = type_int;
6105 ntype->function.unspecified_parameters = true;
6107 type_t *type = typehash_insert(ntype);
6108 if (type != ntype) {
6112 declaration_t *const declaration = allocate_declaration_zero();
6113 declaration->storage_class = STORAGE_CLASS_EXTERN;
6114 declaration->declared_storage_class = STORAGE_CLASS_EXTERN;
6115 declaration->type = type;
6116 declaration->symbol = symbol;
6117 declaration->source_position = *source_position;
6118 declaration->implicit = true;
6120 bool strict_prototypes_old = warning.strict_prototypes;
6121 warning.strict_prototypes = false;
6122 record_declaration(declaration, false);
6123 warning.strict_prototypes = strict_prototypes_old;
6129 * Creates a return_type (func)(argument_type) function type if not
6132 static type_t *make_function_2_type(type_t *return_type, type_t *argument_type1,
6133 type_t *argument_type2)
6135 function_parameter_t *parameter2
6136 = obstack_alloc(type_obst, sizeof(parameter2[0]));
6137 memset(parameter2, 0, sizeof(parameter2[0]));
6138 parameter2->type = argument_type2;
6140 function_parameter_t *parameter1
6141 = obstack_alloc(type_obst, sizeof(parameter1[0]));
6142 memset(parameter1, 0, sizeof(parameter1[0]));
6143 parameter1->type = argument_type1;
6144 parameter1->next = parameter2;
6146 type_t *type = allocate_type_zero(TYPE_FUNCTION, &builtin_source_position);
6147 type->function.return_type = return_type;
6148 type->function.parameters = parameter1;
6150 type_t *result = typehash_insert(type);
6151 if (result != type) {
6159 * Creates a return_type (func)(argument_type) function type if not
6162 * @param return_type the return type
6163 * @param argument_type the argument type
6165 static type_t *make_function_1_type(type_t *return_type, type_t *argument_type)
6167 function_parameter_t *parameter
6168 = obstack_alloc(type_obst, sizeof(parameter[0]));
6169 memset(parameter, 0, sizeof(parameter[0]));
6170 parameter->type = argument_type;
6172 type_t *type = allocate_type_zero(TYPE_FUNCTION, &builtin_source_position);
6173 type->function.return_type = return_type;
6174 type->function.parameters = parameter;
6176 type_t *result = typehash_insert(type);
6177 if (result != type) {
6184 static type_t *make_function_0_type(type_t *return_type)
6186 type_t *type = allocate_type_zero(TYPE_FUNCTION, &builtin_source_position);
6187 type->function.return_type = return_type;
6188 type->function.parameters = NULL;
6190 type_t *result = typehash_insert(type);
6191 if (result != type) {
6199 * Creates a function type for some function like builtins.
6201 * @param symbol the symbol describing the builtin
6203 static type_t *get_builtin_symbol_type(symbol_t *symbol)
6205 switch(symbol->ID) {
6206 case T___builtin_alloca:
6207 return make_function_1_type(type_void_ptr, type_size_t);
6208 case T___builtin_huge_val:
6209 return make_function_0_type(type_double);
6210 case T___builtin_inf:
6211 return make_function_0_type(type_double);
6212 case T___builtin_inff:
6213 return make_function_0_type(type_float);
6214 case T___builtin_infl:
6215 return make_function_0_type(type_long_double);
6216 case T___builtin_nan:
6217 return make_function_1_type(type_double, type_char_ptr);
6218 case T___builtin_nanf:
6219 return make_function_1_type(type_float, type_char_ptr);
6220 case T___builtin_nanl:
6221 return make_function_1_type(type_long_double, type_char_ptr);
6222 case T___builtin_va_end:
6223 return make_function_1_type(type_void, type_valist);
6224 case T___builtin_expect:
6225 return make_function_2_type(type_long, type_long, type_long);
6227 internal_errorf(HERE, "not implemented builtin symbol found");
6232 * Performs automatic type cast as described in § 6.3.2.1.
6234 * @param orig_type the original type
6236 static type_t *automatic_type_conversion(type_t *orig_type)
6238 type_t *type = skip_typeref(orig_type);
6239 if (is_type_array(type)) {
6240 array_type_t *array_type = &type->array;
6241 type_t *element_type = array_type->element_type;
6242 unsigned qualifiers = array_type->base.qualifiers;
6244 return make_pointer_type(element_type, qualifiers);
6247 if (is_type_function(type)) {
6248 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
6255 * reverts the automatic casts of array to pointer types and function
6256 * to function-pointer types as defined § 6.3.2.1
6258 type_t *revert_automatic_type_conversion(const expression_t *expression)
6260 switch (expression->kind) {
6261 case EXPR_REFERENCE: return expression->reference.declaration->type;
6264 return get_qualified_type(expression->select.compound_entry->type,
6265 expression->base.type->base.qualifiers);
6267 case EXPR_UNARY_DEREFERENCE: {
6268 const expression_t *const value = expression->unary.value;
6269 type_t *const type = skip_typeref(value->base.type);
6270 assert(is_type_pointer(type));
6271 return type->pointer.points_to;
6274 case EXPR_BUILTIN_SYMBOL:
6275 return get_builtin_symbol_type(expression->builtin_symbol.symbol);
6277 case EXPR_ARRAY_ACCESS: {
6278 const expression_t *array_ref = expression->array_access.array_ref;
6279 type_t *type_left = skip_typeref(array_ref->base.type);
6280 if (!is_type_valid(type_left))
6282 assert(is_type_pointer(type_left));
6283 return type_left->pointer.points_to;
6286 case EXPR_STRING_LITERAL: {
6287 size_t size = expression->string.value.size;
6288 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
6291 case EXPR_WIDE_STRING_LITERAL: {
6292 size_t size = expression->wide_string.value.size;
6293 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
6296 case EXPR_COMPOUND_LITERAL:
6297 return expression->compound_literal.type;
6302 return expression->base.type;
6305 static expression_t *parse_reference(void)
6307 expression_t *expression = allocate_expression_zero(EXPR_REFERENCE);
6309 reference_expression_t *ref = &expression->reference;
6310 symbol_t *const symbol = token.v.symbol;
6312 declaration_t *declaration = get_declaration(symbol, NAMESPACE_NORMAL);
6314 if (declaration == NULL) {
6315 if (!strict_mode && look_ahead(1)->type == '(') {
6316 /* an implicitly declared function */
6317 if (warning.implicit_function_declaration) {
6318 warningf(HERE, "implicit declaration of function '%Y'",
6322 declaration = create_implicit_function(symbol, HERE);
6324 errorf(HERE, "unknown symbol '%Y' found.", symbol);
6325 declaration = create_error_declaration(symbol, STORAGE_CLASS_NONE);
6329 type_t *orig_type = declaration->type;
6331 /* we always do the auto-type conversions; the & and sizeof parser contains
6332 * code to revert this! */
6333 type_t *type = automatic_type_conversion(orig_type);
6335 ref->declaration = declaration;
6336 ref->base.type = type;
6338 /* this declaration is used */
6339 declaration->used = true;
6341 if (declaration->parent_scope != file_scope &&
6342 declaration->parent_scope->depth < current_function->scope.depth &&
6343 is_type_valid(orig_type) && !is_type_function(orig_type)) {
6344 /* access of a variable from an outer function */
6345 declaration->address_taken = true;
6346 ref->is_outer_ref = true;
6347 current_function->need_closure = true;
6350 /* check for deprecated functions */
6351 if (warning.deprecated_declarations &&
6352 declaration->modifiers & DM_DEPRECATED) {
6353 char const *const prefix = is_type_function(declaration->type) ?
6354 "function" : "variable";
6356 if (declaration->deprecated_string != NULL) {
6357 warningf(HERE, "%s '%Y' is deprecated (declared %P): \"%s\"",
6358 prefix, declaration->symbol, &declaration->source_position,
6359 declaration->deprecated_string);
6361 warningf(HERE, "%s '%Y' is deprecated (declared %P)", prefix,
6362 declaration->symbol, &declaration->source_position);
6365 if (warning.init_self && declaration == current_init_decl && !in_type_prop) {
6366 current_init_decl = NULL;
6367 warningf(HERE, "variable '%#T' is initialized by itself",
6368 declaration->type, declaration->symbol);
6375 static bool semantic_cast(expression_t *cast)
6377 expression_t *expression = cast->unary.value;
6378 type_t *orig_dest_type = cast->base.type;
6379 type_t *orig_type_right = expression->base.type;
6380 type_t const *dst_type = skip_typeref(orig_dest_type);
6381 type_t const *src_type = skip_typeref(orig_type_right);
6382 source_position_t const *pos = &cast->base.source_position;
6384 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
6385 if (dst_type == type_void)
6388 /* only integer and pointer can be casted to pointer */
6389 if (is_type_pointer(dst_type) &&
6390 !is_type_pointer(src_type) &&
6391 !is_type_integer(src_type) &&
6392 is_type_valid(src_type)) {
6393 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
6397 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
6398 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
6402 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
6403 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
6407 if (warning.cast_qual &&
6408 is_type_pointer(src_type) &&
6409 is_type_pointer(dst_type)) {
6410 type_t *src = skip_typeref(src_type->pointer.points_to);
6411 type_t *dst = skip_typeref(dst_type->pointer.points_to);
6412 unsigned missing_qualifiers =
6413 src->base.qualifiers & ~dst->base.qualifiers;
6414 if (missing_qualifiers != 0) {
6416 "cast discards qualifiers '%Q' in pointer target type of '%T'",
6417 missing_qualifiers, orig_type_right);
6423 static expression_t *parse_compound_literal(type_t *type)
6425 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
6427 parse_initializer_env_t env;
6429 env.declaration = NULL;
6430 env.must_be_constant = false;
6431 initializer_t *initializer = parse_initializer(&env);
6434 expression->compound_literal.initializer = initializer;
6435 expression->compound_literal.type = type;
6436 expression->base.type = automatic_type_conversion(type);
6442 * Parse a cast expression.
6444 static expression_t *parse_cast(void)
6446 add_anchor_token(')');
6448 source_position_t source_position = token.source_position;
6450 type_t *type = parse_typename();
6452 rem_anchor_token(')');
6455 if (token.type == '{') {
6456 return parse_compound_literal(type);
6459 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
6460 cast->base.source_position = source_position;
6462 expression_t *value = parse_sub_expression(20);
6463 cast->base.type = type;
6464 cast->unary.value = value;
6466 if (! semantic_cast(cast)) {
6467 /* TODO: record the error in the AST. else it is impossible to detect it */
6472 return create_invalid_expression();
6476 * Parse a statement expression.
6478 static expression_t *parse_statement_expression(void)
6480 add_anchor_token(')');
6482 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6484 statement_t *statement = parse_compound_statement(true);
6485 expression->statement.statement = statement;
6486 expression->base.source_position = statement->base.source_position;
6488 /* find last statement and use its type */
6489 type_t *type = type_void;
6490 const statement_t *stmt = statement->compound.statements;
6492 while (stmt->base.next != NULL)
6493 stmt = stmt->base.next;
6495 if (stmt->kind == STATEMENT_EXPRESSION) {
6496 type = stmt->expression.expression->base.type;
6499 warningf(&expression->base.source_position, "empty statement expression ({})");
6501 expression->base.type = type;
6503 rem_anchor_token(')');
6511 * Parse a parenthesized expression.
6513 static expression_t *parse_parenthesized_expression(void)
6517 switch(token.type) {
6519 /* gcc extension: a statement expression */
6520 return parse_statement_expression();
6524 return parse_cast();
6526 if (is_typedef_symbol(token.v.symbol)) {
6527 return parse_cast();
6531 add_anchor_token(')');
6532 expression_t *result = parse_expression();
6533 rem_anchor_token(')');
6540 static expression_t *parse_function_keyword(void)
6545 if (current_function == NULL) {
6546 errorf(HERE, "'__func__' used outside of a function");
6549 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6550 expression->base.type = type_char_ptr;
6551 expression->funcname.kind = FUNCNAME_FUNCTION;
6556 static expression_t *parse_pretty_function_keyword(void)
6558 eat(T___PRETTY_FUNCTION__);
6560 if (current_function == NULL) {
6561 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
6564 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6565 expression->base.type = type_char_ptr;
6566 expression->funcname.kind = FUNCNAME_PRETTY_FUNCTION;
6571 static expression_t *parse_funcsig_keyword(void)
6575 if (current_function == NULL) {
6576 errorf(HERE, "'__FUNCSIG__' used outside of a function");
6579 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6580 expression->base.type = type_char_ptr;
6581 expression->funcname.kind = FUNCNAME_FUNCSIG;
6586 static expression_t *parse_funcdname_keyword(void)
6588 eat(T___FUNCDNAME__);
6590 if (current_function == NULL) {
6591 errorf(HERE, "'__FUNCDNAME__' used outside of a function");
6594 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6595 expression->base.type = type_char_ptr;
6596 expression->funcname.kind = FUNCNAME_FUNCDNAME;
6601 static designator_t *parse_designator(void)
6603 designator_t *result = allocate_ast_zero(sizeof(result[0]));
6604 result->source_position = *HERE;
6606 if (token.type != T_IDENTIFIER) {
6607 parse_error_expected("while parsing member designator",
6608 T_IDENTIFIER, NULL);
6611 result->symbol = token.v.symbol;
6614 designator_t *last_designator = result;
6616 if (token.type == '.') {
6618 if (token.type != T_IDENTIFIER) {
6619 parse_error_expected("while parsing member designator",
6620 T_IDENTIFIER, NULL);
6623 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6624 designator->source_position = *HERE;
6625 designator->symbol = token.v.symbol;
6628 last_designator->next = designator;
6629 last_designator = designator;
6632 if (token.type == '[') {
6634 add_anchor_token(']');
6635 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6636 designator->source_position = *HERE;
6637 designator->array_index = parse_expression();
6638 rem_anchor_token(']');
6640 if (designator->array_index == NULL) {
6644 last_designator->next = designator;
6645 last_designator = designator;
6657 * Parse the __builtin_offsetof() expression.
6659 static expression_t *parse_offsetof(void)
6661 eat(T___builtin_offsetof);
6663 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6664 expression->base.type = type_size_t;
6667 add_anchor_token(',');
6668 type_t *type = parse_typename();
6669 rem_anchor_token(',');
6671 add_anchor_token(')');
6672 designator_t *designator = parse_designator();
6673 rem_anchor_token(')');
6676 expression->offsetofe.type = type;
6677 expression->offsetofe.designator = designator;
6680 memset(&path, 0, sizeof(path));
6681 path.top_type = type;
6682 path.path = NEW_ARR_F(type_path_entry_t, 0);
6684 descend_into_subtype(&path);
6686 if (!walk_designator(&path, designator, true)) {
6687 return create_invalid_expression();
6690 DEL_ARR_F(path.path);
6694 return create_invalid_expression();
6698 * Parses a _builtin_va_start() expression.
6700 static expression_t *parse_va_start(void)
6702 eat(T___builtin_va_start);
6704 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6707 add_anchor_token(',');
6708 expression->va_starte.ap = parse_assignment_expression();
6709 rem_anchor_token(',');
6711 expression_t *const expr = parse_assignment_expression();
6712 if (expr->kind == EXPR_REFERENCE) {
6713 declaration_t *const decl = expr->reference.declaration;
6714 if (decl->parent_scope != ¤t_function->scope || decl->next != NULL) {
6715 errorf(&expr->base.source_position,
6716 "second argument of 'va_start' must be last parameter of the current function");
6718 expression->va_starte.parameter = decl;
6724 return create_invalid_expression();
6728 * Parses a _builtin_va_arg() expression.
6730 static expression_t *parse_va_arg(void)
6732 eat(T___builtin_va_arg);
6734 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
6737 expression->va_arge.ap = parse_assignment_expression();
6739 expression->base.type = parse_typename();
6744 return create_invalid_expression();
6747 static expression_t *parse_builtin_symbol(void)
6749 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_SYMBOL);
6751 symbol_t *symbol = token.v.symbol;
6753 expression->builtin_symbol.symbol = symbol;
6756 type_t *type = get_builtin_symbol_type(symbol);
6757 type = automatic_type_conversion(type);
6759 expression->base.type = type;
6764 * Parses a __builtin_constant() expression.
6766 static expression_t *parse_builtin_constant(void)
6768 eat(T___builtin_constant_p);
6770 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
6773 add_anchor_token(')');
6774 expression->builtin_constant.value = parse_assignment_expression();
6775 rem_anchor_token(')');
6777 expression->base.type = type_int;
6781 return create_invalid_expression();
6785 * Parses a __builtin_prefetch() expression.
6787 static expression_t *parse_builtin_prefetch(void)
6789 eat(T___builtin_prefetch);
6791 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_PREFETCH);
6794 add_anchor_token(')');
6795 expression->builtin_prefetch.adr = parse_assignment_expression();
6796 if (token.type == ',') {
6798 expression->builtin_prefetch.rw = parse_assignment_expression();
6800 if (token.type == ',') {
6802 expression->builtin_prefetch.locality = parse_assignment_expression();
6804 rem_anchor_token(')');
6806 expression->base.type = type_void;
6810 return create_invalid_expression();
6814 * Parses a __builtin_is_*() compare expression.
6816 static expression_t *parse_compare_builtin(void)
6818 expression_t *expression;
6820 switch(token.type) {
6821 case T___builtin_isgreater:
6822 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
6824 case T___builtin_isgreaterequal:
6825 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
6827 case T___builtin_isless:
6828 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
6830 case T___builtin_islessequal:
6831 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
6833 case T___builtin_islessgreater:
6834 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
6836 case T___builtin_isunordered:
6837 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
6840 internal_errorf(HERE, "invalid compare builtin found");
6842 expression->base.source_position = *HERE;
6846 expression->binary.left = parse_assignment_expression();
6848 expression->binary.right = parse_assignment_expression();
6851 type_t *const orig_type_left = expression->binary.left->base.type;
6852 type_t *const orig_type_right = expression->binary.right->base.type;
6854 type_t *const type_left = skip_typeref(orig_type_left);
6855 type_t *const type_right = skip_typeref(orig_type_right);
6856 if (!is_type_float(type_left) && !is_type_float(type_right)) {
6857 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6858 type_error_incompatible("invalid operands in comparison",
6859 &expression->base.source_position, orig_type_left, orig_type_right);
6862 semantic_comparison(&expression->binary);
6867 return create_invalid_expression();
6872 * Parses a __builtin_expect() expression.
6874 static expression_t *parse_builtin_expect(void)
6876 eat(T___builtin_expect);
6878 expression_t *expression
6879 = allocate_expression_zero(EXPR_BINARY_BUILTIN_EXPECT);
6882 expression->binary.left = parse_assignment_expression();
6884 expression->binary.right = parse_constant_expression();
6887 expression->base.type = expression->binary.left->base.type;
6891 return create_invalid_expression();
6896 * Parses a MS assume() expression.
6898 static expression_t *parse_assume(void)
6902 expression_t *expression
6903 = allocate_expression_zero(EXPR_UNARY_ASSUME);
6906 add_anchor_token(')');
6907 expression->unary.value = parse_assignment_expression();
6908 rem_anchor_token(')');
6911 expression->base.type = type_void;
6914 return create_invalid_expression();
6918 * Return the declaration for a given label symbol or create a new one.
6920 * @param symbol the symbol of the label
6922 static declaration_t *get_label(symbol_t *symbol)
6924 declaration_t *candidate;
6925 assert(current_function != NULL);
6927 candidate = get_declaration(symbol, NAMESPACE_LOCAL_LABEL);
6928 /* if we found a local label, we already created the declaration */
6929 if (candidate != NULL) {
6930 if (candidate->parent_scope != scope) {
6931 assert(candidate->parent_scope->depth < scope->depth);
6932 current_function->goto_to_outer = true;
6937 candidate = get_declaration(symbol, NAMESPACE_LABEL);
6938 /* if we found a label in the same function, then we already created the
6940 if (candidate != NULL
6941 && candidate->parent_scope == ¤t_function->scope) {
6945 /* otherwise we need to create a new one */
6946 declaration_t *const declaration = allocate_declaration_zero();
6947 declaration->namespc = NAMESPACE_LABEL;
6948 declaration->symbol = symbol;
6950 label_push(declaration);
6956 * Parses a GNU && label address expression.
6958 static expression_t *parse_label_address(void)
6960 source_position_t source_position = token.source_position;
6962 if (token.type != T_IDENTIFIER) {
6963 parse_error_expected("while parsing label address", T_IDENTIFIER, NULL);
6966 symbol_t *symbol = token.v.symbol;
6969 declaration_t *label = get_label(symbol);
6972 label->address_taken = true;
6974 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
6975 expression->base.source_position = source_position;
6977 /* label address is threaten as a void pointer */
6978 expression->base.type = type_void_ptr;
6979 expression->label_address.declaration = label;
6982 return create_invalid_expression();
6986 * Parse a microsoft __noop expression.
6988 static expression_t *parse_noop_expression(void)
6990 source_position_t source_position = *HERE;
6993 if (token.type == '(') {
6994 /* parse arguments */
6996 add_anchor_token(')');
6997 add_anchor_token(',');
6999 if (token.type != ')') {
7001 (void)parse_assignment_expression();
7002 if (token.type != ',')
7008 rem_anchor_token(',');
7009 rem_anchor_token(')');
7012 /* the result is a (int)0 */
7013 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
7014 cnst->base.source_position = source_position;
7015 cnst->base.type = type_int;
7016 cnst->conste.v.int_value = 0;
7017 cnst->conste.is_ms_noop = true;
7022 return create_invalid_expression();
7026 * Parses a primary expression.
7028 static expression_t *parse_primary_expression(void)
7030 switch (token.type) {
7031 case T_INTEGER: return parse_int_const();
7032 case T_CHARACTER_CONSTANT: return parse_character_constant();
7033 case T_WIDE_CHARACTER_CONSTANT: return parse_wide_character_constant();
7034 case T_FLOATINGPOINT: return parse_float_const();
7035 case T_STRING_LITERAL:
7036 case T_WIDE_STRING_LITERAL: return parse_string_const();
7037 case T_IDENTIFIER: return parse_reference();
7038 case T___FUNCTION__:
7039 case T___func__: return parse_function_keyword();
7040 case T___PRETTY_FUNCTION__: return parse_pretty_function_keyword();
7041 case T___FUNCSIG__: return parse_funcsig_keyword();
7042 case T___FUNCDNAME__: return parse_funcdname_keyword();
7043 case T___builtin_offsetof: return parse_offsetof();
7044 case T___builtin_va_start: return parse_va_start();
7045 case T___builtin_va_arg: return parse_va_arg();
7046 case T___builtin_expect:
7047 case T___builtin_alloca:
7048 case T___builtin_inf:
7049 case T___builtin_inff:
7050 case T___builtin_infl:
7051 case T___builtin_nan:
7052 case T___builtin_nanf:
7053 case T___builtin_nanl:
7054 case T___builtin_huge_val:
7055 case T___builtin_va_end: return parse_builtin_symbol();
7056 case T___builtin_isgreater:
7057 case T___builtin_isgreaterequal:
7058 case T___builtin_isless:
7059 case T___builtin_islessequal:
7060 case T___builtin_islessgreater:
7061 case T___builtin_isunordered: return parse_compare_builtin();
7062 case T___builtin_constant_p: return parse_builtin_constant();
7063 case T___builtin_prefetch: return parse_builtin_prefetch();
7064 case T__assume: return parse_assume();
7067 return parse_label_address();
7070 case '(': return parse_parenthesized_expression();
7071 case T___noop: return parse_noop_expression();
7074 errorf(HERE, "unexpected token %K, expected an expression", &token);
7075 return create_invalid_expression();
7079 * Check if the expression has the character type and issue a warning then.
7081 static void check_for_char_index_type(const expression_t *expression)
7083 type_t *const type = expression->base.type;
7084 const type_t *const base_type = skip_typeref(type);
7086 if (is_type_atomic(base_type, ATOMIC_TYPE_CHAR) &&
7087 warning.char_subscripts) {
7088 warningf(&expression->base.source_position,
7089 "array subscript has type '%T'", type);
7093 static expression_t *parse_array_expression(unsigned precedence,
7099 add_anchor_token(']');
7101 expression_t *inside = parse_expression();
7103 expression_t *expression = allocate_expression_zero(EXPR_ARRAY_ACCESS);
7105 array_access_expression_t *array_access = &expression->array_access;
7107 type_t *const orig_type_left = left->base.type;
7108 type_t *const orig_type_inside = inside->base.type;
7110 type_t *const type_left = skip_typeref(orig_type_left);
7111 type_t *const type_inside = skip_typeref(orig_type_inside);
7113 type_t *return_type;
7114 if (is_type_pointer(type_left)) {
7115 return_type = type_left->pointer.points_to;
7116 array_access->array_ref = left;
7117 array_access->index = inside;
7118 check_for_char_index_type(inside);
7119 } else if (is_type_pointer(type_inside)) {
7120 return_type = type_inside->pointer.points_to;
7121 array_access->array_ref = inside;
7122 array_access->index = left;
7123 array_access->flipped = true;
7124 check_for_char_index_type(left);
7126 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
7128 "array access on object with non-pointer types '%T', '%T'",
7129 orig_type_left, orig_type_inside);
7131 return_type = type_error_type;
7132 array_access->array_ref = left;
7133 array_access->index = inside;
7136 expression->base.type = automatic_type_conversion(return_type);
7138 rem_anchor_token(']');
7139 if (token.type == ']') {
7142 parse_error_expected("Problem while parsing array access", ']', NULL);
7147 static expression_t *parse_typeprop(expression_kind_t const kind,
7148 source_position_t const pos,
7149 unsigned const precedence)
7151 expression_t *tp_expression = allocate_expression_zero(kind);
7152 tp_expression->base.type = type_size_t;
7153 tp_expression->base.source_position = pos;
7155 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7157 /* we only refer to a type property, mark this case */
7158 bool old = in_type_prop;
7159 in_type_prop = true;
7160 if (token.type == '(' && is_declaration_specifier(look_ahead(1), true)) {
7162 add_anchor_token(')');
7163 type_t* const orig_type = parse_typename();
7164 tp_expression->typeprop.type = orig_type;
7166 type_t const* const type = skip_typeref(orig_type);
7167 char const* const wrong_type =
7168 is_type_incomplete(type) ? "incomplete" :
7169 type->kind == TYPE_FUNCTION ? "function designator" :
7170 type->kind == TYPE_BITFIELD ? "bitfield" :
7172 if (wrong_type != NULL) {
7173 errorf(&pos, "operand of %s expression must not be %s type '%T'",
7174 what, wrong_type, type);
7177 rem_anchor_token(')');
7180 expression_t *expression = parse_sub_expression(precedence);
7182 type_t* const orig_type = revert_automatic_type_conversion(expression);
7183 expression->base.type = orig_type;
7185 type_t const* const type = skip_typeref(orig_type);
7186 char const* const wrong_type =
7187 is_type_incomplete(type) ? "incomplete" :
7188 type->kind == TYPE_FUNCTION ? "function designator" :
7189 type->kind == TYPE_BITFIELD ? "bitfield" :
7191 if (wrong_type != NULL) {
7192 errorf(&pos, "operand of %s expression must not be expression of %s type '%T'", what, wrong_type, type);
7195 tp_expression->typeprop.type = expression->base.type;
7196 tp_expression->typeprop.tp_expression = expression;
7201 return tp_expression;
7204 static expression_t *parse_sizeof(unsigned precedence)
7206 source_position_t pos = *HERE;
7208 return parse_typeprop(EXPR_SIZEOF, pos, precedence);
7211 static expression_t *parse_alignof(unsigned precedence)
7213 source_position_t pos = *HERE;
7215 return parse_typeprop(EXPR_ALIGNOF, pos, precedence);
7218 static expression_t *parse_select_expression(unsigned precedence,
7219 expression_t *compound)
7222 assert(token.type == '.' || token.type == T_MINUSGREATER);
7224 bool is_pointer = (token.type == T_MINUSGREATER);
7227 expression_t *select = allocate_expression_zero(EXPR_SELECT);
7228 select->select.compound = compound;
7230 if (token.type != T_IDENTIFIER) {
7231 parse_error_expected("while parsing select", T_IDENTIFIER, NULL);
7234 symbol_t *symbol = token.v.symbol;
7237 type_t *const orig_type = compound->base.type;
7238 type_t *const type = skip_typeref(orig_type);
7241 bool saw_error = false;
7242 if (is_type_pointer(type)) {
7245 "request for member '%Y' in something not a struct or union, but '%T'",
7249 type_left = skip_typeref(type->pointer.points_to);
7251 if (is_pointer && is_type_valid(type)) {
7252 errorf(HERE, "left hand side of '->' is not a pointer, but '%T'", orig_type);
7258 declaration_t *entry;
7259 if (type_left->kind == TYPE_COMPOUND_STRUCT ||
7260 type_left->kind == TYPE_COMPOUND_UNION) {
7261 declaration_t *const declaration = type_left->compound.declaration;
7263 if (!declaration->init.complete) {
7264 errorf(HERE, "request for member '%Y' of incomplete type '%T'",
7266 goto create_error_entry;
7269 entry = find_compound_entry(declaration, symbol);
7270 if (entry == NULL) {
7271 errorf(HERE, "'%T' has no member named '%Y'", orig_type, symbol);
7272 goto create_error_entry;
7275 if (is_type_valid(type_left) && !saw_error) {
7277 "request for member '%Y' in something not a struct or union, but '%T'",
7281 entry = allocate_declaration_zero();
7282 entry->symbol = symbol;
7285 select->select.compound_entry = entry;
7287 type_t *const res_type =
7288 get_qualified_type(entry->type, type_left->base.qualifiers);
7290 /* we always do the auto-type conversions; the & and sizeof parser contains
7291 * code to revert this! */
7292 select->base.type = automatic_type_conversion(res_type);
7294 type_t *skipped = skip_typeref(res_type);
7295 if (skipped->kind == TYPE_BITFIELD) {
7296 select->base.type = skipped->bitfield.base_type;
7302 static void check_call_argument(const function_parameter_t *parameter,
7303 call_argument_t *argument, unsigned pos)
7305 type_t *expected_type = parameter->type;
7306 type_t *expected_type_skip = skip_typeref(expected_type);
7307 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
7308 expression_t *arg_expr = argument->expression;
7309 type_t *arg_type = skip_typeref(arg_expr->base.type);
7311 /* handle transparent union gnu extension */
7312 if (is_type_union(expected_type_skip)
7313 && (expected_type_skip->base.modifiers
7314 & TYPE_MODIFIER_TRANSPARENT_UNION)) {
7315 declaration_t *union_decl = expected_type_skip->compound.declaration;
7317 declaration_t *declaration = union_decl->scope.declarations;
7318 type_t *best_type = NULL;
7319 for ( ; declaration != NULL; declaration = declaration->next) {
7320 type_t *decl_type = declaration->type;
7321 error = semantic_assign(decl_type, arg_expr);
7322 if (error == ASSIGN_ERROR_INCOMPATIBLE
7323 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
7326 if (error == ASSIGN_SUCCESS) {
7327 best_type = decl_type;
7328 } else if (best_type == NULL) {
7329 best_type = decl_type;
7333 if (best_type != NULL) {
7334 expected_type = best_type;
7338 error = semantic_assign(expected_type, arg_expr);
7339 argument->expression = create_implicit_cast(argument->expression,
7342 if (error != ASSIGN_SUCCESS) {
7343 /* report exact scope in error messages (like "in argument 3") */
7345 snprintf(buf, sizeof(buf), "call argument %u", pos);
7346 report_assign_error(error, expected_type, arg_expr, buf,
7347 &arg_expr->base.source_position);
7348 } else if (warning.traditional || warning.conversion) {
7349 type_t *const promoted_type = get_default_promoted_type(arg_type);
7350 if (!types_compatible(expected_type_skip, promoted_type) &&
7351 !types_compatible(expected_type_skip, type_void_ptr) &&
7352 !types_compatible(type_void_ptr, promoted_type)) {
7353 /* Deliberately show the skipped types in this warning */
7354 warningf(&arg_expr->base.source_position,
7355 "passing call argument %u as '%T' rather than '%T' due to prototype",
7356 pos, expected_type_skip, promoted_type);
7362 * Parse a call expression, ie. expression '( ... )'.
7364 * @param expression the function address
7366 static expression_t *parse_call_expression(unsigned precedence,
7367 expression_t *expression)
7370 expression_t *result = allocate_expression_zero(EXPR_CALL);
7371 result->base.source_position = expression->base.source_position;
7373 call_expression_t *call = &result->call;
7374 call->function = expression;
7376 type_t *const orig_type = expression->base.type;
7377 type_t *const type = skip_typeref(orig_type);
7379 function_type_t *function_type = NULL;
7380 if (is_type_pointer(type)) {
7381 type_t *const to_type = skip_typeref(type->pointer.points_to);
7383 if (is_type_function(to_type)) {
7384 function_type = &to_type->function;
7385 call->base.type = function_type->return_type;
7389 if (function_type == NULL && is_type_valid(type)) {
7390 errorf(HERE, "called object '%E' (type '%T') is not a pointer to a function", expression, orig_type);
7393 /* parse arguments */
7395 add_anchor_token(')');
7396 add_anchor_token(',');
7398 if (token.type != ')') {
7399 call_argument_t *last_argument = NULL;
7402 call_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
7404 argument->expression = parse_assignment_expression();
7405 if (last_argument == NULL) {
7406 call->arguments = argument;
7408 last_argument->next = argument;
7410 last_argument = argument;
7412 if (token.type != ',')
7417 rem_anchor_token(',');
7418 rem_anchor_token(')');
7421 if (function_type == NULL)
7424 function_parameter_t *parameter = function_type->parameters;
7425 call_argument_t *argument = call->arguments;
7426 if (!function_type->unspecified_parameters) {
7427 for (unsigned pos = 0; parameter != NULL && argument != NULL;
7428 parameter = parameter->next, argument = argument->next) {
7429 check_call_argument(parameter, argument, ++pos);
7432 if (parameter != NULL) {
7433 errorf(HERE, "too few arguments to function '%E'", expression);
7434 } else if (argument != NULL && !function_type->variadic) {
7435 errorf(HERE, "too many arguments to function '%E'", expression);
7439 /* do default promotion */
7440 for( ; argument != NULL; argument = argument->next) {
7441 type_t *type = argument->expression->base.type;
7443 type = get_default_promoted_type(type);
7445 argument->expression
7446 = create_implicit_cast(argument->expression, type);
7449 check_format(&result->call);
7451 if (warning.aggregate_return &&
7452 is_type_compound(skip_typeref(function_type->return_type))) {
7453 warningf(&result->base.source_position,
7454 "function call has aggregate value");
7461 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
7463 static bool same_compound_type(const type_t *type1, const type_t *type2)
7466 is_type_compound(type1) &&
7467 type1->kind == type2->kind &&
7468 type1->compound.declaration == type2->compound.declaration;
7472 * Parse a conditional expression, ie. 'expression ? ... : ...'.
7474 * @param expression the conditional expression
7476 static expression_t *parse_conditional_expression(unsigned precedence,
7477 expression_t *expression)
7479 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
7481 conditional_expression_t *conditional = &result->conditional;
7482 conditional->base.source_position = *HERE;
7483 conditional->condition = expression;
7486 add_anchor_token(':');
7489 type_t *const condition_type_orig = expression->base.type;
7490 type_t *const condition_type = skip_typeref(condition_type_orig);
7491 if (!is_type_scalar(condition_type) && is_type_valid(condition_type)) {
7492 type_error("expected a scalar type in conditional condition",
7493 &expression->base.source_position, condition_type_orig);
7496 expression_t *true_expression = expression;
7497 bool gnu_cond = false;
7498 if (GNU_MODE && token.type == ':') {
7501 true_expression = parse_expression();
7502 rem_anchor_token(':');
7504 expression_t *false_expression = parse_sub_expression(precedence);
7506 type_t *const orig_true_type = true_expression->base.type;
7507 type_t *const orig_false_type = false_expression->base.type;
7508 type_t *const true_type = skip_typeref(orig_true_type);
7509 type_t *const false_type = skip_typeref(orig_false_type);
7512 type_t *result_type;
7513 if (is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7514 is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
7515 if (!is_type_atomic(true_type, ATOMIC_TYPE_VOID)
7516 || !is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
7517 warningf(&conditional->base.source_position,
7518 "ISO C forbids conditional expression with only one void side");
7520 result_type = type_void;
7521 } else if (is_type_arithmetic(true_type)
7522 && is_type_arithmetic(false_type)) {
7523 result_type = semantic_arithmetic(true_type, false_type);
7525 true_expression = create_implicit_cast(true_expression, result_type);
7526 false_expression = create_implicit_cast(false_expression, result_type);
7528 conditional->true_expression = true_expression;
7529 conditional->false_expression = false_expression;
7530 conditional->base.type = result_type;
7531 } else if (same_compound_type(true_type, false_type)) {
7532 /* just take 1 of the 2 types */
7533 result_type = true_type;
7534 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
7535 type_t *pointer_type;
7537 expression_t *other_expression;
7538 if (is_type_pointer(true_type) &&
7539 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
7540 pointer_type = true_type;
7541 other_type = false_type;
7542 other_expression = false_expression;
7544 pointer_type = false_type;
7545 other_type = true_type;
7546 other_expression = true_expression;
7549 if (is_null_pointer_constant(other_expression)) {
7550 result_type = pointer_type;
7551 } else if (is_type_pointer(other_type)) {
7552 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
7553 type_t *to2 = skip_typeref(other_type->pointer.points_to);
7556 if (is_type_atomic(to1, ATOMIC_TYPE_VOID) ||
7557 is_type_atomic(to2, ATOMIC_TYPE_VOID)) {
7559 } else if (types_compatible(get_unqualified_type(to1),
7560 get_unqualified_type(to2))) {
7563 warningf(&conditional->base.source_position,
7564 "pointer types '%T' and '%T' in conditional expression are incompatible",
7565 true_type, false_type);
7569 type_t *const type =
7570 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
7571 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7572 } else if (is_type_integer(other_type)) {
7573 warningf(&conditional->base.source_position,
7574 "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7575 result_type = pointer_type;
7577 if (is_type_valid(other_type)) {
7578 type_error_incompatible("while parsing conditional",
7579 &expression->base.source_position, true_type, false_type);
7581 result_type = type_error_type;
7584 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7585 type_error_incompatible("while parsing conditional",
7586 &conditional->base.source_position, true_type,
7589 result_type = type_error_type;
7592 conditional->true_expression
7593 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7594 conditional->false_expression
7595 = create_implicit_cast(false_expression, result_type);
7596 conditional->base.type = result_type;
7599 return create_invalid_expression();
7603 * Parse an extension expression.
7605 static expression_t *parse_extension(unsigned precedence)
7607 eat(T___extension__);
7609 bool old_gcc_extension = in_gcc_extension;
7610 in_gcc_extension = true;
7611 expression_t *expression = parse_sub_expression(precedence);
7612 in_gcc_extension = old_gcc_extension;
7617 * Parse a __builtin_classify_type() expression.
7619 static expression_t *parse_builtin_classify_type(const unsigned precedence)
7621 eat(T___builtin_classify_type);
7623 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7624 result->base.type = type_int;
7627 add_anchor_token(')');
7628 expression_t *expression = parse_sub_expression(precedence);
7629 rem_anchor_token(')');
7631 result->classify_type.type_expression = expression;
7635 return create_invalid_expression();
7638 static bool check_pointer_arithmetic(const source_position_t *source_position,
7639 type_t *pointer_type,
7640 type_t *orig_pointer_type)
7642 type_t *points_to = pointer_type->pointer.points_to;
7643 points_to = skip_typeref(points_to);
7645 if (is_type_incomplete(points_to)) {
7646 if (!GNU_MODE || !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7647 errorf(source_position,
7648 "arithmetic with pointer to incomplete type '%T' not allowed",
7651 } else if (warning.pointer_arith) {
7652 warningf(source_position,
7653 "pointer of type '%T' used in arithmetic",
7656 } else if (is_type_function(points_to)) {
7658 errorf(source_position,
7659 "arithmetic with pointer to function type '%T' not allowed",
7662 } else if (warning.pointer_arith) {
7663 warningf(source_position,
7664 "pointer to a function '%T' used in arithmetic",
7671 static bool is_lvalue(const expression_t *expression)
7673 switch (expression->kind) {
7674 case EXPR_REFERENCE:
7675 case EXPR_ARRAY_ACCESS:
7677 case EXPR_UNARY_DEREFERENCE:
7681 /* Claim it is an lvalue, if the type is invalid. There was a parse
7682 * error before, which maybe prevented properly recognizing it as
7684 return !is_type_valid(skip_typeref(expression->base.type));
7688 static void semantic_incdec(unary_expression_t *expression)
7690 type_t *const orig_type = expression->value->base.type;
7691 type_t *const type = skip_typeref(orig_type);
7692 if (is_type_pointer(type)) {
7693 if (!check_pointer_arithmetic(&expression->base.source_position,
7697 } else if (!is_type_real(type) && is_type_valid(type)) {
7698 /* TODO: improve error message */
7699 errorf(&expression->base.source_position,
7700 "operation needs an arithmetic or pointer type");
7703 if (!is_lvalue(expression->value)) {
7704 /* TODO: improve error message */
7705 errorf(&expression->base.source_position, "lvalue required as operand");
7707 expression->base.type = orig_type;
7710 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
7712 type_t *const orig_type = expression->value->base.type;
7713 type_t *const type = skip_typeref(orig_type);
7714 if (!is_type_arithmetic(type)) {
7715 if (is_type_valid(type)) {
7716 /* TODO: improve error message */
7717 errorf(&expression->base.source_position,
7718 "operation needs an arithmetic type");
7723 expression->base.type = orig_type;
7726 static void semantic_unexpr_plus(unary_expression_t *expression)
7728 semantic_unexpr_arithmetic(expression);
7729 if (warning.traditional)
7730 warningf(&expression->base.source_position,
7731 "traditional C rejects the unary plus operator");
7734 static expression_t const *get_reference_address(expression_t const *expr)
7736 bool regular_take_address = true;
7738 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7739 expr = expr->unary.value;
7741 regular_take_address = false;
7744 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7747 expr = expr->unary.value;
7750 if (expr->kind != EXPR_REFERENCE)
7753 if (!regular_take_address &&
7754 !is_type_function(skip_typeref(expr->reference.declaration->type))) {
7761 static void warn_function_address_as_bool(expression_t const* expr)
7763 if (!warning.address)
7766 expr = get_reference_address(expr);
7768 warningf(&expr->base.source_position,
7769 "the address of '%Y' will always evaluate as 'true'",
7770 expr->reference.declaration->symbol);
7774 static void semantic_not(unary_expression_t *expression)
7776 type_t *const orig_type = expression->value->base.type;
7777 type_t *const type = skip_typeref(orig_type);
7778 if (!is_type_scalar(type) && is_type_valid(type)) {
7779 errorf(&expression->base.source_position,
7780 "operand of ! must be of scalar type");
7783 warn_function_address_as_bool(expression->value);
7785 expression->base.type = type_int;
7788 static void semantic_unexpr_integer(unary_expression_t *expression)
7790 type_t *const orig_type = expression->value->base.type;
7791 type_t *const type = skip_typeref(orig_type);
7792 if (!is_type_integer(type)) {
7793 if (is_type_valid(type)) {
7794 errorf(&expression->base.source_position,
7795 "operand of ~ must be of integer type");
7800 expression->base.type = orig_type;
7803 static void semantic_dereference(unary_expression_t *expression)
7805 type_t *const orig_type = expression->value->base.type;
7806 type_t *const type = skip_typeref(orig_type);
7807 if (!is_type_pointer(type)) {
7808 if (is_type_valid(type)) {
7809 errorf(&expression->base.source_position,
7810 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
7815 type_t *result_type = type->pointer.points_to;
7816 result_type = automatic_type_conversion(result_type);
7817 expression->base.type = result_type;
7821 * Record that an address is taken (expression represents an lvalue).
7823 * @param expression the expression
7824 * @param may_be_register if true, the expression might be an register
7826 static void set_address_taken(expression_t *expression, bool may_be_register)
7828 if (expression->kind != EXPR_REFERENCE)
7831 declaration_t *const declaration = expression->reference.declaration;
7832 /* happens for parse errors */
7833 if (declaration == NULL)
7836 if (declaration->storage_class == STORAGE_CLASS_REGISTER && !may_be_register) {
7837 errorf(&expression->base.source_position,
7838 "address of register variable '%Y' requested",
7839 declaration->symbol);
7841 declaration->address_taken = 1;
7846 * Check the semantic of the address taken expression.
7848 static void semantic_take_addr(unary_expression_t *expression)
7850 expression_t *value = expression->value;
7851 value->base.type = revert_automatic_type_conversion(value);
7853 type_t *orig_type = value->base.type;
7854 if (!is_type_valid(skip_typeref(orig_type)))
7857 set_address_taken(value, false);
7859 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
7862 #define CREATE_UNARY_EXPRESSION_PARSER(token_type, unexpression_type, sfunc) \
7863 static expression_t *parse_##unexpression_type(unsigned precedence) \
7865 expression_t *unary_expression \
7866 = allocate_expression_zero(unexpression_type); \
7867 unary_expression->base.source_position = *HERE; \
7869 unary_expression->unary.value = parse_sub_expression(precedence); \
7871 sfunc(&unary_expression->unary); \
7873 return unary_expression; \
7876 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
7877 semantic_unexpr_arithmetic)
7878 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
7879 semantic_unexpr_plus)
7880 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
7882 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
7883 semantic_dereference)
7884 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
7886 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
7887 semantic_unexpr_integer)
7888 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
7890 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
7893 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_type, unexpression_type, \
7895 static expression_t *parse_##unexpression_type(unsigned precedence, \
7896 expression_t *left) \
7898 (void) precedence; \
7900 expression_t *unary_expression \
7901 = allocate_expression_zero(unexpression_type); \
7902 unary_expression->base.source_position = *HERE; \
7904 unary_expression->unary.value = left; \
7906 sfunc(&unary_expression->unary); \
7908 return unary_expression; \
7911 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
7912 EXPR_UNARY_POSTFIX_INCREMENT,
7914 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
7915 EXPR_UNARY_POSTFIX_DECREMENT,
7918 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
7920 /* TODO: handle complex + imaginary types */
7922 type_left = get_unqualified_type(type_left);
7923 type_right = get_unqualified_type(type_right);
7925 /* § 6.3.1.8 Usual arithmetic conversions */
7926 if (type_left == type_long_double || type_right == type_long_double) {
7927 return type_long_double;
7928 } else if (type_left == type_double || type_right == type_double) {
7930 } else if (type_left == type_float || type_right == type_float) {
7934 type_left = promote_integer(type_left);
7935 type_right = promote_integer(type_right);
7937 if (type_left == type_right)
7940 bool const signed_left = is_type_signed(type_left);
7941 bool const signed_right = is_type_signed(type_right);
7942 int const rank_left = get_rank(type_left);
7943 int const rank_right = get_rank(type_right);
7945 if (signed_left == signed_right)
7946 return rank_left >= rank_right ? type_left : type_right;
7955 u_rank = rank_right;
7956 u_type = type_right;
7958 s_rank = rank_right;
7959 s_type = type_right;
7964 if (u_rank >= s_rank)
7967 /* casting rank to atomic_type_kind is a bit hacky, but makes things
7969 if (get_atomic_type_size((atomic_type_kind_t) s_rank)
7970 > get_atomic_type_size((atomic_type_kind_t) u_rank))
7974 case ATOMIC_TYPE_INT: return type_unsigned_int;
7975 case ATOMIC_TYPE_LONG: return type_unsigned_long;
7976 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
7978 default: panic("invalid atomic type");
7983 * Check the semantic restrictions for a binary expression.
7985 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
7987 expression_t *const left = expression->left;
7988 expression_t *const right = expression->right;
7989 type_t *const orig_type_left = left->base.type;
7990 type_t *const orig_type_right = right->base.type;
7991 type_t *const type_left = skip_typeref(orig_type_left);
7992 type_t *const type_right = skip_typeref(orig_type_right);
7994 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
7995 /* TODO: improve error message */
7996 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7997 errorf(&expression->base.source_position,
7998 "operation needs arithmetic types");
8003 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8004 expression->left = create_implicit_cast(left, arithmetic_type);
8005 expression->right = create_implicit_cast(right, arithmetic_type);
8006 expression->base.type = arithmetic_type;
8009 static void warn_div_by_zero(binary_expression_t const *const expression)
8011 if (!warning.div_by_zero ||
8012 !is_type_integer(expression->base.type))
8015 expression_t const *const right = expression->right;
8016 /* The type of the right operand can be different for /= */
8017 if (is_type_integer(right->base.type) &&
8018 is_constant_expression(right) &&
8019 fold_constant(right) == 0) {
8020 warningf(&expression->base.source_position, "division by zero");
8025 * Check the semantic restrictions for a div/mod expression.
8027 static void semantic_divmod_arithmetic(binary_expression_t *expression) {
8028 semantic_binexpr_arithmetic(expression);
8029 warn_div_by_zero(expression);
8032 static void semantic_shift_op(binary_expression_t *expression)
8034 expression_t *const left = expression->left;
8035 expression_t *const right = expression->right;
8036 type_t *const orig_type_left = left->base.type;
8037 type_t *const orig_type_right = right->base.type;
8038 type_t * type_left = skip_typeref(orig_type_left);
8039 type_t * type_right = skip_typeref(orig_type_right);
8041 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8042 /* TODO: improve error message */
8043 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8044 errorf(&expression->base.source_position,
8045 "operands of shift operation must have integer types");
8050 type_left = promote_integer(type_left);
8051 type_right = promote_integer(type_right);
8053 expression->left = create_implicit_cast(left, type_left);
8054 expression->right = create_implicit_cast(right, type_right);
8055 expression->base.type = type_left;
8058 static void semantic_add(binary_expression_t *expression)
8060 expression_t *const left = expression->left;
8061 expression_t *const right = expression->right;
8062 type_t *const orig_type_left = left->base.type;
8063 type_t *const orig_type_right = right->base.type;
8064 type_t *const type_left = skip_typeref(orig_type_left);
8065 type_t *const type_right = skip_typeref(orig_type_right);
8068 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8069 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8070 expression->left = create_implicit_cast(left, arithmetic_type);
8071 expression->right = create_implicit_cast(right, arithmetic_type);
8072 expression->base.type = arithmetic_type;
8074 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8075 check_pointer_arithmetic(&expression->base.source_position,
8076 type_left, orig_type_left);
8077 expression->base.type = type_left;
8078 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
8079 check_pointer_arithmetic(&expression->base.source_position,
8080 type_right, orig_type_right);
8081 expression->base.type = type_right;
8082 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8083 errorf(&expression->base.source_position,
8084 "invalid operands to binary + ('%T', '%T')",
8085 orig_type_left, orig_type_right);
8089 static void semantic_sub(binary_expression_t *expression)
8091 expression_t *const left = expression->left;
8092 expression_t *const right = expression->right;
8093 type_t *const orig_type_left = left->base.type;
8094 type_t *const orig_type_right = right->base.type;
8095 type_t *const type_left = skip_typeref(orig_type_left);
8096 type_t *const type_right = skip_typeref(orig_type_right);
8097 source_position_t const *const pos = &expression->base.source_position;
8100 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8101 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8102 expression->left = create_implicit_cast(left, arithmetic_type);
8103 expression->right = create_implicit_cast(right, arithmetic_type);
8104 expression->base.type = arithmetic_type;
8106 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8107 check_pointer_arithmetic(&expression->base.source_position,
8108 type_left, orig_type_left);
8109 expression->base.type = type_left;
8110 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8111 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
8112 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
8113 if (!types_compatible(unqual_left, unqual_right)) {
8115 "subtracting pointers to incompatible types '%T' and '%T'",
8116 orig_type_left, orig_type_right);
8117 } else if (!is_type_object(unqual_left)) {
8118 if (is_type_atomic(unqual_left, ATOMIC_TYPE_VOID)) {
8119 warningf(pos, "subtracting pointers to void");
8121 errorf(pos, "subtracting pointers to non-object types '%T'",
8125 expression->base.type = type_ptrdiff_t;
8126 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8127 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
8128 orig_type_left, orig_type_right);
8132 static void warn_string_literal_address(expression_t const* expr)
8134 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
8135 expr = expr->unary.value;
8136 if (expr->kind != EXPR_UNARY_DEREFERENCE)
8138 expr = expr->unary.value;
8141 if (expr->kind == EXPR_STRING_LITERAL ||
8142 expr->kind == EXPR_WIDE_STRING_LITERAL) {
8143 warningf(&expr->base.source_position,
8144 "comparison with string literal results in unspecified behaviour");
8149 * Check the semantics of comparison expressions.
8151 * @param expression The expression to check.
8153 static void semantic_comparison(binary_expression_t *expression)
8155 expression_t *left = expression->left;
8156 expression_t *right = expression->right;
8158 if (warning.address) {
8159 warn_string_literal_address(left);
8160 warn_string_literal_address(right);
8162 expression_t const* const func_left = get_reference_address(left);
8163 if (func_left != NULL && is_null_pointer_constant(right)) {
8164 warningf(&expression->base.source_position,
8165 "the address of '%Y' will never be NULL",
8166 func_left->reference.declaration->symbol);
8169 expression_t const* const func_right = get_reference_address(right);
8170 if (func_right != NULL && is_null_pointer_constant(right)) {
8171 warningf(&expression->base.source_position,
8172 "the address of '%Y' will never be NULL",
8173 func_right->reference.declaration->symbol);
8177 type_t *orig_type_left = left->base.type;
8178 type_t *orig_type_right = right->base.type;
8179 type_t *type_left = skip_typeref(orig_type_left);
8180 type_t *type_right = skip_typeref(orig_type_right);
8182 /* TODO non-arithmetic types */
8183 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8184 /* test for signed vs unsigned compares */
8185 if (warning.sign_compare &&
8186 (expression->base.kind != EXPR_BINARY_EQUAL &&
8187 expression->base.kind != EXPR_BINARY_NOTEQUAL) &&
8188 (is_type_signed(type_left) != is_type_signed(type_right))) {
8190 /* check if 1 of the operands is a constant, in this case we just
8191 * check wether we can safely represent the resulting constant in
8192 * the type of the other operand. */
8193 expression_t *const_expr = NULL;
8194 expression_t *other_expr = NULL;
8196 if (is_constant_expression(left)) {
8199 } else if (is_constant_expression(right)) {
8204 if (const_expr != NULL) {
8205 type_t *other_type = skip_typeref(other_expr->base.type);
8206 long val = fold_constant(const_expr);
8207 /* TODO: check if val can be represented by other_type */
8211 warningf(&expression->base.source_position,
8212 "comparison between signed and unsigned");
8214 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8215 expression->left = create_implicit_cast(left, arithmetic_type);
8216 expression->right = create_implicit_cast(right, arithmetic_type);
8217 expression->base.type = arithmetic_type;
8218 if (warning.float_equal &&
8219 (expression->base.kind == EXPR_BINARY_EQUAL ||
8220 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
8221 is_type_float(arithmetic_type)) {
8222 warningf(&expression->base.source_position,
8223 "comparing floating point with == or != is unsafe");
8225 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8226 /* TODO check compatibility */
8227 } else if (is_type_pointer(type_left)) {
8228 expression->right = create_implicit_cast(right, type_left);
8229 } else if (is_type_pointer(type_right)) {
8230 expression->left = create_implicit_cast(left, type_right);
8231 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8232 type_error_incompatible("invalid operands in comparison",
8233 &expression->base.source_position,
8234 type_left, type_right);
8236 expression->base.type = type_int;
8240 * Checks if a compound type has constant fields.
8242 static bool has_const_fields(const compound_type_t *type)
8244 const scope_t *scope = &type->declaration->scope;
8245 const declaration_t *declaration = scope->declarations;
8247 for (; declaration != NULL; declaration = declaration->next) {
8248 if (declaration->namespc != NAMESPACE_NORMAL)
8251 const type_t *decl_type = skip_typeref(declaration->type);
8252 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
8259 static bool is_valid_assignment_lhs(expression_t const* const left)
8261 type_t *const orig_type_left = revert_automatic_type_conversion(left);
8262 type_t *const type_left = skip_typeref(orig_type_left);
8264 if (!is_lvalue(left)) {
8265 errorf(HERE, "left hand side '%E' of assignment is not an lvalue",
8270 if (is_type_array(type_left)) {
8271 errorf(HERE, "cannot assign to arrays ('%E')", left);
8274 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
8275 errorf(HERE, "assignment to readonly location '%E' (type '%T')", left,
8279 if (is_type_incomplete(type_left)) {
8280 errorf(HERE, "left-hand side '%E' of assignment has incomplete type '%T'",
8281 left, orig_type_left);
8284 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
8285 errorf(HERE, "cannot assign to '%E' because compound type '%T' has readonly fields",
8286 left, orig_type_left);
8293 static void semantic_arithmetic_assign(binary_expression_t *expression)
8295 expression_t *left = expression->left;
8296 expression_t *right = expression->right;
8297 type_t *orig_type_left = left->base.type;
8298 type_t *orig_type_right = right->base.type;
8300 if (!is_valid_assignment_lhs(left))
8303 type_t *type_left = skip_typeref(orig_type_left);
8304 type_t *type_right = skip_typeref(orig_type_right);
8306 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8307 /* TODO: improve error message */
8308 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8309 errorf(&expression->base.source_position,
8310 "operation needs arithmetic types");
8315 /* combined instructions are tricky. We can't create an implicit cast on
8316 * the left side, because we need the uncasted form for the store.
8317 * The ast2firm pass has to know that left_type must be right_type
8318 * for the arithmetic operation and create a cast by itself */
8319 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8320 expression->right = create_implicit_cast(right, arithmetic_type);
8321 expression->base.type = type_left;
8324 static void semantic_divmod_assign(binary_expression_t *expression)
8326 semantic_arithmetic_assign(expression);
8327 warn_div_by_zero(expression);
8330 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
8332 expression_t *const left = expression->left;
8333 expression_t *const right = expression->right;
8334 type_t *const orig_type_left = left->base.type;
8335 type_t *const orig_type_right = right->base.type;
8336 type_t *const type_left = skip_typeref(orig_type_left);
8337 type_t *const type_right = skip_typeref(orig_type_right);
8339 if (!is_valid_assignment_lhs(left))
8342 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8343 /* combined instructions are tricky. We can't create an implicit cast on
8344 * the left side, because we need the uncasted form for the store.
8345 * The ast2firm pass has to know that left_type must be right_type
8346 * for the arithmetic operation and create a cast by itself */
8347 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
8348 expression->right = create_implicit_cast(right, arithmetic_type);
8349 expression->base.type = type_left;
8350 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8351 check_pointer_arithmetic(&expression->base.source_position,
8352 type_left, orig_type_left);
8353 expression->base.type = type_left;
8354 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8355 errorf(&expression->base.source_position,
8356 "incompatible types '%T' and '%T' in assignment",
8357 orig_type_left, orig_type_right);
8362 * Check the semantic restrictions of a logical expression.
8364 static void semantic_logical_op(binary_expression_t *expression)
8366 expression_t *const left = expression->left;
8367 expression_t *const right = expression->right;
8368 type_t *const orig_type_left = left->base.type;
8369 type_t *const orig_type_right = right->base.type;
8370 type_t *const type_left = skip_typeref(orig_type_left);
8371 type_t *const type_right = skip_typeref(orig_type_right);
8373 warn_function_address_as_bool(left);
8374 warn_function_address_as_bool(right);
8376 if (!is_type_scalar(type_left) || !is_type_scalar(type_right)) {
8377 /* TODO: improve error message */
8378 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8379 errorf(&expression->base.source_position,
8380 "operation needs scalar types");
8385 expression->base.type = type_int;
8389 * Check the semantic restrictions of a binary assign expression.
8391 static void semantic_binexpr_assign(binary_expression_t *expression)
8393 expression_t *left = expression->left;
8394 type_t *orig_type_left = left->base.type;
8396 if (!is_valid_assignment_lhs(left))
8399 assign_error_t error = semantic_assign(orig_type_left, expression->right);
8400 report_assign_error(error, orig_type_left, expression->right,
8401 "assignment", &left->base.source_position);
8402 expression->right = create_implicit_cast(expression->right, orig_type_left);
8403 expression->base.type = orig_type_left;
8407 * Determine if the outermost operation (or parts thereof) of the given
8408 * expression has no effect in order to generate a warning about this fact.
8409 * Therefore in some cases this only examines some of the operands of the
8410 * expression (see comments in the function and examples below).
8412 * f() + 23; // warning, because + has no effect
8413 * x || f(); // no warning, because x controls execution of f()
8414 * x ? y : f(); // warning, because y has no effect
8415 * (void)x; // no warning to be able to suppress the warning
8416 * This function can NOT be used for an "expression has definitely no effect"-
8418 static bool expression_has_effect(const expression_t *const expr)
8420 switch (expr->kind) {
8421 case EXPR_UNKNOWN: break;
8422 case EXPR_INVALID: return true; /* do NOT warn */
8423 case EXPR_REFERENCE: return false;
8424 /* suppress the warning for microsoft __noop operations */
8425 case EXPR_CONST: return expr->conste.is_ms_noop;
8426 case EXPR_CHARACTER_CONSTANT: return false;
8427 case EXPR_WIDE_CHARACTER_CONSTANT: return false;
8428 case EXPR_STRING_LITERAL: return false;
8429 case EXPR_WIDE_STRING_LITERAL: return false;
8430 case EXPR_LABEL_ADDRESS: return false;
8433 const call_expression_t *const call = &expr->call;
8434 if (call->function->kind != EXPR_BUILTIN_SYMBOL)
8437 switch (call->function->builtin_symbol.symbol->ID) {
8438 case T___builtin_va_end: return true;
8439 default: return false;
8443 /* Generate the warning if either the left or right hand side of a
8444 * conditional expression has no effect */
8445 case EXPR_CONDITIONAL: {
8446 const conditional_expression_t *const cond = &expr->conditional;
8448 expression_has_effect(cond->true_expression) &&
8449 expression_has_effect(cond->false_expression);
8452 case EXPR_SELECT: return false;
8453 case EXPR_ARRAY_ACCESS: return false;
8454 case EXPR_SIZEOF: return false;
8455 case EXPR_CLASSIFY_TYPE: return false;
8456 case EXPR_ALIGNOF: return false;
8458 case EXPR_FUNCNAME: return false;
8459 case EXPR_BUILTIN_SYMBOL: break; /* handled in EXPR_CALL */
8460 case EXPR_BUILTIN_CONSTANT_P: return false;
8461 case EXPR_BUILTIN_PREFETCH: return true;
8462 case EXPR_OFFSETOF: return false;
8463 case EXPR_VA_START: return true;
8464 case EXPR_VA_ARG: return true;
8465 case EXPR_STATEMENT: return true; // TODO
8466 case EXPR_COMPOUND_LITERAL: return false;
8468 case EXPR_UNARY_NEGATE: return false;
8469 case EXPR_UNARY_PLUS: return false;
8470 case EXPR_UNARY_BITWISE_NEGATE: return false;
8471 case EXPR_UNARY_NOT: return false;
8472 case EXPR_UNARY_DEREFERENCE: return false;
8473 case EXPR_UNARY_TAKE_ADDRESS: return false;
8474 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
8475 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
8476 case EXPR_UNARY_PREFIX_INCREMENT: return true;
8477 case EXPR_UNARY_PREFIX_DECREMENT: return true;
8479 /* Treat void casts as if they have an effect in order to being able to
8480 * suppress the warning */
8481 case EXPR_UNARY_CAST: {
8482 type_t *const type = skip_typeref(expr->base.type);
8483 return is_type_atomic(type, ATOMIC_TYPE_VOID);
8486 case EXPR_UNARY_CAST_IMPLICIT: return true;
8487 case EXPR_UNARY_ASSUME: return true;
8489 case EXPR_BINARY_ADD: return false;
8490 case EXPR_BINARY_SUB: return false;
8491 case EXPR_BINARY_MUL: return false;
8492 case EXPR_BINARY_DIV: return false;
8493 case EXPR_BINARY_MOD: return false;
8494 case EXPR_BINARY_EQUAL: return false;
8495 case EXPR_BINARY_NOTEQUAL: return false;
8496 case EXPR_BINARY_LESS: return false;
8497 case EXPR_BINARY_LESSEQUAL: return false;
8498 case EXPR_BINARY_GREATER: return false;
8499 case EXPR_BINARY_GREATEREQUAL: return false;
8500 case EXPR_BINARY_BITWISE_AND: return false;
8501 case EXPR_BINARY_BITWISE_OR: return false;
8502 case EXPR_BINARY_BITWISE_XOR: return false;
8503 case EXPR_BINARY_SHIFTLEFT: return false;
8504 case EXPR_BINARY_SHIFTRIGHT: return false;
8505 case EXPR_BINARY_ASSIGN: return true;
8506 case EXPR_BINARY_MUL_ASSIGN: return true;
8507 case EXPR_BINARY_DIV_ASSIGN: return true;
8508 case EXPR_BINARY_MOD_ASSIGN: return true;
8509 case EXPR_BINARY_ADD_ASSIGN: return true;
8510 case EXPR_BINARY_SUB_ASSIGN: return true;
8511 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
8512 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
8513 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
8514 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
8515 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
8517 /* Only examine the right hand side of && and ||, because the left hand
8518 * side already has the effect of controlling the execution of the right
8520 case EXPR_BINARY_LOGICAL_AND:
8521 case EXPR_BINARY_LOGICAL_OR:
8522 /* Only examine the right hand side of a comma expression, because the left
8523 * hand side has a separate warning */
8524 case EXPR_BINARY_COMMA:
8525 return expression_has_effect(expr->binary.right);
8527 case EXPR_BINARY_BUILTIN_EXPECT: return true;
8528 case EXPR_BINARY_ISGREATER: return false;
8529 case EXPR_BINARY_ISGREATEREQUAL: return false;
8530 case EXPR_BINARY_ISLESS: return false;
8531 case EXPR_BINARY_ISLESSEQUAL: return false;
8532 case EXPR_BINARY_ISLESSGREATER: return false;
8533 case EXPR_BINARY_ISUNORDERED: return false;
8536 internal_errorf(HERE, "unexpected expression");
8539 static void semantic_comma(binary_expression_t *expression)
8541 if (warning.unused_value) {
8542 const expression_t *const left = expression->left;
8543 if (!expression_has_effect(left)) {
8544 warningf(&left->base.source_position,
8545 "left-hand operand of comma expression has no effect");
8548 expression->base.type = expression->right->base.type;
8551 #define CREATE_BINEXPR_PARSER(token_type, binexpression_type, sfunc, lr) \
8552 static expression_t *parse_##binexpression_type(unsigned precedence, \
8553 expression_t *left) \
8555 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
8556 binexpr->base.source_position = *HERE; \
8557 binexpr->binary.left = left; \
8560 expression_t *right = parse_sub_expression(precedence + lr); \
8562 binexpr->binary.right = right; \
8563 sfunc(&binexpr->binary); \
8568 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, semantic_comma, 1)
8569 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, semantic_binexpr_arithmetic, 1)
8570 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, semantic_divmod_arithmetic, 1)
8571 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, semantic_divmod_arithmetic, 1)
8572 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, semantic_add, 1)
8573 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, semantic_sub, 1)
8574 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, semantic_comparison, 1)
8575 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, semantic_comparison, 1)
8576 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, semantic_binexpr_assign, 0)
8578 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL,
8579 semantic_comparison, 1)
8580 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL,
8581 semantic_comparison, 1)
8582 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL,
8583 semantic_comparison, 1)
8584 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL,
8585 semantic_comparison, 1)
8587 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND,
8588 semantic_binexpr_arithmetic, 1)
8589 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR,
8590 semantic_binexpr_arithmetic, 1)
8591 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR,
8592 semantic_binexpr_arithmetic, 1)
8593 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND,
8594 semantic_logical_op, 1)
8595 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR,
8596 semantic_logical_op, 1)
8597 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT,
8598 semantic_shift_op, 1)
8599 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT,
8600 semantic_shift_op, 1)
8601 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN,
8602 semantic_arithmetic_addsubb_assign, 0)
8603 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN,
8604 semantic_arithmetic_addsubb_assign, 0)
8605 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN,
8606 semantic_arithmetic_assign, 0)
8607 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN,
8608 semantic_divmod_assign, 0)
8609 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN,
8610 semantic_divmod_assign, 0)
8611 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN,
8612 semantic_arithmetic_assign, 0)
8613 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN,
8614 semantic_arithmetic_assign, 0)
8615 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN,
8616 semantic_arithmetic_assign, 0)
8617 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN,
8618 semantic_arithmetic_assign, 0)
8619 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN,
8620 semantic_arithmetic_assign, 0)
8622 static expression_t *parse_sub_expression(unsigned precedence)
8624 if (token.type < 0) {
8625 return expected_expression_error();
8628 expression_parser_function_t *parser
8629 = &expression_parsers[token.type];
8630 source_position_t source_position = token.source_position;
8633 if (parser->parser != NULL) {
8634 left = parser->parser(parser->precedence);
8636 left = parse_primary_expression();
8638 assert(left != NULL);
8639 left->base.source_position = source_position;
8642 if (token.type < 0) {
8643 return expected_expression_error();
8646 parser = &expression_parsers[token.type];
8647 if (parser->infix_parser == NULL)
8649 if (parser->infix_precedence < precedence)
8652 left = parser->infix_parser(parser->infix_precedence, left);
8654 assert(left != NULL);
8655 assert(left->kind != EXPR_UNKNOWN);
8656 left->base.source_position = source_position;
8663 * Parse an expression.
8665 static expression_t *parse_expression(void)
8667 return parse_sub_expression(1);
8671 * Register a parser for a prefix-like operator with given precedence.
8673 * @param parser the parser function
8674 * @param token_type the token type of the prefix token
8675 * @param precedence the precedence of the operator
8677 static void register_expression_parser(parse_expression_function parser,
8678 int token_type, unsigned precedence)
8680 expression_parser_function_t *entry = &expression_parsers[token_type];
8682 if (entry->parser != NULL) {
8683 diagnosticf("for token '%k'\n", (token_type_t)token_type);
8684 panic("trying to register multiple expression parsers for a token");
8686 entry->parser = parser;
8687 entry->precedence = precedence;
8691 * Register a parser for an infix operator with given precedence.
8693 * @param parser the parser function
8694 * @param token_type the token type of the infix operator
8695 * @param precedence the precedence of the operator
8697 static void register_infix_parser(parse_expression_infix_function parser,
8698 int token_type, unsigned precedence)
8700 expression_parser_function_t *entry = &expression_parsers[token_type];
8702 if (entry->infix_parser != NULL) {
8703 diagnosticf("for token '%k'\n", (token_type_t)token_type);
8704 panic("trying to register multiple infix expression parsers for a "
8707 entry->infix_parser = parser;
8708 entry->infix_precedence = precedence;
8712 * Initialize the expression parsers.
8714 static void init_expression_parsers(void)
8716 memset(&expression_parsers, 0, sizeof(expression_parsers));
8718 register_infix_parser(parse_array_expression, '[', 30);
8719 register_infix_parser(parse_call_expression, '(', 30);
8720 register_infix_parser(parse_select_expression, '.', 30);
8721 register_infix_parser(parse_select_expression, T_MINUSGREATER, 30);
8722 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT,
8724 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT,
8727 register_infix_parser(parse_EXPR_BINARY_MUL, '*', 17);
8728 register_infix_parser(parse_EXPR_BINARY_DIV, '/', 17);
8729 register_infix_parser(parse_EXPR_BINARY_MOD, '%', 17);
8730 register_infix_parser(parse_EXPR_BINARY_ADD, '+', 16);
8731 register_infix_parser(parse_EXPR_BINARY_SUB, '-', 16);
8732 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, 15);
8733 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, 15);
8734 register_infix_parser(parse_EXPR_BINARY_LESS, '<', 14);
8735 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', 14);
8736 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, 14);
8737 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, 14);
8738 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, 13);
8739 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL,
8740 T_EXCLAMATIONMARKEQUAL, 13);
8741 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', 12);
8742 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', 11);
8743 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', 10);
8744 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, 9);
8745 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, 8);
8746 register_infix_parser(parse_conditional_expression, '?', 7);
8747 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', 2);
8748 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, 2);
8749 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, 2);
8750 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, 2);
8751 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, 2);
8752 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, 2);
8753 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN,
8754 T_LESSLESSEQUAL, 2);
8755 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN,
8756 T_GREATERGREATEREQUAL, 2);
8757 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN,
8759 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN,
8761 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN,
8764 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', 1);
8766 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-', 25);
8767 register_expression_parser(parse_EXPR_UNARY_PLUS, '+', 25);
8768 register_expression_parser(parse_EXPR_UNARY_NOT, '!', 25);
8769 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~', 25);
8770 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*', 25);
8771 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&', 25);
8772 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT,
8774 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT,
8776 register_expression_parser(parse_sizeof, T_sizeof, 25);
8777 register_expression_parser(parse_alignof, T___alignof__, 25);
8778 register_expression_parser(parse_extension, T___extension__, 25);
8779 register_expression_parser(parse_builtin_classify_type,
8780 T___builtin_classify_type, 25);
8784 * Parse a asm statement arguments specification.
8786 static asm_argument_t *parse_asm_arguments(bool is_out)
8788 asm_argument_t *result = NULL;
8789 asm_argument_t *last = NULL;
8791 while (token.type == T_STRING_LITERAL || token.type == '[') {
8792 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
8793 memset(argument, 0, sizeof(argument[0]));
8795 if (token.type == '[') {
8797 if (token.type != T_IDENTIFIER) {
8798 parse_error_expected("while parsing asm argument",
8799 T_IDENTIFIER, NULL);
8802 argument->symbol = token.v.symbol;
8807 argument->constraints = parse_string_literals();
8809 add_anchor_token(')');
8810 expression_t *expression = parse_expression();
8811 rem_anchor_token(')');
8813 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
8814 * change size or type representation (e.g. int -> long is ok, but
8815 * int -> float is not) */
8816 if (expression->kind == EXPR_UNARY_CAST) {
8817 type_t *const type = expression->base.type;
8818 type_kind_t const kind = type->kind;
8819 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
8822 if (kind == TYPE_ATOMIC) {
8823 atomic_type_kind_t const akind = type->atomic.akind;
8824 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8825 size = get_atomic_type_size(akind);
8827 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8828 size = get_atomic_type_size(get_intptr_kind());
8832 expression_t *const value = expression->unary.value;
8833 type_t *const value_type = value->base.type;
8834 type_kind_t const value_kind = value_type->kind;
8836 unsigned value_flags;
8837 unsigned value_size;
8838 if (value_kind == TYPE_ATOMIC) {
8839 atomic_type_kind_t const value_akind = value_type->atomic.akind;
8840 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8841 value_size = get_atomic_type_size(value_akind);
8842 } else if (value_kind == TYPE_POINTER) {
8843 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8844 value_size = get_atomic_type_size(get_intptr_kind());
8849 if (value_flags != flags || value_size != size)
8853 } while (expression->kind == EXPR_UNARY_CAST);
8857 if (!is_lvalue(expression)) {
8858 errorf(&expression->base.source_position,
8859 "asm output argument is not an lvalue");
8862 if (argument->constraints.begin[0] == '+')
8863 mark_decls_read(expression, NULL);
8865 mark_decls_read(expression, NULL);
8867 argument->expression = expression;
8870 set_address_taken(expression, true);
8873 last->next = argument;
8879 if (token.type != ',')
8890 * Parse a asm statement clobber specification.
8892 static asm_clobber_t *parse_asm_clobbers(void)
8894 asm_clobber_t *result = NULL;
8895 asm_clobber_t *last = NULL;
8897 while(token.type == T_STRING_LITERAL) {
8898 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
8899 clobber->clobber = parse_string_literals();
8902 last->next = clobber;
8908 if (token.type != ',')
8917 * Parse an asm statement.
8919 static statement_t *parse_asm_statement(void)
8921 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
8922 asm_statement_t *asm_statement = &statement->asms;
8926 if (token.type == T_volatile) {
8928 asm_statement->is_volatile = true;
8932 add_anchor_token(')');
8933 add_anchor_token(':');
8934 asm_statement->asm_text = parse_string_literals();
8936 if (token.type != ':') {
8937 rem_anchor_token(':');
8942 asm_statement->outputs = parse_asm_arguments(true);
8943 if (token.type != ':') {
8944 rem_anchor_token(':');
8949 asm_statement->inputs = parse_asm_arguments(false);
8950 if (token.type != ':') {
8951 rem_anchor_token(':');
8954 rem_anchor_token(':');
8957 asm_statement->clobbers = parse_asm_clobbers();
8960 rem_anchor_token(')');
8964 if (asm_statement->outputs == NULL) {
8965 /* GCC: An 'asm' instruction without any output operands will be treated
8966 * identically to a volatile 'asm' instruction. */
8967 asm_statement->is_volatile = true;
8972 return create_invalid_statement();
8976 * Parse a case statement.
8978 static statement_t *parse_case_statement(void)
8980 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
8981 source_position_t *const pos = &statement->base.source_position;
8985 expression_t *const expression = parse_expression();
8986 statement->case_label.expression = expression;
8987 if (!is_constant_expression(expression)) {
8988 /* This check does not prevent the error message in all cases of an
8989 * prior error while parsing the expression. At least it catches the
8990 * common case of a mistyped enum entry. */
8991 if (is_type_valid(skip_typeref(expression->base.type))) {
8992 errorf(pos, "case label does not reduce to an integer constant");
8994 statement->case_label.is_bad = true;
8996 long const val = fold_constant(expression);
8997 statement->case_label.first_case = val;
8998 statement->case_label.last_case = val;
9002 if (token.type == T_DOTDOTDOT) {
9004 expression_t *const end_range = parse_expression();
9005 statement->case_label.end_range = end_range;
9006 if (!is_constant_expression(end_range)) {
9007 /* This check does not prevent the error message in all cases of an
9008 * prior error while parsing the expression. At least it catches the
9009 * common case of a mistyped enum entry. */
9010 if (is_type_valid(skip_typeref(end_range->base.type))) {
9011 errorf(pos, "case range does not reduce to an integer constant");
9013 statement->case_label.is_bad = true;
9015 long const val = fold_constant(end_range);
9016 statement->case_label.last_case = val;
9018 if (val < statement->case_label.first_case) {
9019 statement->case_label.is_empty_range = true;
9020 warningf(pos, "empty range specified");
9026 PUSH_PARENT(statement);
9030 if (current_switch != NULL) {
9031 if (! statement->case_label.is_bad) {
9032 /* Check for duplicate case values */
9033 case_label_statement_t *c = &statement->case_label;
9034 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
9035 if (l->is_bad || l->is_empty_range || l->expression == NULL)
9038 if (c->last_case < l->first_case || c->first_case > l->last_case)
9041 errorf(pos, "duplicate case value (previously used %P)",
9042 &l->base.source_position);
9046 /* link all cases into the switch statement */
9047 if (current_switch->last_case == NULL) {
9048 current_switch->first_case = &statement->case_label;
9050 current_switch->last_case->next = &statement->case_label;
9052 current_switch->last_case = &statement->case_label;
9054 errorf(pos, "case label not within a switch statement");
9057 statement_t *const inner_stmt = parse_statement();
9058 statement->case_label.statement = inner_stmt;
9059 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9060 errorf(&inner_stmt->base.source_position, "declaration after case label");
9067 return create_invalid_statement();
9071 * Parse a default statement.
9073 static statement_t *parse_default_statement(void)
9075 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9079 PUSH_PARENT(statement);
9082 if (current_switch != NULL) {
9083 const case_label_statement_t *def_label = current_switch->default_label;
9084 if (def_label != NULL) {
9085 errorf(HERE, "multiple default labels in one switch (previous declared %P)",
9086 &def_label->base.source_position);
9088 current_switch->default_label = &statement->case_label;
9090 /* link all cases into the switch statement */
9091 if (current_switch->last_case == NULL) {
9092 current_switch->first_case = &statement->case_label;
9094 current_switch->last_case->next = &statement->case_label;
9096 current_switch->last_case = &statement->case_label;
9099 errorf(&statement->base.source_position,
9100 "'default' label not within a switch statement");
9103 statement_t *const inner_stmt = parse_statement();
9104 statement->case_label.statement = inner_stmt;
9105 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9106 errorf(&inner_stmt->base.source_position, "declaration after default label");
9113 return create_invalid_statement();
9117 * Parse a label statement.
9119 static statement_t *parse_label_statement(void)
9121 assert(token.type == T_IDENTIFIER);
9122 symbol_t *symbol = token.v.symbol;
9123 declaration_t *label = get_label(symbol);
9125 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
9126 statement->label.label = label;
9130 PUSH_PARENT(statement);
9132 /* if statement is already set then the label is defined twice,
9133 * otherwise it was just mentioned in a goto/local label declaration so far */
9134 if (label->init.statement != NULL) {
9135 errorf(HERE, "duplicate label '%Y' (declared %P)",
9136 symbol, &label->source_position);
9138 label->source_position = token.source_position;
9139 label->init.statement = statement;
9144 if (token.type == '}') {
9145 /* TODO only warn? */
9147 warningf(HERE, "label at end of compound statement");
9148 statement->label.statement = create_empty_statement();
9150 errorf(HERE, "label at end of compound statement");
9151 statement->label.statement = create_invalid_statement();
9153 } else if (token.type == ';') {
9154 /* Eat an empty statement here, to avoid the warning about an empty
9155 * statement after a label. label:; is commonly used to have a label
9156 * before a closing brace. */
9157 statement->label.statement = create_empty_statement();
9160 statement_t *const inner_stmt = parse_statement();
9161 statement->label.statement = inner_stmt;
9162 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9163 errorf(&inner_stmt->base.source_position, "declaration after label");
9167 /* remember the labels in a list for later checking */
9168 if (label_last == NULL) {
9169 label_first = &statement->label;
9171 label_last->next = &statement->label;
9173 label_last = &statement->label;
9180 * Parse an if statement.
9182 static statement_t *parse_if(void)
9184 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
9188 PUSH_PARENT(statement);
9190 add_anchor_token('{');
9193 add_anchor_token(')');
9194 expression_t *const expr = parse_expression();
9195 statement->ifs.condition = expr;
9196 mark_decls_read(expr, NULL);
9197 rem_anchor_token(')');
9201 rem_anchor_token('{');
9203 add_anchor_token(T_else);
9204 statement->ifs.true_statement = parse_statement();
9205 rem_anchor_token(T_else);
9207 if (token.type == T_else) {
9209 statement->ifs.false_statement = parse_statement();
9217 * Check that all enums are handled in a switch.
9219 * @param statement the switch statement to check
9221 static void check_enum_cases(const switch_statement_t *statement) {
9222 const type_t *type = skip_typeref(statement->expression->base.type);
9223 if (! is_type_enum(type))
9225 const enum_type_t *enumt = &type->enumt;
9227 /* if we have a default, no warnings */
9228 if (statement->default_label != NULL)
9231 /* FIXME: calculation of value should be done while parsing */
9232 const declaration_t *declaration;
9233 long last_value = -1;
9234 for (declaration = enumt->declaration->next;
9235 declaration != NULL && declaration->storage_class == STORAGE_CLASS_ENUM_ENTRY;
9236 declaration = declaration->next) {
9237 const expression_t *expression = declaration->init.enum_value;
9238 long value = expression != NULL ? fold_constant(expression) : last_value + 1;
9240 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
9241 if (l->expression == NULL)
9243 if (l->first_case <= value && value <= l->last_case) {
9249 warningf(&statement->base.source_position,
9250 "enumeration value '%Y' not handled in switch", declaration->symbol);
9257 * Parse a switch statement.
9259 static statement_t *parse_switch(void)
9261 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
9265 PUSH_PARENT(statement);
9268 add_anchor_token(')');
9269 expression_t *const expr = parse_expression();
9270 mark_decls_read(expr, NULL);
9271 type_t * type = skip_typeref(expr->base.type);
9272 if (is_type_integer(type)) {
9273 type = promote_integer(type);
9274 if (warning.traditional) {
9275 if (get_rank(type) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
9276 warningf(&expr->base.source_position,
9277 "'%T' switch expression not converted to '%T' in ISO C",
9281 } else if (is_type_valid(type)) {
9282 errorf(&expr->base.source_position,
9283 "switch quantity is not an integer, but '%T'", type);
9284 type = type_error_type;
9286 statement->switchs.expression = create_implicit_cast(expr, type);
9288 rem_anchor_token(')');
9290 switch_statement_t *rem = current_switch;
9291 current_switch = &statement->switchs;
9292 statement->switchs.body = parse_statement();
9293 current_switch = rem;
9295 if (warning.switch_default &&
9296 statement->switchs.default_label == NULL) {
9297 warningf(&statement->base.source_position, "switch has no default case");
9299 if (warning.switch_enum)
9300 check_enum_cases(&statement->switchs);
9306 return create_invalid_statement();
9309 static statement_t *parse_loop_body(statement_t *const loop)
9311 statement_t *const rem = current_loop;
9312 current_loop = loop;
9314 statement_t *const body = parse_statement();
9321 * Parse a while statement.
9323 static statement_t *parse_while(void)
9325 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
9329 PUSH_PARENT(statement);
9332 add_anchor_token(')');
9333 expression_t *const cond = parse_expression();
9334 statement->whiles.condition = cond;
9335 mark_decls_read(cond, NULL);
9336 rem_anchor_token(')');
9339 statement->whiles.body = parse_loop_body(statement);
9345 return create_invalid_statement();
9349 * Parse a do statement.
9351 static statement_t *parse_do(void)
9353 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
9357 PUSH_PARENT(statement);
9359 add_anchor_token(T_while);
9360 statement->do_while.body = parse_loop_body(statement);
9361 rem_anchor_token(T_while);
9365 add_anchor_token(')');
9366 expression_t *const cond = parse_expression();
9367 statement->do_while.condition = cond;
9368 mark_decls_read(cond, NULL);
9369 rem_anchor_token(')');
9377 return create_invalid_statement();
9381 * Parse a for statement.
9383 static statement_t *parse_for(void)
9385 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9389 PUSH_PARENT(statement);
9391 size_t const top = environment_top();
9392 scope_push(&statement->fors.scope);
9395 add_anchor_token(')');
9397 if (token.type != ';') {
9398 if (is_declaration_specifier(&token, false)) {
9399 parse_declaration(record_declaration);
9401 add_anchor_token(';');
9402 expression_t *const init = parse_expression();
9403 statement->fors.initialisation = init;
9404 mark_decls_read(init, DECL_ANY);
9405 if (warning.unused_value && !expression_has_effect(init)) {
9406 warningf(&init->base.source_position,
9407 "initialisation of 'for'-statement has no effect");
9409 rem_anchor_token(';');
9416 if (token.type != ';') {
9417 add_anchor_token(';');
9418 expression_t *const cond = parse_expression();
9419 statement->fors.condition = cond;
9420 mark_decls_read(cond, NULL);
9421 rem_anchor_token(';');
9424 if (token.type != ')') {
9425 expression_t *const step = parse_expression();
9426 statement->fors.step = step;
9427 mark_decls_read(step, DECL_ANY);
9428 if (warning.unused_value && !expression_has_effect(step)) {
9429 warningf(&step->base.source_position,
9430 "step of 'for'-statement has no effect");
9433 rem_anchor_token(')');
9435 statement->fors.body = parse_loop_body(statement);
9437 assert(scope == &statement->fors.scope);
9439 environment_pop_to(top);
9446 rem_anchor_token(')');
9447 assert(scope == &statement->fors.scope);
9449 environment_pop_to(top);
9451 return create_invalid_statement();
9455 * Parse a goto statement.
9457 static statement_t *parse_goto(void)
9459 statement_t *statement = allocate_statement_zero(STATEMENT_GOTO);
9462 if (GNU_MODE && token.type == '*') {
9464 expression_t *expression = parse_expression();
9465 mark_decls_read(expression, NULL);
9467 /* Argh: although documentation say the expression must be of type void *,
9468 * gcc excepts anything that can be casted into void * without error */
9469 type_t *type = expression->base.type;
9471 if (type != type_error_type) {
9472 if (!is_type_pointer(type) && !is_type_integer(type)) {
9473 errorf(&expression->base.source_position,
9474 "cannot convert to a pointer type");
9475 } else if (type != type_void_ptr) {
9476 warningf(&expression->base.source_position,
9477 "type of computed goto expression should be 'void*' not '%T'", type);
9479 expression = create_implicit_cast(expression, type_void_ptr);
9482 statement->gotos.expression = expression;
9484 if (token.type != T_IDENTIFIER) {
9486 parse_error_expected("while parsing goto", T_IDENTIFIER, '*', NULL);
9488 parse_error_expected("while parsing goto", T_IDENTIFIER, NULL);
9492 symbol_t *symbol = token.v.symbol;
9495 statement->gotos.label = get_label(symbol);
9497 if (statement->gotos.label->parent_scope->depth < current_function->scope.depth) {
9498 statement->gotos.outer_fkt_jmp = true;
9502 /* remember the goto's in a list for later checking */
9503 if (goto_last == NULL) {
9504 goto_first = &statement->gotos;
9506 goto_last->next = &statement->gotos;
9508 goto_last = &statement->gotos;
9514 return create_invalid_statement();
9518 * Parse a continue statement.
9520 static statement_t *parse_continue(void)
9522 if (current_loop == NULL) {
9523 errorf(HERE, "continue statement not within loop");
9526 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
9536 * Parse a break statement.
9538 static statement_t *parse_break(void)
9540 if (current_switch == NULL && current_loop == NULL) {
9541 errorf(HERE, "break statement not within loop or switch");
9544 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
9554 * Parse a __leave statement.
9556 static statement_t *parse_leave_statement(void)
9558 if (current_try == NULL) {
9559 errorf(HERE, "__leave statement not within __try");
9562 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
9572 * Check if a given declaration represents a local variable.
9574 static bool is_local_var_declaration(const declaration_t *declaration)
9576 switch ((storage_class_tag_t) declaration->storage_class) {
9577 case STORAGE_CLASS_AUTO:
9578 case STORAGE_CLASS_REGISTER: {
9579 const type_t *type = skip_typeref(declaration->type);
9580 if (is_type_function(type)) {
9592 * Check if a given declaration represents a variable.
9594 static bool is_var_declaration(const declaration_t *declaration)
9596 if (declaration->storage_class == STORAGE_CLASS_TYPEDEF)
9599 const type_t *type = skip_typeref(declaration->type);
9600 return !is_type_function(type);
9604 * Check if a given expression represents a local variable.
9606 static bool is_local_variable(const expression_t *expression)
9608 if (expression->base.kind != EXPR_REFERENCE) {
9611 const declaration_t *declaration = expression->reference.declaration;
9612 return is_local_var_declaration(declaration);
9616 * Check if a given expression represents a local variable and
9617 * return its declaration then, else return NULL.
9619 declaration_t *expr_is_variable(const expression_t *expression)
9621 if (expression->base.kind != EXPR_REFERENCE) {
9624 declaration_t *declaration = expression->reference.declaration;
9625 if (is_var_declaration(declaration))
9631 * Parse a return statement.
9633 static statement_t *parse_return(void)
9637 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
9639 expression_t *return_value = NULL;
9640 if (token.type != ';') {
9641 return_value = parse_expression();
9642 mark_decls_read(return_value, NULL);
9645 const type_t *const func_type = current_function->type;
9646 assert(is_type_function(func_type));
9647 type_t *const return_type = skip_typeref(func_type->function.return_type);
9649 if (return_value != NULL) {
9650 type_t *return_value_type = skip_typeref(return_value->base.type);
9652 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID)
9653 && !is_type_atomic(return_value_type, ATOMIC_TYPE_VOID)) {
9654 warningf(&statement->base.source_position,
9655 "'return' with a value, in function returning void");
9656 return_value = NULL;
9658 assign_error_t error = semantic_assign(return_type, return_value);
9659 report_assign_error(error, return_type, return_value, "'return'",
9660 &statement->base.source_position);
9661 return_value = create_implicit_cast(return_value, return_type);
9663 /* check for returning address of a local var */
9664 if (return_value != NULL &&
9665 return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
9666 const expression_t *expression = return_value->unary.value;
9667 if (is_local_variable(expression)) {
9668 warningf(&statement->base.source_position,
9669 "function returns address of local variable");
9673 if (!is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
9674 warningf(&statement->base.source_position,
9675 "'return' without value, in function returning non-void");
9678 statement->returns.value = return_value;
9687 * Parse a declaration statement.
9689 static statement_t *parse_declaration_statement(void)
9691 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9693 declaration_t *before = last_declaration;
9695 parse_external_declaration();
9697 parse_declaration(record_declaration);
9699 if (before == NULL) {
9700 statement->declaration.declarations_begin = scope->declarations;
9702 statement->declaration.declarations_begin = before->next;
9704 statement->declaration.declarations_end = last_declaration;
9710 * Parse an expression statement, ie. expr ';'.
9712 static statement_t *parse_expression_statement(void)
9714 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
9716 expression_t *const expr = parse_expression();
9717 statement->expression.expression = expr;
9718 mark_decls_read(expr, DECL_ANY);
9727 * Parse a microsoft __try { } __finally { } or
9728 * __try{ } __except() { }
9730 static statement_t *parse_ms_try_statment(void)
9732 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
9735 PUSH_PARENT(statement);
9737 ms_try_statement_t *rem = current_try;
9738 current_try = &statement->ms_try;
9739 statement->ms_try.try_statement = parse_compound_statement(false);
9744 if (token.type == T___except) {
9747 add_anchor_token(')');
9748 expression_t *const expr = parse_expression();
9749 mark_decls_read(expr, NULL);
9750 type_t * type = skip_typeref(expr->base.type);
9751 if (is_type_integer(type)) {
9752 type = promote_integer(type);
9753 } else if (is_type_valid(type)) {
9754 errorf(&expr->base.source_position,
9755 "__expect expression is not an integer, but '%T'", type);
9756 type = type_error_type;
9758 statement->ms_try.except_expression = create_implicit_cast(expr, type);
9759 rem_anchor_token(')');
9761 statement->ms_try.final_statement = parse_compound_statement(false);
9762 } else if (token.type == T__finally) {
9764 statement->ms_try.final_statement = parse_compound_statement(false);
9766 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
9767 return create_invalid_statement();
9771 return create_invalid_statement();
9774 static statement_t *parse_empty_statement(void)
9776 if (warning.empty_statement) {
9777 warningf(HERE, "statement is empty");
9779 statement_t *const statement = create_empty_statement();
9784 static statement_t *parse_local_label_declaration(void) {
9785 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9789 declaration_t *begin = NULL, *end = NULL;
9792 if (token.type != T_IDENTIFIER) {
9793 parse_error_expected("while parsing local label declaration",
9794 T_IDENTIFIER, NULL);
9797 symbol_t *symbol = token.v.symbol;
9798 declaration_t *declaration = get_declaration(symbol, NAMESPACE_LOCAL_LABEL);
9799 if (declaration != NULL) {
9800 errorf(HERE, "multiple definitions of '__label__ %Y' (previous definition at %P)",
9801 symbol, &declaration->source_position);
9803 declaration = allocate_declaration_zero();
9804 declaration->namespc = NAMESPACE_LOCAL_LABEL;
9805 declaration->source_position = token.source_position;
9806 declaration->symbol = symbol;
9807 declaration->parent_scope = scope;
9808 declaration->init.statement = NULL;
9811 end->next = declaration;
9814 begin = declaration;
9816 local_label_push(declaration);
9820 if (token.type != ',')
9826 statement->declaration.declarations_begin = begin;
9827 statement->declaration.declarations_end = end;
9832 * Parse a statement.
9833 * There's also parse_statement() which additionally checks for
9834 * "statement has no effect" warnings
9836 static statement_t *intern_parse_statement(void)
9838 statement_t *statement = NULL;
9840 /* declaration or statement */
9841 add_anchor_token(';');
9842 switch (token.type) {
9843 case T_IDENTIFIER: {
9844 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
9845 if (la1_type == ':') {
9846 statement = parse_label_statement();
9847 } else if (is_typedef_symbol(token.v.symbol)) {
9848 statement = parse_declaration_statement();
9849 } else switch (la1_type) {
9851 if (get_declaration(token.v.symbol, NAMESPACE_NORMAL) != NULL)
9852 goto expression_statment;
9857 statement = parse_declaration_statement();
9861 expression_statment:
9862 statement = parse_expression_statement();
9868 case T___extension__:
9869 /* This can be a prefix to a declaration or an expression statement.
9870 * We simply eat it now and parse the rest with tail recursion. */
9873 } while (token.type == T___extension__);
9874 bool old_gcc_extension = in_gcc_extension;
9875 in_gcc_extension = true;
9876 statement = parse_statement();
9877 in_gcc_extension = old_gcc_extension;
9881 statement = parse_declaration_statement();
9885 statement = parse_local_label_declaration();
9888 case ';': statement = parse_empty_statement(); break;
9889 case '{': statement = parse_compound_statement(false); break;
9890 case T___leave: statement = parse_leave_statement(); break;
9891 case T___try: statement = parse_ms_try_statment(); break;
9892 case T_asm: statement = parse_asm_statement(); break;
9893 case T_break: statement = parse_break(); break;
9894 case T_case: statement = parse_case_statement(); break;
9895 case T_continue: statement = parse_continue(); break;
9896 case T_default: statement = parse_default_statement(); break;
9897 case T_do: statement = parse_do(); break;
9898 case T_for: statement = parse_for(); break;
9899 case T_goto: statement = parse_goto(); break;
9900 case T_if: statement = parse_if(); break;
9901 case T_return: statement = parse_return(); break;
9902 case T_switch: statement = parse_switch(); break;
9903 case T_while: statement = parse_while(); break;
9913 case T_CHARACTER_CONSTANT:
9914 case T_FLOATINGPOINT:
9918 case T_STRING_LITERAL:
9919 case T_WIDE_CHARACTER_CONSTANT:
9920 case T_WIDE_STRING_LITERAL:
9921 case T___FUNCDNAME__:
9923 case T___FUNCTION__:
9924 case T___PRETTY_FUNCTION__:
9925 case T___builtin_alloca:
9926 case T___builtin_classify_type:
9927 case T___builtin_constant_p:
9928 case T___builtin_expect:
9929 case T___builtin_huge_val:
9930 case T___builtin_isgreater:
9931 case T___builtin_isgreaterequal:
9932 case T___builtin_isless:
9933 case T___builtin_islessequal:
9934 case T___builtin_islessgreater:
9935 case T___builtin_isunordered:
9936 case T___builtin_inf:
9937 case T___builtin_inff:
9938 case T___builtin_infl:
9939 case T___builtin_nan:
9940 case T___builtin_nanf:
9941 case T___builtin_nanl:
9942 case T___builtin_offsetof:
9943 case T___builtin_prefetch:
9944 case T___builtin_va_arg:
9945 case T___builtin_va_end:
9946 case T___builtin_va_start:
9950 statement = parse_expression_statement();
9954 errorf(HERE, "unexpected token %K while parsing statement", &token);
9955 statement = create_invalid_statement();
9960 rem_anchor_token(';');
9962 assert(statement != NULL
9963 && statement->base.source_position.input_name != NULL);
9969 * parse a statement and emits "statement has no effect" warning if needed
9970 * (This is really a wrapper around intern_parse_statement with check for 1
9971 * single warning. It is needed, because for statement expressions we have
9972 * to avoid the warning on the last statement)
9974 static statement_t *parse_statement(void)
9976 statement_t *statement = intern_parse_statement();
9978 if (statement->kind == STATEMENT_EXPRESSION && warning.unused_value) {
9979 expression_t *expression = statement->expression.expression;
9980 if (!expression_has_effect(expression)) {
9981 warningf(&expression->base.source_position,
9982 "statement has no effect");
9990 * Parse a compound statement.
9992 static statement_t *parse_compound_statement(bool inside_expression_statement)
9994 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
9996 PUSH_PARENT(statement);
9999 add_anchor_token('}');
10001 size_t const top = environment_top();
10002 size_t const top_local = local_label_top();
10003 scope_push(&statement->compound.scope);
10005 statement_t **anchor = &statement->compound.statements;
10006 bool only_decls_so_far = true;
10007 while (token.type != '}') {
10008 if (token.type == T_EOF) {
10009 errorf(&statement->base.source_position,
10010 "EOF while parsing compound statement");
10013 statement_t *sub_statement = intern_parse_statement();
10014 if (is_invalid_statement(sub_statement)) {
10015 /* an error occurred. if we are at an anchor, return */
10021 if (warning.declaration_after_statement) {
10022 if (sub_statement->kind != STATEMENT_DECLARATION) {
10023 only_decls_so_far = false;
10024 } else if (!only_decls_so_far) {
10025 warningf(&sub_statement->base.source_position,
10026 "ISO C90 forbids mixed declarations and code");
10030 *anchor = sub_statement;
10032 while (sub_statement->base.next != NULL)
10033 sub_statement = sub_statement->base.next;
10035 anchor = &sub_statement->base.next;
10039 /* look over all statements again to produce no effect warnings */
10040 if (warning.unused_value) {
10041 statement_t *sub_statement = statement->compound.statements;
10042 for( ; sub_statement != NULL; sub_statement = sub_statement->base.next) {
10043 if (sub_statement->kind != STATEMENT_EXPRESSION)
10045 /* don't emit a warning for the last expression in an expression
10046 * statement as it has always an effect */
10047 if (inside_expression_statement && sub_statement->base.next == NULL)
10050 expression_t *expression = sub_statement->expression.expression;
10051 if (!expression_has_effect(expression)) {
10052 warningf(&expression->base.source_position,
10053 "statement has no effect");
10059 rem_anchor_token('}');
10060 assert(scope == &statement->compound.scope);
10062 environment_pop_to(top);
10063 local_label_pop_to(top_local);
10070 * Initialize builtin types.
10072 static void initialize_builtin_types(void)
10074 type_intmax_t = make_global_typedef("__intmax_t__", type_long_long);
10075 type_size_t = make_global_typedef("__SIZE_TYPE__", type_unsigned_long);
10076 type_ssize_t = make_global_typedef("__SSIZE_TYPE__", type_long);
10077 type_ptrdiff_t = make_global_typedef("__PTRDIFF_TYPE__", type_long);
10078 type_uintmax_t = make_global_typedef("__uintmax_t__", type_unsigned_long_long);
10079 type_uptrdiff_t = make_global_typedef("__UPTRDIFF_TYPE__", type_unsigned_long);
10080 type_wchar_t = make_global_typedef("__WCHAR_TYPE__", opt_short_wchar_t ? type_unsigned_short : type_int);
10081 type_wint_t = make_global_typedef("__WINT_TYPE__", type_int);
10083 type_intmax_t_ptr = make_pointer_type(type_intmax_t, TYPE_QUALIFIER_NONE);
10084 type_ptrdiff_t_ptr = make_pointer_type(type_ptrdiff_t, TYPE_QUALIFIER_NONE);
10085 type_ssize_t_ptr = make_pointer_type(type_ssize_t, TYPE_QUALIFIER_NONE);
10086 type_wchar_t_ptr = make_pointer_type(type_wchar_t, TYPE_QUALIFIER_NONE);
10088 /* const version of wchar_t */
10089 type_const_wchar_t = allocate_type_zero(TYPE_TYPEDEF, &builtin_source_position);
10090 type_const_wchar_t->typedeft.declaration = type_wchar_t->typedeft.declaration;
10091 type_const_wchar_t->base.qualifiers |= TYPE_QUALIFIER_CONST;
10093 type_const_wchar_t_ptr = make_pointer_type(type_const_wchar_t, TYPE_QUALIFIER_NONE);
10097 * Check for unused global static functions and variables
10099 static void check_unused_globals(void)
10101 if (!warning.unused_function && !warning.unused_variable)
10104 for (const declaration_t *decl = file_scope->declarations; decl != NULL; decl = decl->next) {
10106 decl->modifiers & DM_UNUSED ||
10107 decl->modifiers & DM_USED ||
10108 decl->storage_class != STORAGE_CLASS_STATIC)
10111 type_t *const type = decl->type;
10113 if (is_type_function(skip_typeref(type))) {
10114 if (!warning.unused_function || decl->is_inline)
10117 s = (decl->init.statement != NULL ? "defined" : "declared");
10119 if (!warning.unused_variable)
10125 warningf(&decl->source_position, "'%#T' %s but not used",
10126 type, decl->symbol, s);
10130 static void parse_global_asm(void)
10132 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
10137 statement->asms.asm_text = parse_string_literals();
10138 statement->base.next = unit->global_asm;
10139 unit->global_asm = statement;
10148 * Parse a translation unit.
10150 static void parse_translation_unit(void)
10152 add_anchor_token(T_EOF);
10155 unsigned char token_anchor_copy[T_LAST_TOKEN];
10156 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
10160 bool anchor_leak = false;
10161 for (int i = 0; i != T_LAST_TOKEN; ++i) {
10162 unsigned char count = token_anchor_set[i] - token_anchor_copy[i];
10164 errorf(HERE, "Leaked anchor token %k %d times", i, count);
10165 anchor_leak = true;
10168 if (in_gcc_extension) {
10169 errorf(HERE, "Leaked __extension__");
10170 anchor_leak = true;
10177 switch (token.type) {
10180 case T___extension__:
10181 parse_external_declaration();
10185 parse_global_asm();
10189 rem_anchor_token(T_EOF);
10193 if (!strict_mode) {
10194 warningf(HERE, "stray ';' outside of function");
10201 errorf(HERE, "stray %K outside of function", &token);
10202 if (token.type == '(' || token.type == '{' || token.type == '[')
10203 eat_until_matching_token(token.type);
10213 * @return the translation unit or NULL if errors occurred.
10215 void start_parsing(void)
10217 environment_stack = NEW_ARR_F(stack_entry_t, 0);
10218 label_stack = NEW_ARR_F(stack_entry_t, 0);
10219 local_label_stack = NEW_ARR_F(stack_entry_t, 0);
10220 diagnostic_count = 0;
10224 type_set_output(stderr);
10225 ast_set_output(stderr);
10227 assert(unit == NULL);
10228 unit = allocate_ast_zero(sizeof(unit[0]));
10230 assert(file_scope == NULL);
10231 file_scope = &unit->scope;
10233 assert(scope == NULL);
10234 scope_push(&unit->scope);
10236 initialize_builtin_types();
10239 translation_unit_t *finish_parsing(void)
10241 /* do NOT use scope_pop() here, this will crash, will it by hand */
10242 assert(scope == &unit->scope);
10244 last_declaration = NULL;
10246 assert(file_scope == &unit->scope);
10247 check_unused_globals();
10250 DEL_ARR_F(environment_stack);
10251 DEL_ARR_F(label_stack);
10252 DEL_ARR_F(local_label_stack);
10254 translation_unit_t *result = unit;
10261 lookahead_bufpos = 0;
10262 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
10265 parse_translation_unit();
10269 * Initialize the parser.
10271 void init_parser(void)
10273 sym_anonymous = symbol_table_insert("<anonymous>");
10275 if (c_mode & _MS) {
10276 /* add predefined symbols for extended-decl-modifier */
10277 sym_align = symbol_table_insert("align");
10278 sym_allocate = symbol_table_insert("allocate");
10279 sym_dllimport = symbol_table_insert("dllimport");
10280 sym_dllexport = symbol_table_insert("dllexport");
10281 sym_naked = symbol_table_insert("naked");
10282 sym_noinline = symbol_table_insert("noinline");
10283 sym_noreturn = symbol_table_insert("noreturn");
10284 sym_nothrow = symbol_table_insert("nothrow");
10285 sym_novtable = symbol_table_insert("novtable");
10286 sym_property = symbol_table_insert("property");
10287 sym_get = symbol_table_insert("get");
10288 sym_put = symbol_table_insert("put");
10289 sym_selectany = symbol_table_insert("selectany");
10290 sym_thread = symbol_table_insert("thread");
10291 sym_uuid = symbol_table_insert("uuid");
10292 sym_deprecated = symbol_table_insert("deprecated");
10293 sym_restrict = symbol_table_insert("restrict");
10294 sym_noalias = symbol_table_insert("noalias");
10296 memset(token_anchor_set, 0, sizeof(token_anchor_set));
10298 init_expression_parsers();
10299 obstack_init(&temp_obst);
10301 symbol_t *const va_list_sym = symbol_table_insert("__builtin_va_list");
10302 type_valist = create_builtin_type(va_list_sym, type_void_ptr);
10306 * Terminate the parser.
10308 void exit_parser(void)
10310 obstack_free(&temp_obst, NULL);