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"
37 #include "lang_features.h"
38 #include "walk_statements.h"
40 #include "adt/bitfiddle.h"
41 #include "adt/error.h"
42 #include "adt/array.h"
44 /** if wchar_t is equal to unsigned short. */
45 bool opt_short_wchar_t =
52 //#define PRINT_TOKENS
53 #define MAX_LOOKAHEAD 2
61 typedef struct argument_list_t argument_list_t;
62 struct argument_list_t {
64 argument_list_t *next;
67 typedef struct gnu_attribute_t gnu_attribute_t;
68 struct gnu_attribute_t {
69 gnu_attribute_kind_t kind; /**< The kind of the GNU attribute. */
70 gnu_attribute_t *next;
71 bool invalid; /**< Set if this attribute had argument errors, */
72 bool have_arguments; /**< True, if this attribute has arguments. */
76 atomic_type_kind_t akind;
77 long argument; /**< Single argument. */
78 argument_list_t *arguments; /**< List of argument expressions. */
82 typedef struct declaration_specifiers_t declaration_specifiers_t;
83 struct declaration_specifiers_t {
84 source_position_t source_position;
85 storage_class_t storage_class;
86 unsigned char alignment; /**< Alignment, 0 if not set. */
89 decl_modifiers_t modifiers; /**< declaration modifiers */
90 gnu_attribute_t *gnu_attributes; /**< list of GNU attributes */
91 const char *deprecated_string; /**< can be set if declaration was marked deprecated. */
92 symbol_t *get_property_sym; /**< the name of the get property if set. */
93 symbol_t *put_property_sym; /**< the name of the put property if set. */
98 * An environment for parsing initializers (and compound literals).
100 typedef struct parse_initializer_env_t {
101 type_t *type; /**< the type of the initializer. In case of an
102 array type with unspecified size this gets
103 adjusted to the actual size. */
104 entity_t *entity; /**< the variable that is initialized if any */
105 bool must_be_constant;
106 } parse_initializer_env_t;
108 typedef entity_t* (*parsed_declaration_func) (entity_t *declaration, bool is_definition);
110 /** The current token. */
111 static token_t token;
112 /** The lookahead ring-buffer. */
113 static token_t lookahead_buffer[MAX_LOOKAHEAD];
114 /** Position of the next token in the lookahead buffer. */
115 static int lookahead_bufpos;
116 static stack_entry_t *environment_stack = NULL;
117 static stack_entry_t *label_stack = NULL;
118 static stack_entry_t *local_label_stack = NULL;
119 /** The global file scope. */
120 static scope_t *file_scope = NULL;
121 /** The current scope. */
122 static scope_t *scope = NULL;
123 /** Point to the current function declaration if inside a function. */
124 static function_t *current_function = NULL;
125 static entity_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 /** special symbol used for anonymous entities. */
149 static const symbol_t *sym_anonymous = NULL;
151 /* symbols for Microsoft extended-decl-modifier */
152 static const symbol_t *sym_align = NULL;
153 static const symbol_t *sym_allocate = NULL;
154 static const symbol_t *sym_dllimport = NULL;
155 static const symbol_t *sym_dllexport = NULL;
156 static const symbol_t *sym_naked = NULL;
157 static const symbol_t *sym_noinline = NULL;
158 static const symbol_t *sym_noreturn = NULL;
159 static const symbol_t *sym_nothrow = NULL;
160 static const symbol_t *sym_novtable = NULL;
161 static const symbol_t *sym_property = NULL;
162 static const symbol_t *sym_get = NULL;
163 static const symbol_t *sym_put = NULL;
164 static const symbol_t *sym_selectany = NULL;
165 static const symbol_t *sym_thread = NULL;
166 static const symbol_t *sym_uuid = NULL;
167 static const symbol_t *sym_deprecated = NULL;
168 static const symbol_t *sym_restrict = NULL;
169 static const symbol_t *sym_noalias = NULL;
171 /** The token anchor set */
172 static unsigned char token_anchor_set[T_LAST_TOKEN];
174 /** The current source position. */
175 #define HERE (&token.source_position)
177 /** true if we are in GCC mode. */
178 #define GNU_MODE ((c_mode & _GNUC) || in_gcc_extension)
180 static type_t *type_valist;
182 static statement_t *parse_compound_statement(bool inside_expression_statement);
183 static statement_t *parse_statement(void);
185 static expression_t *parse_sub_expression(precedence_t);
186 static expression_t *parse_expression(void);
187 static type_t *parse_typename(void);
189 static void parse_compound_type_entries(compound_t *compound_declaration);
190 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
191 bool may_be_abstract,
192 bool create_compound_member);
193 static entity_t *record_entity(entity_t *entity, bool is_definition);
195 static void semantic_comparison(binary_expression_t *expression);
197 #define STORAGE_CLASSES \
205 #define TYPE_QUALIFIERS \
210 case T__forceinline: \
211 case T___attribute__:
213 #ifdef PROVIDE_COMPLEX
214 #define COMPLEX_SPECIFIERS \
216 #define IMAGINARY_SPECIFIERS \
219 #define COMPLEX_SPECIFIERS
220 #define IMAGINARY_SPECIFIERS
223 #define TYPE_SPECIFIERS \
238 case T___builtin_va_list: \
243 #define DECLARATION_START \
248 #define TYPENAME_START \
252 #define EXPRESSION_START \
261 case T_CHARACTER_CONSTANT: \
262 case T_FLOATINGPOINT: \
266 case T_STRING_LITERAL: \
267 case T_WIDE_CHARACTER_CONSTANT: \
268 case T_WIDE_STRING_LITERAL: \
269 case T___FUNCDNAME__: \
270 case T___FUNCSIG__: \
271 case T___FUNCTION__: \
272 case T___PRETTY_FUNCTION__: \
273 case T___alignof__: \
274 case T___builtin_alloca: \
275 case T___builtin_classify_type: \
276 case T___builtin_constant_p: \
277 case T___builtin_expect: \
278 case T___builtin_huge_val: \
279 case T___builtin_inf: \
280 case T___builtin_inff: \
281 case T___builtin_infl: \
282 case T___builtin_isgreater: \
283 case T___builtin_isgreaterequal: \
284 case T___builtin_isless: \
285 case T___builtin_islessequal: \
286 case T___builtin_islessgreater: \
287 case T___builtin_isunordered: \
288 case T___builtin_nan: \
289 case T___builtin_nanf: \
290 case T___builtin_nanl: \
291 case T___builtin_offsetof: \
292 case T___builtin_prefetch: \
293 case T___builtin_va_arg: \
294 case T___builtin_va_end: \
295 case T___builtin_va_start: \
304 * Allocate an AST node with given size and
305 * initialize all fields with zero.
307 static void *allocate_ast_zero(size_t size)
309 void *res = allocate_ast(size);
310 memset(res, 0, size);
314 static size_t get_entity_struct_size(entity_kind_t kind)
316 static const size_t sizes[] = {
317 [ENTITY_VARIABLE] = sizeof(variable_t),
318 [ENTITY_COMPOUND_MEMBER] = sizeof(variable_t),
319 [ENTITY_FUNCTION] = sizeof(function_t),
320 [ENTITY_TYPEDEF] = sizeof(typedef_t),
321 [ENTITY_STRUCT] = sizeof(compound_t),
322 [ENTITY_UNION] = sizeof(compound_t),
323 [ENTITY_ENUM] = sizeof(enum_t),
324 [ENTITY_ENUM_VALUE] = sizeof(enum_value_t),
325 [ENTITY_LABEL] = sizeof(label_t),
326 [ENTITY_LOCAL_LABEL] = sizeof(label_t)
328 assert(kind <= sizeof(sizes) / sizeof(sizes[0]));
329 assert(sizes[kind] != 0);
333 static entity_t *allocate_entity_zero(entity_kind_t kind)
335 size_t size = get_entity_struct_size(kind);
336 entity_t *entity = allocate_ast_zero(size);
342 * Returns the size of a statement node.
344 * @param kind the statement kind
346 static size_t get_statement_struct_size(statement_kind_t kind)
348 static const size_t sizes[] = {
349 [STATEMENT_INVALID] = sizeof(invalid_statement_t),
350 [STATEMENT_EMPTY] = sizeof(empty_statement_t),
351 [STATEMENT_COMPOUND] = sizeof(compound_statement_t),
352 [STATEMENT_RETURN] = sizeof(return_statement_t),
353 [STATEMENT_DECLARATION] = sizeof(declaration_statement_t),
354 [STATEMENT_LOCAL_LABEL] = sizeof(local_label_statement_t),
355 [STATEMENT_IF] = sizeof(if_statement_t),
356 [STATEMENT_SWITCH] = sizeof(switch_statement_t),
357 [STATEMENT_EXPRESSION] = sizeof(expression_statement_t),
358 [STATEMENT_CONTINUE] = sizeof(statement_base_t),
359 [STATEMENT_BREAK] = sizeof(statement_base_t),
360 [STATEMENT_GOTO] = sizeof(goto_statement_t),
361 [STATEMENT_LABEL] = sizeof(label_statement_t),
362 [STATEMENT_CASE_LABEL] = sizeof(case_label_statement_t),
363 [STATEMENT_WHILE] = sizeof(while_statement_t),
364 [STATEMENT_DO_WHILE] = sizeof(do_while_statement_t),
365 [STATEMENT_FOR] = sizeof(for_statement_t),
366 [STATEMENT_ASM] = sizeof(asm_statement_t),
367 [STATEMENT_MS_TRY] = sizeof(ms_try_statement_t),
368 [STATEMENT_LEAVE] = sizeof(leave_statement_t)
370 assert(kind <= sizeof(sizes) / sizeof(sizes[0]));
371 assert(sizes[kind] != 0);
376 * Returns the size of an expression node.
378 * @param kind the expression kind
380 static size_t get_expression_struct_size(expression_kind_t kind)
382 static const size_t sizes[] = {
383 [EXPR_INVALID] = sizeof(expression_base_t),
384 [EXPR_REFERENCE] = sizeof(reference_expression_t),
385 [EXPR_REFERENCE_ENUM_VALUE] = sizeof(reference_expression_t),
386 [EXPR_CONST] = sizeof(const_expression_t),
387 [EXPR_CHARACTER_CONSTANT] = sizeof(const_expression_t),
388 [EXPR_WIDE_CHARACTER_CONSTANT] = sizeof(const_expression_t),
389 [EXPR_STRING_LITERAL] = sizeof(string_literal_expression_t),
390 [EXPR_WIDE_STRING_LITERAL] = sizeof(wide_string_literal_expression_t),
391 [EXPR_COMPOUND_LITERAL] = sizeof(compound_literal_expression_t),
392 [EXPR_CALL] = sizeof(call_expression_t),
393 [EXPR_UNARY_FIRST] = sizeof(unary_expression_t),
394 [EXPR_BINARY_FIRST] = sizeof(binary_expression_t),
395 [EXPR_CONDITIONAL] = sizeof(conditional_expression_t),
396 [EXPR_SELECT] = sizeof(select_expression_t),
397 [EXPR_ARRAY_ACCESS] = sizeof(array_access_expression_t),
398 [EXPR_SIZEOF] = sizeof(typeprop_expression_t),
399 [EXPR_ALIGNOF] = sizeof(typeprop_expression_t),
400 [EXPR_CLASSIFY_TYPE] = sizeof(classify_type_expression_t),
401 [EXPR_FUNCNAME] = sizeof(funcname_expression_t),
402 [EXPR_BUILTIN_SYMBOL] = sizeof(builtin_symbol_expression_t),
403 [EXPR_BUILTIN_CONSTANT_P] = sizeof(builtin_constant_expression_t),
404 [EXPR_BUILTIN_PREFETCH] = sizeof(builtin_prefetch_expression_t),
405 [EXPR_OFFSETOF] = sizeof(offsetof_expression_t),
406 [EXPR_VA_START] = sizeof(va_start_expression_t),
407 [EXPR_VA_ARG] = sizeof(va_arg_expression_t),
408 [EXPR_STATEMENT] = sizeof(statement_expression_t),
409 [EXPR_LABEL_ADDRESS] = sizeof(label_address_expression_t),
411 if (kind >= EXPR_UNARY_FIRST && kind <= EXPR_UNARY_LAST) {
412 return sizes[EXPR_UNARY_FIRST];
414 if (kind >= EXPR_BINARY_FIRST && kind <= EXPR_BINARY_LAST) {
415 return sizes[EXPR_BINARY_FIRST];
417 assert(kind <= sizeof(sizes) / sizeof(sizes[0]));
418 assert(sizes[kind] != 0);
423 * Allocate a statement node of given kind and initialize all
426 static statement_t *allocate_statement_zero(statement_kind_t kind)
428 size_t size = get_statement_struct_size(kind);
429 statement_t *res = allocate_ast_zero(size);
431 res->base.kind = kind;
432 res->base.parent = current_parent;
433 res->base.source_position = token.source_position;
438 * Allocate an expression node of given kind and initialize all
441 static expression_t *allocate_expression_zero(expression_kind_t kind)
443 size_t size = get_expression_struct_size(kind);
444 expression_t *res = allocate_ast_zero(size);
446 res->base.kind = kind;
447 res->base.type = type_error_type;
448 res->base.source_position = token.source_position;
453 * Creates a new invalid expression.
455 static expression_t *create_invalid_expression(void)
457 return allocate_expression_zero(EXPR_INVALID);
461 * Creates a new invalid statement.
463 static statement_t *create_invalid_statement(void)
465 return allocate_statement_zero(STATEMENT_INVALID);
469 * Allocate a new empty statement.
471 static statement_t *create_empty_statement(void)
473 return allocate_statement_zero(STATEMENT_EMPTY);
477 * Returns the size of a type node.
479 * @param kind the type kind
481 static size_t get_type_struct_size(type_kind_t kind)
483 static const size_t sizes[] = {
484 [TYPE_ATOMIC] = sizeof(atomic_type_t),
485 [TYPE_COMPLEX] = sizeof(complex_type_t),
486 [TYPE_IMAGINARY] = sizeof(imaginary_type_t),
487 [TYPE_BITFIELD] = sizeof(bitfield_type_t),
488 [TYPE_COMPOUND_STRUCT] = sizeof(compound_type_t),
489 [TYPE_COMPOUND_UNION] = sizeof(compound_type_t),
490 [TYPE_ENUM] = sizeof(enum_type_t),
491 [TYPE_FUNCTION] = sizeof(function_type_t),
492 [TYPE_POINTER] = sizeof(pointer_type_t),
493 [TYPE_ARRAY] = sizeof(array_type_t),
494 [TYPE_BUILTIN] = sizeof(builtin_type_t),
495 [TYPE_TYPEDEF] = sizeof(typedef_type_t),
496 [TYPE_TYPEOF] = sizeof(typeof_type_t),
498 assert(sizeof(sizes) / sizeof(sizes[0]) == (int) TYPE_TYPEOF + 1);
499 assert(kind <= TYPE_TYPEOF);
500 assert(sizes[kind] != 0);
505 * Allocate a type node of given kind and initialize all
508 * @param kind type kind to allocate
510 static type_t *allocate_type_zero(type_kind_t kind)
512 size_t size = get_type_struct_size(kind);
513 type_t *res = obstack_alloc(type_obst, size);
514 memset(res, 0, size);
515 res->base.kind = kind;
521 * Returns the size of an initializer node.
523 * @param kind the initializer kind
525 static size_t get_initializer_size(initializer_kind_t kind)
527 static const size_t sizes[] = {
528 [INITIALIZER_VALUE] = sizeof(initializer_value_t),
529 [INITIALIZER_STRING] = sizeof(initializer_string_t),
530 [INITIALIZER_WIDE_STRING] = sizeof(initializer_wide_string_t),
531 [INITIALIZER_LIST] = sizeof(initializer_list_t),
532 [INITIALIZER_DESIGNATOR] = sizeof(initializer_designator_t)
534 assert(kind < sizeof(sizes) / sizeof(*sizes));
535 assert(sizes[kind] != 0);
540 * Allocate an initializer node of given kind and initialize all
543 static initializer_t *allocate_initializer_zero(initializer_kind_t kind)
545 initializer_t *result = allocate_ast_zero(get_initializer_size(kind));
552 * Free a type from the type obstack.
554 static void free_type(void *type)
556 obstack_free(type_obst, type);
560 * Returns the index of the top element of the environment stack.
562 static size_t environment_top(void)
564 return ARR_LEN(environment_stack);
568 * Returns the index of the top element of the global label stack.
570 static size_t label_top(void)
572 return ARR_LEN(label_stack);
576 * Returns the index of the top element of the local label stack.
578 static size_t local_label_top(void)
580 return ARR_LEN(local_label_stack);
584 * Return the next token.
586 static inline void next_token(void)
588 token = lookahead_buffer[lookahead_bufpos];
589 lookahead_buffer[lookahead_bufpos] = lexer_token;
592 lookahead_bufpos = (lookahead_bufpos+1) % MAX_LOOKAHEAD;
595 print_token(stderr, &token);
596 fprintf(stderr, "\n");
601 * Return the next token with a given lookahead.
603 static inline const token_t *look_ahead(int num)
605 assert(num > 0 && num <= MAX_LOOKAHEAD);
606 int pos = (lookahead_bufpos+num-1) % MAX_LOOKAHEAD;
607 return &lookahead_buffer[pos];
611 * Adds a token to the token anchor set (a multi-set).
613 static void add_anchor_token(int token_type)
615 assert(0 <= token_type && token_type < T_LAST_TOKEN);
616 ++token_anchor_set[token_type];
619 static int save_and_reset_anchor_state(int token_type)
621 assert(0 <= token_type && token_type < T_LAST_TOKEN);
622 int count = token_anchor_set[token_type];
623 token_anchor_set[token_type] = 0;
627 static void restore_anchor_state(int token_type, int count)
629 assert(0 <= token_type && token_type < T_LAST_TOKEN);
630 token_anchor_set[token_type] = count;
634 * Remove a token from the token anchor set (a multi-set).
636 static void rem_anchor_token(int token_type)
638 assert(0 <= token_type && token_type < T_LAST_TOKEN);
639 assert(token_anchor_set[token_type] != 0);
640 --token_anchor_set[token_type];
643 static bool at_anchor(void)
647 return token_anchor_set[token.type];
651 * Eat tokens until a matching token is found.
653 static void eat_until_matching_token(int type)
657 case '(': end_token = ')'; break;
658 case '{': end_token = '}'; break;
659 case '[': end_token = ']'; break;
660 default: end_token = type; break;
663 unsigned parenthesis_count = 0;
664 unsigned brace_count = 0;
665 unsigned bracket_count = 0;
666 while (token.type != end_token ||
667 parenthesis_count != 0 ||
669 bracket_count != 0) {
670 switch (token.type) {
672 case '(': ++parenthesis_count; break;
673 case '{': ++brace_count; break;
674 case '[': ++bracket_count; break;
677 if (parenthesis_count > 0)
687 if (bracket_count > 0)
690 if (token.type == end_token &&
691 parenthesis_count == 0 &&
705 * Eat input tokens until an anchor is found.
707 static void eat_until_anchor(void)
709 while (token_anchor_set[token.type] == 0) {
710 if (token.type == '(' || token.type == '{' || token.type == '[')
711 eat_until_matching_token(token.type);
716 static void eat_block(void)
718 eat_until_matching_token('{');
719 if (token.type == '}')
723 #define eat(token_type) do { assert(token.type == (token_type)); next_token(); } while (0)
726 * Report a parse error because an expected token was not found.
729 #if defined __GNUC__ && __GNUC__ >= 4
730 __attribute__((sentinel))
732 void parse_error_expected(const char *message, ...)
734 if (message != NULL) {
735 errorf(HERE, "%s", message);
738 va_start(ap, message);
739 errorf(HERE, "got %K, expected %#k", &token, &ap, ", ");
744 * Report a type error.
746 static void type_error(const char *msg, const source_position_t *source_position,
749 errorf(source_position, "%s, but found type '%T'", msg, type);
753 * Report an incompatible type.
755 static void type_error_incompatible(const char *msg,
756 const source_position_t *source_position, type_t *type1, type_t *type2)
758 errorf(source_position, "%s, incompatible types: '%T' - '%T'",
763 * Expect the the current token is the expected token.
764 * If not, generate an error, eat the current statement,
765 * and goto the end_error label.
767 #define expect(expected) \
769 if (UNLIKELY(token.type != (expected))) { \
770 parse_error_expected(NULL, (expected), NULL); \
771 add_anchor_token(expected); \
772 eat_until_anchor(); \
773 if (token.type == expected) \
775 rem_anchor_token(expected); \
781 static void scope_push(scope_t *new_scope)
784 new_scope->depth = scope->depth + 1;
786 new_scope->parent = scope;
790 static void scope_pop(void)
792 scope = scope->parent;
796 * Search an entity by its symbol in a given namespace.
798 static entity_t *get_entity(const symbol_t *const symbol, namespace_t namespc)
800 entity_t *entity = symbol->entity;
801 for( ; entity != NULL; entity = entity->base.symbol_next) {
802 if (entity->base.namespc == namespc)
810 * pushs an entity on the environment stack and links the corresponding symbol
813 static void stack_push(stack_entry_t **stack_ptr, entity_t *entity)
815 symbol_t *symbol = entity->base.symbol;
816 namespace_t namespc = entity->base.namespc;
817 assert(namespc != NAMESPACE_INVALID);
819 /* replace/add entity into entity list of the symbol */
822 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
827 /* replace an entry? */
828 if (iter->base.namespc == namespc) {
829 entity->base.symbol_next = iter->base.symbol_next;
835 /* remember old declaration */
837 entry.symbol = symbol;
838 entry.old_entity = iter;
839 entry.namespc = namespc;
840 ARR_APP1(stack_entry_t, *stack_ptr, entry);
844 * Push an entity on the environment stack.
846 static void environment_push(entity_t *entity)
848 assert(entity->base.source_position.input_name != NULL);
849 assert(entity->base.parent_scope != NULL);
850 stack_push(&environment_stack, entity);
854 * Push a declaration on the global label stack.
856 * @param declaration the declaration
858 static void label_push(entity_t *label)
860 /* we abuse the parameters scope as parent for the labels */
861 label->base.parent_scope = ¤t_function->parameters;
862 stack_push(&label_stack, label);
866 * Push a declaration of the local label stack.
868 * @param declaration the declaration
870 static void local_label_push(entity_t *label)
872 assert(label->base.parent_scope != NULL);
873 label->base.parent_scope = scope;
874 stack_push(&local_label_stack, label);
878 * pops symbols from the environment stack until @p new_top is the top element
880 static void stack_pop_to(stack_entry_t **stack_ptr, size_t new_top)
882 stack_entry_t *stack = *stack_ptr;
883 size_t top = ARR_LEN(stack);
886 assert(new_top <= top);
890 for(i = top; i > new_top; --i) {
891 stack_entry_t *entry = &stack[i - 1];
893 entity_t *old_entity = entry->old_entity;
894 symbol_t *symbol = entry->symbol;
895 namespace_t namespc = entry->namespc;
897 /* replace with old_entity/remove */
900 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
902 assert(iter != NULL);
903 /* replace an entry? */
904 if (iter->base.namespc == namespc)
908 /* restore definition from outer scopes (if there was one) */
909 if (old_entity != NULL) {
910 old_entity->base.symbol_next = iter->base.symbol_next;
911 *anchor = old_entity;
913 /* remove entry from list */
914 *anchor = iter->base.symbol_next;
918 ARR_SHRINKLEN(*stack_ptr, (int) new_top);
922 * Pop all entries from the environment stack until the new_top
925 * @param new_top the new stack top
927 static void environment_pop_to(size_t new_top)
929 stack_pop_to(&environment_stack, new_top);
933 * Pop all entries from the global label stack until the new_top
936 * @param new_top the new stack top
938 static void label_pop_to(size_t new_top)
940 stack_pop_to(&label_stack, new_top);
944 * Pop all entries from the local label stack until the new_top
947 * @param new_top the new stack top
949 static void local_label_pop_to(size_t new_top)
951 stack_pop_to(&local_label_stack, new_top);
955 static int get_akind_rank(atomic_type_kind_t akind)
960 static int get_rank(const type_t *type)
962 assert(!is_typeref(type));
963 /* The C-standard allows promoting enums to int or unsigned int (see § 7.2.2
964 * and esp. footnote 108). However we can't fold constants (yet), so we
965 * can't decide whether unsigned int is possible, while int always works.
966 * (unsigned int would be preferable when possible... for stuff like
967 * struct { enum { ... } bla : 4; } ) */
968 if (type->kind == TYPE_ENUM)
969 return get_akind_rank(ATOMIC_TYPE_INT);
971 assert(type->kind == TYPE_ATOMIC);
972 return get_akind_rank(type->atomic.akind);
975 static type_t *promote_integer(type_t *type)
977 if (type->kind == TYPE_BITFIELD)
978 type = type->bitfield.base_type;
980 if (get_rank(type) < get_akind_rank(ATOMIC_TYPE_INT))
987 * Create a cast expression.
989 * @param expression the expression to cast
990 * @param dest_type the destination type
992 static expression_t *create_cast_expression(expression_t *expression,
995 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST_IMPLICIT);
997 cast->unary.value = expression;
998 cast->base.type = dest_type;
1004 * Check if a given expression represents the 0 pointer constant.
1006 static bool is_null_pointer_constant(const expression_t *expression)
1008 /* skip void* cast */
1009 if (expression->kind == EXPR_UNARY_CAST
1010 || expression->kind == EXPR_UNARY_CAST_IMPLICIT) {
1011 expression = expression->unary.value;
1014 /* TODO: not correct yet, should be any constant integer expression
1015 * which evaluates to 0 */
1016 if (expression->kind != EXPR_CONST)
1019 type_t *const type = skip_typeref(expression->base.type);
1020 if (!is_type_integer(type))
1023 return expression->conste.v.int_value == 0;
1027 * Create an implicit cast expression.
1029 * @param expression the expression to cast
1030 * @param dest_type the destination type
1032 static expression_t *create_implicit_cast(expression_t *expression,
1035 type_t *const source_type = expression->base.type;
1037 if (source_type == dest_type)
1040 return create_cast_expression(expression, dest_type);
1043 typedef enum assign_error_t {
1045 ASSIGN_ERROR_INCOMPATIBLE,
1046 ASSIGN_ERROR_POINTER_QUALIFIER_MISSING,
1047 ASSIGN_WARNING_POINTER_INCOMPATIBLE,
1048 ASSIGN_WARNING_POINTER_FROM_INT,
1049 ASSIGN_WARNING_INT_FROM_POINTER
1052 static void report_assign_error(assign_error_t error, type_t *orig_type_left,
1053 const expression_t *const right,
1054 const char *context,
1055 const source_position_t *source_position)
1057 type_t *const orig_type_right = right->base.type;
1058 type_t *const type_left = skip_typeref(orig_type_left);
1059 type_t *const type_right = skip_typeref(orig_type_right);
1062 case ASSIGN_SUCCESS:
1064 case ASSIGN_ERROR_INCOMPATIBLE:
1065 errorf(source_position,
1066 "destination type '%T' in %s is incompatible with type '%T'",
1067 orig_type_left, context, orig_type_right);
1070 case ASSIGN_ERROR_POINTER_QUALIFIER_MISSING: {
1071 if (warning.other) {
1072 type_t *points_to_left = skip_typeref(type_left->pointer.points_to);
1073 type_t *points_to_right = skip_typeref(type_right->pointer.points_to);
1075 /* the left type has all qualifiers from the right type */
1076 unsigned missing_qualifiers
1077 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
1078 warningf(source_position,
1079 "destination type '%T' in %s from type '%T' lacks qualifiers '%Q' in pointer target type",
1080 orig_type_left, context, orig_type_right, missing_qualifiers);
1085 case ASSIGN_WARNING_POINTER_INCOMPATIBLE:
1086 if (warning.other) {
1087 warningf(source_position,
1088 "destination type '%T' in %s is incompatible with '%E' of type '%T'",
1089 orig_type_left, context, right, orig_type_right);
1093 case ASSIGN_WARNING_POINTER_FROM_INT:
1094 if (warning.other) {
1095 warningf(source_position,
1096 "%s makes pointer '%T' from integer '%T' without a cast",
1097 context, orig_type_left, orig_type_right);
1101 case ASSIGN_WARNING_INT_FROM_POINTER:
1102 if (warning.other) {
1103 warningf(source_position,
1104 "%s makes integer '%T' from pointer '%T' without a cast",
1105 context, orig_type_left, orig_type_right);
1110 panic("invalid error value");
1114 /** Implements the rules from § 6.5.16.1 */
1115 static assign_error_t semantic_assign(type_t *orig_type_left,
1116 const expression_t *const right)
1118 type_t *const orig_type_right = right->base.type;
1119 type_t *const type_left = skip_typeref(orig_type_left);
1120 type_t *const type_right = skip_typeref(orig_type_right);
1122 if (is_type_pointer(type_left)) {
1123 if (is_null_pointer_constant(right)) {
1124 return ASSIGN_SUCCESS;
1125 } else if (is_type_pointer(type_right)) {
1126 type_t *points_to_left
1127 = skip_typeref(type_left->pointer.points_to);
1128 type_t *points_to_right
1129 = skip_typeref(type_right->pointer.points_to);
1130 assign_error_t res = ASSIGN_SUCCESS;
1132 /* the left type has all qualifiers from the right type */
1133 unsigned missing_qualifiers
1134 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
1135 if (missing_qualifiers != 0) {
1136 res = ASSIGN_ERROR_POINTER_QUALIFIER_MISSING;
1139 points_to_left = get_unqualified_type(points_to_left);
1140 points_to_right = get_unqualified_type(points_to_right);
1142 if (is_type_atomic(points_to_left, ATOMIC_TYPE_VOID))
1145 if (is_type_atomic(points_to_right, ATOMIC_TYPE_VOID)) {
1146 /* ISO/IEC 14882:1998(E) §C.1.2:6 */
1147 return c_mode & _CXX ? ASSIGN_ERROR_INCOMPATIBLE : res;
1150 if (!types_compatible(points_to_left, points_to_right)) {
1151 return ASSIGN_WARNING_POINTER_INCOMPATIBLE;
1155 } else if (is_type_integer(type_right)) {
1156 return ASSIGN_WARNING_POINTER_FROM_INT;
1158 } else if ((is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) ||
1159 (is_type_atomic(type_left, ATOMIC_TYPE_BOOL)
1160 && is_type_pointer(type_right))) {
1161 return ASSIGN_SUCCESS;
1162 } else if ((is_type_compound(type_left) && is_type_compound(type_right))
1163 || (is_type_builtin(type_left) && is_type_builtin(type_right))) {
1164 type_t *const unqual_type_left = get_unqualified_type(type_left);
1165 type_t *const unqual_type_right = get_unqualified_type(type_right);
1166 if (types_compatible(unqual_type_left, unqual_type_right)) {
1167 return ASSIGN_SUCCESS;
1169 } else if (is_type_integer(type_left) && is_type_pointer(type_right)) {
1170 return ASSIGN_WARNING_INT_FROM_POINTER;
1173 if (!is_type_valid(type_left) || !is_type_valid(type_right))
1174 return ASSIGN_SUCCESS;
1176 return ASSIGN_ERROR_INCOMPATIBLE;
1179 static expression_t *parse_constant_expression(void)
1181 expression_t *result = parse_sub_expression(PREC_CONDITIONAL);
1183 if (!is_constant_expression(result)) {
1184 errorf(&result->base.source_position,
1185 "expression '%E' is not constant\n", result);
1191 static expression_t *parse_assignment_expression(void)
1193 return parse_sub_expression(PREC_ASSIGNMENT);
1196 static type_t *make_global_typedef(const char *name, type_t *type)
1198 symbol_t *const symbol = symbol_table_insert(name);
1200 entity_t *const entity = allocate_entity_zero(ENTITY_TYPEDEF);
1201 entity->base.symbol = symbol;
1202 entity->base.source_position = builtin_source_position;
1203 entity->base.namespc = NAMESPACE_NORMAL;
1204 entity->typedefe.type = type;
1205 entity->typedefe.builtin = true;
1207 record_entity(entity, false);
1209 type_t *typedef_type = allocate_type_zero(TYPE_TYPEDEF);
1210 typedef_type->typedeft.typedefe = &entity->typedefe;
1212 return typedef_type;
1215 static string_t parse_string_literals(void)
1217 assert(token.type == T_STRING_LITERAL);
1218 string_t result = token.v.string;
1222 while (token.type == T_STRING_LITERAL) {
1223 result = concat_strings(&result, &token.v.string);
1230 static const char *const gnu_attribute_names[GNU_AK_LAST] = {
1231 [GNU_AK_CONST] = "const",
1232 [GNU_AK_VOLATILE] = "volatile",
1233 [GNU_AK_CDECL] = "cdecl",
1234 [GNU_AK_STDCALL] = "stdcall",
1235 [GNU_AK_FASTCALL] = "fastcall",
1236 [GNU_AK_DEPRECATED] = "deprecated",
1237 [GNU_AK_NOINLINE] = "noinline",
1238 [GNU_AK_NORETURN] = "noreturn",
1239 [GNU_AK_NAKED] = "naked",
1240 [GNU_AK_PURE] = "pure",
1241 [GNU_AK_ALWAYS_INLINE] = "always_inline",
1242 [GNU_AK_MALLOC] = "malloc",
1243 [GNU_AK_WEAK] = "weak",
1244 [GNU_AK_CONSTRUCTOR] = "constructor",
1245 [GNU_AK_DESTRUCTOR] = "destructor",
1246 [GNU_AK_NOTHROW] = "nothrow",
1247 [GNU_AK_TRANSPARENT_UNION] = "transparent_union",
1248 [GNU_AK_COMMON] = "common",
1249 [GNU_AK_NOCOMMON] = "nocommon",
1250 [GNU_AK_PACKED] = "packed",
1251 [GNU_AK_SHARED] = "shared",
1252 [GNU_AK_NOTSHARED] = "notshared",
1253 [GNU_AK_USED] = "used",
1254 [GNU_AK_UNUSED] = "unused",
1255 [GNU_AK_NO_INSTRUMENT_FUNCTION] = "no_instrument_function",
1256 [GNU_AK_WARN_UNUSED_RESULT] = "warn_unused_result",
1257 [GNU_AK_LONGCALL] = "longcall",
1258 [GNU_AK_SHORTCALL] = "shortcall",
1259 [GNU_AK_LONG_CALL] = "long_call",
1260 [GNU_AK_SHORT_CALL] = "short_call",
1261 [GNU_AK_FUNCTION_VECTOR] = "function_vector",
1262 [GNU_AK_INTERRUPT] = "interrupt",
1263 [GNU_AK_INTERRUPT_HANDLER] = "interrupt_handler",
1264 [GNU_AK_NMI_HANDLER] = "nmi_handler",
1265 [GNU_AK_NESTING] = "nesting",
1266 [GNU_AK_NEAR] = "near",
1267 [GNU_AK_FAR] = "far",
1268 [GNU_AK_SIGNAL] = "signal",
1269 [GNU_AK_EIGTHBIT_DATA] = "eightbit_data",
1270 [GNU_AK_TINY_DATA] = "tiny_data",
1271 [GNU_AK_SAVEALL] = "saveall",
1272 [GNU_AK_FLATTEN] = "flatten",
1273 [GNU_AK_SSEREGPARM] = "sseregparm",
1274 [GNU_AK_EXTERNALLY_VISIBLE] = "externally_visible",
1275 [GNU_AK_RETURN_TWICE] = "return_twice",
1276 [GNU_AK_MAY_ALIAS] = "may_alias",
1277 [GNU_AK_MS_STRUCT] = "ms_struct",
1278 [GNU_AK_GCC_STRUCT] = "gcc_struct",
1279 [GNU_AK_DLLIMPORT] = "dllimport",
1280 [GNU_AK_DLLEXPORT] = "dllexport",
1281 [GNU_AK_ALIGNED] = "aligned",
1282 [GNU_AK_ALIAS] = "alias",
1283 [GNU_AK_SECTION] = "section",
1284 [GNU_AK_FORMAT] = "format",
1285 [GNU_AK_FORMAT_ARG] = "format_arg",
1286 [GNU_AK_WEAKREF] = "weakref",
1287 [GNU_AK_NONNULL] = "nonnull",
1288 [GNU_AK_TLS_MODEL] = "tls_model",
1289 [GNU_AK_VISIBILITY] = "visibility",
1290 [GNU_AK_REGPARM] = "regparm",
1291 [GNU_AK_MODE] = "mode",
1292 [GNU_AK_MODEL] = "model",
1293 [GNU_AK_TRAP_EXIT] = "trap_exit",
1294 [GNU_AK_SP_SWITCH] = "sp_switch",
1295 [GNU_AK_SENTINEL] = "sentinel"
1299 * compare two string, ignoring double underscores on the second.
1301 static int strcmp_underscore(const char *s1, const char *s2)
1303 if (s2[0] == '_' && s2[1] == '_') {
1304 size_t len2 = strlen(s2);
1305 size_t len1 = strlen(s1);
1306 if (len1 == len2-4 && s2[len2-2] == '_' && s2[len2-1] == '_') {
1307 return strncmp(s1, s2+2, len2-4);
1311 return strcmp(s1, s2);
1315 * Allocate a new gnu temporal attribute.
1317 static gnu_attribute_t *allocate_gnu_attribute(gnu_attribute_kind_t kind)
1319 gnu_attribute_t *attribute = obstack_alloc(&temp_obst, sizeof(*attribute));
1320 attribute->kind = kind;
1321 attribute->next = NULL;
1322 attribute->invalid = false;
1323 attribute->have_arguments = false;
1329 * parse one constant expression argument.
1331 static void parse_gnu_attribute_const_arg(gnu_attribute_t *attribute)
1333 expression_t *expression;
1334 add_anchor_token(')');
1335 expression = parse_constant_expression();
1336 rem_anchor_token(')');
1338 attribute->u.argument = fold_constant(expression);
1341 attribute->invalid = true;
1345 * parse a list of constant expressions arguments.
1347 static void parse_gnu_attribute_const_arg_list(gnu_attribute_t *attribute)
1349 argument_list_t **list = &attribute->u.arguments;
1350 argument_list_t *entry;
1351 expression_t *expression;
1352 add_anchor_token(')');
1353 add_anchor_token(',');
1355 expression = parse_constant_expression();
1356 entry = obstack_alloc(&temp_obst, sizeof(entry));
1357 entry->argument = fold_constant(expression);
1360 list = &entry->next;
1361 if (token.type != ',')
1365 rem_anchor_token(',');
1366 rem_anchor_token(')');
1370 attribute->invalid = true;
1374 * parse one string literal argument.
1376 static void parse_gnu_attribute_string_arg(gnu_attribute_t *attribute,
1379 add_anchor_token('(');
1380 if (token.type != T_STRING_LITERAL) {
1381 parse_error_expected("while parsing attribute directive",
1382 T_STRING_LITERAL, NULL);
1385 *string = parse_string_literals();
1386 rem_anchor_token('(');
1390 attribute->invalid = true;
1394 * parse one tls model.
1396 static void parse_gnu_attribute_tls_model_arg(gnu_attribute_t *attribute)
1398 static const char *const tls_models[] = {
1404 string_t string = { NULL, 0 };
1405 parse_gnu_attribute_string_arg(attribute, &string);
1406 if (string.begin != NULL) {
1407 for(size_t i = 0; i < 4; ++i) {
1408 if (strcmp(tls_models[i], string.begin) == 0) {
1409 attribute->u.value = i;
1413 errorf(HERE, "'%s' is an unrecognized tls model", string.begin);
1415 attribute->invalid = true;
1419 * parse one tls model.
1421 static void parse_gnu_attribute_visibility_arg(gnu_attribute_t *attribute)
1423 static const char *const visibilities[] = {
1429 string_t string = { NULL, 0 };
1430 parse_gnu_attribute_string_arg(attribute, &string);
1431 if (string.begin != NULL) {
1432 for(size_t i = 0; i < 4; ++i) {
1433 if (strcmp(visibilities[i], string.begin) == 0) {
1434 attribute->u.value = i;
1438 errorf(HERE, "'%s' is an unrecognized visibility", string.begin);
1440 attribute->invalid = true;
1444 * parse one (code) model.
1446 static void parse_gnu_attribute_model_arg(gnu_attribute_t *attribute)
1448 static const char *const visibilities[] = {
1453 string_t string = { NULL, 0 };
1454 parse_gnu_attribute_string_arg(attribute, &string);
1455 if (string.begin != NULL) {
1456 for(int i = 0; i < 3; ++i) {
1457 if (strcmp(visibilities[i], string.begin) == 0) {
1458 attribute->u.value = i;
1462 errorf(HERE, "'%s' is an unrecognized model", string.begin);
1464 attribute->invalid = true;
1467 static void parse_gnu_attribute_mode_arg(gnu_attribute_t *attribute)
1469 /* TODO: find out what is allowed here... */
1471 /* at least: byte, word, pointer, list of machine modes
1472 * __XXX___ is interpreted as XXX */
1473 add_anchor_token(')');
1475 if (token.type != T_IDENTIFIER) {
1476 expect(T_IDENTIFIER);
1479 /* This isn't really correct, the backend should provide a list of machine
1480 * specific modes (according to gcc philosophy that is...) */
1481 const char *symbol_str = token.v.symbol->string;
1482 if (strcmp_underscore("QI", symbol_str) == 0 ||
1483 strcmp_underscore("byte", symbol_str) == 0) {
1484 attribute->u.akind = ATOMIC_TYPE_CHAR;
1485 } else if (strcmp_underscore("HI", symbol_str) == 0) {
1486 attribute->u.akind = ATOMIC_TYPE_SHORT;
1487 } else if (strcmp_underscore("SI", symbol_str) == 0
1488 || strcmp_underscore("word", symbol_str) == 0
1489 || strcmp_underscore("pointer", symbol_str) == 0) {
1490 attribute->u.akind = ATOMIC_TYPE_INT;
1491 } else if (strcmp_underscore("DI", symbol_str) == 0) {
1492 attribute->u.akind = ATOMIC_TYPE_LONGLONG;
1495 warningf(HERE, "ignoring unknown mode '%s'", symbol_str);
1496 attribute->invalid = true;
1500 rem_anchor_token(')');
1504 attribute->invalid = true;
1508 * parse one interrupt argument.
1510 static void parse_gnu_attribute_interrupt_arg(gnu_attribute_t *attribute)
1512 static const char *const interrupts[] = {
1519 string_t string = { NULL, 0 };
1520 parse_gnu_attribute_string_arg(attribute, &string);
1521 if (string.begin != NULL) {
1522 for(size_t i = 0; i < 5; ++i) {
1523 if (strcmp(interrupts[i], string.begin) == 0) {
1524 attribute->u.value = i;
1528 errorf(HERE, "'%s' is not an interrupt", string.begin);
1530 attribute->invalid = true;
1534 * parse ( identifier, const expression, const expression )
1536 static void parse_gnu_attribute_format_args(gnu_attribute_t *attribute)
1538 static const char *const format_names[] = {
1546 if (token.type != T_IDENTIFIER) {
1547 parse_error_expected("while parsing format attribute directive", T_IDENTIFIER, NULL);
1550 const char *name = token.v.symbol->string;
1551 for(i = 0; i < 4; ++i) {
1552 if (strcmp_underscore(format_names[i], name) == 0)
1556 if (warning.attribute)
1557 warningf(HERE, "'%s' is an unrecognized format function type", name);
1562 add_anchor_token(')');
1563 add_anchor_token(',');
1564 parse_constant_expression();
1565 rem_anchor_token(',');
1566 rem_anchor_token(')');
1569 add_anchor_token(')');
1570 parse_constant_expression();
1571 rem_anchor_token(')');
1575 attribute->u.value = true;
1578 static void check_no_argument(gnu_attribute_t *attribute, const char *name)
1580 if (!attribute->have_arguments)
1583 /* should have no arguments */
1584 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1585 eat_until_matching_token('(');
1586 /* we have already consumed '(', so we stop before ')', eat it */
1588 attribute->invalid = true;
1592 * Parse one GNU attribute.
1594 * Note that attribute names can be specified WITH or WITHOUT
1595 * double underscores, ie const or __const__.
1597 * The following attributes are parsed without arguments
1622 * no_instrument_function
1623 * warn_unused_result
1640 * externally_visible
1648 * The following attributes are parsed with arguments
1649 * aligned( const expression )
1650 * alias( string literal )
1651 * section( string literal )
1652 * format( identifier, const expression, const expression )
1653 * format_arg( const expression )
1654 * tls_model( string literal )
1655 * visibility( string literal )
1656 * regparm( const expression )
1657 * model( string leteral )
1658 * trap_exit( const expression )
1659 * sp_switch( string literal )
1661 * The following attributes might have arguments
1662 * weak_ref( string literal )
1663 * non_null( const expression // ',' )
1664 * interrupt( string literal )
1665 * sentinel( constant expression )
1667 static decl_modifiers_t parse_gnu_attribute(gnu_attribute_t **attributes)
1669 gnu_attribute_t *head = *attributes;
1670 gnu_attribute_t *last = *attributes;
1671 decl_modifiers_t modifiers = 0;
1672 gnu_attribute_t *attribute;
1674 eat(T___attribute__);
1678 if (token.type != ')') {
1679 /* find the end of the list */
1681 while (last->next != NULL)
1685 /* non-empty attribute list */
1688 if (token.type == T_const) {
1690 } else if (token.type == T_volatile) {
1692 } else if (token.type == T_cdecl) {
1693 /* __attribute__((cdecl)), WITH ms mode */
1695 } else if (token.type == T_IDENTIFIER) {
1696 const symbol_t *sym = token.v.symbol;
1699 parse_error_expected("while parsing GNU attribute", T_IDENTIFIER, NULL);
1706 for(i = 0; i < GNU_AK_LAST; ++i) {
1707 if (strcmp_underscore(gnu_attribute_names[i], name) == 0)
1710 gnu_attribute_kind_t kind = (gnu_attribute_kind_t)i;
1713 if (kind == GNU_AK_LAST) {
1714 if (warning.attribute)
1715 warningf(HERE, "'%s' attribute directive ignored", name);
1717 /* skip possible arguments */
1718 if (token.type == '(') {
1719 eat_until_matching_token(')');
1722 /* check for arguments */
1723 attribute = allocate_gnu_attribute(kind);
1724 if (token.type == '(') {
1726 if (token.type == ')') {
1727 /* empty args are allowed */
1730 attribute->have_arguments = true;
1734 case GNU_AK_VOLATILE:
1739 case GNU_AK_NOCOMMON:
1741 case GNU_AK_NOTSHARED:
1742 case GNU_AK_NO_INSTRUMENT_FUNCTION:
1743 case GNU_AK_WARN_UNUSED_RESULT:
1744 case GNU_AK_LONGCALL:
1745 case GNU_AK_SHORTCALL:
1746 case GNU_AK_LONG_CALL:
1747 case GNU_AK_SHORT_CALL:
1748 case GNU_AK_FUNCTION_VECTOR:
1749 case GNU_AK_INTERRUPT_HANDLER:
1750 case GNU_AK_NMI_HANDLER:
1751 case GNU_AK_NESTING:
1755 case GNU_AK_EIGTHBIT_DATA:
1756 case GNU_AK_TINY_DATA:
1757 case GNU_AK_SAVEALL:
1758 case GNU_AK_FLATTEN:
1759 case GNU_AK_SSEREGPARM:
1760 case GNU_AK_EXTERNALLY_VISIBLE:
1761 case GNU_AK_RETURN_TWICE:
1762 case GNU_AK_MAY_ALIAS:
1763 case GNU_AK_MS_STRUCT:
1764 case GNU_AK_GCC_STRUCT:
1767 case GNU_AK_CDECL: modifiers |= DM_CDECL; goto no_arg;
1768 case GNU_AK_FASTCALL: modifiers |= DM_FASTCALL; goto no_arg;
1769 case GNU_AK_STDCALL: modifiers |= DM_STDCALL; goto no_arg;
1770 case GNU_AK_UNUSED: modifiers |= DM_UNUSED; goto no_arg;
1771 case GNU_AK_USED: modifiers |= DM_USED; goto no_arg;
1772 case GNU_AK_PURE: modifiers |= DM_PURE; goto no_arg;
1773 case GNU_AK_CONST: modifiers |= DM_CONST; goto no_arg;
1774 case GNU_AK_ALWAYS_INLINE: modifiers |= DM_FORCEINLINE; goto no_arg;
1775 case GNU_AK_DLLIMPORT: modifiers |= DM_DLLIMPORT; goto no_arg;
1776 case GNU_AK_DLLEXPORT: modifiers |= DM_DLLEXPORT; goto no_arg;
1777 case GNU_AK_PACKED: modifiers |= DM_PACKED; goto no_arg;
1778 case GNU_AK_NOINLINE: modifiers |= DM_NOINLINE; goto no_arg;
1779 case GNU_AK_NORETURN: modifiers |= DM_NORETURN; goto no_arg;
1780 case GNU_AK_NOTHROW: modifiers |= DM_NOTHROW; goto no_arg;
1781 case GNU_AK_TRANSPARENT_UNION: modifiers |= DM_TRANSPARENT_UNION; goto no_arg;
1782 case GNU_AK_CONSTRUCTOR: modifiers |= DM_CONSTRUCTOR; goto no_arg;
1783 case GNU_AK_DESTRUCTOR: modifiers |= DM_DESTRUCTOR; goto no_arg;
1784 case GNU_AK_DEPRECATED: modifiers |= DM_DEPRECATED; goto no_arg;
1786 case GNU_AK_ALIGNED:
1787 /* __align__ may be used without an argument */
1788 if (attribute->have_arguments) {
1789 parse_gnu_attribute_const_arg(attribute);
1793 case GNU_AK_FORMAT_ARG:
1794 case GNU_AK_REGPARM:
1795 case GNU_AK_TRAP_EXIT:
1796 if (!attribute->have_arguments) {
1797 /* should have arguments */
1798 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1799 attribute->invalid = true;
1801 parse_gnu_attribute_const_arg(attribute);
1804 case GNU_AK_SECTION:
1805 case GNU_AK_SP_SWITCH:
1806 if (!attribute->have_arguments) {
1807 /* should have arguments */
1808 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1809 attribute->invalid = true;
1811 parse_gnu_attribute_string_arg(attribute, &attribute->u.string);
1814 if (!attribute->have_arguments) {
1815 /* should have arguments */
1816 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1817 attribute->invalid = true;
1819 parse_gnu_attribute_format_args(attribute);
1821 case GNU_AK_WEAKREF:
1822 /* may have one string argument */
1823 if (attribute->have_arguments)
1824 parse_gnu_attribute_string_arg(attribute, &attribute->u.string);
1826 case GNU_AK_NONNULL:
1827 if (attribute->have_arguments)
1828 parse_gnu_attribute_const_arg_list(attribute);
1830 case GNU_AK_TLS_MODEL:
1831 if (!attribute->have_arguments) {
1832 /* should have arguments */
1833 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1835 parse_gnu_attribute_tls_model_arg(attribute);
1837 case GNU_AK_VISIBILITY:
1838 if (!attribute->have_arguments) {
1839 /* should have arguments */
1840 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1842 parse_gnu_attribute_visibility_arg(attribute);
1845 if (!attribute->have_arguments) {
1846 /* should have arguments */
1847 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1849 parse_gnu_attribute_model_arg(attribute);
1853 if (!attribute->have_arguments) {
1854 /* should have arguments */
1855 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1857 parse_gnu_attribute_mode_arg(attribute);
1860 case GNU_AK_INTERRUPT:
1861 /* may have one string argument */
1862 if (attribute->have_arguments)
1863 parse_gnu_attribute_interrupt_arg(attribute);
1865 case GNU_AK_SENTINEL:
1866 /* may have one string argument */
1867 if (attribute->have_arguments)
1868 parse_gnu_attribute_const_arg(attribute);
1871 /* already handled */
1875 check_no_argument(attribute, name);
1878 if (attribute != NULL) {
1880 last->next = attribute;
1883 head = last = attribute;
1887 if (token.type != ',')
1901 * Parse GNU attributes.
1903 static decl_modifiers_t parse_attributes(gnu_attribute_t **attributes)
1905 decl_modifiers_t modifiers = 0;
1908 switch (token.type) {
1909 case T___attribute__:
1910 modifiers |= parse_gnu_attribute(attributes);
1916 if (token.type != T_STRING_LITERAL) {
1917 parse_error_expected("while parsing assembler attribute",
1918 T_STRING_LITERAL, NULL);
1919 eat_until_matching_token('(');
1922 parse_string_literals();
1927 case T_cdecl: modifiers |= DM_CDECL; break;
1928 case T__fastcall: modifiers |= DM_FASTCALL; break;
1929 case T__stdcall: modifiers |= DM_STDCALL; break;
1932 /* TODO record modifier */
1934 warningf(HERE, "Ignoring declaration modifier %K", &token);
1938 default: return modifiers;
1945 static void mark_vars_read(expression_t *expr, variable_t *lhs_var);
1947 static variable_t *determine_lhs_var(expression_t *const expr,
1948 variable_t *lhs_var)
1950 switch (expr->kind) {
1951 case EXPR_REFERENCE: {
1952 entity_t *const entity = expr->reference.entity;
1953 /* we should only find variables as lavlues... */
1954 if (entity->base.kind != ENTITY_VARIABLE)
1957 return &entity->variable;
1960 case EXPR_ARRAY_ACCESS: {
1961 expression_t *const ref = expr->array_access.array_ref;
1962 variable_t * var = NULL;
1963 if (is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1964 var = determine_lhs_var(ref, lhs_var);
1967 mark_vars_read(expr->select.compound, lhs_var);
1969 mark_vars_read(expr->array_access.index, lhs_var);
1974 if (is_type_compound(skip_typeref(expr->base.type))) {
1975 return determine_lhs_var(expr->select.compound, lhs_var);
1977 mark_vars_read(expr->select.compound, lhs_var);
1982 case EXPR_UNARY_DEREFERENCE: {
1983 expression_t *const val = expr->unary.value;
1984 if (val->kind == EXPR_UNARY_TAKE_ADDRESS) {
1986 return determine_lhs_var(val->unary.value, lhs_var);
1988 mark_vars_read(val, NULL);
1994 mark_vars_read(expr, NULL);
1999 #define VAR_ANY ((variable_t*)-1)
2002 * Mark declarations, which are read. This is used to deted variables, which
2006 * x is not marked as "read", because it is only read to calculate its own new
2010 * x and y are not detected as "not read", because multiple variables are
2013 static void mark_vars_read(expression_t *const expr, variable_t *lhs_var)
2015 switch (expr->kind) {
2016 case EXPR_REFERENCE: {
2017 entity_t *const entity = expr->reference.entity;
2018 if (entity->kind != ENTITY_VARIABLE)
2021 variable_t *variable = &entity->variable;
2022 if (lhs_var != variable && lhs_var != VAR_ANY) {
2023 variable->read = true;
2029 // TODO respect pure/const
2030 mark_vars_read(expr->call.function, NULL);
2031 for (call_argument_t *arg = expr->call.arguments; arg != NULL; arg = arg->next) {
2032 mark_vars_read(arg->expression, NULL);
2036 case EXPR_CONDITIONAL:
2037 // TODO lhs_decl should depend on whether true/false have an effect
2038 mark_vars_read(expr->conditional.condition, NULL);
2039 if (expr->conditional.true_expression != NULL)
2040 mark_vars_read(expr->conditional.true_expression, lhs_var);
2041 mark_vars_read(expr->conditional.false_expression, lhs_var);
2045 if (lhs_var == VAR_ANY && !is_type_compound(skip_typeref(expr->base.type)))
2047 mark_vars_read(expr->select.compound, lhs_var);
2050 case EXPR_ARRAY_ACCESS: {
2051 expression_t *const ref = expr->array_access.array_ref;
2052 mark_vars_read(ref, lhs_var);
2053 lhs_var = determine_lhs_var(ref, lhs_var);
2054 mark_vars_read(expr->array_access.index, lhs_var);
2059 mark_vars_read(expr->va_arge.ap, lhs_var);
2062 case EXPR_UNARY_CAST:
2063 /* Special case: Use void cast to mark a variable as "read" */
2064 if (is_type_atomic(skip_typeref(expr->base.type), ATOMIC_TYPE_VOID))
2069 case EXPR_UNARY_THROW:
2070 if (expr->unary.value == NULL)
2073 case EXPR_UNARY_DEREFERENCE:
2074 case EXPR_UNARY_DELETE:
2075 case EXPR_UNARY_DELETE_ARRAY:
2076 if (lhs_var == VAR_ANY)
2080 case EXPR_UNARY_NEGATE:
2081 case EXPR_UNARY_PLUS:
2082 case EXPR_UNARY_BITWISE_NEGATE:
2083 case EXPR_UNARY_NOT:
2084 case EXPR_UNARY_TAKE_ADDRESS:
2085 case EXPR_UNARY_POSTFIX_INCREMENT:
2086 case EXPR_UNARY_POSTFIX_DECREMENT:
2087 case EXPR_UNARY_PREFIX_INCREMENT:
2088 case EXPR_UNARY_PREFIX_DECREMENT:
2089 case EXPR_UNARY_CAST_IMPLICIT:
2090 case EXPR_UNARY_ASSUME:
2092 mark_vars_read(expr->unary.value, lhs_var);
2095 case EXPR_BINARY_ADD:
2096 case EXPR_BINARY_SUB:
2097 case EXPR_BINARY_MUL:
2098 case EXPR_BINARY_DIV:
2099 case EXPR_BINARY_MOD:
2100 case EXPR_BINARY_EQUAL:
2101 case EXPR_BINARY_NOTEQUAL:
2102 case EXPR_BINARY_LESS:
2103 case EXPR_BINARY_LESSEQUAL:
2104 case EXPR_BINARY_GREATER:
2105 case EXPR_BINARY_GREATEREQUAL:
2106 case EXPR_BINARY_BITWISE_AND:
2107 case EXPR_BINARY_BITWISE_OR:
2108 case EXPR_BINARY_BITWISE_XOR:
2109 case EXPR_BINARY_LOGICAL_AND:
2110 case EXPR_BINARY_LOGICAL_OR:
2111 case EXPR_BINARY_SHIFTLEFT:
2112 case EXPR_BINARY_SHIFTRIGHT:
2113 case EXPR_BINARY_COMMA:
2114 case EXPR_BINARY_ISGREATER:
2115 case EXPR_BINARY_ISGREATEREQUAL:
2116 case EXPR_BINARY_ISLESS:
2117 case EXPR_BINARY_ISLESSEQUAL:
2118 case EXPR_BINARY_ISLESSGREATER:
2119 case EXPR_BINARY_ISUNORDERED:
2120 mark_vars_read(expr->binary.left, lhs_var);
2121 mark_vars_read(expr->binary.right, lhs_var);
2124 case EXPR_BINARY_ASSIGN:
2125 case EXPR_BINARY_MUL_ASSIGN:
2126 case EXPR_BINARY_DIV_ASSIGN:
2127 case EXPR_BINARY_MOD_ASSIGN:
2128 case EXPR_BINARY_ADD_ASSIGN:
2129 case EXPR_BINARY_SUB_ASSIGN:
2130 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2131 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2132 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2133 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2134 case EXPR_BINARY_BITWISE_OR_ASSIGN: {
2135 if (lhs_var == VAR_ANY)
2137 lhs_var = determine_lhs_var(expr->binary.left, lhs_var);
2138 mark_vars_read(expr->binary.right, lhs_var);
2143 determine_lhs_var(expr->va_starte.ap, lhs_var);
2149 case EXPR_CHARACTER_CONSTANT:
2150 case EXPR_WIDE_CHARACTER_CONSTANT:
2151 case EXPR_STRING_LITERAL:
2152 case EXPR_WIDE_STRING_LITERAL:
2153 case EXPR_COMPOUND_LITERAL: // TODO init?
2155 case EXPR_CLASSIFY_TYPE:
2158 case EXPR_BUILTIN_SYMBOL:
2159 case EXPR_BUILTIN_CONSTANT_P:
2160 case EXPR_BUILTIN_PREFETCH:
2162 case EXPR_STATEMENT: // TODO
2163 case EXPR_LABEL_ADDRESS:
2164 case EXPR_BINARY_BUILTIN_EXPECT:
2165 case EXPR_REFERENCE_ENUM_VALUE:
2169 panic("unhandled expression");
2172 static designator_t *parse_designation(void)
2174 designator_t *result = NULL;
2175 designator_t *last = NULL;
2178 designator_t *designator;
2179 switch (token.type) {
2181 designator = allocate_ast_zero(sizeof(designator[0]));
2182 designator->source_position = token.source_position;
2184 add_anchor_token(']');
2185 designator->array_index = parse_constant_expression();
2186 rem_anchor_token(']');
2190 designator = allocate_ast_zero(sizeof(designator[0]));
2191 designator->source_position = token.source_position;
2193 if (token.type != T_IDENTIFIER) {
2194 parse_error_expected("while parsing designator",
2195 T_IDENTIFIER, NULL);
2198 designator->symbol = token.v.symbol;
2206 assert(designator != NULL);
2208 last->next = designator;
2210 result = designator;
2218 static initializer_t *initializer_from_string(array_type_t *type,
2219 const string_t *const string)
2221 /* TODO: check len vs. size of array type */
2224 initializer_t *initializer = allocate_initializer_zero(INITIALIZER_STRING);
2225 initializer->string.string = *string;
2230 static initializer_t *initializer_from_wide_string(array_type_t *const type,
2231 wide_string_t *const string)
2233 /* TODO: check len vs. size of array type */
2236 initializer_t *const initializer =
2237 allocate_initializer_zero(INITIALIZER_WIDE_STRING);
2238 initializer->wide_string.string = *string;
2244 * Build an initializer from a given expression.
2246 static initializer_t *initializer_from_expression(type_t *orig_type,
2247 expression_t *expression)
2249 /* TODO check that expression is a constant expression */
2251 /* § 6.7.8.14/15 char array may be initialized by string literals */
2252 type_t *type = skip_typeref(orig_type);
2253 type_t *expr_type_orig = expression->base.type;
2254 type_t *expr_type = skip_typeref(expr_type_orig);
2255 if (is_type_array(type) && expr_type->kind == TYPE_POINTER) {
2256 array_type_t *const array_type = &type->array;
2257 type_t *const element_type = skip_typeref(array_type->element_type);
2259 if (element_type->kind == TYPE_ATOMIC) {
2260 atomic_type_kind_t akind = element_type->atomic.akind;
2261 switch (expression->kind) {
2262 case EXPR_STRING_LITERAL:
2263 if (akind == ATOMIC_TYPE_CHAR
2264 || akind == ATOMIC_TYPE_SCHAR
2265 || akind == ATOMIC_TYPE_UCHAR) {
2266 return initializer_from_string(array_type,
2267 &expression->string.value);
2270 case EXPR_WIDE_STRING_LITERAL: {
2271 type_t *bare_wchar_type = skip_typeref(type_wchar_t);
2272 if (get_unqualified_type(element_type) == bare_wchar_type) {
2273 return initializer_from_wide_string(array_type,
2274 &expression->wide_string.value);
2284 assign_error_t error = semantic_assign(type, expression);
2285 if (error == ASSIGN_ERROR_INCOMPATIBLE)
2287 report_assign_error(error, type, expression, "initializer",
2288 &expression->base.source_position);
2290 initializer_t *const result = allocate_initializer_zero(INITIALIZER_VALUE);
2292 if (type->kind == TYPE_BITFIELD) {
2293 type = type->bitfield.base_type;
2296 result->value.value = create_implicit_cast(expression, type);
2302 * Checks if a given expression can be used as an constant initializer.
2304 static bool is_initializer_constant(const expression_t *expression)
2306 return is_constant_expression(expression)
2307 || is_address_constant(expression);
2311 * Parses an scalar initializer.
2313 * § 6.7.8.11; eat {} without warning
2315 static initializer_t *parse_scalar_initializer(type_t *type,
2316 bool must_be_constant)
2318 /* there might be extra {} hierarchies */
2320 if (token.type == '{') {
2322 warningf(HERE, "extra curly braces around scalar initializer");
2326 } while (token.type == '{');
2329 expression_t *expression = parse_assignment_expression();
2330 mark_vars_read(expression, NULL);
2331 if (must_be_constant && !is_initializer_constant(expression)) {
2332 errorf(&expression->base.source_position,
2333 "Initialisation expression '%E' is not constant\n",
2337 initializer_t *initializer = initializer_from_expression(type, expression);
2339 if (initializer == NULL) {
2340 errorf(&expression->base.source_position,
2341 "expression '%E' (type '%T') doesn't match expected type '%T'",
2342 expression, expression->base.type, type);
2347 bool additional_warning_displayed = false;
2348 while (braces > 0) {
2349 if (token.type == ',') {
2352 if (token.type != '}') {
2353 if (!additional_warning_displayed && warning.other) {
2354 warningf(HERE, "additional elements in scalar initializer");
2355 additional_warning_displayed = true;
2366 * An entry in the type path.
2368 typedef struct type_path_entry_t type_path_entry_t;
2369 struct type_path_entry_t {
2370 type_t *type; /**< the upper top type. restored to path->top_tye if this entry is popped. */
2372 size_t index; /**< For array types: the current index. */
2373 declaration_t *compound_entry; /**< For compound types: the current declaration. */
2378 * A type path expression a position inside compound or array types.
2380 typedef struct type_path_t type_path_t;
2381 struct type_path_t {
2382 type_path_entry_t *path; /**< An flexible array containing the current path. */
2383 type_t *top_type; /**< type of the element the path points */
2384 size_t max_index; /**< largest index in outermost array */
2388 * Prints a type path for debugging.
2390 static __attribute__((unused)) void debug_print_type_path(
2391 const type_path_t *path)
2393 size_t len = ARR_LEN(path->path);
2395 for(size_t i = 0; i < len; ++i) {
2396 const type_path_entry_t *entry = & path->path[i];
2398 type_t *type = skip_typeref(entry->type);
2399 if (is_type_compound(type)) {
2400 /* in gcc mode structs can have no members */
2401 if (entry->v.compound_entry == NULL) {
2405 fprintf(stderr, ".%s",
2406 entry->v.compound_entry->base.symbol->string);
2407 } else if (is_type_array(type)) {
2408 fprintf(stderr, "[%zu]", entry->v.index);
2410 fprintf(stderr, "-INVALID-");
2413 if (path->top_type != NULL) {
2414 fprintf(stderr, " (");
2415 print_type(path->top_type);
2416 fprintf(stderr, ")");
2421 * Return the top type path entry, ie. in a path
2422 * (type).a.b returns the b.
2424 static type_path_entry_t *get_type_path_top(const type_path_t *path)
2426 size_t len = ARR_LEN(path->path);
2428 return &path->path[len-1];
2432 * Enlarge the type path by an (empty) element.
2434 static type_path_entry_t *append_to_type_path(type_path_t *path)
2436 size_t len = ARR_LEN(path->path);
2437 ARR_RESIZE(type_path_entry_t, path->path, len+1);
2439 type_path_entry_t *result = & path->path[len];
2440 memset(result, 0, sizeof(result[0]));
2445 * Descending into a sub-type. Enter the scope of the current top_type.
2447 static void descend_into_subtype(type_path_t *path)
2449 type_t *orig_top_type = path->top_type;
2450 type_t *top_type = skip_typeref(orig_top_type);
2452 type_path_entry_t *top = append_to_type_path(path);
2453 top->type = top_type;
2455 if (is_type_compound(top_type)) {
2456 compound_t *compound = top_type->compound.compound;
2457 entity_t *entry = compound->members.entities;
2459 if (entry != NULL) {
2460 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
2461 top->v.compound_entry = &entry->declaration;
2462 path->top_type = entry->declaration.type;
2464 path->top_type = NULL;
2466 } else if (is_type_array(top_type)) {
2468 path->top_type = top_type->array.element_type;
2470 assert(!is_type_valid(top_type));
2475 * Pop an entry from the given type path, ie. returning from
2476 * (type).a.b to (type).a
2478 static void ascend_from_subtype(type_path_t *path)
2480 type_path_entry_t *top = get_type_path_top(path);
2482 path->top_type = top->type;
2484 size_t len = ARR_LEN(path->path);
2485 ARR_RESIZE(type_path_entry_t, path->path, len-1);
2489 * Pop entries from the given type path until the given
2490 * path level is reached.
2492 static void ascend_to(type_path_t *path, size_t top_path_level)
2494 size_t len = ARR_LEN(path->path);
2496 while (len > top_path_level) {
2497 ascend_from_subtype(path);
2498 len = ARR_LEN(path->path);
2502 static bool walk_designator(type_path_t *path, const designator_t *designator,
2503 bool used_in_offsetof)
2505 for( ; designator != NULL; designator = designator->next) {
2506 type_path_entry_t *top = get_type_path_top(path);
2507 type_t *orig_type = top->type;
2509 type_t *type = skip_typeref(orig_type);
2511 if (designator->symbol != NULL) {
2512 symbol_t *symbol = designator->symbol;
2513 if (!is_type_compound(type)) {
2514 if (is_type_valid(type)) {
2515 errorf(&designator->source_position,
2516 "'.%Y' designator used for non-compound type '%T'",
2520 top->type = type_error_type;
2521 top->v.compound_entry = NULL;
2522 orig_type = type_error_type;
2524 compound_t *compound = type->compound.compound;
2525 entity_t *iter = compound->members.entities;
2526 for( ; iter != NULL; iter = iter->base.next) {
2527 if (iter->base.symbol == symbol) {
2532 errorf(&designator->source_position,
2533 "'%T' has no member named '%Y'", orig_type, symbol);
2536 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
2537 if (used_in_offsetof) {
2538 type_t *real_type = skip_typeref(iter->declaration.type);
2539 if (real_type->kind == TYPE_BITFIELD) {
2540 errorf(&designator->source_position,
2541 "offsetof designator '%Y' may not specify bitfield",
2547 top->type = orig_type;
2548 top->v.compound_entry = &iter->declaration;
2549 orig_type = iter->declaration.type;
2552 expression_t *array_index = designator->array_index;
2553 assert(designator->array_index != NULL);
2555 if (!is_type_array(type)) {
2556 if (is_type_valid(type)) {
2557 errorf(&designator->source_position,
2558 "[%E] designator used for non-array type '%T'",
2559 array_index, orig_type);
2564 long index = fold_constant(array_index);
2565 if (!used_in_offsetof) {
2567 errorf(&designator->source_position,
2568 "array index [%E] must be positive", array_index);
2569 } else if (type->array.size_constant) {
2570 long array_size = type->array.size;
2571 if (index >= array_size) {
2572 errorf(&designator->source_position,
2573 "designator [%E] (%d) exceeds array size %d",
2574 array_index, index, array_size);
2579 top->type = orig_type;
2580 top->v.index = (size_t) index;
2581 orig_type = type->array.element_type;
2583 path->top_type = orig_type;
2585 if (designator->next != NULL) {
2586 descend_into_subtype(path);
2595 static void advance_current_object(type_path_t *path, size_t top_path_level)
2597 type_path_entry_t *top = get_type_path_top(path);
2599 type_t *type = skip_typeref(top->type);
2600 if (is_type_union(type)) {
2601 /* in unions only the first element is initialized */
2602 top->v.compound_entry = NULL;
2603 } else if (is_type_struct(type)) {
2604 declaration_t *entry = top->v.compound_entry;
2606 entity_t *next_entity = entry->base.next;
2607 if (next_entity != NULL) {
2608 assert(is_declaration(next_entity));
2609 entry = &next_entity->declaration;
2614 top->v.compound_entry = entry;
2615 if (entry != NULL) {
2616 path->top_type = entry->type;
2619 } else if (is_type_array(type)) {
2620 assert(is_type_array(type));
2624 if (!type->array.size_constant || top->v.index < type->array.size) {
2628 assert(!is_type_valid(type));
2632 /* we're past the last member of the current sub-aggregate, try if we
2633 * can ascend in the type hierarchy and continue with another subobject */
2634 size_t len = ARR_LEN(path->path);
2636 if (len > top_path_level) {
2637 ascend_from_subtype(path);
2638 advance_current_object(path, top_path_level);
2640 path->top_type = NULL;
2645 * skip until token is found.
2647 static void skip_until(int type)
2649 while (token.type != type) {
2650 if (token.type == T_EOF)
2657 * skip any {...} blocks until a closing bracket is reached.
2659 static void skip_initializers(void)
2661 if (token.type == '{')
2664 while (token.type != '}') {
2665 if (token.type == T_EOF)
2667 if (token.type == '{') {
2675 static initializer_t *create_empty_initializer(void)
2677 static initializer_t empty_initializer
2678 = { .list = { { INITIALIZER_LIST }, 0 } };
2679 return &empty_initializer;
2683 * Parse a part of an initialiser for a struct or union,
2685 static initializer_t *parse_sub_initializer(type_path_t *path,
2686 type_t *outer_type, size_t top_path_level,
2687 parse_initializer_env_t *env)
2689 if (token.type == '}') {
2690 /* empty initializer */
2691 return create_empty_initializer();
2694 type_t *orig_type = path->top_type;
2695 type_t *type = NULL;
2697 if (orig_type == NULL) {
2698 /* We are initializing an empty compound. */
2700 type = skip_typeref(orig_type);
2703 initializer_t **initializers = NEW_ARR_F(initializer_t*, 0);
2706 designator_t *designator = NULL;
2707 if (token.type == '.' || token.type == '[') {
2708 designator = parse_designation();
2709 goto finish_designator;
2710 } else if (token.type == T_IDENTIFIER && look_ahead(1)->type == ':') {
2711 /* GNU-style designator ("identifier: value") */
2712 designator = allocate_ast_zero(sizeof(designator[0]));
2713 designator->source_position = token.source_position;
2714 designator->symbol = token.v.symbol;
2719 /* reset path to toplevel, evaluate designator from there */
2720 ascend_to(path, top_path_level);
2721 if (!walk_designator(path, designator, false)) {
2722 /* can't continue after designation error */
2726 initializer_t *designator_initializer
2727 = allocate_initializer_zero(INITIALIZER_DESIGNATOR);
2728 designator_initializer->designator.designator = designator;
2729 ARR_APP1(initializer_t*, initializers, designator_initializer);
2731 orig_type = path->top_type;
2732 type = orig_type != NULL ? skip_typeref(orig_type) : NULL;
2737 if (token.type == '{') {
2738 if (type != NULL && is_type_scalar(type)) {
2739 sub = parse_scalar_initializer(type, env->must_be_constant);
2743 if (env->entity != NULL) {
2745 "extra brace group at end of initializer for '%Y'",
2746 env->entity->base.symbol);
2748 errorf(HERE, "extra brace group at end of initializer");
2751 descend_into_subtype(path);
2753 add_anchor_token('}');
2754 sub = parse_sub_initializer(path, orig_type, top_path_level+1,
2756 rem_anchor_token('}');
2759 ascend_from_subtype(path);
2763 goto error_parse_next;
2767 /* must be an expression */
2768 expression_t *expression = parse_assignment_expression();
2770 if (env->must_be_constant && !is_initializer_constant(expression)) {
2771 errorf(&expression->base.source_position,
2772 "Initialisation expression '%E' is not constant\n",
2777 /* we are already outside, ... */
2778 type_t *const outer_type_skip = skip_typeref(outer_type);
2779 if (is_type_compound(outer_type_skip) &&
2780 !outer_type_skip->compound.compound->complete) {
2781 goto error_parse_next;
2786 /* handle { "string" } special case */
2787 if ((expression->kind == EXPR_STRING_LITERAL
2788 || expression->kind == EXPR_WIDE_STRING_LITERAL)
2789 && outer_type != NULL) {
2790 sub = initializer_from_expression(outer_type, expression);
2792 if (token.type == ',') {
2795 if (token.type != '}' && warning.other) {
2796 warningf(HERE, "excessive elements in initializer for type '%T'",
2799 /* TODO: eat , ... */
2804 /* descend into subtypes until expression matches type */
2806 orig_type = path->top_type;
2807 type = skip_typeref(orig_type);
2809 sub = initializer_from_expression(orig_type, expression);
2813 if (!is_type_valid(type)) {
2816 if (is_type_scalar(type)) {
2817 errorf(&expression->base.source_position,
2818 "expression '%E' doesn't match expected type '%T'",
2819 expression, orig_type);
2823 descend_into_subtype(path);
2827 /* update largest index of top array */
2828 const type_path_entry_t *first = &path->path[0];
2829 type_t *first_type = first->type;
2830 first_type = skip_typeref(first_type);
2831 if (is_type_array(first_type)) {
2832 size_t index = first->v.index;
2833 if (index > path->max_index)
2834 path->max_index = index;
2838 /* append to initializers list */
2839 ARR_APP1(initializer_t*, initializers, sub);
2842 if (warning.other) {
2843 if (env->entity != NULL) {
2844 warningf(HERE, "excess elements in struct initializer for '%Y'",
2845 env->entity->base.symbol);
2847 warningf(HERE, "excess elements in struct initializer");
2853 if (token.type == '}') {
2857 if (token.type == '}') {
2862 /* advance to the next declaration if we are not at the end */
2863 advance_current_object(path, top_path_level);
2864 orig_type = path->top_type;
2865 if (orig_type != NULL)
2866 type = skip_typeref(orig_type);
2872 size_t len = ARR_LEN(initializers);
2873 size_t size = sizeof(initializer_list_t) + len * sizeof(initializers[0]);
2874 initializer_t *result = allocate_ast_zero(size);
2875 result->kind = INITIALIZER_LIST;
2876 result->list.len = len;
2877 memcpy(&result->list.initializers, initializers,
2878 len * sizeof(initializers[0]));
2880 DEL_ARR_F(initializers);
2881 ascend_to(path, top_path_level+1);
2886 skip_initializers();
2887 DEL_ARR_F(initializers);
2888 ascend_to(path, top_path_level+1);
2893 * Parses an initializer. Parsers either a compound literal
2894 * (env->declaration == NULL) or an initializer of a declaration.
2896 static initializer_t *parse_initializer(parse_initializer_env_t *env)
2898 type_t *type = skip_typeref(env->type);
2899 initializer_t *result = NULL;
2902 if (is_type_scalar(type)) {
2903 result = parse_scalar_initializer(type, env->must_be_constant);
2904 } else if (token.type == '{') {
2908 memset(&path, 0, sizeof(path));
2909 path.top_type = env->type;
2910 path.path = NEW_ARR_F(type_path_entry_t, 0);
2912 descend_into_subtype(&path);
2914 add_anchor_token('}');
2915 result = parse_sub_initializer(&path, env->type, 1, env);
2916 rem_anchor_token('}');
2918 max_index = path.max_index;
2919 DEL_ARR_F(path.path);
2923 /* parse_scalar_initializer() also works in this case: we simply
2924 * have an expression without {} around it */
2925 result = parse_scalar_initializer(type, env->must_be_constant);
2928 /* § 6.7.8 (22) array initializers for arrays with unknown size determine
2929 * the array type size */
2930 if (is_type_array(type) && type->array.size_expression == NULL
2931 && result != NULL) {
2933 switch (result->kind) {
2934 case INITIALIZER_LIST:
2935 size = max_index + 1;
2938 case INITIALIZER_STRING:
2939 size = result->string.string.size;
2942 case INITIALIZER_WIDE_STRING:
2943 size = result->wide_string.string.size;
2946 case INITIALIZER_DESIGNATOR:
2947 case INITIALIZER_VALUE:
2948 /* can happen for parse errors */
2953 internal_errorf(HERE, "invalid initializer type");
2956 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
2957 cnst->base.type = type_size_t;
2958 cnst->conste.v.int_value = size;
2960 type_t *new_type = duplicate_type(type);
2962 new_type->array.size_expression = cnst;
2963 new_type->array.size_constant = true;
2964 new_type->array.has_implicit_size = true;
2965 new_type->array.size = size;
2966 env->type = new_type;
2974 static void append_entity(scope_t *scope, entity_t *entity)
2976 if (scope->last_entity != NULL) {
2977 scope->last_entity->base.next = entity;
2979 scope->entities = entity;
2981 scope->last_entity = entity;
2985 static compound_t *parse_compound_type_specifier(bool is_struct)
2987 gnu_attribute_t *attributes = NULL;
2988 decl_modifiers_t modifiers = 0;
2995 symbol_t *symbol = NULL;
2996 compound_t *compound = NULL;
2998 if (token.type == T___attribute__) {
2999 modifiers |= parse_attributes(&attributes);
3002 if (token.type == T_IDENTIFIER) {
3003 symbol = token.v.symbol;
3006 namespace_t const namespc =
3007 is_struct ? NAMESPACE_STRUCT : NAMESPACE_UNION;
3008 entity_t *entity = get_entity(symbol, namespc);
3009 if (entity != NULL) {
3010 assert(entity->kind == (is_struct ? ENTITY_STRUCT : ENTITY_UNION));
3011 compound = &entity->compound;
3012 if (compound->base.parent_scope != scope &&
3013 (token.type == '{' || token.type == ';')) {
3014 /* we're in an inner scope and have a definition. Override
3015 existing definition in outer scope */
3017 } else if (compound->complete && token.type == '{') {
3018 assert(symbol != NULL);
3019 errorf(HERE, "multiple definitions of '%s %Y' (previous definition %P)",
3020 is_struct ? "struct" : "union", symbol,
3021 &compound->base.source_position);
3022 /* clear members in the hope to avoid further errors */
3023 compound->members.entities = NULL;
3026 } else if (token.type != '{') {
3028 parse_error_expected("while parsing struct type specifier",
3029 T_IDENTIFIER, '{', NULL);
3031 parse_error_expected("while parsing union type specifier",
3032 T_IDENTIFIER, '{', NULL);
3038 if (compound == NULL) {
3039 entity_kind_t kind = is_struct ? ENTITY_STRUCT : ENTITY_UNION;
3040 entity_t *entity = allocate_entity_zero(kind);
3041 compound = &entity->compound;
3043 compound->base.namespc =
3044 (is_struct ? NAMESPACE_STRUCT : NAMESPACE_UNION);
3045 compound->base.source_position = token.source_position;
3046 compound->base.symbol = symbol;
3047 compound->base.parent_scope = scope;
3048 if (symbol != NULL) {
3049 environment_push(entity);
3051 append_entity(scope, entity);
3054 if (token.type == '{') {
3055 compound->complete = true;
3057 parse_compound_type_entries(compound);
3058 modifiers |= parse_attributes(&attributes);
3061 compound->modifiers |= modifiers;
3065 static void parse_enum_entries(type_t *const enum_type)
3069 if (token.type == '}') {
3071 errorf(HERE, "empty enum not allowed");
3075 add_anchor_token('}');
3077 if (token.type != T_IDENTIFIER) {
3078 parse_error_expected("while parsing enum entry", T_IDENTIFIER, NULL);
3080 rem_anchor_token('}');
3084 entity_t *entity = allocate_entity_zero(ENTITY_ENUM_VALUE);
3085 entity->enum_value.enum_type = enum_type;
3086 entity->base.symbol = token.v.symbol;
3087 entity->base.source_position = token.source_position;
3090 if (token.type == '=') {
3092 expression_t *value = parse_constant_expression();
3094 value = create_implicit_cast(value, enum_type);
3095 entity->enum_value.value = value;
3100 record_entity(entity, false);
3102 if (token.type != ',')
3105 } while (token.type != '}');
3106 rem_anchor_token('}');
3114 static type_t *parse_enum_specifier(void)
3116 gnu_attribute_t *attributes = NULL;
3121 if (token.type == T_IDENTIFIER) {
3122 symbol = token.v.symbol;
3125 entity = get_entity(symbol, NAMESPACE_ENUM);
3126 assert(entity == NULL || entity->kind == ENTITY_ENUM);
3127 } else if (token.type != '{') {
3128 parse_error_expected("while parsing enum type specifier",
3129 T_IDENTIFIER, '{', NULL);
3136 if (entity == NULL) {
3137 entity = allocate_entity_zero(ENTITY_ENUM);
3138 entity->base.namespc = NAMESPACE_ENUM;
3139 entity->base.source_position = token.source_position;
3140 entity->base.symbol = symbol;
3141 entity->base.parent_scope = scope;
3144 type_t *const type = allocate_type_zero(TYPE_ENUM);
3145 type->enumt.enume = &entity->enume;
3147 if (token.type == '{') {
3148 if (entity->enume.complete) {
3149 errorf(HERE, "multiple definitions of enum %Y (previous definition %P)",
3150 symbol, &entity->base.source_position);
3152 if (symbol != NULL) {
3153 environment_push(entity);
3155 append_entity(scope, entity);
3156 entity->enume.complete = true;
3158 parse_enum_entries(type);
3159 parse_attributes(&attributes);
3160 } else if(!entity->enume.complete && !(c_mode & _GNUC)) {
3161 errorf(HERE, "enum %Y used before definition (incomplete enumes are a GNU extension)",
3169 * if a symbol is a typedef to another type, return true
3171 static bool is_typedef_symbol(symbol_t *symbol)
3173 const entity_t *const entity = get_entity(symbol, NAMESPACE_NORMAL);
3174 return entity != NULL && entity->kind == ENTITY_TYPEDEF;
3177 static type_t *parse_typeof(void)
3184 add_anchor_token(')');
3186 expression_t *expression = NULL;
3188 bool old_type_prop = in_type_prop;
3189 bool old_gcc_extension = in_gcc_extension;
3190 in_type_prop = true;
3192 while (token.type == T___extension__) {
3193 /* This can be a prefix to a typename or an expression. */
3195 in_gcc_extension = true;
3197 switch (token.type) {
3199 if (is_typedef_symbol(token.v.symbol)) {
3200 type = parse_typename();
3202 expression = parse_expression();
3203 type = expression->base.type;
3208 type = parse_typename();
3212 expression = parse_expression();
3213 type = expression->base.type;
3216 in_type_prop = old_type_prop;
3217 in_gcc_extension = old_gcc_extension;
3219 rem_anchor_token(')');
3222 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF);
3223 typeof_type->typeoft.expression = expression;
3224 typeof_type->typeoft.typeof_type = type;
3231 typedef enum specifiers_t {
3232 SPECIFIER_SIGNED = 1 << 0,
3233 SPECIFIER_UNSIGNED = 1 << 1,
3234 SPECIFIER_LONG = 1 << 2,
3235 SPECIFIER_INT = 1 << 3,
3236 SPECIFIER_DOUBLE = 1 << 4,
3237 SPECIFIER_CHAR = 1 << 5,
3238 SPECIFIER_SHORT = 1 << 6,
3239 SPECIFIER_LONG_LONG = 1 << 7,
3240 SPECIFIER_FLOAT = 1 << 8,
3241 SPECIFIER_BOOL = 1 << 9,
3242 SPECIFIER_VOID = 1 << 10,
3243 SPECIFIER_INT8 = 1 << 11,
3244 SPECIFIER_INT16 = 1 << 12,
3245 SPECIFIER_INT32 = 1 << 13,
3246 SPECIFIER_INT64 = 1 << 14,
3247 SPECIFIER_INT128 = 1 << 15,
3248 SPECIFIER_COMPLEX = 1 << 16,
3249 SPECIFIER_IMAGINARY = 1 << 17,
3252 static type_t *create_builtin_type(symbol_t *const symbol,
3253 type_t *const real_type)
3255 type_t *type = allocate_type_zero(TYPE_BUILTIN);
3256 type->builtin.symbol = symbol;
3257 type->builtin.real_type = real_type;
3259 type_t *result = typehash_insert(type);
3260 if (type != result) {
3267 static type_t *get_typedef_type(symbol_t *symbol)
3269 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
3270 if (entity == NULL || entity->kind != ENTITY_TYPEDEF)
3273 type_t *type = allocate_type_zero(TYPE_TYPEDEF);
3274 type->typedeft.typedefe = &entity->typedefe;
3280 * check for the allowed MS alignment values.
3282 static bool check_alignment_value(long long intvalue)
3284 if (intvalue < 1 || intvalue > 8192) {
3285 errorf(HERE, "illegal alignment value");
3288 unsigned v = (unsigned)intvalue;
3289 for (unsigned i = 1; i <= 8192; i += i) {
3293 errorf(HERE, "alignment must be power of two");
3297 #define DET_MOD(name, tag) do { \
3298 if (*modifiers & tag && warning.other) warningf(HERE, #name " used more than once"); \
3299 *modifiers |= tag; \
3302 static void parse_microsoft_extended_decl_modifier(declaration_specifiers_t *specifiers)
3304 decl_modifiers_t *modifiers = &specifiers->modifiers;
3307 if (token.type == T_restrict) {
3309 DET_MOD(restrict, DM_RESTRICT);
3311 } else if (token.type != T_IDENTIFIER)
3313 symbol_t *symbol = token.v.symbol;
3314 if (symbol == sym_align) {
3317 if (token.type != T_INTEGER)
3319 if (check_alignment_value(token.v.intvalue)) {
3320 if (specifiers->alignment != 0 && warning.other)
3321 warningf(HERE, "align used more than once");
3322 specifiers->alignment = (unsigned char)token.v.intvalue;
3326 } else if (symbol == sym_allocate) {
3329 if (token.type != T_IDENTIFIER)
3331 (void)token.v.symbol;
3333 } else if (symbol == sym_dllimport) {
3335 DET_MOD(dllimport, DM_DLLIMPORT);
3336 } else if (symbol == sym_dllexport) {
3338 DET_MOD(dllexport, DM_DLLEXPORT);
3339 } else if (symbol == sym_thread) {
3341 DET_MOD(thread, DM_THREAD);
3342 } else if (symbol == sym_naked) {
3344 DET_MOD(naked, DM_NAKED);
3345 } else if (symbol == sym_noinline) {
3347 DET_MOD(noinline, DM_NOINLINE);
3348 } else if (symbol == sym_noreturn) {
3350 DET_MOD(noreturn, DM_NORETURN);
3351 } else if (symbol == sym_nothrow) {
3353 DET_MOD(nothrow, DM_NOTHROW);
3354 } else if (symbol == sym_novtable) {
3356 DET_MOD(novtable, DM_NOVTABLE);
3357 } else if (symbol == sym_property) {
3361 bool is_get = false;
3362 if (token.type != T_IDENTIFIER)
3364 if (token.v.symbol == sym_get) {
3366 } else if (token.v.symbol == sym_put) {
3368 errorf(HERE, "Bad property name '%Y'", token.v.symbol);
3373 if (token.type != T_IDENTIFIER)
3376 if (specifiers->get_property_sym != NULL) {
3377 errorf(HERE, "get property name already specified");
3379 specifiers->get_property_sym = token.v.symbol;
3382 if (specifiers->put_property_sym != NULL) {
3383 errorf(HERE, "put property name already specified");
3385 specifiers->put_property_sym = token.v.symbol;
3389 if (token.type == ',') {
3396 } else if (symbol == sym_selectany) {
3398 DET_MOD(selectany, DM_SELECTANY);
3399 } else if (symbol == sym_uuid) {
3402 if (token.type != T_STRING_LITERAL)
3406 } else if (symbol == sym_deprecated) {
3408 if (specifiers->deprecated != 0 && warning.other)
3409 warningf(HERE, "deprecated used more than once");
3410 specifiers->deprecated = true;
3411 if (token.type == '(') {
3413 if (token.type == T_STRING_LITERAL) {
3414 specifiers->deprecated_string = token.v.string.begin;
3417 errorf(HERE, "string literal expected");
3421 } else if (symbol == sym_noalias) {
3423 DET_MOD(noalias, DM_NOALIAS);
3426 warningf(HERE, "Unknown modifier %Y ignored", token.v.symbol);
3428 if (token.type == '(')
3432 if (token.type == ',')
3439 static entity_t *create_error_entity(symbol_t *symbol, entity_kind_tag_t kind)
3441 entity_t *entity = allocate_entity_zero(kind);
3442 entity->base.source_position = *HERE;
3443 entity->base.symbol = symbol;
3444 if (is_declaration(entity)) {
3445 entity->declaration.type = type_error_type;
3446 entity->declaration.implicit = true;
3448 record_entity(entity, false);
3453 * Finish the construction of a struct type by calculating
3454 * its size, offsets, alignment.
3456 static void finish_struct_type(compound_type_t *type)
3458 assert(type->compound != NULL);
3460 compound_t *compound = type->compound;
3461 if (!compound->complete)
3466 il_alignment_t alignment = 1;
3467 bool need_pad = false;
3469 entity_t *entry = compound->members.entities;
3470 for (; entry != NULL; entry = entry->base.next) {
3471 if (entry->kind != ENTITY_COMPOUND_MEMBER)
3474 type_t *m_type = skip_typeref(entry->declaration.type);
3475 if (! is_type_valid(m_type)) {
3476 /* simply ignore errors here */
3479 il_alignment_t m_alignment = m_type->base.alignment;
3480 if (m_alignment > alignment)
3481 alignment = m_alignment;
3483 offset = (size + m_alignment - 1) & -m_alignment;
3487 entry->compound_member.offset = offset;
3488 size = offset + m_type->base.size;
3490 if (type->base.alignment != 0) {
3491 alignment = type->base.alignment;
3494 offset = (size + alignment - 1) & -alignment;
3498 if (warning.padded && need_pad) {
3499 warningf(&compound->base.source_position,
3500 "'%#T' needs padding", type, compound->base.symbol);
3502 if (warning.packed && !need_pad) {
3503 warningf(&compound->base.source_position,
3504 "superfluous packed attribute on '%#T'",
3505 type, compound->base.symbol);
3508 type->base.size = offset;
3509 type->base.alignment = alignment;
3513 * Finish the construction of an union type by calculating
3514 * its size and alignment.
3516 static void finish_union_type(compound_type_t *type)
3518 assert(type->compound != NULL);
3520 compound_t *compound = type->compound;
3521 if (! compound->complete)
3525 il_alignment_t alignment = 1;
3527 entity_t *entry = compound->members.entities;
3528 for (; entry != NULL; entry = entry->base.next) {
3529 if (entry->kind != ENTITY_COMPOUND_MEMBER)
3532 type_t *m_type = skip_typeref(entry->declaration.type);
3533 if (! is_type_valid(m_type))
3536 entry->compound_member.offset = 0;
3537 if (m_type->base.size > size)
3538 size = m_type->base.size;
3539 if (m_type->base.alignment > alignment)
3540 alignment = m_type->base.alignment;
3542 if (type->base.alignment != 0) {
3543 alignment = type->base.alignment;
3545 size = (size + alignment - 1) & -alignment;
3546 type->base.size = size;
3547 type->base.alignment = alignment;
3550 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
3552 type_t *type = NULL;
3553 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3554 type_modifiers_t modifiers = TYPE_MODIFIER_NONE;
3555 unsigned type_specifiers = 0;
3556 bool newtype = false;
3557 bool saw_error = false;
3558 bool old_gcc_extension = in_gcc_extension;
3560 specifiers->source_position = token.source_position;
3563 specifiers->modifiers
3564 |= parse_attributes(&specifiers->gnu_attributes);
3565 if (specifiers->modifiers & DM_TRANSPARENT_UNION)
3566 modifiers |= TYPE_MODIFIER_TRANSPARENT_UNION;
3568 switch (token.type) {
3571 #define MATCH_STORAGE_CLASS(token, class) \
3573 if (specifiers->storage_class != STORAGE_CLASS_NONE) { \
3574 errorf(HERE, "multiple storage classes in declaration specifiers"); \
3576 specifiers->storage_class = class; \
3580 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
3581 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
3582 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
3583 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
3584 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
3589 add_anchor_token(')');
3590 parse_microsoft_extended_decl_modifier(specifiers);
3591 rem_anchor_token(')');
3596 switch (specifiers->storage_class) {
3597 case STORAGE_CLASS_NONE:
3598 specifiers->storage_class = STORAGE_CLASS_THREAD;
3601 case STORAGE_CLASS_EXTERN:
3602 specifiers->storage_class = STORAGE_CLASS_THREAD_EXTERN;
3605 case STORAGE_CLASS_STATIC:
3606 specifiers->storage_class = STORAGE_CLASS_THREAD_STATIC;
3610 errorf(HERE, "multiple storage classes in declaration specifiers");
3616 /* type qualifiers */
3617 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
3619 qualifiers |= qualifier; \
3623 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3624 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3625 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3626 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3627 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3628 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3629 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3630 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3632 case T___extension__:
3634 in_gcc_extension = true;
3637 /* type specifiers */
3638 #define MATCH_SPECIFIER(token, specifier, name) \
3641 if (type_specifiers & specifier) { \
3642 errorf(HERE, "multiple " name " type specifiers given"); \
3644 type_specifiers |= specifier; \
3648 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
3649 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
3650 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
3651 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
3652 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
3653 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
3654 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
3655 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
3656 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
3657 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
3658 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
3659 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
3660 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
3661 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
3662 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
3663 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
3665 case T__forceinline:
3666 /* only in microsoft mode */
3667 specifiers->modifiers |= DM_FORCEINLINE;
3672 specifiers->is_inline = true;
3677 if (type_specifiers & SPECIFIER_LONG_LONG) {
3678 errorf(HERE, "multiple type specifiers given");
3679 } else if (type_specifiers & SPECIFIER_LONG) {
3680 type_specifiers |= SPECIFIER_LONG_LONG;
3682 type_specifiers |= SPECIFIER_LONG;
3687 type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
3689 type->compound.compound = parse_compound_type_specifier(true);
3690 finish_struct_type(&type->compound);
3694 type = allocate_type_zero(TYPE_COMPOUND_UNION);
3695 type->compound.compound = parse_compound_type_specifier(false);
3696 if (type->compound.compound->modifiers & DM_TRANSPARENT_UNION)
3697 modifiers |= TYPE_MODIFIER_TRANSPARENT_UNION;
3698 finish_union_type(&type->compound);
3702 type = parse_enum_specifier();
3705 type = parse_typeof();
3707 case T___builtin_va_list:
3708 type = duplicate_type(type_valist);
3712 case T_IDENTIFIER: {
3713 /* only parse identifier if we haven't found a type yet */
3714 if (type != NULL || type_specifiers != 0) {
3715 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
3716 * declaration, so it doesn't generate errors about expecting '(' or
3718 switch (look_ahead(1)->type) {
3725 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
3728 errorf(HERE, "discarding stray %K in declaration specifier", &token);
3733 goto finish_specifiers;
3737 type_t *const typedef_type = get_typedef_type(token.v.symbol);
3738 if (typedef_type == NULL) {
3739 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
3740 * declaration, so it doesn't generate 'implicit int' followed by more
3741 * errors later on. */
3742 token_type_t const la1_type = (token_type_t)look_ahead(1)->type;
3747 errorf(HERE, "%K does not name a type", &token);
3750 create_error_entity(token.v.symbol, ENTITY_TYPEDEF);
3752 type = allocate_type_zero(TYPE_TYPEDEF);
3753 type->typedeft.typedefe = &entity->typedefe;
3757 if (la1_type == '*')
3758 goto finish_specifiers;
3763 goto finish_specifiers;
3768 type = typedef_type;
3772 /* function specifier */
3774 goto finish_specifiers;
3779 in_gcc_extension = old_gcc_extension;
3781 if (type == NULL || (saw_error && type_specifiers != 0)) {
3782 atomic_type_kind_t atomic_type;
3784 /* match valid basic types */
3785 switch (type_specifiers) {
3786 case SPECIFIER_VOID:
3787 atomic_type = ATOMIC_TYPE_VOID;
3789 case SPECIFIER_CHAR:
3790 atomic_type = ATOMIC_TYPE_CHAR;
3792 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
3793 atomic_type = ATOMIC_TYPE_SCHAR;
3795 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
3796 atomic_type = ATOMIC_TYPE_UCHAR;
3798 case SPECIFIER_SHORT:
3799 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
3800 case SPECIFIER_SHORT | SPECIFIER_INT:
3801 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3802 atomic_type = ATOMIC_TYPE_SHORT;
3804 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
3805 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3806 atomic_type = ATOMIC_TYPE_USHORT;
3809 case SPECIFIER_SIGNED:
3810 case SPECIFIER_SIGNED | SPECIFIER_INT:
3811 atomic_type = ATOMIC_TYPE_INT;
3813 case SPECIFIER_UNSIGNED:
3814 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
3815 atomic_type = ATOMIC_TYPE_UINT;
3817 case SPECIFIER_LONG:
3818 case SPECIFIER_SIGNED | SPECIFIER_LONG:
3819 case SPECIFIER_LONG | SPECIFIER_INT:
3820 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3821 atomic_type = ATOMIC_TYPE_LONG;
3823 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
3824 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3825 atomic_type = ATOMIC_TYPE_ULONG;
3828 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3829 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3830 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
3831 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3833 atomic_type = ATOMIC_TYPE_LONGLONG;
3834 goto warn_about_long_long;
3836 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3837 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3839 atomic_type = ATOMIC_TYPE_ULONGLONG;
3840 warn_about_long_long:
3841 if (warning.long_long) {
3842 warningf(&specifiers->source_position,
3843 "ISO C90 does not support 'long long'");
3847 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
3848 atomic_type = unsigned_int8_type_kind;
3851 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
3852 atomic_type = unsigned_int16_type_kind;
3855 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
3856 atomic_type = unsigned_int32_type_kind;
3859 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
3860 atomic_type = unsigned_int64_type_kind;
3863 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
3864 atomic_type = unsigned_int128_type_kind;
3867 case SPECIFIER_INT8:
3868 case SPECIFIER_SIGNED | SPECIFIER_INT8:
3869 atomic_type = int8_type_kind;
3872 case SPECIFIER_INT16:
3873 case SPECIFIER_SIGNED | SPECIFIER_INT16:
3874 atomic_type = int16_type_kind;
3877 case SPECIFIER_INT32:
3878 case SPECIFIER_SIGNED | SPECIFIER_INT32:
3879 atomic_type = int32_type_kind;
3882 case SPECIFIER_INT64:
3883 case SPECIFIER_SIGNED | SPECIFIER_INT64:
3884 atomic_type = int64_type_kind;
3887 case SPECIFIER_INT128:
3888 case SPECIFIER_SIGNED | SPECIFIER_INT128:
3889 atomic_type = int128_type_kind;
3892 case SPECIFIER_FLOAT:
3893 atomic_type = ATOMIC_TYPE_FLOAT;
3895 case SPECIFIER_DOUBLE:
3896 atomic_type = ATOMIC_TYPE_DOUBLE;
3898 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
3899 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3901 case SPECIFIER_BOOL:
3902 atomic_type = ATOMIC_TYPE_BOOL;
3904 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
3905 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
3906 atomic_type = ATOMIC_TYPE_FLOAT;
3908 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3909 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3910 atomic_type = ATOMIC_TYPE_DOUBLE;
3912 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3913 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3914 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3917 /* invalid specifier combination, give an error message */
3918 if (type_specifiers == 0) {
3922 /* ISO/IEC 14882:1998(E) §C.1.5:4 */
3923 if (!(c_mode & _CXX) && !strict_mode) {
3924 if (warning.implicit_int) {
3925 warningf(HERE, "no type specifiers in declaration, using 'int'");
3927 atomic_type = ATOMIC_TYPE_INT;
3930 errorf(HERE, "no type specifiers given in declaration");
3932 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
3933 (type_specifiers & SPECIFIER_UNSIGNED)) {
3934 errorf(HERE, "signed and unsigned specifiers given");
3935 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3936 errorf(HERE, "only integer types can be signed or unsigned");
3938 errorf(HERE, "multiple datatypes in declaration");
3943 if (type_specifiers & SPECIFIER_COMPLEX) {
3944 type = allocate_type_zero(TYPE_COMPLEX);
3945 type->complex.akind = atomic_type;
3946 } else if (type_specifiers & SPECIFIER_IMAGINARY) {
3947 type = allocate_type_zero(TYPE_IMAGINARY);
3948 type->imaginary.akind = atomic_type;
3950 type = allocate_type_zero(TYPE_ATOMIC);
3951 type->atomic.akind = atomic_type;
3954 } else if (type_specifiers != 0) {
3955 errorf(HERE, "multiple datatypes in declaration");
3958 /* FIXME: check type qualifiers here */
3960 type->base.qualifiers = qualifiers;
3961 type->base.modifiers = modifiers;
3963 type_t *result = typehash_insert(type);
3964 if (newtype && result != type) {
3968 specifiers->type = result;
3972 specifiers->type = type_error_type;
3976 static type_qualifiers_t parse_type_qualifiers(void)
3978 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3981 switch (token.type) {
3982 /* type qualifiers */
3983 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3984 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3985 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3986 /* microsoft extended type modifiers */
3987 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3988 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3989 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3990 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3991 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
4000 * Parses an K&R identifier list
4002 static void parse_identifier_list(scope_t *scope)
4005 entity_t *entity = allocate_entity_zero(ENTITY_VARIABLE);
4006 entity->base.source_position = token.source_position;
4007 entity->base.namespc = NAMESPACE_NORMAL;
4008 entity->base.symbol = token.v.symbol;
4009 /* a K&R parameter has no type, yet */
4012 append_entity(scope, entity);
4014 if (token.type != ',') {
4018 } while (token.type == T_IDENTIFIER);
4021 static type_t *automatic_type_conversion(type_t *orig_type);
4023 static void semantic_parameter(declaration_t *declaration)
4025 /* TODO: improve error messages */
4026 source_position_t const* const pos = &declaration->base.source_position;
4029 switch (declaration->declared_storage_class) {
4030 /* Allowed storage classes */
4031 case STORAGE_CLASS_NONE:
4032 case STORAGE_CLASS_REGISTER:
4036 errorf(pos, "parameter may only have none or register storage class");
4040 type_t *const orig_type = declaration->type;
4041 /* §6.7.5.3(7): Array as last part of a parameter type is just syntactic
4042 * sugar. Turn it into a pointer.
4043 * §6.7.5.3(8): A declaration of a parameter as ``function returning type''
4044 * shall be adjusted to ``pointer to function returning type'', as in 6.3.2.1.
4046 type_t *const type = automatic_type_conversion(orig_type);
4047 declaration->type = type;
4049 if (is_type_incomplete(skip_typeref(type))) {
4050 errorf(pos, "parameter '%#T' is of incomplete type",
4051 orig_type, declaration->base.symbol);
4055 static entity_t *parse_parameter(void)
4057 declaration_specifiers_t specifiers;
4058 memset(&specifiers, 0, sizeof(specifiers));
4060 parse_declaration_specifiers(&specifiers);
4062 entity_t *entity = parse_declarator(&specifiers, true, false);
4067 * Parses function type parameters (and optionally creates variable_t entities
4068 * for them in a scope)
4070 static void parse_parameters(function_type_t *type, scope_t *scope)
4073 add_anchor_token(')');
4074 int saved_comma_state = save_and_reset_anchor_state(',');
4076 if (token.type == T_IDENTIFIER &&
4077 !is_typedef_symbol(token.v.symbol)) {
4078 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
4079 if (la1_type == ',' || la1_type == ')') {
4080 type->kr_style_parameters = true;
4081 parse_identifier_list(scope);
4082 goto parameters_finished;
4086 if (token.type == ')') {
4087 /* ISO/IEC 14882:1998(E) §C.1.6:1 */
4088 if (!(c_mode & _CXX))
4089 type->unspecified_parameters = true;
4090 goto parameters_finished;
4093 function_parameter_t *parameter;
4094 function_parameter_t *last_parameter = NULL;
4097 switch (token.type) {
4100 type->variadic = true;
4101 goto parameters_finished;
4104 case T___extension__:
4107 entity_t *entity = parse_parameter();
4108 if (entity->kind == ENTITY_TYPEDEF) {
4109 errorf(&entity->base.source_position,
4110 "typedef not allowed as function parameter");
4113 assert(is_declaration(entity));
4115 /* func(void) is not a parameter */
4116 if (last_parameter == NULL
4117 && token.type == ')'
4118 && entity->base.symbol == NULL
4119 && skip_typeref(entity->declaration.type) == type_void) {
4120 goto parameters_finished;
4122 semantic_parameter(&entity->declaration);
4124 parameter = obstack_alloc(type_obst, sizeof(parameter[0]));
4125 memset(parameter, 0, sizeof(parameter[0]));
4126 parameter->type = entity->declaration.type;
4128 if (scope != NULL) {
4129 append_entity(scope, entity);
4132 if (last_parameter != NULL) {
4133 last_parameter->next = parameter;
4135 type->parameters = parameter;
4137 last_parameter = parameter;
4142 goto parameters_finished;
4144 if (token.type != ',') {
4145 goto parameters_finished;
4151 parameters_finished:
4152 rem_anchor_token(')');
4156 restore_anchor_state(',', saved_comma_state);
4159 typedef enum construct_type_kind_t {
4164 } construct_type_kind_t;
4166 typedef struct construct_type_t construct_type_t;
4167 struct construct_type_t {
4168 construct_type_kind_t kind;
4169 construct_type_t *next;
4172 typedef struct parsed_pointer_t parsed_pointer_t;
4173 struct parsed_pointer_t {
4174 construct_type_t construct_type;
4175 type_qualifiers_t type_qualifiers;
4178 typedef struct construct_function_type_t construct_function_type_t;
4179 struct construct_function_type_t {
4180 construct_type_t construct_type;
4181 type_t *function_type;
4184 typedef struct parsed_array_t parsed_array_t;
4185 struct parsed_array_t {
4186 construct_type_t construct_type;
4187 type_qualifiers_t type_qualifiers;
4193 typedef struct construct_base_type_t construct_base_type_t;
4194 struct construct_base_type_t {
4195 construct_type_t construct_type;
4199 static construct_type_t *parse_pointer_declarator(void)
4203 parsed_pointer_t *pointer = obstack_alloc(&temp_obst, sizeof(pointer[0]));
4204 memset(pointer, 0, sizeof(pointer[0]));
4205 pointer->construct_type.kind = CONSTRUCT_POINTER;
4206 pointer->type_qualifiers = parse_type_qualifiers();
4208 return (construct_type_t*) pointer;
4211 static construct_type_t *parse_array_declarator(void)
4214 add_anchor_token(']');
4216 parsed_array_t *array = obstack_alloc(&temp_obst, sizeof(array[0]));
4217 memset(array, 0, sizeof(array[0]));
4218 array->construct_type.kind = CONSTRUCT_ARRAY;
4220 if (token.type == T_static) {
4221 array->is_static = true;
4225 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
4226 if (type_qualifiers != 0) {
4227 if (token.type == T_static) {
4228 array->is_static = true;
4232 array->type_qualifiers = type_qualifiers;
4234 if (token.type == '*' && look_ahead(1)->type == ']') {
4235 array->is_variable = true;
4237 } else if (token.type != ']') {
4238 array->size = parse_assignment_expression();
4241 rem_anchor_token(']');
4245 return (construct_type_t*) array;
4248 static construct_type_t *parse_function_declarator(scope_t *scope)
4250 type_t *type = allocate_type_zero(TYPE_FUNCTION);
4252 /* TODO: revive this... once we know exactly how to do it */
4254 decl_modifiers_t modifiers = entity->declaration.modifiers;
4256 unsigned mask = modifiers & (DM_CDECL|DM_STDCALL|DM_FASTCALL|DM_THISCALL);
4258 if (mask & (mask-1)) {
4259 const char *first = NULL, *second = NULL;
4261 /* more than one calling convention set */
4262 if (modifiers & DM_CDECL) {
4263 if (first == NULL) first = "cdecl";
4264 else if (second == NULL) second = "cdecl";
4266 if (modifiers & DM_STDCALL) {
4267 if (first == NULL) first = "stdcall";
4268 else if (second == NULL) second = "stdcall";
4270 if (modifiers & DM_FASTCALL) {
4271 if (first == NULL) first = "fastcall";
4272 else if (second == NULL) second = "fastcall";
4274 if (modifiers & DM_THISCALL) {
4275 if (first == NULL) first = "thiscall";
4276 else if (second == NULL) second = "thiscall";
4278 errorf(&entity->base.source_position,
4279 "%s and %s attributes are not compatible", first, second);
4282 if (modifiers & DM_CDECL)
4283 type->function.calling_convention = CC_CDECL;
4284 else if (modifiers & DM_STDCALL)
4285 type->function.calling_convention = CC_STDCALL;
4286 else if (modifiers & DM_FASTCALL)
4287 type->function.calling_convention = CC_FASTCALL;
4288 else if (modifiers & DM_THISCALL)
4289 type->function.calling_convention = CC_THISCALL;
4292 parse_parameters(&type->function, scope);
4294 construct_function_type_t *construct_function_type =
4295 obstack_alloc(&temp_obst, sizeof(construct_function_type[0]));
4296 memset(construct_function_type, 0, sizeof(construct_function_type[0]));
4297 construct_function_type->construct_type.kind = CONSTRUCT_FUNCTION;
4298 construct_function_type->function_type = type;
4300 return &construct_function_type->construct_type;
4303 typedef struct parse_declarator_env_t {
4304 decl_modifiers_t modifiers;
4306 source_position_t source_position;
4308 } parse_declarator_env_t;
4310 static construct_type_t *parse_inner_declarator(parse_declarator_env_t *env,
4311 bool may_be_abstract)
4313 /* construct a single linked list of construct_type_t's which describe
4314 * how to construct the final declarator type */
4315 construct_type_t *first = NULL;
4316 construct_type_t *last = NULL;
4317 gnu_attribute_t *attributes = NULL;
4319 decl_modifiers_t modifiers = parse_attributes(&attributes);
4322 while (token.type == '*') {
4323 construct_type_t *type = parse_pointer_declarator();
4333 /* TODO: find out if this is correct */
4334 modifiers |= parse_attributes(&attributes);
4338 env->modifiers |= modifiers;
4340 construct_type_t *inner_types = NULL;
4342 switch (token.type) {
4345 errorf(HERE, "no identifier expected in typename");
4347 env->symbol = token.v.symbol;
4348 env->source_position = token.source_position;
4354 add_anchor_token(')');
4355 inner_types = parse_inner_declarator(env, may_be_abstract);
4356 if (inner_types != NULL) {
4357 /* All later declarators only modify the return type */
4360 rem_anchor_token(')');
4364 if (may_be_abstract)
4366 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
4371 construct_type_t *p = last;
4374 construct_type_t *type;
4375 switch (token.type) {
4377 scope_t *scope = NULL;
4379 scope = &env->parameters;
4381 type = parse_function_declarator(scope);
4385 type = parse_array_declarator();
4388 goto declarator_finished;
4391 /* insert in the middle of the list (behind p) */
4393 type->next = p->next;
4404 declarator_finished:
4405 /* append inner_types at the end of the list, we don't to set last anymore
4406 * as it's not needed anymore */
4408 assert(first == NULL);
4409 first = inner_types;
4411 last->next = inner_types;
4419 static void parse_declaration_attributes(entity_t *entity)
4421 gnu_attribute_t *attributes = NULL;
4422 decl_modifiers_t modifiers = parse_attributes(&attributes);
4428 if (entity->kind == ENTITY_TYPEDEF) {
4429 modifiers |= entity->typedefe.modifiers;
4430 type = entity->typedefe.type;
4432 assert(is_declaration(entity));
4433 modifiers |= entity->declaration.modifiers;
4434 type = entity->declaration.type;
4439 /* handle these strange/stupid mode attributes */
4440 gnu_attribute_t *attribute = attributes;
4441 for ( ; attribute != NULL; attribute = attribute->next) {
4442 if (attribute->kind != GNU_AK_MODE || attribute->invalid)
4445 atomic_type_kind_t akind = attribute->u.akind;
4446 if (!is_type_signed(type)) {
4448 case ATOMIC_TYPE_CHAR: akind = ATOMIC_TYPE_UCHAR; break;
4449 case ATOMIC_TYPE_SHORT: akind = ATOMIC_TYPE_USHORT; break;
4450 case ATOMIC_TYPE_INT: akind = ATOMIC_TYPE_UINT; break;
4451 case ATOMIC_TYPE_LONGLONG: akind = ATOMIC_TYPE_ULONGLONG; break;
4453 panic("invalid akind in mode attribute");
4457 case ATOMIC_TYPE_CHAR: akind = ATOMIC_TYPE_SCHAR; break;
4458 case ATOMIC_TYPE_SHORT: akind = ATOMIC_TYPE_SHORT; break;
4459 case ATOMIC_TYPE_INT: akind = ATOMIC_TYPE_INT; break;
4460 case ATOMIC_TYPE_LONGLONG: akind = ATOMIC_TYPE_LONGLONG; break;
4462 panic("invalid akind in mode attribute");
4466 type = make_atomic_type(akind, type->base.qualifiers);
4469 type_modifiers_t type_modifiers = type->base.modifiers;
4470 if (modifiers & DM_TRANSPARENT_UNION)
4471 modifiers |= TYPE_MODIFIER_TRANSPARENT_UNION;
4473 if (type->base.modifiers != type_modifiers) {
4474 type_t *copy = duplicate_type(type);
4475 copy->base.modifiers = type_modifiers;
4477 type = typehash_insert(copy);
4479 obstack_free(type_obst, copy);
4483 if (entity->kind == ENTITY_TYPEDEF) {
4484 entity->typedefe.type = type;
4485 entity->typedefe.modifiers = modifiers;
4487 entity->declaration.type = type;
4488 entity->declaration.modifiers = modifiers;
4492 static type_t *construct_declarator_type(construct_type_t *construct_list,
4495 construct_type_t *iter = construct_list;
4496 for( ; iter != NULL; iter = iter->next) {
4497 switch (iter->kind) {
4498 case CONSTRUCT_INVALID:
4499 internal_errorf(HERE, "invalid type construction found");
4500 case CONSTRUCT_FUNCTION: {
4501 construct_function_type_t *construct_function_type
4502 = (construct_function_type_t*) iter;
4504 type_t *function_type = construct_function_type->function_type;
4506 function_type->function.return_type = type;
4508 type_t *skipped_return_type = skip_typeref(type);
4510 if (is_type_function(skipped_return_type)) {
4511 errorf(HERE, "function returning function is not allowed");
4512 } else if (is_type_array(skipped_return_type)) {
4513 errorf(HERE, "function returning array is not allowed");
4515 if (skipped_return_type->base.qualifiers != 0 && warning.other) {
4517 "type qualifiers in return type of function type are meaningless");
4521 type = function_type;
4525 case CONSTRUCT_POINTER: {
4526 parsed_pointer_t *parsed_pointer = (parsed_pointer_t*) iter;
4527 type = make_pointer_type(type, parsed_pointer->type_qualifiers);
4531 case CONSTRUCT_ARRAY: {
4532 parsed_array_t *parsed_array = (parsed_array_t*) iter;
4533 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
4535 expression_t *size_expression = parsed_array->size;
4536 if (size_expression != NULL) {
4538 = create_implicit_cast(size_expression, type_size_t);
4541 array_type->base.qualifiers = parsed_array->type_qualifiers;
4542 array_type->array.element_type = type;
4543 array_type->array.is_static = parsed_array->is_static;
4544 array_type->array.is_variable = parsed_array->is_variable;
4545 array_type->array.size_expression = size_expression;
4547 if (size_expression != NULL) {
4548 if (is_constant_expression(size_expression)) {
4549 array_type->array.size_constant = true;
4550 array_type->array.size
4551 = fold_constant(size_expression);
4553 array_type->array.is_vla = true;
4557 type_t *skipped_type = skip_typeref(type);
4559 if (is_type_incomplete(skipped_type)) {
4560 errorf(HERE, "array of incomplete type '%T' is not allowed", type);
4561 } else if (is_type_function(skipped_type)) {
4562 errorf(HERE, "array of functions is not allowed");
4569 type_t *hashed_type = typehash_insert(type);
4570 if (hashed_type != type) {
4571 /* the function type was constructed earlier freeing it here will
4572 * destroy other types... */
4573 if (iter->kind != CONSTRUCT_FUNCTION) {
4583 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
4584 bool may_be_abstract,
4585 bool create_compound_member)
4587 parse_declarator_env_t env;
4588 memset(&env, 0, sizeof(env));
4590 construct_type_t *construct_type
4591 = parse_inner_declarator(&env, may_be_abstract);
4592 type_t *type = construct_declarator_type(construct_type, specifiers->type);
4594 if (construct_type != NULL) {
4595 obstack_free(&temp_obst, construct_type);
4599 if (specifiers->storage_class == STORAGE_CLASS_TYPEDEF) {
4600 entity = allocate_entity_zero(ENTITY_TYPEDEF);
4601 entity->base.symbol = env.symbol;
4602 entity->base.source_position = env.source_position;
4603 entity->typedefe.type = type;
4605 if (create_compound_member) {
4606 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER);
4607 } else if (is_type_function(skip_typeref(type))) {
4608 entity = allocate_entity_zero(ENTITY_FUNCTION);
4610 entity->function.is_inline = specifiers->is_inline;
4611 entity->function.parameters = env.parameters;
4613 entity = allocate_entity_zero(ENTITY_VARIABLE);
4615 entity->variable.get_property_sym = specifiers->get_property_sym;
4616 entity->variable.put_property_sym = specifiers->put_property_sym;
4617 if (specifiers->alignment != 0) {
4618 /* TODO: add checks here */
4619 entity->variable.alignment = specifiers->alignment;
4622 if (warning.other && specifiers->is_inline && is_type_valid(type)) {
4623 warningf(&env.source_position,
4624 "variable '%Y' declared 'inline'\n", env.symbol);
4628 entity->base.source_position = env.source_position;
4629 entity->base.symbol = env.symbol;
4630 entity->base.namespc = NAMESPACE_NORMAL;
4631 entity->declaration.type = type;
4632 entity->declaration.modifiers = env.modifiers | specifiers->modifiers;
4633 entity->declaration.deprecated_string = specifiers->deprecated_string;
4635 storage_class_t storage_class = specifiers->storage_class;
4636 entity->declaration.declared_storage_class = storage_class;
4638 if (storage_class == STORAGE_CLASS_NONE && scope != file_scope) {
4639 storage_class = STORAGE_CLASS_AUTO;
4641 entity->declaration.storage_class = storage_class;
4644 parse_declaration_attributes(entity);
4649 static type_t *parse_abstract_declarator(type_t *base_type)
4651 construct_type_t *construct_type = parse_inner_declarator(NULL, 1);
4653 type_t *result = construct_declarator_type(construct_type, base_type);
4654 if (construct_type != NULL) {
4655 obstack_free(&temp_obst, construct_type);
4662 * Check if the declaration of main is suspicious. main should be a
4663 * function with external linkage, returning int, taking either zero
4664 * arguments, two, or three arguments of appropriate types, ie.
4666 * int main([ int argc, char **argv [, char **env ] ]).
4668 * @param decl the declaration to check
4669 * @param type the function type of the declaration
4671 static void check_type_of_main(const entity_t *entity)
4673 const source_position_t *pos = &entity->base.source_position;
4674 if (entity->kind != ENTITY_FUNCTION) {
4675 warningf(pos, "'main' is not a function");
4679 if (entity->declaration.storage_class == STORAGE_CLASS_STATIC) {
4680 warningf(pos, "'main' is normally a non-static function");
4683 type_t *type = skip_typeref(entity->declaration.type);
4684 assert(is_type_function(type));
4686 function_type_t *func_type = &type->function;
4687 if (!types_compatible(skip_typeref(func_type->return_type), type_int)) {
4688 warningf(pos, "return type of 'main' should be 'int', but is '%T'",
4689 func_type->return_type);
4691 const function_parameter_t *parm = func_type->parameters;
4693 type_t *const first_type = parm->type;
4694 if (!types_compatible(skip_typeref(first_type), type_int)) {
4696 "first argument of 'main' should be 'int', but is '%T'",
4701 type_t *const second_type = parm->type;
4702 if (!types_compatible(skip_typeref(second_type), type_char_ptr_ptr)) {
4703 warningf(pos, "second argument of 'main' should be 'char**', but is '%T'", second_type);
4707 type_t *const third_type = parm->type;
4708 if (!types_compatible(skip_typeref(third_type), type_char_ptr_ptr)) {
4709 warningf(pos, "third argument of 'main' should be 'char**', but is '%T'", third_type);
4713 goto warn_arg_count;
4717 warningf(pos, "'main' takes only zero, two or three arguments");
4723 * Check if a symbol is the equal to "main".
4725 static bool is_sym_main(const symbol_t *const sym)
4727 return strcmp(sym->string, "main") == 0;
4731 * record entities for the NAMESPACE_NORMAL, and produce error messages/warnings
4732 * for various problems that occur for multiple definitions
4734 static entity_t *record_entity(entity_t *entity, const bool is_definition)
4736 const symbol_t *const symbol = entity->base.symbol;
4737 const namespace_t namespc = entity->base.namespc;
4738 const source_position_t *pos = &entity->base.source_position;
4740 assert(symbol != NULL);
4741 entity_t *previous_entity = get_entity(symbol, namespc);
4742 /* pushing the same entity twice will break the stack structure */
4743 assert(previous_entity != entity);
4745 if (entity->kind == ENTITY_FUNCTION) {
4746 type_t *const orig_type = entity->declaration.type;
4747 type_t *const type = skip_typeref(orig_type);
4749 assert(is_type_function(type));
4750 if (type->function.unspecified_parameters &&
4751 warning.strict_prototypes &&
4752 previous_entity == NULL) {
4753 warningf(pos, "function declaration '%#T' is not a prototype",
4757 if (warning.main && scope == file_scope && is_sym_main(symbol)) {
4758 check_type_of_main(entity);
4762 if (is_declaration(entity)) {
4763 if (warning.nested_externs
4764 && entity->declaration.storage_class == STORAGE_CLASS_EXTERN
4765 && scope != file_scope) {
4766 warningf(pos, "nested extern declaration of '%#T'",
4767 entity->declaration.type, symbol);
4771 if (previous_entity != NULL
4772 && previous_entity->base.parent_scope == ¤t_function->parameters
4773 && scope->depth == previous_entity->base.parent_scope->depth + 1) {
4775 assert(previous_entity->kind == ENTITY_VARIABLE);
4777 "declaration '%#T' redeclares the parameter '%#T' (declared %P)",
4778 entity->declaration.type, symbol,
4779 previous_entity->declaration.type, symbol,
4780 &previous_entity->base.source_position);
4784 if (previous_entity != NULL
4785 && previous_entity->base.parent_scope == scope) {
4787 if (previous_entity->kind != entity->kind) {
4789 "redeclaration of '%Y' as different kind of symbol (declared %P)",
4790 symbol, &previous_entity->base.source_position);
4793 if (previous_entity->kind == ENTITY_ENUM_VALUE) {
4795 "redeclaration of enum entry '%Y' (declared %P)",
4796 symbol, &previous_entity->base.source_position);
4799 if (previous_entity->kind == ENTITY_TYPEDEF) {
4800 /* TODO: C++ allows this for exactly the same type */
4802 "redefinition of typedef '%Y' (declared %P)",
4803 symbol, &previous_entity->base.source_position);
4807 /* at this point we should have only VARIABLES or FUNCTIONS */
4808 assert(is_declaration(previous_entity) && is_declaration(entity));
4810 /* can happen for K&R style declarations */
4811 if (previous_entity->kind == ENTITY_VARIABLE
4812 && previous_entity->declaration.type == NULL
4813 && entity->kind == ENTITY_VARIABLE) {
4814 previous_entity->declaration.type = entity->declaration.type;
4815 previous_entity->declaration.storage_class
4816 = entity->declaration.storage_class;
4817 previous_entity->declaration.declared_storage_class
4818 = entity->declaration.declared_storage_class;
4819 previous_entity->declaration.modifiers
4820 = entity->declaration.modifiers;
4821 previous_entity->declaration.deprecated_string
4822 = entity->declaration.deprecated_string;
4824 assert(entity->declaration.type != NULL);
4826 declaration_t *const previous_declaration
4827 = &previous_entity->declaration;
4828 declaration_t *const declaration = &entity->declaration;
4829 type_t *const orig_type = entity->declaration.type;
4830 type_t *const type = skip_typeref(orig_type);
4832 type_t *prev_type = skip_typeref(previous_declaration->type);
4834 if (!types_compatible(type, prev_type)) {
4836 "declaration '%#T' is incompatible with '%#T' (declared %P)",
4837 orig_type, symbol, previous_declaration->type, symbol,
4838 &previous_entity->base.source_position);
4840 unsigned old_storage_class = previous_declaration->storage_class;
4841 if (warning.redundant_decls && is_definition
4842 && previous_declaration->storage_class == STORAGE_CLASS_STATIC
4843 && !(previous_declaration->modifiers & DM_USED)
4844 && !previous_declaration->used) {
4845 warningf(&previous_entity->base.source_position,
4846 "unnecessary static forward declaration for '%#T'",
4847 previous_declaration->type, symbol);
4850 unsigned new_storage_class = declaration->storage_class;
4851 if (is_type_incomplete(prev_type)) {
4852 previous_declaration->type = type;
4856 /* pretend no storage class means extern for function
4857 * declarations (except if the previous declaration is neither
4858 * none nor extern) */
4859 if (entity->kind == ENTITY_FUNCTION) {
4860 if (prev_type->function.unspecified_parameters) {
4861 previous_declaration->type = type;
4865 switch (old_storage_class) {
4866 case STORAGE_CLASS_NONE:
4867 old_storage_class = STORAGE_CLASS_EXTERN;
4870 case STORAGE_CLASS_EXTERN:
4871 if (is_definition) {
4872 if (warning.missing_prototypes &&
4873 prev_type->function.unspecified_parameters &&
4874 !is_sym_main(symbol)) {
4875 warningf(pos, "no previous prototype for '%#T'",
4878 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4879 new_storage_class = STORAGE_CLASS_EXTERN;
4888 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4889 new_storage_class == STORAGE_CLASS_EXTERN) {
4890 warn_redundant_declaration:
4891 if (!is_definition &&
4892 warning.redundant_decls &&
4893 is_type_valid(prev_type) &&
4894 strcmp(previous_entity->base.source_position.input_name, "<builtin>") != 0) {
4896 "redundant declaration for '%Y' (declared %P)",
4897 symbol, &previous_entity->base.source_position);
4899 } else if (current_function == NULL) {
4900 if (old_storage_class != STORAGE_CLASS_STATIC &&
4901 new_storage_class == STORAGE_CLASS_STATIC) {
4903 "static declaration of '%Y' follows non-static declaration (declared %P)",
4904 symbol, &previous_entity->base.source_position);
4905 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4906 previous_declaration->storage_class = STORAGE_CLASS_NONE;
4907 previous_declaration->declared_storage_class = STORAGE_CLASS_NONE;
4909 /* ISO/IEC 14882:1998(E) §C.1.2:1 */
4911 goto error_redeclaration;
4912 goto warn_redundant_declaration;
4914 } else if (is_type_valid(prev_type)) {
4915 if (old_storage_class == new_storage_class) {
4916 error_redeclaration:
4917 errorf(pos, "redeclaration of '%Y' (declared %P)",
4918 symbol, &previous_entity->base.source_position);
4921 "redeclaration of '%Y' with different linkage (declared %P)",
4922 symbol, &previous_entity->base.source_position);
4927 previous_declaration->modifiers |= declaration->modifiers;
4928 if (entity->kind == ENTITY_FUNCTION) {
4929 previous_entity->function.is_inline |= entity->function.is_inline;
4931 return previous_entity;
4934 if (entity->kind == ENTITY_FUNCTION) {
4935 if (is_definition &&
4936 entity->declaration.storage_class != STORAGE_CLASS_STATIC) {
4937 if (warning.missing_prototypes && !is_sym_main(symbol)) {
4938 warningf(pos, "no previous prototype for '%#T'",
4939 entity->declaration.type, symbol);
4940 } else if (warning.missing_declarations && !is_sym_main(symbol)) {
4941 warningf(pos, "no previous declaration for '%#T'",
4942 entity->declaration.type, symbol);
4945 } else if (warning.missing_declarations
4946 && entity->kind == ENTITY_VARIABLE
4947 && scope == file_scope) {
4948 declaration_t *declaration = &entity->declaration;
4949 if (declaration->storage_class == STORAGE_CLASS_NONE ||
4950 declaration->storage_class == STORAGE_CLASS_THREAD) {
4951 warningf(pos, "no previous declaration for '%#T'",
4952 declaration->type, symbol);
4957 assert(entity->base.parent_scope == NULL);
4958 assert(scope != NULL);
4960 entity->base.parent_scope = scope;
4961 entity->base.namespc = NAMESPACE_NORMAL;
4962 environment_push(entity);
4963 append_entity(scope, entity);
4968 static void parser_error_multiple_definition(entity_t *entity,
4969 const source_position_t *source_position)
4971 errorf(source_position, "multiple definition of symbol '%Y' (declared %P)",
4972 entity->base.symbol, &entity->base.source_position);
4975 static bool is_declaration_specifier(const token_t *token,
4976 bool only_specifiers_qualifiers)
4978 switch (token->type) {
4983 return is_typedef_symbol(token->v.symbol);
4985 case T___extension__:
4987 return !only_specifiers_qualifiers;
4994 static void parse_init_declarator_rest(entity_t *entity)
4996 assert(is_declaration(entity));
4997 declaration_t *const declaration = &entity->declaration;
5001 type_t *orig_type = declaration->type;
5002 type_t *type = skip_typeref(orig_type);
5004 if (entity->kind == ENTITY_VARIABLE
5005 && entity->variable.initializer != NULL) {
5006 parser_error_multiple_definition(entity, HERE);
5009 bool must_be_constant = false;
5010 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
5011 declaration->storage_class == STORAGE_CLASS_THREAD_STATIC ||
5012 entity->base.parent_scope == file_scope) {
5013 must_be_constant = true;
5016 if (is_type_function(type)) {
5017 errorf(&entity->base.source_position,
5018 "function '%#T' is initialized like a variable",
5019 orig_type, entity->base.symbol);
5020 orig_type = type_error_type;
5023 parse_initializer_env_t env;
5024 env.type = orig_type;
5025 env.must_be_constant = must_be_constant;
5026 env.entity = entity;
5027 current_init_decl = entity;
5029 initializer_t *initializer = parse_initializer(&env);
5030 current_init_decl = NULL;
5032 if (entity->kind == ENTITY_VARIABLE) {
5033 /* § 6.7.5 (22) array initializers for arrays with unknown size
5034 * determine the array type size */
5035 declaration->type = env.type;
5036 entity->variable.initializer = initializer;
5040 /* parse rest of a declaration without any declarator */
5041 static void parse_anonymous_declaration_rest(
5042 const declaration_specifiers_t *specifiers)
5046 if (warning.other) {
5047 if (specifiers->storage_class != STORAGE_CLASS_NONE) {
5048 warningf(&specifiers->source_position,
5049 "useless storage class in empty declaration");
5052 type_t *type = specifiers->type;
5053 switch (type->kind) {
5054 case TYPE_COMPOUND_STRUCT:
5055 case TYPE_COMPOUND_UNION: {
5056 if (type->compound.compound->base.symbol == NULL) {
5057 warningf(&specifiers->source_position,
5058 "unnamed struct/union that defines no instances");
5067 warningf(&specifiers->source_position, "empty declaration");
5073 static void parse_declaration_rest(entity_t *ndeclaration,
5074 const declaration_specifiers_t *specifiers,
5075 parsed_declaration_func finished_declaration)
5077 add_anchor_token(';');
5078 add_anchor_token(',');
5080 entity_t *entity = finished_declaration(ndeclaration, token.type == '=');
5082 if (token.type == '=') {
5083 parse_init_declarator_rest(entity);
5086 if (token.type != ',')
5090 add_anchor_token('=');
5091 ndeclaration = parse_declarator(specifiers, /*may_be_abstract=*/false, false);
5092 rem_anchor_token('=');
5097 rem_anchor_token(';');
5098 rem_anchor_token(',');
5101 static entity_t *finished_kr_declaration(entity_t *entity, bool is_definition)
5103 symbol_t *symbol = entity->base.symbol;
5104 if (symbol == NULL) {
5105 errorf(HERE, "anonymous declaration not valid as function parameter");
5109 assert(entity->base.namespc == NAMESPACE_NORMAL);
5110 entity_t *previous_entity = get_entity(symbol, NAMESPACE_NORMAL);
5111 if (previous_entity == NULL
5112 || previous_entity->base.parent_scope != scope) {
5113 errorf(HERE, "expected declaration of a function parameter, found '%Y'",
5118 if (is_definition) {
5119 errorf(HERE, "parameter %Y is initialised", entity->base.symbol);
5122 return record_entity(entity, false);
5125 static void parse_declaration(parsed_declaration_func finished_declaration)
5127 declaration_specifiers_t specifiers;
5128 memset(&specifiers, 0, sizeof(specifiers));
5130 add_anchor_token(';');
5131 parse_declaration_specifiers(&specifiers);
5132 rem_anchor_token(';');
5134 if (token.type == ';') {
5135 parse_anonymous_declaration_rest(&specifiers);
5137 entity_t *entity = parse_declarator(&specifiers, /*may_be_abstract=*/false, false);
5138 parse_declaration_rest(entity, &specifiers, finished_declaration);
5142 static type_t *get_default_promoted_type(type_t *orig_type)
5144 type_t *result = orig_type;
5146 type_t *type = skip_typeref(orig_type);
5147 if (is_type_integer(type)) {
5148 result = promote_integer(type);
5149 } else if (type == type_float) {
5150 result = type_double;
5156 static void parse_kr_declaration_list(entity_t *entity)
5158 if (entity->kind != ENTITY_FUNCTION)
5161 type_t *type = skip_typeref(entity->declaration.type);
5162 assert(is_type_function(type));
5163 if (!type->function.kr_style_parameters)
5167 add_anchor_token('{');
5169 /* push function parameters */
5170 size_t const top = environment_top();
5171 scope_push(&entity->function.parameters);
5173 entity_t *parameter = entity->function.parameters.entities;
5174 for ( ; parameter != NULL; parameter = parameter->base.next) {
5175 assert(parameter->base.parent_scope == NULL);
5176 parameter->base.parent_scope = scope;
5177 environment_push(parameter);
5180 /* parse declaration list */
5181 while (is_declaration_specifier(&token, false)) {
5182 parse_declaration(finished_kr_declaration);
5185 /* pop function parameters */
5186 assert(scope == &entity->function.parameters);
5188 environment_pop_to(top);
5190 /* update function type */
5191 type_t *new_type = duplicate_type(type);
5193 function_parameter_t *parameters = NULL;
5194 function_parameter_t *last_parameter = NULL;
5196 entity_t *parameter_declaration = entity->function.parameters.entities;
5197 for( ; parameter_declaration != NULL;
5198 parameter_declaration = parameter_declaration->base.next) {
5199 type_t *parameter_type = parameter_declaration->declaration.type;
5200 if (parameter_type == NULL) {
5202 errorf(HERE, "no type specified for function parameter '%Y'",
5203 parameter_declaration->base.symbol);
5205 if (warning.implicit_int) {
5206 warningf(HERE, "no type specified for function parameter '%Y', using 'int'",
5207 parameter_declaration->base.symbol);
5209 parameter_type = type_int;
5210 parameter_declaration->declaration.type = parameter_type;
5214 semantic_parameter(¶meter_declaration->declaration);
5215 parameter_type = parameter_declaration->declaration.type;
5218 * we need the default promoted types for the function type
5220 parameter_type = get_default_promoted_type(parameter_type);
5222 function_parameter_t *function_parameter
5223 = obstack_alloc(type_obst, sizeof(function_parameter[0]));
5224 memset(function_parameter, 0, sizeof(function_parameter[0]));
5226 function_parameter->type = parameter_type;
5227 if (last_parameter != NULL) {
5228 last_parameter->next = function_parameter;
5230 parameters = function_parameter;
5232 last_parameter = function_parameter;
5235 /* § 6.9.1.7: A K&R style parameter list does NOT act as a function
5237 new_type->function.parameters = parameters;
5238 new_type->function.unspecified_parameters = true;
5240 type = typehash_insert(new_type);
5241 if (type != new_type) {
5242 obstack_free(type_obst, new_type);
5245 entity->declaration.type = type;
5247 rem_anchor_token('{');
5250 static bool first_err = true;
5253 * When called with first_err set, prints the name of the current function,
5256 static void print_in_function(void)
5260 diagnosticf("%s: In function '%Y':\n",
5261 current_function->base.base.source_position.input_name,
5262 current_function->base.base.symbol);
5267 * Check if all labels are defined in the current function.
5268 * Check if all labels are used in the current function.
5270 static void check_labels(void)
5272 for (const goto_statement_t *goto_statement = goto_first;
5273 goto_statement != NULL;
5274 goto_statement = goto_statement->next) {
5275 /* skip computed gotos */
5276 if (goto_statement->expression != NULL)
5279 label_t *label = goto_statement->label;
5282 if (label->base.source_position.input_name == NULL) {
5283 print_in_function();
5284 errorf(&goto_statement->base.source_position,
5285 "label '%Y' used but not defined", label->base.symbol);
5291 if (warning.unused_label) {
5292 for (const label_statement_t *label_statement = label_first;
5293 label_statement != NULL;
5294 label_statement = label_statement->next) {
5295 label_t *label = label_statement->label;
5297 if (! label->used) {
5298 print_in_function();
5299 warningf(&label_statement->base.source_position,
5300 "label '%Y' defined but not used", label->base.symbol);
5304 label_first = label_last = NULL;
5307 static void warn_unused_decl(entity_t *entity, entity_t *end,
5308 char const *const what)
5310 for (; entity != NULL; entity = entity->base.next) {
5311 if (!is_declaration(entity))
5314 declaration_t *declaration = &entity->declaration;
5315 if (declaration->implicit)
5318 if (!declaration->used) {
5319 print_in_function();
5320 warningf(&entity->base.source_position, "%s '%Y' is unused",
5321 what, entity->base.symbol);
5322 } else if (entity->kind == ENTITY_VARIABLE && !entity->variable.read) {
5323 print_in_function();
5324 warningf(&entity->base.source_position, "%s '%Y' is never read",
5325 what, entity->base.symbol);
5333 static void check_unused_variables(statement_t *const stmt, void *const env)
5337 switch (stmt->kind) {
5338 case STATEMENT_DECLARATION: {
5339 declaration_statement_t const *const decls = &stmt->declaration;
5340 warn_unused_decl(decls->declarations_begin, decls->declarations_end,
5346 warn_unused_decl(stmt->fors.scope.entities, NULL, "variable");
5355 * Check declarations of current_function for unused entities.
5357 static void check_declarations(void)
5359 if (warning.unused_parameter) {
5360 const scope_t *scope = ¤t_function->parameters;
5362 /* do not issue unused warnings for main */
5363 if (!is_sym_main(current_function->base.base.symbol)) {
5364 warn_unused_decl(scope->entities, NULL, "parameter");
5367 if (warning.unused_variable) {
5368 walk_statements(current_function->statement, check_unused_variables,
5373 static int determine_truth(expression_t const* const cond)
5376 !is_constant_expression(cond) ? 0 :
5377 fold_constant(cond) != 0 ? 1 :
5381 static bool expression_returns(expression_t const *const expr)
5383 switch (expr->kind) {
5385 expression_t const *const func = expr->call.function;
5386 if (func->kind == EXPR_REFERENCE) {
5387 entity_t *entity = func->reference.entity;
5388 if (entity->kind == ENTITY_FUNCTION
5389 && entity->declaration.modifiers & DM_NORETURN)
5393 if (!expression_returns(func))
5396 for (call_argument_t const* arg = expr->call.arguments; arg != NULL; arg = arg->next) {
5397 if (!expression_returns(arg->expression))
5404 case EXPR_REFERENCE:
5405 case EXPR_REFERENCE_ENUM_VALUE:
5407 case EXPR_CHARACTER_CONSTANT:
5408 case EXPR_WIDE_CHARACTER_CONSTANT:
5409 case EXPR_STRING_LITERAL:
5410 case EXPR_WIDE_STRING_LITERAL:
5411 case EXPR_COMPOUND_LITERAL: // TODO descend into initialisers
5412 case EXPR_LABEL_ADDRESS:
5413 case EXPR_CLASSIFY_TYPE:
5414 case EXPR_SIZEOF: // TODO handle obscure VLA case
5417 case EXPR_BUILTIN_SYMBOL:
5418 case EXPR_BUILTIN_CONSTANT_P:
5419 case EXPR_BUILTIN_PREFETCH:
5422 case EXPR_STATEMENT: // TODO implement
5425 case EXPR_CONDITIONAL:
5426 // TODO handle constant expression
5428 expression_returns(expr->conditional.condition) && (
5429 expression_returns(expr->conditional.true_expression) ||
5430 expression_returns(expr->conditional.false_expression)
5434 return expression_returns(expr->select.compound);
5436 case EXPR_ARRAY_ACCESS:
5438 expression_returns(expr->array_access.array_ref) &&
5439 expression_returns(expr->array_access.index);
5442 return expression_returns(expr->va_starte.ap);
5445 return expression_returns(expr->va_arge.ap);
5447 EXPR_UNARY_CASES_MANDATORY
5448 return expression_returns(expr->unary.value);
5450 case EXPR_UNARY_THROW:
5454 // TODO handle constant lhs of && and ||
5456 expression_returns(expr->binary.left) &&
5457 expression_returns(expr->binary.right);
5463 panic("unhandled expression");
5466 static bool noreturn_candidate;
5468 static void check_reachable(statement_t *const stmt)
5470 if (stmt->base.reachable)
5472 if (stmt->kind != STATEMENT_DO_WHILE)
5473 stmt->base.reachable = true;
5475 statement_t *last = stmt;
5477 switch (stmt->kind) {
5478 case STATEMENT_INVALID:
5479 case STATEMENT_EMPTY:
5480 case STATEMENT_DECLARATION:
5481 case STATEMENT_LOCAL_LABEL:
5483 next = stmt->base.next;
5486 case STATEMENT_COMPOUND:
5487 next = stmt->compound.statements;
5490 case STATEMENT_RETURN:
5491 noreturn_candidate = false;
5494 case STATEMENT_IF: {
5495 if_statement_t const* const ifs = &stmt->ifs;
5496 int const val = determine_truth(ifs->condition);
5499 check_reachable(ifs->true_statement);
5504 if (ifs->false_statement != NULL) {
5505 check_reachable(ifs->false_statement);
5509 next = stmt->base.next;
5513 case STATEMENT_SWITCH: {
5514 switch_statement_t const *const switchs = &stmt->switchs;
5515 expression_t const *const expr = switchs->expression;
5517 if (is_constant_expression(expr)) {
5518 long const val = fold_constant(expr);
5519 case_label_statement_t * defaults = NULL;
5520 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5521 if (i->expression == NULL) {
5526 if (i->first_case <= val && val <= i->last_case) {
5527 check_reachable((statement_t*)i);
5532 if (defaults != NULL) {
5533 check_reachable((statement_t*)defaults);
5537 bool has_default = false;
5538 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5539 if (i->expression == NULL)
5542 check_reachable((statement_t*)i);
5549 next = stmt->base.next;
5553 case STATEMENT_EXPRESSION: {
5554 /* Check for noreturn function call */
5555 expression_t const *const expr = stmt->expression.expression;
5556 if (!expression_returns(expr))
5559 next = stmt->base.next;
5563 case STATEMENT_CONTINUE: {
5564 statement_t *parent = stmt;
5566 parent = parent->base.parent;
5567 if (parent == NULL) /* continue not within loop */
5571 switch (parent->kind) {
5572 case STATEMENT_WHILE: goto continue_while;
5573 case STATEMENT_DO_WHILE: goto continue_do_while;
5574 case STATEMENT_FOR: goto continue_for;
5581 case STATEMENT_BREAK: {
5582 statement_t *parent = stmt;
5584 parent = parent->base.parent;
5585 if (parent == NULL) /* break not within loop/switch */
5588 switch (parent->kind) {
5589 case STATEMENT_SWITCH:
5590 case STATEMENT_WHILE:
5591 case STATEMENT_DO_WHILE:
5594 next = parent->base.next;
5595 goto found_break_parent;
5604 case STATEMENT_GOTO:
5605 if (stmt->gotos.expression) {
5606 statement_t *parent = stmt->base.parent;
5607 if (parent == NULL) /* top level goto */
5611 next = stmt->gotos.label->statement;
5612 if (next == NULL) /* missing label */
5617 case STATEMENT_LABEL:
5618 next = stmt->label.statement;
5621 case STATEMENT_CASE_LABEL:
5622 next = stmt->case_label.statement;
5625 case STATEMENT_WHILE: {
5626 while_statement_t const *const whiles = &stmt->whiles;
5627 int const val = determine_truth(whiles->condition);
5630 check_reachable(whiles->body);
5635 next = stmt->base.next;
5639 case STATEMENT_DO_WHILE:
5640 next = stmt->do_while.body;
5643 case STATEMENT_FOR: {
5644 for_statement_t *const fors = &stmt->fors;
5646 if (fors->condition_reachable)
5648 fors->condition_reachable = true;
5650 expression_t const *const cond = fors->condition;
5652 cond == NULL ? 1 : determine_truth(cond);
5655 check_reachable(fors->body);
5660 next = stmt->base.next;
5664 case STATEMENT_MS_TRY: {
5665 ms_try_statement_t const *const ms_try = &stmt->ms_try;
5666 check_reachable(ms_try->try_statement);
5667 next = ms_try->final_statement;
5671 case STATEMENT_LEAVE: {
5672 statement_t *parent = stmt;
5674 parent = parent->base.parent;
5675 if (parent == NULL) /* __leave not within __try */
5678 if (parent->kind == STATEMENT_MS_TRY) {
5680 next = parent->ms_try.final_statement;
5688 while (next == NULL) {
5689 next = last->base.parent;
5691 noreturn_candidate = false;
5693 type_t *const type = current_function->base.type;
5694 assert(is_type_function(type));
5695 type_t *const ret = skip_typeref(type->function.return_type);
5696 if (warning.return_type &&
5697 !is_type_atomic(ret, ATOMIC_TYPE_VOID) &&
5698 is_type_valid(ret) &&
5699 !is_sym_main(current_function->base.base.symbol)) {
5700 warningf(&stmt->base.source_position,
5701 "control reaches end of non-void function");
5706 switch (next->kind) {
5707 case STATEMENT_INVALID:
5708 case STATEMENT_EMPTY:
5709 case STATEMENT_DECLARATION:
5710 case STATEMENT_LOCAL_LABEL:
5711 case STATEMENT_EXPRESSION:
5713 case STATEMENT_RETURN:
5714 case STATEMENT_CONTINUE:
5715 case STATEMENT_BREAK:
5716 case STATEMENT_GOTO:
5717 case STATEMENT_LEAVE:
5718 panic("invalid control flow in function");
5720 case STATEMENT_COMPOUND:
5722 case STATEMENT_SWITCH:
5723 case STATEMENT_LABEL:
5724 case STATEMENT_CASE_LABEL:
5726 next = next->base.next;
5729 case STATEMENT_WHILE: {
5731 if (next->base.reachable)
5733 next->base.reachable = true;
5735 while_statement_t const *const whiles = &next->whiles;
5736 int const val = determine_truth(whiles->condition);
5739 check_reachable(whiles->body);
5745 next = next->base.next;
5749 case STATEMENT_DO_WHILE: {
5751 if (next->base.reachable)
5753 next->base.reachable = true;
5755 do_while_statement_t const *const dw = &next->do_while;
5756 int const val = determine_truth(dw->condition);
5759 check_reachable(dw->body);
5765 next = next->base.next;
5769 case STATEMENT_FOR: {
5771 for_statement_t *const fors = &next->fors;
5773 fors->step_reachable = true;
5775 if (fors->condition_reachable)
5777 fors->condition_reachable = true;
5779 expression_t const *const cond = fors->condition;
5781 cond == NULL ? 1 : determine_truth(cond);
5784 check_reachable(fors->body);
5790 next = next->base.next;
5794 case STATEMENT_MS_TRY:
5796 next = next->ms_try.final_statement;
5801 check_reachable(next);
5804 static void check_unreachable(statement_t* const stmt, void *const env)
5808 switch (stmt->kind) {
5809 case STATEMENT_DO_WHILE:
5810 if (!stmt->base.reachable) {
5811 expression_t const *const cond = stmt->do_while.condition;
5812 if (determine_truth(cond) >= 0) {
5813 warningf(&cond->base.source_position,
5814 "condition of do-while-loop is unreachable");
5819 case STATEMENT_FOR: {
5820 for_statement_t const* const fors = &stmt->fors;
5822 // if init and step are unreachable, cond is unreachable, too
5823 if (!stmt->base.reachable && !fors->step_reachable) {
5824 warningf(&stmt->base.source_position, "statement is unreachable");
5826 if (!stmt->base.reachable && fors->initialisation != NULL) {
5827 warningf(&fors->initialisation->base.source_position,
5828 "initialisation of for-statement is unreachable");
5831 if (!fors->condition_reachable && fors->condition != NULL) {
5832 warningf(&fors->condition->base.source_position,
5833 "condition of for-statement is unreachable");
5836 if (!fors->step_reachable && fors->step != NULL) {
5837 warningf(&fors->step->base.source_position,
5838 "step of for-statement is unreachable");
5844 case STATEMENT_COMPOUND:
5845 if (stmt->compound.statements != NULL)
5850 if (!stmt->base.reachable)
5851 warningf(&stmt->base.source_position, "statement is unreachable");
5856 static void parse_external_declaration(void)
5858 /* function-definitions and declarations both start with declaration
5860 declaration_specifiers_t specifiers;
5861 memset(&specifiers, 0, sizeof(specifiers));
5863 add_anchor_token(';');
5864 parse_declaration_specifiers(&specifiers);
5865 rem_anchor_token(';');
5867 /* must be a declaration */
5868 if (token.type == ';') {
5869 parse_anonymous_declaration_rest(&specifiers);
5873 add_anchor_token(',');
5874 add_anchor_token('=');
5875 add_anchor_token(';');
5876 add_anchor_token('{');
5878 /* declarator is common to both function-definitions and declarations */
5879 entity_t *ndeclaration = parse_declarator(&specifiers, /*may_be_abstract=*/false, false);
5881 rem_anchor_token('{');
5882 rem_anchor_token(';');
5883 rem_anchor_token('=');
5884 rem_anchor_token(',');
5886 /* must be a declaration */
5887 switch (token.type) {
5891 parse_declaration_rest(ndeclaration, &specifiers, record_entity);
5895 /* must be a function definition */
5896 parse_kr_declaration_list(ndeclaration);
5898 if (token.type != '{') {
5899 parse_error_expected("while parsing function definition", '{', NULL);
5900 eat_until_matching_token(';');
5904 assert(is_declaration(ndeclaration));
5905 type_t *type = ndeclaration->declaration.type;
5907 /* note that we don't skip typerefs: the standard doesn't allow them here
5908 * (so we can't use is_type_function here) */
5909 if (type->kind != TYPE_FUNCTION) {
5910 if (is_type_valid(type)) {
5911 errorf(HERE, "declarator '%#T' has a body but is not a function type",
5912 type, ndeclaration->base.symbol);
5918 if (warning.aggregate_return &&
5919 is_type_compound(skip_typeref(type->function.return_type))) {
5920 warningf(HERE, "function '%Y' returns an aggregate",
5921 ndeclaration->base.symbol);
5923 if (warning.traditional && !type->function.unspecified_parameters) {
5924 warningf(HERE, "traditional C rejects ISO C style function definition of function '%Y'",
5925 ndeclaration->base.symbol);
5927 if (warning.old_style_definition && type->function.unspecified_parameters) {
5928 warningf(HERE, "old-style function definition '%Y'",
5929 ndeclaration->base.symbol);
5932 /* § 6.7.5.3 (14) a function definition with () means no
5933 * parameters (and not unspecified parameters) */
5934 if (type->function.unspecified_parameters
5935 && type->function.parameters == NULL
5936 && !type->function.kr_style_parameters) {
5937 type_t *duplicate = duplicate_type(type);
5938 duplicate->function.unspecified_parameters = false;
5940 type = typehash_insert(duplicate);
5941 if (type != duplicate) {
5942 obstack_free(type_obst, duplicate);
5944 ndeclaration->declaration.type = type;
5947 entity_t *const entity = record_entity(ndeclaration, true);
5948 assert(entity->kind == ENTITY_FUNCTION);
5949 assert(ndeclaration->kind == ENTITY_FUNCTION);
5951 function_t *function = &entity->function;
5952 if (ndeclaration != entity) {
5953 function->parameters = ndeclaration->function.parameters;
5955 assert(is_declaration(entity));
5956 type = skip_typeref(entity->declaration.type);
5958 /* push function parameters and switch scope */
5959 size_t const top = environment_top();
5960 scope_push(&function->parameters);
5962 entity_t *parameter = function->parameters.entities;
5963 for( ; parameter != NULL; parameter = parameter->base.next) {
5964 if (parameter->base.parent_scope == &ndeclaration->function.parameters) {
5965 parameter->base.parent_scope = scope;
5967 assert(parameter->base.parent_scope == NULL
5968 || parameter->base.parent_scope == scope);
5969 parameter->base.parent_scope = scope;
5970 if (parameter->base.symbol == NULL) {
5971 errorf(¶meter->base.source_position, "parameter name omitted");
5974 environment_push(parameter);
5977 if (function->statement != NULL) {
5978 parser_error_multiple_definition(entity, HERE);
5981 /* parse function body */
5982 int label_stack_top = label_top();
5983 function_t *old_current_function = current_function;
5984 current_function = function;
5985 current_parent = NULL;
5987 statement_t *const body = parse_compound_statement(false);
5988 function->statement = body;
5991 check_declarations();
5992 if (warning.return_type ||
5993 warning.unreachable_code ||
5994 (warning.missing_noreturn
5995 && !(function->base.modifiers & DM_NORETURN))) {
5996 noreturn_candidate = true;
5997 check_reachable(body);
5998 if (warning.unreachable_code)
5999 walk_statements(body, check_unreachable, NULL);
6000 if (warning.missing_noreturn &&
6001 noreturn_candidate &&
6002 !(function->base.modifiers & DM_NORETURN)) {
6003 warningf(&body->base.source_position,
6004 "function '%#T' is candidate for attribute 'noreturn'",
6005 type, entity->base.symbol);
6009 assert(current_parent == NULL);
6010 assert(current_function == function);
6011 current_function = old_current_function;
6012 label_pop_to(label_stack_top);
6015 assert(scope == &function->parameters);
6017 environment_pop_to(top);
6020 static type_t *make_bitfield_type(type_t *base_type, expression_t *size,
6021 source_position_t *source_position,
6022 const symbol_t *symbol)
6024 type_t *type = allocate_type_zero(TYPE_BITFIELD);
6026 type->bitfield.base_type = base_type;
6027 type->bitfield.size_expression = size;
6030 type_t *skipped_type = skip_typeref(base_type);
6031 if (!is_type_integer(skipped_type)) {
6032 errorf(HERE, "bitfield base type '%T' is not an integer type",
6036 bit_size = skipped_type->base.size * 8;
6039 if (is_constant_expression(size)) {
6040 long v = fold_constant(size);
6043 errorf(source_position, "negative width in bit-field '%Y'",
6045 } else if (v == 0) {
6046 errorf(source_position, "zero width for bit-field '%Y'",
6048 } else if (bit_size > 0 && (il_size_t)v > bit_size) {
6049 errorf(source_position, "width of '%Y' exceeds its type",
6052 type->bitfield.bit_size = v;
6059 static entity_t *find_compound_entry(compound_t *compound, symbol_t *symbol)
6061 entity_t *iter = compound->members.entities;
6062 for( ; iter != NULL; iter = iter->base.next) {
6063 if (iter->kind != ENTITY_COMPOUND_MEMBER)
6066 if (iter->base.symbol == NULL) {
6067 type_t *type = skip_typeref(iter->declaration.type);
6068 if (is_type_compound(type)) {
6070 = find_compound_entry(type->compound.compound, symbol);
6077 if (iter->base.symbol == symbol) {
6085 static void parse_compound_declarators(compound_t *compound,
6086 const declaration_specifiers_t *specifiers)
6091 if (token.type == ':') {
6092 source_position_t source_position = *HERE;
6095 type_t *base_type = specifiers->type;
6096 expression_t *size = parse_constant_expression();
6098 type_t *type = make_bitfield_type(base_type, size,
6099 &source_position, sym_anonymous);
6101 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER);
6102 entity->base.namespc = NAMESPACE_NORMAL;
6103 entity->base.source_position = source_position;
6104 entity->declaration.declared_storage_class = STORAGE_CLASS_NONE;
6105 entity->declaration.storage_class = STORAGE_CLASS_NONE;
6106 entity->declaration.modifiers = specifiers->modifiers;
6107 entity->declaration.type = type;
6109 entity = parse_declarator(specifiers,/*may_be_abstract=*/true, true);
6110 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
6112 if (token.type == ':') {
6113 source_position_t source_position = *HERE;
6115 expression_t *size = parse_constant_expression();
6117 type_t *type = entity->declaration.type;
6118 type_t *bitfield_type = make_bitfield_type(type, size,
6119 &source_position, entity->base.symbol);
6120 entity->declaration.type = bitfield_type;
6124 /* make sure we don't define a symbol multiple times */
6125 symbol_t *symbol = entity->base.symbol;
6126 if (symbol != NULL) {
6127 entity_t *prev = find_compound_entry(compound, symbol);
6130 assert(prev->base.symbol == symbol);
6131 errorf(&entity->base.source_position,
6132 "multiple declarations of symbol '%Y' (declared %P)",
6133 symbol, &prev->base.source_position);
6137 append_entity(&compound->members, entity);
6139 if (token.type != ',')
6149 static void semantic_compound(compound_t *compound)
6151 entity_t *entity = compound->members.entities;
6152 for ( ; entity != NULL; entity = entity->base.next) {
6153 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
6155 type_t *orig_type = entity->declaration.type;
6156 type_t *type = skip_typeref(orig_type);
6158 if (is_type_function(type)) {
6160 "compound member '%Y' must not have function type '%T'",
6161 entity->base.symbol, orig_type);
6162 } else if (is_type_incomplete(type)) {
6163 /* §6.7.2.1 (16) flexible array member */
6164 if (is_type_array(type) && entity->base.next == NULL) {
6165 compound->has_flexible_member = true;
6168 "compound member '%Y' has incomplete type '%T'",
6169 entity->base.symbol, orig_type);
6175 static void parse_compound_type_entries(compound_t *compound)
6178 add_anchor_token('}');
6180 while (token.type != '}') {
6181 if (token.type == T_EOF) {
6182 errorf(HERE, "EOF while parsing struct");
6185 declaration_specifiers_t specifiers;
6186 memset(&specifiers, 0, sizeof(specifiers));
6187 parse_declaration_specifiers(&specifiers);
6189 parse_compound_declarators(compound, &specifiers);
6191 semantic_compound(compound);
6192 rem_anchor_token('}');
6196 static type_t *parse_typename(void)
6198 declaration_specifiers_t specifiers;
6199 memset(&specifiers, 0, sizeof(specifiers));
6200 parse_declaration_specifiers(&specifiers);
6201 if (specifiers.storage_class != STORAGE_CLASS_NONE) {
6202 /* TODO: improve error message, user does probably not know what a
6203 * storage class is...
6205 errorf(HERE, "typename may not have a storage class");
6208 type_t *result = parse_abstract_declarator(specifiers.type);
6216 typedef expression_t* (*parse_expression_function)(void);
6217 typedef expression_t* (*parse_expression_infix_function)(expression_t *left);
6219 typedef struct expression_parser_function_t expression_parser_function_t;
6220 struct expression_parser_function_t {
6221 parse_expression_function parser;
6222 unsigned infix_precedence;
6223 parse_expression_infix_function infix_parser;
6226 expression_parser_function_t expression_parsers[T_LAST_TOKEN];
6229 * Prints an error message if an expression was expected but not read
6231 static expression_t *expected_expression_error(void)
6233 /* skip the error message if the error token was read */
6234 if (token.type != T_ERROR) {
6235 errorf(HERE, "expected expression, got token '%K'", &token);
6239 return create_invalid_expression();
6243 * Parse a string constant.
6245 static expression_t *parse_string_const(void)
6248 if (token.type == T_STRING_LITERAL) {
6249 string_t res = token.v.string;
6251 while (token.type == T_STRING_LITERAL) {
6252 res = concat_strings(&res, &token.v.string);
6255 if (token.type != T_WIDE_STRING_LITERAL) {
6256 expression_t *const cnst = allocate_expression_zero(EXPR_STRING_LITERAL);
6257 /* note: that we use type_char_ptr here, which is already the
6258 * automatic converted type. revert_automatic_type_conversion
6259 * will construct the array type */
6260 cnst->base.type = warning.write_strings ? type_const_char_ptr : type_char_ptr;
6261 cnst->string.value = res;
6265 wres = concat_string_wide_string(&res, &token.v.wide_string);
6267 wres = token.v.wide_string;
6272 switch (token.type) {
6273 case T_WIDE_STRING_LITERAL:
6274 wres = concat_wide_strings(&wres, &token.v.wide_string);
6277 case T_STRING_LITERAL:
6278 wres = concat_wide_string_string(&wres, &token.v.string);
6282 expression_t *const cnst = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
6283 cnst->base.type = warning.write_strings ? type_const_wchar_t_ptr : type_wchar_t_ptr;
6284 cnst->wide_string.value = wres;
6293 * Parse an integer constant.
6295 static expression_t *parse_int_const(void)
6297 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
6298 cnst->base.type = token.datatype;
6299 cnst->conste.v.int_value = token.v.intvalue;
6307 * Parse a character constant.
6309 static expression_t *parse_character_constant(void)
6311 expression_t *cnst = allocate_expression_zero(EXPR_CHARACTER_CONSTANT);
6312 cnst->base.type = token.datatype;
6313 cnst->conste.v.character = token.v.string;
6315 if (cnst->conste.v.character.size != 1) {
6316 if (warning.multichar && GNU_MODE) {
6317 warningf(HERE, "multi-character character constant");
6319 errorf(HERE, "more than 1 characters in character constant");
6328 * Parse a wide character constant.
6330 static expression_t *parse_wide_character_constant(void)
6332 expression_t *cnst = allocate_expression_zero(EXPR_WIDE_CHARACTER_CONSTANT);
6333 cnst->base.type = token.datatype;
6334 cnst->conste.v.wide_character = token.v.wide_string;
6336 if (cnst->conste.v.wide_character.size != 1) {
6337 if (warning.multichar && GNU_MODE) {
6338 warningf(HERE, "multi-character character constant");
6340 errorf(HERE, "more than 1 characters in character constant");
6349 * Parse a float constant.
6351 static expression_t *parse_float_const(void)
6353 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
6354 cnst->base.type = token.datatype;
6355 cnst->conste.v.float_value = token.v.floatvalue;
6362 static entity_t *create_implicit_function(symbol_t *symbol,
6363 const source_position_t *source_position)
6365 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
6366 ntype->function.return_type = type_int;
6367 ntype->function.unspecified_parameters = true;
6369 type_t *type = typehash_insert(ntype);
6370 if (type != ntype) {
6374 entity_t *entity = allocate_entity_zero(ENTITY_FUNCTION);
6375 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
6376 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
6377 entity->declaration.type = type;
6378 entity->declaration.implicit = true;
6379 entity->base.symbol = symbol;
6380 entity->base.source_position = *source_position;
6382 bool strict_prototypes_old = warning.strict_prototypes;
6383 warning.strict_prototypes = false;
6384 record_entity(entity, false);
6385 warning.strict_prototypes = strict_prototypes_old;
6391 * Creates a return_type (func)(argument_type) function type if not
6394 static type_t *make_function_2_type(type_t *return_type, type_t *argument_type1,
6395 type_t *argument_type2)
6397 function_parameter_t *parameter2
6398 = obstack_alloc(type_obst, sizeof(parameter2[0]));
6399 memset(parameter2, 0, sizeof(parameter2[0]));
6400 parameter2->type = argument_type2;
6402 function_parameter_t *parameter1
6403 = obstack_alloc(type_obst, sizeof(parameter1[0]));
6404 memset(parameter1, 0, sizeof(parameter1[0]));
6405 parameter1->type = argument_type1;
6406 parameter1->next = parameter2;
6408 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6409 type->function.return_type = return_type;
6410 type->function.parameters = parameter1;
6412 type_t *result = typehash_insert(type);
6413 if (result != type) {
6421 * Creates a return_type (func)(argument_type) function type if not
6424 * @param return_type the return type
6425 * @param argument_type the argument type
6427 static type_t *make_function_1_type(type_t *return_type, type_t *argument_type)
6429 function_parameter_t *parameter
6430 = obstack_alloc(type_obst, sizeof(parameter[0]));
6431 memset(parameter, 0, sizeof(parameter[0]));
6432 parameter->type = argument_type;
6434 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6435 type->function.return_type = return_type;
6436 type->function.parameters = parameter;
6438 type_t *result = typehash_insert(type);
6439 if (result != type) {
6446 static type_t *make_function_0_type(type_t *return_type)
6448 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6449 type->function.return_type = return_type;
6450 type->function.parameters = NULL;
6452 type_t *result = typehash_insert(type);
6453 if (result != type) {
6461 * Creates a function type for some function like builtins.
6463 * @param symbol the symbol describing the builtin
6465 static type_t *get_builtin_symbol_type(symbol_t *symbol)
6467 switch (symbol->ID) {
6468 case T___builtin_alloca:
6469 return make_function_1_type(type_void_ptr, type_size_t);
6470 case T___builtin_huge_val:
6471 return make_function_0_type(type_double);
6472 case T___builtin_inf:
6473 return make_function_0_type(type_double);
6474 case T___builtin_inff:
6475 return make_function_0_type(type_float);
6476 case T___builtin_infl:
6477 return make_function_0_type(type_long_double);
6478 case T___builtin_nan:
6479 return make_function_1_type(type_double, type_char_ptr);
6480 case T___builtin_nanf:
6481 return make_function_1_type(type_float, type_char_ptr);
6482 case T___builtin_nanl:
6483 return make_function_1_type(type_long_double, type_char_ptr);
6484 case T___builtin_va_end:
6485 return make_function_1_type(type_void, type_valist);
6486 case T___builtin_expect:
6487 return make_function_2_type(type_long, type_long, type_long);
6489 internal_errorf(HERE, "not implemented builtin symbol found");
6494 * Performs automatic type cast as described in § 6.3.2.1.
6496 * @param orig_type the original type
6498 static type_t *automatic_type_conversion(type_t *orig_type)
6500 type_t *type = skip_typeref(orig_type);
6501 if (is_type_array(type)) {
6502 array_type_t *array_type = &type->array;
6503 type_t *element_type = array_type->element_type;
6504 unsigned qualifiers = array_type->base.qualifiers;
6506 return make_pointer_type(element_type, qualifiers);
6509 if (is_type_function(type)) {
6510 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
6517 * reverts the automatic casts of array to pointer types and function
6518 * to function-pointer types as defined § 6.3.2.1
6520 type_t *revert_automatic_type_conversion(const expression_t *expression)
6522 switch (expression->kind) {
6523 case EXPR_REFERENCE: {
6524 entity_t *entity = expression->reference.entity;
6525 if (is_declaration(entity)) {
6526 return entity->declaration.type;
6527 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6528 return entity->enum_value.enum_type;
6530 panic("no declaration or enum in reference");
6535 entity_t *entity = expression->select.compound_entry;
6536 assert(is_declaration(entity));
6537 type_t *type = entity->declaration.type;
6538 return get_qualified_type(type,
6539 expression->base.type->base.qualifiers);
6542 case EXPR_UNARY_DEREFERENCE: {
6543 const expression_t *const value = expression->unary.value;
6544 type_t *const type = skip_typeref(value->base.type);
6545 assert(is_type_pointer(type));
6546 return type->pointer.points_to;
6549 case EXPR_BUILTIN_SYMBOL:
6550 return get_builtin_symbol_type(expression->builtin_symbol.symbol);
6552 case EXPR_ARRAY_ACCESS: {
6553 const expression_t *array_ref = expression->array_access.array_ref;
6554 type_t *type_left = skip_typeref(array_ref->base.type);
6555 if (!is_type_valid(type_left))
6557 assert(is_type_pointer(type_left));
6558 return type_left->pointer.points_to;
6561 case EXPR_STRING_LITERAL: {
6562 size_t size = expression->string.value.size;
6563 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
6566 case EXPR_WIDE_STRING_LITERAL: {
6567 size_t size = expression->wide_string.value.size;
6568 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
6571 case EXPR_COMPOUND_LITERAL:
6572 return expression->compound_literal.type;
6577 return expression->base.type;
6580 static expression_t *parse_reference(void)
6582 symbol_t *const symbol = token.v.symbol;
6584 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
6586 if (entity == NULL) {
6587 if (!strict_mode && look_ahead(1)->type == '(') {
6588 /* an implicitly declared function */
6589 if (warning.implicit_function_declaration) {
6590 warningf(HERE, "implicit declaration of function '%Y'",
6594 entity = create_implicit_function(symbol, HERE);
6596 errorf(HERE, "unknown symbol '%Y' found.", symbol);
6597 entity = create_error_entity(symbol, ENTITY_VARIABLE);
6603 if (is_declaration(entity)) {
6604 orig_type = entity->declaration.type;
6605 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6606 orig_type = entity->enum_value.enum_type;
6608 panic("expected declaration or enum value in reference");
6611 /* we always do the auto-type conversions; the & and sizeof parser contains
6612 * code to revert this! */
6613 type_t *type = automatic_type_conversion(orig_type);
6615 expression_kind_t kind = EXPR_REFERENCE;
6616 if (entity->kind == ENTITY_ENUM_VALUE)
6617 kind = EXPR_REFERENCE_ENUM_VALUE;
6619 expression_t *expression = allocate_expression_zero(kind);
6620 expression->reference.entity = entity;
6621 expression->base.type = type;
6623 /* this declaration is used */
6624 if (is_declaration(entity)) {
6625 entity->declaration.used = true;
6628 if (entity->base.parent_scope != file_scope
6629 && entity->base.parent_scope->depth < current_function->parameters.depth
6630 && is_type_valid(orig_type) && !is_type_function(orig_type)) {
6631 if (entity->kind == ENTITY_VARIABLE) {
6632 /* access of a variable from an outer function */
6633 entity->variable.address_taken = true;
6635 current_function->need_closure = true;
6638 /* check for deprecated functions */
6639 if (warning.deprecated_declarations
6640 && is_declaration(entity)
6641 && entity->declaration.modifiers & DM_DEPRECATED) {
6642 declaration_t *declaration = &entity->declaration;
6644 char const *const prefix = entity->kind == ENTITY_FUNCTION ?
6645 "function" : "variable";
6647 if (declaration->deprecated_string != NULL) {
6648 warningf(HERE, "%s '%Y' is deprecated (declared %P): \"%s\"",
6649 prefix, entity->base.symbol, &entity->base.source_position,
6650 declaration->deprecated_string);
6652 warningf(HERE, "%s '%Y' is deprecated (declared %P)", prefix,
6653 entity->base.symbol, &entity->base.source_position);
6657 if (warning.init_self && entity == current_init_decl && !in_type_prop
6658 && entity->kind == ENTITY_VARIABLE) {
6659 current_init_decl = NULL;
6660 warningf(HERE, "variable '%#T' is initialized by itself",
6661 entity->declaration.type, entity->base.symbol);
6668 static bool semantic_cast(expression_t *cast)
6670 expression_t *expression = cast->unary.value;
6671 type_t *orig_dest_type = cast->base.type;
6672 type_t *orig_type_right = expression->base.type;
6673 type_t const *dst_type = skip_typeref(orig_dest_type);
6674 type_t const *src_type = skip_typeref(orig_type_right);
6675 source_position_t const *pos = &cast->base.source_position;
6677 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
6678 if (dst_type == type_void)
6681 /* only integer and pointer can be casted to pointer */
6682 if (is_type_pointer(dst_type) &&
6683 !is_type_pointer(src_type) &&
6684 !is_type_integer(src_type) &&
6685 is_type_valid(src_type)) {
6686 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
6690 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
6691 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
6695 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
6696 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
6700 if (warning.cast_qual &&
6701 is_type_pointer(src_type) &&
6702 is_type_pointer(dst_type)) {
6703 type_t *src = skip_typeref(src_type->pointer.points_to);
6704 type_t *dst = skip_typeref(dst_type->pointer.points_to);
6705 unsigned missing_qualifiers =
6706 src->base.qualifiers & ~dst->base.qualifiers;
6707 if (missing_qualifiers != 0) {
6709 "cast discards qualifiers '%Q' in pointer target type of '%T'",
6710 missing_qualifiers, orig_type_right);
6716 static expression_t *parse_compound_literal(type_t *type)
6718 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
6720 parse_initializer_env_t env;
6723 env.must_be_constant = false;
6724 initializer_t *initializer = parse_initializer(&env);
6727 expression->compound_literal.initializer = initializer;
6728 expression->compound_literal.type = type;
6729 expression->base.type = automatic_type_conversion(type);
6735 * Parse a cast expression.
6737 static expression_t *parse_cast(void)
6739 add_anchor_token(')');
6741 source_position_t source_position = token.source_position;
6743 type_t *type = parse_typename();
6745 rem_anchor_token(')');
6748 if (token.type == '{') {
6749 return parse_compound_literal(type);
6752 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
6753 cast->base.source_position = source_position;
6755 expression_t *value = parse_sub_expression(PREC_CAST);
6756 cast->base.type = type;
6757 cast->unary.value = value;
6759 if (! semantic_cast(cast)) {
6760 /* TODO: record the error in the AST. else it is impossible to detect it */
6765 return create_invalid_expression();
6769 * Parse a statement expression.
6771 static expression_t *parse_statement_expression(void)
6773 add_anchor_token(')');
6775 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6777 statement_t *statement = parse_compound_statement(true);
6778 expression->statement.statement = statement;
6780 /* find last statement and use its type */
6781 type_t *type = type_void;
6782 const statement_t *stmt = statement->compound.statements;
6784 while (stmt->base.next != NULL)
6785 stmt = stmt->base.next;
6787 if (stmt->kind == STATEMENT_EXPRESSION) {
6788 type = stmt->expression.expression->base.type;
6790 } else if (warning.other) {
6791 warningf(&expression->base.source_position, "empty statement expression ({})");
6793 expression->base.type = type;
6795 rem_anchor_token(')');
6803 * Parse a parenthesized expression.
6805 static expression_t *parse_parenthesized_expression(void)
6809 switch (token.type) {
6811 /* gcc extension: a statement expression */
6812 return parse_statement_expression();
6816 return parse_cast();
6818 if (is_typedef_symbol(token.v.symbol)) {
6819 return parse_cast();
6823 add_anchor_token(')');
6824 expression_t *result = parse_expression();
6825 rem_anchor_token(')');
6832 static expression_t *parse_function_keyword(void)
6836 if (current_function == NULL) {
6837 errorf(HERE, "'__func__' used outside of a function");
6840 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6841 expression->base.type = type_char_ptr;
6842 expression->funcname.kind = FUNCNAME_FUNCTION;
6849 static expression_t *parse_pretty_function_keyword(void)
6851 if (current_function == NULL) {
6852 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
6855 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6856 expression->base.type = type_char_ptr;
6857 expression->funcname.kind = FUNCNAME_PRETTY_FUNCTION;
6859 eat(T___PRETTY_FUNCTION__);
6864 static expression_t *parse_funcsig_keyword(void)
6866 if (current_function == NULL) {
6867 errorf(HERE, "'__FUNCSIG__' used outside of a function");
6870 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6871 expression->base.type = type_char_ptr;
6872 expression->funcname.kind = FUNCNAME_FUNCSIG;
6879 static expression_t *parse_funcdname_keyword(void)
6881 if (current_function == NULL) {
6882 errorf(HERE, "'__FUNCDNAME__' used outside of a function");
6885 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6886 expression->base.type = type_char_ptr;
6887 expression->funcname.kind = FUNCNAME_FUNCDNAME;
6889 eat(T___FUNCDNAME__);
6894 static designator_t *parse_designator(void)
6896 designator_t *result = allocate_ast_zero(sizeof(result[0]));
6897 result->source_position = *HERE;
6899 if (token.type != T_IDENTIFIER) {
6900 parse_error_expected("while parsing member designator",
6901 T_IDENTIFIER, NULL);
6904 result->symbol = token.v.symbol;
6907 designator_t *last_designator = result;
6909 if (token.type == '.') {
6911 if (token.type != T_IDENTIFIER) {
6912 parse_error_expected("while parsing member designator",
6913 T_IDENTIFIER, NULL);
6916 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6917 designator->source_position = *HERE;
6918 designator->symbol = token.v.symbol;
6921 last_designator->next = designator;
6922 last_designator = designator;
6925 if (token.type == '[') {
6927 add_anchor_token(']');
6928 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6929 designator->source_position = *HERE;
6930 designator->array_index = parse_expression();
6931 rem_anchor_token(']');
6933 if (designator->array_index == NULL) {
6937 last_designator->next = designator;
6938 last_designator = designator;
6950 * Parse the __builtin_offsetof() expression.
6952 static expression_t *parse_offsetof(void)
6954 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6955 expression->base.type = type_size_t;
6957 eat(T___builtin_offsetof);
6960 add_anchor_token(',');
6961 type_t *type = parse_typename();
6962 rem_anchor_token(',');
6964 add_anchor_token(')');
6965 designator_t *designator = parse_designator();
6966 rem_anchor_token(')');
6969 expression->offsetofe.type = type;
6970 expression->offsetofe.designator = designator;
6973 memset(&path, 0, sizeof(path));
6974 path.top_type = type;
6975 path.path = NEW_ARR_F(type_path_entry_t, 0);
6977 descend_into_subtype(&path);
6979 if (!walk_designator(&path, designator, true)) {
6980 return create_invalid_expression();
6983 DEL_ARR_F(path.path);
6987 return create_invalid_expression();
6991 * Parses a _builtin_va_start() expression.
6993 static expression_t *parse_va_start(void)
6995 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6997 eat(T___builtin_va_start);
7000 add_anchor_token(',');
7001 expression->va_starte.ap = parse_assignment_expression();
7002 rem_anchor_token(',');
7004 expression_t *const expr = parse_assignment_expression();
7005 if (expr->kind == EXPR_REFERENCE) {
7006 entity_t *const entity = expr->reference.entity;
7007 if (entity->base.parent_scope != ¤t_function->parameters
7008 || entity->base.next != NULL
7009 || entity->kind != ENTITY_VARIABLE) {
7010 errorf(&expr->base.source_position,
7011 "second argument of 'va_start' must be last parameter of the current function");
7013 expression->va_starte.parameter = &entity->variable;
7020 return create_invalid_expression();
7024 * Parses a _builtin_va_arg() expression.
7026 static expression_t *parse_va_arg(void)
7028 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
7030 eat(T___builtin_va_arg);
7033 expression->va_arge.ap = parse_assignment_expression();
7035 expression->base.type = parse_typename();
7040 return create_invalid_expression();
7043 static expression_t *parse_builtin_symbol(void)
7045 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_SYMBOL);
7047 symbol_t *symbol = token.v.symbol;
7049 expression->builtin_symbol.symbol = symbol;
7052 type_t *type = get_builtin_symbol_type(symbol);
7053 type = automatic_type_conversion(type);
7055 expression->base.type = type;
7060 * Parses a __builtin_constant() expression.
7062 static expression_t *parse_builtin_constant(void)
7064 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
7066 eat(T___builtin_constant_p);
7069 add_anchor_token(')');
7070 expression->builtin_constant.value = parse_assignment_expression();
7071 rem_anchor_token(')');
7073 expression->base.type = type_int;
7077 return create_invalid_expression();
7081 * Parses a __builtin_prefetch() expression.
7083 static expression_t *parse_builtin_prefetch(void)
7085 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_PREFETCH);
7087 eat(T___builtin_prefetch);
7090 add_anchor_token(')');
7091 expression->builtin_prefetch.adr = parse_assignment_expression();
7092 if (token.type == ',') {
7094 expression->builtin_prefetch.rw = parse_assignment_expression();
7096 if (token.type == ',') {
7098 expression->builtin_prefetch.locality = parse_assignment_expression();
7100 rem_anchor_token(')');
7102 expression->base.type = type_void;
7106 return create_invalid_expression();
7110 * Parses a __builtin_is_*() compare expression.
7112 static expression_t *parse_compare_builtin(void)
7114 expression_t *expression;
7116 switch (token.type) {
7117 case T___builtin_isgreater:
7118 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
7120 case T___builtin_isgreaterequal:
7121 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
7123 case T___builtin_isless:
7124 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
7126 case T___builtin_islessequal:
7127 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
7129 case T___builtin_islessgreater:
7130 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
7132 case T___builtin_isunordered:
7133 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
7136 internal_errorf(HERE, "invalid compare builtin found");
7138 expression->base.source_position = *HERE;
7142 expression->binary.left = parse_assignment_expression();
7144 expression->binary.right = parse_assignment_expression();
7147 type_t *const orig_type_left = expression->binary.left->base.type;
7148 type_t *const orig_type_right = expression->binary.right->base.type;
7150 type_t *const type_left = skip_typeref(orig_type_left);
7151 type_t *const type_right = skip_typeref(orig_type_right);
7152 if (!is_type_float(type_left) && !is_type_float(type_right)) {
7153 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7154 type_error_incompatible("invalid operands in comparison",
7155 &expression->base.source_position, orig_type_left, orig_type_right);
7158 semantic_comparison(&expression->binary);
7163 return create_invalid_expression();
7168 * Parses a __builtin_expect() expression.
7170 static expression_t *parse_builtin_expect(void)
7172 expression_t *expression
7173 = allocate_expression_zero(EXPR_BINARY_BUILTIN_EXPECT);
7175 eat(T___builtin_expect);
7178 expression->binary.left = parse_assignment_expression();
7180 expression->binary.right = parse_constant_expression();
7183 expression->base.type = expression->binary.left->base.type;
7187 return create_invalid_expression();
7192 * Parses a MS assume() expression.
7194 static expression_t *parse_assume(void)
7196 expression_t *expression = allocate_expression_zero(EXPR_UNARY_ASSUME);
7201 add_anchor_token(')');
7202 expression->unary.value = parse_assignment_expression();
7203 rem_anchor_token(')');
7206 expression->base.type = type_void;
7209 return create_invalid_expression();
7213 * Return the declaration for a given label symbol or create a new one.
7215 * @param symbol the symbol of the label
7217 static label_t *get_label(symbol_t *symbol)
7220 assert(current_function != NULL);
7222 label = get_entity(symbol, NAMESPACE_LOCAL_LABEL);
7223 /* if we found a local label, we already created the declaration */
7224 if (label != NULL && label->kind == ENTITY_LOCAL_LABEL) {
7225 if (label->base.parent_scope != scope) {
7226 assert(label->base.parent_scope->depth < scope->depth);
7227 current_function->goto_to_outer = true;
7229 return &label->label;
7232 label = get_entity(symbol, NAMESPACE_LABEL);
7233 /* if we found a label in the same function, then we already created the
7236 && label->base.parent_scope == ¤t_function->parameters) {
7237 return &label->label;
7240 /* otherwise we need to create a new one */
7241 label = allocate_entity_zero(ENTITY_LABEL);
7242 label->base.namespc = NAMESPACE_LABEL;
7243 label->base.symbol = symbol;
7247 return &label->label;
7251 * Parses a GNU && label address expression.
7253 static expression_t *parse_label_address(void)
7255 source_position_t source_position = token.source_position;
7257 if (token.type != T_IDENTIFIER) {
7258 parse_error_expected("while parsing label address", T_IDENTIFIER, NULL);
7261 symbol_t *symbol = token.v.symbol;
7264 label_t *label = get_label(symbol);
7266 label->address_taken = true;
7268 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
7269 expression->base.source_position = source_position;
7271 /* label address is threaten as a void pointer */
7272 expression->base.type = type_void_ptr;
7273 expression->label_address.label = label;
7276 return create_invalid_expression();
7280 * Parse a microsoft __noop expression.
7282 static expression_t *parse_noop_expression(void)
7284 /* the result is a (int)0 */
7285 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
7286 cnst->base.type = type_int;
7287 cnst->conste.v.int_value = 0;
7288 cnst->conste.is_ms_noop = true;
7292 if (token.type == '(') {
7293 /* parse arguments */
7295 add_anchor_token(')');
7296 add_anchor_token(',');
7298 if (token.type != ')') {
7300 (void)parse_assignment_expression();
7301 if (token.type != ',')
7307 rem_anchor_token(',');
7308 rem_anchor_token(')');
7316 * Parses a primary expression.
7318 static expression_t *parse_primary_expression(void)
7320 switch (token.type) {
7321 case T_INTEGER: return parse_int_const();
7322 case T_CHARACTER_CONSTANT: return parse_character_constant();
7323 case T_WIDE_CHARACTER_CONSTANT: return parse_wide_character_constant();
7324 case T_FLOATINGPOINT: return parse_float_const();
7325 case T_STRING_LITERAL:
7326 case T_WIDE_STRING_LITERAL: return parse_string_const();
7327 case T_IDENTIFIER: return parse_reference();
7328 case T___FUNCTION__:
7329 case T___func__: return parse_function_keyword();
7330 case T___PRETTY_FUNCTION__: return parse_pretty_function_keyword();
7331 case T___FUNCSIG__: return parse_funcsig_keyword();
7332 case T___FUNCDNAME__: return parse_funcdname_keyword();
7333 case T___builtin_offsetof: return parse_offsetof();
7334 case T___builtin_va_start: return parse_va_start();
7335 case T___builtin_va_arg: return parse_va_arg();
7336 case T___builtin_expect:
7337 case T___builtin_alloca:
7338 case T___builtin_inf:
7339 case T___builtin_inff:
7340 case T___builtin_infl:
7341 case T___builtin_nan:
7342 case T___builtin_nanf:
7343 case T___builtin_nanl:
7344 case T___builtin_huge_val:
7345 case T___builtin_va_end: return parse_builtin_symbol();
7346 case T___builtin_isgreater:
7347 case T___builtin_isgreaterequal:
7348 case T___builtin_isless:
7349 case T___builtin_islessequal:
7350 case T___builtin_islessgreater:
7351 case T___builtin_isunordered: return parse_compare_builtin();
7352 case T___builtin_constant_p: return parse_builtin_constant();
7353 case T___builtin_prefetch: return parse_builtin_prefetch();
7354 case T__assume: return parse_assume();
7357 return parse_label_address();
7360 case '(': return parse_parenthesized_expression();
7361 case T___noop: return parse_noop_expression();
7364 errorf(HERE, "unexpected token %K, expected an expression", &token);
7365 return create_invalid_expression();
7369 * Check if the expression has the character type and issue a warning then.
7371 static void check_for_char_index_type(const expression_t *expression)
7373 type_t *const type = expression->base.type;
7374 const type_t *const base_type = skip_typeref(type);
7376 if (is_type_atomic(base_type, ATOMIC_TYPE_CHAR) &&
7377 warning.char_subscripts) {
7378 warningf(&expression->base.source_position,
7379 "array subscript has type '%T'", type);
7383 static expression_t *parse_array_expression(expression_t *left)
7385 expression_t *expression = allocate_expression_zero(EXPR_ARRAY_ACCESS);
7388 add_anchor_token(']');
7390 expression_t *inside = parse_expression();
7392 type_t *const orig_type_left = left->base.type;
7393 type_t *const orig_type_inside = inside->base.type;
7395 type_t *const type_left = skip_typeref(orig_type_left);
7396 type_t *const type_inside = skip_typeref(orig_type_inside);
7398 type_t *return_type;
7399 array_access_expression_t *array_access = &expression->array_access;
7400 if (is_type_pointer(type_left)) {
7401 return_type = type_left->pointer.points_to;
7402 array_access->array_ref = left;
7403 array_access->index = inside;
7404 check_for_char_index_type(inside);
7405 } else if (is_type_pointer(type_inside)) {
7406 return_type = type_inside->pointer.points_to;
7407 array_access->array_ref = inside;
7408 array_access->index = left;
7409 array_access->flipped = true;
7410 check_for_char_index_type(left);
7412 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
7414 "array access on object with non-pointer types '%T', '%T'",
7415 orig_type_left, orig_type_inside);
7417 return_type = type_error_type;
7418 array_access->array_ref = left;
7419 array_access->index = inside;
7422 expression->base.type = automatic_type_conversion(return_type);
7424 rem_anchor_token(']');
7430 static expression_t *parse_typeprop(expression_kind_t const kind)
7432 expression_t *tp_expression = allocate_expression_zero(kind);
7433 tp_expression->base.type = type_size_t;
7435 eat(kind == EXPR_SIZEOF ? T_sizeof : T___alignof__);
7437 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7439 /* we only refer to a type property, mark this case */
7440 bool old = in_type_prop;
7441 in_type_prop = true;
7444 expression_t *expression;
7445 if (token.type == '(' && is_declaration_specifier(look_ahead(1), true)) {
7447 add_anchor_token(')');
7448 orig_type = parse_typename();
7449 rem_anchor_token(')');
7452 if (token.type == '{') {
7453 /* It was not sizeof(type) after all. It is sizeof of an expression
7454 * starting with a compound literal */
7455 expression = parse_compound_literal(orig_type);
7456 goto typeprop_expression;
7459 expression = parse_sub_expression(PREC_UNARY);
7461 typeprop_expression:
7462 tp_expression->typeprop.tp_expression = expression;
7464 orig_type = revert_automatic_type_conversion(expression);
7465 expression->base.type = orig_type;
7468 tp_expression->typeprop.type = orig_type;
7469 type_t const* const type = skip_typeref(orig_type);
7470 char const* const wrong_type =
7471 is_type_incomplete(type) ? "incomplete" :
7472 type->kind == TYPE_FUNCTION ? "function designator" :
7473 type->kind == TYPE_BITFIELD ? "bitfield" :
7475 if (wrong_type != NULL) {
7476 errorf(&tp_expression->base.source_position,
7477 "operand of %s expression must not be of %s type '%T'",
7478 what, wrong_type, orig_type);
7483 return tp_expression;
7486 static expression_t *parse_sizeof(void)
7488 return parse_typeprop(EXPR_SIZEOF);
7491 static expression_t *parse_alignof(void)
7493 return parse_typeprop(EXPR_ALIGNOF);
7496 static expression_t *parse_select_expression(expression_t *compound)
7498 expression_t *select = allocate_expression_zero(EXPR_SELECT);
7499 select->select.compound = compound;
7501 assert(token.type == '.' || token.type == T_MINUSGREATER);
7502 bool is_pointer = (token.type == T_MINUSGREATER);
7505 if (token.type != T_IDENTIFIER) {
7506 parse_error_expected("while parsing select", T_IDENTIFIER, NULL);
7509 symbol_t *symbol = token.v.symbol;
7512 type_t *const orig_type = compound->base.type;
7513 type_t *const type = skip_typeref(orig_type);
7516 bool saw_error = false;
7517 if (is_type_pointer(type)) {
7520 "request for member '%Y' in something not a struct or union, but '%T'",
7524 type_left = skip_typeref(type->pointer.points_to);
7526 if (is_pointer && is_type_valid(type)) {
7527 errorf(HERE, "left hand side of '->' is not a pointer, but '%T'", orig_type);
7534 if (type_left->kind == TYPE_COMPOUND_STRUCT ||
7535 type_left->kind == TYPE_COMPOUND_UNION) {
7536 compound_t *compound = type_left->compound.compound;
7538 if (!compound->complete) {
7539 errorf(HERE, "request for member '%Y' of incomplete type '%T'",
7541 goto create_error_entry;
7544 entry = find_compound_entry(compound, symbol);
7545 if (entry == NULL) {
7546 errorf(HERE, "'%T' has no member named '%Y'", orig_type, symbol);
7547 goto create_error_entry;
7550 if (is_type_valid(type_left) && !saw_error) {
7552 "request for member '%Y' in something not a struct or union, but '%T'",
7556 return create_invalid_expression();
7559 assert(is_declaration(entry));
7560 select->select.compound_entry = entry;
7562 type_t *entry_type = entry->declaration.type;
7564 = get_qualified_type(entry_type, type_left->base.qualifiers);
7566 /* we always do the auto-type conversions; the & and sizeof parser contains
7567 * code to revert this! */
7568 select->base.type = automatic_type_conversion(res_type);
7570 type_t *skipped = skip_typeref(res_type);
7571 if (skipped->kind == TYPE_BITFIELD) {
7572 select->base.type = skipped->bitfield.base_type;
7578 static void check_call_argument(const function_parameter_t *parameter,
7579 call_argument_t *argument, unsigned pos)
7581 type_t *expected_type = parameter->type;
7582 type_t *expected_type_skip = skip_typeref(expected_type);
7583 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
7584 expression_t *arg_expr = argument->expression;
7585 type_t *arg_type = skip_typeref(arg_expr->base.type);
7587 /* handle transparent union gnu extension */
7588 if (is_type_union(expected_type_skip)
7589 && (expected_type_skip->base.modifiers
7590 & TYPE_MODIFIER_TRANSPARENT_UNION)) {
7591 compound_t *union_decl = expected_type_skip->compound.compound;
7592 type_t *best_type = NULL;
7593 entity_t *entry = union_decl->members.entities;
7594 for ( ; entry != NULL; entry = entry->base.next) {
7595 assert(is_declaration(entry));
7596 type_t *decl_type = entry->declaration.type;
7597 error = semantic_assign(decl_type, arg_expr);
7598 if (error == ASSIGN_ERROR_INCOMPATIBLE
7599 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
7602 if (error == ASSIGN_SUCCESS) {
7603 best_type = decl_type;
7604 } else if (best_type == NULL) {
7605 best_type = decl_type;
7609 if (best_type != NULL) {
7610 expected_type = best_type;
7614 error = semantic_assign(expected_type, arg_expr);
7615 argument->expression = create_implicit_cast(argument->expression,
7618 if (error != ASSIGN_SUCCESS) {
7619 /* report exact scope in error messages (like "in argument 3") */
7621 snprintf(buf, sizeof(buf), "call argument %u", pos);
7622 report_assign_error(error, expected_type, arg_expr, buf,
7623 &arg_expr->base.source_position);
7624 } else if (warning.traditional || warning.conversion) {
7625 type_t *const promoted_type = get_default_promoted_type(arg_type);
7626 if (!types_compatible(expected_type_skip, promoted_type) &&
7627 !types_compatible(expected_type_skip, type_void_ptr) &&
7628 !types_compatible(type_void_ptr, promoted_type)) {
7629 /* Deliberately show the skipped types in this warning */
7630 warningf(&arg_expr->base.source_position,
7631 "passing call argument %u as '%T' rather than '%T' due to prototype",
7632 pos, expected_type_skip, promoted_type);
7638 * Parse a call expression, ie. expression '( ... )'.
7640 * @param expression the function address
7642 static expression_t *parse_call_expression(expression_t *expression)
7644 expression_t *result = allocate_expression_zero(EXPR_CALL);
7645 call_expression_t *call = &result->call;
7646 call->function = expression;
7648 type_t *const orig_type = expression->base.type;
7649 type_t *const type = skip_typeref(orig_type);
7651 function_type_t *function_type = NULL;
7652 if (is_type_pointer(type)) {
7653 type_t *const to_type = skip_typeref(type->pointer.points_to);
7655 if (is_type_function(to_type)) {
7656 function_type = &to_type->function;
7657 call->base.type = function_type->return_type;
7661 if (function_type == NULL && is_type_valid(type)) {
7662 errorf(HERE, "called object '%E' (type '%T') is not a pointer to a function", expression, orig_type);
7665 /* parse arguments */
7667 add_anchor_token(')');
7668 add_anchor_token(',');
7670 if (token.type != ')') {
7671 call_argument_t *last_argument = NULL;
7674 call_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
7676 argument->expression = parse_assignment_expression();
7677 if (last_argument == NULL) {
7678 call->arguments = argument;
7680 last_argument->next = argument;
7682 last_argument = argument;
7684 if (token.type != ',')
7689 rem_anchor_token(',');
7690 rem_anchor_token(')');
7693 if (function_type == NULL)
7696 function_parameter_t *parameter = function_type->parameters;
7697 call_argument_t *argument = call->arguments;
7698 if (!function_type->unspecified_parameters) {
7699 for (unsigned pos = 0; parameter != NULL && argument != NULL;
7700 parameter = parameter->next, argument = argument->next) {
7701 check_call_argument(parameter, argument, ++pos);
7704 if (parameter != NULL) {
7705 errorf(HERE, "too few arguments to function '%E'", expression);
7706 } else if (argument != NULL && !function_type->variadic) {
7707 errorf(HERE, "too many arguments to function '%E'", expression);
7711 /* do default promotion */
7712 for( ; argument != NULL; argument = argument->next) {
7713 type_t *type = argument->expression->base.type;
7715 type = get_default_promoted_type(type);
7717 argument->expression
7718 = create_implicit_cast(argument->expression, type);
7721 check_format(&result->call);
7723 if (warning.aggregate_return &&
7724 is_type_compound(skip_typeref(function_type->return_type))) {
7725 warningf(&result->base.source_position,
7726 "function call has aggregate value");
7733 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
7735 static bool same_compound_type(const type_t *type1, const type_t *type2)
7738 is_type_compound(type1) &&
7739 type1->kind == type2->kind &&
7740 type1->compound.compound == type2->compound.compound;
7744 * Parse a conditional expression, ie. 'expression ? ... : ...'.
7746 * @param expression the conditional expression
7748 static expression_t *parse_conditional_expression(expression_t *expression)
7750 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
7752 conditional_expression_t *conditional = &result->conditional;
7753 conditional->condition = expression;
7756 add_anchor_token(':');
7759 type_t *const condition_type_orig = expression->base.type;
7760 type_t *const condition_type = skip_typeref(condition_type_orig);
7761 if (!is_type_scalar(condition_type) && is_type_valid(condition_type)) {
7762 type_error("expected a scalar type in conditional condition",
7763 &expression->base.source_position, condition_type_orig);
7766 expression_t *true_expression = expression;
7767 bool gnu_cond = false;
7768 if (GNU_MODE && token.type == ':') {
7771 true_expression = parse_expression();
7773 rem_anchor_token(':');
7775 expression_t *false_expression =
7776 parse_sub_expression(c_mode & _CXX ? PREC_ASSIGNMENT : PREC_CONDITIONAL);
7778 type_t *const orig_true_type = true_expression->base.type;
7779 type_t *const orig_false_type = false_expression->base.type;
7780 type_t *const true_type = skip_typeref(orig_true_type);
7781 type_t *const false_type = skip_typeref(orig_false_type);
7784 type_t *result_type;
7785 if (is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7786 is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
7787 /* ISO/IEC 14882:1998(E) §5.16:2 */
7788 if (true_expression->kind == EXPR_UNARY_THROW) {
7789 result_type = false_type;
7790 } else if (false_expression->kind == EXPR_UNARY_THROW) {
7791 result_type = true_type;
7793 if (warning.other && (
7794 !is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7795 !is_type_atomic(false_type, ATOMIC_TYPE_VOID)
7797 warningf(&conditional->base.source_position,
7798 "ISO C forbids conditional expression with only one void side");
7800 result_type = type_void;
7802 } else if (is_type_arithmetic(true_type)
7803 && is_type_arithmetic(false_type)) {
7804 result_type = semantic_arithmetic(true_type, false_type);
7806 true_expression = create_implicit_cast(true_expression, result_type);
7807 false_expression = create_implicit_cast(false_expression, result_type);
7809 conditional->true_expression = true_expression;
7810 conditional->false_expression = false_expression;
7811 conditional->base.type = result_type;
7812 } else if (same_compound_type(true_type, false_type)) {
7813 /* just take 1 of the 2 types */
7814 result_type = true_type;
7815 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
7816 type_t *pointer_type;
7818 expression_t *other_expression;
7819 if (is_type_pointer(true_type) &&
7820 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
7821 pointer_type = true_type;
7822 other_type = false_type;
7823 other_expression = false_expression;
7825 pointer_type = false_type;
7826 other_type = true_type;
7827 other_expression = true_expression;
7830 if (is_null_pointer_constant(other_expression)) {
7831 result_type = pointer_type;
7832 } else if (is_type_pointer(other_type)) {
7833 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
7834 type_t *to2 = skip_typeref(other_type->pointer.points_to);
7837 if (is_type_atomic(to1, ATOMIC_TYPE_VOID) ||
7838 is_type_atomic(to2, ATOMIC_TYPE_VOID)) {
7840 } else if (types_compatible(get_unqualified_type(to1),
7841 get_unqualified_type(to2))) {
7844 if (warning.other) {
7845 warningf(&conditional->base.source_position,
7846 "pointer types '%T' and '%T' in conditional expression are incompatible",
7847 true_type, false_type);
7852 type_t *const type =
7853 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
7854 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7855 } else if (is_type_integer(other_type)) {
7856 if (warning.other) {
7857 warningf(&conditional->base.source_position,
7858 "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7860 result_type = pointer_type;
7862 if (is_type_valid(other_type)) {
7863 type_error_incompatible("while parsing conditional",
7864 &expression->base.source_position, true_type, false_type);
7866 result_type = type_error_type;
7869 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7870 type_error_incompatible("while parsing conditional",
7871 &conditional->base.source_position, true_type,
7874 result_type = type_error_type;
7877 conditional->true_expression
7878 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7879 conditional->false_expression
7880 = create_implicit_cast(false_expression, result_type);
7881 conditional->base.type = result_type;
7884 return create_invalid_expression();
7888 * Parse an extension expression.
7890 static expression_t *parse_extension(void)
7892 eat(T___extension__);
7894 bool old_gcc_extension = in_gcc_extension;
7895 in_gcc_extension = true;
7896 expression_t *expression = parse_sub_expression(PREC_UNARY);
7897 in_gcc_extension = old_gcc_extension;
7902 * Parse a __builtin_classify_type() expression.
7904 static expression_t *parse_builtin_classify_type(void)
7906 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7907 result->base.type = type_int;
7909 eat(T___builtin_classify_type);
7912 add_anchor_token(')');
7913 expression_t *expression = parse_expression();
7914 rem_anchor_token(')');
7916 result->classify_type.type_expression = expression;
7920 return create_invalid_expression();
7924 * Parse a delete expression
7925 * ISO/IEC 14882:1998(E) §5.3.5
7927 static expression_t *parse_delete(void)
7929 expression_t *const result = allocate_expression_zero(EXPR_UNARY_DELETE);
7930 result->base.type = type_void;
7934 if (token.type == '[') {
7936 result->kind = EXPR_UNARY_DELETE_ARRAY;
7941 expression_t *const value = parse_sub_expression(PREC_CAST);
7942 result->unary.value = value;
7944 type_t *const type = skip_typeref(value->base.type);
7945 if (!is_type_pointer(type)) {
7946 errorf(&value->base.source_position,
7947 "operand of delete must have pointer type");
7948 } else if (warning.other &&
7949 is_type_atomic(skip_typeref(type->pointer.points_to), ATOMIC_TYPE_VOID)) {
7950 warningf(&value->base.source_position,
7951 "deleting 'void*' is undefined");
7958 * Parse a throw expression
7959 * ISO/IEC 14882:1998(E) §15:1
7961 static expression_t *parse_throw(void)
7963 expression_t *const result = allocate_expression_zero(EXPR_UNARY_THROW);
7964 result->base.type = type_void;
7968 expression_t *value = NULL;
7969 switch (token.type) {
7971 value = parse_assignment_expression();
7972 /* ISO/IEC 14882:1998(E) §15.1:3 */
7973 type_t *const orig_type = value->base.type;
7974 type_t *const type = skip_typeref(orig_type);
7975 if (is_type_incomplete(type)) {
7976 errorf(&value->base.source_position,
7977 "cannot throw object of incomplete type '%T'", orig_type);
7978 } else if (is_type_pointer(type)) {
7979 type_t *const points_to = skip_typeref(type->pointer.points_to);
7980 if (is_type_incomplete(points_to) &&
7981 !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7982 errorf(&value->base.source_position,
7983 "cannot throw pointer to incomplete type '%T'", orig_type);
7991 result->unary.value = value;
7996 static bool check_pointer_arithmetic(const source_position_t *source_position,
7997 type_t *pointer_type,
7998 type_t *orig_pointer_type)
8000 type_t *points_to = pointer_type->pointer.points_to;
8001 points_to = skip_typeref(points_to);
8003 if (is_type_incomplete(points_to)) {
8004 if (!GNU_MODE || !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
8005 errorf(source_position,
8006 "arithmetic with pointer to incomplete type '%T' not allowed",
8009 } else if (warning.pointer_arith) {
8010 warningf(source_position,
8011 "pointer of type '%T' used in arithmetic",
8014 } else if (is_type_function(points_to)) {
8016 errorf(source_position,
8017 "arithmetic with pointer to function type '%T' not allowed",
8020 } else if (warning.pointer_arith) {
8021 warningf(source_position,
8022 "pointer to a function '%T' used in arithmetic",
8029 static bool is_lvalue(const expression_t *expression)
8031 /* TODO: doesn't seem to be consistent with §6.3.2.1 (1) */
8032 switch (expression->kind) {
8033 case EXPR_REFERENCE:
8034 case EXPR_ARRAY_ACCESS:
8036 case EXPR_UNARY_DEREFERENCE:
8040 /* Claim it is an lvalue, if the type is invalid. There was a parse
8041 * error before, which maybe prevented properly recognizing it as
8043 return !is_type_valid(skip_typeref(expression->base.type));
8047 static void semantic_incdec(unary_expression_t *expression)
8049 type_t *const orig_type = expression->value->base.type;
8050 type_t *const type = skip_typeref(orig_type);
8051 if (is_type_pointer(type)) {
8052 if (!check_pointer_arithmetic(&expression->base.source_position,
8056 } else if (!is_type_real(type) && is_type_valid(type)) {
8057 /* TODO: improve error message */
8058 errorf(&expression->base.source_position,
8059 "operation needs an arithmetic or pointer type");
8062 if (!is_lvalue(expression->value)) {
8063 /* TODO: improve error message */
8064 errorf(&expression->base.source_position, "lvalue required as operand");
8066 expression->base.type = orig_type;
8069 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
8071 type_t *const orig_type = expression->value->base.type;
8072 type_t *const type = skip_typeref(orig_type);
8073 if (!is_type_arithmetic(type)) {
8074 if (is_type_valid(type)) {
8075 /* TODO: improve error message */
8076 errorf(&expression->base.source_position,
8077 "operation needs an arithmetic type");
8082 expression->base.type = orig_type;
8085 static void semantic_unexpr_plus(unary_expression_t *expression)
8087 semantic_unexpr_arithmetic(expression);
8088 if (warning.traditional)
8089 warningf(&expression->base.source_position,
8090 "traditional C rejects the unary plus operator");
8093 static expression_t const *get_reference_address(expression_t const *expr)
8095 bool regular_take_address = true;
8097 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
8098 expr = expr->unary.value;
8100 regular_take_address = false;
8103 if (expr->kind != EXPR_UNARY_DEREFERENCE)
8106 expr = expr->unary.value;
8109 /* special case for functions which are automatically converted to a
8110 * pointer to function without an extra TAKE_ADDRESS operation */
8111 if (!regular_take_address && expr->kind == EXPR_REFERENCE
8112 && expr->reference.entity->kind == ENTITY_FUNCTION) {
8119 static void warn_function_address_as_bool(expression_t const* expr)
8121 if (!warning.address)
8124 expr = get_reference_address(expr);
8126 warningf(&expr->base.source_position,
8127 "the address of '%Y' will always evaluate as 'true'",
8128 expr->reference.entity->base.symbol);
8132 static void semantic_not(unary_expression_t *expression)
8134 type_t *const orig_type = expression->value->base.type;
8135 type_t *const type = skip_typeref(orig_type);
8136 if (!is_type_scalar(type) && is_type_valid(type)) {
8137 errorf(&expression->base.source_position,
8138 "operand of ! must be of scalar type");
8141 warn_function_address_as_bool(expression->value);
8143 expression->base.type = type_int;
8146 static void semantic_unexpr_integer(unary_expression_t *expression)
8148 type_t *const orig_type = expression->value->base.type;
8149 type_t *const type = skip_typeref(orig_type);
8150 if (!is_type_integer(type)) {
8151 if (is_type_valid(type)) {
8152 errorf(&expression->base.source_position,
8153 "operand of ~ must be of integer type");
8158 expression->base.type = orig_type;
8161 static void semantic_dereference(unary_expression_t *expression)
8163 type_t *const orig_type = expression->value->base.type;
8164 type_t *const type = skip_typeref(orig_type);
8165 if (!is_type_pointer(type)) {
8166 if (is_type_valid(type)) {
8167 errorf(&expression->base.source_position,
8168 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
8173 type_t *result_type = type->pointer.points_to;
8174 result_type = automatic_type_conversion(result_type);
8175 expression->base.type = result_type;
8179 * Record that an address is taken (expression represents an lvalue).
8181 * @param expression the expression
8182 * @param may_be_register if true, the expression might be an register
8184 static void set_address_taken(expression_t *expression, bool may_be_register)
8186 if (expression->kind != EXPR_REFERENCE)
8189 entity_t *const entity = expression->reference.entity;
8191 if (entity->kind != ENTITY_VARIABLE)
8194 if (entity->declaration.storage_class == STORAGE_CLASS_REGISTER
8195 && !may_be_register) {
8196 errorf(&expression->base.source_position,
8197 "address of register variable '%Y' requested",
8198 entity->base.symbol);
8201 entity->variable.address_taken = true;
8205 * Check the semantic of the address taken expression.
8207 static void semantic_take_addr(unary_expression_t *expression)
8209 expression_t *value = expression->value;
8210 value->base.type = revert_automatic_type_conversion(value);
8212 type_t *orig_type = value->base.type;
8213 type_t *type = skip_typeref(orig_type);
8214 if (!is_type_valid(type))
8218 if (value->kind != EXPR_ARRAY_ACCESS
8219 && value->kind != EXPR_UNARY_DEREFERENCE
8220 && !is_lvalue(value)) {
8221 errorf(&expression->base.source_position,
8222 "'&' requires an lvalue");
8224 if (type->kind == TYPE_BITFIELD) {
8225 errorf(&expression->base.source_position,
8226 "'&' not allowed on object with bitfield type '%T'",
8230 set_address_taken(value, false);
8232 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
8235 #define CREATE_UNARY_EXPRESSION_PARSER(token_type, unexpression_type, sfunc) \
8236 static expression_t *parse_##unexpression_type(void) \
8238 expression_t *unary_expression \
8239 = allocate_expression_zero(unexpression_type); \
8241 unary_expression->unary.value = parse_sub_expression(PREC_UNARY); \
8243 sfunc(&unary_expression->unary); \
8245 return unary_expression; \
8248 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
8249 semantic_unexpr_arithmetic)
8250 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
8251 semantic_unexpr_plus)
8252 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
8254 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
8255 semantic_dereference)
8256 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
8258 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
8259 semantic_unexpr_integer)
8260 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
8262 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
8265 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_type, unexpression_type, \
8267 static expression_t *parse_##unexpression_type(expression_t *left) \
8269 expression_t *unary_expression \
8270 = allocate_expression_zero(unexpression_type); \
8272 unary_expression->unary.value = left; \
8274 sfunc(&unary_expression->unary); \
8276 return unary_expression; \
8279 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
8280 EXPR_UNARY_POSTFIX_INCREMENT,
8282 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
8283 EXPR_UNARY_POSTFIX_DECREMENT,
8286 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
8288 /* TODO: handle complex + imaginary types */
8290 type_left = get_unqualified_type(type_left);
8291 type_right = get_unqualified_type(type_right);
8293 /* § 6.3.1.8 Usual arithmetic conversions */
8294 if (type_left == type_long_double || type_right == type_long_double) {
8295 return type_long_double;
8296 } else if (type_left == type_double || type_right == type_double) {
8298 } else if (type_left == type_float || type_right == type_float) {
8302 type_left = promote_integer(type_left);
8303 type_right = promote_integer(type_right);
8305 if (type_left == type_right)
8308 bool const signed_left = is_type_signed(type_left);
8309 bool const signed_right = is_type_signed(type_right);
8310 int const rank_left = get_rank(type_left);
8311 int const rank_right = get_rank(type_right);
8313 if (signed_left == signed_right)
8314 return rank_left >= rank_right ? type_left : type_right;
8323 u_rank = rank_right;
8324 u_type = type_right;
8326 s_rank = rank_right;
8327 s_type = type_right;
8332 if (u_rank >= s_rank)
8335 /* casting rank to atomic_type_kind is a bit hacky, but makes things
8337 if (get_atomic_type_size((atomic_type_kind_t) s_rank)
8338 > get_atomic_type_size((atomic_type_kind_t) u_rank))
8342 case ATOMIC_TYPE_INT: return type_unsigned_int;
8343 case ATOMIC_TYPE_LONG: return type_unsigned_long;
8344 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
8346 default: panic("invalid atomic type");
8351 * Check the semantic restrictions for a binary expression.
8353 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
8355 expression_t *const left = expression->left;
8356 expression_t *const right = expression->right;
8357 type_t *const orig_type_left = left->base.type;
8358 type_t *const orig_type_right = right->base.type;
8359 type_t *const type_left = skip_typeref(orig_type_left);
8360 type_t *const type_right = skip_typeref(orig_type_right);
8362 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8363 /* TODO: improve error message */
8364 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8365 errorf(&expression->base.source_position,
8366 "operation needs arithmetic types");
8371 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8372 expression->left = create_implicit_cast(left, arithmetic_type);
8373 expression->right = create_implicit_cast(right, arithmetic_type);
8374 expression->base.type = arithmetic_type;
8377 static void warn_div_by_zero(binary_expression_t const *const expression)
8379 if (!warning.div_by_zero ||
8380 !is_type_integer(expression->base.type))
8383 expression_t const *const right = expression->right;
8384 /* The type of the right operand can be different for /= */
8385 if (is_type_integer(right->base.type) &&
8386 is_constant_expression(right) &&
8387 fold_constant(right) == 0) {
8388 warningf(&expression->base.source_position, "division by zero");
8393 * Check the semantic restrictions for a div/mod expression.
8395 static void semantic_divmod_arithmetic(binary_expression_t *expression) {
8396 semantic_binexpr_arithmetic(expression);
8397 warn_div_by_zero(expression);
8400 static void semantic_shift_op(binary_expression_t *expression)
8402 expression_t *const left = expression->left;
8403 expression_t *const right = expression->right;
8404 type_t *const orig_type_left = left->base.type;
8405 type_t *const orig_type_right = right->base.type;
8406 type_t * type_left = skip_typeref(orig_type_left);
8407 type_t * type_right = skip_typeref(orig_type_right);
8409 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8410 /* TODO: improve error message */
8411 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8412 errorf(&expression->base.source_position,
8413 "operands of shift operation must have integer types");
8418 type_left = promote_integer(type_left);
8419 type_right = promote_integer(type_right);
8421 expression->left = create_implicit_cast(left, type_left);
8422 expression->right = create_implicit_cast(right, type_right);
8423 expression->base.type = type_left;
8426 static void semantic_add(binary_expression_t *expression)
8428 expression_t *const left = expression->left;
8429 expression_t *const right = expression->right;
8430 type_t *const orig_type_left = left->base.type;
8431 type_t *const orig_type_right = right->base.type;
8432 type_t *const type_left = skip_typeref(orig_type_left);
8433 type_t *const type_right = skip_typeref(orig_type_right);
8436 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8437 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8438 expression->left = create_implicit_cast(left, arithmetic_type);
8439 expression->right = create_implicit_cast(right, arithmetic_type);
8440 expression->base.type = arithmetic_type;
8442 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8443 check_pointer_arithmetic(&expression->base.source_position,
8444 type_left, orig_type_left);
8445 expression->base.type = type_left;
8446 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
8447 check_pointer_arithmetic(&expression->base.source_position,
8448 type_right, orig_type_right);
8449 expression->base.type = type_right;
8450 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8451 errorf(&expression->base.source_position,
8452 "invalid operands to binary + ('%T', '%T')",
8453 orig_type_left, orig_type_right);
8457 static void semantic_sub(binary_expression_t *expression)
8459 expression_t *const left = expression->left;
8460 expression_t *const right = expression->right;
8461 type_t *const orig_type_left = left->base.type;
8462 type_t *const orig_type_right = right->base.type;
8463 type_t *const type_left = skip_typeref(orig_type_left);
8464 type_t *const type_right = skip_typeref(orig_type_right);
8465 source_position_t const *const pos = &expression->base.source_position;
8468 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8469 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8470 expression->left = create_implicit_cast(left, arithmetic_type);
8471 expression->right = create_implicit_cast(right, arithmetic_type);
8472 expression->base.type = arithmetic_type;
8474 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8475 check_pointer_arithmetic(&expression->base.source_position,
8476 type_left, orig_type_left);
8477 expression->base.type = type_left;
8478 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8479 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
8480 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
8481 if (!types_compatible(unqual_left, unqual_right)) {
8483 "subtracting pointers to incompatible types '%T' and '%T'",
8484 orig_type_left, orig_type_right);
8485 } else if (!is_type_object(unqual_left)) {
8486 if (!is_type_atomic(unqual_left, ATOMIC_TYPE_VOID)) {
8487 errorf(pos, "subtracting pointers to non-object types '%T'",
8489 } else if (warning.other) {
8490 warningf(pos, "subtracting pointers to void");
8493 expression->base.type = type_ptrdiff_t;
8494 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8495 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
8496 orig_type_left, orig_type_right);
8500 static void warn_string_literal_address(expression_t const* expr)
8502 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
8503 expr = expr->unary.value;
8504 if (expr->kind != EXPR_UNARY_DEREFERENCE)
8506 expr = expr->unary.value;
8509 if (expr->kind == EXPR_STRING_LITERAL ||
8510 expr->kind == EXPR_WIDE_STRING_LITERAL) {
8511 warningf(&expr->base.source_position,
8512 "comparison with string literal results in unspecified behaviour");
8517 * Check the semantics of comparison expressions.
8519 * @param expression The expression to check.
8521 static void semantic_comparison(binary_expression_t *expression)
8523 expression_t *left = expression->left;
8524 expression_t *right = expression->right;
8526 if (warning.address) {
8527 warn_string_literal_address(left);
8528 warn_string_literal_address(right);
8530 expression_t const* const func_left = get_reference_address(left);
8531 if (func_left != NULL && is_null_pointer_constant(right)) {
8532 warningf(&expression->base.source_position,
8533 "the address of '%Y' will never be NULL",
8534 func_left->reference.entity->base.symbol);
8537 expression_t const* const func_right = get_reference_address(right);
8538 if (func_right != NULL && is_null_pointer_constant(right)) {
8539 warningf(&expression->base.source_position,
8540 "the address of '%Y' will never be NULL",
8541 func_right->reference.entity->base.symbol);
8545 type_t *orig_type_left = left->base.type;
8546 type_t *orig_type_right = right->base.type;
8547 type_t *type_left = skip_typeref(orig_type_left);
8548 type_t *type_right = skip_typeref(orig_type_right);
8550 /* TODO non-arithmetic types */
8551 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8552 /* test for signed vs unsigned compares */
8553 if (warning.sign_compare &&
8554 (expression->base.kind != EXPR_BINARY_EQUAL &&
8555 expression->base.kind != EXPR_BINARY_NOTEQUAL) &&
8556 (is_type_signed(type_left) != is_type_signed(type_right))) {
8558 /* check if 1 of the operands is a constant, in this case we just
8559 * check wether we can safely represent the resulting constant in
8560 * the type of the other operand. */
8561 expression_t *const_expr = NULL;
8562 expression_t *other_expr = NULL;
8564 if (is_constant_expression(left)) {
8567 } else if (is_constant_expression(right)) {
8572 if (const_expr != NULL) {
8573 type_t *other_type = skip_typeref(other_expr->base.type);
8574 long val = fold_constant(const_expr);
8575 /* TODO: check if val can be represented by other_type */
8579 warningf(&expression->base.source_position,
8580 "comparison between signed and unsigned");
8582 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8583 expression->left = create_implicit_cast(left, arithmetic_type);
8584 expression->right = create_implicit_cast(right, arithmetic_type);
8585 expression->base.type = arithmetic_type;
8586 if (warning.float_equal &&
8587 (expression->base.kind == EXPR_BINARY_EQUAL ||
8588 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
8589 is_type_float(arithmetic_type)) {
8590 warningf(&expression->base.source_position,
8591 "comparing floating point with == or != is unsafe");
8593 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8594 /* TODO check compatibility */
8595 } else if (is_type_pointer(type_left)) {
8596 expression->right = create_implicit_cast(right, type_left);
8597 } else if (is_type_pointer(type_right)) {
8598 expression->left = create_implicit_cast(left, type_right);
8599 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8600 type_error_incompatible("invalid operands in comparison",
8601 &expression->base.source_position,
8602 type_left, type_right);
8604 expression->base.type = type_int;
8608 * Checks if a compound type has constant fields.
8610 static bool has_const_fields(const compound_type_t *type)
8612 compound_t *compound = type->compound;
8613 entity_t *entry = compound->members.entities;
8615 for (; entry != NULL; entry = entry->base.next) {
8616 if (!is_declaration(entry))
8619 const type_t *decl_type = skip_typeref(entry->declaration.type);
8620 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
8627 static bool is_valid_assignment_lhs(expression_t const* const left)
8629 type_t *const orig_type_left = revert_automatic_type_conversion(left);
8630 type_t *const type_left = skip_typeref(orig_type_left);
8632 if (!is_lvalue(left)) {
8633 errorf(HERE, "left hand side '%E' of assignment is not an lvalue",
8638 if (is_type_array(type_left)) {
8639 errorf(HERE, "cannot assign to arrays ('%E')", left);
8642 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
8643 errorf(HERE, "assignment to readonly location '%E' (type '%T')", left,
8647 if (is_type_incomplete(type_left)) {
8648 errorf(HERE, "left-hand side '%E' of assignment has incomplete type '%T'",
8649 left, orig_type_left);
8652 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
8653 errorf(HERE, "cannot assign to '%E' because compound type '%T' has readonly fields",
8654 left, orig_type_left);
8661 static void semantic_arithmetic_assign(binary_expression_t *expression)
8663 expression_t *left = expression->left;
8664 expression_t *right = expression->right;
8665 type_t *orig_type_left = left->base.type;
8666 type_t *orig_type_right = right->base.type;
8668 if (!is_valid_assignment_lhs(left))
8671 type_t *type_left = skip_typeref(orig_type_left);
8672 type_t *type_right = skip_typeref(orig_type_right);
8674 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8675 /* TODO: improve error message */
8676 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8677 errorf(&expression->base.source_position,
8678 "operation needs arithmetic types");
8683 /* combined instructions are tricky. We can't create an implicit cast on
8684 * the left side, because we need the uncasted form for the store.
8685 * The ast2firm pass has to know that left_type must be right_type
8686 * for the arithmetic operation and create a cast by itself */
8687 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8688 expression->right = create_implicit_cast(right, arithmetic_type);
8689 expression->base.type = type_left;
8692 static void semantic_divmod_assign(binary_expression_t *expression)
8694 semantic_arithmetic_assign(expression);
8695 warn_div_by_zero(expression);
8698 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
8700 expression_t *const left = expression->left;
8701 expression_t *const right = expression->right;
8702 type_t *const orig_type_left = left->base.type;
8703 type_t *const orig_type_right = right->base.type;
8704 type_t *const type_left = skip_typeref(orig_type_left);
8705 type_t *const type_right = skip_typeref(orig_type_right);
8707 if (!is_valid_assignment_lhs(left))
8710 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8711 /* combined instructions are tricky. We can't create an implicit cast on
8712 * the left side, because we need the uncasted form for the store.
8713 * The ast2firm pass has to know that left_type must be right_type
8714 * for the arithmetic operation and create a cast by itself */
8715 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
8716 expression->right = create_implicit_cast(right, arithmetic_type);
8717 expression->base.type = type_left;
8718 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8719 check_pointer_arithmetic(&expression->base.source_position,
8720 type_left, orig_type_left);
8721 expression->base.type = type_left;
8722 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8723 errorf(&expression->base.source_position,
8724 "incompatible types '%T' and '%T' in assignment",
8725 orig_type_left, orig_type_right);
8730 * Check the semantic restrictions of a logical expression.
8732 static void semantic_logical_op(binary_expression_t *expression)
8734 expression_t *const left = expression->left;
8735 expression_t *const right = expression->right;
8736 type_t *const orig_type_left = left->base.type;
8737 type_t *const orig_type_right = right->base.type;
8738 type_t *const type_left = skip_typeref(orig_type_left);
8739 type_t *const type_right = skip_typeref(orig_type_right);
8741 warn_function_address_as_bool(left);
8742 warn_function_address_as_bool(right);
8744 if (!is_type_scalar(type_left) || !is_type_scalar(type_right)) {
8745 /* TODO: improve error message */
8746 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8747 errorf(&expression->base.source_position,
8748 "operation needs scalar types");
8753 expression->base.type = type_int;
8757 * Check the semantic restrictions of a binary assign expression.
8759 static void semantic_binexpr_assign(binary_expression_t *expression)
8761 expression_t *left = expression->left;
8762 type_t *orig_type_left = left->base.type;
8764 if (!is_valid_assignment_lhs(left))
8767 assign_error_t error = semantic_assign(orig_type_left, expression->right);
8768 report_assign_error(error, orig_type_left, expression->right,
8769 "assignment", &left->base.source_position);
8770 expression->right = create_implicit_cast(expression->right, orig_type_left);
8771 expression->base.type = orig_type_left;
8775 * Determine if the outermost operation (or parts thereof) of the given
8776 * expression has no effect in order to generate a warning about this fact.
8777 * Therefore in some cases this only examines some of the operands of the
8778 * expression (see comments in the function and examples below).
8780 * f() + 23; // warning, because + has no effect
8781 * x || f(); // no warning, because x controls execution of f()
8782 * x ? y : f(); // warning, because y has no effect
8783 * (void)x; // no warning to be able to suppress the warning
8784 * This function can NOT be used for an "expression has definitely no effect"-
8786 static bool expression_has_effect(const expression_t *const expr)
8788 switch (expr->kind) {
8789 case EXPR_UNKNOWN: break;
8790 case EXPR_INVALID: return true; /* do NOT warn */
8791 case EXPR_REFERENCE: return false;
8792 case EXPR_REFERENCE_ENUM_VALUE: return false;
8793 /* suppress the warning for microsoft __noop operations */
8794 case EXPR_CONST: return expr->conste.is_ms_noop;
8795 case EXPR_CHARACTER_CONSTANT: return false;
8796 case EXPR_WIDE_CHARACTER_CONSTANT: return false;
8797 case EXPR_STRING_LITERAL: return false;
8798 case EXPR_WIDE_STRING_LITERAL: return false;
8799 case EXPR_LABEL_ADDRESS: return false;
8802 const call_expression_t *const call = &expr->call;
8803 if (call->function->kind != EXPR_BUILTIN_SYMBOL)
8806 switch (call->function->builtin_symbol.symbol->ID) {
8807 case T___builtin_va_end: return true;
8808 default: return false;
8812 /* Generate the warning if either the left or right hand side of a
8813 * conditional expression has no effect */
8814 case EXPR_CONDITIONAL: {
8815 const conditional_expression_t *const cond = &expr->conditional;
8817 expression_has_effect(cond->true_expression) &&
8818 expression_has_effect(cond->false_expression);
8821 case EXPR_SELECT: return false;
8822 case EXPR_ARRAY_ACCESS: return false;
8823 case EXPR_SIZEOF: return false;
8824 case EXPR_CLASSIFY_TYPE: return false;
8825 case EXPR_ALIGNOF: return false;
8827 case EXPR_FUNCNAME: return false;
8828 case EXPR_BUILTIN_SYMBOL: break; /* handled in EXPR_CALL */
8829 case EXPR_BUILTIN_CONSTANT_P: return false;
8830 case EXPR_BUILTIN_PREFETCH: return true;
8831 case EXPR_OFFSETOF: return false;
8832 case EXPR_VA_START: return true;
8833 case EXPR_VA_ARG: return true;
8834 case EXPR_STATEMENT: return true; // TODO
8835 case EXPR_COMPOUND_LITERAL: return false;
8837 case EXPR_UNARY_NEGATE: return false;
8838 case EXPR_UNARY_PLUS: return false;
8839 case EXPR_UNARY_BITWISE_NEGATE: return false;
8840 case EXPR_UNARY_NOT: return false;
8841 case EXPR_UNARY_DEREFERENCE: return false;
8842 case EXPR_UNARY_TAKE_ADDRESS: return false;
8843 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
8844 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
8845 case EXPR_UNARY_PREFIX_INCREMENT: return true;
8846 case EXPR_UNARY_PREFIX_DECREMENT: return true;
8848 /* Treat void casts as if they have an effect in order to being able to
8849 * suppress the warning */
8850 case EXPR_UNARY_CAST: {
8851 type_t *const type = skip_typeref(expr->base.type);
8852 return is_type_atomic(type, ATOMIC_TYPE_VOID);
8855 case EXPR_UNARY_CAST_IMPLICIT: return true;
8856 case EXPR_UNARY_ASSUME: return true;
8857 case EXPR_UNARY_DELETE: return true;
8858 case EXPR_UNARY_DELETE_ARRAY: return true;
8859 case EXPR_UNARY_THROW: return true;
8861 case EXPR_BINARY_ADD: return false;
8862 case EXPR_BINARY_SUB: return false;
8863 case EXPR_BINARY_MUL: return false;
8864 case EXPR_BINARY_DIV: return false;
8865 case EXPR_BINARY_MOD: return false;
8866 case EXPR_BINARY_EQUAL: return false;
8867 case EXPR_BINARY_NOTEQUAL: return false;
8868 case EXPR_BINARY_LESS: return false;
8869 case EXPR_BINARY_LESSEQUAL: return false;
8870 case EXPR_BINARY_GREATER: return false;
8871 case EXPR_BINARY_GREATEREQUAL: return false;
8872 case EXPR_BINARY_BITWISE_AND: return false;
8873 case EXPR_BINARY_BITWISE_OR: return false;
8874 case EXPR_BINARY_BITWISE_XOR: return false;
8875 case EXPR_BINARY_SHIFTLEFT: return false;
8876 case EXPR_BINARY_SHIFTRIGHT: return false;
8877 case EXPR_BINARY_ASSIGN: return true;
8878 case EXPR_BINARY_MUL_ASSIGN: return true;
8879 case EXPR_BINARY_DIV_ASSIGN: return true;
8880 case EXPR_BINARY_MOD_ASSIGN: return true;
8881 case EXPR_BINARY_ADD_ASSIGN: return true;
8882 case EXPR_BINARY_SUB_ASSIGN: return true;
8883 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
8884 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
8885 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
8886 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
8887 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
8889 /* Only examine the right hand side of && and ||, because the left hand
8890 * side already has the effect of controlling the execution of the right
8892 case EXPR_BINARY_LOGICAL_AND:
8893 case EXPR_BINARY_LOGICAL_OR:
8894 /* Only examine the right hand side of a comma expression, because the left
8895 * hand side has a separate warning */
8896 case EXPR_BINARY_COMMA:
8897 return expression_has_effect(expr->binary.right);
8899 case EXPR_BINARY_BUILTIN_EXPECT: return true;
8900 case EXPR_BINARY_ISGREATER: return false;
8901 case EXPR_BINARY_ISGREATEREQUAL: return false;
8902 case EXPR_BINARY_ISLESS: return false;
8903 case EXPR_BINARY_ISLESSEQUAL: return false;
8904 case EXPR_BINARY_ISLESSGREATER: return false;
8905 case EXPR_BINARY_ISUNORDERED: return false;
8908 internal_errorf(HERE, "unexpected expression");
8911 static void semantic_comma(binary_expression_t *expression)
8913 if (warning.unused_value) {
8914 const expression_t *const left = expression->left;
8915 if (!expression_has_effect(left)) {
8916 warningf(&left->base.source_position,
8917 "left-hand operand of comma expression has no effect");
8920 expression->base.type = expression->right->base.type;
8924 * @param prec_r precedence of the right operand
8926 #define CREATE_BINEXPR_PARSER(token_type, binexpression_type, prec_r, sfunc) \
8927 static expression_t *parse_##binexpression_type(expression_t *left) \
8929 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
8930 binexpr->binary.left = left; \
8933 expression_t *right = parse_sub_expression(prec_r); \
8935 binexpr->binary.right = right; \
8936 sfunc(&binexpr->binary); \
8941 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, PREC_CAST, semantic_binexpr_arithmetic)
8942 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, PREC_CAST, semantic_divmod_arithmetic)
8943 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, PREC_CAST, semantic_divmod_arithmetic)
8944 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, PREC_MULTIPLICATIVE, semantic_add)
8945 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, PREC_MULTIPLICATIVE, semantic_sub)
8946 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT, PREC_ADDITIVE, semantic_shift_op)
8947 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT, PREC_ADDITIVE, semantic_shift_op)
8948 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, PREC_SHIFT, semantic_comparison)
8949 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, PREC_SHIFT, semantic_comparison)
8950 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL, PREC_SHIFT, semantic_comparison)
8951 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL, PREC_SHIFT, semantic_comparison)
8952 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL, PREC_RELATIONAL, semantic_comparison)
8953 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL, PREC_RELATIONAL, semantic_comparison)
8954 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND, PREC_EQUALITY, semantic_binexpr_arithmetic)
8955 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR, PREC_AND, semantic_binexpr_arithmetic)
8956 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR, PREC_XOR, semantic_binexpr_arithmetic)
8957 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND, PREC_OR, semantic_logical_op)
8958 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR, PREC_LOGICAL_AND, semantic_logical_op)
8959 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, PREC_ASSIGNMENT, semantic_binexpr_assign)
8960 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8961 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8962 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8963 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8964 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8965 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8966 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8967 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8968 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8969 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8970 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, PREC_ASSIGNMENT, semantic_comma)
8973 static expression_t *parse_sub_expression(precedence_t precedence)
8975 if (token.type < 0) {
8976 return expected_expression_error();
8979 expression_parser_function_t *parser
8980 = &expression_parsers[token.type];
8981 source_position_t source_position = token.source_position;
8984 if (parser->parser != NULL) {
8985 left = parser->parser();
8987 left = parse_primary_expression();
8989 assert(left != NULL);
8990 left->base.source_position = source_position;
8993 if (token.type < 0) {
8994 return expected_expression_error();
8997 parser = &expression_parsers[token.type];
8998 if (parser->infix_parser == NULL)
9000 if (parser->infix_precedence < precedence)
9003 left = parser->infix_parser(left);
9005 assert(left != NULL);
9006 assert(left->kind != EXPR_UNKNOWN);
9007 left->base.source_position = source_position;
9014 * Parse an expression.
9016 static expression_t *parse_expression(void)
9018 return parse_sub_expression(PREC_EXPRESSION);
9022 * Register a parser for a prefix-like operator.
9024 * @param parser the parser function
9025 * @param token_type the token type of the prefix token
9027 static void register_expression_parser(parse_expression_function parser,
9030 expression_parser_function_t *entry = &expression_parsers[token_type];
9032 if (entry->parser != NULL) {
9033 diagnosticf("for token '%k'\n", (token_type_t)token_type);
9034 panic("trying to register multiple expression parsers for a token");
9036 entry->parser = parser;
9040 * Register a parser for an infix operator with given precedence.
9042 * @param parser the parser function
9043 * @param token_type the token type of the infix operator
9044 * @param precedence the precedence of the operator
9046 static void register_infix_parser(parse_expression_infix_function parser,
9047 int token_type, unsigned precedence)
9049 expression_parser_function_t *entry = &expression_parsers[token_type];
9051 if (entry->infix_parser != NULL) {
9052 diagnosticf("for token '%k'\n", (token_type_t)token_type);
9053 panic("trying to register multiple infix expression parsers for a "
9056 entry->infix_parser = parser;
9057 entry->infix_precedence = precedence;
9061 * Initialize the expression parsers.
9063 static void init_expression_parsers(void)
9065 memset(&expression_parsers, 0, sizeof(expression_parsers));
9067 register_infix_parser(parse_array_expression, '[', PREC_POSTFIX);
9068 register_infix_parser(parse_call_expression, '(', PREC_POSTFIX);
9069 register_infix_parser(parse_select_expression, '.', PREC_POSTFIX);
9070 register_infix_parser(parse_select_expression, T_MINUSGREATER, PREC_POSTFIX);
9071 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT, T_PLUSPLUS, PREC_POSTFIX);
9072 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT, T_MINUSMINUS, PREC_POSTFIX);
9073 register_infix_parser(parse_EXPR_BINARY_MUL, '*', PREC_MULTIPLICATIVE);
9074 register_infix_parser(parse_EXPR_BINARY_DIV, '/', PREC_MULTIPLICATIVE);
9075 register_infix_parser(parse_EXPR_BINARY_MOD, '%', PREC_MULTIPLICATIVE);
9076 register_infix_parser(parse_EXPR_BINARY_ADD, '+', PREC_ADDITIVE);
9077 register_infix_parser(parse_EXPR_BINARY_SUB, '-', PREC_ADDITIVE);
9078 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, PREC_SHIFT);
9079 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, PREC_SHIFT);
9080 register_infix_parser(parse_EXPR_BINARY_LESS, '<', PREC_RELATIONAL);
9081 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', PREC_RELATIONAL);
9082 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, PREC_RELATIONAL);
9083 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, PREC_RELATIONAL);
9084 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, PREC_EQUALITY);
9085 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL, T_EXCLAMATIONMARKEQUAL, PREC_EQUALITY);
9086 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', PREC_AND);
9087 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', PREC_XOR);
9088 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', PREC_OR);
9089 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, PREC_LOGICAL_AND);
9090 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, PREC_LOGICAL_OR);
9091 register_infix_parser(parse_conditional_expression, '?', PREC_CONDITIONAL);
9092 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', PREC_ASSIGNMENT);
9093 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, PREC_ASSIGNMENT);
9094 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, PREC_ASSIGNMENT);
9095 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, PREC_ASSIGNMENT);
9096 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, PREC_ASSIGNMENT);
9097 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, PREC_ASSIGNMENT);
9098 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN, T_LESSLESSEQUAL, PREC_ASSIGNMENT);
9099 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN, T_GREATERGREATEREQUAL, PREC_ASSIGNMENT);
9100 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN, T_ANDEQUAL, PREC_ASSIGNMENT);
9101 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN, T_PIPEEQUAL, PREC_ASSIGNMENT);
9102 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN, T_CARETEQUAL, PREC_ASSIGNMENT);
9103 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', PREC_EXPRESSION);
9105 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-');
9106 register_expression_parser(parse_EXPR_UNARY_PLUS, '+');
9107 register_expression_parser(parse_EXPR_UNARY_NOT, '!');
9108 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~');
9109 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*');
9110 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&');
9111 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT, T_PLUSPLUS);
9112 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT, T_MINUSMINUS);
9113 register_expression_parser(parse_sizeof, T_sizeof);
9114 register_expression_parser(parse_alignof, T___alignof__);
9115 register_expression_parser(parse_extension, T___extension__);
9116 register_expression_parser(parse_builtin_classify_type, T___builtin_classify_type);
9117 register_expression_parser(parse_delete, T_delete);
9118 register_expression_parser(parse_throw, T_throw);
9122 * Parse a asm statement arguments specification.
9124 static asm_argument_t *parse_asm_arguments(bool is_out)
9126 asm_argument_t *result = NULL;
9127 asm_argument_t *last = NULL;
9129 while (token.type == T_STRING_LITERAL || token.type == '[') {
9130 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
9131 memset(argument, 0, sizeof(argument[0]));
9133 if (token.type == '[') {
9135 if (token.type != T_IDENTIFIER) {
9136 parse_error_expected("while parsing asm argument",
9137 T_IDENTIFIER, NULL);
9140 argument->symbol = token.v.symbol;
9145 argument->constraints = parse_string_literals();
9147 add_anchor_token(')');
9148 expression_t *expression = parse_expression();
9149 rem_anchor_token(')');
9151 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
9152 * change size or type representation (e.g. int -> long is ok, but
9153 * int -> float is not) */
9154 if (expression->kind == EXPR_UNARY_CAST) {
9155 type_t *const type = expression->base.type;
9156 type_kind_t const kind = type->kind;
9157 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
9160 if (kind == TYPE_ATOMIC) {
9161 atomic_type_kind_t const akind = type->atomic.akind;
9162 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9163 size = get_atomic_type_size(akind);
9165 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9166 size = get_atomic_type_size(get_intptr_kind());
9170 expression_t *const value = expression->unary.value;
9171 type_t *const value_type = value->base.type;
9172 type_kind_t const value_kind = value_type->kind;
9174 unsigned value_flags;
9175 unsigned value_size;
9176 if (value_kind == TYPE_ATOMIC) {
9177 atomic_type_kind_t const value_akind = value_type->atomic.akind;
9178 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9179 value_size = get_atomic_type_size(value_akind);
9180 } else if (value_kind == TYPE_POINTER) {
9181 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9182 value_size = get_atomic_type_size(get_intptr_kind());
9187 if (value_flags != flags || value_size != size)
9191 } while (expression->kind == EXPR_UNARY_CAST);
9195 if (!is_lvalue(expression)) {
9196 errorf(&expression->base.source_position,
9197 "asm output argument is not an lvalue");
9200 if (argument->constraints.begin[0] == '+')
9201 mark_vars_read(expression, NULL);
9203 mark_vars_read(expression, NULL);
9205 argument->expression = expression;
9208 set_address_taken(expression, true);
9211 last->next = argument;
9217 if (token.type != ',')
9228 * Parse a asm statement clobber specification.
9230 static asm_clobber_t *parse_asm_clobbers(void)
9232 asm_clobber_t *result = NULL;
9233 asm_clobber_t *last = NULL;
9235 while(token.type == T_STRING_LITERAL) {
9236 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
9237 clobber->clobber = parse_string_literals();
9240 last->next = clobber;
9246 if (token.type != ',')
9255 * Parse an asm statement.
9257 static statement_t *parse_asm_statement(void)
9259 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
9260 asm_statement_t *asm_statement = &statement->asms;
9264 if (token.type == T_volatile) {
9266 asm_statement->is_volatile = true;
9270 add_anchor_token(')');
9271 add_anchor_token(':');
9272 asm_statement->asm_text = parse_string_literals();
9274 if (token.type != ':') {
9275 rem_anchor_token(':');
9280 asm_statement->outputs = parse_asm_arguments(true);
9281 if (token.type != ':') {
9282 rem_anchor_token(':');
9287 asm_statement->inputs = parse_asm_arguments(false);
9288 if (token.type != ':') {
9289 rem_anchor_token(':');
9292 rem_anchor_token(':');
9295 asm_statement->clobbers = parse_asm_clobbers();
9298 rem_anchor_token(')');
9302 if (asm_statement->outputs == NULL) {
9303 /* GCC: An 'asm' instruction without any output operands will be treated
9304 * identically to a volatile 'asm' instruction. */
9305 asm_statement->is_volatile = true;
9310 return create_invalid_statement();
9314 * Parse a case statement.
9316 static statement_t *parse_case_statement(void)
9318 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9319 source_position_t *const pos = &statement->base.source_position;
9323 expression_t *const expression = parse_expression();
9324 statement->case_label.expression = expression;
9325 if (!is_constant_expression(expression)) {
9326 /* This check does not prevent the error message in all cases of an
9327 * prior error while parsing the expression. At least it catches the
9328 * common case of a mistyped enum entry. */
9329 if (is_type_valid(skip_typeref(expression->base.type))) {
9330 errorf(pos, "case label does not reduce to an integer constant");
9332 statement->case_label.is_bad = true;
9334 long const val = fold_constant(expression);
9335 statement->case_label.first_case = val;
9336 statement->case_label.last_case = val;
9340 if (token.type == T_DOTDOTDOT) {
9342 expression_t *const end_range = parse_expression();
9343 statement->case_label.end_range = end_range;
9344 if (!is_constant_expression(end_range)) {
9345 /* This check does not prevent the error message in all cases of an
9346 * prior error while parsing the expression. At least it catches the
9347 * common case of a mistyped enum entry. */
9348 if (is_type_valid(skip_typeref(end_range->base.type))) {
9349 errorf(pos, "case range does not reduce to an integer constant");
9351 statement->case_label.is_bad = true;
9353 long const val = fold_constant(end_range);
9354 statement->case_label.last_case = val;
9356 if (warning.other && val < statement->case_label.first_case) {
9357 statement->case_label.is_empty_range = true;
9358 warningf(pos, "empty range specified");
9364 PUSH_PARENT(statement);
9368 if (current_switch != NULL) {
9369 if (! statement->case_label.is_bad) {
9370 /* Check for duplicate case values */
9371 case_label_statement_t *c = &statement->case_label;
9372 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
9373 if (l->is_bad || l->is_empty_range || l->expression == NULL)
9376 if (c->last_case < l->first_case || c->first_case > l->last_case)
9379 errorf(pos, "duplicate case value (previously used %P)",
9380 &l->base.source_position);
9384 /* link all cases into the switch statement */
9385 if (current_switch->last_case == NULL) {
9386 current_switch->first_case = &statement->case_label;
9388 current_switch->last_case->next = &statement->case_label;
9390 current_switch->last_case = &statement->case_label;
9392 errorf(pos, "case label not within a switch statement");
9395 statement_t *const inner_stmt = parse_statement();
9396 statement->case_label.statement = inner_stmt;
9397 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9398 errorf(&inner_stmt->base.source_position, "declaration after case label");
9405 return create_invalid_statement();
9409 * Parse a default statement.
9411 static statement_t *parse_default_statement(void)
9413 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9417 PUSH_PARENT(statement);
9420 if (current_switch != NULL) {
9421 const case_label_statement_t *def_label = current_switch->default_label;
9422 if (def_label != NULL) {
9423 errorf(HERE, "multiple default labels in one switch (previous declared %P)",
9424 &def_label->base.source_position);
9426 current_switch->default_label = &statement->case_label;
9428 /* link all cases into the switch statement */
9429 if (current_switch->last_case == NULL) {
9430 current_switch->first_case = &statement->case_label;
9432 current_switch->last_case->next = &statement->case_label;
9434 current_switch->last_case = &statement->case_label;
9437 errorf(&statement->base.source_position,
9438 "'default' label not within a switch statement");
9441 statement_t *const inner_stmt = parse_statement();
9442 statement->case_label.statement = inner_stmt;
9443 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9444 errorf(&inner_stmt->base.source_position, "declaration after default label");
9451 return create_invalid_statement();
9455 * Parse a label statement.
9457 static statement_t *parse_label_statement(void)
9459 assert(token.type == T_IDENTIFIER);
9460 symbol_t *symbol = token.v.symbol;
9461 label_t *label = get_label(symbol);
9463 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
9464 statement->label.label = label;
9468 PUSH_PARENT(statement);
9470 /* if statement is already set then the label is defined twice,
9471 * otherwise it was just mentioned in a goto/local label declaration so far
9473 if (label->statement != NULL) {
9474 errorf(HERE, "duplicate label '%Y' (declared %P)",
9475 symbol, &label->base.source_position);
9477 label->base.source_position = token.source_position;
9478 label->statement = statement;
9483 if (token.type == '}') {
9484 /* TODO only warn? */
9485 if (warning.other && false) {
9486 warningf(HERE, "label at end of compound statement");
9487 statement->label.statement = create_empty_statement();
9489 errorf(HERE, "label at end of compound statement");
9490 statement->label.statement = create_invalid_statement();
9492 } else if (token.type == ';') {
9493 /* Eat an empty statement here, to avoid the warning about an empty
9494 * statement after a label. label:; is commonly used to have a label
9495 * before a closing brace. */
9496 statement->label.statement = create_empty_statement();
9499 statement_t *const inner_stmt = parse_statement();
9500 statement->label.statement = inner_stmt;
9501 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9502 errorf(&inner_stmt->base.source_position, "declaration after label");
9506 /* remember the labels in a list for later checking */
9507 if (label_last == NULL) {
9508 label_first = &statement->label;
9510 label_last->next = &statement->label;
9512 label_last = &statement->label;
9519 * Parse an if statement.
9521 static statement_t *parse_if(void)
9523 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
9527 PUSH_PARENT(statement);
9529 add_anchor_token('{');
9532 add_anchor_token(')');
9533 expression_t *const expr = parse_expression();
9534 statement->ifs.condition = expr;
9535 mark_vars_read(expr, NULL);
9536 rem_anchor_token(')');
9540 rem_anchor_token('{');
9542 add_anchor_token(T_else);
9543 statement->ifs.true_statement = parse_statement();
9544 rem_anchor_token(T_else);
9546 if (token.type == T_else) {
9548 statement->ifs.false_statement = parse_statement();
9556 * Check that all enums are handled in a switch.
9558 * @param statement the switch statement to check
9560 static void check_enum_cases(const switch_statement_t *statement) {
9561 const type_t *type = skip_typeref(statement->expression->base.type);
9562 if (! is_type_enum(type))
9564 const enum_type_t *enumt = &type->enumt;
9566 /* if we have a default, no warnings */
9567 if (statement->default_label != NULL)
9570 /* FIXME: calculation of value should be done while parsing */
9571 /* TODO: quadratic algorithm here. Change to an n log n one */
9572 long last_value = -1;
9573 const entity_t *entry = enumt->enume->base.next;
9574 for (; entry != NULL && entry->kind == ENTITY_ENUM_VALUE;
9575 entry = entry->base.next) {
9576 const expression_t *expression = entry->enum_value.value;
9577 long value = expression != NULL ? fold_constant(expression) : last_value + 1;
9579 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
9580 if (l->expression == NULL)
9582 if (l->first_case <= value && value <= l->last_case) {
9588 warningf(&statement->base.source_position,
9589 "enumeration value '%Y' not handled in switch",
9590 entry->base.symbol);
9597 * Parse a switch statement.
9599 static statement_t *parse_switch(void)
9601 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
9605 PUSH_PARENT(statement);
9608 add_anchor_token(')');
9609 expression_t *const expr = parse_expression();
9610 mark_vars_read(expr, NULL);
9611 type_t * type = skip_typeref(expr->base.type);
9612 if (is_type_integer(type)) {
9613 type = promote_integer(type);
9614 if (warning.traditional) {
9615 if (get_rank(type) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
9616 warningf(&expr->base.source_position,
9617 "'%T' switch expression not converted to '%T' in ISO C",
9621 } else if (is_type_valid(type)) {
9622 errorf(&expr->base.source_position,
9623 "switch quantity is not an integer, but '%T'", type);
9624 type = type_error_type;
9626 statement->switchs.expression = create_implicit_cast(expr, type);
9628 rem_anchor_token(')');
9630 switch_statement_t *rem = current_switch;
9631 current_switch = &statement->switchs;
9632 statement->switchs.body = parse_statement();
9633 current_switch = rem;
9635 if (warning.switch_default &&
9636 statement->switchs.default_label == NULL) {
9637 warningf(&statement->base.source_position, "switch has no default case");
9639 if (warning.switch_enum)
9640 check_enum_cases(&statement->switchs);
9646 return create_invalid_statement();
9649 static statement_t *parse_loop_body(statement_t *const loop)
9651 statement_t *const rem = current_loop;
9652 current_loop = loop;
9654 statement_t *const body = parse_statement();
9661 * Parse a while statement.
9663 static statement_t *parse_while(void)
9665 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
9669 PUSH_PARENT(statement);
9672 add_anchor_token(')');
9673 expression_t *const cond = parse_expression();
9674 statement->whiles.condition = cond;
9675 mark_vars_read(cond, NULL);
9676 rem_anchor_token(')');
9679 statement->whiles.body = parse_loop_body(statement);
9685 return create_invalid_statement();
9689 * Parse a do statement.
9691 static statement_t *parse_do(void)
9693 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
9697 PUSH_PARENT(statement);
9699 add_anchor_token(T_while);
9700 statement->do_while.body = parse_loop_body(statement);
9701 rem_anchor_token(T_while);
9705 add_anchor_token(')');
9706 expression_t *const cond = parse_expression();
9707 statement->do_while.condition = cond;
9708 mark_vars_read(cond, NULL);
9709 rem_anchor_token(')');
9717 return create_invalid_statement();
9721 * Parse a for statement.
9723 static statement_t *parse_for(void)
9725 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9729 PUSH_PARENT(statement);
9731 size_t const top = environment_top();
9732 scope_push(&statement->fors.scope);
9735 add_anchor_token(')');
9737 if (token.type != ';') {
9738 if (is_declaration_specifier(&token, false)) {
9739 parse_declaration(record_entity);
9741 add_anchor_token(';');
9742 expression_t *const init = parse_expression();
9743 statement->fors.initialisation = init;
9744 mark_vars_read(init, VAR_ANY);
9745 if (warning.unused_value && !expression_has_effect(init)) {
9746 warningf(&init->base.source_position,
9747 "initialisation of 'for'-statement has no effect");
9749 rem_anchor_token(';');
9756 if (token.type != ';') {
9757 add_anchor_token(';');
9758 expression_t *const cond = parse_expression();
9759 statement->fors.condition = cond;
9760 mark_vars_read(cond, NULL);
9761 rem_anchor_token(';');
9764 if (token.type != ')') {
9765 expression_t *const step = parse_expression();
9766 statement->fors.step = step;
9767 mark_vars_read(step, VAR_ANY);
9768 if (warning.unused_value && !expression_has_effect(step)) {
9769 warningf(&step->base.source_position,
9770 "step of 'for'-statement has no effect");
9774 rem_anchor_token(')');
9775 statement->fors.body = parse_loop_body(statement);
9777 assert(scope == &statement->fors.scope);
9779 environment_pop_to(top);
9786 rem_anchor_token(')');
9787 assert(scope == &statement->fors.scope);
9789 environment_pop_to(top);
9791 return create_invalid_statement();
9795 * Parse a goto statement.
9797 static statement_t *parse_goto(void)
9799 statement_t *statement = allocate_statement_zero(STATEMENT_GOTO);
9802 if (GNU_MODE && token.type == '*') {
9804 expression_t *expression = parse_expression();
9805 mark_vars_read(expression, NULL);
9807 /* Argh: although documentation say the expression must be of type void *,
9808 * gcc excepts anything that can be casted into void * without error */
9809 type_t *type = expression->base.type;
9811 if (type != type_error_type) {
9812 if (!is_type_pointer(type) && !is_type_integer(type)) {
9813 errorf(&expression->base.source_position,
9814 "cannot convert to a pointer type");
9815 } else if (warning.other && type != type_void_ptr) {
9816 warningf(&expression->base.source_position,
9817 "type of computed goto expression should be 'void*' not '%T'", type);
9819 expression = create_implicit_cast(expression, type_void_ptr);
9822 statement->gotos.expression = expression;
9824 if (token.type != T_IDENTIFIER) {
9826 parse_error_expected("while parsing goto", T_IDENTIFIER, '*', NULL);
9828 parse_error_expected("while parsing goto", T_IDENTIFIER, NULL);
9832 symbol_t *symbol = token.v.symbol;
9835 statement->gotos.label = get_label(symbol);
9838 /* remember the goto's in a list for later checking */
9839 if (goto_last == NULL) {
9840 goto_first = &statement->gotos;
9842 goto_last->next = &statement->gotos;
9844 goto_last = &statement->gotos;
9850 return create_invalid_statement();
9854 * Parse a continue statement.
9856 static statement_t *parse_continue(void)
9858 if (current_loop == NULL) {
9859 errorf(HERE, "continue statement not within loop");
9862 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
9872 * Parse a break statement.
9874 static statement_t *parse_break(void)
9876 if (current_switch == NULL && current_loop == NULL) {
9877 errorf(HERE, "break statement not within loop or switch");
9880 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
9890 * Parse a __leave statement.
9892 static statement_t *parse_leave_statement(void)
9894 if (current_try == NULL) {
9895 errorf(HERE, "__leave statement not within __try");
9898 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
9908 * Check if a given entity represents a local variable.
9910 static bool is_local_variable(const entity_t *entity)
9912 if (entity->kind != ENTITY_VARIABLE)
9915 switch ((storage_class_tag_t) entity->declaration.storage_class) {
9916 case STORAGE_CLASS_AUTO:
9917 case STORAGE_CLASS_REGISTER: {
9918 const type_t *type = skip_typeref(entity->declaration.type);
9919 if (is_type_function(type)) {
9931 * Check if a given expression represents a local variable.
9933 static bool expression_is_local_variable(const expression_t *expression)
9935 if (expression->base.kind != EXPR_REFERENCE) {
9938 const entity_t *entity = expression->reference.entity;
9939 return is_local_variable(entity);
9943 * Check if a given expression represents a local variable and
9944 * return its declaration then, else return NULL.
9946 entity_t *expression_is_variable(const expression_t *expression)
9948 if (expression->base.kind != EXPR_REFERENCE) {
9951 entity_t *entity = expression->reference.entity;
9952 if (entity->kind != ENTITY_VARIABLE)
9959 * Parse a return statement.
9961 static statement_t *parse_return(void)
9965 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
9967 expression_t *return_value = NULL;
9968 if (token.type != ';') {
9969 return_value = parse_expression();
9970 mark_vars_read(return_value, NULL);
9973 const type_t *const func_type = current_function->base.type;
9974 assert(is_type_function(func_type));
9975 type_t *const return_type = skip_typeref(func_type->function.return_type);
9977 if (return_value != NULL) {
9978 type_t *return_value_type = skip_typeref(return_value->base.type);
9980 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID) &&
9981 !is_type_atomic(return_value_type, ATOMIC_TYPE_VOID)) {
9982 if (warning.other) {
9983 warningf(&statement->base.source_position,
9984 "'return' with a value, in function returning void");
9986 return_value = NULL;
9988 assign_error_t error = semantic_assign(return_type, return_value);
9989 report_assign_error(error, return_type, return_value, "'return'",
9990 &statement->base.source_position);
9991 return_value = create_implicit_cast(return_value, return_type);
9993 /* check for returning address of a local var */
9994 if (warning.other && return_value != NULL
9995 && return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
9996 const expression_t *expression = return_value->unary.value;
9997 if (expression_is_local_variable(expression)) {
9998 warningf(&statement->base.source_position,
9999 "function returns address of local variable");
10002 } else if (warning.other && !is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
10003 warningf(&statement->base.source_position,
10004 "'return' without value, in function returning non-void");
10006 statement->returns.value = return_value;
10015 * Parse a declaration statement.
10017 static statement_t *parse_declaration_statement(void)
10019 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
10021 entity_t *before = scope->last_entity;
10023 parse_external_declaration();
10025 parse_declaration(record_entity);
10027 if (before == NULL) {
10028 statement->declaration.declarations_begin = scope->entities;
10030 statement->declaration.declarations_begin = before->base.next;
10032 statement->declaration.declarations_end = scope->last_entity;
10038 * Parse an expression statement, ie. expr ';'.
10040 static statement_t *parse_expression_statement(void)
10042 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10044 expression_t *const expr = parse_expression();
10045 statement->expression.expression = expr;
10046 mark_vars_read(expr, VAR_ANY);
10055 * Parse a microsoft __try { } __finally { } or
10056 * __try{ } __except() { }
10058 static statement_t *parse_ms_try_statment(void)
10060 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
10063 PUSH_PARENT(statement);
10065 ms_try_statement_t *rem = current_try;
10066 current_try = &statement->ms_try;
10067 statement->ms_try.try_statement = parse_compound_statement(false);
10072 if (token.type == T___except) {
10075 add_anchor_token(')');
10076 expression_t *const expr = parse_expression();
10077 mark_vars_read(expr, NULL);
10078 type_t * type = skip_typeref(expr->base.type);
10079 if (is_type_integer(type)) {
10080 type = promote_integer(type);
10081 } else if (is_type_valid(type)) {
10082 errorf(&expr->base.source_position,
10083 "__expect expression is not an integer, but '%T'", type);
10084 type = type_error_type;
10086 statement->ms_try.except_expression = create_implicit_cast(expr, type);
10087 rem_anchor_token(')');
10089 statement->ms_try.final_statement = parse_compound_statement(false);
10090 } else if (token.type == T__finally) {
10092 statement->ms_try.final_statement = parse_compound_statement(false);
10094 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
10095 return create_invalid_statement();
10099 return create_invalid_statement();
10102 static statement_t *parse_empty_statement(void)
10104 if (warning.empty_statement) {
10105 warningf(HERE, "statement is empty");
10107 statement_t *const statement = create_empty_statement();
10112 static statement_t *parse_local_label_declaration(void)
10114 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
10118 entity_t *begin = NULL, *end = NULL;
10121 if (token.type != T_IDENTIFIER) {
10122 parse_error_expected("while parsing local label declaration",
10123 T_IDENTIFIER, NULL);
10126 symbol_t *symbol = token.v.symbol;
10127 entity_t *entity = get_entity(symbol, NAMESPACE_LOCAL_LABEL);
10128 if (entity != NULL && entity->base.parent_scope == scope) {
10129 errorf(HERE, "multiple definitions of '__label__ %Y' (previous definition %P)",
10130 symbol, &entity->base.source_position);
10132 entity = allocate_entity_zero(ENTITY_LOCAL_LABEL);
10134 entity->base.parent_scope = scope;
10135 entity->base.namespc = NAMESPACE_LOCAL_LABEL;
10136 entity->base.source_position = token.source_position;
10137 entity->base.symbol = symbol;
10140 end->base.next = entity;
10145 local_label_push(entity);
10149 if (token.type != ',')
10155 statement->declaration.declarations_begin = begin;
10156 statement->declaration.declarations_end = end;
10161 * Parse a statement.
10162 * There's also parse_statement() which additionally checks for
10163 * "statement has no effect" warnings
10165 static statement_t *intern_parse_statement(void)
10167 statement_t *statement = NULL;
10169 /* declaration or statement */
10170 add_anchor_token(';');
10171 switch (token.type) {
10172 case T_IDENTIFIER: {
10173 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
10174 if (la1_type == ':') {
10175 statement = parse_label_statement();
10176 } else if (is_typedef_symbol(token.v.symbol)) {
10177 statement = parse_declaration_statement();
10179 /* it's an identifier, the grammar says this must be an
10180 * expression statement. However it is common that users mistype
10181 * declaration types, so we guess a bit here to improve robustness
10182 * for incorrect programs */
10183 switch (la1_type) {
10185 if (get_entity(token.v.symbol, NAMESPACE_NORMAL) != NULL)
10186 goto expression_statment;
10191 statement = parse_declaration_statement();
10195 expression_statment:
10196 statement = parse_expression_statement();
10203 case T___extension__:
10204 /* This can be a prefix to a declaration or an expression statement.
10205 * We simply eat it now and parse the rest with tail recursion. */
10208 } while (token.type == T___extension__);
10209 bool old_gcc_extension = in_gcc_extension;
10210 in_gcc_extension = true;
10211 statement = parse_statement();
10212 in_gcc_extension = old_gcc_extension;
10216 statement = parse_declaration_statement();
10220 statement = parse_local_label_declaration();
10223 case ';': statement = parse_empty_statement(); break;
10224 case '{': statement = parse_compound_statement(false); break;
10225 case T___leave: statement = parse_leave_statement(); break;
10226 case T___try: statement = parse_ms_try_statment(); break;
10227 case T_asm: statement = parse_asm_statement(); break;
10228 case T_break: statement = parse_break(); break;
10229 case T_case: statement = parse_case_statement(); break;
10230 case T_continue: statement = parse_continue(); break;
10231 case T_default: statement = parse_default_statement(); break;
10232 case T_do: statement = parse_do(); break;
10233 case T_for: statement = parse_for(); break;
10234 case T_goto: statement = parse_goto(); break;
10235 case T_if: statement = parse_if(); break;
10236 case T_return: statement = parse_return(); break;
10237 case T_switch: statement = parse_switch(); break;
10238 case T_while: statement = parse_while(); break;
10241 statement = parse_expression_statement();
10245 errorf(HERE, "unexpected token %K while parsing statement", &token);
10246 statement = create_invalid_statement();
10251 rem_anchor_token(';');
10253 assert(statement != NULL
10254 && statement->base.source_position.input_name != NULL);
10260 * parse a statement and emits "statement has no effect" warning if needed
10261 * (This is really a wrapper around intern_parse_statement with check for 1
10262 * single warning. It is needed, because for statement expressions we have
10263 * to avoid the warning on the last statement)
10265 static statement_t *parse_statement(void)
10267 statement_t *statement = intern_parse_statement();
10269 if (statement->kind == STATEMENT_EXPRESSION && warning.unused_value) {
10270 expression_t *expression = statement->expression.expression;
10271 if (!expression_has_effect(expression)) {
10272 warningf(&expression->base.source_position,
10273 "statement has no effect");
10281 * Parse a compound statement.
10283 static statement_t *parse_compound_statement(bool inside_expression_statement)
10285 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
10287 PUSH_PARENT(statement);
10290 add_anchor_token('}');
10292 size_t const top = environment_top();
10293 size_t const top_local = local_label_top();
10294 scope_push(&statement->compound.scope);
10296 statement_t **anchor = &statement->compound.statements;
10297 bool only_decls_so_far = true;
10298 while (token.type != '}') {
10299 if (token.type == T_EOF) {
10300 errorf(&statement->base.source_position,
10301 "EOF while parsing compound statement");
10304 statement_t *sub_statement = intern_parse_statement();
10305 if (is_invalid_statement(sub_statement)) {
10306 /* an error occurred. if we are at an anchor, return */
10312 if (warning.declaration_after_statement) {
10313 if (sub_statement->kind != STATEMENT_DECLARATION) {
10314 only_decls_so_far = false;
10315 } else if (!only_decls_so_far) {
10316 warningf(&sub_statement->base.source_position,
10317 "ISO C90 forbids mixed declarations and code");
10321 *anchor = sub_statement;
10323 while (sub_statement->base.next != NULL)
10324 sub_statement = sub_statement->base.next;
10326 anchor = &sub_statement->base.next;
10330 /* look over all statements again to produce no effect warnings */
10331 if (warning.unused_value) {
10332 statement_t *sub_statement = statement->compound.statements;
10333 for( ; sub_statement != NULL; sub_statement = sub_statement->base.next) {
10334 if (sub_statement->kind != STATEMENT_EXPRESSION)
10336 /* don't emit a warning for the last expression in an expression
10337 * statement as it has always an effect */
10338 if (inside_expression_statement && sub_statement->base.next == NULL)
10341 expression_t *expression = sub_statement->expression.expression;
10342 if (!expression_has_effect(expression)) {
10343 warningf(&expression->base.source_position,
10344 "statement has no effect");
10350 rem_anchor_token('}');
10351 assert(scope == &statement->compound.scope);
10353 environment_pop_to(top);
10354 local_label_pop_to(top_local);
10361 * Initialize builtin types.
10363 static void initialize_builtin_types(void)
10365 type_intmax_t = make_global_typedef("__intmax_t__", type_long_long);
10366 type_size_t = make_global_typedef("__SIZE_TYPE__", type_unsigned_long);
10367 type_ssize_t = make_global_typedef("__SSIZE_TYPE__", type_long);
10368 type_ptrdiff_t = make_global_typedef("__PTRDIFF_TYPE__", type_long);
10369 type_uintmax_t = make_global_typedef("__uintmax_t__", type_unsigned_long_long);
10370 type_uptrdiff_t = make_global_typedef("__UPTRDIFF_TYPE__", type_unsigned_long);
10371 type_wchar_t = make_global_typedef("__WCHAR_TYPE__", opt_short_wchar_t ? type_unsigned_short : type_int);
10372 type_wint_t = make_global_typedef("__WINT_TYPE__", type_int);
10374 type_intmax_t_ptr = make_pointer_type(type_intmax_t, TYPE_QUALIFIER_NONE);
10375 type_ptrdiff_t_ptr = make_pointer_type(type_ptrdiff_t, TYPE_QUALIFIER_NONE);
10376 type_ssize_t_ptr = make_pointer_type(type_ssize_t, TYPE_QUALIFIER_NONE);
10377 type_wchar_t_ptr = make_pointer_type(type_wchar_t, TYPE_QUALIFIER_NONE);
10379 /* const version of wchar_t */
10380 type_const_wchar_t = allocate_type_zero(TYPE_TYPEDEF);
10381 type_const_wchar_t->typedeft.typedefe = type_wchar_t->typedeft.typedefe;
10382 type_const_wchar_t->base.qualifiers |= TYPE_QUALIFIER_CONST;
10384 type_const_wchar_t_ptr = make_pointer_type(type_const_wchar_t, TYPE_QUALIFIER_NONE);
10388 * Check for unused global static functions and variables
10390 static void check_unused_globals(void)
10392 if (!warning.unused_function && !warning.unused_variable)
10395 for (const entity_t *entity = file_scope->entities; entity != NULL;
10396 entity = entity->base.next) {
10397 if (!is_declaration(entity))
10400 const declaration_t *declaration = &entity->declaration;
10401 if (declaration->used ||
10402 declaration->modifiers & DM_UNUSED ||
10403 declaration->modifiers & DM_USED ||
10404 declaration->storage_class != STORAGE_CLASS_STATIC)
10407 type_t *const type = declaration->type;
10409 if (entity->kind == ENTITY_FUNCTION) {
10410 /* inhibit warning for static inline functions */
10411 if (entity->function.is_inline)
10414 s = entity->function.statement != NULL ? "defined" : "declared";
10419 warningf(&declaration->base.source_position, "'%#T' %s but not used",
10420 type, declaration->base.symbol, s);
10424 static void parse_global_asm(void)
10426 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
10431 statement->asms.asm_text = parse_string_literals();
10432 statement->base.next = unit->global_asm;
10433 unit->global_asm = statement;
10442 * Parse a translation unit.
10444 static void parse_translation_unit(void)
10446 add_anchor_token(T_EOF);
10449 unsigned char token_anchor_copy[T_LAST_TOKEN];
10450 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
10454 bool anchor_leak = false;
10455 for (int i = 0; i != T_LAST_TOKEN; ++i) {
10456 unsigned char count = token_anchor_set[i] - token_anchor_copy[i];
10458 errorf(HERE, "Leaked anchor token %k %d times", i, count);
10459 anchor_leak = true;
10462 if (in_gcc_extension) {
10463 errorf(HERE, "Leaked __extension__");
10464 anchor_leak = true;
10471 switch (token.type) {
10474 case T___extension__:
10475 parse_external_declaration();
10479 parse_global_asm();
10483 rem_anchor_token(T_EOF);
10487 if (!strict_mode) {
10489 warningf(HERE, "stray ';' outside of function");
10496 errorf(HERE, "stray %K outside of function", &token);
10497 if (token.type == '(' || token.type == '{' || token.type == '[')
10498 eat_until_matching_token(token.type);
10508 * @return the translation unit or NULL if errors occurred.
10510 void start_parsing(void)
10512 environment_stack = NEW_ARR_F(stack_entry_t, 0);
10513 label_stack = NEW_ARR_F(stack_entry_t, 0);
10514 local_label_stack = NEW_ARR_F(stack_entry_t, 0);
10515 diagnostic_count = 0;
10519 type_set_output(stderr);
10520 ast_set_output(stderr);
10522 assert(unit == NULL);
10523 unit = allocate_ast_zero(sizeof(unit[0]));
10525 assert(file_scope == NULL);
10526 file_scope = &unit->scope;
10528 assert(scope == NULL);
10529 scope_push(&unit->scope);
10531 initialize_builtin_types();
10534 translation_unit_t *finish_parsing(void)
10536 /* do NOT use scope_pop() here, this will crash, will it by hand */
10537 assert(scope == &unit->scope);
10540 assert(file_scope == &unit->scope);
10541 check_unused_globals();
10544 DEL_ARR_F(environment_stack);
10545 DEL_ARR_F(label_stack);
10546 DEL_ARR_F(local_label_stack);
10548 translation_unit_t *result = unit;
10555 lookahead_bufpos = 0;
10556 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
10559 parse_translation_unit();
10563 * Initialize the parser.
10565 void init_parser(void)
10567 sym_anonymous = symbol_table_insert("<anonymous>");
10569 if (c_mode & _MS) {
10570 /* add predefined symbols for extended-decl-modifier */
10571 sym_align = symbol_table_insert("align");
10572 sym_allocate = symbol_table_insert("allocate");
10573 sym_dllimport = symbol_table_insert("dllimport");
10574 sym_dllexport = symbol_table_insert("dllexport");
10575 sym_naked = symbol_table_insert("naked");
10576 sym_noinline = symbol_table_insert("noinline");
10577 sym_noreturn = symbol_table_insert("noreturn");
10578 sym_nothrow = symbol_table_insert("nothrow");
10579 sym_novtable = symbol_table_insert("novtable");
10580 sym_property = symbol_table_insert("property");
10581 sym_get = symbol_table_insert("get");
10582 sym_put = symbol_table_insert("put");
10583 sym_selectany = symbol_table_insert("selectany");
10584 sym_thread = symbol_table_insert("thread");
10585 sym_uuid = symbol_table_insert("uuid");
10586 sym_deprecated = symbol_table_insert("deprecated");
10587 sym_restrict = symbol_table_insert("restrict");
10588 sym_noalias = symbol_table_insert("noalias");
10590 memset(token_anchor_set, 0, sizeof(token_anchor_set));
10592 init_expression_parsers();
10593 obstack_init(&temp_obst);
10595 symbol_t *const va_list_sym = symbol_table_insert("__builtin_va_list");
10596 type_valist = create_builtin_type(va_list_sym, type_void_ptr);
10600 * Terminate the parser.
10602 void exit_parser(void)
10604 obstack_free(&temp_obst, NULL);