2 * This file is part of cparser.
3 * Copyright (C) 2007-2009 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 "attribute_t.h"
38 #include "lang_features.h"
39 #include "walk_statements.h"
41 #include "adt/bitfiddle.h"
42 #include "adt/error.h"
43 #include "adt/array.h"
45 //#define PRINT_TOKENS
46 #define MAX_LOOKAHEAD 1
51 entity_namespace_t namespc;
54 typedef struct declaration_specifiers_t declaration_specifiers_t;
55 struct declaration_specifiers_t {
56 source_position_t source_position;
57 storage_class_t storage_class;
58 unsigned char alignment; /**< Alignment, 0 if not set. */
60 bool thread_local : 1; /**< GCC __thread */
61 attribute_t *attributes; /**< list of attributes */
66 * An environment for parsing initializers (and compound literals).
68 typedef struct parse_initializer_env_t {
69 type_t *type; /**< the type of the initializer. In case of an
70 array type with unspecified size this gets
71 adjusted to the actual size. */
72 entity_t *entity; /**< the variable that is initialized if any */
73 bool must_be_constant;
74 } parse_initializer_env_t;
76 typedef entity_t* (*parsed_declaration_func) (entity_t *declaration, bool is_definition);
78 /** The current token. */
80 /** The lookahead ring-buffer. */
81 static token_t lookahead_buffer[MAX_LOOKAHEAD];
82 /** Position of the next token in the lookahead buffer. */
83 static size_t lookahead_bufpos;
84 static stack_entry_t *environment_stack = NULL;
85 static stack_entry_t *label_stack = NULL;
86 static scope_t *file_scope = NULL;
87 static scope_t *current_scope = NULL;
88 /** Point to the current function declaration if inside a function. */
89 static function_t *current_function = NULL;
90 static entity_t *current_init_decl = NULL;
91 static switch_statement_t *current_switch = NULL;
92 static statement_t *current_loop = NULL;
93 static statement_t *current_parent = NULL;
94 static ms_try_statement_t *current_try = NULL;
95 static linkage_kind_t current_linkage = LINKAGE_INVALID;
96 static goto_statement_t *goto_first = NULL;
97 static goto_statement_t **goto_anchor = NULL;
98 static label_statement_t *label_first = NULL;
99 static label_statement_t **label_anchor = NULL;
100 /** current translation unit. */
101 static translation_unit_t *unit = NULL;
102 /** true if we are in a type property context (evaluation only for type. */
103 static bool in_type_prop = false;
104 /** true in we are in a __extension__ context. */
105 static bool in_gcc_extension = false;
106 static struct obstack temp_obst;
107 static entity_t *anonymous_entity;
108 static declaration_t **incomplete_arrays;
111 #define PUSH_PARENT(stmt) \
112 statement_t *const prev_parent = current_parent; \
113 ((void)(current_parent = (stmt)))
114 #define POP_PARENT ((void)(current_parent = prev_parent))
116 /** special symbol used for anonymous entities. */
117 static symbol_t *sym_anonymous = NULL;
119 /** The token anchor set */
120 static unsigned char token_anchor_set[T_LAST_TOKEN];
122 /** The current source position. */
123 #define HERE (&token.source_position)
125 /** true if we are in GCC mode. */
126 #define GNU_MODE ((c_mode & _GNUC) || in_gcc_extension)
128 static statement_t *parse_compound_statement(bool inside_expression_statement);
129 static statement_t *parse_statement(void);
131 static expression_t *parse_sub_expression(precedence_t);
132 static expression_t *parse_expression(void);
133 static type_t *parse_typename(void);
134 static void parse_externals(void);
135 static void parse_external(void);
137 static void parse_compound_type_entries(compound_t *compound_declaration);
139 static void check_call_argument(type_t *expected_type,
140 call_argument_t *argument, unsigned pos);
142 typedef enum declarator_flags_t {
144 DECL_MAY_BE_ABSTRACT = 1U << 0,
145 DECL_CREATE_COMPOUND_MEMBER = 1U << 1,
146 DECL_IS_PARAMETER = 1U << 2
147 } declarator_flags_t;
149 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
150 declarator_flags_t flags);
152 static entity_t *record_entity(entity_t *entity, bool is_definition);
154 static void semantic_comparison(binary_expression_t *expression);
156 static void create_gnu_builtins(void);
157 static void create_microsoft_intrinsics(void);
159 #define STORAGE_CLASSES \
160 STORAGE_CLASSES_NO_EXTERN \
163 #define STORAGE_CLASSES_NO_EXTERN \
170 #define TYPE_QUALIFIERS \
175 case T__forceinline: \
176 case T___attribute__:
178 #define COMPLEX_SPECIFIERS \
180 #define IMAGINARY_SPECIFIERS \
183 #define TYPE_SPECIFIERS \
185 case T___builtin_va_list: \
210 #define DECLARATION_START \
215 #define DECLARATION_START_NO_EXTERN \
216 STORAGE_CLASSES_NO_EXTERN \
220 #define TYPENAME_START \
224 #define EXPRESSION_START \
233 case T_CHARACTER_CONSTANT: \
234 case T_FLOATINGPOINT: \
238 case T_STRING_LITERAL: \
239 case T_WIDE_CHARACTER_CONSTANT: \
240 case T_WIDE_STRING_LITERAL: \
241 case T___FUNCDNAME__: \
242 case T___FUNCSIG__: \
243 case T___FUNCTION__: \
244 case T___PRETTY_FUNCTION__: \
245 case T___alignof__: \
246 case T___builtin_classify_type: \
247 case T___builtin_constant_p: \
248 case T___builtin_isgreater: \
249 case T___builtin_isgreaterequal: \
250 case T___builtin_isless: \
251 case T___builtin_islessequal: \
252 case T___builtin_islessgreater: \
253 case T___builtin_isunordered: \
254 case T___builtin_offsetof: \
255 case T___builtin_va_arg: \
256 case T___builtin_va_start: \
257 case T___builtin_va_copy: \
268 * Allocate an AST node with given size and
269 * initialize all fields with zero.
271 static void *allocate_ast_zero(size_t size)
273 void *res = allocate_ast(size);
274 memset(res, 0, size);
279 * Returns the size of an entity node.
281 * @param kind the entity kind
283 static size_t get_entity_struct_size(entity_kind_t kind)
285 static const size_t sizes[] = {
286 [ENTITY_VARIABLE] = sizeof(variable_t),
287 [ENTITY_PARAMETER] = sizeof(parameter_t),
288 [ENTITY_COMPOUND_MEMBER] = sizeof(compound_member_t),
289 [ENTITY_FUNCTION] = sizeof(function_t),
290 [ENTITY_TYPEDEF] = sizeof(typedef_t),
291 [ENTITY_STRUCT] = sizeof(compound_t),
292 [ENTITY_UNION] = sizeof(compound_t),
293 [ENTITY_ENUM] = sizeof(enum_t),
294 [ENTITY_ENUM_VALUE] = sizeof(enum_value_t),
295 [ENTITY_LABEL] = sizeof(label_t),
296 [ENTITY_LOCAL_LABEL] = sizeof(label_t),
297 [ENTITY_NAMESPACE] = sizeof(namespace_t)
299 assert(kind < lengthof(sizes));
300 assert(sizes[kind] != 0);
305 * Allocate an entity of given kind and initialize all
308 * @param kind the kind of the entity to allocate
310 static entity_t *allocate_entity_zero(entity_kind_t kind)
312 size_t size = get_entity_struct_size(kind);
313 entity_t *entity = allocate_ast_zero(size);
319 * Returns the size of a statement node.
321 * @param kind the statement kind
323 static size_t get_statement_struct_size(statement_kind_t kind)
325 static const size_t sizes[] = {
326 [STATEMENT_INVALID] = sizeof(invalid_statement_t),
327 [STATEMENT_EMPTY] = sizeof(empty_statement_t),
328 [STATEMENT_COMPOUND] = sizeof(compound_statement_t),
329 [STATEMENT_RETURN] = sizeof(return_statement_t),
330 [STATEMENT_DECLARATION] = sizeof(declaration_statement_t),
331 [STATEMENT_IF] = sizeof(if_statement_t),
332 [STATEMENT_SWITCH] = sizeof(switch_statement_t),
333 [STATEMENT_EXPRESSION] = sizeof(expression_statement_t),
334 [STATEMENT_CONTINUE] = sizeof(statement_base_t),
335 [STATEMENT_BREAK] = sizeof(statement_base_t),
336 [STATEMENT_GOTO] = sizeof(goto_statement_t),
337 [STATEMENT_LABEL] = sizeof(label_statement_t),
338 [STATEMENT_CASE_LABEL] = sizeof(case_label_statement_t),
339 [STATEMENT_WHILE] = sizeof(while_statement_t),
340 [STATEMENT_DO_WHILE] = sizeof(do_while_statement_t),
341 [STATEMENT_FOR] = sizeof(for_statement_t),
342 [STATEMENT_ASM] = sizeof(asm_statement_t),
343 [STATEMENT_MS_TRY] = sizeof(ms_try_statement_t),
344 [STATEMENT_LEAVE] = sizeof(leave_statement_t)
346 assert(kind < lengthof(sizes));
347 assert(sizes[kind] != 0);
352 * Returns the size of an expression node.
354 * @param kind the expression kind
356 static size_t get_expression_struct_size(expression_kind_t kind)
358 static const size_t sizes[] = {
359 [EXPR_INVALID] = sizeof(expression_base_t),
360 [EXPR_REFERENCE] = sizeof(reference_expression_t),
361 [EXPR_REFERENCE_ENUM_VALUE] = sizeof(reference_expression_t),
362 [EXPR_CONST] = sizeof(const_expression_t),
363 [EXPR_CHARACTER_CONSTANT] = sizeof(const_expression_t),
364 [EXPR_WIDE_CHARACTER_CONSTANT] = sizeof(const_expression_t),
365 [EXPR_STRING_LITERAL] = sizeof(string_literal_expression_t),
366 [EXPR_WIDE_STRING_LITERAL] = sizeof(wide_string_literal_expression_t),
367 [EXPR_COMPOUND_LITERAL] = sizeof(compound_literal_expression_t),
368 [EXPR_CALL] = sizeof(call_expression_t),
369 [EXPR_UNARY_FIRST] = sizeof(unary_expression_t),
370 [EXPR_BINARY_FIRST] = sizeof(binary_expression_t),
371 [EXPR_CONDITIONAL] = sizeof(conditional_expression_t),
372 [EXPR_SELECT] = sizeof(select_expression_t),
373 [EXPR_ARRAY_ACCESS] = sizeof(array_access_expression_t),
374 [EXPR_SIZEOF] = sizeof(typeprop_expression_t),
375 [EXPR_ALIGNOF] = sizeof(typeprop_expression_t),
376 [EXPR_CLASSIFY_TYPE] = sizeof(classify_type_expression_t),
377 [EXPR_FUNCNAME] = sizeof(funcname_expression_t),
378 [EXPR_BUILTIN_CONSTANT_P] = sizeof(builtin_constant_expression_t),
379 [EXPR_BUILTIN_TYPES_COMPATIBLE_P] = sizeof(builtin_types_compatible_expression_t),
380 [EXPR_OFFSETOF] = sizeof(offsetof_expression_t),
381 [EXPR_VA_START] = sizeof(va_start_expression_t),
382 [EXPR_VA_ARG] = sizeof(va_arg_expression_t),
383 [EXPR_VA_COPY] = sizeof(va_copy_expression_t),
384 [EXPR_STATEMENT] = sizeof(statement_expression_t),
385 [EXPR_LABEL_ADDRESS] = sizeof(label_address_expression_t),
387 if (kind >= EXPR_UNARY_FIRST && kind <= EXPR_UNARY_LAST) {
388 return sizes[EXPR_UNARY_FIRST];
390 if (kind >= EXPR_BINARY_FIRST && kind <= EXPR_BINARY_LAST) {
391 return sizes[EXPR_BINARY_FIRST];
393 assert(kind < lengthof(sizes));
394 assert(sizes[kind] != 0);
399 * Allocate a statement node of given kind and initialize all
400 * fields with zero. Sets its source position to the position
401 * of the current token.
403 static statement_t *allocate_statement_zero(statement_kind_t kind)
405 size_t size = get_statement_struct_size(kind);
406 statement_t *res = allocate_ast_zero(size);
408 res->base.kind = kind;
409 res->base.parent = current_parent;
410 res->base.source_position = token.source_position;
415 * Allocate an expression node of given kind and initialize all
418 * @param kind the kind of the expression to allocate
420 static expression_t *allocate_expression_zero(expression_kind_t kind)
422 size_t size = get_expression_struct_size(kind);
423 expression_t *res = allocate_ast_zero(size);
425 res->base.kind = kind;
426 res->base.type = type_error_type;
427 res->base.source_position = token.source_position;
432 * Creates a new invalid expression at the source position
433 * of the current token.
435 static expression_t *create_invalid_expression(void)
437 return allocate_expression_zero(EXPR_INVALID);
441 * Creates a new invalid statement.
443 static statement_t *create_invalid_statement(void)
445 return allocate_statement_zero(STATEMENT_INVALID);
449 * Allocate a new empty statement.
451 static statement_t *create_empty_statement(void)
453 return allocate_statement_zero(STATEMENT_EMPTY);
457 * Returns the size of a type node.
459 * @param kind the type kind
461 static size_t get_type_struct_size(type_kind_t kind)
463 static const size_t sizes[] = {
464 [TYPE_ATOMIC] = sizeof(atomic_type_t),
465 [TYPE_COMPLEX] = sizeof(complex_type_t),
466 [TYPE_IMAGINARY] = sizeof(imaginary_type_t),
467 [TYPE_BITFIELD] = sizeof(bitfield_type_t),
468 [TYPE_COMPOUND_STRUCT] = sizeof(compound_type_t),
469 [TYPE_COMPOUND_UNION] = sizeof(compound_type_t),
470 [TYPE_ENUM] = sizeof(enum_type_t),
471 [TYPE_FUNCTION] = sizeof(function_type_t),
472 [TYPE_POINTER] = sizeof(pointer_type_t),
473 [TYPE_ARRAY] = sizeof(array_type_t),
474 [TYPE_BUILTIN] = sizeof(builtin_type_t),
475 [TYPE_TYPEDEF] = sizeof(typedef_type_t),
476 [TYPE_TYPEOF] = sizeof(typeof_type_t),
478 assert(lengthof(sizes) == (int)TYPE_TYPEOF + 1);
479 assert(kind <= TYPE_TYPEOF);
480 assert(sizes[kind] != 0);
485 * Allocate a type node of given kind and initialize all
488 * @param kind type kind to allocate
490 static type_t *allocate_type_zero(type_kind_t kind)
492 size_t size = get_type_struct_size(kind);
493 type_t *res = obstack_alloc(type_obst, size);
494 memset(res, 0, size);
495 res->base.kind = kind;
500 static function_parameter_t *allocate_parameter(type_t *const type)
502 function_parameter_t *const param = obstack_alloc(type_obst, sizeof(*param));
503 memset(param, 0, sizeof(*param));
509 * Returns the size of an initializer node.
511 * @param kind the initializer kind
513 static size_t get_initializer_size(initializer_kind_t kind)
515 static const size_t sizes[] = {
516 [INITIALIZER_VALUE] = sizeof(initializer_value_t),
517 [INITIALIZER_STRING] = sizeof(initializer_string_t),
518 [INITIALIZER_WIDE_STRING] = sizeof(initializer_wide_string_t),
519 [INITIALIZER_LIST] = sizeof(initializer_list_t),
520 [INITIALIZER_DESIGNATOR] = sizeof(initializer_designator_t)
522 assert(kind < lengthof(sizes));
523 assert(sizes[kind] != 0);
528 * Allocate an initializer node of given kind and initialize all
531 static initializer_t *allocate_initializer_zero(initializer_kind_t kind)
533 initializer_t *result = allocate_ast_zero(get_initializer_size(kind));
540 * Returns the index of the top element of the environment stack.
542 static size_t environment_top(void)
544 return ARR_LEN(environment_stack);
548 * Returns the index of the top element of the global label stack.
550 static size_t label_top(void)
552 return ARR_LEN(label_stack);
556 * Return the next token.
558 static inline void next_token(void)
560 token = lookahead_buffer[lookahead_bufpos];
561 lookahead_buffer[lookahead_bufpos] = lexer_token;
564 lookahead_bufpos = (lookahead_bufpos + 1) % MAX_LOOKAHEAD;
567 print_token(stderr, &token);
568 fprintf(stderr, "\n");
573 * Return the next token with a given lookahead.
575 static inline const token_t *look_ahead(size_t num)
577 assert(0 < num && num <= MAX_LOOKAHEAD);
578 size_t pos = (lookahead_bufpos + num - 1) % MAX_LOOKAHEAD;
579 return &lookahead_buffer[pos];
583 * Adds a token type to the token type anchor set (a multi-set).
585 static void add_anchor_token(int token_type)
587 assert(0 <= token_type && token_type < T_LAST_TOKEN);
588 ++token_anchor_set[token_type];
592 * Set the number of tokens types of the given type
593 * to zero and return the old count.
595 static int save_and_reset_anchor_state(int token_type)
597 assert(0 <= token_type && token_type < T_LAST_TOKEN);
598 int count = token_anchor_set[token_type];
599 token_anchor_set[token_type] = 0;
604 * Restore the number of token types to the given count.
606 static void restore_anchor_state(int token_type, int count)
608 assert(0 <= token_type && token_type < T_LAST_TOKEN);
609 token_anchor_set[token_type] = count;
613 * Remove a token type from the token type anchor set (a multi-set).
615 static void rem_anchor_token(int token_type)
617 assert(0 <= token_type && token_type < T_LAST_TOKEN);
618 assert(token_anchor_set[token_type] != 0);
619 --token_anchor_set[token_type];
623 * Return true if the token type of the current token is
626 static bool at_anchor(void)
630 return token_anchor_set[token.type];
634 * Eat tokens until a matching token type is found.
636 static void eat_until_matching_token(int type)
640 case '(': end_token = ')'; break;
641 case '{': end_token = '}'; break;
642 case '[': end_token = ']'; break;
643 default: end_token = type; break;
646 unsigned parenthesis_count = 0;
647 unsigned brace_count = 0;
648 unsigned bracket_count = 0;
649 while (token.type != end_token ||
650 parenthesis_count != 0 ||
652 bracket_count != 0) {
653 switch (token.type) {
655 case '(': ++parenthesis_count; break;
656 case '{': ++brace_count; break;
657 case '[': ++bracket_count; break;
660 if (parenthesis_count > 0)
670 if (bracket_count > 0)
673 if (token.type == end_token &&
674 parenthesis_count == 0 &&
688 * Eat input tokens until an anchor is found.
690 static void eat_until_anchor(void)
692 while (token_anchor_set[token.type] == 0) {
693 if (token.type == '(' || token.type == '{' || token.type == '[')
694 eat_until_matching_token(token.type);
700 * Eat a whole block from input tokens.
702 static void eat_block(void)
704 eat_until_matching_token('{');
705 if (token.type == '}')
709 #define eat(token_type) (assert(token.type == (token_type)), next_token())
712 * Report a parse error because an expected token was not found.
715 #if defined __GNUC__ && __GNUC__ >= 4
716 __attribute__((sentinel))
718 void parse_error_expected(const char *message, ...)
720 if (message != NULL) {
721 errorf(HERE, "%s", message);
724 va_start(ap, message);
725 errorf(HERE, "got %K, expected %#k", &token, &ap, ", ");
730 * Report an incompatible type.
732 static void type_error_incompatible(const char *msg,
733 const source_position_t *source_position, type_t *type1, type_t *type2)
735 errorf(source_position, "%s, incompatible types: '%T' - '%T'",
740 * Expect the current token is the expected token.
741 * If not, generate an error, eat the current statement,
742 * and goto the end_error label.
744 #define expect(expected, error_label) \
746 if (UNLIKELY(token.type != (expected))) { \
747 parse_error_expected(NULL, (expected), NULL); \
748 add_anchor_token(expected); \
749 eat_until_anchor(); \
750 if (token.type == expected) \
752 rem_anchor_token(expected); \
759 * Push a given scope on the scope stack and make it the
762 static scope_t *scope_push(scope_t *new_scope)
764 if (current_scope != NULL) {
765 new_scope->depth = current_scope->depth + 1;
768 scope_t *old_scope = current_scope;
769 current_scope = new_scope;
774 * Pop the current scope from the scope stack.
776 static void scope_pop(scope_t *old_scope)
778 current_scope = old_scope;
782 * Search an entity by its symbol in a given namespace.
784 static entity_t *get_entity(const symbol_t *const symbol,
785 namespace_tag_t namespc)
787 entity_t *entity = symbol->entity;
788 for (; entity != NULL; entity = entity->base.symbol_next) {
789 if (entity->base.namespc == namespc)
796 /* §6.2.3:1 24) There is only one name space for tags even though three are
798 static entity_t *get_tag(symbol_t const *const symbol,
799 entity_kind_tag_t const kind)
801 entity_t *entity = get_entity(symbol, NAMESPACE_TAG);
802 if (entity != NULL && entity->kind != kind) {
804 "'%Y' defined as wrong kind of tag (previous definition %P)",
805 symbol, &entity->base.source_position);
812 * pushs an entity on the environment stack and links the corresponding symbol
815 static void stack_push(stack_entry_t **stack_ptr, entity_t *entity)
817 symbol_t *symbol = entity->base.symbol;
818 entity_namespace_t namespc = entity->base.namespc;
819 assert(namespc != NAMESPACE_INVALID);
821 /* replace/add entity into entity list of the symbol */
824 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
829 /* replace an entry? */
830 if (iter->base.namespc == namespc) {
831 entity->base.symbol_next = iter->base.symbol_next;
837 /* remember old declaration */
839 entry.symbol = symbol;
840 entry.old_entity = iter;
841 entry.namespc = namespc;
842 ARR_APP1(stack_entry_t, *stack_ptr, entry);
846 * Push an entity on the environment stack.
848 static void environment_push(entity_t *entity)
850 assert(entity->base.source_position.input_name != NULL);
851 assert(entity->base.parent_scope != NULL);
852 stack_push(&environment_stack, entity);
856 * Push a declaration on the global label stack.
858 * @param declaration the declaration
860 static void label_push(entity_t *label)
862 /* we abuse the parameters scope as parent for the labels */
863 label->base.parent_scope = ¤t_function->parameters;
864 stack_push(&label_stack, label);
868 * pops symbols from the environment stack until @p new_top is the top element
870 static void stack_pop_to(stack_entry_t **stack_ptr, size_t new_top)
872 stack_entry_t *stack = *stack_ptr;
873 size_t top = ARR_LEN(stack);
876 assert(new_top <= top);
880 for (i = top; i > new_top; --i) {
881 stack_entry_t *entry = &stack[i - 1];
883 entity_t *old_entity = entry->old_entity;
884 symbol_t *symbol = entry->symbol;
885 entity_namespace_t namespc = entry->namespc;
887 /* replace with old_entity/remove */
890 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
892 assert(iter != NULL);
893 /* replace an entry? */
894 if (iter->base.namespc == namespc)
898 /* restore definition from outer scopes (if there was one) */
899 if (old_entity != NULL) {
900 old_entity->base.symbol_next = iter->base.symbol_next;
901 *anchor = old_entity;
903 /* remove entry from list */
904 *anchor = iter->base.symbol_next;
908 ARR_SHRINKLEN(*stack_ptr, (int) new_top);
912 * Pop all entries from the environment stack until the new_top
915 * @param new_top the new stack top
917 static void environment_pop_to(size_t new_top)
919 stack_pop_to(&environment_stack, new_top);
923 * Pop all entries from the global label stack until the new_top
926 * @param new_top the new stack top
928 static void label_pop_to(size_t new_top)
930 stack_pop_to(&label_stack, new_top);
933 static int get_akind_rank(atomic_type_kind_t akind)
939 * Return the type rank for an atomic type.
941 static int get_rank(const type_t *type)
943 assert(!is_typeref(type));
944 if (type->kind == TYPE_ENUM)
945 return get_akind_rank(type->enumt.akind);
947 assert(type->kind == TYPE_ATOMIC);
948 return get_akind_rank(type->atomic.akind);
952 * §6.3.1.1:2 Do integer promotion for a given type.
954 * @param type the type to promote
955 * @return the promoted type
957 static type_t *promote_integer(type_t *type)
959 if (type->kind == TYPE_BITFIELD)
960 type = type->bitfield.base_type;
962 if (get_rank(type) < get_akind_rank(ATOMIC_TYPE_INT))
969 * Create a cast expression.
971 * @param expression the expression to cast
972 * @param dest_type the destination type
974 static expression_t *create_cast_expression(expression_t *expression,
977 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST_IMPLICIT);
979 cast->unary.value = expression;
980 cast->base.type = dest_type;
986 * Check if a given expression represents a null pointer constant.
988 * @param expression the expression to check
990 static bool is_null_pointer_constant(const expression_t *expression)
992 /* skip void* cast */
993 if (expression->kind == EXPR_UNARY_CAST ||
994 expression->kind == EXPR_UNARY_CAST_IMPLICIT) {
995 type_t *const type = skip_typeref(expression->base.type);
996 if (types_compatible(type, type_void_ptr))
997 expression = expression->unary.value;
1000 type_t *const type = skip_typeref(expression->base.type);
1002 is_type_integer(type) &&
1003 is_constant_expression(expression) &&
1004 !fold_constant_to_bool(expression);
1008 * Create an implicit cast expression.
1010 * @param expression the expression to cast
1011 * @param dest_type the destination type
1013 static expression_t *create_implicit_cast(expression_t *expression,
1016 type_t *const source_type = expression->base.type;
1018 if (source_type == dest_type)
1021 return create_cast_expression(expression, dest_type);
1024 typedef enum assign_error_t {
1026 ASSIGN_ERROR_INCOMPATIBLE,
1027 ASSIGN_ERROR_POINTER_QUALIFIER_MISSING,
1028 ASSIGN_WARNING_POINTER_INCOMPATIBLE,
1029 ASSIGN_WARNING_POINTER_FROM_INT,
1030 ASSIGN_WARNING_INT_FROM_POINTER
1033 static void report_assign_error(assign_error_t error, type_t *orig_type_left,
1034 const expression_t *const right,
1035 const char *context,
1036 const source_position_t *source_position)
1038 type_t *const orig_type_right = right->base.type;
1039 type_t *const type_left = skip_typeref(orig_type_left);
1040 type_t *const type_right = skip_typeref(orig_type_right);
1043 case ASSIGN_SUCCESS:
1045 case ASSIGN_ERROR_INCOMPATIBLE:
1046 errorf(source_position,
1047 "destination type '%T' in %s is incompatible with type '%T'",
1048 orig_type_left, context, orig_type_right);
1051 case ASSIGN_ERROR_POINTER_QUALIFIER_MISSING: {
1052 if (warning.other) {
1053 type_t *points_to_left = skip_typeref(type_left->pointer.points_to);
1054 type_t *points_to_right = skip_typeref(type_right->pointer.points_to);
1056 /* the left type has all qualifiers from the right type */
1057 unsigned missing_qualifiers
1058 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
1059 warningf(source_position,
1060 "destination type '%T' in %s from type '%T' lacks qualifiers '%Q' in pointer target type",
1061 orig_type_left, context, orig_type_right, missing_qualifiers);
1066 case ASSIGN_WARNING_POINTER_INCOMPATIBLE:
1067 if (warning.other) {
1068 warningf(source_position,
1069 "destination type '%T' in %s is incompatible with '%E' of type '%T'",
1070 orig_type_left, context, right, orig_type_right);
1074 case ASSIGN_WARNING_POINTER_FROM_INT:
1075 if (warning.other) {
1076 warningf(source_position,
1077 "%s makes pointer '%T' from integer '%T' without a cast",
1078 context, orig_type_left, orig_type_right);
1082 case ASSIGN_WARNING_INT_FROM_POINTER:
1083 if (warning.other) {
1084 warningf(source_position,
1085 "%s makes integer '%T' from pointer '%T' without a cast",
1086 context, orig_type_left, orig_type_right);
1091 panic("invalid error value");
1095 /** Implements the rules from §6.5.16.1 */
1096 static assign_error_t semantic_assign(type_t *orig_type_left,
1097 const expression_t *const right)
1099 type_t *const orig_type_right = right->base.type;
1100 type_t *const type_left = skip_typeref(orig_type_left);
1101 type_t *const type_right = skip_typeref(orig_type_right);
1103 if (is_type_pointer(type_left)) {
1104 if (is_null_pointer_constant(right)) {
1105 return ASSIGN_SUCCESS;
1106 } else if (is_type_pointer(type_right)) {
1107 type_t *points_to_left
1108 = skip_typeref(type_left->pointer.points_to);
1109 type_t *points_to_right
1110 = skip_typeref(type_right->pointer.points_to);
1111 assign_error_t res = ASSIGN_SUCCESS;
1113 /* the left type has all qualifiers from the right type */
1114 unsigned missing_qualifiers
1115 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
1116 if (missing_qualifiers != 0) {
1117 res = ASSIGN_ERROR_POINTER_QUALIFIER_MISSING;
1120 points_to_left = get_unqualified_type(points_to_left);
1121 points_to_right = get_unqualified_type(points_to_right);
1123 if (is_type_atomic(points_to_left, ATOMIC_TYPE_VOID))
1126 if (is_type_atomic(points_to_right, ATOMIC_TYPE_VOID)) {
1127 /* ISO/IEC 14882:1998(E) §C.1.2:6 */
1128 return c_mode & _CXX ? ASSIGN_ERROR_INCOMPATIBLE : res;
1131 if (!types_compatible(points_to_left, points_to_right)) {
1132 return ASSIGN_WARNING_POINTER_INCOMPATIBLE;
1136 } else if (is_type_integer(type_right)) {
1137 return ASSIGN_WARNING_POINTER_FROM_INT;
1139 } else if ((is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) ||
1140 (is_type_atomic(type_left, ATOMIC_TYPE_BOOL)
1141 && is_type_pointer(type_right))) {
1142 return ASSIGN_SUCCESS;
1143 } else if ((is_type_compound(type_left) && is_type_compound(type_right))
1144 || (is_type_builtin(type_left) && is_type_builtin(type_right))) {
1145 type_t *const unqual_type_left = get_unqualified_type(type_left);
1146 type_t *const unqual_type_right = get_unqualified_type(type_right);
1147 if (types_compatible(unqual_type_left, unqual_type_right)) {
1148 return ASSIGN_SUCCESS;
1150 } else if (is_type_integer(type_left) && is_type_pointer(type_right)) {
1151 return ASSIGN_WARNING_INT_FROM_POINTER;
1154 if (!is_type_valid(type_left) || !is_type_valid(type_right))
1155 return ASSIGN_SUCCESS;
1157 return ASSIGN_ERROR_INCOMPATIBLE;
1160 static expression_t *parse_constant_expression(void)
1162 expression_t *result = parse_sub_expression(PREC_CONDITIONAL);
1164 if (!is_constant_expression(result)) {
1165 errorf(&result->base.source_position,
1166 "expression '%E' is not constant", result);
1172 static expression_t *parse_assignment_expression(void)
1174 return parse_sub_expression(PREC_ASSIGNMENT);
1177 static string_t parse_string_literals(void)
1179 assert(token.type == T_STRING_LITERAL);
1180 string_t result = token.v.string;
1184 while (token.type == T_STRING_LITERAL) {
1185 result = concat_strings(&result, &token.v.string);
1193 * compare two string, ignoring double underscores on the second.
1195 static int strcmp_underscore(const char *s1, const char *s2)
1197 if (s2[0] == '_' && s2[1] == '_') {
1198 size_t len2 = strlen(s2);
1199 size_t len1 = strlen(s1);
1200 if (len1 == len2-4 && s2[len2-2] == '_' && s2[len2-1] == '_') {
1201 return strncmp(s1, s2+2, len2-4);
1205 return strcmp(s1, s2);
1208 static attribute_t *allocate_attribute_zero(attribute_kind_t kind)
1210 attribute_t *attribute = allocate_ast_zero(sizeof(*attribute));
1211 attribute->kind = kind;
1216 * Parse (gcc) attribute argument. From gcc comments in gcc source:
1219 * __attribute__ ( ( attribute-list ) )
1223 * attribute_list , attrib
1228 * any-word ( identifier )
1229 * any-word ( identifier , nonempty-expr-list )
1230 * any-word ( expr-list )
1232 * where the "identifier" must not be declared as a type, and
1233 * "any-word" may be any identifier (including one declared as a
1234 * type), a reserved word storage class specifier, type specifier or
1235 * type qualifier. ??? This still leaves out most reserved keywords
1236 * (following the old parser), shouldn't we include them, and why not
1237 * allow identifiers declared as types to start the arguments?
1239 * Matze: this all looks confusing and little systematic, so we're even less
1240 * strict and parse any list of things which are identifiers or
1241 * (assignment-)expressions.
1243 static attribute_argument_t *parse_attribute_arguments(void)
1245 if (token.type == ')')
1248 attribute_argument_t *first = NULL;
1249 attribute_argument_t *last = NULL;
1251 attribute_argument_t *argument = allocate_ast_zero(sizeof(*argument));
1253 /* is it an identifier */
1254 if (token.type == T_IDENTIFIER
1255 && (look_ahead(1)->type == ',' || look_ahead(1)->type == ')')) {
1256 symbol_t *symbol = token.v.symbol;
1257 argument->kind = ATTRIBUTE_ARGUMENT_SYMBOL;
1258 argument->v.symbol = symbol;
1261 /* must be an expression */
1262 expression_t *expression = parse_assignment_expression();
1264 argument->kind = ATTRIBUTE_ARGUMENT_EXPRESSION;
1265 argument->v.expression = expression;
1268 /* append argument */
1272 last->next = argument;
1276 if (token.type == ',') {
1280 expect(')', end_error);
1291 static attribute_t *parse_attribute_asm(void)
1295 attribute_t *attribute = allocate_attribute_zero(ATTRIBUTE_GNU_ASM);
1297 expect('(', end_error);
1298 attribute->a.arguments = parse_attribute_arguments();
1305 static symbol_t *get_symbol_from_token(void)
1307 switch(token.type) {
1309 return token.v.symbol;
1338 /* maybe we need more tokens ... add them on demand */
1339 return get_token_symbol(&token);
1345 static attribute_t *parse_attribute_gnu_single(void)
1347 /* parse "any-word" */
1348 symbol_t *symbol = get_symbol_from_token();
1349 if (symbol == NULL) {
1350 parse_error_expected("while parsing attribute((", T_IDENTIFIER, NULL);
1354 const char *name = symbol->string;
1357 attribute_kind_t kind;
1358 for (kind = ATTRIBUTE_GNU_FIRST; kind <= ATTRIBUTE_GNU_LAST; ++kind) {
1359 const char *attribute_name = get_attribute_name(kind);
1360 if (attribute_name != NULL
1361 && strcmp_underscore(attribute_name, name) == 0)
1365 if (kind >= ATTRIBUTE_GNU_LAST) {
1366 if (warning.attribute) {
1367 warningf(HERE, "unknown attribute '%s' ignored", name);
1369 /* TODO: we should still save the attribute in the list... */
1370 kind = ATTRIBUTE_UNKNOWN;
1373 attribute_t *attribute = allocate_attribute_zero(kind);
1375 /* parse arguments */
1376 if (token.type == '(') {
1378 attribute->a.arguments = parse_attribute_arguments();
1387 static attribute_t *parse_attribute_gnu(void)
1389 attribute_t *first = NULL;
1390 attribute_t *last = NULL;
1392 eat(T___attribute__);
1393 expect('(', end_error);
1394 expect('(', end_error);
1396 if (token.type == ')') {
1398 expect(')', end_error);
1403 attribute_t *attribute = parse_attribute_gnu_single();
1404 if (attribute == NULL)
1410 last->next = attribute;
1414 if (token.type == ')') {
1418 expect(',', end_error);
1420 expect(')', end_error);
1426 /** Parse attributes. */
1427 static attribute_t *parse_attributes(attribute_t *first)
1429 attribute_t *last = first;
1432 while (last->next != NULL)
1436 attribute_t *attribute;
1437 switch (token.type) {
1438 case T___attribute__:
1439 attribute = parse_attribute_gnu();
1443 attribute = parse_attribute_asm();
1448 attribute = allocate_attribute_zero(ATTRIBUTE_MS_CDECL);
1453 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FASTCALL);
1456 case T__forceinline:
1458 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FORCEINLINE);
1463 attribute = allocate_attribute_zero(ATTRIBUTE_MS_STDCALL);
1468 /* TODO record modifier */
1470 warningf(HERE, "Ignoring declaration modifier %K", &token);
1471 attribute = allocate_attribute_zero(ATTRIBUTE_MS_THISCALL);
1481 last->next = attribute;
1487 static void mark_vars_read(expression_t *expr, entity_t *lhs_ent);
1489 static entity_t *determine_lhs_ent(expression_t *const expr,
1492 switch (expr->kind) {
1493 case EXPR_REFERENCE: {
1494 entity_t *const entity = expr->reference.entity;
1495 /* we should only find variables as lvalues... */
1496 if (entity->base.kind != ENTITY_VARIABLE
1497 && entity->base.kind != ENTITY_PARAMETER)
1503 case EXPR_ARRAY_ACCESS: {
1504 expression_t *const ref = expr->array_access.array_ref;
1505 entity_t * ent = NULL;
1506 if (is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1507 ent = determine_lhs_ent(ref, lhs_ent);
1510 mark_vars_read(expr->select.compound, lhs_ent);
1512 mark_vars_read(expr->array_access.index, lhs_ent);
1517 if (is_type_compound(skip_typeref(expr->base.type))) {
1518 return determine_lhs_ent(expr->select.compound, lhs_ent);
1520 mark_vars_read(expr->select.compound, lhs_ent);
1525 case EXPR_UNARY_DEREFERENCE: {
1526 expression_t *const val = expr->unary.value;
1527 if (val->kind == EXPR_UNARY_TAKE_ADDRESS) {
1529 return determine_lhs_ent(val->unary.value, lhs_ent);
1531 mark_vars_read(val, NULL);
1537 mark_vars_read(expr, NULL);
1542 #define ENT_ANY ((entity_t*)-1)
1545 * Mark declarations, which are read. This is used to detect variables, which
1549 * x is not marked as "read", because it is only read to calculate its own new
1553 * x and y are not detected as "not read", because multiple variables are
1556 static void mark_vars_read(expression_t *const expr, entity_t *lhs_ent)
1558 switch (expr->kind) {
1559 case EXPR_REFERENCE: {
1560 entity_t *const entity = expr->reference.entity;
1561 if (entity->kind != ENTITY_VARIABLE
1562 && entity->kind != ENTITY_PARAMETER)
1565 if (lhs_ent != entity && lhs_ent != ENT_ANY) {
1566 if (entity->kind == ENTITY_VARIABLE) {
1567 entity->variable.read = true;
1569 entity->parameter.read = true;
1576 // TODO respect pure/const
1577 mark_vars_read(expr->call.function, NULL);
1578 for (call_argument_t *arg = expr->call.arguments; arg != NULL; arg = arg->next) {
1579 mark_vars_read(arg->expression, NULL);
1583 case EXPR_CONDITIONAL:
1584 // TODO lhs_decl should depend on whether true/false have an effect
1585 mark_vars_read(expr->conditional.condition, NULL);
1586 if (expr->conditional.true_expression != NULL)
1587 mark_vars_read(expr->conditional.true_expression, lhs_ent);
1588 mark_vars_read(expr->conditional.false_expression, lhs_ent);
1592 if (lhs_ent == ENT_ANY
1593 && !is_type_compound(skip_typeref(expr->base.type)))
1595 mark_vars_read(expr->select.compound, lhs_ent);
1598 case EXPR_ARRAY_ACCESS: {
1599 expression_t *const ref = expr->array_access.array_ref;
1600 mark_vars_read(ref, lhs_ent);
1601 lhs_ent = determine_lhs_ent(ref, lhs_ent);
1602 mark_vars_read(expr->array_access.index, lhs_ent);
1607 mark_vars_read(expr->va_arge.ap, lhs_ent);
1611 mark_vars_read(expr->va_copye.src, lhs_ent);
1614 case EXPR_UNARY_CAST:
1615 /* Special case: Use void cast to mark a variable as "read" */
1616 if (is_type_atomic(skip_typeref(expr->base.type), ATOMIC_TYPE_VOID))
1621 case EXPR_UNARY_THROW:
1622 if (expr->unary.value == NULL)
1625 case EXPR_UNARY_DEREFERENCE:
1626 case EXPR_UNARY_DELETE:
1627 case EXPR_UNARY_DELETE_ARRAY:
1628 if (lhs_ent == ENT_ANY)
1632 case EXPR_UNARY_NEGATE:
1633 case EXPR_UNARY_PLUS:
1634 case EXPR_UNARY_BITWISE_NEGATE:
1635 case EXPR_UNARY_NOT:
1636 case EXPR_UNARY_TAKE_ADDRESS:
1637 case EXPR_UNARY_POSTFIX_INCREMENT:
1638 case EXPR_UNARY_POSTFIX_DECREMENT:
1639 case EXPR_UNARY_PREFIX_INCREMENT:
1640 case EXPR_UNARY_PREFIX_DECREMENT:
1641 case EXPR_UNARY_CAST_IMPLICIT:
1642 case EXPR_UNARY_ASSUME:
1644 mark_vars_read(expr->unary.value, lhs_ent);
1647 case EXPR_BINARY_ADD:
1648 case EXPR_BINARY_SUB:
1649 case EXPR_BINARY_MUL:
1650 case EXPR_BINARY_DIV:
1651 case EXPR_BINARY_MOD:
1652 case EXPR_BINARY_EQUAL:
1653 case EXPR_BINARY_NOTEQUAL:
1654 case EXPR_BINARY_LESS:
1655 case EXPR_BINARY_LESSEQUAL:
1656 case EXPR_BINARY_GREATER:
1657 case EXPR_BINARY_GREATEREQUAL:
1658 case EXPR_BINARY_BITWISE_AND:
1659 case EXPR_BINARY_BITWISE_OR:
1660 case EXPR_BINARY_BITWISE_XOR:
1661 case EXPR_BINARY_LOGICAL_AND:
1662 case EXPR_BINARY_LOGICAL_OR:
1663 case EXPR_BINARY_SHIFTLEFT:
1664 case EXPR_BINARY_SHIFTRIGHT:
1665 case EXPR_BINARY_COMMA:
1666 case EXPR_BINARY_ISGREATER:
1667 case EXPR_BINARY_ISGREATEREQUAL:
1668 case EXPR_BINARY_ISLESS:
1669 case EXPR_BINARY_ISLESSEQUAL:
1670 case EXPR_BINARY_ISLESSGREATER:
1671 case EXPR_BINARY_ISUNORDERED:
1672 mark_vars_read(expr->binary.left, lhs_ent);
1673 mark_vars_read(expr->binary.right, lhs_ent);
1676 case EXPR_BINARY_ASSIGN:
1677 case EXPR_BINARY_MUL_ASSIGN:
1678 case EXPR_BINARY_DIV_ASSIGN:
1679 case EXPR_BINARY_MOD_ASSIGN:
1680 case EXPR_BINARY_ADD_ASSIGN:
1681 case EXPR_BINARY_SUB_ASSIGN:
1682 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
1683 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
1684 case EXPR_BINARY_BITWISE_AND_ASSIGN:
1685 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
1686 case EXPR_BINARY_BITWISE_OR_ASSIGN: {
1687 if (lhs_ent == ENT_ANY)
1689 lhs_ent = determine_lhs_ent(expr->binary.left, lhs_ent);
1690 mark_vars_read(expr->binary.right, lhs_ent);
1695 determine_lhs_ent(expr->va_starte.ap, lhs_ent);
1701 case EXPR_CHARACTER_CONSTANT:
1702 case EXPR_WIDE_CHARACTER_CONSTANT:
1703 case EXPR_STRING_LITERAL:
1704 case EXPR_WIDE_STRING_LITERAL:
1705 case EXPR_COMPOUND_LITERAL: // TODO init?
1707 case EXPR_CLASSIFY_TYPE:
1710 case EXPR_BUILTIN_CONSTANT_P:
1711 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
1713 case EXPR_STATEMENT: // TODO
1714 case EXPR_LABEL_ADDRESS:
1715 case EXPR_REFERENCE_ENUM_VALUE:
1719 panic("unhandled expression");
1722 static designator_t *parse_designation(void)
1724 designator_t *result = NULL;
1725 designator_t *last = NULL;
1728 designator_t *designator;
1729 switch (token.type) {
1731 designator = allocate_ast_zero(sizeof(designator[0]));
1732 designator->source_position = token.source_position;
1734 add_anchor_token(']');
1735 designator->array_index = parse_constant_expression();
1736 rem_anchor_token(']');
1737 expect(']', end_error);
1740 designator = allocate_ast_zero(sizeof(designator[0]));
1741 designator->source_position = token.source_position;
1743 if (token.type != T_IDENTIFIER) {
1744 parse_error_expected("while parsing designator",
1745 T_IDENTIFIER, NULL);
1748 designator->symbol = token.v.symbol;
1752 expect('=', end_error);
1756 assert(designator != NULL);
1758 last->next = designator;
1760 result = designator;
1768 static initializer_t *initializer_from_string(array_type_t *type,
1769 const string_t *const string)
1771 /* TODO: check len vs. size of array type */
1774 initializer_t *initializer = allocate_initializer_zero(INITIALIZER_STRING);
1775 initializer->string.string = *string;
1780 static initializer_t *initializer_from_wide_string(array_type_t *const type,
1781 wide_string_t *const string)
1783 /* TODO: check len vs. size of array type */
1786 initializer_t *const initializer =
1787 allocate_initializer_zero(INITIALIZER_WIDE_STRING);
1788 initializer->wide_string.string = *string;
1794 * Build an initializer from a given expression.
1796 static initializer_t *initializer_from_expression(type_t *orig_type,
1797 expression_t *expression)
1799 /* TODO check that expression is a constant expression */
1801 /* §6.7.8.14/15 char array may be initialized by string literals */
1802 type_t *type = skip_typeref(orig_type);
1803 type_t *expr_type_orig = expression->base.type;
1804 type_t *expr_type = skip_typeref(expr_type_orig);
1805 if (is_type_array(type) && expr_type->kind == TYPE_POINTER) {
1806 array_type_t *const array_type = &type->array;
1807 type_t *const element_type = skip_typeref(array_type->element_type);
1809 if (element_type->kind == TYPE_ATOMIC) {
1810 atomic_type_kind_t akind = element_type->atomic.akind;
1811 switch (expression->kind) {
1812 case EXPR_STRING_LITERAL:
1813 if (akind == ATOMIC_TYPE_CHAR
1814 || akind == ATOMIC_TYPE_SCHAR
1815 || akind == ATOMIC_TYPE_UCHAR) {
1816 return initializer_from_string(array_type,
1817 &expression->string.value);
1821 case EXPR_WIDE_STRING_LITERAL: {
1822 type_t *bare_wchar_type = skip_typeref(type_wchar_t);
1823 if (get_unqualified_type(element_type) == bare_wchar_type) {
1824 return initializer_from_wide_string(array_type,
1825 &expression->wide_string.value);
1836 assign_error_t error = semantic_assign(type, expression);
1837 if (error == ASSIGN_ERROR_INCOMPATIBLE)
1839 report_assign_error(error, type, expression, "initializer",
1840 &expression->base.source_position);
1842 initializer_t *const result = allocate_initializer_zero(INITIALIZER_VALUE);
1843 result->value.value = create_implicit_cast(expression, type);
1849 * Checks if a given expression can be used as an constant initializer.
1851 static bool is_initializer_constant(const expression_t *expression)
1853 return is_constant_expression(expression)
1854 || is_address_constant(expression);
1858 * Parses an scalar initializer.
1860 * §6.7.8.11; eat {} without warning
1862 static initializer_t *parse_scalar_initializer(type_t *type,
1863 bool must_be_constant)
1865 /* there might be extra {} hierarchies */
1867 if (token.type == '{') {
1869 warningf(HERE, "extra curly braces around scalar initializer");
1873 } while (token.type == '{');
1876 expression_t *expression = parse_assignment_expression();
1877 mark_vars_read(expression, NULL);
1878 if (must_be_constant && !is_initializer_constant(expression)) {
1879 errorf(&expression->base.source_position,
1880 "initialisation expression '%E' is not constant",
1884 initializer_t *initializer = initializer_from_expression(type, expression);
1886 if (initializer == NULL) {
1887 errorf(&expression->base.source_position,
1888 "expression '%E' (type '%T') doesn't match expected type '%T'",
1889 expression, expression->base.type, type);
1894 bool additional_warning_displayed = false;
1895 while (braces > 0) {
1896 if (token.type == ',') {
1899 if (token.type != '}') {
1900 if (!additional_warning_displayed && warning.other) {
1901 warningf(HERE, "additional elements in scalar initializer");
1902 additional_warning_displayed = true;
1913 * An entry in the type path.
1915 typedef struct type_path_entry_t type_path_entry_t;
1916 struct type_path_entry_t {
1917 type_t *type; /**< the upper top type. restored to path->top_tye if this entry is popped. */
1919 size_t index; /**< For array types: the current index. */
1920 declaration_t *compound_entry; /**< For compound types: the current declaration. */
1925 * A type path expression a position inside compound or array types.
1927 typedef struct type_path_t type_path_t;
1928 struct type_path_t {
1929 type_path_entry_t *path; /**< An flexible array containing the current path. */
1930 type_t *top_type; /**< type of the element the path points */
1931 size_t max_index; /**< largest index in outermost array */
1935 * Prints a type path for debugging.
1937 static __attribute__((unused)) void debug_print_type_path(
1938 const type_path_t *path)
1940 size_t len = ARR_LEN(path->path);
1942 for (size_t i = 0; i < len; ++i) {
1943 const type_path_entry_t *entry = & path->path[i];
1945 type_t *type = skip_typeref(entry->type);
1946 if (is_type_compound(type)) {
1947 /* in gcc mode structs can have no members */
1948 if (entry->v.compound_entry == NULL) {
1952 fprintf(stderr, ".%s",
1953 entry->v.compound_entry->base.symbol->string);
1954 } else if (is_type_array(type)) {
1955 fprintf(stderr, "[%u]", (unsigned) entry->v.index);
1957 fprintf(stderr, "-INVALID-");
1960 if (path->top_type != NULL) {
1961 fprintf(stderr, " (");
1962 print_type(path->top_type);
1963 fprintf(stderr, ")");
1968 * Return the top type path entry, ie. in a path
1969 * (type).a.b returns the b.
1971 static type_path_entry_t *get_type_path_top(const type_path_t *path)
1973 size_t len = ARR_LEN(path->path);
1975 return &path->path[len-1];
1979 * Enlarge the type path by an (empty) element.
1981 static type_path_entry_t *append_to_type_path(type_path_t *path)
1983 size_t len = ARR_LEN(path->path);
1984 ARR_RESIZE(type_path_entry_t, path->path, len+1);
1986 type_path_entry_t *result = & path->path[len];
1987 memset(result, 0, sizeof(result[0]));
1992 * Descending into a sub-type. Enter the scope of the current top_type.
1994 static void descend_into_subtype(type_path_t *path)
1996 type_t *orig_top_type = path->top_type;
1997 type_t *top_type = skip_typeref(orig_top_type);
1999 type_path_entry_t *top = append_to_type_path(path);
2000 top->type = top_type;
2002 if (is_type_compound(top_type)) {
2003 compound_t *compound = top_type->compound.compound;
2004 entity_t *entry = compound->members.entities;
2006 if (entry != NULL) {
2007 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
2008 top->v.compound_entry = &entry->declaration;
2009 path->top_type = entry->declaration.type;
2011 path->top_type = NULL;
2013 } else if (is_type_array(top_type)) {
2015 path->top_type = top_type->array.element_type;
2017 assert(!is_type_valid(top_type));
2022 * Pop an entry from the given type path, ie. returning from
2023 * (type).a.b to (type).a
2025 static void ascend_from_subtype(type_path_t *path)
2027 type_path_entry_t *top = get_type_path_top(path);
2029 path->top_type = top->type;
2031 size_t len = ARR_LEN(path->path);
2032 ARR_RESIZE(type_path_entry_t, path->path, len-1);
2036 * Pop entries from the given type path until the given
2037 * path level is reached.
2039 static void ascend_to(type_path_t *path, size_t top_path_level)
2041 size_t len = ARR_LEN(path->path);
2043 while (len > top_path_level) {
2044 ascend_from_subtype(path);
2045 len = ARR_LEN(path->path);
2049 static bool walk_designator(type_path_t *path, const designator_t *designator,
2050 bool used_in_offsetof)
2052 for (; designator != NULL; designator = designator->next) {
2053 type_path_entry_t *top = get_type_path_top(path);
2054 type_t *orig_type = top->type;
2056 type_t *type = skip_typeref(orig_type);
2058 if (designator->symbol != NULL) {
2059 symbol_t *symbol = designator->symbol;
2060 if (!is_type_compound(type)) {
2061 if (is_type_valid(type)) {
2062 errorf(&designator->source_position,
2063 "'.%Y' designator used for non-compound type '%T'",
2067 top->type = type_error_type;
2068 top->v.compound_entry = NULL;
2069 orig_type = type_error_type;
2071 compound_t *compound = type->compound.compound;
2072 entity_t *iter = compound->members.entities;
2073 for (; iter != NULL; iter = iter->base.next) {
2074 if (iter->base.symbol == symbol) {
2079 errorf(&designator->source_position,
2080 "'%T' has no member named '%Y'", orig_type, symbol);
2083 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
2084 if (used_in_offsetof) {
2085 type_t *real_type = skip_typeref(iter->declaration.type);
2086 if (real_type->kind == TYPE_BITFIELD) {
2087 errorf(&designator->source_position,
2088 "offsetof designator '%Y' may not specify bitfield",
2094 top->type = orig_type;
2095 top->v.compound_entry = &iter->declaration;
2096 orig_type = iter->declaration.type;
2099 expression_t *array_index = designator->array_index;
2100 assert(designator->array_index != NULL);
2102 if (!is_type_array(type)) {
2103 if (is_type_valid(type)) {
2104 errorf(&designator->source_position,
2105 "[%E] designator used for non-array type '%T'",
2106 array_index, orig_type);
2111 long index = fold_constant_to_int(array_index);
2112 if (!used_in_offsetof) {
2114 errorf(&designator->source_position,
2115 "array index [%E] must be positive", array_index);
2116 } else if (type->array.size_constant) {
2117 long array_size = type->array.size;
2118 if (index >= array_size) {
2119 errorf(&designator->source_position,
2120 "designator [%E] (%d) exceeds array size %d",
2121 array_index, index, array_size);
2126 top->type = orig_type;
2127 top->v.index = (size_t) index;
2128 orig_type = type->array.element_type;
2130 path->top_type = orig_type;
2132 if (designator->next != NULL) {
2133 descend_into_subtype(path);
2142 static void advance_current_object(type_path_t *path, size_t top_path_level)
2144 type_path_entry_t *top = get_type_path_top(path);
2146 type_t *type = skip_typeref(top->type);
2147 if (is_type_union(type)) {
2148 /* in unions only the first element is initialized */
2149 top->v.compound_entry = NULL;
2150 } else if (is_type_struct(type)) {
2151 declaration_t *entry = top->v.compound_entry;
2153 entity_t *next_entity = entry->base.next;
2154 if (next_entity != NULL) {
2155 assert(is_declaration(next_entity));
2156 entry = &next_entity->declaration;
2161 top->v.compound_entry = entry;
2162 if (entry != NULL) {
2163 path->top_type = entry->type;
2166 } else if (is_type_array(type)) {
2167 assert(is_type_array(type));
2171 if (!type->array.size_constant || top->v.index < type->array.size) {
2175 assert(!is_type_valid(type));
2179 /* we're past the last member of the current sub-aggregate, try if we
2180 * can ascend in the type hierarchy and continue with another subobject */
2181 size_t len = ARR_LEN(path->path);
2183 if (len > top_path_level) {
2184 ascend_from_subtype(path);
2185 advance_current_object(path, top_path_level);
2187 path->top_type = NULL;
2192 * skip any {...} blocks until a closing bracket is reached.
2194 static void skip_initializers(void)
2196 if (token.type == '{')
2199 while (token.type != '}') {
2200 if (token.type == T_EOF)
2202 if (token.type == '{') {
2210 static initializer_t *create_empty_initializer(void)
2212 static initializer_t empty_initializer
2213 = { .list = { { INITIALIZER_LIST }, 0 } };
2214 return &empty_initializer;
2218 * Parse a part of an initialiser for a struct or union,
2220 static initializer_t *parse_sub_initializer(type_path_t *path,
2221 type_t *outer_type, size_t top_path_level,
2222 parse_initializer_env_t *env)
2224 if (token.type == '}') {
2225 /* empty initializer */
2226 return create_empty_initializer();
2229 type_t *orig_type = path->top_type;
2230 type_t *type = NULL;
2232 if (orig_type == NULL) {
2233 /* We are initializing an empty compound. */
2235 type = skip_typeref(orig_type);
2238 initializer_t **initializers = NEW_ARR_F(initializer_t*, 0);
2241 designator_t *designator = NULL;
2242 if (token.type == '.' || token.type == '[') {
2243 designator = parse_designation();
2244 goto finish_designator;
2245 } else if (token.type == T_IDENTIFIER && look_ahead(1)->type == ':') {
2246 /* GNU-style designator ("identifier: value") */
2247 designator = allocate_ast_zero(sizeof(designator[0]));
2248 designator->source_position = token.source_position;
2249 designator->symbol = token.v.symbol;
2254 /* reset path to toplevel, evaluate designator from there */
2255 ascend_to(path, top_path_level);
2256 if (!walk_designator(path, designator, false)) {
2257 /* can't continue after designation error */
2261 initializer_t *designator_initializer
2262 = allocate_initializer_zero(INITIALIZER_DESIGNATOR);
2263 designator_initializer->designator.designator = designator;
2264 ARR_APP1(initializer_t*, initializers, designator_initializer);
2266 orig_type = path->top_type;
2267 type = orig_type != NULL ? skip_typeref(orig_type) : NULL;
2272 if (token.type == '{') {
2273 if (type != NULL && is_type_scalar(type)) {
2274 sub = parse_scalar_initializer(type, env->must_be_constant);
2278 if (env->entity != NULL) {
2280 "extra brace group at end of initializer for '%Y'",
2281 env->entity->base.symbol);
2283 errorf(HERE, "extra brace group at end of initializer");
2286 descend_into_subtype(path);
2288 add_anchor_token('}');
2289 sub = parse_sub_initializer(path, orig_type, top_path_level+1,
2291 rem_anchor_token('}');
2294 ascend_from_subtype(path);
2295 expect('}', end_error);
2297 expect('}', end_error);
2298 goto error_parse_next;
2302 /* must be an expression */
2303 expression_t *expression = parse_assignment_expression();
2304 mark_vars_read(expression, NULL);
2306 if (env->must_be_constant && !is_initializer_constant(expression)) {
2307 errorf(&expression->base.source_position,
2308 "Initialisation expression '%E' is not constant",
2313 /* we are already outside, ... */
2314 type_t *const outer_type_skip = skip_typeref(outer_type);
2315 if (is_type_compound(outer_type_skip) &&
2316 !outer_type_skip->compound.compound->complete) {
2317 goto error_parse_next;
2322 /* handle { "string" } special case */
2323 if ((expression->kind == EXPR_STRING_LITERAL
2324 || expression->kind == EXPR_WIDE_STRING_LITERAL)
2325 && outer_type != NULL) {
2326 sub = initializer_from_expression(outer_type, expression);
2328 if (token.type == ',') {
2331 if (token.type != '}' && warning.other) {
2332 warningf(HERE, "excessive elements in initializer for type '%T'",
2335 /* TODO: eat , ... */
2340 /* descend into subtypes until expression matches type */
2342 orig_type = path->top_type;
2343 type = skip_typeref(orig_type);
2345 sub = initializer_from_expression(orig_type, expression);
2349 if (!is_type_valid(type)) {
2352 if (is_type_scalar(type)) {
2353 errorf(&expression->base.source_position,
2354 "expression '%E' doesn't match expected type '%T'",
2355 expression, orig_type);
2359 descend_into_subtype(path);
2363 /* update largest index of top array */
2364 const type_path_entry_t *first = &path->path[0];
2365 type_t *first_type = first->type;
2366 first_type = skip_typeref(first_type);
2367 if (is_type_array(first_type)) {
2368 size_t index = first->v.index;
2369 if (index > path->max_index)
2370 path->max_index = index;
2374 /* append to initializers list */
2375 ARR_APP1(initializer_t*, initializers, sub);
2378 if (warning.other) {
2379 if (env->entity != NULL) {
2380 warningf(HERE, "excess elements in initializer for '%Y'",
2381 env->entity->base.symbol);
2383 warningf(HERE, "excess elements in initializer");
2389 if (token.type == '}') {
2392 expect(',', end_error);
2393 if (token.type == '}') {
2398 /* advance to the next declaration if we are not at the end */
2399 advance_current_object(path, top_path_level);
2400 orig_type = path->top_type;
2401 if (orig_type != NULL)
2402 type = skip_typeref(orig_type);
2408 size_t len = ARR_LEN(initializers);
2409 size_t size = sizeof(initializer_list_t) + len * sizeof(initializers[0]);
2410 initializer_t *result = allocate_ast_zero(size);
2411 result->kind = INITIALIZER_LIST;
2412 result->list.len = len;
2413 memcpy(&result->list.initializers, initializers,
2414 len * sizeof(initializers[0]));
2416 DEL_ARR_F(initializers);
2417 ascend_to(path, top_path_level+1);
2422 skip_initializers();
2423 DEL_ARR_F(initializers);
2424 ascend_to(path, top_path_level+1);
2429 * Parses an initializer. Parsers either a compound literal
2430 * (env->declaration == NULL) or an initializer of a declaration.
2432 static initializer_t *parse_initializer(parse_initializer_env_t *env)
2434 type_t *type = skip_typeref(env->type);
2435 size_t max_index = 0xdeadbeaf; // TODO: Resolve this uninitialized variable problem
2436 initializer_t *result;
2438 if (is_type_scalar(type)) {
2439 result = parse_scalar_initializer(type, env->must_be_constant);
2440 } else if (token.type == '{') {
2444 memset(&path, 0, sizeof(path));
2445 path.top_type = env->type;
2446 path.path = NEW_ARR_F(type_path_entry_t, 0);
2448 descend_into_subtype(&path);
2450 add_anchor_token('}');
2451 result = parse_sub_initializer(&path, env->type, 1, env);
2452 rem_anchor_token('}');
2454 max_index = path.max_index;
2455 DEL_ARR_F(path.path);
2457 expect('}', end_error);
2459 /* parse_scalar_initializer() also works in this case: we simply
2460 * have an expression without {} around it */
2461 result = parse_scalar_initializer(type, env->must_be_constant);
2464 /* §6.7.8:22 array initializers for arrays with unknown size determine
2465 * the array type size */
2466 if (is_type_array(type) && type->array.size_expression == NULL
2467 && result != NULL) {
2469 switch (result->kind) {
2470 case INITIALIZER_LIST:
2471 assert(max_index != 0xdeadbeaf);
2472 size = max_index + 1;
2475 case INITIALIZER_STRING:
2476 size = result->string.string.size;
2479 case INITIALIZER_WIDE_STRING:
2480 size = result->wide_string.string.size;
2483 case INITIALIZER_DESIGNATOR:
2484 case INITIALIZER_VALUE:
2485 /* can happen for parse errors */
2490 internal_errorf(HERE, "invalid initializer type");
2493 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
2494 cnst->base.type = type_size_t;
2495 cnst->conste.v.int_value = size;
2497 type_t *new_type = duplicate_type(type);
2499 new_type->array.size_expression = cnst;
2500 new_type->array.size_constant = true;
2501 new_type->array.has_implicit_size = true;
2502 new_type->array.size = size;
2503 env->type = new_type;
2511 static void append_entity(scope_t *scope, entity_t *entity)
2513 if (scope->last_entity != NULL) {
2514 scope->last_entity->base.next = entity;
2516 scope->entities = entity;
2518 scope->last_entity = entity;
2522 static compound_t *parse_compound_type_specifier(bool is_struct)
2524 eat(is_struct ? T_struct : T_union);
2526 symbol_t *symbol = NULL;
2527 compound_t *compound = NULL;
2528 attribute_t *attributes = NULL;
2530 if (token.type == T___attribute__) {
2531 attributes = parse_attributes(NULL);
2534 entity_kind_tag_t const kind = is_struct ? ENTITY_STRUCT : ENTITY_UNION;
2535 if (token.type == T_IDENTIFIER) {
2536 /* the compound has a name, check if we have seen it already */
2537 symbol = token.v.symbol;
2540 entity_t *entity = get_tag(symbol, kind);
2541 if (entity != NULL) {
2542 compound = &entity->compound;
2543 if (compound->base.parent_scope != current_scope &&
2544 (token.type == '{' || token.type == ';')) {
2545 /* we're in an inner scope and have a definition. Shadow
2546 * existing definition in outer scope */
2548 } else if (compound->complete && token.type == '{') {
2549 assert(symbol != NULL);
2550 errorf(HERE, "multiple definitions of '%s %Y' (previous definition %P)",
2551 is_struct ? "struct" : "union", symbol,
2552 &compound->base.source_position);
2553 /* clear members in the hope to avoid further errors */
2554 compound->members.entities = NULL;
2557 } else if (token.type != '{') {
2559 parse_error_expected("while parsing struct type specifier",
2560 T_IDENTIFIER, '{', NULL);
2562 parse_error_expected("while parsing union type specifier",
2563 T_IDENTIFIER, '{', NULL);
2569 if (compound == NULL) {
2570 entity_t *entity = allocate_entity_zero(kind);
2571 compound = &entity->compound;
2573 compound->alignment = 1;
2574 compound->base.namespc = NAMESPACE_TAG;
2575 compound->base.source_position = token.source_position;
2576 compound->base.symbol = symbol;
2577 compound->base.parent_scope = current_scope;
2578 if (symbol != NULL) {
2579 environment_push(entity);
2581 append_entity(current_scope, entity);
2584 if (token.type == '{') {
2585 parse_compound_type_entries(compound);
2587 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2588 if (symbol == NULL) {
2589 assert(anonymous_entity == NULL);
2590 anonymous_entity = (entity_t*)compound;
2594 if (attributes != NULL) {
2595 handle_entity_attributes(attributes, (entity_t*) compound);
2601 static void parse_enum_entries(type_t *const enum_type)
2605 if (token.type == '}') {
2606 errorf(HERE, "empty enum not allowed");
2611 add_anchor_token('}');
2613 if (token.type != T_IDENTIFIER) {
2614 parse_error_expected("while parsing enum entry", T_IDENTIFIER, NULL);
2616 rem_anchor_token('}');
2620 entity_t *entity = allocate_entity_zero(ENTITY_ENUM_VALUE);
2621 entity->enum_value.enum_type = enum_type;
2622 entity->base.symbol = token.v.symbol;
2623 entity->base.source_position = token.source_position;
2626 if (token.type == '=') {
2628 expression_t *value = parse_constant_expression();
2630 value = create_implicit_cast(value, enum_type);
2631 entity->enum_value.value = value;
2636 record_entity(entity, false);
2638 if (token.type != ',')
2641 } while (token.type != '}');
2642 rem_anchor_token('}');
2644 expect('}', end_error);
2650 static type_t *parse_enum_specifier(void)
2656 if (token.type == T_IDENTIFIER) {
2657 symbol = token.v.symbol;
2660 entity = get_tag(symbol, ENTITY_ENUM);
2661 if (entity != NULL) {
2662 if (entity->base.parent_scope != current_scope &&
2663 (token.type == '{' || token.type == ';')) {
2664 /* we're in an inner scope and have a definition. Shadow
2665 * existing definition in outer scope */
2667 } else if (entity->enume.complete && token.type == '{') {
2668 errorf(HERE, "multiple definitions of 'enum %Y' (previous definition %P)",
2669 symbol, &entity->base.source_position);
2672 } else if (token.type != '{') {
2673 parse_error_expected("while parsing enum type specifier",
2674 T_IDENTIFIER, '{', NULL);
2681 if (entity == NULL) {
2682 entity = allocate_entity_zero(ENTITY_ENUM);
2683 entity->base.namespc = NAMESPACE_TAG;
2684 entity->base.source_position = token.source_position;
2685 entity->base.symbol = symbol;
2686 entity->base.parent_scope = current_scope;
2689 type_t *const type = allocate_type_zero(TYPE_ENUM);
2690 type->enumt.enume = &entity->enume;
2691 type->enumt.akind = ATOMIC_TYPE_INT;
2693 if (token.type == '{') {
2694 if (symbol != NULL) {
2695 environment_push(entity);
2697 append_entity(current_scope, entity);
2698 entity->enume.complete = true;
2700 parse_enum_entries(type);
2701 parse_attributes(NULL);
2703 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2704 if (symbol == NULL) {
2705 assert(anonymous_entity == NULL);
2706 anonymous_entity = entity;
2708 } else if (!entity->enume.complete && !(c_mode & _GNUC)) {
2709 errorf(HERE, "'enum %Y' used before definition (incomplete enums are a GNU extension)",
2717 * if a symbol is a typedef to another type, return true
2719 static bool is_typedef_symbol(symbol_t *symbol)
2721 const entity_t *const entity = get_entity(symbol, NAMESPACE_NORMAL);
2722 return entity != NULL && entity->kind == ENTITY_TYPEDEF;
2725 static type_t *parse_typeof(void)
2731 expect('(', end_error);
2732 add_anchor_token(')');
2734 expression_t *expression = NULL;
2736 bool old_type_prop = in_type_prop;
2737 bool old_gcc_extension = in_gcc_extension;
2738 in_type_prop = true;
2740 while (token.type == T___extension__) {
2741 /* This can be a prefix to a typename or an expression. */
2743 in_gcc_extension = true;
2745 switch (token.type) {
2747 if (is_typedef_symbol(token.v.symbol)) {
2748 type = parse_typename();
2750 expression = parse_expression();
2751 type = revert_automatic_type_conversion(expression);
2756 type = parse_typename();
2760 expression = parse_expression();
2761 type = expression->base.type;
2764 in_type_prop = old_type_prop;
2765 in_gcc_extension = old_gcc_extension;
2767 rem_anchor_token(')');
2768 expect(')', end_error);
2770 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF);
2771 typeof_type->typeoft.expression = expression;
2772 typeof_type->typeoft.typeof_type = type;
2779 typedef enum specifiers_t {
2780 SPECIFIER_SIGNED = 1 << 0,
2781 SPECIFIER_UNSIGNED = 1 << 1,
2782 SPECIFIER_LONG = 1 << 2,
2783 SPECIFIER_INT = 1 << 3,
2784 SPECIFIER_DOUBLE = 1 << 4,
2785 SPECIFIER_CHAR = 1 << 5,
2786 SPECIFIER_WCHAR_T = 1 << 6,
2787 SPECIFIER_SHORT = 1 << 7,
2788 SPECIFIER_LONG_LONG = 1 << 8,
2789 SPECIFIER_FLOAT = 1 << 9,
2790 SPECIFIER_BOOL = 1 << 10,
2791 SPECIFIER_VOID = 1 << 11,
2792 SPECIFIER_INT8 = 1 << 12,
2793 SPECIFIER_INT16 = 1 << 13,
2794 SPECIFIER_INT32 = 1 << 14,
2795 SPECIFIER_INT64 = 1 << 15,
2796 SPECIFIER_INT128 = 1 << 16,
2797 SPECIFIER_COMPLEX = 1 << 17,
2798 SPECIFIER_IMAGINARY = 1 << 18,
2801 static type_t *create_builtin_type(symbol_t *const symbol,
2802 type_t *const real_type)
2804 type_t *type = allocate_type_zero(TYPE_BUILTIN);
2805 type->builtin.symbol = symbol;
2806 type->builtin.real_type = real_type;
2807 return identify_new_type(type);
2810 static type_t *get_typedef_type(symbol_t *symbol)
2812 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
2813 if (entity == NULL || entity->kind != ENTITY_TYPEDEF)
2816 type_t *type = allocate_type_zero(TYPE_TYPEDEF);
2817 type->typedeft.typedefe = &entity->typedefe;
2822 static attribute_t *parse_attribute_ms_property(attribute_t *attribute)
2824 expect('(', end_error);
2826 attribute_property_argument_t *property
2827 = allocate_ast_zero(sizeof(*property));
2830 if (token.type != T_IDENTIFIER) {
2831 parse_error_expected("while parsing property declspec",
2832 T_IDENTIFIER, NULL);
2837 symbol_t *symbol = token.v.symbol;
2839 if (strcmp(symbol->string, "put") == 0) {
2841 } else if (strcmp(symbol->string, "get") == 0) {
2844 errorf(HERE, "expected put or get in property declspec");
2847 expect('=', end_error);
2848 if (token.type != T_IDENTIFIER) {
2849 parse_error_expected("while parsing property declspec",
2850 T_IDENTIFIER, NULL);
2854 property->put_symbol = token.v.symbol;
2856 property->get_symbol = token.v.symbol;
2859 if (token.type == ')')
2861 expect(',', end_error);
2864 attribute->a.property = property;
2866 expect(')', end_error);
2872 static attribute_t *parse_microsoft_extended_decl_modifier_single(void)
2874 attribute_kind_t kind = ATTRIBUTE_UNKNOWN;
2875 if (token.type == T_restrict) {
2876 kind = ATTRIBUTE_MS_RESTRICT;
2878 } else if (token.type == T_IDENTIFIER) {
2879 const char *name = token.v.symbol->string;
2881 for (attribute_kind_t k = ATTRIBUTE_MS_FIRST; k <= ATTRIBUTE_MS_LAST;
2883 const char *attribute_name = get_attribute_name(k);
2884 if (attribute_name != NULL && strcmp(attribute_name, name) == 0) {
2890 if (kind == ATTRIBUTE_UNKNOWN && warning.attribute) {
2891 warningf(HERE, "unknown __declspec '%s' ignored", name);
2894 parse_error_expected("while parsing __declspec", T_IDENTIFIER, NULL);
2898 attribute_t *attribute = allocate_attribute_zero(kind);
2900 if (kind == ATTRIBUTE_MS_PROPERTY) {
2901 return parse_attribute_ms_property(attribute);
2904 /* parse arguments */
2905 if (token.type == '(') {
2907 attribute->a.arguments = parse_attribute_arguments();
2913 static attribute_t *parse_microsoft_extended_decl_modifier(attribute_t *first)
2917 expect('(', end_error);
2919 if (token.type == ')') {
2924 add_anchor_token(')');
2926 attribute_t *last = first;
2929 while (last->next != NULL)
2933 attribute_t *attribute
2934 = parse_microsoft_extended_decl_modifier_single();
2935 if (attribute == NULL)
2941 last->next = attribute;
2945 if (token.type == ')') {
2948 expect(',', end_error);
2951 rem_anchor_token(')');
2952 expect(')', end_error);
2956 rem_anchor_token(')');
2960 static entity_t *create_error_entity(symbol_t *symbol, entity_kind_tag_t kind)
2962 entity_t *entity = allocate_entity_zero(kind);
2963 entity->base.source_position = *HERE;
2964 entity->base.symbol = symbol;
2965 if (is_declaration(entity)) {
2966 entity->declaration.type = type_error_type;
2967 entity->declaration.implicit = true;
2968 } else if (kind == ENTITY_TYPEDEF) {
2969 entity->typedefe.type = type_error_type;
2970 entity->typedefe.builtin = true;
2972 if (kind != ENTITY_COMPOUND_MEMBER)
2973 record_entity(entity, false);
2977 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
2979 type_t *type = NULL;
2980 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
2981 unsigned type_specifiers = 0;
2982 bool newtype = false;
2983 bool saw_error = false;
2984 bool old_gcc_extension = in_gcc_extension;
2986 specifiers->source_position = token.source_position;
2989 specifiers->attributes = parse_attributes(specifiers->attributes);
2991 switch (token.type) {
2993 #define MATCH_STORAGE_CLASS(token, class) \
2995 if (specifiers->storage_class != STORAGE_CLASS_NONE) { \
2996 errorf(HERE, "multiple storage classes in declaration specifiers"); \
2998 specifiers->storage_class = class; \
2999 if (specifiers->thread_local) \
3000 goto check_thread_storage_class; \
3004 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
3005 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
3006 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
3007 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
3008 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
3011 specifiers->attributes
3012 = parse_microsoft_extended_decl_modifier(specifiers->attributes);
3016 if (specifiers->thread_local) {
3017 errorf(HERE, "duplicate '__thread'");
3019 specifiers->thread_local = true;
3020 check_thread_storage_class:
3021 switch (specifiers->storage_class) {
3022 case STORAGE_CLASS_EXTERN:
3023 case STORAGE_CLASS_NONE:
3024 case STORAGE_CLASS_STATIC:
3028 case STORAGE_CLASS_AUTO: wrong = "auto"; goto wrong_thread_stoarge_class;
3029 case STORAGE_CLASS_REGISTER: wrong = "register"; goto wrong_thread_stoarge_class;
3030 case STORAGE_CLASS_TYPEDEF: wrong = "typedef"; goto wrong_thread_stoarge_class;
3031 wrong_thread_stoarge_class:
3032 errorf(HERE, "'__thread' used with '%s'", wrong);
3039 /* type qualifiers */
3040 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
3042 qualifiers |= qualifier; \
3046 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3047 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3048 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3049 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3050 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3051 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3052 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3053 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3055 case T___extension__:
3057 in_gcc_extension = true;
3060 /* type specifiers */
3061 #define MATCH_SPECIFIER(token, specifier, name) \
3063 if (type_specifiers & specifier) { \
3064 errorf(HERE, "multiple " name " type specifiers given"); \
3066 type_specifiers |= specifier; \
3071 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
3072 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
3073 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
3074 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
3075 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
3076 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
3077 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
3078 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
3079 MATCH_SPECIFIER(T_bool, SPECIFIER_BOOL, "bool");
3080 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
3081 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
3082 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
3083 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
3084 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
3085 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
3086 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
3087 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
3088 MATCH_SPECIFIER(T_wchar_t, SPECIFIER_WCHAR_T, "wchar_t");
3092 specifiers->is_inline = true;
3096 case T__forceinline:
3098 specifiers->modifiers |= DM_FORCEINLINE;
3103 if (type_specifiers & SPECIFIER_LONG_LONG) {
3104 errorf(HERE, "multiple type specifiers given");
3105 } else if (type_specifiers & SPECIFIER_LONG) {
3106 type_specifiers |= SPECIFIER_LONG_LONG;
3108 type_specifiers |= SPECIFIER_LONG;
3113 #define CHECK_DOUBLE_TYPE() \
3114 if ( type != NULL) \
3115 errorf(HERE, "multiple data types in declaration specifiers");
3118 CHECK_DOUBLE_TYPE();
3119 type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
3121 type->compound.compound = parse_compound_type_specifier(true);
3124 CHECK_DOUBLE_TYPE();
3125 type = allocate_type_zero(TYPE_COMPOUND_UNION);
3126 type->compound.compound = parse_compound_type_specifier(false);
3129 CHECK_DOUBLE_TYPE();
3130 type = parse_enum_specifier();
3133 CHECK_DOUBLE_TYPE();
3134 type = parse_typeof();
3136 case T___builtin_va_list:
3137 CHECK_DOUBLE_TYPE();
3138 type = duplicate_type(type_valist);
3142 case T_IDENTIFIER: {
3143 /* only parse identifier if we haven't found a type yet */
3144 if (type != NULL || type_specifiers != 0) {
3145 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
3146 * declaration, so it doesn't generate errors about expecting '(' or
3148 switch (look_ahead(1)->type) {
3155 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
3159 errorf(HERE, "discarding stray %K in declaration specifier", &token);
3164 goto finish_specifiers;
3168 type_t *const typedef_type = get_typedef_type(token.v.symbol);
3169 if (typedef_type == NULL) {
3170 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
3171 * declaration, so it doesn't generate 'implicit int' followed by more
3172 * errors later on. */
3173 token_type_t const la1_type = (token_type_t)look_ahead(1)->type;
3179 errorf(HERE, "%K does not name a type", &token);
3182 create_error_entity(token.v.symbol, ENTITY_TYPEDEF);
3184 type = allocate_type_zero(TYPE_TYPEDEF);
3185 type->typedeft.typedefe = &entity->typedefe;
3189 if (la1_type == '&' || la1_type == '*')
3190 goto finish_specifiers;
3195 goto finish_specifiers;
3200 type = typedef_type;
3204 /* function specifier */
3206 goto finish_specifiers;
3211 specifiers->attributes = parse_attributes(specifiers->attributes);
3213 in_gcc_extension = old_gcc_extension;
3215 if (type == NULL || (saw_error && type_specifiers != 0)) {
3216 atomic_type_kind_t atomic_type;
3218 /* match valid basic types */
3219 switch (type_specifiers) {
3220 case SPECIFIER_VOID:
3221 atomic_type = ATOMIC_TYPE_VOID;
3223 case SPECIFIER_WCHAR_T:
3224 atomic_type = ATOMIC_TYPE_WCHAR_T;
3226 case SPECIFIER_CHAR:
3227 atomic_type = ATOMIC_TYPE_CHAR;
3229 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
3230 atomic_type = ATOMIC_TYPE_SCHAR;
3232 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
3233 atomic_type = ATOMIC_TYPE_UCHAR;
3235 case SPECIFIER_SHORT:
3236 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
3237 case SPECIFIER_SHORT | SPECIFIER_INT:
3238 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3239 atomic_type = ATOMIC_TYPE_SHORT;
3241 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
3242 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3243 atomic_type = ATOMIC_TYPE_USHORT;
3246 case SPECIFIER_SIGNED:
3247 case SPECIFIER_SIGNED | SPECIFIER_INT:
3248 atomic_type = ATOMIC_TYPE_INT;
3250 case SPECIFIER_UNSIGNED:
3251 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
3252 atomic_type = ATOMIC_TYPE_UINT;
3254 case SPECIFIER_LONG:
3255 case SPECIFIER_SIGNED | SPECIFIER_LONG:
3256 case SPECIFIER_LONG | SPECIFIER_INT:
3257 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3258 atomic_type = ATOMIC_TYPE_LONG;
3260 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
3261 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3262 atomic_type = ATOMIC_TYPE_ULONG;
3265 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3266 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3267 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
3268 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3270 atomic_type = ATOMIC_TYPE_LONGLONG;
3271 goto warn_about_long_long;
3273 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3274 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3276 atomic_type = ATOMIC_TYPE_ULONGLONG;
3277 warn_about_long_long:
3278 if (warning.long_long) {
3279 warningf(&specifiers->source_position,
3280 "ISO C90 does not support 'long long'");
3284 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
3285 atomic_type = unsigned_int8_type_kind;
3288 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
3289 atomic_type = unsigned_int16_type_kind;
3292 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
3293 atomic_type = unsigned_int32_type_kind;
3296 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
3297 atomic_type = unsigned_int64_type_kind;
3300 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
3301 atomic_type = unsigned_int128_type_kind;
3304 case SPECIFIER_INT8:
3305 case SPECIFIER_SIGNED | SPECIFIER_INT8:
3306 atomic_type = int8_type_kind;
3309 case SPECIFIER_INT16:
3310 case SPECIFIER_SIGNED | SPECIFIER_INT16:
3311 atomic_type = int16_type_kind;
3314 case SPECIFIER_INT32:
3315 case SPECIFIER_SIGNED | SPECIFIER_INT32:
3316 atomic_type = int32_type_kind;
3319 case SPECIFIER_INT64:
3320 case SPECIFIER_SIGNED | SPECIFIER_INT64:
3321 atomic_type = int64_type_kind;
3324 case SPECIFIER_INT128:
3325 case SPECIFIER_SIGNED | SPECIFIER_INT128:
3326 atomic_type = int128_type_kind;
3329 case SPECIFIER_FLOAT:
3330 atomic_type = ATOMIC_TYPE_FLOAT;
3332 case SPECIFIER_DOUBLE:
3333 atomic_type = ATOMIC_TYPE_DOUBLE;
3335 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
3336 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3338 case SPECIFIER_BOOL:
3339 atomic_type = ATOMIC_TYPE_BOOL;
3341 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
3342 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
3343 atomic_type = ATOMIC_TYPE_FLOAT;
3345 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3346 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3347 atomic_type = ATOMIC_TYPE_DOUBLE;
3349 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3350 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3351 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3354 /* invalid specifier combination, give an error message */
3355 if (type_specifiers == 0) {
3359 /* ISO/IEC 14882:1998(E) §C.1.5:4 */
3360 if (!(c_mode & _CXX) && !strict_mode) {
3361 if (warning.implicit_int) {
3362 warningf(HERE, "no type specifiers in declaration, using 'int'");
3364 atomic_type = ATOMIC_TYPE_INT;
3367 errorf(HERE, "no type specifiers given in declaration");
3369 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
3370 (type_specifiers & SPECIFIER_UNSIGNED)) {
3371 errorf(HERE, "signed and unsigned specifiers given");
3372 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3373 errorf(HERE, "only integer types can be signed or unsigned");
3375 errorf(HERE, "multiple datatypes in declaration");
3380 if (type_specifiers & SPECIFIER_COMPLEX) {
3381 type = allocate_type_zero(TYPE_COMPLEX);
3382 type->complex.akind = atomic_type;
3383 } else if (type_specifiers & SPECIFIER_IMAGINARY) {
3384 type = allocate_type_zero(TYPE_IMAGINARY);
3385 type->imaginary.akind = atomic_type;
3387 type = allocate_type_zero(TYPE_ATOMIC);
3388 type->atomic.akind = atomic_type;
3391 } else if (type_specifiers != 0) {
3392 errorf(HERE, "multiple datatypes in declaration");
3395 /* FIXME: check type qualifiers here */
3396 type->base.qualifiers = qualifiers;
3399 type = identify_new_type(type);
3401 type = typehash_insert(type);
3404 if (specifiers->attributes != NULL)
3405 type = handle_type_attributes(specifiers->attributes, type);
3406 specifiers->type = type;
3410 specifiers->type = type_error_type;
3414 static type_qualifiers_t parse_type_qualifiers(void)
3416 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3419 switch (token.type) {
3420 /* type qualifiers */
3421 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3422 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3423 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3424 /* microsoft extended type modifiers */
3425 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3426 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3427 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3428 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3429 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3438 * Parses an K&R identifier list
3440 static void parse_identifier_list(scope_t *scope)
3443 entity_t *entity = allocate_entity_zero(ENTITY_PARAMETER);
3444 entity->base.source_position = token.source_position;
3445 entity->base.namespc = NAMESPACE_NORMAL;
3446 entity->base.symbol = token.v.symbol;
3447 /* a K&R parameter has no type, yet */
3451 append_entity(scope, entity);
3453 if (token.type != ',') {
3457 } while (token.type == T_IDENTIFIER);
3460 static entity_t *parse_parameter(void)
3462 declaration_specifiers_t specifiers;
3463 memset(&specifiers, 0, sizeof(specifiers));
3465 parse_declaration_specifiers(&specifiers);
3467 entity_t *entity = parse_declarator(&specifiers,
3468 DECL_MAY_BE_ABSTRACT | DECL_IS_PARAMETER);
3469 anonymous_entity = NULL;
3473 static void semantic_parameter_incomplete(const entity_t *entity)
3475 assert(entity->kind == ENTITY_PARAMETER);
3477 /* §6.7.5.3:4 After adjustment, the parameters in a parameter type
3478 * list in a function declarator that is part of a
3479 * definition of that function shall not have
3480 * incomplete type. */
3481 type_t *type = skip_typeref(entity->declaration.type);
3482 if (is_type_incomplete(type)) {
3483 errorf(&entity->base.source_position,
3484 "parameter '%#T' has incomplete type",
3485 entity->declaration.type, entity->base.symbol);
3489 static bool has_parameters(void)
3491 /* func(void) is not a parameter */
3492 if (token.type == T_IDENTIFIER) {
3493 entity_t const *const entity = get_entity(token.v.symbol, NAMESPACE_NORMAL);
3496 if (entity->kind != ENTITY_TYPEDEF)
3498 if (skip_typeref(entity->typedefe.type) != type_void)
3500 } else if (token.type != T_void) {
3503 if (look_ahead(1)->type != ')')
3510 * Parses function type parameters (and optionally creates variable_t entities
3511 * for them in a scope)
3513 static void parse_parameters(function_type_t *type, scope_t *scope)
3516 add_anchor_token(')');
3517 int saved_comma_state = save_and_reset_anchor_state(',');
3519 if (token.type == T_IDENTIFIER &&
3520 !is_typedef_symbol(token.v.symbol)) {
3521 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
3522 if (la1_type == ',' || la1_type == ')') {
3523 type->kr_style_parameters = true;
3524 parse_identifier_list(scope);
3525 goto parameters_finished;
3529 if (token.type == ')') {
3530 /* ISO/IEC 14882:1998(E) §C.1.6:1 */
3531 if (!(c_mode & _CXX))
3532 type->unspecified_parameters = true;
3533 goto parameters_finished;
3536 if (has_parameters()) {
3537 function_parameter_t **anchor = &type->parameters;
3539 switch (token.type) {
3542 type->variadic = true;
3543 goto parameters_finished;
3546 case T___extension__:
3549 entity_t *entity = parse_parameter();
3550 if (entity->kind == ENTITY_TYPEDEF) {
3551 errorf(&entity->base.source_position,
3552 "typedef not allowed as function parameter");
3555 assert(is_declaration(entity));
3557 semantic_parameter_incomplete(entity);
3559 function_parameter_t *const parameter =
3560 allocate_parameter(entity->declaration.type);
3562 if (scope != NULL) {
3563 append_entity(scope, entity);
3566 *anchor = parameter;
3567 anchor = ¶meter->next;
3572 goto parameters_finished;
3574 if (token.type != ',') {
3575 goto parameters_finished;
3582 parameters_finished:
3583 rem_anchor_token(')');
3584 expect(')', end_error);
3587 restore_anchor_state(',', saved_comma_state);
3590 typedef enum construct_type_kind_t {
3593 CONSTRUCT_REFERENCE,
3596 } construct_type_kind_t;
3598 typedef union construct_type_t construct_type_t;
3600 typedef struct construct_type_base_t {
3601 construct_type_kind_t kind;
3602 construct_type_t *next;
3603 } construct_type_base_t;
3605 typedef struct parsed_pointer_t {
3606 construct_type_base_t base;
3607 type_qualifiers_t type_qualifiers;
3608 variable_t *base_variable; /**< MS __based extension. */
3611 typedef struct parsed_reference_t {
3612 construct_type_base_t base;
3613 } parsed_reference_t;
3615 typedef struct construct_function_type_t {
3616 construct_type_base_t base;
3617 type_t *function_type;
3618 } construct_function_type_t;
3620 typedef struct parsed_array_t {
3621 construct_type_base_t base;
3622 type_qualifiers_t type_qualifiers;
3628 union construct_type_t {
3629 construct_type_kind_t kind;
3630 construct_type_base_t base;
3631 parsed_pointer_t pointer;
3632 parsed_reference_t reference;
3633 construct_function_type_t function;
3634 parsed_array_t array;
3637 static construct_type_t *parse_pointer_declarator(void)
3641 parsed_pointer_t *pointer = obstack_alloc(&temp_obst, sizeof(pointer[0]));
3642 memset(pointer, 0, sizeof(pointer[0]));
3643 pointer->base.kind = CONSTRUCT_POINTER;
3644 pointer->type_qualifiers = parse_type_qualifiers();
3645 //pointer->base_variable = base_variable;
3647 return (construct_type_t*) pointer;
3650 static construct_type_t *parse_reference_declarator(void)
3654 construct_type_t *cons = obstack_alloc(&temp_obst, sizeof(cons->reference));
3655 parsed_reference_t *reference = &cons->reference;
3656 memset(reference, 0, sizeof(*reference));
3657 cons->kind = CONSTRUCT_REFERENCE;
3662 static construct_type_t *parse_array_declarator(void)
3665 add_anchor_token(']');
3667 construct_type_t *cons = obstack_alloc(&temp_obst, sizeof(cons->array));
3668 parsed_array_t *array = &cons->array;
3669 memset(array, 0, sizeof(*array));
3670 cons->kind = CONSTRUCT_ARRAY;
3672 if (token.type == T_static) {
3673 array->is_static = true;
3677 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
3678 if (type_qualifiers != 0) {
3679 if (token.type == T_static) {
3680 array->is_static = true;
3684 array->type_qualifiers = type_qualifiers;
3686 if (token.type == '*' && look_ahead(1)->type == ']') {
3687 array->is_variable = true;
3689 } else if (token.type != ']') {
3690 expression_t *const size = parse_assignment_expression();
3692 /* §6.7.5.2:1 Array size must have integer type */
3693 type_t *const orig_type = size->base.type;
3694 type_t *const type = skip_typeref(orig_type);
3695 if (!is_type_integer(type) && is_type_valid(type)) {
3696 errorf(&size->base.source_position,
3697 "array size '%E' must have integer type but has type '%T'",
3702 mark_vars_read(size, NULL);
3705 rem_anchor_token(']');
3706 expect(']', end_error);
3712 static construct_type_t *parse_function_declarator(scope_t *scope)
3714 type_t *type = allocate_type_zero(TYPE_FUNCTION);
3715 function_type_t *ftype = &type->function;
3717 ftype->linkage = current_linkage;
3718 ftype->calling_convention = CC_DEFAULT;
3720 parse_parameters(ftype, scope);
3722 construct_type_t *cons = obstack_alloc(&temp_obst, sizeof(cons->function));
3723 construct_function_type_t *function = &cons->function;
3724 memset(function, 0, sizeof(*function));
3725 cons->kind = CONSTRUCT_FUNCTION;
3726 function->function_type = type;
3731 typedef struct parse_declarator_env_t {
3732 bool may_be_abstract : 1;
3733 bool must_be_abstract : 1;
3734 decl_modifiers_t modifiers;
3736 source_position_t source_position;
3738 attribute_t *attributes;
3739 } parse_declarator_env_t;
3741 static construct_type_t *parse_inner_declarator(parse_declarator_env_t *env)
3743 /* construct a single linked list of construct_type_t's which describe
3744 * how to construct the final declarator type */
3745 construct_type_t *first = NULL;
3746 construct_type_t **anchor = &first;
3748 env->attributes = parse_attributes(env->attributes);
3751 construct_type_t *type;
3752 //variable_t *based = NULL; /* MS __based extension */
3753 switch (token.type) {
3755 if (!(c_mode & _CXX))
3756 errorf(HERE, "references are only available for C++");
3757 type = parse_reference_declarator();
3762 source_position_t const pos = *HERE;
3764 expect('(', end_error);
3765 add_anchor_token(')');
3766 based = parse_microsoft_based();
3767 rem_anchor_token(')');
3768 expect(')', end_error);
3769 if (token.type != '*') {
3770 if (token.type == T__based) {
3771 errorf(&pos, "__based type modifier specified more than once");
3772 } else if (warning.other) {
3774 "__based does not precede a pointer declarator, ignored");
3779 panic("based currently disabled");
3785 type = parse_pointer_declarator();
3789 goto ptr_operator_end;
3793 anchor = &type->base.next;
3795 /* TODO: find out if this is correct */
3796 env->attributes = parse_attributes(env->attributes);
3801 modifiers |= env->modifiers;
3802 env->modifiers = modifiers;
3805 construct_type_t *inner_types = NULL;
3807 switch (token.type) {
3809 if (env->must_be_abstract) {
3810 errorf(HERE, "no identifier expected in typename");
3812 env->symbol = token.v.symbol;
3813 env->source_position = token.source_position;
3818 /* §6.7.6:2 footnote 126: Empty parentheses in a type name are
3819 * interpreted as ``function with no parameter specification'', rather
3820 * than redundant parentheses around the omitted identifier. */
3821 if (look_ahead(1)->type != ')') {
3823 add_anchor_token(')');
3824 inner_types = parse_inner_declarator(env);
3825 if (inner_types != NULL) {
3826 /* All later declarators only modify the return type */
3827 env->must_be_abstract = true;
3829 rem_anchor_token(')');
3830 expect(')', end_error);
3834 if (env->may_be_abstract)
3836 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
3841 construct_type_t **const p = anchor;
3844 construct_type_t *type;
3845 switch (token.type) {
3847 scope_t *scope = NULL;
3848 if (!env->must_be_abstract) {
3849 scope = &env->parameters;
3852 type = parse_function_declarator(scope);
3856 type = parse_array_declarator();
3859 goto declarator_finished;
3862 /* insert in the middle of the list (at p) */
3863 type->base.next = *p;
3866 anchor = &type->base.next;
3869 declarator_finished:
3870 /* append inner_types at the end of the list, we don't to set anchor anymore
3871 * as it's not needed anymore */
3872 *anchor = inner_types;
3879 static type_t *construct_declarator_type(construct_type_t *construct_list, type_t *type)
3881 construct_type_t *iter = construct_list;
3882 for (; iter != NULL; iter = iter->base.next) {
3883 switch (iter->kind) {
3884 case CONSTRUCT_INVALID:
3886 case CONSTRUCT_FUNCTION: {
3887 construct_function_type_t *function = &iter->function;
3888 type_t *function_type = function->function_type;
3890 function_type->function.return_type = type;
3892 type_t *skipped_return_type = skip_typeref(type);
3894 if (is_type_function(skipped_return_type)) {
3895 errorf(HERE, "function returning function is not allowed");
3896 } else if (is_type_array(skipped_return_type)) {
3897 errorf(HERE, "function returning array is not allowed");
3899 if (skipped_return_type->base.qualifiers != 0 && warning.other) {
3901 "type qualifiers in return type of function type are meaningless");
3905 /* The function type was constructed earlier. Freeing it here will
3906 * destroy other types. */
3907 type = typehash_insert(function_type);
3911 case CONSTRUCT_POINTER: {
3912 if (is_type_reference(skip_typeref(type)))
3913 errorf(HERE, "cannot declare a pointer to reference");
3915 parsed_pointer_t *pointer = &iter->pointer;
3916 type = make_based_pointer_type(type, pointer->type_qualifiers, pointer->base_variable);
3920 case CONSTRUCT_REFERENCE:
3921 if (is_type_reference(skip_typeref(type)))
3922 errorf(HERE, "cannot declare a reference to reference");
3924 type = make_reference_type(type);
3927 case CONSTRUCT_ARRAY: {
3928 if (is_type_reference(skip_typeref(type)))
3929 errorf(HERE, "cannot declare an array of references");
3931 parsed_array_t *array = &iter->array;
3932 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
3934 expression_t *size_expression = array->size;
3935 if (size_expression != NULL) {
3937 = create_implicit_cast(size_expression, type_size_t);
3940 array_type->base.qualifiers = array->type_qualifiers;
3941 array_type->array.element_type = type;
3942 array_type->array.is_static = array->is_static;
3943 array_type->array.is_variable = array->is_variable;
3944 array_type->array.size_expression = size_expression;
3946 if (size_expression != NULL) {
3947 if (is_constant_expression(size_expression)) {
3949 = fold_constant_to_int(size_expression);
3950 array_type->array.size = size;
3951 array_type->array.size_constant = true;
3952 /* §6.7.5.2:1 If the expression is a constant expression, it shall
3953 * have a value greater than zero. */
3955 if (size < 0 || !GNU_MODE) {
3956 errorf(&size_expression->base.source_position,
3957 "size of array must be greater than zero");
3958 } else if (warning.other) {
3959 warningf(&size_expression->base.source_position,
3960 "zero length arrays are a GCC extension");
3964 array_type->array.is_vla = true;
3968 type_t *skipped_type = skip_typeref(type);
3970 if (is_type_incomplete(skipped_type)) {
3971 errorf(HERE, "array of incomplete type '%T' is not allowed", type);
3972 } else if (is_type_function(skipped_type)) {
3973 errorf(HERE, "array of functions is not allowed");
3975 type = identify_new_type(array_type);
3979 internal_errorf(HERE, "invalid type construction found");
3985 static type_t *automatic_type_conversion(type_t *orig_type);
3987 static type_t *semantic_parameter(const source_position_t *pos,
3989 const declaration_specifiers_t *specifiers,
3992 /* §6.7.5.3:7 A declaration of a parameter as ``array of type''
3993 * shall be adjusted to ``qualified pointer to type'',
3995 * §6.7.5.3:8 A declaration of a parameter as ``function returning
3996 * type'' shall be adjusted to ``pointer to function
3997 * returning type'', as in 6.3.2.1. */
3998 type = automatic_type_conversion(type);
4000 if (specifiers->is_inline && is_type_valid(type)) {
4001 errorf(pos, "parameter '%#T' declared 'inline'", type, symbol);
4004 /* §6.9.1:6 The declarations in the declaration list shall contain
4005 * no storage-class specifier other than register and no
4006 * initializations. */
4007 if (specifiers->thread_local || (
4008 specifiers->storage_class != STORAGE_CLASS_NONE &&
4009 specifiers->storage_class != STORAGE_CLASS_REGISTER)
4011 errorf(pos, "invalid storage class for parameter '%#T'", type, symbol);
4014 /* delay test for incomplete type, because we might have (void)
4015 * which is legal but incomplete... */
4020 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
4021 declarator_flags_t flags)
4023 parse_declarator_env_t env;
4024 memset(&env, 0, sizeof(env));
4025 env.may_be_abstract = (flags & DECL_MAY_BE_ABSTRACT) != 0;
4027 construct_type_t *construct_type = parse_inner_declarator(&env);
4029 construct_declarator_type(construct_type, specifiers->type);
4030 type_t *type = skip_typeref(orig_type);
4032 if (construct_type != NULL) {
4033 obstack_free(&temp_obst, construct_type);
4036 attribute_t *attributes = parse_attributes(env.attributes);
4037 /* append (shared) specifier attribute behind attributes of this
4039 if (attributes != NULL) {
4040 attribute_t *last = attributes;
4041 while (last->next != NULL)
4043 last->next = specifiers->attributes;
4045 attributes = specifiers->attributes;
4049 if (specifiers->storage_class == STORAGE_CLASS_TYPEDEF) {
4050 entity = allocate_entity_zero(ENTITY_TYPEDEF);
4051 entity->base.symbol = env.symbol;
4052 entity->base.source_position = env.source_position;
4053 entity->typedefe.type = orig_type;
4055 if (anonymous_entity != NULL) {
4056 if (is_type_compound(type)) {
4057 assert(anonymous_entity->compound.alias == NULL);
4058 assert(anonymous_entity->kind == ENTITY_STRUCT ||
4059 anonymous_entity->kind == ENTITY_UNION);
4060 anonymous_entity->compound.alias = entity;
4061 anonymous_entity = NULL;
4062 } else if (is_type_enum(type)) {
4063 assert(anonymous_entity->enume.alias == NULL);
4064 assert(anonymous_entity->kind == ENTITY_ENUM);
4065 anonymous_entity->enume.alias = entity;
4066 anonymous_entity = NULL;
4070 /* create a declaration type entity */
4071 if (flags & DECL_CREATE_COMPOUND_MEMBER) {
4072 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER);
4074 if (env.symbol != NULL) {
4075 if (specifiers->is_inline && is_type_valid(type)) {
4076 errorf(&env.source_position,
4077 "compound member '%Y' declared 'inline'", env.symbol);
4080 if (specifiers->thread_local ||
4081 specifiers->storage_class != STORAGE_CLASS_NONE) {
4082 errorf(&env.source_position,
4083 "compound member '%Y' must have no storage class",
4087 } else if (flags & DECL_IS_PARAMETER) {
4088 orig_type = semantic_parameter(&env.source_position, orig_type,
4089 specifiers, env.symbol);
4091 entity = allocate_entity_zero(ENTITY_PARAMETER);
4092 } else if (is_type_function(type)) {
4093 entity = allocate_entity_zero(ENTITY_FUNCTION);
4095 entity->function.is_inline = specifiers->is_inline;
4096 entity->function.parameters = env.parameters;
4098 if (env.symbol != NULL) {
4099 /* this needs fixes for C++ */
4100 bool in_function_scope = current_function != NULL;
4102 if (specifiers->thread_local || (
4103 specifiers->storage_class != STORAGE_CLASS_EXTERN &&
4104 specifiers->storage_class != STORAGE_CLASS_NONE &&
4105 (in_function_scope || specifiers->storage_class != STORAGE_CLASS_STATIC)
4107 errorf(&env.source_position,
4108 "invalid storage class for function '%Y'", env.symbol);
4112 entity = allocate_entity_zero(ENTITY_VARIABLE);
4114 entity->variable.thread_local = specifiers->thread_local;
4116 if (env.symbol != NULL) {
4117 if (specifiers->is_inline && is_type_valid(type)) {
4118 errorf(&env.source_position,
4119 "variable '%Y' declared 'inline'", env.symbol);
4122 bool invalid_storage_class = false;
4123 if (current_scope == file_scope) {
4124 if (specifiers->storage_class != STORAGE_CLASS_EXTERN &&
4125 specifiers->storage_class != STORAGE_CLASS_NONE &&
4126 specifiers->storage_class != STORAGE_CLASS_STATIC) {
4127 invalid_storage_class = true;
4130 if (specifiers->thread_local &&
4131 specifiers->storage_class == STORAGE_CLASS_NONE) {
4132 invalid_storage_class = true;
4135 if (invalid_storage_class) {
4136 errorf(&env.source_position,
4137 "invalid storage class for variable '%Y'", env.symbol);
4142 if (env.symbol != NULL) {
4143 entity->base.symbol = env.symbol;
4144 entity->base.source_position = env.source_position;
4146 entity->base.source_position = specifiers->source_position;
4148 entity->base.namespc = NAMESPACE_NORMAL;
4149 entity->declaration.type = orig_type;
4150 entity->declaration.alignment = get_type_alignment(orig_type);
4151 entity->declaration.modifiers = env.modifiers;
4152 entity->declaration.attributes = attributes;
4154 storage_class_t storage_class = specifiers->storage_class;
4155 entity->declaration.declared_storage_class = storage_class;
4157 if (storage_class == STORAGE_CLASS_NONE && current_function != NULL)
4158 storage_class = STORAGE_CLASS_AUTO;
4159 entity->declaration.storage_class = storage_class;
4162 if (attributes != NULL) {
4163 handle_entity_attributes(attributes, entity);
4169 static type_t *parse_abstract_declarator(type_t *base_type)
4171 parse_declarator_env_t env;
4172 memset(&env, 0, sizeof(env));
4173 env.may_be_abstract = true;
4174 env.must_be_abstract = true;
4176 construct_type_t *construct_type = parse_inner_declarator(&env);
4178 type_t *result = construct_declarator_type(construct_type, base_type);
4179 if (construct_type != NULL) {
4180 obstack_free(&temp_obst, construct_type);
4182 result = handle_type_attributes(env.attributes, result);
4188 * Check if the declaration of main is suspicious. main should be a
4189 * function with external linkage, returning int, taking either zero
4190 * arguments, two, or three arguments of appropriate types, ie.
4192 * int main([ int argc, char **argv [, char **env ] ]).
4194 * @param decl the declaration to check
4195 * @param type the function type of the declaration
4197 static void check_main(const entity_t *entity)
4199 const source_position_t *pos = &entity->base.source_position;
4200 if (entity->kind != ENTITY_FUNCTION) {
4201 warningf(pos, "'main' is not a function");
4205 if (entity->declaration.storage_class == STORAGE_CLASS_STATIC) {
4206 warningf(pos, "'main' is normally a non-static function");
4209 type_t *type = skip_typeref(entity->declaration.type);
4210 assert(is_type_function(type));
4212 function_type_t *func_type = &type->function;
4213 if (!types_compatible(skip_typeref(func_type->return_type), type_int)) {
4214 warningf(pos, "return type of 'main' should be 'int', but is '%T'",
4215 func_type->return_type);
4217 const function_parameter_t *parm = func_type->parameters;
4219 type_t *const first_type = parm->type;
4220 if (!types_compatible(skip_typeref(first_type), type_int)) {
4222 "first argument of 'main' should be 'int', but is '%T'",
4227 type_t *const second_type = parm->type;
4228 if (!types_compatible(skip_typeref(second_type), type_char_ptr_ptr)) {
4229 warningf(pos, "second argument of 'main' should be 'char**', but is '%T'", second_type);
4233 type_t *const third_type = parm->type;
4234 if (!types_compatible(skip_typeref(third_type), type_char_ptr_ptr)) {
4235 warningf(pos, "third argument of 'main' should be 'char**', but is '%T'", third_type);
4239 goto warn_arg_count;
4243 warningf(pos, "'main' takes only zero, two or three arguments");
4249 * Check if a symbol is the equal to "main".
4251 static bool is_sym_main(const symbol_t *const sym)
4253 return strcmp(sym->string, "main") == 0;
4256 static void error_redefined_as_different_kind(const source_position_t *pos,
4257 const entity_t *old, entity_kind_t new_kind)
4259 errorf(pos, "redeclaration of %s '%Y' as %s (declared %P)",
4260 get_entity_kind_name(old->kind), old->base.symbol,
4261 get_entity_kind_name(new_kind), &old->base.source_position);
4264 static bool is_error_entity(entity_t *const ent)
4266 if (is_declaration(ent)) {
4267 return is_type_valid(skip_typeref(ent->declaration.type));
4268 } else if (ent->kind == ENTITY_TYPEDEF) {
4269 return is_type_valid(skip_typeref(ent->typedefe.type));
4274 static bool contains_attribute(const attribute_t *list, const attribute_t *attr)
4276 for (const attribute_t *tattr = list; tattr != NULL; tattr = tattr->next) {
4277 if (attributes_equal(tattr, attr))
4284 * test wether new_list contains any attributes not included in old_list
4286 static bool has_new_attributes(const attribute_t *old_list,
4287 const attribute_t *new_list)
4289 for (const attribute_t *attr = new_list; attr != NULL; attr = attr->next) {
4290 if (!contains_attribute(old_list, attr))
4297 * Merge in attributes from an attribute list (probably from a previous
4298 * declaration with the same name). Warning: destroys the old structure
4299 * of the attribute list - don't reuse attributes after this call.
4301 static void merge_in_attributes(declaration_t *decl, attribute_t *attributes)
4304 for (attribute_t *attr = attributes; attr != NULL; attr = next) {
4306 if (contains_attribute(decl->attributes, attr))
4309 /* move attribute to new declarations attributes list */
4310 attr->next = decl->attributes;
4311 decl->attributes = attr;
4316 * record entities for the NAMESPACE_NORMAL, and produce error messages/warnings
4317 * for various problems that occur for multiple definitions
4319 static entity_t *record_entity(entity_t *entity, const bool is_definition)
4321 const symbol_t *const symbol = entity->base.symbol;
4322 const namespace_tag_t namespc = (namespace_tag_t)entity->base.namespc;
4323 const source_position_t *pos = &entity->base.source_position;
4325 /* can happen in error cases */
4329 entity_t *const previous_entity = get_entity(symbol, namespc);
4330 /* pushing the same entity twice will break the stack structure */
4331 assert(previous_entity != entity);
4333 if (entity->kind == ENTITY_FUNCTION) {
4334 type_t *const orig_type = entity->declaration.type;
4335 type_t *const type = skip_typeref(orig_type);
4337 assert(is_type_function(type));
4338 if (type->function.unspecified_parameters &&
4339 warning.strict_prototypes &&
4340 previous_entity == NULL) {
4341 warningf(pos, "function declaration '%#T' is not a prototype",
4345 if (warning.main && current_scope == file_scope
4346 && is_sym_main(symbol)) {
4351 if (is_declaration(entity) &&
4352 warning.nested_externs &&
4353 entity->declaration.storage_class == STORAGE_CLASS_EXTERN &&
4354 current_scope != file_scope) {
4355 warningf(pos, "nested extern declaration of '%#T'",
4356 entity->declaration.type, symbol);
4359 if (previous_entity != NULL) {
4360 if (previous_entity->base.parent_scope == ¤t_function->parameters &&
4361 previous_entity->base.parent_scope->depth + 1 == current_scope->depth) {
4362 assert(previous_entity->kind == ENTITY_PARAMETER);
4364 "declaration '%#T' redeclares the parameter '%#T' (declared %P)",
4365 entity->declaration.type, symbol,
4366 previous_entity->declaration.type, symbol,
4367 &previous_entity->base.source_position);
4371 if (previous_entity->base.parent_scope == current_scope) {
4372 if (previous_entity->kind != entity->kind) {
4373 if (!is_error_entity(previous_entity) && !is_error_entity(entity)) {
4374 error_redefined_as_different_kind(pos, previous_entity,
4379 if (previous_entity->kind == ENTITY_ENUM_VALUE) {
4380 errorf(pos, "redeclaration of enum entry '%Y' (declared %P)",
4381 symbol, &previous_entity->base.source_position);
4384 if (previous_entity->kind == ENTITY_TYPEDEF) {
4385 /* TODO: C++ allows this for exactly the same type */
4386 errorf(pos, "redefinition of typedef '%Y' (declared %P)",
4387 symbol, &previous_entity->base.source_position);
4391 /* at this point we should have only VARIABLES or FUNCTIONS */
4392 assert(is_declaration(previous_entity) && is_declaration(entity));
4394 declaration_t *const prev_decl = &previous_entity->declaration;
4395 declaration_t *const decl = &entity->declaration;
4397 /* can happen for K&R style declarations */
4398 if (prev_decl->type == NULL &&
4399 previous_entity->kind == ENTITY_PARAMETER &&
4400 entity->kind == ENTITY_PARAMETER) {
4401 prev_decl->type = decl->type;
4402 prev_decl->storage_class = decl->storage_class;
4403 prev_decl->declared_storage_class = decl->declared_storage_class;
4404 prev_decl->modifiers = decl->modifiers;
4405 return previous_entity;
4408 type_t *const orig_type = decl->type;
4409 assert(orig_type != NULL);
4410 type_t *const type = skip_typeref(orig_type);
4411 type_t *const prev_type = skip_typeref(prev_decl->type);
4413 if (!types_compatible(type, prev_type)) {
4415 "declaration '%#T' is incompatible with '%#T' (declared %P)",
4416 orig_type, symbol, prev_decl->type, symbol,
4417 &previous_entity->base.source_position);
4419 unsigned old_storage_class = prev_decl->storage_class;
4421 if (warning.redundant_decls &&
4424 !(prev_decl->modifiers & DM_USED) &&
4425 prev_decl->storage_class == STORAGE_CLASS_STATIC) {
4426 warningf(&previous_entity->base.source_position,
4427 "unnecessary static forward declaration for '%#T'",
4428 prev_decl->type, symbol);
4431 storage_class_t new_storage_class = decl->storage_class;
4433 /* pretend no storage class means extern for function
4434 * declarations (except if the previous declaration is neither
4435 * none nor extern) */
4436 if (entity->kind == ENTITY_FUNCTION) {
4437 /* the previous declaration could have unspecified parameters or
4438 * be a typedef, so use the new type */
4439 if (prev_type->function.unspecified_parameters || is_definition)
4440 prev_decl->type = type;
4442 switch (old_storage_class) {
4443 case STORAGE_CLASS_NONE:
4444 old_storage_class = STORAGE_CLASS_EXTERN;
4447 case STORAGE_CLASS_EXTERN:
4448 if (is_definition) {
4449 if (warning.missing_prototypes &&
4450 prev_type->function.unspecified_parameters &&
4451 !is_sym_main(symbol)) {
4452 warningf(pos, "no previous prototype for '%#T'",
4455 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4456 new_storage_class = STORAGE_CLASS_EXTERN;
4463 } else if (is_type_incomplete(prev_type)) {
4464 prev_decl->type = type;
4467 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4468 new_storage_class == STORAGE_CLASS_EXTERN) {
4470 warn_redundant_declaration: ;
4472 = has_new_attributes(prev_decl->attributes,
4474 if (has_new_attrs) {
4475 merge_in_attributes(decl, prev_decl->attributes);
4476 } else if (!is_definition &&
4477 warning.redundant_decls &&
4478 is_type_valid(prev_type) &&
4479 strcmp(previous_entity->base.source_position.input_name,
4480 "<builtin>") != 0) {
4482 "redundant declaration for '%Y' (declared %P)",
4483 symbol, &previous_entity->base.source_position);
4485 } else if (current_function == NULL) {
4486 if (old_storage_class != STORAGE_CLASS_STATIC &&
4487 new_storage_class == STORAGE_CLASS_STATIC) {
4489 "static declaration of '%Y' follows non-static declaration (declared %P)",
4490 symbol, &previous_entity->base.source_position);
4491 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4492 prev_decl->storage_class = STORAGE_CLASS_NONE;
4493 prev_decl->declared_storage_class = STORAGE_CLASS_NONE;
4495 /* ISO/IEC 14882:1998(E) §C.1.2:1 */
4497 goto error_redeclaration;
4498 goto warn_redundant_declaration;
4500 } else if (is_type_valid(prev_type)) {
4501 if (old_storage_class == new_storage_class) {
4502 error_redeclaration:
4503 errorf(pos, "redeclaration of '%Y' (declared %P)",
4504 symbol, &previous_entity->base.source_position);
4507 "redeclaration of '%Y' with different linkage (declared %P)",
4508 symbol, &previous_entity->base.source_position);
4513 prev_decl->modifiers |= decl->modifiers;
4514 if (entity->kind == ENTITY_FUNCTION) {
4515 previous_entity->function.is_inline |= entity->function.is_inline;
4517 return previous_entity;
4520 if (warning.shadow) {
4521 warningf(pos, "%s '%Y' shadows %s (declared %P)",
4522 get_entity_kind_name(entity->kind), symbol,
4523 get_entity_kind_name(previous_entity->kind),
4524 &previous_entity->base.source_position);
4528 if (entity->kind == ENTITY_FUNCTION) {
4529 if (is_definition &&
4530 entity->declaration.storage_class != STORAGE_CLASS_STATIC) {
4531 if (warning.missing_prototypes && !is_sym_main(symbol)) {
4532 warningf(pos, "no previous prototype for '%#T'",
4533 entity->declaration.type, symbol);
4534 } else if (warning.missing_declarations && !is_sym_main(symbol)) {
4535 warningf(pos, "no previous declaration for '%#T'",
4536 entity->declaration.type, symbol);
4539 } else if (warning.missing_declarations &&
4540 entity->kind == ENTITY_VARIABLE &&
4541 current_scope == file_scope) {
4542 declaration_t *declaration = &entity->declaration;
4543 if (declaration->storage_class == STORAGE_CLASS_NONE) {
4544 warningf(pos, "no previous declaration for '%#T'",
4545 declaration->type, symbol);
4550 assert(entity->base.parent_scope == NULL);
4551 assert(current_scope != NULL);
4553 entity->base.parent_scope = current_scope;
4554 entity->base.namespc = NAMESPACE_NORMAL;
4555 environment_push(entity);
4556 append_entity(current_scope, entity);
4561 static void parser_error_multiple_definition(entity_t *entity,
4562 const source_position_t *source_position)
4564 errorf(source_position, "multiple definition of '%Y' (declared %P)",
4565 entity->base.symbol, &entity->base.source_position);
4568 static bool is_declaration_specifier(const token_t *token,
4569 bool only_specifiers_qualifiers)
4571 switch (token->type) {
4576 return is_typedef_symbol(token->v.symbol);
4578 case T___extension__:
4580 return !only_specifiers_qualifiers;
4587 static void parse_init_declarator_rest(entity_t *entity)
4589 assert(is_declaration(entity));
4590 declaration_t *const declaration = &entity->declaration;
4594 type_t *orig_type = declaration->type;
4595 type_t *type = skip_typeref(orig_type);
4597 if (entity->kind == ENTITY_VARIABLE
4598 && entity->variable.initializer != NULL) {
4599 parser_error_multiple_definition(entity, HERE);
4602 bool must_be_constant = false;
4603 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
4604 entity->base.parent_scope == file_scope) {
4605 must_be_constant = true;
4608 if (is_type_function(type)) {
4609 errorf(&entity->base.source_position,
4610 "function '%#T' is initialized like a variable",
4611 orig_type, entity->base.symbol);
4612 orig_type = type_error_type;
4615 parse_initializer_env_t env;
4616 env.type = orig_type;
4617 env.must_be_constant = must_be_constant;
4618 env.entity = entity;
4619 current_init_decl = entity;
4621 initializer_t *initializer = parse_initializer(&env);
4622 current_init_decl = NULL;
4624 if (entity->kind == ENTITY_VARIABLE) {
4625 /* §6.7.5:22 array initializers for arrays with unknown size
4626 * determine the array type size */
4627 declaration->type = env.type;
4628 entity->variable.initializer = initializer;
4632 /* parse rest of a declaration without any declarator */
4633 static void parse_anonymous_declaration_rest(
4634 const declaration_specifiers_t *specifiers)
4637 anonymous_entity = NULL;
4639 if (warning.other) {
4640 if (specifiers->storage_class != STORAGE_CLASS_NONE ||
4641 specifiers->thread_local) {
4642 warningf(&specifiers->source_position,
4643 "useless storage class in empty declaration");
4646 type_t *type = specifiers->type;
4647 switch (type->kind) {
4648 case TYPE_COMPOUND_STRUCT:
4649 case TYPE_COMPOUND_UNION: {
4650 if (type->compound.compound->base.symbol == NULL) {
4651 warningf(&specifiers->source_position,
4652 "unnamed struct/union that defines no instances");
4661 warningf(&specifiers->source_position, "empty declaration");
4667 static void check_variable_type_complete(entity_t *ent)
4669 if (ent->kind != ENTITY_VARIABLE)
4672 /* §6.7:7 If an identifier for an object is declared with no linkage, the
4673 * type for the object shall be complete [...] */
4674 declaration_t *decl = &ent->declaration;
4675 if (decl->storage_class == STORAGE_CLASS_EXTERN ||
4676 decl->storage_class == STORAGE_CLASS_STATIC)
4679 type_t *const orig_type = decl->type;
4680 type_t *const type = skip_typeref(orig_type);
4681 if (!is_type_incomplete(type))
4684 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
4685 * are given length one. */
4686 if (is_type_array(type) && ent->base.parent_scope == file_scope) {
4687 ARR_APP1(declaration_t*, incomplete_arrays, decl);
4691 errorf(&ent->base.source_position, "variable '%#T' has incomplete type",
4692 orig_type, ent->base.symbol);
4696 static void parse_declaration_rest(entity_t *ndeclaration,
4697 const declaration_specifiers_t *specifiers,
4698 parsed_declaration_func finished_declaration,
4699 declarator_flags_t flags)
4701 add_anchor_token(';');
4702 add_anchor_token(',');
4704 entity_t *entity = finished_declaration(ndeclaration, token.type == '=');
4706 if (token.type == '=') {
4707 parse_init_declarator_rest(entity);
4708 } else if (entity->kind == ENTITY_VARIABLE) {
4709 /* ISO/IEC 14882:1998(E) §8.5.3:3 The initializer can be omitted
4710 * [...] where the extern specifier is explicitly used. */
4711 declaration_t *decl = &entity->declaration;
4712 if (decl->storage_class != STORAGE_CLASS_EXTERN) {
4713 type_t *type = decl->type;
4714 if (is_type_reference(skip_typeref(type))) {
4715 errorf(&entity->base.source_position,
4716 "reference '%#T' must be initialized",
4717 type, entity->base.symbol);
4722 check_variable_type_complete(entity);
4724 if (token.type != ',')
4728 add_anchor_token('=');
4729 ndeclaration = parse_declarator(specifiers, flags);
4730 rem_anchor_token('=');
4732 expect(';', end_error);
4735 anonymous_entity = NULL;
4736 rem_anchor_token(';');
4737 rem_anchor_token(',');
4740 static entity_t *finished_kr_declaration(entity_t *entity, bool is_definition)
4742 symbol_t *symbol = entity->base.symbol;
4743 if (symbol == NULL) {
4744 errorf(HERE, "anonymous declaration not valid as function parameter");
4748 assert(entity->base.namespc == NAMESPACE_NORMAL);
4749 entity_t *previous_entity = get_entity(symbol, NAMESPACE_NORMAL);
4750 if (previous_entity == NULL
4751 || previous_entity->base.parent_scope != current_scope) {
4752 errorf(HERE, "expected declaration of a function parameter, found '%Y'",
4757 if (is_definition) {
4758 errorf(HERE, "parameter '%Y' is initialised", entity->base.symbol);
4761 return record_entity(entity, false);
4764 static void parse_declaration(parsed_declaration_func finished_declaration,
4765 declarator_flags_t flags)
4767 declaration_specifiers_t specifiers;
4768 memset(&specifiers, 0, sizeof(specifiers));
4770 add_anchor_token(';');
4771 parse_declaration_specifiers(&specifiers);
4772 rem_anchor_token(';');
4774 if (token.type == ';') {
4775 parse_anonymous_declaration_rest(&specifiers);
4777 entity_t *entity = parse_declarator(&specifiers, flags);
4778 parse_declaration_rest(entity, &specifiers, finished_declaration, flags);
4783 static type_t *get_default_promoted_type(type_t *orig_type)
4785 type_t *result = orig_type;
4787 type_t *type = skip_typeref(orig_type);
4788 if (is_type_integer(type)) {
4789 result = promote_integer(type);
4790 } else if (is_type_atomic(type, ATOMIC_TYPE_FLOAT)) {
4791 result = type_double;
4797 static void parse_kr_declaration_list(entity_t *entity)
4799 if (entity->kind != ENTITY_FUNCTION)
4802 type_t *type = skip_typeref(entity->declaration.type);
4803 assert(is_type_function(type));
4804 if (!type->function.kr_style_parameters)
4807 add_anchor_token('{');
4809 /* push function parameters */
4810 size_t const top = environment_top();
4811 scope_t *old_scope = scope_push(&entity->function.parameters);
4813 entity_t *parameter = entity->function.parameters.entities;
4814 for ( ; parameter != NULL; parameter = parameter->base.next) {
4815 assert(parameter->base.parent_scope == NULL);
4816 parameter->base.parent_scope = current_scope;
4817 environment_push(parameter);
4820 /* parse declaration list */
4822 switch (token.type) {
4824 case T___extension__:
4825 /* This covers symbols, which are no type, too, and results in
4826 * better error messages. The typical cases are misspelled type
4827 * names and missing includes. */
4829 parse_declaration(finished_kr_declaration, DECL_IS_PARAMETER);
4837 /* pop function parameters */
4838 assert(current_scope == &entity->function.parameters);
4839 scope_pop(old_scope);
4840 environment_pop_to(top);
4842 /* update function type */
4843 type_t *new_type = duplicate_type(type);
4845 function_parameter_t *parameters = NULL;
4846 function_parameter_t **anchor = ¶meters;
4848 /* did we have an earlier prototype? */
4849 entity_t *proto_type = get_entity(entity->base.symbol, NAMESPACE_NORMAL);
4850 if (proto_type != NULL && proto_type->kind != ENTITY_FUNCTION)
4853 function_parameter_t *proto_parameter = NULL;
4854 if (proto_type != NULL) {
4855 type_t *proto_type_type = proto_type->declaration.type;
4856 proto_parameter = proto_type_type->function.parameters;
4857 /* If a K&R function definition has a variadic prototype earlier, then
4858 * make the function definition variadic, too. This should conform to
4859 * §6.7.5.3:15 and §6.9.1:8. */
4860 new_type->function.variadic = proto_type_type->function.variadic;
4862 /* §6.9.1.7: A K&R style parameter list does NOT act as a function
4864 new_type->function.unspecified_parameters = true;
4867 bool need_incompatible_warning = false;
4868 parameter = entity->function.parameters.entities;
4869 for (; parameter != NULL; parameter = parameter->base.next,
4871 proto_parameter == NULL ? NULL : proto_parameter->next) {
4872 if (parameter->kind != ENTITY_PARAMETER)
4875 type_t *parameter_type = parameter->declaration.type;
4876 if (parameter_type == NULL) {
4878 errorf(HERE, "no type specified for function parameter '%Y'",
4879 parameter->base.symbol);
4880 parameter_type = type_error_type;
4882 if (warning.implicit_int) {
4883 warningf(HERE, "no type specified for function parameter '%Y', using 'int'",
4884 parameter->base.symbol);
4886 parameter_type = type_int;
4888 parameter->declaration.type = parameter_type;
4891 semantic_parameter_incomplete(parameter);
4893 /* we need the default promoted types for the function type */
4894 type_t *not_promoted = parameter_type;
4895 parameter_type = get_default_promoted_type(parameter_type);
4897 /* gcc special: if the type of the prototype matches the unpromoted
4898 * type don't promote */
4899 if (!strict_mode && proto_parameter != NULL) {
4900 type_t *proto_p_type = skip_typeref(proto_parameter->type);
4901 type_t *promo_skip = skip_typeref(parameter_type);
4902 type_t *param_skip = skip_typeref(not_promoted);
4903 if (!types_compatible(proto_p_type, promo_skip)
4904 && types_compatible(proto_p_type, param_skip)) {
4906 need_incompatible_warning = true;
4907 parameter_type = not_promoted;
4910 function_parameter_t *const parameter
4911 = allocate_parameter(parameter_type);
4913 *anchor = parameter;
4914 anchor = ¶meter->next;
4917 new_type->function.parameters = parameters;
4918 new_type = identify_new_type(new_type);
4920 if (warning.other && need_incompatible_warning) {
4921 type_t *proto_type_type = proto_type->declaration.type;
4923 "declaration '%#T' is incompatible with '%#T' (declared %P)",
4924 proto_type_type, proto_type->base.symbol,
4925 new_type, entity->base.symbol,
4926 &proto_type->base.source_position);
4929 entity->declaration.type = new_type;
4931 rem_anchor_token('{');
4934 static bool first_err = true;
4937 * When called with first_err set, prints the name of the current function,
4940 static void print_in_function(void)
4944 diagnosticf("%s: In function '%Y':\n",
4945 current_function->base.base.source_position.input_name,
4946 current_function->base.base.symbol);
4951 * Check if all labels are defined in the current function.
4952 * Check if all labels are used in the current function.
4954 static void check_labels(void)
4956 for (const goto_statement_t *goto_statement = goto_first;
4957 goto_statement != NULL;
4958 goto_statement = goto_statement->next) {
4959 /* skip computed gotos */
4960 if (goto_statement->expression != NULL)
4963 label_t *label = goto_statement->label;
4966 if (label->base.source_position.input_name == NULL) {
4967 print_in_function();
4968 errorf(&goto_statement->base.source_position,
4969 "label '%Y' used but not defined", label->base.symbol);
4973 if (warning.unused_label) {
4974 for (const label_statement_t *label_statement = label_first;
4975 label_statement != NULL;
4976 label_statement = label_statement->next) {
4977 label_t *label = label_statement->label;
4979 if (! label->used) {
4980 print_in_function();
4981 warningf(&label_statement->base.source_position,
4982 "label '%Y' defined but not used", label->base.symbol);
4988 static void warn_unused_entity(entity_t *entity, entity_t *last)
4990 entity_t const *const end = last != NULL ? last->base.next : NULL;
4991 for (; entity != end; entity = entity->base.next) {
4992 if (!is_declaration(entity))
4995 declaration_t *declaration = &entity->declaration;
4996 if (declaration->implicit)
4999 if (!declaration->used) {
5000 print_in_function();
5001 const char *what = get_entity_kind_name(entity->kind);
5002 warningf(&entity->base.source_position, "%s '%Y' is unused",
5003 what, entity->base.symbol);
5004 } else if (entity->kind == ENTITY_VARIABLE && !entity->variable.read) {
5005 print_in_function();
5006 const char *what = get_entity_kind_name(entity->kind);
5007 warningf(&entity->base.source_position, "%s '%Y' is never read",
5008 what, entity->base.symbol);
5013 static void check_unused_variables(statement_t *const stmt, void *const env)
5017 switch (stmt->kind) {
5018 case STATEMENT_DECLARATION: {
5019 declaration_statement_t const *const decls = &stmt->declaration;
5020 warn_unused_entity(decls->declarations_begin,
5021 decls->declarations_end);
5026 warn_unused_entity(stmt->fors.scope.entities, NULL);
5035 * Check declarations of current_function for unused entities.
5037 static void check_declarations(void)
5039 if (warning.unused_parameter) {
5040 const scope_t *scope = ¤t_function->parameters;
5042 /* do not issue unused warnings for main */
5043 if (!is_sym_main(current_function->base.base.symbol)) {
5044 warn_unused_entity(scope->entities, NULL);
5047 if (warning.unused_variable) {
5048 walk_statements(current_function->statement, check_unused_variables,
5053 static int determine_truth(expression_t const* const cond)
5056 !is_constant_expression(cond) ? 0 :
5057 fold_constant_to_bool(cond) ? 1 :
5061 static void check_reachable(statement_t *);
5062 static bool reaches_end;
5064 static bool expression_returns(expression_t const *const expr)
5066 switch (expr->kind) {
5068 expression_t const *const func = expr->call.function;
5069 if (func->kind == EXPR_REFERENCE) {
5070 entity_t *entity = func->reference.entity;
5071 if (entity->kind == ENTITY_FUNCTION
5072 && entity->declaration.modifiers & DM_NORETURN)
5076 if (!expression_returns(func))
5079 for (call_argument_t const* arg = expr->call.arguments; arg != NULL; arg = arg->next) {
5080 if (!expression_returns(arg->expression))
5087 case EXPR_REFERENCE:
5088 case EXPR_REFERENCE_ENUM_VALUE:
5090 case EXPR_CHARACTER_CONSTANT:
5091 case EXPR_WIDE_CHARACTER_CONSTANT:
5092 case EXPR_STRING_LITERAL:
5093 case EXPR_WIDE_STRING_LITERAL:
5094 case EXPR_COMPOUND_LITERAL: // TODO descend into initialisers
5095 case EXPR_LABEL_ADDRESS:
5096 case EXPR_CLASSIFY_TYPE:
5097 case EXPR_SIZEOF: // TODO handle obscure VLA case
5100 case EXPR_BUILTIN_CONSTANT_P:
5101 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
5106 case EXPR_STATEMENT: {
5107 bool old_reaches_end = reaches_end;
5108 reaches_end = false;
5109 check_reachable(expr->statement.statement);
5110 bool returns = reaches_end;
5111 reaches_end = old_reaches_end;
5115 case EXPR_CONDITIONAL:
5116 // TODO handle constant expression
5118 if (!expression_returns(expr->conditional.condition))
5121 if (expr->conditional.true_expression != NULL
5122 && expression_returns(expr->conditional.true_expression))
5125 return expression_returns(expr->conditional.false_expression);
5128 return expression_returns(expr->select.compound);
5130 case EXPR_ARRAY_ACCESS:
5132 expression_returns(expr->array_access.array_ref) &&
5133 expression_returns(expr->array_access.index);
5136 return expression_returns(expr->va_starte.ap);
5139 return expression_returns(expr->va_arge.ap);
5142 return expression_returns(expr->va_copye.src);
5144 EXPR_UNARY_CASES_MANDATORY
5145 return expression_returns(expr->unary.value);
5147 case EXPR_UNARY_THROW:
5151 // TODO handle constant lhs of && and ||
5153 expression_returns(expr->binary.left) &&
5154 expression_returns(expr->binary.right);
5160 panic("unhandled expression");
5163 static bool initializer_returns(initializer_t const *const init)
5165 switch (init->kind) {
5166 case INITIALIZER_VALUE:
5167 return expression_returns(init->value.value);
5169 case INITIALIZER_LIST: {
5170 initializer_t * const* i = init->list.initializers;
5171 initializer_t * const* const end = i + init->list.len;
5172 bool returns = true;
5173 for (; i != end; ++i) {
5174 if (!initializer_returns(*i))
5180 case INITIALIZER_STRING:
5181 case INITIALIZER_WIDE_STRING:
5182 case INITIALIZER_DESIGNATOR: // designators have no payload
5185 panic("unhandled initializer");
5188 static bool noreturn_candidate;
5190 static void check_reachable(statement_t *const stmt)
5192 if (stmt->base.reachable)
5194 if (stmt->kind != STATEMENT_DO_WHILE)
5195 stmt->base.reachable = true;
5197 statement_t *last = stmt;
5199 switch (stmt->kind) {
5200 case STATEMENT_INVALID:
5201 case STATEMENT_EMPTY:
5203 next = stmt->base.next;
5206 case STATEMENT_DECLARATION: {
5207 declaration_statement_t const *const decl = &stmt->declaration;
5208 entity_t const * ent = decl->declarations_begin;
5209 entity_t const *const last = decl->declarations_end;
5211 for (;; ent = ent->base.next) {
5212 if (ent->kind == ENTITY_VARIABLE &&
5213 ent->variable.initializer != NULL &&
5214 !initializer_returns(ent->variable.initializer)) {
5221 next = stmt->base.next;
5225 case STATEMENT_COMPOUND:
5226 next = stmt->compound.statements;
5228 next = stmt->base.next;
5231 case STATEMENT_RETURN: {
5232 expression_t const *const val = stmt->returns.value;
5233 if (val == NULL || expression_returns(val))
5234 noreturn_candidate = false;
5238 case STATEMENT_IF: {
5239 if_statement_t const *const ifs = &stmt->ifs;
5240 expression_t const *const cond = ifs->condition;
5242 if (!expression_returns(cond))
5245 int const val = determine_truth(cond);
5248 check_reachable(ifs->true_statement);
5253 if (ifs->false_statement != NULL) {
5254 check_reachable(ifs->false_statement);
5258 next = stmt->base.next;
5262 case STATEMENT_SWITCH: {
5263 switch_statement_t const *const switchs = &stmt->switchs;
5264 expression_t const *const expr = switchs->expression;
5266 if (!expression_returns(expr))
5269 if (is_constant_expression(expr)) {
5270 long const val = fold_constant_to_int(expr);
5271 case_label_statement_t * defaults = NULL;
5272 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5273 if (i->expression == NULL) {
5278 if (i->first_case <= val && val <= i->last_case) {
5279 check_reachable((statement_t*)i);
5284 if (defaults != NULL) {
5285 check_reachable((statement_t*)defaults);
5289 bool has_default = false;
5290 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5291 if (i->expression == NULL)
5294 check_reachable((statement_t*)i);
5301 next = stmt->base.next;
5305 case STATEMENT_EXPRESSION: {
5306 /* Check for noreturn function call */
5307 expression_t const *const expr = stmt->expression.expression;
5308 if (!expression_returns(expr))
5311 next = stmt->base.next;
5315 case STATEMENT_CONTINUE: {
5316 statement_t *parent = stmt;
5318 parent = parent->base.parent;
5319 if (parent == NULL) /* continue not within loop */
5323 switch (parent->kind) {
5324 case STATEMENT_WHILE: goto continue_while;
5325 case STATEMENT_DO_WHILE: goto continue_do_while;
5326 case STATEMENT_FOR: goto continue_for;
5333 case STATEMENT_BREAK: {
5334 statement_t *parent = stmt;
5336 parent = parent->base.parent;
5337 if (parent == NULL) /* break not within loop/switch */
5340 switch (parent->kind) {
5341 case STATEMENT_SWITCH:
5342 case STATEMENT_WHILE:
5343 case STATEMENT_DO_WHILE:
5346 next = parent->base.next;
5347 goto found_break_parent;
5356 case STATEMENT_GOTO:
5357 if (stmt->gotos.expression) {
5358 if (!expression_returns(stmt->gotos.expression))
5361 statement_t *parent = stmt->base.parent;
5362 if (parent == NULL) /* top level goto */
5366 next = stmt->gotos.label->statement;
5367 if (next == NULL) /* missing label */
5372 case STATEMENT_LABEL:
5373 next = stmt->label.statement;
5376 case STATEMENT_CASE_LABEL:
5377 next = stmt->case_label.statement;
5380 case STATEMENT_WHILE: {
5381 while_statement_t const *const whiles = &stmt->whiles;
5382 expression_t const *const cond = whiles->condition;
5384 if (!expression_returns(cond))
5387 int const val = determine_truth(cond);
5390 check_reachable(whiles->body);
5395 next = stmt->base.next;
5399 case STATEMENT_DO_WHILE:
5400 next = stmt->do_while.body;
5403 case STATEMENT_FOR: {
5404 for_statement_t *const fors = &stmt->fors;
5406 if (fors->condition_reachable)
5408 fors->condition_reachable = true;
5410 expression_t const *const cond = fors->condition;
5415 } else if (expression_returns(cond)) {
5416 val = determine_truth(cond);
5422 check_reachable(fors->body);
5427 next = stmt->base.next;
5431 case STATEMENT_MS_TRY: {
5432 ms_try_statement_t const *const ms_try = &stmt->ms_try;
5433 check_reachable(ms_try->try_statement);
5434 next = ms_try->final_statement;
5438 case STATEMENT_LEAVE: {
5439 statement_t *parent = stmt;
5441 parent = parent->base.parent;
5442 if (parent == NULL) /* __leave not within __try */
5445 if (parent->kind == STATEMENT_MS_TRY) {
5447 next = parent->ms_try.final_statement;
5455 panic("invalid statement kind");
5458 while (next == NULL) {
5459 next = last->base.parent;
5461 noreturn_candidate = false;
5463 type_t *const type = skip_typeref(current_function->base.type);
5464 assert(is_type_function(type));
5465 type_t *const ret = skip_typeref(type->function.return_type);
5466 if (warning.return_type &&
5467 !is_type_atomic(ret, ATOMIC_TYPE_VOID) &&
5468 is_type_valid(ret) &&
5469 !is_sym_main(current_function->base.base.symbol)) {
5470 warningf(&stmt->base.source_position,
5471 "control reaches end of non-void function");
5476 switch (next->kind) {
5477 case STATEMENT_INVALID:
5478 case STATEMENT_EMPTY:
5479 case STATEMENT_DECLARATION:
5480 case STATEMENT_EXPRESSION:
5482 case STATEMENT_RETURN:
5483 case STATEMENT_CONTINUE:
5484 case STATEMENT_BREAK:
5485 case STATEMENT_GOTO:
5486 case STATEMENT_LEAVE:
5487 panic("invalid control flow in function");
5489 case STATEMENT_COMPOUND:
5490 if (next->compound.stmt_expr) {
5496 case STATEMENT_SWITCH:
5497 case STATEMENT_LABEL:
5498 case STATEMENT_CASE_LABEL:
5500 next = next->base.next;
5503 case STATEMENT_WHILE: {
5505 if (next->base.reachable)
5507 next->base.reachable = true;
5509 while_statement_t const *const whiles = &next->whiles;
5510 expression_t const *const cond = whiles->condition;
5512 if (!expression_returns(cond))
5515 int const val = determine_truth(cond);
5518 check_reachable(whiles->body);
5524 next = next->base.next;
5528 case STATEMENT_DO_WHILE: {
5530 if (next->base.reachable)
5532 next->base.reachable = true;
5534 do_while_statement_t const *const dw = &next->do_while;
5535 expression_t const *const cond = dw->condition;
5537 if (!expression_returns(cond))
5540 int const val = determine_truth(cond);
5543 check_reachable(dw->body);
5549 next = next->base.next;
5553 case STATEMENT_FOR: {
5555 for_statement_t *const fors = &next->fors;
5557 fors->step_reachable = true;
5559 if (fors->condition_reachable)
5561 fors->condition_reachable = true;
5563 expression_t const *const cond = fors->condition;
5568 } else if (expression_returns(cond)) {
5569 val = determine_truth(cond);
5575 check_reachable(fors->body);
5581 next = next->base.next;
5585 case STATEMENT_MS_TRY:
5587 next = next->ms_try.final_statement;
5592 check_reachable(next);
5595 static void check_unreachable(statement_t* const stmt, void *const env)
5599 switch (stmt->kind) {
5600 case STATEMENT_DO_WHILE:
5601 if (!stmt->base.reachable) {
5602 expression_t const *const cond = stmt->do_while.condition;
5603 if (determine_truth(cond) >= 0) {
5604 warningf(&cond->base.source_position,
5605 "condition of do-while-loop is unreachable");
5610 case STATEMENT_FOR: {
5611 for_statement_t const* const fors = &stmt->fors;
5613 // if init and step are unreachable, cond is unreachable, too
5614 if (!stmt->base.reachable && !fors->step_reachable) {
5615 warningf(&stmt->base.source_position, "statement is unreachable");
5617 if (!stmt->base.reachable && fors->initialisation != NULL) {
5618 warningf(&fors->initialisation->base.source_position,
5619 "initialisation of for-statement is unreachable");
5622 if (!fors->condition_reachable && fors->condition != NULL) {
5623 warningf(&fors->condition->base.source_position,
5624 "condition of for-statement is unreachable");
5627 if (!fors->step_reachable && fors->step != NULL) {
5628 warningf(&fors->step->base.source_position,
5629 "step of for-statement is unreachable");
5635 case STATEMENT_COMPOUND:
5636 if (stmt->compound.statements != NULL)
5638 goto warn_unreachable;
5640 case STATEMENT_DECLARATION: {
5641 /* Only warn if there is at least one declarator with an initializer.
5642 * This typically occurs in switch statements. */
5643 declaration_statement_t const *const decl = &stmt->declaration;
5644 entity_t const * ent = decl->declarations_begin;
5645 entity_t const *const last = decl->declarations_end;
5647 for (;; ent = ent->base.next) {
5648 if (ent->kind == ENTITY_VARIABLE &&
5649 ent->variable.initializer != NULL) {
5650 goto warn_unreachable;
5660 if (!stmt->base.reachable)
5661 warningf(&stmt->base.source_position, "statement is unreachable");
5666 static void parse_external_declaration(void)
5668 /* function-definitions and declarations both start with declaration
5670 declaration_specifiers_t specifiers;
5671 memset(&specifiers, 0, sizeof(specifiers));
5673 add_anchor_token(';');
5674 parse_declaration_specifiers(&specifiers);
5675 rem_anchor_token(';');
5677 /* must be a declaration */
5678 if (token.type == ';') {
5679 parse_anonymous_declaration_rest(&specifiers);
5683 add_anchor_token(',');
5684 add_anchor_token('=');
5685 add_anchor_token(';');
5686 add_anchor_token('{');
5688 /* declarator is common to both function-definitions and declarations */
5689 entity_t *ndeclaration = parse_declarator(&specifiers, DECL_FLAGS_NONE);
5691 rem_anchor_token('{');
5692 rem_anchor_token(';');
5693 rem_anchor_token('=');
5694 rem_anchor_token(',');
5696 /* must be a declaration */
5697 switch (token.type) {
5701 parse_declaration_rest(ndeclaration, &specifiers, record_entity,
5706 /* must be a function definition */
5707 parse_kr_declaration_list(ndeclaration);
5709 if (token.type != '{') {
5710 parse_error_expected("while parsing function definition", '{', NULL);
5711 eat_until_matching_token(';');
5715 assert(is_declaration(ndeclaration));
5716 type_t *const orig_type = ndeclaration->declaration.type;
5717 type_t * type = skip_typeref(orig_type);
5719 if (!is_type_function(type)) {
5720 if (is_type_valid(type)) {
5721 errorf(HERE, "declarator '%#T' has a body but is not a function type",
5722 type, ndeclaration->base.symbol);
5726 } else if (is_typeref(orig_type)) {
5728 errorf(&ndeclaration->base.source_position,
5729 "type of function definition '%#T' is a typedef",
5730 orig_type, ndeclaration->base.symbol);
5733 if (warning.aggregate_return &&
5734 is_type_compound(skip_typeref(type->function.return_type))) {
5735 warningf(HERE, "function '%Y' returns an aggregate",
5736 ndeclaration->base.symbol);
5738 if (warning.traditional && !type->function.unspecified_parameters) {
5739 warningf(HERE, "traditional C rejects ISO C style function definition of function '%Y'",
5740 ndeclaration->base.symbol);
5742 if (warning.old_style_definition && type->function.unspecified_parameters) {
5743 warningf(HERE, "old-style function definition '%Y'",
5744 ndeclaration->base.symbol);
5747 /* §6.7.5.3:14 a function definition with () means no
5748 * parameters (and not unspecified parameters) */
5749 if (type->function.unspecified_parameters &&
5750 type->function.parameters == NULL) {
5751 type_t *copy = duplicate_type(type);
5752 copy->function.unspecified_parameters = false;
5753 type = identify_new_type(copy);
5755 ndeclaration->declaration.type = type;
5758 entity_t *const entity = record_entity(ndeclaration, true);
5759 assert(entity->kind == ENTITY_FUNCTION);
5760 assert(ndeclaration->kind == ENTITY_FUNCTION);
5762 function_t *function = &entity->function;
5763 if (ndeclaration != entity) {
5764 function->parameters = ndeclaration->function.parameters;
5766 assert(is_declaration(entity));
5767 type = skip_typeref(entity->declaration.type);
5769 /* push function parameters and switch scope */
5770 size_t const top = environment_top();
5771 scope_t *old_scope = scope_push(&function->parameters);
5773 entity_t *parameter = function->parameters.entities;
5774 for (; parameter != NULL; parameter = parameter->base.next) {
5775 if (parameter->base.parent_scope == &ndeclaration->function.parameters) {
5776 parameter->base.parent_scope = current_scope;
5778 assert(parameter->base.parent_scope == NULL
5779 || parameter->base.parent_scope == current_scope);
5780 parameter->base.parent_scope = current_scope;
5781 if (parameter->base.symbol == NULL) {
5782 errorf(¶meter->base.source_position, "parameter name omitted");
5785 environment_push(parameter);
5788 if (function->statement != NULL) {
5789 parser_error_multiple_definition(entity, HERE);
5792 /* parse function body */
5793 int label_stack_top = label_top();
5794 function_t *old_current_function = current_function;
5795 current_function = function;
5796 current_parent = NULL;
5799 goto_anchor = &goto_first;
5801 label_anchor = &label_first;
5803 statement_t *const body = parse_compound_statement(false);
5804 function->statement = body;
5807 check_declarations();
5808 if (warning.return_type ||
5809 warning.unreachable_code ||
5810 (warning.missing_noreturn
5811 && !(function->base.modifiers & DM_NORETURN))) {
5812 noreturn_candidate = true;
5813 check_reachable(body);
5814 if (warning.unreachable_code)
5815 walk_statements(body, check_unreachable, NULL);
5816 if (warning.missing_noreturn &&
5817 noreturn_candidate &&
5818 !(function->base.modifiers & DM_NORETURN)) {
5819 warningf(&body->base.source_position,
5820 "function '%#T' is candidate for attribute 'noreturn'",
5821 type, entity->base.symbol);
5825 assert(current_parent == NULL);
5826 assert(current_function == function);
5827 current_function = old_current_function;
5828 label_pop_to(label_stack_top);
5831 assert(current_scope == &function->parameters);
5832 scope_pop(old_scope);
5833 environment_pop_to(top);
5836 static type_t *make_bitfield_type(type_t *base_type, expression_t *size,
5837 source_position_t *source_position,
5838 const symbol_t *symbol)
5840 type_t *type = allocate_type_zero(TYPE_BITFIELD);
5842 type->bitfield.base_type = base_type;
5843 type->bitfield.size_expression = size;
5846 type_t *skipped_type = skip_typeref(base_type);
5847 if (!is_type_integer(skipped_type)) {
5848 errorf(HERE, "bitfield base type '%T' is not an integer type",
5852 bit_size = get_type_size(base_type) * 8;
5855 if (is_constant_expression(size)) {
5856 long v = fold_constant_to_int(size);
5857 const symbol_t *user_symbol = symbol == NULL ? sym_anonymous : symbol;
5860 errorf(source_position, "negative width in bit-field '%Y'",
5862 } else if (v == 0 && symbol != NULL) {
5863 errorf(source_position, "zero width for bit-field '%Y'",
5865 } else if (bit_size > 0 && (il_size_t)v > bit_size) {
5866 errorf(source_position, "width of '%Y' exceeds its type",
5869 type->bitfield.bit_size = v;
5876 static entity_t *find_compound_entry(compound_t *compound, symbol_t *symbol)
5878 entity_t *iter = compound->members.entities;
5879 for (; iter != NULL; iter = iter->base.next) {
5880 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5883 if (iter->base.symbol == symbol) {
5885 } else if (iter->base.symbol == NULL) {
5886 /* search in anonymous structs and unions */
5887 type_t *type = skip_typeref(iter->declaration.type);
5888 if (is_type_compound(type)) {
5889 if (find_compound_entry(type->compound.compound, symbol)
5900 static void check_deprecated(const source_position_t *source_position,
5901 const entity_t *entity)
5903 if (!warning.deprecated_declarations)
5905 if (!is_declaration(entity))
5907 if ((entity->declaration.modifiers & DM_DEPRECATED) == 0)
5910 char const *const prefix = get_entity_kind_name(entity->kind);
5911 const char *deprecated_string
5912 = get_deprecated_string(entity->declaration.attributes);
5913 if (deprecated_string != NULL) {
5914 warningf(source_position, "%s '%Y' is deprecated (declared %P): \"%s\"",
5915 prefix, entity->base.symbol, &entity->base.source_position,
5918 warningf(source_position, "%s '%Y' is deprecated (declared %P)", prefix,
5919 entity->base.symbol, &entity->base.source_position);
5924 static expression_t *create_select(const source_position_t *pos,
5926 type_qualifiers_t qualifiers,
5929 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
5931 check_deprecated(pos, entry);
5933 expression_t *select = allocate_expression_zero(EXPR_SELECT);
5934 select->select.compound = addr;
5935 select->select.compound_entry = entry;
5937 type_t *entry_type = entry->declaration.type;
5938 type_t *res_type = get_qualified_type(entry_type, qualifiers);
5940 /* we always do the auto-type conversions; the & and sizeof parser contains
5941 * code to revert this! */
5942 select->base.type = automatic_type_conversion(res_type);
5943 if (res_type->kind == TYPE_BITFIELD) {
5944 select->base.type = res_type->bitfield.base_type;
5951 * Find entry with symbol in compound. Search anonymous structs and unions and
5952 * creates implicit select expressions for them.
5953 * Returns the adress for the innermost compound.
5955 static expression_t *find_create_select(const source_position_t *pos,
5957 type_qualifiers_t qualifiers,
5958 compound_t *compound, symbol_t *symbol)
5960 entity_t *iter = compound->members.entities;
5961 for (; iter != NULL; iter = iter->base.next) {
5962 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5965 symbol_t *iter_symbol = iter->base.symbol;
5966 if (iter_symbol == NULL) {
5967 type_t *type = iter->declaration.type;
5968 if (type->kind != TYPE_COMPOUND_STRUCT
5969 && type->kind != TYPE_COMPOUND_UNION)
5972 compound_t *sub_compound = type->compound.compound;
5974 if (find_compound_entry(sub_compound, symbol) == NULL)
5977 expression_t *sub_addr = create_select(pos, addr, qualifiers, iter);
5978 sub_addr->base.source_position = *pos;
5979 sub_addr->select.implicit = true;
5980 return find_create_select(pos, sub_addr, qualifiers, sub_compound,
5984 if (iter_symbol == symbol) {
5985 return create_select(pos, addr, qualifiers, iter);
5992 static void parse_compound_declarators(compound_t *compound,
5993 const declaration_specifiers_t *specifiers)
5998 if (token.type == ':') {
5999 source_position_t source_position = *HERE;
6002 type_t *base_type = specifiers->type;
6003 expression_t *size = parse_constant_expression();
6005 type_t *type = make_bitfield_type(base_type, size,
6006 &source_position, NULL);
6008 attribute_t *attributes = parse_attributes(NULL);
6009 if (attributes != NULL) {
6010 attribute_t *last = attributes;
6011 while (last->next != NULL)
6013 last->next = specifiers->attributes;
6015 attributes = specifiers->attributes;
6018 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER);
6019 entity->base.namespc = NAMESPACE_NORMAL;
6020 entity->base.source_position = source_position;
6021 entity->declaration.declared_storage_class = STORAGE_CLASS_NONE;
6022 entity->declaration.storage_class = STORAGE_CLASS_NONE;
6023 entity->declaration.type = type;
6024 entity->declaration.attributes = attributes;
6026 if (attributes != NULL) {
6027 handle_entity_attributes(attributes, entity);
6029 append_entity(&compound->members, entity);
6031 entity = parse_declarator(specifiers,
6032 DECL_MAY_BE_ABSTRACT | DECL_CREATE_COMPOUND_MEMBER);
6033 if (entity->kind == ENTITY_TYPEDEF) {
6034 errorf(&entity->base.source_position,
6035 "typedef not allowed as compound member");
6037 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
6039 /* make sure we don't define a symbol multiple times */
6040 symbol_t *symbol = entity->base.symbol;
6041 if (symbol != NULL) {
6042 entity_t *prev = find_compound_entry(compound, symbol);
6044 errorf(&entity->base.source_position,
6045 "multiple declarations of symbol '%Y' (declared %P)",
6046 symbol, &prev->base.source_position);
6050 if (token.type == ':') {
6051 source_position_t source_position = *HERE;
6053 expression_t *size = parse_constant_expression();
6055 type_t *type = entity->declaration.type;
6056 type_t *bitfield_type = make_bitfield_type(type, size,
6057 &source_position, entity->base.symbol);
6059 attribute_t *attributes = parse_attributes(NULL);
6060 entity->declaration.type = bitfield_type;
6061 handle_entity_attributes(attributes, entity);
6063 type_t *orig_type = entity->declaration.type;
6064 type_t *type = skip_typeref(orig_type);
6065 if (is_type_function(type)) {
6066 errorf(&entity->base.source_position,
6067 "compound member '%Y' must not have function type '%T'",
6068 entity->base.symbol, orig_type);
6069 } else if (is_type_incomplete(type)) {
6070 /* §6.7.2.1:16 flexible array member */
6071 if (!is_type_array(type) ||
6072 token.type != ';' ||
6073 look_ahead(1)->type != '}') {
6074 errorf(&entity->base.source_position,
6075 "compound member '%Y' has incomplete type '%T'",
6076 entity->base.symbol, orig_type);
6081 append_entity(&compound->members, entity);
6085 if (token.type != ',')
6089 expect(';', end_error);
6092 anonymous_entity = NULL;
6095 static void parse_compound_type_entries(compound_t *compound)
6098 add_anchor_token('}');
6100 while (token.type != '}') {
6101 if (token.type == T_EOF) {
6102 errorf(HERE, "EOF while parsing struct");
6105 declaration_specifiers_t specifiers;
6106 memset(&specifiers, 0, sizeof(specifiers));
6107 parse_declaration_specifiers(&specifiers);
6109 parse_compound_declarators(compound, &specifiers);
6111 rem_anchor_token('}');
6115 compound->complete = true;
6118 static type_t *parse_typename(void)
6120 declaration_specifiers_t specifiers;
6121 memset(&specifiers, 0, sizeof(specifiers));
6122 parse_declaration_specifiers(&specifiers);
6123 if (specifiers.storage_class != STORAGE_CLASS_NONE ||
6124 specifiers.thread_local) {
6125 /* TODO: improve error message, user does probably not know what a
6126 * storage class is...
6128 errorf(HERE, "typename may not have a storage class");
6131 type_t *result = parse_abstract_declarator(specifiers.type);
6139 typedef expression_t* (*parse_expression_function)(void);
6140 typedef expression_t* (*parse_expression_infix_function)(expression_t *left);
6142 typedef struct expression_parser_function_t expression_parser_function_t;
6143 struct expression_parser_function_t {
6144 parse_expression_function parser;
6145 precedence_t infix_precedence;
6146 parse_expression_infix_function infix_parser;
6149 expression_parser_function_t expression_parsers[T_LAST_TOKEN];
6152 * Prints an error message if an expression was expected but not read
6154 static expression_t *expected_expression_error(void)
6156 /* skip the error message if the error token was read */
6157 if (token.type != T_ERROR) {
6158 errorf(HERE, "expected expression, got token %K", &token);
6162 return create_invalid_expression();
6166 * Parse a string constant.
6168 static expression_t *parse_string_const(void)
6171 if (token.type == T_STRING_LITERAL) {
6172 string_t res = token.v.string;
6174 while (token.type == T_STRING_LITERAL) {
6175 res = concat_strings(&res, &token.v.string);
6178 if (token.type != T_WIDE_STRING_LITERAL) {
6179 expression_t *const cnst = allocate_expression_zero(EXPR_STRING_LITERAL);
6180 /* note: that we use type_char_ptr here, which is already the
6181 * automatic converted type. revert_automatic_type_conversion
6182 * will construct the array type */
6183 cnst->base.type = warning.write_strings ? type_const_char_ptr : type_char_ptr;
6184 cnst->string.value = res;
6188 wres = concat_string_wide_string(&res, &token.v.wide_string);
6190 wres = token.v.wide_string;
6195 switch (token.type) {
6196 case T_WIDE_STRING_LITERAL:
6197 wres = concat_wide_strings(&wres, &token.v.wide_string);
6200 case T_STRING_LITERAL:
6201 wres = concat_wide_string_string(&wres, &token.v.string);
6205 expression_t *const cnst = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
6206 cnst->base.type = warning.write_strings ? type_const_wchar_t_ptr : type_wchar_t_ptr;
6207 cnst->wide_string.value = wres;
6216 * Parse a boolean constant.
6218 static expression_t *parse_bool_const(bool value)
6220 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
6221 cnst->base.type = type_bool;
6222 cnst->conste.v.int_value = value;
6230 * Parse an integer constant.
6232 static expression_t *parse_int_const(void)
6234 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
6235 cnst->base.type = token.datatype;
6236 cnst->conste.v.int_value = token.v.intvalue;
6244 * Parse a character constant.
6246 static expression_t *parse_character_constant(void)
6248 expression_t *cnst = allocate_expression_zero(EXPR_CHARACTER_CONSTANT);
6249 cnst->base.type = token.datatype;
6250 cnst->conste.v.character = token.v.string;
6252 if (cnst->conste.v.character.size != 1) {
6254 errorf(HERE, "more than 1 character in character constant");
6255 } else if (warning.multichar) {
6256 warningf(HERE, "multi-character character constant");
6265 * Parse a wide character constant.
6267 static expression_t *parse_wide_character_constant(void)
6269 expression_t *cnst = allocate_expression_zero(EXPR_WIDE_CHARACTER_CONSTANT);
6270 cnst->base.type = token.datatype;
6271 cnst->conste.v.wide_character = token.v.wide_string;
6273 if (cnst->conste.v.wide_character.size != 1) {
6275 errorf(HERE, "more than 1 character in character constant");
6276 } else if (warning.multichar) {
6277 warningf(HERE, "multi-character character constant");
6286 * Parse a float constant.
6288 static expression_t *parse_float_const(void)
6290 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
6291 cnst->base.type = token.datatype;
6292 cnst->conste.v.float_value = token.v.floatvalue;
6299 static entity_t *create_implicit_function(symbol_t *symbol,
6300 const source_position_t *source_position)
6302 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
6303 ntype->function.return_type = type_int;
6304 ntype->function.unspecified_parameters = true;
6305 ntype->function.linkage = LINKAGE_C;
6306 type_t *type = identify_new_type(ntype);
6308 entity_t *entity = allocate_entity_zero(ENTITY_FUNCTION);
6309 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
6310 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
6311 entity->declaration.type = type;
6312 entity->declaration.implicit = true;
6313 entity->base.symbol = symbol;
6314 entity->base.source_position = *source_position;
6316 if (current_scope != NULL) {
6317 bool strict_prototypes_old = warning.strict_prototypes;
6318 warning.strict_prototypes = false;
6319 record_entity(entity, false);
6320 warning.strict_prototypes = strict_prototypes_old;
6327 * Creates a return_type (func)(argument_type) function type if not
6330 static type_t *make_function_2_type(type_t *return_type, type_t *argument_type1,
6331 type_t *argument_type2)
6333 function_parameter_t *const parameter2 = allocate_parameter(argument_type2);
6334 function_parameter_t *const parameter1 = allocate_parameter(argument_type1);
6335 parameter1->next = parameter2;
6337 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6338 type->function.return_type = return_type;
6339 type->function.parameters = parameter1;
6341 return identify_new_type(type);
6345 * Creates a return_type (func)(argument_type) function type if not
6348 * @param return_type the return type
6349 * @param argument_type the argument type
6351 static type_t *make_function_1_type(type_t *return_type, type_t *argument_type)
6353 function_parameter_t *const parameter = allocate_parameter(argument_type);
6355 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6356 type->function.return_type = return_type;
6357 type->function.parameters = parameter;
6359 return identify_new_type(type);
6363 * Creates a return_type (func)(argument_type, ...) function type if not
6366 * @param return_type the return type
6367 * @param argument_type the argument type
6369 static type_t *make_function_1_type_variadic(type_t *return_type, type_t *argument_type)
6371 function_parameter_t *const parameter = allocate_parameter(argument_type);
6373 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6374 type->function.return_type = return_type;
6375 type->function.parameters = parameter;
6376 type->function.variadic = true;
6378 return identify_new_type(type);
6382 * Creates a return_type (func)(void) function type if not
6385 * @param return_type the return type
6387 static type_t *make_function_0_type(type_t *return_type)
6389 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6390 type->function.return_type = return_type;
6391 type->function.parameters = NULL;
6393 return identify_new_type(type);
6397 * Creates a NO_RETURN return_type (func)(void) function type if not
6400 * @param return_type the return type
6402 static type_t *make_function_0_type_noreturn(type_t *return_type)
6404 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6405 type->function.return_type = return_type;
6406 type->function.parameters = NULL;
6407 type->function.modifiers |= DM_NORETURN;
6408 return identify_new_type(type);
6412 * Performs automatic type cast as described in §6.3.2.1.
6414 * @param orig_type the original type
6416 static type_t *automatic_type_conversion(type_t *orig_type)
6418 type_t *type = skip_typeref(orig_type);
6419 if (is_type_array(type)) {
6420 array_type_t *array_type = &type->array;
6421 type_t *element_type = array_type->element_type;
6422 unsigned qualifiers = array_type->base.qualifiers;
6424 return make_pointer_type(element_type, qualifiers);
6427 if (is_type_function(type)) {
6428 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
6435 * reverts the automatic casts of array to pointer types and function
6436 * to function-pointer types as defined §6.3.2.1
6438 type_t *revert_automatic_type_conversion(const expression_t *expression)
6440 switch (expression->kind) {
6441 case EXPR_REFERENCE: {
6442 entity_t *entity = expression->reference.entity;
6443 if (is_declaration(entity)) {
6444 return entity->declaration.type;
6445 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6446 return entity->enum_value.enum_type;
6448 panic("no declaration or enum in reference");
6453 entity_t *entity = expression->select.compound_entry;
6454 assert(is_declaration(entity));
6455 type_t *type = entity->declaration.type;
6456 return get_qualified_type(type,
6457 expression->base.type->base.qualifiers);
6460 case EXPR_UNARY_DEREFERENCE: {
6461 const expression_t *const value = expression->unary.value;
6462 type_t *const type = skip_typeref(value->base.type);
6463 if (!is_type_pointer(type))
6464 return type_error_type;
6465 return type->pointer.points_to;
6468 case EXPR_ARRAY_ACCESS: {
6469 const expression_t *array_ref = expression->array_access.array_ref;
6470 type_t *type_left = skip_typeref(array_ref->base.type);
6471 if (!is_type_pointer(type_left))
6472 return type_error_type;
6473 return type_left->pointer.points_to;
6476 case EXPR_STRING_LITERAL: {
6477 size_t size = expression->string.value.size;
6478 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
6481 case EXPR_WIDE_STRING_LITERAL: {
6482 size_t size = expression->wide_string.value.size;
6483 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
6486 case EXPR_COMPOUND_LITERAL:
6487 return expression->compound_literal.type;
6490 return expression->base.type;
6495 * Find an entity matching a symbol in a scope.
6496 * Uses current scope if scope is NULL
6498 static entity_t *lookup_entity(const scope_t *scope, symbol_t *symbol,
6499 namespace_tag_t namespc)
6501 if (scope == NULL) {
6502 return get_entity(symbol, namespc);
6505 /* we should optimize here, if scope grows above a certain size we should
6506 construct a hashmap here... */
6507 entity_t *entity = scope->entities;
6508 for ( ; entity != NULL; entity = entity->base.next) {
6509 if (entity->base.symbol == symbol && entity->base.namespc == namespc)
6516 static entity_t *parse_qualified_identifier(void)
6518 /* namespace containing the symbol */
6520 const scope_t *lookup_scope = NULL;
6522 if (token.type == T_COLONCOLON) {
6524 lookup_scope = &unit->scope;
6529 if (token.type != T_IDENTIFIER) {
6530 parse_error_expected("while parsing identifier", T_IDENTIFIER, NULL);
6531 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6533 symbol = token.v.symbol;
6537 entity = lookup_entity(lookup_scope, symbol, NAMESPACE_NORMAL);
6539 if (token.type != T_COLONCOLON)
6543 switch (entity->kind) {
6544 case ENTITY_NAMESPACE:
6545 lookup_scope = &entity->namespacee.members;
6550 lookup_scope = &entity->compound.members;
6553 errorf(HERE, "'%Y' must be a namespace, class, struct or union (but is a %s)",
6554 symbol, get_entity_kind_name(entity->kind));
6559 if (entity == NULL) {
6560 if (!strict_mode && token.type == '(') {
6561 /* an implicitly declared function */
6562 if (warning.error_implicit_function_declaration) {
6563 errorf(HERE, "implicit declaration of function '%Y'", symbol);
6564 } else if (warning.implicit_function_declaration) {
6565 warningf(HERE, "implicit declaration of function '%Y'", symbol);
6568 entity = create_implicit_function(symbol, HERE);
6570 errorf(HERE, "unknown identifier '%Y' found.", symbol);
6571 entity = create_error_entity(symbol, ENTITY_VARIABLE);
6578 /* skip further qualifications */
6579 while (token.type == T_IDENTIFIER) {
6581 if (token.type != T_COLONCOLON)
6586 return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6589 static expression_t *parse_reference(void)
6591 entity_t *entity = parse_qualified_identifier();
6594 if (is_declaration(entity)) {
6595 orig_type = entity->declaration.type;
6596 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6597 orig_type = entity->enum_value.enum_type;
6599 panic("expected declaration or enum value in reference");
6602 /* we always do the auto-type conversions; the & and sizeof parser contains
6603 * code to revert this! */
6604 type_t *type = automatic_type_conversion(orig_type);
6606 expression_kind_t kind = EXPR_REFERENCE;
6607 if (entity->kind == ENTITY_ENUM_VALUE)
6608 kind = EXPR_REFERENCE_ENUM_VALUE;
6610 expression_t *expression = allocate_expression_zero(kind);
6611 expression->reference.entity = entity;
6612 expression->base.type = type;
6614 /* this declaration is used */
6615 if (is_declaration(entity)) {
6616 entity->declaration.used = true;
6619 if (entity->base.parent_scope != file_scope
6620 && (current_function != NULL
6621 && entity->base.parent_scope->depth < current_function->parameters.depth)
6622 && (entity->kind == ENTITY_VARIABLE || entity->kind == ENTITY_PARAMETER)) {
6623 if (entity->kind == ENTITY_VARIABLE) {
6624 /* access of a variable from an outer function */
6625 entity->variable.address_taken = true;
6626 } else if (entity->kind == ENTITY_PARAMETER) {
6627 entity->parameter.address_taken = true;
6629 current_function->need_closure = true;
6632 check_deprecated(HERE, entity);
6634 if (warning.init_self && entity == current_init_decl && !in_type_prop
6635 && entity->kind == ENTITY_VARIABLE) {
6636 current_init_decl = NULL;
6637 warningf(HERE, "variable '%#T' is initialized by itself",
6638 entity->declaration.type, entity->base.symbol);
6644 static bool semantic_cast(expression_t *cast)
6646 expression_t *expression = cast->unary.value;
6647 type_t *orig_dest_type = cast->base.type;
6648 type_t *orig_type_right = expression->base.type;
6649 type_t const *dst_type = skip_typeref(orig_dest_type);
6650 type_t const *src_type = skip_typeref(orig_type_right);
6651 source_position_t const *pos = &cast->base.source_position;
6653 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
6654 if (dst_type == type_void)
6657 /* only integer and pointer can be casted to pointer */
6658 if (is_type_pointer(dst_type) &&
6659 !is_type_pointer(src_type) &&
6660 !is_type_integer(src_type) &&
6661 is_type_valid(src_type)) {
6662 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
6666 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
6667 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
6671 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
6672 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
6676 if (warning.cast_qual &&
6677 is_type_pointer(src_type) &&
6678 is_type_pointer(dst_type)) {
6679 type_t *src = skip_typeref(src_type->pointer.points_to);
6680 type_t *dst = skip_typeref(dst_type->pointer.points_to);
6681 unsigned missing_qualifiers =
6682 src->base.qualifiers & ~dst->base.qualifiers;
6683 if (missing_qualifiers != 0) {
6685 "cast discards qualifiers '%Q' in pointer target type of '%T'",
6686 missing_qualifiers, orig_type_right);
6692 static expression_t *parse_compound_literal(type_t *type)
6694 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
6696 parse_initializer_env_t env;
6699 env.must_be_constant = false;
6700 initializer_t *initializer = parse_initializer(&env);
6703 expression->compound_literal.initializer = initializer;
6704 expression->compound_literal.type = type;
6705 expression->base.type = automatic_type_conversion(type);
6711 * Parse a cast expression.
6713 static expression_t *parse_cast(void)
6715 add_anchor_token(')');
6717 source_position_t source_position = token.source_position;
6719 type_t *type = parse_typename();
6721 rem_anchor_token(')');
6722 expect(')', end_error);
6724 if (token.type == '{') {
6725 return parse_compound_literal(type);
6728 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
6729 cast->base.source_position = source_position;
6731 expression_t *value = parse_sub_expression(PREC_CAST);
6732 cast->base.type = type;
6733 cast->unary.value = value;
6735 if (! semantic_cast(cast)) {
6736 /* TODO: record the error in the AST. else it is impossible to detect it */
6741 return create_invalid_expression();
6745 * Parse a statement expression.
6747 static expression_t *parse_statement_expression(void)
6749 add_anchor_token(')');
6751 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6753 statement_t *statement = parse_compound_statement(true);
6754 statement->compound.stmt_expr = true;
6755 expression->statement.statement = statement;
6757 /* find last statement and use its type */
6758 type_t *type = type_void;
6759 const statement_t *stmt = statement->compound.statements;
6761 while (stmt->base.next != NULL)
6762 stmt = stmt->base.next;
6764 if (stmt->kind == STATEMENT_EXPRESSION) {
6765 type = stmt->expression.expression->base.type;
6767 } else if (warning.other) {
6768 warningf(&expression->base.source_position, "empty statement expression ({})");
6770 expression->base.type = type;
6772 rem_anchor_token(')');
6773 expect(')', end_error);
6780 * Parse a parenthesized expression.
6782 static expression_t *parse_parenthesized_expression(void)
6786 switch (token.type) {
6788 /* gcc extension: a statement expression */
6789 return parse_statement_expression();
6793 return parse_cast();
6795 if (is_typedef_symbol(token.v.symbol)) {
6796 return parse_cast();
6800 add_anchor_token(')');
6801 expression_t *result = parse_expression();
6802 result->base.parenthesized = true;
6803 rem_anchor_token(')');
6804 expect(')', end_error);
6810 static expression_t *parse_function_keyword(void)
6814 if (current_function == NULL) {
6815 errorf(HERE, "'__func__' used outside of a function");
6818 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6819 expression->base.type = type_char_ptr;
6820 expression->funcname.kind = FUNCNAME_FUNCTION;
6827 static expression_t *parse_pretty_function_keyword(void)
6829 if (current_function == NULL) {
6830 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
6833 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6834 expression->base.type = type_char_ptr;
6835 expression->funcname.kind = FUNCNAME_PRETTY_FUNCTION;
6837 eat(T___PRETTY_FUNCTION__);
6842 static expression_t *parse_funcsig_keyword(void)
6844 if (current_function == NULL) {
6845 errorf(HERE, "'__FUNCSIG__' used outside of a function");
6848 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6849 expression->base.type = type_char_ptr;
6850 expression->funcname.kind = FUNCNAME_FUNCSIG;
6857 static expression_t *parse_funcdname_keyword(void)
6859 if (current_function == NULL) {
6860 errorf(HERE, "'__FUNCDNAME__' used outside of a function");
6863 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6864 expression->base.type = type_char_ptr;
6865 expression->funcname.kind = FUNCNAME_FUNCDNAME;
6867 eat(T___FUNCDNAME__);
6872 static designator_t *parse_designator(void)
6874 designator_t *result = allocate_ast_zero(sizeof(result[0]));
6875 result->source_position = *HERE;
6877 if (token.type != T_IDENTIFIER) {
6878 parse_error_expected("while parsing member designator",
6879 T_IDENTIFIER, NULL);
6882 result->symbol = token.v.symbol;
6885 designator_t *last_designator = result;
6887 if (token.type == '.') {
6889 if (token.type != T_IDENTIFIER) {
6890 parse_error_expected("while parsing member designator",
6891 T_IDENTIFIER, NULL);
6894 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6895 designator->source_position = *HERE;
6896 designator->symbol = token.v.symbol;
6899 last_designator->next = designator;
6900 last_designator = designator;
6903 if (token.type == '[') {
6905 add_anchor_token(']');
6906 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6907 designator->source_position = *HERE;
6908 designator->array_index = parse_expression();
6909 rem_anchor_token(']');
6910 expect(']', end_error);
6911 if (designator->array_index == NULL) {
6915 last_designator->next = designator;
6916 last_designator = designator;
6928 * Parse the __builtin_offsetof() expression.
6930 static expression_t *parse_offsetof(void)
6932 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6933 expression->base.type = type_size_t;
6935 eat(T___builtin_offsetof);
6937 expect('(', end_error);
6938 add_anchor_token(',');
6939 type_t *type = parse_typename();
6940 rem_anchor_token(',');
6941 expect(',', end_error);
6942 add_anchor_token(')');
6943 designator_t *designator = parse_designator();
6944 rem_anchor_token(')');
6945 expect(')', end_error);
6947 expression->offsetofe.type = type;
6948 expression->offsetofe.designator = designator;
6951 memset(&path, 0, sizeof(path));
6952 path.top_type = type;
6953 path.path = NEW_ARR_F(type_path_entry_t, 0);
6955 descend_into_subtype(&path);
6957 if (!walk_designator(&path, designator, true)) {
6958 return create_invalid_expression();
6961 DEL_ARR_F(path.path);
6965 return create_invalid_expression();
6969 * Parses a _builtin_va_start() expression.
6971 static expression_t *parse_va_start(void)
6973 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6975 eat(T___builtin_va_start);
6977 expect('(', end_error);
6978 add_anchor_token(',');
6979 expression->va_starte.ap = parse_assignment_expression();
6980 rem_anchor_token(',');
6981 expect(',', end_error);
6982 expression_t *const expr = parse_assignment_expression();
6983 if (expr->kind == EXPR_REFERENCE) {
6984 entity_t *const entity = expr->reference.entity;
6985 if (!current_function->base.type->function.variadic) {
6986 errorf(&expr->base.source_position,
6987 "'va_start' used in non-variadic function");
6988 } else if (entity->base.parent_scope != ¤t_function->parameters ||
6989 entity->base.next != NULL ||
6990 entity->kind != ENTITY_PARAMETER) {
6991 errorf(&expr->base.source_position,
6992 "second argument of 'va_start' must be last parameter of the current function");
6994 expression->va_starte.parameter = &entity->variable;
6996 expect(')', end_error);
6999 expect(')', end_error);
7001 return create_invalid_expression();
7005 * Parses a __builtin_va_arg() expression.
7007 static expression_t *parse_va_arg(void)
7009 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
7011 eat(T___builtin_va_arg);
7013 expect('(', end_error);
7015 ap.expression = parse_assignment_expression();
7016 expression->va_arge.ap = ap.expression;
7017 check_call_argument(type_valist, &ap, 1);
7019 expect(',', end_error);
7020 expression->base.type = parse_typename();
7021 expect(')', end_error);
7025 return create_invalid_expression();
7029 * Parses a __builtin_va_copy() expression.
7031 static expression_t *parse_va_copy(void)
7033 expression_t *expression = allocate_expression_zero(EXPR_VA_COPY);
7035 eat(T___builtin_va_copy);
7037 expect('(', end_error);
7038 expression_t *dst = parse_assignment_expression();
7039 assign_error_t error = semantic_assign(type_valist, dst);
7040 report_assign_error(error, type_valist, dst, "call argument 1",
7041 &dst->base.source_position);
7042 expression->va_copye.dst = dst;
7044 expect(',', end_error);
7046 call_argument_t src;
7047 src.expression = parse_assignment_expression();
7048 check_call_argument(type_valist, &src, 2);
7049 expression->va_copye.src = src.expression;
7050 expect(')', end_error);
7054 return create_invalid_expression();
7058 * Parses a __builtin_constant_p() expression.
7060 static expression_t *parse_builtin_constant(void)
7062 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
7064 eat(T___builtin_constant_p);
7066 expect('(', end_error);
7067 add_anchor_token(')');
7068 expression->builtin_constant.value = parse_assignment_expression();
7069 rem_anchor_token(')');
7070 expect(')', end_error);
7071 expression->base.type = type_int;
7075 return create_invalid_expression();
7079 * Parses a __builtin_types_compatible_p() expression.
7081 static expression_t *parse_builtin_types_compatible(void)
7083 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_TYPES_COMPATIBLE_P);
7085 eat(T___builtin_types_compatible_p);
7087 expect('(', end_error);
7088 add_anchor_token(')');
7089 add_anchor_token(',');
7090 expression->builtin_types_compatible.left = parse_typename();
7091 rem_anchor_token(',');
7092 expect(',', end_error);
7093 expression->builtin_types_compatible.right = parse_typename();
7094 rem_anchor_token(')');
7095 expect(')', end_error);
7096 expression->base.type = type_int;
7100 return create_invalid_expression();
7104 * Parses a __builtin_is_*() compare expression.
7106 static expression_t *parse_compare_builtin(void)
7108 expression_t *expression;
7110 switch (token.type) {
7111 case T___builtin_isgreater:
7112 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
7114 case T___builtin_isgreaterequal:
7115 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
7117 case T___builtin_isless:
7118 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
7120 case T___builtin_islessequal:
7121 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
7123 case T___builtin_islessgreater:
7124 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
7126 case T___builtin_isunordered:
7127 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
7130 internal_errorf(HERE, "invalid compare builtin found");
7132 expression->base.source_position = *HERE;
7135 expect('(', end_error);
7136 expression->binary.left = parse_assignment_expression();
7137 expect(',', end_error);
7138 expression->binary.right = parse_assignment_expression();
7139 expect(')', end_error);
7141 type_t *const orig_type_left = expression->binary.left->base.type;
7142 type_t *const orig_type_right = expression->binary.right->base.type;
7144 type_t *const type_left = skip_typeref(orig_type_left);
7145 type_t *const type_right = skip_typeref(orig_type_right);
7146 if (!is_type_float(type_left) && !is_type_float(type_right)) {
7147 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7148 type_error_incompatible("invalid operands in comparison",
7149 &expression->base.source_position, orig_type_left, orig_type_right);
7152 semantic_comparison(&expression->binary);
7157 return create_invalid_expression();
7161 * Parses a MS assume() expression.
7163 static expression_t *parse_assume(void)
7165 expression_t *expression = allocate_expression_zero(EXPR_UNARY_ASSUME);
7169 expect('(', end_error);
7170 add_anchor_token(')');
7171 expression->unary.value = parse_assignment_expression();
7172 rem_anchor_token(')');
7173 expect(')', end_error);
7175 expression->base.type = type_void;
7178 return create_invalid_expression();
7182 * Return the declaration for a given label symbol or create a new one.
7184 * @param symbol the symbol of the label
7186 static label_t *get_label(symbol_t *symbol)
7189 assert(current_function != NULL);
7191 label = get_entity(symbol, NAMESPACE_LABEL);
7192 /* if we found a local label, we already created the declaration */
7193 if (label != NULL && label->kind == ENTITY_LOCAL_LABEL) {
7194 if (label->base.parent_scope != current_scope) {
7195 assert(label->base.parent_scope->depth < current_scope->depth);
7196 current_function->goto_to_outer = true;
7198 return &label->label;
7201 label = get_entity(symbol, NAMESPACE_LABEL);
7202 /* if we found a label in the same function, then we already created the
7205 && label->base.parent_scope == ¤t_function->parameters) {
7206 return &label->label;
7209 /* otherwise we need to create a new one */
7210 label = allocate_entity_zero(ENTITY_LABEL);
7211 label->base.namespc = NAMESPACE_LABEL;
7212 label->base.symbol = symbol;
7216 return &label->label;
7220 * Parses a GNU && label address expression.
7222 static expression_t *parse_label_address(void)
7224 source_position_t source_position = token.source_position;
7226 if (token.type != T_IDENTIFIER) {
7227 parse_error_expected("while parsing label address", T_IDENTIFIER, NULL);
7230 symbol_t *symbol = token.v.symbol;
7233 label_t *label = get_label(symbol);
7235 label->address_taken = true;
7237 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
7238 expression->base.source_position = source_position;
7240 /* label address is threaten as a void pointer */
7241 expression->base.type = type_void_ptr;
7242 expression->label_address.label = label;
7245 return create_invalid_expression();
7249 * Parse a microsoft __noop expression.
7251 static expression_t *parse_noop_expression(void)
7253 /* the result is a (int)0 */
7254 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
7255 cnst->base.type = type_int;
7256 cnst->conste.v.int_value = 0;
7257 cnst->conste.is_ms_noop = true;
7261 if (token.type == '(') {
7262 /* parse arguments */
7264 add_anchor_token(')');
7265 add_anchor_token(',');
7267 if (token.type != ')') {
7269 (void)parse_assignment_expression();
7270 if (token.type != ',')
7276 rem_anchor_token(',');
7277 rem_anchor_token(')');
7278 expect(')', end_error);
7285 * Parses a primary expression.
7287 static expression_t *parse_primary_expression(void)
7289 switch (token.type) {
7290 case T_false: return parse_bool_const(false);
7291 case T_true: return parse_bool_const(true);
7292 case T_INTEGER: return parse_int_const();
7293 case T_CHARACTER_CONSTANT: return parse_character_constant();
7294 case T_WIDE_CHARACTER_CONSTANT: return parse_wide_character_constant();
7295 case T_FLOATINGPOINT: return parse_float_const();
7296 case T_STRING_LITERAL:
7297 case T_WIDE_STRING_LITERAL: return parse_string_const();
7298 case T___FUNCTION__:
7299 case T___func__: return parse_function_keyword();
7300 case T___PRETTY_FUNCTION__: return parse_pretty_function_keyword();
7301 case T___FUNCSIG__: return parse_funcsig_keyword();
7302 case T___FUNCDNAME__: return parse_funcdname_keyword();
7303 case T___builtin_offsetof: return parse_offsetof();
7304 case T___builtin_va_start: return parse_va_start();
7305 case T___builtin_va_arg: return parse_va_arg();
7306 case T___builtin_va_copy: return parse_va_copy();
7307 case T___builtin_isgreater:
7308 case T___builtin_isgreaterequal:
7309 case T___builtin_isless:
7310 case T___builtin_islessequal:
7311 case T___builtin_islessgreater:
7312 case T___builtin_isunordered: return parse_compare_builtin();
7313 case T___builtin_constant_p: return parse_builtin_constant();
7314 case T___builtin_types_compatible_p: return parse_builtin_types_compatible();
7315 case T__assume: return parse_assume();
7318 return parse_label_address();
7321 case '(': return parse_parenthesized_expression();
7322 case T___noop: return parse_noop_expression();
7324 /* Gracefully handle type names while parsing expressions. */
7326 return parse_reference();
7328 if (!is_typedef_symbol(token.v.symbol)) {
7329 return parse_reference();
7333 source_position_t const pos = *HERE;
7334 type_t const *const type = parse_typename();
7335 errorf(&pos, "encountered type '%T' while parsing expression", type);
7336 return create_invalid_expression();
7340 errorf(HERE, "unexpected token %K, expected an expression", &token);
7341 return create_invalid_expression();
7345 * Check if the expression has the character type and issue a warning then.
7347 static void check_for_char_index_type(const expression_t *expression)
7349 type_t *const type = expression->base.type;
7350 const type_t *const base_type = skip_typeref(type);
7352 if (is_type_atomic(base_type, ATOMIC_TYPE_CHAR) &&
7353 warning.char_subscripts) {
7354 warningf(&expression->base.source_position,
7355 "array subscript has type '%T'", type);
7359 static expression_t *parse_array_expression(expression_t *left)
7361 expression_t *expression = allocate_expression_zero(EXPR_ARRAY_ACCESS);
7364 add_anchor_token(']');
7366 expression_t *inside = parse_expression();
7368 type_t *const orig_type_left = left->base.type;
7369 type_t *const orig_type_inside = inside->base.type;
7371 type_t *const type_left = skip_typeref(orig_type_left);
7372 type_t *const type_inside = skip_typeref(orig_type_inside);
7374 type_t *return_type;
7375 array_access_expression_t *array_access = &expression->array_access;
7376 if (is_type_pointer(type_left)) {
7377 return_type = type_left->pointer.points_to;
7378 array_access->array_ref = left;
7379 array_access->index = inside;
7380 check_for_char_index_type(inside);
7381 } else if (is_type_pointer(type_inside)) {
7382 return_type = type_inside->pointer.points_to;
7383 array_access->array_ref = inside;
7384 array_access->index = left;
7385 array_access->flipped = true;
7386 check_for_char_index_type(left);
7388 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
7390 "array access on object with non-pointer types '%T', '%T'",
7391 orig_type_left, orig_type_inside);
7393 return_type = type_error_type;
7394 array_access->array_ref = left;
7395 array_access->index = inside;
7398 expression->base.type = automatic_type_conversion(return_type);
7400 rem_anchor_token(']');
7401 expect(']', end_error);
7406 static expression_t *parse_typeprop(expression_kind_t const kind)
7408 expression_t *tp_expression = allocate_expression_zero(kind);
7409 tp_expression->base.type = type_size_t;
7411 eat(kind == EXPR_SIZEOF ? T_sizeof : T___alignof__);
7413 /* we only refer to a type property, mark this case */
7414 bool old = in_type_prop;
7415 in_type_prop = true;
7418 expression_t *expression;
7419 if (token.type == '(' && is_declaration_specifier(look_ahead(1), true)) {
7421 add_anchor_token(')');
7422 orig_type = parse_typename();
7423 rem_anchor_token(')');
7424 expect(')', end_error);
7426 if (token.type == '{') {
7427 /* It was not sizeof(type) after all. It is sizeof of an expression
7428 * starting with a compound literal */
7429 expression = parse_compound_literal(orig_type);
7430 goto typeprop_expression;
7433 expression = parse_sub_expression(PREC_UNARY);
7435 typeprop_expression:
7436 tp_expression->typeprop.tp_expression = expression;
7438 orig_type = revert_automatic_type_conversion(expression);
7439 expression->base.type = orig_type;
7442 tp_expression->typeprop.type = orig_type;
7443 type_t const* const type = skip_typeref(orig_type);
7444 char const* const wrong_type =
7445 GNU_MODE && is_type_atomic(type, ATOMIC_TYPE_VOID) ? NULL :
7446 is_type_incomplete(type) ? "incomplete" :
7447 type->kind == TYPE_FUNCTION ? "function designator" :
7448 type->kind == TYPE_BITFIELD ? "bitfield" :
7450 if (wrong_type != NULL) {
7451 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7452 errorf(&tp_expression->base.source_position,
7453 "operand of %s expression must not be of %s type '%T'",
7454 what, wrong_type, orig_type);
7459 return tp_expression;
7462 static expression_t *parse_sizeof(void)
7464 return parse_typeprop(EXPR_SIZEOF);
7467 static expression_t *parse_alignof(void)
7469 return parse_typeprop(EXPR_ALIGNOF);
7472 static expression_t *parse_select_expression(expression_t *addr)
7474 assert(token.type == '.' || token.type == T_MINUSGREATER);
7475 bool select_left_arrow = (token.type == T_MINUSGREATER);
7478 if (token.type != T_IDENTIFIER) {
7479 parse_error_expected("while parsing select", T_IDENTIFIER, NULL);
7480 return create_invalid_expression();
7482 symbol_t *symbol = token.v.symbol;
7485 type_t *const orig_type = addr->base.type;
7486 type_t *const type = skip_typeref(orig_type);
7489 bool saw_error = false;
7490 if (is_type_pointer(type)) {
7491 if (!select_left_arrow) {
7493 "request for member '%Y' in something not a struct or union, but '%T'",
7497 type_left = skip_typeref(type->pointer.points_to);
7499 if (select_left_arrow && is_type_valid(type)) {
7500 errorf(HERE, "left hand side of '->' is not a pointer, but '%T'", orig_type);
7506 if (type_left->kind != TYPE_COMPOUND_STRUCT &&
7507 type_left->kind != TYPE_COMPOUND_UNION) {
7509 if (is_type_valid(type_left) && !saw_error) {
7511 "request for member '%Y' in something not a struct or union, but '%T'",
7514 return create_invalid_expression();
7517 compound_t *compound = type_left->compound.compound;
7518 if (!compound->complete) {
7519 errorf(HERE, "request for member '%Y' in incomplete type '%T'",
7521 return create_invalid_expression();
7524 type_qualifiers_t qualifiers = type_left->base.qualifiers;
7525 expression_t *result
7526 = find_create_select(HERE, addr, qualifiers, compound, symbol);
7528 if (result == NULL) {
7529 errorf(HERE, "'%T' has no member named '%Y'", orig_type, symbol);
7530 return create_invalid_expression();
7536 static void check_call_argument(type_t *expected_type,
7537 call_argument_t *argument, unsigned pos)
7539 type_t *expected_type_skip = skip_typeref(expected_type);
7540 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
7541 expression_t *arg_expr = argument->expression;
7542 type_t *arg_type = skip_typeref(arg_expr->base.type);
7544 /* handle transparent union gnu extension */
7545 if (is_type_union(expected_type_skip)
7546 && (get_type_modifiers(expected_type) & DM_TRANSPARENT_UNION)) {
7547 compound_t *union_decl = expected_type_skip->compound.compound;
7548 type_t *best_type = NULL;
7549 entity_t *entry = union_decl->members.entities;
7550 for ( ; entry != NULL; entry = entry->base.next) {
7551 assert(is_declaration(entry));
7552 type_t *decl_type = entry->declaration.type;
7553 error = semantic_assign(decl_type, arg_expr);
7554 if (error == ASSIGN_ERROR_INCOMPATIBLE
7555 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
7558 if (error == ASSIGN_SUCCESS) {
7559 best_type = decl_type;
7560 } else if (best_type == NULL) {
7561 best_type = decl_type;
7565 if (best_type != NULL) {
7566 expected_type = best_type;
7570 error = semantic_assign(expected_type, arg_expr);
7571 argument->expression = create_implicit_cast(arg_expr, expected_type);
7573 if (error != ASSIGN_SUCCESS) {
7574 /* report exact scope in error messages (like "in argument 3") */
7576 snprintf(buf, sizeof(buf), "call argument %u", pos);
7577 report_assign_error(error, expected_type, arg_expr, buf,
7578 &arg_expr->base.source_position);
7579 } else if (warning.traditional || warning.conversion) {
7580 type_t *const promoted_type = get_default_promoted_type(arg_type);
7581 if (!types_compatible(expected_type_skip, promoted_type) &&
7582 !types_compatible(expected_type_skip, type_void_ptr) &&
7583 !types_compatible(type_void_ptr, promoted_type)) {
7584 /* Deliberately show the skipped types in this warning */
7585 warningf(&arg_expr->base.source_position,
7586 "passing call argument %u as '%T' rather than '%T' due to prototype",
7587 pos, expected_type_skip, promoted_type);
7593 * Handle the semantic restrictions of builtin calls
7595 static void handle_builtin_argument_restrictions(call_expression_t *call) {
7596 switch (call->function->reference.entity->function.btk) {
7597 case bk_gnu_builtin_return_address:
7598 case bk_gnu_builtin_frame_address: {
7599 /* argument must be constant */
7600 call_argument_t *argument = call->arguments;
7602 if (! is_constant_expression(argument->expression)) {
7603 errorf(&call->base.source_position,
7604 "argument of '%Y' must be a constant expression",
7605 call->function->reference.entity->base.symbol);
7609 case bk_gnu_builtin_prefetch: {
7610 /* second and third argument must be constant if existent */
7611 call_argument_t *rw = call->arguments->next;
7612 call_argument_t *locality = NULL;
7615 if (! is_constant_expression(rw->expression)) {
7616 errorf(&call->base.source_position,
7617 "second argument of '%Y' must be a constant expression",
7618 call->function->reference.entity->base.symbol);
7620 locality = rw->next;
7622 if (locality != NULL) {
7623 if (! is_constant_expression(locality->expression)) {
7624 errorf(&call->base.source_position,
7625 "third argument of '%Y' must be a constant expression",
7626 call->function->reference.entity->base.symbol);
7628 locality = rw->next;
7638 * Parse a call expression, ie. expression '( ... )'.
7640 * @param expression the function address
7642 static expression_t *parse_call_expression(expression_t *expression)
7644 expression_t *result = allocate_expression_zero(EXPR_CALL);
7645 call_expression_t *call = &result->call;
7646 call->function = expression;
7648 type_t *const orig_type = expression->base.type;
7649 type_t *const type = skip_typeref(orig_type);
7651 function_type_t *function_type = NULL;
7652 if (is_type_pointer(type)) {
7653 type_t *const to_type = skip_typeref(type->pointer.points_to);
7655 if (is_type_function(to_type)) {
7656 function_type = &to_type->function;
7657 call->base.type = function_type->return_type;
7661 if (function_type == NULL && is_type_valid(type)) {
7663 "called object '%E' (type '%T') is not a pointer to a function",
7664 expression, orig_type);
7667 /* parse arguments */
7669 add_anchor_token(')');
7670 add_anchor_token(',');
7672 if (token.type != ')') {
7673 call_argument_t **anchor = &call->arguments;
7675 call_argument_t *argument = allocate_ast_zero(sizeof(*argument));
7676 argument->expression = parse_assignment_expression();
7679 anchor = &argument->next;
7681 if (token.type != ',')
7686 rem_anchor_token(',');
7687 rem_anchor_token(')');
7688 expect(')', end_error);
7690 if (function_type == NULL)
7693 /* check type and count of call arguments */
7694 function_parameter_t *parameter = function_type->parameters;
7695 call_argument_t *argument = call->arguments;
7696 if (!function_type->unspecified_parameters) {
7697 for (unsigned pos = 0; parameter != NULL && argument != NULL;
7698 parameter = parameter->next, argument = argument->next) {
7699 check_call_argument(parameter->type, argument, ++pos);
7702 if (parameter != NULL) {
7703 errorf(HERE, "too few arguments to function '%E'", expression);
7704 } else if (argument != NULL && !function_type->variadic) {
7705 errorf(HERE, "too many arguments to function '%E'", expression);
7709 /* do default promotion for other arguments */
7710 for (; argument != NULL; argument = argument->next) {
7711 type_t *type = argument->expression->base.type;
7713 type = get_default_promoted_type(type);
7715 argument->expression
7716 = create_implicit_cast(argument->expression, type);
7719 check_format(&result->call);
7721 if (warning.aggregate_return &&
7722 is_type_compound(skip_typeref(function_type->return_type))) {
7723 warningf(&result->base.source_position,
7724 "function call has aggregate value");
7727 if (call->function->kind == EXPR_REFERENCE) {
7728 reference_expression_t *reference = &call->function->reference;
7729 if (reference->entity->kind == ENTITY_FUNCTION &&
7730 reference->entity->function.btk != bk_none)
7731 handle_builtin_argument_restrictions(call);
7738 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
7740 static bool same_compound_type(const type_t *type1, const type_t *type2)
7743 is_type_compound(type1) &&
7744 type1->kind == type2->kind &&
7745 type1->compound.compound == type2->compound.compound;
7748 static expression_t const *get_reference_address(expression_t const *expr)
7750 bool regular_take_address = true;
7752 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7753 expr = expr->unary.value;
7755 regular_take_address = false;
7758 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7761 expr = expr->unary.value;
7764 if (expr->kind != EXPR_REFERENCE)
7767 /* special case for functions which are automatically converted to a
7768 * pointer to function without an extra TAKE_ADDRESS operation */
7769 if (!regular_take_address &&
7770 expr->reference.entity->kind != ENTITY_FUNCTION) {
7777 static void warn_reference_address_as_bool(expression_t const* expr)
7779 if (!warning.address)
7782 expr = get_reference_address(expr);
7784 warningf(&expr->base.source_position,
7785 "the address of '%Y' will always evaluate as 'true'",
7786 expr->reference.entity->base.symbol);
7790 static void warn_assignment_in_condition(const expression_t *const expr)
7792 if (!warning.parentheses)
7794 if (expr->base.kind != EXPR_BINARY_ASSIGN)
7796 if (expr->base.parenthesized)
7798 warningf(&expr->base.source_position,
7799 "suggest parentheses around assignment used as truth value");
7802 static void semantic_condition(expression_t const *const expr,
7803 char const *const context)
7805 type_t *const type = skip_typeref(expr->base.type);
7806 if (is_type_scalar(type)) {
7807 warn_reference_address_as_bool(expr);
7808 warn_assignment_in_condition(expr);
7809 } else if (is_type_valid(type)) {
7810 errorf(&expr->base.source_position,
7811 "%s must have scalar type", context);
7816 * Parse a conditional expression, ie. 'expression ? ... : ...'.
7818 * @param expression the conditional expression
7820 static expression_t *parse_conditional_expression(expression_t *expression)
7822 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
7824 conditional_expression_t *conditional = &result->conditional;
7825 conditional->condition = expression;
7828 add_anchor_token(':');
7830 /* §6.5.15:2 The first operand shall have scalar type. */
7831 semantic_condition(expression, "condition of conditional operator");
7833 expression_t *true_expression = expression;
7834 bool gnu_cond = false;
7835 if (GNU_MODE && token.type == ':') {
7838 true_expression = parse_expression();
7840 rem_anchor_token(':');
7841 expect(':', end_error);
7843 expression_t *false_expression =
7844 parse_sub_expression(c_mode & _CXX ? PREC_ASSIGNMENT : PREC_CONDITIONAL);
7846 type_t *const orig_true_type = true_expression->base.type;
7847 type_t *const orig_false_type = false_expression->base.type;
7848 type_t *const true_type = skip_typeref(orig_true_type);
7849 type_t *const false_type = skip_typeref(orig_false_type);
7852 type_t *result_type;
7853 if (is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7854 is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
7855 /* ISO/IEC 14882:1998(E) §5.16:2 */
7856 if (true_expression->kind == EXPR_UNARY_THROW) {
7857 result_type = false_type;
7858 } else if (false_expression->kind == EXPR_UNARY_THROW) {
7859 result_type = true_type;
7861 if (warning.other && (
7862 !is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7863 !is_type_atomic(false_type, ATOMIC_TYPE_VOID)
7865 warningf(&conditional->base.source_position,
7866 "ISO C forbids conditional expression with only one void side");
7868 result_type = type_void;
7870 } else if (is_type_arithmetic(true_type)
7871 && is_type_arithmetic(false_type)) {
7872 result_type = semantic_arithmetic(true_type, false_type);
7874 true_expression = create_implicit_cast(true_expression, result_type);
7875 false_expression = create_implicit_cast(false_expression, result_type);
7877 conditional->true_expression = true_expression;
7878 conditional->false_expression = false_expression;
7879 conditional->base.type = result_type;
7880 } else if (same_compound_type(true_type, false_type)) {
7881 /* just take 1 of the 2 types */
7882 result_type = true_type;
7883 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
7884 type_t *pointer_type;
7886 expression_t *other_expression;
7887 if (is_type_pointer(true_type) &&
7888 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
7889 pointer_type = true_type;
7890 other_type = false_type;
7891 other_expression = false_expression;
7893 pointer_type = false_type;
7894 other_type = true_type;
7895 other_expression = true_expression;
7898 if (is_null_pointer_constant(other_expression)) {
7899 result_type = pointer_type;
7900 } else if (is_type_pointer(other_type)) {
7901 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
7902 type_t *to2 = skip_typeref(other_type->pointer.points_to);
7905 if (is_type_atomic(to1, ATOMIC_TYPE_VOID) ||
7906 is_type_atomic(to2, ATOMIC_TYPE_VOID)) {
7908 } else if (types_compatible(get_unqualified_type(to1),
7909 get_unqualified_type(to2))) {
7912 if (warning.other) {
7913 warningf(&conditional->base.source_position,
7914 "pointer types '%T' and '%T' in conditional expression are incompatible",
7915 true_type, false_type);
7920 type_t *const type =
7921 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
7922 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7923 } else if (is_type_integer(other_type)) {
7924 if (warning.other) {
7925 warningf(&conditional->base.source_position,
7926 "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7928 result_type = pointer_type;
7930 if (is_type_valid(other_type)) {
7931 type_error_incompatible("while parsing conditional",
7932 &expression->base.source_position, true_type, false_type);
7934 result_type = type_error_type;
7937 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7938 type_error_incompatible("while parsing conditional",
7939 &conditional->base.source_position, true_type,
7942 result_type = type_error_type;
7945 conditional->true_expression
7946 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7947 conditional->false_expression
7948 = create_implicit_cast(false_expression, result_type);
7949 conditional->base.type = result_type;
7954 * Parse an extension expression.
7956 static expression_t *parse_extension(void)
7958 eat(T___extension__);
7960 bool old_gcc_extension = in_gcc_extension;
7961 in_gcc_extension = true;
7962 expression_t *expression = parse_sub_expression(PREC_UNARY);
7963 in_gcc_extension = old_gcc_extension;
7968 * Parse a __builtin_classify_type() expression.
7970 static expression_t *parse_builtin_classify_type(void)
7972 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7973 result->base.type = type_int;
7975 eat(T___builtin_classify_type);
7977 expect('(', end_error);
7978 add_anchor_token(')');
7979 expression_t *expression = parse_expression();
7980 rem_anchor_token(')');
7981 expect(')', end_error);
7982 result->classify_type.type_expression = expression;
7986 return create_invalid_expression();
7990 * Parse a delete expression
7991 * ISO/IEC 14882:1998(E) §5.3.5
7993 static expression_t *parse_delete(void)
7995 expression_t *const result = allocate_expression_zero(EXPR_UNARY_DELETE);
7996 result->base.type = type_void;
8000 if (token.type == '[') {
8002 result->kind = EXPR_UNARY_DELETE_ARRAY;
8003 expect(']', end_error);
8007 expression_t *const value = parse_sub_expression(PREC_CAST);
8008 result->unary.value = value;
8010 type_t *const type = skip_typeref(value->base.type);
8011 if (!is_type_pointer(type)) {
8012 if (is_type_valid(type)) {
8013 errorf(&value->base.source_position,
8014 "operand of delete must have pointer type");
8016 } else if (warning.other &&
8017 is_type_atomic(skip_typeref(type->pointer.points_to), ATOMIC_TYPE_VOID)) {
8018 warningf(&value->base.source_position,
8019 "deleting 'void*' is undefined");
8026 * Parse a throw expression
8027 * ISO/IEC 14882:1998(E) §15:1
8029 static expression_t *parse_throw(void)
8031 expression_t *const result = allocate_expression_zero(EXPR_UNARY_THROW);
8032 result->base.type = type_void;
8036 expression_t *value = NULL;
8037 switch (token.type) {
8039 value = parse_assignment_expression();
8040 /* ISO/IEC 14882:1998(E) §15.1:3 */
8041 type_t *const orig_type = value->base.type;
8042 type_t *const type = skip_typeref(orig_type);
8043 if (is_type_incomplete(type)) {
8044 errorf(&value->base.source_position,
8045 "cannot throw object of incomplete type '%T'", orig_type);
8046 } else if (is_type_pointer(type)) {
8047 type_t *const points_to = skip_typeref(type->pointer.points_to);
8048 if (is_type_incomplete(points_to) &&
8049 !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
8050 errorf(&value->base.source_position,
8051 "cannot throw pointer to incomplete type '%T'", orig_type);
8059 result->unary.value = value;
8064 static bool check_pointer_arithmetic(const source_position_t *source_position,
8065 type_t *pointer_type,
8066 type_t *orig_pointer_type)
8068 type_t *points_to = pointer_type->pointer.points_to;
8069 points_to = skip_typeref(points_to);
8071 if (is_type_incomplete(points_to)) {
8072 if (!GNU_MODE || !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
8073 errorf(source_position,
8074 "arithmetic with pointer to incomplete type '%T' not allowed",
8077 } else if (warning.pointer_arith) {
8078 warningf(source_position,
8079 "pointer of type '%T' used in arithmetic",
8082 } else if (is_type_function(points_to)) {
8084 errorf(source_position,
8085 "arithmetic with pointer to function type '%T' not allowed",
8088 } else if (warning.pointer_arith) {
8089 warningf(source_position,
8090 "pointer to a function '%T' used in arithmetic",
8097 static bool is_lvalue(const expression_t *expression)
8099 /* TODO: doesn't seem to be consistent with §6.3.2.1:1 */
8100 switch (expression->kind) {
8101 case EXPR_ARRAY_ACCESS:
8102 case EXPR_COMPOUND_LITERAL:
8103 case EXPR_REFERENCE:
8105 case EXPR_UNARY_DEREFERENCE:
8109 type_t *type = skip_typeref(expression->base.type);
8111 /* ISO/IEC 14882:1998(E) §3.10:3 */
8112 is_type_reference(type) ||
8113 /* Claim it is an lvalue, if the type is invalid. There was a parse
8114 * error before, which maybe prevented properly recognizing it as
8116 !is_type_valid(type);
8121 static void semantic_incdec(unary_expression_t *expression)
8123 type_t *const orig_type = expression->value->base.type;
8124 type_t *const type = skip_typeref(orig_type);
8125 if (is_type_pointer(type)) {
8126 if (!check_pointer_arithmetic(&expression->base.source_position,
8130 } else if (!is_type_real(type) && is_type_valid(type)) {
8131 /* TODO: improve error message */
8132 errorf(&expression->base.source_position,
8133 "operation needs an arithmetic or pointer type");
8136 if (!is_lvalue(expression->value)) {
8137 /* TODO: improve error message */
8138 errorf(&expression->base.source_position, "lvalue required as operand");
8140 expression->base.type = orig_type;
8143 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
8145 type_t *const orig_type = expression->value->base.type;
8146 type_t *const type = skip_typeref(orig_type);
8147 if (!is_type_arithmetic(type)) {
8148 if (is_type_valid(type)) {
8149 /* TODO: improve error message */
8150 errorf(&expression->base.source_position,
8151 "operation needs an arithmetic type");
8156 expression->base.type = orig_type;
8159 static void semantic_unexpr_plus(unary_expression_t *expression)
8161 semantic_unexpr_arithmetic(expression);
8162 if (warning.traditional)
8163 warningf(&expression->base.source_position,
8164 "traditional C rejects the unary plus operator");
8167 static void semantic_not(unary_expression_t *expression)
8169 /* §6.5.3.3:1 The operand [...] of the ! operator, scalar type. */
8170 semantic_condition(expression->value, "operand of !");
8171 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8174 static void semantic_unexpr_integer(unary_expression_t *expression)
8176 type_t *const orig_type = expression->value->base.type;
8177 type_t *const type = skip_typeref(orig_type);
8178 if (!is_type_integer(type)) {
8179 if (is_type_valid(type)) {
8180 errorf(&expression->base.source_position,
8181 "operand of ~ must be of integer type");
8186 expression->base.type = orig_type;
8189 static void semantic_dereference(unary_expression_t *expression)
8191 type_t *const orig_type = expression->value->base.type;
8192 type_t *const type = skip_typeref(orig_type);
8193 if (!is_type_pointer(type)) {
8194 if (is_type_valid(type)) {
8195 errorf(&expression->base.source_position,
8196 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
8201 type_t *result_type = type->pointer.points_to;
8202 result_type = automatic_type_conversion(result_type);
8203 expression->base.type = result_type;
8207 * Record that an address is taken (expression represents an lvalue).
8209 * @param expression the expression
8210 * @param may_be_register if true, the expression might be an register
8212 static void set_address_taken(expression_t *expression, bool may_be_register)
8214 if (expression->kind != EXPR_REFERENCE)
8217 entity_t *const entity = expression->reference.entity;
8219 if (entity->kind != ENTITY_VARIABLE && entity->kind != ENTITY_PARAMETER)
8222 if (entity->declaration.storage_class == STORAGE_CLASS_REGISTER
8223 && !may_be_register) {
8224 errorf(&expression->base.source_position,
8225 "address of register %s '%Y' requested",
8226 get_entity_kind_name(entity->kind), entity->base.symbol);
8229 if (entity->kind == ENTITY_VARIABLE) {
8230 entity->variable.address_taken = true;
8232 assert(entity->kind == ENTITY_PARAMETER);
8233 entity->parameter.address_taken = true;
8238 * Check the semantic of the address taken expression.
8240 static void semantic_take_addr(unary_expression_t *expression)
8242 expression_t *value = expression->value;
8243 value->base.type = revert_automatic_type_conversion(value);
8245 type_t *orig_type = value->base.type;
8246 type_t *type = skip_typeref(orig_type);
8247 if (!is_type_valid(type))
8251 if (!is_lvalue(value)) {
8252 errorf(&expression->base.source_position, "'&' requires an lvalue");
8254 if (type->kind == TYPE_BITFIELD) {
8255 errorf(&expression->base.source_position,
8256 "'&' not allowed on object with bitfield type '%T'",
8260 set_address_taken(value, false);
8262 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
8265 #define CREATE_UNARY_EXPRESSION_PARSER(token_type, unexpression_type, sfunc) \
8266 static expression_t *parse_##unexpression_type(void) \
8268 expression_t *unary_expression \
8269 = allocate_expression_zero(unexpression_type); \
8271 unary_expression->unary.value = parse_sub_expression(PREC_UNARY); \
8273 sfunc(&unary_expression->unary); \
8275 return unary_expression; \
8278 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
8279 semantic_unexpr_arithmetic)
8280 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
8281 semantic_unexpr_plus)
8282 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
8284 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
8285 semantic_dereference)
8286 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
8288 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
8289 semantic_unexpr_integer)
8290 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
8292 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
8295 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_type, unexpression_type, \
8297 static expression_t *parse_##unexpression_type(expression_t *left) \
8299 expression_t *unary_expression \
8300 = allocate_expression_zero(unexpression_type); \
8302 unary_expression->unary.value = left; \
8304 sfunc(&unary_expression->unary); \
8306 return unary_expression; \
8309 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
8310 EXPR_UNARY_POSTFIX_INCREMENT,
8312 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
8313 EXPR_UNARY_POSTFIX_DECREMENT,
8316 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
8318 /* TODO: handle complex + imaginary types */
8320 type_left = get_unqualified_type(type_left);
8321 type_right = get_unqualified_type(type_right);
8323 /* §6.3.1.8 Usual arithmetic conversions */
8324 if (type_left == type_long_double || type_right == type_long_double) {
8325 return type_long_double;
8326 } else if (type_left == type_double || type_right == type_double) {
8328 } else if (type_left == type_float || type_right == type_float) {
8332 type_left = promote_integer(type_left);
8333 type_right = promote_integer(type_right);
8335 if (type_left == type_right)
8338 bool const signed_left = is_type_signed(type_left);
8339 bool const signed_right = is_type_signed(type_right);
8340 int const rank_left = get_rank(type_left);
8341 int const rank_right = get_rank(type_right);
8343 if (signed_left == signed_right)
8344 return rank_left >= rank_right ? type_left : type_right;
8353 u_rank = rank_right;
8354 u_type = type_right;
8356 s_rank = rank_right;
8357 s_type = type_right;
8362 if (u_rank >= s_rank)
8365 /* casting rank to atomic_type_kind is a bit hacky, but makes things
8367 if (get_atomic_type_size((atomic_type_kind_t) s_rank)
8368 > get_atomic_type_size((atomic_type_kind_t) u_rank))
8372 case ATOMIC_TYPE_INT: return type_unsigned_int;
8373 case ATOMIC_TYPE_LONG: return type_unsigned_long;
8374 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
8376 default: panic("invalid atomic type");
8381 * Check the semantic restrictions for a binary expression.
8383 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
8385 expression_t *const left = expression->left;
8386 expression_t *const right = expression->right;
8387 type_t *const orig_type_left = left->base.type;
8388 type_t *const orig_type_right = right->base.type;
8389 type_t *const type_left = skip_typeref(orig_type_left);
8390 type_t *const type_right = skip_typeref(orig_type_right);
8392 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8393 /* TODO: improve error message */
8394 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8395 errorf(&expression->base.source_position,
8396 "operation needs arithmetic types");
8401 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8402 expression->left = create_implicit_cast(left, arithmetic_type);
8403 expression->right = create_implicit_cast(right, arithmetic_type);
8404 expression->base.type = arithmetic_type;
8407 static void warn_div_by_zero(binary_expression_t const *const expression)
8409 if (!warning.div_by_zero ||
8410 !is_type_integer(expression->base.type))
8413 expression_t const *const right = expression->right;
8414 /* The type of the right operand can be different for /= */
8415 if (is_type_integer(right->base.type) &&
8416 is_constant_expression(right) &&
8417 !fold_constant_to_bool(right)) {
8418 warningf(&expression->base.source_position, "division by zero");
8423 * Check the semantic restrictions for a div/mod expression.
8425 static void semantic_divmod_arithmetic(binary_expression_t *expression)
8427 semantic_binexpr_arithmetic(expression);
8428 warn_div_by_zero(expression);
8431 static void warn_addsub_in_shift(const expression_t *const expr)
8433 if (expr->base.parenthesized)
8437 switch (expr->kind) {
8438 case EXPR_BINARY_ADD: op = '+'; break;
8439 case EXPR_BINARY_SUB: op = '-'; break;
8443 warningf(&expr->base.source_position,
8444 "suggest parentheses around '%c' inside shift", op);
8447 static bool semantic_shift(binary_expression_t *expression)
8449 expression_t *const left = expression->left;
8450 expression_t *const right = expression->right;
8451 type_t *const orig_type_left = left->base.type;
8452 type_t *const orig_type_right = right->base.type;
8453 type_t * type_left = skip_typeref(orig_type_left);
8454 type_t * type_right = skip_typeref(orig_type_right);
8456 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8457 /* TODO: improve error message */
8458 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8459 errorf(&expression->base.source_position,
8460 "operands of shift operation must have integer types");
8465 type_left = promote_integer(type_left);
8467 if (is_constant_expression(right)) {
8468 long count = fold_constant_to_int(right);
8470 warningf(&right->base.source_position,
8471 "shift count must be non-negative");
8472 } else if ((unsigned long)count >=
8473 get_atomic_type_size(type_left->atomic.akind) * 8) {
8474 warningf(&right->base.source_position,
8475 "shift count must be less than type width");
8479 type_right = promote_integer(type_right);
8480 expression->right = create_implicit_cast(right, type_right);
8485 static void semantic_shift_op(binary_expression_t *expression)
8487 expression_t *const left = expression->left;
8488 expression_t *const right = expression->right;
8490 if (!semantic_shift(expression))
8493 if (warning.parentheses) {
8494 warn_addsub_in_shift(left);
8495 warn_addsub_in_shift(right);
8498 type_t *const orig_type_left = left->base.type;
8499 type_t * type_left = skip_typeref(orig_type_left);
8501 type_left = promote_integer(type_left);
8502 expression->left = create_implicit_cast(left, type_left);
8503 expression->base.type = type_left;
8506 static void semantic_add(binary_expression_t *expression)
8508 expression_t *const left = expression->left;
8509 expression_t *const right = expression->right;
8510 type_t *const orig_type_left = left->base.type;
8511 type_t *const orig_type_right = right->base.type;
8512 type_t *const type_left = skip_typeref(orig_type_left);
8513 type_t *const type_right = skip_typeref(orig_type_right);
8516 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8517 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8518 expression->left = create_implicit_cast(left, arithmetic_type);
8519 expression->right = create_implicit_cast(right, arithmetic_type);
8520 expression->base.type = arithmetic_type;
8521 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8522 check_pointer_arithmetic(&expression->base.source_position,
8523 type_left, orig_type_left);
8524 expression->base.type = type_left;
8525 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
8526 check_pointer_arithmetic(&expression->base.source_position,
8527 type_right, orig_type_right);
8528 expression->base.type = type_right;
8529 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8530 errorf(&expression->base.source_position,
8531 "invalid operands to binary + ('%T', '%T')",
8532 orig_type_left, orig_type_right);
8536 static void semantic_sub(binary_expression_t *expression)
8538 expression_t *const left = expression->left;
8539 expression_t *const right = expression->right;
8540 type_t *const orig_type_left = left->base.type;
8541 type_t *const orig_type_right = right->base.type;
8542 type_t *const type_left = skip_typeref(orig_type_left);
8543 type_t *const type_right = skip_typeref(orig_type_right);
8544 source_position_t const *const pos = &expression->base.source_position;
8547 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8548 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8549 expression->left = create_implicit_cast(left, arithmetic_type);
8550 expression->right = create_implicit_cast(right, arithmetic_type);
8551 expression->base.type = arithmetic_type;
8552 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8553 check_pointer_arithmetic(&expression->base.source_position,
8554 type_left, orig_type_left);
8555 expression->base.type = type_left;
8556 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8557 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
8558 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
8559 if (!types_compatible(unqual_left, unqual_right)) {
8561 "subtracting pointers to incompatible types '%T' and '%T'",
8562 orig_type_left, orig_type_right);
8563 } else if (!is_type_object(unqual_left)) {
8564 if (!is_type_atomic(unqual_left, ATOMIC_TYPE_VOID)) {
8565 errorf(pos, "subtracting pointers to non-object types '%T'",
8567 } else if (warning.other) {
8568 warningf(pos, "subtracting pointers to void");
8571 expression->base.type = type_ptrdiff_t;
8572 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8573 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
8574 orig_type_left, orig_type_right);
8578 static void warn_string_literal_address(expression_t const* expr)
8580 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
8581 expr = expr->unary.value;
8582 if (expr->kind != EXPR_UNARY_DEREFERENCE)
8584 expr = expr->unary.value;
8587 if (expr->kind == EXPR_STRING_LITERAL ||
8588 expr->kind == EXPR_WIDE_STRING_LITERAL) {
8589 warningf(&expr->base.source_position,
8590 "comparison with string literal results in unspecified behaviour");
8594 static void warn_comparison_in_comparison(const expression_t *const expr)
8596 if (expr->base.parenthesized)
8598 switch (expr->base.kind) {
8599 case EXPR_BINARY_LESS:
8600 case EXPR_BINARY_GREATER:
8601 case EXPR_BINARY_LESSEQUAL:
8602 case EXPR_BINARY_GREATEREQUAL:
8603 case EXPR_BINARY_NOTEQUAL:
8604 case EXPR_BINARY_EQUAL:
8605 warningf(&expr->base.source_position,
8606 "comparisons like 'x <= y < z' do not have their mathematical meaning");
8613 static bool maybe_negative(expression_t const *const expr)
8616 !is_constant_expression(expr) ||
8617 fold_constant_to_int(expr) < 0;
8621 * Check the semantics of comparison expressions.
8623 * @param expression The expression to check.
8625 static void semantic_comparison(binary_expression_t *expression)
8627 expression_t *left = expression->left;
8628 expression_t *right = expression->right;
8630 if (warning.address) {
8631 warn_string_literal_address(left);
8632 warn_string_literal_address(right);
8634 expression_t const* const func_left = get_reference_address(left);
8635 if (func_left != NULL && is_null_pointer_constant(right)) {
8636 warningf(&expression->base.source_position,
8637 "the address of '%Y' will never be NULL",
8638 func_left->reference.entity->base.symbol);
8641 expression_t const* const func_right = get_reference_address(right);
8642 if (func_right != NULL && is_null_pointer_constant(right)) {
8643 warningf(&expression->base.source_position,
8644 "the address of '%Y' will never be NULL",
8645 func_right->reference.entity->base.symbol);
8649 if (warning.parentheses) {
8650 warn_comparison_in_comparison(left);
8651 warn_comparison_in_comparison(right);
8654 type_t *orig_type_left = left->base.type;
8655 type_t *orig_type_right = right->base.type;
8656 type_t *type_left = skip_typeref(orig_type_left);
8657 type_t *type_right = skip_typeref(orig_type_right);
8659 /* TODO non-arithmetic types */
8660 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8661 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8663 /* test for signed vs unsigned compares */
8664 if (warning.sign_compare && is_type_integer(arithmetic_type)) {
8665 bool const signed_left = is_type_signed(type_left);
8666 bool const signed_right = is_type_signed(type_right);
8667 if (signed_left != signed_right) {
8668 /* FIXME long long needs better const folding magic */
8669 /* TODO check whether constant value can be represented by other type */
8670 if ((signed_left && maybe_negative(left)) ||
8671 (signed_right && maybe_negative(right))) {
8672 warningf(&expression->base.source_position,
8673 "comparison between signed and unsigned");
8678 expression->left = create_implicit_cast(left, arithmetic_type);
8679 expression->right = create_implicit_cast(right, arithmetic_type);
8680 expression->base.type = arithmetic_type;
8681 if (warning.float_equal &&
8682 (expression->base.kind == EXPR_BINARY_EQUAL ||
8683 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
8684 is_type_float(arithmetic_type)) {
8685 warningf(&expression->base.source_position,
8686 "comparing floating point with == or != is unsafe");
8688 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8689 /* TODO check compatibility */
8690 } else if (is_type_pointer(type_left)) {
8691 expression->right = create_implicit_cast(right, type_left);
8692 } else if (is_type_pointer(type_right)) {
8693 expression->left = create_implicit_cast(left, type_right);
8694 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8695 type_error_incompatible("invalid operands in comparison",
8696 &expression->base.source_position,
8697 type_left, type_right);
8699 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8703 * Checks if a compound type has constant fields.
8705 static bool has_const_fields(const compound_type_t *type)
8707 compound_t *compound = type->compound;
8708 entity_t *entry = compound->members.entities;
8710 for (; entry != NULL; entry = entry->base.next) {
8711 if (!is_declaration(entry))
8714 const type_t *decl_type = skip_typeref(entry->declaration.type);
8715 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
8722 static bool is_valid_assignment_lhs(expression_t const* const left)
8724 type_t *const orig_type_left = revert_automatic_type_conversion(left);
8725 type_t *const type_left = skip_typeref(orig_type_left);
8727 if (!is_lvalue(left)) {
8728 errorf(HERE, "left hand side '%E' of assignment is not an lvalue",
8733 if (left->kind == EXPR_REFERENCE
8734 && left->reference.entity->kind == ENTITY_FUNCTION) {
8735 errorf(HERE, "cannot assign to function '%E'", left);
8739 if (is_type_array(type_left)) {
8740 errorf(HERE, "cannot assign to array '%E'", left);
8743 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
8744 errorf(HERE, "assignment to readonly location '%E' (type '%T')", left,
8748 if (is_type_incomplete(type_left)) {
8749 errorf(HERE, "left-hand side '%E' of assignment has incomplete type '%T'",
8750 left, orig_type_left);
8753 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
8754 errorf(HERE, "cannot assign to '%E' because compound type '%T' has readonly fields",
8755 left, orig_type_left);
8762 static void semantic_arithmetic_assign(binary_expression_t *expression)
8764 expression_t *left = expression->left;
8765 expression_t *right = expression->right;
8766 type_t *orig_type_left = left->base.type;
8767 type_t *orig_type_right = right->base.type;
8769 if (!is_valid_assignment_lhs(left))
8772 type_t *type_left = skip_typeref(orig_type_left);
8773 type_t *type_right = skip_typeref(orig_type_right);
8775 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8776 /* TODO: improve error message */
8777 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8778 errorf(&expression->base.source_position,
8779 "operation needs arithmetic types");
8784 /* combined instructions are tricky. We can't create an implicit cast on
8785 * the left side, because we need the uncasted form for the store.
8786 * The ast2firm pass has to know that left_type must be right_type
8787 * for the arithmetic operation and create a cast by itself */
8788 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8789 expression->right = create_implicit_cast(right, arithmetic_type);
8790 expression->base.type = type_left;
8793 static void semantic_divmod_assign(binary_expression_t *expression)
8795 semantic_arithmetic_assign(expression);
8796 warn_div_by_zero(expression);
8799 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
8801 expression_t *const left = expression->left;
8802 expression_t *const right = expression->right;
8803 type_t *const orig_type_left = left->base.type;
8804 type_t *const orig_type_right = right->base.type;
8805 type_t *const type_left = skip_typeref(orig_type_left);
8806 type_t *const type_right = skip_typeref(orig_type_right);
8808 if (!is_valid_assignment_lhs(left))
8811 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8812 /* combined instructions are tricky. We can't create an implicit cast on
8813 * the left side, because we need the uncasted form for the store.
8814 * The ast2firm pass has to know that left_type must be right_type
8815 * for the arithmetic operation and create a cast by itself */
8816 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
8817 expression->right = create_implicit_cast(right, arithmetic_type);
8818 expression->base.type = type_left;
8819 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8820 check_pointer_arithmetic(&expression->base.source_position,
8821 type_left, orig_type_left);
8822 expression->base.type = type_left;
8823 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8824 errorf(&expression->base.source_position,
8825 "incompatible types '%T' and '%T' in assignment",
8826 orig_type_left, orig_type_right);
8830 static void semantic_integer_assign(binary_expression_t *expression)
8832 expression_t *left = expression->left;
8833 expression_t *right = expression->right;
8834 type_t *orig_type_left = left->base.type;
8835 type_t *orig_type_right = right->base.type;
8837 if (!is_valid_assignment_lhs(left))
8840 type_t *type_left = skip_typeref(orig_type_left);
8841 type_t *type_right = skip_typeref(orig_type_right);
8843 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8844 /* TODO: improve error message */
8845 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8846 errorf(&expression->base.source_position,
8847 "operation needs integer types");
8852 /* combined instructions are tricky. We can't create an implicit cast on
8853 * the left side, because we need the uncasted form for the store.
8854 * The ast2firm pass has to know that left_type must be right_type
8855 * for the arithmetic operation and create a cast by itself */
8856 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8857 expression->right = create_implicit_cast(right, arithmetic_type);
8858 expression->base.type = type_left;
8861 static void semantic_shift_assign(binary_expression_t *expression)
8863 expression_t *left = expression->left;
8865 if (!is_valid_assignment_lhs(left))
8868 if (!semantic_shift(expression))
8871 expression->base.type = skip_typeref(left->base.type);
8874 static void warn_logical_and_within_or(const expression_t *const expr)
8876 if (expr->base.kind != EXPR_BINARY_LOGICAL_AND)
8878 if (expr->base.parenthesized)
8880 warningf(&expr->base.source_position,
8881 "suggest parentheses around && within ||");
8885 * Check the semantic restrictions of a logical expression.
8887 static void semantic_logical_op(binary_expression_t *expression)
8889 /* §6.5.13:2 Each of the operands shall have scalar type.
8890 * §6.5.14:2 Each of the operands shall have scalar type. */
8891 semantic_condition(expression->left, "left operand of logical operator");
8892 semantic_condition(expression->right, "right operand of logical operator");
8893 if (expression->base.kind == EXPR_BINARY_LOGICAL_OR &&
8894 warning.parentheses) {
8895 warn_logical_and_within_or(expression->left);
8896 warn_logical_and_within_or(expression->right);
8898 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8902 * Check the semantic restrictions of a binary assign expression.
8904 static void semantic_binexpr_assign(binary_expression_t *expression)
8906 expression_t *left = expression->left;
8907 type_t *orig_type_left = left->base.type;
8909 if (!is_valid_assignment_lhs(left))
8912 assign_error_t error = semantic_assign(orig_type_left, expression->right);
8913 report_assign_error(error, orig_type_left, expression->right,
8914 "assignment", &left->base.source_position);
8915 expression->right = create_implicit_cast(expression->right, orig_type_left);
8916 expression->base.type = orig_type_left;
8920 * Determine if the outermost operation (or parts thereof) of the given
8921 * expression has no effect in order to generate a warning about this fact.
8922 * Therefore in some cases this only examines some of the operands of the
8923 * expression (see comments in the function and examples below).
8925 * f() + 23; // warning, because + has no effect
8926 * x || f(); // no warning, because x controls execution of f()
8927 * x ? y : f(); // warning, because y has no effect
8928 * (void)x; // no warning to be able to suppress the warning
8929 * This function can NOT be used for an "expression has definitely no effect"-
8931 static bool expression_has_effect(const expression_t *const expr)
8933 switch (expr->kind) {
8934 case EXPR_UNKNOWN: break;
8935 case EXPR_INVALID: return true; /* do NOT warn */
8936 case EXPR_REFERENCE: return false;
8937 case EXPR_REFERENCE_ENUM_VALUE: return false;
8938 /* suppress the warning for microsoft __noop operations */
8939 case EXPR_CONST: return expr->conste.is_ms_noop;
8940 case EXPR_CHARACTER_CONSTANT: return false;
8941 case EXPR_WIDE_CHARACTER_CONSTANT: return false;
8942 case EXPR_STRING_LITERAL: return false;
8943 case EXPR_WIDE_STRING_LITERAL: return false;
8944 case EXPR_LABEL_ADDRESS: return false;
8947 const call_expression_t *const call = &expr->call;
8948 if (call->function->kind != EXPR_REFERENCE)
8951 switch (call->function->reference.entity->function.btk) {
8952 /* FIXME: which builtins have no effect? */
8953 default: return true;
8957 /* Generate the warning if either the left or right hand side of a
8958 * conditional expression has no effect */
8959 case EXPR_CONDITIONAL: {
8960 conditional_expression_t const *const cond = &expr->conditional;
8961 expression_t const *const t = cond->true_expression;
8963 (t == NULL || expression_has_effect(t)) &&
8964 expression_has_effect(cond->false_expression);
8967 case EXPR_SELECT: return false;
8968 case EXPR_ARRAY_ACCESS: return false;
8969 case EXPR_SIZEOF: return false;
8970 case EXPR_CLASSIFY_TYPE: return false;
8971 case EXPR_ALIGNOF: return false;
8973 case EXPR_FUNCNAME: return false;
8974 case EXPR_BUILTIN_CONSTANT_P: return false;
8975 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return false;
8976 case EXPR_OFFSETOF: return false;
8977 case EXPR_VA_START: return true;
8978 case EXPR_VA_ARG: return true;
8979 case EXPR_VA_COPY: return true;
8980 case EXPR_STATEMENT: return true; // TODO
8981 case EXPR_COMPOUND_LITERAL: return false;
8983 case EXPR_UNARY_NEGATE: return false;
8984 case EXPR_UNARY_PLUS: return false;
8985 case EXPR_UNARY_BITWISE_NEGATE: return false;
8986 case EXPR_UNARY_NOT: return false;
8987 case EXPR_UNARY_DEREFERENCE: return false;
8988 case EXPR_UNARY_TAKE_ADDRESS: return false;
8989 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
8990 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
8991 case EXPR_UNARY_PREFIX_INCREMENT: return true;
8992 case EXPR_UNARY_PREFIX_DECREMENT: return true;
8994 /* Treat void casts as if they have an effect in order to being able to
8995 * suppress the warning */
8996 case EXPR_UNARY_CAST: {
8997 type_t *const type = skip_typeref(expr->base.type);
8998 return is_type_atomic(type, ATOMIC_TYPE_VOID);
9001 case EXPR_UNARY_CAST_IMPLICIT: return true;
9002 case EXPR_UNARY_ASSUME: return true;
9003 case EXPR_UNARY_DELETE: return true;
9004 case EXPR_UNARY_DELETE_ARRAY: return true;
9005 case EXPR_UNARY_THROW: return true;
9007 case EXPR_BINARY_ADD: return false;
9008 case EXPR_BINARY_SUB: return false;
9009 case EXPR_BINARY_MUL: return false;
9010 case EXPR_BINARY_DIV: return false;
9011 case EXPR_BINARY_MOD: return false;
9012 case EXPR_BINARY_EQUAL: return false;
9013 case EXPR_BINARY_NOTEQUAL: return false;
9014 case EXPR_BINARY_LESS: return false;
9015 case EXPR_BINARY_LESSEQUAL: return false;
9016 case EXPR_BINARY_GREATER: return false;
9017 case EXPR_BINARY_GREATEREQUAL: return false;
9018 case EXPR_BINARY_BITWISE_AND: return false;
9019 case EXPR_BINARY_BITWISE_OR: return false;
9020 case EXPR_BINARY_BITWISE_XOR: return false;
9021 case EXPR_BINARY_SHIFTLEFT: return false;
9022 case EXPR_BINARY_SHIFTRIGHT: return false;
9023 case EXPR_BINARY_ASSIGN: return true;
9024 case EXPR_BINARY_MUL_ASSIGN: return true;
9025 case EXPR_BINARY_DIV_ASSIGN: return true;
9026 case EXPR_BINARY_MOD_ASSIGN: return true;
9027 case EXPR_BINARY_ADD_ASSIGN: return true;
9028 case EXPR_BINARY_SUB_ASSIGN: return true;
9029 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
9030 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
9031 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
9032 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
9033 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
9035 /* Only examine the right hand side of && and ||, because the left hand
9036 * side already has the effect of controlling the execution of the right
9038 case EXPR_BINARY_LOGICAL_AND:
9039 case EXPR_BINARY_LOGICAL_OR:
9040 /* Only examine the right hand side of a comma expression, because the left
9041 * hand side has a separate warning */
9042 case EXPR_BINARY_COMMA:
9043 return expression_has_effect(expr->binary.right);
9045 case EXPR_BINARY_ISGREATER: return false;
9046 case EXPR_BINARY_ISGREATEREQUAL: return false;
9047 case EXPR_BINARY_ISLESS: return false;
9048 case EXPR_BINARY_ISLESSEQUAL: return false;
9049 case EXPR_BINARY_ISLESSGREATER: return false;
9050 case EXPR_BINARY_ISUNORDERED: return false;
9053 internal_errorf(HERE, "unexpected expression");
9056 static void semantic_comma(binary_expression_t *expression)
9058 if (warning.unused_value) {
9059 const expression_t *const left = expression->left;
9060 if (!expression_has_effect(left)) {
9061 warningf(&left->base.source_position,
9062 "left-hand operand of comma expression has no effect");
9065 expression->base.type = expression->right->base.type;
9069 * @param prec_r precedence of the right operand
9071 #define CREATE_BINEXPR_PARSER(token_type, binexpression_type, prec_r, sfunc) \
9072 static expression_t *parse_##binexpression_type(expression_t *left) \
9074 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
9075 binexpr->binary.left = left; \
9078 expression_t *right = parse_sub_expression(prec_r); \
9080 binexpr->binary.right = right; \
9081 sfunc(&binexpr->binary); \
9086 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, PREC_CAST, semantic_binexpr_arithmetic)
9087 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, PREC_CAST, semantic_divmod_arithmetic)
9088 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, PREC_CAST, semantic_divmod_arithmetic)
9089 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, PREC_MULTIPLICATIVE, semantic_add)
9090 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, PREC_MULTIPLICATIVE, semantic_sub)
9091 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT, PREC_ADDITIVE, semantic_shift_op)
9092 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT, PREC_ADDITIVE, semantic_shift_op)
9093 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, PREC_SHIFT, semantic_comparison)
9094 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, PREC_SHIFT, semantic_comparison)
9095 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL, PREC_SHIFT, semantic_comparison)
9096 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL, PREC_SHIFT, semantic_comparison)
9097 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL, PREC_RELATIONAL, semantic_comparison)
9098 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL, PREC_RELATIONAL, semantic_comparison)
9099 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND, PREC_EQUALITY, semantic_binexpr_arithmetic)
9100 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR, PREC_AND, semantic_binexpr_arithmetic)
9101 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR, PREC_XOR, semantic_binexpr_arithmetic)
9102 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND, PREC_OR, semantic_logical_op)
9103 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR, PREC_LOGICAL_AND, semantic_logical_op)
9104 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, PREC_ASSIGNMENT, semantic_binexpr_assign)
9105 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
9106 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
9107 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
9108 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
9109 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
9110 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
9111 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
9112 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
9113 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
9114 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
9115 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, PREC_ASSIGNMENT, semantic_comma)
9118 static expression_t *parse_sub_expression(precedence_t precedence)
9120 if (token.type < 0) {
9121 return expected_expression_error();
9124 expression_parser_function_t *parser
9125 = &expression_parsers[token.type];
9126 source_position_t source_position = token.source_position;
9129 if (parser->parser != NULL) {
9130 left = parser->parser();
9132 left = parse_primary_expression();
9134 assert(left != NULL);
9135 left->base.source_position = source_position;
9138 if (token.type < 0) {
9139 return expected_expression_error();
9142 parser = &expression_parsers[token.type];
9143 if (parser->infix_parser == NULL)
9145 if (parser->infix_precedence < precedence)
9148 left = parser->infix_parser(left);
9150 assert(left != NULL);
9151 assert(left->kind != EXPR_UNKNOWN);
9152 left->base.source_position = source_position;
9159 * Parse an expression.
9161 static expression_t *parse_expression(void)
9163 return parse_sub_expression(PREC_EXPRESSION);
9167 * Register a parser for a prefix-like operator.
9169 * @param parser the parser function
9170 * @param token_type the token type of the prefix token
9172 static void register_expression_parser(parse_expression_function parser,
9175 expression_parser_function_t *entry = &expression_parsers[token_type];
9177 if (entry->parser != NULL) {
9178 diagnosticf("for token '%k'\n", (token_type_t)token_type);
9179 panic("trying to register multiple expression parsers for a token");
9181 entry->parser = parser;
9185 * Register a parser for an infix operator with given precedence.
9187 * @param parser the parser function
9188 * @param token_type the token type of the infix operator
9189 * @param precedence the precedence of the operator
9191 static void register_infix_parser(parse_expression_infix_function parser,
9192 int token_type, precedence_t precedence)
9194 expression_parser_function_t *entry = &expression_parsers[token_type];
9196 if (entry->infix_parser != NULL) {
9197 diagnosticf("for token '%k'\n", (token_type_t)token_type);
9198 panic("trying to register multiple infix expression parsers for a "
9201 entry->infix_parser = parser;
9202 entry->infix_precedence = precedence;
9206 * Initialize the expression parsers.
9208 static void init_expression_parsers(void)
9210 memset(&expression_parsers, 0, sizeof(expression_parsers));
9212 register_infix_parser(parse_array_expression, '[', PREC_POSTFIX);
9213 register_infix_parser(parse_call_expression, '(', PREC_POSTFIX);
9214 register_infix_parser(parse_select_expression, '.', PREC_POSTFIX);
9215 register_infix_parser(parse_select_expression, T_MINUSGREATER, PREC_POSTFIX);
9216 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT, T_PLUSPLUS, PREC_POSTFIX);
9217 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT, T_MINUSMINUS, PREC_POSTFIX);
9218 register_infix_parser(parse_EXPR_BINARY_MUL, '*', PREC_MULTIPLICATIVE);
9219 register_infix_parser(parse_EXPR_BINARY_DIV, '/', PREC_MULTIPLICATIVE);
9220 register_infix_parser(parse_EXPR_BINARY_MOD, '%', PREC_MULTIPLICATIVE);
9221 register_infix_parser(parse_EXPR_BINARY_ADD, '+', PREC_ADDITIVE);
9222 register_infix_parser(parse_EXPR_BINARY_SUB, '-', PREC_ADDITIVE);
9223 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, PREC_SHIFT);
9224 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, PREC_SHIFT);
9225 register_infix_parser(parse_EXPR_BINARY_LESS, '<', PREC_RELATIONAL);
9226 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', PREC_RELATIONAL);
9227 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, PREC_RELATIONAL);
9228 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, PREC_RELATIONAL);
9229 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, PREC_EQUALITY);
9230 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL, T_EXCLAMATIONMARKEQUAL, PREC_EQUALITY);
9231 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', PREC_AND);
9232 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', PREC_XOR);
9233 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', PREC_OR);
9234 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, PREC_LOGICAL_AND);
9235 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, PREC_LOGICAL_OR);
9236 register_infix_parser(parse_conditional_expression, '?', PREC_CONDITIONAL);
9237 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', PREC_ASSIGNMENT);
9238 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, PREC_ASSIGNMENT);
9239 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, PREC_ASSIGNMENT);
9240 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, PREC_ASSIGNMENT);
9241 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, PREC_ASSIGNMENT);
9242 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, PREC_ASSIGNMENT);
9243 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN, T_LESSLESSEQUAL, PREC_ASSIGNMENT);
9244 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN, T_GREATERGREATEREQUAL, PREC_ASSIGNMENT);
9245 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN, T_ANDEQUAL, PREC_ASSIGNMENT);
9246 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN, T_PIPEEQUAL, PREC_ASSIGNMENT);
9247 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN, T_CARETEQUAL, PREC_ASSIGNMENT);
9248 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', PREC_EXPRESSION);
9250 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-');
9251 register_expression_parser(parse_EXPR_UNARY_PLUS, '+');
9252 register_expression_parser(parse_EXPR_UNARY_NOT, '!');
9253 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~');
9254 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*');
9255 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&');
9256 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT, T_PLUSPLUS);
9257 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT, T_MINUSMINUS);
9258 register_expression_parser(parse_sizeof, T_sizeof);
9259 register_expression_parser(parse_alignof, T___alignof__);
9260 register_expression_parser(parse_extension, T___extension__);
9261 register_expression_parser(parse_builtin_classify_type, T___builtin_classify_type);
9262 register_expression_parser(parse_delete, T_delete);
9263 register_expression_parser(parse_throw, T_throw);
9267 * Parse a asm statement arguments specification.
9269 static asm_argument_t *parse_asm_arguments(bool is_out)
9271 asm_argument_t *result = NULL;
9272 asm_argument_t **anchor = &result;
9274 while (token.type == T_STRING_LITERAL || token.type == '[') {
9275 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
9276 memset(argument, 0, sizeof(argument[0]));
9278 if (token.type == '[') {
9280 if (token.type != T_IDENTIFIER) {
9281 parse_error_expected("while parsing asm argument",
9282 T_IDENTIFIER, NULL);
9285 argument->symbol = token.v.symbol;
9287 expect(']', end_error);
9290 argument->constraints = parse_string_literals();
9291 expect('(', end_error);
9292 add_anchor_token(')');
9293 expression_t *expression = parse_expression();
9294 rem_anchor_token(')');
9296 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
9297 * change size or type representation (e.g. int -> long is ok, but
9298 * int -> float is not) */
9299 if (expression->kind == EXPR_UNARY_CAST) {
9300 type_t *const type = expression->base.type;
9301 type_kind_t const kind = type->kind;
9302 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
9305 if (kind == TYPE_ATOMIC) {
9306 atomic_type_kind_t const akind = type->atomic.akind;
9307 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9308 size = get_atomic_type_size(akind);
9310 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9311 size = get_atomic_type_size(get_intptr_kind());
9315 expression_t *const value = expression->unary.value;
9316 type_t *const value_type = value->base.type;
9317 type_kind_t const value_kind = value_type->kind;
9319 unsigned value_flags;
9320 unsigned value_size;
9321 if (value_kind == TYPE_ATOMIC) {
9322 atomic_type_kind_t const value_akind = value_type->atomic.akind;
9323 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9324 value_size = get_atomic_type_size(value_akind);
9325 } else if (value_kind == TYPE_POINTER) {
9326 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9327 value_size = get_atomic_type_size(get_intptr_kind());
9332 if (value_flags != flags || value_size != size)
9336 } while (expression->kind == EXPR_UNARY_CAST);
9340 if (!is_lvalue(expression)) {
9341 errorf(&expression->base.source_position,
9342 "asm output argument is not an lvalue");
9345 if (argument->constraints.begin[0] == '+')
9346 mark_vars_read(expression, NULL);
9348 mark_vars_read(expression, NULL);
9350 argument->expression = expression;
9351 expect(')', end_error);
9353 set_address_taken(expression, true);
9356 anchor = &argument->next;
9358 if (token.type != ',')
9369 * Parse a asm statement clobber specification.
9371 static asm_clobber_t *parse_asm_clobbers(void)
9373 asm_clobber_t *result = NULL;
9374 asm_clobber_t *last = NULL;
9376 while (token.type == T_STRING_LITERAL) {
9377 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
9378 clobber->clobber = parse_string_literals();
9381 last->next = clobber;
9387 if (token.type != ',')
9396 * Parse an asm statement.
9398 static statement_t *parse_asm_statement(void)
9400 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
9401 asm_statement_t *asm_statement = &statement->asms;
9405 if (token.type == T_volatile) {
9407 asm_statement->is_volatile = true;
9410 expect('(', end_error);
9411 add_anchor_token(')');
9412 add_anchor_token(':');
9413 asm_statement->asm_text = parse_string_literals();
9415 if (token.type != ':') {
9416 rem_anchor_token(':');
9421 asm_statement->outputs = parse_asm_arguments(true);
9422 if (token.type != ':') {
9423 rem_anchor_token(':');
9428 asm_statement->inputs = parse_asm_arguments(false);
9429 if (token.type != ':') {
9430 rem_anchor_token(':');
9433 rem_anchor_token(':');
9436 asm_statement->clobbers = parse_asm_clobbers();
9439 rem_anchor_token(')');
9440 expect(')', end_error);
9441 expect(';', end_error);
9443 if (asm_statement->outputs == NULL) {
9444 /* GCC: An 'asm' instruction without any output operands will be treated
9445 * identically to a volatile 'asm' instruction. */
9446 asm_statement->is_volatile = true;
9451 return create_invalid_statement();
9455 * Parse a case statement.
9457 static statement_t *parse_case_statement(void)
9459 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9460 source_position_t *const pos = &statement->base.source_position;
9464 expression_t *const expression = parse_expression();
9465 statement->case_label.expression = expression;
9466 if (!is_constant_expression(expression)) {
9467 /* This check does not prevent the error message in all cases of an
9468 * prior error while parsing the expression. At least it catches the
9469 * common case of a mistyped enum entry. */
9470 if (is_type_valid(skip_typeref(expression->base.type))) {
9471 errorf(pos, "case label does not reduce to an integer constant");
9473 statement->case_label.is_bad = true;
9475 long const val = fold_constant_to_int(expression);
9476 statement->case_label.first_case = val;
9477 statement->case_label.last_case = val;
9481 if (token.type == T_DOTDOTDOT) {
9483 expression_t *const end_range = parse_expression();
9484 statement->case_label.end_range = end_range;
9485 if (!is_constant_expression(end_range)) {
9486 /* This check does not prevent the error message in all cases of an
9487 * prior error while parsing the expression. At least it catches the
9488 * common case of a mistyped enum entry. */
9489 if (is_type_valid(skip_typeref(end_range->base.type))) {
9490 errorf(pos, "case range does not reduce to an integer constant");
9492 statement->case_label.is_bad = true;
9494 long const val = fold_constant_to_int(end_range);
9495 statement->case_label.last_case = val;
9497 if (warning.other && val < statement->case_label.first_case) {
9498 statement->case_label.is_empty_range = true;
9499 warningf(pos, "empty range specified");
9505 PUSH_PARENT(statement);
9507 expect(':', end_error);
9510 if (current_switch != NULL) {
9511 if (! statement->case_label.is_bad) {
9512 /* Check for duplicate case values */
9513 case_label_statement_t *c = &statement->case_label;
9514 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
9515 if (l->is_bad || l->is_empty_range || l->expression == NULL)
9518 if (c->last_case < l->first_case || c->first_case > l->last_case)
9521 errorf(pos, "duplicate case value (previously used %P)",
9522 &l->base.source_position);
9526 /* link all cases into the switch statement */
9527 if (current_switch->last_case == NULL) {
9528 current_switch->first_case = &statement->case_label;
9530 current_switch->last_case->next = &statement->case_label;
9532 current_switch->last_case = &statement->case_label;
9534 errorf(pos, "case label not within a switch statement");
9537 statement_t *const inner_stmt = parse_statement();
9538 statement->case_label.statement = inner_stmt;
9539 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9540 errorf(&inner_stmt->base.source_position, "declaration after case label");
9548 * Parse a default statement.
9550 static statement_t *parse_default_statement(void)
9552 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9556 PUSH_PARENT(statement);
9558 expect(':', end_error);
9559 if (current_switch != NULL) {
9560 const case_label_statement_t *def_label = current_switch->default_label;
9561 if (def_label != NULL) {
9562 errorf(HERE, "multiple default labels in one switch (previous declared %P)",
9563 &def_label->base.source_position);
9565 current_switch->default_label = &statement->case_label;
9567 /* link all cases into the switch statement */
9568 if (current_switch->last_case == NULL) {
9569 current_switch->first_case = &statement->case_label;
9571 current_switch->last_case->next = &statement->case_label;
9573 current_switch->last_case = &statement->case_label;
9576 errorf(&statement->base.source_position,
9577 "'default' label not within a switch statement");
9580 statement_t *const inner_stmt = parse_statement();
9581 statement->case_label.statement = inner_stmt;
9582 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9583 errorf(&inner_stmt->base.source_position, "declaration after default label");
9590 return create_invalid_statement();
9594 * Parse a label statement.
9596 static statement_t *parse_label_statement(void)
9598 assert(token.type == T_IDENTIFIER);
9599 symbol_t *symbol = token.v.symbol;
9600 label_t *label = get_label(symbol);
9602 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
9603 statement->label.label = label;
9607 PUSH_PARENT(statement);
9609 /* if statement is already set then the label is defined twice,
9610 * otherwise it was just mentioned in a goto/local label declaration so far
9612 if (label->statement != NULL) {
9613 errorf(HERE, "duplicate label '%Y' (declared %P)",
9614 symbol, &label->base.source_position);
9616 label->base.source_position = token.source_position;
9617 label->statement = statement;
9622 if (token.type == '}') {
9623 /* TODO only warn? */
9624 if (warning.other && false) {
9625 warningf(HERE, "label at end of compound statement");
9626 statement->label.statement = create_empty_statement();
9628 errorf(HERE, "label at end of compound statement");
9629 statement->label.statement = create_invalid_statement();
9631 } else if (token.type == ';') {
9632 /* Eat an empty statement here, to avoid the warning about an empty
9633 * statement after a label. label:; is commonly used to have a label
9634 * before a closing brace. */
9635 statement->label.statement = create_empty_statement();
9638 statement_t *const inner_stmt = parse_statement();
9639 statement->label.statement = inner_stmt;
9640 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9641 errorf(&inner_stmt->base.source_position, "declaration after label");
9645 /* remember the labels in a list for later checking */
9646 *label_anchor = &statement->label;
9647 label_anchor = &statement->label.next;
9654 * Parse an if statement.
9656 static statement_t *parse_if(void)
9658 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
9662 PUSH_PARENT(statement);
9664 add_anchor_token('{');
9666 expect('(', end_error);
9667 add_anchor_token(')');
9668 expression_t *const expr = parse_expression();
9669 statement->ifs.condition = expr;
9670 /* §6.8.4.1:1 The controlling expression of an if statement shall have
9672 semantic_condition(expr, "condition of 'if'-statment");
9673 mark_vars_read(expr, NULL);
9674 rem_anchor_token(')');
9675 expect(')', end_error);
9678 rem_anchor_token('{');
9680 add_anchor_token(T_else);
9681 statement_t *const true_stmt = parse_statement();
9682 statement->ifs.true_statement = true_stmt;
9683 rem_anchor_token(T_else);
9685 if (token.type == T_else) {
9687 statement->ifs.false_statement = parse_statement();
9688 } else if (warning.parentheses &&
9689 true_stmt->kind == STATEMENT_IF &&
9690 true_stmt->ifs.false_statement != NULL) {
9691 warningf(&true_stmt->base.source_position,
9692 "suggest explicit braces to avoid ambiguous 'else'");
9700 * Check that all enums are handled in a switch.
9702 * @param statement the switch statement to check
9704 static void check_enum_cases(const switch_statement_t *statement)
9706 const type_t *type = skip_typeref(statement->expression->base.type);
9707 if (! is_type_enum(type))
9709 const enum_type_t *enumt = &type->enumt;
9711 /* if we have a default, no warnings */
9712 if (statement->default_label != NULL)
9715 /* FIXME: calculation of value should be done while parsing */
9716 /* TODO: quadratic algorithm here. Change to an n log n one */
9717 long last_value = -1;
9718 const entity_t *entry = enumt->enume->base.next;
9719 for (; entry != NULL && entry->kind == ENTITY_ENUM_VALUE;
9720 entry = entry->base.next) {
9721 const expression_t *expression = entry->enum_value.value;
9722 long value = expression != NULL ? fold_constant_to_int(expression) : last_value + 1;
9724 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
9725 if (l->expression == NULL)
9727 if (l->first_case <= value && value <= l->last_case) {
9733 warningf(&statement->base.source_position,
9734 "enumeration value '%Y' not handled in switch",
9735 entry->base.symbol);
9742 * Parse a switch statement.
9744 static statement_t *parse_switch(void)
9746 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
9750 PUSH_PARENT(statement);
9752 expect('(', end_error);
9753 add_anchor_token(')');
9754 expression_t *const expr = parse_expression();
9755 mark_vars_read(expr, NULL);
9756 type_t * type = skip_typeref(expr->base.type);
9757 if (is_type_integer(type)) {
9758 type = promote_integer(type);
9759 if (warning.traditional) {
9760 if (get_rank(type) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
9761 warningf(&expr->base.source_position,
9762 "'%T' switch expression not converted to '%T' in ISO C",
9766 } else if (is_type_valid(type)) {
9767 errorf(&expr->base.source_position,
9768 "switch quantity is not an integer, but '%T'", type);
9769 type = type_error_type;
9771 statement->switchs.expression = create_implicit_cast(expr, type);
9772 expect(')', end_error);
9773 rem_anchor_token(')');
9775 switch_statement_t *rem = current_switch;
9776 current_switch = &statement->switchs;
9777 statement->switchs.body = parse_statement();
9778 current_switch = rem;
9780 if (warning.switch_default &&
9781 statement->switchs.default_label == NULL) {
9782 warningf(&statement->base.source_position, "switch has no default case");
9784 if (warning.switch_enum)
9785 check_enum_cases(&statement->switchs);
9791 return create_invalid_statement();
9794 static statement_t *parse_loop_body(statement_t *const loop)
9796 statement_t *const rem = current_loop;
9797 current_loop = loop;
9799 statement_t *const body = parse_statement();
9806 * Parse a while statement.
9808 static statement_t *parse_while(void)
9810 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
9814 PUSH_PARENT(statement);
9816 expect('(', end_error);
9817 add_anchor_token(')');
9818 expression_t *const cond = parse_expression();
9819 statement->whiles.condition = cond;
9820 /* §6.8.5:2 The controlling expression of an iteration statement shall
9821 * have scalar type. */
9822 semantic_condition(cond, "condition of 'while'-statement");
9823 mark_vars_read(cond, NULL);
9824 rem_anchor_token(')');
9825 expect(')', end_error);
9827 statement->whiles.body = parse_loop_body(statement);
9833 return create_invalid_statement();
9837 * Parse a do statement.
9839 static statement_t *parse_do(void)
9841 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
9845 PUSH_PARENT(statement);
9847 add_anchor_token(T_while);
9848 statement->do_while.body = parse_loop_body(statement);
9849 rem_anchor_token(T_while);
9851 expect(T_while, end_error);
9852 expect('(', end_error);
9853 add_anchor_token(')');
9854 expression_t *const cond = parse_expression();
9855 statement->do_while.condition = cond;
9856 /* §6.8.5:2 The controlling expression of an iteration statement shall
9857 * have scalar type. */
9858 semantic_condition(cond, "condition of 'do-while'-statement");
9859 mark_vars_read(cond, NULL);
9860 rem_anchor_token(')');
9861 expect(')', end_error);
9862 expect(';', end_error);
9868 return create_invalid_statement();
9872 * Parse a for statement.
9874 static statement_t *parse_for(void)
9876 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9880 expect('(', end_error1);
9881 add_anchor_token(')');
9883 PUSH_PARENT(statement);
9885 size_t const top = environment_top();
9886 scope_t *old_scope = scope_push(&statement->fors.scope);
9888 bool old_gcc_extension = in_gcc_extension;
9889 while (token.type == T___extension__) {
9891 in_gcc_extension = true;
9894 if (token.type == ';') {
9896 } else if (is_declaration_specifier(&token, false)) {
9897 parse_declaration(record_entity, DECL_FLAGS_NONE);
9899 add_anchor_token(';');
9900 expression_t *const init = parse_expression();
9901 statement->fors.initialisation = init;
9902 mark_vars_read(init, ENT_ANY);
9903 if (warning.unused_value && !expression_has_effect(init)) {
9904 warningf(&init->base.source_position,
9905 "initialisation of 'for'-statement has no effect");
9907 rem_anchor_token(';');
9908 expect(';', end_error2);
9910 in_gcc_extension = old_gcc_extension;
9912 if (token.type != ';') {
9913 add_anchor_token(';');
9914 expression_t *const cond = parse_expression();
9915 statement->fors.condition = cond;
9916 /* §6.8.5:2 The controlling expression of an iteration statement
9917 * shall have scalar type. */
9918 semantic_condition(cond, "condition of 'for'-statement");
9919 mark_vars_read(cond, NULL);
9920 rem_anchor_token(';');
9922 expect(';', end_error2);
9923 if (token.type != ')') {
9924 expression_t *const step = parse_expression();
9925 statement->fors.step = step;
9926 mark_vars_read(step, ENT_ANY);
9927 if (warning.unused_value && !expression_has_effect(step)) {
9928 warningf(&step->base.source_position,
9929 "step of 'for'-statement has no effect");
9932 expect(')', end_error2);
9933 rem_anchor_token(')');
9934 statement->fors.body = parse_loop_body(statement);
9936 assert(current_scope == &statement->fors.scope);
9937 scope_pop(old_scope);
9938 environment_pop_to(top);
9945 rem_anchor_token(')');
9946 assert(current_scope == &statement->fors.scope);
9947 scope_pop(old_scope);
9948 environment_pop_to(top);
9952 return create_invalid_statement();
9956 * Parse a goto statement.
9958 static statement_t *parse_goto(void)
9960 statement_t *statement = allocate_statement_zero(STATEMENT_GOTO);
9963 if (GNU_MODE && token.type == '*') {
9965 expression_t *expression = parse_expression();
9966 mark_vars_read(expression, NULL);
9968 /* Argh: although documentation says the expression must be of type void*,
9969 * gcc accepts anything that can be casted into void* without error */
9970 type_t *type = expression->base.type;
9972 if (type != type_error_type) {
9973 if (!is_type_pointer(type) && !is_type_integer(type)) {
9974 errorf(&expression->base.source_position,
9975 "cannot convert to a pointer type");
9976 } else if (warning.other && type != type_void_ptr) {
9977 warningf(&expression->base.source_position,
9978 "type of computed goto expression should be 'void*' not '%T'", type);
9980 expression = create_implicit_cast(expression, type_void_ptr);
9983 statement->gotos.expression = expression;
9984 } else if (token.type == T_IDENTIFIER) {
9985 symbol_t *symbol = token.v.symbol;
9987 statement->gotos.label = get_label(symbol);
9990 parse_error_expected("while parsing goto", T_IDENTIFIER, '*', NULL);
9992 parse_error_expected("while parsing goto", T_IDENTIFIER, NULL);
9997 /* remember the goto's in a list for later checking */
9998 *goto_anchor = &statement->gotos;
9999 goto_anchor = &statement->gotos.next;
10001 expect(';', end_error);
10005 return create_invalid_statement();
10009 * Parse a continue statement.
10011 static statement_t *parse_continue(void)
10013 if (current_loop == NULL) {
10014 errorf(HERE, "continue statement not within loop");
10017 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
10020 expect(';', end_error);
10027 * Parse a break statement.
10029 static statement_t *parse_break(void)
10031 if (current_switch == NULL && current_loop == NULL) {
10032 errorf(HERE, "break statement not within loop or switch");
10035 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
10038 expect(';', end_error);
10045 * Parse a __leave statement.
10047 static statement_t *parse_leave_statement(void)
10049 if (current_try == NULL) {
10050 errorf(HERE, "__leave statement not within __try");
10053 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
10056 expect(';', end_error);
10063 * Check if a given entity represents a local variable.
10065 static bool is_local_variable(const entity_t *entity)
10067 if (entity->kind != ENTITY_VARIABLE)
10070 switch ((storage_class_tag_t) entity->declaration.storage_class) {
10071 case STORAGE_CLASS_AUTO:
10072 case STORAGE_CLASS_REGISTER: {
10073 const type_t *type = skip_typeref(entity->declaration.type);
10074 if (is_type_function(type)) {
10086 * Check if a given expression represents a local variable.
10088 static bool expression_is_local_variable(const expression_t *expression)
10090 if (expression->base.kind != EXPR_REFERENCE) {
10093 const entity_t *entity = expression->reference.entity;
10094 return is_local_variable(entity);
10098 * Check if a given expression represents a local variable and
10099 * return its declaration then, else return NULL.
10101 entity_t *expression_is_variable(const expression_t *expression)
10103 if (expression->base.kind != EXPR_REFERENCE) {
10106 entity_t *entity = expression->reference.entity;
10107 if (entity->kind != ENTITY_VARIABLE)
10114 * Parse a return statement.
10116 static statement_t *parse_return(void)
10120 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
10122 expression_t *return_value = NULL;
10123 if (token.type != ';') {
10124 return_value = parse_expression();
10125 mark_vars_read(return_value, NULL);
10128 const type_t *const func_type = skip_typeref(current_function->base.type);
10129 assert(is_type_function(func_type));
10130 type_t *const return_type = skip_typeref(func_type->function.return_type);
10132 source_position_t const *const pos = &statement->base.source_position;
10133 if (return_value != NULL) {
10134 type_t *return_value_type = skip_typeref(return_value->base.type);
10136 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
10137 if (is_type_atomic(return_value_type, ATOMIC_TYPE_VOID)) {
10138 /* ISO/IEC 14882:1998(E) §6.6.3:2 */
10139 /* Only warn in C mode, because GCC does the same */
10140 if (c_mode & _CXX || strict_mode) {
10142 "'return' with a value, in function returning 'void'");
10143 } else if (warning.other) {
10145 "'return' with a value, in function returning 'void'");
10147 } else if (!(c_mode & _CXX)) { /* ISO/IEC 14882:1998(E) §6.6.3:3 */
10148 /* Only warn in C mode, because GCC does the same */
10151 "'return' with expression in function returning 'void'");
10152 } else if (warning.other) {
10154 "'return' with expression in function returning 'void'");
10158 assign_error_t error = semantic_assign(return_type, return_value);
10159 report_assign_error(error, return_type, return_value, "'return'",
10162 return_value = create_implicit_cast(return_value, return_type);
10163 /* check for returning address of a local var */
10164 if (warning.other && return_value != NULL
10165 && return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
10166 const expression_t *expression = return_value->unary.value;
10167 if (expression_is_local_variable(expression)) {
10168 warningf(pos, "function returns address of local variable");
10171 } else if (warning.other && !is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
10172 /* ISO/IEC 14882:1998(E) §6.6.3:3 */
10173 if (c_mode & _CXX || strict_mode) {
10175 "'return' without value, in function returning non-void");
10178 "'return' without value, in function returning non-void");
10181 statement->returns.value = return_value;
10183 expect(';', end_error);
10190 * Parse a declaration statement.
10192 static statement_t *parse_declaration_statement(void)
10194 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
10196 entity_t *before = current_scope->last_entity;
10198 parse_external_declaration();
10200 parse_declaration(record_entity, DECL_FLAGS_NONE);
10203 declaration_statement_t *const decl = &statement->declaration;
10204 entity_t *const begin =
10205 before != NULL ? before->base.next : current_scope->entities;
10206 decl->declarations_begin = begin;
10207 decl->declarations_end = begin != NULL ? current_scope->last_entity : NULL;
10213 * Parse an expression statement, ie. expr ';'.
10215 static statement_t *parse_expression_statement(void)
10217 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10219 expression_t *const expr = parse_expression();
10220 statement->expression.expression = expr;
10221 mark_vars_read(expr, ENT_ANY);
10223 expect(';', end_error);
10230 * Parse a microsoft __try { } __finally { } or
10231 * __try{ } __except() { }
10233 static statement_t *parse_ms_try_statment(void)
10235 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
10238 PUSH_PARENT(statement);
10240 ms_try_statement_t *rem = current_try;
10241 current_try = &statement->ms_try;
10242 statement->ms_try.try_statement = parse_compound_statement(false);
10247 if (token.type == T___except) {
10249 expect('(', end_error);
10250 add_anchor_token(')');
10251 expression_t *const expr = parse_expression();
10252 mark_vars_read(expr, NULL);
10253 type_t * type = skip_typeref(expr->base.type);
10254 if (is_type_integer(type)) {
10255 type = promote_integer(type);
10256 } else if (is_type_valid(type)) {
10257 errorf(&expr->base.source_position,
10258 "__expect expression is not an integer, but '%T'", type);
10259 type = type_error_type;
10261 statement->ms_try.except_expression = create_implicit_cast(expr, type);
10262 rem_anchor_token(')');
10263 expect(')', end_error);
10264 statement->ms_try.final_statement = parse_compound_statement(false);
10265 } else if (token.type == T__finally) {
10267 statement->ms_try.final_statement = parse_compound_statement(false);
10269 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
10270 return create_invalid_statement();
10274 return create_invalid_statement();
10277 static statement_t *parse_empty_statement(void)
10279 if (warning.empty_statement) {
10280 warningf(HERE, "statement is empty");
10282 statement_t *const statement = create_empty_statement();
10287 static statement_t *parse_local_label_declaration(void)
10289 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
10293 entity_t *begin = NULL, *end = NULL;
10296 if (token.type != T_IDENTIFIER) {
10297 parse_error_expected("while parsing local label declaration",
10298 T_IDENTIFIER, NULL);
10301 symbol_t *symbol = token.v.symbol;
10302 entity_t *entity = get_entity(symbol, NAMESPACE_LABEL);
10303 if (entity != NULL && entity->base.parent_scope == current_scope) {
10304 errorf(HERE, "multiple definitions of '__label__ %Y' (previous definition %P)",
10305 symbol, &entity->base.source_position);
10307 entity = allocate_entity_zero(ENTITY_LOCAL_LABEL);
10309 entity->base.parent_scope = current_scope;
10310 entity->base.namespc = NAMESPACE_LABEL;
10311 entity->base.source_position = token.source_position;
10312 entity->base.symbol = symbol;
10315 end->base.next = entity;
10320 environment_push(entity);
10324 if (token.type != ',')
10330 statement->declaration.declarations_begin = begin;
10331 statement->declaration.declarations_end = end;
10335 static void parse_namespace_definition(void)
10339 entity_t *entity = NULL;
10340 symbol_t *symbol = NULL;
10342 if (token.type == T_IDENTIFIER) {
10343 symbol = token.v.symbol;
10346 entity = get_entity(symbol, NAMESPACE_NORMAL);
10347 if (entity != NULL &&
10348 entity->kind != ENTITY_NAMESPACE &&
10349 entity->base.parent_scope == current_scope) {
10350 if (!is_error_entity(entity)) {
10351 error_redefined_as_different_kind(&token.source_position,
10352 entity, ENTITY_NAMESPACE);
10358 if (entity == NULL) {
10359 entity = allocate_entity_zero(ENTITY_NAMESPACE);
10360 entity->base.symbol = symbol;
10361 entity->base.source_position = token.source_position;
10362 entity->base.namespc = NAMESPACE_NORMAL;
10363 entity->base.parent_scope = current_scope;
10366 if (token.type == '=') {
10367 /* TODO: parse namespace alias */
10368 panic("namespace alias definition not supported yet");
10371 environment_push(entity);
10372 append_entity(current_scope, entity);
10374 size_t const top = environment_top();
10375 scope_t *old_scope = scope_push(&entity->namespacee.members);
10377 expect('{', end_error);
10379 expect('}', end_error);
10382 assert(current_scope == &entity->namespacee.members);
10383 scope_pop(old_scope);
10384 environment_pop_to(top);
10388 * Parse a statement.
10389 * There's also parse_statement() which additionally checks for
10390 * "statement has no effect" warnings
10392 static statement_t *intern_parse_statement(void)
10394 statement_t *statement = NULL;
10396 /* declaration or statement */
10397 add_anchor_token(';');
10398 switch (token.type) {
10399 case T_IDENTIFIER: {
10400 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
10401 if (la1_type == ':') {
10402 statement = parse_label_statement();
10403 } else if (is_typedef_symbol(token.v.symbol)) {
10404 statement = parse_declaration_statement();
10406 /* it's an identifier, the grammar says this must be an
10407 * expression statement. However it is common that users mistype
10408 * declaration types, so we guess a bit here to improve robustness
10409 * for incorrect programs */
10410 switch (la1_type) {
10413 if (get_entity(token.v.symbol, NAMESPACE_NORMAL) != NULL)
10414 goto expression_statment;
10419 statement = parse_declaration_statement();
10423 expression_statment:
10424 statement = parse_expression_statement();
10431 case T___extension__:
10432 /* This can be a prefix to a declaration or an expression statement.
10433 * We simply eat it now and parse the rest with tail recursion. */
10436 } while (token.type == T___extension__);
10437 bool old_gcc_extension = in_gcc_extension;
10438 in_gcc_extension = true;
10439 statement = intern_parse_statement();
10440 in_gcc_extension = old_gcc_extension;
10444 statement = parse_declaration_statement();
10448 statement = parse_local_label_declaration();
10451 case ';': statement = parse_empty_statement(); break;
10452 case '{': statement = parse_compound_statement(false); break;
10453 case T___leave: statement = parse_leave_statement(); break;
10454 case T___try: statement = parse_ms_try_statment(); break;
10455 case T_asm: statement = parse_asm_statement(); break;
10456 case T_break: statement = parse_break(); break;
10457 case T_case: statement = parse_case_statement(); break;
10458 case T_continue: statement = parse_continue(); break;
10459 case T_default: statement = parse_default_statement(); break;
10460 case T_do: statement = parse_do(); break;
10461 case T_for: statement = parse_for(); break;
10462 case T_goto: statement = parse_goto(); break;
10463 case T_if: statement = parse_if(); break;
10464 case T_return: statement = parse_return(); break;
10465 case T_switch: statement = parse_switch(); break;
10466 case T_while: statement = parse_while(); break;
10469 statement = parse_expression_statement();
10473 errorf(HERE, "unexpected token %K while parsing statement", &token);
10474 statement = create_invalid_statement();
10479 rem_anchor_token(';');
10481 assert(statement != NULL
10482 && statement->base.source_position.input_name != NULL);
10488 * parse a statement and emits "statement has no effect" warning if needed
10489 * (This is really a wrapper around intern_parse_statement with check for 1
10490 * single warning. It is needed, because for statement expressions we have
10491 * to avoid the warning on the last statement)
10493 static statement_t *parse_statement(void)
10495 statement_t *statement = intern_parse_statement();
10497 if (statement->kind == STATEMENT_EXPRESSION && warning.unused_value) {
10498 expression_t *expression = statement->expression.expression;
10499 if (!expression_has_effect(expression)) {
10500 warningf(&expression->base.source_position,
10501 "statement has no effect");
10509 * Parse a compound statement.
10511 static statement_t *parse_compound_statement(bool inside_expression_statement)
10513 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
10515 PUSH_PARENT(statement);
10518 add_anchor_token('}');
10519 /* tokens, which can start a statement */
10520 /* TODO MS, __builtin_FOO */
10521 add_anchor_token('!');
10522 add_anchor_token('&');
10523 add_anchor_token('(');
10524 add_anchor_token('*');
10525 add_anchor_token('+');
10526 add_anchor_token('-');
10527 add_anchor_token('{');
10528 add_anchor_token('~');
10529 add_anchor_token(T_CHARACTER_CONSTANT);
10530 add_anchor_token(T_COLONCOLON);
10531 add_anchor_token(T_FLOATINGPOINT);
10532 add_anchor_token(T_IDENTIFIER);
10533 add_anchor_token(T_INTEGER);
10534 add_anchor_token(T_MINUSMINUS);
10535 add_anchor_token(T_PLUSPLUS);
10536 add_anchor_token(T_STRING_LITERAL);
10537 add_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10538 add_anchor_token(T_WIDE_STRING_LITERAL);
10539 add_anchor_token(T__Bool);
10540 add_anchor_token(T__Complex);
10541 add_anchor_token(T__Imaginary);
10542 add_anchor_token(T___FUNCTION__);
10543 add_anchor_token(T___PRETTY_FUNCTION__);
10544 add_anchor_token(T___alignof__);
10545 add_anchor_token(T___attribute__);
10546 add_anchor_token(T___builtin_va_start);
10547 add_anchor_token(T___extension__);
10548 add_anchor_token(T___func__);
10549 add_anchor_token(T___imag__);
10550 add_anchor_token(T___label__);
10551 add_anchor_token(T___real__);
10552 add_anchor_token(T___thread);
10553 add_anchor_token(T_asm);
10554 add_anchor_token(T_auto);
10555 add_anchor_token(T_bool);
10556 add_anchor_token(T_break);
10557 add_anchor_token(T_case);
10558 add_anchor_token(T_char);
10559 add_anchor_token(T_class);
10560 add_anchor_token(T_const);
10561 add_anchor_token(T_const_cast);
10562 add_anchor_token(T_continue);
10563 add_anchor_token(T_default);
10564 add_anchor_token(T_delete);
10565 add_anchor_token(T_double);
10566 add_anchor_token(T_do);
10567 add_anchor_token(T_dynamic_cast);
10568 add_anchor_token(T_enum);
10569 add_anchor_token(T_extern);
10570 add_anchor_token(T_false);
10571 add_anchor_token(T_float);
10572 add_anchor_token(T_for);
10573 add_anchor_token(T_goto);
10574 add_anchor_token(T_if);
10575 add_anchor_token(T_inline);
10576 add_anchor_token(T_int);
10577 add_anchor_token(T_long);
10578 add_anchor_token(T_new);
10579 add_anchor_token(T_operator);
10580 add_anchor_token(T_register);
10581 add_anchor_token(T_reinterpret_cast);
10582 add_anchor_token(T_restrict);
10583 add_anchor_token(T_return);
10584 add_anchor_token(T_short);
10585 add_anchor_token(T_signed);
10586 add_anchor_token(T_sizeof);
10587 add_anchor_token(T_static);
10588 add_anchor_token(T_static_cast);
10589 add_anchor_token(T_struct);
10590 add_anchor_token(T_switch);
10591 add_anchor_token(T_template);
10592 add_anchor_token(T_this);
10593 add_anchor_token(T_throw);
10594 add_anchor_token(T_true);
10595 add_anchor_token(T_try);
10596 add_anchor_token(T_typedef);
10597 add_anchor_token(T_typeid);
10598 add_anchor_token(T_typename);
10599 add_anchor_token(T_typeof);
10600 add_anchor_token(T_union);
10601 add_anchor_token(T_unsigned);
10602 add_anchor_token(T_using);
10603 add_anchor_token(T_void);
10604 add_anchor_token(T_volatile);
10605 add_anchor_token(T_wchar_t);
10606 add_anchor_token(T_while);
10608 size_t const top = environment_top();
10609 scope_t *old_scope = scope_push(&statement->compound.scope);
10611 statement_t **anchor = &statement->compound.statements;
10612 bool only_decls_so_far = true;
10613 while (token.type != '}') {
10614 if (token.type == T_EOF) {
10615 errorf(&statement->base.source_position,
10616 "EOF while parsing compound statement");
10619 statement_t *sub_statement = intern_parse_statement();
10620 if (is_invalid_statement(sub_statement)) {
10621 /* an error occurred. if we are at an anchor, return */
10627 if (warning.declaration_after_statement) {
10628 if (sub_statement->kind != STATEMENT_DECLARATION) {
10629 only_decls_so_far = false;
10630 } else if (!only_decls_so_far) {
10631 warningf(&sub_statement->base.source_position,
10632 "ISO C90 forbids mixed declarations and code");
10636 *anchor = sub_statement;
10638 while (sub_statement->base.next != NULL)
10639 sub_statement = sub_statement->base.next;
10641 anchor = &sub_statement->base.next;
10645 /* look over all statements again to produce no effect warnings */
10646 if (warning.unused_value) {
10647 statement_t *sub_statement = statement->compound.statements;
10648 for (; sub_statement != NULL; sub_statement = sub_statement->base.next) {
10649 if (sub_statement->kind != STATEMENT_EXPRESSION)
10651 /* don't emit a warning for the last expression in an expression
10652 * statement as it has always an effect */
10653 if (inside_expression_statement && sub_statement->base.next == NULL)
10656 expression_t *expression = sub_statement->expression.expression;
10657 if (!expression_has_effect(expression)) {
10658 warningf(&expression->base.source_position,
10659 "statement has no effect");
10665 rem_anchor_token(T_while);
10666 rem_anchor_token(T_wchar_t);
10667 rem_anchor_token(T_volatile);
10668 rem_anchor_token(T_void);
10669 rem_anchor_token(T_using);
10670 rem_anchor_token(T_unsigned);
10671 rem_anchor_token(T_union);
10672 rem_anchor_token(T_typeof);
10673 rem_anchor_token(T_typename);
10674 rem_anchor_token(T_typeid);
10675 rem_anchor_token(T_typedef);
10676 rem_anchor_token(T_try);
10677 rem_anchor_token(T_true);
10678 rem_anchor_token(T_throw);
10679 rem_anchor_token(T_this);
10680 rem_anchor_token(T_template);
10681 rem_anchor_token(T_switch);
10682 rem_anchor_token(T_struct);
10683 rem_anchor_token(T_static_cast);
10684 rem_anchor_token(T_static);
10685 rem_anchor_token(T_sizeof);
10686 rem_anchor_token(T_signed);
10687 rem_anchor_token(T_short);
10688 rem_anchor_token(T_return);
10689 rem_anchor_token(T_restrict);
10690 rem_anchor_token(T_reinterpret_cast);
10691 rem_anchor_token(T_register);
10692 rem_anchor_token(T_operator);
10693 rem_anchor_token(T_new);
10694 rem_anchor_token(T_long);
10695 rem_anchor_token(T_int);
10696 rem_anchor_token(T_inline);
10697 rem_anchor_token(T_if);
10698 rem_anchor_token(T_goto);
10699 rem_anchor_token(T_for);
10700 rem_anchor_token(T_float);
10701 rem_anchor_token(T_false);
10702 rem_anchor_token(T_extern);
10703 rem_anchor_token(T_enum);
10704 rem_anchor_token(T_dynamic_cast);
10705 rem_anchor_token(T_do);
10706 rem_anchor_token(T_double);
10707 rem_anchor_token(T_delete);
10708 rem_anchor_token(T_default);
10709 rem_anchor_token(T_continue);
10710 rem_anchor_token(T_const_cast);
10711 rem_anchor_token(T_const);
10712 rem_anchor_token(T_class);
10713 rem_anchor_token(T_char);
10714 rem_anchor_token(T_case);
10715 rem_anchor_token(T_break);
10716 rem_anchor_token(T_bool);
10717 rem_anchor_token(T_auto);
10718 rem_anchor_token(T_asm);
10719 rem_anchor_token(T___thread);
10720 rem_anchor_token(T___real__);
10721 rem_anchor_token(T___label__);
10722 rem_anchor_token(T___imag__);
10723 rem_anchor_token(T___func__);
10724 rem_anchor_token(T___extension__);
10725 rem_anchor_token(T___builtin_va_start);
10726 rem_anchor_token(T___attribute__);
10727 rem_anchor_token(T___alignof__);
10728 rem_anchor_token(T___PRETTY_FUNCTION__);
10729 rem_anchor_token(T___FUNCTION__);
10730 rem_anchor_token(T__Imaginary);
10731 rem_anchor_token(T__Complex);
10732 rem_anchor_token(T__Bool);
10733 rem_anchor_token(T_WIDE_STRING_LITERAL);
10734 rem_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10735 rem_anchor_token(T_STRING_LITERAL);
10736 rem_anchor_token(T_PLUSPLUS);
10737 rem_anchor_token(T_MINUSMINUS);
10738 rem_anchor_token(T_INTEGER);
10739 rem_anchor_token(T_IDENTIFIER);
10740 rem_anchor_token(T_FLOATINGPOINT);
10741 rem_anchor_token(T_COLONCOLON);
10742 rem_anchor_token(T_CHARACTER_CONSTANT);
10743 rem_anchor_token('~');
10744 rem_anchor_token('{');
10745 rem_anchor_token('-');
10746 rem_anchor_token('+');
10747 rem_anchor_token('*');
10748 rem_anchor_token('(');
10749 rem_anchor_token('&');
10750 rem_anchor_token('!');
10751 rem_anchor_token('}');
10752 assert(current_scope == &statement->compound.scope);
10753 scope_pop(old_scope);
10754 environment_pop_to(top);
10761 * Check for unused global static functions and variables
10763 static void check_unused_globals(void)
10765 if (!warning.unused_function && !warning.unused_variable)
10768 for (const entity_t *entity = file_scope->entities; entity != NULL;
10769 entity = entity->base.next) {
10770 if (!is_declaration(entity))
10773 const declaration_t *declaration = &entity->declaration;
10774 if (declaration->used ||
10775 declaration->modifiers & DM_UNUSED ||
10776 declaration->modifiers & DM_USED ||
10777 declaration->storage_class != STORAGE_CLASS_STATIC)
10780 type_t *const type = declaration->type;
10782 if (entity->kind == ENTITY_FUNCTION) {
10783 /* inhibit warning for static inline functions */
10784 if (entity->function.is_inline)
10787 s = entity->function.statement != NULL ? "defined" : "declared";
10792 warningf(&declaration->base.source_position, "'%#T' %s but not used",
10793 type, declaration->base.symbol, s);
10797 static void parse_global_asm(void)
10799 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
10802 expect('(', end_error);
10804 statement->asms.asm_text = parse_string_literals();
10805 statement->base.next = unit->global_asm;
10806 unit->global_asm = statement;
10808 expect(')', end_error);
10809 expect(';', end_error);
10814 static void parse_linkage_specification(void)
10817 assert(token.type == T_STRING_LITERAL);
10819 const char *linkage = parse_string_literals().begin;
10821 linkage_kind_t old_linkage = current_linkage;
10822 linkage_kind_t new_linkage;
10823 if (strcmp(linkage, "C") == 0) {
10824 new_linkage = LINKAGE_C;
10825 } else if (strcmp(linkage, "C++") == 0) {
10826 new_linkage = LINKAGE_CXX;
10828 errorf(HERE, "linkage string \"%s\" not recognized", linkage);
10829 new_linkage = LINKAGE_INVALID;
10831 current_linkage = new_linkage;
10833 if (token.type == '{') {
10836 expect('}', end_error);
10842 assert(current_linkage == new_linkage);
10843 current_linkage = old_linkage;
10846 static void parse_external(void)
10848 switch (token.type) {
10849 DECLARATION_START_NO_EXTERN
10851 case T___extension__:
10852 /* tokens below are for implicit int */
10853 case '&': /* & x; -> int& x; (and error later, because C++ has no
10855 case '*': /* * x; -> int* x; */
10856 case '(': /* (x); -> int (x); */
10857 parse_external_declaration();
10861 if (look_ahead(1)->type == T_STRING_LITERAL) {
10862 parse_linkage_specification();
10864 parse_external_declaration();
10869 parse_global_asm();
10873 parse_namespace_definition();
10877 if (!strict_mode) {
10879 warningf(HERE, "stray ';' outside of function");
10886 errorf(HERE, "stray %K outside of function", &token);
10887 if (token.type == '(' || token.type == '{' || token.type == '[')
10888 eat_until_matching_token(token.type);
10894 static void parse_externals(void)
10896 add_anchor_token('}');
10897 add_anchor_token(T_EOF);
10900 unsigned char token_anchor_copy[T_LAST_TOKEN];
10901 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
10904 while (token.type != T_EOF && token.type != '}') {
10906 bool anchor_leak = false;
10907 for (int i = 0; i != T_LAST_TOKEN; ++i) {
10908 unsigned char count = token_anchor_set[i] - token_anchor_copy[i];
10910 errorf(HERE, "Leaked anchor token %k %d times", i, count);
10911 anchor_leak = true;
10914 if (in_gcc_extension) {
10915 errorf(HERE, "Leaked __extension__");
10916 anchor_leak = true;
10926 rem_anchor_token(T_EOF);
10927 rem_anchor_token('}');
10931 * Parse a translation unit.
10933 static void parse_translation_unit(void)
10935 add_anchor_token(T_EOF);
10940 if (token.type == T_EOF)
10943 errorf(HERE, "stray %K outside of function", &token);
10944 if (token.type == '(' || token.type == '{' || token.type == '[')
10945 eat_until_matching_token(token.type);
10953 * @return the translation unit or NULL if errors occurred.
10955 void start_parsing(void)
10957 environment_stack = NEW_ARR_F(stack_entry_t, 0);
10958 label_stack = NEW_ARR_F(stack_entry_t, 0);
10959 diagnostic_count = 0;
10963 type_set_output(stderr);
10964 ast_set_output(stderr);
10966 assert(unit == NULL);
10967 unit = allocate_ast_zero(sizeof(unit[0]));
10969 assert(file_scope == NULL);
10970 file_scope = &unit->scope;
10972 assert(current_scope == NULL);
10973 scope_push(&unit->scope);
10975 create_gnu_builtins();
10977 create_microsoft_intrinsics();
10980 translation_unit_t *finish_parsing(void)
10982 assert(current_scope == &unit->scope);
10985 assert(file_scope == &unit->scope);
10986 check_unused_globals();
10989 DEL_ARR_F(environment_stack);
10990 DEL_ARR_F(label_stack);
10992 translation_unit_t *result = unit;
10997 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
10998 * are given length one. */
10999 static void complete_incomplete_arrays(void)
11001 size_t n = ARR_LEN(incomplete_arrays);
11002 for (size_t i = 0; i != n; ++i) {
11003 declaration_t *const decl = incomplete_arrays[i];
11004 type_t *const orig_type = decl->type;
11005 type_t *const type = skip_typeref(orig_type);
11007 if (!is_type_incomplete(type))
11010 if (warning.other) {
11011 warningf(&decl->base.source_position,
11012 "array '%#T' assumed to have one element",
11013 orig_type, decl->base.symbol);
11016 type_t *const new_type = duplicate_type(type);
11017 new_type->array.size_constant = true;
11018 new_type->array.has_implicit_size = true;
11019 new_type->array.size = 1;
11021 type_t *const result = identify_new_type(new_type);
11023 decl->type = result;
11027 void prepare_main_collect2(entity_t *entity)
11029 // create call to __main
11030 symbol_t *symbol = symbol_table_insert("__main");
11031 entity_t *subsubmain_ent
11032 = create_implicit_function(symbol, &builtin_source_position);
11034 expression_t *ref = allocate_expression_zero(EXPR_REFERENCE);
11035 type_t *ftype = subsubmain_ent->declaration.type;
11036 ref->base.source_position = builtin_source_position;
11037 ref->base.type = make_pointer_type(ftype, TYPE_QUALIFIER_NONE);
11038 ref->reference.entity = subsubmain_ent;
11040 expression_t *call = allocate_expression_zero(EXPR_CALL);
11041 call->base.source_position = builtin_source_position;
11042 call->base.type = type_void;
11043 call->call.function = ref;
11045 statement_t *expr_statement = allocate_statement_zero(STATEMENT_EXPRESSION);
11046 expr_statement->base.source_position = builtin_source_position;
11047 expr_statement->expression.expression = call;
11049 statement_t *statement = entity->function.statement;
11050 assert(statement->kind == STATEMENT_COMPOUND);
11051 compound_statement_t *compounds = &statement->compound;
11053 expr_statement->base.next = compounds->statements;
11054 compounds->statements = expr_statement;
11059 lookahead_bufpos = 0;
11060 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
11063 current_linkage = c_mode & _CXX ? LINKAGE_CXX : LINKAGE_C;
11064 incomplete_arrays = NEW_ARR_F(declaration_t*, 0);
11065 parse_translation_unit();
11066 complete_incomplete_arrays();
11067 DEL_ARR_F(incomplete_arrays);
11068 incomplete_arrays = NULL;
11072 * create a builtin function.
11074 static entity_t *create_builtin_function(builtin_kind_t kind, const char *name, type_t *function_type)
11076 symbol_t *symbol = symbol_table_insert(name);
11077 entity_t *entity = allocate_entity_zero(ENTITY_FUNCTION);
11078 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
11079 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
11080 entity->declaration.type = function_type;
11081 entity->declaration.implicit = true;
11082 entity->base.symbol = symbol;
11083 entity->base.source_position = builtin_source_position;
11085 entity->function.btk = kind;
11087 record_entity(entity, /*is_definition=*/false);
11093 * Create predefined gnu builtins.
11095 static void create_gnu_builtins(void)
11097 #define GNU_BUILTIN(a, b) create_builtin_function(bk_gnu_builtin_##a, "__builtin_" #a, b)
11099 GNU_BUILTIN(alloca, make_function_1_type(type_void_ptr, type_size_t));
11100 GNU_BUILTIN(huge_val, make_function_0_type(type_double));
11101 GNU_BUILTIN(inf, make_function_0_type(type_double));
11102 GNU_BUILTIN(inff, make_function_0_type(type_float));
11103 GNU_BUILTIN(infl, make_function_0_type(type_long_double));
11104 GNU_BUILTIN(nan, make_function_1_type(type_double, type_char_ptr));
11105 GNU_BUILTIN(nanf, make_function_1_type(type_float, type_char_ptr));
11106 GNU_BUILTIN(nanl, make_function_1_type(type_long_double, type_char_ptr));
11107 GNU_BUILTIN(va_end, make_function_1_type(type_void, type_valist));
11108 GNU_BUILTIN(expect, make_function_2_type(type_long, type_long, type_long));
11109 GNU_BUILTIN(return_address, make_function_1_type(type_void_ptr, type_unsigned_int));
11110 GNU_BUILTIN(frame_address, make_function_1_type(type_void_ptr, type_unsigned_int));
11111 GNU_BUILTIN(ffs, make_function_1_type(type_int, type_unsigned_int));
11112 GNU_BUILTIN(clz, make_function_1_type(type_int, type_unsigned_int));
11113 GNU_BUILTIN(ctz, make_function_1_type(type_int, type_unsigned_int));
11114 GNU_BUILTIN(popcount, make_function_1_type(type_int, type_unsigned_int));
11115 GNU_BUILTIN(parity, make_function_1_type(type_int, type_unsigned_int));
11116 GNU_BUILTIN(prefetch, make_function_1_type_variadic(type_float, type_void_ptr));
11117 GNU_BUILTIN(trap, make_function_0_type_noreturn(type_void));
11123 * Create predefined MS intrinsics.
11125 static void create_microsoft_intrinsics(void)
11127 #define MS_BUILTIN(a, b) create_builtin_function(bk_ms##a, #a, b)
11129 /* intrinsics for all architectures */
11130 MS_BUILTIN(_rotl, make_function_2_type(type_unsigned_int, type_unsigned_int, type_int));
11131 MS_BUILTIN(_rotr, make_function_2_type(type_unsigned_int, type_unsigned_int, type_int));
11132 MS_BUILTIN(_rotl64, make_function_2_type(type_unsigned_int64, type_unsigned_int64, type_int));
11133 MS_BUILTIN(_rotr64, make_function_2_type(type_unsigned_int64, type_unsigned_int64, type_int));
11134 MS_BUILTIN(_byteswap_ushort, make_function_1_type(type_unsigned_short, type_unsigned_short));
11135 MS_BUILTIN(_byteswap_ulong, make_function_1_type(type_unsigned_long, type_unsigned_long));
11136 MS_BUILTIN(_byteswap_uint64, make_function_1_type(type_unsigned_int64, type_unsigned_int64));
11138 MS_BUILTIN(__debugbreak, make_function_0_type(type_void));
11139 MS_BUILTIN(_ReturnAddress, make_function_0_type(type_void_ptr));
11140 MS_BUILTIN(_AddressOfReturnAddress, make_function_0_type(type_void_ptr));
11141 MS_BUILTIN(__popcount, make_function_1_type(type_unsigned_int, type_unsigned_int));
11144 MS_BUILTIN(_enable, make_function_0_type(type_void));
11145 MS_BUILTIN(_disable, make_function_0_type(type_void));
11146 MS_BUILTIN(__inbyte, make_function_1_type(type_unsigned_char, type_unsigned_short));
11147 MS_BUILTIN(__inword, make_function_1_type(type_unsigned_short, type_unsigned_short));
11148 MS_BUILTIN(__indword, make_function_1_type(type_unsigned_long, type_unsigned_short));
11149 MS_BUILTIN(__outbyte, make_function_2_type(type_void, type_unsigned_short, type_unsigned_char));
11150 MS_BUILTIN(__outword, make_function_2_type(type_void, type_unsigned_short, type_unsigned_short));
11151 MS_BUILTIN(__outdword, make_function_2_type(type_void, type_unsigned_short, type_unsigned_long));
11152 MS_BUILTIN(__ud2, make_function_0_type_noreturn(type_void));
11153 MS_BUILTIN(_BitScanForward, make_function_2_type(type_unsigned_char, type_unsigned_long_ptr, type_unsigned_long));
11154 MS_BUILTIN(_BitScanReverse, make_function_2_type(type_unsigned_char, type_unsigned_long_ptr, type_unsigned_long));
11155 MS_BUILTIN(_InterlockedExchange, make_function_2_type(type_long, type_long_ptr, type_long));
11156 MS_BUILTIN(_InterlockedExchange64, make_function_2_type(type_int64, type_int64_ptr, type_int64));
11158 if (machine_size <= 32) {
11159 MS_BUILTIN(__readeflags, make_function_0_type(type_unsigned_int));
11160 MS_BUILTIN(__writeeflags, make_function_1_type(type_void, type_unsigned_int));
11162 MS_BUILTIN(__readeflags, make_function_0_type(type_unsigned_int64));
11163 MS_BUILTIN(__writeeflags, make_function_1_type(type_void, type_unsigned_int64));
11170 * Initialize the parser.
11172 void init_parser(void)
11174 sym_anonymous = symbol_table_insert("<anonymous>");
11176 memset(token_anchor_set, 0, sizeof(token_anchor_set));
11178 init_expression_parsers();
11179 obstack_init(&temp_obst);
11181 symbol_t *const va_list_sym = symbol_table_insert("__builtin_va_list");
11182 type_valist = create_builtin_type(va_list_sym, type_void_ptr);
11186 * Terminate the parser.
11188 void exit_parser(void)
11190 obstack_free(&temp_obst, NULL);