2 * This file is part of cparser.
3 * Copyright (C) 2007-2008 Matthias Braun <matze@braunis.de>
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License
7 * as published by the Free Software Foundation; either version 2
8 * of the License, or (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
27 #include "diagnostic.h"
28 #include "format_check.h"
34 #include "type_hash.h"
37 #include "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 const 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);
1844 if (type->kind == TYPE_BITFIELD) {
1845 type = type->bitfield.base_type;
1848 result->value.value = create_implicit_cast(expression, type);
1854 * Checks if a given expression can be used as an constant initializer.
1856 static bool is_initializer_constant(const expression_t *expression)
1858 return is_constant_expression(expression)
1859 || is_address_constant(expression);
1863 * Parses an scalar initializer.
1865 * §6.7.8.11; eat {} without warning
1867 static initializer_t *parse_scalar_initializer(type_t *type,
1868 bool must_be_constant)
1870 /* there might be extra {} hierarchies */
1872 if (token.type == '{') {
1874 warningf(HERE, "extra curly braces around scalar initializer");
1878 } while (token.type == '{');
1881 expression_t *expression = parse_assignment_expression();
1882 mark_vars_read(expression, NULL);
1883 if (must_be_constant && !is_initializer_constant(expression)) {
1884 errorf(&expression->base.source_position,
1885 "Initialisation expression '%E' is not constant",
1889 initializer_t *initializer = initializer_from_expression(type, expression);
1891 if (initializer == NULL) {
1892 errorf(&expression->base.source_position,
1893 "expression '%E' (type '%T') doesn't match expected type '%T'",
1894 expression, expression->base.type, type);
1899 bool additional_warning_displayed = false;
1900 while (braces > 0) {
1901 if (token.type == ',') {
1904 if (token.type != '}') {
1905 if (!additional_warning_displayed && warning.other) {
1906 warningf(HERE, "additional elements in scalar initializer");
1907 additional_warning_displayed = true;
1918 * An entry in the type path.
1920 typedef struct type_path_entry_t type_path_entry_t;
1921 struct type_path_entry_t {
1922 type_t *type; /**< the upper top type. restored to path->top_tye if this entry is popped. */
1924 size_t index; /**< For array types: the current index. */
1925 declaration_t *compound_entry; /**< For compound types: the current declaration. */
1930 * A type path expression a position inside compound or array types.
1932 typedef struct type_path_t type_path_t;
1933 struct type_path_t {
1934 type_path_entry_t *path; /**< An flexible array containing the current path. */
1935 type_t *top_type; /**< type of the element the path points */
1936 size_t max_index; /**< largest index in outermost array */
1940 * Prints a type path for debugging.
1942 static __attribute__((unused)) void debug_print_type_path(
1943 const type_path_t *path)
1945 size_t len = ARR_LEN(path->path);
1947 for (size_t i = 0; i < len; ++i) {
1948 const type_path_entry_t *entry = & path->path[i];
1950 type_t *type = skip_typeref(entry->type);
1951 if (is_type_compound(type)) {
1952 /* in gcc mode structs can have no members */
1953 if (entry->v.compound_entry == NULL) {
1957 fprintf(stderr, ".%s",
1958 entry->v.compound_entry->base.symbol->string);
1959 } else if (is_type_array(type)) {
1960 fprintf(stderr, "[%u]", (unsigned) entry->v.index);
1962 fprintf(stderr, "-INVALID-");
1965 if (path->top_type != NULL) {
1966 fprintf(stderr, " (");
1967 print_type(path->top_type);
1968 fprintf(stderr, ")");
1973 * Return the top type path entry, ie. in a path
1974 * (type).a.b returns the b.
1976 static type_path_entry_t *get_type_path_top(const type_path_t *path)
1978 size_t len = ARR_LEN(path->path);
1980 return &path->path[len-1];
1984 * Enlarge the type path by an (empty) element.
1986 static type_path_entry_t *append_to_type_path(type_path_t *path)
1988 size_t len = ARR_LEN(path->path);
1989 ARR_RESIZE(type_path_entry_t, path->path, len+1);
1991 type_path_entry_t *result = & path->path[len];
1992 memset(result, 0, sizeof(result[0]));
1997 * Descending into a sub-type. Enter the scope of the current top_type.
1999 static void descend_into_subtype(type_path_t *path)
2001 type_t *orig_top_type = path->top_type;
2002 type_t *top_type = skip_typeref(orig_top_type);
2004 type_path_entry_t *top = append_to_type_path(path);
2005 top->type = top_type;
2007 if (is_type_compound(top_type)) {
2008 compound_t *compound = top_type->compound.compound;
2009 entity_t *entry = compound->members.entities;
2011 if (entry != NULL) {
2012 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
2013 top->v.compound_entry = &entry->declaration;
2014 path->top_type = entry->declaration.type;
2016 path->top_type = NULL;
2018 } else if (is_type_array(top_type)) {
2020 path->top_type = top_type->array.element_type;
2022 assert(!is_type_valid(top_type));
2027 * Pop an entry from the given type path, ie. returning from
2028 * (type).a.b to (type).a
2030 static void ascend_from_subtype(type_path_t *path)
2032 type_path_entry_t *top = get_type_path_top(path);
2034 path->top_type = top->type;
2036 size_t len = ARR_LEN(path->path);
2037 ARR_RESIZE(type_path_entry_t, path->path, len-1);
2041 * Pop entries from the given type path until the given
2042 * path level is reached.
2044 static void ascend_to(type_path_t *path, size_t top_path_level)
2046 size_t len = ARR_LEN(path->path);
2048 while (len > top_path_level) {
2049 ascend_from_subtype(path);
2050 len = ARR_LEN(path->path);
2054 static bool walk_designator(type_path_t *path, const designator_t *designator,
2055 bool used_in_offsetof)
2057 for (; designator != NULL; designator = designator->next) {
2058 type_path_entry_t *top = get_type_path_top(path);
2059 type_t *orig_type = top->type;
2061 type_t *type = skip_typeref(orig_type);
2063 if (designator->symbol != NULL) {
2064 symbol_t *symbol = designator->symbol;
2065 if (!is_type_compound(type)) {
2066 if (is_type_valid(type)) {
2067 errorf(&designator->source_position,
2068 "'.%Y' designator used for non-compound type '%T'",
2072 top->type = type_error_type;
2073 top->v.compound_entry = NULL;
2074 orig_type = type_error_type;
2076 compound_t *compound = type->compound.compound;
2077 entity_t *iter = compound->members.entities;
2078 for (; iter != NULL; iter = iter->base.next) {
2079 if (iter->base.symbol == symbol) {
2084 errorf(&designator->source_position,
2085 "'%T' has no member named '%Y'", orig_type, symbol);
2088 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
2089 if (used_in_offsetof) {
2090 type_t *real_type = skip_typeref(iter->declaration.type);
2091 if (real_type->kind == TYPE_BITFIELD) {
2092 errorf(&designator->source_position,
2093 "offsetof designator '%Y' may not specify bitfield",
2099 top->type = orig_type;
2100 top->v.compound_entry = &iter->declaration;
2101 orig_type = iter->declaration.type;
2104 expression_t *array_index = designator->array_index;
2105 assert(designator->array_index != NULL);
2107 if (!is_type_array(type)) {
2108 if (is_type_valid(type)) {
2109 errorf(&designator->source_position,
2110 "[%E] designator used for non-array type '%T'",
2111 array_index, orig_type);
2116 long index = fold_constant_to_int(array_index);
2117 if (!used_in_offsetof) {
2119 errorf(&designator->source_position,
2120 "array index [%E] must be positive", array_index);
2121 } else if (type->array.size_constant) {
2122 long array_size = type->array.size;
2123 if (index >= array_size) {
2124 errorf(&designator->source_position,
2125 "designator [%E] (%d) exceeds array size %d",
2126 array_index, index, array_size);
2131 top->type = orig_type;
2132 top->v.index = (size_t) index;
2133 orig_type = type->array.element_type;
2135 path->top_type = orig_type;
2137 if (designator->next != NULL) {
2138 descend_into_subtype(path);
2147 static void advance_current_object(type_path_t *path, size_t top_path_level)
2149 type_path_entry_t *top = get_type_path_top(path);
2151 type_t *type = skip_typeref(top->type);
2152 if (is_type_union(type)) {
2153 /* in unions only the first element is initialized */
2154 top->v.compound_entry = NULL;
2155 } else if (is_type_struct(type)) {
2156 declaration_t *entry = top->v.compound_entry;
2158 entity_t *next_entity = entry->base.next;
2159 if (next_entity != NULL) {
2160 assert(is_declaration(next_entity));
2161 entry = &next_entity->declaration;
2166 top->v.compound_entry = entry;
2167 if (entry != NULL) {
2168 path->top_type = entry->type;
2171 } else if (is_type_array(type)) {
2172 assert(is_type_array(type));
2176 if (!type->array.size_constant || top->v.index < type->array.size) {
2180 assert(!is_type_valid(type));
2184 /* we're past the last member of the current sub-aggregate, try if we
2185 * can ascend in the type hierarchy and continue with another subobject */
2186 size_t len = ARR_LEN(path->path);
2188 if (len > top_path_level) {
2189 ascend_from_subtype(path);
2190 advance_current_object(path, top_path_level);
2192 path->top_type = NULL;
2197 * skip any {...} blocks until a closing bracket is reached.
2199 static void skip_initializers(void)
2201 if (token.type == '{')
2204 while (token.type != '}') {
2205 if (token.type == T_EOF)
2207 if (token.type == '{') {
2215 static initializer_t *create_empty_initializer(void)
2217 static initializer_t empty_initializer
2218 = { .list = { { INITIALIZER_LIST }, 0 } };
2219 return &empty_initializer;
2223 * Parse a part of an initialiser for a struct or union,
2225 static initializer_t *parse_sub_initializer(type_path_t *path,
2226 type_t *outer_type, size_t top_path_level,
2227 parse_initializer_env_t *env)
2229 if (token.type == '}') {
2230 /* empty initializer */
2231 return create_empty_initializer();
2234 type_t *orig_type = path->top_type;
2235 type_t *type = NULL;
2237 if (orig_type == NULL) {
2238 /* We are initializing an empty compound. */
2240 type = skip_typeref(orig_type);
2243 initializer_t **initializers = NEW_ARR_F(initializer_t*, 0);
2246 designator_t *designator = NULL;
2247 if (token.type == '.' || token.type == '[') {
2248 designator = parse_designation();
2249 goto finish_designator;
2250 } else if (token.type == T_IDENTIFIER && look_ahead(1)->type == ':') {
2251 /* GNU-style designator ("identifier: value") */
2252 designator = allocate_ast_zero(sizeof(designator[0]));
2253 designator->source_position = token.source_position;
2254 designator->symbol = token.v.symbol;
2259 /* reset path to toplevel, evaluate designator from there */
2260 ascend_to(path, top_path_level);
2261 if (!walk_designator(path, designator, false)) {
2262 /* can't continue after designation error */
2266 initializer_t *designator_initializer
2267 = allocate_initializer_zero(INITIALIZER_DESIGNATOR);
2268 designator_initializer->designator.designator = designator;
2269 ARR_APP1(initializer_t*, initializers, designator_initializer);
2271 orig_type = path->top_type;
2272 type = orig_type != NULL ? skip_typeref(orig_type) : NULL;
2277 if (token.type == '{') {
2278 if (type != NULL && is_type_scalar(type)) {
2279 sub = parse_scalar_initializer(type, env->must_be_constant);
2283 if (env->entity != NULL) {
2285 "extra brace group at end of initializer for '%Y'",
2286 env->entity->base.symbol);
2288 errorf(HERE, "extra brace group at end of initializer");
2291 descend_into_subtype(path);
2293 add_anchor_token('}');
2294 sub = parse_sub_initializer(path, orig_type, top_path_level+1,
2296 rem_anchor_token('}');
2299 ascend_from_subtype(path);
2300 expect('}', end_error);
2302 expect('}', end_error);
2303 goto error_parse_next;
2307 /* must be an expression */
2308 expression_t *expression = parse_assignment_expression();
2309 mark_vars_read(expression, NULL);
2311 if (env->must_be_constant && !is_initializer_constant(expression)) {
2312 errorf(&expression->base.source_position,
2313 "Initialisation expression '%E' is not constant",
2318 /* we are already outside, ... */
2319 type_t *const outer_type_skip = skip_typeref(outer_type);
2320 if (is_type_compound(outer_type_skip) &&
2321 !outer_type_skip->compound.compound->complete) {
2322 goto error_parse_next;
2327 /* handle { "string" } special case */
2328 if ((expression->kind == EXPR_STRING_LITERAL
2329 || expression->kind == EXPR_WIDE_STRING_LITERAL)
2330 && outer_type != NULL) {
2331 sub = initializer_from_expression(outer_type, expression);
2333 if (token.type == ',') {
2336 if (token.type != '}' && warning.other) {
2337 warningf(HERE, "excessive elements in initializer for type '%T'",
2340 /* TODO: eat , ... */
2345 /* descend into subtypes until expression matches type */
2347 orig_type = path->top_type;
2348 type = skip_typeref(orig_type);
2350 sub = initializer_from_expression(orig_type, expression);
2354 if (!is_type_valid(type)) {
2357 if (is_type_scalar(type)) {
2358 errorf(&expression->base.source_position,
2359 "expression '%E' doesn't match expected type '%T'",
2360 expression, orig_type);
2364 descend_into_subtype(path);
2368 /* update largest index of top array */
2369 const type_path_entry_t *first = &path->path[0];
2370 type_t *first_type = first->type;
2371 first_type = skip_typeref(first_type);
2372 if (is_type_array(first_type)) {
2373 size_t index = first->v.index;
2374 if (index > path->max_index)
2375 path->max_index = index;
2379 /* append to initializers list */
2380 ARR_APP1(initializer_t*, initializers, sub);
2383 if (warning.other) {
2384 if (env->entity != NULL) {
2385 warningf(HERE, "excess elements in struct initializer for '%Y'",
2386 env->entity->base.symbol);
2388 warningf(HERE, "excess elements in struct initializer");
2394 if (token.type == '}') {
2397 expect(',', end_error);
2398 if (token.type == '}') {
2403 /* advance to the next declaration if we are not at the end */
2404 advance_current_object(path, top_path_level);
2405 orig_type = path->top_type;
2406 if (orig_type != NULL)
2407 type = skip_typeref(orig_type);
2413 size_t len = ARR_LEN(initializers);
2414 size_t size = sizeof(initializer_list_t) + len * sizeof(initializers[0]);
2415 initializer_t *result = allocate_ast_zero(size);
2416 result->kind = INITIALIZER_LIST;
2417 result->list.len = len;
2418 memcpy(&result->list.initializers, initializers,
2419 len * sizeof(initializers[0]));
2421 DEL_ARR_F(initializers);
2422 ascend_to(path, top_path_level+1);
2427 skip_initializers();
2428 DEL_ARR_F(initializers);
2429 ascend_to(path, top_path_level+1);
2434 * Parses an initializer. Parsers either a compound literal
2435 * (env->declaration == NULL) or an initializer of a declaration.
2437 static initializer_t *parse_initializer(parse_initializer_env_t *env)
2439 type_t *type = skip_typeref(env->type);
2440 size_t max_index = 0xdeadbeaf; // TODO: Resolve this uninitialized variable problem
2441 initializer_t *result;
2443 if (is_type_scalar(type)) {
2444 result = parse_scalar_initializer(type, env->must_be_constant);
2445 } else if (token.type == '{') {
2449 memset(&path, 0, sizeof(path));
2450 path.top_type = env->type;
2451 path.path = NEW_ARR_F(type_path_entry_t, 0);
2453 descend_into_subtype(&path);
2455 add_anchor_token('}');
2456 result = parse_sub_initializer(&path, env->type, 1, env);
2457 rem_anchor_token('}');
2459 max_index = path.max_index;
2460 DEL_ARR_F(path.path);
2462 expect('}', end_error);
2464 /* parse_scalar_initializer() also works in this case: we simply
2465 * have an expression without {} around it */
2466 result = parse_scalar_initializer(type, env->must_be_constant);
2469 /* §6.7.8:22 array initializers for arrays with unknown size determine
2470 * the array type size */
2471 if (is_type_array(type) && type->array.size_expression == NULL
2472 && result != NULL) {
2474 switch (result->kind) {
2475 case INITIALIZER_LIST:
2476 assert(max_index != 0xdeadbeaf);
2477 size = max_index + 1;
2480 case INITIALIZER_STRING:
2481 size = result->string.string.size;
2484 case INITIALIZER_WIDE_STRING:
2485 size = result->wide_string.string.size;
2488 case INITIALIZER_DESIGNATOR:
2489 case INITIALIZER_VALUE:
2490 /* can happen for parse errors */
2495 internal_errorf(HERE, "invalid initializer type");
2498 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
2499 cnst->base.type = type_size_t;
2500 cnst->conste.v.int_value = size;
2502 type_t *new_type = duplicate_type(type);
2504 new_type->array.size_expression = cnst;
2505 new_type->array.size_constant = true;
2506 new_type->array.has_implicit_size = true;
2507 new_type->array.size = size;
2508 env->type = new_type;
2516 static void append_entity(scope_t *scope, entity_t *entity)
2518 if (scope->last_entity != NULL) {
2519 scope->last_entity->base.next = entity;
2521 scope->entities = entity;
2523 scope->last_entity = entity;
2527 static compound_t *parse_compound_type_specifier(bool is_struct)
2535 symbol_t *symbol = NULL;
2536 compound_t *compound = NULL;
2538 if (token.type == T___attribute__) {
2539 parse_attributes(NULL);
2542 entity_kind_tag_t const kind = is_struct ? ENTITY_STRUCT : ENTITY_UNION;
2543 if (token.type == T_IDENTIFIER) {
2544 /* the compound has a name, check if we have seen it already */
2545 symbol = token.v.symbol;
2548 entity_t *entity = get_tag(symbol, kind);
2549 if (entity != NULL) {
2550 compound = &entity->compound;
2551 if (compound->base.parent_scope != current_scope &&
2552 (token.type == '{' || token.type == ';')) {
2553 /* we're in an inner scope and have a definition. Shadow
2554 * existing definition in outer scope */
2556 } else if (compound->complete && token.type == '{') {
2557 assert(symbol != NULL);
2558 errorf(HERE, "multiple definitions of '%s %Y' (previous definition %P)",
2559 is_struct ? "struct" : "union", symbol,
2560 &compound->base.source_position);
2561 /* clear members in the hope to avoid further errors */
2562 compound->members.entities = NULL;
2565 } else if (token.type != '{') {
2567 parse_error_expected("while parsing struct type specifier",
2568 T_IDENTIFIER, '{', NULL);
2570 parse_error_expected("while parsing union type specifier",
2571 T_IDENTIFIER, '{', NULL);
2577 if (compound == NULL) {
2578 entity_t *entity = allocate_entity_zero(kind);
2579 compound = &entity->compound;
2581 compound->base.namespc = NAMESPACE_TAG;
2582 compound->base.source_position = token.source_position;
2583 compound->base.symbol = symbol;
2584 compound->base.parent_scope = current_scope;
2585 if (symbol != NULL) {
2586 environment_push(entity);
2588 append_entity(current_scope, entity);
2591 if (token.type == '{') {
2592 parse_compound_type_entries(compound);
2593 parse_attributes(NULL);
2595 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2596 if (symbol == NULL) {
2597 assert(anonymous_entity == NULL);
2598 anonymous_entity = (entity_t*)compound;
2605 static void parse_enum_entries(type_t *const enum_type)
2609 if (token.type == '}') {
2610 errorf(HERE, "empty enum not allowed");
2615 add_anchor_token('}');
2617 if (token.type != T_IDENTIFIER) {
2618 parse_error_expected("while parsing enum entry", T_IDENTIFIER, NULL);
2620 rem_anchor_token('}');
2624 entity_t *entity = allocate_entity_zero(ENTITY_ENUM_VALUE);
2625 entity->enum_value.enum_type = enum_type;
2626 entity->base.symbol = token.v.symbol;
2627 entity->base.source_position = token.source_position;
2630 if (token.type == '=') {
2632 expression_t *value = parse_constant_expression();
2634 value = create_implicit_cast(value, enum_type);
2635 entity->enum_value.value = value;
2640 record_entity(entity, false);
2642 if (token.type != ',')
2645 } while (token.type != '}');
2646 rem_anchor_token('}');
2648 expect('}', end_error);
2654 static type_t *parse_enum_specifier(void)
2660 if (token.type == T_IDENTIFIER) {
2661 symbol = token.v.symbol;
2664 entity = get_tag(symbol, ENTITY_ENUM);
2665 if (entity != NULL) {
2666 if (entity->base.parent_scope != current_scope &&
2667 (token.type == '{' || token.type == ';')) {
2668 /* we're in an inner scope and have a definition. Shadow
2669 * existing definition in outer scope */
2671 } else if (entity->enume.complete && token.type == '{') {
2672 errorf(HERE, "multiple definitions of 'enum %Y' (previous definition %P)",
2673 symbol, &entity->base.source_position);
2676 } else if (token.type != '{') {
2677 parse_error_expected("while parsing enum type specifier",
2678 T_IDENTIFIER, '{', NULL);
2685 if (entity == NULL) {
2686 entity = allocate_entity_zero(ENTITY_ENUM);
2687 entity->base.namespc = NAMESPACE_TAG;
2688 entity->base.source_position = token.source_position;
2689 entity->base.symbol = symbol;
2690 entity->base.parent_scope = current_scope;
2693 type_t *const type = allocate_type_zero(TYPE_ENUM);
2694 type->enumt.enume = &entity->enume;
2695 type->enumt.akind = ATOMIC_TYPE_INT;
2697 if (token.type == '{') {
2698 if (symbol != NULL) {
2699 environment_push(entity);
2701 append_entity(current_scope, entity);
2702 entity->enume.complete = true;
2704 parse_enum_entries(type);
2705 parse_attributes(NULL);
2707 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2708 if (symbol == NULL) {
2709 assert(anonymous_entity == NULL);
2710 anonymous_entity = entity;
2712 } else if (!entity->enume.complete && !(c_mode & _GNUC)) {
2713 errorf(HERE, "'enum %Y' used before definition (incomplete enums are a GNU extension)",
2721 * if a symbol is a typedef to another type, return true
2723 static bool is_typedef_symbol(symbol_t *symbol)
2725 const entity_t *const entity = get_entity(symbol, NAMESPACE_NORMAL);
2726 return entity != NULL && entity->kind == ENTITY_TYPEDEF;
2729 static type_t *parse_typeof(void)
2735 expect('(', end_error);
2736 add_anchor_token(')');
2738 expression_t *expression = NULL;
2740 bool old_type_prop = in_type_prop;
2741 bool old_gcc_extension = in_gcc_extension;
2742 in_type_prop = true;
2744 while (token.type == T___extension__) {
2745 /* This can be a prefix to a typename or an expression. */
2747 in_gcc_extension = true;
2749 switch (token.type) {
2751 if (is_typedef_symbol(token.v.symbol)) {
2752 type = parse_typename();
2754 expression = parse_expression();
2755 type = revert_automatic_type_conversion(expression);
2760 type = parse_typename();
2764 expression = parse_expression();
2765 type = expression->base.type;
2768 in_type_prop = old_type_prop;
2769 in_gcc_extension = old_gcc_extension;
2771 rem_anchor_token(')');
2772 expect(')', end_error);
2774 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF);
2775 typeof_type->typeoft.expression = expression;
2776 typeof_type->typeoft.typeof_type = type;
2783 typedef enum specifiers_t {
2784 SPECIFIER_SIGNED = 1 << 0,
2785 SPECIFIER_UNSIGNED = 1 << 1,
2786 SPECIFIER_LONG = 1 << 2,
2787 SPECIFIER_INT = 1 << 3,
2788 SPECIFIER_DOUBLE = 1 << 4,
2789 SPECIFIER_CHAR = 1 << 5,
2790 SPECIFIER_WCHAR_T = 1 << 6,
2791 SPECIFIER_SHORT = 1 << 7,
2792 SPECIFIER_LONG_LONG = 1 << 8,
2793 SPECIFIER_FLOAT = 1 << 9,
2794 SPECIFIER_BOOL = 1 << 10,
2795 SPECIFIER_VOID = 1 << 11,
2796 SPECIFIER_INT8 = 1 << 12,
2797 SPECIFIER_INT16 = 1 << 13,
2798 SPECIFIER_INT32 = 1 << 14,
2799 SPECIFIER_INT64 = 1 << 15,
2800 SPECIFIER_INT128 = 1 << 16,
2801 SPECIFIER_COMPLEX = 1 << 17,
2802 SPECIFIER_IMAGINARY = 1 << 18,
2805 static type_t *create_builtin_type(symbol_t *const symbol,
2806 type_t *const real_type)
2808 type_t *type = allocate_type_zero(TYPE_BUILTIN);
2809 type->builtin.symbol = symbol;
2810 type->builtin.real_type = real_type;
2811 return identify_new_type(type);
2814 static type_t *get_typedef_type(symbol_t *symbol)
2816 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
2817 if (entity == NULL || entity->kind != ENTITY_TYPEDEF)
2820 type_t *type = allocate_type_zero(TYPE_TYPEDEF);
2821 type->typedeft.typedefe = &entity->typedefe;
2826 static attribute_t *parse_attribute_ms_property(attribute_t *attribute)
2828 expect('(', end_error);
2830 attribute_property_argument_t *property
2831 = allocate_ast_zero(sizeof(*property));
2834 if (token.type != T_IDENTIFIER) {
2835 parse_error_expected("while parsing property declspec",
2836 T_IDENTIFIER, NULL);
2841 symbol_t *symbol = token.v.symbol;
2843 if (strcmp(symbol->string, "put") == 0) {
2845 } else if (strcmp(symbol->string, "get") == 0) {
2848 errorf(HERE, "expected put or get in property declspec");
2851 expect('=', end_error);
2852 if (token.type != T_IDENTIFIER) {
2853 parse_error_expected("while parsing property declspec",
2854 T_IDENTIFIER, NULL);
2858 property->put_symbol = token.v.symbol;
2860 property->get_symbol = token.v.symbol;
2863 if (token.type == ')')
2865 expect(',', end_error);
2868 attribute->a.property = property;
2870 expect(')', end_error);
2876 static attribute_t *parse_microsoft_extended_decl_modifier_single(void)
2878 attribute_kind_t kind = ATTRIBUTE_UNKNOWN;
2879 if (token.type == T_restrict) {
2880 kind = ATTRIBUTE_MS_RESTRICT;
2882 } else if (token.type == T_IDENTIFIER) {
2883 const char *name = token.v.symbol->string;
2885 for (attribute_kind_t k = ATTRIBUTE_MS_FIRST; k <= ATTRIBUTE_MS_LAST;
2887 const char *attribute_name = get_attribute_name(k);
2888 if (attribute_name != NULL && strcmp(attribute_name, name) == 0) {
2894 if (kind == ATTRIBUTE_UNKNOWN && warning.attribute) {
2895 warningf(HERE, "unknown __declspec '%s' ignored", name);
2898 parse_error_expected("while parsing __declspec", T_IDENTIFIER, NULL);
2902 attribute_t *attribute = allocate_attribute_zero(kind);
2904 if (kind == ATTRIBUTE_MS_PROPERTY) {
2905 return parse_attribute_ms_property(attribute);
2908 /* parse arguments */
2909 if (token.type == '(') {
2911 attribute->a.arguments = parse_attribute_arguments();
2917 static attribute_t *parse_microsoft_extended_decl_modifier(attribute_t *first)
2921 expect('(', end_error);
2923 if (token.type == ')') {
2928 add_anchor_token(')');
2930 attribute_t *last = first;
2933 while (last->next != NULL)
2937 attribute_t *attribute
2938 = parse_microsoft_extended_decl_modifier_single();
2939 if (attribute == NULL)
2945 last->next = attribute;
2949 if (token.type == ')') {
2952 expect(',', end_error);
2955 rem_anchor_token(')');
2956 expect(')', end_error);
2960 rem_anchor_token(')');
2964 static entity_t *create_error_entity(symbol_t *symbol, entity_kind_tag_t kind)
2966 entity_t *entity = allocate_entity_zero(kind);
2967 entity->base.source_position = *HERE;
2968 entity->base.symbol = symbol;
2969 if (is_declaration(entity)) {
2970 entity->declaration.type = type_error_type;
2971 entity->declaration.implicit = true;
2972 } else if (kind == ENTITY_TYPEDEF) {
2973 entity->typedefe.type = type_error_type;
2974 entity->typedefe.builtin = true;
2976 if (kind != ENTITY_COMPOUND_MEMBER)
2977 record_entity(entity, false);
2981 static entity_t *pack_bitfield_members(il_size_t *size, type_t *type,
2982 size_t offset, entity_t *first)
2984 /* TODO: packed handling */
2985 type_t *base_type = skip_typeref(type->bitfield.base_type);
2986 size_t remaining_bits = get_type_size(base_type) * BITS_PER_BYTE;
2987 size_t bit_offset = 0;
2990 for (member = first; member != NULL; member = member->base.next) {
2991 /* TODO: make this an assert */
2992 if (member->kind != ENTITY_COMPOUND_MEMBER)
2995 type_t *member_type = member->declaration.type;
2996 if (member_type->kind != TYPE_BITFIELD)
2998 if (base_type != NULL
2999 && skip_typeref(member_type->bitfield.base_type) != base_type)
3002 size_t bit_size = member_type->bitfield.bit_size;
3003 if (bit_size > remaining_bits)
3006 member->compound_member.offset = offset;
3007 member->compound_member.bit_offset = bit_offset;
3009 bit_offset += bit_size;
3011 /* 0-size members end current bucket. multiple 0-size buckets
3012 * seem to not start-end multiple buckets */
3013 if (bit_size == 0) {
3016 remaining_bits -= bit_size;
3019 assert(member != first);
3021 *size += (bit_offset + (BITS_PER_BYTE-1)) / BITS_PER_BYTE;
3027 * Finish the construction of a struct type by calculating its size, offsets,
3030 static void finish_struct_type(compound_type_t *type)
3032 assert(type->compound != NULL);
3034 compound_t *compound = type->compound;
3035 if (!compound->complete)
3040 il_alignment_t alignment = compound->alignment;
3041 bool need_pad = false;
3043 entity_t *entry = compound->members.entities;
3044 while (entry != NULL) {
3045 if (entry->kind != ENTITY_COMPOUND_MEMBER) {
3046 entry = entry->base.next;
3050 type_t *m_type = entry->declaration.type;
3051 type_t *skipped = skip_typeref(m_type);
3052 if (! is_type_valid(skipped)) {
3053 entry = entry->base.next;
3057 type_t *base_type = m_type;
3058 if (skipped->kind == TYPE_BITFIELD) {
3059 base_type = m_type->bitfield.base_type;
3062 il_alignment_t m_alignment = get_type_alignment(base_type);
3063 il_size_t m_size = get_type_size(base_type);
3064 if (m_alignment > alignment)
3065 alignment = m_alignment;
3067 offset = (size + m_alignment - 1) & -m_alignment;
3072 if (skipped->kind == TYPE_BITFIELD) {
3073 entry = pack_bitfield_members(&size, m_type, offset, entry);
3075 entry->compound_member.offset = offset;
3076 size = offset + m_size;
3078 entry = entry->base.next;
3082 offset = (size + alignment - 1) & -alignment;
3087 if (warning.padded) {
3088 warningf(&compound->base.source_position, "'%T' needs padding",
3091 } else if (compound->packed && warning.packed) {
3092 warningf(&compound->base.source_position,
3093 "superfluous packed attribute on '%T'", type);
3096 compound->size = offset;
3097 compound->alignment = alignment;
3101 * Finish the construction of an union type by calculating
3102 * its size and alignment.
3104 static void finish_union_type(compound_type_t *type)
3106 assert(type->compound != NULL);
3108 compound_t *compound = type->compound;
3109 if (! compound->complete)
3113 il_alignment_t alignment = compound->alignment;
3115 entity_t *entry = compound->members.entities;
3116 for (; entry != NULL; entry = entry->base.next) {
3117 if (entry->kind != ENTITY_COMPOUND_MEMBER)
3120 type_t *m_type = entry->declaration.type;
3121 if (! is_type_valid(skip_typeref(m_type)))
3124 entry->compound_member.offset = 0;
3125 il_size_t m_size = get_type_size(m_type);
3128 il_alignment_t m_alignment = get_type_alignment(m_type);
3129 if (m_alignment > alignment)
3130 alignment = m_alignment;
3132 size = (size + alignment - 1) & -alignment;
3134 compound->size = size;
3135 compound->alignment = alignment;
3138 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
3140 type_t *type = NULL;
3141 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3142 unsigned type_specifiers = 0;
3143 bool newtype = false;
3144 bool saw_error = false;
3145 bool old_gcc_extension = in_gcc_extension;
3147 specifiers->source_position = token.source_position;
3150 specifiers->attributes = parse_attributes(specifiers->attributes);
3152 switch (token.type) {
3154 #define MATCH_STORAGE_CLASS(token, class) \
3156 if (specifiers->storage_class != STORAGE_CLASS_NONE) { \
3157 errorf(HERE, "multiple storage classes in declaration specifiers"); \
3159 specifiers->storage_class = class; \
3160 if (specifiers->thread_local) \
3161 goto check_thread_storage_class; \
3165 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
3166 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
3167 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
3168 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
3169 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
3172 specifiers->attributes
3173 = parse_microsoft_extended_decl_modifier(specifiers->attributes);
3177 if (specifiers->thread_local) {
3178 errorf(HERE, "duplicate '__thread'");
3180 specifiers->thread_local = true;
3181 check_thread_storage_class:
3182 switch (specifiers->storage_class) {
3183 case STORAGE_CLASS_EXTERN:
3184 case STORAGE_CLASS_NONE:
3185 case STORAGE_CLASS_STATIC:
3189 case STORAGE_CLASS_AUTO: wrong = "auto"; goto wrong_thread_stoarge_class;
3190 case STORAGE_CLASS_REGISTER: wrong = "register"; goto wrong_thread_stoarge_class;
3191 case STORAGE_CLASS_TYPEDEF: wrong = "typedef"; goto wrong_thread_stoarge_class;
3192 wrong_thread_stoarge_class:
3193 errorf(HERE, "'__thread' used with '%s'", wrong);
3200 /* type qualifiers */
3201 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
3203 qualifiers |= qualifier; \
3207 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3208 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3209 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3210 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3211 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3212 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3213 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3214 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3216 case T___extension__:
3218 in_gcc_extension = true;
3221 /* type specifiers */
3222 #define MATCH_SPECIFIER(token, specifier, name) \
3224 if (type_specifiers & specifier) { \
3225 errorf(HERE, "multiple " name " type specifiers given"); \
3227 type_specifiers |= specifier; \
3232 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
3233 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
3234 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
3235 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
3236 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
3237 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
3238 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
3239 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
3240 MATCH_SPECIFIER(T_bool, SPECIFIER_BOOL, "bool");
3241 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
3242 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
3243 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
3244 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
3245 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
3246 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
3247 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
3248 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
3249 MATCH_SPECIFIER(T_wchar_t, SPECIFIER_WCHAR_T, "wchar_t");
3253 specifiers->is_inline = true;
3257 case T__forceinline:
3259 specifiers->modifiers |= DM_FORCEINLINE;
3264 if (type_specifiers & SPECIFIER_LONG_LONG) {
3265 errorf(HERE, "multiple type specifiers given");
3266 } else if (type_specifiers & SPECIFIER_LONG) {
3267 type_specifiers |= SPECIFIER_LONG_LONG;
3269 type_specifiers |= SPECIFIER_LONG;
3274 #define CHECK_DOUBLE_TYPE() \
3275 if ( type != NULL) \
3276 errorf(HERE, "multiple data types in declaration specifiers");
3279 CHECK_DOUBLE_TYPE();
3280 type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
3282 type->compound.compound = parse_compound_type_specifier(true);
3283 finish_struct_type(&type->compound);
3286 CHECK_DOUBLE_TYPE();
3287 type = allocate_type_zero(TYPE_COMPOUND_UNION);
3288 type->compound.compound = parse_compound_type_specifier(false);
3289 finish_union_type(&type->compound);
3292 CHECK_DOUBLE_TYPE();
3293 type = parse_enum_specifier();
3296 CHECK_DOUBLE_TYPE();
3297 type = parse_typeof();
3299 case T___builtin_va_list:
3300 CHECK_DOUBLE_TYPE();
3301 type = duplicate_type(type_valist);
3305 case T_IDENTIFIER: {
3306 /* only parse identifier if we haven't found a type yet */
3307 if (type != NULL || type_specifiers != 0) {
3308 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
3309 * declaration, so it doesn't generate errors about expecting '(' or
3311 switch (look_ahead(1)->type) {
3318 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
3322 errorf(HERE, "discarding stray %K in declaration specifier", &token);
3327 goto finish_specifiers;
3331 type_t *const typedef_type = get_typedef_type(token.v.symbol);
3332 if (typedef_type == NULL) {
3333 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
3334 * declaration, so it doesn't generate 'implicit int' followed by more
3335 * errors later on. */
3336 token_type_t const la1_type = (token_type_t)look_ahead(1)->type;
3342 errorf(HERE, "%K does not name a type", &token);
3345 create_error_entity(token.v.symbol, ENTITY_TYPEDEF);
3347 type = allocate_type_zero(TYPE_TYPEDEF);
3348 type->typedeft.typedefe = &entity->typedefe;
3352 if (la1_type == '&' || la1_type == '*')
3353 goto finish_specifiers;
3358 goto finish_specifiers;
3363 type = typedef_type;
3367 /* function specifier */
3369 goto finish_specifiers;
3374 specifiers->attributes = parse_attributes(specifiers->attributes);
3376 in_gcc_extension = old_gcc_extension;
3378 if (type == NULL || (saw_error && type_specifiers != 0)) {
3379 atomic_type_kind_t atomic_type;
3381 /* match valid basic types */
3382 switch (type_specifiers) {
3383 case SPECIFIER_VOID:
3384 atomic_type = ATOMIC_TYPE_VOID;
3386 case SPECIFIER_WCHAR_T:
3387 atomic_type = ATOMIC_TYPE_WCHAR_T;
3389 case SPECIFIER_CHAR:
3390 atomic_type = ATOMIC_TYPE_CHAR;
3392 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
3393 atomic_type = ATOMIC_TYPE_SCHAR;
3395 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
3396 atomic_type = ATOMIC_TYPE_UCHAR;
3398 case SPECIFIER_SHORT:
3399 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
3400 case SPECIFIER_SHORT | SPECIFIER_INT:
3401 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3402 atomic_type = ATOMIC_TYPE_SHORT;
3404 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
3405 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3406 atomic_type = ATOMIC_TYPE_USHORT;
3409 case SPECIFIER_SIGNED:
3410 case SPECIFIER_SIGNED | SPECIFIER_INT:
3411 atomic_type = ATOMIC_TYPE_INT;
3413 case SPECIFIER_UNSIGNED:
3414 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
3415 atomic_type = ATOMIC_TYPE_UINT;
3417 case SPECIFIER_LONG:
3418 case SPECIFIER_SIGNED | SPECIFIER_LONG:
3419 case SPECIFIER_LONG | SPECIFIER_INT:
3420 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3421 atomic_type = ATOMIC_TYPE_LONG;
3423 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
3424 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3425 atomic_type = ATOMIC_TYPE_ULONG;
3428 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3429 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3430 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
3431 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3433 atomic_type = ATOMIC_TYPE_LONGLONG;
3434 goto warn_about_long_long;
3436 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3437 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3439 atomic_type = ATOMIC_TYPE_ULONGLONG;
3440 warn_about_long_long:
3441 if (warning.long_long) {
3442 warningf(&specifiers->source_position,
3443 "ISO C90 does not support 'long long'");
3447 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
3448 atomic_type = unsigned_int8_type_kind;
3451 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
3452 atomic_type = unsigned_int16_type_kind;
3455 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
3456 atomic_type = unsigned_int32_type_kind;
3459 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
3460 atomic_type = unsigned_int64_type_kind;
3463 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
3464 atomic_type = unsigned_int128_type_kind;
3467 case SPECIFIER_INT8:
3468 case SPECIFIER_SIGNED | SPECIFIER_INT8:
3469 atomic_type = int8_type_kind;
3472 case SPECIFIER_INT16:
3473 case SPECIFIER_SIGNED | SPECIFIER_INT16:
3474 atomic_type = int16_type_kind;
3477 case SPECIFIER_INT32:
3478 case SPECIFIER_SIGNED | SPECIFIER_INT32:
3479 atomic_type = int32_type_kind;
3482 case SPECIFIER_INT64:
3483 case SPECIFIER_SIGNED | SPECIFIER_INT64:
3484 atomic_type = int64_type_kind;
3487 case SPECIFIER_INT128:
3488 case SPECIFIER_SIGNED | SPECIFIER_INT128:
3489 atomic_type = int128_type_kind;
3492 case SPECIFIER_FLOAT:
3493 atomic_type = ATOMIC_TYPE_FLOAT;
3495 case SPECIFIER_DOUBLE:
3496 atomic_type = ATOMIC_TYPE_DOUBLE;
3498 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
3499 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3501 case SPECIFIER_BOOL:
3502 atomic_type = ATOMIC_TYPE_BOOL;
3504 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
3505 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
3506 atomic_type = ATOMIC_TYPE_FLOAT;
3508 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3509 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3510 atomic_type = ATOMIC_TYPE_DOUBLE;
3512 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3513 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3514 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3517 /* invalid specifier combination, give an error message */
3518 if (type_specifiers == 0) {
3522 /* ISO/IEC 14882:1998(E) §C.1.5:4 */
3523 if (!(c_mode & _CXX) && !strict_mode) {
3524 if (warning.implicit_int) {
3525 warningf(HERE, "no type specifiers in declaration, using 'int'");
3527 atomic_type = ATOMIC_TYPE_INT;
3530 errorf(HERE, "no type specifiers given in declaration");
3532 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
3533 (type_specifiers & SPECIFIER_UNSIGNED)) {
3534 errorf(HERE, "signed and unsigned specifiers given");
3535 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3536 errorf(HERE, "only integer types can be signed or unsigned");
3538 errorf(HERE, "multiple datatypes in declaration");
3543 if (type_specifiers & SPECIFIER_COMPLEX) {
3544 type = allocate_type_zero(TYPE_COMPLEX);
3545 type->complex.akind = atomic_type;
3546 } else if (type_specifiers & SPECIFIER_IMAGINARY) {
3547 type = allocate_type_zero(TYPE_IMAGINARY);
3548 type->imaginary.akind = atomic_type;
3550 type = allocate_type_zero(TYPE_ATOMIC);
3551 type->atomic.akind = atomic_type;
3554 } else if (type_specifiers != 0) {
3555 errorf(HERE, "multiple datatypes in declaration");
3558 /* FIXME: check type qualifiers here */
3559 type->base.qualifiers = qualifiers;
3562 type = identify_new_type(type);
3564 type = typehash_insert(type);
3567 if (specifiers->attributes != NULL)
3568 type = handle_type_attributes(specifiers->attributes, type);
3569 specifiers->type = type;
3573 specifiers->type = type_error_type;
3577 static type_qualifiers_t parse_type_qualifiers(void)
3579 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3582 switch (token.type) {
3583 /* type qualifiers */
3584 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3585 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3586 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3587 /* microsoft extended type modifiers */
3588 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3589 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3590 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3591 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3592 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3601 * Parses an K&R identifier list
3603 static void parse_identifier_list(scope_t *scope)
3606 entity_t *entity = allocate_entity_zero(ENTITY_PARAMETER);
3607 entity->base.source_position = token.source_position;
3608 entity->base.namespc = NAMESPACE_NORMAL;
3609 entity->base.symbol = token.v.symbol;
3610 /* a K&R parameter has no type, yet */
3614 append_entity(scope, entity);
3616 if (token.type != ',') {
3620 } while (token.type == T_IDENTIFIER);
3623 static entity_t *parse_parameter(void)
3625 declaration_specifiers_t specifiers;
3626 memset(&specifiers, 0, sizeof(specifiers));
3628 parse_declaration_specifiers(&specifiers);
3630 entity_t *entity = parse_declarator(&specifiers,
3631 DECL_MAY_BE_ABSTRACT | DECL_IS_PARAMETER);
3632 anonymous_entity = NULL;
3636 static void semantic_parameter_incomplete(const entity_t *entity)
3638 assert(entity->kind == ENTITY_PARAMETER);
3640 /* §6.7.5.3:4 After adjustment, the parameters in a parameter type
3641 * list in a function declarator that is part of a
3642 * definition of that function shall not have
3643 * incomplete type. */
3644 type_t *type = skip_typeref(entity->declaration.type);
3645 if (is_type_incomplete(type)) {
3646 errorf(&entity->base.source_position,
3647 "parameter '%#T' has incomplete type",
3648 entity->declaration.type, entity->base.symbol);
3652 static bool has_parameters(void)
3654 /* func(void) is not a parameter */
3655 if (token.type == T_IDENTIFIER) {
3656 entity_t const *const entity = get_entity(token.v.symbol, NAMESPACE_NORMAL);
3659 if (entity->kind != ENTITY_TYPEDEF)
3661 if (skip_typeref(entity->typedefe.type) != type_void)
3663 } else if (token.type != T_void) {
3666 if (look_ahead(1)->type != ')')
3673 * Parses function type parameters (and optionally creates variable_t entities
3674 * for them in a scope)
3676 static void parse_parameters(function_type_t *type, scope_t *scope)
3679 add_anchor_token(')');
3680 int saved_comma_state = save_and_reset_anchor_state(',');
3682 if (token.type == T_IDENTIFIER &&
3683 !is_typedef_symbol(token.v.symbol)) {
3684 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
3685 if (la1_type == ',' || la1_type == ')') {
3686 type->kr_style_parameters = true;
3687 type->unspecified_parameters = true;
3688 parse_identifier_list(scope);
3689 goto parameters_finished;
3693 if (token.type == ')') {
3694 /* ISO/IEC 14882:1998(E) §C.1.6:1 */
3695 if (!(c_mode & _CXX))
3696 type->unspecified_parameters = true;
3697 goto parameters_finished;
3700 if (has_parameters()) {
3701 function_parameter_t **anchor = &type->parameters;
3703 switch (token.type) {
3706 type->variadic = true;
3707 goto parameters_finished;
3710 case T___extension__:
3713 entity_t *entity = parse_parameter();
3714 if (entity->kind == ENTITY_TYPEDEF) {
3715 errorf(&entity->base.source_position,
3716 "typedef not allowed as function parameter");
3719 assert(is_declaration(entity));
3721 semantic_parameter_incomplete(entity);
3723 function_parameter_t *const parameter =
3724 allocate_parameter(entity->declaration.type);
3726 if (scope != NULL) {
3727 append_entity(scope, entity);
3730 *anchor = parameter;
3731 anchor = ¶meter->next;
3736 goto parameters_finished;
3738 if (token.type != ',') {
3739 goto parameters_finished;
3746 parameters_finished:
3747 rem_anchor_token(')');
3748 expect(')', end_error);
3751 restore_anchor_state(',', saved_comma_state);
3754 typedef enum construct_type_kind_t {
3757 CONSTRUCT_REFERENCE,
3760 } construct_type_kind_t;
3762 typedef union construct_type_t construct_type_t;
3764 typedef struct construct_type_base_t {
3765 construct_type_kind_t kind;
3766 construct_type_t *next;
3767 } construct_type_base_t;
3769 typedef struct parsed_pointer_t {
3770 construct_type_base_t base;
3771 type_qualifiers_t type_qualifiers;
3772 variable_t *base_variable; /**< MS __based extension. */
3775 typedef struct parsed_reference_t {
3776 construct_type_base_t base;
3777 } parsed_reference_t;
3779 typedef struct construct_function_type_t {
3780 construct_type_base_t base;
3781 type_t *function_type;
3782 } construct_function_type_t;
3784 typedef struct parsed_array_t {
3785 construct_type_base_t base;
3786 type_qualifiers_t type_qualifiers;
3792 union construct_type_t {
3793 construct_type_kind_t kind;
3794 construct_type_base_t base;
3795 parsed_pointer_t pointer;
3796 parsed_reference_t reference;
3797 construct_function_type_t function;
3798 parsed_array_t array;
3801 static construct_type_t *parse_pointer_declarator(void)
3805 parsed_pointer_t *pointer = obstack_alloc(&temp_obst, sizeof(pointer[0]));
3806 memset(pointer, 0, sizeof(pointer[0]));
3807 pointer->base.kind = CONSTRUCT_POINTER;
3808 pointer->type_qualifiers = parse_type_qualifiers();
3809 //pointer->base_variable = base_variable;
3811 return (construct_type_t*) pointer;
3814 static construct_type_t *parse_reference_declarator(void)
3818 construct_type_t *cons = obstack_alloc(&temp_obst, sizeof(cons->reference));
3819 parsed_reference_t *reference = &cons->reference;
3820 memset(reference, 0, sizeof(*reference));
3821 cons->kind = CONSTRUCT_REFERENCE;
3826 static construct_type_t *parse_array_declarator(void)
3829 add_anchor_token(']');
3831 construct_type_t *cons = obstack_alloc(&temp_obst, sizeof(cons->array));
3832 parsed_array_t *array = &cons->array;
3833 memset(array, 0, sizeof(*array));
3834 cons->kind = CONSTRUCT_ARRAY;
3836 if (token.type == T_static) {
3837 array->is_static = true;
3841 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
3842 if (type_qualifiers != 0) {
3843 if (token.type == T_static) {
3844 array->is_static = true;
3848 array->type_qualifiers = type_qualifiers;
3850 if (token.type == '*' && look_ahead(1)->type == ']') {
3851 array->is_variable = true;
3853 } else if (token.type != ']') {
3854 expression_t *const size = parse_assignment_expression();
3856 /* §6.7.5.2:1 Array size must have integer type */
3857 type_t *const orig_type = size->base.type;
3858 type_t *const type = skip_typeref(orig_type);
3859 if (!is_type_integer(type) && is_type_valid(type)) {
3860 errorf(&size->base.source_position,
3861 "array size '%E' must have integer type but has type '%T'",
3866 mark_vars_read(size, NULL);
3869 rem_anchor_token(']');
3870 expect(']', end_error);
3876 static construct_type_t *parse_function_declarator(scope_t *scope)
3878 type_t *type = allocate_type_zero(TYPE_FUNCTION);
3879 function_type_t *ftype = &type->function;
3881 ftype->linkage = current_linkage;
3884 switch (modifiers & (DM_CDECL | DM_STDCALL | DM_FASTCALL | DM_THISCALL)) {
3885 case DM_NONE: break;
3886 case DM_CDECL: ftype->calling_convention = CC_CDECL; break;
3887 case DM_STDCALL: ftype->calling_convention = CC_STDCALL; break;
3888 case DM_FASTCALL: ftype->calling_convention = CC_FASTCALL; break;
3889 case DM_THISCALL: ftype->calling_convention = CC_THISCALL; break;
3892 errorf(HERE, "multiple calling conventions in declaration");
3897 parse_parameters(ftype, scope);
3899 construct_type_t *cons = obstack_alloc(&temp_obst, sizeof(cons->function));
3900 construct_function_type_t *function = &cons->function;
3901 memset(function, 0, sizeof(*function));
3902 cons->kind = CONSTRUCT_FUNCTION;
3903 function->function_type = type;
3908 typedef struct parse_declarator_env_t {
3909 bool may_be_abstract : 1;
3910 bool must_be_abstract : 1;
3911 decl_modifiers_t modifiers;
3913 source_position_t source_position;
3915 attribute_t *attributes;
3916 } parse_declarator_env_t;
3918 static construct_type_t *parse_inner_declarator(parse_declarator_env_t *env)
3920 /* construct a single linked list of construct_type_t's which describe
3921 * how to construct the final declarator type */
3922 construct_type_t *first = NULL;
3923 construct_type_t **anchor = &first;
3925 env->attributes = parse_attributes(env->attributes);
3928 construct_type_t *type;
3929 //variable_t *based = NULL; /* MS __based extension */
3930 switch (token.type) {
3932 if (!(c_mode & _CXX))
3933 errorf(HERE, "references are only available for C++");
3934 type = parse_reference_declarator();
3939 source_position_t const pos = *HERE;
3941 expect('(', end_error);
3942 add_anchor_token(')');
3943 based = parse_microsoft_based();
3944 rem_anchor_token(')');
3945 expect(')', end_error);
3946 if (token.type != '*') {
3947 if (token.type == T__based) {
3948 errorf(&pos, "__based type modifier specified more than once");
3949 } else if (warning.other) {
3951 "__based does not precede a pointer declarator, ignored");
3956 panic("based currently disabled");
3962 type = parse_pointer_declarator();
3966 goto ptr_operator_end;
3970 anchor = &type->base.next;
3972 /* TODO: find out if this is correct */
3973 env->attributes = parse_attributes(env->attributes);
3978 modifiers |= env->modifiers;
3979 env->modifiers = modifiers;
3982 construct_type_t *inner_types = NULL;
3984 switch (token.type) {
3986 if (env->must_be_abstract) {
3987 errorf(HERE, "no identifier expected in typename");
3989 env->symbol = token.v.symbol;
3990 env->source_position = token.source_position;
3995 /* §6.7.6:2 footnote 126: Empty parentheses in a type name are
3996 * interpreted as ``function with no parameter specification'', rather
3997 * than redundant parentheses around the omitted identifier. */
3998 if (look_ahead(1)->type != ')') {
4000 add_anchor_token(')');
4001 inner_types = parse_inner_declarator(env);
4002 if (inner_types != NULL) {
4003 /* All later declarators only modify the return type */
4004 env->must_be_abstract = true;
4006 rem_anchor_token(')');
4007 expect(')', end_error);
4011 if (env->may_be_abstract)
4013 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
4018 construct_type_t **const p = anchor;
4021 construct_type_t *type;
4022 switch (token.type) {
4024 scope_t *scope = NULL;
4025 if (!env->must_be_abstract) {
4026 scope = &env->parameters;
4029 type = parse_function_declarator(scope);
4033 type = parse_array_declarator();
4036 goto declarator_finished;
4039 /* insert in the middle of the list (at p) */
4040 type->base.next = *p;
4043 anchor = &type->base.next;
4046 declarator_finished:
4047 /* append inner_types at the end of the list, we don't to set anchor anymore
4048 * as it's not needed anymore */
4049 *anchor = inner_types;
4056 static type_t *construct_declarator_type(construct_type_t *construct_list, type_t *type)
4058 construct_type_t *iter = construct_list;
4059 for (; iter != NULL; iter = iter->base.next) {
4060 switch (iter->kind) {
4061 case CONSTRUCT_INVALID:
4063 case CONSTRUCT_FUNCTION: {
4064 construct_function_type_t *function = &iter->function;
4065 type_t *function_type = function->function_type;
4067 function_type->function.return_type = type;
4069 type_t *skipped_return_type = skip_typeref(type);
4071 if (is_type_function(skipped_return_type)) {
4072 errorf(HERE, "function returning function is not allowed");
4073 } else if (is_type_array(skipped_return_type)) {
4074 errorf(HERE, "function returning array is not allowed");
4076 if (skipped_return_type->base.qualifiers != 0 && warning.other) {
4078 "type qualifiers in return type of function type are meaningless");
4082 /* The function type was constructed earlier. Freeing it here will
4083 * destroy other types. */
4084 type = typehash_insert(function_type);
4088 case CONSTRUCT_POINTER: {
4089 if (is_type_reference(skip_typeref(type)))
4090 errorf(HERE, "cannot declare a pointer to reference");
4092 parsed_pointer_t *pointer = &iter->pointer;
4093 type = make_based_pointer_type(type, pointer->type_qualifiers, pointer->base_variable);
4097 case CONSTRUCT_REFERENCE:
4098 if (is_type_reference(skip_typeref(type)))
4099 errorf(HERE, "cannot declare a reference to reference");
4101 type = make_reference_type(type);
4104 case CONSTRUCT_ARRAY: {
4105 if (is_type_reference(skip_typeref(type)))
4106 errorf(HERE, "cannot declare an array of references");
4108 parsed_array_t *array = &iter->array;
4109 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
4111 expression_t *size_expression = array->size;
4112 if (size_expression != NULL) {
4114 = create_implicit_cast(size_expression, type_size_t);
4117 array_type->base.qualifiers = array->type_qualifiers;
4118 array_type->array.element_type = type;
4119 array_type->array.is_static = array->is_static;
4120 array_type->array.is_variable = array->is_variable;
4121 array_type->array.size_expression = size_expression;
4123 if (size_expression != NULL) {
4124 if (is_constant_expression(size_expression)) {
4126 = fold_constant_to_int(size_expression);
4127 array_type->array.size = size;
4128 array_type->array.size_constant = true;
4129 /* §6.7.5.2:1 If the expression is a constant expression, it shall
4130 * have a value greater than zero. */
4132 if (size < 0 || !GNU_MODE) {
4133 errorf(&size_expression->base.source_position,
4134 "size of array must be greater than zero");
4135 } else if (warning.other) {
4136 warningf(&size_expression->base.source_position,
4137 "zero length arrays are a GCC extension");
4141 array_type->array.is_vla = true;
4145 type_t *skipped_type = skip_typeref(type);
4147 if (is_type_incomplete(skipped_type)) {
4148 errorf(HERE, "array of incomplete type '%T' is not allowed", type);
4149 } else if (is_type_function(skipped_type)) {
4150 errorf(HERE, "array of functions is not allowed");
4152 type = identify_new_type(array_type);
4156 internal_errorf(HERE, "invalid type construction found");
4162 static type_t *automatic_type_conversion(type_t *orig_type);
4164 static type_t *semantic_parameter(const source_position_t *pos,
4166 const declaration_specifiers_t *specifiers,
4169 /* §6.7.5.3:7 A declaration of a parameter as ``array of type''
4170 * shall be adjusted to ``qualified pointer to type'',
4172 * §6.7.5.3:8 A declaration of a parameter as ``function returning
4173 * type'' shall be adjusted to ``pointer to function
4174 * returning type'', as in 6.3.2.1. */
4175 type = automatic_type_conversion(type);
4177 if (specifiers->is_inline && is_type_valid(type)) {
4178 errorf(pos, "parameter '%#T' declared 'inline'", type, symbol);
4181 /* §6.9.1:6 The declarations in the declaration list shall contain
4182 * no storage-class specifier other than register and no
4183 * initializations. */
4184 if (specifiers->thread_local || (
4185 specifiers->storage_class != STORAGE_CLASS_NONE &&
4186 specifiers->storage_class != STORAGE_CLASS_REGISTER)
4188 errorf(pos, "invalid storage class for parameter '%#T'", type, symbol);
4191 /* delay test for incomplete type, because we might have (void)
4192 * which is legal but incomplete... */
4197 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
4198 declarator_flags_t flags)
4200 parse_declarator_env_t env;
4201 memset(&env, 0, sizeof(env));
4202 env.may_be_abstract = (flags & DECL_MAY_BE_ABSTRACT) != 0;
4204 construct_type_t *construct_type = parse_inner_declarator(&env);
4206 construct_declarator_type(construct_type, specifiers->type);
4207 type_t *type = skip_typeref(orig_type);
4209 if (construct_type != NULL) {
4210 obstack_free(&temp_obst, construct_type);
4213 attribute_t *attributes = parse_attributes(env.attributes);
4214 /* append (shared) specifier attribute behind attributes of this
4216 if (attributes != NULL) {
4217 attribute_t *last = attributes;
4218 while (last->next != NULL)
4220 last->next = specifiers->attributes;
4222 attributes = specifiers->attributes;
4226 if (specifiers->storage_class == STORAGE_CLASS_TYPEDEF) {
4227 entity = allocate_entity_zero(ENTITY_TYPEDEF);
4228 entity->base.symbol = env.symbol;
4229 entity->base.source_position = env.source_position;
4230 entity->typedefe.type = orig_type;
4232 if (anonymous_entity != NULL) {
4233 if (is_type_compound(type)) {
4234 assert(anonymous_entity->compound.alias == NULL);
4235 assert(anonymous_entity->kind == ENTITY_STRUCT ||
4236 anonymous_entity->kind == ENTITY_UNION);
4237 anonymous_entity->compound.alias = entity;
4238 anonymous_entity = NULL;
4239 } else if (is_type_enum(type)) {
4240 assert(anonymous_entity->enume.alias == NULL);
4241 assert(anonymous_entity->kind == ENTITY_ENUM);
4242 anonymous_entity->enume.alias = entity;
4243 anonymous_entity = NULL;
4247 /* create a declaration type entity */
4248 if (flags & DECL_CREATE_COMPOUND_MEMBER) {
4249 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER);
4251 if (env.symbol != NULL) {
4252 if (specifiers->is_inline && is_type_valid(type)) {
4253 errorf(&env.source_position,
4254 "compound member '%Y' declared 'inline'", env.symbol);
4257 if (specifiers->thread_local ||
4258 specifiers->storage_class != STORAGE_CLASS_NONE) {
4259 errorf(&env.source_position,
4260 "compound member '%Y' must have no storage class",
4264 } else if (flags & DECL_IS_PARAMETER) {
4265 orig_type = semantic_parameter(&env.source_position, orig_type,
4266 specifiers, env.symbol);
4268 entity = allocate_entity_zero(ENTITY_PARAMETER);
4269 } else if (is_type_function(type)) {
4270 entity = allocate_entity_zero(ENTITY_FUNCTION);
4272 entity->function.is_inline = specifiers->is_inline;
4273 entity->function.parameters = env.parameters;
4275 if (env.symbol != NULL) {
4276 /* this needs fixes for C++ */
4277 bool in_function_scope = current_function != NULL;
4279 if (specifiers->thread_local || (
4280 specifiers->storage_class != STORAGE_CLASS_EXTERN &&
4281 specifiers->storage_class != STORAGE_CLASS_NONE &&
4282 (in_function_scope || specifiers->storage_class != STORAGE_CLASS_STATIC)
4284 errorf(&env.source_position,
4285 "invalid storage class for function '%Y'", env.symbol);
4289 entity = allocate_entity_zero(ENTITY_VARIABLE);
4291 entity->variable.thread_local = specifiers->thread_local;
4293 if (env.symbol != NULL) {
4294 if (specifiers->is_inline && is_type_valid(type)) {
4295 errorf(&env.source_position,
4296 "variable '%Y' declared 'inline'", env.symbol);
4299 bool invalid_storage_class = false;
4300 if (current_scope == file_scope) {
4301 if (specifiers->storage_class != STORAGE_CLASS_EXTERN &&
4302 specifiers->storage_class != STORAGE_CLASS_NONE &&
4303 specifiers->storage_class != STORAGE_CLASS_STATIC) {
4304 invalid_storage_class = true;
4307 if (specifiers->thread_local &&
4308 specifiers->storage_class == STORAGE_CLASS_NONE) {
4309 invalid_storage_class = true;
4312 if (invalid_storage_class) {
4313 errorf(&env.source_position,
4314 "invalid storage class for variable '%Y'", env.symbol);
4319 if (env.symbol != NULL) {
4320 entity->base.symbol = env.symbol;
4321 entity->base.source_position = env.source_position;
4323 entity->base.source_position = specifiers->source_position;
4325 entity->base.namespc = NAMESPACE_NORMAL;
4326 entity->declaration.type = orig_type;
4327 entity->declaration.alignment = get_type_alignment(orig_type);
4328 entity->declaration.modifiers = env.modifiers;
4329 entity->declaration.attributes = attributes;
4331 storage_class_t storage_class = specifiers->storage_class;
4332 entity->declaration.declared_storage_class = storage_class;
4334 if (storage_class == STORAGE_CLASS_NONE && current_scope != file_scope)
4335 storage_class = STORAGE_CLASS_AUTO;
4336 entity->declaration.storage_class = storage_class;
4339 if (attributes != NULL) {
4340 handle_entity_attributes(attributes, entity);
4346 static type_t *parse_abstract_declarator(type_t *base_type)
4348 parse_declarator_env_t env;
4349 memset(&env, 0, sizeof(env));
4350 env.may_be_abstract = true;
4351 env.must_be_abstract = true;
4353 construct_type_t *construct_type = parse_inner_declarator(&env);
4355 type_t *result = construct_declarator_type(construct_type, base_type);
4356 if (construct_type != NULL) {
4357 obstack_free(&temp_obst, construct_type);
4359 result = handle_type_attributes(env.attributes, result);
4365 * Check if the declaration of main is suspicious. main should be a
4366 * function with external linkage, returning int, taking either zero
4367 * arguments, two, or three arguments of appropriate types, ie.
4369 * int main([ int argc, char **argv [, char **env ] ]).
4371 * @param decl the declaration to check
4372 * @param type the function type of the declaration
4374 static void check_type_of_main(const entity_t *entity)
4376 const source_position_t *pos = &entity->base.source_position;
4377 if (entity->kind != ENTITY_FUNCTION) {
4378 warningf(pos, "'main' is not a function");
4382 if (entity->declaration.storage_class == STORAGE_CLASS_STATIC) {
4383 warningf(pos, "'main' is normally a non-static function");
4386 type_t *type = skip_typeref(entity->declaration.type);
4387 assert(is_type_function(type));
4389 function_type_t *func_type = &type->function;
4390 if (!types_compatible(skip_typeref(func_type->return_type), type_int)) {
4391 warningf(pos, "return type of 'main' should be 'int', but is '%T'",
4392 func_type->return_type);
4394 const function_parameter_t *parm = func_type->parameters;
4396 type_t *const first_type = parm->type;
4397 if (!types_compatible(skip_typeref(first_type), type_int)) {
4399 "first argument of 'main' should be 'int', but is '%T'",
4404 type_t *const second_type = parm->type;
4405 if (!types_compatible(skip_typeref(second_type), type_char_ptr_ptr)) {
4406 warningf(pos, "second argument of 'main' should be 'char**', but is '%T'", second_type);
4410 type_t *const third_type = parm->type;
4411 if (!types_compatible(skip_typeref(third_type), type_char_ptr_ptr)) {
4412 warningf(pos, "third argument of 'main' should be 'char**', but is '%T'", third_type);
4416 goto warn_arg_count;
4420 warningf(pos, "'main' takes only zero, two or three arguments");
4426 * Check if a symbol is the equal to "main".
4428 static bool is_sym_main(const symbol_t *const sym)
4430 return strcmp(sym->string, "main") == 0;
4433 static void error_redefined_as_different_kind(const source_position_t *pos,
4434 const entity_t *old, entity_kind_t new_kind)
4436 errorf(pos, "redeclaration of %s '%Y' as %s (declared %P)",
4437 get_entity_kind_name(old->kind), old->base.symbol,
4438 get_entity_kind_name(new_kind), &old->base.source_position);
4441 static bool is_error_entity(entity_t *const ent)
4443 if (is_declaration(ent)) {
4444 return is_type_valid(skip_typeref(ent->declaration.type));
4445 } else if (ent->kind == ENTITY_TYPEDEF) {
4446 return is_type_valid(skip_typeref(ent->typedefe.type));
4452 * record entities for the NAMESPACE_NORMAL, and produce error messages/warnings
4453 * for various problems that occur for multiple definitions
4455 static entity_t *record_entity(entity_t *entity, const bool is_definition)
4457 const symbol_t *const symbol = entity->base.symbol;
4458 const namespace_tag_t namespc = (namespace_tag_t)entity->base.namespc;
4459 const source_position_t *pos = &entity->base.source_position;
4461 /* can happen in error cases */
4465 entity_t *const previous_entity = get_entity(symbol, namespc);
4466 /* pushing the same entity twice will break the stack structure */
4467 assert(previous_entity != entity);
4469 if (entity->kind == ENTITY_FUNCTION) {
4470 type_t *const orig_type = entity->declaration.type;
4471 type_t *const type = skip_typeref(orig_type);
4473 assert(is_type_function(type));
4474 if (type->function.unspecified_parameters &&
4475 warning.strict_prototypes &&
4476 previous_entity == NULL) {
4477 warningf(pos, "function declaration '%#T' is not a prototype",
4481 if (warning.main && current_scope == file_scope
4482 && is_sym_main(symbol)) {
4483 check_type_of_main(entity);
4487 if (is_declaration(entity) &&
4488 warning.nested_externs &&
4489 entity->declaration.storage_class == STORAGE_CLASS_EXTERN &&
4490 current_scope != file_scope) {
4491 warningf(pos, "nested extern declaration of '%#T'",
4492 entity->declaration.type, symbol);
4495 if (previous_entity != NULL) {
4496 if (previous_entity->base.parent_scope == ¤t_function->parameters &&
4497 previous_entity->base.parent_scope->depth + 1 == current_scope->depth) {
4498 assert(previous_entity->kind == ENTITY_PARAMETER);
4500 "declaration '%#T' redeclares the parameter '%#T' (declared %P)",
4501 entity->declaration.type, symbol,
4502 previous_entity->declaration.type, symbol,
4503 &previous_entity->base.source_position);
4507 if (previous_entity->base.parent_scope == current_scope) {
4508 if (previous_entity->kind != entity->kind) {
4509 if (!is_error_entity(previous_entity) && !is_error_entity(entity)) {
4510 error_redefined_as_different_kind(pos, previous_entity,
4515 if (previous_entity->kind == ENTITY_ENUM_VALUE) {
4516 errorf(pos, "redeclaration of enum entry '%Y' (declared %P)",
4517 symbol, &previous_entity->base.source_position);
4520 if (previous_entity->kind == ENTITY_TYPEDEF) {
4521 /* TODO: C++ allows this for exactly the same type */
4522 errorf(pos, "redefinition of typedef '%Y' (declared %P)",
4523 symbol, &previous_entity->base.source_position);
4527 /* at this point we should have only VARIABLES or FUNCTIONS */
4528 assert(is_declaration(previous_entity) && is_declaration(entity));
4530 declaration_t *const prev_decl = &previous_entity->declaration;
4531 declaration_t *const decl = &entity->declaration;
4533 /* can happen for K&R style declarations */
4534 if (prev_decl->type == NULL &&
4535 previous_entity->kind == ENTITY_PARAMETER &&
4536 entity->kind == ENTITY_PARAMETER) {
4537 prev_decl->type = decl->type;
4538 prev_decl->storage_class = decl->storage_class;
4539 prev_decl->declared_storage_class = decl->declared_storage_class;
4540 prev_decl->modifiers = decl->modifiers;
4541 return previous_entity;
4544 type_t *const orig_type = decl->type;
4545 assert(orig_type != NULL);
4546 type_t *const type = skip_typeref(orig_type);
4547 type_t *const prev_type = skip_typeref(prev_decl->type);
4549 if (!types_compatible(type, prev_type)) {
4551 "declaration '%#T' is incompatible with '%#T' (declared %P)",
4552 orig_type, symbol, prev_decl->type, symbol,
4553 &previous_entity->base.source_position);
4555 unsigned old_storage_class = prev_decl->storage_class;
4556 if (warning.redundant_decls &&
4559 !(prev_decl->modifiers & DM_USED) &&
4560 prev_decl->storage_class == STORAGE_CLASS_STATIC) {
4561 warningf(&previous_entity->base.source_position,
4562 "unnecessary static forward declaration for '%#T'",
4563 prev_decl->type, symbol);
4566 storage_class_t new_storage_class = decl->storage_class;
4568 /* pretend no storage class means extern for function
4569 * declarations (except if the previous declaration is neither
4570 * none nor extern) */
4571 if (entity->kind == ENTITY_FUNCTION) {
4572 /* the previous declaration could have unspecified parameters or
4573 * be a typedef, so use the new type */
4574 if (prev_type->function.unspecified_parameters || is_definition)
4575 prev_decl->type = type;
4577 switch (old_storage_class) {
4578 case STORAGE_CLASS_NONE:
4579 old_storage_class = STORAGE_CLASS_EXTERN;
4582 case STORAGE_CLASS_EXTERN:
4583 if (is_definition) {
4584 if (warning.missing_prototypes &&
4585 prev_type->function.unspecified_parameters &&
4586 !is_sym_main(symbol)) {
4587 warningf(pos, "no previous prototype for '%#T'",
4590 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4591 new_storage_class = STORAGE_CLASS_EXTERN;
4598 } else if (is_type_incomplete(prev_type)) {
4599 prev_decl->type = type;
4602 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4603 new_storage_class == STORAGE_CLASS_EXTERN) {
4604 warn_redundant_declaration:
4605 if (!is_definition &&
4606 warning.redundant_decls &&
4607 is_type_valid(prev_type) &&
4608 strcmp(previous_entity->base.source_position.input_name,
4609 "<builtin>") != 0) {
4611 "redundant declaration for '%Y' (declared %P)",
4612 symbol, &previous_entity->base.source_position);
4614 } else if (current_function == NULL) {
4615 if (old_storage_class != STORAGE_CLASS_STATIC &&
4616 new_storage_class == STORAGE_CLASS_STATIC) {
4618 "static declaration of '%Y' follows non-static declaration (declared %P)",
4619 symbol, &previous_entity->base.source_position);
4620 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4621 prev_decl->storage_class = STORAGE_CLASS_NONE;
4622 prev_decl->declared_storage_class = STORAGE_CLASS_NONE;
4624 /* ISO/IEC 14882:1998(E) §C.1.2:1 */
4626 goto error_redeclaration;
4627 goto warn_redundant_declaration;
4629 } else if (is_type_valid(prev_type)) {
4630 if (old_storage_class == new_storage_class) {
4631 error_redeclaration:
4632 errorf(pos, "redeclaration of '%Y' (declared %P)",
4633 symbol, &previous_entity->base.source_position);
4636 "redeclaration of '%Y' with different linkage (declared %P)",
4637 symbol, &previous_entity->base.source_position);
4642 prev_decl->modifiers |= decl->modifiers;
4643 if (entity->kind == ENTITY_FUNCTION) {
4644 previous_entity->function.is_inline |= entity->function.is_inline;
4646 return previous_entity;
4649 if (warning.shadow) {
4650 warningf(pos, "%s '%Y' shadows %s (declared %P)",
4651 get_entity_kind_name(entity->kind), symbol,
4652 get_entity_kind_name(previous_entity->kind),
4653 &previous_entity->base.source_position);
4657 if (entity->kind == ENTITY_FUNCTION) {
4658 if (is_definition &&
4659 entity->declaration.storage_class != STORAGE_CLASS_STATIC) {
4660 if (warning.missing_prototypes && !is_sym_main(symbol)) {
4661 warningf(pos, "no previous prototype for '%#T'",
4662 entity->declaration.type, symbol);
4663 } else if (warning.missing_declarations && !is_sym_main(symbol)) {
4664 warningf(pos, "no previous declaration for '%#T'",
4665 entity->declaration.type, symbol);
4668 } else if (warning.missing_declarations &&
4669 entity->kind == ENTITY_VARIABLE &&
4670 current_scope == file_scope) {
4671 declaration_t *declaration = &entity->declaration;
4672 if (declaration->storage_class == STORAGE_CLASS_NONE) {
4673 warningf(pos, "no previous declaration for '%#T'",
4674 declaration->type, symbol);
4679 assert(entity->base.parent_scope == NULL);
4680 assert(current_scope != NULL);
4682 entity->base.parent_scope = current_scope;
4683 entity->base.namespc = NAMESPACE_NORMAL;
4684 environment_push(entity);
4685 append_entity(current_scope, entity);
4690 static void parser_error_multiple_definition(entity_t *entity,
4691 const source_position_t *source_position)
4693 errorf(source_position, "multiple definition of '%Y' (declared %P)",
4694 entity->base.symbol, &entity->base.source_position);
4697 static bool is_declaration_specifier(const token_t *token,
4698 bool only_specifiers_qualifiers)
4700 switch (token->type) {
4705 return is_typedef_symbol(token->v.symbol);
4707 case T___extension__:
4709 return !only_specifiers_qualifiers;
4716 static void parse_init_declarator_rest(entity_t *entity)
4718 assert(is_declaration(entity));
4719 declaration_t *const declaration = &entity->declaration;
4723 type_t *orig_type = declaration->type;
4724 type_t *type = skip_typeref(orig_type);
4726 if (entity->kind == ENTITY_VARIABLE
4727 && entity->variable.initializer != NULL) {
4728 parser_error_multiple_definition(entity, HERE);
4731 bool must_be_constant = false;
4732 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
4733 entity->base.parent_scope == file_scope) {
4734 must_be_constant = true;
4737 if (is_type_function(type)) {
4738 errorf(&entity->base.source_position,
4739 "function '%#T' is initialized like a variable",
4740 orig_type, entity->base.symbol);
4741 orig_type = type_error_type;
4744 parse_initializer_env_t env;
4745 env.type = orig_type;
4746 env.must_be_constant = must_be_constant;
4747 env.entity = entity;
4748 current_init_decl = entity;
4750 initializer_t *initializer = parse_initializer(&env);
4751 current_init_decl = NULL;
4753 if (entity->kind == ENTITY_VARIABLE) {
4754 /* §6.7.5:22 array initializers for arrays with unknown size
4755 * determine the array type size */
4756 declaration->type = env.type;
4757 entity->variable.initializer = initializer;
4761 /* parse rest of a declaration without any declarator */
4762 static void parse_anonymous_declaration_rest(
4763 const declaration_specifiers_t *specifiers)
4766 anonymous_entity = NULL;
4768 if (warning.other) {
4769 if (specifiers->storage_class != STORAGE_CLASS_NONE ||
4770 specifiers->thread_local) {
4771 warningf(&specifiers->source_position,
4772 "useless storage class in empty declaration");
4775 type_t *type = specifiers->type;
4776 switch (type->kind) {
4777 case TYPE_COMPOUND_STRUCT:
4778 case TYPE_COMPOUND_UNION: {
4779 if (type->compound.compound->base.symbol == NULL) {
4780 warningf(&specifiers->source_position,
4781 "unnamed struct/union that defines no instances");
4790 warningf(&specifiers->source_position, "empty declaration");
4796 static void check_variable_type_complete(entity_t *ent)
4798 if (ent->kind != ENTITY_VARIABLE)
4801 /* §6.7:7 If an identifier for an object is declared with no linkage, the
4802 * type for the object shall be complete [...] */
4803 declaration_t *decl = &ent->declaration;
4804 if (decl->storage_class == STORAGE_CLASS_EXTERN ||
4805 decl->storage_class == STORAGE_CLASS_STATIC)
4808 type_t *const orig_type = decl->type;
4809 type_t *const type = skip_typeref(orig_type);
4810 if (!is_type_incomplete(type))
4813 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
4814 * are given length one. */
4815 if (is_type_array(type) && ent->base.parent_scope == file_scope) {
4816 ARR_APP1(declaration_t*, incomplete_arrays, decl);
4820 errorf(&ent->base.source_position, "variable '%#T' has incomplete type",
4821 orig_type, ent->base.symbol);
4825 static void parse_declaration_rest(entity_t *ndeclaration,
4826 const declaration_specifiers_t *specifiers,
4827 parsed_declaration_func finished_declaration,
4828 declarator_flags_t flags)
4830 add_anchor_token(';');
4831 add_anchor_token(',');
4833 entity_t *entity = finished_declaration(ndeclaration, token.type == '=');
4835 if (token.type == '=') {
4836 parse_init_declarator_rest(entity);
4837 } else if (entity->kind == ENTITY_VARIABLE) {
4838 /* ISO/IEC 14882:1998(E) §8.5.3:3 The initializer can be omitted
4839 * [...] where the extern specifier is explicitly used. */
4840 declaration_t *decl = &entity->declaration;
4841 if (decl->storage_class != STORAGE_CLASS_EXTERN) {
4842 type_t *type = decl->type;
4843 if (is_type_reference(skip_typeref(type))) {
4844 errorf(&entity->base.source_position,
4845 "reference '%#T' must be initialized",
4846 type, entity->base.symbol);
4851 check_variable_type_complete(entity);
4853 if (token.type != ',')
4857 add_anchor_token('=');
4858 ndeclaration = parse_declarator(specifiers, flags);
4859 rem_anchor_token('=');
4861 expect(';', end_error);
4864 anonymous_entity = NULL;
4865 rem_anchor_token(';');
4866 rem_anchor_token(',');
4869 static entity_t *finished_kr_declaration(entity_t *entity, bool is_definition)
4871 symbol_t *symbol = entity->base.symbol;
4872 if (symbol == NULL) {
4873 errorf(HERE, "anonymous declaration not valid as function parameter");
4877 assert(entity->base.namespc == NAMESPACE_NORMAL);
4878 entity_t *previous_entity = get_entity(symbol, NAMESPACE_NORMAL);
4879 if (previous_entity == NULL
4880 || previous_entity->base.parent_scope != current_scope) {
4881 errorf(HERE, "expected declaration of a function parameter, found '%Y'",
4886 if (is_definition) {
4887 errorf(HERE, "parameter '%Y' is initialised", entity->base.symbol);
4890 return record_entity(entity, false);
4893 static void parse_declaration(parsed_declaration_func finished_declaration,
4894 declarator_flags_t flags)
4896 declaration_specifiers_t specifiers;
4897 memset(&specifiers, 0, sizeof(specifiers));
4899 add_anchor_token(';');
4900 parse_declaration_specifiers(&specifiers);
4901 rem_anchor_token(';');
4903 if (token.type == ';') {
4904 parse_anonymous_declaration_rest(&specifiers);
4906 entity_t *entity = parse_declarator(&specifiers, flags);
4907 parse_declaration_rest(entity, &specifiers, finished_declaration, flags);
4912 static type_t *get_default_promoted_type(type_t *orig_type)
4914 type_t *result = orig_type;
4916 type_t *type = skip_typeref(orig_type);
4917 if (is_type_integer(type)) {
4918 result = promote_integer(type);
4919 } else if (is_type_atomic(type, ATOMIC_TYPE_FLOAT)) {
4920 result = type_double;
4926 static void parse_kr_declaration_list(entity_t *entity)
4928 if (entity->kind != ENTITY_FUNCTION)
4931 type_t *type = skip_typeref(entity->declaration.type);
4932 assert(is_type_function(type));
4933 if (!type->function.kr_style_parameters)
4937 add_anchor_token('{');
4939 /* push function parameters */
4940 size_t const top = environment_top();
4941 scope_t *old_scope = scope_push(&entity->function.parameters);
4943 entity_t *parameter = entity->function.parameters.entities;
4944 for ( ; parameter != NULL; parameter = parameter->base.next) {
4945 assert(parameter->base.parent_scope == NULL);
4946 parameter->base.parent_scope = current_scope;
4947 environment_push(parameter);
4950 /* parse declaration list */
4952 switch (token.type) {
4954 case T___extension__:
4955 /* This covers symbols, which are no type, too, and results in
4956 * better error messages. The typical cases are misspelled type
4957 * names and missing includes. */
4959 parse_declaration(finished_kr_declaration, DECL_IS_PARAMETER);
4967 /* pop function parameters */
4968 assert(current_scope == &entity->function.parameters);
4969 scope_pop(old_scope);
4970 environment_pop_to(top);
4972 /* update function type */
4973 type_t *new_type = duplicate_type(type);
4975 function_parameter_t *parameters = NULL;
4976 function_parameter_t **anchor = ¶meters;
4978 parameter = entity->function.parameters.entities;
4979 for (; parameter != NULL; parameter = parameter->base.next) {
4980 if (parameter->kind != ENTITY_PARAMETER)
4983 type_t *parameter_type = parameter->declaration.type;
4984 if (parameter_type == NULL) {
4986 errorf(HERE, "no type specified for function parameter '%Y'",
4987 parameter->base.symbol);
4988 parameter_type = type_error_type;
4990 if (warning.implicit_int) {
4991 warningf(HERE, "no type specified for function parameter '%Y', using 'int'",
4992 parameter->base.symbol);
4994 parameter_type = type_int;
4996 parameter->declaration.type = parameter_type;
4999 semantic_parameter_incomplete(parameter);
5002 * we need the default promoted types for the function type
5004 parameter_type = get_default_promoted_type(parameter_type);
5006 function_parameter_t *const parameter =
5007 allocate_parameter(parameter_type);
5009 *anchor = parameter;
5010 anchor = ¶meter->next;
5013 /* §6.9.1.7: A K&R style parameter list does NOT act as a function
5015 new_type->function.parameters = parameters;
5016 new_type->function.unspecified_parameters = true;
5018 new_type = identify_new_type(new_type);
5020 entity->declaration.type = new_type;
5022 rem_anchor_token('{');
5025 static bool first_err = true;
5028 * When called with first_err set, prints the name of the current function,
5031 static void print_in_function(void)
5035 diagnosticf("%s: In function '%Y':\n",
5036 current_function->base.base.source_position.input_name,
5037 current_function->base.base.symbol);
5042 * Check if all labels are defined in the current function.
5043 * Check if all labels are used in the current function.
5045 static void check_labels(void)
5047 for (const goto_statement_t *goto_statement = goto_first;
5048 goto_statement != NULL;
5049 goto_statement = goto_statement->next) {
5050 /* skip computed gotos */
5051 if (goto_statement->expression != NULL)
5054 label_t *label = goto_statement->label;
5057 if (label->base.source_position.input_name == NULL) {
5058 print_in_function();
5059 errorf(&goto_statement->base.source_position,
5060 "label '%Y' used but not defined", label->base.symbol);
5064 if (warning.unused_label) {
5065 for (const label_statement_t *label_statement = label_first;
5066 label_statement != NULL;
5067 label_statement = label_statement->next) {
5068 label_t *label = label_statement->label;
5070 if (! label->used) {
5071 print_in_function();
5072 warningf(&label_statement->base.source_position,
5073 "label '%Y' defined but not used", label->base.symbol);
5079 static void warn_unused_entity(entity_t *entity, entity_t *last)
5081 entity_t const *const end = last != NULL ? last->base.next : NULL;
5082 for (; entity != end; entity = entity->base.next) {
5083 if (!is_declaration(entity))
5086 declaration_t *declaration = &entity->declaration;
5087 if (declaration->implicit)
5090 if (!declaration->used) {
5091 print_in_function();
5092 const char *what = get_entity_kind_name(entity->kind);
5093 warningf(&entity->base.source_position, "%s '%Y' is unused",
5094 what, entity->base.symbol);
5095 } else if (entity->kind == ENTITY_VARIABLE && !entity->variable.read) {
5096 print_in_function();
5097 const char *what = get_entity_kind_name(entity->kind);
5098 warningf(&entity->base.source_position, "%s '%Y' is never read",
5099 what, entity->base.symbol);
5104 static void check_unused_variables(statement_t *const stmt, void *const env)
5108 switch (stmt->kind) {
5109 case STATEMENT_DECLARATION: {
5110 declaration_statement_t const *const decls = &stmt->declaration;
5111 warn_unused_entity(decls->declarations_begin,
5112 decls->declarations_end);
5117 warn_unused_entity(stmt->fors.scope.entities, NULL);
5126 * Check declarations of current_function for unused entities.
5128 static void check_declarations(void)
5130 if (warning.unused_parameter) {
5131 const scope_t *scope = ¤t_function->parameters;
5133 /* do not issue unused warnings for main */
5134 if (!is_sym_main(current_function->base.base.symbol)) {
5135 warn_unused_entity(scope->entities, NULL);
5138 if (warning.unused_variable) {
5139 walk_statements(current_function->statement, check_unused_variables,
5144 static int determine_truth(expression_t const* const cond)
5147 !is_constant_expression(cond) ? 0 :
5148 fold_constant_to_bool(cond) ? 1 :
5152 static void check_reachable(statement_t *);
5153 static bool reaches_end;
5155 static bool expression_returns(expression_t const *const expr)
5157 switch (expr->kind) {
5159 expression_t const *const func = expr->call.function;
5160 if (func->kind == EXPR_REFERENCE) {
5161 entity_t *entity = func->reference.entity;
5162 if (entity->kind == ENTITY_FUNCTION
5163 && entity->declaration.modifiers & DM_NORETURN)
5167 if (!expression_returns(func))
5170 for (call_argument_t const* arg = expr->call.arguments; arg != NULL; arg = arg->next) {
5171 if (!expression_returns(arg->expression))
5178 case EXPR_REFERENCE:
5179 case EXPR_REFERENCE_ENUM_VALUE:
5181 case EXPR_CHARACTER_CONSTANT:
5182 case EXPR_WIDE_CHARACTER_CONSTANT:
5183 case EXPR_STRING_LITERAL:
5184 case EXPR_WIDE_STRING_LITERAL:
5185 case EXPR_COMPOUND_LITERAL: // TODO descend into initialisers
5186 case EXPR_LABEL_ADDRESS:
5187 case EXPR_CLASSIFY_TYPE:
5188 case EXPR_SIZEOF: // TODO handle obscure VLA case
5191 case EXPR_BUILTIN_CONSTANT_P:
5192 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
5197 case EXPR_STATEMENT: {
5198 bool old_reaches_end = reaches_end;
5199 reaches_end = false;
5200 check_reachable(expr->statement.statement);
5201 bool returns = reaches_end;
5202 reaches_end = old_reaches_end;
5206 case EXPR_CONDITIONAL:
5207 // TODO handle constant expression
5209 if (!expression_returns(expr->conditional.condition))
5212 if (expr->conditional.true_expression != NULL
5213 && expression_returns(expr->conditional.true_expression))
5216 return expression_returns(expr->conditional.false_expression);
5219 return expression_returns(expr->select.compound);
5221 case EXPR_ARRAY_ACCESS:
5223 expression_returns(expr->array_access.array_ref) &&
5224 expression_returns(expr->array_access.index);
5227 return expression_returns(expr->va_starte.ap);
5230 return expression_returns(expr->va_arge.ap);
5233 return expression_returns(expr->va_copye.src);
5235 EXPR_UNARY_CASES_MANDATORY
5236 return expression_returns(expr->unary.value);
5238 case EXPR_UNARY_THROW:
5242 // TODO handle constant lhs of && and ||
5244 expression_returns(expr->binary.left) &&
5245 expression_returns(expr->binary.right);
5251 panic("unhandled expression");
5254 static bool initializer_returns(initializer_t const *const init)
5256 switch (init->kind) {
5257 case INITIALIZER_VALUE:
5258 return expression_returns(init->value.value);
5260 case INITIALIZER_LIST: {
5261 initializer_t * const* i = init->list.initializers;
5262 initializer_t * const* const end = i + init->list.len;
5263 bool returns = true;
5264 for (; i != end; ++i) {
5265 if (!initializer_returns(*i))
5271 case INITIALIZER_STRING:
5272 case INITIALIZER_WIDE_STRING:
5273 case INITIALIZER_DESIGNATOR: // designators have no payload
5276 panic("unhandled initializer");
5279 static bool noreturn_candidate;
5281 static void check_reachable(statement_t *const stmt)
5283 if (stmt->base.reachable)
5285 if (stmt->kind != STATEMENT_DO_WHILE)
5286 stmt->base.reachable = true;
5288 statement_t *last = stmt;
5290 switch (stmt->kind) {
5291 case STATEMENT_INVALID:
5292 case STATEMENT_EMPTY:
5294 next = stmt->base.next;
5297 case STATEMENT_DECLARATION: {
5298 declaration_statement_t const *const decl = &stmt->declaration;
5299 entity_t const * ent = decl->declarations_begin;
5300 entity_t const *const last = decl->declarations_end;
5302 for (;; ent = ent->base.next) {
5303 if (ent->kind == ENTITY_VARIABLE &&
5304 ent->variable.initializer != NULL &&
5305 !initializer_returns(ent->variable.initializer)) {
5312 next = stmt->base.next;
5316 case STATEMENT_COMPOUND:
5317 next = stmt->compound.statements;
5319 next = stmt->base.next;
5322 case STATEMENT_RETURN: {
5323 expression_t const *const val = stmt->returns.value;
5324 if (val == NULL || expression_returns(val))
5325 noreturn_candidate = false;
5329 case STATEMENT_IF: {
5330 if_statement_t const *const ifs = &stmt->ifs;
5331 expression_t const *const cond = ifs->condition;
5333 if (!expression_returns(cond))
5336 int const val = determine_truth(cond);
5339 check_reachable(ifs->true_statement);
5344 if (ifs->false_statement != NULL) {
5345 check_reachable(ifs->false_statement);
5349 next = stmt->base.next;
5353 case STATEMENT_SWITCH: {
5354 switch_statement_t const *const switchs = &stmt->switchs;
5355 expression_t const *const expr = switchs->expression;
5357 if (!expression_returns(expr))
5360 if (is_constant_expression(expr)) {
5361 long const val = fold_constant_to_int(expr);
5362 case_label_statement_t * defaults = NULL;
5363 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5364 if (i->expression == NULL) {
5369 if (i->first_case <= val && val <= i->last_case) {
5370 check_reachable((statement_t*)i);
5375 if (defaults != NULL) {
5376 check_reachable((statement_t*)defaults);
5380 bool has_default = false;
5381 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5382 if (i->expression == NULL)
5385 check_reachable((statement_t*)i);
5392 next = stmt->base.next;
5396 case STATEMENT_EXPRESSION: {
5397 /* Check for noreturn function call */
5398 expression_t const *const expr = stmt->expression.expression;
5399 if (!expression_returns(expr))
5402 next = stmt->base.next;
5406 case STATEMENT_CONTINUE: {
5407 statement_t *parent = stmt;
5409 parent = parent->base.parent;
5410 if (parent == NULL) /* continue not within loop */
5414 switch (parent->kind) {
5415 case STATEMENT_WHILE: goto continue_while;
5416 case STATEMENT_DO_WHILE: goto continue_do_while;
5417 case STATEMENT_FOR: goto continue_for;
5424 case STATEMENT_BREAK: {
5425 statement_t *parent = stmt;
5427 parent = parent->base.parent;
5428 if (parent == NULL) /* break not within loop/switch */
5431 switch (parent->kind) {
5432 case STATEMENT_SWITCH:
5433 case STATEMENT_WHILE:
5434 case STATEMENT_DO_WHILE:
5437 next = parent->base.next;
5438 goto found_break_parent;
5447 case STATEMENT_GOTO:
5448 if (stmt->gotos.expression) {
5449 if (!expression_returns(stmt->gotos.expression))
5452 statement_t *parent = stmt->base.parent;
5453 if (parent == NULL) /* top level goto */
5457 next = stmt->gotos.label->statement;
5458 if (next == NULL) /* missing label */
5463 case STATEMENT_LABEL:
5464 next = stmt->label.statement;
5467 case STATEMENT_CASE_LABEL:
5468 next = stmt->case_label.statement;
5471 case STATEMENT_WHILE: {
5472 while_statement_t const *const whiles = &stmt->whiles;
5473 expression_t const *const cond = whiles->condition;
5475 if (!expression_returns(cond))
5478 int const val = determine_truth(cond);
5481 check_reachable(whiles->body);
5486 next = stmt->base.next;
5490 case STATEMENT_DO_WHILE:
5491 next = stmt->do_while.body;
5494 case STATEMENT_FOR: {
5495 for_statement_t *const fors = &stmt->fors;
5497 if (fors->condition_reachable)
5499 fors->condition_reachable = true;
5501 expression_t const *const cond = fors->condition;
5506 } else if (expression_returns(cond)) {
5507 val = determine_truth(cond);
5513 check_reachable(fors->body);
5518 next = stmt->base.next;
5522 case STATEMENT_MS_TRY: {
5523 ms_try_statement_t const *const ms_try = &stmt->ms_try;
5524 check_reachable(ms_try->try_statement);
5525 next = ms_try->final_statement;
5529 case STATEMENT_LEAVE: {
5530 statement_t *parent = stmt;
5532 parent = parent->base.parent;
5533 if (parent == NULL) /* __leave not within __try */
5536 if (parent->kind == STATEMENT_MS_TRY) {
5538 next = parent->ms_try.final_statement;
5546 panic("invalid statement kind");
5549 while (next == NULL) {
5550 next = last->base.parent;
5552 noreturn_candidate = false;
5554 type_t *const type = skip_typeref(current_function->base.type);
5555 assert(is_type_function(type));
5556 type_t *const ret = skip_typeref(type->function.return_type);
5557 if (warning.return_type &&
5558 !is_type_atomic(ret, ATOMIC_TYPE_VOID) &&
5559 is_type_valid(ret) &&
5560 !is_sym_main(current_function->base.base.symbol)) {
5561 warningf(&stmt->base.source_position,
5562 "control reaches end of non-void function");
5567 switch (next->kind) {
5568 case STATEMENT_INVALID:
5569 case STATEMENT_EMPTY:
5570 case STATEMENT_DECLARATION:
5571 case STATEMENT_EXPRESSION:
5573 case STATEMENT_RETURN:
5574 case STATEMENT_CONTINUE:
5575 case STATEMENT_BREAK:
5576 case STATEMENT_GOTO:
5577 case STATEMENT_LEAVE:
5578 panic("invalid control flow in function");
5580 case STATEMENT_COMPOUND:
5581 if (next->compound.stmt_expr) {
5587 case STATEMENT_SWITCH:
5588 case STATEMENT_LABEL:
5589 case STATEMENT_CASE_LABEL:
5591 next = next->base.next;
5594 case STATEMENT_WHILE: {
5596 if (next->base.reachable)
5598 next->base.reachable = true;
5600 while_statement_t const *const whiles = &next->whiles;
5601 expression_t const *const cond = whiles->condition;
5603 if (!expression_returns(cond))
5606 int const val = determine_truth(cond);
5609 check_reachable(whiles->body);
5615 next = next->base.next;
5619 case STATEMENT_DO_WHILE: {
5621 if (next->base.reachable)
5623 next->base.reachable = true;
5625 do_while_statement_t const *const dw = &next->do_while;
5626 expression_t const *const cond = dw->condition;
5628 if (!expression_returns(cond))
5631 int const val = determine_truth(cond);
5634 check_reachable(dw->body);
5640 next = next->base.next;
5644 case STATEMENT_FOR: {
5646 for_statement_t *const fors = &next->fors;
5648 fors->step_reachable = true;
5650 if (fors->condition_reachable)
5652 fors->condition_reachable = true;
5654 expression_t const *const cond = fors->condition;
5659 } else if (expression_returns(cond)) {
5660 val = determine_truth(cond);
5666 check_reachable(fors->body);
5672 next = next->base.next;
5676 case STATEMENT_MS_TRY:
5678 next = next->ms_try.final_statement;
5683 check_reachable(next);
5686 static void check_unreachable(statement_t* const stmt, void *const env)
5690 switch (stmt->kind) {
5691 case STATEMENT_DO_WHILE:
5692 if (!stmt->base.reachable) {
5693 expression_t const *const cond = stmt->do_while.condition;
5694 if (determine_truth(cond) >= 0) {
5695 warningf(&cond->base.source_position,
5696 "condition of do-while-loop is unreachable");
5701 case STATEMENT_FOR: {
5702 for_statement_t const* const fors = &stmt->fors;
5704 // if init and step are unreachable, cond is unreachable, too
5705 if (!stmt->base.reachable && !fors->step_reachable) {
5706 warningf(&stmt->base.source_position, "statement is unreachable");
5708 if (!stmt->base.reachable && fors->initialisation != NULL) {
5709 warningf(&fors->initialisation->base.source_position,
5710 "initialisation of for-statement is unreachable");
5713 if (!fors->condition_reachable && fors->condition != NULL) {
5714 warningf(&fors->condition->base.source_position,
5715 "condition of for-statement is unreachable");
5718 if (!fors->step_reachable && fors->step != NULL) {
5719 warningf(&fors->step->base.source_position,
5720 "step of for-statement is unreachable");
5726 case STATEMENT_COMPOUND:
5727 if (stmt->compound.statements != NULL)
5729 goto warn_unreachable;
5731 case STATEMENT_DECLARATION: {
5732 /* Only warn if there is at least one declarator with an initializer.
5733 * This typically occurs in switch statements. */
5734 declaration_statement_t const *const decl = &stmt->declaration;
5735 entity_t const * ent = decl->declarations_begin;
5736 entity_t const *const last = decl->declarations_end;
5738 for (;; ent = ent->base.next) {
5739 if (ent->kind == ENTITY_VARIABLE &&
5740 ent->variable.initializer != NULL) {
5741 goto warn_unreachable;
5751 if (!stmt->base.reachable)
5752 warningf(&stmt->base.source_position, "statement is unreachable");
5757 static void parse_external_declaration(void)
5759 /* function-definitions and declarations both start with declaration
5761 declaration_specifiers_t specifiers;
5762 memset(&specifiers, 0, sizeof(specifiers));
5764 add_anchor_token(';');
5765 parse_declaration_specifiers(&specifiers);
5766 rem_anchor_token(';');
5768 /* must be a declaration */
5769 if (token.type == ';') {
5770 parse_anonymous_declaration_rest(&specifiers);
5774 add_anchor_token(',');
5775 add_anchor_token('=');
5776 add_anchor_token(';');
5777 add_anchor_token('{');
5779 /* declarator is common to both function-definitions and declarations */
5780 entity_t *ndeclaration = parse_declarator(&specifiers, DECL_FLAGS_NONE);
5782 rem_anchor_token('{');
5783 rem_anchor_token(';');
5784 rem_anchor_token('=');
5785 rem_anchor_token(',');
5787 /* must be a declaration */
5788 switch (token.type) {
5792 parse_declaration_rest(ndeclaration, &specifiers, record_entity,
5797 /* must be a function definition */
5798 parse_kr_declaration_list(ndeclaration);
5800 if (token.type != '{') {
5801 parse_error_expected("while parsing function definition", '{', NULL);
5802 eat_until_matching_token(';');
5806 assert(is_declaration(ndeclaration));
5807 type_t *const orig_type = ndeclaration->declaration.type;
5808 type_t * type = skip_typeref(orig_type);
5810 if (!is_type_function(type)) {
5811 if (is_type_valid(type)) {
5812 errorf(HERE, "declarator '%#T' has a body but is not a function type",
5813 type, ndeclaration->base.symbol);
5817 } else if (is_typeref(orig_type)) {
5819 errorf(&ndeclaration->base.source_position,
5820 "type of function definition '%#T' is a typedef",
5821 orig_type, ndeclaration->base.symbol);
5824 if (warning.aggregate_return &&
5825 is_type_compound(skip_typeref(type->function.return_type))) {
5826 warningf(HERE, "function '%Y' returns an aggregate",
5827 ndeclaration->base.symbol);
5829 if (warning.traditional && !type->function.unspecified_parameters) {
5830 warningf(HERE, "traditional C rejects ISO C style function definition of function '%Y'",
5831 ndeclaration->base.symbol);
5833 if (warning.old_style_definition && type->function.unspecified_parameters) {
5834 warningf(HERE, "old-style function definition '%Y'",
5835 ndeclaration->base.symbol);
5838 /* §6.7.5.3:14 a function definition with () means no
5839 * parameters (and not unspecified parameters) */
5840 if (type->function.unspecified_parameters &&
5841 type->function.parameters == NULL &&
5842 !type->function.kr_style_parameters) {
5843 type_t *copy = duplicate_type(type);
5844 copy->function.unspecified_parameters = false;
5845 type = identify_new_type(copy);
5847 ndeclaration->declaration.type = type;
5850 entity_t *const entity = record_entity(ndeclaration, true);
5851 assert(entity->kind == ENTITY_FUNCTION);
5852 assert(ndeclaration->kind == ENTITY_FUNCTION);
5854 function_t *function = &entity->function;
5855 if (ndeclaration != entity) {
5856 function->parameters = ndeclaration->function.parameters;
5858 assert(is_declaration(entity));
5859 type = skip_typeref(entity->declaration.type);
5861 /* push function parameters and switch scope */
5862 size_t const top = environment_top();
5863 scope_t *old_scope = scope_push(&function->parameters);
5865 entity_t *parameter = function->parameters.entities;
5866 for (; parameter != NULL; parameter = parameter->base.next) {
5867 if (parameter->base.parent_scope == &ndeclaration->function.parameters) {
5868 parameter->base.parent_scope = current_scope;
5870 assert(parameter->base.parent_scope == NULL
5871 || parameter->base.parent_scope == current_scope);
5872 parameter->base.parent_scope = current_scope;
5873 if (parameter->base.symbol == NULL) {
5874 errorf(¶meter->base.source_position, "parameter name omitted");
5877 environment_push(parameter);
5880 if (function->statement != NULL) {
5881 parser_error_multiple_definition(entity, HERE);
5884 /* parse function body */
5885 int label_stack_top = label_top();
5886 function_t *old_current_function = current_function;
5887 current_function = function;
5888 current_parent = NULL;
5891 goto_anchor = &goto_first;
5893 label_anchor = &label_first;
5895 statement_t *const body = parse_compound_statement(false);
5896 function->statement = body;
5899 check_declarations();
5900 if (warning.return_type ||
5901 warning.unreachable_code ||
5902 (warning.missing_noreturn
5903 && !(function->base.modifiers & DM_NORETURN))) {
5904 noreturn_candidate = true;
5905 check_reachable(body);
5906 if (warning.unreachable_code)
5907 walk_statements(body, check_unreachable, NULL);
5908 if (warning.missing_noreturn &&
5909 noreturn_candidate &&
5910 !(function->base.modifiers & DM_NORETURN)) {
5911 warningf(&body->base.source_position,
5912 "function '%#T' is candidate for attribute 'noreturn'",
5913 type, entity->base.symbol);
5917 assert(current_parent == NULL);
5918 assert(current_function == function);
5919 current_function = old_current_function;
5920 label_pop_to(label_stack_top);
5923 assert(current_scope == &function->parameters);
5924 scope_pop(old_scope);
5925 environment_pop_to(top);
5928 static type_t *make_bitfield_type(type_t *base_type, expression_t *size,
5929 source_position_t *source_position,
5930 const symbol_t *symbol)
5932 type_t *type = allocate_type_zero(TYPE_BITFIELD);
5934 type->bitfield.base_type = base_type;
5935 type->bitfield.size_expression = size;
5938 type_t *skipped_type = skip_typeref(base_type);
5939 if (!is_type_integer(skipped_type)) {
5940 errorf(HERE, "bitfield base type '%T' is not an integer type",
5944 bit_size = get_type_size(base_type) * 8;
5947 if (is_constant_expression(size)) {
5948 long v = fold_constant_to_int(size);
5949 const symbol_t *user_symbol = symbol == NULL ? sym_anonymous : symbol;
5952 errorf(source_position, "negative width in bit-field '%Y'",
5954 } else if (v == 0 && symbol != NULL) {
5955 errorf(source_position, "zero width for bit-field '%Y'",
5957 } else if (bit_size > 0 && (il_size_t)v > bit_size) {
5958 errorf(source_position, "width of '%Y' exceeds its type",
5961 type->bitfield.bit_size = v;
5968 static entity_t *find_compound_entry(compound_t *compound, symbol_t *symbol)
5970 entity_t *iter = compound->members.entities;
5971 for (; iter != NULL; iter = iter->base.next) {
5972 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5975 if (iter->base.symbol == symbol) {
5977 } else if (iter->base.symbol == NULL) {
5978 /* search in anonymous structs and unions */
5979 type_t *type = skip_typeref(iter->declaration.type);
5980 if (is_type_compound(type)) {
5981 if (find_compound_entry(type->compound.compound, symbol)
5992 static void check_deprecated(const source_position_t *source_position,
5993 const entity_t *entity)
5995 if (!warning.deprecated_declarations)
5997 if (!is_declaration(entity))
5999 if ((entity->declaration.modifiers & DM_DEPRECATED) == 0)
6002 char const *const prefix = get_entity_kind_name(entity->kind);
6003 const char *deprecated_string
6004 = get_deprecated_string(entity->declaration.attributes);
6005 if (deprecated_string != NULL) {
6006 warningf(source_position, "%s '%Y' is deprecated (declared %P): \"%s\"",
6007 prefix, entity->base.symbol, &entity->base.source_position,
6010 warningf(source_position, "%s '%Y' is deprecated (declared %P)", prefix,
6011 entity->base.symbol, &entity->base.source_position);
6016 static expression_t *create_select(const source_position_t *pos,
6018 type_qualifiers_t qualifiers,
6021 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
6023 check_deprecated(pos, entry);
6025 expression_t *select = allocate_expression_zero(EXPR_SELECT);
6026 select->select.compound = addr;
6027 select->select.compound_entry = entry;
6029 type_t *entry_type = entry->declaration.type;
6030 type_t *res_type = get_qualified_type(entry_type, qualifiers);
6032 /* we always do the auto-type conversions; the & and sizeof parser contains
6033 * code to revert this! */
6034 select->base.type = automatic_type_conversion(res_type);
6035 if (res_type->kind == TYPE_BITFIELD) {
6036 select->base.type = res_type->bitfield.base_type;
6043 * Find entry with symbol in compound. Search anonymous structs and unions and
6044 * creates implicit select expressions for them.
6045 * Returns the adress for the innermost compound.
6047 static expression_t *find_create_select(const source_position_t *pos,
6049 type_qualifiers_t qualifiers,
6050 compound_t *compound, symbol_t *symbol)
6052 entity_t *iter = compound->members.entities;
6053 for (; iter != NULL; iter = iter->base.next) {
6054 if (iter->kind != ENTITY_COMPOUND_MEMBER)
6057 symbol_t *iter_symbol = iter->base.symbol;
6058 if (iter_symbol == NULL) {
6059 type_t *type = iter->declaration.type;
6060 if (type->kind != TYPE_COMPOUND_STRUCT
6061 && type->kind != TYPE_COMPOUND_UNION)
6064 compound_t *sub_compound = type->compound.compound;
6066 if (find_compound_entry(sub_compound, symbol) == NULL)
6069 expression_t *sub_addr = create_select(pos, addr, qualifiers, iter);
6070 sub_addr->base.source_position = *pos;
6071 sub_addr->select.implicit = true;
6072 return find_create_select(pos, sub_addr, qualifiers, sub_compound,
6076 if (iter_symbol == symbol) {
6077 return create_select(pos, addr, qualifiers, iter);
6084 static void parse_compound_declarators(compound_t *compound,
6085 const declaration_specifiers_t *specifiers)
6090 if (token.type == ':') {
6091 source_position_t source_position = *HERE;
6094 type_t *base_type = specifiers->type;
6095 expression_t *size = parse_constant_expression();
6097 type_t *type = make_bitfield_type(base_type, size,
6098 &source_position, NULL);
6100 attribute_t *attributes = parse_attributes(NULL);
6101 if (attributes != NULL) {
6102 attribute_t *last = attributes;
6103 while (last->next != NULL)
6105 last->next = specifiers->attributes;
6107 attributes = specifiers->attributes;
6110 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER);
6111 entity->base.namespc = NAMESPACE_NORMAL;
6112 entity->base.source_position = source_position;
6113 entity->declaration.declared_storage_class = STORAGE_CLASS_NONE;
6114 entity->declaration.storage_class = STORAGE_CLASS_NONE;
6115 entity->declaration.type = type;
6116 entity->declaration.attributes = attributes;
6118 if (attributes != NULL) {
6119 handle_entity_attributes(attributes, entity);
6121 append_entity(&compound->members, entity);
6123 entity = parse_declarator(specifiers,
6124 DECL_MAY_BE_ABSTRACT | DECL_CREATE_COMPOUND_MEMBER);
6125 if (entity->kind == ENTITY_TYPEDEF) {
6126 errorf(&entity->base.source_position,
6127 "typedef not allowed as compound member");
6129 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
6131 /* make sure we don't define a symbol multiple times */
6132 symbol_t *symbol = entity->base.symbol;
6133 if (symbol != NULL) {
6134 entity_t *prev = find_compound_entry(compound, symbol);
6136 errorf(&entity->base.source_position,
6137 "multiple declarations of symbol '%Y' (declared %P)",
6138 symbol, &prev->base.source_position);
6142 if (token.type == ':') {
6143 source_position_t source_position = *HERE;
6145 expression_t *size = parse_constant_expression();
6147 type_t *type = entity->declaration.type;
6148 type_t *bitfield_type = make_bitfield_type(type, size,
6149 &source_position, entity->base.symbol);
6151 attribute_t *attributes = parse_attributes(NULL);
6152 entity->declaration.type = bitfield_type;
6153 handle_entity_attributes(attributes, entity);
6155 type_t *orig_type = entity->declaration.type;
6156 type_t *type = skip_typeref(orig_type);
6157 if (is_type_function(type)) {
6158 errorf(&entity->base.source_position,
6159 "compound member '%Y' must not have function type '%T'",
6160 entity->base.symbol, orig_type);
6161 } else if (is_type_incomplete(type)) {
6162 /* §6.7.2.1:16 flexible array member */
6163 if (!is_type_array(type) ||
6164 token.type != ';' ||
6165 look_ahead(1)->type != '}') {
6166 errorf(&entity->base.source_position,
6167 "compound member '%Y' has incomplete type '%T'",
6168 entity->base.symbol, orig_type);
6173 append_entity(&compound->members, entity);
6177 if (token.type != ',')
6181 expect(';', end_error);
6184 anonymous_entity = NULL;
6187 static void parse_compound_type_entries(compound_t *compound)
6190 add_anchor_token('}');
6192 while (token.type != '}') {
6193 if (token.type == T_EOF) {
6194 errorf(HERE, "EOF while parsing struct");
6197 declaration_specifiers_t specifiers;
6198 memset(&specifiers, 0, sizeof(specifiers));
6199 parse_declaration_specifiers(&specifiers);
6201 parse_compound_declarators(compound, &specifiers);
6203 rem_anchor_token('}');
6207 compound->complete = true;
6210 static type_t *parse_typename(void)
6212 declaration_specifiers_t specifiers;
6213 memset(&specifiers, 0, sizeof(specifiers));
6214 parse_declaration_specifiers(&specifiers);
6215 if (specifiers.storage_class != STORAGE_CLASS_NONE ||
6216 specifiers.thread_local) {
6217 /* TODO: improve error message, user does probably not know what a
6218 * storage class is...
6220 errorf(HERE, "typename may not have a storage class");
6223 type_t *result = parse_abstract_declarator(specifiers.type);
6231 typedef expression_t* (*parse_expression_function)(void);
6232 typedef expression_t* (*parse_expression_infix_function)(expression_t *left);
6234 typedef struct expression_parser_function_t expression_parser_function_t;
6235 struct expression_parser_function_t {
6236 parse_expression_function parser;
6237 precedence_t infix_precedence;
6238 parse_expression_infix_function infix_parser;
6241 expression_parser_function_t expression_parsers[T_LAST_TOKEN];
6244 * Prints an error message if an expression was expected but not read
6246 static expression_t *expected_expression_error(void)
6248 /* skip the error message if the error token was read */
6249 if (token.type != T_ERROR) {
6250 errorf(HERE, "expected expression, got token %K", &token);
6254 return create_invalid_expression();
6258 * Parse a string constant.
6260 static expression_t *parse_string_const(void)
6263 if (token.type == T_STRING_LITERAL) {
6264 string_t res = token.v.string;
6266 while (token.type == T_STRING_LITERAL) {
6267 res = concat_strings(&res, &token.v.string);
6270 if (token.type != T_WIDE_STRING_LITERAL) {
6271 expression_t *const cnst = allocate_expression_zero(EXPR_STRING_LITERAL);
6272 /* note: that we use type_char_ptr here, which is already the
6273 * automatic converted type. revert_automatic_type_conversion
6274 * will construct the array type */
6275 cnst->base.type = warning.write_strings ? type_const_char_ptr : type_char_ptr;
6276 cnst->string.value = res;
6280 wres = concat_string_wide_string(&res, &token.v.wide_string);
6282 wres = token.v.wide_string;
6287 switch (token.type) {
6288 case T_WIDE_STRING_LITERAL:
6289 wres = concat_wide_strings(&wres, &token.v.wide_string);
6292 case T_STRING_LITERAL:
6293 wres = concat_wide_string_string(&wres, &token.v.string);
6297 expression_t *const cnst = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
6298 cnst->base.type = warning.write_strings ? type_const_wchar_t_ptr : type_wchar_t_ptr;
6299 cnst->wide_string.value = wres;
6308 * Parse a boolean constant.
6310 static expression_t *parse_bool_const(bool value)
6312 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
6313 cnst->base.type = type_bool;
6314 cnst->conste.v.int_value = value;
6322 * Parse an integer constant.
6324 static expression_t *parse_int_const(void)
6326 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
6327 cnst->base.type = token.datatype;
6328 cnst->conste.v.int_value = token.v.intvalue;
6336 * Parse a character constant.
6338 static expression_t *parse_character_constant(void)
6340 expression_t *cnst = allocate_expression_zero(EXPR_CHARACTER_CONSTANT);
6341 cnst->base.type = token.datatype;
6342 cnst->conste.v.character = token.v.string;
6344 if (cnst->conste.v.character.size != 1) {
6346 errorf(HERE, "more than 1 character in character constant");
6347 } else if (warning.multichar) {
6348 warningf(HERE, "multi-character character constant");
6357 * Parse a wide character constant.
6359 static expression_t *parse_wide_character_constant(void)
6361 expression_t *cnst = allocate_expression_zero(EXPR_WIDE_CHARACTER_CONSTANT);
6362 cnst->base.type = token.datatype;
6363 cnst->conste.v.wide_character = token.v.wide_string;
6365 if (cnst->conste.v.wide_character.size != 1) {
6367 errorf(HERE, "more than 1 character in character constant");
6368 } else if (warning.multichar) {
6369 warningf(HERE, "multi-character character constant");
6378 * Parse a float constant.
6380 static expression_t *parse_float_const(void)
6382 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
6383 cnst->base.type = token.datatype;
6384 cnst->conste.v.float_value = token.v.floatvalue;
6391 static entity_t *create_implicit_function(symbol_t *symbol,
6392 const source_position_t *source_position)
6394 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
6395 ntype->function.return_type = type_int;
6396 ntype->function.unspecified_parameters = true;
6397 ntype->function.linkage = LINKAGE_C;
6398 type_t *type = identify_new_type(ntype);
6400 entity_t *entity = allocate_entity_zero(ENTITY_FUNCTION);
6401 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
6402 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
6403 entity->declaration.type = type;
6404 entity->declaration.implicit = true;
6405 entity->base.symbol = symbol;
6406 entity->base.source_position = *source_position;
6408 bool strict_prototypes_old = warning.strict_prototypes;
6409 warning.strict_prototypes = false;
6410 record_entity(entity, false);
6411 warning.strict_prototypes = strict_prototypes_old;
6417 * Creates a return_type (func)(argument_type) function type if not
6420 static type_t *make_function_2_type(type_t *return_type, type_t *argument_type1,
6421 type_t *argument_type2)
6423 function_parameter_t *const parameter2 = allocate_parameter(argument_type2);
6424 function_parameter_t *const parameter1 = allocate_parameter(argument_type1);
6425 parameter1->next = parameter2;
6427 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6428 type->function.return_type = return_type;
6429 type->function.parameters = parameter1;
6431 return identify_new_type(type);
6435 * Creates a return_type (func)(argument_type) function type if not
6438 * @param return_type the return type
6439 * @param argument_type the argument type
6441 static type_t *make_function_1_type(type_t *return_type, type_t *argument_type)
6443 function_parameter_t *const parameter = allocate_parameter(argument_type);
6445 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6446 type->function.return_type = return_type;
6447 type->function.parameters = parameter;
6449 return identify_new_type(type);
6452 static type_t *make_function_1_type_variadic(type_t *return_type, type_t *argument_type)
6454 type_t *res = make_function_1_type(return_type, argument_type);
6455 res->function.variadic = 1;
6460 * Creates a return_type (func)(void) function type if not
6463 * @param return_type the return type
6465 static type_t *make_function_0_type(type_t *return_type)
6467 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6468 type->function.return_type = return_type;
6469 type->function.parameters = NULL;
6471 return identify_new_type(type);
6475 * Creates a NO_RETURN return_type (func)(void) function type if not
6478 * @param return_type the return type
6480 static type_t *make_function_0_type_noreturn(type_t *return_type)
6482 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6483 type->function.return_type = return_type;
6484 type->function.parameters = NULL;
6485 type->function.modifiers |= DM_NORETURN;
6486 return identify_new_type(type);
6490 * Performs automatic type cast as described in §6.3.2.1.
6492 * @param orig_type the original type
6494 static type_t *automatic_type_conversion(type_t *orig_type)
6496 type_t *type = skip_typeref(orig_type);
6497 if (is_type_array(type)) {
6498 array_type_t *array_type = &type->array;
6499 type_t *element_type = array_type->element_type;
6500 unsigned qualifiers = array_type->base.qualifiers;
6502 return make_pointer_type(element_type, qualifiers);
6505 if (is_type_function(type)) {
6506 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
6513 * reverts the automatic casts of array to pointer types and function
6514 * to function-pointer types as defined §6.3.2.1
6516 type_t *revert_automatic_type_conversion(const expression_t *expression)
6518 switch (expression->kind) {
6519 case EXPR_REFERENCE: {
6520 entity_t *entity = expression->reference.entity;
6521 if (is_declaration(entity)) {
6522 return entity->declaration.type;
6523 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6524 return entity->enum_value.enum_type;
6526 panic("no declaration or enum in reference");
6531 entity_t *entity = expression->select.compound_entry;
6532 assert(is_declaration(entity));
6533 type_t *type = entity->declaration.type;
6534 return get_qualified_type(type,
6535 expression->base.type->base.qualifiers);
6538 case EXPR_UNARY_DEREFERENCE: {
6539 const expression_t *const value = expression->unary.value;
6540 type_t *const type = skip_typeref(value->base.type);
6541 if (!is_type_pointer(type))
6542 return type_error_type;
6543 return type->pointer.points_to;
6546 case EXPR_ARRAY_ACCESS: {
6547 const expression_t *array_ref = expression->array_access.array_ref;
6548 type_t *type_left = skip_typeref(array_ref->base.type);
6549 if (!is_type_pointer(type_left))
6550 return type_error_type;
6551 return type_left->pointer.points_to;
6554 case EXPR_STRING_LITERAL: {
6555 size_t size = expression->string.value.size;
6556 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
6559 case EXPR_WIDE_STRING_LITERAL: {
6560 size_t size = expression->wide_string.value.size;
6561 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
6564 case EXPR_COMPOUND_LITERAL:
6565 return expression->compound_literal.type;
6568 return expression->base.type;
6572 static expression_t *parse_reference(void)
6574 symbol_t *const symbol = token.v.symbol;
6576 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
6578 if (entity == NULL) {
6579 if (!strict_mode && look_ahead(1)->type == '(') {
6580 /* an implicitly declared function */
6581 if (warning.error_implicit_function_declaration) {
6582 errorf(HERE, "implicit declaration of function '%Y'", symbol);
6583 } else if (warning.implicit_function_declaration) {
6584 warningf(HERE, "implicit declaration of function '%Y'", symbol);
6587 entity = create_implicit_function(symbol, HERE);
6589 errorf(HERE, "unknown identifier '%Y' found.", symbol);
6590 entity = create_error_entity(symbol, ENTITY_VARIABLE);
6596 if (is_declaration(entity)) {
6597 orig_type = entity->declaration.type;
6598 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6599 orig_type = entity->enum_value.enum_type;
6601 panic("expected declaration or enum value in reference");
6604 /* we always do the auto-type conversions; the & and sizeof parser contains
6605 * code to revert this! */
6606 type_t *type = automatic_type_conversion(orig_type);
6608 expression_kind_t kind = EXPR_REFERENCE;
6609 if (entity->kind == ENTITY_ENUM_VALUE)
6610 kind = EXPR_REFERENCE_ENUM_VALUE;
6612 expression_t *expression = allocate_expression_zero(kind);
6613 expression->reference.entity = entity;
6614 expression->base.type = type;
6616 /* this declaration is used */
6617 if (is_declaration(entity)) {
6618 entity->declaration.used = true;
6621 if (entity->base.parent_scope != file_scope
6622 && (current_function != NULL && entity->base.parent_scope->depth < current_function->parameters.depth)
6623 && is_type_valid(orig_type) && !is_type_function(orig_type)) {
6624 if (entity->kind == ENTITY_VARIABLE) {
6625 /* access of a variable from an outer function */
6626 entity->variable.address_taken = true;
6627 } else if (entity->kind == ENTITY_PARAMETER) {
6628 entity->parameter.address_taken = true;
6630 current_function->need_closure = true;
6633 check_deprecated(HERE, entity);
6635 if (warning.init_self && entity == current_init_decl && !in_type_prop
6636 && entity->kind == ENTITY_VARIABLE) {
6637 current_init_decl = NULL;
6638 warningf(HERE, "variable '%#T' is initialized by itself",
6639 entity->declaration.type, entity->base.symbol);
6646 static bool semantic_cast(expression_t *cast)
6648 expression_t *expression = cast->unary.value;
6649 type_t *orig_dest_type = cast->base.type;
6650 type_t *orig_type_right = expression->base.type;
6651 type_t const *dst_type = skip_typeref(orig_dest_type);
6652 type_t const *src_type = skip_typeref(orig_type_right);
6653 source_position_t const *pos = &cast->base.source_position;
6655 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
6656 if (dst_type == type_void)
6659 /* only integer and pointer can be casted to pointer */
6660 if (is_type_pointer(dst_type) &&
6661 !is_type_pointer(src_type) &&
6662 !is_type_integer(src_type) &&
6663 is_type_valid(src_type)) {
6664 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
6668 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
6669 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
6673 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
6674 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
6678 if (warning.cast_qual &&
6679 is_type_pointer(src_type) &&
6680 is_type_pointer(dst_type)) {
6681 type_t *src = skip_typeref(src_type->pointer.points_to);
6682 type_t *dst = skip_typeref(dst_type->pointer.points_to);
6683 unsigned missing_qualifiers =
6684 src->base.qualifiers & ~dst->base.qualifiers;
6685 if (missing_qualifiers != 0) {
6687 "cast discards qualifiers '%Q' in pointer target type of '%T'",
6688 missing_qualifiers, orig_type_right);
6694 static expression_t *parse_compound_literal(type_t *type)
6696 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
6698 parse_initializer_env_t env;
6701 env.must_be_constant = false;
6702 initializer_t *initializer = parse_initializer(&env);
6705 expression->compound_literal.initializer = initializer;
6706 expression->compound_literal.type = type;
6707 expression->base.type = automatic_type_conversion(type);
6713 * Parse a cast expression.
6715 static expression_t *parse_cast(void)
6717 add_anchor_token(')');
6719 source_position_t source_position = token.source_position;
6721 type_t *type = parse_typename();
6723 rem_anchor_token(')');
6724 expect(')', end_error);
6726 if (token.type == '{') {
6727 return parse_compound_literal(type);
6730 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
6731 cast->base.source_position = source_position;
6733 expression_t *value = parse_sub_expression(PREC_CAST);
6734 cast->base.type = type;
6735 cast->unary.value = value;
6737 if (! semantic_cast(cast)) {
6738 /* TODO: record the error in the AST. else it is impossible to detect it */
6743 return create_invalid_expression();
6747 * Parse a statement expression.
6749 static expression_t *parse_statement_expression(void)
6751 add_anchor_token(')');
6753 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6755 statement_t *statement = parse_compound_statement(true);
6756 statement->compound.stmt_expr = true;
6757 expression->statement.statement = statement;
6759 /* find last statement and use its type */
6760 type_t *type = type_void;
6761 const statement_t *stmt = statement->compound.statements;
6763 while (stmt->base.next != NULL)
6764 stmt = stmt->base.next;
6766 if (stmt->kind == STATEMENT_EXPRESSION) {
6767 type = stmt->expression.expression->base.type;
6769 } else if (warning.other) {
6770 warningf(&expression->base.source_position, "empty statement expression ({})");
6772 expression->base.type = type;
6774 rem_anchor_token(')');
6775 expect(')', end_error);
6782 * Parse a parenthesized expression.
6784 static expression_t *parse_parenthesized_expression(void)
6788 switch (token.type) {
6790 /* gcc extension: a statement expression */
6791 return parse_statement_expression();
6795 return parse_cast();
6797 if (is_typedef_symbol(token.v.symbol)) {
6798 return parse_cast();
6802 add_anchor_token(')');
6803 expression_t *result = parse_expression();
6804 result->base.parenthesized = true;
6805 rem_anchor_token(')');
6806 expect(')', end_error);
6812 static expression_t *parse_function_keyword(void)
6816 if (current_function == NULL) {
6817 errorf(HERE, "'__func__' used outside of a function");
6820 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6821 expression->base.type = type_char_ptr;
6822 expression->funcname.kind = FUNCNAME_FUNCTION;
6829 static expression_t *parse_pretty_function_keyword(void)
6831 if (current_function == NULL) {
6832 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
6835 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6836 expression->base.type = type_char_ptr;
6837 expression->funcname.kind = FUNCNAME_PRETTY_FUNCTION;
6839 eat(T___PRETTY_FUNCTION__);
6844 static expression_t *parse_funcsig_keyword(void)
6846 if (current_function == NULL) {
6847 errorf(HERE, "'__FUNCSIG__' used outside of a function");
6850 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6851 expression->base.type = type_char_ptr;
6852 expression->funcname.kind = FUNCNAME_FUNCSIG;
6859 static expression_t *parse_funcdname_keyword(void)
6861 if (current_function == NULL) {
6862 errorf(HERE, "'__FUNCDNAME__' used outside of a function");
6865 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6866 expression->base.type = type_char_ptr;
6867 expression->funcname.kind = FUNCNAME_FUNCDNAME;
6869 eat(T___FUNCDNAME__);
6874 static designator_t *parse_designator(void)
6876 designator_t *result = allocate_ast_zero(sizeof(result[0]));
6877 result->source_position = *HERE;
6879 if (token.type != T_IDENTIFIER) {
6880 parse_error_expected("while parsing member designator",
6881 T_IDENTIFIER, NULL);
6884 result->symbol = token.v.symbol;
6887 designator_t *last_designator = result;
6889 if (token.type == '.') {
6891 if (token.type != T_IDENTIFIER) {
6892 parse_error_expected("while parsing member designator",
6893 T_IDENTIFIER, NULL);
6896 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6897 designator->source_position = *HERE;
6898 designator->symbol = token.v.symbol;
6901 last_designator->next = designator;
6902 last_designator = designator;
6905 if (token.type == '[') {
6907 add_anchor_token(']');
6908 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6909 designator->source_position = *HERE;
6910 designator->array_index = parse_expression();
6911 rem_anchor_token(']');
6912 expect(']', end_error);
6913 if (designator->array_index == NULL) {
6917 last_designator->next = designator;
6918 last_designator = designator;
6930 * Parse the __builtin_offsetof() expression.
6932 static expression_t *parse_offsetof(void)
6934 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6935 expression->base.type = type_size_t;
6937 eat(T___builtin_offsetof);
6939 expect('(', end_error);
6940 add_anchor_token(',');
6941 type_t *type = parse_typename();
6942 rem_anchor_token(',');
6943 expect(',', end_error);
6944 add_anchor_token(')');
6945 designator_t *designator = parse_designator();
6946 rem_anchor_token(')');
6947 expect(')', end_error);
6949 expression->offsetofe.type = type;
6950 expression->offsetofe.designator = designator;
6953 memset(&path, 0, sizeof(path));
6954 path.top_type = type;
6955 path.path = NEW_ARR_F(type_path_entry_t, 0);
6957 descend_into_subtype(&path);
6959 if (!walk_designator(&path, designator, true)) {
6960 return create_invalid_expression();
6963 DEL_ARR_F(path.path);
6967 return create_invalid_expression();
6971 * Parses a _builtin_va_start() expression.
6973 static expression_t *parse_va_start(void)
6975 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6977 eat(T___builtin_va_start);
6979 expect('(', end_error);
6980 add_anchor_token(',');
6981 expression->va_starte.ap = parse_assignment_expression();
6982 rem_anchor_token(',');
6983 expect(',', end_error);
6984 expression_t *const expr = parse_assignment_expression();
6985 if (expr->kind == EXPR_REFERENCE) {
6986 entity_t *const entity = expr->reference.entity;
6987 if (entity->base.parent_scope != ¤t_function->parameters
6988 || entity->base.next != NULL
6989 || entity->kind != ENTITY_PARAMETER) {
6990 errorf(&expr->base.source_position,
6991 "second argument of 'va_start' must be last parameter of the current function");
6993 expression->va_starte.parameter = &entity->variable;
6995 expect(')', end_error);
6998 expect(')', end_error);
7000 return create_invalid_expression();
7004 * Parses a __builtin_va_arg() expression.
7006 static expression_t *parse_va_arg(void)
7008 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
7010 eat(T___builtin_va_arg);
7012 expect('(', end_error);
7014 ap.expression = parse_assignment_expression();
7015 expression->va_arge.ap = ap.expression;
7016 check_call_argument(type_valist, &ap, 1);
7018 expect(',', end_error);
7019 expression->base.type = parse_typename();
7020 expect(')', end_error);
7024 return create_invalid_expression();
7028 * Parses a __builtin_va_copy() expression.
7030 static expression_t *parse_va_copy(void)
7032 expression_t *expression = allocate_expression_zero(EXPR_VA_COPY);
7034 eat(T___builtin_va_copy);
7036 expect('(', end_error);
7037 expression_t *dst = parse_assignment_expression();
7038 assign_error_t error = semantic_assign(type_valist, dst);
7039 report_assign_error(error, type_valist, dst, "call argument 1",
7040 &dst->base.source_position);
7041 expression->va_copye.dst = dst;
7043 expect(',', end_error);
7045 call_argument_t src;
7046 src.expression = parse_assignment_expression();
7047 check_call_argument(type_valist, &src, 2);
7048 expression->va_copye.src = src.expression;
7049 expect(')', end_error);
7053 return create_invalid_expression();
7057 * Parses a __builtin_constant_p() expression.
7059 static expression_t *parse_builtin_constant(void)
7061 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
7063 eat(T___builtin_constant_p);
7065 expect('(', end_error);
7066 add_anchor_token(')');
7067 expression->builtin_constant.value = parse_assignment_expression();
7068 rem_anchor_token(')');
7069 expect(')', end_error);
7070 expression->base.type = type_int;
7074 return create_invalid_expression();
7078 * Parses a __builtin_types_compatible_p() expression.
7080 static expression_t *parse_builtin_types_compatible(void)
7082 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_TYPES_COMPATIBLE_P);
7084 eat(T___builtin_types_compatible_p);
7086 expect('(', end_error);
7087 add_anchor_token(')');
7088 add_anchor_token(',');
7089 expression->builtin_types_compatible.left = parse_typename();
7090 rem_anchor_token(',');
7091 expect(',', end_error);
7092 expression->builtin_types_compatible.right = parse_typename();
7093 rem_anchor_token(')');
7094 expect(')', end_error);
7095 expression->base.type = type_int;
7099 return create_invalid_expression();
7103 * Parses a __builtin_is_*() compare expression.
7105 static expression_t *parse_compare_builtin(void)
7107 expression_t *expression;
7109 switch (token.type) {
7110 case T___builtin_isgreater:
7111 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
7113 case T___builtin_isgreaterequal:
7114 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
7116 case T___builtin_isless:
7117 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
7119 case T___builtin_islessequal:
7120 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
7122 case T___builtin_islessgreater:
7123 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
7125 case T___builtin_isunordered:
7126 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
7129 internal_errorf(HERE, "invalid compare builtin found");
7131 expression->base.source_position = *HERE;
7134 expect('(', end_error);
7135 expression->binary.left = parse_assignment_expression();
7136 expect(',', end_error);
7137 expression->binary.right = parse_assignment_expression();
7138 expect(')', end_error);
7140 type_t *const orig_type_left = expression->binary.left->base.type;
7141 type_t *const orig_type_right = expression->binary.right->base.type;
7143 type_t *const type_left = skip_typeref(orig_type_left);
7144 type_t *const type_right = skip_typeref(orig_type_right);
7145 if (!is_type_float(type_left) && !is_type_float(type_right)) {
7146 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7147 type_error_incompatible("invalid operands in comparison",
7148 &expression->base.source_position, orig_type_left, orig_type_right);
7151 semantic_comparison(&expression->binary);
7156 return create_invalid_expression();
7161 * Parses a __builtin_expect(, end_error) expression.
7163 static expression_t *parse_builtin_expect(void, end_error)
7165 expression_t *expression
7166 = allocate_expression_zero(EXPR_BINARY_BUILTIN_EXPECT);
7168 eat(T___builtin_expect);
7170 expect('(', end_error);
7171 expression->binary.left = parse_assignment_expression();
7172 expect(',', end_error);
7173 expression->binary.right = parse_constant_expression();
7174 expect(')', end_error);
7176 expression->base.type = expression->binary.left->base.type;
7180 return create_invalid_expression();
7185 * Parses a MS assume() expression.
7187 static expression_t *parse_assume(void)
7189 expression_t *expression = allocate_expression_zero(EXPR_UNARY_ASSUME);
7193 expect('(', end_error);
7194 add_anchor_token(')');
7195 expression->unary.value = parse_assignment_expression();
7196 rem_anchor_token(')');
7197 expect(')', end_error);
7199 expression->base.type = type_void;
7202 return create_invalid_expression();
7206 * Return the declaration for a given label symbol or create a new one.
7208 * @param symbol the symbol of the label
7210 static label_t *get_label(symbol_t *symbol)
7213 assert(current_function != NULL);
7215 label = get_entity(symbol, NAMESPACE_LABEL);
7216 /* if we found a local label, we already created the declaration */
7217 if (label != NULL && label->kind == ENTITY_LOCAL_LABEL) {
7218 if (label->base.parent_scope != current_scope) {
7219 assert(label->base.parent_scope->depth < current_scope->depth);
7220 current_function->goto_to_outer = true;
7222 return &label->label;
7225 label = get_entity(symbol, NAMESPACE_LABEL);
7226 /* if we found a label in the same function, then we already created the
7229 && label->base.parent_scope == ¤t_function->parameters) {
7230 return &label->label;
7233 /* otherwise we need to create a new one */
7234 label = allocate_entity_zero(ENTITY_LABEL);
7235 label->base.namespc = NAMESPACE_LABEL;
7236 label->base.symbol = symbol;
7240 return &label->label;
7244 * Parses a GNU && label address expression.
7246 static expression_t *parse_label_address(void)
7248 source_position_t source_position = token.source_position;
7250 if (token.type != T_IDENTIFIER) {
7251 parse_error_expected("while parsing label address", T_IDENTIFIER, NULL);
7254 symbol_t *symbol = token.v.symbol;
7257 label_t *label = get_label(symbol);
7259 label->address_taken = true;
7261 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
7262 expression->base.source_position = source_position;
7264 /* label address is threaten as a void pointer */
7265 expression->base.type = type_void_ptr;
7266 expression->label_address.label = label;
7269 return create_invalid_expression();
7273 * Parse a microsoft __noop expression.
7275 static expression_t *parse_noop_expression(void)
7277 /* the result is a (int)0 */
7278 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
7279 cnst->base.type = type_int;
7280 cnst->conste.v.int_value = 0;
7281 cnst->conste.is_ms_noop = true;
7285 if (token.type == '(') {
7286 /* parse arguments */
7288 add_anchor_token(')');
7289 add_anchor_token(',');
7291 if (token.type != ')') {
7293 (void)parse_assignment_expression();
7294 if (token.type != ',')
7300 rem_anchor_token(',');
7301 rem_anchor_token(')');
7302 expect(')', end_error);
7309 * Parses a primary expression.
7311 static expression_t *parse_primary_expression(void)
7313 switch (token.type) {
7314 case T_false: return parse_bool_const(false);
7315 case T_true: return parse_bool_const(true);
7316 case T_INTEGER: return parse_int_const();
7317 case T_CHARACTER_CONSTANT: return parse_character_constant();
7318 case T_WIDE_CHARACTER_CONSTANT: return parse_wide_character_constant();
7319 case T_FLOATINGPOINT: return parse_float_const();
7320 case T_STRING_LITERAL:
7321 case T_WIDE_STRING_LITERAL: return parse_string_const();
7322 case T___FUNCTION__:
7323 case T___func__: return parse_function_keyword();
7324 case T___PRETTY_FUNCTION__: return parse_pretty_function_keyword();
7325 case T___FUNCSIG__: return parse_funcsig_keyword();
7326 case T___FUNCDNAME__: return parse_funcdname_keyword();
7327 case T___builtin_offsetof: return parse_offsetof();
7328 case T___builtin_va_start: return parse_va_start();
7329 case T___builtin_va_arg: return parse_va_arg();
7330 case T___builtin_va_copy: return parse_va_copy();
7331 case T___builtin_isgreater:
7332 case T___builtin_isgreaterequal:
7333 case T___builtin_isless:
7334 case T___builtin_islessequal:
7335 case T___builtin_islessgreater:
7336 case T___builtin_isunordered: return parse_compare_builtin();
7337 case T___builtin_constant_p: return parse_builtin_constant();
7338 case T___builtin_types_compatible_p: return parse_builtin_types_compatible();
7339 case T__assume: return parse_assume();
7342 return parse_label_address();
7345 case '(': return parse_parenthesized_expression();
7346 case T___noop: return parse_noop_expression();
7348 /* Gracefully handle type names while parsing expressions. */
7350 if (!is_typedef_symbol(token.v.symbol)) {
7351 return parse_reference();
7355 source_position_t const pos = *HERE;
7356 type_t const *const type = parse_typename();
7357 errorf(&pos, "encountered type '%T' while parsing expression", type);
7358 return create_invalid_expression();
7362 errorf(HERE, "unexpected token %K, expected an expression", &token);
7363 return create_invalid_expression();
7367 * Check if the expression has the character type and issue a warning then.
7369 static void check_for_char_index_type(const expression_t *expression)
7371 type_t *const type = expression->base.type;
7372 const type_t *const base_type = skip_typeref(type);
7374 if (is_type_atomic(base_type, ATOMIC_TYPE_CHAR) &&
7375 warning.char_subscripts) {
7376 warningf(&expression->base.source_position,
7377 "array subscript has type '%T'", type);
7381 static expression_t *parse_array_expression(expression_t *left)
7383 expression_t *expression = allocate_expression_zero(EXPR_ARRAY_ACCESS);
7386 add_anchor_token(']');
7388 expression_t *inside = parse_expression();
7390 type_t *const orig_type_left = left->base.type;
7391 type_t *const orig_type_inside = inside->base.type;
7393 type_t *const type_left = skip_typeref(orig_type_left);
7394 type_t *const type_inside = skip_typeref(orig_type_inside);
7396 type_t *return_type;
7397 array_access_expression_t *array_access = &expression->array_access;
7398 if (is_type_pointer(type_left)) {
7399 return_type = type_left->pointer.points_to;
7400 array_access->array_ref = left;
7401 array_access->index = inside;
7402 check_for_char_index_type(inside);
7403 } else if (is_type_pointer(type_inside)) {
7404 return_type = type_inside->pointer.points_to;
7405 array_access->array_ref = inside;
7406 array_access->index = left;
7407 array_access->flipped = true;
7408 check_for_char_index_type(left);
7410 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
7412 "array access on object with non-pointer types '%T', '%T'",
7413 orig_type_left, orig_type_inside);
7415 return_type = type_error_type;
7416 array_access->array_ref = left;
7417 array_access->index = inside;
7420 expression->base.type = automatic_type_conversion(return_type);
7422 rem_anchor_token(']');
7423 expect(']', end_error);
7428 static expression_t *parse_typeprop(expression_kind_t const kind)
7430 expression_t *tp_expression = allocate_expression_zero(kind);
7431 tp_expression->base.type = type_size_t;
7433 eat(kind == EXPR_SIZEOF ? T_sizeof : T___alignof__);
7435 /* we only refer to a type property, mark this case */
7436 bool old = in_type_prop;
7437 in_type_prop = true;
7440 expression_t *expression;
7441 if (token.type == '(' && is_declaration_specifier(look_ahead(1), true)) {
7443 add_anchor_token(')');
7444 orig_type = parse_typename();
7445 rem_anchor_token(')');
7446 expect(')', end_error);
7448 if (token.type == '{') {
7449 /* It was not sizeof(type) after all. It is sizeof of an expression
7450 * starting with a compound literal */
7451 expression = parse_compound_literal(orig_type);
7452 goto typeprop_expression;
7455 expression = parse_sub_expression(PREC_UNARY);
7457 typeprop_expression:
7458 tp_expression->typeprop.tp_expression = expression;
7460 orig_type = revert_automatic_type_conversion(expression);
7461 expression->base.type = orig_type;
7464 tp_expression->typeprop.type = orig_type;
7465 type_t const* const type = skip_typeref(orig_type);
7466 char const* const wrong_type =
7467 GNU_MODE && is_type_atomic(type, ATOMIC_TYPE_VOID) ? NULL :
7468 is_type_incomplete(type) ? "incomplete" :
7469 type->kind == TYPE_FUNCTION ? "function designator" :
7470 type->kind == TYPE_BITFIELD ? "bitfield" :
7472 if (wrong_type != NULL) {
7473 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7474 errorf(&tp_expression->base.source_position,
7475 "operand of %s expression must not be of %s type '%T'",
7476 what, wrong_type, orig_type);
7481 return tp_expression;
7484 static expression_t *parse_sizeof(void)
7486 return parse_typeprop(EXPR_SIZEOF);
7489 static expression_t *parse_alignof(void)
7491 return parse_typeprop(EXPR_ALIGNOF);
7494 static expression_t *parse_select_expression(expression_t *addr)
7496 assert(token.type == '.' || token.type == T_MINUSGREATER);
7497 bool select_left_arrow = (token.type == T_MINUSGREATER);
7500 if (token.type != T_IDENTIFIER) {
7501 parse_error_expected("while parsing select", T_IDENTIFIER, NULL);
7502 return create_invalid_expression();
7504 symbol_t *symbol = token.v.symbol;
7507 type_t *const orig_type = addr->base.type;
7508 type_t *const type = skip_typeref(orig_type);
7511 bool saw_error = false;
7512 if (is_type_pointer(type)) {
7513 if (!select_left_arrow) {
7515 "request for member '%Y' in something not a struct or union, but '%T'",
7519 type_left = skip_typeref(type->pointer.points_to);
7521 if (select_left_arrow && is_type_valid(type)) {
7522 errorf(HERE, "left hand side of '->' is not a pointer, but '%T'", orig_type);
7528 if (type_left->kind != TYPE_COMPOUND_STRUCT &&
7529 type_left->kind != TYPE_COMPOUND_UNION) {
7531 if (is_type_valid(type_left) && !saw_error) {
7533 "request for member '%Y' in something not a struct or union, but '%T'",
7536 return create_invalid_expression();
7539 compound_t *compound = type_left->compound.compound;
7540 if (!compound->complete) {
7541 errorf(HERE, "request for member '%Y' in incomplete type '%T'",
7543 return create_invalid_expression();
7546 type_qualifiers_t qualifiers = type_left->base.qualifiers;
7547 expression_t *result
7548 = find_create_select(HERE, addr, qualifiers, compound, symbol);
7550 if (result == NULL) {
7551 errorf(HERE, "'%T' has no member named '%Y'", orig_type, symbol);
7552 return create_invalid_expression();
7558 static void check_call_argument(type_t *expected_type,
7559 call_argument_t *argument, unsigned pos)
7561 type_t *expected_type_skip = skip_typeref(expected_type);
7562 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
7563 expression_t *arg_expr = argument->expression;
7564 type_t *arg_type = skip_typeref(arg_expr->base.type);
7566 /* handle transparent union gnu extension */
7567 if (is_type_union(expected_type_skip)
7568 && (get_type_modifiers(expected_type) & DM_TRANSPARENT_UNION)) {
7569 compound_t *union_decl = expected_type_skip->compound.compound;
7570 type_t *best_type = NULL;
7571 entity_t *entry = union_decl->members.entities;
7572 for ( ; entry != NULL; entry = entry->base.next) {
7573 assert(is_declaration(entry));
7574 type_t *decl_type = entry->declaration.type;
7575 error = semantic_assign(decl_type, arg_expr);
7576 if (error == ASSIGN_ERROR_INCOMPATIBLE
7577 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
7580 if (error == ASSIGN_SUCCESS) {
7581 best_type = decl_type;
7582 } else if (best_type == NULL) {
7583 best_type = decl_type;
7587 if (best_type != NULL) {
7588 expected_type = best_type;
7592 error = semantic_assign(expected_type, arg_expr);
7593 argument->expression = create_implicit_cast(arg_expr, expected_type);
7595 if (error != ASSIGN_SUCCESS) {
7596 /* report exact scope in error messages (like "in argument 3") */
7598 snprintf(buf, sizeof(buf), "call argument %u", pos);
7599 report_assign_error(error, expected_type, arg_expr, buf,
7600 &arg_expr->base.source_position);
7601 } else if (warning.traditional || warning.conversion) {
7602 type_t *const promoted_type = get_default_promoted_type(arg_type);
7603 if (!types_compatible(expected_type_skip, promoted_type) &&
7604 !types_compatible(expected_type_skip, type_void_ptr) &&
7605 !types_compatible(type_void_ptr, promoted_type)) {
7606 /* Deliberately show the skipped types in this warning */
7607 warningf(&arg_expr->base.source_position,
7608 "passing call argument %u as '%T' rather than '%T' due to prototype",
7609 pos, expected_type_skip, promoted_type);
7615 * Handle the semantic restrictions of builtin calls
7617 static void handle_builtin_argument_restrictions(call_expression_t *call) {
7618 switch (call->function->reference.entity->function.btk) {
7619 case bk_gnu_builtin_return_address:
7620 case bk_gnu_builtin_frame_address: {
7621 /* argument must be constant */
7622 call_argument_t *argument = call->arguments;
7624 if (! is_constant_expression(argument->expression)) {
7625 errorf(&call->base.source_position,
7626 "argument of '%Y' must be a constant expression",
7627 call->function->reference.entity->base.symbol);
7631 case bk_gnu_builtin_prefetch: {
7632 /* second and third argument must be constant if existent */
7633 call_argument_t *rw = call->arguments->next;
7634 call_argument_t *locality = NULL;
7637 if (! is_constant_expression(rw->expression)) {
7638 errorf(&call->base.source_position,
7639 "second argument of '%Y' must be a constant expression",
7640 call->function->reference.entity->base.symbol);
7642 locality = rw->next;
7644 if (locality != NULL) {
7645 if (! is_constant_expression(locality->expression)) {
7646 errorf(&call->base.source_position,
7647 "third argument of '%Y' must be a constant expression",
7648 call->function->reference.entity->base.symbol);
7650 locality = rw->next;
7660 * Parse a call expression, ie. expression '( ... )'.
7662 * @param expression the function address
7664 static expression_t *parse_call_expression(expression_t *expression)
7666 expression_t *result = allocate_expression_zero(EXPR_CALL);
7667 call_expression_t *call = &result->call;
7668 call->function = expression;
7670 type_t *const orig_type = expression->base.type;
7671 type_t *const type = skip_typeref(orig_type);
7673 function_type_t *function_type = NULL;
7674 if (is_type_pointer(type)) {
7675 type_t *const to_type = skip_typeref(type->pointer.points_to);
7677 if (is_type_function(to_type)) {
7678 function_type = &to_type->function;
7679 call->base.type = function_type->return_type;
7683 if (function_type == NULL && is_type_valid(type)) {
7685 "called object '%E' (type '%T') is not a pointer to a function",
7686 expression, orig_type);
7689 /* parse arguments */
7691 add_anchor_token(')');
7692 add_anchor_token(',');
7694 if (token.type != ')') {
7695 call_argument_t **anchor = &call->arguments;
7697 call_argument_t *argument = allocate_ast_zero(sizeof(*argument));
7698 argument->expression = parse_assignment_expression();
7701 anchor = &argument->next;
7703 if (token.type != ',')
7708 rem_anchor_token(',');
7709 rem_anchor_token(')');
7710 expect(')', end_error);
7712 if (function_type == NULL)
7715 /* check type and count of call arguments */
7716 function_parameter_t *parameter = function_type->parameters;
7717 call_argument_t *argument = call->arguments;
7718 if (!function_type->unspecified_parameters) {
7719 for (unsigned pos = 0; parameter != NULL && argument != NULL;
7720 parameter = parameter->next, argument = argument->next) {
7721 check_call_argument(parameter->type, argument, ++pos);
7724 if (parameter != NULL) {
7725 errorf(HERE, "too few arguments to function '%E'", expression);
7726 } else if (argument != NULL && !function_type->variadic) {
7727 errorf(HERE, "too many arguments to function '%E'", expression);
7731 /* do default promotion for other arguments */
7732 for (; argument != NULL; argument = argument->next) {
7733 type_t *type = argument->expression->base.type;
7735 type = get_default_promoted_type(type);
7737 argument->expression
7738 = create_implicit_cast(argument->expression, type);
7741 check_format(&result->call);
7743 if (warning.aggregate_return &&
7744 is_type_compound(skip_typeref(function_type->return_type))) {
7745 warningf(&result->base.source_position,
7746 "function call has aggregate value");
7749 if (call->function->kind == EXPR_REFERENCE) {
7750 reference_expression_t *reference = &call->function->reference;
7751 if (reference->entity->kind == ENTITY_FUNCTION &&
7752 reference->entity->function.btk != bk_none)
7753 handle_builtin_argument_restrictions(call);
7760 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
7762 static bool same_compound_type(const type_t *type1, const type_t *type2)
7765 is_type_compound(type1) &&
7766 type1->kind == type2->kind &&
7767 type1->compound.compound == type2->compound.compound;
7770 static expression_t const *get_reference_address(expression_t const *expr)
7772 bool regular_take_address = true;
7774 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7775 expr = expr->unary.value;
7777 regular_take_address = false;
7780 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7783 expr = expr->unary.value;
7786 if (expr->kind != EXPR_REFERENCE)
7789 /* special case for functions which are automatically converted to a
7790 * pointer to function without an extra TAKE_ADDRESS operation */
7791 if (!regular_take_address &&
7792 expr->reference.entity->kind != ENTITY_FUNCTION) {
7799 static void warn_reference_address_as_bool(expression_t const* expr)
7801 if (!warning.address)
7804 expr = get_reference_address(expr);
7806 warningf(&expr->base.source_position,
7807 "the address of '%Y' will always evaluate as 'true'",
7808 expr->reference.entity->base.symbol);
7812 static void warn_assignment_in_condition(const expression_t *const expr)
7814 if (!warning.parentheses)
7816 if (expr->base.kind != EXPR_BINARY_ASSIGN)
7818 if (expr->base.parenthesized)
7820 warningf(&expr->base.source_position,
7821 "suggest parentheses around assignment used as truth value");
7824 static void semantic_condition(expression_t const *const expr,
7825 char const *const context)
7827 type_t *const type = skip_typeref(expr->base.type);
7828 if (is_type_scalar(type)) {
7829 warn_reference_address_as_bool(expr);
7830 warn_assignment_in_condition(expr);
7831 } else if (is_type_valid(type)) {
7832 errorf(&expr->base.source_position,
7833 "%s must have scalar type", context);
7838 * Parse a conditional expression, ie. 'expression ? ... : ...'.
7840 * @param expression the conditional expression
7842 static expression_t *parse_conditional_expression(expression_t *expression)
7844 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
7846 conditional_expression_t *conditional = &result->conditional;
7847 conditional->condition = expression;
7850 add_anchor_token(':');
7852 /* §6.5.15:2 The first operand shall have scalar type. */
7853 semantic_condition(expression, "condition of conditional operator");
7855 expression_t *true_expression = expression;
7856 bool gnu_cond = false;
7857 if (GNU_MODE && token.type == ':') {
7860 true_expression = parse_expression();
7862 rem_anchor_token(':');
7863 expect(':', end_error);
7865 expression_t *false_expression =
7866 parse_sub_expression(c_mode & _CXX ? PREC_ASSIGNMENT : PREC_CONDITIONAL);
7868 type_t *const orig_true_type = true_expression->base.type;
7869 type_t *const orig_false_type = false_expression->base.type;
7870 type_t *const true_type = skip_typeref(orig_true_type);
7871 type_t *const false_type = skip_typeref(orig_false_type);
7874 type_t *result_type;
7875 if (is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7876 is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
7877 /* ISO/IEC 14882:1998(E) §5.16:2 */
7878 if (true_expression->kind == EXPR_UNARY_THROW) {
7879 result_type = false_type;
7880 } else if (false_expression->kind == EXPR_UNARY_THROW) {
7881 result_type = true_type;
7883 if (warning.other && (
7884 !is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7885 !is_type_atomic(false_type, ATOMIC_TYPE_VOID)
7887 warningf(&conditional->base.source_position,
7888 "ISO C forbids conditional expression with only one void side");
7890 result_type = type_void;
7892 } else if (is_type_arithmetic(true_type)
7893 && is_type_arithmetic(false_type)) {
7894 result_type = semantic_arithmetic(true_type, false_type);
7896 true_expression = create_implicit_cast(true_expression, result_type);
7897 false_expression = create_implicit_cast(false_expression, result_type);
7899 conditional->true_expression = true_expression;
7900 conditional->false_expression = false_expression;
7901 conditional->base.type = result_type;
7902 } else if (same_compound_type(true_type, false_type)) {
7903 /* just take 1 of the 2 types */
7904 result_type = true_type;
7905 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
7906 type_t *pointer_type;
7908 expression_t *other_expression;
7909 if (is_type_pointer(true_type) &&
7910 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
7911 pointer_type = true_type;
7912 other_type = false_type;
7913 other_expression = false_expression;
7915 pointer_type = false_type;
7916 other_type = true_type;
7917 other_expression = true_expression;
7920 if (is_null_pointer_constant(other_expression)) {
7921 result_type = pointer_type;
7922 } else if (is_type_pointer(other_type)) {
7923 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
7924 type_t *to2 = skip_typeref(other_type->pointer.points_to);
7927 if (is_type_atomic(to1, ATOMIC_TYPE_VOID) ||
7928 is_type_atomic(to2, ATOMIC_TYPE_VOID)) {
7930 } else if (types_compatible(get_unqualified_type(to1),
7931 get_unqualified_type(to2))) {
7934 if (warning.other) {
7935 warningf(&conditional->base.source_position,
7936 "pointer types '%T' and '%T' in conditional expression are incompatible",
7937 true_type, false_type);
7942 type_t *const type =
7943 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
7944 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7945 } else if (is_type_integer(other_type)) {
7946 if (warning.other) {
7947 warningf(&conditional->base.source_position,
7948 "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7950 result_type = pointer_type;
7952 if (is_type_valid(other_type)) {
7953 type_error_incompatible("while parsing conditional",
7954 &expression->base.source_position, true_type, false_type);
7956 result_type = type_error_type;
7959 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7960 type_error_incompatible("while parsing conditional",
7961 &conditional->base.source_position, true_type,
7964 result_type = type_error_type;
7967 conditional->true_expression
7968 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7969 conditional->false_expression
7970 = create_implicit_cast(false_expression, result_type);
7971 conditional->base.type = result_type;
7976 * Parse an extension expression.
7978 static expression_t *parse_extension(void)
7980 eat(T___extension__);
7982 bool old_gcc_extension = in_gcc_extension;
7983 in_gcc_extension = true;
7984 expression_t *expression = parse_sub_expression(PREC_UNARY);
7985 in_gcc_extension = old_gcc_extension;
7990 * Parse a __builtin_classify_type() expression.
7992 static expression_t *parse_builtin_classify_type(void)
7994 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7995 result->base.type = type_int;
7997 eat(T___builtin_classify_type);
7999 expect('(', end_error);
8000 add_anchor_token(')');
8001 expression_t *expression = parse_expression();
8002 rem_anchor_token(')');
8003 expect(')', end_error);
8004 result->classify_type.type_expression = expression;
8008 return create_invalid_expression();
8012 * Parse a delete expression
8013 * ISO/IEC 14882:1998(E) §5.3.5
8015 static expression_t *parse_delete(void)
8017 expression_t *const result = allocate_expression_zero(EXPR_UNARY_DELETE);
8018 result->base.type = type_void;
8022 if (token.type == '[') {
8024 result->kind = EXPR_UNARY_DELETE_ARRAY;
8025 expect(']', end_error);
8029 expression_t *const value = parse_sub_expression(PREC_CAST);
8030 result->unary.value = value;
8032 type_t *const type = skip_typeref(value->base.type);
8033 if (!is_type_pointer(type)) {
8034 if (is_type_valid(type)) {
8035 errorf(&value->base.source_position,
8036 "operand of delete must have pointer type");
8038 } else if (warning.other &&
8039 is_type_atomic(skip_typeref(type->pointer.points_to), ATOMIC_TYPE_VOID)) {
8040 warningf(&value->base.source_position,
8041 "deleting 'void*' is undefined");
8048 * Parse a throw expression
8049 * ISO/IEC 14882:1998(E) §15:1
8051 static expression_t *parse_throw(void)
8053 expression_t *const result = allocate_expression_zero(EXPR_UNARY_THROW);
8054 result->base.type = type_void;
8058 expression_t *value = NULL;
8059 switch (token.type) {
8061 value = parse_assignment_expression();
8062 /* ISO/IEC 14882:1998(E) §15.1:3 */
8063 type_t *const orig_type = value->base.type;
8064 type_t *const type = skip_typeref(orig_type);
8065 if (is_type_incomplete(type)) {
8066 errorf(&value->base.source_position,
8067 "cannot throw object of incomplete type '%T'", orig_type);
8068 } else if (is_type_pointer(type)) {
8069 type_t *const points_to = skip_typeref(type->pointer.points_to);
8070 if (is_type_incomplete(points_to) &&
8071 !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
8072 errorf(&value->base.source_position,
8073 "cannot throw pointer to incomplete type '%T'", orig_type);
8081 result->unary.value = value;
8086 static bool check_pointer_arithmetic(const source_position_t *source_position,
8087 type_t *pointer_type,
8088 type_t *orig_pointer_type)
8090 type_t *points_to = pointer_type->pointer.points_to;
8091 points_to = skip_typeref(points_to);
8093 if (is_type_incomplete(points_to)) {
8094 if (!GNU_MODE || !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
8095 errorf(source_position,
8096 "arithmetic with pointer to incomplete type '%T' not allowed",
8099 } else if (warning.pointer_arith) {
8100 warningf(source_position,
8101 "pointer of type '%T' used in arithmetic",
8104 } else if (is_type_function(points_to)) {
8106 errorf(source_position,
8107 "arithmetic with pointer to function type '%T' not allowed",
8110 } else if (warning.pointer_arith) {
8111 warningf(source_position,
8112 "pointer to a function '%T' used in arithmetic",
8119 static bool is_lvalue(const expression_t *expression)
8121 /* TODO: doesn't seem to be consistent with §6.3.2.1:1 */
8122 switch (expression->kind) {
8123 case EXPR_ARRAY_ACCESS:
8124 case EXPR_COMPOUND_LITERAL:
8125 case EXPR_REFERENCE:
8127 case EXPR_UNARY_DEREFERENCE:
8131 type_t *type = skip_typeref(expression->base.type);
8133 /* ISO/IEC 14882:1998(E) §3.10:3 */
8134 is_type_reference(type) ||
8135 /* Claim it is an lvalue, if the type is invalid. There was a parse
8136 * error before, which maybe prevented properly recognizing it as
8138 !is_type_valid(type);
8143 static void semantic_incdec(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_pointer(type)) {
8148 if (!check_pointer_arithmetic(&expression->base.source_position,
8152 } else if (!is_type_real(type) && is_type_valid(type)) {
8153 /* TODO: improve error message */
8154 errorf(&expression->base.source_position,
8155 "operation needs an arithmetic or pointer type");
8158 if (!is_lvalue(expression->value)) {
8159 /* TODO: improve error message */
8160 errorf(&expression->base.source_position, "lvalue required as operand");
8162 expression->base.type = orig_type;
8165 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
8167 type_t *const orig_type = expression->value->base.type;
8168 type_t *const type = skip_typeref(orig_type);
8169 if (!is_type_arithmetic(type)) {
8170 if (is_type_valid(type)) {
8171 /* TODO: improve error message */
8172 errorf(&expression->base.source_position,
8173 "operation needs an arithmetic type");
8178 expression->base.type = orig_type;
8181 static void semantic_unexpr_plus(unary_expression_t *expression)
8183 semantic_unexpr_arithmetic(expression);
8184 if (warning.traditional)
8185 warningf(&expression->base.source_position,
8186 "traditional C rejects the unary plus operator");
8189 static void semantic_not(unary_expression_t *expression)
8191 /* §6.5.3.3:1 The operand [...] of the ! operator, scalar type. */
8192 semantic_condition(expression->value, "operand of !");
8193 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8196 static void semantic_unexpr_integer(unary_expression_t *expression)
8198 type_t *const orig_type = expression->value->base.type;
8199 type_t *const type = skip_typeref(orig_type);
8200 if (!is_type_integer(type)) {
8201 if (is_type_valid(type)) {
8202 errorf(&expression->base.source_position,
8203 "operand of ~ must be of integer type");
8208 expression->base.type = orig_type;
8211 static void semantic_dereference(unary_expression_t *expression)
8213 type_t *const orig_type = expression->value->base.type;
8214 type_t *const type = skip_typeref(orig_type);
8215 if (!is_type_pointer(type)) {
8216 if (is_type_valid(type)) {
8217 errorf(&expression->base.source_position,
8218 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
8223 type_t *result_type = type->pointer.points_to;
8224 result_type = automatic_type_conversion(result_type);
8225 expression->base.type = result_type;
8229 * Record that an address is taken (expression represents an lvalue).
8231 * @param expression the expression
8232 * @param may_be_register if true, the expression might be an register
8234 static void set_address_taken(expression_t *expression, bool may_be_register)
8236 if (expression->kind != EXPR_REFERENCE)
8239 entity_t *const entity = expression->reference.entity;
8241 if (entity->kind != ENTITY_VARIABLE && entity->kind != ENTITY_PARAMETER)
8244 if (entity->declaration.storage_class == STORAGE_CLASS_REGISTER
8245 && !may_be_register) {
8246 errorf(&expression->base.source_position,
8247 "address of register %s '%Y' requested",
8248 get_entity_kind_name(entity->kind), entity->base.symbol);
8251 if (entity->kind == ENTITY_VARIABLE) {
8252 entity->variable.address_taken = true;
8254 assert(entity->kind == ENTITY_PARAMETER);
8255 entity->parameter.address_taken = true;
8260 * Check the semantic of the address taken expression.
8262 static void semantic_take_addr(unary_expression_t *expression)
8264 expression_t *value = expression->value;
8265 value->base.type = revert_automatic_type_conversion(value);
8267 type_t *orig_type = value->base.type;
8268 type_t *type = skip_typeref(orig_type);
8269 if (!is_type_valid(type))
8273 if (!is_lvalue(value)) {
8274 errorf(&expression->base.source_position, "'&' requires an lvalue");
8276 if (type->kind == TYPE_BITFIELD) {
8277 errorf(&expression->base.source_position,
8278 "'&' not allowed on object with bitfield type '%T'",
8282 set_address_taken(value, false);
8284 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
8287 #define CREATE_UNARY_EXPRESSION_PARSER(token_type, unexpression_type, sfunc) \
8288 static expression_t *parse_##unexpression_type(void) \
8290 expression_t *unary_expression \
8291 = allocate_expression_zero(unexpression_type); \
8293 unary_expression->unary.value = parse_sub_expression(PREC_UNARY); \
8295 sfunc(&unary_expression->unary); \
8297 return unary_expression; \
8300 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
8301 semantic_unexpr_arithmetic)
8302 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
8303 semantic_unexpr_plus)
8304 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
8306 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
8307 semantic_dereference)
8308 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
8310 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
8311 semantic_unexpr_integer)
8312 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
8314 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
8317 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_type, unexpression_type, \
8319 static expression_t *parse_##unexpression_type(expression_t *left) \
8321 expression_t *unary_expression \
8322 = allocate_expression_zero(unexpression_type); \
8324 unary_expression->unary.value = left; \
8326 sfunc(&unary_expression->unary); \
8328 return unary_expression; \
8331 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
8332 EXPR_UNARY_POSTFIX_INCREMENT,
8334 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
8335 EXPR_UNARY_POSTFIX_DECREMENT,
8338 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
8340 /* TODO: handle complex + imaginary types */
8342 type_left = get_unqualified_type(type_left);
8343 type_right = get_unqualified_type(type_right);
8345 /* §6.3.1.8 Usual arithmetic conversions */
8346 if (type_left == type_long_double || type_right == type_long_double) {
8347 return type_long_double;
8348 } else if (type_left == type_double || type_right == type_double) {
8350 } else if (type_left == type_float || type_right == type_float) {
8354 type_left = promote_integer(type_left);
8355 type_right = promote_integer(type_right);
8357 if (type_left == type_right)
8360 bool const signed_left = is_type_signed(type_left);
8361 bool const signed_right = is_type_signed(type_right);
8362 int const rank_left = get_rank(type_left);
8363 int const rank_right = get_rank(type_right);
8365 if (signed_left == signed_right)
8366 return rank_left >= rank_right ? type_left : type_right;
8375 u_rank = rank_right;
8376 u_type = type_right;
8378 s_rank = rank_right;
8379 s_type = type_right;
8384 if (u_rank >= s_rank)
8387 /* casting rank to atomic_type_kind is a bit hacky, but makes things
8389 if (get_atomic_type_size((atomic_type_kind_t) s_rank)
8390 > get_atomic_type_size((atomic_type_kind_t) u_rank))
8394 case ATOMIC_TYPE_INT: return type_unsigned_int;
8395 case ATOMIC_TYPE_LONG: return type_unsigned_long;
8396 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
8398 default: panic("invalid atomic type");
8403 * Check the semantic restrictions for a binary expression.
8405 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
8407 expression_t *const left = expression->left;
8408 expression_t *const right = expression->right;
8409 type_t *const orig_type_left = left->base.type;
8410 type_t *const orig_type_right = right->base.type;
8411 type_t *const type_left = skip_typeref(orig_type_left);
8412 type_t *const type_right = skip_typeref(orig_type_right);
8414 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8415 /* TODO: improve error message */
8416 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8417 errorf(&expression->base.source_position,
8418 "operation needs arithmetic types");
8423 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8424 expression->left = create_implicit_cast(left, arithmetic_type);
8425 expression->right = create_implicit_cast(right, arithmetic_type);
8426 expression->base.type = arithmetic_type;
8429 static void warn_div_by_zero(binary_expression_t const *const expression)
8431 if (!warning.div_by_zero ||
8432 !is_type_integer(expression->base.type))
8435 expression_t const *const right = expression->right;
8436 /* The type of the right operand can be different for /= */
8437 if (is_type_integer(right->base.type) &&
8438 is_constant_expression(right) &&
8439 !fold_constant_to_bool(right)) {
8440 warningf(&expression->base.source_position, "division by zero");
8445 * Check the semantic restrictions for a div/mod expression.
8447 static void semantic_divmod_arithmetic(binary_expression_t *expression)
8449 semantic_binexpr_arithmetic(expression);
8450 warn_div_by_zero(expression);
8453 static void warn_addsub_in_shift(const expression_t *const expr)
8455 if (expr->base.parenthesized)
8459 switch (expr->kind) {
8460 case EXPR_BINARY_ADD: op = '+'; break;
8461 case EXPR_BINARY_SUB: op = '-'; break;
8465 warningf(&expr->base.source_position,
8466 "suggest parentheses around '%c' inside shift", op);
8469 static bool semantic_shift(binary_expression_t *expression)
8471 expression_t *const left = expression->left;
8472 expression_t *const right = expression->right;
8473 type_t *const orig_type_left = left->base.type;
8474 type_t *const orig_type_right = right->base.type;
8475 type_t * type_left = skip_typeref(orig_type_left);
8476 type_t * type_right = skip_typeref(orig_type_right);
8478 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8479 /* TODO: improve error message */
8480 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8481 errorf(&expression->base.source_position,
8482 "operands of shift operation must have integer types");
8487 type_left = promote_integer(type_left);
8489 if (is_constant_expression(right)) {
8490 long count = fold_constant_to_int(right);
8492 warningf(&right->base.source_position,
8493 "shift count must be non-negative");
8494 } else if ((unsigned long)count >=
8495 get_atomic_type_size(type_left->atomic.akind) * 8) {
8496 warningf(&right->base.source_position,
8497 "shift count must be less than type width");
8501 type_right = promote_integer(type_right);
8502 expression->right = create_implicit_cast(right, type_right);
8507 static void semantic_shift_op(binary_expression_t *expression)
8509 expression_t *const left = expression->left;
8510 expression_t *const right = expression->right;
8512 if (!semantic_shift(expression))
8515 if (warning.parentheses) {
8516 warn_addsub_in_shift(left);
8517 warn_addsub_in_shift(right);
8520 type_t *const orig_type_left = left->base.type;
8521 type_t * type_left = skip_typeref(orig_type_left);
8523 type_left = promote_integer(type_left);
8524 expression->left = create_implicit_cast(left, type_left);
8525 expression->base.type = type_left;
8528 static void semantic_add(binary_expression_t *expression)
8530 expression_t *const left = expression->left;
8531 expression_t *const right = expression->right;
8532 type_t *const orig_type_left = left->base.type;
8533 type_t *const orig_type_right = right->base.type;
8534 type_t *const type_left = skip_typeref(orig_type_left);
8535 type_t *const type_right = skip_typeref(orig_type_right);
8538 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8539 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8540 expression->left = create_implicit_cast(left, arithmetic_type);
8541 expression->right = create_implicit_cast(right, arithmetic_type);
8542 expression->base.type = arithmetic_type;
8543 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8544 check_pointer_arithmetic(&expression->base.source_position,
8545 type_left, orig_type_left);
8546 expression->base.type = type_left;
8547 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
8548 check_pointer_arithmetic(&expression->base.source_position,
8549 type_right, orig_type_right);
8550 expression->base.type = type_right;
8551 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8552 errorf(&expression->base.source_position,
8553 "invalid operands to binary + ('%T', '%T')",
8554 orig_type_left, orig_type_right);
8558 static void semantic_sub(binary_expression_t *expression)
8560 expression_t *const left = expression->left;
8561 expression_t *const right = expression->right;
8562 type_t *const orig_type_left = left->base.type;
8563 type_t *const orig_type_right = right->base.type;
8564 type_t *const type_left = skip_typeref(orig_type_left);
8565 type_t *const type_right = skip_typeref(orig_type_right);
8566 source_position_t const *const pos = &expression->base.source_position;
8569 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8570 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8571 expression->left = create_implicit_cast(left, arithmetic_type);
8572 expression->right = create_implicit_cast(right, arithmetic_type);
8573 expression->base.type = arithmetic_type;
8574 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8575 check_pointer_arithmetic(&expression->base.source_position,
8576 type_left, orig_type_left);
8577 expression->base.type = type_left;
8578 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8579 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
8580 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
8581 if (!types_compatible(unqual_left, unqual_right)) {
8583 "subtracting pointers to incompatible types '%T' and '%T'",
8584 orig_type_left, orig_type_right);
8585 } else if (!is_type_object(unqual_left)) {
8586 if (!is_type_atomic(unqual_left, ATOMIC_TYPE_VOID)) {
8587 errorf(pos, "subtracting pointers to non-object types '%T'",
8589 } else if (warning.other) {
8590 warningf(pos, "subtracting pointers to void");
8593 expression->base.type = type_ptrdiff_t;
8594 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8595 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
8596 orig_type_left, orig_type_right);
8600 static void warn_string_literal_address(expression_t const* expr)
8602 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
8603 expr = expr->unary.value;
8604 if (expr->kind != EXPR_UNARY_DEREFERENCE)
8606 expr = expr->unary.value;
8609 if (expr->kind == EXPR_STRING_LITERAL ||
8610 expr->kind == EXPR_WIDE_STRING_LITERAL) {
8611 warningf(&expr->base.source_position,
8612 "comparison with string literal results in unspecified behaviour");
8616 static void warn_comparison_in_comparison(const expression_t *const expr)
8618 if (expr->base.parenthesized)
8620 switch (expr->base.kind) {
8621 case EXPR_BINARY_LESS:
8622 case EXPR_BINARY_GREATER:
8623 case EXPR_BINARY_LESSEQUAL:
8624 case EXPR_BINARY_GREATEREQUAL:
8625 case EXPR_BINARY_NOTEQUAL:
8626 case EXPR_BINARY_EQUAL:
8627 warningf(&expr->base.source_position,
8628 "comparisons like 'x <= y < z' do not have their mathematical meaning");
8635 static bool maybe_negative(expression_t const *const expr)
8638 !is_constant_expression(expr) ||
8639 fold_constant_to_int(expr) < 0;
8643 * Check the semantics of comparison expressions.
8645 * @param expression The expression to check.
8647 static void semantic_comparison(binary_expression_t *expression)
8649 expression_t *left = expression->left;
8650 expression_t *right = expression->right;
8652 if (warning.address) {
8653 warn_string_literal_address(left);
8654 warn_string_literal_address(right);
8656 expression_t const* const func_left = get_reference_address(left);
8657 if (func_left != NULL && is_null_pointer_constant(right)) {
8658 warningf(&expression->base.source_position,
8659 "the address of '%Y' will never be NULL",
8660 func_left->reference.entity->base.symbol);
8663 expression_t const* const func_right = get_reference_address(right);
8664 if (func_right != NULL && is_null_pointer_constant(right)) {
8665 warningf(&expression->base.source_position,
8666 "the address of '%Y' will never be NULL",
8667 func_right->reference.entity->base.symbol);
8671 if (warning.parentheses) {
8672 warn_comparison_in_comparison(left);
8673 warn_comparison_in_comparison(right);
8676 type_t *orig_type_left = left->base.type;
8677 type_t *orig_type_right = right->base.type;
8678 type_t *type_left = skip_typeref(orig_type_left);
8679 type_t *type_right = skip_typeref(orig_type_right);
8681 /* TODO non-arithmetic types */
8682 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8683 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8685 /* test for signed vs unsigned compares */
8686 if (warning.sign_compare && is_type_integer(arithmetic_type)) {
8687 bool const signed_left = is_type_signed(type_left);
8688 bool const signed_right = is_type_signed(type_right);
8689 if (signed_left != signed_right) {
8690 /* FIXME long long needs better const folding magic */
8691 /* TODO check whether constant value can be represented by other type */
8692 if ((signed_left && maybe_negative(left)) ||
8693 (signed_right && maybe_negative(right))) {
8694 warningf(&expression->base.source_position,
8695 "comparison between signed and unsigned");
8700 expression->left = create_implicit_cast(left, arithmetic_type);
8701 expression->right = create_implicit_cast(right, arithmetic_type);
8702 expression->base.type = arithmetic_type;
8703 if (warning.float_equal &&
8704 (expression->base.kind == EXPR_BINARY_EQUAL ||
8705 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
8706 is_type_float(arithmetic_type)) {
8707 warningf(&expression->base.source_position,
8708 "comparing floating point with == or != is unsafe");
8710 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8711 /* TODO check compatibility */
8712 } else if (is_type_pointer(type_left)) {
8713 expression->right = create_implicit_cast(right, type_left);
8714 } else if (is_type_pointer(type_right)) {
8715 expression->left = create_implicit_cast(left, type_right);
8716 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8717 type_error_incompatible("invalid operands in comparison",
8718 &expression->base.source_position,
8719 type_left, type_right);
8721 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8725 * Checks if a compound type has constant fields.
8727 static bool has_const_fields(const compound_type_t *type)
8729 compound_t *compound = type->compound;
8730 entity_t *entry = compound->members.entities;
8732 for (; entry != NULL; entry = entry->base.next) {
8733 if (!is_declaration(entry))
8736 const type_t *decl_type = skip_typeref(entry->declaration.type);
8737 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
8744 static bool is_valid_assignment_lhs(expression_t const* const left)
8746 type_t *const orig_type_left = revert_automatic_type_conversion(left);
8747 type_t *const type_left = skip_typeref(orig_type_left);
8749 if (!is_lvalue(left)) {
8750 errorf(HERE, "left hand side '%E' of assignment is not an lvalue",
8755 if (left->kind == EXPR_REFERENCE
8756 && left->reference.entity->kind == ENTITY_FUNCTION) {
8757 errorf(HERE, "cannot assign to function '%E'", left);
8761 if (is_type_array(type_left)) {
8762 errorf(HERE, "cannot assign to array '%E'", left);
8765 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
8766 errorf(HERE, "assignment to readonly location '%E' (type '%T')", left,
8770 if (is_type_incomplete(type_left)) {
8771 errorf(HERE, "left-hand side '%E' of assignment has incomplete type '%T'",
8772 left, orig_type_left);
8775 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
8776 errorf(HERE, "cannot assign to '%E' because compound type '%T' has readonly fields",
8777 left, orig_type_left);
8784 static void semantic_arithmetic_assign(binary_expression_t *expression)
8786 expression_t *left = expression->left;
8787 expression_t *right = expression->right;
8788 type_t *orig_type_left = left->base.type;
8789 type_t *orig_type_right = right->base.type;
8791 if (!is_valid_assignment_lhs(left))
8794 type_t *type_left = skip_typeref(orig_type_left);
8795 type_t *type_right = skip_typeref(orig_type_right);
8797 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8798 /* TODO: improve error message */
8799 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8800 errorf(&expression->base.source_position,
8801 "operation needs arithmetic types");
8806 /* combined instructions are tricky. We can't create an implicit cast on
8807 * the left side, because we need the uncasted form for the store.
8808 * The ast2firm pass has to know that left_type must be right_type
8809 * for the arithmetic operation and create a cast by itself */
8810 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8811 expression->right = create_implicit_cast(right, arithmetic_type);
8812 expression->base.type = type_left;
8815 static void semantic_divmod_assign(binary_expression_t *expression)
8817 semantic_arithmetic_assign(expression);
8818 warn_div_by_zero(expression);
8821 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
8823 expression_t *const left = expression->left;
8824 expression_t *const right = expression->right;
8825 type_t *const orig_type_left = left->base.type;
8826 type_t *const orig_type_right = right->base.type;
8827 type_t *const type_left = skip_typeref(orig_type_left);
8828 type_t *const type_right = skip_typeref(orig_type_right);
8830 if (!is_valid_assignment_lhs(left))
8833 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8834 /* combined instructions are tricky. We can't create an implicit cast on
8835 * the left side, because we need the uncasted form for the store.
8836 * The ast2firm pass has to know that left_type must be right_type
8837 * for the arithmetic operation and create a cast by itself */
8838 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
8839 expression->right = create_implicit_cast(right, arithmetic_type);
8840 expression->base.type = type_left;
8841 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8842 check_pointer_arithmetic(&expression->base.source_position,
8843 type_left, orig_type_left);
8844 expression->base.type = type_left;
8845 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8846 errorf(&expression->base.source_position,
8847 "incompatible types '%T' and '%T' in assignment",
8848 orig_type_left, orig_type_right);
8852 static void semantic_integer_assign(binary_expression_t *expression)
8854 expression_t *left = expression->left;
8855 expression_t *right = expression->right;
8856 type_t *orig_type_left = left->base.type;
8857 type_t *orig_type_right = right->base.type;
8859 if (!is_valid_assignment_lhs(left))
8862 type_t *type_left = skip_typeref(orig_type_left);
8863 type_t *type_right = skip_typeref(orig_type_right);
8865 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8866 /* TODO: improve error message */
8867 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8868 errorf(&expression->base.source_position,
8869 "operation needs integer types");
8874 /* combined instructions are tricky. We can't create an implicit cast on
8875 * the left side, because we need the uncasted form for the store.
8876 * The ast2firm pass has to know that left_type must be right_type
8877 * for the arithmetic operation and create a cast by itself */
8878 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8879 expression->right = create_implicit_cast(right, arithmetic_type);
8880 expression->base.type = type_left;
8883 static void semantic_shift_assign(binary_expression_t *expression)
8885 expression_t *left = expression->left;
8887 if (!is_valid_assignment_lhs(left))
8890 if (!semantic_shift(expression))
8893 expression->base.type = skip_typeref(left->base.type);
8896 static void warn_logical_and_within_or(const expression_t *const expr)
8898 if (expr->base.kind != EXPR_BINARY_LOGICAL_AND)
8900 if (expr->base.parenthesized)
8902 warningf(&expr->base.source_position,
8903 "suggest parentheses around && within ||");
8907 * Check the semantic restrictions of a logical expression.
8909 static void semantic_logical_op(binary_expression_t *expression)
8911 /* §6.5.13:2 Each of the operands shall have scalar type.
8912 * §6.5.14:2 Each of the operands shall have scalar type. */
8913 semantic_condition(expression->left, "left operand of logical operator");
8914 semantic_condition(expression->right, "right operand of logical operator");
8915 if (expression->base.kind == EXPR_BINARY_LOGICAL_OR &&
8916 warning.parentheses) {
8917 warn_logical_and_within_or(expression->left);
8918 warn_logical_and_within_or(expression->right);
8920 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8924 * Check the semantic restrictions of a binary assign expression.
8926 static void semantic_binexpr_assign(binary_expression_t *expression)
8928 expression_t *left = expression->left;
8929 type_t *orig_type_left = left->base.type;
8931 if (!is_valid_assignment_lhs(left))
8934 assign_error_t error = semantic_assign(orig_type_left, expression->right);
8935 report_assign_error(error, orig_type_left, expression->right,
8936 "assignment", &left->base.source_position);
8937 expression->right = create_implicit_cast(expression->right, orig_type_left);
8938 expression->base.type = orig_type_left;
8942 * Determine if the outermost operation (or parts thereof) of the given
8943 * expression has no effect in order to generate a warning about this fact.
8944 * Therefore in some cases this only examines some of the operands of the
8945 * expression (see comments in the function and examples below).
8947 * f() + 23; // warning, because + has no effect
8948 * x || f(); // no warning, because x controls execution of f()
8949 * x ? y : f(); // warning, because y has no effect
8950 * (void)x; // no warning to be able to suppress the warning
8951 * This function can NOT be used for an "expression has definitely no effect"-
8953 static bool expression_has_effect(const expression_t *const expr)
8955 switch (expr->kind) {
8956 case EXPR_UNKNOWN: break;
8957 case EXPR_INVALID: return true; /* do NOT warn */
8958 case EXPR_REFERENCE: return false;
8959 case EXPR_REFERENCE_ENUM_VALUE: return false;
8960 /* suppress the warning for microsoft __noop operations */
8961 case EXPR_CONST: return expr->conste.is_ms_noop;
8962 case EXPR_CHARACTER_CONSTANT: return false;
8963 case EXPR_WIDE_CHARACTER_CONSTANT: return false;
8964 case EXPR_STRING_LITERAL: return false;
8965 case EXPR_WIDE_STRING_LITERAL: return false;
8966 case EXPR_LABEL_ADDRESS: return false;
8969 const call_expression_t *const call = &expr->call;
8970 if (call->function->kind != EXPR_REFERENCE)
8973 switch (call->function->reference.entity->function.btk) {
8974 /* FIXME: which builtins have no effect? */
8975 default: return true;
8979 /* Generate the warning if either the left or right hand side of a
8980 * conditional expression has no effect */
8981 case EXPR_CONDITIONAL: {
8982 conditional_expression_t const *const cond = &expr->conditional;
8983 expression_t const *const t = cond->true_expression;
8985 (t == NULL || expression_has_effect(t)) &&
8986 expression_has_effect(cond->false_expression);
8989 case EXPR_SELECT: return false;
8990 case EXPR_ARRAY_ACCESS: return false;
8991 case EXPR_SIZEOF: return false;
8992 case EXPR_CLASSIFY_TYPE: return false;
8993 case EXPR_ALIGNOF: return false;
8995 case EXPR_FUNCNAME: return false;
8996 case EXPR_BUILTIN_CONSTANT_P: return false;
8997 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return false;
8998 case EXPR_OFFSETOF: return false;
8999 case EXPR_VA_START: return true;
9000 case EXPR_VA_ARG: return true;
9001 case EXPR_VA_COPY: return true;
9002 case EXPR_STATEMENT: return true; // TODO
9003 case EXPR_COMPOUND_LITERAL: return false;
9005 case EXPR_UNARY_NEGATE: return false;
9006 case EXPR_UNARY_PLUS: return false;
9007 case EXPR_UNARY_BITWISE_NEGATE: return false;
9008 case EXPR_UNARY_NOT: return false;
9009 case EXPR_UNARY_DEREFERENCE: return false;
9010 case EXPR_UNARY_TAKE_ADDRESS: return false;
9011 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
9012 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
9013 case EXPR_UNARY_PREFIX_INCREMENT: return true;
9014 case EXPR_UNARY_PREFIX_DECREMENT: return true;
9016 /* Treat void casts as if they have an effect in order to being able to
9017 * suppress the warning */
9018 case EXPR_UNARY_CAST: {
9019 type_t *const type = skip_typeref(expr->base.type);
9020 return is_type_atomic(type, ATOMIC_TYPE_VOID);
9023 case EXPR_UNARY_CAST_IMPLICIT: return true;
9024 case EXPR_UNARY_ASSUME: return true;
9025 case EXPR_UNARY_DELETE: return true;
9026 case EXPR_UNARY_DELETE_ARRAY: return true;
9027 case EXPR_UNARY_THROW: return true;
9029 case EXPR_BINARY_ADD: return false;
9030 case EXPR_BINARY_SUB: return false;
9031 case EXPR_BINARY_MUL: return false;
9032 case EXPR_BINARY_DIV: return false;
9033 case EXPR_BINARY_MOD: return false;
9034 case EXPR_BINARY_EQUAL: return false;
9035 case EXPR_BINARY_NOTEQUAL: return false;
9036 case EXPR_BINARY_LESS: return false;
9037 case EXPR_BINARY_LESSEQUAL: return false;
9038 case EXPR_BINARY_GREATER: return false;
9039 case EXPR_BINARY_GREATEREQUAL: return false;
9040 case EXPR_BINARY_BITWISE_AND: return false;
9041 case EXPR_BINARY_BITWISE_OR: return false;
9042 case EXPR_BINARY_BITWISE_XOR: return false;
9043 case EXPR_BINARY_SHIFTLEFT: return false;
9044 case EXPR_BINARY_SHIFTRIGHT: return false;
9045 case EXPR_BINARY_ASSIGN: return true;
9046 case EXPR_BINARY_MUL_ASSIGN: return true;
9047 case EXPR_BINARY_DIV_ASSIGN: return true;
9048 case EXPR_BINARY_MOD_ASSIGN: return true;
9049 case EXPR_BINARY_ADD_ASSIGN: return true;
9050 case EXPR_BINARY_SUB_ASSIGN: return true;
9051 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
9052 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
9053 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
9054 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
9055 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
9057 /* Only examine the right hand side of && and ||, because the left hand
9058 * side already has the effect of controlling the execution of the right
9060 case EXPR_BINARY_LOGICAL_AND:
9061 case EXPR_BINARY_LOGICAL_OR:
9062 /* Only examine the right hand side of a comma expression, because the left
9063 * hand side has a separate warning */
9064 case EXPR_BINARY_COMMA:
9065 return expression_has_effect(expr->binary.right);
9067 case EXPR_BINARY_ISGREATER: return false;
9068 case EXPR_BINARY_ISGREATEREQUAL: return false;
9069 case EXPR_BINARY_ISLESS: return false;
9070 case EXPR_BINARY_ISLESSEQUAL: return false;
9071 case EXPR_BINARY_ISLESSGREATER: return false;
9072 case EXPR_BINARY_ISUNORDERED: return false;
9075 internal_errorf(HERE, "unexpected expression");
9078 static void semantic_comma(binary_expression_t *expression)
9080 if (warning.unused_value) {
9081 const expression_t *const left = expression->left;
9082 if (!expression_has_effect(left)) {
9083 warningf(&left->base.source_position,
9084 "left-hand operand of comma expression has no effect");
9087 expression->base.type = expression->right->base.type;
9091 * @param prec_r precedence of the right operand
9093 #define CREATE_BINEXPR_PARSER(token_type, binexpression_type, prec_r, sfunc) \
9094 static expression_t *parse_##binexpression_type(expression_t *left) \
9096 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
9097 binexpr->binary.left = left; \
9100 expression_t *right = parse_sub_expression(prec_r); \
9102 binexpr->binary.right = right; \
9103 sfunc(&binexpr->binary); \
9108 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, PREC_CAST, semantic_binexpr_arithmetic)
9109 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, PREC_CAST, semantic_divmod_arithmetic)
9110 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, PREC_CAST, semantic_divmod_arithmetic)
9111 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, PREC_MULTIPLICATIVE, semantic_add)
9112 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, PREC_MULTIPLICATIVE, semantic_sub)
9113 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT, PREC_ADDITIVE, semantic_shift_op)
9114 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT, PREC_ADDITIVE, semantic_shift_op)
9115 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, PREC_SHIFT, semantic_comparison)
9116 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, PREC_SHIFT, semantic_comparison)
9117 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL, PREC_SHIFT, semantic_comparison)
9118 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL, PREC_SHIFT, semantic_comparison)
9119 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL, PREC_RELATIONAL, semantic_comparison)
9120 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL, PREC_RELATIONAL, semantic_comparison)
9121 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND, PREC_EQUALITY, semantic_binexpr_arithmetic)
9122 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR, PREC_AND, semantic_binexpr_arithmetic)
9123 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR, PREC_XOR, semantic_binexpr_arithmetic)
9124 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND, PREC_OR, semantic_logical_op)
9125 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR, PREC_LOGICAL_AND, semantic_logical_op)
9126 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, PREC_ASSIGNMENT, semantic_binexpr_assign)
9127 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
9128 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
9129 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
9130 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
9131 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
9132 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
9133 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
9134 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
9135 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
9136 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
9137 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, PREC_ASSIGNMENT, semantic_comma)
9140 static expression_t *parse_sub_expression(precedence_t precedence)
9142 if (token.type < 0) {
9143 return expected_expression_error();
9146 expression_parser_function_t *parser
9147 = &expression_parsers[token.type];
9148 source_position_t source_position = token.source_position;
9151 if (parser->parser != NULL) {
9152 left = parser->parser();
9154 left = parse_primary_expression();
9156 assert(left != NULL);
9157 left->base.source_position = source_position;
9160 if (token.type < 0) {
9161 return expected_expression_error();
9164 parser = &expression_parsers[token.type];
9165 if (parser->infix_parser == NULL)
9167 if (parser->infix_precedence < precedence)
9170 left = parser->infix_parser(left);
9172 assert(left != NULL);
9173 assert(left->kind != EXPR_UNKNOWN);
9174 left->base.source_position = source_position;
9181 * Parse an expression.
9183 static expression_t *parse_expression(void)
9185 return parse_sub_expression(PREC_EXPRESSION);
9189 * Register a parser for a prefix-like operator.
9191 * @param parser the parser function
9192 * @param token_type the token type of the prefix token
9194 static void register_expression_parser(parse_expression_function parser,
9197 expression_parser_function_t *entry = &expression_parsers[token_type];
9199 if (entry->parser != NULL) {
9200 diagnosticf("for token '%k'\n", (token_type_t)token_type);
9201 panic("trying to register multiple expression parsers for a token");
9203 entry->parser = parser;
9207 * Register a parser for an infix operator with given precedence.
9209 * @param parser the parser function
9210 * @param token_type the token type of the infix operator
9211 * @param precedence the precedence of the operator
9213 static void register_infix_parser(parse_expression_infix_function parser,
9214 int token_type, precedence_t precedence)
9216 expression_parser_function_t *entry = &expression_parsers[token_type];
9218 if (entry->infix_parser != NULL) {
9219 diagnosticf("for token '%k'\n", (token_type_t)token_type);
9220 panic("trying to register multiple infix expression parsers for a "
9223 entry->infix_parser = parser;
9224 entry->infix_precedence = precedence;
9228 * Initialize the expression parsers.
9230 static void init_expression_parsers(void)
9232 memset(&expression_parsers, 0, sizeof(expression_parsers));
9234 register_infix_parser(parse_array_expression, '[', PREC_POSTFIX);
9235 register_infix_parser(parse_call_expression, '(', PREC_POSTFIX);
9236 register_infix_parser(parse_select_expression, '.', PREC_POSTFIX);
9237 register_infix_parser(parse_select_expression, T_MINUSGREATER, PREC_POSTFIX);
9238 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT, T_PLUSPLUS, PREC_POSTFIX);
9239 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT, T_MINUSMINUS, PREC_POSTFIX);
9240 register_infix_parser(parse_EXPR_BINARY_MUL, '*', PREC_MULTIPLICATIVE);
9241 register_infix_parser(parse_EXPR_BINARY_DIV, '/', PREC_MULTIPLICATIVE);
9242 register_infix_parser(parse_EXPR_BINARY_MOD, '%', PREC_MULTIPLICATIVE);
9243 register_infix_parser(parse_EXPR_BINARY_ADD, '+', PREC_ADDITIVE);
9244 register_infix_parser(parse_EXPR_BINARY_SUB, '-', PREC_ADDITIVE);
9245 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, PREC_SHIFT);
9246 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, PREC_SHIFT);
9247 register_infix_parser(parse_EXPR_BINARY_LESS, '<', PREC_RELATIONAL);
9248 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', PREC_RELATIONAL);
9249 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, PREC_RELATIONAL);
9250 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, PREC_RELATIONAL);
9251 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, PREC_EQUALITY);
9252 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL, T_EXCLAMATIONMARKEQUAL, PREC_EQUALITY);
9253 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', PREC_AND);
9254 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', PREC_XOR);
9255 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', PREC_OR);
9256 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, PREC_LOGICAL_AND);
9257 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, PREC_LOGICAL_OR);
9258 register_infix_parser(parse_conditional_expression, '?', PREC_CONDITIONAL);
9259 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', PREC_ASSIGNMENT);
9260 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, PREC_ASSIGNMENT);
9261 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, PREC_ASSIGNMENT);
9262 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, PREC_ASSIGNMENT);
9263 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, PREC_ASSIGNMENT);
9264 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, PREC_ASSIGNMENT);
9265 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN, T_LESSLESSEQUAL, PREC_ASSIGNMENT);
9266 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN, T_GREATERGREATEREQUAL, PREC_ASSIGNMENT);
9267 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN, T_ANDEQUAL, PREC_ASSIGNMENT);
9268 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN, T_PIPEEQUAL, PREC_ASSIGNMENT);
9269 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN, T_CARETEQUAL, PREC_ASSIGNMENT);
9270 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', PREC_EXPRESSION);
9272 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-');
9273 register_expression_parser(parse_EXPR_UNARY_PLUS, '+');
9274 register_expression_parser(parse_EXPR_UNARY_NOT, '!');
9275 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~');
9276 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*');
9277 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&');
9278 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT, T_PLUSPLUS);
9279 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT, T_MINUSMINUS);
9280 register_expression_parser(parse_sizeof, T_sizeof);
9281 register_expression_parser(parse_alignof, T___alignof__);
9282 register_expression_parser(parse_extension, T___extension__);
9283 register_expression_parser(parse_builtin_classify_type, T___builtin_classify_type);
9284 register_expression_parser(parse_delete, T_delete);
9285 register_expression_parser(parse_throw, T_throw);
9289 * Parse a asm statement arguments specification.
9291 static asm_argument_t *parse_asm_arguments(bool is_out)
9293 asm_argument_t *result = NULL;
9294 asm_argument_t **anchor = &result;
9296 while (token.type == T_STRING_LITERAL || token.type == '[') {
9297 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
9298 memset(argument, 0, sizeof(argument[0]));
9300 if (token.type == '[') {
9302 if (token.type != T_IDENTIFIER) {
9303 parse_error_expected("while parsing asm argument",
9304 T_IDENTIFIER, NULL);
9307 argument->symbol = token.v.symbol;
9309 expect(']', end_error);
9312 argument->constraints = parse_string_literals();
9313 expect('(', end_error);
9314 add_anchor_token(')');
9315 expression_t *expression = parse_expression();
9316 rem_anchor_token(')');
9318 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
9319 * change size or type representation (e.g. int -> long is ok, but
9320 * int -> float is not) */
9321 if (expression->kind == EXPR_UNARY_CAST) {
9322 type_t *const type = expression->base.type;
9323 type_kind_t const kind = type->kind;
9324 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
9327 if (kind == TYPE_ATOMIC) {
9328 atomic_type_kind_t const akind = type->atomic.akind;
9329 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9330 size = get_atomic_type_size(akind);
9332 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9333 size = get_atomic_type_size(get_intptr_kind());
9337 expression_t *const value = expression->unary.value;
9338 type_t *const value_type = value->base.type;
9339 type_kind_t const value_kind = value_type->kind;
9341 unsigned value_flags;
9342 unsigned value_size;
9343 if (value_kind == TYPE_ATOMIC) {
9344 atomic_type_kind_t const value_akind = value_type->atomic.akind;
9345 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9346 value_size = get_atomic_type_size(value_akind);
9347 } else if (value_kind == TYPE_POINTER) {
9348 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9349 value_size = get_atomic_type_size(get_intptr_kind());
9354 if (value_flags != flags || value_size != size)
9358 } while (expression->kind == EXPR_UNARY_CAST);
9362 if (!is_lvalue(expression)) {
9363 errorf(&expression->base.source_position,
9364 "asm output argument is not an lvalue");
9367 if (argument->constraints.begin[0] == '+')
9368 mark_vars_read(expression, NULL);
9370 mark_vars_read(expression, NULL);
9372 argument->expression = expression;
9373 expect(')', end_error);
9375 set_address_taken(expression, true);
9378 anchor = &argument->next;
9380 if (token.type != ',')
9391 * Parse a asm statement clobber specification.
9393 static asm_clobber_t *parse_asm_clobbers(void)
9395 asm_clobber_t *result = NULL;
9396 asm_clobber_t *last = NULL;
9398 while (token.type == T_STRING_LITERAL) {
9399 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
9400 clobber->clobber = parse_string_literals();
9403 last->next = clobber;
9409 if (token.type != ',')
9418 * Parse an asm statement.
9420 static statement_t *parse_asm_statement(void)
9422 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
9423 asm_statement_t *asm_statement = &statement->asms;
9427 if (token.type == T_volatile) {
9429 asm_statement->is_volatile = true;
9432 expect('(', end_error);
9433 add_anchor_token(')');
9434 add_anchor_token(':');
9435 asm_statement->asm_text = parse_string_literals();
9437 if (token.type != ':') {
9438 rem_anchor_token(':');
9443 asm_statement->outputs = parse_asm_arguments(true);
9444 if (token.type != ':') {
9445 rem_anchor_token(':');
9450 asm_statement->inputs = parse_asm_arguments(false);
9451 if (token.type != ':') {
9452 rem_anchor_token(':');
9455 rem_anchor_token(':');
9458 asm_statement->clobbers = parse_asm_clobbers();
9461 rem_anchor_token(')');
9462 expect(')', end_error);
9463 expect(';', end_error);
9465 if (asm_statement->outputs == NULL) {
9466 /* GCC: An 'asm' instruction without any output operands will be treated
9467 * identically to a volatile 'asm' instruction. */
9468 asm_statement->is_volatile = true;
9473 return create_invalid_statement();
9477 * Parse a case statement.
9479 static statement_t *parse_case_statement(void)
9481 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9482 source_position_t *const pos = &statement->base.source_position;
9486 expression_t *const expression = parse_expression();
9487 statement->case_label.expression = expression;
9488 if (!is_constant_expression(expression)) {
9489 /* This check does not prevent the error message in all cases of an
9490 * prior error while parsing the expression. At least it catches the
9491 * common case of a mistyped enum entry. */
9492 if (is_type_valid(skip_typeref(expression->base.type))) {
9493 errorf(pos, "case label does not reduce to an integer constant");
9495 statement->case_label.is_bad = true;
9497 long const val = fold_constant_to_int(expression);
9498 statement->case_label.first_case = val;
9499 statement->case_label.last_case = val;
9503 if (token.type == T_DOTDOTDOT) {
9505 expression_t *const end_range = parse_expression();
9506 statement->case_label.end_range = end_range;
9507 if (!is_constant_expression(end_range)) {
9508 /* This check does not prevent the error message in all cases of an
9509 * prior error while parsing the expression. At least it catches the
9510 * common case of a mistyped enum entry. */
9511 if (is_type_valid(skip_typeref(end_range->base.type))) {
9512 errorf(pos, "case range does not reduce to an integer constant");
9514 statement->case_label.is_bad = true;
9516 long const val = fold_constant_to_int(end_range);
9517 statement->case_label.last_case = val;
9519 if (warning.other && val < statement->case_label.first_case) {
9520 statement->case_label.is_empty_range = true;
9521 warningf(pos, "empty range specified");
9527 PUSH_PARENT(statement);
9529 expect(':', end_error);
9532 if (current_switch != NULL) {
9533 if (! statement->case_label.is_bad) {
9534 /* Check for duplicate case values */
9535 case_label_statement_t *c = &statement->case_label;
9536 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
9537 if (l->is_bad || l->is_empty_range || l->expression == NULL)
9540 if (c->last_case < l->first_case || c->first_case > l->last_case)
9543 errorf(pos, "duplicate case value (previously used %P)",
9544 &l->base.source_position);
9548 /* link all cases into the switch statement */
9549 if (current_switch->last_case == NULL) {
9550 current_switch->first_case = &statement->case_label;
9552 current_switch->last_case->next = &statement->case_label;
9554 current_switch->last_case = &statement->case_label;
9556 errorf(pos, "case label not within a switch statement");
9559 statement_t *const inner_stmt = parse_statement();
9560 statement->case_label.statement = inner_stmt;
9561 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9562 errorf(&inner_stmt->base.source_position, "declaration after case label");
9570 * Parse a default statement.
9572 static statement_t *parse_default_statement(void)
9574 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9578 PUSH_PARENT(statement);
9580 expect(':', end_error);
9581 if (current_switch != NULL) {
9582 const case_label_statement_t *def_label = current_switch->default_label;
9583 if (def_label != NULL) {
9584 errorf(HERE, "multiple default labels in one switch (previous declared %P)",
9585 &def_label->base.source_position);
9587 current_switch->default_label = &statement->case_label;
9589 /* link all cases into the switch statement */
9590 if (current_switch->last_case == NULL) {
9591 current_switch->first_case = &statement->case_label;
9593 current_switch->last_case->next = &statement->case_label;
9595 current_switch->last_case = &statement->case_label;
9598 errorf(&statement->base.source_position,
9599 "'default' label not within a switch statement");
9602 statement_t *const inner_stmt = parse_statement();
9603 statement->case_label.statement = inner_stmt;
9604 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9605 errorf(&inner_stmt->base.source_position, "declaration after default label");
9612 return create_invalid_statement();
9616 * Parse a label statement.
9618 static statement_t *parse_label_statement(void)
9620 assert(token.type == T_IDENTIFIER);
9621 symbol_t *symbol = token.v.symbol;
9622 label_t *label = get_label(symbol);
9624 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
9625 statement->label.label = label;
9629 PUSH_PARENT(statement);
9631 /* if statement is already set then the label is defined twice,
9632 * otherwise it was just mentioned in a goto/local label declaration so far
9634 if (label->statement != NULL) {
9635 errorf(HERE, "duplicate label '%Y' (declared %P)",
9636 symbol, &label->base.source_position);
9638 label->base.source_position = token.source_position;
9639 label->statement = statement;
9644 if (token.type == '}') {
9645 /* TODO only warn? */
9646 if (warning.other && false) {
9647 warningf(HERE, "label at end of compound statement");
9648 statement->label.statement = create_empty_statement();
9650 errorf(HERE, "label at end of compound statement");
9651 statement->label.statement = create_invalid_statement();
9653 } else if (token.type == ';') {
9654 /* Eat an empty statement here, to avoid the warning about an empty
9655 * statement after a label. label:; is commonly used to have a label
9656 * before a closing brace. */
9657 statement->label.statement = create_empty_statement();
9660 statement_t *const inner_stmt = parse_statement();
9661 statement->label.statement = inner_stmt;
9662 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9663 errorf(&inner_stmt->base.source_position, "declaration after label");
9667 /* remember the labels in a list for later checking */
9668 *label_anchor = &statement->label;
9669 label_anchor = &statement->label.next;
9676 * Parse an if statement.
9678 static statement_t *parse_if(void)
9680 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
9684 PUSH_PARENT(statement);
9686 add_anchor_token('{');
9688 expect('(', end_error);
9689 add_anchor_token(')');
9690 expression_t *const expr = parse_expression();
9691 statement->ifs.condition = expr;
9692 /* §6.8.4.1:1 The controlling expression of an if statement shall have
9694 semantic_condition(expr, "condition of 'if'-statment");
9695 mark_vars_read(expr, NULL);
9696 rem_anchor_token(')');
9697 expect(')', end_error);
9700 rem_anchor_token('{');
9702 add_anchor_token(T_else);
9703 statement_t *const true_stmt = parse_statement();
9704 statement->ifs.true_statement = true_stmt;
9705 rem_anchor_token(T_else);
9707 if (token.type == T_else) {
9709 statement->ifs.false_statement = parse_statement();
9710 } else if (warning.parentheses &&
9711 true_stmt->kind == STATEMENT_IF &&
9712 true_stmt->ifs.false_statement != NULL) {
9713 warningf(&true_stmt->base.source_position,
9714 "suggest explicit braces to avoid ambiguous 'else'");
9722 * Check that all enums are handled in a switch.
9724 * @param statement the switch statement to check
9726 static void check_enum_cases(const switch_statement_t *statement)
9728 const type_t *type = skip_typeref(statement->expression->base.type);
9729 if (! is_type_enum(type))
9731 const enum_type_t *enumt = &type->enumt;
9733 /* if we have a default, no warnings */
9734 if (statement->default_label != NULL)
9737 /* FIXME: calculation of value should be done while parsing */
9738 /* TODO: quadratic algorithm here. Change to an n log n one */
9739 long last_value = -1;
9740 const entity_t *entry = enumt->enume->base.next;
9741 for (; entry != NULL && entry->kind == ENTITY_ENUM_VALUE;
9742 entry = entry->base.next) {
9743 const expression_t *expression = entry->enum_value.value;
9744 long value = expression != NULL ? fold_constant_to_int(expression) : last_value + 1;
9746 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
9747 if (l->expression == NULL)
9749 if (l->first_case <= value && value <= l->last_case) {
9755 warningf(&statement->base.source_position,
9756 "enumeration value '%Y' not handled in switch",
9757 entry->base.symbol);
9764 * Parse a switch statement.
9766 static statement_t *parse_switch(void)
9768 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
9772 PUSH_PARENT(statement);
9774 expect('(', end_error);
9775 add_anchor_token(')');
9776 expression_t *const expr = parse_expression();
9777 mark_vars_read(expr, NULL);
9778 type_t * type = skip_typeref(expr->base.type);
9779 if (is_type_integer(type)) {
9780 type = promote_integer(type);
9781 if (warning.traditional) {
9782 if (get_rank(type) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
9783 warningf(&expr->base.source_position,
9784 "'%T' switch expression not converted to '%T' in ISO C",
9788 } else if (is_type_valid(type)) {
9789 errorf(&expr->base.source_position,
9790 "switch quantity is not an integer, but '%T'", type);
9791 type = type_error_type;
9793 statement->switchs.expression = create_implicit_cast(expr, type);
9794 expect(')', end_error);
9795 rem_anchor_token(')');
9797 switch_statement_t *rem = current_switch;
9798 current_switch = &statement->switchs;
9799 statement->switchs.body = parse_statement();
9800 current_switch = rem;
9802 if (warning.switch_default &&
9803 statement->switchs.default_label == NULL) {
9804 warningf(&statement->base.source_position, "switch has no default case");
9806 if (warning.switch_enum)
9807 check_enum_cases(&statement->switchs);
9813 return create_invalid_statement();
9816 static statement_t *parse_loop_body(statement_t *const loop)
9818 statement_t *const rem = current_loop;
9819 current_loop = loop;
9821 statement_t *const body = parse_statement();
9828 * Parse a while statement.
9830 static statement_t *parse_while(void)
9832 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
9836 PUSH_PARENT(statement);
9838 expect('(', end_error);
9839 add_anchor_token(')');
9840 expression_t *const cond = parse_expression();
9841 statement->whiles.condition = cond;
9842 /* §6.8.5:2 The controlling expression of an iteration statement shall
9843 * have scalar type. */
9844 semantic_condition(cond, "condition of 'while'-statement");
9845 mark_vars_read(cond, NULL);
9846 rem_anchor_token(')');
9847 expect(')', end_error);
9849 statement->whiles.body = parse_loop_body(statement);
9855 return create_invalid_statement();
9859 * Parse a do statement.
9861 static statement_t *parse_do(void)
9863 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
9867 PUSH_PARENT(statement);
9869 add_anchor_token(T_while);
9870 statement->do_while.body = parse_loop_body(statement);
9871 rem_anchor_token(T_while);
9873 expect(T_while, end_error);
9874 expect('(', end_error);
9875 add_anchor_token(')');
9876 expression_t *const cond = parse_expression();
9877 statement->do_while.condition = cond;
9878 /* §6.8.5:2 The controlling expression of an iteration statement shall
9879 * have scalar type. */
9880 semantic_condition(cond, "condition of 'do-while'-statement");
9881 mark_vars_read(cond, NULL);
9882 rem_anchor_token(')');
9883 expect(')', end_error);
9884 expect(';', end_error);
9890 return create_invalid_statement();
9894 * Parse a for statement.
9896 static statement_t *parse_for(void)
9898 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9902 expect('(', end_error1);
9903 add_anchor_token(')');
9905 PUSH_PARENT(statement);
9907 size_t const top = environment_top();
9908 scope_t *old_scope = scope_push(&statement->fors.scope);
9910 bool old_gcc_extension = in_gcc_extension;
9911 while (token.type == T___extension__) {
9913 in_gcc_extension = true;
9916 if (token.type == ';') {
9918 } else if (is_declaration_specifier(&token, false)) {
9919 parse_declaration(record_entity, DECL_FLAGS_NONE);
9921 add_anchor_token(';');
9922 expression_t *const init = parse_expression();
9923 statement->fors.initialisation = init;
9924 mark_vars_read(init, ENT_ANY);
9925 if (warning.unused_value && !expression_has_effect(init)) {
9926 warningf(&init->base.source_position,
9927 "initialisation of 'for'-statement has no effect");
9929 rem_anchor_token(';');
9930 expect(';', end_error2);
9932 in_gcc_extension = old_gcc_extension;
9934 if (token.type != ';') {
9935 add_anchor_token(';');
9936 expression_t *const cond = parse_expression();
9937 statement->fors.condition = cond;
9938 /* §6.8.5:2 The controlling expression of an iteration statement
9939 * shall have scalar type. */
9940 semantic_condition(cond, "condition of 'for'-statement");
9941 mark_vars_read(cond, NULL);
9942 rem_anchor_token(';');
9944 expect(';', end_error2);
9945 if (token.type != ')') {
9946 expression_t *const step = parse_expression();
9947 statement->fors.step = step;
9948 mark_vars_read(step, ENT_ANY);
9949 if (warning.unused_value && !expression_has_effect(step)) {
9950 warningf(&step->base.source_position,
9951 "step of 'for'-statement has no effect");
9954 expect(')', end_error2);
9955 rem_anchor_token(')');
9956 statement->fors.body = parse_loop_body(statement);
9958 assert(current_scope == &statement->fors.scope);
9959 scope_pop(old_scope);
9960 environment_pop_to(top);
9967 rem_anchor_token(')');
9968 assert(current_scope == &statement->fors.scope);
9969 scope_pop(old_scope);
9970 environment_pop_to(top);
9974 return create_invalid_statement();
9978 * Parse a goto statement.
9980 static statement_t *parse_goto(void)
9982 statement_t *statement = allocate_statement_zero(STATEMENT_GOTO);
9985 if (GNU_MODE && token.type == '*') {
9987 expression_t *expression = parse_expression();
9988 mark_vars_read(expression, NULL);
9990 /* Argh: although documentation says the expression must be of type void*,
9991 * gcc accepts anything that can be casted into void* without error */
9992 type_t *type = expression->base.type;
9994 if (type != type_error_type) {
9995 if (!is_type_pointer(type) && !is_type_integer(type)) {
9996 errorf(&expression->base.source_position,
9997 "cannot convert to a pointer type");
9998 } else if (warning.other && type != type_void_ptr) {
9999 warningf(&expression->base.source_position,
10000 "type of computed goto expression should be 'void*' not '%T'", type);
10002 expression = create_implicit_cast(expression, type_void_ptr);
10005 statement->gotos.expression = expression;
10006 } else if (token.type == T_IDENTIFIER) {
10007 symbol_t *symbol = token.v.symbol;
10009 statement->gotos.label = get_label(symbol);
10012 parse_error_expected("while parsing goto", T_IDENTIFIER, '*', NULL);
10014 parse_error_expected("while parsing goto", T_IDENTIFIER, NULL);
10015 eat_until_anchor();
10019 /* remember the goto's in a list for later checking */
10020 *goto_anchor = &statement->gotos;
10021 goto_anchor = &statement->gotos.next;
10023 expect(';', end_error);
10027 return create_invalid_statement();
10031 * Parse a continue statement.
10033 static statement_t *parse_continue(void)
10035 if (current_loop == NULL) {
10036 errorf(HERE, "continue statement not within loop");
10039 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
10042 expect(';', end_error);
10049 * Parse a break statement.
10051 static statement_t *parse_break(void)
10053 if (current_switch == NULL && current_loop == NULL) {
10054 errorf(HERE, "break statement not within loop or switch");
10057 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
10060 expect(';', end_error);
10067 * Parse a __leave statement.
10069 static statement_t *parse_leave_statement(void)
10071 if (current_try == NULL) {
10072 errorf(HERE, "__leave statement not within __try");
10075 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
10078 expect(';', end_error);
10085 * Check if a given entity represents a local variable.
10087 static bool is_local_variable(const entity_t *entity)
10089 if (entity->kind != ENTITY_VARIABLE)
10092 switch ((storage_class_tag_t) entity->declaration.storage_class) {
10093 case STORAGE_CLASS_AUTO:
10094 case STORAGE_CLASS_REGISTER: {
10095 const type_t *type = skip_typeref(entity->declaration.type);
10096 if (is_type_function(type)) {
10108 * Check if a given expression represents a local variable.
10110 static bool expression_is_local_variable(const expression_t *expression)
10112 if (expression->base.kind != EXPR_REFERENCE) {
10115 const entity_t *entity = expression->reference.entity;
10116 return is_local_variable(entity);
10120 * Check if a given expression represents a local variable and
10121 * return its declaration then, else return NULL.
10123 entity_t *expression_is_variable(const expression_t *expression)
10125 if (expression->base.kind != EXPR_REFERENCE) {
10128 entity_t *entity = expression->reference.entity;
10129 if (entity->kind != ENTITY_VARIABLE)
10136 * Parse a return statement.
10138 static statement_t *parse_return(void)
10142 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
10144 expression_t *return_value = NULL;
10145 if (token.type != ';') {
10146 return_value = parse_expression();
10147 mark_vars_read(return_value, NULL);
10150 const type_t *const func_type = skip_typeref(current_function->base.type);
10151 assert(is_type_function(func_type));
10152 type_t *const return_type = skip_typeref(func_type->function.return_type);
10154 source_position_t const *const pos = &statement->base.source_position;
10155 if (return_value != NULL) {
10156 type_t *return_value_type = skip_typeref(return_value->base.type);
10158 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
10159 if (is_type_atomic(return_value_type, ATOMIC_TYPE_VOID)) {
10160 /* ISO/IEC 14882:1998(E) §6.6.3:2 */
10161 /* Only warn in C mode, because GCC does the same */
10162 if (c_mode & _CXX || strict_mode) {
10164 "'return' with a value, in function returning 'void'");
10165 } else if (warning.other) {
10167 "'return' with a value, in function returning 'void'");
10169 } else if (!(c_mode & _CXX)) { /* ISO/IEC 14882:1998(E) §6.6.3:3 */
10170 /* Only warn in C mode, because GCC does the same */
10173 "'return' with expression in function returning 'void'");
10174 } else if (warning.other) {
10176 "'return' with expression in function returning 'void'");
10180 assign_error_t error = semantic_assign(return_type, return_value);
10181 report_assign_error(error, return_type, return_value, "'return'",
10184 return_value = create_implicit_cast(return_value, return_type);
10185 /* check for returning address of a local var */
10186 if (warning.other && return_value != NULL
10187 && return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
10188 const expression_t *expression = return_value->unary.value;
10189 if (expression_is_local_variable(expression)) {
10190 warningf(pos, "function returns address of local variable");
10193 } else if (warning.other && !is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
10194 /* ISO/IEC 14882:1998(E) §6.6.3:3 */
10195 if (c_mode & _CXX || strict_mode) {
10197 "'return' without value, in function returning non-void");
10200 "'return' without value, in function returning non-void");
10203 statement->returns.value = return_value;
10205 expect(';', end_error);
10212 * Parse a declaration statement.
10214 static statement_t *parse_declaration_statement(void)
10216 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
10218 entity_t *before = current_scope->last_entity;
10220 parse_external_declaration();
10222 parse_declaration(record_entity, DECL_FLAGS_NONE);
10225 declaration_statement_t *const decl = &statement->declaration;
10226 entity_t *const begin =
10227 before != NULL ? before->base.next : current_scope->entities;
10228 decl->declarations_begin = begin;
10229 decl->declarations_end = begin != NULL ? current_scope->last_entity : NULL;
10235 * Parse an expression statement, ie. expr ';'.
10237 static statement_t *parse_expression_statement(void)
10239 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10241 expression_t *const expr = parse_expression();
10242 statement->expression.expression = expr;
10243 mark_vars_read(expr, ENT_ANY);
10245 expect(';', end_error);
10252 * Parse a microsoft __try { } __finally { } or
10253 * __try{ } __except() { }
10255 static statement_t *parse_ms_try_statment(void)
10257 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
10260 PUSH_PARENT(statement);
10262 ms_try_statement_t *rem = current_try;
10263 current_try = &statement->ms_try;
10264 statement->ms_try.try_statement = parse_compound_statement(false);
10269 if (token.type == T___except) {
10271 expect('(', end_error);
10272 add_anchor_token(')');
10273 expression_t *const expr = parse_expression();
10274 mark_vars_read(expr, NULL);
10275 type_t * type = skip_typeref(expr->base.type);
10276 if (is_type_integer(type)) {
10277 type = promote_integer(type);
10278 } else if (is_type_valid(type)) {
10279 errorf(&expr->base.source_position,
10280 "__expect expression is not an integer, but '%T'", type);
10281 type = type_error_type;
10283 statement->ms_try.except_expression = create_implicit_cast(expr, type);
10284 rem_anchor_token(')');
10285 expect(')', end_error);
10286 statement->ms_try.final_statement = parse_compound_statement(false);
10287 } else if (token.type == T__finally) {
10289 statement->ms_try.final_statement = parse_compound_statement(false);
10291 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
10292 return create_invalid_statement();
10296 return create_invalid_statement();
10299 static statement_t *parse_empty_statement(void)
10301 if (warning.empty_statement) {
10302 warningf(HERE, "statement is empty");
10304 statement_t *const statement = create_empty_statement();
10309 static statement_t *parse_local_label_declaration(void)
10311 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
10315 entity_t *begin = NULL, *end = NULL;
10318 if (token.type != T_IDENTIFIER) {
10319 parse_error_expected("while parsing local label declaration",
10320 T_IDENTIFIER, NULL);
10323 symbol_t *symbol = token.v.symbol;
10324 entity_t *entity = get_entity(symbol, NAMESPACE_LABEL);
10325 if (entity != NULL && entity->base.parent_scope == current_scope) {
10326 errorf(HERE, "multiple definitions of '__label__ %Y' (previous definition %P)",
10327 symbol, &entity->base.source_position);
10329 entity = allocate_entity_zero(ENTITY_LOCAL_LABEL);
10331 entity->base.parent_scope = current_scope;
10332 entity->base.namespc = NAMESPACE_LABEL;
10333 entity->base.source_position = token.source_position;
10334 entity->base.symbol = symbol;
10337 end->base.next = entity;
10342 environment_push(entity);
10346 if (token.type != ',')
10352 statement->declaration.declarations_begin = begin;
10353 statement->declaration.declarations_end = end;
10357 static void parse_namespace_definition(void)
10361 entity_t *entity = NULL;
10362 symbol_t *symbol = NULL;
10364 if (token.type == T_IDENTIFIER) {
10365 symbol = token.v.symbol;
10368 entity = get_entity(symbol, NAMESPACE_NORMAL);
10369 if (entity != NULL &&
10370 entity->kind != ENTITY_NAMESPACE &&
10371 entity->base.parent_scope == current_scope) {
10372 if (!is_error_entity(entity)) {
10373 error_redefined_as_different_kind(&token.source_position,
10374 entity, ENTITY_NAMESPACE);
10380 if (entity == NULL) {
10381 entity = allocate_entity_zero(ENTITY_NAMESPACE);
10382 entity->base.symbol = symbol;
10383 entity->base.source_position = token.source_position;
10384 entity->base.namespc = NAMESPACE_NORMAL;
10385 entity->base.parent_scope = current_scope;
10388 if (token.type == '=') {
10389 /* TODO: parse namespace alias */
10390 panic("namespace alias definition not supported yet");
10393 environment_push(entity);
10394 append_entity(current_scope, entity);
10396 size_t const top = environment_top();
10397 scope_t *old_scope = scope_push(&entity->namespacee.members);
10399 expect('{', end_error);
10401 expect('}', end_error);
10404 assert(current_scope == &entity->namespacee.members);
10405 scope_pop(old_scope);
10406 environment_pop_to(top);
10410 * Parse a statement.
10411 * There's also parse_statement() which additionally checks for
10412 * "statement has no effect" warnings
10414 static statement_t *intern_parse_statement(void)
10416 statement_t *statement = NULL;
10418 /* declaration or statement */
10419 add_anchor_token(';');
10420 switch (token.type) {
10421 case T_IDENTIFIER: {
10422 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
10423 if (la1_type == ':') {
10424 statement = parse_label_statement();
10425 } else if (is_typedef_symbol(token.v.symbol)) {
10426 statement = parse_declaration_statement();
10428 /* it's an identifier, the grammar says this must be an
10429 * expression statement. However it is common that users mistype
10430 * declaration types, so we guess a bit here to improve robustness
10431 * for incorrect programs */
10432 switch (la1_type) {
10435 if (get_entity(token.v.symbol, NAMESPACE_NORMAL) != NULL)
10436 goto expression_statment;
10441 statement = parse_declaration_statement();
10445 expression_statment:
10446 statement = parse_expression_statement();
10453 case T___extension__:
10454 /* This can be a prefix to a declaration or an expression statement.
10455 * We simply eat it now and parse the rest with tail recursion. */
10458 } while (token.type == T___extension__);
10459 bool old_gcc_extension = in_gcc_extension;
10460 in_gcc_extension = true;
10461 statement = intern_parse_statement();
10462 in_gcc_extension = old_gcc_extension;
10466 statement = parse_declaration_statement();
10470 statement = parse_local_label_declaration();
10473 case ';': statement = parse_empty_statement(); break;
10474 case '{': statement = parse_compound_statement(false); break;
10475 case T___leave: statement = parse_leave_statement(); break;
10476 case T___try: statement = parse_ms_try_statment(); break;
10477 case T_asm: statement = parse_asm_statement(); break;
10478 case T_break: statement = parse_break(); break;
10479 case T_case: statement = parse_case_statement(); break;
10480 case T_continue: statement = parse_continue(); break;
10481 case T_default: statement = parse_default_statement(); break;
10482 case T_do: statement = parse_do(); break;
10483 case T_for: statement = parse_for(); break;
10484 case T_goto: statement = parse_goto(); break;
10485 case T_if: statement = parse_if(); break;
10486 case T_return: statement = parse_return(); break;
10487 case T_switch: statement = parse_switch(); break;
10488 case T_while: statement = parse_while(); break;
10491 statement = parse_expression_statement();
10495 errorf(HERE, "unexpected token %K while parsing statement", &token);
10496 statement = create_invalid_statement();
10501 rem_anchor_token(';');
10503 assert(statement != NULL
10504 && statement->base.source_position.input_name != NULL);
10510 * parse a statement and emits "statement has no effect" warning if needed
10511 * (This is really a wrapper around intern_parse_statement with check for 1
10512 * single warning. It is needed, because for statement expressions we have
10513 * to avoid the warning on the last statement)
10515 static statement_t *parse_statement(void)
10517 statement_t *statement = intern_parse_statement();
10519 if (statement->kind == STATEMENT_EXPRESSION && warning.unused_value) {
10520 expression_t *expression = statement->expression.expression;
10521 if (!expression_has_effect(expression)) {
10522 warningf(&expression->base.source_position,
10523 "statement has no effect");
10531 * Parse a compound statement.
10533 static statement_t *parse_compound_statement(bool inside_expression_statement)
10535 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
10537 PUSH_PARENT(statement);
10540 add_anchor_token('}');
10541 /* tokens, which can start a statement */
10542 /* TODO MS, __builtin_FOO */
10543 add_anchor_token('!');
10544 add_anchor_token('&');
10545 add_anchor_token('(');
10546 add_anchor_token('*');
10547 add_anchor_token('+');
10548 add_anchor_token('-');
10549 add_anchor_token('{');
10550 add_anchor_token('~');
10551 add_anchor_token(T_CHARACTER_CONSTANT);
10552 add_anchor_token(T_COLONCOLON);
10553 add_anchor_token(T_FLOATINGPOINT);
10554 add_anchor_token(T_IDENTIFIER);
10555 add_anchor_token(T_INTEGER);
10556 add_anchor_token(T_MINUSMINUS);
10557 add_anchor_token(T_PLUSPLUS);
10558 add_anchor_token(T_STRING_LITERAL);
10559 add_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10560 add_anchor_token(T_WIDE_STRING_LITERAL);
10561 add_anchor_token(T__Bool);
10562 add_anchor_token(T__Complex);
10563 add_anchor_token(T__Imaginary);
10564 add_anchor_token(T___FUNCTION__);
10565 add_anchor_token(T___PRETTY_FUNCTION__);
10566 add_anchor_token(T___alignof__);
10567 add_anchor_token(T___attribute__);
10568 add_anchor_token(T___builtin_va_start);
10569 add_anchor_token(T___extension__);
10570 add_anchor_token(T___func__);
10571 add_anchor_token(T___imag__);
10572 add_anchor_token(T___label__);
10573 add_anchor_token(T___real__);
10574 add_anchor_token(T___thread);
10575 add_anchor_token(T_asm);
10576 add_anchor_token(T_auto);
10577 add_anchor_token(T_bool);
10578 add_anchor_token(T_break);
10579 add_anchor_token(T_case);
10580 add_anchor_token(T_char);
10581 add_anchor_token(T_class);
10582 add_anchor_token(T_const);
10583 add_anchor_token(T_const_cast);
10584 add_anchor_token(T_continue);
10585 add_anchor_token(T_default);
10586 add_anchor_token(T_delete);
10587 add_anchor_token(T_double);
10588 add_anchor_token(T_do);
10589 add_anchor_token(T_dynamic_cast);
10590 add_anchor_token(T_enum);
10591 add_anchor_token(T_extern);
10592 add_anchor_token(T_false);
10593 add_anchor_token(T_float);
10594 add_anchor_token(T_for);
10595 add_anchor_token(T_goto);
10596 add_anchor_token(T_if);
10597 add_anchor_token(T_inline);
10598 add_anchor_token(T_int);
10599 add_anchor_token(T_long);
10600 add_anchor_token(T_new);
10601 add_anchor_token(T_operator);
10602 add_anchor_token(T_register);
10603 add_anchor_token(T_reinterpret_cast);
10604 add_anchor_token(T_restrict);
10605 add_anchor_token(T_return);
10606 add_anchor_token(T_short);
10607 add_anchor_token(T_signed);
10608 add_anchor_token(T_sizeof);
10609 add_anchor_token(T_static);
10610 add_anchor_token(T_static_cast);
10611 add_anchor_token(T_struct);
10612 add_anchor_token(T_switch);
10613 add_anchor_token(T_template);
10614 add_anchor_token(T_this);
10615 add_anchor_token(T_throw);
10616 add_anchor_token(T_true);
10617 add_anchor_token(T_try);
10618 add_anchor_token(T_typedef);
10619 add_anchor_token(T_typeid);
10620 add_anchor_token(T_typename);
10621 add_anchor_token(T_typeof);
10622 add_anchor_token(T_union);
10623 add_anchor_token(T_unsigned);
10624 add_anchor_token(T_using);
10625 add_anchor_token(T_void);
10626 add_anchor_token(T_volatile);
10627 add_anchor_token(T_wchar_t);
10628 add_anchor_token(T_while);
10630 size_t const top = environment_top();
10631 scope_t *old_scope = scope_push(&statement->compound.scope);
10633 statement_t **anchor = &statement->compound.statements;
10634 bool only_decls_so_far = true;
10635 while (token.type != '}') {
10636 if (token.type == T_EOF) {
10637 errorf(&statement->base.source_position,
10638 "EOF while parsing compound statement");
10641 statement_t *sub_statement = intern_parse_statement();
10642 if (is_invalid_statement(sub_statement)) {
10643 /* an error occurred. if we are at an anchor, return */
10649 if (warning.declaration_after_statement) {
10650 if (sub_statement->kind != STATEMENT_DECLARATION) {
10651 only_decls_so_far = false;
10652 } else if (!only_decls_so_far) {
10653 warningf(&sub_statement->base.source_position,
10654 "ISO C90 forbids mixed declarations and code");
10658 *anchor = sub_statement;
10660 while (sub_statement->base.next != NULL)
10661 sub_statement = sub_statement->base.next;
10663 anchor = &sub_statement->base.next;
10667 /* look over all statements again to produce no effect warnings */
10668 if (warning.unused_value) {
10669 statement_t *sub_statement = statement->compound.statements;
10670 for (; sub_statement != NULL; sub_statement = sub_statement->base.next) {
10671 if (sub_statement->kind != STATEMENT_EXPRESSION)
10673 /* don't emit a warning for the last expression in an expression
10674 * statement as it has always an effect */
10675 if (inside_expression_statement && sub_statement->base.next == NULL)
10678 expression_t *expression = sub_statement->expression.expression;
10679 if (!expression_has_effect(expression)) {
10680 warningf(&expression->base.source_position,
10681 "statement has no effect");
10687 rem_anchor_token(T_while);
10688 rem_anchor_token(T_wchar_t);
10689 rem_anchor_token(T_volatile);
10690 rem_anchor_token(T_void);
10691 rem_anchor_token(T_using);
10692 rem_anchor_token(T_unsigned);
10693 rem_anchor_token(T_union);
10694 rem_anchor_token(T_typeof);
10695 rem_anchor_token(T_typename);
10696 rem_anchor_token(T_typeid);
10697 rem_anchor_token(T_typedef);
10698 rem_anchor_token(T_try);
10699 rem_anchor_token(T_true);
10700 rem_anchor_token(T_throw);
10701 rem_anchor_token(T_this);
10702 rem_anchor_token(T_template);
10703 rem_anchor_token(T_switch);
10704 rem_anchor_token(T_struct);
10705 rem_anchor_token(T_static_cast);
10706 rem_anchor_token(T_static);
10707 rem_anchor_token(T_sizeof);
10708 rem_anchor_token(T_signed);
10709 rem_anchor_token(T_short);
10710 rem_anchor_token(T_return);
10711 rem_anchor_token(T_restrict);
10712 rem_anchor_token(T_reinterpret_cast);
10713 rem_anchor_token(T_register);
10714 rem_anchor_token(T_operator);
10715 rem_anchor_token(T_new);
10716 rem_anchor_token(T_long);
10717 rem_anchor_token(T_int);
10718 rem_anchor_token(T_inline);
10719 rem_anchor_token(T_if);
10720 rem_anchor_token(T_goto);
10721 rem_anchor_token(T_for);
10722 rem_anchor_token(T_float);
10723 rem_anchor_token(T_false);
10724 rem_anchor_token(T_extern);
10725 rem_anchor_token(T_enum);
10726 rem_anchor_token(T_dynamic_cast);
10727 rem_anchor_token(T_do);
10728 rem_anchor_token(T_double);
10729 rem_anchor_token(T_delete);
10730 rem_anchor_token(T_default);
10731 rem_anchor_token(T_continue);
10732 rem_anchor_token(T_const_cast);
10733 rem_anchor_token(T_const);
10734 rem_anchor_token(T_class);
10735 rem_anchor_token(T_char);
10736 rem_anchor_token(T_case);
10737 rem_anchor_token(T_break);
10738 rem_anchor_token(T_bool);
10739 rem_anchor_token(T_auto);
10740 rem_anchor_token(T_asm);
10741 rem_anchor_token(T___thread);
10742 rem_anchor_token(T___real__);
10743 rem_anchor_token(T___label__);
10744 rem_anchor_token(T___imag__);
10745 rem_anchor_token(T___func__);
10746 rem_anchor_token(T___extension__);
10747 rem_anchor_token(T___builtin_va_start);
10748 rem_anchor_token(T___attribute__);
10749 rem_anchor_token(T___alignof__);
10750 rem_anchor_token(T___PRETTY_FUNCTION__);
10751 rem_anchor_token(T___FUNCTION__);
10752 rem_anchor_token(T__Imaginary);
10753 rem_anchor_token(T__Complex);
10754 rem_anchor_token(T__Bool);
10755 rem_anchor_token(T_WIDE_STRING_LITERAL);
10756 rem_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10757 rem_anchor_token(T_STRING_LITERAL);
10758 rem_anchor_token(T_PLUSPLUS);
10759 rem_anchor_token(T_MINUSMINUS);
10760 rem_anchor_token(T_INTEGER);
10761 rem_anchor_token(T_IDENTIFIER);
10762 rem_anchor_token(T_FLOATINGPOINT);
10763 rem_anchor_token(T_COLONCOLON);
10764 rem_anchor_token(T_CHARACTER_CONSTANT);
10765 rem_anchor_token('~');
10766 rem_anchor_token('{');
10767 rem_anchor_token('-');
10768 rem_anchor_token('+');
10769 rem_anchor_token('*');
10770 rem_anchor_token('(');
10771 rem_anchor_token('&');
10772 rem_anchor_token('!');
10773 rem_anchor_token('}');
10774 assert(current_scope == &statement->compound.scope);
10775 scope_pop(old_scope);
10776 environment_pop_to(top);
10783 * Check for unused global static functions and variables
10785 static void check_unused_globals(void)
10787 if (!warning.unused_function && !warning.unused_variable)
10790 for (const entity_t *entity = file_scope->entities; entity != NULL;
10791 entity = entity->base.next) {
10792 if (!is_declaration(entity))
10795 const declaration_t *declaration = &entity->declaration;
10796 if (declaration->used ||
10797 declaration->modifiers & DM_UNUSED ||
10798 declaration->modifiers & DM_USED ||
10799 declaration->storage_class != STORAGE_CLASS_STATIC)
10802 type_t *const type = declaration->type;
10804 if (entity->kind == ENTITY_FUNCTION) {
10805 /* inhibit warning for static inline functions */
10806 if (entity->function.is_inline)
10809 s = entity->function.statement != NULL ? "defined" : "declared";
10814 warningf(&declaration->base.source_position, "'%#T' %s but not used",
10815 type, declaration->base.symbol, s);
10819 static void parse_global_asm(void)
10821 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
10824 expect('(', end_error);
10826 statement->asms.asm_text = parse_string_literals();
10827 statement->base.next = unit->global_asm;
10828 unit->global_asm = statement;
10830 expect(')', end_error);
10831 expect(';', end_error);
10836 static void parse_linkage_specification(void)
10839 assert(token.type == T_STRING_LITERAL);
10841 const char *linkage = parse_string_literals().begin;
10843 linkage_kind_t old_linkage = current_linkage;
10844 linkage_kind_t new_linkage;
10845 if (strcmp(linkage, "C") == 0) {
10846 new_linkage = LINKAGE_C;
10847 } else if (strcmp(linkage, "C++") == 0) {
10848 new_linkage = LINKAGE_CXX;
10850 errorf(HERE, "linkage string \"%s\" not recognized", linkage);
10851 new_linkage = LINKAGE_INVALID;
10853 current_linkage = new_linkage;
10855 if (token.type == '{') {
10858 expect('}', end_error);
10864 assert(current_linkage == new_linkage);
10865 current_linkage = old_linkage;
10868 static void parse_external(void)
10870 switch (token.type) {
10871 DECLARATION_START_NO_EXTERN
10873 case T___extension__:
10874 /* tokens below are for implicit int */
10875 case '&': /* & x; -> int& x; (and error later, because C++ has no
10877 case '*': /* * x; -> int* x; */
10878 case '(': /* (x); -> int (x); */
10879 parse_external_declaration();
10883 if (look_ahead(1)->type == T_STRING_LITERAL) {
10884 parse_linkage_specification();
10886 parse_external_declaration();
10891 parse_global_asm();
10895 parse_namespace_definition();
10899 if (!strict_mode) {
10901 warningf(HERE, "stray ';' outside of function");
10908 errorf(HERE, "stray %K outside of function", &token);
10909 if (token.type == '(' || token.type == '{' || token.type == '[')
10910 eat_until_matching_token(token.type);
10916 static void parse_externals(void)
10918 add_anchor_token('}');
10919 add_anchor_token(T_EOF);
10922 unsigned char token_anchor_copy[T_LAST_TOKEN];
10923 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
10926 while (token.type != T_EOF && token.type != '}') {
10928 bool anchor_leak = false;
10929 for (int i = 0; i != T_LAST_TOKEN; ++i) {
10930 unsigned char count = token_anchor_set[i] - token_anchor_copy[i];
10932 errorf(HERE, "Leaked anchor token %k %d times", i, count);
10933 anchor_leak = true;
10936 if (in_gcc_extension) {
10937 errorf(HERE, "Leaked __extension__");
10938 anchor_leak = true;
10948 rem_anchor_token(T_EOF);
10949 rem_anchor_token('}');
10953 * Parse a translation unit.
10955 static void parse_translation_unit(void)
10957 add_anchor_token(T_EOF);
10962 if (token.type == T_EOF)
10965 errorf(HERE, "stray %K outside of function", &token);
10966 if (token.type == '(' || token.type == '{' || token.type == '[')
10967 eat_until_matching_token(token.type);
10975 * @return the translation unit or NULL if errors occurred.
10977 void start_parsing(void)
10979 environment_stack = NEW_ARR_F(stack_entry_t, 0);
10980 label_stack = NEW_ARR_F(stack_entry_t, 0);
10981 diagnostic_count = 0;
10985 type_set_output(stderr);
10986 ast_set_output(stderr);
10988 assert(unit == NULL);
10989 unit = allocate_ast_zero(sizeof(unit[0]));
10991 assert(file_scope == NULL);
10992 file_scope = &unit->scope;
10994 assert(current_scope == NULL);
10995 scope_push(&unit->scope);
10997 create_gnu_builtins();
10999 create_microsoft_intrinsics();
11002 translation_unit_t *finish_parsing(void)
11004 assert(current_scope == &unit->scope);
11007 assert(file_scope == &unit->scope);
11008 check_unused_globals();
11011 DEL_ARR_F(environment_stack);
11012 DEL_ARR_F(label_stack);
11014 translation_unit_t *result = unit;
11019 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
11020 * are given length one. */
11021 static void complete_incomplete_arrays(void)
11023 size_t n = ARR_LEN(incomplete_arrays);
11024 for (size_t i = 0; i != n; ++i) {
11025 declaration_t *const decl = incomplete_arrays[i];
11026 type_t *const orig_type = decl->type;
11027 type_t *const type = skip_typeref(orig_type);
11029 if (!is_type_incomplete(type))
11032 if (warning.other) {
11033 warningf(&decl->base.source_position,
11034 "array '%#T' assumed to have one element",
11035 orig_type, decl->base.symbol);
11038 type_t *const new_type = duplicate_type(type);
11039 new_type->array.size_constant = true;
11040 new_type->array.has_implicit_size = true;
11041 new_type->array.size = 1;
11043 type_t *const result = identify_new_type(new_type);
11045 decl->type = result;
11051 lookahead_bufpos = 0;
11052 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
11055 current_linkage = c_mode & _CXX ? LINKAGE_CXX : LINKAGE_C;
11056 incomplete_arrays = NEW_ARR_F(declaration_t*, 0);
11057 parse_translation_unit();
11058 complete_incomplete_arrays();
11059 DEL_ARR_F(incomplete_arrays);
11060 incomplete_arrays = NULL;
11064 * create a builtin function.
11066 static entity_t *create_builtin_function(builtin_kind_t kind, const char *name, type_t *function_type)
11068 symbol_t *symbol = symbol_table_insert(name);
11069 entity_t *entity = allocate_entity_zero(ENTITY_FUNCTION);
11070 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
11071 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
11072 entity->declaration.type = function_type;
11073 entity->declaration.implicit = true;
11074 entity->base.symbol = symbol;
11075 entity->base.source_position = builtin_source_position;
11077 entity->function.btk = kind;
11079 record_entity(entity, /*is_definition=*/false);
11085 * Create predefined gnu builtins.
11087 static void create_gnu_builtins(void)
11089 #define GNU_BUILTIN(a, b) create_builtin_function(bk_gnu_builtin_##a, "__builtin_" #a, b)
11091 GNU_BUILTIN(alloca, make_function_1_type(type_void_ptr, type_size_t));
11092 GNU_BUILTIN(huge_val, make_function_0_type(type_double));
11093 GNU_BUILTIN(inf, make_function_0_type(type_double));
11094 GNU_BUILTIN(inff, make_function_0_type(type_float));
11095 GNU_BUILTIN(infl, make_function_0_type(type_long_double));
11096 GNU_BUILTIN(nan, make_function_1_type(type_double, type_char_ptr));
11097 GNU_BUILTIN(nanf, make_function_1_type(type_float, type_char_ptr));
11098 GNU_BUILTIN(nanl, make_function_1_type(type_long_double, type_char_ptr));
11099 GNU_BUILTIN(va_end, make_function_1_type(type_void, type_valist));
11100 GNU_BUILTIN(expect, make_function_2_type(type_long, type_long, type_long));
11101 GNU_BUILTIN(return_address, make_function_1_type(type_void_ptr, type_unsigned_int));
11102 GNU_BUILTIN(frame_address, make_function_1_type(type_void_ptr, type_unsigned_int));
11103 GNU_BUILTIN(ffs, make_function_1_type(type_int, type_unsigned_int));
11104 GNU_BUILTIN(clz, make_function_1_type(type_int, type_unsigned_int));
11105 GNU_BUILTIN(ctz, make_function_1_type(type_int, type_unsigned_int));
11106 GNU_BUILTIN(popcount, make_function_1_type(type_int, type_unsigned_int));
11107 GNU_BUILTIN(parity, make_function_1_type(type_int, type_unsigned_int));
11108 GNU_BUILTIN(prefetch, make_function_1_type_variadic(type_float, type_void_ptr));
11109 GNU_BUILTIN(trap, make_function_0_type_noreturn(type_void));
11115 * Create predefined MS intrinsics.
11117 static void create_microsoft_intrinsics(void)
11119 #define MS_BUILTIN(a, b) create_builtin_function(bk_ms##a, #a, b)
11121 /* intrinsics for all architectures */
11122 MS_BUILTIN(_rotl, make_function_2_type(type_unsigned_int, type_unsigned_int, type_int));
11123 MS_BUILTIN(_rotr, make_function_2_type(type_unsigned_int, type_unsigned_int, type_int));
11124 MS_BUILTIN(_rotl64, make_function_2_type(type_unsigned_int64, type_unsigned_int64, type_int));
11125 MS_BUILTIN(_rotr64, make_function_2_type(type_unsigned_int64, type_unsigned_int64, type_int));
11126 MS_BUILTIN(_byteswap_ushort, make_function_1_type(type_unsigned_short, type_unsigned_short));
11127 MS_BUILTIN(_byteswap_ulong, make_function_1_type(type_unsigned_long, type_unsigned_long));
11128 MS_BUILTIN(_byteswap_uint64, make_function_1_type(type_unsigned_int64, type_unsigned_int64));
11130 MS_BUILTIN(__debugbreak, make_function_0_type(type_void));
11131 MS_BUILTIN(_ReturnAddress, make_function_0_type(type_void_ptr));
11132 MS_BUILTIN(_AddressOfReturnAddress, make_function_0_type(type_void_ptr));
11133 MS_BUILTIN(__popcount, make_function_1_type(type_unsigned_int, type_unsigned_int));
11136 MS_BUILTIN(_enable, make_function_0_type(type_void));
11137 MS_BUILTIN(_disable, make_function_0_type(type_void));
11138 MS_BUILTIN(__inbyte, make_function_1_type(type_unsigned_char, type_unsigned_short));
11139 MS_BUILTIN(__inword, make_function_1_type(type_unsigned_short, type_unsigned_short));
11140 MS_BUILTIN(__indword, make_function_1_type(type_unsigned_long, type_unsigned_short));
11141 MS_BUILTIN(__outbyte, make_function_2_type(type_void, type_unsigned_short, type_unsigned_char));
11142 MS_BUILTIN(__outword, make_function_2_type(type_void, type_unsigned_short, type_unsigned_short));
11143 MS_BUILTIN(__outdword, make_function_2_type(type_void, type_unsigned_short, type_unsigned_long));
11144 MS_BUILTIN(__ud2, make_function_0_type_noreturn(type_void));
11145 MS_BUILTIN(_BitScanForward, make_function_2_type(type_unsigned_char, type_unsigned_long_ptr, type_unsigned_long));
11146 MS_BUILTIN(_BitScanReverse, make_function_2_type(type_unsigned_char, type_unsigned_long_ptr, type_unsigned_long));
11147 MS_BUILTIN(_InterlockedExchange, make_function_2_type(type_long, type_long_ptr, type_long));
11148 MS_BUILTIN(_InterlockedExchange64, make_function_2_type(type_int64, type_int64_ptr, type_int64));
11150 if (machine_size <= 32) {
11151 MS_BUILTIN(__readeflags, make_function_0_type(type_unsigned_int));
11152 MS_BUILTIN(__writeeflags, make_function_1_type(type_void, type_unsigned_int));
11154 MS_BUILTIN(__readeflags, make_function_0_type(type_unsigned_int64));
11155 MS_BUILTIN(__writeeflags, make_function_1_type(type_void, type_unsigned_int64));
11162 * Initialize the parser.
11164 void init_parser(void)
11166 sym_anonymous = symbol_table_insert("<anonymous>");
11168 memset(token_anchor_set, 0, sizeof(token_anchor_set));
11170 init_expression_parsers();
11171 obstack_init(&temp_obst);
11173 symbol_t *const va_list_sym = symbol_table_insert("__builtin_va_list");
11174 type_valist = create_builtin_type(va_list_sym, type_void_ptr);
11178 * Terminate the parser.
11180 void exit_parser(void)
11182 obstack_free(&temp_obst, NULL);