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;
3447 } else if (kind == ENTITY_TYPEDEF) {
3448 entity->typedefe.type = type_error_type;
3450 record_entity(entity, false);
3455 * Finish the construction of a struct type by calculating
3456 * its size, offsets, alignment.
3458 static void finish_struct_type(compound_type_t *type)
3460 assert(type->compound != NULL);
3462 compound_t *compound = type->compound;
3463 if (!compound->complete)
3468 il_alignment_t alignment = 1;
3469 bool need_pad = false;
3471 entity_t *entry = compound->members.entities;
3472 for (; entry != NULL; entry = entry->base.next) {
3473 if (entry->kind != ENTITY_COMPOUND_MEMBER)
3476 type_t *m_type = skip_typeref(entry->declaration.type);
3477 if (! is_type_valid(m_type)) {
3478 /* simply ignore errors here */
3481 il_alignment_t m_alignment = m_type->base.alignment;
3482 if (m_alignment > alignment)
3483 alignment = m_alignment;
3485 offset = (size + m_alignment - 1) & -m_alignment;
3489 entry->compound_member.offset = offset;
3490 size = offset + m_type->base.size;
3492 if (type->base.alignment != 0) {
3493 alignment = type->base.alignment;
3496 offset = (size + alignment - 1) & -alignment;
3500 if (warning.padded && need_pad) {
3501 warningf(&compound->base.source_position,
3502 "'%#T' needs padding", type, compound->base.symbol);
3504 if (warning.packed && !need_pad) {
3505 warningf(&compound->base.source_position,
3506 "superfluous packed attribute on '%#T'",
3507 type, compound->base.symbol);
3510 type->base.size = offset;
3511 type->base.alignment = alignment;
3515 * Finish the construction of an union type by calculating
3516 * its size and alignment.
3518 static void finish_union_type(compound_type_t *type)
3520 assert(type->compound != NULL);
3522 compound_t *compound = type->compound;
3523 if (! compound->complete)
3527 il_alignment_t alignment = 1;
3529 entity_t *entry = compound->members.entities;
3530 for (; entry != NULL; entry = entry->base.next) {
3531 if (entry->kind != ENTITY_COMPOUND_MEMBER)
3534 type_t *m_type = skip_typeref(entry->declaration.type);
3535 if (! is_type_valid(m_type))
3538 entry->compound_member.offset = 0;
3539 if (m_type->base.size > size)
3540 size = m_type->base.size;
3541 if (m_type->base.alignment > alignment)
3542 alignment = m_type->base.alignment;
3544 if (type->base.alignment != 0) {
3545 alignment = type->base.alignment;
3547 size = (size + alignment - 1) & -alignment;
3548 type->base.size = size;
3549 type->base.alignment = alignment;
3552 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
3554 type_t *type = NULL;
3555 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3556 type_modifiers_t modifiers = TYPE_MODIFIER_NONE;
3557 unsigned type_specifiers = 0;
3558 bool newtype = false;
3559 bool saw_error = false;
3560 bool old_gcc_extension = in_gcc_extension;
3562 specifiers->source_position = token.source_position;
3565 specifiers->modifiers
3566 |= parse_attributes(&specifiers->gnu_attributes);
3567 if (specifiers->modifiers & DM_TRANSPARENT_UNION)
3568 modifiers |= TYPE_MODIFIER_TRANSPARENT_UNION;
3570 switch (token.type) {
3573 #define MATCH_STORAGE_CLASS(token, class) \
3575 if (specifiers->storage_class != STORAGE_CLASS_NONE) { \
3576 errorf(HERE, "multiple storage classes in declaration specifiers"); \
3578 specifiers->storage_class = class; \
3582 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
3583 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
3584 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
3585 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
3586 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
3591 add_anchor_token(')');
3592 parse_microsoft_extended_decl_modifier(specifiers);
3593 rem_anchor_token(')');
3598 switch (specifiers->storage_class) {
3599 case STORAGE_CLASS_NONE:
3600 specifiers->storage_class = STORAGE_CLASS_THREAD;
3603 case STORAGE_CLASS_EXTERN:
3604 specifiers->storage_class = STORAGE_CLASS_THREAD_EXTERN;
3607 case STORAGE_CLASS_STATIC:
3608 specifiers->storage_class = STORAGE_CLASS_THREAD_STATIC;
3612 errorf(HERE, "multiple storage classes in declaration specifiers");
3618 /* type qualifiers */
3619 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
3621 qualifiers |= qualifier; \
3625 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3626 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3627 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3628 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3629 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3630 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3631 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3632 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3634 case T___extension__:
3636 in_gcc_extension = true;
3639 /* type specifiers */
3640 #define MATCH_SPECIFIER(token, specifier, name) \
3643 if (type_specifiers & specifier) { \
3644 errorf(HERE, "multiple " name " type specifiers given"); \
3646 type_specifiers |= specifier; \
3650 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
3651 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
3652 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
3653 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
3654 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
3655 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
3656 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
3657 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
3658 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
3659 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
3660 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
3661 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
3662 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
3663 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
3664 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
3665 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
3667 case T__forceinline:
3668 /* only in microsoft mode */
3669 specifiers->modifiers |= DM_FORCEINLINE;
3674 specifiers->is_inline = true;
3679 if (type_specifiers & SPECIFIER_LONG_LONG) {
3680 errorf(HERE, "multiple type specifiers given");
3681 } else if (type_specifiers & SPECIFIER_LONG) {
3682 type_specifiers |= SPECIFIER_LONG_LONG;
3684 type_specifiers |= SPECIFIER_LONG;
3689 type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
3691 type->compound.compound = parse_compound_type_specifier(true);
3692 finish_struct_type(&type->compound);
3696 type = allocate_type_zero(TYPE_COMPOUND_UNION);
3697 type->compound.compound = parse_compound_type_specifier(false);
3698 if (type->compound.compound->modifiers & DM_TRANSPARENT_UNION)
3699 modifiers |= TYPE_MODIFIER_TRANSPARENT_UNION;
3700 finish_union_type(&type->compound);
3704 type = parse_enum_specifier();
3707 type = parse_typeof();
3709 case T___builtin_va_list:
3710 type = duplicate_type(type_valist);
3714 case T_IDENTIFIER: {
3715 /* only parse identifier if we haven't found a type yet */
3716 if (type != NULL || type_specifiers != 0) {
3717 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
3718 * declaration, so it doesn't generate errors about expecting '(' or
3720 switch (look_ahead(1)->type) {
3727 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
3730 errorf(HERE, "discarding stray %K in declaration specifier", &token);
3735 goto finish_specifiers;
3739 type_t *const typedef_type = get_typedef_type(token.v.symbol);
3740 if (typedef_type == NULL) {
3741 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
3742 * declaration, so it doesn't generate 'implicit int' followed by more
3743 * errors later on. */
3744 token_type_t const la1_type = (token_type_t)look_ahead(1)->type;
3749 errorf(HERE, "%K does not name a type", &token);
3752 create_error_entity(token.v.symbol, ENTITY_TYPEDEF);
3754 type = allocate_type_zero(TYPE_TYPEDEF);
3755 type->typedeft.typedefe = &entity->typedefe;
3759 if (la1_type == '*')
3760 goto finish_specifiers;
3765 goto finish_specifiers;
3770 type = typedef_type;
3774 /* function specifier */
3776 goto finish_specifiers;
3781 in_gcc_extension = old_gcc_extension;
3783 if (type == NULL || (saw_error && type_specifiers != 0)) {
3784 atomic_type_kind_t atomic_type;
3786 /* match valid basic types */
3787 switch (type_specifiers) {
3788 case SPECIFIER_VOID:
3789 atomic_type = ATOMIC_TYPE_VOID;
3791 case SPECIFIER_CHAR:
3792 atomic_type = ATOMIC_TYPE_CHAR;
3794 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
3795 atomic_type = ATOMIC_TYPE_SCHAR;
3797 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
3798 atomic_type = ATOMIC_TYPE_UCHAR;
3800 case SPECIFIER_SHORT:
3801 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
3802 case SPECIFIER_SHORT | SPECIFIER_INT:
3803 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3804 atomic_type = ATOMIC_TYPE_SHORT;
3806 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
3807 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3808 atomic_type = ATOMIC_TYPE_USHORT;
3811 case SPECIFIER_SIGNED:
3812 case SPECIFIER_SIGNED | SPECIFIER_INT:
3813 atomic_type = ATOMIC_TYPE_INT;
3815 case SPECIFIER_UNSIGNED:
3816 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
3817 atomic_type = ATOMIC_TYPE_UINT;
3819 case SPECIFIER_LONG:
3820 case SPECIFIER_SIGNED | SPECIFIER_LONG:
3821 case SPECIFIER_LONG | SPECIFIER_INT:
3822 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3823 atomic_type = ATOMIC_TYPE_LONG;
3825 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
3826 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3827 atomic_type = ATOMIC_TYPE_ULONG;
3830 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3831 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3832 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
3833 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3835 atomic_type = ATOMIC_TYPE_LONGLONG;
3836 goto warn_about_long_long;
3838 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3839 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3841 atomic_type = ATOMIC_TYPE_ULONGLONG;
3842 warn_about_long_long:
3843 if (warning.long_long) {
3844 warningf(&specifiers->source_position,
3845 "ISO C90 does not support 'long long'");
3849 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
3850 atomic_type = unsigned_int8_type_kind;
3853 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
3854 atomic_type = unsigned_int16_type_kind;
3857 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
3858 atomic_type = unsigned_int32_type_kind;
3861 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
3862 atomic_type = unsigned_int64_type_kind;
3865 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
3866 atomic_type = unsigned_int128_type_kind;
3869 case SPECIFIER_INT8:
3870 case SPECIFIER_SIGNED | SPECIFIER_INT8:
3871 atomic_type = int8_type_kind;
3874 case SPECIFIER_INT16:
3875 case SPECIFIER_SIGNED | SPECIFIER_INT16:
3876 atomic_type = int16_type_kind;
3879 case SPECIFIER_INT32:
3880 case SPECIFIER_SIGNED | SPECIFIER_INT32:
3881 atomic_type = int32_type_kind;
3884 case SPECIFIER_INT64:
3885 case SPECIFIER_SIGNED | SPECIFIER_INT64:
3886 atomic_type = int64_type_kind;
3889 case SPECIFIER_INT128:
3890 case SPECIFIER_SIGNED | SPECIFIER_INT128:
3891 atomic_type = int128_type_kind;
3894 case SPECIFIER_FLOAT:
3895 atomic_type = ATOMIC_TYPE_FLOAT;
3897 case SPECIFIER_DOUBLE:
3898 atomic_type = ATOMIC_TYPE_DOUBLE;
3900 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
3901 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3903 case SPECIFIER_BOOL:
3904 atomic_type = ATOMIC_TYPE_BOOL;
3906 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
3907 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
3908 atomic_type = ATOMIC_TYPE_FLOAT;
3910 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3911 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3912 atomic_type = ATOMIC_TYPE_DOUBLE;
3914 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3915 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3916 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3919 /* invalid specifier combination, give an error message */
3920 if (type_specifiers == 0) {
3924 /* ISO/IEC 14882:1998(E) §C.1.5:4 */
3925 if (!(c_mode & _CXX) && !strict_mode) {
3926 if (warning.implicit_int) {
3927 warningf(HERE, "no type specifiers in declaration, using 'int'");
3929 atomic_type = ATOMIC_TYPE_INT;
3932 errorf(HERE, "no type specifiers given in declaration");
3934 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
3935 (type_specifiers & SPECIFIER_UNSIGNED)) {
3936 errorf(HERE, "signed and unsigned specifiers given");
3937 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3938 errorf(HERE, "only integer types can be signed or unsigned");
3940 errorf(HERE, "multiple datatypes in declaration");
3945 if (type_specifiers & SPECIFIER_COMPLEX) {
3946 type = allocate_type_zero(TYPE_COMPLEX);
3947 type->complex.akind = atomic_type;
3948 } else if (type_specifiers & SPECIFIER_IMAGINARY) {
3949 type = allocate_type_zero(TYPE_IMAGINARY);
3950 type->imaginary.akind = atomic_type;
3952 type = allocate_type_zero(TYPE_ATOMIC);
3953 type->atomic.akind = atomic_type;
3956 } else if (type_specifiers != 0) {
3957 errorf(HERE, "multiple datatypes in declaration");
3960 /* FIXME: check type qualifiers here */
3962 type->base.qualifiers = qualifiers;
3963 type->base.modifiers = modifiers;
3965 type_t *result = typehash_insert(type);
3966 if (newtype && result != type) {
3970 specifiers->type = result;
3974 specifiers->type = type_error_type;
3978 static type_qualifiers_t parse_type_qualifiers(void)
3980 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3983 switch (token.type) {
3984 /* type qualifiers */
3985 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3986 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3987 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3988 /* microsoft extended type modifiers */
3989 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3990 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3991 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3992 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3993 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
4002 * Parses an K&R identifier list
4004 static void parse_identifier_list(scope_t *scope)
4007 entity_t *entity = allocate_entity_zero(ENTITY_VARIABLE);
4008 entity->base.source_position = token.source_position;
4009 entity->base.namespc = NAMESPACE_NORMAL;
4010 entity->base.symbol = token.v.symbol;
4011 /* a K&R parameter has no type, yet */
4014 append_entity(scope, entity);
4016 if (token.type != ',') {
4020 } while (token.type == T_IDENTIFIER);
4023 static type_t *automatic_type_conversion(type_t *orig_type);
4025 static void semantic_parameter(declaration_t *declaration)
4027 /* TODO: improve error messages */
4028 source_position_t const* const pos = &declaration->base.source_position;
4031 switch (declaration->declared_storage_class) {
4032 /* Allowed storage classes */
4033 case STORAGE_CLASS_NONE:
4034 case STORAGE_CLASS_REGISTER:
4038 errorf(pos, "parameter may only have none or register storage class");
4042 type_t *const orig_type = declaration->type;
4043 /* §6.7.5.3(7): Array as last part of a parameter type is just syntactic
4044 * sugar. Turn it into a pointer.
4045 * §6.7.5.3(8): A declaration of a parameter as ``function returning type''
4046 * shall be adjusted to ``pointer to function returning type'', as in 6.3.2.1.
4048 type_t *const type = automatic_type_conversion(orig_type);
4049 declaration->type = type;
4051 if (is_type_incomplete(skip_typeref(type))) {
4052 errorf(pos, "parameter '%#T' is of incomplete type",
4053 orig_type, declaration->base.symbol);
4057 static entity_t *parse_parameter(void)
4059 declaration_specifiers_t specifiers;
4060 memset(&specifiers, 0, sizeof(specifiers));
4062 parse_declaration_specifiers(&specifiers);
4064 entity_t *entity = parse_declarator(&specifiers, true, false);
4069 * Parses function type parameters (and optionally creates variable_t entities
4070 * for them in a scope)
4072 static void parse_parameters(function_type_t *type, scope_t *scope)
4075 add_anchor_token(')');
4076 int saved_comma_state = save_and_reset_anchor_state(',');
4078 if (token.type == T_IDENTIFIER &&
4079 !is_typedef_symbol(token.v.symbol)) {
4080 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
4081 if (la1_type == ',' || la1_type == ')') {
4082 type->kr_style_parameters = true;
4083 parse_identifier_list(scope);
4084 goto parameters_finished;
4088 if (token.type == ')') {
4089 /* ISO/IEC 14882:1998(E) §C.1.6:1 */
4090 if (!(c_mode & _CXX))
4091 type->unspecified_parameters = true;
4092 goto parameters_finished;
4095 function_parameter_t *parameter;
4096 function_parameter_t *last_parameter = NULL;
4099 switch (token.type) {
4102 type->variadic = true;
4103 goto parameters_finished;
4106 case T___extension__:
4109 entity_t *entity = parse_parameter();
4110 if (entity->kind == ENTITY_TYPEDEF) {
4111 errorf(&entity->base.source_position,
4112 "typedef not allowed as function parameter");
4115 assert(is_declaration(entity));
4117 /* func(void) is not a parameter */
4118 if (last_parameter == NULL
4119 && token.type == ')'
4120 && entity->base.symbol == NULL
4121 && skip_typeref(entity->declaration.type) == type_void) {
4122 goto parameters_finished;
4124 semantic_parameter(&entity->declaration);
4126 parameter = obstack_alloc(type_obst, sizeof(parameter[0]));
4127 memset(parameter, 0, sizeof(parameter[0]));
4128 parameter->type = entity->declaration.type;
4130 if (scope != NULL) {
4131 append_entity(scope, entity);
4134 if (last_parameter != NULL) {
4135 last_parameter->next = parameter;
4137 type->parameters = parameter;
4139 last_parameter = parameter;
4144 goto parameters_finished;
4146 if (token.type != ',') {
4147 goto parameters_finished;
4153 parameters_finished:
4154 rem_anchor_token(')');
4158 restore_anchor_state(',', saved_comma_state);
4161 typedef enum construct_type_kind_t {
4166 } construct_type_kind_t;
4168 typedef struct construct_type_t construct_type_t;
4169 struct construct_type_t {
4170 construct_type_kind_t kind;
4171 construct_type_t *next;
4174 typedef struct parsed_pointer_t parsed_pointer_t;
4175 struct parsed_pointer_t {
4176 construct_type_t construct_type;
4177 type_qualifiers_t type_qualifiers;
4180 typedef struct construct_function_type_t construct_function_type_t;
4181 struct construct_function_type_t {
4182 construct_type_t construct_type;
4183 type_t *function_type;
4186 typedef struct parsed_array_t parsed_array_t;
4187 struct parsed_array_t {
4188 construct_type_t construct_type;
4189 type_qualifiers_t type_qualifiers;
4195 typedef struct construct_base_type_t construct_base_type_t;
4196 struct construct_base_type_t {
4197 construct_type_t construct_type;
4201 static construct_type_t *parse_pointer_declarator(void)
4205 parsed_pointer_t *pointer = obstack_alloc(&temp_obst, sizeof(pointer[0]));
4206 memset(pointer, 0, sizeof(pointer[0]));
4207 pointer->construct_type.kind = CONSTRUCT_POINTER;
4208 pointer->type_qualifiers = parse_type_qualifiers();
4210 return (construct_type_t*) pointer;
4213 static construct_type_t *parse_array_declarator(void)
4216 add_anchor_token(']');
4218 parsed_array_t *array = obstack_alloc(&temp_obst, sizeof(array[0]));
4219 memset(array, 0, sizeof(array[0]));
4220 array->construct_type.kind = CONSTRUCT_ARRAY;
4222 if (token.type == T_static) {
4223 array->is_static = true;
4227 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
4228 if (type_qualifiers != 0) {
4229 if (token.type == T_static) {
4230 array->is_static = true;
4234 array->type_qualifiers = type_qualifiers;
4236 if (token.type == '*' && look_ahead(1)->type == ']') {
4237 array->is_variable = true;
4239 } else if (token.type != ']') {
4240 array->size = parse_assignment_expression();
4243 rem_anchor_token(']');
4247 return (construct_type_t*) array;
4250 static construct_type_t *parse_function_declarator(scope_t *scope)
4252 type_t *type = allocate_type_zero(TYPE_FUNCTION);
4254 /* TODO: revive this... once we know exactly how to do it */
4256 decl_modifiers_t modifiers = entity->declaration.modifiers;
4258 unsigned mask = modifiers & (DM_CDECL|DM_STDCALL|DM_FASTCALL|DM_THISCALL);
4260 if (mask & (mask-1)) {
4261 const char *first = NULL, *second = NULL;
4263 /* more than one calling convention set */
4264 if (modifiers & DM_CDECL) {
4265 if (first == NULL) first = "cdecl";
4266 else if (second == NULL) second = "cdecl";
4268 if (modifiers & DM_STDCALL) {
4269 if (first == NULL) first = "stdcall";
4270 else if (second == NULL) second = "stdcall";
4272 if (modifiers & DM_FASTCALL) {
4273 if (first == NULL) first = "fastcall";
4274 else if (second == NULL) second = "fastcall";
4276 if (modifiers & DM_THISCALL) {
4277 if (first == NULL) first = "thiscall";
4278 else if (second == NULL) second = "thiscall";
4280 errorf(&entity->base.source_position,
4281 "%s and %s attributes are not compatible", first, second);
4284 if (modifiers & DM_CDECL)
4285 type->function.calling_convention = CC_CDECL;
4286 else if (modifiers & DM_STDCALL)
4287 type->function.calling_convention = CC_STDCALL;
4288 else if (modifiers & DM_FASTCALL)
4289 type->function.calling_convention = CC_FASTCALL;
4290 else if (modifiers & DM_THISCALL)
4291 type->function.calling_convention = CC_THISCALL;
4294 parse_parameters(&type->function, scope);
4296 construct_function_type_t *construct_function_type =
4297 obstack_alloc(&temp_obst, sizeof(construct_function_type[0]));
4298 memset(construct_function_type, 0, sizeof(construct_function_type[0]));
4299 construct_function_type->construct_type.kind = CONSTRUCT_FUNCTION;
4300 construct_function_type->function_type = type;
4302 return &construct_function_type->construct_type;
4305 typedef struct parse_declarator_env_t {
4306 decl_modifiers_t modifiers;
4308 source_position_t source_position;
4310 } parse_declarator_env_t;
4312 static construct_type_t *parse_inner_declarator(parse_declarator_env_t *env,
4313 bool may_be_abstract)
4315 /* construct a single linked list of construct_type_t's which describe
4316 * how to construct the final declarator type */
4317 construct_type_t *first = NULL;
4318 construct_type_t *last = NULL;
4319 gnu_attribute_t *attributes = NULL;
4321 decl_modifiers_t modifiers = parse_attributes(&attributes);
4324 while (token.type == '*') {
4325 construct_type_t *type = parse_pointer_declarator();
4335 /* TODO: find out if this is correct */
4336 modifiers |= parse_attributes(&attributes);
4340 env->modifiers |= modifiers;
4342 construct_type_t *inner_types = NULL;
4344 switch (token.type) {
4347 errorf(HERE, "no identifier expected in typename");
4349 env->symbol = token.v.symbol;
4350 env->source_position = token.source_position;
4356 add_anchor_token(')');
4357 inner_types = parse_inner_declarator(env, may_be_abstract);
4358 if (inner_types != NULL) {
4359 /* All later declarators only modify the return type */
4362 rem_anchor_token(')');
4366 if (may_be_abstract)
4368 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
4373 construct_type_t *p = last;
4376 construct_type_t *type;
4377 switch (token.type) {
4379 scope_t *scope = NULL;
4381 scope = &env->parameters;
4383 type = parse_function_declarator(scope);
4387 type = parse_array_declarator();
4390 goto declarator_finished;
4393 /* insert in the middle of the list (behind p) */
4395 type->next = p->next;
4406 declarator_finished:
4407 /* append inner_types at the end of the list, we don't to set last anymore
4408 * as it's not needed anymore */
4410 assert(first == NULL);
4411 first = inner_types;
4413 last->next = inner_types;
4421 static void parse_declaration_attributes(entity_t *entity)
4423 gnu_attribute_t *attributes = NULL;
4424 decl_modifiers_t modifiers = parse_attributes(&attributes);
4430 if (entity->kind == ENTITY_TYPEDEF) {
4431 modifiers |= entity->typedefe.modifiers;
4432 type = entity->typedefe.type;
4434 assert(is_declaration(entity));
4435 modifiers |= entity->declaration.modifiers;
4436 type = entity->declaration.type;
4441 /* handle these strange/stupid mode attributes */
4442 gnu_attribute_t *attribute = attributes;
4443 for ( ; attribute != NULL; attribute = attribute->next) {
4444 if (attribute->kind != GNU_AK_MODE || attribute->invalid)
4447 atomic_type_kind_t akind = attribute->u.akind;
4448 if (!is_type_signed(type)) {
4450 case ATOMIC_TYPE_CHAR: akind = ATOMIC_TYPE_UCHAR; break;
4451 case ATOMIC_TYPE_SHORT: akind = ATOMIC_TYPE_USHORT; break;
4452 case ATOMIC_TYPE_INT: akind = ATOMIC_TYPE_UINT; break;
4453 case ATOMIC_TYPE_LONGLONG: akind = ATOMIC_TYPE_ULONGLONG; break;
4455 panic("invalid akind in mode attribute");
4459 case ATOMIC_TYPE_CHAR: akind = ATOMIC_TYPE_SCHAR; break;
4460 case ATOMIC_TYPE_SHORT: akind = ATOMIC_TYPE_SHORT; break;
4461 case ATOMIC_TYPE_INT: akind = ATOMIC_TYPE_INT; break;
4462 case ATOMIC_TYPE_LONGLONG: akind = ATOMIC_TYPE_LONGLONG; break;
4464 panic("invalid akind in mode attribute");
4468 type = make_atomic_type(akind, type->base.qualifiers);
4471 type_modifiers_t type_modifiers = type->base.modifiers;
4472 if (modifiers & DM_TRANSPARENT_UNION)
4473 modifiers |= TYPE_MODIFIER_TRANSPARENT_UNION;
4475 if (type->base.modifiers != type_modifiers) {
4476 type_t *copy = duplicate_type(type);
4477 copy->base.modifiers = type_modifiers;
4479 type = typehash_insert(copy);
4481 obstack_free(type_obst, copy);
4485 if (entity->kind == ENTITY_TYPEDEF) {
4486 entity->typedefe.type = type;
4487 entity->typedefe.modifiers = modifiers;
4489 entity->declaration.type = type;
4490 entity->declaration.modifiers = modifiers;
4494 static type_t *construct_declarator_type(construct_type_t *construct_list,
4497 construct_type_t *iter = construct_list;
4498 for( ; iter != NULL; iter = iter->next) {
4499 switch (iter->kind) {
4500 case CONSTRUCT_INVALID:
4501 internal_errorf(HERE, "invalid type construction found");
4502 case CONSTRUCT_FUNCTION: {
4503 construct_function_type_t *construct_function_type
4504 = (construct_function_type_t*) iter;
4506 type_t *function_type = construct_function_type->function_type;
4508 function_type->function.return_type = type;
4510 type_t *skipped_return_type = skip_typeref(type);
4512 if (is_type_function(skipped_return_type)) {
4513 errorf(HERE, "function returning function is not allowed");
4514 } else if (is_type_array(skipped_return_type)) {
4515 errorf(HERE, "function returning array is not allowed");
4517 if (skipped_return_type->base.qualifiers != 0 && warning.other) {
4519 "type qualifiers in return type of function type are meaningless");
4523 type = function_type;
4527 case CONSTRUCT_POINTER: {
4528 parsed_pointer_t *parsed_pointer = (parsed_pointer_t*) iter;
4529 type = make_pointer_type(type, parsed_pointer->type_qualifiers);
4533 case CONSTRUCT_ARRAY: {
4534 parsed_array_t *parsed_array = (parsed_array_t*) iter;
4535 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
4537 expression_t *size_expression = parsed_array->size;
4538 if (size_expression != NULL) {
4540 = create_implicit_cast(size_expression, type_size_t);
4543 array_type->base.qualifiers = parsed_array->type_qualifiers;
4544 array_type->array.element_type = type;
4545 array_type->array.is_static = parsed_array->is_static;
4546 array_type->array.is_variable = parsed_array->is_variable;
4547 array_type->array.size_expression = size_expression;
4549 if (size_expression != NULL) {
4550 if (is_constant_expression(size_expression)) {
4551 array_type->array.size_constant = true;
4552 array_type->array.size
4553 = fold_constant(size_expression);
4555 array_type->array.is_vla = true;
4559 type_t *skipped_type = skip_typeref(type);
4561 if (is_type_incomplete(skipped_type)) {
4562 errorf(HERE, "array of incomplete type '%T' is not allowed", type);
4563 } else if (is_type_function(skipped_type)) {
4564 errorf(HERE, "array of functions is not allowed");
4571 type_t *hashed_type = typehash_insert(type);
4572 if (hashed_type != type) {
4573 /* the function type was constructed earlier freeing it here will
4574 * destroy other types... */
4575 if (iter->kind != CONSTRUCT_FUNCTION) {
4585 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
4586 bool may_be_abstract,
4587 bool create_compound_member)
4589 parse_declarator_env_t env;
4590 memset(&env, 0, sizeof(env));
4592 construct_type_t *construct_type
4593 = parse_inner_declarator(&env, may_be_abstract);
4594 type_t *type = construct_declarator_type(construct_type, specifiers->type);
4596 if (construct_type != NULL) {
4597 obstack_free(&temp_obst, construct_type);
4601 if (specifiers->storage_class == STORAGE_CLASS_TYPEDEF) {
4602 entity = allocate_entity_zero(ENTITY_TYPEDEF);
4603 entity->base.symbol = env.symbol;
4604 entity->base.source_position = env.source_position;
4605 entity->typedefe.type = type;
4607 if (create_compound_member) {
4608 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER);
4609 } else if (is_type_function(skip_typeref(type))) {
4610 entity = allocate_entity_zero(ENTITY_FUNCTION);
4612 entity->function.is_inline = specifiers->is_inline;
4613 entity->function.parameters = env.parameters;
4615 entity = allocate_entity_zero(ENTITY_VARIABLE);
4617 entity->variable.get_property_sym = specifiers->get_property_sym;
4618 entity->variable.put_property_sym = specifiers->put_property_sym;
4619 if (specifiers->alignment != 0) {
4620 /* TODO: add checks here */
4621 entity->variable.alignment = specifiers->alignment;
4624 if (warning.other && specifiers->is_inline && is_type_valid(type)) {
4625 warningf(&env.source_position,
4626 "variable '%Y' declared 'inline'\n", env.symbol);
4630 entity->base.source_position = env.source_position;
4631 entity->base.symbol = env.symbol;
4632 entity->base.namespc = NAMESPACE_NORMAL;
4633 entity->declaration.type = type;
4634 entity->declaration.modifiers = env.modifiers | specifiers->modifiers;
4635 entity->declaration.deprecated_string = specifiers->deprecated_string;
4637 storage_class_t storage_class = specifiers->storage_class;
4638 entity->declaration.declared_storage_class = storage_class;
4640 if (storage_class == STORAGE_CLASS_NONE && scope != file_scope) {
4641 storage_class = STORAGE_CLASS_AUTO;
4643 entity->declaration.storage_class = storage_class;
4646 parse_declaration_attributes(entity);
4651 static type_t *parse_abstract_declarator(type_t *base_type)
4653 construct_type_t *construct_type = parse_inner_declarator(NULL, 1);
4655 type_t *result = construct_declarator_type(construct_type, base_type);
4656 if (construct_type != NULL) {
4657 obstack_free(&temp_obst, construct_type);
4664 * Check if the declaration of main is suspicious. main should be a
4665 * function with external linkage, returning int, taking either zero
4666 * arguments, two, or three arguments of appropriate types, ie.
4668 * int main([ int argc, char **argv [, char **env ] ]).
4670 * @param decl the declaration to check
4671 * @param type the function type of the declaration
4673 static void check_type_of_main(const entity_t *entity)
4675 const source_position_t *pos = &entity->base.source_position;
4676 if (entity->kind != ENTITY_FUNCTION) {
4677 warningf(pos, "'main' is not a function");
4681 if (entity->declaration.storage_class == STORAGE_CLASS_STATIC) {
4682 warningf(pos, "'main' is normally a non-static function");
4685 type_t *type = skip_typeref(entity->declaration.type);
4686 assert(is_type_function(type));
4688 function_type_t *func_type = &type->function;
4689 if (!types_compatible(skip_typeref(func_type->return_type), type_int)) {
4690 warningf(pos, "return type of 'main' should be 'int', but is '%T'",
4691 func_type->return_type);
4693 const function_parameter_t *parm = func_type->parameters;
4695 type_t *const first_type = parm->type;
4696 if (!types_compatible(skip_typeref(first_type), type_int)) {
4698 "first argument of 'main' should be 'int', but is '%T'",
4703 type_t *const second_type = parm->type;
4704 if (!types_compatible(skip_typeref(second_type), type_char_ptr_ptr)) {
4705 warningf(pos, "second argument of 'main' should be 'char**', but is '%T'", second_type);
4709 type_t *const third_type = parm->type;
4710 if (!types_compatible(skip_typeref(third_type), type_char_ptr_ptr)) {
4711 warningf(pos, "third argument of 'main' should be 'char**', but is '%T'", third_type);
4715 goto warn_arg_count;
4719 warningf(pos, "'main' takes only zero, two or three arguments");
4725 * Check if a symbol is the equal to "main".
4727 static bool is_sym_main(const symbol_t *const sym)
4729 return strcmp(sym->string, "main") == 0;
4733 * record entities for the NAMESPACE_NORMAL, and produce error messages/warnings
4734 * for various problems that occur for multiple definitions
4736 static entity_t *record_entity(entity_t *entity, const bool is_definition)
4738 const symbol_t *const symbol = entity->base.symbol;
4739 const namespace_t namespc = entity->base.namespc;
4740 const source_position_t *pos = &entity->base.source_position;
4742 assert(symbol != NULL);
4743 entity_t *previous_entity = get_entity(symbol, namespc);
4744 /* pushing the same entity twice will break the stack structure */
4745 assert(previous_entity != entity);
4747 if (entity->kind == ENTITY_FUNCTION) {
4748 type_t *const orig_type = entity->declaration.type;
4749 type_t *const type = skip_typeref(orig_type);
4751 assert(is_type_function(type));
4752 if (type->function.unspecified_parameters &&
4753 warning.strict_prototypes &&
4754 previous_entity == NULL) {
4755 warningf(pos, "function declaration '%#T' is not a prototype",
4759 if (warning.main && scope == file_scope && is_sym_main(symbol)) {
4760 check_type_of_main(entity);
4764 if (is_declaration(entity)) {
4765 if (warning.nested_externs
4766 && entity->declaration.storage_class == STORAGE_CLASS_EXTERN
4767 && scope != file_scope) {
4768 warningf(pos, "nested extern declaration of '%#T'",
4769 entity->declaration.type, symbol);
4773 if (previous_entity != NULL
4774 && previous_entity->base.parent_scope == ¤t_function->parameters
4775 && scope->depth == previous_entity->base.parent_scope->depth + 1) {
4777 assert(previous_entity->kind == ENTITY_VARIABLE);
4779 "declaration '%#T' redeclares the parameter '%#T' (declared %P)",
4780 entity->declaration.type, symbol,
4781 previous_entity->declaration.type, symbol,
4782 &previous_entity->base.source_position);
4786 if (previous_entity != NULL
4787 && previous_entity->base.parent_scope == scope) {
4789 if (previous_entity->kind != entity->kind) {
4791 "redeclaration of '%Y' as different kind of symbol (declared %P)",
4792 symbol, &previous_entity->base.source_position);
4795 if (previous_entity->kind == ENTITY_ENUM_VALUE) {
4797 "redeclaration of enum entry '%Y' (declared %P)",
4798 symbol, &previous_entity->base.source_position);
4801 if (previous_entity->kind == ENTITY_TYPEDEF) {
4802 /* TODO: C++ allows this for exactly the same type */
4804 "redefinition of typedef '%Y' (declared %P)",
4805 symbol, &previous_entity->base.source_position);
4809 /* at this point we should have only VARIABLES or FUNCTIONS */
4810 assert(is_declaration(previous_entity) && is_declaration(entity));
4812 /* can happen for K&R style declarations */
4813 if (previous_entity->kind == ENTITY_VARIABLE
4814 && previous_entity->declaration.type == NULL
4815 && entity->kind == ENTITY_VARIABLE) {
4816 previous_entity->declaration.type = entity->declaration.type;
4817 previous_entity->declaration.storage_class
4818 = entity->declaration.storage_class;
4819 previous_entity->declaration.declared_storage_class
4820 = entity->declaration.declared_storage_class;
4821 previous_entity->declaration.modifiers
4822 = entity->declaration.modifiers;
4823 previous_entity->declaration.deprecated_string
4824 = entity->declaration.deprecated_string;
4826 assert(entity->declaration.type != NULL);
4828 declaration_t *const previous_declaration
4829 = &previous_entity->declaration;
4830 declaration_t *const declaration = &entity->declaration;
4831 type_t *const orig_type = entity->declaration.type;
4832 type_t *const type = skip_typeref(orig_type);
4834 type_t *prev_type = skip_typeref(previous_declaration->type);
4836 if (!types_compatible(type, prev_type)) {
4838 "declaration '%#T' is incompatible with '%#T' (declared %P)",
4839 orig_type, symbol, previous_declaration->type, symbol,
4840 &previous_entity->base.source_position);
4842 unsigned old_storage_class = previous_declaration->storage_class;
4843 if (warning.redundant_decls && is_definition
4844 && previous_declaration->storage_class == STORAGE_CLASS_STATIC
4845 && !(previous_declaration->modifiers & DM_USED)
4846 && !previous_declaration->used) {
4847 warningf(&previous_entity->base.source_position,
4848 "unnecessary static forward declaration for '%#T'",
4849 previous_declaration->type, symbol);
4852 unsigned new_storage_class = declaration->storage_class;
4853 if (is_type_incomplete(prev_type)) {
4854 previous_declaration->type = type;
4858 /* pretend no storage class means extern for function
4859 * declarations (except if the previous declaration is neither
4860 * none nor extern) */
4861 if (entity->kind == ENTITY_FUNCTION) {
4862 if (prev_type->function.unspecified_parameters) {
4863 previous_declaration->type = type;
4867 switch (old_storage_class) {
4868 case STORAGE_CLASS_NONE:
4869 old_storage_class = STORAGE_CLASS_EXTERN;
4872 case STORAGE_CLASS_EXTERN:
4873 if (is_definition) {
4874 if (warning.missing_prototypes &&
4875 prev_type->function.unspecified_parameters &&
4876 !is_sym_main(symbol)) {
4877 warningf(pos, "no previous prototype for '%#T'",
4880 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4881 new_storage_class = STORAGE_CLASS_EXTERN;
4890 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4891 new_storage_class == STORAGE_CLASS_EXTERN) {
4892 warn_redundant_declaration:
4893 if (!is_definition &&
4894 warning.redundant_decls &&
4895 is_type_valid(prev_type) &&
4896 strcmp(previous_entity->base.source_position.input_name, "<builtin>") != 0) {
4898 "redundant declaration for '%Y' (declared %P)",
4899 symbol, &previous_entity->base.source_position);
4901 } else if (current_function == NULL) {
4902 if (old_storage_class != STORAGE_CLASS_STATIC &&
4903 new_storage_class == STORAGE_CLASS_STATIC) {
4905 "static declaration of '%Y' follows non-static declaration (declared %P)",
4906 symbol, &previous_entity->base.source_position);
4907 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4908 previous_declaration->storage_class = STORAGE_CLASS_NONE;
4909 previous_declaration->declared_storage_class = STORAGE_CLASS_NONE;
4911 /* ISO/IEC 14882:1998(E) §C.1.2:1 */
4913 goto error_redeclaration;
4914 goto warn_redundant_declaration;
4916 } else if (is_type_valid(prev_type)) {
4917 if (old_storage_class == new_storage_class) {
4918 error_redeclaration:
4919 errorf(pos, "redeclaration of '%Y' (declared %P)",
4920 symbol, &previous_entity->base.source_position);
4923 "redeclaration of '%Y' with different linkage (declared %P)",
4924 symbol, &previous_entity->base.source_position);
4929 previous_declaration->modifiers |= declaration->modifiers;
4930 if (entity->kind == ENTITY_FUNCTION) {
4931 previous_entity->function.is_inline |= entity->function.is_inline;
4933 return previous_entity;
4936 if (entity->kind == ENTITY_FUNCTION) {
4937 if (is_definition &&
4938 entity->declaration.storage_class != STORAGE_CLASS_STATIC) {
4939 if (warning.missing_prototypes && !is_sym_main(symbol)) {
4940 warningf(pos, "no previous prototype for '%#T'",
4941 entity->declaration.type, symbol);
4942 } else if (warning.missing_declarations && !is_sym_main(symbol)) {
4943 warningf(pos, "no previous declaration for '%#T'",
4944 entity->declaration.type, symbol);
4947 } else if (warning.missing_declarations
4948 && entity->kind == ENTITY_VARIABLE
4949 && scope == file_scope) {
4950 declaration_t *declaration = &entity->declaration;
4951 if (declaration->storage_class == STORAGE_CLASS_NONE ||
4952 declaration->storage_class == STORAGE_CLASS_THREAD) {
4953 warningf(pos, "no previous declaration for '%#T'",
4954 declaration->type, symbol);
4959 assert(entity->base.parent_scope == NULL);
4960 assert(scope != NULL);
4962 entity->base.parent_scope = scope;
4963 entity->base.namespc = NAMESPACE_NORMAL;
4964 environment_push(entity);
4965 append_entity(scope, entity);
4970 static void parser_error_multiple_definition(entity_t *entity,
4971 const source_position_t *source_position)
4973 errorf(source_position, "multiple definition of symbol '%Y' (declared %P)",
4974 entity->base.symbol, &entity->base.source_position);
4977 static bool is_declaration_specifier(const token_t *token,
4978 bool only_specifiers_qualifiers)
4980 switch (token->type) {
4985 return is_typedef_symbol(token->v.symbol);
4987 case T___extension__:
4989 return !only_specifiers_qualifiers;
4996 static void parse_init_declarator_rest(entity_t *entity)
4998 assert(is_declaration(entity));
4999 declaration_t *const declaration = &entity->declaration;
5003 type_t *orig_type = declaration->type;
5004 type_t *type = skip_typeref(orig_type);
5006 if (entity->kind == ENTITY_VARIABLE
5007 && entity->variable.initializer != NULL) {
5008 parser_error_multiple_definition(entity, HERE);
5011 bool must_be_constant = false;
5012 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
5013 declaration->storage_class == STORAGE_CLASS_THREAD_STATIC ||
5014 entity->base.parent_scope == file_scope) {
5015 must_be_constant = true;
5018 if (is_type_function(type)) {
5019 errorf(&entity->base.source_position,
5020 "function '%#T' is initialized like a variable",
5021 orig_type, entity->base.symbol);
5022 orig_type = type_error_type;
5025 parse_initializer_env_t env;
5026 env.type = orig_type;
5027 env.must_be_constant = must_be_constant;
5028 env.entity = entity;
5029 current_init_decl = entity;
5031 initializer_t *initializer = parse_initializer(&env);
5032 current_init_decl = NULL;
5034 if (entity->kind == ENTITY_VARIABLE) {
5035 /* § 6.7.5 (22) array initializers for arrays with unknown size
5036 * determine the array type size */
5037 declaration->type = env.type;
5038 entity->variable.initializer = initializer;
5042 /* parse rest of a declaration without any declarator */
5043 static void parse_anonymous_declaration_rest(
5044 const declaration_specifiers_t *specifiers)
5048 if (warning.other) {
5049 if (specifiers->storage_class != STORAGE_CLASS_NONE) {
5050 warningf(&specifiers->source_position,
5051 "useless storage class in empty declaration");
5054 type_t *type = specifiers->type;
5055 switch (type->kind) {
5056 case TYPE_COMPOUND_STRUCT:
5057 case TYPE_COMPOUND_UNION: {
5058 if (type->compound.compound->base.symbol == NULL) {
5059 warningf(&specifiers->source_position,
5060 "unnamed struct/union that defines no instances");
5069 warningf(&specifiers->source_position, "empty declaration");
5075 static void parse_declaration_rest(entity_t *ndeclaration,
5076 const declaration_specifiers_t *specifiers,
5077 parsed_declaration_func finished_declaration)
5079 add_anchor_token(';');
5080 add_anchor_token(',');
5082 entity_t *entity = finished_declaration(ndeclaration, token.type == '=');
5084 if (token.type == '=') {
5085 parse_init_declarator_rest(entity);
5088 if (token.type != ',')
5092 add_anchor_token('=');
5093 ndeclaration = parse_declarator(specifiers, /*may_be_abstract=*/false, false);
5094 rem_anchor_token('=');
5099 rem_anchor_token(';');
5100 rem_anchor_token(',');
5103 static entity_t *finished_kr_declaration(entity_t *entity, bool is_definition)
5105 symbol_t *symbol = entity->base.symbol;
5106 if (symbol == NULL) {
5107 errorf(HERE, "anonymous declaration not valid as function parameter");
5111 assert(entity->base.namespc == NAMESPACE_NORMAL);
5112 entity_t *previous_entity = get_entity(symbol, NAMESPACE_NORMAL);
5113 if (previous_entity == NULL
5114 || previous_entity->base.parent_scope != scope) {
5115 errorf(HERE, "expected declaration of a function parameter, found '%Y'",
5120 if (is_definition) {
5121 errorf(HERE, "parameter %Y is initialised", entity->base.symbol);
5124 return record_entity(entity, false);
5127 static void parse_declaration(parsed_declaration_func finished_declaration)
5129 declaration_specifiers_t specifiers;
5130 memset(&specifiers, 0, sizeof(specifiers));
5132 add_anchor_token(';');
5133 parse_declaration_specifiers(&specifiers);
5134 rem_anchor_token(';');
5136 if (token.type == ';') {
5137 parse_anonymous_declaration_rest(&specifiers);
5139 entity_t *entity = parse_declarator(&specifiers, /*may_be_abstract=*/false, false);
5140 parse_declaration_rest(entity, &specifiers, finished_declaration);
5144 static type_t *get_default_promoted_type(type_t *orig_type)
5146 type_t *result = orig_type;
5148 type_t *type = skip_typeref(orig_type);
5149 if (is_type_integer(type)) {
5150 result = promote_integer(type);
5151 } else if (type == type_float) {
5152 result = type_double;
5158 static void parse_kr_declaration_list(entity_t *entity)
5160 if (entity->kind != ENTITY_FUNCTION)
5163 type_t *type = skip_typeref(entity->declaration.type);
5164 assert(is_type_function(type));
5165 if (!type->function.kr_style_parameters)
5169 add_anchor_token('{');
5171 /* push function parameters */
5172 size_t const top = environment_top();
5173 scope_push(&entity->function.parameters);
5175 entity_t *parameter = entity->function.parameters.entities;
5176 for ( ; parameter != NULL; parameter = parameter->base.next) {
5177 assert(parameter->base.parent_scope == NULL);
5178 parameter->base.parent_scope = scope;
5179 environment_push(parameter);
5182 /* parse declaration list */
5183 while (is_declaration_specifier(&token, false)) {
5184 parse_declaration(finished_kr_declaration);
5187 /* pop function parameters */
5188 assert(scope == &entity->function.parameters);
5190 environment_pop_to(top);
5192 /* update function type */
5193 type_t *new_type = duplicate_type(type);
5195 function_parameter_t *parameters = NULL;
5196 function_parameter_t *last_parameter = NULL;
5198 entity_t *parameter_declaration = entity->function.parameters.entities;
5199 for( ; parameter_declaration != NULL;
5200 parameter_declaration = parameter_declaration->base.next) {
5201 type_t *parameter_type = parameter_declaration->declaration.type;
5202 if (parameter_type == NULL) {
5204 errorf(HERE, "no type specified for function parameter '%Y'",
5205 parameter_declaration->base.symbol);
5207 if (warning.implicit_int) {
5208 warningf(HERE, "no type specified for function parameter '%Y', using 'int'",
5209 parameter_declaration->base.symbol);
5211 parameter_type = type_int;
5212 parameter_declaration->declaration.type = parameter_type;
5216 semantic_parameter(¶meter_declaration->declaration);
5217 parameter_type = parameter_declaration->declaration.type;
5220 * we need the default promoted types for the function type
5222 parameter_type = get_default_promoted_type(parameter_type);
5224 function_parameter_t *function_parameter
5225 = obstack_alloc(type_obst, sizeof(function_parameter[0]));
5226 memset(function_parameter, 0, sizeof(function_parameter[0]));
5228 function_parameter->type = parameter_type;
5229 if (last_parameter != NULL) {
5230 last_parameter->next = function_parameter;
5232 parameters = function_parameter;
5234 last_parameter = function_parameter;
5237 /* § 6.9.1.7: A K&R style parameter list does NOT act as a function
5239 new_type->function.parameters = parameters;
5240 new_type->function.unspecified_parameters = true;
5242 type = typehash_insert(new_type);
5243 if (type != new_type) {
5244 obstack_free(type_obst, new_type);
5247 entity->declaration.type = type;
5249 rem_anchor_token('{');
5252 static bool first_err = true;
5255 * When called with first_err set, prints the name of the current function,
5258 static void print_in_function(void)
5262 diagnosticf("%s: In function '%Y':\n",
5263 current_function->base.base.source_position.input_name,
5264 current_function->base.base.symbol);
5269 * Check if all labels are defined in the current function.
5270 * Check if all labels are used in the current function.
5272 static void check_labels(void)
5274 for (const goto_statement_t *goto_statement = goto_first;
5275 goto_statement != NULL;
5276 goto_statement = goto_statement->next) {
5277 /* skip computed gotos */
5278 if (goto_statement->expression != NULL)
5281 label_t *label = goto_statement->label;
5284 if (label->base.source_position.input_name == NULL) {
5285 print_in_function();
5286 errorf(&goto_statement->base.source_position,
5287 "label '%Y' used but not defined", label->base.symbol);
5293 if (warning.unused_label) {
5294 for (const label_statement_t *label_statement = label_first;
5295 label_statement != NULL;
5296 label_statement = label_statement->next) {
5297 label_t *label = label_statement->label;
5299 if (! label->used) {
5300 print_in_function();
5301 warningf(&label_statement->base.source_position,
5302 "label '%Y' defined but not used", label->base.symbol);
5306 label_first = label_last = NULL;
5309 static void warn_unused_decl(entity_t *entity, entity_t *end,
5310 char const *const what)
5312 for (; entity != NULL; entity = entity->base.next) {
5313 if (!is_declaration(entity))
5316 declaration_t *declaration = &entity->declaration;
5317 if (declaration->implicit)
5320 if (!declaration->used) {
5321 print_in_function();
5322 warningf(&entity->base.source_position, "%s '%Y' is unused",
5323 what, entity->base.symbol);
5324 } else if (entity->kind == ENTITY_VARIABLE && !entity->variable.read) {
5325 print_in_function();
5326 warningf(&entity->base.source_position, "%s '%Y' is never read",
5327 what, entity->base.symbol);
5335 static void check_unused_variables(statement_t *const stmt, void *const env)
5339 switch (stmt->kind) {
5340 case STATEMENT_DECLARATION: {
5341 declaration_statement_t const *const decls = &stmt->declaration;
5342 warn_unused_decl(decls->declarations_begin, decls->declarations_end,
5348 warn_unused_decl(stmt->fors.scope.entities, NULL, "variable");
5357 * Check declarations of current_function for unused entities.
5359 static void check_declarations(void)
5361 if (warning.unused_parameter) {
5362 const scope_t *scope = ¤t_function->parameters;
5364 /* do not issue unused warnings for main */
5365 if (!is_sym_main(current_function->base.base.symbol)) {
5366 warn_unused_decl(scope->entities, NULL, "parameter");
5369 if (warning.unused_variable) {
5370 walk_statements(current_function->statement, check_unused_variables,
5375 static int determine_truth(expression_t const* const cond)
5378 !is_constant_expression(cond) ? 0 :
5379 fold_constant(cond) != 0 ? 1 :
5383 static bool expression_returns(expression_t const *const expr)
5385 switch (expr->kind) {
5387 expression_t const *const func = expr->call.function;
5388 if (func->kind == EXPR_REFERENCE) {
5389 entity_t *entity = func->reference.entity;
5390 if (entity->kind == ENTITY_FUNCTION
5391 && entity->declaration.modifiers & DM_NORETURN)
5395 if (!expression_returns(func))
5398 for (call_argument_t const* arg = expr->call.arguments; arg != NULL; arg = arg->next) {
5399 if (!expression_returns(arg->expression))
5406 case EXPR_REFERENCE:
5407 case EXPR_REFERENCE_ENUM_VALUE:
5409 case EXPR_CHARACTER_CONSTANT:
5410 case EXPR_WIDE_CHARACTER_CONSTANT:
5411 case EXPR_STRING_LITERAL:
5412 case EXPR_WIDE_STRING_LITERAL:
5413 case EXPR_COMPOUND_LITERAL: // TODO descend into initialisers
5414 case EXPR_LABEL_ADDRESS:
5415 case EXPR_CLASSIFY_TYPE:
5416 case EXPR_SIZEOF: // TODO handle obscure VLA case
5419 case EXPR_BUILTIN_SYMBOL:
5420 case EXPR_BUILTIN_CONSTANT_P:
5421 case EXPR_BUILTIN_PREFETCH:
5424 case EXPR_STATEMENT: // TODO implement
5427 case EXPR_CONDITIONAL:
5428 // TODO handle constant expression
5430 expression_returns(expr->conditional.condition) && (
5431 expression_returns(expr->conditional.true_expression) ||
5432 expression_returns(expr->conditional.false_expression)
5436 return expression_returns(expr->select.compound);
5438 case EXPR_ARRAY_ACCESS:
5440 expression_returns(expr->array_access.array_ref) &&
5441 expression_returns(expr->array_access.index);
5444 return expression_returns(expr->va_starte.ap);
5447 return expression_returns(expr->va_arge.ap);
5449 EXPR_UNARY_CASES_MANDATORY
5450 return expression_returns(expr->unary.value);
5452 case EXPR_UNARY_THROW:
5456 // TODO handle constant lhs of && and ||
5458 expression_returns(expr->binary.left) &&
5459 expression_returns(expr->binary.right);
5465 panic("unhandled expression");
5468 static bool noreturn_candidate;
5470 static void check_reachable(statement_t *const stmt)
5472 if (stmt->base.reachable)
5474 if (stmt->kind != STATEMENT_DO_WHILE)
5475 stmt->base.reachable = true;
5477 statement_t *last = stmt;
5479 switch (stmt->kind) {
5480 case STATEMENT_INVALID:
5481 case STATEMENT_EMPTY:
5482 case STATEMENT_DECLARATION:
5483 case STATEMENT_LOCAL_LABEL:
5485 next = stmt->base.next;
5488 case STATEMENT_COMPOUND:
5489 next = stmt->compound.statements;
5492 case STATEMENT_RETURN:
5493 noreturn_candidate = false;
5496 case STATEMENT_IF: {
5497 if_statement_t const* const ifs = &stmt->ifs;
5498 int const val = determine_truth(ifs->condition);
5501 check_reachable(ifs->true_statement);
5506 if (ifs->false_statement != NULL) {
5507 check_reachable(ifs->false_statement);
5511 next = stmt->base.next;
5515 case STATEMENT_SWITCH: {
5516 switch_statement_t const *const switchs = &stmt->switchs;
5517 expression_t const *const expr = switchs->expression;
5519 if (is_constant_expression(expr)) {
5520 long const val = fold_constant(expr);
5521 case_label_statement_t * defaults = NULL;
5522 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5523 if (i->expression == NULL) {
5528 if (i->first_case <= val && val <= i->last_case) {
5529 check_reachable((statement_t*)i);
5534 if (defaults != NULL) {
5535 check_reachable((statement_t*)defaults);
5539 bool has_default = false;
5540 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5541 if (i->expression == NULL)
5544 check_reachable((statement_t*)i);
5551 next = stmt->base.next;
5555 case STATEMENT_EXPRESSION: {
5556 /* Check for noreturn function call */
5557 expression_t const *const expr = stmt->expression.expression;
5558 if (!expression_returns(expr))
5561 next = stmt->base.next;
5565 case STATEMENT_CONTINUE: {
5566 statement_t *parent = stmt;
5568 parent = parent->base.parent;
5569 if (parent == NULL) /* continue not within loop */
5573 switch (parent->kind) {
5574 case STATEMENT_WHILE: goto continue_while;
5575 case STATEMENT_DO_WHILE: goto continue_do_while;
5576 case STATEMENT_FOR: goto continue_for;
5583 case STATEMENT_BREAK: {
5584 statement_t *parent = stmt;
5586 parent = parent->base.parent;
5587 if (parent == NULL) /* break not within loop/switch */
5590 switch (parent->kind) {
5591 case STATEMENT_SWITCH:
5592 case STATEMENT_WHILE:
5593 case STATEMENT_DO_WHILE:
5596 next = parent->base.next;
5597 goto found_break_parent;
5606 case STATEMENT_GOTO:
5607 if (stmt->gotos.expression) {
5608 statement_t *parent = stmt->base.parent;
5609 if (parent == NULL) /* top level goto */
5613 next = stmt->gotos.label->statement;
5614 if (next == NULL) /* missing label */
5619 case STATEMENT_LABEL:
5620 next = stmt->label.statement;
5623 case STATEMENT_CASE_LABEL:
5624 next = stmt->case_label.statement;
5627 case STATEMENT_WHILE: {
5628 while_statement_t const *const whiles = &stmt->whiles;
5629 int const val = determine_truth(whiles->condition);
5632 check_reachable(whiles->body);
5637 next = stmt->base.next;
5641 case STATEMENT_DO_WHILE:
5642 next = stmt->do_while.body;
5645 case STATEMENT_FOR: {
5646 for_statement_t *const fors = &stmt->fors;
5648 if (fors->condition_reachable)
5650 fors->condition_reachable = true;
5652 expression_t const *const cond = fors->condition;
5654 cond == NULL ? 1 : determine_truth(cond);
5657 check_reachable(fors->body);
5662 next = stmt->base.next;
5666 case STATEMENT_MS_TRY: {
5667 ms_try_statement_t const *const ms_try = &stmt->ms_try;
5668 check_reachable(ms_try->try_statement);
5669 next = ms_try->final_statement;
5673 case STATEMENT_LEAVE: {
5674 statement_t *parent = stmt;
5676 parent = parent->base.parent;
5677 if (parent == NULL) /* __leave not within __try */
5680 if (parent->kind == STATEMENT_MS_TRY) {
5682 next = parent->ms_try.final_statement;
5690 while (next == NULL) {
5691 next = last->base.parent;
5693 noreturn_candidate = false;
5695 type_t *const type = current_function->base.type;
5696 assert(is_type_function(type));
5697 type_t *const ret = skip_typeref(type->function.return_type);
5698 if (warning.return_type &&
5699 !is_type_atomic(ret, ATOMIC_TYPE_VOID) &&
5700 is_type_valid(ret) &&
5701 !is_sym_main(current_function->base.base.symbol)) {
5702 warningf(&stmt->base.source_position,
5703 "control reaches end of non-void function");
5708 switch (next->kind) {
5709 case STATEMENT_INVALID:
5710 case STATEMENT_EMPTY:
5711 case STATEMENT_DECLARATION:
5712 case STATEMENT_LOCAL_LABEL:
5713 case STATEMENT_EXPRESSION:
5715 case STATEMENT_RETURN:
5716 case STATEMENT_CONTINUE:
5717 case STATEMENT_BREAK:
5718 case STATEMENT_GOTO:
5719 case STATEMENT_LEAVE:
5720 panic("invalid control flow in function");
5722 case STATEMENT_COMPOUND:
5724 case STATEMENT_SWITCH:
5725 case STATEMENT_LABEL:
5726 case STATEMENT_CASE_LABEL:
5728 next = next->base.next;
5731 case STATEMENT_WHILE: {
5733 if (next->base.reachable)
5735 next->base.reachable = true;
5737 while_statement_t const *const whiles = &next->whiles;
5738 int const val = determine_truth(whiles->condition);
5741 check_reachable(whiles->body);
5747 next = next->base.next;
5751 case STATEMENT_DO_WHILE: {
5753 if (next->base.reachable)
5755 next->base.reachable = true;
5757 do_while_statement_t const *const dw = &next->do_while;
5758 int const val = determine_truth(dw->condition);
5761 check_reachable(dw->body);
5767 next = next->base.next;
5771 case STATEMENT_FOR: {
5773 for_statement_t *const fors = &next->fors;
5775 fors->step_reachable = true;
5777 if (fors->condition_reachable)
5779 fors->condition_reachable = true;
5781 expression_t const *const cond = fors->condition;
5783 cond == NULL ? 1 : determine_truth(cond);
5786 check_reachable(fors->body);
5792 next = next->base.next;
5796 case STATEMENT_MS_TRY:
5798 next = next->ms_try.final_statement;
5803 check_reachable(next);
5806 static void check_unreachable(statement_t* const stmt, void *const env)
5810 switch (stmt->kind) {
5811 case STATEMENT_DO_WHILE:
5812 if (!stmt->base.reachable) {
5813 expression_t const *const cond = stmt->do_while.condition;
5814 if (determine_truth(cond) >= 0) {
5815 warningf(&cond->base.source_position,
5816 "condition of do-while-loop is unreachable");
5821 case STATEMENT_FOR: {
5822 for_statement_t const* const fors = &stmt->fors;
5824 // if init and step are unreachable, cond is unreachable, too
5825 if (!stmt->base.reachable && !fors->step_reachable) {
5826 warningf(&stmt->base.source_position, "statement is unreachable");
5828 if (!stmt->base.reachable && fors->initialisation != NULL) {
5829 warningf(&fors->initialisation->base.source_position,
5830 "initialisation of for-statement is unreachable");
5833 if (!fors->condition_reachable && fors->condition != NULL) {
5834 warningf(&fors->condition->base.source_position,
5835 "condition of for-statement is unreachable");
5838 if (!fors->step_reachable && fors->step != NULL) {
5839 warningf(&fors->step->base.source_position,
5840 "step of for-statement is unreachable");
5846 case STATEMENT_COMPOUND:
5847 if (stmt->compound.statements != NULL)
5852 if (!stmt->base.reachable)
5853 warningf(&stmt->base.source_position, "statement is unreachable");
5858 static void parse_external_declaration(void)
5860 /* function-definitions and declarations both start with declaration
5862 declaration_specifiers_t specifiers;
5863 memset(&specifiers, 0, sizeof(specifiers));
5865 add_anchor_token(';');
5866 parse_declaration_specifiers(&specifiers);
5867 rem_anchor_token(';');
5869 /* must be a declaration */
5870 if (token.type == ';') {
5871 parse_anonymous_declaration_rest(&specifiers);
5875 add_anchor_token(',');
5876 add_anchor_token('=');
5877 add_anchor_token(';');
5878 add_anchor_token('{');
5880 /* declarator is common to both function-definitions and declarations */
5881 entity_t *ndeclaration = parse_declarator(&specifiers, /*may_be_abstract=*/false, false);
5883 rem_anchor_token('{');
5884 rem_anchor_token(';');
5885 rem_anchor_token('=');
5886 rem_anchor_token(',');
5888 /* must be a declaration */
5889 switch (token.type) {
5893 parse_declaration_rest(ndeclaration, &specifiers, record_entity);
5897 /* must be a function definition */
5898 parse_kr_declaration_list(ndeclaration);
5900 if (token.type != '{') {
5901 parse_error_expected("while parsing function definition", '{', NULL);
5902 eat_until_matching_token(';');
5906 assert(is_declaration(ndeclaration));
5907 type_t *type = ndeclaration->declaration.type;
5909 /* note that we don't skip typerefs: the standard doesn't allow them here
5910 * (so we can't use is_type_function here) */
5911 if (type->kind != TYPE_FUNCTION) {
5912 if (is_type_valid(type)) {
5913 errorf(HERE, "declarator '%#T' has a body but is not a function type",
5914 type, ndeclaration->base.symbol);
5920 if (warning.aggregate_return &&
5921 is_type_compound(skip_typeref(type->function.return_type))) {
5922 warningf(HERE, "function '%Y' returns an aggregate",
5923 ndeclaration->base.symbol);
5925 if (warning.traditional && !type->function.unspecified_parameters) {
5926 warningf(HERE, "traditional C rejects ISO C style function definition of function '%Y'",
5927 ndeclaration->base.symbol);
5929 if (warning.old_style_definition && type->function.unspecified_parameters) {
5930 warningf(HERE, "old-style function definition '%Y'",
5931 ndeclaration->base.symbol);
5934 /* § 6.7.5.3 (14) a function definition with () means no
5935 * parameters (and not unspecified parameters) */
5936 if (type->function.unspecified_parameters
5937 && type->function.parameters == NULL
5938 && !type->function.kr_style_parameters) {
5939 type_t *duplicate = duplicate_type(type);
5940 duplicate->function.unspecified_parameters = false;
5942 type = typehash_insert(duplicate);
5943 if (type != duplicate) {
5944 obstack_free(type_obst, duplicate);
5946 ndeclaration->declaration.type = type;
5949 entity_t *const entity = record_entity(ndeclaration, true);
5950 assert(entity->kind == ENTITY_FUNCTION);
5951 assert(ndeclaration->kind == ENTITY_FUNCTION);
5953 function_t *function = &entity->function;
5954 if (ndeclaration != entity) {
5955 function->parameters = ndeclaration->function.parameters;
5957 assert(is_declaration(entity));
5958 type = skip_typeref(entity->declaration.type);
5960 /* push function parameters and switch scope */
5961 size_t const top = environment_top();
5962 scope_push(&function->parameters);
5964 entity_t *parameter = function->parameters.entities;
5965 for( ; parameter != NULL; parameter = parameter->base.next) {
5966 if (parameter->base.parent_scope == &ndeclaration->function.parameters) {
5967 parameter->base.parent_scope = scope;
5969 assert(parameter->base.parent_scope == NULL
5970 || parameter->base.parent_scope == scope);
5971 parameter->base.parent_scope = scope;
5972 if (parameter->base.symbol == NULL) {
5973 errorf(¶meter->base.source_position, "parameter name omitted");
5976 environment_push(parameter);
5979 if (function->statement != NULL) {
5980 parser_error_multiple_definition(entity, HERE);
5983 /* parse function body */
5984 int label_stack_top = label_top();
5985 function_t *old_current_function = current_function;
5986 current_function = function;
5987 current_parent = NULL;
5989 statement_t *const body = parse_compound_statement(false);
5990 function->statement = body;
5993 check_declarations();
5994 if (warning.return_type ||
5995 warning.unreachable_code ||
5996 (warning.missing_noreturn
5997 && !(function->base.modifiers & DM_NORETURN))) {
5998 noreturn_candidate = true;
5999 check_reachable(body);
6000 if (warning.unreachable_code)
6001 walk_statements(body, check_unreachable, NULL);
6002 if (warning.missing_noreturn &&
6003 noreturn_candidate &&
6004 !(function->base.modifiers & DM_NORETURN)) {
6005 warningf(&body->base.source_position,
6006 "function '%#T' is candidate for attribute 'noreturn'",
6007 type, entity->base.symbol);
6011 assert(current_parent == NULL);
6012 assert(current_function == function);
6013 current_function = old_current_function;
6014 label_pop_to(label_stack_top);
6017 assert(scope == &function->parameters);
6019 environment_pop_to(top);
6022 static type_t *make_bitfield_type(type_t *base_type, expression_t *size,
6023 source_position_t *source_position,
6024 const symbol_t *symbol)
6026 type_t *type = allocate_type_zero(TYPE_BITFIELD);
6028 type->bitfield.base_type = base_type;
6029 type->bitfield.size_expression = size;
6032 type_t *skipped_type = skip_typeref(base_type);
6033 if (!is_type_integer(skipped_type)) {
6034 errorf(HERE, "bitfield base type '%T' is not an integer type",
6038 bit_size = skipped_type->base.size * 8;
6041 if (is_constant_expression(size)) {
6042 long v = fold_constant(size);
6045 errorf(source_position, "negative width in bit-field '%Y'",
6047 } else if (v == 0) {
6048 errorf(source_position, "zero width for bit-field '%Y'",
6050 } else if (bit_size > 0 && (il_size_t)v > bit_size) {
6051 errorf(source_position, "width of '%Y' exceeds its type",
6054 type->bitfield.bit_size = v;
6061 static entity_t *find_compound_entry(compound_t *compound, symbol_t *symbol)
6063 entity_t *iter = compound->members.entities;
6064 for( ; iter != NULL; iter = iter->base.next) {
6065 if (iter->kind != ENTITY_COMPOUND_MEMBER)
6068 if (iter->base.symbol == NULL) {
6069 type_t *type = skip_typeref(iter->declaration.type);
6070 if (is_type_compound(type)) {
6072 = find_compound_entry(type->compound.compound, symbol);
6079 if (iter->base.symbol == symbol) {
6087 static void parse_compound_declarators(compound_t *compound,
6088 const declaration_specifiers_t *specifiers)
6093 if (token.type == ':') {
6094 source_position_t source_position = *HERE;
6097 type_t *base_type = specifiers->type;
6098 expression_t *size = parse_constant_expression();
6100 type_t *type = make_bitfield_type(base_type, size,
6101 &source_position, sym_anonymous);
6103 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER);
6104 entity->base.namespc = NAMESPACE_NORMAL;
6105 entity->base.source_position = source_position;
6106 entity->declaration.declared_storage_class = STORAGE_CLASS_NONE;
6107 entity->declaration.storage_class = STORAGE_CLASS_NONE;
6108 entity->declaration.modifiers = specifiers->modifiers;
6109 entity->declaration.type = type;
6111 entity = parse_declarator(specifiers,/*may_be_abstract=*/true, true);
6112 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
6114 if (token.type == ':') {
6115 source_position_t source_position = *HERE;
6117 expression_t *size = parse_constant_expression();
6119 type_t *type = entity->declaration.type;
6120 type_t *bitfield_type = make_bitfield_type(type, size,
6121 &source_position, entity->base.symbol);
6122 entity->declaration.type = bitfield_type;
6126 /* make sure we don't define a symbol multiple times */
6127 symbol_t *symbol = entity->base.symbol;
6128 if (symbol != NULL) {
6129 entity_t *prev = find_compound_entry(compound, symbol);
6132 assert(prev->base.symbol == symbol);
6133 errorf(&entity->base.source_position,
6134 "multiple declarations of symbol '%Y' (declared %P)",
6135 symbol, &prev->base.source_position);
6139 append_entity(&compound->members, entity);
6141 if (token.type != ',')
6151 static void semantic_compound(compound_t *compound)
6153 entity_t *entity = compound->members.entities;
6154 for ( ; entity != NULL; entity = entity->base.next) {
6155 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
6157 type_t *orig_type = entity->declaration.type;
6158 type_t *type = skip_typeref(orig_type);
6160 if (is_type_function(type)) {
6162 "compound member '%Y' must not have function type '%T'",
6163 entity->base.symbol, orig_type);
6164 } else if (is_type_incomplete(type)) {
6165 /* §6.7.2.1 (16) flexible array member */
6166 if (is_type_array(type) && entity->base.next == NULL) {
6167 compound->has_flexible_member = true;
6170 "compound member '%Y' has incomplete type '%T'",
6171 entity->base.symbol, orig_type);
6177 static void parse_compound_type_entries(compound_t *compound)
6180 add_anchor_token('}');
6182 while (token.type != '}') {
6183 if (token.type == T_EOF) {
6184 errorf(HERE, "EOF while parsing struct");
6187 declaration_specifiers_t specifiers;
6188 memset(&specifiers, 0, sizeof(specifiers));
6189 parse_declaration_specifiers(&specifiers);
6191 parse_compound_declarators(compound, &specifiers);
6193 semantic_compound(compound);
6194 rem_anchor_token('}');
6198 static type_t *parse_typename(void)
6200 declaration_specifiers_t specifiers;
6201 memset(&specifiers, 0, sizeof(specifiers));
6202 parse_declaration_specifiers(&specifiers);
6203 if (specifiers.storage_class != STORAGE_CLASS_NONE) {
6204 /* TODO: improve error message, user does probably not know what a
6205 * storage class is...
6207 errorf(HERE, "typename may not have a storage class");
6210 type_t *result = parse_abstract_declarator(specifiers.type);
6218 typedef expression_t* (*parse_expression_function)(void);
6219 typedef expression_t* (*parse_expression_infix_function)(expression_t *left);
6221 typedef struct expression_parser_function_t expression_parser_function_t;
6222 struct expression_parser_function_t {
6223 parse_expression_function parser;
6224 unsigned infix_precedence;
6225 parse_expression_infix_function infix_parser;
6228 expression_parser_function_t expression_parsers[T_LAST_TOKEN];
6231 * Prints an error message if an expression was expected but not read
6233 static expression_t *expected_expression_error(void)
6235 /* skip the error message if the error token was read */
6236 if (token.type != T_ERROR) {
6237 errorf(HERE, "expected expression, got token '%K'", &token);
6241 return create_invalid_expression();
6245 * Parse a string constant.
6247 static expression_t *parse_string_const(void)
6250 if (token.type == T_STRING_LITERAL) {
6251 string_t res = token.v.string;
6253 while (token.type == T_STRING_LITERAL) {
6254 res = concat_strings(&res, &token.v.string);
6257 if (token.type != T_WIDE_STRING_LITERAL) {
6258 expression_t *const cnst = allocate_expression_zero(EXPR_STRING_LITERAL);
6259 /* note: that we use type_char_ptr here, which is already the
6260 * automatic converted type. revert_automatic_type_conversion
6261 * will construct the array type */
6262 cnst->base.type = warning.write_strings ? type_const_char_ptr : type_char_ptr;
6263 cnst->string.value = res;
6267 wres = concat_string_wide_string(&res, &token.v.wide_string);
6269 wres = token.v.wide_string;
6274 switch (token.type) {
6275 case T_WIDE_STRING_LITERAL:
6276 wres = concat_wide_strings(&wres, &token.v.wide_string);
6279 case T_STRING_LITERAL:
6280 wres = concat_wide_string_string(&wres, &token.v.string);
6284 expression_t *const cnst = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
6285 cnst->base.type = warning.write_strings ? type_const_wchar_t_ptr : type_wchar_t_ptr;
6286 cnst->wide_string.value = wres;
6295 * Parse an integer constant.
6297 static expression_t *parse_int_const(void)
6299 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
6300 cnst->base.type = token.datatype;
6301 cnst->conste.v.int_value = token.v.intvalue;
6309 * Parse a character constant.
6311 static expression_t *parse_character_constant(void)
6313 expression_t *cnst = allocate_expression_zero(EXPR_CHARACTER_CONSTANT);
6314 cnst->base.type = token.datatype;
6315 cnst->conste.v.character = token.v.string;
6317 if (cnst->conste.v.character.size != 1) {
6318 if (warning.multichar && GNU_MODE) {
6319 warningf(HERE, "multi-character character constant");
6321 errorf(HERE, "more than 1 characters in character constant");
6330 * Parse a wide character constant.
6332 static expression_t *parse_wide_character_constant(void)
6334 expression_t *cnst = allocate_expression_zero(EXPR_WIDE_CHARACTER_CONSTANT);
6335 cnst->base.type = token.datatype;
6336 cnst->conste.v.wide_character = token.v.wide_string;
6338 if (cnst->conste.v.wide_character.size != 1) {
6339 if (warning.multichar && GNU_MODE) {
6340 warningf(HERE, "multi-character character constant");
6342 errorf(HERE, "more than 1 characters in character constant");
6351 * Parse a float constant.
6353 static expression_t *parse_float_const(void)
6355 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
6356 cnst->base.type = token.datatype;
6357 cnst->conste.v.float_value = token.v.floatvalue;
6364 static entity_t *create_implicit_function(symbol_t *symbol,
6365 const source_position_t *source_position)
6367 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
6368 ntype->function.return_type = type_int;
6369 ntype->function.unspecified_parameters = true;
6371 type_t *type = typehash_insert(ntype);
6372 if (type != ntype) {
6376 entity_t *entity = allocate_entity_zero(ENTITY_FUNCTION);
6377 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
6378 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
6379 entity->declaration.type = type;
6380 entity->declaration.implicit = true;
6381 entity->base.symbol = symbol;
6382 entity->base.source_position = *source_position;
6384 bool strict_prototypes_old = warning.strict_prototypes;
6385 warning.strict_prototypes = false;
6386 record_entity(entity, false);
6387 warning.strict_prototypes = strict_prototypes_old;
6393 * Creates a return_type (func)(argument_type) function type if not
6396 static type_t *make_function_2_type(type_t *return_type, type_t *argument_type1,
6397 type_t *argument_type2)
6399 function_parameter_t *parameter2
6400 = obstack_alloc(type_obst, sizeof(parameter2[0]));
6401 memset(parameter2, 0, sizeof(parameter2[0]));
6402 parameter2->type = argument_type2;
6404 function_parameter_t *parameter1
6405 = obstack_alloc(type_obst, sizeof(parameter1[0]));
6406 memset(parameter1, 0, sizeof(parameter1[0]));
6407 parameter1->type = argument_type1;
6408 parameter1->next = parameter2;
6410 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6411 type->function.return_type = return_type;
6412 type->function.parameters = parameter1;
6414 type_t *result = typehash_insert(type);
6415 if (result != type) {
6423 * Creates a return_type (func)(argument_type) function type if not
6426 * @param return_type the return type
6427 * @param argument_type the argument type
6429 static type_t *make_function_1_type(type_t *return_type, type_t *argument_type)
6431 function_parameter_t *parameter
6432 = obstack_alloc(type_obst, sizeof(parameter[0]));
6433 memset(parameter, 0, sizeof(parameter[0]));
6434 parameter->type = argument_type;
6436 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6437 type->function.return_type = return_type;
6438 type->function.parameters = parameter;
6440 type_t *result = typehash_insert(type);
6441 if (result != type) {
6448 static type_t *make_function_0_type(type_t *return_type)
6450 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6451 type->function.return_type = return_type;
6452 type->function.parameters = NULL;
6454 type_t *result = typehash_insert(type);
6455 if (result != type) {
6463 * Creates a function type for some function like builtins.
6465 * @param symbol the symbol describing the builtin
6467 static type_t *get_builtin_symbol_type(symbol_t *symbol)
6469 switch (symbol->ID) {
6470 case T___builtin_alloca:
6471 return make_function_1_type(type_void_ptr, type_size_t);
6472 case T___builtin_huge_val:
6473 return make_function_0_type(type_double);
6474 case T___builtin_inf:
6475 return make_function_0_type(type_double);
6476 case T___builtin_inff:
6477 return make_function_0_type(type_float);
6478 case T___builtin_infl:
6479 return make_function_0_type(type_long_double);
6480 case T___builtin_nan:
6481 return make_function_1_type(type_double, type_char_ptr);
6482 case T___builtin_nanf:
6483 return make_function_1_type(type_float, type_char_ptr);
6484 case T___builtin_nanl:
6485 return make_function_1_type(type_long_double, type_char_ptr);
6486 case T___builtin_va_end:
6487 return make_function_1_type(type_void, type_valist);
6488 case T___builtin_expect:
6489 return make_function_2_type(type_long, type_long, type_long);
6491 internal_errorf(HERE, "not implemented builtin symbol found");
6496 * Performs automatic type cast as described in § 6.3.2.1.
6498 * @param orig_type the original type
6500 static type_t *automatic_type_conversion(type_t *orig_type)
6502 type_t *type = skip_typeref(orig_type);
6503 if (is_type_array(type)) {
6504 array_type_t *array_type = &type->array;
6505 type_t *element_type = array_type->element_type;
6506 unsigned qualifiers = array_type->base.qualifiers;
6508 return make_pointer_type(element_type, qualifiers);
6511 if (is_type_function(type)) {
6512 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
6519 * reverts the automatic casts of array to pointer types and function
6520 * to function-pointer types as defined § 6.3.2.1
6522 type_t *revert_automatic_type_conversion(const expression_t *expression)
6524 switch (expression->kind) {
6525 case EXPR_REFERENCE: {
6526 entity_t *entity = expression->reference.entity;
6527 if (is_declaration(entity)) {
6528 return entity->declaration.type;
6529 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6530 return entity->enum_value.enum_type;
6532 panic("no declaration or enum in reference");
6537 entity_t *entity = expression->select.compound_entry;
6538 assert(is_declaration(entity));
6539 type_t *type = entity->declaration.type;
6540 return get_qualified_type(type,
6541 expression->base.type->base.qualifiers);
6544 case EXPR_UNARY_DEREFERENCE: {
6545 const expression_t *const value = expression->unary.value;
6546 type_t *const type = skip_typeref(value->base.type);
6547 assert(is_type_pointer(type));
6548 return type->pointer.points_to;
6551 case EXPR_BUILTIN_SYMBOL:
6552 return get_builtin_symbol_type(expression->builtin_symbol.symbol);
6554 case EXPR_ARRAY_ACCESS: {
6555 const expression_t *array_ref = expression->array_access.array_ref;
6556 type_t *type_left = skip_typeref(array_ref->base.type);
6557 if (!is_type_valid(type_left))
6559 assert(is_type_pointer(type_left));
6560 return type_left->pointer.points_to;
6563 case EXPR_STRING_LITERAL: {
6564 size_t size = expression->string.value.size;
6565 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
6568 case EXPR_WIDE_STRING_LITERAL: {
6569 size_t size = expression->wide_string.value.size;
6570 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
6573 case EXPR_COMPOUND_LITERAL:
6574 return expression->compound_literal.type;
6579 return expression->base.type;
6582 static expression_t *parse_reference(void)
6584 symbol_t *const symbol = token.v.symbol;
6586 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
6588 if (entity == NULL) {
6589 if (!strict_mode && look_ahead(1)->type == '(') {
6590 /* an implicitly declared function */
6591 if (warning.implicit_function_declaration) {
6592 warningf(HERE, "implicit declaration of function '%Y'",
6596 entity = create_implicit_function(symbol, HERE);
6598 errorf(HERE, "unknown symbol '%Y' found.", symbol);
6599 entity = create_error_entity(symbol, ENTITY_VARIABLE);
6605 if (is_declaration(entity)) {
6606 orig_type = entity->declaration.type;
6607 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6608 orig_type = entity->enum_value.enum_type;
6609 } else if (entity->kind == ENTITY_TYPEDEF) {
6610 errorf(HERE, "encountered typedef name '%Y' while parsing expression",
6613 return create_invalid_expression();
6615 panic("expected declaration or enum value in reference");
6618 /* we always do the auto-type conversions; the & and sizeof parser contains
6619 * code to revert this! */
6620 type_t *type = automatic_type_conversion(orig_type);
6622 expression_kind_t kind = EXPR_REFERENCE;
6623 if (entity->kind == ENTITY_ENUM_VALUE)
6624 kind = EXPR_REFERENCE_ENUM_VALUE;
6626 expression_t *expression = allocate_expression_zero(kind);
6627 expression->reference.entity = entity;
6628 expression->base.type = type;
6630 /* this declaration is used */
6631 if (is_declaration(entity)) {
6632 entity->declaration.used = true;
6635 if (entity->base.parent_scope != file_scope
6636 && entity->base.parent_scope->depth < current_function->parameters.depth
6637 && is_type_valid(orig_type) && !is_type_function(orig_type)) {
6638 if (entity->kind == ENTITY_VARIABLE) {
6639 /* access of a variable from an outer function */
6640 entity->variable.address_taken = true;
6642 current_function->need_closure = true;
6645 /* check for deprecated functions */
6646 if (warning.deprecated_declarations
6647 && is_declaration(entity)
6648 && entity->declaration.modifiers & DM_DEPRECATED) {
6649 declaration_t *declaration = &entity->declaration;
6651 char const *const prefix = entity->kind == ENTITY_FUNCTION ?
6652 "function" : "variable";
6654 if (declaration->deprecated_string != NULL) {
6655 warningf(HERE, "%s '%Y' is deprecated (declared %P): \"%s\"",
6656 prefix, entity->base.symbol, &entity->base.source_position,
6657 declaration->deprecated_string);
6659 warningf(HERE, "%s '%Y' is deprecated (declared %P)", prefix,
6660 entity->base.symbol, &entity->base.source_position);
6664 if (warning.init_self && entity == current_init_decl && !in_type_prop
6665 && entity->kind == ENTITY_VARIABLE) {
6666 current_init_decl = NULL;
6667 warningf(HERE, "variable '%#T' is initialized by itself",
6668 entity->declaration.type, entity->base.symbol);
6675 static bool semantic_cast(expression_t *cast)
6677 expression_t *expression = cast->unary.value;
6678 type_t *orig_dest_type = cast->base.type;
6679 type_t *orig_type_right = expression->base.type;
6680 type_t const *dst_type = skip_typeref(orig_dest_type);
6681 type_t const *src_type = skip_typeref(orig_type_right);
6682 source_position_t const *pos = &cast->base.source_position;
6684 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
6685 if (dst_type == type_void)
6688 /* only integer and pointer can be casted to pointer */
6689 if (is_type_pointer(dst_type) &&
6690 !is_type_pointer(src_type) &&
6691 !is_type_integer(src_type) &&
6692 is_type_valid(src_type)) {
6693 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
6697 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
6698 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
6702 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
6703 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
6707 if (warning.cast_qual &&
6708 is_type_pointer(src_type) &&
6709 is_type_pointer(dst_type)) {
6710 type_t *src = skip_typeref(src_type->pointer.points_to);
6711 type_t *dst = skip_typeref(dst_type->pointer.points_to);
6712 unsigned missing_qualifiers =
6713 src->base.qualifiers & ~dst->base.qualifiers;
6714 if (missing_qualifiers != 0) {
6716 "cast discards qualifiers '%Q' in pointer target type of '%T'",
6717 missing_qualifiers, orig_type_right);
6723 static expression_t *parse_compound_literal(type_t *type)
6725 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
6727 parse_initializer_env_t env;
6730 env.must_be_constant = false;
6731 initializer_t *initializer = parse_initializer(&env);
6734 expression->compound_literal.initializer = initializer;
6735 expression->compound_literal.type = type;
6736 expression->base.type = automatic_type_conversion(type);
6742 * Parse a cast expression.
6744 static expression_t *parse_cast(void)
6746 add_anchor_token(')');
6748 source_position_t source_position = token.source_position;
6750 type_t *type = parse_typename();
6752 rem_anchor_token(')');
6755 if (token.type == '{') {
6756 return parse_compound_literal(type);
6759 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
6760 cast->base.source_position = source_position;
6762 expression_t *value = parse_sub_expression(PREC_CAST);
6763 cast->base.type = type;
6764 cast->unary.value = value;
6766 if (! semantic_cast(cast)) {
6767 /* TODO: record the error in the AST. else it is impossible to detect it */
6772 return create_invalid_expression();
6776 * Parse a statement expression.
6778 static expression_t *parse_statement_expression(void)
6780 add_anchor_token(')');
6782 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6784 statement_t *statement = parse_compound_statement(true);
6785 expression->statement.statement = statement;
6787 /* find last statement and use its type */
6788 type_t *type = type_void;
6789 const statement_t *stmt = statement->compound.statements;
6791 while (stmt->base.next != NULL)
6792 stmt = stmt->base.next;
6794 if (stmt->kind == STATEMENT_EXPRESSION) {
6795 type = stmt->expression.expression->base.type;
6797 } else if (warning.other) {
6798 warningf(&expression->base.source_position, "empty statement expression ({})");
6800 expression->base.type = type;
6802 rem_anchor_token(')');
6810 * Parse a parenthesized expression.
6812 static expression_t *parse_parenthesized_expression(void)
6816 switch (token.type) {
6818 /* gcc extension: a statement expression */
6819 return parse_statement_expression();
6823 return parse_cast();
6825 if (is_typedef_symbol(token.v.symbol)) {
6826 return parse_cast();
6830 add_anchor_token(')');
6831 expression_t *result = parse_expression();
6832 rem_anchor_token(')');
6839 static expression_t *parse_function_keyword(void)
6843 if (current_function == NULL) {
6844 errorf(HERE, "'__func__' used outside of a function");
6847 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6848 expression->base.type = type_char_ptr;
6849 expression->funcname.kind = FUNCNAME_FUNCTION;
6856 static expression_t *parse_pretty_function_keyword(void)
6858 if (current_function == NULL) {
6859 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
6862 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6863 expression->base.type = type_char_ptr;
6864 expression->funcname.kind = FUNCNAME_PRETTY_FUNCTION;
6866 eat(T___PRETTY_FUNCTION__);
6871 static expression_t *parse_funcsig_keyword(void)
6873 if (current_function == NULL) {
6874 errorf(HERE, "'__FUNCSIG__' used outside of a function");
6877 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6878 expression->base.type = type_char_ptr;
6879 expression->funcname.kind = FUNCNAME_FUNCSIG;
6886 static expression_t *parse_funcdname_keyword(void)
6888 if (current_function == NULL) {
6889 errorf(HERE, "'__FUNCDNAME__' used outside of a function");
6892 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6893 expression->base.type = type_char_ptr;
6894 expression->funcname.kind = FUNCNAME_FUNCDNAME;
6896 eat(T___FUNCDNAME__);
6901 static designator_t *parse_designator(void)
6903 designator_t *result = allocate_ast_zero(sizeof(result[0]));
6904 result->source_position = *HERE;
6906 if (token.type != T_IDENTIFIER) {
6907 parse_error_expected("while parsing member designator",
6908 T_IDENTIFIER, NULL);
6911 result->symbol = token.v.symbol;
6914 designator_t *last_designator = result;
6916 if (token.type == '.') {
6918 if (token.type != T_IDENTIFIER) {
6919 parse_error_expected("while parsing member designator",
6920 T_IDENTIFIER, NULL);
6923 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6924 designator->source_position = *HERE;
6925 designator->symbol = token.v.symbol;
6928 last_designator->next = designator;
6929 last_designator = designator;
6932 if (token.type == '[') {
6934 add_anchor_token(']');
6935 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6936 designator->source_position = *HERE;
6937 designator->array_index = parse_expression();
6938 rem_anchor_token(']');
6940 if (designator->array_index == NULL) {
6944 last_designator->next = designator;
6945 last_designator = designator;
6957 * Parse the __builtin_offsetof() expression.
6959 static expression_t *parse_offsetof(void)
6961 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6962 expression->base.type = type_size_t;
6964 eat(T___builtin_offsetof);
6967 add_anchor_token(',');
6968 type_t *type = parse_typename();
6969 rem_anchor_token(',');
6971 add_anchor_token(')');
6972 designator_t *designator = parse_designator();
6973 rem_anchor_token(')');
6976 expression->offsetofe.type = type;
6977 expression->offsetofe.designator = designator;
6980 memset(&path, 0, sizeof(path));
6981 path.top_type = type;
6982 path.path = NEW_ARR_F(type_path_entry_t, 0);
6984 descend_into_subtype(&path);
6986 if (!walk_designator(&path, designator, true)) {
6987 return create_invalid_expression();
6990 DEL_ARR_F(path.path);
6994 return create_invalid_expression();
6998 * Parses a _builtin_va_start() expression.
7000 static expression_t *parse_va_start(void)
7002 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
7004 eat(T___builtin_va_start);
7007 add_anchor_token(',');
7008 expression->va_starte.ap = parse_assignment_expression();
7009 rem_anchor_token(',');
7011 expression_t *const expr = parse_assignment_expression();
7012 if (expr->kind == EXPR_REFERENCE) {
7013 entity_t *const entity = expr->reference.entity;
7014 if (entity->base.parent_scope != ¤t_function->parameters
7015 || entity->base.next != NULL
7016 || entity->kind != ENTITY_VARIABLE) {
7017 errorf(&expr->base.source_position,
7018 "second argument of 'va_start' must be last parameter of the current function");
7020 expression->va_starte.parameter = &entity->variable;
7027 return create_invalid_expression();
7031 * Parses a _builtin_va_arg() expression.
7033 static expression_t *parse_va_arg(void)
7035 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
7037 eat(T___builtin_va_arg);
7040 expression->va_arge.ap = parse_assignment_expression();
7042 expression->base.type = parse_typename();
7047 return create_invalid_expression();
7050 static expression_t *parse_builtin_symbol(void)
7052 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_SYMBOL);
7054 symbol_t *symbol = token.v.symbol;
7056 expression->builtin_symbol.symbol = symbol;
7059 type_t *type = get_builtin_symbol_type(symbol);
7060 type = automatic_type_conversion(type);
7062 expression->base.type = type;
7067 * Parses a __builtin_constant() expression.
7069 static expression_t *parse_builtin_constant(void)
7071 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
7073 eat(T___builtin_constant_p);
7076 add_anchor_token(')');
7077 expression->builtin_constant.value = parse_assignment_expression();
7078 rem_anchor_token(')');
7080 expression->base.type = type_int;
7084 return create_invalid_expression();
7088 * Parses a __builtin_prefetch() expression.
7090 static expression_t *parse_builtin_prefetch(void)
7092 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_PREFETCH);
7094 eat(T___builtin_prefetch);
7097 add_anchor_token(')');
7098 expression->builtin_prefetch.adr = parse_assignment_expression();
7099 if (token.type == ',') {
7101 expression->builtin_prefetch.rw = parse_assignment_expression();
7103 if (token.type == ',') {
7105 expression->builtin_prefetch.locality = parse_assignment_expression();
7107 rem_anchor_token(')');
7109 expression->base.type = type_void;
7113 return create_invalid_expression();
7117 * Parses a __builtin_is_*() compare expression.
7119 static expression_t *parse_compare_builtin(void)
7121 expression_t *expression;
7123 switch (token.type) {
7124 case T___builtin_isgreater:
7125 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
7127 case T___builtin_isgreaterequal:
7128 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
7130 case T___builtin_isless:
7131 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
7133 case T___builtin_islessequal:
7134 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
7136 case T___builtin_islessgreater:
7137 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
7139 case T___builtin_isunordered:
7140 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
7143 internal_errorf(HERE, "invalid compare builtin found");
7145 expression->base.source_position = *HERE;
7149 expression->binary.left = parse_assignment_expression();
7151 expression->binary.right = parse_assignment_expression();
7154 type_t *const orig_type_left = expression->binary.left->base.type;
7155 type_t *const orig_type_right = expression->binary.right->base.type;
7157 type_t *const type_left = skip_typeref(orig_type_left);
7158 type_t *const type_right = skip_typeref(orig_type_right);
7159 if (!is_type_float(type_left) && !is_type_float(type_right)) {
7160 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7161 type_error_incompatible("invalid operands in comparison",
7162 &expression->base.source_position, orig_type_left, orig_type_right);
7165 semantic_comparison(&expression->binary);
7170 return create_invalid_expression();
7175 * Parses a __builtin_expect() expression.
7177 static expression_t *parse_builtin_expect(void)
7179 expression_t *expression
7180 = allocate_expression_zero(EXPR_BINARY_BUILTIN_EXPECT);
7182 eat(T___builtin_expect);
7185 expression->binary.left = parse_assignment_expression();
7187 expression->binary.right = parse_constant_expression();
7190 expression->base.type = expression->binary.left->base.type;
7194 return create_invalid_expression();
7199 * Parses a MS assume() expression.
7201 static expression_t *parse_assume(void)
7203 expression_t *expression = allocate_expression_zero(EXPR_UNARY_ASSUME);
7208 add_anchor_token(')');
7209 expression->unary.value = parse_assignment_expression();
7210 rem_anchor_token(')');
7213 expression->base.type = type_void;
7216 return create_invalid_expression();
7220 * Return the declaration for a given label symbol or create a new one.
7222 * @param symbol the symbol of the label
7224 static label_t *get_label(symbol_t *symbol)
7227 assert(current_function != NULL);
7229 label = get_entity(symbol, NAMESPACE_LOCAL_LABEL);
7230 /* if we found a local label, we already created the declaration */
7231 if (label != NULL && label->kind == ENTITY_LOCAL_LABEL) {
7232 if (label->base.parent_scope != scope) {
7233 assert(label->base.parent_scope->depth < scope->depth);
7234 current_function->goto_to_outer = true;
7236 return &label->label;
7239 label = get_entity(symbol, NAMESPACE_LABEL);
7240 /* if we found a label in the same function, then we already created the
7243 && label->base.parent_scope == ¤t_function->parameters) {
7244 return &label->label;
7247 /* otherwise we need to create a new one */
7248 label = allocate_entity_zero(ENTITY_LABEL);
7249 label->base.namespc = NAMESPACE_LABEL;
7250 label->base.symbol = symbol;
7254 return &label->label;
7258 * Parses a GNU && label address expression.
7260 static expression_t *parse_label_address(void)
7262 source_position_t source_position = token.source_position;
7264 if (token.type != T_IDENTIFIER) {
7265 parse_error_expected("while parsing label address", T_IDENTIFIER, NULL);
7268 symbol_t *symbol = token.v.symbol;
7271 label_t *label = get_label(symbol);
7273 label->address_taken = true;
7275 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
7276 expression->base.source_position = source_position;
7278 /* label address is threaten as a void pointer */
7279 expression->base.type = type_void_ptr;
7280 expression->label_address.label = label;
7283 return create_invalid_expression();
7287 * Parse a microsoft __noop expression.
7289 static expression_t *parse_noop_expression(void)
7291 /* the result is a (int)0 */
7292 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
7293 cnst->base.type = type_int;
7294 cnst->conste.v.int_value = 0;
7295 cnst->conste.is_ms_noop = true;
7299 if (token.type == '(') {
7300 /* parse arguments */
7302 add_anchor_token(')');
7303 add_anchor_token(',');
7305 if (token.type != ')') {
7307 (void)parse_assignment_expression();
7308 if (token.type != ',')
7314 rem_anchor_token(',');
7315 rem_anchor_token(')');
7323 * Parses a primary expression.
7325 static expression_t *parse_primary_expression(void)
7327 switch (token.type) {
7328 case T_INTEGER: return parse_int_const();
7329 case T_CHARACTER_CONSTANT: return parse_character_constant();
7330 case T_WIDE_CHARACTER_CONSTANT: return parse_wide_character_constant();
7331 case T_FLOATINGPOINT: return parse_float_const();
7332 case T_STRING_LITERAL:
7333 case T_WIDE_STRING_LITERAL: return parse_string_const();
7334 case T_IDENTIFIER: return parse_reference();
7335 case T___FUNCTION__:
7336 case T___func__: return parse_function_keyword();
7337 case T___PRETTY_FUNCTION__: return parse_pretty_function_keyword();
7338 case T___FUNCSIG__: return parse_funcsig_keyword();
7339 case T___FUNCDNAME__: return parse_funcdname_keyword();
7340 case T___builtin_offsetof: return parse_offsetof();
7341 case T___builtin_va_start: return parse_va_start();
7342 case T___builtin_va_arg: return parse_va_arg();
7343 case T___builtin_expect:
7344 case T___builtin_alloca:
7345 case T___builtin_inf:
7346 case T___builtin_inff:
7347 case T___builtin_infl:
7348 case T___builtin_nan:
7349 case T___builtin_nanf:
7350 case T___builtin_nanl:
7351 case T___builtin_huge_val:
7352 case T___builtin_va_end: return parse_builtin_symbol();
7353 case T___builtin_isgreater:
7354 case T___builtin_isgreaterequal:
7355 case T___builtin_isless:
7356 case T___builtin_islessequal:
7357 case T___builtin_islessgreater:
7358 case T___builtin_isunordered: return parse_compare_builtin();
7359 case T___builtin_constant_p: return parse_builtin_constant();
7360 case T___builtin_prefetch: return parse_builtin_prefetch();
7361 case T__assume: return parse_assume();
7364 return parse_label_address();
7367 case '(': return parse_parenthesized_expression();
7368 case T___noop: return parse_noop_expression();
7371 errorf(HERE, "unexpected token %K, expected an expression", &token);
7372 return create_invalid_expression();
7376 * Check if the expression has the character type and issue a warning then.
7378 static void check_for_char_index_type(const expression_t *expression)
7380 type_t *const type = expression->base.type;
7381 const type_t *const base_type = skip_typeref(type);
7383 if (is_type_atomic(base_type, ATOMIC_TYPE_CHAR) &&
7384 warning.char_subscripts) {
7385 warningf(&expression->base.source_position,
7386 "array subscript has type '%T'", type);
7390 static expression_t *parse_array_expression(expression_t *left)
7392 expression_t *expression = allocate_expression_zero(EXPR_ARRAY_ACCESS);
7395 add_anchor_token(']');
7397 expression_t *inside = parse_expression();
7399 type_t *const orig_type_left = left->base.type;
7400 type_t *const orig_type_inside = inside->base.type;
7402 type_t *const type_left = skip_typeref(orig_type_left);
7403 type_t *const type_inside = skip_typeref(orig_type_inside);
7405 type_t *return_type;
7406 array_access_expression_t *array_access = &expression->array_access;
7407 if (is_type_pointer(type_left)) {
7408 return_type = type_left->pointer.points_to;
7409 array_access->array_ref = left;
7410 array_access->index = inside;
7411 check_for_char_index_type(inside);
7412 } else if (is_type_pointer(type_inside)) {
7413 return_type = type_inside->pointer.points_to;
7414 array_access->array_ref = inside;
7415 array_access->index = left;
7416 array_access->flipped = true;
7417 check_for_char_index_type(left);
7419 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
7421 "array access on object with non-pointer types '%T', '%T'",
7422 orig_type_left, orig_type_inside);
7424 return_type = type_error_type;
7425 array_access->array_ref = left;
7426 array_access->index = inside;
7429 expression->base.type = automatic_type_conversion(return_type);
7431 rem_anchor_token(']');
7437 static expression_t *parse_typeprop(expression_kind_t const kind)
7439 expression_t *tp_expression = allocate_expression_zero(kind);
7440 tp_expression->base.type = type_size_t;
7442 eat(kind == EXPR_SIZEOF ? T_sizeof : T___alignof__);
7444 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7446 /* we only refer to a type property, mark this case */
7447 bool old = in_type_prop;
7448 in_type_prop = true;
7451 expression_t *expression;
7452 if (token.type == '(' && is_declaration_specifier(look_ahead(1), true)) {
7454 add_anchor_token(')');
7455 orig_type = parse_typename();
7456 rem_anchor_token(')');
7459 if (token.type == '{') {
7460 /* It was not sizeof(type) after all. It is sizeof of an expression
7461 * starting with a compound literal */
7462 expression = parse_compound_literal(orig_type);
7463 goto typeprop_expression;
7466 expression = parse_sub_expression(PREC_UNARY);
7468 typeprop_expression:
7469 tp_expression->typeprop.tp_expression = expression;
7471 orig_type = revert_automatic_type_conversion(expression);
7472 expression->base.type = orig_type;
7475 tp_expression->typeprop.type = orig_type;
7476 type_t const* const type = skip_typeref(orig_type);
7477 char const* const wrong_type =
7478 is_type_incomplete(type) ? "incomplete" :
7479 type->kind == TYPE_FUNCTION ? "function designator" :
7480 type->kind == TYPE_BITFIELD ? "bitfield" :
7482 if (wrong_type != NULL) {
7483 errorf(&tp_expression->base.source_position,
7484 "operand of %s expression must not be of %s type '%T'",
7485 what, wrong_type, orig_type);
7490 return tp_expression;
7493 static expression_t *parse_sizeof(void)
7495 return parse_typeprop(EXPR_SIZEOF);
7498 static expression_t *parse_alignof(void)
7500 return parse_typeprop(EXPR_ALIGNOF);
7503 static expression_t *parse_select_expression(expression_t *compound)
7505 expression_t *select = allocate_expression_zero(EXPR_SELECT);
7506 select->select.compound = compound;
7508 assert(token.type == '.' || token.type == T_MINUSGREATER);
7509 bool is_pointer = (token.type == T_MINUSGREATER);
7512 if (token.type != T_IDENTIFIER) {
7513 parse_error_expected("while parsing select", T_IDENTIFIER, NULL);
7516 symbol_t *symbol = token.v.symbol;
7519 type_t *const orig_type = compound->base.type;
7520 type_t *const type = skip_typeref(orig_type);
7523 bool saw_error = false;
7524 if (is_type_pointer(type)) {
7527 "request for member '%Y' in something not a struct or union, but '%T'",
7531 type_left = skip_typeref(type->pointer.points_to);
7533 if (is_pointer && is_type_valid(type)) {
7534 errorf(HERE, "left hand side of '->' is not a pointer, but '%T'", orig_type);
7541 if (type_left->kind == TYPE_COMPOUND_STRUCT ||
7542 type_left->kind == TYPE_COMPOUND_UNION) {
7543 compound_t *compound = type_left->compound.compound;
7545 if (!compound->complete) {
7546 errorf(HERE, "request for member '%Y' of incomplete type '%T'",
7548 goto create_error_entry;
7551 entry = find_compound_entry(compound, symbol);
7552 if (entry == NULL) {
7553 errorf(HERE, "'%T' has no member named '%Y'", orig_type, symbol);
7554 goto create_error_entry;
7557 if (is_type_valid(type_left) && !saw_error) {
7559 "request for member '%Y' in something not a struct or union, but '%T'",
7563 return create_invalid_expression();
7566 assert(is_declaration(entry));
7567 select->select.compound_entry = entry;
7569 type_t *entry_type = entry->declaration.type;
7571 = get_qualified_type(entry_type, type_left->base.qualifiers);
7573 /* we always do the auto-type conversions; the & and sizeof parser contains
7574 * code to revert this! */
7575 select->base.type = automatic_type_conversion(res_type);
7577 type_t *skipped = skip_typeref(res_type);
7578 if (skipped->kind == TYPE_BITFIELD) {
7579 select->base.type = skipped->bitfield.base_type;
7585 static void check_call_argument(const function_parameter_t *parameter,
7586 call_argument_t *argument, unsigned pos)
7588 type_t *expected_type = parameter->type;
7589 type_t *expected_type_skip = skip_typeref(expected_type);
7590 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
7591 expression_t *arg_expr = argument->expression;
7592 type_t *arg_type = skip_typeref(arg_expr->base.type);
7594 /* handle transparent union gnu extension */
7595 if (is_type_union(expected_type_skip)
7596 && (expected_type_skip->base.modifiers
7597 & TYPE_MODIFIER_TRANSPARENT_UNION)) {
7598 compound_t *union_decl = expected_type_skip->compound.compound;
7599 type_t *best_type = NULL;
7600 entity_t *entry = union_decl->members.entities;
7601 for ( ; entry != NULL; entry = entry->base.next) {
7602 assert(is_declaration(entry));
7603 type_t *decl_type = entry->declaration.type;
7604 error = semantic_assign(decl_type, arg_expr);
7605 if (error == ASSIGN_ERROR_INCOMPATIBLE
7606 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
7609 if (error == ASSIGN_SUCCESS) {
7610 best_type = decl_type;
7611 } else if (best_type == NULL) {
7612 best_type = decl_type;
7616 if (best_type != NULL) {
7617 expected_type = best_type;
7621 error = semantic_assign(expected_type, arg_expr);
7622 argument->expression = create_implicit_cast(argument->expression,
7625 if (error != ASSIGN_SUCCESS) {
7626 /* report exact scope in error messages (like "in argument 3") */
7628 snprintf(buf, sizeof(buf), "call argument %u", pos);
7629 report_assign_error(error, expected_type, arg_expr, buf,
7630 &arg_expr->base.source_position);
7631 } else if (warning.traditional || warning.conversion) {
7632 type_t *const promoted_type = get_default_promoted_type(arg_type);
7633 if (!types_compatible(expected_type_skip, promoted_type) &&
7634 !types_compatible(expected_type_skip, type_void_ptr) &&
7635 !types_compatible(type_void_ptr, promoted_type)) {
7636 /* Deliberately show the skipped types in this warning */
7637 warningf(&arg_expr->base.source_position,
7638 "passing call argument %u as '%T' rather than '%T' due to prototype",
7639 pos, expected_type_skip, promoted_type);
7645 * Parse a call expression, ie. expression '( ... )'.
7647 * @param expression the function address
7649 static expression_t *parse_call_expression(expression_t *expression)
7651 expression_t *result = allocate_expression_zero(EXPR_CALL);
7652 call_expression_t *call = &result->call;
7653 call->function = expression;
7655 type_t *const orig_type = expression->base.type;
7656 type_t *const type = skip_typeref(orig_type);
7658 function_type_t *function_type = NULL;
7659 if (is_type_pointer(type)) {
7660 type_t *const to_type = skip_typeref(type->pointer.points_to);
7662 if (is_type_function(to_type)) {
7663 function_type = &to_type->function;
7664 call->base.type = function_type->return_type;
7668 if (function_type == NULL && is_type_valid(type)) {
7669 errorf(HERE, "called object '%E' (type '%T') is not a pointer to a function", expression, orig_type);
7672 /* parse arguments */
7674 add_anchor_token(')');
7675 add_anchor_token(',');
7677 if (token.type != ')') {
7678 call_argument_t *last_argument = NULL;
7681 call_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
7683 argument->expression = parse_assignment_expression();
7684 if (last_argument == NULL) {
7685 call->arguments = argument;
7687 last_argument->next = argument;
7689 last_argument = argument;
7691 if (token.type != ',')
7696 rem_anchor_token(',');
7697 rem_anchor_token(')');
7700 if (function_type == NULL)
7703 function_parameter_t *parameter = function_type->parameters;
7704 call_argument_t *argument = call->arguments;
7705 if (!function_type->unspecified_parameters) {
7706 for (unsigned pos = 0; parameter != NULL && argument != NULL;
7707 parameter = parameter->next, argument = argument->next) {
7708 check_call_argument(parameter, argument, ++pos);
7711 if (parameter != NULL) {
7712 errorf(HERE, "too few arguments to function '%E'", expression);
7713 } else if (argument != NULL && !function_type->variadic) {
7714 errorf(HERE, "too many arguments to function '%E'", expression);
7718 /* do default promotion */
7719 for( ; argument != NULL; argument = argument->next) {
7720 type_t *type = argument->expression->base.type;
7722 type = get_default_promoted_type(type);
7724 argument->expression
7725 = create_implicit_cast(argument->expression, type);
7728 check_format(&result->call);
7730 if (warning.aggregate_return &&
7731 is_type_compound(skip_typeref(function_type->return_type))) {
7732 warningf(&result->base.source_position,
7733 "function call has aggregate value");
7740 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
7742 static bool same_compound_type(const type_t *type1, const type_t *type2)
7745 is_type_compound(type1) &&
7746 type1->kind == type2->kind &&
7747 type1->compound.compound == type2->compound.compound;
7751 * Parse a conditional expression, ie. 'expression ? ... : ...'.
7753 * @param expression the conditional expression
7755 static expression_t *parse_conditional_expression(expression_t *expression)
7757 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
7759 conditional_expression_t *conditional = &result->conditional;
7760 conditional->condition = expression;
7763 add_anchor_token(':');
7766 type_t *const condition_type_orig = expression->base.type;
7767 type_t *const condition_type = skip_typeref(condition_type_orig);
7768 if (!is_type_scalar(condition_type) && is_type_valid(condition_type)) {
7769 type_error("expected a scalar type in conditional condition",
7770 &expression->base.source_position, condition_type_orig);
7773 expression_t *true_expression = expression;
7774 bool gnu_cond = false;
7775 if (GNU_MODE && token.type == ':') {
7778 true_expression = parse_expression();
7780 rem_anchor_token(':');
7782 expression_t *false_expression =
7783 parse_sub_expression(c_mode & _CXX ? PREC_ASSIGNMENT : PREC_CONDITIONAL);
7785 type_t *const orig_true_type = true_expression->base.type;
7786 type_t *const orig_false_type = false_expression->base.type;
7787 type_t *const true_type = skip_typeref(orig_true_type);
7788 type_t *const false_type = skip_typeref(orig_false_type);
7791 type_t *result_type;
7792 if (is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7793 is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
7794 /* ISO/IEC 14882:1998(E) §5.16:2 */
7795 if (true_expression->kind == EXPR_UNARY_THROW) {
7796 result_type = false_type;
7797 } else if (false_expression->kind == EXPR_UNARY_THROW) {
7798 result_type = true_type;
7800 if (warning.other && (
7801 !is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7802 !is_type_atomic(false_type, ATOMIC_TYPE_VOID)
7804 warningf(&conditional->base.source_position,
7805 "ISO C forbids conditional expression with only one void side");
7807 result_type = type_void;
7809 } else if (is_type_arithmetic(true_type)
7810 && is_type_arithmetic(false_type)) {
7811 result_type = semantic_arithmetic(true_type, false_type);
7813 true_expression = create_implicit_cast(true_expression, result_type);
7814 false_expression = create_implicit_cast(false_expression, result_type);
7816 conditional->true_expression = true_expression;
7817 conditional->false_expression = false_expression;
7818 conditional->base.type = result_type;
7819 } else if (same_compound_type(true_type, false_type)) {
7820 /* just take 1 of the 2 types */
7821 result_type = true_type;
7822 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
7823 type_t *pointer_type;
7825 expression_t *other_expression;
7826 if (is_type_pointer(true_type) &&
7827 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
7828 pointer_type = true_type;
7829 other_type = false_type;
7830 other_expression = false_expression;
7832 pointer_type = false_type;
7833 other_type = true_type;
7834 other_expression = true_expression;
7837 if (is_null_pointer_constant(other_expression)) {
7838 result_type = pointer_type;
7839 } else if (is_type_pointer(other_type)) {
7840 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
7841 type_t *to2 = skip_typeref(other_type->pointer.points_to);
7844 if (is_type_atomic(to1, ATOMIC_TYPE_VOID) ||
7845 is_type_atomic(to2, ATOMIC_TYPE_VOID)) {
7847 } else if (types_compatible(get_unqualified_type(to1),
7848 get_unqualified_type(to2))) {
7851 if (warning.other) {
7852 warningf(&conditional->base.source_position,
7853 "pointer types '%T' and '%T' in conditional expression are incompatible",
7854 true_type, false_type);
7859 type_t *const type =
7860 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
7861 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7862 } else if (is_type_integer(other_type)) {
7863 if (warning.other) {
7864 warningf(&conditional->base.source_position,
7865 "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7867 result_type = pointer_type;
7869 if (is_type_valid(other_type)) {
7870 type_error_incompatible("while parsing conditional",
7871 &expression->base.source_position, true_type, false_type);
7873 result_type = type_error_type;
7876 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7877 type_error_incompatible("while parsing conditional",
7878 &conditional->base.source_position, true_type,
7881 result_type = type_error_type;
7884 conditional->true_expression
7885 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7886 conditional->false_expression
7887 = create_implicit_cast(false_expression, result_type);
7888 conditional->base.type = result_type;
7891 return create_invalid_expression();
7895 * Parse an extension expression.
7897 static expression_t *parse_extension(void)
7899 eat(T___extension__);
7901 bool old_gcc_extension = in_gcc_extension;
7902 in_gcc_extension = true;
7903 expression_t *expression = parse_sub_expression(PREC_UNARY);
7904 in_gcc_extension = old_gcc_extension;
7909 * Parse a __builtin_classify_type() expression.
7911 static expression_t *parse_builtin_classify_type(void)
7913 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7914 result->base.type = type_int;
7916 eat(T___builtin_classify_type);
7919 add_anchor_token(')');
7920 expression_t *expression = parse_expression();
7921 rem_anchor_token(')');
7923 result->classify_type.type_expression = expression;
7927 return create_invalid_expression();
7931 * Parse a delete expression
7932 * ISO/IEC 14882:1998(E) §5.3.5
7934 static expression_t *parse_delete(void)
7936 expression_t *const result = allocate_expression_zero(EXPR_UNARY_DELETE);
7937 result->base.type = type_void;
7941 if (token.type == '[') {
7943 result->kind = EXPR_UNARY_DELETE_ARRAY;
7948 expression_t *const value = parse_sub_expression(PREC_CAST);
7949 result->unary.value = value;
7951 type_t *const type = skip_typeref(value->base.type);
7952 if (!is_type_pointer(type)) {
7953 errorf(&value->base.source_position,
7954 "operand of delete must have pointer type");
7955 } else if (warning.other &&
7956 is_type_atomic(skip_typeref(type->pointer.points_to), ATOMIC_TYPE_VOID)) {
7957 warningf(&value->base.source_position,
7958 "deleting 'void*' is undefined");
7965 * Parse a throw expression
7966 * ISO/IEC 14882:1998(E) §15:1
7968 static expression_t *parse_throw(void)
7970 expression_t *const result = allocate_expression_zero(EXPR_UNARY_THROW);
7971 result->base.type = type_void;
7975 expression_t *value = NULL;
7976 switch (token.type) {
7978 value = parse_assignment_expression();
7979 /* ISO/IEC 14882:1998(E) §15.1:3 */
7980 type_t *const orig_type = value->base.type;
7981 type_t *const type = skip_typeref(orig_type);
7982 if (is_type_incomplete(type)) {
7983 errorf(&value->base.source_position,
7984 "cannot throw object of incomplete type '%T'", orig_type);
7985 } else if (is_type_pointer(type)) {
7986 type_t *const points_to = skip_typeref(type->pointer.points_to);
7987 if (is_type_incomplete(points_to) &&
7988 !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7989 errorf(&value->base.source_position,
7990 "cannot throw pointer to incomplete type '%T'", orig_type);
7998 result->unary.value = value;
8003 static bool check_pointer_arithmetic(const source_position_t *source_position,
8004 type_t *pointer_type,
8005 type_t *orig_pointer_type)
8007 type_t *points_to = pointer_type->pointer.points_to;
8008 points_to = skip_typeref(points_to);
8010 if (is_type_incomplete(points_to)) {
8011 if (!GNU_MODE || !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
8012 errorf(source_position,
8013 "arithmetic with pointer to incomplete type '%T' not allowed",
8016 } else if (warning.pointer_arith) {
8017 warningf(source_position,
8018 "pointer of type '%T' used in arithmetic",
8021 } else if (is_type_function(points_to)) {
8023 errorf(source_position,
8024 "arithmetic with pointer to function type '%T' not allowed",
8027 } else if (warning.pointer_arith) {
8028 warningf(source_position,
8029 "pointer to a function '%T' used in arithmetic",
8036 static bool is_lvalue(const expression_t *expression)
8038 /* TODO: doesn't seem to be consistent with §6.3.2.1 (1) */
8039 switch (expression->kind) {
8040 case EXPR_REFERENCE:
8041 case EXPR_ARRAY_ACCESS:
8043 case EXPR_UNARY_DEREFERENCE:
8047 /* Claim it is an lvalue, if the type is invalid. There was a parse
8048 * error before, which maybe prevented properly recognizing it as
8050 return !is_type_valid(skip_typeref(expression->base.type));
8054 static void semantic_incdec(unary_expression_t *expression)
8056 type_t *const orig_type = expression->value->base.type;
8057 type_t *const type = skip_typeref(orig_type);
8058 if (is_type_pointer(type)) {
8059 if (!check_pointer_arithmetic(&expression->base.source_position,
8063 } else if (!is_type_real(type) && is_type_valid(type)) {
8064 /* TODO: improve error message */
8065 errorf(&expression->base.source_position,
8066 "operation needs an arithmetic or pointer type");
8069 if (!is_lvalue(expression->value)) {
8070 /* TODO: improve error message */
8071 errorf(&expression->base.source_position, "lvalue required as operand");
8073 expression->base.type = orig_type;
8076 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
8078 type_t *const orig_type = expression->value->base.type;
8079 type_t *const type = skip_typeref(orig_type);
8080 if (!is_type_arithmetic(type)) {
8081 if (is_type_valid(type)) {
8082 /* TODO: improve error message */
8083 errorf(&expression->base.source_position,
8084 "operation needs an arithmetic type");
8089 expression->base.type = orig_type;
8092 static void semantic_unexpr_plus(unary_expression_t *expression)
8094 semantic_unexpr_arithmetic(expression);
8095 if (warning.traditional)
8096 warningf(&expression->base.source_position,
8097 "traditional C rejects the unary plus operator");
8100 static expression_t const *get_reference_address(expression_t const *expr)
8102 bool regular_take_address = true;
8104 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
8105 expr = expr->unary.value;
8107 regular_take_address = false;
8110 if (expr->kind != EXPR_UNARY_DEREFERENCE)
8113 expr = expr->unary.value;
8116 /* special case for functions which are automatically converted to a
8117 * pointer to function without an extra TAKE_ADDRESS operation */
8118 if (!regular_take_address && expr->kind == EXPR_REFERENCE
8119 && expr->reference.entity->kind == ENTITY_FUNCTION) {
8126 static void warn_function_address_as_bool(expression_t const* expr)
8128 if (!warning.address)
8131 expr = get_reference_address(expr);
8133 warningf(&expr->base.source_position,
8134 "the address of '%Y' will always evaluate as 'true'",
8135 expr->reference.entity->base.symbol);
8139 static void semantic_not(unary_expression_t *expression)
8141 type_t *const orig_type = expression->value->base.type;
8142 type_t *const type = skip_typeref(orig_type);
8143 if (!is_type_scalar(type) && is_type_valid(type)) {
8144 errorf(&expression->base.source_position,
8145 "operand of ! must be of scalar type");
8148 warn_function_address_as_bool(expression->value);
8150 expression->base.type = type_int;
8153 static void semantic_unexpr_integer(unary_expression_t *expression)
8155 type_t *const orig_type = expression->value->base.type;
8156 type_t *const type = skip_typeref(orig_type);
8157 if (!is_type_integer(type)) {
8158 if (is_type_valid(type)) {
8159 errorf(&expression->base.source_position,
8160 "operand of ~ must be of integer type");
8165 expression->base.type = orig_type;
8168 static void semantic_dereference(unary_expression_t *expression)
8170 type_t *const orig_type = expression->value->base.type;
8171 type_t *const type = skip_typeref(orig_type);
8172 if (!is_type_pointer(type)) {
8173 if (is_type_valid(type)) {
8174 errorf(&expression->base.source_position,
8175 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
8180 type_t *result_type = type->pointer.points_to;
8181 result_type = automatic_type_conversion(result_type);
8182 expression->base.type = result_type;
8186 * Record that an address is taken (expression represents an lvalue).
8188 * @param expression the expression
8189 * @param may_be_register if true, the expression might be an register
8191 static void set_address_taken(expression_t *expression, bool may_be_register)
8193 if (expression->kind != EXPR_REFERENCE)
8196 entity_t *const entity = expression->reference.entity;
8198 if (entity->kind != ENTITY_VARIABLE)
8201 if (entity->declaration.storage_class == STORAGE_CLASS_REGISTER
8202 && !may_be_register) {
8203 errorf(&expression->base.source_position,
8204 "address of register variable '%Y' requested",
8205 entity->base.symbol);
8208 entity->variable.address_taken = true;
8212 * Check the semantic of the address taken expression.
8214 static void semantic_take_addr(unary_expression_t *expression)
8216 expression_t *value = expression->value;
8217 value->base.type = revert_automatic_type_conversion(value);
8219 type_t *orig_type = value->base.type;
8220 type_t *type = skip_typeref(orig_type);
8221 if (!is_type_valid(type))
8225 if (value->kind != EXPR_ARRAY_ACCESS
8226 && value->kind != EXPR_UNARY_DEREFERENCE
8227 && !is_lvalue(value)) {
8228 errorf(&expression->base.source_position,
8229 "'&' requires an lvalue");
8231 if (type->kind == TYPE_BITFIELD) {
8232 errorf(&expression->base.source_position,
8233 "'&' not allowed on object with bitfield type '%T'",
8237 set_address_taken(value, false);
8239 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
8242 #define CREATE_UNARY_EXPRESSION_PARSER(token_type, unexpression_type, sfunc) \
8243 static expression_t *parse_##unexpression_type(void) \
8245 expression_t *unary_expression \
8246 = allocate_expression_zero(unexpression_type); \
8248 unary_expression->unary.value = parse_sub_expression(PREC_UNARY); \
8250 sfunc(&unary_expression->unary); \
8252 return unary_expression; \
8255 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
8256 semantic_unexpr_arithmetic)
8257 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
8258 semantic_unexpr_plus)
8259 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
8261 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
8262 semantic_dereference)
8263 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
8265 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
8266 semantic_unexpr_integer)
8267 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
8269 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
8272 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_type, unexpression_type, \
8274 static expression_t *parse_##unexpression_type(expression_t *left) \
8276 expression_t *unary_expression \
8277 = allocate_expression_zero(unexpression_type); \
8279 unary_expression->unary.value = left; \
8281 sfunc(&unary_expression->unary); \
8283 return unary_expression; \
8286 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
8287 EXPR_UNARY_POSTFIX_INCREMENT,
8289 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
8290 EXPR_UNARY_POSTFIX_DECREMENT,
8293 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
8295 /* TODO: handle complex + imaginary types */
8297 type_left = get_unqualified_type(type_left);
8298 type_right = get_unqualified_type(type_right);
8300 /* § 6.3.1.8 Usual arithmetic conversions */
8301 if (type_left == type_long_double || type_right == type_long_double) {
8302 return type_long_double;
8303 } else if (type_left == type_double || type_right == type_double) {
8305 } else if (type_left == type_float || type_right == type_float) {
8309 type_left = promote_integer(type_left);
8310 type_right = promote_integer(type_right);
8312 if (type_left == type_right)
8315 bool const signed_left = is_type_signed(type_left);
8316 bool const signed_right = is_type_signed(type_right);
8317 int const rank_left = get_rank(type_left);
8318 int const rank_right = get_rank(type_right);
8320 if (signed_left == signed_right)
8321 return rank_left >= rank_right ? type_left : type_right;
8330 u_rank = rank_right;
8331 u_type = type_right;
8333 s_rank = rank_right;
8334 s_type = type_right;
8339 if (u_rank >= s_rank)
8342 /* casting rank to atomic_type_kind is a bit hacky, but makes things
8344 if (get_atomic_type_size((atomic_type_kind_t) s_rank)
8345 > get_atomic_type_size((atomic_type_kind_t) u_rank))
8349 case ATOMIC_TYPE_INT: return type_unsigned_int;
8350 case ATOMIC_TYPE_LONG: return type_unsigned_long;
8351 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
8353 default: panic("invalid atomic type");
8358 * Check the semantic restrictions for a binary expression.
8360 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
8362 expression_t *const left = expression->left;
8363 expression_t *const right = expression->right;
8364 type_t *const orig_type_left = left->base.type;
8365 type_t *const orig_type_right = right->base.type;
8366 type_t *const type_left = skip_typeref(orig_type_left);
8367 type_t *const type_right = skip_typeref(orig_type_right);
8369 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8370 /* TODO: improve error message */
8371 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8372 errorf(&expression->base.source_position,
8373 "operation needs arithmetic types");
8378 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8379 expression->left = create_implicit_cast(left, arithmetic_type);
8380 expression->right = create_implicit_cast(right, arithmetic_type);
8381 expression->base.type = arithmetic_type;
8384 static void warn_div_by_zero(binary_expression_t const *const expression)
8386 if (!warning.div_by_zero ||
8387 !is_type_integer(expression->base.type))
8390 expression_t const *const right = expression->right;
8391 /* The type of the right operand can be different for /= */
8392 if (is_type_integer(right->base.type) &&
8393 is_constant_expression(right) &&
8394 fold_constant(right) == 0) {
8395 warningf(&expression->base.source_position, "division by zero");
8400 * Check the semantic restrictions for a div/mod expression.
8402 static void semantic_divmod_arithmetic(binary_expression_t *expression) {
8403 semantic_binexpr_arithmetic(expression);
8404 warn_div_by_zero(expression);
8407 static void semantic_shift_op(binary_expression_t *expression)
8409 expression_t *const left = expression->left;
8410 expression_t *const right = expression->right;
8411 type_t *const orig_type_left = left->base.type;
8412 type_t *const orig_type_right = right->base.type;
8413 type_t * type_left = skip_typeref(orig_type_left);
8414 type_t * type_right = skip_typeref(orig_type_right);
8416 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8417 /* TODO: improve error message */
8418 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8419 errorf(&expression->base.source_position,
8420 "operands of shift operation must have integer types");
8425 type_left = promote_integer(type_left);
8426 type_right = promote_integer(type_right);
8428 expression->left = create_implicit_cast(left, type_left);
8429 expression->right = create_implicit_cast(right, type_right);
8430 expression->base.type = type_left;
8433 static void semantic_add(binary_expression_t *expression)
8435 expression_t *const left = expression->left;
8436 expression_t *const right = expression->right;
8437 type_t *const orig_type_left = left->base.type;
8438 type_t *const orig_type_right = right->base.type;
8439 type_t *const type_left = skip_typeref(orig_type_left);
8440 type_t *const type_right = skip_typeref(orig_type_right);
8443 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8444 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8445 expression->left = create_implicit_cast(left, arithmetic_type);
8446 expression->right = create_implicit_cast(right, arithmetic_type);
8447 expression->base.type = arithmetic_type;
8449 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8450 check_pointer_arithmetic(&expression->base.source_position,
8451 type_left, orig_type_left);
8452 expression->base.type = type_left;
8453 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
8454 check_pointer_arithmetic(&expression->base.source_position,
8455 type_right, orig_type_right);
8456 expression->base.type = type_right;
8457 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8458 errorf(&expression->base.source_position,
8459 "invalid operands to binary + ('%T', '%T')",
8460 orig_type_left, orig_type_right);
8464 static void semantic_sub(binary_expression_t *expression)
8466 expression_t *const left = expression->left;
8467 expression_t *const right = expression->right;
8468 type_t *const orig_type_left = left->base.type;
8469 type_t *const orig_type_right = right->base.type;
8470 type_t *const type_left = skip_typeref(orig_type_left);
8471 type_t *const type_right = skip_typeref(orig_type_right);
8472 source_position_t const *const pos = &expression->base.source_position;
8475 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8476 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8477 expression->left = create_implicit_cast(left, arithmetic_type);
8478 expression->right = create_implicit_cast(right, arithmetic_type);
8479 expression->base.type = arithmetic_type;
8481 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8482 check_pointer_arithmetic(&expression->base.source_position,
8483 type_left, orig_type_left);
8484 expression->base.type = type_left;
8485 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8486 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
8487 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
8488 if (!types_compatible(unqual_left, unqual_right)) {
8490 "subtracting pointers to incompatible types '%T' and '%T'",
8491 orig_type_left, orig_type_right);
8492 } else if (!is_type_object(unqual_left)) {
8493 if (!is_type_atomic(unqual_left, ATOMIC_TYPE_VOID)) {
8494 errorf(pos, "subtracting pointers to non-object types '%T'",
8496 } else if (warning.other) {
8497 warningf(pos, "subtracting pointers to void");
8500 expression->base.type = type_ptrdiff_t;
8501 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8502 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
8503 orig_type_left, orig_type_right);
8507 static void warn_string_literal_address(expression_t const* expr)
8509 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
8510 expr = expr->unary.value;
8511 if (expr->kind != EXPR_UNARY_DEREFERENCE)
8513 expr = expr->unary.value;
8516 if (expr->kind == EXPR_STRING_LITERAL ||
8517 expr->kind == EXPR_WIDE_STRING_LITERAL) {
8518 warningf(&expr->base.source_position,
8519 "comparison with string literal results in unspecified behaviour");
8524 * Check the semantics of comparison expressions.
8526 * @param expression The expression to check.
8528 static void semantic_comparison(binary_expression_t *expression)
8530 expression_t *left = expression->left;
8531 expression_t *right = expression->right;
8533 if (warning.address) {
8534 warn_string_literal_address(left);
8535 warn_string_literal_address(right);
8537 expression_t const* const func_left = get_reference_address(left);
8538 if (func_left != NULL && is_null_pointer_constant(right)) {
8539 warningf(&expression->base.source_position,
8540 "the address of '%Y' will never be NULL",
8541 func_left->reference.entity->base.symbol);
8544 expression_t const* const func_right = get_reference_address(right);
8545 if (func_right != NULL && is_null_pointer_constant(right)) {
8546 warningf(&expression->base.source_position,
8547 "the address of '%Y' will never be NULL",
8548 func_right->reference.entity->base.symbol);
8552 type_t *orig_type_left = left->base.type;
8553 type_t *orig_type_right = right->base.type;
8554 type_t *type_left = skip_typeref(orig_type_left);
8555 type_t *type_right = skip_typeref(orig_type_right);
8557 /* TODO non-arithmetic types */
8558 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8559 /* test for signed vs unsigned compares */
8560 if (warning.sign_compare &&
8561 (expression->base.kind != EXPR_BINARY_EQUAL &&
8562 expression->base.kind != EXPR_BINARY_NOTEQUAL) &&
8563 (is_type_signed(type_left) != is_type_signed(type_right))) {
8565 /* check if 1 of the operands is a constant, in this case we just
8566 * check wether we can safely represent the resulting constant in
8567 * the type of the other operand. */
8568 expression_t *const_expr = NULL;
8569 expression_t *other_expr = NULL;
8571 if (is_constant_expression(left)) {
8574 } else if (is_constant_expression(right)) {
8579 if (const_expr != NULL) {
8580 type_t *other_type = skip_typeref(other_expr->base.type);
8581 long val = fold_constant(const_expr);
8582 /* TODO: check if val can be represented by other_type */
8586 warningf(&expression->base.source_position,
8587 "comparison between signed and unsigned");
8589 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8590 expression->left = create_implicit_cast(left, arithmetic_type);
8591 expression->right = create_implicit_cast(right, arithmetic_type);
8592 expression->base.type = arithmetic_type;
8593 if (warning.float_equal &&
8594 (expression->base.kind == EXPR_BINARY_EQUAL ||
8595 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
8596 is_type_float(arithmetic_type)) {
8597 warningf(&expression->base.source_position,
8598 "comparing floating point with == or != is unsafe");
8600 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8601 /* TODO check compatibility */
8602 } else if (is_type_pointer(type_left)) {
8603 expression->right = create_implicit_cast(right, type_left);
8604 } else if (is_type_pointer(type_right)) {
8605 expression->left = create_implicit_cast(left, type_right);
8606 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8607 type_error_incompatible("invalid operands in comparison",
8608 &expression->base.source_position,
8609 type_left, type_right);
8611 expression->base.type = type_int;
8615 * Checks if a compound type has constant fields.
8617 static bool has_const_fields(const compound_type_t *type)
8619 compound_t *compound = type->compound;
8620 entity_t *entry = compound->members.entities;
8622 for (; entry != NULL; entry = entry->base.next) {
8623 if (!is_declaration(entry))
8626 const type_t *decl_type = skip_typeref(entry->declaration.type);
8627 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
8634 static bool is_valid_assignment_lhs(expression_t const* const left)
8636 type_t *const orig_type_left = revert_automatic_type_conversion(left);
8637 type_t *const type_left = skip_typeref(orig_type_left);
8639 if (!is_lvalue(left)) {
8640 errorf(HERE, "left hand side '%E' of assignment is not an lvalue",
8645 if (is_type_array(type_left)) {
8646 errorf(HERE, "cannot assign to arrays ('%E')", left);
8649 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
8650 errorf(HERE, "assignment to readonly location '%E' (type '%T')", left,
8654 if (is_type_incomplete(type_left)) {
8655 errorf(HERE, "left-hand side '%E' of assignment has incomplete type '%T'",
8656 left, orig_type_left);
8659 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
8660 errorf(HERE, "cannot assign to '%E' because compound type '%T' has readonly fields",
8661 left, orig_type_left);
8668 static void semantic_arithmetic_assign(binary_expression_t *expression)
8670 expression_t *left = expression->left;
8671 expression_t *right = expression->right;
8672 type_t *orig_type_left = left->base.type;
8673 type_t *orig_type_right = right->base.type;
8675 if (!is_valid_assignment_lhs(left))
8678 type_t *type_left = skip_typeref(orig_type_left);
8679 type_t *type_right = skip_typeref(orig_type_right);
8681 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8682 /* TODO: improve error message */
8683 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8684 errorf(&expression->base.source_position,
8685 "operation needs arithmetic types");
8690 /* combined instructions are tricky. We can't create an implicit cast on
8691 * the left side, because we need the uncasted form for the store.
8692 * The ast2firm pass has to know that left_type must be right_type
8693 * for the arithmetic operation and create a cast by itself */
8694 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8695 expression->right = create_implicit_cast(right, arithmetic_type);
8696 expression->base.type = type_left;
8699 static void semantic_divmod_assign(binary_expression_t *expression)
8701 semantic_arithmetic_assign(expression);
8702 warn_div_by_zero(expression);
8705 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
8707 expression_t *const left = expression->left;
8708 expression_t *const right = expression->right;
8709 type_t *const orig_type_left = left->base.type;
8710 type_t *const orig_type_right = right->base.type;
8711 type_t *const type_left = skip_typeref(orig_type_left);
8712 type_t *const type_right = skip_typeref(orig_type_right);
8714 if (!is_valid_assignment_lhs(left))
8717 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8718 /* combined instructions are tricky. We can't create an implicit cast on
8719 * the left side, because we need the uncasted form for the store.
8720 * The ast2firm pass has to know that left_type must be right_type
8721 * for the arithmetic operation and create a cast by itself */
8722 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
8723 expression->right = create_implicit_cast(right, arithmetic_type);
8724 expression->base.type = type_left;
8725 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8726 check_pointer_arithmetic(&expression->base.source_position,
8727 type_left, orig_type_left);
8728 expression->base.type = type_left;
8729 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8730 errorf(&expression->base.source_position,
8731 "incompatible types '%T' and '%T' in assignment",
8732 orig_type_left, orig_type_right);
8737 * Check the semantic restrictions of a logical expression.
8739 static void semantic_logical_op(binary_expression_t *expression)
8741 expression_t *const left = expression->left;
8742 expression_t *const right = expression->right;
8743 type_t *const orig_type_left = left->base.type;
8744 type_t *const orig_type_right = right->base.type;
8745 type_t *const type_left = skip_typeref(orig_type_left);
8746 type_t *const type_right = skip_typeref(orig_type_right);
8748 warn_function_address_as_bool(left);
8749 warn_function_address_as_bool(right);
8751 if (!is_type_scalar(type_left) || !is_type_scalar(type_right)) {
8752 /* TODO: improve error message */
8753 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8754 errorf(&expression->base.source_position,
8755 "operation needs scalar types");
8760 expression->base.type = type_int;
8764 * Check the semantic restrictions of a binary assign expression.
8766 static void semantic_binexpr_assign(binary_expression_t *expression)
8768 expression_t *left = expression->left;
8769 type_t *orig_type_left = left->base.type;
8771 if (!is_valid_assignment_lhs(left))
8774 assign_error_t error = semantic_assign(orig_type_left, expression->right);
8775 report_assign_error(error, orig_type_left, expression->right,
8776 "assignment", &left->base.source_position);
8777 expression->right = create_implicit_cast(expression->right, orig_type_left);
8778 expression->base.type = orig_type_left;
8782 * Determine if the outermost operation (or parts thereof) of the given
8783 * expression has no effect in order to generate a warning about this fact.
8784 * Therefore in some cases this only examines some of the operands of the
8785 * expression (see comments in the function and examples below).
8787 * f() + 23; // warning, because + has no effect
8788 * x || f(); // no warning, because x controls execution of f()
8789 * x ? y : f(); // warning, because y has no effect
8790 * (void)x; // no warning to be able to suppress the warning
8791 * This function can NOT be used for an "expression has definitely no effect"-
8793 static bool expression_has_effect(const expression_t *const expr)
8795 switch (expr->kind) {
8796 case EXPR_UNKNOWN: break;
8797 case EXPR_INVALID: return true; /* do NOT warn */
8798 case EXPR_REFERENCE: return false;
8799 case EXPR_REFERENCE_ENUM_VALUE: return false;
8800 /* suppress the warning for microsoft __noop operations */
8801 case EXPR_CONST: return expr->conste.is_ms_noop;
8802 case EXPR_CHARACTER_CONSTANT: return false;
8803 case EXPR_WIDE_CHARACTER_CONSTANT: return false;
8804 case EXPR_STRING_LITERAL: return false;
8805 case EXPR_WIDE_STRING_LITERAL: return false;
8806 case EXPR_LABEL_ADDRESS: return false;
8809 const call_expression_t *const call = &expr->call;
8810 if (call->function->kind != EXPR_BUILTIN_SYMBOL)
8813 switch (call->function->builtin_symbol.symbol->ID) {
8814 case T___builtin_va_end: return true;
8815 default: return false;
8819 /* Generate the warning if either the left or right hand side of a
8820 * conditional expression has no effect */
8821 case EXPR_CONDITIONAL: {
8822 const conditional_expression_t *const cond = &expr->conditional;
8824 expression_has_effect(cond->true_expression) &&
8825 expression_has_effect(cond->false_expression);
8828 case EXPR_SELECT: return false;
8829 case EXPR_ARRAY_ACCESS: return false;
8830 case EXPR_SIZEOF: return false;
8831 case EXPR_CLASSIFY_TYPE: return false;
8832 case EXPR_ALIGNOF: return false;
8834 case EXPR_FUNCNAME: return false;
8835 case EXPR_BUILTIN_SYMBOL: break; /* handled in EXPR_CALL */
8836 case EXPR_BUILTIN_CONSTANT_P: return false;
8837 case EXPR_BUILTIN_PREFETCH: return true;
8838 case EXPR_OFFSETOF: return false;
8839 case EXPR_VA_START: return true;
8840 case EXPR_VA_ARG: return true;
8841 case EXPR_STATEMENT: return true; // TODO
8842 case EXPR_COMPOUND_LITERAL: return false;
8844 case EXPR_UNARY_NEGATE: return false;
8845 case EXPR_UNARY_PLUS: return false;
8846 case EXPR_UNARY_BITWISE_NEGATE: return false;
8847 case EXPR_UNARY_NOT: return false;
8848 case EXPR_UNARY_DEREFERENCE: return false;
8849 case EXPR_UNARY_TAKE_ADDRESS: return false;
8850 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
8851 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
8852 case EXPR_UNARY_PREFIX_INCREMENT: return true;
8853 case EXPR_UNARY_PREFIX_DECREMENT: return true;
8855 /* Treat void casts as if they have an effect in order to being able to
8856 * suppress the warning */
8857 case EXPR_UNARY_CAST: {
8858 type_t *const type = skip_typeref(expr->base.type);
8859 return is_type_atomic(type, ATOMIC_TYPE_VOID);
8862 case EXPR_UNARY_CAST_IMPLICIT: return true;
8863 case EXPR_UNARY_ASSUME: return true;
8864 case EXPR_UNARY_DELETE: return true;
8865 case EXPR_UNARY_DELETE_ARRAY: return true;
8866 case EXPR_UNARY_THROW: return true;
8868 case EXPR_BINARY_ADD: return false;
8869 case EXPR_BINARY_SUB: return false;
8870 case EXPR_BINARY_MUL: return false;
8871 case EXPR_BINARY_DIV: return false;
8872 case EXPR_BINARY_MOD: return false;
8873 case EXPR_BINARY_EQUAL: return false;
8874 case EXPR_BINARY_NOTEQUAL: return false;
8875 case EXPR_BINARY_LESS: return false;
8876 case EXPR_BINARY_LESSEQUAL: return false;
8877 case EXPR_BINARY_GREATER: return false;
8878 case EXPR_BINARY_GREATEREQUAL: return false;
8879 case EXPR_BINARY_BITWISE_AND: return false;
8880 case EXPR_BINARY_BITWISE_OR: return false;
8881 case EXPR_BINARY_BITWISE_XOR: return false;
8882 case EXPR_BINARY_SHIFTLEFT: return false;
8883 case EXPR_BINARY_SHIFTRIGHT: return false;
8884 case EXPR_BINARY_ASSIGN: return true;
8885 case EXPR_BINARY_MUL_ASSIGN: return true;
8886 case EXPR_BINARY_DIV_ASSIGN: return true;
8887 case EXPR_BINARY_MOD_ASSIGN: return true;
8888 case EXPR_BINARY_ADD_ASSIGN: return true;
8889 case EXPR_BINARY_SUB_ASSIGN: return true;
8890 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
8891 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
8892 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
8893 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
8894 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
8896 /* Only examine the right hand side of && and ||, because the left hand
8897 * side already has the effect of controlling the execution of the right
8899 case EXPR_BINARY_LOGICAL_AND:
8900 case EXPR_BINARY_LOGICAL_OR:
8901 /* Only examine the right hand side of a comma expression, because the left
8902 * hand side has a separate warning */
8903 case EXPR_BINARY_COMMA:
8904 return expression_has_effect(expr->binary.right);
8906 case EXPR_BINARY_BUILTIN_EXPECT: return true;
8907 case EXPR_BINARY_ISGREATER: return false;
8908 case EXPR_BINARY_ISGREATEREQUAL: return false;
8909 case EXPR_BINARY_ISLESS: return false;
8910 case EXPR_BINARY_ISLESSEQUAL: return false;
8911 case EXPR_BINARY_ISLESSGREATER: return false;
8912 case EXPR_BINARY_ISUNORDERED: return false;
8915 internal_errorf(HERE, "unexpected expression");
8918 static void semantic_comma(binary_expression_t *expression)
8920 if (warning.unused_value) {
8921 const expression_t *const left = expression->left;
8922 if (!expression_has_effect(left)) {
8923 warningf(&left->base.source_position,
8924 "left-hand operand of comma expression has no effect");
8927 expression->base.type = expression->right->base.type;
8931 * @param prec_r precedence of the right operand
8933 #define CREATE_BINEXPR_PARSER(token_type, binexpression_type, prec_r, sfunc) \
8934 static expression_t *parse_##binexpression_type(expression_t *left) \
8936 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
8937 binexpr->binary.left = left; \
8940 expression_t *right = parse_sub_expression(prec_r); \
8942 binexpr->binary.right = right; \
8943 sfunc(&binexpr->binary); \
8948 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, PREC_CAST, semantic_binexpr_arithmetic)
8949 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, PREC_CAST, semantic_divmod_arithmetic)
8950 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, PREC_CAST, semantic_divmod_arithmetic)
8951 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, PREC_MULTIPLICATIVE, semantic_add)
8952 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, PREC_MULTIPLICATIVE, semantic_sub)
8953 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT, PREC_ADDITIVE, semantic_shift_op)
8954 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT, PREC_ADDITIVE, semantic_shift_op)
8955 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, PREC_SHIFT, semantic_comparison)
8956 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, PREC_SHIFT, semantic_comparison)
8957 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL, PREC_SHIFT, semantic_comparison)
8958 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL, PREC_SHIFT, semantic_comparison)
8959 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL, PREC_RELATIONAL, semantic_comparison)
8960 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL, PREC_RELATIONAL, semantic_comparison)
8961 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND, PREC_EQUALITY, semantic_binexpr_arithmetic)
8962 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR, PREC_AND, semantic_binexpr_arithmetic)
8963 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR, PREC_XOR, semantic_binexpr_arithmetic)
8964 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND, PREC_OR, semantic_logical_op)
8965 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR, PREC_LOGICAL_AND, semantic_logical_op)
8966 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, PREC_ASSIGNMENT, semantic_binexpr_assign)
8967 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8968 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8969 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8970 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8971 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8972 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8973 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8974 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8975 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8976 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8977 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, PREC_ASSIGNMENT, semantic_comma)
8980 static expression_t *parse_sub_expression(precedence_t precedence)
8982 if (token.type < 0) {
8983 return expected_expression_error();
8986 expression_parser_function_t *parser
8987 = &expression_parsers[token.type];
8988 source_position_t source_position = token.source_position;
8991 if (parser->parser != NULL) {
8992 left = parser->parser();
8994 left = parse_primary_expression();
8996 assert(left != NULL);
8997 left->base.source_position = source_position;
9000 if (token.type < 0) {
9001 return expected_expression_error();
9004 parser = &expression_parsers[token.type];
9005 if (parser->infix_parser == NULL)
9007 if (parser->infix_precedence < precedence)
9010 left = parser->infix_parser(left);
9012 assert(left != NULL);
9013 assert(left->kind != EXPR_UNKNOWN);
9014 left->base.source_position = source_position;
9021 * Parse an expression.
9023 static expression_t *parse_expression(void)
9025 return parse_sub_expression(PREC_EXPRESSION);
9029 * Register a parser for a prefix-like operator.
9031 * @param parser the parser function
9032 * @param token_type the token type of the prefix token
9034 static void register_expression_parser(parse_expression_function parser,
9037 expression_parser_function_t *entry = &expression_parsers[token_type];
9039 if (entry->parser != NULL) {
9040 diagnosticf("for token '%k'\n", (token_type_t)token_type);
9041 panic("trying to register multiple expression parsers for a token");
9043 entry->parser = parser;
9047 * Register a parser for an infix operator with given precedence.
9049 * @param parser the parser function
9050 * @param token_type the token type of the infix operator
9051 * @param precedence the precedence of the operator
9053 static void register_infix_parser(parse_expression_infix_function parser,
9054 int token_type, unsigned precedence)
9056 expression_parser_function_t *entry = &expression_parsers[token_type];
9058 if (entry->infix_parser != NULL) {
9059 diagnosticf("for token '%k'\n", (token_type_t)token_type);
9060 panic("trying to register multiple infix expression parsers for a "
9063 entry->infix_parser = parser;
9064 entry->infix_precedence = precedence;
9068 * Initialize the expression parsers.
9070 static void init_expression_parsers(void)
9072 memset(&expression_parsers, 0, sizeof(expression_parsers));
9074 register_infix_parser(parse_array_expression, '[', PREC_POSTFIX);
9075 register_infix_parser(parse_call_expression, '(', PREC_POSTFIX);
9076 register_infix_parser(parse_select_expression, '.', PREC_POSTFIX);
9077 register_infix_parser(parse_select_expression, T_MINUSGREATER, PREC_POSTFIX);
9078 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT, T_PLUSPLUS, PREC_POSTFIX);
9079 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT, T_MINUSMINUS, PREC_POSTFIX);
9080 register_infix_parser(parse_EXPR_BINARY_MUL, '*', PREC_MULTIPLICATIVE);
9081 register_infix_parser(parse_EXPR_BINARY_DIV, '/', PREC_MULTIPLICATIVE);
9082 register_infix_parser(parse_EXPR_BINARY_MOD, '%', PREC_MULTIPLICATIVE);
9083 register_infix_parser(parse_EXPR_BINARY_ADD, '+', PREC_ADDITIVE);
9084 register_infix_parser(parse_EXPR_BINARY_SUB, '-', PREC_ADDITIVE);
9085 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, PREC_SHIFT);
9086 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, PREC_SHIFT);
9087 register_infix_parser(parse_EXPR_BINARY_LESS, '<', PREC_RELATIONAL);
9088 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', PREC_RELATIONAL);
9089 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, PREC_RELATIONAL);
9090 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, PREC_RELATIONAL);
9091 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, PREC_EQUALITY);
9092 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL, T_EXCLAMATIONMARKEQUAL, PREC_EQUALITY);
9093 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', PREC_AND);
9094 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', PREC_XOR);
9095 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', PREC_OR);
9096 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, PREC_LOGICAL_AND);
9097 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, PREC_LOGICAL_OR);
9098 register_infix_parser(parse_conditional_expression, '?', PREC_CONDITIONAL);
9099 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', PREC_ASSIGNMENT);
9100 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, PREC_ASSIGNMENT);
9101 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, PREC_ASSIGNMENT);
9102 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, PREC_ASSIGNMENT);
9103 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, PREC_ASSIGNMENT);
9104 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, PREC_ASSIGNMENT);
9105 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN, T_LESSLESSEQUAL, PREC_ASSIGNMENT);
9106 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN, T_GREATERGREATEREQUAL, PREC_ASSIGNMENT);
9107 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN, T_ANDEQUAL, PREC_ASSIGNMENT);
9108 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN, T_PIPEEQUAL, PREC_ASSIGNMENT);
9109 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN, T_CARETEQUAL, PREC_ASSIGNMENT);
9110 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', PREC_EXPRESSION);
9112 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-');
9113 register_expression_parser(parse_EXPR_UNARY_PLUS, '+');
9114 register_expression_parser(parse_EXPR_UNARY_NOT, '!');
9115 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~');
9116 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*');
9117 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&');
9118 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT, T_PLUSPLUS);
9119 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT, T_MINUSMINUS);
9120 register_expression_parser(parse_sizeof, T_sizeof);
9121 register_expression_parser(parse_alignof, T___alignof__);
9122 register_expression_parser(parse_extension, T___extension__);
9123 register_expression_parser(parse_builtin_classify_type, T___builtin_classify_type);
9124 register_expression_parser(parse_delete, T_delete);
9125 register_expression_parser(parse_throw, T_throw);
9129 * Parse a asm statement arguments specification.
9131 static asm_argument_t *parse_asm_arguments(bool is_out)
9133 asm_argument_t *result = NULL;
9134 asm_argument_t *last = NULL;
9136 while (token.type == T_STRING_LITERAL || token.type == '[') {
9137 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
9138 memset(argument, 0, sizeof(argument[0]));
9140 if (token.type == '[') {
9142 if (token.type != T_IDENTIFIER) {
9143 parse_error_expected("while parsing asm argument",
9144 T_IDENTIFIER, NULL);
9147 argument->symbol = token.v.symbol;
9152 argument->constraints = parse_string_literals();
9154 add_anchor_token(')');
9155 expression_t *expression = parse_expression();
9156 rem_anchor_token(')');
9158 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
9159 * change size or type representation (e.g. int -> long is ok, but
9160 * int -> float is not) */
9161 if (expression->kind == EXPR_UNARY_CAST) {
9162 type_t *const type = expression->base.type;
9163 type_kind_t const kind = type->kind;
9164 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
9167 if (kind == TYPE_ATOMIC) {
9168 atomic_type_kind_t const akind = type->atomic.akind;
9169 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9170 size = get_atomic_type_size(akind);
9172 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9173 size = get_atomic_type_size(get_intptr_kind());
9177 expression_t *const value = expression->unary.value;
9178 type_t *const value_type = value->base.type;
9179 type_kind_t const value_kind = value_type->kind;
9181 unsigned value_flags;
9182 unsigned value_size;
9183 if (value_kind == TYPE_ATOMIC) {
9184 atomic_type_kind_t const value_akind = value_type->atomic.akind;
9185 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9186 value_size = get_atomic_type_size(value_akind);
9187 } else if (value_kind == TYPE_POINTER) {
9188 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9189 value_size = get_atomic_type_size(get_intptr_kind());
9194 if (value_flags != flags || value_size != size)
9198 } while (expression->kind == EXPR_UNARY_CAST);
9202 if (!is_lvalue(expression)) {
9203 errorf(&expression->base.source_position,
9204 "asm output argument is not an lvalue");
9207 if (argument->constraints.begin[0] == '+')
9208 mark_vars_read(expression, NULL);
9210 mark_vars_read(expression, NULL);
9212 argument->expression = expression;
9215 set_address_taken(expression, true);
9218 last->next = argument;
9224 if (token.type != ',')
9235 * Parse a asm statement clobber specification.
9237 static asm_clobber_t *parse_asm_clobbers(void)
9239 asm_clobber_t *result = NULL;
9240 asm_clobber_t *last = NULL;
9242 while(token.type == T_STRING_LITERAL) {
9243 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
9244 clobber->clobber = parse_string_literals();
9247 last->next = clobber;
9253 if (token.type != ',')
9262 * Parse an asm statement.
9264 static statement_t *parse_asm_statement(void)
9266 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
9267 asm_statement_t *asm_statement = &statement->asms;
9271 if (token.type == T_volatile) {
9273 asm_statement->is_volatile = true;
9277 add_anchor_token(')');
9278 add_anchor_token(':');
9279 asm_statement->asm_text = parse_string_literals();
9281 if (token.type != ':') {
9282 rem_anchor_token(':');
9287 asm_statement->outputs = parse_asm_arguments(true);
9288 if (token.type != ':') {
9289 rem_anchor_token(':');
9294 asm_statement->inputs = parse_asm_arguments(false);
9295 if (token.type != ':') {
9296 rem_anchor_token(':');
9299 rem_anchor_token(':');
9302 asm_statement->clobbers = parse_asm_clobbers();
9305 rem_anchor_token(')');
9309 if (asm_statement->outputs == NULL) {
9310 /* GCC: An 'asm' instruction without any output operands will be treated
9311 * identically to a volatile 'asm' instruction. */
9312 asm_statement->is_volatile = true;
9317 return create_invalid_statement();
9321 * Parse a case statement.
9323 static statement_t *parse_case_statement(void)
9325 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9326 source_position_t *const pos = &statement->base.source_position;
9330 expression_t *const expression = parse_expression();
9331 statement->case_label.expression = expression;
9332 if (!is_constant_expression(expression)) {
9333 /* This check does not prevent the error message in all cases of an
9334 * prior error while parsing the expression. At least it catches the
9335 * common case of a mistyped enum entry. */
9336 if (is_type_valid(skip_typeref(expression->base.type))) {
9337 errorf(pos, "case label does not reduce to an integer constant");
9339 statement->case_label.is_bad = true;
9341 long const val = fold_constant(expression);
9342 statement->case_label.first_case = val;
9343 statement->case_label.last_case = val;
9347 if (token.type == T_DOTDOTDOT) {
9349 expression_t *const end_range = parse_expression();
9350 statement->case_label.end_range = end_range;
9351 if (!is_constant_expression(end_range)) {
9352 /* This check does not prevent the error message in all cases of an
9353 * prior error while parsing the expression. At least it catches the
9354 * common case of a mistyped enum entry. */
9355 if (is_type_valid(skip_typeref(end_range->base.type))) {
9356 errorf(pos, "case range does not reduce to an integer constant");
9358 statement->case_label.is_bad = true;
9360 long const val = fold_constant(end_range);
9361 statement->case_label.last_case = val;
9363 if (warning.other && val < statement->case_label.first_case) {
9364 statement->case_label.is_empty_range = true;
9365 warningf(pos, "empty range specified");
9371 PUSH_PARENT(statement);
9375 if (current_switch != NULL) {
9376 if (! statement->case_label.is_bad) {
9377 /* Check for duplicate case values */
9378 case_label_statement_t *c = &statement->case_label;
9379 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
9380 if (l->is_bad || l->is_empty_range || l->expression == NULL)
9383 if (c->last_case < l->first_case || c->first_case > l->last_case)
9386 errorf(pos, "duplicate case value (previously used %P)",
9387 &l->base.source_position);
9391 /* link all cases into the switch statement */
9392 if (current_switch->last_case == NULL) {
9393 current_switch->first_case = &statement->case_label;
9395 current_switch->last_case->next = &statement->case_label;
9397 current_switch->last_case = &statement->case_label;
9399 errorf(pos, "case label not within a switch statement");
9402 statement_t *const inner_stmt = parse_statement();
9403 statement->case_label.statement = inner_stmt;
9404 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9405 errorf(&inner_stmt->base.source_position, "declaration after case label");
9412 return create_invalid_statement();
9416 * Parse a default statement.
9418 static statement_t *parse_default_statement(void)
9420 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9424 PUSH_PARENT(statement);
9427 if (current_switch != NULL) {
9428 const case_label_statement_t *def_label = current_switch->default_label;
9429 if (def_label != NULL) {
9430 errorf(HERE, "multiple default labels in one switch (previous declared %P)",
9431 &def_label->base.source_position);
9433 current_switch->default_label = &statement->case_label;
9435 /* link all cases into the switch statement */
9436 if (current_switch->last_case == NULL) {
9437 current_switch->first_case = &statement->case_label;
9439 current_switch->last_case->next = &statement->case_label;
9441 current_switch->last_case = &statement->case_label;
9444 errorf(&statement->base.source_position,
9445 "'default' label not within a switch statement");
9448 statement_t *const inner_stmt = parse_statement();
9449 statement->case_label.statement = inner_stmt;
9450 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9451 errorf(&inner_stmt->base.source_position, "declaration after default label");
9458 return create_invalid_statement();
9462 * Parse a label statement.
9464 static statement_t *parse_label_statement(void)
9466 assert(token.type == T_IDENTIFIER);
9467 symbol_t *symbol = token.v.symbol;
9468 label_t *label = get_label(symbol);
9470 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
9471 statement->label.label = label;
9475 PUSH_PARENT(statement);
9477 /* if statement is already set then the label is defined twice,
9478 * otherwise it was just mentioned in a goto/local label declaration so far
9480 if (label->statement != NULL) {
9481 errorf(HERE, "duplicate label '%Y' (declared %P)",
9482 symbol, &label->base.source_position);
9484 label->base.source_position = token.source_position;
9485 label->statement = statement;
9490 if (token.type == '}') {
9491 /* TODO only warn? */
9492 if (warning.other && false) {
9493 warningf(HERE, "label at end of compound statement");
9494 statement->label.statement = create_empty_statement();
9496 errorf(HERE, "label at end of compound statement");
9497 statement->label.statement = create_invalid_statement();
9499 } else if (token.type == ';') {
9500 /* Eat an empty statement here, to avoid the warning about an empty
9501 * statement after a label. label:; is commonly used to have a label
9502 * before a closing brace. */
9503 statement->label.statement = create_empty_statement();
9506 statement_t *const inner_stmt = parse_statement();
9507 statement->label.statement = inner_stmt;
9508 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9509 errorf(&inner_stmt->base.source_position, "declaration after label");
9513 /* remember the labels in a list for later checking */
9514 if (label_last == NULL) {
9515 label_first = &statement->label;
9517 label_last->next = &statement->label;
9519 label_last = &statement->label;
9526 * Parse an if statement.
9528 static statement_t *parse_if(void)
9530 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
9534 PUSH_PARENT(statement);
9536 add_anchor_token('{');
9539 add_anchor_token(')');
9540 expression_t *const expr = parse_expression();
9541 statement->ifs.condition = expr;
9542 mark_vars_read(expr, NULL);
9543 rem_anchor_token(')');
9547 rem_anchor_token('{');
9549 add_anchor_token(T_else);
9550 statement->ifs.true_statement = parse_statement();
9551 rem_anchor_token(T_else);
9553 if (token.type == T_else) {
9555 statement->ifs.false_statement = parse_statement();
9563 * Check that all enums are handled in a switch.
9565 * @param statement the switch statement to check
9567 static void check_enum_cases(const switch_statement_t *statement) {
9568 const type_t *type = skip_typeref(statement->expression->base.type);
9569 if (! is_type_enum(type))
9571 const enum_type_t *enumt = &type->enumt;
9573 /* if we have a default, no warnings */
9574 if (statement->default_label != NULL)
9577 /* FIXME: calculation of value should be done while parsing */
9578 /* TODO: quadratic algorithm here. Change to an n log n one */
9579 long last_value = -1;
9580 const entity_t *entry = enumt->enume->base.next;
9581 for (; entry != NULL && entry->kind == ENTITY_ENUM_VALUE;
9582 entry = entry->base.next) {
9583 const expression_t *expression = entry->enum_value.value;
9584 long value = expression != NULL ? fold_constant(expression) : last_value + 1;
9586 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
9587 if (l->expression == NULL)
9589 if (l->first_case <= value && value <= l->last_case) {
9595 warningf(&statement->base.source_position,
9596 "enumeration value '%Y' not handled in switch",
9597 entry->base.symbol);
9604 * Parse a switch statement.
9606 static statement_t *parse_switch(void)
9608 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
9612 PUSH_PARENT(statement);
9615 add_anchor_token(')');
9616 expression_t *const expr = parse_expression();
9617 mark_vars_read(expr, NULL);
9618 type_t * type = skip_typeref(expr->base.type);
9619 if (is_type_integer(type)) {
9620 type = promote_integer(type);
9621 if (warning.traditional) {
9622 if (get_rank(type) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
9623 warningf(&expr->base.source_position,
9624 "'%T' switch expression not converted to '%T' in ISO C",
9628 } else if (is_type_valid(type)) {
9629 errorf(&expr->base.source_position,
9630 "switch quantity is not an integer, but '%T'", type);
9631 type = type_error_type;
9633 statement->switchs.expression = create_implicit_cast(expr, type);
9635 rem_anchor_token(')');
9637 switch_statement_t *rem = current_switch;
9638 current_switch = &statement->switchs;
9639 statement->switchs.body = parse_statement();
9640 current_switch = rem;
9642 if (warning.switch_default &&
9643 statement->switchs.default_label == NULL) {
9644 warningf(&statement->base.source_position, "switch has no default case");
9646 if (warning.switch_enum)
9647 check_enum_cases(&statement->switchs);
9653 return create_invalid_statement();
9656 static statement_t *parse_loop_body(statement_t *const loop)
9658 statement_t *const rem = current_loop;
9659 current_loop = loop;
9661 statement_t *const body = parse_statement();
9668 * Parse a while statement.
9670 static statement_t *parse_while(void)
9672 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
9676 PUSH_PARENT(statement);
9679 add_anchor_token(')');
9680 expression_t *const cond = parse_expression();
9681 statement->whiles.condition = cond;
9682 mark_vars_read(cond, NULL);
9683 rem_anchor_token(')');
9686 statement->whiles.body = parse_loop_body(statement);
9692 return create_invalid_statement();
9696 * Parse a do statement.
9698 static statement_t *parse_do(void)
9700 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
9704 PUSH_PARENT(statement);
9706 add_anchor_token(T_while);
9707 statement->do_while.body = parse_loop_body(statement);
9708 rem_anchor_token(T_while);
9712 add_anchor_token(')');
9713 expression_t *const cond = parse_expression();
9714 statement->do_while.condition = cond;
9715 mark_vars_read(cond, NULL);
9716 rem_anchor_token(')');
9724 return create_invalid_statement();
9728 * Parse a for statement.
9730 static statement_t *parse_for(void)
9732 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9736 PUSH_PARENT(statement);
9738 size_t const top = environment_top();
9739 scope_push(&statement->fors.scope);
9742 add_anchor_token(')');
9744 if (token.type != ';') {
9745 if (is_declaration_specifier(&token, false)) {
9746 parse_declaration(record_entity);
9748 add_anchor_token(';');
9749 expression_t *const init = parse_expression();
9750 statement->fors.initialisation = init;
9751 mark_vars_read(init, VAR_ANY);
9752 if (warning.unused_value && !expression_has_effect(init)) {
9753 warningf(&init->base.source_position,
9754 "initialisation of 'for'-statement has no effect");
9756 rem_anchor_token(';');
9763 if (token.type != ';') {
9764 add_anchor_token(';');
9765 expression_t *const cond = parse_expression();
9766 statement->fors.condition = cond;
9767 mark_vars_read(cond, NULL);
9768 rem_anchor_token(';');
9771 if (token.type != ')') {
9772 expression_t *const step = parse_expression();
9773 statement->fors.step = step;
9774 mark_vars_read(step, VAR_ANY);
9775 if (warning.unused_value && !expression_has_effect(step)) {
9776 warningf(&step->base.source_position,
9777 "step of 'for'-statement has no effect");
9781 rem_anchor_token(')');
9782 statement->fors.body = parse_loop_body(statement);
9784 assert(scope == &statement->fors.scope);
9786 environment_pop_to(top);
9793 rem_anchor_token(')');
9794 assert(scope == &statement->fors.scope);
9796 environment_pop_to(top);
9798 return create_invalid_statement();
9802 * Parse a goto statement.
9804 static statement_t *parse_goto(void)
9806 statement_t *statement = allocate_statement_zero(STATEMENT_GOTO);
9809 if (GNU_MODE && token.type == '*') {
9811 expression_t *expression = parse_expression();
9812 mark_vars_read(expression, NULL);
9814 /* Argh: although documentation say the expression must be of type void *,
9815 * gcc excepts anything that can be casted into void * without error */
9816 type_t *type = expression->base.type;
9818 if (type != type_error_type) {
9819 if (!is_type_pointer(type) && !is_type_integer(type)) {
9820 errorf(&expression->base.source_position,
9821 "cannot convert to a pointer type");
9822 } else if (warning.other && type != type_void_ptr) {
9823 warningf(&expression->base.source_position,
9824 "type of computed goto expression should be 'void*' not '%T'", type);
9826 expression = create_implicit_cast(expression, type_void_ptr);
9829 statement->gotos.expression = expression;
9831 if (token.type != T_IDENTIFIER) {
9833 parse_error_expected("while parsing goto", T_IDENTIFIER, '*', NULL);
9835 parse_error_expected("while parsing goto", T_IDENTIFIER, NULL);
9839 symbol_t *symbol = token.v.symbol;
9842 statement->gotos.label = get_label(symbol);
9845 /* remember the goto's in a list for later checking */
9846 if (goto_last == NULL) {
9847 goto_first = &statement->gotos;
9849 goto_last->next = &statement->gotos;
9851 goto_last = &statement->gotos;
9857 return create_invalid_statement();
9861 * Parse a continue statement.
9863 static statement_t *parse_continue(void)
9865 if (current_loop == NULL) {
9866 errorf(HERE, "continue statement not within loop");
9869 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
9879 * Parse a break statement.
9881 static statement_t *parse_break(void)
9883 if (current_switch == NULL && current_loop == NULL) {
9884 errorf(HERE, "break statement not within loop or switch");
9887 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
9897 * Parse a __leave statement.
9899 static statement_t *parse_leave_statement(void)
9901 if (current_try == NULL) {
9902 errorf(HERE, "__leave statement not within __try");
9905 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
9915 * Check if a given entity represents a local variable.
9917 static bool is_local_variable(const entity_t *entity)
9919 if (entity->kind != ENTITY_VARIABLE)
9922 switch ((storage_class_tag_t) entity->declaration.storage_class) {
9923 case STORAGE_CLASS_AUTO:
9924 case STORAGE_CLASS_REGISTER: {
9925 const type_t *type = skip_typeref(entity->declaration.type);
9926 if (is_type_function(type)) {
9938 * Check if a given expression represents a local variable.
9940 static bool expression_is_local_variable(const expression_t *expression)
9942 if (expression->base.kind != EXPR_REFERENCE) {
9945 const entity_t *entity = expression->reference.entity;
9946 return is_local_variable(entity);
9950 * Check if a given expression represents a local variable and
9951 * return its declaration then, else return NULL.
9953 entity_t *expression_is_variable(const expression_t *expression)
9955 if (expression->base.kind != EXPR_REFERENCE) {
9958 entity_t *entity = expression->reference.entity;
9959 if (entity->kind != ENTITY_VARIABLE)
9966 * Parse a return statement.
9968 static statement_t *parse_return(void)
9972 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
9974 expression_t *return_value = NULL;
9975 if (token.type != ';') {
9976 return_value = parse_expression();
9977 mark_vars_read(return_value, NULL);
9980 const type_t *const func_type = current_function->base.type;
9981 assert(is_type_function(func_type));
9982 type_t *const return_type = skip_typeref(func_type->function.return_type);
9984 if (return_value != NULL) {
9985 type_t *return_value_type = skip_typeref(return_value->base.type);
9987 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID) &&
9988 !is_type_atomic(return_value_type, ATOMIC_TYPE_VOID)) {
9989 if (warning.other) {
9990 warningf(&statement->base.source_position,
9991 "'return' with a value, in function returning void");
9993 return_value = NULL;
9995 assign_error_t error = semantic_assign(return_type, return_value);
9996 report_assign_error(error, return_type, return_value, "'return'",
9997 &statement->base.source_position);
9998 return_value = create_implicit_cast(return_value, return_type);
10000 /* check for returning address of a local var */
10001 if (warning.other && return_value != NULL
10002 && return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
10003 const expression_t *expression = return_value->unary.value;
10004 if (expression_is_local_variable(expression)) {
10005 warningf(&statement->base.source_position,
10006 "function returns address of local variable");
10009 } else if (warning.other && !is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
10010 warningf(&statement->base.source_position,
10011 "'return' without value, in function returning non-void");
10013 statement->returns.value = return_value;
10022 * Parse a declaration statement.
10024 static statement_t *parse_declaration_statement(void)
10026 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
10028 entity_t *before = scope->last_entity;
10030 parse_external_declaration();
10032 parse_declaration(record_entity);
10034 if (before == NULL) {
10035 statement->declaration.declarations_begin = scope->entities;
10037 statement->declaration.declarations_begin = before->base.next;
10039 statement->declaration.declarations_end = scope->last_entity;
10045 * Parse an expression statement, ie. expr ';'.
10047 static statement_t *parse_expression_statement(void)
10049 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10051 expression_t *const expr = parse_expression();
10052 statement->expression.expression = expr;
10053 mark_vars_read(expr, VAR_ANY);
10062 * Parse a microsoft __try { } __finally { } or
10063 * __try{ } __except() { }
10065 static statement_t *parse_ms_try_statment(void)
10067 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
10070 PUSH_PARENT(statement);
10072 ms_try_statement_t *rem = current_try;
10073 current_try = &statement->ms_try;
10074 statement->ms_try.try_statement = parse_compound_statement(false);
10079 if (token.type == T___except) {
10082 add_anchor_token(')');
10083 expression_t *const expr = parse_expression();
10084 mark_vars_read(expr, NULL);
10085 type_t * type = skip_typeref(expr->base.type);
10086 if (is_type_integer(type)) {
10087 type = promote_integer(type);
10088 } else if (is_type_valid(type)) {
10089 errorf(&expr->base.source_position,
10090 "__expect expression is not an integer, but '%T'", type);
10091 type = type_error_type;
10093 statement->ms_try.except_expression = create_implicit_cast(expr, type);
10094 rem_anchor_token(')');
10096 statement->ms_try.final_statement = parse_compound_statement(false);
10097 } else if (token.type == T__finally) {
10099 statement->ms_try.final_statement = parse_compound_statement(false);
10101 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
10102 return create_invalid_statement();
10106 return create_invalid_statement();
10109 static statement_t *parse_empty_statement(void)
10111 if (warning.empty_statement) {
10112 warningf(HERE, "statement is empty");
10114 statement_t *const statement = create_empty_statement();
10119 static statement_t *parse_local_label_declaration(void)
10121 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
10125 entity_t *begin = NULL, *end = NULL;
10128 if (token.type != T_IDENTIFIER) {
10129 parse_error_expected("while parsing local label declaration",
10130 T_IDENTIFIER, NULL);
10133 symbol_t *symbol = token.v.symbol;
10134 entity_t *entity = get_entity(symbol, NAMESPACE_LOCAL_LABEL);
10135 if (entity != NULL && entity->base.parent_scope == scope) {
10136 errorf(HERE, "multiple definitions of '__label__ %Y' (previous definition %P)",
10137 symbol, &entity->base.source_position);
10139 entity = allocate_entity_zero(ENTITY_LOCAL_LABEL);
10141 entity->base.parent_scope = scope;
10142 entity->base.namespc = NAMESPACE_LOCAL_LABEL;
10143 entity->base.source_position = token.source_position;
10144 entity->base.symbol = symbol;
10147 end->base.next = entity;
10152 local_label_push(entity);
10156 if (token.type != ',')
10162 statement->declaration.declarations_begin = begin;
10163 statement->declaration.declarations_end = end;
10168 * Parse a statement.
10169 * There's also parse_statement() which additionally checks for
10170 * "statement has no effect" warnings
10172 static statement_t *intern_parse_statement(void)
10174 statement_t *statement = NULL;
10176 /* declaration or statement */
10177 add_anchor_token(';');
10178 switch (token.type) {
10179 case T_IDENTIFIER: {
10180 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
10181 if (la1_type == ':') {
10182 statement = parse_label_statement();
10183 } else if (is_typedef_symbol(token.v.symbol)) {
10184 statement = parse_declaration_statement();
10186 /* it's an identifier, the grammar says this must be an
10187 * expression statement. However it is common that users mistype
10188 * declaration types, so we guess a bit here to improve robustness
10189 * for incorrect programs */
10190 switch (la1_type) {
10192 if (get_entity(token.v.symbol, NAMESPACE_NORMAL) != NULL)
10193 goto expression_statment;
10198 statement = parse_declaration_statement();
10202 expression_statment:
10203 statement = parse_expression_statement();
10210 case T___extension__:
10211 /* This can be a prefix to a declaration or an expression statement.
10212 * We simply eat it now and parse the rest with tail recursion. */
10215 } while (token.type == T___extension__);
10216 bool old_gcc_extension = in_gcc_extension;
10217 in_gcc_extension = true;
10218 statement = parse_statement();
10219 in_gcc_extension = old_gcc_extension;
10223 statement = parse_declaration_statement();
10227 statement = parse_local_label_declaration();
10230 case ';': statement = parse_empty_statement(); break;
10231 case '{': statement = parse_compound_statement(false); break;
10232 case T___leave: statement = parse_leave_statement(); break;
10233 case T___try: statement = parse_ms_try_statment(); break;
10234 case T_asm: statement = parse_asm_statement(); break;
10235 case T_break: statement = parse_break(); break;
10236 case T_case: statement = parse_case_statement(); break;
10237 case T_continue: statement = parse_continue(); break;
10238 case T_default: statement = parse_default_statement(); break;
10239 case T_do: statement = parse_do(); break;
10240 case T_for: statement = parse_for(); break;
10241 case T_goto: statement = parse_goto(); break;
10242 case T_if: statement = parse_if(); break;
10243 case T_return: statement = parse_return(); break;
10244 case T_switch: statement = parse_switch(); break;
10245 case T_while: statement = parse_while(); break;
10248 statement = parse_expression_statement();
10252 errorf(HERE, "unexpected token %K while parsing statement", &token);
10253 statement = create_invalid_statement();
10258 rem_anchor_token(';');
10260 assert(statement != NULL
10261 && statement->base.source_position.input_name != NULL);
10267 * parse a statement and emits "statement has no effect" warning if needed
10268 * (This is really a wrapper around intern_parse_statement with check for 1
10269 * single warning. It is needed, because for statement expressions we have
10270 * to avoid the warning on the last statement)
10272 static statement_t *parse_statement(void)
10274 statement_t *statement = intern_parse_statement();
10276 if (statement->kind == STATEMENT_EXPRESSION && warning.unused_value) {
10277 expression_t *expression = statement->expression.expression;
10278 if (!expression_has_effect(expression)) {
10279 warningf(&expression->base.source_position,
10280 "statement has no effect");
10288 * Parse a compound statement.
10290 static statement_t *parse_compound_statement(bool inside_expression_statement)
10292 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
10294 PUSH_PARENT(statement);
10297 add_anchor_token('}');
10299 size_t const top = environment_top();
10300 size_t const top_local = local_label_top();
10301 scope_push(&statement->compound.scope);
10303 statement_t **anchor = &statement->compound.statements;
10304 bool only_decls_so_far = true;
10305 while (token.type != '}') {
10306 if (token.type == T_EOF) {
10307 errorf(&statement->base.source_position,
10308 "EOF while parsing compound statement");
10311 statement_t *sub_statement = intern_parse_statement();
10312 if (is_invalid_statement(sub_statement)) {
10313 /* an error occurred. if we are at an anchor, return */
10319 if (warning.declaration_after_statement) {
10320 if (sub_statement->kind != STATEMENT_DECLARATION) {
10321 only_decls_so_far = false;
10322 } else if (!only_decls_so_far) {
10323 warningf(&sub_statement->base.source_position,
10324 "ISO C90 forbids mixed declarations and code");
10328 *anchor = sub_statement;
10330 while (sub_statement->base.next != NULL)
10331 sub_statement = sub_statement->base.next;
10333 anchor = &sub_statement->base.next;
10337 /* look over all statements again to produce no effect warnings */
10338 if (warning.unused_value) {
10339 statement_t *sub_statement = statement->compound.statements;
10340 for( ; sub_statement != NULL; sub_statement = sub_statement->base.next) {
10341 if (sub_statement->kind != STATEMENT_EXPRESSION)
10343 /* don't emit a warning for the last expression in an expression
10344 * statement as it has always an effect */
10345 if (inside_expression_statement && sub_statement->base.next == NULL)
10348 expression_t *expression = sub_statement->expression.expression;
10349 if (!expression_has_effect(expression)) {
10350 warningf(&expression->base.source_position,
10351 "statement has no effect");
10357 rem_anchor_token('}');
10358 assert(scope == &statement->compound.scope);
10360 environment_pop_to(top);
10361 local_label_pop_to(top_local);
10368 * Initialize builtin types.
10370 static void initialize_builtin_types(void)
10372 type_intmax_t = make_global_typedef("__intmax_t__", type_long_long);
10373 type_size_t = make_global_typedef("__SIZE_TYPE__", type_unsigned_long);
10374 type_ssize_t = make_global_typedef("__SSIZE_TYPE__", type_long);
10375 type_ptrdiff_t = make_global_typedef("__PTRDIFF_TYPE__", type_long);
10376 type_uintmax_t = make_global_typedef("__uintmax_t__", type_unsigned_long_long);
10377 type_uptrdiff_t = make_global_typedef("__UPTRDIFF_TYPE__", type_unsigned_long);
10378 type_wchar_t = make_global_typedef("__WCHAR_TYPE__", opt_short_wchar_t ? type_unsigned_short : type_int);
10379 type_wint_t = make_global_typedef("__WINT_TYPE__", type_int);
10381 type_intmax_t_ptr = make_pointer_type(type_intmax_t, TYPE_QUALIFIER_NONE);
10382 type_ptrdiff_t_ptr = make_pointer_type(type_ptrdiff_t, TYPE_QUALIFIER_NONE);
10383 type_ssize_t_ptr = make_pointer_type(type_ssize_t, TYPE_QUALIFIER_NONE);
10384 type_wchar_t_ptr = make_pointer_type(type_wchar_t, TYPE_QUALIFIER_NONE);
10386 /* const version of wchar_t */
10387 type_const_wchar_t = allocate_type_zero(TYPE_TYPEDEF);
10388 type_const_wchar_t->typedeft.typedefe = type_wchar_t->typedeft.typedefe;
10389 type_const_wchar_t->base.qualifiers |= TYPE_QUALIFIER_CONST;
10391 type_const_wchar_t_ptr = make_pointer_type(type_const_wchar_t, TYPE_QUALIFIER_NONE);
10395 * Check for unused global static functions and variables
10397 static void check_unused_globals(void)
10399 if (!warning.unused_function && !warning.unused_variable)
10402 for (const entity_t *entity = file_scope->entities; entity != NULL;
10403 entity = entity->base.next) {
10404 if (!is_declaration(entity))
10407 const declaration_t *declaration = &entity->declaration;
10408 if (declaration->used ||
10409 declaration->modifiers & DM_UNUSED ||
10410 declaration->modifiers & DM_USED ||
10411 declaration->storage_class != STORAGE_CLASS_STATIC)
10414 type_t *const type = declaration->type;
10416 if (entity->kind == ENTITY_FUNCTION) {
10417 /* inhibit warning for static inline functions */
10418 if (entity->function.is_inline)
10421 s = entity->function.statement != NULL ? "defined" : "declared";
10426 warningf(&declaration->base.source_position, "'%#T' %s but not used",
10427 type, declaration->base.symbol, s);
10431 static void parse_global_asm(void)
10433 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
10438 statement->asms.asm_text = parse_string_literals();
10439 statement->base.next = unit->global_asm;
10440 unit->global_asm = statement;
10449 * Parse a translation unit.
10451 static void parse_translation_unit(void)
10453 add_anchor_token(T_EOF);
10456 unsigned char token_anchor_copy[T_LAST_TOKEN];
10457 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
10461 bool anchor_leak = false;
10462 for (int i = 0; i != T_LAST_TOKEN; ++i) {
10463 unsigned char count = token_anchor_set[i] - token_anchor_copy[i];
10465 errorf(HERE, "Leaked anchor token %k %d times", i, count);
10466 anchor_leak = true;
10469 if (in_gcc_extension) {
10470 errorf(HERE, "Leaked __extension__");
10471 anchor_leak = true;
10478 switch (token.type) {
10481 case T___extension__:
10482 parse_external_declaration();
10486 parse_global_asm();
10490 rem_anchor_token(T_EOF);
10494 if (!strict_mode) {
10496 warningf(HERE, "stray ';' outside of function");
10503 errorf(HERE, "stray %K outside of function", &token);
10504 if (token.type == '(' || token.type == '{' || token.type == '[')
10505 eat_until_matching_token(token.type);
10515 * @return the translation unit or NULL if errors occurred.
10517 void start_parsing(void)
10519 environment_stack = NEW_ARR_F(stack_entry_t, 0);
10520 label_stack = NEW_ARR_F(stack_entry_t, 0);
10521 local_label_stack = NEW_ARR_F(stack_entry_t, 0);
10522 diagnostic_count = 0;
10526 type_set_output(stderr);
10527 ast_set_output(stderr);
10529 assert(unit == NULL);
10530 unit = allocate_ast_zero(sizeof(unit[0]));
10532 assert(file_scope == NULL);
10533 file_scope = &unit->scope;
10535 assert(scope == NULL);
10536 scope_push(&unit->scope);
10538 initialize_builtin_types();
10541 translation_unit_t *finish_parsing(void)
10543 /* do NOT use scope_pop() here, this will crash, will it by hand */
10544 assert(scope == &unit->scope);
10547 assert(file_scope == &unit->scope);
10548 check_unused_globals();
10551 DEL_ARR_F(environment_stack);
10552 DEL_ARR_F(label_stack);
10553 DEL_ARR_F(local_label_stack);
10555 translation_unit_t *result = unit;
10562 lookahead_bufpos = 0;
10563 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
10566 parse_translation_unit();
10570 * Initialize the parser.
10572 void init_parser(void)
10574 sym_anonymous = symbol_table_insert("<anonymous>");
10576 if (c_mode & _MS) {
10577 /* add predefined symbols for extended-decl-modifier */
10578 sym_align = symbol_table_insert("align");
10579 sym_allocate = symbol_table_insert("allocate");
10580 sym_dllimport = symbol_table_insert("dllimport");
10581 sym_dllexport = symbol_table_insert("dllexport");
10582 sym_naked = symbol_table_insert("naked");
10583 sym_noinline = symbol_table_insert("noinline");
10584 sym_noreturn = symbol_table_insert("noreturn");
10585 sym_nothrow = symbol_table_insert("nothrow");
10586 sym_novtable = symbol_table_insert("novtable");
10587 sym_property = symbol_table_insert("property");
10588 sym_get = symbol_table_insert("get");
10589 sym_put = symbol_table_insert("put");
10590 sym_selectany = symbol_table_insert("selectany");
10591 sym_thread = symbol_table_insert("thread");
10592 sym_uuid = symbol_table_insert("uuid");
10593 sym_deprecated = symbol_table_insert("deprecated");
10594 sym_restrict = symbol_table_insert("restrict");
10595 sym_noalias = symbol_table_insert("noalias");
10597 memset(token_anchor_set, 0, sizeof(token_anchor_set));
10599 init_expression_parsers();
10600 obstack_init(&temp_obst);
10602 symbol_t *const va_list_sym = symbol_table_insert("__builtin_va_list");
10603 type_valist = create_builtin_type(va_list_sym, type_void_ptr);
10607 * Terminate the parser.
10609 void exit_parser(void)
10611 obstack_free(&temp_obst, NULL);