2 * This file is part of cparser.
3 * Copyright (C) 2007-2009 Matthias Braun <matze@braunis.de>
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License
7 * as published by the Free Software Foundation; either version 2
8 * of the License, or (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
27 #include "diagnostic.h"
28 #include "format_check.h"
34 #include "type_hash.h"
37 #include "attribute_t.h"
38 #include "lang_features.h"
39 #include "walk_statements.h"
41 #include "adt/bitfiddle.h"
42 #include "adt/error.h"
43 #include "adt/array.h"
45 //#define PRINT_TOKENS
46 #define MAX_LOOKAHEAD 1
51 entity_namespace_t namespc;
54 typedef struct declaration_specifiers_t declaration_specifiers_t;
55 struct declaration_specifiers_t {
56 source_position_t source_position;
57 storage_class_t storage_class;
58 unsigned char alignment; /**< Alignment, 0 if not set. */
60 bool thread_local : 1; /**< GCC __thread */
61 attribute_t *attributes; /**< list of attributes */
66 * An environment for parsing initializers (and compound literals).
68 typedef struct parse_initializer_env_t {
69 type_t *type; /**< the type of the initializer. In case of an
70 array type with unspecified size this gets
71 adjusted to the actual size. */
72 entity_t *entity; /**< the variable that is initialized if any */
73 bool must_be_constant;
74 } parse_initializer_env_t;
76 typedef entity_t* (*parsed_declaration_func) (entity_t *declaration, bool is_definition);
78 /** The current token. */
80 /** The lookahead ring-buffer. */
81 static token_t lookahead_buffer[MAX_LOOKAHEAD];
82 /** Position of the next token in the lookahead buffer. */
83 static size_t lookahead_bufpos;
84 static stack_entry_t *environment_stack = NULL;
85 static stack_entry_t *label_stack = NULL;
86 static scope_t *file_scope = NULL;
87 static scope_t *current_scope = NULL;
88 /** Point to the current function declaration if inside a function. */
89 static function_t *current_function = NULL;
90 static entity_t *current_init_decl = NULL;
91 static switch_statement_t *current_switch = NULL;
92 static statement_t *current_loop = NULL;
93 static statement_t *current_parent = NULL;
94 static ms_try_statement_t *current_try = NULL;
95 static linkage_kind_t current_linkage = LINKAGE_INVALID;
96 static goto_statement_t *goto_first = NULL;
97 static goto_statement_t **goto_anchor = NULL;
98 static label_statement_t *label_first = NULL;
99 static label_statement_t **label_anchor = NULL;
100 /** current translation unit. */
101 static translation_unit_t *unit = NULL;
102 /** true if we are in a type property context (evaluation only for type. */
103 static bool in_type_prop = false;
104 /** true in we are in a __extension__ context. */
105 static bool in_gcc_extension = false;
106 static struct obstack temp_obst;
107 static entity_t *anonymous_entity;
108 static declaration_t **incomplete_arrays;
111 #define PUSH_PARENT(stmt) \
112 statement_t *const prev_parent = current_parent; \
113 ((void)(current_parent = (stmt)))
114 #define POP_PARENT ((void)(current_parent = prev_parent))
116 /** special symbol used for anonymous entities. */
117 static 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;
2537 attribute_t *attributes = NULL;
2539 if (token.type == T___attribute__) {
2540 attributes = parse_attributes(NULL);
2543 entity_kind_tag_t const kind = is_struct ? ENTITY_STRUCT : ENTITY_UNION;
2544 if (token.type == T_IDENTIFIER) {
2545 /* the compound has a name, check if we have seen it already */
2546 symbol = token.v.symbol;
2549 entity_t *entity = get_tag(symbol, kind);
2550 if (entity != NULL) {
2551 compound = &entity->compound;
2552 if (compound->base.parent_scope != current_scope &&
2553 (token.type == '{' || token.type == ';')) {
2554 /* we're in an inner scope and have a definition. Shadow
2555 * existing definition in outer scope */
2557 } else if (compound->complete && token.type == '{') {
2558 assert(symbol != NULL);
2559 errorf(HERE, "multiple definitions of '%s %Y' (previous definition %P)",
2560 is_struct ? "struct" : "union", symbol,
2561 &compound->base.source_position);
2562 /* clear members in the hope to avoid further errors */
2563 compound->members.entities = NULL;
2566 } else if (token.type != '{') {
2568 parse_error_expected("while parsing struct type specifier",
2569 T_IDENTIFIER, '{', NULL);
2571 parse_error_expected("while parsing union type specifier",
2572 T_IDENTIFIER, '{', NULL);
2578 if (compound == NULL) {
2579 entity_t *entity = allocate_entity_zero(kind);
2580 compound = &entity->compound;
2582 compound->alignment = 1;
2583 compound->base.namespc = NAMESPACE_TAG;
2584 compound->base.source_position = token.source_position;
2585 compound->base.symbol = symbol;
2586 compound->base.parent_scope = current_scope;
2587 if (symbol != NULL) {
2588 environment_push(entity);
2590 append_entity(current_scope, entity);
2593 if (token.type == '{') {
2594 parse_compound_type_entries(compound);
2596 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2597 if (symbol == NULL) {
2598 assert(anonymous_entity == NULL);
2599 anonymous_entity = (entity_t*)compound;
2603 if (attributes != NULL) {
2604 handle_entity_attributes(attributes, (entity_t*) compound);
2610 static void parse_enum_entries(type_t *const enum_type)
2614 if (token.type == '}') {
2615 errorf(HERE, "empty enum not allowed");
2620 add_anchor_token('}');
2622 if (token.type != T_IDENTIFIER) {
2623 parse_error_expected("while parsing enum entry", T_IDENTIFIER, NULL);
2625 rem_anchor_token('}');
2629 entity_t *entity = allocate_entity_zero(ENTITY_ENUM_VALUE);
2630 entity->enum_value.enum_type = enum_type;
2631 entity->base.symbol = token.v.symbol;
2632 entity->base.source_position = token.source_position;
2635 if (token.type == '=') {
2637 expression_t *value = parse_constant_expression();
2639 value = create_implicit_cast(value, enum_type);
2640 entity->enum_value.value = value;
2645 record_entity(entity, false);
2647 if (token.type != ',')
2650 } while (token.type != '}');
2651 rem_anchor_token('}');
2653 expect('}', end_error);
2659 static type_t *parse_enum_specifier(void)
2665 if (token.type == T_IDENTIFIER) {
2666 symbol = token.v.symbol;
2669 entity = get_tag(symbol, ENTITY_ENUM);
2670 if (entity != NULL) {
2671 if (entity->base.parent_scope != current_scope &&
2672 (token.type == '{' || token.type == ';')) {
2673 /* we're in an inner scope and have a definition. Shadow
2674 * existing definition in outer scope */
2676 } else if (entity->enume.complete && token.type == '{') {
2677 errorf(HERE, "multiple definitions of 'enum %Y' (previous definition %P)",
2678 symbol, &entity->base.source_position);
2681 } else if (token.type != '{') {
2682 parse_error_expected("while parsing enum type specifier",
2683 T_IDENTIFIER, '{', NULL);
2690 if (entity == NULL) {
2691 entity = allocate_entity_zero(ENTITY_ENUM);
2692 entity->base.namespc = NAMESPACE_TAG;
2693 entity->base.source_position = token.source_position;
2694 entity->base.symbol = symbol;
2695 entity->base.parent_scope = current_scope;
2698 type_t *const type = allocate_type_zero(TYPE_ENUM);
2699 type->enumt.enume = &entity->enume;
2700 type->enumt.akind = ATOMIC_TYPE_INT;
2702 if (token.type == '{') {
2703 if (symbol != NULL) {
2704 environment_push(entity);
2706 append_entity(current_scope, entity);
2707 entity->enume.complete = true;
2709 parse_enum_entries(type);
2710 parse_attributes(NULL);
2712 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2713 if (symbol == NULL) {
2714 assert(anonymous_entity == NULL);
2715 anonymous_entity = entity;
2717 } else if (!entity->enume.complete && !(c_mode & _GNUC)) {
2718 errorf(HERE, "'enum %Y' used before definition (incomplete enums are a GNU extension)",
2726 * if a symbol is a typedef to another type, return true
2728 static bool is_typedef_symbol(symbol_t *symbol)
2730 const entity_t *const entity = get_entity(symbol, NAMESPACE_NORMAL);
2731 return entity != NULL && entity->kind == ENTITY_TYPEDEF;
2734 static type_t *parse_typeof(void)
2740 expect('(', end_error);
2741 add_anchor_token(')');
2743 expression_t *expression = NULL;
2745 bool old_type_prop = in_type_prop;
2746 bool old_gcc_extension = in_gcc_extension;
2747 in_type_prop = true;
2749 while (token.type == T___extension__) {
2750 /* This can be a prefix to a typename or an expression. */
2752 in_gcc_extension = true;
2754 switch (token.type) {
2756 if (is_typedef_symbol(token.v.symbol)) {
2757 type = parse_typename();
2759 expression = parse_expression();
2760 type = revert_automatic_type_conversion(expression);
2765 type = parse_typename();
2769 expression = parse_expression();
2770 type = expression->base.type;
2773 in_type_prop = old_type_prop;
2774 in_gcc_extension = old_gcc_extension;
2776 rem_anchor_token(')');
2777 expect(')', end_error);
2779 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF);
2780 typeof_type->typeoft.expression = expression;
2781 typeof_type->typeoft.typeof_type = type;
2788 typedef enum specifiers_t {
2789 SPECIFIER_SIGNED = 1 << 0,
2790 SPECIFIER_UNSIGNED = 1 << 1,
2791 SPECIFIER_LONG = 1 << 2,
2792 SPECIFIER_INT = 1 << 3,
2793 SPECIFIER_DOUBLE = 1 << 4,
2794 SPECIFIER_CHAR = 1 << 5,
2795 SPECIFIER_WCHAR_T = 1 << 6,
2796 SPECIFIER_SHORT = 1 << 7,
2797 SPECIFIER_LONG_LONG = 1 << 8,
2798 SPECIFIER_FLOAT = 1 << 9,
2799 SPECIFIER_BOOL = 1 << 10,
2800 SPECIFIER_VOID = 1 << 11,
2801 SPECIFIER_INT8 = 1 << 12,
2802 SPECIFIER_INT16 = 1 << 13,
2803 SPECIFIER_INT32 = 1 << 14,
2804 SPECIFIER_INT64 = 1 << 15,
2805 SPECIFIER_INT128 = 1 << 16,
2806 SPECIFIER_COMPLEX = 1 << 17,
2807 SPECIFIER_IMAGINARY = 1 << 18,
2810 static type_t *create_builtin_type(symbol_t *const symbol,
2811 type_t *const real_type)
2813 type_t *type = allocate_type_zero(TYPE_BUILTIN);
2814 type->builtin.symbol = symbol;
2815 type->builtin.real_type = real_type;
2816 return identify_new_type(type);
2819 static type_t *get_typedef_type(symbol_t *symbol)
2821 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
2822 if (entity == NULL || entity->kind != ENTITY_TYPEDEF)
2825 type_t *type = allocate_type_zero(TYPE_TYPEDEF);
2826 type->typedeft.typedefe = &entity->typedefe;
2831 static attribute_t *parse_attribute_ms_property(attribute_t *attribute)
2833 expect('(', end_error);
2835 attribute_property_argument_t *property
2836 = allocate_ast_zero(sizeof(*property));
2839 if (token.type != T_IDENTIFIER) {
2840 parse_error_expected("while parsing property declspec",
2841 T_IDENTIFIER, NULL);
2846 symbol_t *symbol = token.v.symbol;
2848 if (strcmp(symbol->string, "put") == 0) {
2850 } else if (strcmp(symbol->string, "get") == 0) {
2853 errorf(HERE, "expected put or get in property declspec");
2856 expect('=', end_error);
2857 if (token.type != T_IDENTIFIER) {
2858 parse_error_expected("while parsing property declspec",
2859 T_IDENTIFIER, NULL);
2863 property->put_symbol = token.v.symbol;
2865 property->get_symbol = token.v.symbol;
2868 if (token.type == ')')
2870 expect(',', end_error);
2873 attribute->a.property = property;
2875 expect(')', end_error);
2881 static attribute_t *parse_microsoft_extended_decl_modifier_single(void)
2883 attribute_kind_t kind = ATTRIBUTE_UNKNOWN;
2884 if (token.type == T_restrict) {
2885 kind = ATTRIBUTE_MS_RESTRICT;
2887 } else if (token.type == T_IDENTIFIER) {
2888 const char *name = token.v.symbol->string;
2890 for (attribute_kind_t k = ATTRIBUTE_MS_FIRST; k <= ATTRIBUTE_MS_LAST;
2892 const char *attribute_name = get_attribute_name(k);
2893 if (attribute_name != NULL && strcmp(attribute_name, name) == 0) {
2899 if (kind == ATTRIBUTE_UNKNOWN && warning.attribute) {
2900 warningf(HERE, "unknown __declspec '%s' ignored", name);
2903 parse_error_expected("while parsing __declspec", T_IDENTIFIER, NULL);
2907 attribute_t *attribute = allocate_attribute_zero(kind);
2909 if (kind == ATTRIBUTE_MS_PROPERTY) {
2910 return parse_attribute_ms_property(attribute);
2913 /* parse arguments */
2914 if (token.type == '(') {
2916 attribute->a.arguments = parse_attribute_arguments();
2922 static attribute_t *parse_microsoft_extended_decl_modifier(attribute_t *first)
2926 expect('(', end_error);
2928 if (token.type == ')') {
2933 add_anchor_token(')');
2935 attribute_t *last = first;
2938 while (last->next != NULL)
2942 attribute_t *attribute
2943 = parse_microsoft_extended_decl_modifier_single();
2944 if (attribute == NULL)
2950 last->next = attribute;
2954 if (token.type == ')') {
2957 expect(',', end_error);
2960 rem_anchor_token(')');
2961 expect(')', end_error);
2965 rem_anchor_token(')');
2969 static entity_t *create_error_entity(symbol_t *symbol, entity_kind_tag_t kind)
2971 entity_t *entity = allocate_entity_zero(kind);
2972 entity->base.source_position = *HERE;
2973 entity->base.symbol = symbol;
2974 if (is_declaration(entity)) {
2975 entity->declaration.type = type_error_type;
2976 entity->declaration.implicit = true;
2977 } else if (kind == ENTITY_TYPEDEF) {
2978 entity->typedefe.type = type_error_type;
2979 entity->typedefe.builtin = true;
2981 if (kind != ENTITY_COMPOUND_MEMBER)
2982 record_entity(entity, false);
2986 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
2988 type_t *type = NULL;
2989 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
2990 unsigned type_specifiers = 0;
2991 bool newtype = false;
2992 bool saw_error = false;
2993 bool old_gcc_extension = in_gcc_extension;
2995 specifiers->source_position = token.source_position;
2998 specifiers->attributes = parse_attributes(specifiers->attributes);
3000 switch (token.type) {
3002 #define MATCH_STORAGE_CLASS(token, class) \
3004 if (specifiers->storage_class != STORAGE_CLASS_NONE) { \
3005 errorf(HERE, "multiple storage classes in declaration specifiers"); \
3007 specifiers->storage_class = class; \
3008 if (specifiers->thread_local) \
3009 goto check_thread_storage_class; \
3013 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
3014 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
3015 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
3016 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
3017 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
3020 specifiers->attributes
3021 = parse_microsoft_extended_decl_modifier(specifiers->attributes);
3025 if (specifiers->thread_local) {
3026 errorf(HERE, "duplicate '__thread'");
3028 specifiers->thread_local = true;
3029 check_thread_storage_class:
3030 switch (specifiers->storage_class) {
3031 case STORAGE_CLASS_EXTERN:
3032 case STORAGE_CLASS_NONE:
3033 case STORAGE_CLASS_STATIC:
3037 case STORAGE_CLASS_AUTO: wrong = "auto"; goto wrong_thread_stoarge_class;
3038 case STORAGE_CLASS_REGISTER: wrong = "register"; goto wrong_thread_stoarge_class;
3039 case STORAGE_CLASS_TYPEDEF: wrong = "typedef"; goto wrong_thread_stoarge_class;
3040 wrong_thread_stoarge_class:
3041 errorf(HERE, "'__thread' used with '%s'", wrong);
3048 /* type qualifiers */
3049 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
3051 qualifiers |= qualifier; \
3055 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3056 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3057 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3058 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3059 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3060 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3061 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3062 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3064 case T___extension__:
3066 in_gcc_extension = true;
3069 /* type specifiers */
3070 #define MATCH_SPECIFIER(token, specifier, name) \
3072 if (type_specifiers & specifier) { \
3073 errorf(HERE, "multiple " name " type specifiers given"); \
3075 type_specifiers |= specifier; \
3080 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
3081 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
3082 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
3083 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
3084 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
3085 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
3086 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
3087 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
3088 MATCH_SPECIFIER(T_bool, SPECIFIER_BOOL, "bool");
3089 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
3090 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
3091 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
3092 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
3093 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
3094 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
3095 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
3096 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
3097 MATCH_SPECIFIER(T_wchar_t, SPECIFIER_WCHAR_T, "wchar_t");
3101 specifiers->is_inline = true;
3105 case T__forceinline:
3107 specifiers->modifiers |= DM_FORCEINLINE;
3112 if (type_specifiers & SPECIFIER_LONG_LONG) {
3113 errorf(HERE, "multiple type specifiers given");
3114 } else if (type_specifiers & SPECIFIER_LONG) {
3115 type_specifiers |= SPECIFIER_LONG_LONG;
3117 type_specifiers |= SPECIFIER_LONG;
3122 #define CHECK_DOUBLE_TYPE() \
3123 if ( type != NULL) \
3124 errorf(HERE, "multiple data types in declaration specifiers");
3127 CHECK_DOUBLE_TYPE();
3128 type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
3130 type->compound.compound = parse_compound_type_specifier(true);
3133 CHECK_DOUBLE_TYPE();
3134 type = allocate_type_zero(TYPE_COMPOUND_UNION);
3135 type->compound.compound = parse_compound_type_specifier(false);
3138 CHECK_DOUBLE_TYPE();
3139 type = parse_enum_specifier();
3142 CHECK_DOUBLE_TYPE();
3143 type = parse_typeof();
3145 case T___builtin_va_list:
3146 CHECK_DOUBLE_TYPE();
3147 type = duplicate_type(type_valist);
3151 case T_IDENTIFIER: {
3152 /* only parse identifier if we haven't found a type yet */
3153 if (type != NULL || type_specifiers != 0) {
3154 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
3155 * declaration, so it doesn't generate errors about expecting '(' or
3157 switch (look_ahead(1)->type) {
3164 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
3168 errorf(HERE, "discarding stray %K in declaration specifier", &token);
3173 goto finish_specifiers;
3177 type_t *const typedef_type = get_typedef_type(token.v.symbol);
3178 if (typedef_type == NULL) {
3179 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
3180 * declaration, so it doesn't generate 'implicit int' followed by more
3181 * errors later on. */
3182 token_type_t const la1_type = (token_type_t)look_ahead(1)->type;
3188 errorf(HERE, "%K does not name a type", &token);
3191 create_error_entity(token.v.symbol, ENTITY_TYPEDEF);
3193 type = allocate_type_zero(TYPE_TYPEDEF);
3194 type->typedeft.typedefe = &entity->typedefe;
3198 if (la1_type == '&' || la1_type == '*')
3199 goto finish_specifiers;
3204 goto finish_specifiers;
3209 type = typedef_type;
3213 /* function specifier */
3215 goto finish_specifiers;
3220 specifiers->attributes = parse_attributes(specifiers->attributes);
3222 in_gcc_extension = old_gcc_extension;
3224 if (type == NULL || (saw_error && type_specifiers != 0)) {
3225 atomic_type_kind_t atomic_type;
3227 /* match valid basic types */
3228 switch (type_specifiers) {
3229 case SPECIFIER_VOID:
3230 atomic_type = ATOMIC_TYPE_VOID;
3232 case SPECIFIER_WCHAR_T:
3233 atomic_type = ATOMIC_TYPE_WCHAR_T;
3235 case SPECIFIER_CHAR:
3236 atomic_type = ATOMIC_TYPE_CHAR;
3238 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
3239 atomic_type = ATOMIC_TYPE_SCHAR;
3241 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
3242 atomic_type = ATOMIC_TYPE_UCHAR;
3244 case SPECIFIER_SHORT:
3245 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
3246 case SPECIFIER_SHORT | SPECIFIER_INT:
3247 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3248 atomic_type = ATOMIC_TYPE_SHORT;
3250 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
3251 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3252 atomic_type = ATOMIC_TYPE_USHORT;
3255 case SPECIFIER_SIGNED:
3256 case SPECIFIER_SIGNED | SPECIFIER_INT:
3257 atomic_type = ATOMIC_TYPE_INT;
3259 case SPECIFIER_UNSIGNED:
3260 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
3261 atomic_type = ATOMIC_TYPE_UINT;
3263 case SPECIFIER_LONG:
3264 case SPECIFIER_SIGNED | SPECIFIER_LONG:
3265 case SPECIFIER_LONG | SPECIFIER_INT:
3266 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3267 atomic_type = ATOMIC_TYPE_LONG;
3269 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
3270 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3271 atomic_type = ATOMIC_TYPE_ULONG;
3274 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3275 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3276 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
3277 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3279 atomic_type = ATOMIC_TYPE_LONGLONG;
3280 goto warn_about_long_long;
3282 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3283 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3285 atomic_type = ATOMIC_TYPE_ULONGLONG;
3286 warn_about_long_long:
3287 if (warning.long_long) {
3288 warningf(&specifiers->source_position,
3289 "ISO C90 does not support 'long long'");
3293 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
3294 atomic_type = unsigned_int8_type_kind;
3297 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
3298 atomic_type = unsigned_int16_type_kind;
3301 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
3302 atomic_type = unsigned_int32_type_kind;
3305 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
3306 atomic_type = unsigned_int64_type_kind;
3309 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
3310 atomic_type = unsigned_int128_type_kind;
3313 case SPECIFIER_INT8:
3314 case SPECIFIER_SIGNED | SPECIFIER_INT8:
3315 atomic_type = int8_type_kind;
3318 case SPECIFIER_INT16:
3319 case SPECIFIER_SIGNED | SPECIFIER_INT16:
3320 atomic_type = int16_type_kind;
3323 case SPECIFIER_INT32:
3324 case SPECIFIER_SIGNED | SPECIFIER_INT32:
3325 atomic_type = int32_type_kind;
3328 case SPECIFIER_INT64:
3329 case SPECIFIER_SIGNED | SPECIFIER_INT64:
3330 atomic_type = int64_type_kind;
3333 case SPECIFIER_INT128:
3334 case SPECIFIER_SIGNED | SPECIFIER_INT128:
3335 atomic_type = int128_type_kind;
3338 case SPECIFIER_FLOAT:
3339 atomic_type = ATOMIC_TYPE_FLOAT;
3341 case SPECIFIER_DOUBLE:
3342 atomic_type = ATOMIC_TYPE_DOUBLE;
3344 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
3345 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3347 case SPECIFIER_BOOL:
3348 atomic_type = ATOMIC_TYPE_BOOL;
3350 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
3351 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
3352 atomic_type = ATOMIC_TYPE_FLOAT;
3354 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3355 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3356 atomic_type = ATOMIC_TYPE_DOUBLE;
3358 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3359 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3360 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3363 /* invalid specifier combination, give an error message */
3364 if (type_specifiers == 0) {
3368 /* ISO/IEC 14882:1998(E) §C.1.5:4 */
3369 if (!(c_mode & _CXX) && !strict_mode) {
3370 if (warning.implicit_int) {
3371 warningf(HERE, "no type specifiers in declaration, using 'int'");
3373 atomic_type = ATOMIC_TYPE_INT;
3376 errorf(HERE, "no type specifiers given in declaration");
3378 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
3379 (type_specifiers & SPECIFIER_UNSIGNED)) {
3380 errorf(HERE, "signed and unsigned specifiers given");
3381 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3382 errorf(HERE, "only integer types can be signed or unsigned");
3384 errorf(HERE, "multiple datatypes in declaration");
3389 if (type_specifiers & SPECIFIER_COMPLEX) {
3390 type = allocate_type_zero(TYPE_COMPLEX);
3391 type->complex.akind = atomic_type;
3392 } else if (type_specifiers & SPECIFIER_IMAGINARY) {
3393 type = allocate_type_zero(TYPE_IMAGINARY);
3394 type->imaginary.akind = atomic_type;
3396 type = allocate_type_zero(TYPE_ATOMIC);
3397 type->atomic.akind = atomic_type;
3400 } else if (type_specifiers != 0) {
3401 errorf(HERE, "multiple datatypes in declaration");
3404 /* FIXME: check type qualifiers here */
3405 type->base.qualifiers = qualifiers;
3408 type = identify_new_type(type);
3410 type = typehash_insert(type);
3413 if (specifiers->attributes != NULL)
3414 type = handle_type_attributes(specifiers->attributes, type);
3415 specifiers->type = type;
3419 specifiers->type = type_error_type;
3423 static type_qualifiers_t parse_type_qualifiers(void)
3425 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3428 switch (token.type) {
3429 /* type qualifiers */
3430 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3431 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3432 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3433 /* microsoft extended type modifiers */
3434 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3435 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3436 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3437 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3438 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3447 * Parses an K&R identifier list
3449 static void parse_identifier_list(scope_t *scope)
3452 entity_t *entity = allocate_entity_zero(ENTITY_PARAMETER);
3453 entity->base.source_position = token.source_position;
3454 entity->base.namespc = NAMESPACE_NORMAL;
3455 entity->base.symbol = token.v.symbol;
3456 /* a K&R parameter has no type, yet */
3460 append_entity(scope, entity);
3462 if (token.type != ',') {
3466 } while (token.type == T_IDENTIFIER);
3469 static entity_t *parse_parameter(void)
3471 declaration_specifiers_t specifiers;
3472 memset(&specifiers, 0, sizeof(specifiers));
3474 parse_declaration_specifiers(&specifiers);
3476 entity_t *entity = parse_declarator(&specifiers,
3477 DECL_MAY_BE_ABSTRACT | DECL_IS_PARAMETER);
3478 anonymous_entity = NULL;
3482 static void semantic_parameter_incomplete(const entity_t *entity)
3484 assert(entity->kind == ENTITY_PARAMETER);
3486 /* §6.7.5.3:4 After adjustment, the parameters in a parameter type
3487 * list in a function declarator that is part of a
3488 * definition of that function shall not have
3489 * incomplete type. */
3490 type_t *type = skip_typeref(entity->declaration.type);
3491 if (is_type_incomplete(type)) {
3492 errorf(&entity->base.source_position,
3493 "parameter '%#T' has incomplete type",
3494 entity->declaration.type, entity->base.symbol);
3498 static bool has_parameters(void)
3500 /* func(void) is not a parameter */
3501 if (token.type == T_IDENTIFIER) {
3502 entity_t const *const entity = get_entity(token.v.symbol, NAMESPACE_NORMAL);
3505 if (entity->kind != ENTITY_TYPEDEF)
3507 if (skip_typeref(entity->typedefe.type) != type_void)
3509 } else if (token.type != T_void) {
3512 if (look_ahead(1)->type != ')')
3519 * Parses function type parameters (and optionally creates variable_t entities
3520 * for them in a scope)
3522 static void parse_parameters(function_type_t *type, scope_t *scope)
3525 add_anchor_token(')');
3526 int saved_comma_state = save_and_reset_anchor_state(',');
3528 if (token.type == T_IDENTIFIER &&
3529 !is_typedef_symbol(token.v.symbol)) {
3530 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
3531 if (la1_type == ',' || la1_type == ')') {
3532 type->kr_style_parameters = true;
3533 type->unspecified_parameters = true;
3534 parse_identifier_list(scope);
3535 goto parameters_finished;
3539 if (token.type == ')') {
3540 /* ISO/IEC 14882:1998(E) §C.1.6:1 */
3541 if (!(c_mode & _CXX))
3542 type->unspecified_parameters = true;
3543 goto parameters_finished;
3546 if (has_parameters()) {
3547 function_parameter_t **anchor = &type->parameters;
3549 switch (token.type) {
3552 type->variadic = true;
3553 goto parameters_finished;
3556 case T___extension__:
3559 entity_t *entity = parse_parameter();
3560 if (entity->kind == ENTITY_TYPEDEF) {
3561 errorf(&entity->base.source_position,
3562 "typedef not allowed as function parameter");
3565 assert(is_declaration(entity));
3567 semantic_parameter_incomplete(entity);
3569 function_parameter_t *const parameter =
3570 allocate_parameter(entity->declaration.type);
3572 if (scope != NULL) {
3573 append_entity(scope, entity);
3576 *anchor = parameter;
3577 anchor = ¶meter->next;
3582 goto parameters_finished;
3584 if (token.type != ',') {
3585 goto parameters_finished;
3592 parameters_finished:
3593 rem_anchor_token(')');
3594 expect(')', end_error);
3597 restore_anchor_state(',', saved_comma_state);
3600 typedef enum construct_type_kind_t {
3603 CONSTRUCT_REFERENCE,
3606 } construct_type_kind_t;
3608 typedef union construct_type_t construct_type_t;
3610 typedef struct construct_type_base_t {
3611 construct_type_kind_t kind;
3612 construct_type_t *next;
3613 } construct_type_base_t;
3615 typedef struct parsed_pointer_t {
3616 construct_type_base_t base;
3617 type_qualifiers_t type_qualifiers;
3618 variable_t *base_variable; /**< MS __based extension. */
3621 typedef struct parsed_reference_t {
3622 construct_type_base_t base;
3623 } parsed_reference_t;
3625 typedef struct construct_function_type_t {
3626 construct_type_base_t base;
3627 type_t *function_type;
3628 } construct_function_type_t;
3630 typedef struct parsed_array_t {
3631 construct_type_base_t base;
3632 type_qualifiers_t type_qualifiers;
3638 union construct_type_t {
3639 construct_type_kind_t kind;
3640 construct_type_base_t base;
3641 parsed_pointer_t pointer;
3642 parsed_reference_t reference;
3643 construct_function_type_t function;
3644 parsed_array_t array;
3647 static construct_type_t *parse_pointer_declarator(void)
3651 parsed_pointer_t *pointer = obstack_alloc(&temp_obst, sizeof(pointer[0]));
3652 memset(pointer, 0, sizeof(pointer[0]));
3653 pointer->base.kind = CONSTRUCT_POINTER;
3654 pointer->type_qualifiers = parse_type_qualifiers();
3655 //pointer->base_variable = base_variable;
3657 return (construct_type_t*) pointer;
3660 static construct_type_t *parse_reference_declarator(void)
3664 construct_type_t *cons = obstack_alloc(&temp_obst, sizeof(cons->reference));
3665 parsed_reference_t *reference = &cons->reference;
3666 memset(reference, 0, sizeof(*reference));
3667 cons->kind = CONSTRUCT_REFERENCE;
3672 static construct_type_t *parse_array_declarator(void)
3675 add_anchor_token(']');
3677 construct_type_t *cons = obstack_alloc(&temp_obst, sizeof(cons->array));
3678 parsed_array_t *array = &cons->array;
3679 memset(array, 0, sizeof(*array));
3680 cons->kind = CONSTRUCT_ARRAY;
3682 if (token.type == T_static) {
3683 array->is_static = true;
3687 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
3688 if (type_qualifiers != 0) {
3689 if (token.type == T_static) {
3690 array->is_static = true;
3694 array->type_qualifiers = type_qualifiers;
3696 if (token.type == '*' && look_ahead(1)->type == ']') {
3697 array->is_variable = true;
3699 } else if (token.type != ']') {
3700 expression_t *const size = parse_assignment_expression();
3702 /* §6.7.5.2:1 Array size must have integer type */
3703 type_t *const orig_type = size->base.type;
3704 type_t *const type = skip_typeref(orig_type);
3705 if (!is_type_integer(type) && is_type_valid(type)) {
3706 errorf(&size->base.source_position,
3707 "array size '%E' must have integer type but has type '%T'",
3712 mark_vars_read(size, NULL);
3715 rem_anchor_token(']');
3716 expect(']', end_error);
3722 static construct_type_t *parse_function_declarator(scope_t *scope)
3724 type_t *type = allocate_type_zero(TYPE_FUNCTION);
3725 function_type_t *ftype = &type->function;
3727 ftype->linkage = current_linkage;
3728 ftype->calling_convention = CC_DEFAULT;
3730 parse_parameters(ftype, scope);
3732 construct_type_t *cons = obstack_alloc(&temp_obst, sizeof(cons->function));
3733 construct_function_type_t *function = &cons->function;
3734 memset(function, 0, sizeof(*function));
3735 cons->kind = CONSTRUCT_FUNCTION;
3736 function->function_type = type;
3741 typedef struct parse_declarator_env_t {
3742 bool may_be_abstract : 1;
3743 bool must_be_abstract : 1;
3744 decl_modifiers_t modifiers;
3746 source_position_t source_position;
3748 attribute_t *attributes;
3749 } parse_declarator_env_t;
3751 static construct_type_t *parse_inner_declarator(parse_declarator_env_t *env)
3753 /* construct a single linked list of construct_type_t's which describe
3754 * how to construct the final declarator type */
3755 construct_type_t *first = NULL;
3756 construct_type_t **anchor = &first;
3758 env->attributes = parse_attributes(env->attributes);
3761 construct_type_t *type;
3762 //variable_t *based = NULL; /* MS __based extension */
3763 switch (token.type) {
3765 if (!(c_mode & _CXX))
3766 errorf(HERE, "references are only available for C++");
3767 type = parse_reference_declarator();
3772 source_position_t const pos = *HERE;
3774 expect('(', end_error);
3775 add_anchor_token(')');
3776 based = parse_microsoft_based();
3777 rem_anchor_token(')');
3778 expect(')', end_error);
3779 if (token.type != '*') {
3780 if (token.type == T__based) {
3781 errorf(&pos, "__based type modifier specified more than once");
3782 } else if (warning.other) {
3784 "__based does not precede a pointer declarator, ignored");
3789 panic("based currently disabled");
3795 type = parse_pointer_declarator();
3799 goto ptr_operator_end;
3803 anchor = &type->base.next;
3805 /* TODO: find out if this is correct */
3806 env->attributes = parse_attributes(env->attributes);
3811 modifiers |= env->modifiers;
3812 env->modifiers = modifiers;
3815 construct_type_t *inner_types = NULL;
3817 switch (token.type) {
3819 if (env->must_be_abstract) {
3820 errorf(HERE, "no identifier expected in typename");
3822 env->symbol = token.v.symbol;
3823 env->source_position = token.source_position;
3828 /* §6.7.6:2 footnote 126: Empty parentheses in a type name are
3829 * interpreted as ``function with no parameter specification'', rather
3830 * than redundant parentheses around the omitted identifier. */
3831 if (look_ahead(1)->type != ')') {
3833 add_anchor_token(')');
3834 inner_types = parse_inner_declarator(env);
3835 if (inner_types != NULL) {
3836 /* All later declarators only modify the return type */
3837 env->must_be_abstract = true;
3839 rem_anchor_token(')');
3840 expect(')', end_error);
3844 if (env->may_be_abstract)
3846 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
3851 construct_type_t **const p = anchor;
3854 construct_type_t *type;
3855 switch (token.type) {
3857 scope_t *scope = NULL;
3858 if (!env->must_be_abstract) {
3859 scope = &env->parameters;
3862 type = parse_function_declarator(scope);
3866 type = parse_array_declarator();
3869 goto declarator_finished;
3872 /* insert in the middle of the list (at p) */
3873 type->base.next = *p;
3876 anchor = &type->base.next;
3879 declarator_finished:
3880 /* append inner_types at the end of the list, we don't to set anchor anymore
3881 * as it's not needed anymore */
3882 *anchor = inner_types;
3889 static type_t *construct_declarator_type(construct_type_t *construct_list, type_t *type)
3891 construct_type_t *iter = construct_list;
3892 for (; iter != NULL; iter = iter->base.next) {
3893 switch (iter->kind) {
3894 case CONSTRUCT_INVALID:
3896 case CONSTRUCT_FUNCTION: {
3897 construct_function_type_t *function = &iter->function;
3898 type_t *function_type = function->function_type;
3900 function_type->function.return_type = type;
3902 type_t *skipped_return_type = skip_typeref(type);
3904 if (is_type_function(skipped_return_type)) {
3905 errorf(HERE, "function returning function is not allowed");
3906 } else if (is_type_array(skipped_return_type)) {
3907 errorf(HERE, "function returning array is not allowed");
3909 if (skipped_return_type->base.qualifiers != 0 && warning.other) {
3911 "type qualifiers in return type of function type are meaningless");
3915 /* The function type was constructed earlier. Freeing it here will
3916 * destroy other types. */
3917 type = typehash_insert(function_type);
3921 case CONSTRUCT_POINTER: {
3922 if (is_type_reference(skip_typeref(type)))
3923 errorf(HERE, "cannot declare a pointer to reference");
3925 parsed_pointer_t *pointer = &iter->pointer;
3926 type = make_based_pointer_type(type, pointer->type_qualifiers, pointer->base_variable);
3930 case CONSTRUCT_REFERENCE:
3931 if (is_type_reference(skip_typeref(type)))
3932 errorf(HERE, "cannot declare a reference to reference");
3934 type = make_reference_type(type);
3937 case CONSTRUCT_ARRAY: {
3938 if (is_type_reference(skip_typeref(type)))
3939 errorf(HERE, "cannot declare an array of references");
3941 parsed_array_t *array = &iter->array;
3942 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
3944 expression_t *size_expression = array->size;
3945 if (size_expression != NULL) {
3947 = create_implicit_cast(size_expression, type_size_t);
3950 array_type->base.qualifiers = array->type_qualifiers;
3951 array_type->array.element_type = type;
3952 array_type->array.is_static = array->is_static;
3953 array_type->array.is_variable = array->is_variable;
3954 array_type->array.size_expression = size_expression;
3956 if (size_expression != NULL) {
3957 if (is_constant_expression(size_expression)) {
3959 = fold_constant_to_int(size_expression);
3960 array_type->array.size = size;
3961 array_type->array.size_constant = true;
3962 /* §6.7.5.2:1 If the expression is a constant expression, it shall
3963 * have a value greater than zero. */
3965 if (size < 0 || !GNU_MODE) {
3966 errorf(&size_expression->base.source_position,
3967 "size of array must be greater than zero");
3968 } else if (warning.other) {
3969 warningf(&size_expression->base.source_position,
3970 "zero length arrays are a GCC extension");
3974 array_type->array.is_vla = true;
3978 type_t *skipped_type = skip_typeref(type);
3980 if (is_type_incomplete(skipped_type)) {
3981 errorf(HERE, "array of incomplete type '%T' is not allowed", type);
3982 } else if (is_type_function(skipped_type)) {
3983 errorf(HERE, "array of functions is not allowed");
3985 type = identify_new_type(array_type);
3989 internal_errorf(HERE, "invalid type construction found");
3995 static type_t *automatic_type_conversion(type_t *orig_type);
3997 static type_t *semantic_parameter(const source_position_t *pos,
3999 const declaration_specifiers_t *specifiers,
4002 /* §6.7.5.3:7 A declaration of a parameter as ``array of type''
4003 * shall be adjusted to ``qualified pointer to type'',
4005 * §6.7.5.3:8 A declaration of a parameter as ``function returning
4006 * type'' shall be adjusted to ``pointer to function
4007 * returning type'', as in 6.3.2.1. */
4008 type = automatic_type_conversion(type);
4010 if (specifiers->is_inline && is_type_valid(type)) {
4011 errorf(pos, "parameter '%#T' declared 'inline'", type, symbol);
4014 /* §6.9.1:6 The declarations in the declaration list shall contain
4015 * no storage-class specifier other than register and no
4016 * initializations. */
4017 if (specifiers->thread_local || (
4018 specifiers->storage_class != STORAGE_CLASS_NONE &&
4019 specifiers->storage_class != STORAGE_CLASS_REGISTER)
4021 errorf(pos, "invalid storage class for parameter '%#T'", type, symbol);
4024 /* delay test for incomplete type, because we might have (void)
4025 * which is legal but incomplete... */
4030 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
4031 declarator_flags_t flags)
4033 parse_declarator_env_t env;
4034 memset(&env, 0, sizeof(env));
4035 env.may_be_abstract = (flags & DECL_MAY_BE_ABSTRACT) != 0;
4037 construct_type_t *construct_type = parse_inner_declarator(&env);
4039 construct_declarator_type(construct_type, specifiers->type);
4040 type_t *type = skip_typeref(orig_type);
4042 if (construct_type != NULL) {
4043 obstack_free(&temp_obst, construct_type);
4046 attribute_t *attributes = parse_attributes(env.attributes);
4047 /* append (shared) specifier attribute behind attributes of this
4049 if (attributes != NULL) {
4050 attribute_t *last = attributes;
4051 while (last->next != NULL)
4053 last->next = specifiers->attributes;
4055 attributes = specifiers->attributes;
4059 if (specifiers->storage_class == STORAGE_CLASS_TYPEDEF) {
4060 entity = allocate_entity_zero(ENTITY_TYPEDEF);
4061 entity->base.symbol = env.symbol;
4062 entity->base.source_position = env.source_position;
4063 entity->typedefe.type = orig_type;
4065 if (anonymous_entity != NULL) {
4066 if (is_type_compound(type)) {
4067 assert(anonymous_entity->compound.alias == NULL);
4068 assert(anonymous_entity->kind == ENTITY_STRUCT ||
4069 anonymous_entity->kind == ENTITY_UNION);
4070 anonymous_entity->compound.alias = entity;
4071 anonymous_entity = NULL;
4072 } else if (is_type_enum(type)) {
4073 assert(anonymous_entity->enume.alias == NULL);
4074 assert(anonymous_entity->kind == ENTITY_ENUM);
4075 anonymous_entity->enume.alias = entity;
4076 anonymous_entity = NULL;
4080 /* create a declaration type entity */
4081 if (flags & DECL_CREATE_COMPOUND_MEMBER) {
4082 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER);
4084 if (env.symbol != NULL) {
4085 if (specifiers->is_inline && is_type_valid(type)) {
4086 errorf(&env.source_position,
4087 "compound member '%Y' declared 'inline'", env.symbol);
4090 if (specifiers->thread_local ||
4091 specifiers->storage_class != STORAGE_CLASS_NONE) {
4092 errorf(&env.source_position,
4093 "compound member '%Y' must have no storage class",
4097 } else if (flags & DECL_IS_PARAMETER) {
4098 orig_type = semantic_parameter(&env.source_position, orig_type,
4099 specifiers, env.symbol);
4101 entity = allocate_entity_zero(ENTITY_PARAMETER);
4102 } else if (is_type_function(type)) {
4103 entity = allocate_entity_zero(ENTITY_FUNCTION);
4105 entity->function.is_inline = specifiers->is_inline;
4106 entity->function.parameters = env.parameters;
4108 if (env.symbol != NULL) {
4109 /* this needs fixes for C++ */
4110 bool in_function_scope = current_function != NULL;
4112 if (specifiers->thread_local || (
4113 specifiers->storage_class != STORAGE_CLASS_EXTERN &&
4114 specifiers->storage_class != STORAGE_CLASS_NONE &&
4115 (in_function_scope || specifiers->storage_class != STORAGE_CLASS_STATIC)
4117 errorf(&env.source_position,
4118 "invalid storage class for function '%Y'", env.symbol);
4122 entity = allocate_entity_zero(ENTITY_VARIABLE);
4124 entity->variable.thread_local = specifiers->thread_local;
4126 if (env.symbol != NULL) {
4127 if (specifiers->is_inline && is_type_valid(type)) {
4128 errorf(&env.source_position,
4129 "variable '%Y' declared 'inline'", env.symbol);
4132 bool invalid_storage_class = false;
4133 if (current_scope == file_scope) {
4134 if (specifiers->storage_class != STORAGE_CLASS_EXTERN &&
4135 specifiers->storage_class != STORAGE_CLASS_NONE &&
4136 specifiers->storage_class != STORAGE_CLASS_STATIC) {
4137 invalid_storage_class = true;
4140 if (specifiers->thread_local &&
4141 specifiers->storage_class == STORAGE_CLASS_NONE) {
4142 invalid_storage_class = true;
4145 if (invalid_storage_class) {
4146 errorf(&env.source_position,
4147 "invalid storage class for variable '%Y'", env.symbol);
4152 if (env.symbol != NULL) {
4153 entity->base.symbol = env.symbol;
4154 entity->base.source_position = env.source_position;
4156 entity->base.source_position = specifiers->source_position;
4158 entity->base.namespc = NAMESPACE_NORMAL;
4159 entity->declaration.type = orig_type;
4160 entity->declaration.alignment = get_type_alignment(orig_type);
4161 entity->declaration.modifiers = env.modifiers;
4162 entity->declaration.attributes = attributes;
4164 storage_class_t storage_class = specifiers->storage_class;
4165 entity->declaration.declared_storage_class = storage_class;
4167 if (storage_class == STORAGE_CLASS_NONE && current_scope != file_scope)
4168 storage_class = STORAGE_CLASS_AUTO;
4169 entity->declaration.storage_class = storage_class;
4172 if (attributes != NULL) {
4173 handle_entity_attributes(attributes, entity);
4179 static type_t *parse_abstract_declarator(type_t *base_type)
4181 parse_declarator_env_t env;
4182 memset(&env, 0, sizeof(env));
4183 env.may_be_abstract = true;
4184 env.must_be_abstract = true;
4186 construct_type_t *construct_type = parse_inner_declarator(&env);
4188 type_t *result = construct_declarator_type(construct_type, base_type);
4189 if (construct_type != NULL) {
4190 obstack_free(&temp_obst, construct_type);
4192 result = handle_type_attributes(env.attributes, result);
4198 * Check if the declaration of main is suspicious. main should be a
4199 * function with external linkage, returning int, taking either zero
4200 * arguments, two, or three arguments of appropriate types, ie.
4202 * int main([ int argc, char **argv [, char **env ] ]).
4204 * @param decl the declaration to check
4205 * @param type the function type of the declaration
4207 static void check_main(const entity_t *entity)
4209 const source_position_t *pos = &entity->base.source_position;
4210 if (entity->kind != ENTITY_FUNCTION) {
4211 warningf(pos, "'main' is not a function");
4215 if (entity->declaration.storage_class == STORAGE_CLASS_STATIC) {
4216 warningf(pos, "'main' is normally a non-static function");
4219 type_t *type = skip_typeref(entity->declaration.type);
4220 assert(is_type_function(type));
4222 function_type_t *func_type = &type->function;
4223 if (!types_compatible(skip_typeref(func_type->return_type), type_int)) {
4224 warningf(pos, "return type of 'main' should be 'int', but is '%T'",
4225 func_type->return_type);
4227 const function_parameter_t *parm = func_type->parameters;
4229 type_t *const first_type = parm->type;
4230 if (!types_compatible(skip_typeref(first_type), type_int)) {
4232 "first argument of 'main' should be 'int', but is '%T'",
4237 type_t *const second_type = parm->type;
4238 if (!types_compatible(skip_typeref(second_type), type_char_ptr_ptr)) {
4239 warningf(pos, "second argument of 'main' should be 'char**', but is '%T'", second_type);
4243 type_t *const third_type = parm->type;
4244 if (!types_compatible(skip_typeref(third_type), type_char_ptr_ptr)) {
4245 warningf(pos, "third argument of 'main' should be 'char**', but is '%T'", third_type);
4249 goto warn_arg_count;
4253 warningf(pos, "'main' takes only zero, two or three arguments");
4259 * Check if a symbol is the equal to "main".
4261 static bool is_sym_main(const symbol_t *const sym)
4263 return strcmp(sym->string, "main") == 0;
4266 static void error_redefined_as_different_kind(const source_position_t *pos,
4267 const entity_t *old, entity_kind_t new_kind)
4269 errorf(pos, "redeclaration of %s '%Y' as %s (declared %P)",
4270 get_entity_kind_name(old->kind), old->base.symbol,
4271 get_entity_kind_name(new_kind), &old->base.source_position);
4274 static bool is_error_entity(entity_t *const ent)
4276 if (is_declaration(ent)) {
4277 return is_type_valid(skip_typeref(ent->declaration.type));
4278 } else if (ent->kind == ENTITY_TYPEDEF) {
4279 return is_type_valid(skip_typeref(ent->typedefe.type));
4285 * record entities for the NAMESPACE_NORMAL, and produce error messages/warnings
4286 * for various problems that occur for multiple definitions
4288 static entity_t *record_entity(entity_t *entity, const bool is_definition)
4290 const symbol_t *const symbol = entity->base.symbol;
4291 const namespace_tag_t namespc = (namespace_tag_t)entity->base.namespc;
4292 const source_position_t *pos = &entity->base.source_position;
4294 /* can happen in error cases */
4298 entity_t *const previous_entity = get_entity(symbol, namespc);
4299 /* pushing the same entity twice will break the stack structure */
4300 assert(previous_entity != entity);
4302 if (entity->kind == ENTITY_FUNCTION) {
4303 type_t *const orig_type = entity->declaration.type;
4304 type_t *const type = skip_typeref(orig_type);
4306 assert(is_type_function(type));
4307 if (type->function.unspecified_parameters &&
4308 warning.strict_prototypes &&
4309 previous_entity == NULL) {
4310 warningf(pos, "function declaration '%#T' is not a prototype",
4314 if (warning.main && current_scope == file_scope
4315 && is_sym_main(symbol)) {
4320 if (is_declaration(entity) &&
4321 warning.nested_externs &&
4322 entity->declaration.storage_class == STORAGE_CLASS_EXTERN &&
4323 current_scope != file_scope) {
4324 warningf(pos, "nested extern declaration of '%#T'",
4325 entity->declaration.type, symbol);
4328 if (previous_entity != NULL) {
4329 if (previous_entity->base.parent_scope == ¤t_function->parameters &&
4330 previous_entity->base.parent_scope->depth + 1 == current_scope->depth) {
4331 assert(previous_entity->kind == ENTITY_PARAMETER);
4333 "declaration '%#T' redeclares the parameter '%#T' (declared %P)",
4334 entity->declaration.type, symbol,
4335 previous_entity->declaration.type, symbol,
4336 &previous_entity->base.source_position);
4340 if (previous_entity->base.parent_scope == current_scope) {
4341 if (previous_entity->kind != entity->kind) {
4342 if (!is_error_entity(previous_entity) && !is_error_entity(entity)) {
4343 error_redefined_as_different_kind(pos, previous_entity,
4348 if (previous_entity->kind == ENTITY_ENUM_VALUE) {
4349 errorf(pos, "redeclaration of enum entry '%Y' (declared %P)",
4350 symbol, &previous_entity->base.source_position);
4353 if (previous_entity->kind == ENTITY_TYPEDEF) {
4354 /* TODO: C++ allows this for exactly the same type */
4355 errorf(pos, "redefinition of typedef '%Y' (declared %P)",
4356 symbol, &previous_entity->base.source_position);
4360 /* at this point we should have only VARIABLES or FUNCTIONS */
4361 assert(is_declaration(previous_entity) && is_declaration(entity));
4363 declaration_t *const prev_decl = &previous_entity->declaration;
4364 declaration_t *const decl = &entity->declaration;
4366 /* can happen for K&R style declarations */
4367 if (prev_decl->type == NULL &&
4368 previous_entity->kind == ENTITY_PARAMETER &&
4369 entity->kind == ENTITY_PARAMETER) {
4370 prev_decl->type = decl->type;
4371 prev_decl->storage_class = decl->storage_class;
4372 prev_decl->declared_storage_class = decl->declared_storage_class;
4373 prev_decl->modifiers = decl->modifiers;
4374 return previous_entity;
4377 type_t *const orig_type = decl->type;
4378 assert(orig_type != NULL);
4379 type_t *const type = skip_typeref(orig_type);
4380 type_t *const prev_type = skip_typeref(prev_decl->type);
4382 if (!types_compatible(type, prev_type)) {
4384 "declaration '%#T' is incompatible with '%#T' (declared %P)",
4385 orig_type, symbol, prev_decl->type, symbol,
4386 &previous_entity->base.source_position);
4388 unsigned old_storage_class = prev_decl->storage_class;
4390 if (warning.redundant_decls &&
4393 !(prev_decl->modifiers & DM_USED) &&
4394 prev_decl->storage_class == STORAGE_CLASS_STATIC) {
4395 warningf(&previous_entity->base.source_position,
4396 "unnecessary static forward declaration for '%#T'",
4397 prev_decl->type, symbol);
4400 storage_class_t new_storage_class = decl->storage_class;
4402 /* pretend no storage class means extern for function
4403 * declarations (except if the previous declaration is neither
4404 * none nor extern) */
4405 if (entity->kind == ENTITY_FUNCTION) {
4406 /* the previous declaration could have unspecified parameters or
4407 * be a typedef, so use the new type */
4408 if (prev_type->function.unspecified_parameters || is_definition)
4409 prev_decl->type = type;
4411 switch (old_storage_class) {
4412 case STORAGE_CLASS_NONE:
4413 old_storage_class = STORAGE_CLASS_EXTERN;
4416 case STORAGE_CLASS_EXTERN:
4417 if (is_definition) {
4418 if (warning.missing_prototypes &&
4419 prev_type->function.unspecified_parameters &&
4420 !is_sym_main(symbol)) {
4421 warningf(pos, "no previous prototype for '%#T'",
4424 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4425 new_storage_class = STORAGE_CLASS_EXTERN;
4432 } else if (is_type_incomplete(prev_type)) {
4433 prev_decl->type = type;
4436 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4437 new_storage_class == STORAGE_CLASS_EXTERN) {
4438 warn_redundant_declaration:
4439 if (!is_definition &&
4440 warning.redundant_decls &&
4441 is_type_valid(prev_type) &&
4442 strcmp(previous_entity->base.source_position.input_name,
4443 "<builtin>") != 0) {
4445 "redundant declaration for '%Y' (declared %P)",
4446 symbol, &previous_entity->base.source_position);
4448 } else if (current_function == NULL) {
4449 if (old_storage_class != STORAGE_CLASS_STATIC &&
4450 new_storage_class == STORAGE_CLASS_STATIC) {
4452 "static declaration of '%Y' follows non-static declaration (declared %P)",
4453 symbol, &previous_entity->base.source_position);
4454 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4455 prev_decl->storage_class = STORAGE_CLASS_NONE;
4456 prev_decl->declared_storage_class = STORAGE_CLASS_NONE;
4458 /* ISO/IEC 14882:1998(E) §C.1.2:1 */
4460 goto error_redeclaration;
4461 goto warn_redundant_declaration;
4463 } else if (is_type_valid(prev_type)) {
4464 if (old_storage_class == new_storage_class) {
4465 error_redeclaration:
4466 errorf(pos, "redeclaration of '%Y' (declared %P)",
4467 symbol, &previous_entity->base.source_position);
4470 "redeclaration of '%Y' with different linkage (declared %P)",
4471 symbol, &previous_entity->base.source_position);
4476 prev_decl->modifiers |= decl->modifiers;
4477 if (entity->kind == ENTITY_FUNCTION) {
4478 previous_entity->function.is_inline |= entity->function.is_inline;
4480 return previous_entity;
4483 if (warning.shadow) {
4484 warningf(pos, "%s '%Y' shadows %s (declared %P)",
4485 get_entity_kind_name(entity->kind), symbol,
4486 get_entity_kind_name(previous_entity->kind),
4487 &previous_entity->base.source_position);
4491 if (entity->kind == ENTITY_FUNCTION) {
4492 if (is_definition &&
4493 entity->declaration.storage_class != STORAGE_CLASS_STATIC) {
4494 if (warning.missing_prototypes && !is_sym_main(symbol)) {
4495 warningf(pos, "no previous prototype for '%#T'",
4496 entity->declaration.type, symbol);
4497 } else if (warning.missing_declarations && !is_sym_main(symbol)) {
4498 warningf(pos, "no previous declaration for '%#T'",
4499 entity->declaration.type, symbol);
4502 } else if (warning.missing_declarations &&
4503 entity->kind == ENTITY_VARIABLE &&
4504 current_scope == file_scope) {
4505 declaration_t *declaration = &entity->declaration;
4506 if (declaration->storage_class == STORAGE_CLASS_NONE) {
4507 warningf(pos, "no previous declaration for '%#T'",
4508 declaration->type, symbol);
4513 assert(entity->base.parent_scope == NULL);
4514 assert(current_scope != NULL);
4516 entity->base.parent_scope = current_scope;
4517 entity->base.namespc = NAMESPACE_NORMAL;
4518 environment_push(entity);
4519 append_entity(current_scope, entity);
4524 static void parser_error_multiple_definition(entity_t *entity,
4525 const source_position_t *source_position)
4527 errorf(source_position, "multiple definition of '%Y' (declared %P)",
4528 entity->base.symbol, &entity->base.source_position);
4531 static bool is_declaration_specifier(const token_t *token,
4532 bool only_specifiers_qualifiers)
4534 switch (token->type) {
4539 return is_typedef_symbol(token->v.symbol);
4541 case T___extension__:
4543 return !only_specifiers_qualifiers;
4550 static void parse_init_declarator_rest(entity_t *entity)
4552 assert(is_declaration(entity));
4553 declaration_t *const declaration = &entity->declaration;
4557 type_t *orig_type = declaration->type;
4558 type_t *type = skip_typeref(orig_type);
4560 if (entity->kind == ENTITY_VARIABLE
4561 && entity->variable.initializer != NULL) {
4562 parser_error_multiple_definition(entity, HERE);
4565 bool must_be_constant = false;
4566 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
4567 entity->base.parent_scope == file_scope) {
4568 must_be_constant = true;
4571 if (is_type_function(type)) {
4572 errorf(&entity->base.source_position,
4573 "function '%#T' is initialized like a variable",
4574 orig_type, entity->base.symbol);
4575 orig_type = type_error_type;
4578 parse_initializer_env_t env;
4579 env.type = orig_type;
4580 env.must_be_constant = must_be_constant;
4581 env.entity = entity;
4582 current_init_decl = entity;
4584 initializer_t *initializer = parse_initializer(&env);
4585 current_init_decl = NULL;
4587 if (entity->kind == ENTITY_VARIABLE) {
4588 /* §6.7.5:22 array initializers for arrays with unknown size
4589 * determine the array type size */
4590 declaration->type = env.type;
4591 entity->variable.initializer = initializer;
4595 /* parse rest of a declaration without any declarator */
4596 static void parse_anonymous_declaration_rest(
4597 const declaration_specifiers_t *specifiers)
4600 anonymous_entity = NULL;
4602 if (warning.other) {
4603 if (specifiers->storage_class != STORAGE_CLASS_NONE ||
4604 specifiers->thread_local) {
4605 warningf(&specifiers->source_position,
4606 "useless storage class in empty declaration");
4609 type_t *type = specifiers->type;
4610 switch (type->kind) {
4611 case TYPE_COMPOUND_STRUCT:
4612 case TYPE_COMPOUND_UNION: {
4613 if (type->compound.compound->base.symbol == NULL) {
4614 warningf(&specifiers->source_position,
4615 "unnamed struct/union that defines no instances");
4624 warningf(&specifiers->source_position, "empty declaration");
4630 static void check_variable_type_complete(entity_t *ent)
4632 if (ent->kind != ENTITY_VARIABLE)
4635 /* §6.7:7 If an identifier for an object is declared with no linkage, the
4636 * type for the object shall be complete [...] */
4637 declaration_t *decl = &ent->declaration;
4638 if (decl->storage_class == STORAGE_CLASS_EXTERN ||
4639 decl->storage_class == STORAGE_CLASS_STATIC)
4642 type_t *const orig_type = decl->type;
4643 type_t *const type = skip_typeref(orig_type);
4644 if (!is_type_incomplete(type))
4647 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
4648 * are given length one. */
4649 if (is_type_array(type) && ent->base.parent_scope == file_scope) {
4650 ARR_APP1(declaration_t*, incomplete_arrays, decl);
4654 errorf(&ent->base.source_position, "variable '%#T' has incomplete type",
4655 orig_type, ent->base.symbol);
4659 static void parse_declaration_rest(entity_t *ndeclaration,
4660 const declaration_specifiers_t *specifiers,
4661 parsed_declaration_func finished_declaration,
4662 declarator_flags_t flags)
4664 add_anchor_token(';');
4665 add_anchor_token(',');
4667 entity_t *entity = finished_declaration(ndeclaration, token.type == '=');
4669 if (token.type == '=') {
4670 parse_init_declarator_rest(entity);
4671 } else if (entity->kind == ENTITY_VARIABLE) {
4672 /* ISO/IEC 14882:1998(E) §8.5.3:3 The initializer can be omitted
4673 * [...] where the extern specifier is explicitly used. */
4674 declaration_t *decl = &entity->declaration;
4675 if (decl->storage_class != STORAGE_CLASS_EXTERN) {
4676 type_t *type = decl->type;
4677 if (is_type_reference(skip_typeref(type))) {
4678 errorf(&entity->base.source_position,
4679 "reference '%#T' must be initialized",
4680 type, entity->base.symbol);
4685 check_variable_type_complete(entity);
4687 if (token.type != ',')
4691 add_anchor_token('=');
4692 ndeclaration = parse_declarator(specifiers, flags);
4693 rem_anchor_token('=');
4695 expect(';', end_error);
4698 anonymous_entity = NULL;
4699 rem_anchor_token(';');
4700 rem_anchor_token(',');
4703 static entity_t *finished_kr_declaration(entity_t *entity, bool is_definition)
4705 symbol_t *symbol = entity->base.symbol;
4706 if (symbol == NULL) {
4707 errorf(HERE, "anonymous declaration not valid as function parameter");
4711 assert(entity->base.namespc == NAMESPACE_NORMAL);
4712 entity_t *previous_entity = get_entity(symbol, NAMESPACE_NORMAL);
4713 if (previous_entity == NULL
4714 || previous_entity->base.parent_scope != current_scope) {
4715 errorf(HERE, "expected declaration of a function parameter, found '%Y'",
4720 if (is_definition) {
4721 errorf(HERE, "parameter '%Y' is initialised", entity->base.symbol);
4724 return record_entity(entity, false);
4727 static void parse_declaration(parsed_declaration_func finished_declaration,
4728 declarator_flags_t flags)
4730 declaration_specifiers_t specifiers;
4731 memset(&specifiers, 0, sizeof(specifiers));
4733 add_anchor_token(';');
4734 parse_declaration_specifiers(&specifiers);
4735 rem_anchor_token(';');
4737 if (token.type == ';') {
4738 parse_anonymous_declaration_rest(&specifiers);
4740 entity_t *entity = parse_declarator(&specifiers, flags);
4741 parse_declaration_rest(entity, &specifiers, finished_declaration, flags);
4746 static type_t *get_default_promoted_type(type_t *orig_type)
4748 type_t *result = orig_type;
4750 type_t *type = skip_typeref(orig_type);
4751 if (is_type_integer(type)) {
4752 result = promote_integer(type);
4753 } else if (is_type_atomic(type, ATOMIC_TYPE_FLOAT)) {
4754 result = type_double;
4760 static void parse_kr_declaration_list(entity_t *entity)
4762 if (entity->kind != ENTITY_FUNCTION)
4765 type_t *type = skip_typeref(entity->declaration.type);
4766 assert(is_type_function(type));
4767 if (!type->function.kr_style_parameters)
4770 entity_t *proto_type = get_entity(entity->base.symbol, NAMESPACE_NORMAL);
4771 if (proto_type != NULL && proto_type->kind != ENTITY_FUNCTION)
4774 add_anchor_token('{');
4776 /* push function parameters */
4777 size_t const top = environment_top();
4778 scope_t *old_scope = scope_push(&entity->function.parameters);
4780 entity_t *parameter = entity->function.parameters.entities;
4781 for ( ; parameter != NULL; parameter = parameter->base.next) {
4782 assert(parameter->base.parent_scope == NULL);
4783 parameter->base.parent_scope = current_scope;
4784 environment_push(parameter);
4787 /* parse declaration list */
4789 switch (token.type) {
4791 case T___extension__:
4792 /* This covers symbols, which are no type, too, and results in
4793 * better error messages. The typical cases are misspelled type
4794 * names and missing includes. */
4796 parse_declaration(finished_kr_declaration, DECL_IS_PARAMETER);
4804 /* pop function parameters */
4805 assert(current_scope == &entity->function.parameters);
4806 scope_pop(old_scope);
4807 environment_pop_to(top);
4809 /* update function type */
4810 type_t *new_type = duplicate_type(type);
4812 function_parameter_t *parameters = NULL;
4813 function_parameter_t **anchor = ¶meters;
4815 parameter = entity->function.parameters.entities;
4816 for (; parameter != NULL; parameter = parameter->base.next) {
4817 if (parameter->kind != ENTITY_PARAMETER)
4820 type_t *parameter_type = parameter->declaration.type;
4821 if (parameter_type == NULL) {
4823 errorf(HERE, "no type specified for function parameter '%Y'",
4824 parameter->base.symbol);
4825 parameter_type = type_error_type;
4827 if (warning.implicit_int) {
4828 warningf(HERE, "no type specified for function parameter '%Y', using 'int'",
4829 parameter->base.symbol);
4831 parameter_type = type_int;
4833 parameter->declaration.type = parameter_type;
4836 semantic_parameter_incomplete(parameter);
4839 * we need the default promoted types for the function type
4841 if (proto_type == NULL)
4842 parameter_type = get_default_promoted_type(parameter_type);
4844 function_parameter_t *const parameter =
4845 allocate_parameter(parameter_type);
4847 *anchor = parameter;
4848 anchor = ¶meter->next;
4851 new_type->function.parameters = parameters;
4852 if (proto_type != NULL) {
4853 /* compatibility with the prototype will be checked later ... */
4854 new_type->function.prototyped = true;
4856 /* §6.9.1.7: A K&R style parameter list does NOT act as a function
4858 new_type->function.unspecified_parameters = true;
4861 new_type = identify_new_type(new_type);
4863 entity->declaration.type = new_type;
4865 rem_anchor_token('{');
4868 static bool first_err = true;
4871 * When called with first_err set, prints the name of the current function,
4874 static void print_in_function(void)
4878 diagnosticf("%s: In function '%Y':\n",
4879 current_function->base.base.source_position.input_name,
4880 current_function->base.base.symbol);
4885 * Check if all labels are defined in the current function.
4886 * Check if all labels are used in the current function.
4888 static void check_labels(void)
4890 for (const goto_statement_t *goto_statement = goto_first;
4891 goto_statement != NULL;
4892 goto_statement = goto_statement->next) {
4893 /* skip computed gotos */
4894 if (goto_statement->expression != NULL)
4897 label_t *label = goto_statement->label;
4900 if (label->base.source_position.input_name == NULL) {
4901 print_in_function();
4902 errorf(&goto_statement->base.source_position,
4903 "label '%Y' used but not defined", label->base.symbol);
4907 if (warning.unused_label) {
4908 for (const label_statement_t *label_statement = label_first;
4909 label_statement != NULL;
4910 label_statement = label_statement->next) {
4911 label_t *label = label_statement->label;
4913 if (! label->used) {
4914 print_in_function();
4915 warningf(&label_statement->base.source_position,
4916 "label '%Y' defined but not used", label->base.symbol);
4922 static void warn_unused_entity(entity_t *entity, entity_t *last)
4924 entity_t const *const end = last != NULL ? last->base.next : NULL;
4925 for (; entity != end; entity = entity->base.next) {
4926 if (!is_declaration(entity))
4929 declaration_t *declaration = &entity->declaration;
4930 if (declaration->implicit)
4933 if (!declaration->used) {
4934 print_in_function();
4935 const char *what = get_entity_kind_name(entity->kind);
4936 warningf(&entity->base.source_position, "%s '%Y' is unused",
4937 what, entity->base.symbol);
4938 } else if (entity->kind == ENTITY_VARIABLE && !entity->variable.read) {
4939 print_in_function();
4940 const char *what = get_entity_kind_name(entity->kind);
4941 warningf(&entity->base.source_position, "%s '%Y' is never read",
4942 what, entity->base.symbol);
4947 static void check_unused_variables(statement_t *const stmt, void *const env)
4951 switch (stmt->kind) {
4952 case STATEMENT_DECLARATION: {
4953 declaration_statement_t const *const decls = &stmt->declaration;
4954 warn_unused_entity(decls->declarations_begin,
4955 decls->declarations_end);
4960 warn_unused_entity(stmt->fors.scope.entities, NULL);
4969 * Check declarations of current_function for unused entities.
4971 static void check_declarations(void)
4973 if (warning.unused_parameter) {
4974 const scope_t *scope = ¤t_function->parameters;
4976 /* do not issue unused warnings for main */
4977 if (!is_sym_main(current_function->base.base.symbol)) {
4978 warn_unused_entity(scope->entities, NULL);
4981 if (warning.unused_variable) {
4982 walk_statements(current_function->statement, check_unused_variables,
4987 static int determine_truth(expression_t const* const cond)
4990 !is_constant_expression(cond) ? 0 :
4991 fold_constant_to_bool(cond) ? 1 :
4995 static void check_reachable(statement_t *);
4996 static bool reaches_end;
4998 static bool expression_returns(expression_t const *const expr)
5000 switch (expr->kind) {
5002 expression_t const *const func = expr->call.function;
5003 if (func->kind == EXPR_REFERENCE) {
5004 entity_t *entity = func->reference.entity;
5005 if (entity->kind == ENTITY_FUNCTION
5006 && entity->declaration.modifiers & DM_NORETURN)
5010 if (!expression_returns(func))
5013 for (call_argument_t const* arg = expr->call.arguments; arg != NULL; arg = arg->next) {
5014 if (!expression_returns(arg->expression))
5021 case EXPR_REFERENCE:
5022 case EXPR_REFERENCE_ENUM_VALUE:
5024 case EXPR_CHARACTER_CONSTANT:
5025 case EXPR_WIDE_CHARACTER_CONSTANT:
5026 case EXPR_STRING_LITERAL:
5027 case EXPR_WIDE_STRING_LITERAL:
5028 case EXPR_COMPOUND_LITERAL: // TODO descend into initialisers
5029 case EXPR_LABEL_ADDRESS:
5030 case EXPR_CLASSIFY_TYPE:
5031 case EXPR_SIZEOF: // TODO handle obscure VLA case
5034 case EXPR_BUILTIN_CONSTANT_P:
5035 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
5040 case EXPR_STATEMENT: {
5041 bool old_reaches_end = reaches_end;
5042 reaches_end = false;
5043 check_reachable(expr->statement.statement);
5044 bool returns = reaches_end;
5045 reaches_end = old_reaches_end;
5049 case EXPR_CONDITIONAL:
5050 // TODO handle constant expression
5052 if (!expression_returns(expr->conditional.condition))
5055 if (expr->conditional.true_expression != NULL
5056 && expression_returns(expr->conditional.true_expression))
5059 return expression_returns(expr->conditional.false_expression);
5062 return expression_returns(expr->select.compound);
5064 case EXPR_ARRAY_ACCESS:
5066 expression_returns(expr->array_access.array_ref) &&
5067 expression_returns(expr->array_access.index);
5070 return expression_returns(expr->va_starte.ap);
5073 return expression_returns(expr->va_arge.ap);
5076 return expression_returns(expr->va_copye.src);
5078 EXPR_UNARY_CASES_MANDATORY
5079 return expression_returns(expr->unary.value);
5081 case EXPR_UNARY_THROW:
5085 // TODO handle constant lhs of && and ||
5087 expression_returns(expr->binary.left) &&
5088 expression_returns(expr->binary.right);
5094 panic("unhandled expression");
5097 static bool initializer_returns(initializer_t const *const init)
5099 switch (init->kind) {
5100 case INITIALIZER_VALUE:
5101 return expression_returns(init->value.value);
5103 case INITIALIZER_LIST: {
5104 initializer_t * const* i = init->list.initializers;
5105 initializer_t * const* const end = i + init->list.len;
5106 bool returns = true;
5107 for (; i != end; ++i) {
5108 if (!initializer_returns(*i))
5114 case INITIALIZER_STRING:
5115 case INITIALIZER_WIDE_STRING:
5116 case INITIALIZER_DESIGNATOR: // designators have no payload
5119 panic("unhandled initializer");
5122 static bool noreturn_candidate;
5124 static void check_reachable(statement_t *const stmt)
5126 if (stmt->base.reachable)
5128 if (stmt->kind != STATEMENT_DO_WHILE)
5129 stmt->base.reachable = true;
5131 statement_t *last = stmt;
5133 switch (stmt->kind) {
5134 case STATEMENT_INVALID:
5135 case STATEMENT_EMPTY:
5137 next = stmt->base.next;
5140 case STATEMENT_DECLARATION: {
5141 declaration_statement_t const *const decl = &stmt->declaration;
5142 entity_t const * ent = decl->declarations_begin;
5143 entity_t const *const last = decl->declarations_end;
5145 for (;; ent = ent->base.next) {
5146 if (ent->kind == ENTITY_VARIABLE &&
5147 ent->variable.initializer != NULL &&
5148 !initializer_returns(ent->variable.initializer)) {
5155 next = stmt->base.next;
5159 case STATEMENT_COMPOUND:
5160 next = stmt->compound.statements;
5162 next = stmt->base.next;
5165 case STATEMENT_RETURN: {
5166 expression_t const *const val = stmt->returns.value;
5167 if (val == NULL || expression_returns(val))
5168 noreturn_candidate = false;
5172 case STATEMENT_IF: {
5173 if_statement_t const *const ifs = &stmt->ifs;
5174 expression_t const *const cond = ifs->condition;
5176 if (!expression_returns(cond))
5179 int const val = determine_truth(cond);
5182 check_reachable(ifs->true_statement);
5187 if (ifs->false_statement != NULL) {
5188 check_reachable(ifs->false_statement);
5192 next = stmt->base.next;
5196 case STATEMENT_SWITCH: {
5197 switch_statement_t const *const switchs = &stmt->switchs;
5198 expression_t const *const expr = switchs->expression;
5200 if (!expression_returns(expr))
5203 if (is_constant_expression(expr)) {
5204 long const val = fold_constant_to_int(expr);
5205 case_label_statement_t * defaults = NULL;
5206 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5207 if (i->expression == NULL) {
5212 if (i->first_case <= val && val <= i->last_case) {
5213 check_reachable((statement_t*)i);
5218 if (defaults != NULL) {
5219 check_reachable((statement_t*)defaults);
5223 bool has_default = false;
5224 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5225 if (i->expression == NULL)
5228 check_reachable((statement_t*)i);
5235 next = stmt->base.next;
5239 case STATEMENT_EXPRESSION: {
5240 /* Check for noreturn function call */
5241 expression_t const *const expr = stmt->expression.expression;
5242 if (!expression_returns(expr))
5245 next = stmt->base.next;
5249 case STATEMENT_CONTINUE: {
5250 statement_t *parent = stmt;
5252 parent = parent->base.parent;
5253 if (parent == NULL) /* continue not within loop */
5257 switch (parent->kind) {
5258 case STATEMENT_WHILE: goto continue_while;
5259 case STATEMENT_DO_WHILE: goto continue_do_while;
5260 case STATEMENT_FOR: goto continue_for;
5267 case STATEMENT_BREAK: {
5268 statement_t *parent = stmt;
5270 parent = parent->base.parent;
5271 if (parent == NULL) /* break not within loop/switch */
5274 switch (parent->kind) {
5275 case STATEMENT_SWITCH:
5276 case STATEMENT_WHILE:
5277 case STATEMENT_DO_WHILE:
5280 next = parent->base.next;
5281 goto found_break_parent;
5290 case STATEMENT_GOTO:
5291 if (stmt->gotos.expression) {
5292 if (!expression_returns(stmt->gotos.expression))
5295 statement_t *parent = stmt->base.parent;
5296 if (parent == NULL) /* top level goto */
5300 next = stmt->gotos.label->statement;
5301 if (next == NULL) /* missing label */
5306 case STATEMENT_LABEL:
5307 next = stmt->label.statement;
5310 case STATEMENT_CASE_LABEL:
5311 next = stmt->case_label.statement;
5314 case STATEMENT_WHILE: {
5315 while_statement_t const *const whiles = &stmt->whiles;
5316 expression_t const *const cond = whiles->condition;
5318 if (!expression_returns(cond))
5321 int const val = determine_truth(cond);
5324 check_reachable(whiles->body);
5329 next = stmt->base.next;
5333 case STATEMENT_DO_WHILE:
5334 next = stmt->do_while.body;
5337 case STATEMENT_FOR: {
5338 for_statement_t *const fors = &stmt->fors;
5340 if (fors->condition_reachable)
5342 fors->condition_reachable = true;
5344 expression_t const *const cond = fors->condition;
5349 } else if (expression_returns(cond)) {
5350 val = determine_truth(cond);
5356 check_reachable(fors->body);
5361 next = stmt->base.next;
5365 case STATEMENT_MS_TRY: {
5366 ms_try_statement_t const *const ms_try = &stmt->ms_try;
5367 check_reachable(ms_try->try_statement);
5368 next = ms_try->final_statement;
5372 case STATEMENT_LEAVE: {
5373 statement_t *parent = stmt;
5375 parent = parent->base.parent;
5376 if (parent == NULL) /* __leave not within __try */
5379 if (parent->kind == STATEMENT_MS_TRY) {
5381 next = parent->ms_try.final_statement;
5389 panic("invalid statement kind");
5392 while (next == NULL) {
5393 next = last->base.parent;
5395 noreturn_candidate = false;
5397 type_t *const type = skip_typeref(current_function->base.type);
5398 assert(is_type_function(type));
5399 type_t *const ret = skip_typeref(type->function.return_type);
5400 if (warning.return_type &&
5401 !is_type_atomic(ret, ATOMIC_TYPE_VOID) &&
5402 is_type_valid(ret) &&
5403 !is_sym_main(current_function->base.base.symbol)) {
5404 warningf(&stmt->base.source_position,
5405 "control reaches end of non-void function");
5410 switch (next->kind) {
5411 case STATEMENT_INVALID:
5412 case STATEMENT_EMPTY:
5413 case STATEMENT_DECLARATION:
5414 case STATEMENT_EXPRESSION:
5416 case STATEMENT_RETURN:
5417 case STATEMENT_CONTINUE:
5418 case STATEMENT_BREAK:
5419 case STATEMENT_GOTO:
5420 case STATEMENT_LEAVE:
5421 panic("invalid control flow in function");
5423 case STATEMENT_COMPOUND:
5424 if (next->compound.stmt_expr) {
5430 case STATEMENT_SWITCH:
5431 case STATEMENT_LABEL:
5432 case STATEMENT_CASE_LABEL:
5434 next = next->base.next;
5437 case STATEMENT_WHILE: {
5439 if (next->base.reachable)
5441 next->base.reachable = true;
5443 while_statement_t const *const whiles = &next->whiles;
5444 expression_t const *const cond = whiles->condition;
5446 if (!expression_returns(cond))
5449 int const val = determine_truth(cond);
5452 check_reachable(whiles->body);
5458 next = next->base.next;
5462 case STATEMENT_DO_WHILE: {
5464 if (next->base.reachable)
5466 next->base.reachable = true;
5468 do_while_statement_t const *const dw = &next->do_while;
5469 expression_t const *const cond = dw->condition;
5471 if (!expression_returns(cond))
5474 int const val = determine_truth(cond);
5477 check_reachable(dw->body);
5483 next = next->base.next;
5487 case STATEMENT_FOR: {
5489 for_statement_t *const fors = &next->fors;
5491 fors->step_reachable = true;
5493 if (fors->condition_reachable)
5495 fors->condition_reachable = true;
5497 expression_t const *const cond = fors->condition;
5502 } else if (expression_returns(cond)) {
5503 val = determine_truth(cond);
5509 check_reachable(fors->body);
5515 next = next->base.next;
5519 case STATEMENT_MS_TRY:
5521 next = next->ms_try.final_statement;
5526 check_reachable(next);
5529 static void check_unreachable(statement_t* const stmt, void *const env)
5533 switch (stmt->kind) {
5534 case STATEMENT_DO_WHILE:
5535 if (!stmt->base.reachable) {
5536 expression_t const *const cond = stmt->do_while.condition;
5537 if (determine_truth(cond) >= 0) {
5538 warningf(&cond->base.source_position,
5539 "condition of do-while-loop is unreachable");
5544 case STATEMENT_FOR: {
5545 for_statement_t const* const fors = &stmt->fors;
5547 // if init and step are unreachable, cond is unreachable, too
5548 if (!stmt->base.reachable && !fors->step_reachable) {
5549 warningf(&stmt->base.source_position, "statement is unreachable");
5551 if (!stmt->base.reachable && fors->initialisation != NULL) {
5552 warningf(&fors->initialisation->base.source_position,
5553 "initialisation of for-statement is unreachable");
5556 if (!fors->condition_reachable && fors->condition != NULL) {
5557 warningf(&fors->condition->base.source_position,
5558 "condition of for-statement is unreachable");
5561 if (!fors->step_reachable && fors->step != NULL) {
5562 warningf(&fors->step->base.source_position,
5563 "step of for-statement is unreachable");
5569 case STATEMENT_COMPOUND:
5570 if (stmt->compound.statements != NULL)
5572 goto warn_unreachable;
5574 case STATEMENT_DECLARATION: {
5575 /* Only warn if there is at least one declarator with an initializer.
5576 * This typically occurs in switch statements. */
5577 declaration_statement_t const *const decl = &stmt->declaration;
5578 entity_t const * ent = decl->declarations_begin;
5579 entity_t const *const last = decl->declarations_end;
5581 for (;; ent = ent->base.next) {
5582 if (ent->kind == ENTITY_VARIABLE &&
5583 ent->variable.initializer != NULL) {
5584 goto warn_unreachable;
5594 if (!stmt->base.reachable)
5595 warningf(&stmt->base.source_position, "statement is unreachable");
5600 static void parse_external_declaration(void)
5602 /* function-definitions and declarations both start with declaration
5604 declaration_specifiers_t specifiers;
5605 memset(&specifiers, 0, sizeof(specifiers));
5607 add_anchor_token(';');
5608 parse_declaration_specifiers(&specifiers);
5609 rem_anchor_token(';');
5611 /* must be a declaration */
5612 if (token.type == ';') {
5613 parse_anonymous_declaration_rest(&specifiers);
5617 add_anchor_token(',');
5618 add_anchor_token('=');
5619 add_anchor_token(';');
5620 add_anchor_token('{');
5622 /* declarator is common to both function-definitions and declarations */
5623 entity_t *ndeclaration = parse_declarator(&specifiers, DECL_FLAGS_NONE);
5625 rem_anchor_token('{');
5626 rem_anchor_token(';');
5627 rem_anchor_token('=');
5628 rem_anchor_token(',');
5630 /* must be a declaration */
5631 switch (token.type) {
5635 parse_declaration_rest(ndeclaration, &specifiers, record_entity,
5640 /* must be a function definition */
5641 parse_kr_declaration_list(ndeclaration);
5643 if (token.type != '{') {
5644 parse_error_expected("while parsing function definition", '{', NULL);
5645 eat_until_matching_token(';');
5649 assert(is_declaration(ndeclaration));
5650 type_t *const orig_type = ndeclaration->declaration.type;
5651 type_t * type = skip_typeref(orig_type);
5653 if (!is_type_function(type)) {
5654 if (is_type_valid(type)) {
5655 errorf(HERE, "declarator '%#T' has a body but is not a function type",
5656 type, ndeclaration->base.symbol);
5660 } else if (is_typeref(orig_type)) {
5662 errorf(&ndeclaration->base.source_position,
5663 "type of function definition '%#T' is a typedef",
5664 orig_type, ndeclaration->base.symbol);
5667 if (warning.aggregate_return &&
5668 is_type_compound(skip_typeref(type->function.return_type))) {
5669 warningf(HERE, "function '%Y' returns an aggregate",
5670 ndeclaration->base.symbol);
5672 if (warning.traditional && !type->function.unspecified_parameters) {
5673 warningf(HERE, "traditional C rejects ISO C style function definition of function '%Y'",
5674 ndeclaration->base.symbol);
5676 if (warning.old_style_definition && type->function.unspecified_parameters) {
5677 warningf(HERE, "old-style function definition '%Y'",
5678 ndeclaration->base.symbol);
5681 /* §6.7.5.3:14 a function definition with () means no
5682 * parameters (and not unspecified parameters) */
5683 if (type->function.unspecified_parameters &&
5684 type->function.parameters == NULL &&
5685 !type->function.kr_style_parameters) {
5686 type_t *copy = duplicate_type(type);
5687 copy->function.unspecified_parameters = false;
5688 type = identify_new_type(copy);
5690 ndeclaration->declaration.type = type;
5693 entity_t *const entity = record_entity(ndeclaration, true);
5694 assert(entity->kind == ENTITY_FUNCTION);
5695 assert(ndeclaration->kind == ENTITY_FUNCTION);
5697 function_t *function = &entity->function;
5698 if (ndeclaration != entity) {
5699 function->parameters = ndeclaration->function.parameters;
5701 assert(is_declaration(entity));
5702 type = skip_typeref(entity->declaration.type);
5704 /* push function parameters and switch scope */
5705 size_t const top = environment_top();
5706 scope_t *old_scope = scope_push(&function->parameters);
5708 entity_t *parameter = function->parameters.entities;
5709 for (; parameter != NULL; parameter = parameter->base.next) {
5710 if (parameter->base.parent_scope == &ndeclaration->function.parameters) {
5711 parameter->base.parent_scope = current_scope;
5713 assert(parameter->base.parent_scope == NULL
5714 || parameter->base.parent_scope == current_scope);
5715 parameter->base.parent_scope = current_scope;
5716 if (parameter->base.symbol == NULL) {
5717 errorf(¶meter->base.source_position, "parameter name omitted");
5720 environment_push(parameter);
5723 if (function->statement != NULL) {
5724 parser_error_multiple_definition(entity, HERE);
5727 /* parse function body */
5728 int label_stack_top = label_top();
5729 function_t *old_current_function = current_function;
5730 current_function = function;
5731 current_parent = NULL;
5734 goto_anchor = &goto_first;
5736 label_anchor = &label_first;
5738 statement_t *const body = parse_compound_statement(false);
5739 function->statement = body;
5742 check_declarations();
5743 if (warning.return_type ||
5744 warning.unreachable_code ||
5745 (warning.missing_noreturn
5746 && !(function->base.modifiers & DM_NORETURN))) {
5747 noreturn_candidate = true;
5748 check_reachable(body);
5749 if (warning.unreachable_code)
5750 walk_statements(body, check_unreachable, NULL);
5751 if (warning.missing_noreturn &&
5752 noreturn_candidate &&
5753 !(function->base.modifiers & DM_NORETURN)) {
5754 warningf(&body->base.source_position,
5755 "function '%#T' is candidate for attribute 'noreturn'",
5756 type, entity->base.symbol);
5760 assert(current_parent == NULL);
5761 assert(current_function == function);
5762 current_function = old_current_function;
5763 label_pop_to(label_stack_top);
5766 assert(current_scope == &function->parameters);
5767 scope_pop(old_scope);
5768 environment_pop_to(top);
5771 static type_t *make_bitfield_type(type_t *base_type, expression_t *size,
5772 source_position_t *source_position,
5773 const symbol_t *symbol)
5775 type_t *type = allocate_type_zero(TYPE_BITFIELD);
5777 type->bitfield.base_type = base_type;
5778 type->bitfield.size_expression = size;
5781 type_t *skipped_type = skip_typeref(base_type);
5782 if (!is_type_integer(skipped_type)) {
5783 errorf(HERE, "bitfield base type '%T' is not an integer type",
5787 bit_size = get_type_size(base_type) * 8;
5790 if (is_constant_expression(size)) {
5791 long v = fold_constant_to_int(size);
5792 const symbol_t *user_symbol = symbol == NULL ? sym_anonymous : symbol;
5795 errorf(source_position, "negative width in bit-field '%Y'",
5797 } else if (v == 0 && symbol != NULL) {
5798 errorf(source_position, "zero width for bit-field '%Y'",
5800 } else if (bit_size > 0 && (il_size_t)v > bit_size) {
5801 errorf(source_position, "width of '%Y' exceeds its type",
5804 type->bitfield.bit_size = v;
5811 static entity_t *find_compound_entry(compound_t *compound, symbol_t *symbol)
5813 entity_t *iter = compound->members.entities;
5814 for (; iter != NULL; iter = iter->base.next) {
5815 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5818 if (iter->base.symbol == symbol) {
5820 } else if (iter->base.symbol == NULL) {
5821 /* search in anonymous structs and unions */
5822 type_t *type = skip_typeref(iter->declaration.type);
5823 if (is_type_compound(type)) {
5824 if (find_compound_entry(type->compound.compound, symbol)
5835 static void check_deprecated(const source_position_t *source_position,
5836 const entity_t *entity)
5838 if (!warning.deprecated_declarations)
5840 if (!is_declaration(entity))
5842 if ((entity->declaration.modifiers & DM_DEPRECATED) == 0)
5845 char const *const prefix = get_entity_kind_name(entity->kind);
5846 const char *deprecated_string
5847 = get_deprecated_string(entity->declaration.attributes);
5848 if (deprecated_string != NULL) {
5849 warningf(source_position, "%s '%Y' is deprecated (declared %P): \"%s\"",
5850 prefix, entity->base.symbol, &entity->base.source_position,
5853 warningf(source_position, "%s '%Y' is deprecated (declared %P)", prefix,
5854 entity->base.symbol, &entity->base.source_position);
5859 static expression_t *create_select(const source_position_t *pos,
5861 type_qualifiers_t qualifiers,
5864 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
5866 check_deprecated(pos, entry);
5868 expression_t *select = allocate_expression_zero(EXPR_SELECT);
5869 select->select.compound = addr;
5870 select->select.compound_entry = entry;
5872 type_t *entry_type = entry->declaration.type;
5873 type_t *res_type = get_qualified_type(entry_type, qualifiers);
5875 /* we always do the auto-type conversions; the & and sizeof parser contains
5876 * code to revert this! */
5877 select->base.type = automatic_type_conversion(res_type);
5878 if (res_type->kind == TYPE_BITFIELD) {
5879 select->base.type = res_type->bitfield.base_type;
5886 * Find entry with symbol in compound. Search anonymous structs and unions and
5887 * creates implicit select expressions for them.
5888 * Returns the adress for the innermost compound.
5890 static expression_t *find_create_select(const source_position_t *pos,
5892 type_qualifiers_t qualifiers,
5893 compound_t *compound, symbol_t *symbol)
5895 entity_t *iter = compound->members.entities;
5896 for (; iter != NULL; iter = iter->base.next) {
5897 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5900 symbol_t *iter_symbol = iter->base.symbol;
5901 if (iter_symbol == NULL) {
5902 type_t *type = iter->declaration.type;
5903 if (type->kind != TYPE_COMPOUND_STRUCT
5904 && type->kind != TYPE_COMPOUND_UNION)
5907 compound_t *sub_compound = type->compound.compound;
5909 if (find_compound_entry(sub_compound, symbol) == NULL)
5912 expression_t *sub_addr = create_select(pos, addr, qualifiers, iter);
5913 sub_addr->base.source_position = *pos;
5914 sub_addr->select.implicit = true;
5915 return find_create_select(pos, sub_addr, qualifiers, sub_compound,
5919 if (iter_symbol == symbol) {
5920 return create_select(pos, addr, qualifiers, iter);
5927 static void parse_compound_declarators(compound_t *compound,
5928 const declaration_specifiers_t *specifiers)
5933 if (token.type == ':') {
5934 source_position_t source_position = *HERE;
5937 type_t *base_type = specifiers->type;
5938 expression_t *size = parse_constant_expression();
5940 type_t *type = make_bitfield_type(base_type, size,
5941 &source_position, NULL);
5943 attribute_t *attributes = parse_attributes(NULL);
5944 if (attributes != NULL) {
5945 attribute_t *last = attributes;
5946 while (last->next != NULL)
5948 last->next = specifiers->attributes;
5950 attributes = specifiers->attributes;
5953 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER);
5954 entity->base.namespc = NAMESPACE_NORMAL;
5955 entity->base.source_position = source_position;
5956 entity->declaration.declared_storage_class = STORAGE_CLASS_NONE;
5957 entity->declaration.storage_class = STORAGE_CLASS_NONE;
5958 entity->declaration.type = type;
5959 entity->declaration.attributes = attributes;
5961 if (attributes != NULL) {
5962 handle_entity_attributes(attributes, entity);
5964 append_entity(&compound->members, entity);
5966 entity = parse_declarator(specifiers,
5967 DECL_MAY_BE_ABSTRACT | DECL_CREATE_COMPOUND_MEMBER);
5968 if (entity->kind == ENTITY_TYPEDEF) {
5969 errorf(&entity->base.source_position,
5970 "typedef not allowed as compound member");
5972 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5974 /* make sure we don't define a symbol multiple times */
5975 symbol_t *symbol = entity->base.symbol;
5976 if (symbol != NULL) {
5977 entity_t *prev = find_compound_entry(compound, symbol);
5979 errorf(&entity->base.source_position,
5980 "multiple declarations of symbol '%Y' (declared %P)",
5981 symbol, &prev->base.source_position);
5985 if (token.type == ':') {
5986 source_position_t source_position = *HERE;
5988 expression_t *size = parse_constant_expression();
5990 type_t *type = entity->declaration.type;
5991 type_t *bitfield_type = make_bitfield_type(type, size,
5992 &source_position, entity->base.symbol);
5994 attribute_t *attributes = parse_attributes(NULL);
5995 entity->declaration.type = bitfield_type;
5996 handle_entity_attributes(attributes, entity);
5998 type_t *orig_type = entity->declaration.type;
5999 type_t *type = skip_typeref(orig_type);
6000 if (is_type_function(type)) {
6001 errorf(&entity->base.source_position,
6002 "compound member '%Y' must not have function type '%T'",
6003 entity->base.symbol, orig_type);
6004 } else if (is_type_incomplete(type)) {
6005 /* §6.7.2.1:16 flexible array member */
6006 if (!is_type_array(type) ||
6007 token.type != ';' ||
6008 look_ahead(1)->type != '}') {
6009 errorf(&entity->base.source_position,
6010 "compound member '%Y' has incomplete type '%T'",
6011 entity->base.symbol, orig_type);
6016 append_entity(&compound->members, entity);
6020 if (token.type != ',')
6024 expect(';', end_error);
6027 anonymous_entity = NULL;
6030 static void parse_compound_type_entries(compound_t *compound)
6033 add_anchor_token('}');
6035 while (token.type != '}') {
6036 if (token.type == T_EOF) {
6037 errorf(HERE, "EOF while parsing struct");
6040 declaration_specifiers_t specifiers;
6041 memset(&specifiers, 0, sizeof(specifiers));
6042 parse_declaration_specifiers(&specifiers);
6044 parse_compound_declarators(compound, &specifiers);
6046 rem_anchor_token('}');
6050 compound->complete = true;
6053 static type_t *parse_typename(void)
6055 declaration_specifiers_t specifiers;
6056 memset(&specifiers, 0, sizeof(specifiers));
6057 parse_declaration_specifiers(&specifiers);
6058 if (specifiers.storage_class != STORAGE_CLASS_NONE ||
6059 specifiers.thread_local) {
6060 /* TODO: improve error message, user does probably not know what a
6061 * storage class is...
6063 errorf(HERE, "typename may not have a storage class");
6066 type_t *result = parse_abstract_declarator(specifiers.type);
6074 typedef expression_t* (*parse_expression_function)(void);
6075 typedef expression_t* (*parse_expression_infix_function)(expression_t *left);
6077 typedef struct expression_parser_function_t expression_parser_function_t;
6078 struct expression_parser_function_t {
6079 parse_expression_function parser;
6080 precedence_t infix_precedence;
6081 parse_expression_infix_function infix_parser;
6084 expression_parser_function_t expression_parsers[T_LAST_TOKEN];
6087 * Prints an error message if an expression was expected but not read
6089 static expression_t *expected_expression_error(void)
6091 /* skip the error message if the error token was read */
6092 if (token.type != T_ERROR) {
6093 errorf(HERE, "expected expression, got token %K", &token);
6097 return create_invalid_expression();
6101 * Parse a string constant.
6103 static expression_t *parse_string_const(void)
6106 if (token.type == T_STRING_LITERAL) {
6107 string_t res = token.v.string;
6109 while (token.type == T_STRING_LITERAL) {
6110 res = concat_strings(&res, &token.v.string);
6113 if (token.type != T_WIDE_STRING_LITERAL) {
6114 expression_t *const cnst = allocate_expression_zero(EXPR_STRING_LITERAL);
6115 /* note: that we use type_char_ptr here, which is already the
6116 * automatic converted type. revert_automatic_type_conversion
6117 * will construct the array type */
6118 cnst->base.type = warning.write_strings ? type_const_char_ptr : type_char_ptr;
6119 cnst->string.value = res;
6123 wres = concat_string_wide_string(&res, &token.v.wide_string);
6125 wres = token.v.wide_string;
6130 switch (token.type) {
6131 case T_WIDE_STRING_LITERAL:
6132 wres = concat_wide_strings(&wres, &token.v.wide_string);
6135 case T_STRING_LITERAL:
6136 wres = concat_wide_string_string(&wres, &token.v.string);
6140 expression_t *const cnst = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
6141 cnst->base.type = warning.write_strings ? type_const_wchar_t_ptr : type_wchar_t_ptr;
6142 cnst->wide_string.value = wres;
6151 * Parse a boolean constant.
6153 static expression_t *parse_bool_const(bool value)
6155 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
6156 cnst->base.type = type_bool;
6157 cnst->conste.v.int_value = value;
6165 * Parse an integer constant.
6167 static expression_t *parse_int_const(void)
6169 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
6170 cnst->base.type = token.datatype;
6171 cnst->conste.v.int_value = token.v.intvalue;
6179 * Parse a character constant.
6181 static expression_t *parse_character_constant(void)
6183 expression_t *cnst = allocate_expression_zero(EXPR_CHARACTER_CONSTANT);
6184 cnst->base.type = token.datatype;
6185 cnst->conste.v.character = token.v.string;
6187 if (cnst->conste.v.character.size != 1) {
6189 errorf(HERE, "more than 1 character in character constant");
6190 } else if (warning.multichar) {
6191 warningf(HERE, "multi-character character constant");
6200 * Parse a wide character constant.
6202 static expression_t *parse_wide_character_constant(void)
6204 expression_t *cnst = allocate_expression_zero(EXPR_WIDE_CHARACTER_CONSTANT);
6205 cnst->base.type = token.datatype;
6206 cnst->conste.v.wide_character = token.v.wide_string;
6208 if (cnst->conste.v.wide_character.size != 1) {
6210 errorf(HERE, "more than 1 character in character constant");
6211 } else if (warning.multichar) {
6212 warningf(HERE, "multi-character character constant");
6221 * Parse a float constant.
6223 static expression_t *parse_float_const(void)
6225 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
6226 cnst->base.type = token.datatype;
6227 cnst->conste.v.float_value = token.v.floatvalue;
6234 static entity_t *create_implicit_function(symbol_t *symbol,
6235 const source_position_t *source_position)
6237 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
6238 ntype->function.return_type = type_int;
6239 ntype->function.unspecified_parameters = true;
6240 ntype->function.linkage = LINKAGE_C;
6241 type_t *type = identify_new_type(ntype);
6243 entity_t *entity = allocate_entity_zero(ENTITY_FUNCTION);
6244 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
6245 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
6246 entity->declaration.type = type;
6247 entity->declaration.implicit = true;
6248 entity->base.symbol = symbol;
6249 entity->base.source_position = *source_position;
6251 if (current_scope != NULL) {
6252 bool strict_prototypes_old = warning.strict_prototypes;
6253 warning.strict_prototypes = false;
6254 record_entity(entity, false);
6255 warning.strict_prototypes = strict_prototypes_old;
6262 * Creates a return_type (func)(argument_type) function type if not
6265 static type_t *make_function_2_type(type_t *return_type, type_t *argument_type1,
6266 type_t *argument_type2)
6268 function_parameter_t *const parameter2 = allocate_parameter(argument_type2);
6269 function_parameter_t *const parameter1 = allocate_parameter(argument_type1);
6270 parameter1->next = parameter2;
6272 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6273 type->function.return_type = return_type;
6274 type->function.parameters = parameter1;
6276 return identify_new_type(type);
6280 * Creates a return_type (func)(argument_type) function type if not
6283 * @param return_type the return type
6284 * @param argument_type the argument type
6286 static type_t *make_function_1_type(type_t *return_type, type_t *argument_type)
6288 function_parameter_t *const parameter = allocate_parameter(argument_type);
6290 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6291 type->function.return_type = return_type;
6292 type->function.parameters = parameter;
6294 return identify_new_type(type);
6298 * Creates a return_type (func)(argument_type, ...) function type if not
6301 * @param return_type the return type
6302 * @param argument_type the argument type
6304 static type_t *make_function_1_type_variadic(type_t *return_type, type_t *argument_type)
6306 function_parameter_t *const parameter = allocate_parameter(argument_type);
6308 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6309 type->function.return_type = return_type;
6310 type->function.parameters = parameter;
6311 type->function.variadic = true;
6313 return identify_new_type(type);
6317 * Creates a return_type (func)(void) function type if not
6320 * @param return_type the return type
6322 static type_t *make_function_0_type(type_t *return_type)
6324 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6325 type->function.return_type = return_type;
6326 type->function.parameters = NULL;
6328 return identify_new_type(type);
6332 * Creates a NO_RETURN return_type (func)(void) function type if not
6335 * @param return_type the return type
6337 static type_t *make_function_0_type_noreturn(type_t *return_type)
6339 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6340 type->function.return_type = return_type;
6341 type->function.parameters = NULL;
6342 type->function.modifiers |= DM_NORETURN;
6343 return identify_new_type(type);
6347 * Performs automatic type cast as described in §6.3.2.1.
6349 * @param orig_type the original type
6351 static type_t *automatic_type_conversion(type_t *orig_type)
6353 type_t *type = skip_typeref(orig_type);
6354 if (is_type_array(type)) {
6355 array_type_t *array_type = &type->array;
6356 type_t *element_type = array_type->element_type;
6357 unsigned qualifiers = array_type->base.qualifiers;
6359 return make_pointer_type(element_type, qualifiers);
6362 if (is_type_function(type)) {
6363 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
6370 * reverts the automatic casts of array to pointer types and function
6371 * to function-pointer types as defined §6.3.2.1
6373 type_t *revert_automatic_type_conversion(const expression_t *expression)
6375 switch (expression->kind) {
6376 case EXPR_REFERENCE: {
6377 entity_t *entity = expression->reference.entity;
6378 if (is_declaration(entity)) {
6379 return entity->declaration.type;
6380 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6381 return entity->enum_value.enum_type;
6383 panic("no declaration or enum in reference");
6388 entity_t *entity = expression->select.compound_entry;
6389 assert(is_declaration(entity));
6390 type_t *type = entity->declaration.type;
6391 return get_qualified_type(type,
6392 expression->base.type->base.qualifiers);
6395 case EXPR_UNARY_DEREFERENCE: {
6396 const expression_t *const value = expression->unary.value;
6397 type_t *const type = skip_typeref(value->base.type);
6398 if (!is_type_pointer(type))
6399 return type_error_type;
6400 return type->pointer.points_to;
6403 case EXPR_ARRAY_ACCESS: {
6404 const expression_t *array_ref = expression->array_access.array_ref;
6405 type_t *type_left = skip_typeref(array_ref->base.type);
6406 if (!is_type_pointer(type_left))
6407 return type_error_type;
6408 return type_left->pointer.points_to;
6411 case EXPR_STRING_LITERAL: {
6412 size_t size = expression->string.value.size;
6413 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
6416 case EXPR_WIDE_STRING_LITERAL: {
6417 size_t size = expression->wide_string.value.size;
6418 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
6421 case EXPR_COMPOUND_LITERAL:
6422 return expression->compound_literal.type;
6425 return expression->base.type;
6429 static expression_t *parse_reference(void)
6431 symbol_t *const symbol = token.v.symbol;
6433 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
6435 if (entity == NULL) {
6436 if (!strict_mode && look_ahead(1)->type == '(') {
6437 /* an implicitly declared function */
6438 if (warning.error_implicit_function_declaration) {
6439 errorf(HERE, "implicit declaration of function '%Y'", symbol);
6440 } else if (warning.implicit_function_declaration) {
6441 warningf(HERE, "implicit declaration of function '%Y'", symbol);
6444 entity = create_implicit_function(symbol, HERE);
6446 errorf(HERE, "unknown identifier '%Y' found.", symbol);
6447 entity = create_error_entity(symbol, ENTITY_VARIABLE);
6453 if (is_declaration(entity)) {
6454 orig_type = entity->declaration.type;
6455 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6456 orig_type = entity->enum_value.enum_type;
6458 panic("expected declaration or enum value in reference");
6461 /* we always do the auto-type conversions; the & and sizeof parser contains
6462 * code to revert this! */
6463 type_t *type = automatic_type_conversion(orig_type);
6465 expression_kind_t kind = EXPR_REFERENCE;
6466 if (entity->kind == ENTITY_ENUM_VALUE)
6467 kind = EXPR_REFERENCE_ENUM_VALUE;
6469 expression_t *expression = allocate_expression_zero(kind);
6470 expression->reference.entity = entity;
6471 expression->base.type = type;
6473 /* this declaration is used */
6474 if (is_declaration(entity)) {
6475 entity->declaration.used = true;
6478 if (entity->base.parent_scope != file_scope
6479 && (current_function != NULL && entity->base.parent_scope->depth < current_function->parameters.depth)
6480 && is_type_valid(orig_type) && !is_type_function(orig_type)) {
6481 if (entity->kind == ENTITY_VARIABLE) {
6482 /* access of a variable from an outer function */
6483 entity->variable.address_taken = true;
6484 } else if (entity->kind == ENTITY_PARAMETER) {
6485 entity->parameter.address_taken = true;
6487 current_function->need_closure = true;
6490 check_deprecated(HERE, entity);
6492 if (warning.init_self && entity == current_init_decl && !in_type_prop
6493 && entity->kind == ENTITY_VARIABLE) {
6494 current_init_decl = NULL;
6495 warningf(HERE, "variable '%#T' is initialized by itself",
6496 entity->declaration.type, entity->base.symbol);
6503 static bool semantic_cast(expression_t *cast)
6505 expression_t *expression = cast->unary.value;
6506 type_t *orig_dest_type = cast->base.type;
6507 type_t *orig_type_right = expression->base.type;
6508 type_t const *dst_type = skip_typeref(orig_dest_type);
6509 type_t const *src_type = skip_typeref(orig_type_right);
6510 source_position_t const *pos = &cast->base.source_position;
6512 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
6513 if (dst_type == type_void)
6516 /* only integer and pointer can be casted to pointer */
6517 if (is_type_pointer(dst_type) &&
6518 !is_type_pointer(src_type) &&
6519 !is_type_integer(src_type) &&
6520 is_type_valid(src_type)) {
6521 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
6525 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
6526 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
6530 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
6531 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
6535 if (warning.cast_qual &&
6536 is_type_pointer(src_type) &&
6537 is_type_pointer(dst_type)) {
6538 type_t *src = skip_typeref(src_type->pointer.points_to);
6539 type_t *dst = skip_typeref(dst_type->pointer.points_to);
6540 unsigned missing_qualifiers =
6541 src->base.qualifiers & ~dst->base.qualifiers;
6542 if (missing_qualifiers != 0) {
6544 "cast discards qualifiers '%Q' in pointer target type of '%T'",
6545 missing_qualifiers, orig_type_right);
6551 static expression_t *parse_compound_literal(type_t *type)
6553 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
6555 parse_initializer_env_t env;
6558 env.must_be_constant = false;
6559 initializer_t *initializer = parse_initializer(&env);
6562 expression->compound_literal.initializer = initializer;
6563 expression->compound_literal.type = type;
6564 expression->base.type = automatic_type_conversion(type);
6570 * Parse a cast expression.
6572 static expression_t *parse_cast(void)
6574 add_anchor_token(')');
6576 source_position_t source_position = token.source_position;
6578 type_t *type = parse_typename();
6580 rem_anchor_token(')');
6581 expect(')', end_error);
6583 if (token.type == '{') {
6584 return parse_compound_literal(type);
6587 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
6588 cast->base.source_position = source_position;
6590 expression_t *value = parse_sub_expression(PREC_CAST);
6591 cast->base.type = type;
6592 cast->unary.value = value;
6594 if (! semantic_cast(cast)) {
6595 /* TODO: record the error in the AST. else it is impossible to detect it */
6600 return create_invalid_expression();
6604 * Parse a statement expression.
6606 static expression_t *parse_statement_expression(void)
6608 add_anchor_token(')');
6610 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6612 statement_t *statement = parse_compound_statement(true);
6613 statement->compound.stmt_expr = true;
6614 expression->statement.statement = statement;
6616 /* find last statement and use its type */
6617 type_t *type = type_void;
6618 const statement_t *stmt = statement->compound.statements;
6620 while (stmt->base.next != NULL)
6621 stmt = stmt->base.next;
6623 if (stmt->kind == STATEMENT_EXPRESSION) {
6624 type = stmt->expression.expression->base.type;
6626 } else if (warning.other) {
6627 warningf(&expression->base.source_position, "empty statement expression ({})");
6629 expression->base.type = type;
6631 rem_anchor_token(')');
6632 expect(')', end_error);
6639 * Parse a parenthesized expression.
6641 static expression_t *parse_parenthesized_expression(void)
6645 switch (token.type) {
6647 /* gcc extension: a statement expression */
6648 return parse_statement_expression();
6652 return parse_cast();
6654 if (is_typedef_symbol(token.v.symbol)) {
6655 return parse_cast();
6659 add_anchor_token(')');
6660 expression_t *result = parse_expression();
6661 result->base.parenthesized = true;
6662 rem_anchor_token(')');
6663 expect(')', end_error);
6669 static expression_t *parse_function_keyword(void)
6673 if (current_function == NULL) {
6674 errorf(HERE, "'__func__' used outside of a function");
6677 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6678 expression->base.type = type_char_ptr;
6679 expression->funcname.kind = FUNCNAME_FUNCTION;
6686 static expression_t *parse_pretty_function_keyword(void)
6688 if (current_function == NULL) {
6689 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
6692 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6693 expression->base.type = type_char_ptr;
6694 expression->funcname.kind = FUNCNAME_PRETTY_FUNCTION;
6696 eat(T___PRETTY_FUNCTION__);
6701 static expression_t *parse_funcsig_keyword(void)
6703 if (current_function == NULL) {
6704 errorf(HERE, "'__FUNCSIG__' used outside of a function");
6707 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6708 expression->base.type = type_char_ptr;
6709 expression->funcname.kind = FUNCNAME_FUNCSIG;
6716 static expression_t *parse_funcdname_keyword(void)
6718 if (current_function == NULL) {
6719 errorf(HERE, "'__FUNCDNAME__' used outside of a function");
6722 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6723 expression->base.type = type_char_ptr;
6724 expression->funcname.kind = FUNCNAME_FUNCDNAME;
6726 eat(T___FUNCDNAME__);
6731 static designator_t *parse_designator(void)
6733 designator_t *result = allocate_ast_zero(sizeof(result[0]));
6734 result->source_position = *HERE;
6736 if (token.type != T_IDENTIFIER) {
6737 parse_error_expected("while parsing member designator",
6738 T_IDENTIFIER, NULL);
6741 result->symbol = token.v.symbol;
6744 designator_t *last_designator = result;
6746 if (token.type == '.') {
6748 if (token.type != T_IDENTIFIER) {
6749 parse_error_expected("while parsing member designator",
6750 T_IDENTIFIER, NULL);
6753 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6754 designator->source_position = *HERE;
6755 designator->symbol = token.v.symbol;
6758 last_designator->next = designator;
6759 last_designator = designator;
6762 if (token.type == '[') {
6764 add_anchor_token(']');
6765 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6766 designator->source_position = *HERE;
6767 designator->array_index = parse_expression();
6768 rem_anchor_token(']');
6769 expect(']', end_error);
6770 if (designator->array_index == NULL) {
6774 last_designator->next = designator;
6775 last_designator = designator;
6787 * Parse the __builtin_offsetof() expression.
6789 static expression_t *parse_offsetof(void)
6791 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6792 expression->base.type = type_size_t;
6794 eat(T___builtin_offsetof);
6796 expect('(', end_error);
6797 add_anchor_token(',');
6798 type_t *type = parse_typename();
6799 rem_anchor_token(',');
6800 expect(',', end_error);
6801 add_anchor_token(')');
6802 designator_t *designator = parse_designator();
6803 rem_anchor_token(')');
6804 expect(')', end_error);
6806 expression->offsetofe.type = type;
6807 expression->offsetofe.designator = designator;
6810 memset(&path, 0, sizeof(path));
6811 path.top_type = type;
6812 path.path = NEW_ARR_F(type_path_entry_t, 0);
6814 descend_into_subtype(&path);
6816 if (!walk_designator(&path, designator, true)) {
6817 return create_invalid_expression();
6820 DEL_ARR_F(path.path);
6824 return create_invalid_expression();
6828 * Parses a _builtin_va_start() expression.
6830 static expression_t *parse_va_start(void)
6832 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6834 eat(T___builtin_va_start);
6836 expect('(', end_error);
6837 add_anchor_token(',');
6838 expression->va_starte.ap = parse_assignment_expression();
6839 rem_anchor_token(',');
6840 expect(',', end_error);
6841 expression_t *const expr = parse_assignment_expression();
6842 if (expr->kind == EXPR_REFERENCE) {
6843 entity_t *const entity = expr->reference.entity;
6844 if (entity->base.parent_scope != ¤t_function->parameters
6845 || entity->base.next != NULL
6846 || entity->kind != ENTITY_PARAMETER) {
6847 errorf(&expr->base.source_position,
6848 "second argument of 'va_start' must be last parameter of the current function");
6850 expression->va_starte.parameter = &entity->variable;
6852 expect(')', end_error);
6855 expect(')', end_error);
6857 return create_invalid_expression();
6861 * Parses a __builtin_va_arg() expression.
6863 static expression_t *parse_va_arg(void)
6865 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
6867 eat(T___builtin_va_arg);
6869 expect('(', end_error);
6871 ap.expression = parse_assignment_expression();
6872 expression->va_arge.ap = ap.expression;
6873 check_call_argument(type_valist, &ap, 1);
6875 expect(',', end_error);
6876 expression->base.type = parse_typename();
6877 expect(')', end_error);
6881 return create_invalid_expression();
6885 * Parses a __builtin_va_copy() expression.
6887 static expression_t *parse_va_copy(void)
6889 expression_t *expression = allocate_expression_zero(EXPR_VA_COPY);
6891 eat(T___builtin_va_copy);
6893 expect('(', end_error);
6894 expression_t *dst = parse_assignment_expression();
6895 assign_error_t error = semantic_assign(type_valist, dst);
6896 report_assign_error(error, type_valist, dst, "call argument 1",
6897 &dst->base.source_position);
6898 expression->va_copye.dst = dst;
6900 expect(',', end_error);
6902 call_argument_t src;
6903 src.expression = parse_assignment_expression();
6904 check_call_argument(type_valist, &src, 2);
6905 expression->va_copye.src = src.expression;
6906 expect(')', end_error);
6910 return create_invalid_expression();
6914 * Parses a __builtin_constant_p() expression.
6916 static expression_t *parse_builtin_constant(void)
6918 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
6920 eat(T___builtin_constant_p);
6922 expect('(', end_error);
6923 add_anchor_token(')');
6924 expression->builtin_constant.value = parse_assignment_expression();
6925 rem_anchor_token(')');
6926 expect(')', end_error);
6927 expression->base.type = type_int;
6931 return create_invalid_expression();
6935 * Parses a __builtin_types_compatible_p() expression.
6937 static expression_t *parse_builtin_types_compatible(void)
6939 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_TYPES_COMPATIBLE_P);
6941 eat(T___builtin_types_compatible_p);
6943 expect('(', end_error);
6944 add_anchor_token(')');
6945 add_anchor_token(',');
6946 expression->builtin_types_compatible.left = parse_typename();
6947 rem_anchor_token(',');
6948 expect(',', end_error);
6949 expression->builtin_types_compatible.right = parse_typename();
6950 rem_anchor_token(')');
6951 expect(')', end_error);
6952 expression->base.type = type_int;
6956 return create_invalid_expression();
6960 * Parses a __builtin_is_*() compare expression.
6962 static expression_t *parse_compare_builtin(void)
6964 expression_t *expression;
6966 switch (token.type) {
6967 case T___builtin_isgreater:
6968 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
6970 case T___builtin_isgreaterequal:
6971 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
6973 case T___builtin_isless:
6974 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
6976 case T___builtin_islessequal:
6977 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
6979 case T___builtin_islessgreater:
6980 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
6982 case T___builtin_isunordered:
6983 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
6986 internal_errorf(HERE, "invalid compare builtin found");
6988 expression->base.source_position = *HERE;
6991 expect('(', end_error);
6992 expression->binary.left = parse_assignment_expression();
6993 expect(',', end_error);
6994 expression->binary.right = parse_assignment_expression();
6995 expect(')', end_error);
6997 type_t *const orig_type_left = expression->binary.left->base.type;
6998 type_t *const orig_type_right = expression->binary.right->base.type;
7000 type_t *const type_left = skip_typeref(orig_type_left);
7001 type_t *const type_right = skip_typeref(orig_type_right);
7002 if (!is_type_float(type_left) && !is_type_float(type_right)) {
7003 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7004 type_error_incompatible("invalid operands in comparison",
7005 &expression->base.source_position, orig_type_left, orig_type_right);
7008 semantic_comparison(&expression->binary);
7013 return create_invalid_expression();
7018 * Parses a __builtin_expect(, end_error) expression.
7020 static expression_t *parse_builtin_expect(void, end_error)
7022 expression_t *expression
7023 = allocate_expression_zero(EXPR_BINARY_BUILTIN_EXPECT);
7025 eat(T___builtin_expect);
7027 expect('(', end_error);
7028 expression->binary.left = parse_assignment_expression();
7029 expect(',', end_error);
7030 expression->binary.right = parse_constant_expression();
7031 expect(')', end_error);
7033 expression->base.type = expression->binary.left->base.type;
7037 return create_invalid_expression();
7042 * Parses a MS assume() expression.
7044 static expression_t *parse_assume(void)
7046 expression_t *expression = allocate_expression_zero(EXPR_UNARY_ASSUME);
7050 expect('(', end_error);
7051 add_anchor_token(')');
7052 expression->unary.value = parse_assignment_expression();
7053 rem_anchor_token(')');
7054 expect(')', end_error);
7056 expression->base.type = type_void;
7059 return create_invalid_expression();
7063 * Return the declaration for a given label symbol or create a new one.
7065 * @param symbol the symbol of the label
7067 static label_t *get_label(symbol_t *symbol)
7070 assert(current_function != NULL);
7072 label = get_entity(symbol, NAMESPACE_LABEL);
7073 /* if we found a local label, we already created the declaration */
7074 if (label != NULL && label->kind == ENTITY_LOCAL_LABEL) {
7075 if (label->base.parent_scope != current_scope) {
7076 assert(label->base.parent_scope->depth < current_scope->depth);
7077 current_function->goto_to_outer = true;
7079 return &label->label;
7082 label = get_entity(symbol, NAMESPACE_LABEL);
7083 /* if we found a label in the same function, then we already created the
7086 && label->base.parent_scope == ¤t_function->parameters) {
7087 return &label->label;
7090 /* otherwise we need to create a new one */
7091 label = allocate_entity_zero(ENTITY_LABEL);
7092 label->base.namespc = NAMESPACE_LABEL;
7093 label->base.symbol = symbol;
7097 return &label->label;
7101 * Parses a GNU && label address expression.
7103 static expression_t *parse_label_address(void)
7105 source_position_t source_position = token.source_position;
7107 if (token.type != T_IDENTIFIER) {
7108 parse_error_expected("while parsing label address", T_IDENTIFIER, NULL);
7111 symbol_t *symbol = token.v.symbol;
7114 label_t *label = get_label(symbol);
7116 label->address_taken = true;
7118 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
7119 expression->base.source_position = source_position;
7121 /* label address is threaten as a void pointer */
7122 expression->base.type = type_void_ptr;
7123 expression->label_address.label = label;
7126 return create_invalid_expression();
7130 * Parse a microsoft __noop expression.
7132 static expression_t *parse_noop_expression(void)
7134 /* the result is a (int)0 */
7135 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
7136 cnst->base.type = type_int;
7137 cnst->conste.v.int_value = 0;
7138 cnst->conste.is_ms_noop = true;
7142 if (token.type == '(') {
7143 /* parse arguments */
7145 add_anchor_token(')');
7146 add_anchor_token(',');
7148 if (token.type != ')') {
7150 (void)parse_assignment_expression();
7151 if (token.type != ',')
7157 rem_anchor_token(',');
7158 rem_anchor_token(')');
7159 expect(')', end_error);
7166 * Parses a primary expression.
7168 static expression_t *parse_primary_expression(void)
7170 switch (token.type) {
7171 case T_false: return parse_bool_const(false);
7172 case T_true: return parse_bool_const(true);
7173 case T_INTEGER: return parse_int_const();
7174 case T_CHARACTER_CONSTANT: return parse_character_constant();
7175 case T_WIDE_CHARACTER_CONSTANT: return parse_wide_character_constant();
7176 case T_FLOATINGPOINT: return parse_float_const();
7177 case T_STRING_LITERAL:
7178 case T_WIDE_STRING_LITERAL: return parse_string_const();
7179 case T___FUNCTION__:
7180 case T___func__: return parse_function_keyword();
7181 case T___PRETTY_FUNCTION__: return parse_pretty_function_keyword();
7182 case T___FUNCSIG__: return parse_funcsig_keyword();
7183 case T___FUNCDNAME__: return parse_funcdname_keyword();
7184 case T___builtin_offsetof: return parse_offsetof();
7185 case T___builtin_va_start: return parse_va_start();
7186 case T___builtin_va_arg: return parse_va_arg();
7187 case T___builtin_va_copy: return parse_va_copy();
7188 case T___builtin_isgreater:
7189 case T___builtin_isgreaterequal:
7190 case T___builtin_isless:
7191 case T___builtin_islessequal:
7192 case T___builtin_islessgreater:
7193 case T___builtin_isunordered: return parse_compare_builtin();
7194 case T___builtin_constant_p: return parse_builtin_constant();
7195 case T___builtin_types_compatible_p: return parse_builtin_types_compatible();
7196 case T__assume: return parse_assume();
7199 return parse_label_address();
7202 case '(': return parse_parenthesized_expression();
7203 case T___noop: return parse_noop_expression();
7205 /* Gracefully handle type names while parsing expressions. */
7207 if (!is_typedef_symbol(token.v.symbol)) {
7208 return parse_reference();
7212 source_position_t const pos = *HERE;
7213 type_t const *const type = parse_typename();
7214 errorf(&pos, "encountered type '%T' while parsing expression", type);
7215 return create_invalid_expression();
7219 errorf(HERE, "unexpected token %K, expected an expression", &token);
7220 return create_invalid_expression();
7224 * Check if the expression has the character type and issue a warning then.
7226 static void check_for_char_index_type(const expression_t *expression)
7228 type_t *const type = expression->base.type;
7229 const type_t *const base_type = skip_typeref(type);
7231 if (is_type_atomic(base_type, ATOMIC_TYPE_CHAR) &&
7232 warning.char_subscripts) {
7233 warningf(&expression->base.source_position,
7234 "array subscript has type '%T'", type);
7238 static expression_t *parse_array_expression(expression_t *left)
7240 expression_t *expression = allocate_expression_zero(EXPR_ARRAY_ACCESS);
7243 add_anchor_token(']');
7245 expression_t *inside = parse_expression();
7247 type_t *const orig_type_left = left->base.type;
7248 type_t *const orig_type_inside = inside->base.type;
7250 type_t *const type_left = skip_typeref(orig_type_left);
7251 type_t *const type_inside = skip_typeref(orig_type_inside);
7253 type_t *return_type;
7254 array_access_expression_t *array_access = &expression->array_access;
7255 if (is_type_pointer(type_left)) {
7256 return_type = type_left->pointer.points_to;
7257 array_access->array_ref = left;
7258 array_access->index = inside;
7259 check_for_char_index_type(inside);
7260 } else if (is_type_pointer(type_inside)) {
7261 return_type = type_inside->pointer.points_to;
7262 array_access->array_ref = inside;
7263 array_access->index = left;
7264 array_access->flipped = true;
7265 check_for_char_index_type(left);
7267 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
7269 "array access on object with non-pointer types '%T', '%T'",
7270 orig_type_left, orig_type_inside);
7272 return_type = type_error_type;
7273 array_access->array_ref = left;
7274 array_access->index = inside;
7277 expression->base.type = automatic_type_conversion(return_type);
7279 rem_anchor_token(']');
7280 expect(']', end_error);
7285 static expression_t *parse_typeprop(expression_kind_t const kind)
7287 expression_t *tp_expression = allocate_expression_zero(kind);
7288 tp_expression->base.type = type_size_t;
7290 eat(kind == EXPR_SIZEOF ? T_sizeof : T___alignof__);
7292 /* we only refer to a type property, mark this case */
7293 bool old = in_type_prop;
7294 in_type_prop = true;
7297 expression_t *expression;
7298 if (token.type == '(' && is_declaration_specifier(look_ahead(1), true)) {
7300 add_anchor_token(')');
7301 orig_type = parse_typename();
7302 rem_anchor_token(')');
7303 expect(')', end_error);
7305 if (token.type == '{') {
7306 /* It was not sizeof(type) after all. It is sizeof of an expression
7307 * starting with a compound literal */
7308 expression = parse_compound_literal(orig_type);
7309 goto typeprop_expression;
7312 expression = parse_sub_expression(PREC_UNARY);
7314 typeprop_expression:
7315 tp_expression->typeprop.tp_expression = expression;
7317 orig_type = revert_automatic_type_conversion(expression);
7318 expression->base.type = orig_type;
7321 tp_expression->typeprop.type = orig_type;
7322 type_t const* const type = skip_typeref(orig_type);
7323 char const* const wrong_type =
7324 GNU_MODE && is_type_atomic(type, ATOMIC_TYPE_VOID) ? NULL :
7325 is_type_incomplete(type) ? "incomplete" :
7326 type->kind == TYPE_FUNCTION ? "function designator" :
7327 type->kind == TYPE_BITFIELD ? "bitfield" :
7329 if (wrong_type != NULL) {
7330 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7331 errorf(&tp_expression->base.source_position,
7332 "operand of %s expression must not be of %s type '%T'",
7333 what, wrong_type, orig_type);
7338 return tp_expression;
7341 static expression_t *parse_sizeof(void)
7343 return parse_typeprop(EXPR_SIZEOF);
7346 static expression_t *parse_alignof(void)
7348 return parse_typeprop(EXPR_ALIGNOF);
7351 static expression_t *parse_select_expression(expression_t *addr)
7353 assert(token.type == '.' || token.type == T_MINUSGREATER);
7354 bool select_left_arrow = (token.type == T_MINUSGREATER);
7357 if (token.type != T_IDENTIFIER) {
7358 parse_error_expected("while parsing select", T_IDENTIFIER, NULL);
7359 return create_invalid_expression();
7361 symbol_t *symbol = token.v.symbol;
7364 type_t *const orig_type = addr->base.type;
7365 type_t *const type = skip_typeref(orig_type);
7368 bool saw_error = false;
7369 if (is_type_pointer(type)) {
7370 if (!select_left_arrow) {
7372 "request for member '%Y' in something not a struct or union, but '%T'",
7376 type_left = skip_typeref(type->pointer.points_to);
7378 if (select_left_arrow && is_type_valid(type)) {
7379 errorf(HERE, "left hand side of '->' is not a pointer, but '%T'", orig_type);
7385 if (type_left->kind != TYPE_COMPOUND_STRUCT &&
7386 type_left->kind != TYPE_COMPOUND_UNION) {
7388 if (is_type_valid(type_left) && !saw_error) {
7390 "request for member '%Y' in something not a struct or union, but '%T'",
7393 return create_invalid_expression();
7396 compound_t *compound = type_left->compound.compound;
7397 if (!compound->complete) {
7398 errorf(HERE, "request for member '%Y' in incomplete type '%T'",
7400 return create_invalid_expression();
7403 type_qualifiers_t qualifiers = type_left->base.qualifiers;
7404 expression_t *result
7405 = find_create_select(HERE, addr, qualifiers, compound, symbol);
7407 if (result == NULL) {
7408 errorf(HERE, "'%T' has no member named '%Y'", orig_type, symbol);
7409 return create_invalid_expression();
7415 static void check_call_argument(type_t *expected_type,
7416 call_argument_t *argument, unsigned pos)
7418 type_t *expected_type_skip = skip_typeref(expected_type);
7419 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
7420 expression_t *arg_expr = argument->expression;
7421 type_t *arg_type = skip_typeref(arg_expr->base.type);
7423 /* handle transparent union gnu extension */
7424 if (is_type_union(expected_type_skip)
7425 && (get_type_modifiers(expected_type) & DM_TRANSPARENT_UNION)) {
7426 compound_t *union_decl = expected_type_skip->compound.compound;
7427 type_t *best_type = NULL;
7428 entity_t *entry = union_decl->members.entities;
7429 for ( ; entry != NULL; entry = entry->base.next) {
7430 assert(is_declaration(entry));
7431 type_t *decl_type = entry->declaration.type;
7432 error = semantic_assign(decl_type, arg_expr);
7433 if (error == ASSIGN_ERROR_INCOMPATIBLE
7434 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
7437 if (error == ASSIGN_SUCCESS) {
7438 best_type = decl_type;
7439 } else if (best_type == NULL) {
7440 best_type = decl_type;
7444 if (best_type != NULL) {
7445 expected_type = best_type;
7449 error = semantic_assign(expected_type, arg_expr);
7450 argument->expression = create_implicit_cast(arg_expr, expected_type);
7452 if (error != ASSIGN_SUCCESS) {
7453 /* report exact scope in error messages (like "in argument 3") */
7455 snprintf(buf, sizeof(buf), "call argument %u", pos);
7456 report_assign_error(error, expected_type, arg_expr, buf,
7457 &arg_expr->base.source_position);
7458 } else if (warning.traditional || warning.conversion) {
7459 type_t *const promoted_type = get_default_promoted_type(arg_type);
7460 if (!types_compatible(expected_type_skip, promoted_type) &&
7461 !types_compatible(expected_type_skip, type_void_ptr) &&
7462 !types_compatible(type_void_ptr, promoted_type)) {
7463 /* Deliberately show the skipped types in this warning */
7464 warningf(&arg_expr->base.source_position,
7465 "passing call argument %u as '%T' rather than '%T' due to prototype",
7466 pos, expected_type_skip, promoted_type);
7472 * Handle the semantic restrictions of builtin calls
7474 static void handle_builtin_argument_restrictions(call_expression_t *call) {
7475 switch (call->function->reference.entity->function.btk) {
7476 case bk_gnu_builtin_return_address:
7477 case bk_gnu_builtin_frame_address: {
7478 /* argument must be constant */
7479 call_argument_t *argument = call->arguments;
7481 if (! is_constant_expression(argument->expression)) {
7482 errorf(&call->base.source_position,
7483 "argument of '%Y' must be a constant expression",
7484 call->function->reference.entity->base.symbol);
7488 case bk_gnu_builtin_prefetch: {
7489 /* second and third argument must be constant if existent */
7490 call_argument_t *rw = call->arguments->next;
7491 call_argument_t *locality = NULL;
7494 if (! is_constant_expression(rw->expression)) {
7495 errorf(&call->base.source_position,
7496 "second argument of '%Y' must be a constant expression",
7497 call->function->reference.entity->base.symbol);
7499 locality = rw->next;
7501 if (locality != NULL) {
7502 if (! is_constant_expression(locality->expression)) {
7503 errorf(&call->base.source_position,
7504 "third argument of '%Y' must be a constant expression",
7505 call->function->reference.entity->base.symbol);
7507 locality = rw->next;
7517 * Parse a call expression, ie. expression '( ... )'.
7519 * @param expression the function address
7521 static expression_t *parse_call_expression(expression_t *expression)
7523 expression_t *result = allocate_expression_zero(EXPR_CALL);
7524 call_expression_t *call = &result->call;
7525 call->function = expression;
7527 type_t *const orig_type = expression->base.type;
7528 type_t *const type = skip_typeref(orig_type);
7530 function_type_t *function_type = NULL;
7531 if (is_type_pointer(type)) {
7532 type_t *const to_type = skip_typeref(type->pointer.points_to);
7534 if (is_type_function(to_type)) {
7535 function_type = &to_type->function;
7536 call->base.type = function_type->return_type;
7540 if (function_type == NULL && is_type_valid(type)) {
7542 "called object '%E' (type '%T') is not a pointer to a function",
7543 expression, orig_type);
7546 /* parse arguments */
7548 add_anchor_token(')');
7549 add_anchor_token(',');
7551 if (token.type != ')') {
7552 call_argument_t **anchor = &call->arguments;
7554 call_argument_t *argument = allocate_ast_zero(sizeof(*argument));
7555 argument->expression = parse_assignment_expression();
7558 anchor = &argument->next;
7560 if (token.type != ',')
7565 rem_anchor_token(',');
7566 rem_anchor_token(')');
7567 expect(')', end_error);
7569 if (function_type == NULL)
7572 /* check type and count of call arguments */
7573 function_parameter_t *parameter = function_type->parameters;
7574 call_argument_t *argument = call->arguments;
7575 if (!function_type->unspecified_parameters) {
7576 for (unsigned pos = 0; parameter != NULL && argument != NULL;
7577 parameter = parameter->next, argument = argument->next) {
7578 check_call_argument(parameter->type, argument, ++pos);
7581 if (parameter != NULL) {
7582 errorf(HERE, "too few arguments to function '%E'", expression);
7583 } else if (argument != NULL && !function_type->variadic) {
7584 errorf(HERE, "too many arguments to function '%E'", expression);
7588 /* do default promotion for other arguments */
7589 for (; argument != NULL; argument = argument->next) {
7590 type_t *type = argument->expression->base.type;
7592 type = get_default_promoted_type(type);
7594 argument->expression
7595 = create_implicit_cast(argument->expression, type);
7598 check_format(&result->call);
7600 if (warning.aggregate_return &&
7601 is_type_compound(skip_typeref(function_type->return_type))) {
7602 warningf(&result->base.source_position,
7603 "function call has aggregate value");
7606 if (call->function->kind == EXPR_REFERENCE) {
7607 reference_expression_t *reference = &call->function->reference;
7608 if (reference->entity->kind == ENTITY_FUNCTION &&
7609 reference->entity->function.btk != bk_none)
7610 handle_builtin_argument_restrictions(call);
7617 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
7619 static bool same_compound_type(const type_t *type1, const type_t *type2)
7622 is_type_compound(type1) &&
7623 type1->kind == type2->kind &&
7624 type1->compound.compound == type2->compound.compound;
7627 static expression_t const *get_reference_address(expression_t const *expr)
7629 bool regular_take_address = true;
7631 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7632 expr = expr->unary.value;
7634 regular_take_address = false;
7637 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7640 expr = expr->unary.value;
7643 if (expr->kind != EXPR_REFERENCE)
7646 /* special case for functions which are automatically converted to a
7647 * pointer to function without an extra TAKE_ADDRESS operation */
7648 if (!regular_take_address &&
7649 expr->reference.entity->kind != ENTITY_FUNCTION) {
7656 static void warn_reference_address_as_bool(expression_t const* expr)
7658 if (!warning.address)
7661 expr = get_reference_address(expr);
7663 warningf(&expr->base.source_position,
7664 "the address of '%Y' will always evaluate as 'true'",
7665 expr->reference.entity->base.symbol);
7669 static void warn_assignment_in_condition(const expression_t *const expr)
7671 if (!warning.parentheses)
7673 if (expr->base.kind != EXPR_BINARY_ASSIGN)
7675 if (expr->base.parenthesized)
7677 warningf(&expr->base.source_position,
7678 "suggest parentheses around assignment used as truth value");
7681 static void semantic_condition(expression_t const *const expr,
7682 char const *const context)
7684 type_t *const type = skip_typeref(expr->base.type);
7685 if (is_type_scalar(type)) {
7686 warn_reference_address_as_bool(expr);
7687 warn_assignment_in_condition(expr);
7688 } else if (is_type_valid(type)) {
7689 errorf(&expr->base.source_position,
7690 "%s must have scalar type", context);
7695 * Parse a conditional expression, ie. 'expression ? ... : ...'.
7697 * @param expression the conditional expression
7699 static expression_t *parse_conditional_expression(expression_t *expression)
7701 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
7703 conditional_expression_t *conditional = &result->conditional;
7704 conditional->condition = expression;
7707 add_anchor_token(':');
7709 /* §6.5.15:2 The first operand shall have scalar type. */
7710 semantic_condition(expression, "condition of conditional operator");
7712 expression_t *true_expression = expression;
7713 bool gnu_cond = false;
7714 if (GNU_MODE && token.type == ':') {
7717 true_expression = parse_expression();
7719 rem_anchor_token(':');
7720 expect(':', end_error);
7722 expression_t *false_expression =
7723 parse_sub_expression(c_mode & _CXX ? PREC_ASSIGNMENT : PREC_CONDITIONAL);
7725 type_t *const orig_true_type = true_expression->base.type;
7726 type_t *const orig_false_type = false_expression->base.type;
7727 type_t *const true_type = skip_typeref(orig_true_type);
7728 type_t *const false_type = skip_typeref(orig_false_type);
7731 type_t *result_type;
7732 if (is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7733 is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
7734 /* ISO/IEC 14882:1998(E) §5.16:2 */
7735 if (true_expression->kind == EXPR_UNARY_THROW) {
7736 result_type = false_type;
7737 } else if (false_expression->kind == EXPR_UNARY_THROW) {
7738 result_type = true_type;
7740 if (warning.other && (
7741 !is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7742 !is_type_atomic(false_type, ATOMIC_TYPE_VOID)
7744 warningf(&conditional->base.source_position,
7745 "ISO C forbids conditional expression with only one void side");
7747 result_type = type_void;
7749 } else if (is_type_arithmetic(true_type)
7750 && is_type_arithmetic(false_type)) {
7751 result_type = semantic_arithmetic(true_type, false_type);
7753 true_expression = create_implicit_cast(true_expression, result_type);
7754 false_expression = create_implicit_cast(false_expression, result_type);
7756 conditional->true_expression = true_expression;
7757 conditional->false_expression = false_expression;
7758 conditional->base.type = result_type;
7759 } else if (same_compound_type(true_type, false_type)) {
7760 /* just take 1 of the 2 types */
7761 result_type = true_type;
7762 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
7763 type_t *pointer_type;
7765 expression_t *other_expression;
7766 if (is_type_pointer(true_type) &&
7767 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
7768 pointer_type = true_type;
7769 other_type = false_type;
7770 other_expression = false_expression;
7772 pointer_type = false_type;
7773 other_type = true_type;
7774 other_expression = true_expression;
7777 if (is_null_pointer_constant(other_expression)) {
7778 result_type = pointer_type;
7779 } else if (is_type_pointer(other_type)) {
7780 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
7781 type_t *to2 = skip_typeref(other_type->pointer.points_to);
7784 if (is_type_atomic(to1, ATOMIC_TYPE_VOID) ||
7785 is_type_atomic(to2, ATOMIC_TYPE_VOID)) {
7787 } else if (types_compatible(get_unqualified_type(to1),
7788 get_unqualified_type(to2))) {
7791 if (warning.other) {
7792 warningf(&conditional->base.source_position,
7793 "pointer types '%T' and '%T' in conditional expression are incompatible",
7794 true_type, false_type);
7799 type_t *const type =
7800 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
7801 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7802 } else if (is_type_integer(other_type)) {
7803 if (warning.other) {
7804 warningf(&conditional->base.source_position,
7805 "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7807 result_type = pointer_type;
7809 if (is_type_valid(other_type)) {
7810 type_error_incompatible("while parsing conditional",
7811 &expression->base.source_position, true_type, false_type);
7813 result_type = type_error_type;
7816 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7817 type_error_incompatible("while parsing conditional",
7818 &conditional->base.source_position, true_type,
7821 result_type = type_error_type;
7824 conditional->true_expression
7825 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7826 conditional->false_expression
7827 = create_implicit_cast(false_expression, result_type);
7828 conditional->base.type = result_type;
7833 * Parse an extension expression.
7835 static expression_t *parse_extension(void)
7837 eat(T___extension__);
7839 bool old_gcc_extension = in_gcc_extension;
7840 in_gcc_extension = true;
7841 expression_t *expression = parse_sub_expression(PREC_UNARY);
7842 in_gcc_extension = old_gcc_extension;
7847 * Parse a __builtin_classify_type() expression.
7849 static expression_t *parse_builtin_classify_type(void)
7851 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7852 result->base.type = type_int;
7854 eat(T___builtin_classify_type);
7856 expect('(', end_error);
7857 add_anchor_token(')');
7858 expression_t *expression = parse_expression();
7859 rem_anchor_token(')');
7860 expect(')', end_error);
7861 result->classify_type.type_expression = expression;
7865 return create_invalid_expression();
7869 * Parse a delete expression
7870 * ISO/IEC 14882:1998(E) §5.3.5
7872 static expression_t *parse_delete(void)
7874 expression_t *const result = allocate_expression_zero(EXPR_UNARY_DELETE);
7875 result->base.type = type_void;
7879 if (token.type == '[') {
7881 result->kind = EXPR_UNARY_DELETE_ARRAY;
7882 expect(']', end_error);
7886 expression_t *const value = parse_sub_expression(PREC_CAST);
7887 result->unary.value = value;
7889 type_t *const type = skip_typeref(value->base.type);
7890 if (!is_type_pointer(type)) {
7891 if (is_type_valid(type)) {
7892 errorf(&value->base.source_position,
7893 "operand of delete must have pointer type");
7895 } else if (warning.other &&
7896 is_type_atomic(skip_typeref(type->pointer.points_to), ATOMIC_TYPE_VOID)) {
7897 warningf(&value->base.source_position,
7898 "deleting 'void*' is undefined");
7905 * Parse a throw expression
7906 * ISO/IEC 14882:1998(E) §15:1
7908 static expression_t *parse_throw(void)
7910 expression_t *const result = allocate_expression_zero(EXPR_UNARY_THROW);
7911 result->base.type = type_void;
7915 expression_t *value = NULL;
7916 switch (token.type) {
7918 value = parse_assignment_expression();
7919 /* ISO/IEC 14882:1998(E) §15.1:3 */
7920 type_t *const orig_type = value->base.type;
7921 type_t *const type = skip_typeref(orig_type);
7922 if (is_type_incomplete(type)) {
7923 errorf(&value->base.source_position,
7924 "cannot throw object of incomplete type '%T'", orig_type);
7925 } else if (is_type_pointer(type)) {
7926 type_t *const points_to = skip_typeref(type->pointer.points_to);
7927 if (is_type_incomplete(points_to) &&
7928 !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7929 errorf(&value->base.source_position,
7930 "cannot throw pointer to incomplete type '%T'", orig_type);
7938 result->unary.value = value;
7943 static bool check_pointer_arithmetic(const source_position_t *source_position,
7944 type_t *pointer_type,
7945 type_t *orig_pointer_type)
7947 type_t *points_to = pointer_type->pointer.points_to;
7948 points_to = skip_typeref(points_to);
7950 if (is_type_incomplete(points_to)) {
7951 if (!GNU_MODE || !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7952 errorf(source_position,
7953 "arithmetic with pointer to incomplete type '%T' not allowed",
7956 } else if (warning.pointer_arith) {
7957 warningf(source_position,
7958 "pointer of type '%T' used in arithmetic",
7961 } else if (is_type_function(points_to)) {
7963 errorf(source_position,
7964 "arithmetic with pointer to function type '%T' not allowed",
7967 } else if (warning.pointer_arith) {
7968 warningf(source_position,
7969 "pointer to a function '%T' used in arithmetic",
7976 static bool is_lvalue(const expression_t *expression)
7978 /* TODO: doesn't seem to be consistent with §6.3.2.1:1 */
7979 switch (expression->kind) {
7980 case EXPR_ARRAY_ACCESS:
7981 case EXPR_COMPOUND_LITERAL:
7982 case EXPR_REFERENCE:
7984 case EXPR_UNARY_DEREFERENCE:
7988 type_t *type = skip_typeref(expression->base.type);
7990 /* ISO/IEC 14882:1998(E) §3.10:3 */
7991 is_type_reference(type) ||
7992 /* Claim it is an lvalue, if the type is invalid. There was a parse
7993 * error before, which maybe prevented properly recognizing it as
7995 !is_type_valid(type);
8000 static void semantic_incdec(unary_expression_t *expression)
8002 type_t *const orig_type = expression->value->base.type;
8003 type_t *const type = skip_typeref(orig_type);
8004 if (is_type_pointer(type)) {
8005 if (!check_pointer_arithmetic(&expression->base.source_position,
8009 } else if (!is_type_real(type) && is_type_valid(type)) {
8010 /* TODO: improve error message */
8011 errorf(&expression->base.source_position,
8012 "operation needs an arithmetic or pointer type");
8015 if (!is_lvalue(expression->value)) {
8016 /* TODO: improve error message */
8017 errorf(&expression->base.source_position, "lvalue required as operand");
8019 expression->base.type = orig_type;
8022 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
8024 type_t *const orig_type = expression->value->base.type;
8025 type_t *const type = skip_typeref(orig_type);
8026 if (!is_type_arithmetic(type)) {
8027 if (is_type_valid(type)) {
8028 /* TODO: improve error message */
8029 errorf(&expression->base.source_position,
8030 "operation needs an arithmetic type");
8035 expression->base.type = orig_type;
8038 static void semantic_unexpr_plus(unary_expression_t *expression)
8040 semantic_unexpr_arithmetic(expression);
8041 if (warning.traditional)
8042 warningf(&expression->base.source_position,
8043 "traditional C rejects the unary plus operator");
8046 static void semantic_not(unary_expression_t *expression)
8048 /* §6.5.3.3:1 The operand [...] of the ! operator, scalar type. */
8049 semantic_condition(expression->value, "operand of !");
8050 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8053 static void semantic_unexpr_integer(unary_expression_t *expression)
8055 type_t *const orig_type = expression->value->base.type;
8056 type_t *const type = skip_typeref(orig_type);
8057 if (!is_type_integer(type)) {
8058 if (is_type_valid(type)) {
8059 errorf(&expression->base.source_position,
8060 "operand of ~ must be of integer type");
8065 expression->base.type = orig_type;
8068 static void semantic_dereference(unary_expression_t *expression)
8070 type_t *const orig_type = expression->value->base.type;
8071 type_t *const type = skip_typeref(orig_type);
8072 if (!is_type_pointer(type)) {
8073 if (is_type_valid(type)) {
8074 errorf(&expression->base.source_position,
8075 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
8080 type_t *result_type = type->pointer.points_to;
8081 result_type = automatic_type_conversion(result_type);
8082 expression->base.type = result_type;
8086 * Record that an address is taken (expression represents an lvalue).
8088 * @param expression the expression
8089 * @param may_be_register if true, the expression might be an register
8091 static void set_address_taken(expression_t *expression, bool may_be_register)
8093 if (expression->kind != EXPR_REFERENCE)
8096 entity_t *const entity = expression->reference.entity;
8098 if (entity->kind != ENTITY_VARIABLE && entity->kind != ENTITY_PARAMETER)
8101 if (entity->declaration.storage_class == STORAGE_CLASS_REGISTER
8102 && !may_be_register) {
8103 errorf(&expression->base.source_position,
8104 "address of register %s '%Y' requested",
8105 get_entity_kind_name(entity->kind), entity->base.symbol);
8108 if (entity->kind == ENTITY_VARIABLE) {
8109 entity->variable.address_taken = true;
8111 assert(entity->kind == ENTITY_PARAMETER);
8112 entity->parameter.address_taken = true;
8117 * Check the semantic of the address taken expression.
8119 static void semantic_take_addr(unary_expression_t *expression)
8121 expression_t *value = expression->value;
8122 value->base.type = revert_automatic_type_conversion(value);
8124 type_t *orig_type = value->base.type;
8125 type_t *type = skip_typeref(orig_type);
8126 if (!is_type_valid(type))
8130 if (!is_lvalue(value)) {
8131 errorf(&expression->base.source_position, "'&' requires an lvalue");
8133 if (type->kind == TYPE_BITFIELD) {
8134 errorf(&expression->base.source_position,
8135 "'&' not allowed on object with bitfield type '%T'",
8139 set_address_taken(value, false);
8141 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
8144 #define CREATE_UNARY_EXPRESSION_PARSER(token_type, unexpression_type, sfunc) \
8145 static expression_t *parse_##unexpression_type(void) \
8147 expression_t *unary_expression \
8148 = allocate_expression_zero(unexpression_type); \
8150 unary_expression->unary.value = parse_sub_expression(PREC_UNARY); \
8152 sfunc(&unary_expression->unary); \
8154 return unary_expression; \
8157 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
8158 semantic_unexpr_arithmetic)
8159 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
8160 semantic_unexpr_plus)
8161 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
8163 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
8164 semantic_dereference)
8165 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
8167 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
8168 semantic_unexpr_integer)
8169 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
8171 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
8174 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_type, unexpression_type, \
8176 static expression_t *parse_##unexpression_type(expression_t *left) \
8178 expression_t *unary_expression \
8179 = allocate_expression_zero(unexpression_type); \
8181 unary_expression->unary.value = left; \
8183 sfunc(&unary_expression->unary); \
8185 return unary_expression; \
8188 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
8189 EXPR_UNARY_POSTFIX_INCREMENT,
8191 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
8192 EXPR_UNARY_POSTFIX_DECREMENT,
8195 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
8197 /* TODO: handle complex + imaginary types */
8199 type_left = get_unqualified_type(type_left);
8200 type_right = get_unqualified_type(type_right);
8202 /* §6.3.1.8 Usual arithmetic conversions */
8203 if (type_left == type_long_double || type_right == type_long_double) {
8204 return type_long_double;
8205 } else if (type_left == type_double || type_right == type_double) {
8207 } else if (type_left == type_float || type_right == type_float) {
8211 type_left = promote_integer(type_left);
8212 type_right = promote_integer(type_right);
8214 if (type_left == type_right)
8217 bool const signed_left = is_type_signed(type_left);
8218 bool const signed_right = is_type_signed(type_right);
8219 int const rank_left = get_rank(type_left);
8220 int const rank_right = get_rank(type_right);
8222 if (signed_left == signed_right)
8223 return rank_left >= rank_right ? type_left : type_right;
8232 u_rank = rank_right;
8233 u_type = type_right;
8235 s_rank = rank_right;
8236 s_type = type_right;
8241 if (u_rank >= s_rank)
8244 /* casting rank to atomic_type_kind is a bit hacky, but makes things
8246 if (get_atomic_type_size((atomic_type_kind_t) s_rank)
8247 > get_atomic_type_size((atomic_type_kind_t) u_rank))
8251 case ATOMIC_TYPE_INT: return type_unsigned_int;
8252 case ATOMIC_TYPE_LONG: return type_unsigned_long;
8253 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
8255 default: panic("invalid atomic type");
8260 * Check the semantic restrictions for a binary expression.
8262 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
8264 expression_t *const left = expression->left;
8265 expression_t *const right = expression->right;
8266 type_t *const orig_type_left = left->base.type;
8267 type_t *const orig_type_right = right->base.type;
8268 type_t *const type_left = skip_typeref(orig_type_left);
8269 type_t *const type_right = skip_typeref(orig_type_right);
8271 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8272 /* TODO: improve error message */
8273 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8274 errorf(&expression->base.source_position,
8275 "operation needs arithmetic types");
8280 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8281 expression->left = create_implicit_cast(left, arithmetic_type);
8282 expression->right = create_implicit_cast(right, arithmetic_type);
8283 expression->base.type = arithmetic_type;
8286 static void warn_div_by_zero(binary_expression_t const *const expression)
8288 if (!warning.div_by_zero ||
8289 !is_type_integer(expression->base.type))
8292 expression_t const *const right = expression->right;
8293 /* The type of the right operand can be different for /= */
8294 if (is_type_integer(right->base.type) &&
8295 is_constant_expression(right) &&
8296 !fold_constant_to_bool(right)) {
8297 warningf(&expression->base.source_position, "division by zero");
8302 * Check the semantic restrictions for a div/mod expression.
8304 static void semantic_divmod_arithmetic(binary_expression_t *expression)
8306 semantic_binexpr_arithmetic(expression);
8307 warn_div_by_zero(expression);
8310 static void warn_addsub_in_shift(const expression_t *const expr)
8312 if (expr->base.parenthesized)
8316 switch (expr->kind) {
8317 case EXPR_BINARY_ADD: op = '+'; break;
8318 case EXPR_BINARY_SUB: op = '-'; break;
8322 warningf(&expr->base.source_position,
8323 "suggest parentheses around '%c' inside shift", op);
8326 static bool semantic_shift(binary_expression_t *expression)
8328 expression_t *const left = expression->left;
8329 expression_t *const right = expression->right;
8330 type_t *const orig_type_left = left->base.type;
8331 type_t *const orig_type_right = right->base.type;
8332 type_t * type_left = skip_typeref(orig_type_left);
8333 type_t * type_right = skip_typeref(orig_type_right);
8335 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8336 /* TODO: improve error message */
8337 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8338 errorf(&expression->base.source_position,
8339 "operands of shift operation must have integer types");
8344 type_left = promote_integer(type_left);
8346 if (is_constant_expression(right)) {
8347 long count = fold_constant_to_int(right);
8349 warningf(&right->base.source_position,
8350 "shift count must be non-negative");
8351 } else if ((unsigned long)count >=
8352 get_atomic_type_size(type_left->atomic.akind) * 8) {
8353 warningf(&right->base.source_position,
8354 "shift count must be less than type width");
8358 type_right = promote_integer(type_right);
8359 expression->right = create_implicit_cast(right, type_right);
8364 static void semantic_shift_op(binary_expression_t *expression)
8366 expression_t *const left = expression->left;
8367 expression_t *const right = expression->right;
8369 if (!semantic_shift(expression))
8372 if (warning.parentheses) {
8373 warn_addsub_in_shift(left);
8374 warn_addsub_in_shift(right);
8377 type_t *const orig_type_left = left->base.type;
8378 type_t * type_left = skip_typeref(orig_type_left);
8380 type_left = promote_integer(type_left);
8381 expression->left = create_implicit_cast(left, type_left);
8382 expression->base.type = type_left;
8385 static void semantic_add(binary_expression_t *expression)
8387 expression_t *const left = expression->left;
8388 expression_t *const right = expression->right;
8389 type_t *const orig_type_left = left->base.type;
8390 type_t *const orig_type_right = right->base.type;
8391 type_t *const type_left = skip_typeref(orig_type_left);
8392 type_t *const type_right = skip_typeref(orig_type_right);
8395 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8396 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8397 expression->left = create_implicit_cast(left, arithmetic_type);
8398 expression->right = create_implicit_cast(right, arithmetic_type);
8399 expression->base.type = arithmetic_type;
8400 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8401 check_pointer_arithmetic(&expression->base.source_position,
8402 type_left, orig_type_left);
8403 expression->base.type = type_left;
8404 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
8405 check_pointer_arithmetic(&expression->base.source_position,
8406 type_right, orig_type_right);
8407 expression->base.type = type_right;
8408 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8409 errorf(&expression->base.source_position,
8410 "invalid operands to binary + ('%T', '%T')",
8411 orig_type_left, orig_type_right);
8415 static void semantic_sub(binary_expression_t *expression)
8417 expression_t *const left = expression->left;
8418 expression_t *const right = expression->right;
8419 type_t *const orig_type_left = left->base.type;
8420 type_t *const orig_type_right = right->base.type;
8421 type_t *const type_left = skip_typeref(orig_type_left);
8422 type_t *const type_right = skip_typeref(orig_type_right);
8423 source_position_t const *const pos = &expression->base.source_position;
8426 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8427 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8428 expression->left = create_implicit_cast(left, arithmetic_type);
8429 expression->right = create_implicit_cast(right, arithmetic_type);
8430 expression->base.type = arithmetic_type;
8431 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8432 check_pointer_arithmetic(&expression->base.source_position,
8433 type_left, orig_type_left);
8434 expression->base.type = type_left;
8435 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8436 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
8437 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
8438 if (!types_compatible(unqual_left, unqual_right)) {
8440 "subtracting pointers to incompatible types '%T' and '%T'",
8441 orig_type_left, orig_type_right);
8442 } else if (!is_type_object(unqual_left)) {
8443 if (!is_type_atomic(unqual_left, ATOMIC_TYPE_VOID)) {
8444 errorf(pos, "subtracting pointers to non-object types '%T'",
8446 } else if (warning.other) {
8447 warningf(pos, "subtracting pointers to void");
8450 expression->base.type = type_ptrdiff_t;
8451 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8452 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
8453 orig_type_left, orig_type_right);
8457 static void warn_string_literal_address(expression_t const* expr)
8459 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
8460 expr = expr->unary.value;
8461 if (expr->kind != EXPR_UNARY_DEREFERENCE)
8463 expr = expr->unary.value;
8466 if (expr->kind == EXPR_STRING_LITERAL ||
8467 expr->kind == EXPR_WIDE_STRING_LITERAL) {
8468 warningf(&expr->base.source_position,
8469 "comparison with string literal results in unspecified behaviour");
8473 static void warn_comparison_in_comparison(const expression_t *const expr)
8475 if (expr->base.parenthesized)
8477 switch (expr->base.kind) {
8478 case EXPR_BINARY_LESS:
8479 case EXPR_BINARY_GREATER:
8480 case EXPR_BINARY_LESSEQUAL:
8481 case EXPR_BINARY_GREATEREQUAL:
8482 case EXPR_BINARY_NOTEQUAL:
8483 case EXPR_BINARY_EQUAL:
8484 warningf(&expr->base.source_position,
8485 "comparisons like 'x <= y < z' do not have their mathematical meaning");
8492 static bool maybe_negative(expression_t const *const expr)
8495 !is_constant_expression(expr) ||
8496 fold_constant_to_int(expr) < 0;
8500 * Check the semantics of comparison expressions.
8502 * @param expression The expression to check.
8504 static void semantic_comparison(binary_expression_t *expression)
8506 expression_t *left = expression->left;
8507 expression_t *right = expression->right;
8509 if (warning.address) {
8510 warn_string_literal_address(left);
8511 warn_string_literal_address(right);
8513 expression_t const* const func_left = get_reference_address(left);
8514 if (func_left != NULL && is_null_pointer_constant(right)) {
8515 warningf(&expression->base.source_position,
8516 "the address of '%Y' will never be NULL",
8517 func_left->reference.entity->base.symbol);
8520 expression_t const* const func_right = get_reference_address(right);
8521 if (func_right != NULL && is_null_pointer_constant(right)) {
8522 warningf(&expression->base.source_position,
8523 "the address of '%Y' will never be NULL",
8524 func_right->reference.entity->base.symbol);
8528 if (warning.parentheses) {
8529 warn_comparison_in_comparison(left);
8530 warn_comparison_in_comparison(right);
8533 type_t *orig_type_left = left->base.type;
8534 type_t *orig_type_right = right->base.type;
8535 type_t *type_left = skip_typeref(orig_type_left);
8536 type_t *type_right = skip_typeref(orig_type_right);
8538 /* TODO non-arithmetic types */
8539 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8540 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8542 /* test for signed vs unsigned compares */
8543 if (warning.sign_compare && is_type_integer(arithmetic_type)) {
8544 bool const signed_left = is_type_signed(type_left);
8545 bool const signed_right = is_type_signed(type_right);
8546 if (signed_left != signed_right) {
8547 /* FIXME long long needs better const folding magic */
8548 /* TODO check whether constant value can be represented by other type */
8549 if ((signed_left && maybe_negative(left)) ||
8550 (signed_right && maybe_negative(right))) {
8551 warningf(&expression->base.source_position,
8552 "comparison between signed and unsigned");
8557 expression->left = create_implicit_cast(left, arithmetic_type);
8558 expression->right = create_implicit_cast(right, arithmetic_type);
8559 expression->base.type = arithmetic_type;
8560 if (warning.float_equal &&
8561 (expression->base.kind == EXPR_BINARY_EQUAL ||
8562 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
8563 is_type_float(arithmetic_type)) {
8564 warningf(&expression->base.source_position,
8565 "comparing floating point with == or != is unsafe");
8567 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8568 /* TODO check compatibility */
8569 } else if (is_type_pointer(type_left)) {
8570 expression->right = create_implicit_cast(right, type_left);
8571 } else if (is_type_pointer(type_right)) {
8572 expression->left = create_implicit_cast(left, type_right);
8573 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8574 type_error_incompatible("invalid operands in comparison",
8575 &expression->base.source_position,
8576 type_left, type_right);
8578 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8582 * Checks if a compound type has constant fields.
8584 static bool has_const_fields(const compound_type_t *type)
8586 compound_t *compound = type->compound;
8587 entity_t *entry = compound->members.entities;
8589 for (; entry != NULL; entry = entry->base.next) {
8590 if (!is_declaration(entry))
8593 const type_t *decl_type = skip_typeref(entry->declaration.type);
8594 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
8601 static bool is_valid_assignment_lhs(expression_t const* const left)
8603 type_t *const orig_type_left = revert_automatic_type_conversion(left);
8604 type_t *const type_left = skip_typeref(orig_type_left);
8606 if (!is_lvalue(left)) {
8607 errorf(HERE, "left hand side '%E' of assignment is not an lvalue",
8612 if (left->kind == EXPR_REFERENCE
8613 && left->reference.entity->kind == ENTITY_FUNCTION) {
8614 errorf(HERE, "cannot assign to function '%E'", left);
8618 if (is_type_array(type_left)) {
8619 errorf(HERE, "cannot assign to array '%E'", left);
8622 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
8623 errorf(HERE, "assignment to readonly location '%E' (type '%T')", left,
8627 if (is_type_incomplete(type_left)) {
8628 errorf(HERE, "left-hand side '%E' of assignment has incomplete type '%T'",
8629 left, orig_type_left);
8632 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
8633 errorf(HERE, "cannot assign to '%E' because compound type '%T' has readonly fields",
8634 left, orig_type_left);
8641 static void semantic_arithmetic_assign(binary_expression_t *expression)
8643 expression_t *left = expression->left;
8644 expression_t *right = expression->right;
8645 type_t *orig_type_left = left->base.type;
8646 type_t *orig_type_right = right->base.type;
8648 if (!is_valid_assignment_lhs(left))
8651 type_t *type_left = skip_typeref(orig_type_left);
8652 type_t *type_right = skip_typeref(orig_type_right);
8654 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8655 /* TODO: improve error message */
8656 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8657 errorf(&expression->base.source_position,
8658 "operation needs arithmetic types");
8663 /* combined instructions are tricky. We can't create an implicit cast on
8664 * the left side, because we need the uncasted form for the store.
8665 * The ast2firm pass has to know that left_type must be right_type
8666 * for the arithmetic operation and create a cast by itself */
8667 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8668 expression->right = create_implicit_cast(right, arithmetic_type);
8669 expression->base.type = type_left;
8672 static void semantic_divmod_assign(binary_expression_t *expression)
8674 semantic_arithmetic_assign(expression);
8675 warn_div_by_zero(expression);
8678 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
8680 expression_t *const left = expression->left;
8681 expression_t *const right = expression->right;
8682 type_t *const orig_type_left = left->base.type;
8683 type_t *const orig_type_right = right->base.type;
8684 type_t *const type_left = skip_typeref(orig_type_left);
8685 type_t *const type_right = skip_typeref(orig_type_right);
8687 if (!is_valid_assignment_lhs(left))
8690 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8691 /* combined instructions are tricky. We can't create an implicit cast on
8692 * the left side, because we need the uncasted form for the store.
8693 * The ast2firm pass has to know that left_type must be right_type
8694 * for the arithmetic operation and create a cast by itself */
8695 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
8696 expression->right = create_implicit_cast(right, arithmetic_type);
8697 expression->base.type = type_left;
8698 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8699 check_pointer_arithmetic(&expression->base.source_position,
8700 type_left, orig_type_left);
8701 expression->base.type = type_left;
8702 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8703 errorf(&expression->base.source_position,
8704 "incompatible types '%T' and '%T' in assignment",
8705 orig_type_left, orig_type_right);
8709 static void semantic_integer_assign(binary_expression_t *expression)
8711 expression_t *left = expression->left;
8712 expression_t *right = expression->right;
8713 type_t *orig_type_left = left->base.type;
8714 type_t *orig_type_right = right->base.type;
8716 if (!is_valid_assignment_lhs(left))
8719 type_t *type_left = skip_typeref(orig_type_left);
8720 type_t *type_right = skip_typeref(orig_type_right);
8722 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8723 /* TODO: improve error message */
8724 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8725 errorf(&expression->base.source_position,
8726 "operation needs integer types");
8731 /* combined instructions are tricky. We can't create an implicit cast on
8732 * the left side, because we need the uncasted form for the store.
8733 * The ast2firm pass has to know that left_type must be right_type
8734 * for the arithmetic operation and create a cast by itself */
8735 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8736 expression->right = create_implicit_cast(right, arithmetic_type);
8737 expression->base.type = type_left;
8740 static void semantic_shift_assign(binary_expression_t *expression)
8742 expression_t *left = expression->left;
8744 if (!is_valid_assignment_lhs(left))
8747 if (!semantic_shift(expression))
8750 expression->base.type = skip_typeref(left->base.type);
8753 static void warn_logical_and_within_or(const expression_t *const expr)
8755 if (expr->base.kind != EXPR_BINARY_LOGICAL_AND)
8757 if (expr->base.parenthesized)
8759 warningf(&expr->base.source_position,
8760 "suggest parentheses around && within ||");
8764 * Check the semantic restrictions of a logical expression.
8766 static void semantic_logical_op(binary_expression_t *expression)
8768 /* §6.5.13:2 Each of the operands shall have scalar type.
8769 * §6.5.14:2 Each of the operands shall have scalar type. */
8770 semantic_condition(expression->left, "left operand of logical operator");
8771 semantic_condition(expression->right, "right operand of logical operator");
8772 if (expression->base.kind == EXPR_BINARY_LOGICAL_OR &&
8773 warning.parentheses) {
8774 warn_logical_and_within_or(expression->left);
8775 warn_logical_and_within_or(expression->right);
8777 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8781 * Check the semantic restrictions of a binary assign expression.
8783 static void semantic_binexpr_assign(binary_expression_t *expression)
8785 expression_t *left = expression->left;
8786 type_t *orig_type_left = left->base.type;
8788 if (!is_valid_assignment_lhs(left))
8791 assign_error_t error = semantic_assign(orig_type_left, expression->right);
8792 report_assign_error(error, orig_type_left, expression->right,
8793 "assignment", &left->base.source_position);
8794 expression->right = create_implicit_cast(expression->right, orig_type_left);
8795 expression->base.type = orig_type_left;
8799 * Determine if the outermost operation (or parts thereof) of the given
8800 * expression has no effect in order to generate a warning about this fact.
8801 * Therefore in some cases this only examines some of the operands of the
8802 * expression (see comments in the function and examples below).
8804 * f() + 23; // warning, because + has no effect
8805 * x || f(); // no warning, because x controls execution of f()
8806 * x ? y : f(); // warning, because y has no effect
8807 * (void)x; // no warning to be able to suppress the warning
8808 * This function can NOT be used for an "expression has definitely no effect"-
8810 static bool expression_has_effect(const expression_t *const expr)
8812 switch (expr->kind) {
8813 case EXPR_UNKNOWN: break;
8814 case EXPR_INVALID: return true; /* do NOT warn */
8815 case EXPR_REFERENCE: return false;
8816 case EXPR_REFERENCE_ENUM_VALUE: return false;
8817 /* suppress the warning for microsoft __noop operations */
8818 case EXPR_CONST: return expr->conste.is_ms_noop;
8819 case EXPR_CHARACTER_CONSTANT: return false;
8820 case EXPR_WIDE_CHARACTER_CONSTANT: return false;
8821 case EXPR_STRING_LITERAL: return false;
8822 case EXPR_WIDE_STRING_LITERAL: return false;
8823 case EXPR_LABEL_ADDRESS: return false;
8826 const call_expression_t *const call = &expr->call;
8827 if (call->function->kind != EXPR_REFERENCE)
8830 switch (call->function->reference.entity->function.btk) {
8831 /* FIXME: which builtins have no effect? */
8832 default: return true;
8836 /* Generate the warning if either the left or right hand side of a
8837 * conditional expression has no effect */
8838 case EXPR_CONDITIONAL: {
8839 conditional_expression_t const *const cond = &expr->conditional;
8840 expression_t const *const t = cond->true_expression;
8842 (t == NULL || expression_has_effect(t)) &&
8843 expression_has_effect(cond->false_expression);
8846 case EXPR_SELECT: return false;
8847 case EXPR_ARRAY_ACCESS: return false;
8848 case EXPR_SIZEOF: return false;
8849 case EXPR_CLASSIFY_TYPE: return false;
8850 case EXPR_ALIGNOF: return false;
8852 case EXPR_FUNCNAME: return false;
8853 case EXPR_BUILTIN_CONSTANT_P: return false;
8854 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return false;
8855 case EXPR_OFFSETOF: return false;
8856 case EXPR_VA_START: return true;
8857 case EXPR_VA_ARG: return true;
8858 case EXPR_VA_COPY: return true;
8859 case EXPR_STATEMENT: return true; // TODO
8860 case EXPR_COMPOUND_LITERAL: return false;
8862 case EXPR_UNARY_NEGATE: return false;
8863 case EXPR_UNARY_PLUS: return false;
8864 case EXPR_UNARY_BITWISE_NEGATE: return false;
8865 case EXPR_UNARY_NOT: return false;
8866 case EXPR_UNARY_DEREFERENCE: return false;
8867 case EXPR_UNARY_TAKE_ADDRESS: return false;
8868 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
8869 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
8870 case EXPR_UNARY_PREFIX_INCREMENT: return true;
8871 case EXPR_UNARY_PREFIX_DECREMENT: return true;
8873 /* Treat void casts as if they have an effect in order to being able to
8874 * suppress the warning */
8875 case EXPR_UNARY_CAST: {
8876 type_t *const type = skip_typeref(expr->base.type);
8877 return is_type_atomic(type, ATOMIC_TYPE_VOID);
8880 case EXPR_UNARY_CAST_IMPLICIT: return true;
8881 case EXPR_UNARY_ASSUME: return true;
8882 case EXPR_UNARY_DELETE: return true;
8883 case EXPR_UNARY_DELETE_ARRAY: return true;
8884 case EXPR_UNARY_THROW: return true;
8886 case EXPR_BINARY_ADD: return false;
8887 case EXPR_BINARY_SUB: return false;
8888 case EXPR_BINARY_MUL: return false;
8889 case EXPR_BINARY_DIV: return false;
8890 case EXPR_BINARY_MOD: return false;
8891 case EXPR_BINARY_EQUAL: return false;
8892 case EXPR_BINARY_NOTEQUAL: return false;
8893 case EXPR_BINARY_LESS: return false;
8894 case EXPR_BINARY_LESSEQUAL: return false;
8895 case EXPR_BINARY_GREATER: return false;
8896 case EXPR_BINARY_GREATEREQUAL: return false;
8897 case EXPR_BINARY_BITWISE_AND: return false;
8898 case EXPR_BINARY_BITWISE_OR: return false;
8899 case EXPR_BINARY_BITWISE_XOR: return false;
8900 case EXPR_BINARY_SHIFTLEFT: return false;
8901 case EXPR_BINARY_SHIFTRIGHT: return false;
8902 case EXPR_BINARY_ASSIGN: return true;
8903 case EXPR_BINARY_MUL_ASSIGN: return true;
8904 case EXPR_BINARY_DIV_ASSIGN: return true;
8905 case EXPR_BINARY_MOD_ASSIGN: return true;
8906 case EXPR_BINARY_ADD_ASSIGN: return true;
8907 case EXPR_BINARY_SUB_ASSIGN: return true;
8908 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
8909 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
8910 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
8911 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
8912 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
8914 /* Only examine the right hand side of && and ||, because the left hand
8915 * side already has the effect of controlling the execution of the right
8917 case EXPR_BINARY_LOGICAL_AND:
8918 case EXPR_BINARY_LOGICAL_OR:
8919 /* Only examine the right hand side of a comma expression, because the left
8920 * hand side has a separate warning */
8921 case EXPR_BINARY_COMMA:
8922 return expression_has_effect(expr->binary.right);
8924 case EXPR_BINARY_ISGREATER: return false;
8925 case EXPR_BINARY_ISGREATEREQUAL: return false;
8926 case EXPR_BINARY_ISLESS: return false;
8927 case EXPR_BINARY_ISLESSEQUAL: return false;
8928 case EXPR_BINARY_ISLESSGREATER: return false;
8929 case EXPR_BINARY_ISUNORDERED: return false;
8932 internal_errorf(HERE, "unexpected expression");
8935 static void semantic_comma(binary_expression_t *expression)
8937 if (warning.unused_value) {
8938 const expression_t *const left = expression->left;
8939 if (!expression_has_effect(left)) {
8940 warningf(&left->base.source_position,
8941 "left-hand operand of comma expression has no effect");
8944 expression->base.type = expression->right->base.type;
8948 * @param prec_r precedence of the right operand
8950 #define CREATE_BINEXPR_PARSER(token_type, binexpression_type, prec_r, sfunc) \
8951 static expression_t *parse_##binexpression_type(expression_t *left) \
8953 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
8954 binexpr->binary.left = left; \
8957 expression_t *right = parse_sub_expression(prec_r); \
8959 binexpr->binary.right = right; \
8960 sfunc(&binexpr->binary); \
8965 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, PREC_CAST, semantic_binexpr_arithmetic)
8966 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, PREC_CAST, semantic_divmod_arithmetic)
8967 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, PREC_CAST, semantic_divmod_arithmetic)
8968 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, PREC_MULTIPLICATIVE, semantic_add)
8969 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, PREC_MULTIPLICATIVE, semantic_sub)
8970 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT, PREC_ADDITIVE, semantic_shift_op)
8971 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT, PREC_ADDITIVE, semantic_shift_op)
8972 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, PREC_SHIFT, semantic_comparison)
8973 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, PREC_SHIFT, semantic_comparison)
8974 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL, PREC_SHIFT, semantic_comparison)
8975 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL, PREC_SHIFT, semantic_comparison)
8976 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL, PREC_RELATIONAL, semantic_comparison)
8977 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL, PREC_RELATIONAL, semantic_comparison)
8978 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND, PREC_EQUALITY, semantic_binexpr_arithmetic)
8979 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR, PREC_AND, semantic_binexpr_arithmetic)
8980 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR, PREC_XOR, semantic_binexpr_arithmetic)
8981 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND, PREC_OR, semantic_logical_op)
8982 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR, PREC_LOGICAL_AND, semantic_logical_op)
8983 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, PREC_ASSIGNMENT, semantic_binexpr_assign)
8984 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8985 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8986 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8987 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8988 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8989 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8990 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8991 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8992 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8993 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8994 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, PREC_ASSIGNMENT, semantic_comma)
8997 static expression_t *parse_sub_expression(precedence_t precedence)
8999 if (token.type < 0) {
9000 return expected_expression_error();
9003 expression_parser_function_t *parser
9004 = &expression_parsers[token.type];
9005 source_position_t source_position = token.source_position;
9008 if (parser->parser != NULL) {
9009 left = parser->parser();
9011 left = parse_primary_expression();
9013 assert(left != NULL);
9014 left->base.source_position = source_position;
9017 if (token.type < 0) {
9018 return expected_expression_error();
9021 parser = &expression_parsers[token.type];
9022 if (parser->infix_parser == NULL)
9024 if (parser->infix_precedence < precedence)
9027 left = parser->infix_parser(left);
9029 assert(left != NULL);
9030 assert(left->kind != EXPR_UNKNOWN);
9031 left->base.source_position = source_position;
9038 * Parse an expression.
9040 static expression_t *parse_expression(void)
9042 return parse_sub_expression(PREC_EXPRESSION);
9046 * Register a parser for a prefix-like operator.
9048 * @param parser the parser function
9049 * @param token_type the token type of the prefix token
9051 static void register_expression_parser(parse_expression_function parser,
9054 expression_parser_function_t *entry = &expression_parsers[token_type];
9056 if (entry->parser != NULL) {
9057 diagnosticf("for token '%k'\n", (token_type_t)token_type);
9058 panic("trying to register multiple expression parsers for a token");
9060 entry->parser = parser;
9064 * Register a parser for an infix operator with given precedence.
9066 * @param parser the parser function
9067 * @param token_type the token type of the infix operator
9068 * @param precedence the precedence of the operator
9070 static void register_infix_parser(parse_expression_infix_function parser,
9071 int token_type, precedence_t precedence)
9073 expression_parser_function_t *entry = &expression_parsers[token_type];
9075 if (entry->infix_parser != NULL) {
9076 diagnosticf("for token '%k'\n", (token_type_t)token_type);
9077 panic("trying to register multiple infix expression parsers for a "
9080 entry->infix_parser = parser;
9081 entry->infix_precedence = precedence;
9085 * Initialize the expression parsers.
9087 static void init_expression_parsers(void)
9089 memset(&expression_parsers, 0, sizeof(expression_parsers));
9091 register_infix_parser(parse_array_expression, '[', PREC_POSTFIX);
9092 register_infix_parser(parse_call_expression, '(', PREC_POSTFIX);
9093 register_infix_parser(parse_select_expression, '.', PREC_POSTFIX);
9094 register_infix_parser(parse_select_expression, T_MINUSGREATER, PREC_POSTFIX);
9095 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT, T_PLUSPLUS, PREC_POSTFIX);
9096 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT, T_MINUSMINUS, PREC_POSTFIX);
9097 register_infix_parser(parse_EXPR_BINARY_MUL, '*', PREC_MULTIPLICATIVE);
9098 register_infix_parser(parse_EXPR_BINARY_DIV, '/', PREC_MULTIPLICATIVE);
9099 register_infix_parser(parse_EXPR_BINARY_MOD, '%', PREC_MULTIPLICATIVE);
9100 register_infix_parser(parse_EXPR_BINARY_ADD, '+', PREC_ADDITIVE);
9101 register_infix_parser(parse_EXPR_BINARY_SUB, '-', PREC_ADDITIVE);
9102 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, PREC_SHIFT);
9103 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, PREC_SHIFT);
9104 register_infix_parser(parse_EXPR_BINARY_LESS, '<', PREC_RELATIONAL);
9105 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', PREC_RELATIONAL);
9106 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, PREC_RELATIONAL);
9107 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, PREC_RELATIONAL);
9108 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, PREC_EQUALITY);
9109 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL, T_EXCLAMATIONMARKEQUAL, PREC_EQUALITY);
9110 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', PREC_AND);
9111 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', PREC_XOR);
9112 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', PREC_OR);
9113 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, PREC_LOGICAL_AND);
9114 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, PREC_LOGICAL_OR);
9115 register_infix_parser(parse_conditional_expression, '?', PREC_CONDITIONAL);
9116 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', PREC_ASSIGNMENT);
9117 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, PREC_ASSIGNMENT);
9118 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, PREC_ASSIGNMENT);
9119 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, PREC_ASSIGNMENT);
9120 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, PREC_ASSIGNMENT);
9121 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, PREC_ASSIGNMENT);
9122 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN, T_LESSLESSEQUAL, PREC_ASSIGNMENT);
9123 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN, T_GREATERGREATEREQUAL, PREC_ASSIGNMENT);
9124 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN, T_ANDEQUAL, PREC_ASSIGNMENT);
9125 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN, T_PIPEEQUAL, PREC_ASSIGNMENT);
9126 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN, T_CARETEQUAL, PREC_ASSIGNMENT);
9127 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', PREC_EXPRESSION);
9129 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-');
9130 register_expression_parser(parse_EXPR_UNARY_PLUS, '+');
9131 register_expression_parser(parse_EXPR_UNARY_NOT, '!');
9132 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~');
9133 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*');
9134 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&');
9135 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT, T_PLUSPLUS);
9136 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT, T_MINUSMINUS);
9137 register_expression_parser(parse_sizeof, T_sizeof);
9138 register_expression_parser(parse_alignof, T___alignof__);
9139 register_expression_parser(parse_extension, T___extension__);
9140 register_expression_parser(parse_builtin_classify_type, T___builtin_classify_type);
9141 register_expression_parser(parse_delete, T_delete);
9142 register_expression_parser(parse_throw, T_throw);
9146 * Parse a asm statement arguments specification.
9148 static asm_argument_t *parse_asm_arguments(bool is_out)
9150 asm_argument_t *result = NULL;
9151 asm_argument_t **anchor = &result;
9153 while (token.type == T_STRING_LITERAL || token.type == '[') {
9154 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
9155 memset(argument, 0, sizeof(argument[0]));
9157 if (token.type == '[') {
9159 if (token.type != T_IDENTIFIER) {
9160 parse_error_expected("while parsing asm argument",
9161 T_IDENTIFIER, NULL);
9164 argument->symbol = token.v.symbol;
9166 expect(']', end_error);
9169 argument->constraints = parse_string_literals();
9170 expect('(', end_error);
9171 add_anchor_token(')');
9172 expression_t *expression = parse_expression();
9173 rem_anchor_token(')');
9175 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
9176 * change size or type representation (e.g. int -> long is ok, but
9177 * int -> float is not) */
9178 if (expression->kind == EXPR_UNARY_CAST) {
9179 type_t *const type = expression->base.type;
9180 type_kind_t const kind = type->kind;
9181 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
9184 if (kind == TYPE_ATOMIC) {
9185 atomic_type_kind_t const akind = type->atomic.akind;
9186 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9187 size = get_atomic_type_size(akind);
9189 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9190 size = get_atomic_type_size(get_intptr_kind());
9194 expression_t *const value = expression->unary.value;
9195 type_t *const value_type = value->base.type;
9196 type_kind_t const value_kind = value_type->kind;
9198 unsigned value_flags;
9199 unsigned value_size;
9200 if (value_kind == TYPE_ATOMIC) {
9201 atomic_type_kind_t const value_akind = value_type->atomic.akind;
9202 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9203 value_size = get_atomic_type_size(value_akind);
9204 } else if (value_kind == TYPE_POINTER) {
9205 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9206 value_size = get_atomic_type_size(get_intptr_kind());
9211 if (value_flags != flags || value_size != size)
9215 } while (expression->kind == EXPR_UNARY_CAST);
9219 if (!is_lvalue(expression)) {
9220 errorf(&expression->base.source_position,
9221 "asm output argument is not an lvalue");
9224 if (argument->constraints.begin[0] == '+')
9225 mark_vars_read(expression, NULL);
9227 mark_vars_read(expression, NULL);
9229 argument->expression = expression;
9230 expect(')', end_error);
9232 set_address_taken(expression, true);
9235 anchor = &argument->next;
9237 if (token.type != ',')
9248 * Parse a asm statement clobber specification.
9250 static asm_clobber_t *parse_asm_clobbers(void)
9252 asm_clobber_t *result = NULL;
9253 asm_clobber_t *last = NULL;
9255 while (token.type == T_STRING_LITERAL) {
9256 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
9257 clobber->clobber = parse_string_literals();
9260 last->next = clobber;
9266 if (token.type != ',')
9275 * Parse an asm statement.
9277 static statement_t *parse_asm_statement(void)
9279 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
9280 asm_statement_t *asm_statement = &statement->asms;
9284 if (token.type == T_volatile) {
9286 asm_statement->is_volatile = true;
9289 expect('(', end_error);
9290 add_anchor_token(')');
9291 add_anchor_token(':');
9292 asm_statement->asm_text = parse_string_literals();
9294 if (token.type != ':') {
9295 rem_anchor_token(':');
9300 asm_statement->outputs = parse_asm_arguments(true);
9301 if (token.type != ':') {
9302 rem_anchor_token(':');
9307 asm_statement->inputs = parse_asm_arguments(false);
9308 if (token.type != ':') {
9309 rem_anchor_token(':');
9312 rem_anchor_token(':');
9315 asm_statement->clobbers = parse_asm_clobbers();
9318 rem_anchor_token(')');
9319 expect(')', end_error);
9320 expect(';', end_error);
9322 if (asm_statement->outputs == NULL) {
9323 /* GCC: An 'asm' instruction without any output operands will be treated
9324 * identically to a volatile 'asm' instruction. */
9325 asm_statement->is_volatile = true;
9330 return create_invalid_statement();
9334 * Parse a case statement.
9336 static statement_t *parse_case_statement(void)
9338 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9339 source_position_t *const pos = &statement->base.source_position;
9343 expression_t *const expression = parse_expression();
9344 statement->case_label.expression = expression;
9345 if (!is_constant_expression(expression)) {
9346 /* This check does not prevent the error message in all cases of an
9347 * prior error while parsing the expression. At least it catches the
9348 * common case of a mistyped enum entry. */
9349 if (is_type_valid(skip_typeref(expression->base.type))) {
9350 errorf(pos, "case label does not reduce to an integer constant");
9352 statement->case_label.is_bad = true;
9354 long const val = fold_constant_to_int(expression);
9355 statement->case_label.first_case = val;
9356 statement->case_label.last_case = val;
9360 if (token.type == T_DOTDOTDOT) {
9362 expression_t *const end_range = parse_expression();
9363 statement->case_label.end_range = end_range;
9364 if (!is_constant_expression(end_range)) {
9365 /* This check does not prevent the error message in all cases of an
9366 * prior error while parsing the expression. At least it catches the
9367 * common case of a mistyped enum entry. */
9368 if (is_type_valid(skip_typeref(end_range->base.type))) {
9369 errorf(pos, "case range does not reduce to an integer constant");
9371 statement->case_label.is_bad = true;
9373 long const val = fold_constant_to_int(end_range);
9374 statement->case_label.last_case = val;
9376 if (warning.other && val < statement->case_label.first_case) {
9377 statement->case_label.is_empty_range = true;
9378 warningf(pos, "empty range specified");
9384 PUSH_PARENT(statement);
9386 expect(':', end_error);
9389 if (current_switch != NULL) {
9390 if (! statement->case_label.is_bad) {
9391 /* Check for duplicate case values */
9392 case_label_statement_t *c = &statement->case_label;
9393 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
9394 if (l->is_bad || l->is_empty_range || l->expression == NULL)
9397 if (c->last_case < l->first_case || c->first_case > l->last_case)
9400 errorf(pos, "duplicate case value (previously used %P)",
9401 &l->base.source_position);
9405 /* link all cases into the switch statement */
9406 if (current_switch->last_case == NULL) {
9407 current_switch->first_case = &statement->case_label;
9409 current_switch->last_case->next = &statement->case_label;
9411 current_switch->last_case = &statement->case_label;
9413 errorf(pos, "case label not within a switch statement");
9416 statement_t *const inner_stmt = parse_statement();
9417 statement->case_label.statement = inner_stmt;
9418 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9419 errorf(&inner_stmt->base.source_position, "declaration after case label");
9427 * Parse a default statement.
9429 static statement_t *parse_default_statement(void)
9431 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9435 PUSH_PARENT(statement);
9437 expect(':', end_error);
9438 if (current_switch != NULL) {
9439 const case_label_statement_t *def_label = current_switch->default_label;
9440 if (def_label != NULL) {
9441 errorf(HERE, "multiple default labels in one switch (previous declared %P)",
9442 &def_label->base.source_position);
9444 current_switch->default_label = &statement->case_label;
9446 /* link all cases into the switch statement */
9447 if (current_switch->last_case == NULL) {
9448 current_switch->first_case = &statement->case_label;
9450 current_switch->last_case->next = &statement->case_label;
9452 current_switch->last_case = &statement->case_label;
9455 errorf(&statement->base.source_position,
9456 "'default' label not within a switch statement");
9459 statement_t *const inner_stmt = parse_statement();
9460 statement->case_label.statement = inner_stmt;
9461 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9462 errorf(&inner_stmt->base.source_position, "declaration after default label");
9469 return create_invalid_statement();
9473 * Parse a label statement.
9475 static statement_t *parse_label_statement(void)
9477 assert(token.type == T_IDENTIFIER);
9478 symbol_t *symbol = token.v.symbol;
9479 label_t *label = get_label(symbol);
9481 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
9482 statement->label.label = label;
9486 PUSH_PARENT(statement);
9488 /* if statement is already set then the label is defined twice,
9489 * otherwise it was just mentioned in a goto/local label declaration so far
9491 if (label->statement != NULL) {
9492 errorf(HERE, "duplicate label '%Y' (declared %P)",
9493 symbol, &label->base.source_position);
9495 label->base.source_position = token.source_position;
9496 label->statement = statement;
9501 if (token.type == '}') {
9502 /* TODO only warn? */
9503 if (warning.other && false) {
9504 warningf(HERE, "label at end of compound statement");
9505 statement->label.statement = create_empty_statement();
9507 errorf(HERE, "label at end of compound statement");
9508 statement->label.statement = create_invalid_statement();
9510 } else if (token.type == ';') {
9511 /* Eat an empty statement here, to avoid the warning about an empty
9512 * statement after a label. label:; is commonly used to have a label
9513 * before a closing brace. */
9514 statement->label.statement = create_empty_statement();
9517 statement_t *const inner_stmt = parse_statement();
9518 statement->label.statement = inner_stmt;
9519 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9520 errorf(&inner_stmt->base.source_position, "declaration after label");
9524 /* remember the labels in a list for later checking */
9525 *label_anchor = &statement->label;
9526 label_anchor = &statement->label.next;
9533 * Parse an if statement.
9535 static statement_t *parse_if(void)
9537 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
9541 PUSH_PARENT(statement);
9543 add_anchor_token('{');
9545 expect('(', end_error);
9546 add_anchor_token(')');
9547 expression_t *const expr = parse_expression();
9548 statement->ifs.condition = expr;
9549 /* §6.8.4.1:1 The controlling expression of an if statement shall have
9551 semantic_condition(expr, "condition of 'if'-statment");
9552 mark_vars_read(expr, NULL);
9553 rem_anchor_token(')');
9554 expect(')', end_error);
9557 rem_anchor_token('{');
9559 add_anchor_token(T_else);
9560 statement_t *const true_stmt = parse_statement();
9561 statement->ifs.true_statement = true_stmt;
9562 rem_anchor_token(T_else);
9564 if (token.type == T_else) {
9566 statement->ifs.false_statement = parse_statement();
9567 } else if (warning.parentheses &&
9568 true_stmt->kind == STATEMENT_IF &&
9569 true_stmt->ifs.false_statement != NULL) {
9570 warningf(&true_stmt->base.source_position,
9571 "suggest explicit braces to avoid ambiguous 'else'");
9579 * Check that all enums are handled in a switch.
9581 * @param statement the switch statement to check
9583 static void check_enum_cases(const switch_statement_t *statement)
9585 const type_t *type = skip_typeref(statement->expression->base.type);
9586 if (! is_type_enum(type))
9588 const enum_type_t *enumt = &type->enumt;
9590 /* if we have a default, no warnings */
9591 if (statement->default_label != NULL)
9594 /* FIXME: calculation of value should be done while parsing */
9595 /* TODO: quadratic algorithm here. Change to an n log n one */
9596 long last_value = -1;
9597 const entity_t *entry = enumt->enume->base.next;
9598 for (; entry != NULL && entry->kind == ENTITY_ENUM_VALUE;
9599 entry = entry->base.next) {
9600 const expression_t *expression = entry->enum_value.value;
9601 long value = expression != NULL ? fold_constant_to_int(expression) : last_value + 1;
9603 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
9604 if (l->expression == NULL)
9606 if (l->first_case <= value && value <= l->last_case) {
9612 warningf(&statement->base.source_position,
9613 "enumeration value '%Y' not handled in switch",
9614 entry->base.symbol);
9621 * Parse a switch statement.
9623 static statement_t *parse_switch(void)
9625 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
9629 PUSH_PARENT(statement);
9631 expect('(', end_error);
9632 add_anchor_token(')');
9633 expression_t *const expr = parse_expression();
9634 mark_vars_read(expr, NULL);
9635 type_t * type = skip_typeref(expr->base.type);
9636 if (is_type_integer(type)) {
9637 type = promote_integer(type);
9638 if (warning.traditional) {
9639 if (get_rank(type) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
9640 warningf(&expr->base.source_position,
9641 "'%T' switch expression not converted to '%T' in ISO C",
9645 } else if (is_type_valid(type)) {
9646 errorf(&expr->base.source_position,
9647 "switch quantity is not an integer, but '%T'", type);
9648 type = type_error_type;
9650 statement->switchs.expression = create_implicit_cast(expr, type);
9651 expect(')', end_error);
9652 rem_anchor_token(')');
9654 switch_statement_t *rem = current_switch;
9655 current_switch = &statement->switchs;
9656 statement->switchs.body = parse_statement();
9657 current_switch = rem;
9659 if (warning.switch_default &&
9660 statement->switchs.default_label == NULL) {
9661 warningf(&statement->base.source_position, "switch has no default case");
9663 if (warning.switch_enum)
9664 check_enum_cases(&statement->switchs);
9670 return create_invalid_statement();
9673 static statement_t *parse_loop_body(statement_t *const loop)
9675 statement_t *const rem = current_loop;
9676 current_loop = loop;
9678 statement_t *const body = parse_statement();
9685 * Parse a while statement.
9687 static statement_t *parse_while(void)
9689 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
9693 PUSH_PARENT(statement);
9695 expect('(', end_error);
9696 add_anchor_token(')');
9697 expression_t *const cond = parse_expression();
9698 statement->whiles.condition = cond;
9699 /* §6.8.5:2 The controlling expression of an iteration statement shall
9700 * have scalar type. */
9701 semantic_condition(cond, "condition of 'while'-statement");
9702 mark_vars_read(cond, NULL);
9703 rem_anchor_token(')');
9704 expect(')', end_error);
9706 statement->whiles.body = parse_loop_body(statement);
9712 return create_invalid_statement();
9716 * Parse a do statement.
9718 static statement_t *parse_do(void)
9720 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
9724 PUSH_PARENT(statement);
9726 add_anchor_token(T_while);
9727 statement->do_while.body = parse_loop_body(statement);
9728 rem_anchor_token(T_while);
9730 expect(T_while, end_error);
9731 expect('(', end_error);
9732 add_anchor_token(')');
9733 expression_t *const cond = parse_expression();
9734 statement->do_while.condition = cond;
9735 /* §6.8.5:2 The controlling expression of an iteration statement shall
9736 * have scalar type. */
9737 semantic_condition(cond, "condition of 'do-while'-statement");
9738 mark_vars_read(cond, NULL);
9739 rem_anchor_token(')');
9740 expect(')', end_error);
9741 expect(';', end_error);
9747 return create_invalid_statement();
9751 * Parse a for statement.
9753 static statement_t *parse_for(void)
9755 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9759 expect('(', end_error1);
9760 add_anchor_token(')');
9762 PUSH_PARENT(statement);
9764 size_t const top = environment_top();
9765 scope_t *old_scope = scope_push(&statement->fors.scope);
9767 bool old_gcc_extension = in_gcc_extension;
9768 while (token.type == T___extension__) {
9770 in_gcc_extension = true;
9773 if (token.type == ';') {
9775 } else if (is_declaration_specifier(&token, false)) {
9776 parse_declaration(record_entity, DECL_FLAGS_NONE);
9778 add_anchor_token(';');
9779 expression_t *const init = parse_expression();
9780 statement->fors.initialisation = init;
9781 mark_vars_read(init, ENT_ANY);
9782 if (warning.unused_value && !expression_has_effect(init)) {
9783 warningf(&init->base.source_position,
9784 "initialisation of 'for'-statement has no effect");
9786 rem_anchor_token(';');
9787 expect(';', end_error2);
9789 in_gcc_extension = old_gcc_extension;
9791 if (token.type != ';') {
9792 add_anchor_token(';');
9793 expression_t *const cond = parse_expression();
9794 statement->fors.condition = cond;
9795 /* §6.8.5:2 The controlling expression of an iteration statement
9796 * shall have scalar type. */
9797 semantic_condition(cond, "condition of 'for'-statement");
9798 mark_vars_read(cond, NULL);
9799 rem_anchor_token(';');
9801 expect(';', end_error2);
9802 if (token.type != ')') {
9803 expression_t *const step = parse_expression();
9804 statement->fors.step = step;
9805 mark_vars_read(step, ENT_ANY);
9806 if (warning.unused_value && !expression_has_effect(step)) {
9807 warningf(&step->base.source_position,
9808 "step of 'for'-statement has no effect");
9811 expect(')', end_error2);
9812 rem_anchor_token(')');
9813 statement->fors.body = parse_loop_body(statement);
9815 assert(current_scope == &statement->fors.scope);
9816 scope_pop(old_scope);
9817 environment_pop_to(top);
9824 rem_anchor_token(')');
9825 assert(current_scope == &statement->fors.scope);
9826 scope_pop(old_scope);
9827 environment_pop_to(top);
9831 return create_invalid_statement();
9835 * Parse a goto statement.
9837 static statement_t *parse_goto(void)
9839 statement_t *statement = allocate_statement_zero(STATEMENT_GOTO);
9842 if (GNU_MODE && token.type == '*') {
9844 expression_t *expression = parse_expression();
9845 mark_vars_read(expression, NULL);
9847 /* Argh: although documentation says the expression must be of type void*,
9848 * gcc accepts anything that can be casted into void* without error */
9849 type_t *type = expression->base.type;
9851 if (type != type_error_type) {
9852 if (!is_type_pointer(type) && !is_type_integer(type)) {
9853 errorf(&expression->base.source_position,
9854 "cannot convert to a pointer type");
9855 } else if (warning.other && type != type_void_ptr) {
9856 warningf(&expression->base.source_position,
9857 "type of computed goto expression should be 'void*' not '%T'", type);
9859 expression = create_implicit_cast(expression, type_void_ptr);
9862 statement->gotos.expression = expression;
9863 } else if (token.type == T_IDENTIFIER) {
9864 symbol_t *symbol = token.v.symbol;
9866 statement->gotos.label = get_label(symbol);
9869 parse_error_expected("while parsing goto", T_IDENTIFIER, '*', NULL);
9871 parse_error_expected("while parsing goto", T_IDENTIFIER, NULL);
9876 /* remember the goto's in a list for later checking */
9877 *goto_anchor = &statement->gotos;
9878 goto_anchor = &statement->gotos.next;
9880 expect(';', end_error);
9884 return create_invalid_statement();
9888 * Parse a continue statement.
9890 static statement_t *parse_continue(void)
9892 if (current_loop == NULL) {
9893 errorf(HERE, "continue statement not within loop");
9896 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
9899 expect(';', end_error);
9906 * Parse a break statement.
9908 static statement_t *parse_break(void)
9910 if (current_switch == NULL && current_loop == NULL) {
9911 errorf(HERE, "break statement not within loop or switch");
9914 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
9917 expect(';', end_error);
9924 * Parse a __leave statement.
9926 static statement_t *parse_leave_statement(void)
9928 if (current_try == NULL) {
9929 errorf(HERE, "__leave statement not within __try");
9932 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
9935 expect(';', end_error);
9942 * Check if a given entity represents a local variable.
9944 static bool is_local_variable(const entity_t *entity)
9946 if (entity->kind != ENTITY_VARIABLE)
9949 switch ((storage_class_tag_t) entity->declaration.storage_class) {
9950 case STORAGE_CLASS_AUTO:
9951 case STORAGE_CLASS_REGISTER: {
9952 const type_t *type = skip_typeref(entity->declaration.type);
9953 if (is_type_function(type)) {
9965 * Check if a given expression represents a local variable.
9967 static bool expression_is_local_variable(const expression_t *expression)
9969 if (expression->base.kind != EXPR_REFERENCE) {
9972 const entity_t *entity = expression->reference.entity;
9973 return is_local_variable(entity);
9977 * Check if a given expression represents a local variable and
9978 * return its declaration then, else return NULL.
9980 entity_t *expression_is_variable(const expression_t *expression)
9982 if (expression->base.kind != EXPR_REFERENCE) {
9985 entity_t *entity = expression->reference.entity;
9986 if (entity->kind != ENTITY_VARIABLE)
9993 * Parse a return statement.
9995 static statement_t *parse_return(void)
9999 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
10001 expression_t *return_value = NULL;
10002 if (token.type != ';') {
10003 return_value = parse_expression();
10004 mark_vars_read(return_value, NULL);
10007 const type_t *const func_type = skip_typeref(current_function->base.type);
10008 assert(is_type_function(func_type));
10009 type_t *const return_type = skip_typeref(func_type->function.return_type);
10011 source_position_t const *const pos = &statement->base.source_position;
10012 if (return_value != NULL) {
10013 type_t *return_value_type = skip_typeref(return_value->base.type);
10015 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
10016 if (is_type_atomic(return_value_type, ATOMIC_TYPE_VOID)) {
10017 /* ISO/IEC 14882:1998(E) §6.6.3:2 */
10018 /* Only warn in C mode, because GCC does the same */
10019 if (c_mode & _CXX || strict_mode) {
10021 "'return' with a value, in function returning 'void'");
10022 } else if (warning.other) {
10024 "'return' with a value, in function returning 'void'");
10026 } else if (!(c_mode & _CXX)) { /* ISO/IEC 14882:1998(E) §6.6.3:3 */
10027 /* Only warn in C mode, because GCC does the same */
10030 "'return' with expression in function returning 'void'");
10031 } else if (warning.other) {
10033 "'return' with expression in function returning 'void'");
10037 assign_error_t error = semantic_assign(return_type, return_value);
10038 report_assign_error(error, return_type, return_value, "'return'",
10041 return_value = create_implicit_cast(return_value, return_type);
10042 /* check for returning address of a local var */
10043 if (warning.other && return_value != NULL
10044 && return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
10045 const expression_t *expression = return_value->unary.value;
10046 if (expression_is_local_variable(expression)) {
10047 warningf(pos, "function returns address of local variable");
10050 } else if (warning.other && !is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
10051 /* ISO/IEC 14882:1998(E) §6.6.3:3 */
10052 if (c_mode & _CXX || strict_mode) {
10054 "'return' without value, in function returning non-void");
10057 "'return' without value, in function returning non-void");
10060 statement->returns.value = return_value;
10062 expect(';', end_error);
10069 * Parse a declaration statement.
10071 static statement_t *parse_declaration_statement(void)
10073 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
10075 entity_t *before = current_scope->last_entity;
10077 parse_external_declaration();
10079 parse_declaration(record_entity, DECL_FLAGS_NONE);
10082 declaration_statement_t *const decl = &statement->declaration;
10083 entity_t *const begin =
10084 before != NULL ? before->base.next : current_scope->entities;
10085 decl->declarations_begin = begin;
10086 decl->declarations_end = begin != NULL ? current_scope->last_entity : NULL;
10092 * Parse an expression statement, ie. expr ';'.
10094 static statement_t *parse_expression_statement(void)
10096 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10098 expression_t *const expr = parse_expression();
10099 statement->expression.expression = expr;
10100 mark_vars_read(expr, ENT_ANY);
10102 expect(';', end_error);
10109 * Parse a microsoft __try { } __finally { } or
10110 * __try{ } __except() { }
10112 static statement_t *parse_ms_try_statment(void)
10114 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
10117 PUSH_PARENT(statement);
10119 ms_try_statement_t *rem = current_try;
10120 current_try = &statement->ms_try;
10121 statement->ms_try.try_statement = parse_compound_statement(false);
10126 if (token.type == T___except) {
10128 expect('(', end_error);
10129 add_anchor_token(')');
10130 expression_t *const expr = parse_expression();
10131 mark_vars_read(expr, NULL);
10132 type_t * type = skip_typeref(expr->base.type);
10133 if (is_type_integer(type)) {
10134 type = promote_integer(type);
10135 } else if (is_type_valid(type)) {
10136 errorf(&expr->base.source_position,
10137 "__expect expression is not an integer, but '%T'", type);
10138 type = type_error_type;
10140 statement->ms_try.except_expression = create_implicit_cast(expr, type);
10141 rem_anchor_token(')');
10142 expect(')', end_error);
10143 statement->ms_try.final_statement = parse_compound_statement(false);
10144 } else if (token.type == T__finally) {
10146 statement->ms_try.final_statement = parse_compound_statement(false);
10148 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
10149 return create_invalid_statement();
10153 return create_invalid_statement();
10156 static statement_t *parse_empty_statement(void)
10158 if (warning.empty_statement) {
10159 warningf(HERE, "statement is empty");
10161 statement_t *const statement = create_empty_statement();
10166 static statement_t *parse_local_label_declaration(void)
10168 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
10172 entity_t *begin = NULL, *end = NULL;
10175 if (token.type != T_IDENTIFIER) {
10176 parse_error_expected("while parsing local label declaration",
10177 T_IDENTIFIER, NULL);
10180 symbol_t *symbol = token.v.symbol;
10181 entity_t *entity = get_entity(symbol, NAMESPACE_LABEL);
10182 if (entity != NULL && entity->base.parent_scope == current_scope) {
10183 errorf(HERE, "multiple definitions of '__label__ %Y' (previous definition %P)",
10184 symbol, &entity->base.source_position);
10186 entity = allocate_entity_zero(ENTITY_LOCAL_LABEL);
10188 entity->base.parent_scope = current_scope;
10189 entity->base.namespc = NAMESPACE_LABEL;
10190 entity->base.source_position = token.source_position;
10191 entity->base.symbol = symbol;
10194 end->base.next = entity;
10199 environment_push(entity);
10203 if (token.type != ',')
10209 statement->declaration.declarations_begin = begin;
10210 statement->declaration.declarations_end = end;
10214 static void parse_namespace_definition(void)
10218 entity_t *entity = NULL;
10219 symbol_t *symbol = NULL;
10221 if (token.type == T_IDENTIFIER) {
10222 symbol = token.v.symbol;
10225 entity = get_entity(symbol, NAMESPACE_NORMAL);
10226 if (entity != NULL &&
10227 entity->kind != ENTITY_NAMESPACE &&
10228 entity->base.parent_scope == current_scope) {
10229 if (!is_error_entity(entity)) {
10230 error_redefined_as_different_kind(&token.source_position,
10231 entity, ENTITY_NAMESPACE);
10237 if (entity == NULL) {
10238 entity = allocate_entity_zero(ENTITY_NAMESPACE);
10239 entity->base.symbol = symbol;
10240 entity->base.source_position = token.source_position;
10241 entity->base.namespc = NAMESPACE_NORMAL;
10242 entity->base.parent_scope = current_scope;
10245 if (token.type == '=') {
10246 /* TODO: parse namespace alias */
10247 panic("namespace alias definition not supported yet");
10250 environment_push(entity);
10251 append_entity(current_scope, entity);
10253 size_t const top = environment_top();
10254 scope_t *old_scope = scope_push(&entity->namespacee.members);
10256 expect('{', end_error);
10258 expect('}', end_error);
10261 assert(current_scope == &entity->namespacee.members);
10262 scope_pop(old_scope);
10263 environment_pop_to(top);
10267 * Parse a statement.
10268 * There's also parse_statement() which additionally checks for
10269 * "statement has no effect" warnings
10271 static statement_t *intern_parse_statement(void)
10273 statement_t *statement = NULL;
10275 /* declaration or statement */
10276 add_anchor_token(';');
10277 switch (token.type) {
10278 case T_IDENTIFIER: {
10279 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
10280 if (la1_type == ':') {
10281 statement = parse_label_statement();
10282 } else if (is_typedef_symbol(token.v.symbol)) {
10283 statement = parse_declaration_statement();
10285 /* it's an identifier, the grammar says this must be an
10286 * expression statement. However it is common that users mistype
10287 * declaration types, so we guess a bit here to improve robustness
10288 * for incorrect programs */
10289 switch (la1_type) {
10292 if (get_entity(token.v.symbol, NAMESPACE_NORMAL) != NULL)
10293 goto expression_statment;
10298 statement = parse_declaration_statement();
10302 expression_statment:
10303 statement = parse_expression_statement();
10310 case T___extension__:
10311 /* This can be a prefix to a declaration or an expression statement.
10312 * We simply eat it now and parse the rest with tail recursion. */
10315 } while (token.type == T___extension__);
10316 bool old_gcc_extension = in_gcc_extension;
10317 in_gcc_extension = true;
10318 statement = intern_parse_statement();
10319 in_gcc_extension = old_gcc_extension;
10323 statement = parse_declaration_statement();
10327 statement = parse_local_label_declaration();
10330 case ';': statement = parse_empty_statement(); break;
10331 case '{': statement = parse_compound_statement(false); break;
10332 case T___leave: statement = parse_leave_statement(); break;
10333 case T___try: statement = parse_ms_try_statment(); break;
10334 case T_asm: statement = parse_asm_statement(); break;
10335 case T_break: statement = parse_break(); break;
10336 case T_case: statement = parse_case_statement(); break;
10337 case T_continue: statement = parse_continue(); break;
10338 case T_default: statement = parse_default_statement(); break;
10339 case T_do: statement = parse_do(); break;
10340 case T_for: statement = parse_for(); break;
10341 case T_goto: statement = parse_goto(); break;
10342 case T_if: statement = parse_if(); break;
10343 case T_return: statement = parse_return(); break;
10344 case T_switch: statement = parse_switch(); break;
10345 case T_while: statement = parse_while(); break;
10348 statement = parse_expression_statement();
10352 errorf(HERE, "unexpected token %K while parsing statement", &token);
10353 statement = create_invalid_statement();
10358 rem_anchor_token(';');
10360 assert(statement != NULL
10361 && statement->base.source_position.input_name != NULL);
10367 * parse a statement and emits "statement has no effect" warning if needed
10368 * (This is really a wrapper around intern_parse_statement with check for 1
10369 * single warning. It is needed, because for statement expressions we have
10370 * to avoid the warning on the last statement)
10372 static statement_t *parse_statement(void)
10374 statement_t *statement = intern_parse_statement();
10376 if (statement->kind == STATEMENT_EXPRESSION && warning.unused_value) {
10377 expression_t *expression = statement->expression.expression;
10378 if (!expression_has_effect(expression)) {
10379 warningf(&expression->base.source_position,
10380 "statement has no effect");
10388 * Parse a compound statement.
10390 static statement_t *parse_compound_statement(bool inside_expression_statement)
10392 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
10394 PUSH_PARENT(statement);
10397 add_anchor_token('}');
10398 /* tokens, which can start a statement */
10399 /* TODO MS, __builtin_FOO */
10400 add_anchor_token('!');
10401 add_anchor_token('&');
10402 add_anchor_token('(');
10403 add_anchor_token('*');
10404 add_anchor_token('+');
10405 add_anchor_token('-');
10406 add_anchor_token('{');
10407 add_anchor_token('~');
10408 add_anchor_token(T_CHARACTER_CONSTANT);
10409 add_anchor_token(T_COLONCOLON);
10410 add_anchor_token(T_FLOATINGPOINT);
10411 add_anchor_token(T_IDENTIFIER);
10412 add_anchor_token(T_INTEGER);
10413 add_anchor_token(T_MINUSMINUS);
10414 add_anchor_token(T_PLUSPLUS);
10415 add_anchor_token(T_STRING_LITERAL);
10416 add_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10417 add_anchor_token(T_WIDE_STRING_LITERAL);
10418 add_anchor_token(T__Bool);
10419 add_anchor_token(T__Complex);
10420 add_anchor_token(T__Imaginary);
10421 add_anchor_token(T___FUNCTION__);
10422 add_anchor_token(T___PRETTY_FUNCTION__);
10423 add_anchor_token(T___alignof__);
10424 add_anchor_token(T___attribute__);
10425 add_anchor_token(T___builtin_va_start);
10426 add_anchor_token(T___extension__);
10427 add_anchor_token(T___func__);
10428 add_anchor_token(T___imag__);
10429 add_anchor_token(T___label__);
10430 add_anchor_token(T___real__);
10431 add_anchor_token(T___thread);
10432 add_anchor_token(T_asm);
10433 add_anchor_token(T_auto);
10434 add_anchor_token(T_bool);
10435 add_anchor_token(T_break);
10436 add_anchor_token(T_case);
10437 add_anchor_token(T_char);
10438 add_anchor_token(T_class);
10439 add_anchor_token(T_const);
10440 add_anchor_token(T_const_cast);
10441 add_anchor_token(T_continue);
10442 add_anchor_token(T_default);
10443 add_anchor_token(T_delete);
10444 add_anchor_token(T_double);
10445 add_anchor_token(T_do);
10446 add_anchor_token(T_dynamic_cast);
10447 add_anchor_token(T_enum);
10448 add_anchor_token(T_extern);
10449 add_anchor_token(T_false);
10450 add_anchor_token(T_float);
10451 add_anchor_token(T_for);
10452 add_anchor_token(T_goto);
10453 add_anchor_token(T_if);
10454 add_anchor_token(T_inline);
10455 add_anchor_token(T_int);
10456 add_anchor_token(T_long);
10457 add_anchor_token(T_new);
10458 add_anchor_token(T_operator);
10459 add_anchor_token(T_register);
10460 add_anchor_token(T_reinterpret_cast);
10461 add_anchor_token(T_restrict);
10462 add_anchor_token(T_return);
10463 add_anchor_token(T_short);
10464 add_anchor_token(T_signed);
10465 add_anchor_token(T_sizeof);
10466 add_anchor_token(T_static);
10467 add_anchor_token(T_static_cast);
10468 add_anchor_token(T_struct);
10469 add_anchor_token(T_switch);
10470 add_anchor_token(T_template);
10471 add_anchor_token(T_this);
10472 add_anchor_token(T_throw);
10473 add_anchor_token(T_true);
10474 add_anchor_token(T_try);
10475 add_anchor_token(T_typedef);
10476 add_anchor_token(T_typeid);
10477 add_anchor_token(T_typename);
10478 add_anchor_token(T_typeof);
10479 add_anchor_token(T_union);
10480 add_anchor_token(T_unsigned);
10481 add_anchor_token(T_using);
10482 add_anchor_token(T_void);
10483 add_anchor_token(T_volatile);
10484 add_anchor_token(T_wchar_t);
10485 add_anchor_token(T_while);
10487 size_t const top = environment_top();
10488 scope_t *old_scope = scope_push(&statement->compound.scope);
10490 statement_t **anchor = &statement->compound.statements;
10491 bool only_decls_so_far = true;
10492 while (token.type != '}') {
10493 if (token.type == T_EOF) {
10494 errorf(&statement->base.source_position,
10495 "EOF while parsing compound statement");
10498 statement_t *sub_statement = intern_parse_statement();
10499 if (is_invalid_statement(sub_statement)) {
10500 /* an error occurred. if we are at an anchor, return */
10506 if (warning.declaration_after_statement) {
10507 if (sub_statement->kind != STATEMENT_DECLARATION) {
10508 only_decls_so_far = false;
10509 } else if (!only_decls_so_far) {
10510 warningf(&sub_statement->base.source_position,
10511 "ISO C90 forbids mixed declarations and code");
10515 *anchor = sub_statement;
10517 while (sub_statement->base.next != NULL)
10518 sub_statement = sub_statement->base.next;
10520 anchor = &sub_statement->base.next;
10524 /* look over all statements again to produce no effect warnings */
10525 if (warning.unused_value) {
10526 statement_t *sub_statement = statement->compound.statements;
10527 for (; sub_statement != NULL; sub_statement = sub_statement->base.next) {
10528 if (sub_statement->kind != STATEMENT_EXPRESSION)
10530 /* don't emit a warning for the last expression in an expression
10531 * statement as it has always an effect */
10532 if (inside_expression_statement && sub_statement->base.next == NULL)
10535 expression_t *expression = sub_statement->expression.expression;
10536 if (!expression_has_effect(expression)) {
10537 warningf(&expression->base.source_position,
10538 "statement has no effect");
10544 rem_anchor_token(T_while);
10545 rem_anchor_token(T_wchar_t);
10546 rem_anchor_token(T_volatile);
10547 rem_anchor_token(T_void);
10548 rem_anchor_token(T_using);
10549 rem_anchor_token(T_unsigned);
10550 rem_anchor_token(T_union);
10551 rem_anchor_token(T_typeof);
10552 rem_anchor_token(T_typename);
10553 rem_anchor_token(T_typeid);
10554 rem_anchor_token(T_typedef);
10555 rem_anchor_token(T_try);
10556 rem_anchor_token(T_true);
10557 rem_anchor_token(T_throw);
10558 rem_anchor_token(T_this);
10559 rem_anchor_token(T_template);
10560 rem_anchor_token(T_switch);
10561 rem_anchor_token(T_struct);
10562 rem_anchor_token(T_static_cast);
10563 rem_anchor_token(T_static);
10564 rem_anchor_token(T_sizeof);
10565 rem_anchor_token(T_signed);
10566 rem_anchor_token(T_short);
10567 rem_anchor_token(T_return);
10568 rem_anchor_token(T_restrict);
10569 rem_anchor_token(T_reinterpret_cast);
10570 rem_anchor_token(T_register);
10571 rem_anchor_token(T_operator);
10572 rem_anchor_token(T_new);
10573 rem_anchor_token(T_long);
10574 rem_anchor_token(T_int);
10575 rem_anchor_token(T_inline);
10576 rem_anchor_token(T_if);
10577 rem_anchor_token(T_goto);
10578 rem_anchor_token(T_for);
10579 rem_anchor_token(T_float);
10580 rem_anchor_token(T_false);
10581 rem_anchor_token(T_extern);
10582 rem_anchor_token(T_enum);
10583 rem_anchor_token(T_dynamic_cast);
10584 rem_anchor_token(T_do);
10585 rem_anchor_token(T_double);
10586 rem_anchor_token(T_delete);
10587 rem_anchor_token(T_default);
10588 rem_anchor_token(T_continue);
10589 rem_anchor_token(T_const_cast);
10590 rem_anchor_token(T_const);
10591 rem_anchor_token(T_class);
10592 rem_anchor_token(T_char);
10593 rem_anchor_token(T_case);
10594 rem_anchor_token(T_break);
10595 rem_anchor_token(T_bool);
10596 rem_anchor_token(T_auto);
10597 rem_anchor_token(T_asm);
10598 rem_anchor_token(T___thread);
10599 rem_anchor_token(T___real__);
10600 rem_anchor_token(T___label__);
10601 rem_anchor_token(T___imag__);
10602 rem_anchor_token(T___func__);
10603 rem_anchor_token(T___extension__);
10604 rem_anchor_token(T___builtin_va_start);
10605 rem_anchor_token(T___attribute__);
10606 rem_anchor_token(T___alignof__);
10607 rem_anchor_token(T___PRETTY_FUNCTION__);
10608 rem_anchor_token(T___FUNCTION__);
10609 rem_anchor_token(T__Imaginary);
10610 rem_anchor_token(T__Complex);
10611 rem_anchor_token(T__Bool);
10612 rem_anchor_token(T_WIDE_STRING_LITERAL);
10613 rem_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10614 rem_anchor_token(T_STRING_LITERAL);
10615 rem_anchor_token(T_PLUSPLUS);
10616 rem_anchor_token(T_MINUSMINUS);
10617 rem_anchor_token(T_INTEGER);
10618 rem_anchor_token(T_IDENTIFIER);
10619 rem_anchor_token(T_FLOATINGPOINT);
10620 rem_anchor_token(T_COLONCOLON);
10621 rem_anchor_token(T_CHARACTER_CONSTANT);
10622 rem_anchor_token('~');
10623 rem_anchor_token('{');
10624 rem_anchor_token('-');
10625 rem_anchor_token('+');
10626 rem_anchor_token('*');
10627 rem_anchor_token('(');
10628 rem_anchor_token('&');
10629 rem_anchor_token('!');
10630 rem_anchor_token('}');
10631 assert(current_scope == &statement->compound.scope);
10632 scope_pop(old_scope);
10633 environment_pop_to(top);
10640 * Check for unused global static functions and variables
10642 static void check_unused_globals(void)
10644 if (!warning.unused_function && !warning.unused_variable)
10647 for (const entity_t *entity = file_scope->entities; entity != NULL;
10648 entity = entity->base.next) {
10649 if (!is_declaration(entity))
10652 const declaration_t *declaration = &entity->declaration;
10653 if (declaration->used ||
10654 declaration->modifiers & DM_UNUSED ||
10655 declaration->modifiers & DM_USED ||
10656 declaration->storage_class != STORAGE_CLASS_STATIC)
10659 type_t *const type = declaration->type;
10661 if (entity->kind == ENTITY_FUNCTION) {
10662 /* inhibit warning for static inline functions */
10663 if (entity->function.is_inline)
10666 s = entity->function.statement != NULL ? "defined" : "declared";
10671 warningf(&declaration->base.source_position, "'%#T' %s but not used",
10672 type, declaration->base.symbol, s);
10676 static void parse_global_asm(void)
10678 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
10681 expect('(', end_error);
10683 statement->asms.asm_text = parse_string_literals();
10684 statement->base.next = unit->global_asm;
10685 unit->global_asm = statement;
10687 expect(')', end_error);
10688 expect(';', end_error);
10693 static void parse_linkage_specification(void)
10696 assert(token.type == T_STRING_LITERAL);
10698 const char *linkage = parse_string_literals().begin;
10700 linkage_kind_t old_linkage = current_linkage;
10701 linkage_kind_t new_linkage;
10702 if (strcmp(linkage, "C") == 0) {
10703 new_linkage = LINKAGE_C;
10704 } else if (strcmp(linkage, "C++") == 0) {
10705 new_linkage = LINKAGE_CXX;
10707 errorf(HERE, "linkage string \"%s\" not recognized", linkage);
10708 new_linkage = LINKAGE_INVALID;
10710 current_linkage = new_linkage;
10712 if (token.type == '{') {
10715 expect('}', end_error);
10721 assert(current_linkage == new_linkage);
10722 current_linkage = old_linkage;
10725 static void parse_external(void)
10727 switch (token.type) {
10728 DECLARATION_START_NO_EXTERN
10730 case T___extension__:
10731 /* tokens below are for implicit int */
10732 case '&': /* & x; -> int& x; (and error later, because C++ has no
10734 case '*': /* * x; -> int* x; */
10735 case '(': /* (x); -> int (x); */
10736 parse_external_declaration();
10740 if (look_ahead(1)->type == T_STRING_LITERAL) {
10741 parse_linkage_specification();
10743 parse_external_declaration();
10748 parse_global_asm();
10752 parse_namespace_definition();
10756 if (!strict_mode) {
10758 warningf(HERE, "stray ';' outside of function");
10765 errorf(HERE, "stray %K outside of function", &token);
10766 if (token.type == '(' || token.type == '{' || token.type == '[')
10767 eat_until_matching_token(token.type);
10773 static void parse_externals(void)
10775 add_anchor_token('}');
10776 add_anchor_token(T_EOF);
10779 unsigned char token_anchor_copy[T_LAST_TOKEN];
10780 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
10783 while (token.type != T_EOF && token.type != '}') {
10785 bool anchor_leak = false;
10786 for (int i = 0; i != T_LAST_TOKEN; ++i) {
10787 unsigned char count = token_anchor_set[i] - token_anchor_copy[i];
10789 errorf(HERE, "Leaked anchor token %k %d times", i, count);
10790 anchor_leak = true;
10793 if (in_gcc_extension) {
10794 errorf(HERE, "Leaked __extension__");
10795 anchor_leak = true;
10805 rem_anchor_token(T_EOF);
10806 rem_anchor_token('}');
10810 * Parse a translation unit.
10812 static void parse_translation_unit(void)
10814 add_anchor_token(T_EOF);
10819 if (token.type == T_EOF)
10822 errorf(HERE, "stray %K outside of function", &token);
10823 if (token.type == '(' || token.type == '{' || token.type == '[')
10824 eat_until_matching_token(token.type);
10832 * @return the translation unit or NULL if errors occurred.
10834 void start_parsing(void)
10836 environment_stack = NEW_ARR_F(stack_entry_t, 0);
10837 label_stack = NEW_ARR_F(stack_entry_t, 0);
10838 diagnostic_count = 0;
10842 type_set_output(stderr);
10843 ast_set_output(stderr);
10845 assert(unit == NULL);
10846 unit = allocate_ast_zero(sizeof(unit[0]));
10848 assert(file_scope == NULL);
10849 file_scope = &unit->scope;
10851 assert(current_scope == NULL);
10852 scope_push(&unit->scope);
10854 create_gnu_builtins();
10856 create_microsoft_intrinsics();
10859 translation_unit_t *finish_parsing(void)
10861 assert(current_scope == &unit->scope);
10864 assert(file_scope == &unit->scope);
10865 check_unused_globals();
10868 DEL_ARR_F(environment_stack);
10869 DEL_ARR_F(label_stack);
10871 translation_unit_t *result = unit;
10876 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
10877 * are given length one. */
10878 static void complete_incomplete_arrays(void)
10880 size_t n = ARR_LEN(incomplete_arrays);
10881 for (size_t i = 0; i != n; ++i) {
10882 declaration_t *const decl = incomplete_arrays[i];
10883 type_t *const orig_type = decl->type;
10884 type_t *const type = skip_typeref(orig_type);
10886 if (!is_type_incomplete(type))
10889 if (warning.other) {
10890 warningf(&decl->base.source_position,
10891 "array '%#T' assumed to have one element",
10892 orig_type, decl->base.symbol);
10895 type_t *const new_type = duplicate_type(type);
10896 new_type->array.size_constant = true;
10897 new_type->array.has_implicit_size = true;
10898 new_type->array.size = 1;
10900 type_t *const result = identify_new_type(new_type);
10902 decl->type = result;
10906 void prepare_main_collect2(entity_t *entity)
10908 // create call to __main
10909 symbol_t *symbol = symbol_table_insert("__main");
10910 entity_t *subsubmain_ent
10911 = create_implicit_function(symbol, &builtin_source_position);
10913 expression_t *ref = allocate_expression_zero(EXPR_REFERENCE);
10914 type_t *ftype = subsubmain_ent->declaration.type;
10915 ref->base.source_position = builtin_source_position;
10916 ref->base.type = make_pointer_type(ftype, TYPE_QUALIFIER_NONE);
10917 ref->reference.entity = subsubmain_ent;
10919 expression_t *call = allocate_expression_zero(EXPR_CALL);
10920 call->base.source_position = builtin_source_position;
10921 call->base.type = type_void;
10922 call->call.function = ref;
10924 statement_t *expr_statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10925 expr_statement->base.source_position = builtin_source_position;
10926 expr_statement->expression.expression = call;
10928 statement_t *statement = entity->function.statement;
10929 assert(statement->kind == STATEMENT_COMPOUND);
10930 compound_statement_t *compounds = &statement->compound;
10932 expr_statement->base.next = compounds->statements;
10933 compounds->statements = expr_statement;
10938 lookahead_bufpos = 0;
10939 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
10942 current_linkage = c_mode & _CXX ? LINKAGE_CXX : LINKAGE_C;
10943 incomplete_arrays = NEW_ARR_F(declaration_t*, 0);
10944 parse_translation_unit();
10945 complete_incomplete_arrays();
10946 DEL_ARR_F(incomplete_arrays);
10947 incomplete_arrays = NULL;
10951 * create a builtin function.
10953 static entity_t *create_builtin_function(builtin_kind_t kind, const char *name, type_t *function_type)
10955 symbol_t *symbol = symbol_table_insert(name);
10956 entity_t *entity = allocate_entity_zero(ENTITY_FUNCTION);
10957 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
10958 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
10959 entity->declaration.type = function_type;
10960 entity->declaration.implicit = true;
10961 entity->base.symbol = symbol;
10962 entity->base.source_position = builtin_source_position;
10964 entity->function.btk = kind;
10966 record_entity(entity, /*is_definition=*/false);
10972 * Create predefined gnu builtins.
10974 static void create_gnu_builtins(void)
10976 #define GNU_BUILTIN(a, b) create_builtin_function(bk_gnu_builtin_##a, "__builtin_" #a, b)
10978 GNU_BUILTIN(alloca, make_function_1_type(type_void_ptr, type_size_t));
10979 GNU_BUILTIN(huge_val, make_function_0_type(type_double));
10980 GNU_BUILTIN(inf, make_function_0_type(type_double));
10981 GNU_BUILTIN(inff, make_function_0_type(type_float));
10982 GNU_BUILTIN(infl, make_function_0_type(type_long_double));
10983 GNU_BUILTIN(nan, make_function_1_type(type_double, type_char_ptr));
10984 GNU_BUILTIN(nanf, make_function_1_type(type_float, type_char_ptr));
10985 GNU_BUILTIN(nanl, make_function_1_type(type_long_double, type_char_ptr));
10986 GNU_BUILTIN(va_end, make_function_1_type(type_void, type_valist));
10987 GNU_BUILTIN(expect, make_function_2_type(type_long, type_long, type_long));
10988 GNU_BUILTIN(return_address, make_function_1_type(type_void_ptr, type_unsigned_int));
10989 GNU_BUILTIN(frame_address, make_function_1_type(type_void_ptr, type_unsigned_int));
10990 GNU_BUILTIN(ffs, make_function_1_type(type_int, type_unsigned_int));
10991 GNU_BUILTIN(clz, make_function_1_type(type_int, type_unsigned_int));
10992 GNU_BUILTIN(ctz, make_function_1_type(type_int, type_unsigned_int));
10993 GNU_BUILTIN(popcount, make_function_1_type(type_int, type_unsigned_int));
10994 GNU_BUILTIN(parity, make_function_1_type(type_int, type_unsigned_int));
10995 GNU_BUILTIN(prefetch, make_function_1_type_variadic(type_float, type_void_ptr));
10996 GNU_BUILTIN(trap, make_function_0_type_noreturn(type_void));
11002 * Create predefined MS intrinsics.
11004 static void create_microsoft_intrinsics(void)
11006 #define MS_BUILTIN(a, b) create_builtin_function(bk_ms##a, #a, b)
11008 /* intrinsics for all architectures */
11009 MS_BUILTIN(_rotl, make_function_2_type(type_unsigned_int, type_unsigned_int, type_int));
11010 MS_BUILTIN(_rotr, make_function_2_type(type_unsigned_int, type_unsigned_int, type_int));
11011 MS_BUILTIN(_rotl64, make_function_2_type(type_unsigned_int64, type_unsigned_int64, type_int));
11012 MS_BUILTIN(_rotr64, make_function_2_type(type_unsigned_int64, type_unsigned_int64, type_int));
11013 MS_BUILTIN(_byteswap_ushort, make_function_1_type(type_unsigned_short, type_unsigned_short));
11014 MS_BUILTIN(_byteswap_ulong, make_function_1_type(type_unsigned_long, type_unsigned_long));
11015 MS_BUILTIN(_byteswap_uint64, make_function_1_type(type_unsigned_int64, type_unsigned_int64));
11017 MS_BUILTIN(__debugbreak, make_function_0_type(type_void));
11018 MS_BUILTIN(_ReturnAddress, make_function_0_type(type_void_ptr));
11019 MS_BUILTIN(_AddressOfReturnAddress, make_function_0_type(type_void_ptr));
11020 MS_BUILTIN(__popcount, make_function_1_type(type_unsigned_int, type_unsigned_int));
11023 MS_BUILTIN(_enable, make_function_0_type(type_void));
11024 MS_BUILTIN(_disable, make_function_0_type(type_void));
11025 MS_BUILTIN(__inbyte, make_function_1_type(type_unsigned_char, type_unsigned_short));
11026 MS_BUILTIN(__inword, make_function_1_type(type_unsigned_short, type_unsigned_short));
11027 MS_BUILTIN(__indword, make_function_1_type(type_unsigned_long, type_unsigned_short));
11028 MS_BUILTIN(__outbyte, make_function_2_type(type_void, type_unsigned_short, type_unsigned_char));
11029 MS_BUILTIN(__outword, make_function_2_type(type_void, type_unsigned_short, type_unsigned_short));
11030 MS_BUILTIN(__outdword, make_function_2_type(type_void, type_unsigned_short, type_unsigned_long));
11031 MS_BUILTIN(__ud2, make_function_0_type_noreturn(type_void));
11032 MS_BUILTIN(_BitScanForward, make_function_2_type(type_unsigned_char, type_unsigned_long_ptr, type_unsigned_long));
11033 MS_BUILTIN(_BitScanReverse, make_function_2_type(type_unsigned_char, type_unsigned_long_ptr, type_unsigned_long));
11034 MS_BUILTIN(_InterlockedExchange, make_function_2_type(type_long, type_long_ptr, type_long));
11035 MS_BUILTIN(_InterlockedExchange64, make_function_2_type(type_int64, type_int64_ptr, type_int64));
11037 if (machine_size <= 32) {
11038 MS_BUILTIN(__readeflags, make_function_0_type(type_unsigned_int));
11039 MS_BUILTIN(__writeeflags, make_function_1_type(type_void, type_unsigned_int));
11041 MS_BUILTIN(__readeflags, make_function_0_type(type_unsigned_int64));
11042 MS_BUILTIN(__writeeflags, make_function_1_type(type_void, type_unsigned_int64));
11049 * Initialize the parser.
11051 void init_parser(void)
11053 sym_anonymous = symbol_table_insert("<anonymous>");
11055 memset(token_anchor_set, 0, sizeof(token_anchor_set));
11057 init_expression_parsers();
11058 obstack_init(&temp_obst);
11060 symbol_t *const va_list_sym = symbol_table_insert("__builtin_va_list");
11061 type_valist = create_builtin_type(va_list_sym, type_void_ptr);
11065 * Terminate the parser.
11067 void exit_parser(void)
11069 obstack_free(&temp_obst, NULL);