2 * This file is part of cparser.
3 * Copyright (C) 2007-2008 Matthias Braun <matze@braunis.de>
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License
7 * as published by the Free Software Foundation; either version 2
8 * of the License, or (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
27 #include "diagnostic.h"
28 #include "format_check.h"
34 #include "type_hash.h"
37 #include "attribute_t.h"
38 #include "lang_features.h"
39 #include "walk_statements.h"
41 #include "adt/bitfiddle.h"
42 #include "adt/error.h"
43 #include "adt/array.h"
45 //#define PRINT_TOKENS
46 #define MAX_LOOKAHEAD 1
51 entity_namespace_t namespc;
54 typedef struct declaration_specifiers_t declaration_specifiers_t;
55 struct declaration_specifiers_t {
56 source_position_t source_position;
57 storage_class_t storage_class;
58 unsigned char alignment; /**< Alignment, 0 if not set. */
60 bool thread_local : 1; /**< GCC __thread */
61 attribute_t *attributes; /**< list of attributes */
66 * An environment for parsing initializers (and compound literals).
68 typedef struct parse_initializer_env_t {
69 type_t *type; /**< the type of the initializer. In case of an
70 array type with unspecified size this gets
71 adjusted to the actual size. */
72 entity_t *entity; /**< the variable that is initialized if any */
73 bool must_be_constant;
74 } parse_initializer_env_t;
76 typedef entity_t* (*parsed_declaration_func) (entity_t *declaration, bool is_definition);
78 /** The current token. */
80 /** The lookahead ring-buffer. */
81 static token_t lookahead_buffer[MAX_LOOKAHEAD];
82 /** Position of the next token in the lookahead buffer. */
83 static size_t lookahead_bufpos;
84 static stack_entry_t *environment_stack = NULL;
85 static stack_entry_t *label_stack = NULL;
86 static scope_t *file_scope = NULL;
87 static scope_t *current_scope = NULL;
88 /** Point to the current function declaration if inside a function. */
89 static function_t *current_function = NULL;
90 static entity_t *current_init_decl = NULL;
91 static switch_statement_t *current_switch = NULL;
92 static statement_t *current_loop = NULL;
93 static statement_t *current_parent = NULL;
94 static ms_try_statement_t *current_try = NULL;
95 static linkage_kind_t current_linkage = LINKAGE_INVALID;
96 static goto_statement_t *goto_first = NULL;
97 static goto_statement_t **goto_anchor = NULL;
98 static label_statement_t *label_first = NULL;
99 static label_statement_t **label_anchor = NULL;
100 /** current translation unit. */
101 static translation_unit_t *unit = NULL;
102 /** true if we are in a type property context (evaluation only for type. */
103 static bool in_type_prop = false;
104 /** true in we are in a __extension__ context. */
105 static bool in_gcc_extension = false;
106 static struct obstack temp_obst;
107 static entity_t *anonymous_entity;
108 static declaration_t **incomplete_arrays;
111 #define PUSH_PARENT(stmt) \
112 statement_t *const prev_parent = current_parent; \
113 ((void)(current_parent = (stmt)))
114 #define POP_PARENT ((void)(current_parent = prev_parent))
116 /** special symbol used for anonymous entities. */
117 static const symbol_t *sym_anonymous = NULL;
119 /** The token anchor set */
120 static unsigned char token_anchor_set[T_LAST_TOKEN];
122 /** The current source position. */
123 #define HERE (&token.source_position)
125 /** true if we are in GCC mode. */
126 #define GNU_MODE ((c_mode & _GNUC) || in_gcc_extension)
128 static statement_t *parse_compound_statement(bool inside_expression_statement);
129 static statement_t *parse_statement(void);
131 static expression_t *parse_sub_expression(precedence_t);
132 static expression_t *parse_expression(void);
133 static type_t *parse_typename(void);
134 static void parse_externals(void);
135 static void parse_external(void);
137 static void parse_compound_type_entries(compound_t *compound_declaration);
139 static void check_call_argument(type_t *expected_type,
140 call_argument_t *argument, unsigned pos);
142 typedef enum declarator_flags_t {
144 DECL_MAY_BE_ABSTRACT = 1U << 0,
145 DECL_CREATE_COMPOUND_MEMBER = 1U << 1,
146 DECL_IS_PARAMETER = 1U << 2
147 } declarator_flags_t;
149 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
150 declarator_flags_t flags);
152 static entity_t *record_entity(entity_t *entity, bool is_definition);
154 static void semantic_comparison(binary_expression_t *expression);
156 static void create_gnu_builtins(void);
157 static void create_microsoft_intrinsics(void);
159 #define STORAGE_CLASSES \
160 STORAGE_CLASSES_NO_EXTERN \
163 #define STORAGE_CLASSES_NO_EXTERN \
170 #define TYPE_QUALIFIERS \
175 case T__forceinline: \
176 case T___attribute__:
178 #define COMPLEX_SPECIFIERS \
180 #define IMAGINARY_SPECIFIERS \
183 #define TYPE_SPECIFIERS \
185 case T___builtin_va_list: \
210 #define DECLARATION_START \
215 #define DECLARATION_START_NO_EXTERN \
216 STORAGE_CLASSES_NO_EXTERN \
220 #define TYPENAME_START \
224 #define EXPRESSION_START \
233 case T_CHARACTER_CONSTANT: \
234 case T_FLOATINGPOINT: \
238 case T_STRING_LITERAL: \
239 case T_WIDE_CHARACTER_CONSTANT: \
240 case T_WIDE_STRING_LITERAL: \
241 case T___FUNCDNAME__: \
242 case T___FUNCSIG__: \
243 case T___FUNCTION__: \
244 case T___PRETTY_FUNCTION__: \
245 case T___alignof__: \
246 case T___builtin_classify_type: \
247 case T___builtin_constant_p: \
248 case T___builtin_isgreater: \
249 case T___builtin_isgreaterequal: \
250 case T___builtin_isless: \
251 case T___builtin_islessequal: \
252 case T___builtin_islessgreater: \
253 case T___builtin_isunordered: \
254 case T___builtin_offsetof: \
255 case T___builtin_va_arg: \
256 case T___builtin_va_start: \
257 case T___builtin_va_copy: \
268 * Allocate an AST node with given size and
269 * initialize all fields with zero.
271 static void *allocate_ast_zero(size_t size)
273 void *res = allocate_ast(size);
274 memset(res, 0, size);
279 * Returns the size of an entity node.
281 * @param kind the entity kind
283 static size_t get_entity_struct_size(entity_kind_t kind)
285 static const size_t sizes[] = {
286 [ENTITY_VARIABLE] = sizeof(variable_t),
287 [ENTITY_PARAMETER] = sizeof(parameter_t),
288 [ENTITY_COMPOUND_MEMBER] = sizeof(compound_member_t),
289 [ENTITY_FUNCTION] = sizeof(function_t),
290 [ENTITY_TYPEDEF] = sizeof(typedef_t),
291 [ENTITY_STRUCT] = sizeof(compound_t),
292 [ENTITY_UNION] = sizeof(compound_t),
293 [ENTITY_ENUM] = sizeof(enum_t),
294 [ENTITY_ENUM_VALUE] = sizeof(enum_value_t),
295 [ENTITY_LABEL] = sizeof(label_t),
296 [ENTITY_LOCAL_LABEL] = sizeof(label_t),
297 [ENTITY_NAMESPACE] = sizeof(namespace_t)
299 assert(kind < lengthof(sizes));
300 assert(sizes[kind] != 0);
305 * Allocate an entity of given kind and initialize all
308 * @param kind the kind of the entity to allocate
310 static entity_t *allocate_entity_zero(entity_kind_t kind)
312 size_t size = get_entity_struct_size(kind);
313 entity_t *entity = allocate_ast_zero(size);
319 * Returns the size of a statement node.
321 * @param kind the statement kind
323 static size_t get_statement_struct_size(statement_kind_t kind)
325 static const size_t sizes[] = {
326 [STATEMENT_INVALID] = sizeof(invalid_statement_t),
327 [STATEMENT_EMPTY] = sizeof(empty_statement_t),
328 [STATEMENT_COMPOUND] = sizeof(compound_statement_t),
329 [STATEMENT_RETURN] = sizeof(return_statement_t),
330 [STATEMENT_DECLARATION] = sizeof(declaration_statement_t),
331 [STATEMENT_IF] = sizeof(if_statement_t),
332 [STATEMENT_SWITCH] = sizeof(switch_statement_t),
333 [STATEMENT_EXPRESSION] = sizeof(expression_statement_t),
334 [STATEMENT_CONTINUE] = sizeof(statement_base_t),
335 [STATEMENT_BREAK] = sizeof(statement_base_t),
336 [STATEMENT_GOTO] = sizeof(goto_statement_t),
337 [STATEMENT_LABEL] = sizeof(label_statement_t),
338 [STATEMENT_CASE_LABEL] = sizeof(case_label_statement_t),
339 [STATEMENT_WHILE] = sizeof(while_statement_t),
340 [STATEMENT_DO_WHILE] = sizeof(do_while_statement_t),
341 [STATEMENT_FOR] = sizeof(for_statement_t),
342 [STATEMENT_ASM] = sizeof(asm_statement_t),
343 [STATEMENT_MS_TRY] = sizeof(ms_try_statement_t),
344 [STATEMENT_LEAVE] = sizeof(leave_statement_t)
346 assert(kind < lengthof(sizes));
347 assert(sizes[kind] != 0);
352 * Returns the size of an expression node.
354 * @param kind the expression kind
356 static size_t get_expression_struct_size(expression_kind_t kind)
358 static const size_t sizes[] = {
359 [EXPR_INVALID] = sizeof(expression_base_t),
360 [EXPR_REFERENCE] = sizeof(reference_expression_t),
361 [EXPR_REFERENCE_ENUM_VALUE] = sizeof(reference_expression_t),
362 [EXPR_CONST] = sizeof(const_expression_t),
363 [EXPR_CHARACTER_CONSTANT] = sizeof(const_expression_t),
364 [EXPR_WIDE_CHARACTER_CONSTANT] = sizeof(const_expression_t),
365 [EXPR_STRING_LITERAL] = sizeof(string_literal_expression_t),
366 [EXPR_WIDE_STRING_LITERAL] = sizeof(wide_string_literal_expression_t),
367 [EXPR_COMPOUND_LITERAL] = sizeof(compound_literal_expression_t),
368 [EXPR_CALL] = sizeof(call_expression_t),
369 [EXPR_UNARY_FIRST] = sizeof(unary_expression_t),
370 [EXPR_BINARY_FIRST] = sizeof(binary_expression_t),
371 [EXPR_CONDITIONAL] = sizeof(conditional_expression_t),
372 [EXPR_SELECT] = sizeof(select_expression_t),
373 [EXPR_ARRAY_ACCESS] = sizeof(array_access_expression_t),
374 [EXPR_SIZEOF] = sizeof(typeprop_expression_t),
375 [EXPR_ALIGNOF] = sizeof(typeprop_expression_t),
376 [EXPR_CLASSIFY_TYPE] = sizeof(classify_type_expression_t),
377 [EXPR_FUNCNAME] = sizeof(funcname_expression_t),
378 [EXPR_BUILTIN_CONSTANT_P] = sizeof(builtin_constant_expression_t),
379 [EXPR_BUILTIN_TYPES_COMPATIBLE_P] = sizeof(builtin_types_compatible_expression_t),
380 [EXPR_OFFSETOF] = sizeof(offsetof_expression_t),
381 [EXPR_VA_START] = sizeof(va_start_expression_t),
382 [EXPR_VA_ARG] = sizeof(va_arg_expression_t),
383 [EXPR_VA_COPY] = sizeof(va_copy_expression_t),
384 [EXPR_STATEMENT] = sizeof(statement_expression_t),
385 [EXPR_LABEL_ADDRESS] = sizeof(label_address_expression_t),
387 if (kind >= EXPR_UNARY_FIRST && kind <= EXPR_UNARY_LAST) {
388 return sizes[EXPR_UNARY_FIRST];
390 if (kind >= EXPR_BINARY_FIRST && kind <= EXPR_BINARY_LAST) {
391 return sizes[EXPR_BINARY_FIRST];
393 assert(kind < lengthof(sizes));
394 assert(sizes[kind] != 0);
399 * Allocate a statement node of given kind and initialize all
400 * fields with zero. Sets its source position to the position
401 * of the current token.
403 static statement_t *allocate_statement_zero(statement_kind_t kind)
405 size_t size = get_statement_struct_size(kind);
406 statement_t *res = allocate_ast_zero(size);
408 res->base.kind = kind;
409 res->base.parent = current_parent;
410 res->base.source_position = token.source_position;
415 * Allocate an expression node of given kind and initialize all
418 * @param kind the kind of the expression to allocate
420 static expression_t *allocate_expression_zero(expression_kind_t kind)
422 size_t size = get_expression_struct_size(kind);
423 expression_t *res = allocate_ast_zero(size);
425 res->base.kind = kind;
426 res->base.type = type_error_type;
427 res->base.source_position = token.source_position;
432 * Creates a new invalid expression at the source position
433 * of the current token.
435 static expression_t *create_invalid_expression(void)
437 return allocate_expression_zero(EXPR_INVALID);
441 * Creates a new invalid statement.
443 static statement_t *create_invalid_statement(void)
445 return allocate_statement_zero(STATEMENT_INVALID);
449 * Allocate a new empty statement.
451 static statement_t *create_empty_statement(void)
453 return allocate_statement_zero(STATEMENT_EMPTY);
457 * Returns the size of a type node.
459 * @param kind the type kind
461 static size_t get_type_struct_size(type_kind_t kind)
463 static const size_t sizes[] = {
464 [TYPE_ATOMIC] = sizeof(atomic_type_t),
465 [TYPE_COMPLEX] = sizeof(complex_type_t),
466 [TYPE_IMAGINARY] = sizeof(imaginary_type_t),
467 [TYPE_BITFIELD] = sizeof(bitfield_type_t),
468 [TYPE_COMPOUND_STRUCT] = sizeof(compound_type_t),
469 [TYPE_COMPOUND_UNION] = sizeof(compound_type_t),
470 [TYPE_ENUM] = sizeof(enum_type_t),
471 [TYPE_FUNCTION] = sizeof(function_type_t),
472 [TYPE_POINTER] = sizeof(pointer_type_t),
473 [TYPE_ARRAY] = sizeof(array_type_t),
474 [TYPE_BUILTIN] = sizeof(builtin_type_t),
475 [TYPE_TYPEDEF] = sizeof(typedef_type_t),
476 [TYPE_TYPEOF] = sizeof(typeof_type_t),
478 assert(lengthof(sizes) == (int)TYPE_TYPEOF + 1);
479 assert(kind <= TYPE_TYPEOF);
480 assert(sizes[kind] != 0);
485 * Allocate a type node of given kind and initialize all
488 * @param kind type kind to allocate
490 static type_t *allocate_type_zero(type_kind_t kind)
492 size_t size = get_type_struct_size(kind);
493 type_t *res = obstack_alloc(type_obst, size);
494 memset(res, 0, size);
495 res->base.kind = kind;
500 static function_parameter_t *allocate_parameter(type_t *const type)
502 function_parameter_t *const param = obstack_alloc(type_obst, sizeof(*param));
503 memset(param, 0, sizeof(*param));
509 * Returns the size of an initializer node.
511 * @param kind the initializer kind
513 static size_t get_initializer_size(initializer_kind_t kind)
515 static const size_t sizes[] = {
516 [INITIALIZER_VALUE] = sizeof(initializer_value_t),
517 [INITIALIZER_STRING] = sizeof(initializer_string_t),
518 [INITIALIZER_WIDE_STRING] = sizeof(initializer_wide_string_t),
519 [INITIALIZER_LIST] = sizeof(initializer_list_t),
520 [INITIALIZER_DESIGNATOR] = sizeof(initializer_designator_t)
522 assert(kind < lengthof(sizes));
523 assert(sizes[kind] != 0);
528 * Allocate an initializer node of given kind and initialize all
531 static initializer_t *allocate_initializer_zero(initializer_kind_t kind)
533 initializer_t *result = allocate_ast_zero(get_initializer_size(kind));
540 * Returns the index of the top element of the environment stack.
542 static size_t environment_top(void)
544 return ARR_LEN(environment_stack);
548 * Returns the index of the top element of the global label stack.
550 static size_t label_top(void)
552 return ARR_LEN(label_stack);
556 * Return the next token.
558 static inline void next_token(void)
560 token = lookahead_buffer[lookahead_bufpos];
561 lookahead_buffer[lookahead_bufpos] = lexer_token;
564 lookahead_bufpos = (lookahead_bufpos + 1) % MAX_LOOKAHEAD;
567 print_token(stderr, &token);
568 fprintf(stderr, "\n");
573 * Return the next token with a given lookahead.
575 static inline const token_t *look_ahead(size_t num)
577 assert(0 < num && num <= MAX_LOOKAHEAD);
578 size_t pos = (lookahead_bufpos + num - 1) % MAX_LOOKAHEAD;
579 return &lookahead_buffer[pos];
583 * Adds a token type to the token type anchor set (a multi-set).
585 static void add_anchor_token(int token_type)
587 assert(0 <= token_type && token_type < T_LAST_TOKEN);
588 ++token_anchor_set[token_type];
592 * Set the number of tokens types of the given type
593 * to zero and return the old count.
595 static int save_and_reset_anchor_state(int token_type)
597 assert(0 <= token_type && token_type < T_LAST_TOKEN);
598 int count = token_anchor_set[token_type];
599 token_anchor_set[token_type] = 0;
604 * Restore the number of token types to the given count.
606 static void restore_anchor_state(int token_type, int count)
608 assert(0 <= token_type && token_type < T_LAST_TOKEN);
609 token_anchor_set[token_type] = count;
613 * Remove a token type from the token type anchor set (a multi-set).
615 static void rem_anchor_token(int token_type)
617 assert(0 <= token_type && token_type < T_LAST_TOKEN);
618 assert(token_anchor_set[token_type] != 0);
619 --token_anchor_set[token_type];
623 * Return true if the token type of the current token is
626 static bool at_anchor(void)
630 return token_anchor_set[token.type];
634 * Eat tokens until a matching token type is found.
636 static void eat_until_matching_token(int type)
640 case '(': end_token = ')'; break;
641 case '{': end_token = '}'; break;
642 case '[': end_token = ']'; break;
643 default: end_token = type; break;
646 unsigned parenthesis_count = 0;
647 unsigned brace_count = 0;
648 unsigned bracket_count = 0;
649 while (token.type != end_token ||
650 parenthesis_count != 0 ||
652 bracket_count != 0) {
653 switch (token.type) {
655 case '(': ++parenthesis_count; break;
656 case '{': ++brace_count; break;
657 case '[': ++bracket_count; break;
660 if (parenthesis_count > 0)
670 if (bracket_count > 0)
673 if (token.type == end_token &&
674 parenthesis_count == 0 &&
688 * Eat input tokens until an anchor is found.
690 static void eat_until_anchor(void)
692 while (token_anchor_set[token.type] == 0) {
693 if (token.type == '(' || token.type == '{' || token.type == '[')
694 eat_until_matching_token(token.type);
700 * Eat a whole block from input tokens.
702 static void eat_block(void)
704 eat_until_matching_token('{');
705 if (token.type == '}')
709 #define eat(token_type) (assert(token.type == (token_type)), next_token())
712 * Report a parse error because an expected token was not found.
715 #if defined __GNUC__ && __GNUC__ >= 4
716 __attribute__((sentinel))
718 void parse_error_expected(const char *message, ...)
720 if (message != NULL) {
721 errorf(HERE, "%s", message);
724 va_start(ap, message);
725 errorf(HERE, "got %K, expected %#k", &token, &ap, ", ");
730 * Report an incompatible type.
732 static void type_error_incompatible(const char *msg,
733 const source_position_t *source_position, type_t *type1, type_t *type2)
735 errorf(source_position, "%s, incompatible types: '%T' - '%T'",
740 * Expect the current token is the expected token.
741 * If not, generate an error, eat the current statement,
742 * and goto the end_error label.
744 #define expect(expected, error_label) \
746 if (UNLIKELY(token.type != (expected))) { \
747 parse_error_expected(NULL, (expected), NULL); \
748 add_anchor_token(expected); \
749 eat_until_anchor(); \
750 if (token.type == expected) \
752 rem_anchor_token(expected); \
759 * Push a given scope on the scope stack and make it the
762 static scope_t *scope_push(scope_t *new_scope)
764 if (current_scope != NULL) {
765 new_scope->depth = current_scope->depth + 1;
768 scope_t *old_scope = current_scope;
769 current_scope = new_scope;
774 * Pop the current scope from the scope stack.
776 static void scope_pop(scope_t *old_scope)
778 current_scope = old_scope;
782 * Search an entity by its symbol in a given namespace.
784 static entity_t *get_entity(const symbol_t *const symbol,
785 namespace_tag_t namespc)
787 entity_t *entity = symbol->entity;
788 for (; entity != NULL; entity = entity->base.symbol_next) {
789 if (entity->base.namespc == namespc)
796 /* §6.2.3:1 24) There is only one name space for tags even though three are
798 static entity_t *get_tag(symbol_t const *const symbol,
799 entity_kind_tag_t const kind)
801 entity_t *entity = get_entity(symbol, NAMESPACE_TAG);
802 if (entity != NULL && entity->kind != kind) {
804 "'%Y' defined as wrong kind of tag (previous definition %P)",
805 symbol, &entity->base.source_position);
812 * pushs an entity on the environment stack and links the corresponding symbol
815 static void stack_push(stack_entry_t **stack_ptr, entity_t *entity)
817 symbol_t *symbol = entity->base.symbol;
818 entity_namespace_t namespc = entity->base.namespc;
819 assert(namespc != NAMESPACE_INVALID);
821 /* replace/add entity into entity list of the symbol */
824 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
829 /* replace an entry? */
830 if (iter->base.namespc == namespc) {
831 entity->base.symbol_next = iter->base.symbol_next;
837 /* remember old declaration */
839 entry.symbol = symbol;
840 entry.old_entity = iter;
841 entry.namespc = namespc;
842 ARR_APP1(stack_entry_t, *stack_ptr, entry);
846 * Push an entity on the environment stack.
848 static void environment_push(entity_t *entity)
850 assert(entity->base.source_position.input_name != NULL);
851 assert(entity->base.parent_scope != NULL);
852 stack_push(&environment_stack, entity);
856 * Push a declaration on the global label stack.
858 * @param declaration the declaration
860 static void label_push(entity_t *label)
862 /* we abuse the parameters scope as parent for the labels */
863 label->base.parent_scope = ¤t_function->parameters;
864 stack_push(&label_stack, label);
868 * pops symbols from the environment stack until @p new_top is the top element
870 static void stack_pop_to(stack_entry_t **stack_ptr, size_t new_top)
872 stack_entry_t *stack = *stack_ptr;
873 size_t top = ARR_LEN(stack);
876 assert(new_top <= top);
880 for (i = top; i > new_top; --i) {
881 stack_entry_t *entry = &stack[i - 1];
883 entity_t *old_entity = entry->old_entity;
884 symbol_t *symbol = entry->symbol;
885 entity_namespace_t namespc = entry->namespc;
887 /* replace with old_entity/remove */
890 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
892 assert(iter != NULL);
893 /* replace an entry? */
894 if (iter->base.namespc == namespc)
898 /* restore definition from outer scopes (if there was one) */
899 if (old_entity != NULL) {
900 old_entity->base.symbol_next = iter->base.symbol_next;
901 *anchor = old_entity;
903 /* remove entry from list */
904 *anchor = iter->base.symbol_next;
908 ARR_SHRINKLEN(*stack_ptr, (int) new_top);
912 * Pop all entries from the environment stack until the new_top
915 * @param new_top the new stack top
917 static void environment_pop_to(size_t new_top)
919 stack_pop_to(&environment_stack, new_top);
923 * Pop all entries from the global label stack until the new_top
926 * @param new_top the new stack top
928 static void label_pop_to(size_t new_top)
930 stack_pop_to(&label_stack, new_top);
933 static int get_akind_rank(atomic_type_kind_t akind)
939 * Return the type rank for an atomic type.
941 static int get_rank(const type_t *type)
943 assert(!is_typeref(type));
944 if (type->kind == TYPE_ENUM)
945 return get_akind_rank(type->enumt.akind);
947 assert(type->kind == TYPE_ATOMIC);
948 return get_akind_rank(type->atomic.akind);
952 * §6.3.1.1:2 Do integer promotion for a given type.
954 * @param type the type to promote
955 * @return the promoted type
957 static type_t *promote_integer(type_t *type)
959 if (type->kind == TYPE_BITFIELD)
960 type = type->bitfield.base_type;
962 if (get_rank(type) < get_akind_rank(ATOMIC_TYPE_INT))
969 * Create a cast expression.
971 * @param expression the expression to cast
972 * @param dest_type the destination type
974 static expression_t *create_cast_expression(expression_t *expression,
977 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST_IMPLICIT);
979 cast->unary.value = expression;
980 cast->base.type = dest_type;
986 * Check if a given expression represents a null pointer constant.
988 * @param expression the expression to check
990 static bool is_null_pointer_constant(const expression_t *expression)
992 /* skip void* cast */
993 if (expression->kind == EXPR_UNARY_CAST ||
994 expression->kind == EXPR_UNARY_CAST_IMPLICIT) {
995 type_t *const type = skip_typeref(expression->base.type);
996 if (types_compatible(type, type_void_ptr))
997 expression = expression->unary.value;
1000 type_t *const type = skip_typeref(expression->base.type);
1002 is_type_integer(type) &&
1003 is_constant_expression(expression) &&
1004 !fold_constant_to_bool(expression);
1008 * Create an implicit cast expression.
1010 * @param expression the expression to cast
1011 * @param dest_type the destination type
1013 static expression_t *create_implicit_cast(expression_t *expression,
1016 type_t *const source_type = expression->base.type;
1018 if (source_type == dest_type)
1021 return create_cast_expression(expression, dest_type);
1024 typedef enum assign_error_t {
1026 ASSIGN_ERROR_INCOMPATIBLE,
1027 ASSIGN_ERROR_POINTER_QUALIFIER_MISSING,
1028 ASSIGN_WARNING_POINTER_INCOMPATIBLE,
1029 ASSIGN_WARNING_POINTER_FROM_INT,
1030 ASSIGN_WARNING_INT_FROM_POINTER
1033 static void report_assign_error(assign_error_t error, type_t *orig_type_left,
1034 const expression_t *const right,
1035 const char *context,
1036 const source_position_t *source_position)
1038 type_t *const orig_type_right = right->base.type;
1039 type_t *const type_left = skip_typeref(orig_type_left);
1040 type_t *const type_right = skip_typeref(orig_type_right);
1043 case ASSIGN_SUCCESS:
1045 case ASSIGN_ERROR_INCOMPATIBLE:
1046 errorf(source_position,
1047 "destination type '%T' in %s is incompatible with type '%T'",
1048 orig_type_left, context, orig_type_right);
1051 case ASSIGN_ERROR_POINTER_QUALIFIER_MISSING: {
1052 if (warning.other) {
1053 type_t *points_to_left = skip_typeref(type_left->pointer.points_to);
1054 type_t *points_to_right = skip_typeref(type_right->pointer.points_to);
1056 /* the left type has all qualifiers from the right type */
1057 unsigned missing_qualifiers
1058 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
1059 warningf(source_position,
1060 "destination type '%T' in %s from type '%T' lacks qualifiers '%Q' in pointer target type",
1061 orig_type_left, context, orig_type_right, missing_qualifiers);
1066 case ASSIGN_WARNING_POINTER_INCOMPATIBLE:
1067 if (warning.other) {
1068 warningf(source_position,
1069 "destination type '%T' in %s is incompatible with '%E' of type '%T'",
1070 orig_type_left, context, right, orig_type_right);
1074 case ASSIGN_WARNING_POINTER_FROM_INT:
1075 if (warning.other) {
1076 warningf(source_position,
1077 "%s makes pointer '%T' from integer '%T' without a cast",
1078 context, orig_type_left, orig_type_right);
1082 case ASSIGN_WARNING_INT_FROM_POINTER:
1083 if (warning.other) {
1084 warningf(source_position,
1085 "%s makes integer '%T' from pointer '%T' without a cast",
1086 context, orig_type_left, orig_type_right);
1091 panic("invalid error value");
1095 /** Implements the rules from §6.5.16.1 */
1096 static assign_error_t semantic_assign(type_t *orig_type_left,
1097 const expression_t *const right)
1099 type_t *const orig_type_right = right->base.type;
1100 type_t *const type_left = skip_typeref(orig_type_left);
1101 type_t *const type_right = skip_typeref(orig_type_right);
1103 if (is_type_pointer(type_left)) {
1104 if (is_null_pointer_constant(right)) {
1105 return ASSIGN_SUCCESS;
1106 } else if (is_type_pointer(type_right)) {
1107 type_t *points_to_left
1108 = skip_typeref(type_left->pointer.points_to);
1109 type_t *points_to_right
1110 = skip_typeref(type_right->pointer.points_to);
1111 assign_error_t res = ASSIGN_SUCCESS;
1113 /* the left type has all qualifiers from the right type */
1114 unsigned missing_qualifiers
1115 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
1116 if (missing_qualifiers != 0) {
1117 res = ASSIGN_ERROR_POINTER_QUALIFIER_MISSING;
1120 points_to_left = get_unqualified_type(points_to_left);
1121 points_to_right = get_unqualified_type(points_to_right);
1123 if (is_type_atomic(points_to_left, ATOMIC_TYPE_VOID))
1126 if (is_type_atomic(points_to_right, ATOMIC_TYPE_VOID)) {
1127 /* ISO/IEC 14882:1998(E) §C.1.2:6 */
1128 return c_mode & _CXX ? ASSIGN_ERROR_INCOMPATIBLE : res;
1131 if (!types_compatible(points_to_left, points_to_right)) {
1132 return ASSIGN_WARNING_POINTER_INCOMPATIBLE;
1136 } else if (is_type_integer(type_right)) {
1137 return ASSIGN_WARNING_POINTER_FROM_INT;
1139 } else if ((is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) ||
1140 (is_type_atomic(type_left, ATOMIC_TYPE_BOOL)
1141 && is_type_pointer(type_right))) {
1142 return ASSIGN_SUCCESS;
1143 } else if ((is_type_compound(type_left) && is_type_compound(type_right))
1144 || (is_type_builtin(type_left) && is_type_builtin(type_right))) {
1145 type_t *const unqual_type_left = get_unqualified_type(type_left);
1146 type_t *const unqual_type_right = get_unqualified_type(type_right);
1147 if (types_compatible(unqual_type_left, unqual_type_right)) {
1148 return ASSIGN_SUCCESS;
1150 } else if (is_type_integer(type_left) && is_type_pointer(type_right)) {
1151 return ASSIGN_WARNING_INT_FROM_POINTER;
1154 if (!is_type_valid(type_left) || !is_type_valid(type_right))
1155 return ASSIGN_SUCCESS;
1157 return ASSIGN_ERROR_INCOMPATIBLE;
1160 static expression_t *parse_constant_expression(void)
1162 expression_t *result = parse_sub_expression(PREC_CONDITIONAL);
1164 if (!is_constant_expression(result)) {
1165 errorf(&result->base.source_position,
1166 "expression '%E' is not constant", result);
1172 static expression_t *parse_assignment_expression(void)
1174 return parse_sub_expression(PREC_ASSIGNMENT);
1177 static string_t parse_string_literals(void)
1179 assert(token.type == T_STRING_LITERAL);
1180 string_t result = token.v.string;
1184 while (token.type == T_STRING_LITERAL) {
1185 result = concat_strings(&result, &token.v.string);
1193 * compare two string, ignoring double underscores on the second.
1195 static int strcmp_underscore(const char *s1, const char *s2)
1197 if (s2[0] == '_' && s2[1] == '_') {
1198 size_t len2 = strlen(s2);
1199 size_t len1 = strlen(s1);
1200 if (len1 == len2-4 && s2[len2-2] == '_' && s2[len2-1] == '_') {
1201 return strncmp(s1, s2+2, len2-4);
1205 return strcmp(s1, s2);
1208 static attribute_t *allocate_attribute_zero(attribute_kind_t kind)
1210 attribute_t *attribute = allocate_ast_zero(sizeof(*attribute));
1211 attribute->kind = kind;
1216 * Parse (gcc) attribute argument. From gcc comments in gcc source:
1219 * __attribute__ ( ( attribute-list ) )
1223 * attribute_list , attrib
1228 * any-word ( identifier )
1229 * any-word ( identifier , nonempty-expr-list )
1230 * any-word ( expr-list )
1232 * where the "identifier" must not be declared as a type, and
1233 * "any-word" may be any identifier (including one declared as a
1234 * type), a reserved word storage class specifier, type specifier or
1235 * type qualifier. ??? This still leaves out most reserved keywords
1236 * (following the old parser), shouldn't we include them, and why not
1237 * allow identifiers declared as types to start the arguments?
1239 * Matze: this all looks confusing and little systematic, so we're even less
1240 * strict and parse any list of things which are identifiers or
1241 * (assignment-)expressions.
1243 static attribute_argument_t *parse_attribute_arguments(void)
1245 if (token.type == ')')
1248 attribute_argument_t *first = NULL;
1249 attribute_argument_t *last = NULL;
1251 attribute_argument_t *argument = allocate_ast_zero(sizeof(*argument));
1253 /* is it an identifier */
1254 if (token.type == T_IDENTIFIER
1255 && (look_ahead(1)->type == ',' || look_ahead(1)->type == ')')) {
1256 symbol_t *symbol = token.v.symbol;
1257 argument->kind = ATTRIBUTE_ARGUMENT_SYMBOL;
1258 argument->v.symbol = symbol;
1261 /* must be an expression */
1262 expression_t *expression = parse_assignment_expression();
1264 argument->kind = ATTRIBUTE_ARGUMENT_EXPRESSION;
1265 argument->v.expression = expression;
1268 /* append argument */
1272 last->next = argument;
1276 if (token.type == ',') {
1280 expect(')', end_error);
1291 static attribute_t *parse_attribute_asm(void)
1295 attribute_t *attribute = allocate_attribute_zero(ATTRIBUTE_GNU_ASM);
1297 expect('(', end_error);
1298 attribute->a.arguments = parse_attribute_arguments();
1305 static symbol_t *get_symbol_from_token(void)
1307 switch(token.type) {
1309 return token.v.symbol;
1338 /* maybe we need more tokens ... add them on demand */
1339 return get_token_symbol(&token);
1345 static attribute_t *parse_attribute_gnu_single(void)
1347 /* parse "any-word" */
1348 symbol_t *symbol = get_symbol_from_token();
1349 if (symbol == NULL) {
1350 parse_error_expected("while parsing attribute((", T_IDENTIFIER, NULL);
1354 const char *name = symbol->string;
1357 attribute_kind_t kind;
1358 for (kind = ATTRIBUTE_GNU_FIRST; kind <= ATTRIBUTE_GNU_LAST; ++kind) {
1359 const char *attribute_name = get_attribute_name(kind);
1360 if (attribute_name != NULL
1361 && strcmp_underscore(attribute_name, name) == 0)
1365 if (kind >= ATTRIBUTE_GNU_LAST) {
1366 if (warning.attribute) {
1367 warningf(HERE, "unknown attribute '%s' ignored", name);
1369 /* TODO: we should still save the attribute in the list... */
1370 kind = ATTRIBUTE_UNKNOWN;
1373 attribute_t *attribute = allocate_attribute_zero(kind);
1375 /* parse arguments */
1376 if (token.type == '(') {
1378 attribute->a.arguments = parse_attribute_arguments();
1387 static attribute_t *parse_attribute_gnu(void)
1389 attribute_t *first = NULL;
1390 attribute_t *last = NULL;
1392 eat(T___attribute__);
1393 expect('(', end_error);
1394 expect('(', end_error);
1396 if (token.type == ')') {
1398 expect(')', end_error);
1403 attribute_t *attribute = parse_attribute_gnu_single();
1404 if (attribute == NULL)
1410 last->next = attribute;
1414 if (token.type == ')') {
1418 expect(',', end_error);
1420 expect(')', end_error);
1426 /** Parse attributes. */
1427 static attribute_t *parse_attributes(attribute_t *first)
1429 attribute_t *last = first;
1432 while (last->next != NULL)
1436 attribute_t *attribute;
1437 switch (token.type) {
1438 case T___attribute__:
1439 attribute = parse_attribute_gnu();
1443 attribute = parse_attribute_asm();
1448 attribute = allocate_attribute_zero(ATTRIBUTE_MS_CDECL);
1453 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FASTCALL);
1456 case T__forceinline:
1458 attribute = allocate_attribute_zero(ATTRIBUTE_MS_FORCEINLINE);
1463 attribute = allocate_attribute_zero(ATTRIBUTE_MS_STDCALL);
1468 /* TODO record modifier */
1470 warningf(HERE, "Ignoring declaration modifier %K", &token);
1471 attribute = allocate_attribute_zero(ATTRIBUTE_MS_THISCALL);
1481 last->next = attribute;
1487 static void mark_vars_read(expression_t *expr, entity_t *lhs_ent);
1489 static entity_t *determine_lhs_ent(expression_t *const expr,
1492 switch (expr->kind) {
1493 case EXPR_REFERENCE: {
1494 entity_t *const entity = expr->reference.entity;
1495 /* we should only find variables as lvalues... */
1496 if (entity->base.kind != ENTITY_VARIABLE
1497 && entity->base.kind != ENTITY_PARAMETER)
1503 case EXPR_ARRAY_ACCESS: {
1504 expression_t *const ref = expr->array_access.array_ref;
1505 entity_t * ent = NULL;
1506 if (is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1507 ent = determine_lhs_ent(ref, lhs_ent);
1510 mark_vars_read(expr->select.compound, lhs_ent);
1512 mark_vars_read(expr->array_access.index, lhs_ent);
1517 if (is_type_compound(skip_typeref(expr->base.type))) {
1518 return determine_lhs_ent(expr->select.compound, lhs_ent);
1520 mark_vars_read(expr->select.compound, lhs_ent);
1525 case EXPR_UNARY_DEREFERENCE: {
1526 expression_t *const val = expr->unary.value;
1527 if (val->kind == EXPR_UNARY_TAKE_ADDRESS) {
1529 return determine_lhs_ent(val->unary.value, lhs_ent);
1531 mark_vars_read(val, NULL);
1537 mark_vars_read(expr, NULL);
1542 #define ENT_ANY ((entity_t*)-1)
1545 * Mark declarations, which are read. This is used to detect variables, which
1549 * x is not marked as "read", because it is only read to calculate its own new
1553 * x and y are not detected as "not read", because multiple variables are
1556 static void mark_vars_read(expression_t *const expr, entity_t *lhs_ent)
1558 switch (expr->kind) {
1559 case EXPR_REFERENCE: {
1560 entity_t *const entity = expr->reference.entity;
1561 if (entity->kind != ENTITY_VARIABLE
1562 && entity->kind != ENTITY_PARAMETER)
1565 if (lhs_ent != entity && lhs_ent != ENT_ANY) {
1566 if (entity->kind == ENTITY_VARIABLE) {
1567 entity->variable.read = true;
1569 entity->parameter.read = true;
1576 // TODO respect pure/const
1577 mark_vars_read(expr->call.function, NULL);
1578 for (call_argument_t *arg = expr->call.arguments; arg != NULL; arg = arg->next) {
1579 mark_vars_read(arg->expression, NULL);
1583 case EXPR_CONDITIONAL:
1584 // TODO lhs_decl should depend on whether true/false have an effect
1585 mark_vars_read(expr->conditional.condition, NULL);
1586 if (expr->conditional.true_expression != NULL)
1587 mark_vars_read(expr->conditional.true_expression, lhs_ent);
1588 mark_vars_read(expr->conditional.false_expression, lhs_ent);
1592 if (lhs_ent == ENT_ANY
1593 && !is_type_compound(skip_typeref(expr->base.type)))
1595 mark_vars_read(expr->select.compound, lhs_ent);
1598 case EXPR_ARRAY_ACCESS: {
1599 expression_t *const ref = expr->array_access.array_ref;
1600 mark_vars_read(ref, lhs_ent);
1601 lhs_ent = determine_lhs_ent(ref, lhs_ent);
1602 mark_vars_read(expr->array_access.index, lhs_ent);
1607 mark_vars_read(expr->va_arge.ap, lhs_ent);
1611 mark_vars_read(expr->va_copye.src, lhs_ent);
1614 case EXPR_UNARY_CAST:
1615 /* Special case: Use void cast to mark a variable as "read" */
1616 if (is_type_atomic(skip_typeref(expr->base.type), ATOMIC_TYPE_VOID))
1621 case EXPR_UNARY_THROW:
1622 if (expr->unary.value == NULL)
1625 case EXPR_UNARY_DEREFERENCE:
1626 case EXPR_UNARY_DELETE:
1627 case EXPR_UNARY_DELETE_ARRAY:
1628 if (lhs_ent == ENT_ANY)
1632 case EXPR_UNARY_NEGATE:
1633 case EXPR_UNARY_PLUS:
1634 case EXPR_UNARY_BITWISE_NEGATE:
1635 case EXPR_UNARY_NOT:
1636 case EXPR_UNARY_TAKE_ADDRESS:
1637 case EXPR_UNARY_POSTFIX_INCREMENT:
1638 case EXPR_UNARY_POSTFIX_DECREMENT:
1639 case EXPR_UNARY_PREFIX_INCREMENT:
1640 case EXPR_UNARY_PREFIX_DECREMENT:
1641 case EXPR_UNARY_CAST_IMPLICIT:
1642 case EXPR_UNARY_ASSUME:
1644 mark_vars_read(expr->unary.value, lhs_ent);
1647 case EXPR_BINARY_ADD:
1648 case EXPR_BINARY_SUB:
1649 case EXPR_BINARY_MUL:
1650 case EXPR_BINARY_DIV:
1651 case EXPR_BINARY_MOD:
1652 case EXPR_BINARY_EQUAL:
1653 case EXPR_BINARY_NOTEQUAL:
1654 case EXPR_BINARY_LESS:
1655 case EXPR_BINARY_LESSEQUAL:
1656 case EXPR_BINARY_GREATER:
1657 case EXPR_BINARY_GREATEREQUAL:
1658 case EXPR_BINARY_BITWISE_AND:
1659 case EXPR_BINARY_BITWISE_OR:
1660 case EXPR_BINARY_BITWISE_XOR:
1661 case EXPR_BINARY_LOGICAL_AND:
1662 case EXPR_BINARY_LOGICAL_OR:
1663 case EXPR_BINARY_SHIFTLEFT:
1664 case EXPR_BINARY_SHIFTRIGHT:
1665 case EXPR_BINARY_COMMA:
1666 case EXPR_BINARY_ISGREATER:
1667 case EXPR_BINARY_ISGREATEREQUAL:
1668 case EXPR_BINARY_ISLESS:
1669 case EXPR_BINARY_ISLESSEQUAL:
1670 case EXPR_BINARY_ISLESSGREATER:
1671 case EXPR_BINARY_ISUNORDERED:
1672 mark_vars_read(expr->binary.left, lhs_ent);
1673 mark_vars_read(expr->binary.right, lhs_ent);
1676 case EXPR_BINARY_ASSIGN:
1677 case EXPR_BINARY_MUL_ASSIGN:
1678 case EXPR_BINARY_DIV_ASSIGN:
1679 case EXPR_BINARY_MOD_ASSIGN:
1680 case EXPR_BINARY_ADD_ASSIGN:
1681 case EXPR_BINARY_SUB_ASSIGN:
1682 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
1683 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
1684 case EXPR_BINARY_BITWISE_AND_ASSIGN:
1685 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
1686 case EXPR_BINARY_BITWISE_OR_ASSIGN: {
1687 if (lhs_ent == ENT_ANY)
1689 lhs_ent = determine_lhs_ent(expr->binary.left, lhs_ent);
1690 mark_vars_read(expr->binary.right, lhs_ent);
1695 determine_lhs_ent(expr->va_starte.ap, lhs_ent);
1701 case EXPR_CHARACTER_CONSTANT:
1702 case EXPR_WIDE_CHARACTER_CONSTANT:
1703 case EXPR_STRING_LITERAL:
1704 case EXPR_WIDE_STRING_LITERAL:
1705 case EXPR_COMPOUND_LITERAL: // TODO init?
1707 case EXPR_CLASSIFY_TYPE:
1710 case EXPR_BUILTIN_CONSTANT_P:
1711 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
1713 case EXPR_STATEMENT: // TODO
1714 case EXPR_LABEL_ADDRESS:
1715 case EXPR_REFERENCE_ENUM_VALUE:
1719 panic("unhandled expression");
1722 static designator_t *parse_designation(void)
1724 designator_t *result = NULL;
1725 designator_t *last = NULL;
1728 designator_t *designator;
1729 switch (token.type) {
1731 designator = allocate_ast_zero(sizeof(designator[0]));
1732 designator->source_position = token.source_position;
1734 add_anchor_token(']');
1735 designator->array_index = parse_constant_expression();
1736 rem_anchor_token(']');
1737 expect(']', end_error);
1740 designator = allocate_ast_zero(sizeof(designator[0]));
1741 designator->source_position = token.source_position;
1743 if (token.type != T_IDENTIFIER) {
1744 parse_error_expected("while parsing designator",
1745 T_IDENTIFIER, NULL);
1748 designator->symbol = token.v.symbol;
1752 expect('=', end_error);
1756 assert(designator != NULL);
1758 last->next = designator;
1760 result = designator;
1768 static initializer_t *initializer_from_string(array_type_t *type,
1769 const string_t *const string)
1771 /* TODO: check len vs. size of array type */
1774 initializer_t *initializer = allocate_initializer_zero(INITIALIZER_STRING);
1775 initializer->string.string = *string;
1780 static initializer_t *initializer_from_wide_string(array_type_t *const type,
1781 wide_string_t *const string)
1783 /* TODO: check len vs. size of array type */
1786 initializer_t *const initializer =
1787 allocate_initializer_zero(INITIALIZER_WIDE_STRING);
1788 initializer->wide_string.string = *string;
1794 * Build an initializer from a given expression.
1796 static initializer_t *initializer_from_expression(type_t *orig_type,
1797 expression_t *expression)
1799 /* TODO check that expression is a constant expression */
1801 /* §6.7.8.14/15 char array may be initialized by string literals */
1802 type_t *type = skip_typeref(orig_type);
1803 type_t *expr_type_orig = expression->base.type;
1804 type_t *expr_type = skip_typeref(expr_type_orig);
1805 if (is_type_array(type) && expr_type->kind == TYPE_POINTER) {
1806 array_type_t *const array_type = &type->array;
1807 type_t *const element_type = skip_typeref(array_type->element_type);
1809 if (element_type->kind == TYPE_ATOMIC) {
1810 atomic_type_kind_t akind = element_type->atomic.akind;
1811 switch (expression->kind) {
1812 case EXPR_STRING_LITERAL:
1813 if (akind == ATOMIC_TYPE_CHAR
1814 || akind == ATOMIC_TYPE_SCHAR
1815 || akind == ATOMIC_TYPE_UCHAR) {
1816 return initializer_from_string(array_type,
1817 &expression->string.value);
1821 case EXPR_WIDE_STRING_LITERAL: {
1822 type_t *bare_wchar_type = skip_typeref(type_wchar_t);
1823 if (get_unqualified_type(element_type) == bare_wchar_type) {
1824 return initializer_from_wide_string(array_type,
1825 &expression->wide_string.value);
1836 assign_error_t error = semantic_assign(type, expression);
1837 if (error == ASSIGN_ERROR_INCOMPATIBLE)
1839 report_assign_error(error, type, expression, "initializer",
1840 &expression->base.source_position);
1842 initializer_t *const result = allocate_initializer_zero(INITIALIZER_VALUE);
1844 if (type->kind == TYPE_BITFIELD) {
1845 type = type->bitfield.base_type;
1848 result->value.value = create_implicit_cast(expression, type);
1854 * Checks if a given expression can be used as an constant initializer.
1856 static bool is_initializer_constant(const expression_t *expression)
1858 return is_constant_expression(expression)
1859 || is_address_constant(expression);
1863 * Parses an scalar initializer.
1865 * §6.7.8.11; eat {} without warning
1867 static initializer_t *parse_scalar_initializer(type_t *type,
1868 bool must_be_constant)
1870 /* there might be extra {} hierarchies */
1872 if (token.type == '{') {
1874 warningf(HERE, "extra curly braces around scalar initializer");
1878 } while (token.type == '{');
1881 expression_t *expression = parse_assignment_expression();
1882 mark_vars_read(expression, NULL);
1883 if (must_be_constant && !is_initializer_constant(expression)) {
1884 errorf(&expression->base.source_position,
1885 "Initialisation expression '%E' is not constant",
1889 initializer_t *initializer = initializer_from_expression(type, expression);
1891 if (initializer == NULL) {
1892 errorf(&expression->base.source_position,
1893 "expression '%E' (type '%T') doesn't match expected type '%T'",
1894 expression, expression->base.type, type);
1899 bool additional_warning_displayed = false;
1900 while (braces > 0) {
1901 if (token.type == ',') {
1904 if (token.type != '}') {
1905 if (!additional_warning_displayed && warning.other) {
1906 warningf(HERE, "additional elements in scalar initializer");
1907 additional_warning_displayed = true;
1918 * An entry in the type path.
1920 typedef struct type_path_entry_t type_path_entry_t;
1921 struct type_path_entry_t {
1922 type_t *type; /**< the upper top type. restored to path->top_tye if this entry is popped. */
1924 size_t index; /**< For array types: the current index. */
1925 declaration_t *compound_entry; /**< For compound types: the current declaration. */
1930 * A type path expression a position inside compound or array types.
1932 typedef struct type_path_t type_path_t;
1933 struct type_path_t {
1934 type_path_entry_t *path; /**< An flexible array containing the current path. */
1935 type_t *top_type; /**< type of the element the path points */
1936 size_t max_index; /**< largest index in outermost array */
1940 * Prints a type path for debugging.
1942 static __attribute__((unused)) void debug_print_type_path(
1943 const type_path_t *path)
1945 size_t len = ARR_LEN(path->path);
1947 for (size_t i = 0; i < len; ++i) {
1948 const type_path_entry_t *entry = & path->path[i];
1950 type_t *type = skip_typeref(entry->type);
1951 if (is_type_compound(type)) {
1952 /* in gcc mode structs can have no members */
1953 if (entry->v.compound_entry == NULL) {
1957 fprintf(stderr, ".%s",
1958 entry->v.compound_entry->base.symbol->string);
1959 } else if (is_type_array(type)) {
1960 fprintf(stderr, "[%u]", (unsigned) entry->v.index);
1962 fprintf(stderr, "-INVALID-");
1965 if (path->top_type != NULL) {
1966 fprintf(stderr, " (");
1967 print_type(path->top_type);
1968 fprintf(stderr, ")");
1973 * Return the top type path entry, ie. in a path
1974 * (type).a.b returns the b.
1976 static type_path_entry_t *get_type_path_top(const type_path_t *path)
1978 size_t len = ARR_LEN(path->path);
1980 return &path->path[len-1];
1984 * Enlarge the type path by an (empty) element.
1986 static type_path_entry_t *append_to_type_path(type_path_t *path)
1988 size_t len = ARR_LEN(path->path);
1989 ARR_RESIZE(type_path_entry_t, path->path, len+1);
1991 type_path_entry_t *result = & path->path[len];
1992 memset(result, 0, sizeof(result[0]));
1997 * Descending into a sub-type. Enter the scope of the current top_type.
1999 static void descend_into_subtype(type_path_t *path)
2001 type_t *orig_top_type = path->top_type;
2002 type_t *top_type = skip_typeref(orig_top_type);
2004 type_path_entry_t *top = append_to_type_path(path);
2005 top->type = top_type;
2007 if (is_type_compound(top_type)) {
2008 compound_t *compound = top_type->compound.compound;
2009 entity_t *entry = compound->members.entities;
2011 if (entry != NULL) {
2012 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
2013 top->v.compound_entry = &entry->declaration;
2014 path->top_type = entry->declaration.type;
2016 path->top_type = NULL;
2018 } else if (is_type_array(top_type)) {
2020 path->top_type = top_type->array.element_type;
2022 assert(!is_type_valid(top_type));
2027 * Pop an entry from the given type path, ie. returning from
2028 * (type).a.b to (type).a
2030 static void ascend_from_subtype(type_path_t *path)
2032 type_path_entry_t *top = get_type_path_top(path);
2034 path->top_type = top->type;
2036 size_t len = ARR_LEN(path->path);
2037 ARR_RESIZE(type_path_entry_t, path->path, len-1);
2041 * Pop entries from the given type path until the given
2042 * path level is reached.
2044 static void ascend_to(type_path_t *path, size_t top_path_level)
2046 size_t len = ARR_LEN(path->path);
2048 while (len > top_path_level) {
2049 ascend_from_subtype(path);
2050 len = ARR_LEN(path->path);
2054 static bool walk_designator(type_path_t *path, const designator_t *designator,
2055 bool used_in_offsetof)
2057 for (; designator != NULL; designator = designator->next) {
2058 type_path_entry_t *top = get_type_path_top(path);
2059 type_t *orig_type = top->type;
2061 type_t *type = skip_typeref(orig_type);
2063 if (designator->symbol != NULL) {
2064 symbol_t *symbol = designator->symbol;
2065 if (!is_type_compound(type)) {
2066 if (is_type_valid(type)) {
2067 errorf(&designator->source_position,
2068 "'.%Y' designator used for non-compound type '%T'",
2072 top->type = type_error_type;
2073 top->v.compound_entry = NULL;
2074 orig_type = type_error_type;
2076 compound_t *compound = type->compound.compound;
2077 entity_t *iter = compound->members.entities;
2078 for (; iter != NULL; iter = iter->base.next) {
2079 if (iter->base.symbol == symbol) {
2084 errorf(&designator->source_position,
2085 "'%T' has no member named '%Y'", orig_type, symbol);
2088 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
2089 if (used_in_offsetof) {
2090 type_t *real_type = skip_typeref(iter->declaration.type);
2091 if (real_type->kind == TYPE_BITFIELD) {
2092 errorf(&designator->source_position,
2093 "offsetof designator '%Y' may not specify bitfield",
2099 top->type = orig_type;
2100 top->v.compound_entry = &iter->declaration;
2101 orig_type = iter->declaration.type;
2104 expression_t *array_index = designator->array_index;
2105 assert(designator->array_index != NULL);
2107 if (!is_type_array(type)) {
2108 if (is_type_valid(type)) {
2109 errorf(&designator->source_position,
2110 "[%E] designator used for non-array type '%T'",
2111 array_index, orig_type);
2116 long index = fold_constant_to_int(array_index);
2117 if (!used_in_offsetof) {
2119 errorf(&designator->source_position,
2120 "array index [%E] must be positive", array_index);
2121 } else if (type->array.size_constant) {
2122 long array_size = type->array.size;
2123 if (index >= array_size) {
2124 errorf(&designator->source_position,
2125 "designator [%E] (%d) exceeds array size %d",
2126 array_index, index, array_size);
2131 top->type = orig_type;
2132 top->v.index = (size_t) index;
2133 orig_type = type->array.element_type;
2135 path->top_type = orig_type;
2137 if (designator->next != NULL) {
2138 descend_into_subtype(path);
2147 static void advance_current_object(type_path_t *path, size_t top_path_level)
2149 type_path_entry_t *top = get_type_path_top(path);
2151 type_t *type = skip_typeref(top->type);
2152 if (is_type_union(type)) {
2153 /* in unions only the first element is initialized */
2154 top->v.compound_entry = NULL;
2155 } else if (is_type_struct(type)) {
2156 declaration_t *entry = top->v.compound_entry;
2158 entity_t *next_entity = entry->base.next;
2159 if (next_entity != NULL) {
2160 assert(is_declaration(next_entity));
2161 entry = &next_entity->declaration;
2166 top->v.compound_entry = entry;
2167 if (entry != NULL) {
2168 path->top_type = entry->type;
2171 } else if (is_type_array(type)) {
2172 assert(is_type_array(type));
2176 if (!type->array.size_constant || top->v.index < type->array.size) {
2180 assert(!is_type_valid(type));
2184 /* we're past the last member of the current sub-aggregate, try if we
2185 * can ascend in the type hierarchy and continue with another subobject */
2186 size_t len = ARR_LEN(path->path);
2188 if (len > top_path_level) {
2189 ascend_from_subtype(path);
2190 advance_current_object(path, top_path_level);
2192 path->top_type = NULL;
2197 * skip any {...} blocks until a closing bracket is reached.
2199 static void skip_initializers(void)
2201 if (token.type == '{')
2204 while (token.type != '}') {
2205 if (token.type == T_EOF)
2207 if (token.type == '{') {
2215 static initializer_t *create_empty_initializer(void)
2217 static initializer_t empty_initializer
2218 = { .list = { { INITIALIZER_LIST }, 0 } };
2219 return &empty_initializer;
2223 * Parse a part of an initialiser for a struct or union,
2225 static initializer_t *parse_sub_initializer(type_path_t *path,
2226 type_t *outer_type, size_t top_path_level,
2227 parse_initializer_env_t *env)
2229 if (token.type == '}') {
2230 /* empty initializer */
2231 return create_empty_initializer();
2234 type_t *orig_type = path->top_type;
2235 type_t *type = NULL;
2237 if (orig_type == NULL) {
2238 /* We are initializing an empty compound. */
2240 type = skip_typeref(orig_type);
2243 initializer_t **initializers = NEW_ARR_F(initializer_t*, 0);
2246 designator_t *designator = NULL;
2247 if (token.type == '.' || token.type == '[') {
2248 designator = parse_designation();
2249 goto finish_designator;
2250 } else if (token.type == T_IDENTIFIER && look_ahead(1)->type == ':') {
2251 /* GNU-style designator ("identifier: value") */
2252 designator = allocate_ast_zero(sizeof(designator[0]));
2253 designator->source_position = token.source_position;
2254 designator->symbol = token.v.symbol;
2259 /* reset path to toplevel, evaluate designator from there */
2260 ascend_to(path, top_path_level);
2261 if (!walk_designator(path, designator, false)) {
2262 /* can't continue after designation error */
2266 initializer_t *designator_initializer
2267 = allocate_initializer_zero(INITIALIZER_DESIGNATOR);
2268 designator_initializer->designator.designator = designator;
2269 ARR_APP1(initializer_t*, initializers, designator_initializer);
2271 orig_type = path->top_type;
2272 type = orig_type != NULL ? skip_typeref(orig_type) : NULL;
2277 if (token.type == '{') {
2278 if (type != NULL && is_type_scalar(type)) {
2279 sub = parse_scalar_initializer(type, env->must_be_constant);
2283 if (env->entity != NULL) {
2285 "extra brace group at end of initializer for '%Y'",
2286 env->entity->base.symbol);
2288 errorf(HERE, "extra brace group at end of initializer");
2291 descend_into_subtype(path);
2293 add_anchor_token('}');
2294 sub = parse_sub_initializer(path, orig_type, top_path_level+1,
2296 rem_anchor_token('}');
2299 ascend_from_subtype(path);
2300 expect('}', end_error);
2302 expect('}', end_error);
2303 goto error_parse_next;
2307 /* must be an expression */
2308 expression_t *expression = parse_assignment_expression();
2309 mark_vars_read(expression, NULL);
2311 if (env->must_be_constant && !is_initializer_constant(expression)) {
2312 errorf(&expression->base.source_position,
2313 "Initialisation expression '%E' is not constant",
2318 /* we are already outside, ... */
2319 type_t *const outer_type_skip = skip_typeref(outer_type);
2320 if (is_type_compound(outer_type_skip) &&
2321 !outer_type_skip->compound.compound->complete) {
2322 goto error_parse_next;
2327 /* handle { "string" } special case */
2328 if ((expression->kind == EXPR_STRING_LITERAL
2329 || expression->kind == EXPR_WIDE_STRING_LITERAL)
2330 && outer_type != NULL) {
2331 sub = initializer_from_expression(outer_type, expression);
2333 if (token.type == ',') {
2336 if (token.type != '}' && warning.other) {
2337 warningf(HERE, "excessive elements in initializer for type '%T'",
2340 /* TODO: eat , ... */
2345 /* descend into subtypes until expression matches type */
2347 orig_type = path->top_type;
2348 type = skip_typeref(orig_type);
2350 sub = initializer_from_expression(orig_type, expression);
2354 if (!is_type_valid(type)) {
2357 if (is_type_scalar(type)) {
2358 errorf(&expression->base.source_position,
2359 "expression '%E' doesn't match expected type '%T'",
2360 expression, orig_type);
2364 descend_into_subtype(path);
2368 /* update largest index of top array */
2369 const type_path_entry_t *first = &path->path[0];
2370 type_t *first_type = first->type;
2371 first_type = skip_typeref(first_type);
2372 if (is_type_array(first_type)) {
2373 size_t index = first->v.index;
2374 if (index > path->max_index)
2375 path->max_index = index;
2379 /* append to initializers list */
2380 ARR_APP1(initializer_t*, initializers, sub);
2383 if (warning.other) {
2384 if (env->entity != NULL) {
2385 warningf(HERE, "excess elements in struct initializer for '%Y'",
2386 env->entity->base.symbol);
2388 warningf(HERE, "excess elements in struct initializer");
2394 if (token.type == '}') {
2397 expect(',', end_error);
2398 if (token.type == '}') {
2403 /* advance to the next declaration if we are not at the end */
2404 advance_current_object(path, top_path_level);
2405 orig_type = path->top_type;
2406 if (orig_type != NULL)
2407 type = skip_typeref(orig_type);
2413 size_t len = ARR_LEN(initializers);
2414 size_t size = sizeof(initializer_list_t) + len * sizeof(initializers[0]);
2415 initializer_t *result = allocate_ast_zero(size);
2416 result->kind = INITIALIZER_LIST;
2417 result->list.len = len;
2418 memcpy(&result->list.initializers, initializers,
2419 len * sizeof(initializers[0]));
2421 DEL_ARR_F(initializers);
2422 ascend_to(path, top_path_level+1);
2427 skip_initializers();
2428 DEL_ARR_F(initializers);
2429 ascend_to(path, top_path_level+1);
2434 * Parses an initializer. Parsers either a compound literal
2435 * (env->declaration == NULL) or an initializer of a declaration.
2437 static initializer_t *parse_initializer(parse_initializer_env_t *env)
2439 type_t *type = skip_typeref(env->type);
2440 size_t max_index = 0xdeadbeaf; // TODO: Resolve this uninitialized variable problem
2441 initializer_t *result;
2443 if (is_type_scalar(type)) {
2444 result = parse_scalar_initializer(type, env->must_be_constant);
2445 } else if (token.type == '{') {
2449 memset(&path, 0, sizeof(path));
2450 path.top_type = env->type;
2451 path.path = NEW_ARR_F(type_path_entry_t, 0);
2453 descend_into_subtype(&path);
2455 add_anchor_token('}');
2456 result = parse_sub_initializer(&path, env->type, 1, env);
2457 rem_anchor_token('}');
2459 max_index = path.max_index;
2460 DEL_ARR_F(path.path);
2462 expect('}', end_error);
2464 /* parse_scalar_initializer() also works in this case: we simply
2465 * have an expression without {} around it */
2466 result = parse_scalar_initializer(type, env->must_be_constant);
2469 /* §6.7.8:22 array initializers for arrays with unknown size determine
2470 * the array type size */
2471 if (is_type_array(type) && type->array.size_expression == NULL
2472 && result != NULL) {
2474 switch (result->kind) {
2475 case INITIALIZER_LIST:
2476 assert(max_index != 0xdeadbeaf);
2477 size = max_index + 1;
2480 case INITIALIZER_STRING:
2481 size = result->string.string.size;
2484 case INITIALIZER_WIDE_STRING:
2485 size = result->wide_string.string.size;
2488 case INITIALIZER_DESIGNATOR:
2489 case INITIALIZER_VALUE:
2490 /* can happen for parse errors */
2495 internal_errorf(HERE, "invalid initializer type");
2498 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
2499 cnst->base.type = type_size_t;
2500 cnst->conste.v.int_value = size;
2502 type_t *new_type = duplicate_type(type);
2504 new_type->array.size_expression = cnst;
2505 new_type->array.size_constant = true;
2506 new_type->array.has_implicit_size = true;
2507 new_type->array.size = size;
2508 env->type = new_type;
2516 static void append_entity(scope_t *scope, entity_t *entity)
2518 if (scope->last_entity != NULL) {
2519 scope->last_entity->base.next = entity;
2521 scope->entities = entity;
2523 scope->last_entity = entity;
2527 static compound_t *parse_compound_type_specifier(bool is_struct)
2535 symbol_t *symbol = NULL;
2536 compound_t *compound = NULL;
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->base.namespc = NAMESPACE_TAG;
2583 compound->base.source_position = token.source_position;
2584 compound->base.symbol = symbol;
2585 compound->base.parent_scope = current_scope;
2586 if (symbol != NULL) {
2587 environment_push(entity);
2589 append_entity(current_scope, entity);
2592 if (token.type == '{') {
2593 parse_compound_type_entries(compound);
2595 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2596 if (symbol == NULL) {
2597 assert(anonymous_entity == NULL);
2598 anonymous_entity = (entity_t*)compound;
2602 if (attributes != NULL) {
2603 handle_entity_attributes(attributes, (entity_t*) compound);
2609 static void parse_enum_entries(type_t *const enum_type)
2613 if (token.type == '}') {
2614 errorf(HERE, "empty enum not allowed");
2619 add_anchor_token('}');
2621 if (token.type != T_IDENTIFIER) {
2622 parse_error_expected("while parsing enum entry", T_IDENTIFIER, NULL);
2624 rem_anchor_token('}');
2628 entity_t *entity = allocate_entity_zero(ENTITY_ENUM_VALUE);
2629 entity->enum_value.enum_type = enum_type;
2630 entity->base.symbol = token.v.symbol;
2631 entity->base.source_position = token.source_position;
2634 if (token.type == '=') {
2636 expression_t *value = parse_constant_expression();
2638 value = create_implicit_cast(value, enum_type);
2639 entity->enum_value.value = value;
2644 record_entity(entity, false);
2646 if (token.type != ',')
2649 } while (token.type != '}');
2650 rem_anchor_token('}');
2652 expect('}', end_error);
2658 static type_t *parse_enum_specifier(void)
2664 if (token.type == T_IDENTIFIER) {
2665 symbol = token.v.symbol;
2668 entity = get_tag(symbol, ENTITY_ENUM);
2669 if (entity != NULL) {
2670 if (entity->base.parent_scope != current_scope &&
2671 (token.type == '{' || token.type == ';')) {
2672 /* we're in an inner scope and have a definition. Shadow
2673 * existing definition in outer scope */
2675 } else if (entity->enume.complete && token.type == '{') {
2676 errorf(HERE, "multiple definitions of 'enum %Y' (previous definition %P)",
2677 symbol, &entity->base.source_position);
2680 } else if (token.type != '{') {
2681 parse_error_expected("while parsing enum type specifier",
2682 T_IDENTIFIER, '{', NULL);
2689 if (entity == NULL) {
2690 entity = allocate_entity_zero(ENTITY_ENUM);
2691 entity->base.namespc = NAMESPACE_TAG;
2692 entity->base.source_position = token.source_position;
2693 entity->base.symbol = symbol;
2694 entity->base.parent_scope = current_scope;
2697 type_t *const type = allocate_type_zero(TYPE_ENUM);
2698 type->enumt.enume = &entity->enume;
2699 type->enumt.akind = ATOMIC_TYPE_INT;
2701 if (token.type == '{') {
2702 if (symbol != NULL) {
2703 environment_push(entity);
2705 append_entity(current_scope, entity);
2706 entity->enume.complete = true;
2708 parse_enum_entries(type);
2709 parse_attributes(NULL);
2711 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2712 if (symbol == NULL) {
2713 assert(anonymous_entity == NULL);
2714 anonymous_entity = entity;
2716 } else if (!entity->enume.complete && !(c_mode & _GNUC)) {
2717 errorf(HERE, "'enum %Y' used before definition (incomplete enums are a GNU extension)",
2725 * if a symbol is a typedef to another type, return true
2727 static bool is_typedef_symbol(symbol_t *symbol)
2729 const entity_t *const entity = get_entity(symbol, NAMESPACE_NORMAL);
2730 return entity != NULL && entity->kind == ENTITY_TYPEDEF;
2733 static type_t *parse_typeof(void)
2739 expect('(', end_error);
2740 add_anchor_token(')');
2742 expression_t *expression = NULL;
2744 bool old_type_prop = in_type_prop;
2745 bool old_gcc_extension = in_gcc_extension;
2746 in_type_prop = true;
2748 while (token.type == T___extension__) {
2749 /* This can be a prefix to a typename or an expression. */
2751 in_gcc_extension = true;
2753 switch (token.type) {
2755 if (is_typedef_symbol(token.v.symbol)) {
2756 type = parse_typename();
2758 expression = parse_expression();
2759 type = revert_automatic_type_conversion(expression);
2764 type = parse_typename();
2768 expression = parse_expression();
2769 type = expression->base.type;
2772 in_type_prop = old_type_prop;
2773 in_gcc_extension = old_gcc_extension;
2775 rem_anchor_token(')');
2776 expect(')', end_error);
2778 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF);
2779 typeof_type->typeoft.expression = expression;
2780 typeof_type->typeoft.typeof_type = type;
2787 typedef enum specifiers_t {
2788 SPECIFIER_SIGNED = 1 << 0,
2789 SPECIFIER_UNSIGNED = 1 << 1,
2790 SPECIFIER_LONG = 1 << 2,
2791 SPECIFIER_INT = 1 << 3,
2792 SPECIFIER_DOUBLE = 1 << 4,
2793 SPECIFIER_CHAR = 1 << 5,
2794 SPECIFIER_WCHAR_T = 1 << 6,
2795 SPECIFIER_SHORT = 1 << 7,
2796 SPECIFIER_LONG_LONG = 1 << 8,
2797 SPECIFIER_FLOAT = 1 << 9,
2798 SPECIFIER_BOOL = 1 << 10,
2799 SPECIFIER_VOID = 1 << 11,
2800 SPECIFIER_INT8 = 1 << 12,
2801 SPECIFIER_INT16 = 1 << 13,
2802 SPECIFIER_INT32 = 1 << 14,
2803 SPECIFIER_INT64 = 1 << 15,
2804 SPECIFIER_INT128 = 1 << 16,
2805 SPECIFIER_COMPLEX = 1 << 17,
2806 SPECIFIER_IMAGINARY = 1 << 18,
2809 static type_t *create_builtin_type(symbol_t *const symbol,
2810 type_t *const real_type)
2812 type_t *type = allocate_type_zero(TYPE_BUILTIN);
2813 type->builtin.symbol = symbol;
2814 type->builtin.real_type = real_type;
2815 return identify_new_type(type);
2818 static type_t *get_typedef_type(symbol_t *symbol)
2820 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
2821 if (entity == NULL || entity->kind != ENTITY_TYPEDEF)
2824 type_t *type = allocate_type_zero(TYPE_TYPEDEF);
2825 type->typedeft.typedefe = &entity->typedefe;
2830 static attribute_t *parse_attribute_ms_property(attribute_t *attribute)
2832 expect('(', end_error);
2834 attribute_property_argument_t *property
2835 = allocate_ast_zero(sizeof(*property));
2838 if (token.type != T_IDENTIFIER) {
2839 parse_error_expected("while parsing property declspec",
2840 T_IDENTIFIER, NULL);
2845 symbol_t *symbol = token.v.symbol;
2847 if (strcmp(symbol->string, "put") == 0) {
2849 } else if (strcmp(symbol->string, "get") == 0) {
2852 errorf(HERE, "expected put or get in property declspec");
2855 expect('=', end_error);
2856 if (token.type != T_IDENTIFIER) {
2857 parse_error_expected("while parsing property declspec",
2858 T_IDENTIFIER, NULL);
2862 property->put_symbol = token.v.symbol;
2864 property->get_symbol = token.v.symbol;
2867 if (token.type == ')')
2869 expect(',', end_error);
2872 attribute->a.property = property;
2874 expect(')', end_error);
2880 static attribute_t *parse_microsoft_extended_decl_modifier_single(void)
2882 attribute_kind_t kind = ATTRIBUTE_UNKNOWN;
2883 if (token.type == T_restrict) {
2884 kind = ATTRIBUTE_MS_RESTRICT;
2886 } else if (token.type == T_IDENTIFIER) {
2887 const char *name = token.v.symbol->string;
2889 for (attribute_kind_t k = ATTRIBUTE_MS_FIRST; k <= ATTRIBUTE_MS_LAST;
2891 const char *attribute_name = get_attribute_name(k);
2892 if (attribute_name != NULL && strcmp(attribute_name, name) == 0) {
2898 if (kind == ATTRIBUTE_UNKNOWN && warning.attribute) {
2899 warningf(HERE, "unknown __declspec '%s' ignored", name);
2902 parse_error_expected("while parsing __declspec", T_IDENTIFIER, NULL);
2906 attribute_t *attribute = allocate_attribute_zero(kind);
2908 if (kind == ATTRIBUTE_MS_PROPERTY) {
2909 return parse_attribute_ms_property(attribute);
2912 /* parse arguments */
2913 if (token.type == '(') {
2915 attribute->a.arguments = parse_attribute_arguments();
2921 static attribute_t *parse_microsoft_extended_decl_modifier(attribute_t *first)
2925 expect('(', end_error);
2927 if (token.type == ')') {
2932 add_anchor_token(')');
2934 attribute_t *last = first;
2937 while (last->next != NULL)
2941 attribute_t *attribute
2942 = parse_microsoft_extended_decl_modifier_single();
2943 if (attribute == NULL)
2949 last->next = attribute;
2953 if (token.type == ')') {
2956 expect(',', end_error);
2959 rem_anchor_token(')');
2960 expect(')', end_error);
2964 rem_anchor_token(')');
2968 static entity_t *create_error_entity(symbol_t *symbol, entity_kind_tag_t kind)
2970 entity_t *entity = allocate_entity_zero(kind);
2971 entity->base.source_position = *HERE;
2972 entity->base.symbol = symbol;
2973 if (is_declaration(entity)) {
2974 entity->declaration.type = type_error_type;
2975 entity->declaration.implicit = true;
2976 } else if (kind == ENTITY_TYPEDEF) {
2977 entity->typedefe.type = type_error_type;
2978 entity->typedefe.builtin = true;
2980 if (kind != ENTITY_COMPOUND_MEMBER)
2981 record_entity(entity, false);
2985 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
2987 type_t *type = NULL;
2988 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
2989 unsigned type_specifiers = 0;
2990 bool newtype = false;
2991 bool saw_error = false;
2992 bool old_gcc_extension = in_gcc_extension;
2994 specifiers->source_position = token.source_position;
2997 specifiers->attributes = parse_attributes(specifiers->attributes);
2999 switch (token.type) {
3001 #define MATCH_STORAGE_CLASS(token, class) \
3003 if (specifiers->storage_class != STORAGE_CLASS_NONE) { \
3004 errorf(HERE, "multiple storage classes in declaration specifiers"); \
3006 specifiers->storage_class = class; \
3007 if (specifiers->thread_local) \
3008 goto check_thread_storage_class; \
3012 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
3013 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
3014 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
3015 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
3016 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
3019 specifiers->attributes
3020 = parse_microsoft_extended_decl_modifier(specifiers->attributes);
3024 if (specifiers->thread_local) {
3025 errorf(HERE, "duplicate '__thread'");
3027 specifiers->thread_local = true;
3028 check_thread_storage_class:
3029 switch (specifiers->storage_class) {
3030 case STORAGE_CLASS_EXTERN:
3031 case STORAGE_CLASS_NONE:
3032 case STORAGE_CLASS_STATIC:
3036 case STORAGE_CLASS_AUTO: wrong = "auto"; goto wrong_thread_stoarge_class;
3037 case STORAGE_CLASS_REGISTER: wrong = "register"; goto wrong_thread_stoarge_class;
3038 case STORAGE_CLASS_TYPEDEF: wrong = "typedef"; goto wrong_thread_stoarge_class;
3039 wrong_thread_stoarge_class:
3040 errorf(HERE, "'__thread' used with '%s'", wrong);
3047 /* type qualifiers */
3048 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
3050 qualifiers |= qualifier; \
3054 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3055 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3056 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3057 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3058 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3059 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3060 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3061 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3063 case T___extension__:
3065 in_gcc_extension = true;
3068 /* type specifiers */
3069 #define MATCH_SPECIFIER(token, specifier, name) \
3071 if (type_specifiers & specifier) { \
3072 errorf(HERE, "multiple " name " type specifiers given"); \
3074 type_specifiers |= specifier; \
3079 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
3080 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
3081 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
3082 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
3083 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
3084 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
3085 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
3086 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
3087 MATCH_SPECIFIER(T_bool, SPECIFIER_BOOL, "bool");
3088 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
3089 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
3090 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
3091 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
3092 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
3093 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
3094 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
3095 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
3096 MATCH_SPECIFIER(T_wchar_t, SPECIFIER_WCHAR_T, "wchar_t");
3100 specifiers->is_inline = true;
3104 case T__forceinline:
3106 specifiers->modifiers |= DM_FORCEINLINE;
3111 if (type_specifiers & SPECIFIER_LONG_LONG) {
3112 errorf(HERE, "multiple type specifiers given");
3113 } else if (type_specifiers & SPECIFIER_LONG) {
3114 type_specifiers |= SPECIFIER_LONG_LONG;
3116 type_specifiers |= SPECIFIER_LONG;
3121 #define CHECK_DOUBLE_TYPE() \
3122 if ( type != NULL) \
3123 errorf(HERE, "multiple data types in declaration specifiers");
3126 CHECK_DOUBLE_TYPE();
3127 type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
3129 type->compound.compound = parse_compound_type_specifier(true);
3132 CHECK_DOUBLE_TYPE();
3133 type = allocate_type_zero(TYPE_COMPOUND_UNION);
3134 type->compound.compound = parse_compound_type_specifier(false);
3137 CHECK_DOUBLE_TYPE();
3138 type = parse_enum_specifier();
3141 CHECK_DOUBLE_TYPE();
3142 type = parse_typeof();
3144 case T___builtin_va_list:
3145 CHECK_DOUBLE_TYPE();
3146 type = duplicate_type(type_valist);
3150 case T_IDENTIFIER: {
3151 /* only parse identifier if we haven't found a type yet */
3152 if (type != NULL || type_specifiers != 0) {
3153 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
3154 * declaration, so it doesn't generate errors about expecting '(' or
3156 switch (look_ahead(1)->type) {
3163 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
3167 errorf(HERE, "discarding stray %K in declaration specifier", &token);
3172 goto finish_specifiers;
3176 type_t *const typedef_type = get_typedef_type(token.v.symbol);
3177 if (typedef_type == NULL) {
3178 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
3179 * declaration, so it doesn't generate 'implicit int' followed by more
3180 * errors later on. */
3181 token_type_t const la1_type = (token_type_t)look_ahead(1)->type;
3187 errorf(HERE, "%K does not name a type", &token);
3190 create_error_entity(token.v.symbol, ENTITY_TYPEDEF);
3192 type = allocate_type_zero(TYPE_TYPEDEF);
3193 type->typedeft.typedefe = &entity->typedefe;
3197 if (la1_type == '&' || la1_type == '*')
3198 goto finish_specifiers;
3203 goto finish_specifiers;
3208 type = typedef_type;
3212 /* function specifier */
3214 goto finish_specifiers;
3219 specifiers->attributes = parse_attributes(specifiers->attributes);
3221 in_gcc_extension = old_gcc_extension;
3223 if (type == NULL || (saw_error && type_specifiers != 0)) {
3224 atomic_type_kind_t atomic_type;
3226 /* match valid basic types */
3227 switch (type_specifiers) {
3228 case SPECIFIER_VOID:
3229 atomic_type = ATOMIC_TYPE_VOID;
3231 case SPECIFIER_WCHAR_T:
3232 atomic_type = ATOMIC_TYPE_WCHAR_T;
3234 case SPECIFIER_CHAR:
3235 atomic_type = ATOMIC_TYPE_CHAR;
3237 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
3238 atomic_type = ATOMIC_TYPE_SCHAR;
3240 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
3241 atomic_type = ATOMIC_TYPE_UCHAR;
3243 case SPECIFIER_SHORT:
3244 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
3245 case SPECIFIER_SHORT | SPECIFIER_INT:
3246 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3247 atomic_type = ATOMIC_TYPE_SHORT;
3249 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
3250 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3251 atomic_type = ATOMIC_TYPE_USHORT;
3254 case SPECIFIER_SIGNED:
3255 case SPECIFIER_SIGNED | SPECIFIER_INT:
3256 atomic_type = ATOMIC_TYPE_INT;
3258 case SPECIFIER_UNSIGNED:
3259 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
3260 atomic_type = ATOMIC_TYPE_UINT;
3262 case SPECIFIER_LONG:
3263 case SPECIFIER_SIGNED | SPECIFIER_LONG:
3264 case SPECIFIER_LONG | SPECIFIER_INT:
3265 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3266 atomic_type = ATOMIC_TYPE_LONG;
3268 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
3269 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3270 atomic_type = ATOMIC_TYPE_ULONG;
3273 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3274 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3275 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
3276 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3278 atomic_type = ATOMIC_TYPE_LONGLONG;
3279 goto warn_about_long_long;
3281 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3282 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3284 atomic_type = ATOMIC_TYPE_ULONGLONG;
3285 warn_about_long_long:
3286 if (warning.long_long) {
3287 warningf(&specifiers->source_position,
3288 "ISO C90 does not support 'long long'");
3292 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
3293 atomic_type = unsigned_int8_type_kind;
3296 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
3297 atomic_type = unsigned_int16_type_kind;
3300 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
3301 atomic_type = unsigned_int32_type_kind;
3304 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
3305 atomic_type = unsigned_int64_type_kind;
3308 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
3309 atomic_type = unsigned_int128_type_kind;
3312 case SPECIFIER_INT8:
3313 case SPECIFIER_SIGNED | SPECIFIER_INT8:
3314 atomic_type = int8_type_kind;
3317 case SPECIFIER_INT16:
3318 case SPECIFIER_SIGNED | SPECIFIER_INT16:
3319 atomic_type = int16_type_kind;
3322 case SPECIFIER_INT32:
3323 case SPECIFIER_SIGNED | SPECIFIER_INT32:
3324 atomic_type = int32_type_kind;
3327 case SPECIFIER_INT64:
3328 case SPECIFIER_SIGNED | SPECIFIER_INT64:
3329 atomic_type = int64_type_kind;
3332 case SPECIFIER_INT128:
3333 case SPECIFIER_SIGNED | SPECIFIER_INT128:
3334 atomic_type = int128_type_kind;
3337 case SPECIFIER_FLOAT:
3338 atomic_type = ATOMIC_TYPE_FLOAT;
3340 case SPECIFIER_DOUBLE:
3341 atomic_type = ATOMIC_TYPE_DOUBLE;
3343 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
3344 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3346 case SPECIFIER_BOOL:
3347 atomic_type = ATOMIC_TYPE_BOOL;
3349 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
3350 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
3351 atomic_type = ATOMIC_TYPE_FLOAT;
3353 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3354 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3355 atomic_type = ATOMIC_TYPE_DOUBLE;
3357 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3358 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3359 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3362 /* invalid specifier combination, give an error message */
3363 if (type_specifiers == 0) {
3367 /* ISO/IEC 14882:1998(E) §C.1.5:4 */
3368 if (!(c_mode & _CXX) && !strict_mode) {
3369 if (warning.implicit_int) {
3370 warningf(HERE, "no type specifiers in declaration, using 'int'");
3372 atomic_type = ATOMIC_TYPE_INT;
3375 errorf(HERE, "no type specifiers given in declaration");
3377 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
3378 (type_specifiers & SPECIFIER_UNSIGNED)) {
3379 errorf(HERE, "signed and unsigned specifiers given");
3380 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3381 errorf(HERE, "only integer types can be signed or unsigned");
3383 errorf(HERE, "multiple datatypes in declaration");
3388 if (type_specifiers & SPECIFIER_COMPLEX) {
3389 type = allocate_type_zero(TYPE_COMPLEX);
3390 type->complex.akind = atomic_type;
3391 } else if (type_specifiers & SPECIFIER_IMAGINARY) {
3392 type = allocate_type_zero(TYPE_IMAGINARY);
3393 type->imaginary.akind = atomic_type;
3395 type = allocate_type_zero(TYPE_ATOMIC);
3396 type->atomic.akind = atomic_type;
3399 } else if (type_specifiers != 0) {
3400 errorf(HERE, "multiple datatypes in declaration");
3403 /* FIXME: check type qualifiers here */
3404 type->base.qualifiers = qualifiers;
3407 type = identify_new_type(type);
3409 type = typehash_insert(type);
3412 if (specifiers->attributes != NULL)
3413 type = handle_type_attributes(specifiers->attributes, type);
3414 specifiers->type = type;
3418 specifiers->type = type_error_type;
3422 static type_qualifiers_t parse_type_qualifiers(void)
3424 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3427 switch (token.type) {
3428 /* type qualifiers */
3429 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3430 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3431 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3432 /* microsoft extended type modifiers */
3433 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3434 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3435 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3436 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3437 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3446 * Parses an K&R identifier list
3448 static void parse_identifier_list(scope_t *scope)
3451 entity_t *entity = allocate_entity_zero(ENTITY_PARAMETER);
3452 entity->base.source_position = token.source_position;
3453 entity->base.namespc = NAMESPACE_NORMAL;
3454 entity->base.symbol = token.v.symbol;
3455 /* a K&R parameter has no type, yet */
3459 append_entity(scope, entity);
3461 if (token.type != ',') {
3465 } while (token.type == T_IDENTIFIER);
3468 static entity_t *parse_parameter(void)
3470 declaration_specifiers_t specifiers;
3471 memset(&specifiers, 0, sizeof(specifiers));
3473 parse_declaration_specifiers(&specifiers);
3475 entity_t *entity = parse_declarator(&specifiers,
3476 DECL_MAY_BE_ABSTRACT | DECL_IS_PARAMETER);
3477 anonymous_entity = NULL;
3481 static void semantic_parameter_incomplete(const entity_t *entity)
3483 assert(entity->kind == ENTITY_PARAMETER);
3485 /* §6.7.5.3:4 After adjustment, the parameters in a parameter type
3486 * list in a function declarator that is part of a
3487 * definition of that function shall not have
3488 * incomplete type. */
3489 type_t *type = skip_typeref(entity->declaration.type);
3490 if (is_type_incomplete(type)) {
3491 errorf(&entity->base.source_position,
3492 "parameter '%#T' has incomplete type",
3493 entity->declaration.type, entity->base.symbol);
3497 static bool has_parameters(void)
3499 /* func(void) is not a parameter */
3500 if (token.type == T_IDENTIFIER) {
3501 entity_t const *const entity = get_entity(token.v.symbol, NAMESPACE_NORMAL);
3504 if (entity->kind != ENTITY_TYPEDEF)
3506 if (skip_typeref(entity->typedefe.type) != type_void)
3508 } else if (token.type != T_void) {
3511 if (look_ahead(1)->type != ')')
3518 * Parses function type parameters (and optionally creates variable_t entities
3519 * for them in a scope)
3521 static void parse_parameters(function_type_t *type, scope_t *scope)
3524 add_anchor_token(')');
3525 int saved_comma_state = save_and_reset_anchor_state(',');
3527 if (token.type == T_IDENTIFIER &&
3528 !is_typedef_symbol(token.v.symbol)) {
3529 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
3530 if (la1_type == ',' || la1_type == ')') {
3531 type->kr_style_parameters = true;
3532 type->unspecified_parameters = true;
3533 parse_identifier_list(scope);
3534 goto parameters_finished;
3538 if (token.type == ')') {
3539 /* ISO/IEC 14882:1998(E) §C.1.6:1 */
3540 if (!(c_mode & _CXX))
3541 type->unspecified_parameters = true;
3542 goto parameters_finished;
3545 if (has_parameters()) {
3546 function_parameter_t **anchor = &type->parameters;
3548 switch (token.type) {
3551 type->variadic = true;
3552 goto parameters_finished;
3555 case T___extension__:
3558 entity_t *entity = parse_parameter();
3559 if (entity->kind == ENTITY_TYPEDEF) {
3560 errorf(&entity->base.source_position,
3561 "typedef not allowed as function parameter");
3564 assert(is_declaration(entity));
3566 semantic_parameter_incomplete(entity);
3568 function_parameter_t *const parameter =
3569 allocate_parameter(entity->declaration.type);
3571 if (scope != NULL) {
3572 append_entity(scope, entity);
3575 *anchor = parameter;
3576 anchor = ¶meter->next;
3581 goto parameters_finished;
3583 if (token.type != ',') {
3584 goto parameters_finished;
3591 parameters_finished:
3592 rem_anchor_token(')');
3593 expect(')', end_error);
3596 restore_anchor_state(',', saved_comma_state);
3599 typedef enum construct_type_kind_t {
3602 CONSTRUCT_REFERENCE,
3605 } construct_type_kind_t;
3607 typedef union construct_type_t construct_type_t;
3609 typedef struct construct_type_base_t {
3610 construct_type_kind_t kind;
3611 construct_type_t *next;
3612 } construct_type_base_t;
3614 typedef struct parsed_pointer_t {
3615 construct_type_base_t base;
3616 type_qualifiers_t type_qualifiers;
3617 variable_t *base_variable; /**< MS __based extension. */
3620 typedef struct parsed_reference_t {
3621 construct_type_base_t base;
3622 } parsed_reference_t;
3624 typedef struct construct_function_type_t {
3625 construct_type_base_t base;
3626 type_t *function_type;
3627 } construct_function_type_t;
3629 typedef struct parsed_array_t {
3630 construct_type_base_t base;
3631 type_qualifiers_t type_qualifiers;
3637 union construct_type_t {
3638 construct_type_kind_t kind;
3639 construct_type_base_t base;
3640 parsed_pointer_t pointer;
3641 parsed_reference_t reference;
3642 construct_function_type_t function;
3643 parsed_array_t array;
3646 static construct_type_t *parse_pointer_declarator(void)
3650 parsed_pointer_t *pointer = obstack_alloc(&temp_obst, sizeof(pointer[0]));
3651 memset(pointer, 0, sizeof(pointer[0]));
3652 pointer->base.kind = CONSTRUCT_POINTER;
3653 pointer->type_qualifiers = parse_type_qualifiers();
3654 //pointer->base_variable = base_variable;
3656 return (construct_type_t*) pointer;
3659 static construct_type_t *parse_reference_declarator(void)
3663 construct_type_t *cons = obstack_alloc(&temp_obst, sizeof(cons->reference));
3664 parsed_reference_t *reference = &cons->reference;
3665 memset(reference, 0, sizeof(*reference));
3666 cons->kind = CONSTRUCT_REFERENCE;
3671 static construct_type_t *parse_array_declarator(void)
3674 add_anchor_token(']');
3676 construct_type_t *cons = obstack_alloc(&temp_obst, sizeof(cons->array));
3677 parsed_array_t *array = &cons->array;
3678 memset(array, 0, sizeof(*array));
3679 cons->kind = CONSTRUCT_ARRAY;
3681 if (token.type == T_static) {
3682 array->is_static = true;
3686 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
3687 if (type_qualifiers != 0) {
3688 if (token.type == T_static) {
3689 array->is_static = true;
3693 array->type_qualifiers = type_qualifiers;
3695 if (token.type == '*' && look_ahead(1)->type == ']') {
3696 array->is_variable = true;
3698 } else if (token.type != ']') {
3699 expression_t *const size = parse_assignment_expression();
3701 /* §6.7.5.2:1 Array size must have integer type */
3702 type_t *const orig_type = size->base.type;
3703 type_t *const type = skip_typeref(orig_type);
3704 if (!is_type_integer(type) && is_type_valid(type)) {
3705 errorf(&size->base.source_position,
3706 "array size '%E' must have integer type but has type '%T'",
3711 mark_vars_read(size, NULL);
3714 rem_anchor_token(']');
3715 expect(']', end_error);
3721 static construct_type_t *parse_function_declarator(scope_t *scope)
3723 type_t *type = allocate_type_zero(TYPE_FUNCTION);
3724 function_type_t *ftype = &type->function;
3726 ftype->linkage = current_linkage;
3727 ftype->calling_convention = CC_CDECL;
3729 parse_parameters(ftype, scope);
3731 construct_type_t *cons = obstack_alloc(&temp_obst, sizeof(cons->function));
3732 construct_function_type_t *function = &cons->function;
3733 memset(function, 0, sizeof(*function));
3734 cons->kind = CONSTRUCT_FUNCTION;
3735 function->function_type = type;
3740 typedef struct parse_declarator_env_t {
3741 bool may_be_abstract : 1;
3742 bool must_be_abstract : 1;
3743 decl_modifiers_t modifiers;
3745 source_position_t source_position;
3747 attribute_t *attributes;
3748 } parse_declarator_env_t;
3750 static construct_type_t *parse_inner_declarator(parse_declarator_env_t *env)
3752 /* construct a single linked list of construct_type_t's which describe
3753 * how to construct the final declarator type */
3754 construct_type_t *first = NULL;
3755 construct_type_t **anchor = &first;
3757 env->attributes = parse_attributes(env->attributes);
3760 construct_type_t *type;
3761 //variable_t *based = NULL; /* MS __based extension */
3762 switch (token.type) {
3764 if (!(c_mode & _CXX))
3765 errorf(HERE, "references are only available for C++");
3766 type = parse_reference_declarator();
3771 source_position_t const pos = *HERE;
3773 expect('(', end_error);
3774 add_anchor_token(')');
3775 based = parse_microsoft_based();
3776 rem_anchor_token(')');
3777 expect(')', end_error);
3778 if (token.type != '*') {
3779 if (token.type == T__based) {
3780 errorf(&pos, "__based type modifier specified more than once");
3781 } else if (warning.other) {
3783 "__based does not precede a pointer declarator, ignored");
3788 panic("based currently disabled");
3794 type = parse_pointer_declarator();
3798 goto ptr_operator_end;
3802 anchor = &type->base.next;
3804 /* TODO: find out if this is correct */
3805 env->attributes = parse_attributes(env->attributes);
3810 modifiers |= env->modifiers;
3811 env->modifiers = modifiers;
3814 construct_type_t *inner_types = NULL;
3816 switch (token.type) {
3818 if (env->must_be_abstract) {
3819 errorf(HERE, "no identifier expected in typename");
3821 env->symbol = token.v.symbol;
3822 env->source_position = token.source_position;
3827 /* §6.7.6:2 footnote 126: Empty parentheses in a type name are
3828 * interpreted as ``function with no parameter specification'', rather
3829 * than redundant parentheses around the omitted identifier. */
3830 if (look_ahead(1)->type != ')') {
3832 add_anchor_token(')');
3833 inner_types = parse_inner_declarator(env);
3834 if (inner_types != NULL) {
3835 /* All later declarators only modify the return type */
3836 env->must_be_abstract = true;
3838 rem_anchor_token(')');
3839 expect(')', end_error);
3843 if (env->may_be_abstract)
3845 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
3850 construct_type_t **const p = anchor;
3853 construct_type_t *type;
3854 switch (token.type) {
3856 scope_t *scope = NULL;
3857 if (!env->must_be_abstract) {
3858 scope = &env->parameters;
3861 type = parse_function_declarator(scope);
3865 type = parse_array_declarator();
3868 goto declarator_finished;
3871 /* insert in the middle of the list (at p) */
3872 type->base.next = *p;
3875 anchor = &type->base.next;
3878 declarator_finished:
3879 /* append inner_types at the end of the list, we don't to set anchor anymore
3880 * as it's not needed anymore */
3881 *anchor = inner_types;
3888 static type_t *construct_declarator_type(construct_type_t *construct_list, type_t *type)
3890 construct_type_t *iter = construct_list;
3891 for (; iter != NULL; iter = iter->base.next) {
3892 switch (iter->kind) {
3893 case CONSTRUCT_INVALID:
3895 case CONSTRUCT_FUNCTION: {
3896 construct_function_type_t *function = &iter->function;
3897 type_t *function_type = function->function_type;
3899 function_type->function.return_type = type;
3901 type_t *skipped_return_type = skip_typeref(type);
3903 if (is_type_function(skipped_return_type)) {
3904 errorf(HERE, "function returning function is not allowed");
3905 } else if (is_type_array(skipped_return_type)) {
3906 errorf(HERE, "function returning array is not allowed");
3908 if (skipped_return_type->base.qualifiers != 0 && warning.other) {
3910 "type qualifiers in return type of function type are meaningless");
3914 /* The function type was constructed earlier. Freeing it here will
3915 * destroy other types. */
3916 type = typehash_insert(function_type);
3920 case CONSTRUCT_POINTER: {
3921 if (is_type_reference(skip_typeref(type)))
3922 errorf(HERE, "cannot declare a pointer to reference");
3924 parsed_pointer_t *pointer = &iter->pointer;
3925 type = make_based_pointer_type(type, pointer->type_qualifiers, pointer->base_variable);
3929 case CONSTRUCT_REFERENCE:
3930 if (is_type_reference(skip_typeref(type)))
3931 errorf(HERE, "cannot declare a reference to reference");
3933 type = make_reference_type(type);
3936 case CONSTRUCT_ARRAY: {
3937 if (is_type_reference(skip_typeref(type)))
3938 errorf(HERE, "cannot declare an array of references");
3940 parsed_array_t *array = &iter->array;
3941 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
3943 expression_t *size_expression = array->size;
3944 if (size_expression != NULL) {
3946 = create_implicit_cast(size_expression, type_size_t);
3949 array_type->base.qualifiers = array->type_qualifiers;
3950 array_type->array.element_type = type;
3951 array_type->array.is_static = array->is_static;
3952 array_type->array.is_variable = array->is_variable;
3953 array_type->array.size_expression = size_expression;
3955 if (size_expression != NULL) {
3956 if (is_constant_expression(size_expression)) {
3958 = fold_constant_to_int(size_expression);
3959 array_type->array.size = size;
3960 array_type->array.size_constant = true;
3961 /* §6.7.5.2:1 If the expression is a constant expression, it shall
3962 * have a value greater than zero. */
3964 if (size < 0 || !GNU_MODE) {
3965 errorf(&size_expression->base.source_position,
3966 "size of array must be greater than zero");
3967 } else if (warning.other) {
3968 warningf(&size_expression->base.source_position,
3969 "zero length arrays are a GCC extension");
3973 array_type->array.is_vla = true;
3977 type_t *skipped_type = skip_typeref(type);
3979 if (is_type_incomplete(skipped_type)) {
3980 errorf(HERE, "array of incomplete type '%T' is not allowed", type);
3981 } else if (is_type_function(skipped_type)) {
3982 errorf(HERE, "array of functions is not allowed");
3984 type = identify_new_type(array_type);
3988 internal_errorf(HERE, "invalid type construction found");
3994 static type_t *automatic_type_conversion(type_t *orig_type);
3996 static type_t *semantic_parameter(const source_position_t *pos,
3998 const declaration_specifiers_t *specifiers,
4001 /* §6.7.5.3:7 A declaration of a parameter as ``array of type''
4002 * shall be adjusted to ``qualified pointer to type'',
4004 * §6.7.5.3:8 A declaration of a parameter as ``function returning
4005 * type'' shall be adjusted to ``pointer to function
4006 * returning type'', as in 6.3.2.1. */
4007 type = automatic_type_conversion(type);
4009 if (specifiers->is_inline && is_type_valid(type)) {
4010 errorf(pos, "parameter '%#T' declared 'inline'", type, symbol);
4013 /* §6.9.1:6 The declarations in the declaration list shall contain
4014 * no storage-class specifier other than register and no
4015 * initializations. */
4016 if (specifiers->thread_local || (
4017 specifiers->storage_class != STORAGE_CLASS_NONE &&
4018 specifiers->storage_class != STORAGE_CLASS_REGISTER)
4020 errorf(pos, "invalid storage class for parameter '%#T'", type, symbol);
4023 /* delay test for incomplete type, because we might have (void)
4024 * which is legal but incomplete... */
4029 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
4030 declarator_flags_t flags)
4032 parse_declarator_env_t env;
4033 memset(&env, 0, sizeof(env));
4034 env.may_be_abstract = (flags & DECL_MAY_BE_ABSTRACT) != 0;
4036 construct_type_t *construct_type = parse_inner_declarator(&env);
4038 construct_declarator_type(construct_type, specifiers->type);
4039 type_t *type = skip_typeref(orig_type);
4041 if (construct_type != NULL) {
4042 obstack_free(&temp_obst, construct_type);
4045 attribute_t *attributes = parse_attributes(env.attributes);
4046 /* append (shared) specifier attribute behind attributes of this
4048 if (attributes != NULL) {
4049 attribute_t *last = attributes;
4050 while (last->next != NULL)
4052 last->next = specifiers->attributes;
4054 attributes = specifiers->attributes;
4058 if (specifiers->storage_class == STORAGE_CLASS_TYPEDEF) {
4059 entity = allocate_entity_zero(ENTITY_TYPEDEF);
4060 entity->base.symbol = env.symbol;
4061 entity->base.source_position = env.source_position;
4062 entity->typedefe.type = orig_type;
4064 if (anonymous_entity != NULL) {
4065 if (is_type_compound(type)) {
4066 assert(anonymous_entity->compound.alias == NULL);
4067 assert(anonymous_entity->kind == ENTITY_STRUCT ||
4068 anonymous_entity->kind == ENTITY_UNION);
4069 anonymous_entity->compound.alias = entity;
4070 anonymous_entity = NULL;
4071 } else if (is_type_enum(type)) {
4072 assert(anonymous_entity->enume.alias == NULL);
4073 assert(anonymous_entity->kind == ENTITY_ENUM);
4074 anonymous_entity->enume.alias = entity;
4075 anonymous_entity = NULL;
4079 /* create a declaration type entity */
4080 if (flags & DECL_CREATE_COMPOUND_MEMBER) {
4081 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER);
4083 if (env.symbol != NULL) {
4084 if (specifiers->is_inline && is_type_valid(type)) {
4085 errorf(&env.source_position,
4086 "compound member '%Y' declared 'inline'", env.symbol);
4089 if (specifiers->thread_local ||
4090 specifiers->storage_class != STORAGE_CLASS_NONE) {
4091 errorf(&env.source_position,
4092 "compound member '%Y' must have no storage class",
4096 } else if (flags & DECL_IS_PARAMETER) {
4097 orig_type = semantic_parameter(&env.source_position, orig_type,
4098 specifiers, env.symbol);
4100 entity = allocate_entity_zero(ENTITY_PARAMETER);
4101 } else if (is_type_function(type)) {
4102 entity = allocate_entity_zero(ENTITY_FUNCTION);
4104 entity->function.is_inline = specifiers->is_inline;
4105 entity->function.parameters = env.parameters;
4107 if (env.symbol != NULL) {
4108 /* this needs fixes for C++ */
4109 bool in_function_scope = current_function != NULL;
4111 if (specifiers->thread_local || (
4112 specifiers->storage_class != STORAGE_CLASS_EXTERN &&
4113 specifiers->storage_class != STORAGE_CLASS_NONE &&
4114 (in_function_scope || specifiers->storage_class != STORAGE_CLASS_STATIC)
4116 errorf(&env.source_position,
4117 "invalid storage class for function '%Y'", env.symbol);
4121 entity = allocate_entity_zero(ENTITY_VARIABLE);
4123 entity->variable.thread_local = specifiers->thread_local;
4125 if (env.symbol != NULL) {
4126 if (specifiers->is_inline && is_type_valid(type)) {
4127 errorf(&env.source_position,
4128 "variable '%Y' declared 'inline'", env.symbol);
4131 bool invalid_storage_class = false;
4132 if (current_scope == file_scope) {
4133 if (specifiers->storage_class != STORAGE_CLASS_EXTERN &&
4134 specifiers->storage_class != STORAGE_CLASS_NONE &&
4135 specifiers->storage_class != STORAGE_CLASS_STATIC) {
4136 invalid_storage_class = true;
4139 if (specifiers->thread_local &&
4140 specifiers->storage_class == STORAGE_CLASS_NONE) {
4141 invalid_storage_class = true;
4144 if (invalid_storage_class) {
4145 errorf(&env.source_position,
4146 "invalid storage class for variable '%Y'", env.symbol);
4151 if (env.symbol != NULL) {
4152 entity->base.symbol = env.symbol;
4153 entity->base.source_position = env.source_position;
4155 entity->base.source_position = specifiers->source_position;
4157 entity->base.namespc = NAMESPACE_NORMAL;
4158 entity->declaration.type = orig_type;
4159 entity->declaration.alignment = get_type_alignment(orig_type);
4160 entity->declaration.modifiers = env.modifiers;
4161 entity->declaration.attributes = attributes;
4163 storage_class_t storage_class = specifiers->storage_class;
4164 entity->declaration.declared_storage_class = storage_class;
4166 if (storage_class == STORAGE_CLASS_NONE && current_scope != file_scope)
4167 storage_class = STORAGE_CLASS_AUTO;
4168 entity->declaration.storage_class = storage_class;
4171 if (attributes != NULL) {
4172 handle_entity_attributes(attributes, entity);
4178 static type_t *parse_abstract_declarator(type_t *base_type)
4180 parse_declarator_env_t env;
4181 memset(&env, 0, sizeof(env));
4182 env.may_be_abstract = true;
4183 env.must_be_abstract = true;
4185 construct_type_t *construct_type = parse_inner_declarator(&env);
4187 type_t *result = construct_declarator_type(construct_type, base_type);
4188 if (construct_type != NULL) {
4189 obstack_free(&temp_obst, construct_type);
4191 result = handle_type_attributes(env.attributes, result);
4197 * Check if the declaration of main is suspicious. main should be a
4198 * function with external linkage, returning int, taking either zero
4199 * arguments, two, or three arguments of appropriate types, ie.
4201 * int main([ int argc, char **argv [, char **env ] ]).
4203 * @param decl the declaration to check
4204 * @param type the function type of the declaration
4206 static void check_type_of_main(const entity_t *entity)
4208 const source_position_t *pos = &entity->base.source_position;
4209 if (entity->kind != ENTITY_FUNCTION) {
4210 warningf(pos, "'main' is not a function");
4214 if (entity->declaration.storage_class == STORAGE_CLASS_STATIC) {
4215 warningf(pos, "'main' is normally a non-static function");
4218 type_t *type = skip_typeref(entity->declaration.type);
4219 assert(is_type_function(type));
4221 function_type_t *func_type = &type->function;
4222 if (!types_compatible(skip_typeref(func_type->return_type), type_int)) {
4223 warningf(pos, "return type of 'main' should be 'int', but is '%T'",
4224 func_type->return_type);
4226 const function_parameter_t *parm = func_type->parameters;
4228 type_t *const first_type = parm->type;
4229 if (!types_compatible(skip_typeref(first_type), type_int)) {
4231 "first argument of 'main' should be 'int', but is '%T'",
4236 type_t *const second_type = parm->type;
4237 if (!types_compatible(skip_typeref(second_type), type_char_ptr_ptr)) {
4238 warningf(pos, "second argument of 'main' should be 'char**', but is '%T'", second_type);
4242 type_t *const third_type = parm->type;
4243 if (!types_compatible(skip_typeref(third_type), type_char_ptr_ptr)) {
4244 warningf(pos, "third argument of 'main' should be 'char**', but is '%T'", third_type);
4248 goto warn_arg_count;
4252 warningf(pos, "'main' takes only zero, two or three arguments");
4258 * Check if a symbol is the equal to "main".
4260 static bool is_sym_main(const symbol_t *const sym)
4262 return strcmp(sym->string, "main") == 0;
4265 static void error_redefined_as_different_kind(const source_position_t *pos,
4266 const entity_t *old, entity_kind_t new_kind)
4268 errorf(pos, "redeclaration of %s '%Y' as %s (declared %P)",
4269 get_entity_kind_name(old->kind), old->base.symbol,
4270 get_entity_kind_name(new_kind), &old->base.source_position);
4273 static bool is_error_entity(entity_t *const ent)
4275 if (is_declaration(ent)) {
4276 return is_type_valid(skip_typeref(ent->declaration.type));
4277 } else if (ent->kind == ENTITY_TYPEDEF) {
4278 return is_type_valid(skip_typeref(ent->typedefe.type));
4284 * record entities for the NAMESPACE_NORMAL, and produce error messages/warnings
4285 * for various problems that occur for multiple definitions
4287 static entity_t *record_entity(entity_t *entity, const bool is_definition)
4289 const symbol_t *const symbol = entity->base.symbol;
4290 const namespace_tag_t namespc = (namespace_tag_t)entity->base.namespc;
4291 const source_position_t *pos = &entity->base.source_position;
4293 /* can happen in error cases */
4297 entity_t *const previous_entity = get_entity(symbol, namespc);
4298 /* pushing the same entity twice will break the stack structure */
4299 assert(previous_entity != entity);
4301 if (entity->kind == ENTITY_FUNCTION) {
4302 type_t *const orig_type = entity->declaration.type;
4303 type_t *const type = skip_typeref(orig_type);
4305 assert(is_type_function(type));
4306 if (type->function.unspecified_parameters &&
4307 warning.strict_prototypes &&
4308 previous_entity == NULL) {
4309 warningf(pos, "function declaration '%#T' is not a prototype",
4313 if (warning.main && current_scope == file_scope
4314 && is_sym_main(symbol)) {
4315 check_type_of_main(entity);
4319 if (is_declaration(entity) &&
4320 warning.nested_externs &&
4321 entity->declaration.storage_class == STORAGE_CLASS_EXTERN &&
4322 current_scope != file_scope) {
4323 warningf(pos, "nested extern declaration of '%#T'",
4324 entity->declaration.type, symbol);
4327 if (previous_entity != NULL) {
4328 if (previous_entity->base.parent_scope == ¤t_function->parameters &&
4329 previous_entity->base.parent_scope->depth + 1 == current_scope->depth) {
4330 assert(previous_entity->kind == ENTITY_PARAMETER);
4332 "declaration '%#T' redeclares the parameter '%#T' (declared %P)",
4333 entity->declaration.type, symbol,
4334 previous_entity->declaration.type, symbol,
4335 &previous_entity->base.source_position);
4339 if (previous_entity->base.parent_scope == current_scope) {
4340 if (previous_entity->kind != entity->kind) {
4341 if (!is_error_entity(previous_entity) && !is_error_entity(entity)) {
4342 error_redefined_as_different_kind(pos, previous_entity,
4347 if (previous_entity->kind == ENTITY_ENUM_VALUE) {
4348 errorf(pos, "redeclaration of enum entry '%Y' (declared %P)",
4349 symbol, &previous_entity->base.source_position);
4352 if (previous_entity->kind == ENTITY_TYPEDEF) {
4353 /* TODO: C++ allows this for exactly the same type */
4354 errorf(pos, "redefinition of typedef '%Y' (declared %P)",
4355 symbol, &previous_entity->base.source_position);
4359 /* at this point we should have only VARIABLES or FUNCTIONS */
4360 assert(is_declaration(previous_entity) && is_declaration(entity));
4362 declaration_t *const prev_decl = &previous_entity->declaration;
4363 declaration_t *const decl = &entity->declaration;
4365 /* can happen for K&R style declarations */
4366 if (prev_decl->type == NULL &&
4367 previous_entity->kind == ENTITY_PARAMETER &&
4368 entity->kind == ENTITY_PARAMETER) {
4369 prev_decl->type = decl->type;
4370 prev_decl->storage_class = decl->storage_class;
4371 prev_decl->declared_storage_class = decl->declared_storage_class;
4372 prev_decl->modifiers = decl->modifiers;
4373 return previous_entity;
4376 type_t *const orig_type = decl->type;
4377 assert(orig_type != NULL);
4378 type_t *const type = skip_typeref(orig_type);
4379 type_t *const prev_type = skip_typeref(prev_decl->type);
4381 if (!types_compatible(type, prev_type)) {
4383 "declaration '%#T' is incompatible with '%#T' (declared %P)",
4384 orig_type, symbol, prev_decl->type, symbol,
4385 &previous_entity->base.source_position);
4387 unsigned old_storage_class = prev_decl->storage_class;
4388 if (warning.redundant_decls &&
4391 !(prev_decl->modifiers & DM_USED) &&
4392 prev_decl->storage_class == STORAGE_CLASS_STATIC) {
4393 warningf(&previous_entity->base.source_position,
4394 "unnecessary static forward declaration for '%#T'",
4395 prev_decl->type, symbol);
4398 storage_class_t new_storage_class = decl->storage_class;
4400 /* pretend no storage class means extern for function
4401 * declarations (except if the previous declaration is neither
4402 * none nor extern) */
4403 if (entity->kind == ENTITY_FUNCTION) {
4404 /* the previous declaration could have unspecified parameters or
4405 * be a typedef, so use the new type */
4406 if (prev_type->function.unspecified_parameters || is_definition)
4407 prev_decl->type = type;
4409 switch (old_storage_class) {
4410 case STORAGE_CLASS_NONE:
4411 old_storage_class = STORAGE_CLASS_EXTERN;
4414 case STORAGE_CLASS_EXTERN:
4415 if (is_definition) {
4416 if (warning.missing_prototypes &&
4417 prev_type->function.unspecified_parameters &&
4418 !is_sym_main(symbol)) {
4419 warningf(pos, "no previous prototype for '%#T'",
4422 } else if (new_storage_class == STORAGE_CLASS_NONE) {
4423 new_storage_class = STORAGE_CLASS_EXTERN;
4430 } else if (is_type_incomplete(prev_type)) {
4431 prev_decl->type = type;
4434 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4435 new_storage_class == STORAGE_CLASS_EXTERN) {
4436 warn_redundant_declaration:
4437 if (!is_definition &&
4438 warning.redundant_decls &&
4439 is_type_valid(prev_type) &&
4440 strcmp(previous_entity->base.source_position.input_name,
4441 "<builtin>") != 0) {
4443 "redundant declaration for '%Y' (declared %P)",
4444 symbol, &previous_entity->base.source_position);
4446 } else if (current_function == NULL) {
4447 if (old_storage_class != STORAGE_CLASS_STATIC &&
4448 new_storage_class == STORAGE_CLASS_STATIC) {
4450 "static declaration of '%Y' follows non-static declaration (declared %P)",
4451 symbol, &previous_entity->base.source_position);
4452 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4453 prev_decl->storage_class = STORAGE_CLASS_NONE;
4454 prev_decl->declared_storage_class = STORAGE_CLASS_NONE;
4456 /* ISO/IEC 14882:1998(E) §C.1.2:1 */
4458 goto error_redeclaration;
4459 goto warn_redundant_declaration;
4461 } else if (is_type_valid(prev_type)) {
4462 if (old_storage_class == new_storage_class) {
4463 error_redeclaration:
4464 errorf(pos, "redeclaration of '%Y' (declared %P)",
4465 symbol, &previous_entity->base.source_position);
4468 "redeclaration of '%Y' with different linkage (declared %P)",
4469 symbol, &previous_entity->base.source_position);
4474 prev_decl->modifiers |= decl->modifiers;
4475 if (entity->kind == ENTITY_FUNCTION) {
4476 previous_entity->function.is_inline |= entity->function.is_inline;
4478 return previous_entity;
4481 if (warning.shadow) {
4482 warningf(pos, "%s '%Y' shadows %s (declared %P)",
4483 get_entity_kind_name(entity->kind), symbol,
4484 get_entity_kind_name(previous_entity->kind),
4485 &previous_entity->base.source_position);
4489 if (entity->kind == ENTITY_FUNCTION) {
4490 if (is_definition &&
4491 entity->declaration.storage_class != STORAGE_CLASS_STATIC) {
4492 if (warning.missing_prototypes && !is_sym_main(symbol)) {
4493 warningf(pos, "no previous prototype for '%#T'",
4494 entity->declaration.type, symbol);
4495 } else if (warning.missing_declarations && !is_sym_main(symbol)) {
4496 warningf(pos, "no previous declaration for '%#T'",
4497 entity->declaration.type, symbol);
4500 } else if (warning.missing_declarations &&
4501 entity->kind == ENTITY_VARIABLE &&
4502 current_scope == file_scope) {
4503 declaration_t *declaration = &entity->declaration;
4504 if (declaration->storage_class == STORAGE_CLASS_NONE) {
4505 warningf(pos, "no previous declaration for '%#T'",
4506 declaration->type, symbol);
4511 assert(entity->base.parent_scope == NULL);
4512 assert(current_scope != NULL);
4514 entity->base.parent_scope = current_scope;
4515 entity->base.namespc = NAMESPACE_NORMAL;
4516 environment_push(entity);
4517 append_entity(current_scope, entity);
4522 static void parser_error_multiple_definition(entity_t *entity,
4523 const source_position_t *source_position)
4525 errorf(source_position, "multiple definition of '%Y' (declared %P)",
4526 entity->base.symbol, &entity->base.source_position);
4529 static bool is_declaration_specifier(const token_t *token,
4530 bool only_specifiers_qualifiers)
4532 switch (token->type) {
4537 return is_typedef_symbol(token->v.symbol);
4539 case T___extension__:
4541 return !only_specifiers_qualifiers;
4548 static void parse_init_declarator_rest(entity_t *entity)
4550 assert(is_declaration(entity));
4551 declaration_t *const declaration = &entity->declaration;
4555 type_t *orig_type = declaration->type;
4556 type_t *type = skip_typeref(orig_type);
4558 if (entity->kind == ENTITY_VARIABLE
4559 && entity->variable.initializer != NULL) {
4560 parser_error_multiple_definition(entity, HERE);
4563 bool must_be_constant = false;
4564 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
4565 entity->base.parent_scope == file_scope) {
4566 must_be_constant = true;
4569 if (is_type_function(type)) {
4570 errorf(&entity->base.source_position,
4571 "function '%#T' is initialized like a variable",
4572 orig_type, entity->base.symbol);
4573 orig_type = type_error_type;
4576 parse_initializer_env_t env;
4577 env.type = orig_type;
4578 env.must_be_constant = must_be_constant;
4579 env.entity = entity;
4580 current_init_decl = entity;
4582 initializer_t *initializer = parse_initializer(&env);
4583 current_init_decl = NULL;
4585 if (entity->kind == ENTITY_VARIABLE) {
4586 /* §6.7.5:22 array initializers for arrays with unknown size
4587 * determine the array type size */
4588 declaration->type = env.type;
4589 entity->variable.initializer = initializer;
4593 /* parse rest of a declaration without any declarator */
4594 static void parse_anonymous_declaration_rest(
4595 const declaration_specifiers_t *specifiers)
4598 anonymous_entity = NULL;
4600 if (warning.other) {
4601 if (specifiers->storage_class != STORAGE_CLASS_NONE ||
4602 specifiers->thread_local) {
4603 warningf(&specifiers->source_position,
4604 "useless storage class in empty declaration");
4607 type_t *type = specifiers->type;
4608 switch (type->kind) {
4609 case TYPE_COMPOUND_STRUCT:
4610 case TYPE_COMPOUND_UNION: {
4611 if (type->compound.compound->base.symbol == NULL) {
4612 warningf(&specifiers->source_position,
4613 "unnamed struct/union that defines no instances");
4622 warningf(&specifiers->source_position, "empty declaration");
4628 static void check_variable_type_complete(entity_t *ent)
4630 if (ent->kind != ENTITY_VARIABLE)
4633 /* §6.7:7 If an identifier for an object is declared with no linkage, the
4634 * type for the object shall be complete [...] */
4635 declaration_t *decl = &ent->declaration;
4636 if (decl->storage_class == STORAGE_CLASS_EXTERN ||
4637 decl->storage_class == STORAGE_CLASS_STATIC)
4640 type_t *const orig_type = decl->type;
4641 type_t *const type = skip_typeref(orig_type);
4642 if (!is_type_incomplete(type))
4645 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
4646 * are given length one. */
4647 if (is_type_array(type) && ent->base.parent_scope == file_scope) {
4648 ARR_APP1(declaration_t*, incomplete_arrays, decl);
4652 errorf(&ent->base.source_position, "variable '%#T' has incomplete type",
4653 orig_type, ent->base.symbol);
4657 static void parse_declaration_rest(entity_t *ndeclaration,
4658 const declaration_specifiers_t *specifiers,
4659 parsed_declaration_func finished_declaration,
4660 declarator_flags_t flags)
4662 add_anchor_token(';');
4663 add_anchor_token(',');
4665 entity_t *entity = finished_declaration(ndeclaration, token.type == '=');
4667 if (token.type == '=') {
4668 parse_init_declarator_rest(entity);
4669 } else if (entity->kind == ENTITY_VARIABLE) {
4670 /* ISO/IEC 14882:1998(E) §8.5.3:3 The initializer can be omitted
4671 * [...] where the extern specifier is explicitly used. */
4672 declaration_t *decl = &entity->declaration;
4673 if (decl->storage_class != STORAGE_CLASS_EXTERN) {
4674 type_t *type = decl->type;
4675 if (is_type_reference(skip_typeref(type))) {
4676 errorf(&entity->base.source_position,
4677 "reference '%#T' must be initialized",
4678 type, entity->base.symbol);
4683 check_variable_type_complete(entity);
4685 if (token.type != ',')
4689 add_anchor_token('=');
4690 ndeclaration = parse_declarator(specifiers, flags);
4691 rem_anchor_token('=');
4693 expect(';', end_error);
4696 anonymous_entity = NULL;
4697 rem_anchor_token(';');
4698 rem_anchor_token(',');
4701 static entity_t *finished_kr_declaration(entity_t *entity, bool is_definition)
4703 symbol_t *symbol = entity->base.symbol;
4704 if (symbol == NULL) {
4705 errorf(HERE, "anonymous declaration not valid as function parameter");
4709 assert(entity->base.namespc == NAMESPACE_NORMAL);
4710 entity_t *previous_entity = get_entity(symbol, NAMESPACE_NORMAL);
4711 if (previous_entity == NULL
4712 || previous_entity->base.parent_scope != current_scope) {
4713 errorf(HERE, "expected declaration of a function parameter, found '%Y'",
4718 if (is_definition) {
4719 errorf(HERE, "parameter '%Y' is initialised", entity->base.symbol);
4722 return record_entity(entity, false);
4725 static void parse_declaration(parsed_declaration_func finished_declaration,
4726 declarator_flags_t flags)
4728 declaration_specifiers_t specifiers;
4729 memset(&specifiers, 0, sizeof(specifiers));
4731 add_anchor_token(';');
4732 parse_declaration_specifiers(&specifiers);
4733 rem_anchor_token(';');
4735 if (token.type == ';') {
4736 parse_anonymous_declaration_rest(&specifiers);
4738 entity_t *entity = parse_declarator(&specifiers, flags);
4739 parse_declaration_rest(entity, &specifiers, finished_declaration, flags);
4744 static type_t *get_default_promoted_type(type_t *orig_type)
4746 type_t *result = orig_type;
4748 type_t *type = skip_typeref(orig_type);
4749 if (is_type_integer(type)) {
4750 result = promote_integer(type);
4751 } else if (is_type_atomic(type, ATOMIC_TYPE_FLOAT)) {
4752 result = type_double;
4758 static void parse_kr_declaration_list(entity_t *entity)
4760 if (entity->kind != ENTITY_FUNCTION)
4763 type_t *type = skip_typeref(entity->declaration.type);
4764 assert(is_type_function(type));
4765 if (!type->function.kr_style_parameters)
4769 add_anchor_token('{');
4771 /* push function parameters */
4772 size_t const top = environment_top();
4773 scope_t *old_scope = scope_push(&entity->function.parameters);
4775 entity_t *parameter = entity->function.parameters.entities;
4776 for ( ; parameter != NULL; parameter = parameter->base.next) {
4777 assert(parameter->base.parent_scope == NULL);
4778 parameter->base.parent_scope = current_scope;
4779 environment_push(parameter);
4782 /* parse declaration list */
4784 switch (token.type) {
4786 case T___extension__:
4787 /* This covers symbols, which are no type, too, and results in
4788 * better error messages. The typical cases are misspelled type
4789 * names and missing includes. */
4791 parse_declaration(finished_kr_declaration, DECL_IS_PARAMETER);
4799 /* pop function parameters */
4800 assert(current_scope == &entity->function.parameters);
4801 scope_pop(old_scope);
4802 environment_pop_to(top);
4804 /* update function type */
4805 type_t *new_type = duplicate_type(type);
4807 function_parameter_t *parameters = NULL;
4808 function_parameter_t **anchor = ¶meters;
4810 parameter = entity->function.parameters.entities;
4811 for (; parameter != NULL; parameter = parameter->base.next) {
4812 if (parameter->kind != ENTITY_PARAMETER)
4815 type_t *parameter_type = parameter->declaration.type;
4816 if (parameter_type == NULL) {
4818 errorf(HERE, "no type specified for function parameter '%Y'",
4819 parameter->base.symbol);
4820 parameter_type = type_error_type;
4822 if (warning.implicit_int) {
4823 warningf(HERE, "no type specified for function parameter '%Y', using 'int'",
4824 parameter->base.symbol);
4826 parameter_type = type_int;
4828 parameter->declaration.type = parameter_type;
4831 semantic_parameter_incomplete(parameter);
4834 * we need the default promoted types for the function type
4836 parameter_type = get_default_promoted_type(parameter_type);
4838 function_parameter_t *const parameter =
4839 allocate_parameter(parameter_type);
4841 *anchor = parameter;
4842 anchor = ¶meter->next;
4845 /* §6.9.1.7: A K&R style parameter list does NOT act as a function
4847 new_type->function.parameters = parameters;
4848 new_type->function.unspecified_parameters = true;
4850 new_type = identify_new_type(new_type);
4852 entity->declaration.type = new_type;
4854 rem_anchor_token('{');
4857 static bool first_err = true;
4860 * When called with first_err set, prints the name of the current function,
4863 static void print_in_function(void)
4867 diagnosticf("%s: In function '%Y':\n",
4868 current_function->base.base.source_position.input_name,
4869 current_function->base.base.symbol);
4874 * Check if all labels are defined in the current function.
4875 * Check if all labels are used in the current function.
4877 static void check_labels(void)
4879 for (const goto_statement_t *goto_statement = goto_first;
4880 goto_statement != NULL;
4881 goto_statement = goto_statement->next) {
4882 /* skip computed gotos */
4883 if (goto_statement->expression != NULL)
4886 label_t *label = goto_statement->label;
4889 if (label->base.source_position.input_name == NULL) {
4890 print_in_function();
4891 errorf(&goto_statement->base.source_position,
4892 "label '%Y' used but not defined", label->base.symbol);
4896 if (warning.unused_label) {
4897 for (const label_statement_t *label_statement = label_first;
4898 label_statement != NULL;
4899 label_statement = label_statement->next) {
4900 label_t *label = label_statement->label;
4902 if (! label->used) {
4903 print_in_function();
4904 warningf(&label_statement->base.source_position,
4905 "label '%Y' defined but not used", label->base.symbol);
4911 static void warn_unused_entity(entity_t *entity, entity_t *last)
4913 entity_t const *const end = last != NULL ? last->base.next : NULL;
4914 for (; entity != end; entity = entity->base.next) {
4915 if (!is_declaration(entity))
4918 declaration_t *declaration = &entity->declaration;
4919 if (declaration->implicit)
4922 if (!declaration->used) {
4923 print_in_function();
4924 const char *what = get_entity_kind_name(entity->kind);
4925 warningf(&entity->base.source_position, "%s '%Y' is unused",
4926 what, entity->base.symbol);
4927 } else if (entity->kind == ENTITY_VARIABLE && !entity->variable.read) {
4928 print_in_function();
4929 const char *what = get_entity_kind_name(entity->kind);
4930 warningf(&entity->base.source_position, "%s '%Y' is never read",
4931 what, entity->base.symbol);
4936 static void check_unused_variables(statement_t *const stmt, void *const env)
4940 switch (stmt->kind) {
4941 case STATEMENT_DECLARATION: {
4942 declaration_statement_t const *const decls = &stmt->declaration;
4943 warn_unused_entity(decls->declarations_begin,
4944 decls->declarations_end);
4949 warn_unused_entity(stmt->fors.scope.entities, NULL);
4958 * Check declarations of current_function for unused entities.
4960 static void check_declarations(void)
4962 if (warning.unused_parameter) {
4963 const scope_t *scope = ¤t_function->parameters;
4965 /* do not issue unused warnings for main */
4966 if (!is_sym_main(current_function->base.base.symbol)) {
4967 warn_unused_entity(scope->entities, NULL);
4970 if (warning.unused_variable) {
4971 walk_statements(current_function->statement, check_unused_variables,
4976 static int determine_truth(expression_t const* const cond)
4979 !is_constant_expression(cond) ? 0 :
4980 fold_constant_to_bool(cond) ? 1 :
4984 static void check_reachable(statement_t *);
4985 static bool reaches_end;
4987 static bool expression_returns(expression_t const *const expr)
4989 switch (expr->kind) {
4991 expression_t const *const func = expr->call.function;
4992 if (func->kind == EXPR_REFERENCE) {
4993 entity_t *entity = func->reference.entity;
4994 if (entity->kind == ENTITY_FUNCTION
4995 && entity->declaration.modifiers & DM_NORETURN)
4999 if (!expression_returns(func))
5002 for (call_argument_t const* arg = expr->call.arguments; arg != NULL; arg = arg->next) {
5003 if (!expression_returns(arg->expression))
5010 case EXPR_REFERENCE:
5011 case EXPR_REFERENCE_ENUM_VALUE:
5013 case EXPR_CHARACTER_CONSTANT:
5014 case EXPR_WIDE_CHARACTER_CONSTANT:
5015 case EXPR_STRING_LITERAL:
5016 case EXPR_WIDE_STRING_LITERAL:
5017 case EXPR_COMPOUND_LITERAL: // TODO descend into initialisers
5018 case EXPR_LABEL_ADDRESS:
5019 case EXPR_CLASSIFY_TYPE:
5020 case EXPR_SIZEOF: // TODO handle obscure VLA case
5023 case EXPR_BUILTIN_CONSTANT_P:
5024 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
5029 case EXPR_STATEMENT: {
5030 bool old_reaches_end = reaches_end;
5031 reaches_end = false;
5032 check_reachable(expr->statement.statement);
5033 bool returns = reaches_end;
5034 reaches_end = old_reaches_end;
5038 case EXPR_CONDITIONAL:
5039 // TODO handle constant expression
5041 if (!expression_returns(expr->conditional.condition))
5044 if (expr->conditional.true_expression != NULL
5045 && expression_returns(expr->conditional.true_expression))
5048 return expression_returns(expr->conditional.false_expression);
5051 return expression_returns(expr->select.compound);
5053 case EXPR_ARRAY_ACCESS:
5055 expression_returns(expr->array_access.array_ref) &&
5056 expression_returns(expr->array_access.index);
5059 return expression_returns(expr->va_starte.ap);
5062 return expression_returns(expr->va_arge.ap);
5065 return expression_returns(expr->va_copye.src);
5067 EXPR_UNARY_CASES_MANDATORY
5068 return expression_returns(expr->unary.value);
5070 case EXPR_UNARY_THROW:
5074 // TODO handle constant lhs of && and ||
5076 expression_returns(expr->binary.left) &&
5077 expression_returns(expr->binary.right);
5083 panic("unhandled expression");
5086 static bool initializer_returns(initializer_t const *const init)
5088 switch (init->kind) {
5089 case INITIALIZER_VALUE:
5090 return expression_returns(init->value.value);
5092 case INITIALIZER_LIST: {
5093 initializer_t * const* i = init->list.initializers;
5094 initializer_t * const* const end = i + init->list.len;
5095 bool returns = true;
5096 for (; i != end; ++i) {
5097 if (!initializer_returns(*i))
5103 case INITIALIZER_STRING:
5104 case INITIALIZER_WIDE_STRING:
5105 case INITIALIZER_DESIGNATOR: // designators have no payload
5108 panic("unhandled initializer");
5111 static bool noreturn_candidate;
5113 static void check_reachable(statement_t *const stmt)
5115 if (stmt->base.reachable)
5117 if (stmt->kind != STATEMENT_DO_WHILE)
5118 stmt->base.reachable = true;
5120 statement_t *last = stmt;
5122 switch (stmt->kind) {
5123 case STATEMENT_INVALID:
5124 case STATEMENT_EMPTY:
5126 next = stmt->base.next;
5129 case STATEMENT_DECLARATION: {
5130 declaration_statement_t const *const decl = &stmt->declaration;
5131 entity_t const * ent = decl->declarations_begin;
5132 entity_t const *const last = decl->declarations_end;
5134 for (;; ent = ent->base.next) {
5135 if (ent->kind == ENTITY_VARIABLE &&
5136 ent->variable.initializer != NULL &&
5137 !initializer_returns(ent->variable.initializer)) {
5144 next = stmt->base.next;
5148 case STATEMENT_COMPOUND:
5149 next = stmt->compound.statements;
5151 next = stmt->base.next;
5154 case STATEMENT_RETURN: {
5155 expression_t const *const val = stmt->returns.value;
5156 if (val == NULL || expression_returns(val))
5157 noreturn_candidate = false;
5161 case STATEMENT_IF: {
5162 if_statement_t const *const ifs = &stmt->ifs;
5163 expression_t const *const cond = ifs->condition;
5165 if (!expression_returns(cond))
5168 int const val = determine_truth(cond);
5171 check_reachable(ifs->true_statement);
5176 if (ifs->false_statement != NULL) {
5177 check_reachable(ifs->false_statement);
5181 next = stmt->base.next;
5185 case STATEMENT_SWITCH: {
5186 switch_statement_t const *const switchs = &stmt->switchs;
5187 expression_t const *const expr = switchs->expression;
5189 if (!expression_returns(expr))
5192 if (is_constant_expression(expr)) {
5193 long const val = fold_constant_to_int(expr);
5194 case_label_statement_t * defaults = NULL;
5195 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5196 if (i->expression == NULL) {
5201 if (i->first_case <= val && val <= i->last_case) {
5202 check_reachable((statement_t*)i);
5207 if (defaults != NULL) {
5208 check_reachable((statement_t*)defaults);
5212 bool has_default = false;
5213 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5214 if (i->expression == NULL)
5217 check_reachable((statement_t*)i);
5224 next = stmt->base.next;
5228 case STATEMENT_EXPRESSION: {
5229 /* Check for noreturn function call */
5230 expression_t const *const expr = stmt->expression.expression;
5231 if (!expression_returns(expr))
5234 next = stmt->base.next;
5238 case STATEMENT_CONTINUE: {
5239 statement_t *parent = stmt;
5241 parent = parent->base.parent;
5242 if (parent == NULL) /* continue not within loop */
5246 switch (parent->kind) {
5247 case STATEMENT_WHILE: goto continue_while;
5248 case STATEMENT_DO_WHILE: goto continue_do_while;
5249 case STATEMENT_FOR: goto continue_for;
5256 case STATEMENT_BREAK: {
5257 statement_t *parent = stmt;
5259 parent = parent->base.parent;
5260 if (parent == NULL) /* break not within loop/switch */
5263 switch (parent->kind) {
5264 case STATEMENT_SWITCH:
5265 case STATEMENT_WHILE:
5266 case STATEMENT_DO_WHILE:
5269 next = parent->base.next;
5270 goto found_break_parent;
5279 case STATEMENT_GOTO:
5280 if (stmt->gotos.expression) {
5281 if (!expression_returns(stmt->gotos.expression))
5284 statement_t *parent = stmt->base.parent;
5285 if (parent == NULL) /* top level goto */
5289 next = stmt->gotos.label->statement;
5290 if (next == NULL) /* missing label */
5295 case STATEMENT_LABEL:
5296 next = stmt->label.statement;
5299 case STATEMENT_CASE_LABEL:
5300 next = stmt->case_label.statement;
5303 case STATEMENT_WHILE: {
5304 while_statement_t const *const whiles = &stmt->whiles;
5305 expression_t const *const cond = whiles->condition;
5307 if (!expression_returns(cond))
5310 int const val = determine_truth(cond);
5313 check_reachable(whiles->body);
5318 next = stmt->base.next;
5322 case STATEMENT_DO_WHILE:
5323 next = stmt->do_while.body;
5326 case STATEMENT_FOR: {
5327 for_statement_t *const fors = &stmt->fors;
5329 if (fors->condition_reachable)
5331 fors->condition_reachable = true;
5333 expression_t const *const cond = fors->condition;
5338 } else if (expression_returns(cond)) {
5339 val = determine_truth(cond);
5345 check_reachable(fors->body);
5350 next = stmt->base.next;
5354 case STATEMENT_MS_TRY: {
5355 ms_try_statement_t const *const ms_try = &stmt->ms_try;
5356 check_reachable(ms_try->try_statement);
5357 next = ms_try->final_statement;
5361 case STATEMENT_LEAVE: {
5362 statement_t *parent = stmt;
5364 parent = parent->base.parent;
5365 if (parent == NULL) /* __leave not within __try */
5368 if (parent->kind == STATEMENT_MS_TRY) {
5370 next = parent->ms_try.final_statement;
5378 panic("invalid statement kind");
5381 while (next == NULL) {
5382 next = last->base.parent;
5384 noreturn_candidate = false;
5386 type_t *const type = skip_typeref(current_function->base.type);
5387 assert(is_type_function(type));
5388 type_t *const ret = skip_typeref(type->function.return_type);
5389 if (warning.return_type &&
5390 !is_type_atomic(ret, ATOMIC_TYPE_VOID) &&
5391 is_type_valid(ret) &&
5392 !is_sym_main(current_function->base.base.symbol)) {
5393 warningf(&stmt->base.source_position,
5394 "control reaches end of non-void function");
5399 switch (next->kind) {
5400 case STATEMENT_INVALID:
5401 case STATEMENT_EMPTY:
5402 case STATEMENT_DECLARATION:
5403 case STATEMENT_EXPRESSION:
5405 case STATEMENT_RETURN:
5406 case STATEMENT_CONTINUE:
5407 case STATEMENT_BREAK:
5408 case STATEMENT_GOTO:
5409 case STATEMENT_LEAVE:
5410 panic("invalid control flow in function");
5412 case STATEMENT_COMPOUND:
5413 if (next->compound.stmt_expr) {
5419 case STATEMENT_SWITCH:
5420 case STATEMENT_LABEL:
5421 case STATEMENT_CASE_LABEL:
5423 next = next->base.next;
5426 case STATEMENT_WHILE: {
5428 if (next->base.reachable)
5430 next->base.reachable = true;
5432 while_statement_t const *const whiles = &next->whiles;
5433 expression_t const *const cond = whiles->condition;
5435 if (!expression_returns(cond))
5438 int const val = determine_truth(cond);
5441 check_reachable(whiles->body);
5447 next = next->base.next;
5451 case STATEMENT_DO_WHILE: {
5453 if (next->base.reachable)
5455 next->base.reachable = true;
5457 do_while_statement_t const *const dw = &next->do_while;
5458 expression_t const *const cond = dw->condition;
5460 if (!expression_returns(cond))
5463 int const val = determine_truth(cond);
5466 check_reachable(dw->body);
5472 next = next->base.next;
5476 case STATEMENT_FOR: {
5478 for_statement_t *const fors = &next->fors;
5480 fors->step_reachable = true;
5482 if (fors->condition_reachable)
5484 fors->condition_reachable = true;
5486 expression_t const *const cond = fors->condition;
5491 } else if (expression_returns(cond)) {
5492 val = determine_truth(cond);
5498 check_reachable(fors->body);
5504 next = next->base.next;
5508 case STATEMENT_MS_TRY:
5510 next = next->ms_try.final_statement;
5515 check_reachable(next);
5518 static void check_unreachable(statement_t* const stmt, void *const env)
5522 switch (stmt->kind) {
5523 case STATEMENT_DO_WHILE:
5524 if (!stmt->base.reachable) {
5525 expression_t const *const cond = stmt->do_while.condition;
5526 if (determine_truth(cond) >= 0) {
5527 warningf(&cond->base.source_position,
5528 "condition of do-while-loop is unreachable");
5533 case STATEMENT_FOR: {
5534 for_statement_t const* const fors = &stmt->fors;
5536 // if init and step are unreachable, cond is unreachable, too
5537 if (!stmt->base.reachable && !fors->step_reachable) {
5538 warningf(&stmt->base.source_position, "statement is unreachable");
5540 if (!stmt->base.reachable && fors->initialisation != NULL) {
5541 warningf(&fors->initialisation->base.source_position,
5542 "initialisation of for-statement is unreachable");
5545 if (!fors->condition_reachable && fors->condition != NULL) {
5546 warningf(&fors->condition->base.source_position,
5547 "condition of for-statement is unreachable");
5550 if (!fors->step_reachable && fors->step != NULL) {
5551 warningf(&fors->step->base.source_position,
5552 "step of for-statement is unreachable");
5558 case STATEMENT_COMPOUND:
5559 if (stmt->compound.statements != NULL)
5561 goto warn_unreachable;
5563 case STATEMENT_DECLARATION: {
5564 /* Only warn if there is at least one declarator with an initializer.
5565 * This typically occurs in switch statements. */
5566 declaration_statement_t const *const decl = &stmt->declaration;
5567 entity_t const * ent = decl->declarations_begin;
5568 entity_t const *const last = decl->declarations_end;
5570 for (;; ent = ent->base.next) {
5571 if (ent->kind == ENTITY_VARIABLE &&
5572 ent->variable.initializer != NULL) {
5573 goto warn_unreachable;
5583 if (!stmt->base.reachable)
5584 warningf(&stmt->base.source_position, "statement is unreachable");
5589 static void parse_external_declaration(void)
5591 /* function-definitions and declarations both start with declaration
5593 declaration_specifiers_t specifiers;
5594 memset(&specifiers, 0, sizeof(specifiers));
5596 add_anchor_token(';');
5597 parse_declaration_specifiers(&specifiers);
5598 rem_anchor_token(';');
5600 /* must be a declaration */
5601 if (token.type == ';') {
5602 parse_anonymous_declaration_rest(&specifiers);
5606 add_anchor_token(',');
5607 add_anchor_token('=');
5608 add_anchor_token(';');
5609 add_anchor_token('{');
5611 /* declarator is common to both function-definitions and declarations */
5612 entity_t *ndeclaration = parse_declarator(&specifiers, DECL_FLAGS_NONE);
5614 rem_anchor_token('{');
5615 rem_anchor_token(';');
5616 rem_anchor_token('=');
5617 rem_anchor_token(',');
5619 /* must be a declaration */
5620 switch (token.type) {
5624 parse_declaration_rest(ndeclaration, &specifiers, record_entity,
5629 /* must be a function definition */
5630 parse_kr_declaration_list(ndeclaration);
5632 if (token.type != '{') {
5633 parse_error_expected("while parsing function definition", '{', NULL);
5634 eat_until_matching_token(';');
5638 assert(is_declaration(ndeclaration));
5639 type_t *const orig_type = ndeclaration->declaration.type;
5640 type_t * type = skip_typeref(orig_type);
5642 if (!is_type_function(type)) {
5643 if (is_type_valid(type)) {
5644 errorf(HERE, "declarator '%#T' has a body but is not a function type",
5645 type, ndeclaration->base.symbol);
5649 } else if (is_typeref(orig_type)) {
5651 errorf(&ndeclaration->base.source_position,
5652 "type of function definition '%#T' is a typedef",
5653 orig_type, ndeclaration->base.symbol);
5656 if (warning.aggregate_return &&
5657 is_type_compound(skip_typeref(type->function.return_type))) {
5658 warningf(HERE, "function '%Y' returns an aggregate",
5659 ndeclaration->base.symbol);
5661 if (warning.traditional && !type->function.unspecified_parameters) {
5662 warningf(HERE, "traditional C rejects ISO C style function definition of function '%Y'",
5663 ndeclaration->base.symbol);
5665 if (warning.old_style_definition && type->function.unspecified_parameters) {
5666 warningf(HERE, "old-style function definition '%Y'",
5667 ndeclaration->base.symbol);
5670 /* §6.7.5.3:14 a function definition with () means no
5671 * parameters (and not unspecified parameters) */
5672 if (type->function.unspecified_parameters &&
5673 type->function.parameters == NULL &&
5674 !type->function.kr_style_parameters) {
5675 type_t *copy = duplicate_type(type);
5676 copy->function.unspecified_parameters = false;
5677 type = identify_new_type(copy);
5679 ndeclaration->declaration.type = type;
5682 entity_t *const entity = record_entity(ndeclaration, true);
5683 assert(entity->kind == ENTITY_FUNCTION);
5684 assert(ndeclaration->kind == ENTITY_FUNCTION);
5686 function_t *function = &entity->function;
5687 if (ndeclaration != entity) {
5688 function->parameters = ndeclaration->function.parameters;
5690 assert(is_declaration(entity));
5691 type = skip_typeref(entity->declaration.type);
5693 /* push function parameters and switch scope */
5694 size_t const top = environment_top();
5695 scope_t *old_scope = scope_push(&function->parameters);
5697 entity_t *parameter = function->parameters.entities;
5698 for (; parameter != NULL; parameter = parameter->base.next) {
5699 if (parameter->base.parent_scope == &ndeclaration->function.parameters) {
5700 parameter->base.parent_scope = current_scope;
5702 assert(parameter->base.parent_scope == NULL
5703 || parameter->base.parent_scope == current_scope);
5704 parameter->base.parent_scope = current_scope;
5705 if (parameter->base.symbol == NULL) {
5706 errorf(¶meter->base.source_position, "parameter name omitted");
5709 environment_push(parameter);
5712 if (function->statement != NULL) {
5713 parser_error_multiple_definition(entity, HERE);
5716 /* parse function body */
5717 int label_stack_top = label_top();
5718 function_t *old_current_function = current_function;
5719 current_function = function;
5720 current_parent = NULL;
5723 goto_anchor = &goto_first;
5725 label_anchor = &label_first;
5727 statement_t *const body = parse_compound_statement(false);
5728 function->statement = body;
5731 check_declarations();
5732 if (warning.return_type ||
5733 warning.unreachable_code ||
5734 (warning.missing_noreturn
5735 && !(function->base.modifiers & DM_NORETURN))) {
5736 noreturn_candidate = true;
5737 check_reachable(body);
5738 if (warning.unreachable_code)
5739 walk_statements(body, check_unreachable, NULL);
5740 if (warning.missing_noreturn &&
5741 noreturn_candidate &&
5742 !(function->base.modifiers & DM_NORETURN)) {
5743 warningf(&body->base.source_position,
5744 "function '%#T' is candidate for attribute 'noreturn'",
5745 type, entity->base.symbol);
5749 assert(current_parent == NULL);
5750 assert(current_function == function);
5751 current_function = old_current_function;
5752 label_pop_to(label_stack_top);
5755 assert(current_scope == &function->parameters);
5756 scope_pop(old_scope);
5757 environment_pop_to(top);
5760 static type_t *make_bitfield_type(type_t *base_type, expression_t *size,
5761 source_position_t *source_position,
5762 const symbol_t *symbol)
5764 type_t *type = allocate_type_zero(TYPE_BITFIELD);
5766 type->bitfield.base_type = base_type;
5767 type->bitfield.size_expression = size;
5770 type_t *skipped_type = skip_typeref(base_type);
5771 if (!is_type_integer(skipped_type)) {
5772 errorf(HERE, "bitfield base type '%T' is not an integer type",
5776 bit_size = get_type_size(base_type) * 8;
5779 if (is_constant_expression(size)) {
5780 long v = fold_constant_to_int(size);
5781 const symbol_t *user_symbol = symbol == NULL ? sym_anonymous : symbol;
5784 errorf(source_position, "negative width in bit-field '%Y'",
5786 } else if (v == 0 && symbol != NULL) {
5787 errorf(source_position, "zero width for bit-field '%Y'",
5789 } else if (bit_size > 0 && (il_size_t)v > bit_size) {
5790 errorf(source_position, "width of '%Y' exceeds its type",
5793 type->bitfield.bit_size = v;
5800 static entity_t *find_compound_entry(compound_t *compound, symbol_t *symbol)
5802 entity_t *iter = compound->members.entities;
5803 for (; iter != NULL; iter = iter->base.next) {
5804 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5807 if (iter->base.symbol == symbol) {
5809 } else if (iter->base.symbol == NULL) {
5810 /* search in anonymous structs and unions */
5811 type_t *type = skip_typeref(iter->declaration.type);
5812 if (is_type_compound(type)) {
5813 if (find_compound_entry(type->compound.compound, symbol)
5824 static void check_deprecated(const source_position_t *source_position,
5825 const entity_t *entity)
5827 if (!warning.deprecated_declarations)
5829 if (!is_declaration(entity))
5831 if ((entity->declaration.modifiers & DM_DEPRECATED) == 0)
5834 char const *const prefix = get_entity_kind_name(entity->kind);
5835 const char *deprecated_string
5836 = get_deprecated_string(entity->declaration.attributes);
5837 if (deprecated_string != NULL) {
5838 warningf(source_position, "%s '%Y' is deprecated (declared %P): \"%s\"",
5839 prefix, entity->base.symbol, &entity->base.source_position,
5842 warningf(source_position, "%s '%Y' is deprecated (declared %P)", prefix,
5843 entity->base.symbol, &entity->base.source_position);
5848 static expression_t *create_select(const source_position_t *pos,
5850 type_qualifiers_t qualifiers,
5853 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
5855 check_deprecated(pos, entry);
5857 expression_t *select = allocate_expression_zero(EXPR_SELECT);
5858 select->select.compound = addr;
5859 select->select.compound_entry = entry;
5861 type_t *entry_type = entry->declaration.type;
5862 type_t *res_type = get_qualified_type(entry_type, qualifiers);
5864 /* we always do the auto-type conversions; the & and sizeof parser contains
5865 * code to revert this! */
5866 select->base.type = automatic_type_conversion(res_type);
5867 if (res_type->kind == TYPE_BITFIELD) {
5868 select->base.type = res_type->bitfield.base_type;
5875 * Find entry with symbol in compound. Search anonymous structs and unions and
5876 * creates implicit select expressions for them.
5877 * Returns the adress for the innermost compound.
5879 static expression_t *find_create_select(const source_position_t *pos,
5881 type_qualifiers_t qualifiers,
5882 compound_t *compound, symbol_t *symbol)
5884 entity_t *iter = compound->members.entities;
5885 for (; iter != NULL; iter = iter->base.next) {
5886 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5889 symbol_t *iter_symbol = iter->base.symbol;
5890 if (iter_symbol == NULL) {
5891 type_t *type = iter->declaration.type;
5892 if (type->kind != TYPE_COMPOUND_STRUCT
5893 && type->kind != TYPE_COMPOUND_UNION)
5896 compound_t *sub_compound = type->compound.compound;
5898 if (find_compound_entry(sub_compound, symbol) == NULL)
5901 expression_t *sub_addr = create_select(pos, addr, qualifiers, iter);
5902 sub_addr->base.source_position = *pos;
5903 sub_addr->select.implicit = true;
5904 return find_create_select(pos, sub_addr, qualifiers, sub_compound,
5908 if (iter_symbol == symbol) {
5909 return create_select(pos, addr, qualifiers, iter);
5916 static void parse_compound_declarators(compound_t *compound,
5917 const declaration_specifiers_t *specifiers)
5922 if (token.type == ':') {
5923 source_position_t source_position = *HERE;
5926 type_t *base_type = specifiers->type;
5927 expression_t *size = parse_constant_expression();
5929 type_t *type = make_bitfield_type(base_type, size,
5930 &source_position, NULL);
5932 attribute_t *attributes = parse_attributes(NULL);
5933 if (attributes != NULL) {
5934 attribute_t *last = attributes;
5935 while (last->next != NULL)
5937 last->next = specifiers->attributes;
5939 attributes = specifiers->attributes;
5942 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER);
5943 entity->base.namespc = NAMESPACE_NORMAL;
5944 entity->base.source_position = source_position;
5945 entity->declaration.declared_storage_class = STORAGE_CLASS_NONE;
5946 entity->declaration.storage_class = STORAGE_CLASS_NONE;
5947 entity->declaration.type = type;
5948 entity->declaration.attributes = attributes;
5950 if (attributes != NULL) {
5951 handle_entity_attributes(attributes, entity);
5953 append_entity(&compound->members, entity);
5955 entity = parse_declarator(specifiers,
5956 DECL_MAY_BE_ABSTRACT | DECL_CREATE_COMPOUND_MEMBER);
5957 if (entity->kind == ENTITY_TYPEDEF) {
5958 errorf(&entity->base.source_position,
5959 "typedef not allowed as compound member");
5961 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5963 /* make sure we don't define a symbol multiple times */
5964 symbol_t *symbol = entity->base.symbol;
5965 if (symbol != NULL) {
5966 entity_t *prev = find_compound_entry(compound, symbol);
5968 errorf(&entity->base.source_position,
5969 "multiple declarations of symbol '%Y' (declared %P)",
5970 symbol, &prev->base.source_position);
5974 if (token.type == ':') {
5975 source_position_t source_position = *HERE;
5977 expression_t *size = parse_constant_expression();
5979 type_t *type = entity->declaration.type;
5980 type_t *bitfield_type = make_bitfield_type(type, size,
5981 &source_position, entity->base.symbol);
5983 attribute_t *attributes = parse_attributes(NULL);
5984 entity->declaration.type = bitfield_type;
5985 handle_entity_attributes(attributes, entity);
5987 type_t *orig_type = entity->declaration.type;
5988 type_t *type = skip_typeref(orig_type);
5989 if (is_type_function(type)) {
5990 errorf(&entity->base.source_position,
5991 "compound member '%Y' must not have function type '%T'",
5992 entity->base.symbol, orig_type);
5993 } else if (is_type_incomplete(type)) {
5994 /* §6.7.2.1:16 flexible array member */
5995 if (!is_type_array(type) ||
5996 token.type != ';' ||
5997 look_ahead(1)->type != '}') {
5998 errorf(&entity->base.source_position,
5999 "compound member '%Y' has incomplete type '%T'",
6000 entity->base.symbol, orig_type);
6005 append_entity(&compound->members, entity);
6009 if (token.type != ',')
6013 expect(';', end_error);
6016 anonymous_entity = NULL;
6019 static void parse_compound_type_entries(compound_t *compound)
6022 add_anchor_token('}');
6024 while (token.type != '}') {
6025 if (token.type == T_EOF) {
6026 errorf(HERE, "EOF while parsing struct");
6029 declaration_specifiers_t specifiers;
6030 memset(&specifiers, 0, sizeof(specifiers));
6031 parse_declaration_specifiers(&specifiers);
6033 parse_compound_declarators(compound, &specifiers);
6035 rem_anchor_token('}');
6039 compound->complete = true;
6042 static type_t *parse_typename(void)
6044 declaration_specifiers_t specifiers;
6045 memset(&specifiers, 0, sizeof(specifiers));
6046 parse_declaration_specifiers(&specifiers);
6047 if (specifiers.storage_class != STORAGE_CLASS_NONE ||
6048 specifiers.thread_local) {
6049 /* TODO: improve error message, user does probably not know what a
6050 * storage class is...
6052 errorf(HERE, "typename may not have a storage class");
6055 type_t *result = parse_abstract_declarator(specifiers.type);
6063 typedef expression_t* (*parse_expression_function)(void);
6064 typedef expression_t* (*parse_expression_infix_function)(expression_t *left);
6066 typedef struct expression_parser_function_t expression_parser_function_t;
6067 struct expression_parser_function_t {
6068 parse_expression_function parser;
6069 precedence_t infix_precedence;
6070 parse_expression_infix_function infix_parser;
6073 expression_parser_function_t expression_parsers[T_LAST_TOKEN];
6076 * Prints an error message if an expression was expected but not read
6078 static expression_t *expected_expression_error(void)
6080 /* skip the error message if the error token was read */
6081 if (token.type != T_ERROR) {
6082 errorf(HERE, "expected expression, got token %K", &token);
6086 return create_invalid_expression();
6090 * Parse a string constant.
6092 static expression_t *parse_string_const(void)
6095 if (token.type == T_STRING_LITERAL) {
6096 string_t res = token.v.string;
6098 while (token.type == T_STRING_LITERAL) {
6099 res = concat_strings(&res, &token.v.string);
6102 if (token.type != T_WIDE_STRING_LITERAL) {
6103 expression_t *const cnst = allocate_expression_zero(EXPR_STRING_LITERAL);
6104 /* note: that we use type_char_ptr here, which is already the
6105 * automatic converted type. revert_automatic_type_conversion
6106 * will construct the array type */
6107 cnst->base.type = warning.write_strings ? type_const_char_ptr : type_char_ptr;
6108 cnst->string.value = res;
6112 wres = concat_string_wide_string(&res, &token.v.wide_string);
6114 wres = token.v.wide_string;
6119 switch (token.type) {
6120 case T_WIDE_STRING_LITERAL:
6121 wres = concat_wide_strings(&wres, &token.v.wide_string);
6124 case T_STRING_LITERAL:
6125 wres = concat_wide_string_string(&wres, &token.v.string);
6129 expression_t *const cnst = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
6130 cnst->base.type = warning.write_strings ? type_const_wchar_t_ptr : type_wchar_t_ptr;
6131 cnst->wide_string.value = wres;
6140 * Parse a boolean constant.
6142 static expression_t *parse_bool_const(bool value)
6144 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
6145 cnst->base.type = type_bool;
6146 cnst->conste.v.int_value = value;
6154 * Parse an integer constant.
6156 static expression_t *parse_int_const(void)
6158 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
6159 cnst->base.type = token.datatype;
6160 cnst->conste.v.int_value = token.v.intvalue;
6168 * Parse a character constant.
6170 static expression_t *parse_character_constant(void)
6172 expression_t *cnst = allocate_expression_zero(EXPR_CHARACTER_CONSTANT);
6173 cnst->base.type = token.datatype;
6174 cnst->conste.v.character = token.v.string;
6176 if (cnst->conste.v.character.size != 1) {
6178 errorf(HERE, "more than 1 character in character constant");
6179 } else if (warning.multichar) {
6180 warningf(HERE, "multi-character character constant");
6189 * Parse a wide character constant.
6191 static expression_t *parse_wide_character_constant(void)
6193 expression_t *cnst = allocate_expression_zero(EXPR_WIDE_CHARACTER_CONSTANT);
6194 cnst->base.type = token.datatype;
6195 cnst->conste.v.wide_character = token.v.wide_string;
6197 if (cnst->conste.v.wide_character.size != 1) {
6199 errorf(HERE, "more than 1 character in character constant");
6200 } else if (warning.multichar) {
6201 warningf(HERE, "multi-character character constant");
6210 * Parse a float constant.
6212 static expression_t *parse_float_const(void)
6214 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
6215 cnst->base.type = token.datatype;
6216 cnst->conste.v.float_value = token.v.floatvalue;
6223 static entity_t *create_implicit_function(symbol_t *symbol,
6224 const source_position_t *source_position)
6226 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
6227 ntype->function.return_type = type_int;
6228 ntype->function.unspecified_parameters = true;
6229 ntype->function.linkage = LINKAGE_C;
6230 type_t *type = identify_new_type(ntype);
6232 entity_t *entity = allocate_entity_zero(ENTITY_FUNCTION);
6233 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
6234 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
6235 entity->declaration.type = type;
6236 entity->declaration.implicit = true;
6237 entity->base.symbol = symbol;
6238 entity->base.source_position = *source_position;
6240 bool strict_prototypes_old = warning.strict_prototypes;
6241 warning.strict_prototypes = false;
6242 record_entity(entity, false);
6243 warning.strict_prototypes = strict_prototypes_old;
6249 * Creates a return_type (func)(argument_type) function type if not
6252 static type_t *make_function_2_type(type_t *return_type, type_t *argument_type1,
6253 type_t *argument_type2)
6255 function_parameter_t *const parameter2 = allocate_parameter(argument_type2);
6256 function_parameter_t *const parameter1 = allocate_parameter(argument_type1);
6257 parameter1->next = parameter2;
6259 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6260 type->function.return_type = return_type;
6261 type->function.parameters = parameter1;
6263 return identify_new_type(type);
6267 * Creates a return_type (func)(argument_type) function type if not
6270 * @param return_type the return type
6271 * @param argument_type the argument type
6273 static type_t *make_function_1_type(type_t *return_type, type_t *argument_type)
6275 function_parameter_t *const parameter = allocate_parameter(argument_type);
6277 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6278 type->function.return_type = return_type;
6279 type->function.parameters = parameter;
6281 return identify_new_type(type);
6284 static type_t *make_function_1_type_variadic(type_t *return_type, type_t *argument_type)
6286 type_t *res = make_function_1_type(return_type, argument_type);
6287 res->function.variadic = 1;
6292 * Creates a return_type (func)(void) function type if not
6295 * @param return_type the return type
6297 static type_t *make_function_0_type(type_t *return_type)
6299 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6300 type->function.return_type = return_type;
6301 type->function.parameters = NULL;
6303 return identify_new_type(type);
6307 * Creates a NO_RETURN return_type (func)(void) function type if not
6310 * @param return_type the return type
6312 static type_t *make_function_0_type_noreturn(type_t *return_type)
6314 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6315 type->function.return_type = return_type;
6316 type->function.parameters = NULL;
6317 type->function.modifiers |= DM_NORETURN;
6318 return identify_new_type(type);
6322 * Performs automatic type cast as described in §6.3.2.1.
6324 * @param orig_type the original type
6326 static type_t *automatic_type_conversion(type_t *orig_type)
6328 type_t *type = skip_typeref(orig_type);
6329 if (is_type_array(type)) {
6330 array_type_t *array_type = &type->array;
6331 type_t *element_type = array_type->element_type;
6332 unsigned qualifiers = array_type->base.qualifiers;
6334 return make_pointer_type(element_type, qualifiers);
6337 if (is_type_function(type)) {
6338 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
6345 * reverts the automatic casts of array to pointer types and function
6346 * to function-pointer types as defined §6.3.2.1
6348 type_t *revert_automatic_type_conversion(const expression_t *expression)
6350 switch (expression->kind) {
6351 case EXPR_REFERENCE: {
6352 entity_t *entity = expression->reference.entity;
6353 if (is_declaration(entity)) {
6354 return entity->declaration.type;
6355 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6356 return entity->enum_value.enum_type;
6358 panic("no declaration or enum in reference");
6363 entity_t *entity = expression->select.compound_entry;
6364 assert(is_declaration(entity));
6365 type_t *type = entity->declaration.type;
6366 return get_qualified_type(type,
6367 expression->base.type->base.qualifiers);
6370 case EXPR_UNARY_DEREFERENCE: {
6371 const expression_t *const value = expression->unary.value;
6372 type_t *const type = skip_typeref(value->base.type);
6373 if (!is_type_pointer(type))
6374 return type_error_type;
6375 return type->pointer.points_to;
6378 case EXPR_ARRAY_ACCESS: {
6379 const expression_t *array_ref = expression->array_access.array_ref;
6380 type_t *type_left = skip_typeref(array_ref->base.type);
6381 if (!is_type_pointer(type_left))
6382 return type_error_type;
6383 return type_left->pointer.points_to;
6386 case EXPR_STRING_LITERAL: {
6387 size_t size = expression->string.value.size;
6388 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
6391 case EXPR_WIDE_STRING_LITERAL: {
6392 size_t size = expression->wide_string.value.size;
6393 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
6396 case EXPR_COMPOUND_LITERAL:
6397 return expression->compound_literal.type;
6400 return expression->base.type;
6404 static expression_t *parse_reference(void)
6406 symbol_t *const symbol = token.v.symbol;
6408 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
6410 if (entity == NULL) {
6411 if (!strict_mode && look_ahead(1)->type == '(') {
6412 /* an implicitly declared function */
6413 if (warning.error_implicit_function_declaration) {
6414 errorf(HERE, "implicit declaration of function '%Y'", symbol);
6415 } else if (warning.implicit_function_declaration) {
6416 warningf(HERE, "implicit declaration of function '%Y'", symbol);
6419 entity = create_implicit_function(symbol, HERE);
6421 errorf(HERE, "unknown identifier '%Y' found.", symbol);
6422 entity = create_error_entity(symbol, ENTITY_VARIABLE);
6428 if (is_declaration(entity)) {
6429 orig_type = entity->declaration.type;
6430 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6431 orig_type = entity->enum_value.enum_type;
6433 panic("expected declaration or enum value in reference");
6436 /* we always do the auto-type conversions; the & and sizeof parser contains
6437 * code to revert this! */
6438 type_t *type = automatic_type_conversion(orig_type);
6440 expression_kind_t kind = EXPR_REFERENCE;
6441 if (entity->kind == ENTITY_ENUM_VALUE)
6442 kind = EXPR_REFERENCE_ENUM_VALUE;
6444 expression_t *expression = allocate_expression_zero(kind);
6445 expression->reference.entity = entity;
6446 expression->base.type = type;
6448 /* this declaration is used */
6449 if (is_declaration(entity)) {
6450 entity->declaration.used = true;
6453 if (entity->base.parent_scope != file_scope
6454 && (current_function != NULL && entity->base.parent_scope->depth < current_function->parameters.depth)
6455 && is_type_valid(orig_type) && !is_type_function(orig_type)) {
6456 if (entity->kind == ENTITY_VARIABLE) {
6457 /* access of a variable from an outer function */
6458 entity->variable.address_taken = true;
6459 } else if (entity->kind == ENTITY_PARAMETER) {
6460 entity->parameter.address_taken = true;
6462 current_function->need_closure = true;
6465 check_deprecated(HERE, entity);
6467 if (warning.init_self && entity == current_init_decl && !in_type_prop
6468 && entity->kind == ENTITY_VARIABLE) {
6469 current_init_decl = NULL;
6470 warningf(HERE, "variable '%#T' is initialized by itself",
6471 entity->declaration.type, entity->base.symbol);
6478 static bool semantic_cast(expression_t *cast)
6480 expression_t *expression = cast->unary.value;
6481 type_t *orig_dest_type = cast->base.type;
6482 type_t *orig_type_right = expression->base.type;
6483 type_t const *dst_type = skip_typeref(orig_dest_type);
6484 type_t const *src_type = skip_typeref(orig_type_right);
6485 source_position_t const *pos = &cast->base.source_position;
6487 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
6488 if (dst_type == type_void)
6491 /* only integer and pointer can be casted to pointer */
6492 if (is_type_pointer(dst_type) &&
6493 !is_type_pointer(src_type) &&
6494 !is_type_integer(src_type) &&
6495 is_type_valid(src_type)) {
6496 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
6500 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
6501 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
6505 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
6506 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
6510 if (warning.cast_qual &&
6511 is_type_pointer(src_type) &&
6512 is_type_pointer(dst_type)) {
6513 type_t *src = skip_typeref(src_type->pointer.points_to);
6514 type_t *dst = skip_typeref(dst_type->pointer.points_to);
6515 unsigned missing_qualifiers =
6516 src->base.qualifiers & ~dst->base.qualifiers;
6517 if (missing_qualifiers != 0) {
6519 "cast discards qualifiers '%Q' in pointer target type of '%T'",
6520 missing_qualifiers, orig_type_right);
6526 static expression_t *parse_compound_literal(type_t *type)
6528 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
6530 parse_initializer_env_t env;
6533 env.must_be_constant = false;
6534 initializer_t *initializer = parse_initializer(&env);
6537 expression->compound_literal.initializer = initializer;
6538 expression->compound_literal.type = type;
6539 expression->base.type = automatic_type_conversion(type);
6545 * Parse a cast expression.
6547 static expression_t *parse_cast(void)
6549 add_anchor_token(')');
6551 source_position_t source_position = token.source_position;
6553 type_t *type = parse_typename();
6555 rem_anchor_token(')');
6556 expect(')', end_error);
6558 if (token.type == '{') {
6559 return parse_compound_literal(type);
6562 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
6563 cast->base.source_position = source_position;
6565 expression_t *value = parse_sub_expression(PREC_CAST);
6566 cast->base.type = type;
6567 cast->unary.value = value;
6569 if (! semantic_cast(cast)) {
6570 /* TODO: record the error in the AST. else it is impossible to detect it */
6575 return create_invalid_expression();
6579 * Parse a statement expression.
6581 static expression_t *parse_statement_expression(void)
6583 add_anchor_token(')');
6585 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6587 statement_t *statement = parse_compound_statement(true);
6588 statement->compound.stmt_expr = true;
6589 expression->statement.statement = statement;
6591 /* find last statement and use its type */
6592 type_t *type = type_void;
6593 const statement_t *stmt = statement->compound.statements;
6595 while (stmt->base.next != NULL)
6596 stmt = stmt->base.next;
6598 if (stmt->kind == STATEMENT_EXPRESSION) {
6599 type = stmt->expression.expression->base.type;
6601 } else if (warning.other) {
6602 warningf(&expression->base.source_position, "empty statement expression ({})");
6604 expression->base.type = type;
6606 rem_anchor_token(')');
6607 expect(')', end_error);
6614 * Parse a parenthesized expression.
6616 static expression_t *parse_parenthesized_expression(void)
6620 switch (token.type) {
6622 /* gcc extension: a statement expression */
6623 return parse_statement_expression();
6627 return parse_cast();
6629 if (is_typedef_symbol(token.v.symbol)) {
6630 return parse_cast();
6634 add_anchor_token(')');
6635 expression_t *result = parse_expression();
6636 result->base.parenthesized = true;
6637 rem_anchor_token(')');
6638 expect(')', end_error);
6644 static expression_t *parse_function_keyword(void)
6648 if (current_function == NULL) {
6649 errorf(HERE, "'__func__' used outside of a function");
6652 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6653 expression->base.type = type_char_ptr;
6654 expression->funcname.kind = FUNCNAME_FUNCTION;
6661 static expression_t *parse_pretty_function_keyword(void)
6663 if (current_function == NULL) {
6664 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
6667 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6668 expression->base.type = type_char_ptr;
6669 expression->funcname.kind = FUNCNAME_PRETTY_FUNCTION;
6671 eat(T___PRETTY_FUNCTION__);
6676 static expression_t *parse_funcsig_keyword(void)
6678 if (current_function == NULL) {
6679 errorf(HERE, "'__FUNCSIG__' used outside of a function");
6682 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6683 expression->base.type = type_char_ptr;
6684 expression->funcname.kind = FUNCNAME_FUNCSIG;
6691 static expression_t *parse_funcdname_keyword(void)
6693 if (current_function == NULL) {
6694 errorf(HERE, "'__FUNCDNAME__' used outside of a function");
6697 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
6698 expression->base.type = type_char_ptr;
6699 expression->funcname.kind = FUNCNAME_FUNCDNAME;
6701 eat(T___FUNCDNAME__);
6706 static designator_t *parse_designator(void)
6708 designator_t *result = allocate_ast_zero(sizeof(result[0]));
6709 result->source_position = *HERE;
6711 if (token.type != T_IDENTIFIER) {
6712 parse_error_expected("while parsing member designator",
6713 T_IDENTIFIER, NULL);
6716 result->symbol = token.v.symbol;
6719 designator_t *last_designator = result;
6721 if (token.type == '.') {
6723 if (token.type != T_IDENTIFIER) {
6724 parse_error_expected("while parsing member designator",
6725 T_IDENTIFIER, NULL);
6728 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6729 designator->source_position = *HERE;
6730 designator->symbol = token.v.symbol;
6733 last_designator->next = designator;
6734 last_designator = designator;
6737 if (token.type == '[') {
6739 add_anchor_token(']');
6740 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
6741 designator->source_position = *HERE;
6742 designator->array_index = parse_expression();
6743 rem_anchor_token(']');
6744 expect(']', end_error);
6745 if (designator->array_index == NULL) {
6749 last_designator->next = designator;
6750 last_designator = designator;
6762 * Parse the __builtin_offsetof() expression.
6764 static expression_t *parse_offsetof(void)
6766 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6767 expression->base.type = type_size_t;
6769 eat(T___builtin_offsetof);
6771 expect('(', end_error);
6772 add_anchor_token(',');
6773 type_t *type = parse_typename();
6774 rem_anchor_token(',');
6775 expect(',', end_error);
6776 add_anchor_token(')');
6777 designator_t *designator = parse_designator();
6778 rem_anchor_token(')');
6779 expect(')', end_error);
6781 expression->offsetofe.type = type;
6782 expression->offsetofe.designator = designator;
6785 memset(&path, 0, sizeof(path));
6786 path.top_type = type;
6787 path.path = NEW_ARR_F(type_path_entry_t, 0);
6789 descend_into_subtype(&path);
6791 if (!walk_designator(&path, designator, true)) {
6792 return create_invalid_expression();
6795 DEL_ARR_F(path.path);
6799 return create_invalid_expression();
6803 * Parses a _builtin_va_start() expression.
6805 static expression_t *parse_va_start(void)
6807 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6809 eat(T___builtin_va_start);
6811 expect('(', end_error);
6812 add_anchor_token(',');
6813 expression->va_starte.ap = parse_assignment_expression();
6814 rem_anchor_token(',');
6815 expect(',', end_error);
6816 expression_t *const expr = parse_assignment_expression();
6817 if (expr->kind == EXPR_REFERENCE) {
6818 entity_t *const entity = expr->reference.entity;
6819 if (entity->base.parent_scope != ¤t_function->parameters
6820 || entity->base.next != NULL
6821 || entity->kind != ENTITY_PARAMETER) {
6822 errorf(&expr->base.source_position,
6823 "second argument of 'va_start' must be last parameter of the current function");
6825 expression->va_starte.parameter = &entity->variable;
6827 expect(')', end_error);
6830 expect(')', end_error);
6832 return create_invalid_expression();
6836 * Parses a __builtin_va_arg() expression.
6838 static expression_t *parse_va_arg(void)
6840 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
6842 eat(T___builtin_va_arg);
6844 expect('(', end_error);
6846 ap.expression = parse_assignment_expression();
6847 expression->va_arge.ap = ap.expression;
6848 check_call_argument(type_valist, &ap, 1);
6850 expect(',', end_error);
6851 expression->base.type = parse_typename();
6852 expect(')', end_error);
6856 return create_invalid_expression();
6860 * Parses a __builtin_va_copy() expression.
6862 static expression_t *parse_va_copy(void)
6864 expression_t *expression = allocate_expression_zero(EXPR_VA_COPY);
6866 eat(T___builtin_va_copy);
6868 expect('(', end_error);
6869 expression_t *dst = parse_assignment_expression();
6870 assign_error_t error = semantic_assign(type_valist, dst);
6871 report_assign_error(error, type_valist, dst, "call argument 1",
6872 &dst->base.source_position);
6873 expression->va_copye.dst = dst;
6875 expect(',', end_error);
6877 call_argument_t src;
6878 src.expression = parse_assignment_expression();
6879 check_call_argument(type_valist, &src, 2);
6880 expression->va_copye.src = src.expression;
6881 expect(')', end_error);
6885 return create_invalid_expression();
6889 * Parses a __builtin_constant_p() expression.
6891 static expression_t *parse_builtin_constant(void)
6893 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
6895 eat(T___builtin_constant_p);
6897 expect('(', end_error);
6898 add_anchor_token(')');
6899 expression->builtin_constant.value = parse_assignment_expression();
6900 rem_anchor_token(')');
6901 expect(')', end_error);
6902 expression->base.type = type_int;
6906 return create_invalid_expression();
6910 * Parses a __builtin_types_compatible_p() expression.
6912 static expression_t *parse_builtin_types_compatible(void)
6914 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_TYPES_COMPATIBLE_P);
6916 eat(T___builtin_types_compatible_p);
6918 expect('(', end_error);
6919 add_anchor_token(')');
6920 add_anchor_token(',');
6921 expression->builtin_types_compatible.left = parse_typename();
6922 rem_anchor_token(',');
6923 expect(',', end_error);
6924 expression->builtin_types_compatible.right = parse_typename();
6925 rem_anchor_token(')');
6926 expect(')', end_error);
6927 expression->base.type = type_int;
6931 return create_invalid_expression();
6935 * Parses a __builtin_is_*() compare expression.
6937 static expression_t *parse_compare_builtin(void)
6939 expression_t *expression;
6941 switch (token.type) {
6942 case T___builtin_isgreater:
6943 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
6945 case T___builtin_isgreaterequal:
6946 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
6948 case T___builtin_isless:
6949 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
6951 case T___builtin_islessequal:
6952 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
6954 case T___builtin_islessgreater:
6955 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
6957 case T___builtin_isunordered:
6958 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
6961 internal_errorf(HERE, "invalid compare builtin found");
6963 expression->base.source_position = *HERE;
6966 expect('(', end_error);
6967 expression->binary.left = parse_assignment_expression();
6968 expect(',', end_error);
6969 expression->binary.right = parse_assignment_expression();
6970 expect(')', end_error);
6972 type_t *const orig_type_left = expression->binary.left->base.type;
6973 type_t *const orig_type_right = expression->binary.right->base.type;
6975 type_t *const type_left = skip_typeref(orig_type_left);
6976 type_t *const type_right = skip_typeref(orig_type_right);
6977 if (!is_type_float(type_left) && !is_type_float(type_right)) {
6978 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6979 type_error_incompatible("invalid operands in comparison",
6980 &expression->base.source_position, orig_type_left, orig_type_right);
6983 semantic_comparison(&expression->binary);
6988 return create_invalid_expression();
6993 * Parses a __builtin_expect(, end_error) expression.
6995 static expression_t *parse_builtin_expect(void, end_error)
6997 expression_t *expression
6998 = allocate_expression_zero(EXPR_BINARY_BUILTIN_EXPECT);
7000 eat(T___builtin_expect);
7002 expect('(', end_error);
7003 expression->binary.left = parse_assignment_expression();
7004 expect(',', end_error);
7005 expression->binary.right = parse_constant_expression();
7006 expect(')', end_error);
7008 expression->base.type = expression->binary.left->base.type;
7012 return create_invalid_expression();
7017 * Parses a MS assume() expression.
7019 static expression_t *parse_assume(void)
7021 expression_t *expression = allocate_expression_zero(EXPR_UNARY_ASSUME);
7025 expect('(', end_error);
7026 add_anchor_token(')');
7027 expression->unary.value = parse_assignment_expression();
7028 rem_anchor_token(')');
7029 expect(')', end_error);
7031 expression->base.type = type_void;
7034 return create_invalid_expression();
7038 * Return the declaration for a given label symbol or create a new one.
7040 * @param symbol the symbol of the label
7042 static label_t *get_label(symbol_t *symbol)
7045 assert(current_function != NULL);
7047 label = get_entity(symbol, NAMESPACE_LABEL);
7048 /* if we found a local label, we already created the declaration */
7049 if (label != NULL && label->kind == ENTITY_LOCAL_LABEL) {
7050 if (label->base.parent_scope != current_scope) {
7051 assert(label->base.parent_scope->depth < current_scope->depth);
7052 current_function->goto_to_outer = true;
7054 return &label->label;
7057 label = get_entity(symbol, NAMESPACE_LABEL);
7058 /* if we found a label in the same function, then we already created the
7061 && label->base.parent_scope == ¤t_function->parameters) {
7062 return &label->label;
7065 /* otherwise we need to create a new one */
7066 label = allocate_entity_zero(ENTITY_LABEL);
7067 label->base.namespc = NAMESPACE_LABEL;
7068 label->base.symbol = symbol;
7072 return &label->label;
7076 * Parses a GNU && label address expression.
7078 static expression_t *parse_label_address(void)
7080 source_position_t source_position = token.source_position;
7082 if (token.type != T_IDENTIFIER) {
7083 parse_error_expected("while parsing label address", T_IDENTIFIER, NULL);
7086 symbol_t *symbol = token.v.symbol;
7089 label_t *label = get_label(symbol);
7091 label->address_taken = true;
7093 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
7094 expression->base.source_position = source_position;
7096 /* label address is threaten as a void pointer */
7097 expression->base.type = type_void_ptr;
7098 expression->label_address.label = label;
7101 return create_invalid_expression();
7105 * Parse a microsoft __noop expression.
7107 static expression_t *parse_noop_expression(void)
7109 /* the result is a (int)0 */
7110 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
7111 cnst->base.type = type_int;
7112 cnst->conste.v.int_value = 0;
7113 cnst->conste.is_ms_noop = true;
7117 if (token.type == '(') {
7118 /* parse arguments */
7120 add_anchor_token(')');
7121 add_anchor_token(',');
7123 if (token.type != ')') {
7125 (void)parse_assignment_expression();
7126 if (token.type != ',')
7132 rem_anchor_token(',');
7133 rem_anchor_token(')');
7134 expect(')', end_error);
7141 * Parses a primary expression.
7143 static expression_t *parse_primary_expression(void)
7145 switch (token.type) {
7146 case T_false: return parse_bool_const(false);
7147 case T_true: return parse_bool_const(true);
7148 case T_INTEGER: return parse_int_const();
7149 case T_CHARACTER_CONSTANT: return parse_character_constant();
7150 case T_WIDE_CHARACTER_CONSTANT: return parse_wide_character_constant();
7151 case T_FLOATINGPOINT: return parse_float_const();
7152 case T_STRING_LITERAL:
7153 case T_WIDE_STRING_LITERAL: return parse_string_const();
7154 case T___FUNCTION__:
7155 case T___func__: return parse_function_keyword();
7156 case T___PRETTY_FUNCTION__: return parse_pretty_function_keyword();
7157 case T___FUNCSIG__: return parse_funcsig_keyword();
7158 case T___FUNCDNAME__: return parse_funcdname_keyword();
7159 case T___builtin_offsetof: return parse_offsetof();
7160 case T___builtin_va_start: return parse_va_start();
7161 case T___builtin_va_arg: return parse_va_arg();
7162 case T___builtin_va_copy: return parse_va_copy();
7163 case T___builtin_isgreater:
7164 case T___builtin_isgreaterequal:
7165 case T___builtin_isless:
7166 case T___builtin_islessequal:
7167 case T___builtin_islessgreater:
7168 case T___builtin_isunordered: return parse_compare_builtin();
7169 case T___builtin_constant_p: return parse_builtin_constant();
7170 case T___builtin_types_compatible_p: return parse_builtin_types_compatible();
7171 case T__assume: return parse_assume();
7174 return parse_label_address();
7177 case '(': return parse_parenthesized_expression();
7178 case T___noop: return parse_noop_expression();
7180 /* Gracefully handle type names while parsing expressions. */
7182 if (!is_typedef_symbol(token.v.symbol)) {
7183 return parse_reference();
7187 source_position_t const pos = *HERE;
7188 type_t const *const type = parse_typename();
7189 errorf(&pos, "encountered type '%T' while parsing expression", type);
7190 return create_invalid_expression();
7194 errorf(HERE, "unexpected token %K, expected an expression", &token);
7195 return create_invalid_expression();
7199 * Check if the expression has the character type and issue a warning then.
7201 static void check_for_char_index_type(const expression_t *expression)
7203 type_t *const type = expression->base.type;
7204 const type_t *const base_type = skip_typeref(type);
7206 if (is_type_atomic(base_type, ATOMIC_TYPE_CHAR) &&
7207 warning.char_subscripts) {
7208 warningf(&expression->base.source_position,
7209 "array subscript has type '%T'", type);
7213 static expression_t *parse_array_expression(expression_t *left)
7215 expression_t *expression = allocate_expression_zero(EXPR_ARRAY_ACCESS);
7218 add_anchor_token(']');
7220 expression_t *inside = parse_expression();
7222 type_t *const orig_type_left = left->base.type;
7223 type_t *const orig_type_inside = inside->base.type;
7225 type_t *const type_left = skip_typeref(orig_type_left);
7226 type_t *const type_inside = skip_typeref(orig_type_inside);
7228 type_t *return_type;
7229 array_access_expression_t *array_access = &expression->array_access;
7230 if (is_type_pointer(type_left)) {
7231 return_type = type_left->pointer.points_to;
7232 array_access->array_ref = left;
7233 array_access->index = inside;
7234 check_for_char_index_type(inside);
7235 } else if (is_type_pointer(type_inside)) {
7236 return_type = type_inside->pointer.points_to;
7237 array_access->array_ref = inside;
7238 array_access->index = left;
7239 array_access->flipped = true;
7240 check_for_char_index_type(left);
7242 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
7244 "array access on object with non-pointer types '%T', '%T'",
7245 orig_type_left, orig_type_inside);
7247 return_type = type_error_type;
7248 array_access->array_ref = left;
7249 array_access->index = inside;
7252 expression->base.type = automatic_type_conversion(return_type);
7254 rem_anchor_token(']');
7255 expect(']', end_error);
7260 static expression_t *parse_typeprop(expression_kind_t const kind)
7262 expression_t *tp_expression = allocate_expression_zero(kind);
7263 tp_expression->base.type = type_size_t;
7265 eat(kind == EXPR_SIZEOF ? T_sizeof : T___alignof__);
7267 /* we only refer to a type property, mark this case */
7268 bool old = in_type_prop;
7269 in_type_prop = true;
7272 expression_t *expression;
7273 if (token.type == '(' && is_declaration_specifier(look_ahead(1), true)) {
7275 add_anchor_token(')');
7276 orig_type = parse_typename();
7277 rem_anchor_token(')');
7278 expect(')', end_error);
7280 if (token.type == '{') {
7281 /* It was not sizeof(type) after all. It is sizeof of an expression
7282 * starting with a compound literal */
7283 expression = parse_compound_literal(orig_type);
7284 goto typeprop_expression;
7287 expression = parse_sub_expression(PREC_UNARY);
7289 typeprop_expression:
7290 tp_expression->typeprop.tp_expression = expression;
7292 orig_type = revert_automatic_type_conversion(expression);
7293 expression->base.type = orig_type;
7296 tp_expression->typeprop.type = orig_type;
7297 type_t const* const type = skip_typeref(orig_type);
7298 char const* const wrong_type =
7299 GNU_MODE && is_type_atomic(type, ATOMIC_TYPE_VOID) ? NULL :
7300 is_type_incomplete(type) ? "incomplete" :
7301 type->kind == TYPE_FUNCTION ? "function designator" :
7302 type->kind == TYPE_BITFIELD ? "bitfield" :
7304 if (wrong_type != NULL) {
7305 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7306 errorf(&tp_expression->base.source_position,
7307 "operand of %s expression must not be of %s type '%T'",
7308 what, wrong_type, orig_type);
7313 return tp_expression;
7316 static expression_t *parse_sizeof(void)
7318 return parse_typeprop(EXPR_SIZEOF);
7321 static expression_t *parse_alignof(void)
7323 return parse_typeprop(EXPR_ALIGNOF);
7326 static expression_t *parse_select_expression(expression_t *addr)
7328 assert(token.type == '.' || token.type == T_MINUSGREATER);
7329 bool select_left_arrow = (token.type == T_MINUSGREATER);
7332 if (token.type != T_IDENTIFIER) {
7333 parse_error_expected("while parsing select", T_IDENTIFIER, NULL);
7334 return create_invalid_expression();
7336 symbol_t *symbol = token.v.symbol;
7339 type_t *const orig_type = addr->base.type;
7340 type_t *const type = skip_typeref(orig_type);
7343 bool saw_error = false;
7344 if (is_type_pointer(type)) {
7345 if (!select_left_arrow) {
7347 "request for member '%Y' in something not a struct or union, but '%T'",
7351 type_left = skip_typeref(type->pointer.points_to);
7353 if (select_left_arrow && is_type_valid(type)) {
7354 errorf(HERE, "left hand side of '->' is not a pointer, but '%T'", orig_type);
7360 if (type_left->kind != TYPE_COMPOUND_STRUCT &&
7361 type_left->kind != TYPE_COMPOUND_UNION) {
7363 if (is_type_valid(type_left) && !saw_error) {
7365 "request for member '%Y' in something not a struct or union, but '%T'",
7368 return create_invalid_expression();
7371 compound_t *compound = type_left->compound.compound;
7372 if (!compound->complete) {
7373 errorf(HERE, "request for member '%Y' in incomplete type '%T'",
7375 return create_invalid_expression();
7378 type_qualifiers_t qualifiers = type_left->base.qualifiers;
7379 expression_t *result
7380 = find_create_select(HERE, addr, qualifiers, compound, symbol);
7382 if (result == NULL) {
7383 errorf(HERE, "'%T' has no member named '%Y'", orig_type, symbol);
7384 return create_invalid_expression();
7390 static void check_call_argument(type_t *expected_type,
7391 call_argument_t *argument, unsigned pos)
7393 type_t *expected_type_skip = skip_typeref(expected_type);
7394 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
7395 expression_t *arg_expr = argument->expression;
7396 type_t *arg_type = skip_typeref(arg_expr->base.type);
7398 /* handle transparent union gnu extension */
7399 if (is_type_union(expected_type_skip)
7400 && (get_type_modifiers(expected_type) & DM_TRANSPARENT_UNION)) {
7401 compound_t *union_decl = expected_type_skip->compound.compound;
7402 type_t *best_type = NULL;
7403 entity_t *entry = union_decl->members.entities;
7404 for ( ; entry != NULL; entry = entry->base.next) {
7405 assert(is_declaration(entry));
7406 type_t *decl_type = entry->declaration.type;
7407 error = semantic_assign(decl_type, arg_expr);
7408 if (error == ASSIGN_ERROR_INCOMPATIBLE
7409 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
7412 if (error == ASSIGN_SUCCESS) {
7413 best_type = decl_type;
7414 } else if (best_type == NULL) {
7415 best_type = decl_type;
7419 if (best_type != NULL) {
7420 expected_type = best_type;
7424 error = semantic_assign(expected_type, arg_expr);
7425 argument->expression = create_implicit_cast(arg_expr, expected_type);
7427 if (error != ASSIGN_SUCCESS) {
7428 /* report exact scope in error messages (like "in argument 3") */
7430 snprintf(buf, sizeof(buf), "call argument %u", pos);
7431 report_assign_error(error, expected_type, arg_expr, buf,
7432 &arg_expr->base.source_position);
7433 } else if (warning.traditional || warning.conversion) {
7434 type_t *const promoted_type = get_default_promoted_type(arg_type);
7435 if (!types_compatible(expected_type_skip, promoted_type) &&
7436 !types_compatible(expected_type_skip, type_void_ptr) &&
7437 !types_compatible(type_void_ptr, promoted_type)) {
7438 /* Deliberately show the skipped types in this warning */
7439 warningf(&arg_expr->base.source_position,
7440 "passing call argument %u as '%T' rather than '%T' due to prototype",
7441 pos, expected_type_skip, promoted_type);
7447 * Handle the semantic restrictions of builtin calls
7449 static void handle_builtin_argument_restrictions(call_expression_t *call) {
7450 switch (call->function->reference.entity->function.btk) {
7451 case bk_gnu_builtin_return_address:
7452 case bk_gnu_builtin_frame_address: {
7453 /* argument must be constant */
7454 call_argument_t *argument = call->arguments;
7456 if (! is_constant_expression(argument->expression)) {
7457 errorf(&call->base.source_position,
7458 "argument of '%Y' must be a constant expression",
7459 call->function->reference.entity->base.symbol);
7463 case bk_gnu_builtin_prefetch: {
7464 /* second and third argument must be constant if existent */
7465 call_argument_t *rw = call->arguments->next;
7466 call_argument_t *locality = NULL;
7469 if (! is_constant_expression(rw->expression)) {
7470 errorf(&call->base.source_position,
7471 "second argument of '%Y' must be a constant expression",
7472 call->function->reference.entity->base.symbol);
7474 locality = rw->next;
7476 if (locality != NULL) {
7477 if (! is_constant_expression(locality->expression)) {
7478 errorf(&call->base.source_position,
7479 "third argument of '%Y' must be a constant expression",
7480 call->function->reference.entity->base.symbol);
7482 locality = rw->next;
7492 * Parse a call expression, ie. expression '( ... )'.
7494 * @param expression the function address
7496 static expression_t *parse_call_expression(expression_t *expression)
7498 expression_t *result = allocate_expression_zero(EXPR_CALL);
7499 call_expression_t *call = &result->call;
7500 call->function = expression;
7502 type_t *const orig_type = expression->base.type;
7503 type_t *const type = skip_typeref(orig_type);
7505 function_type_t *function_type = NULL;
7506 if (is_type_pointer(type)) {
7507 type_t *const to_type = skip_typeref(type->pointer.points_to);
7509 if (is_type_function(to_type)) {
7510 function_type = &to_type->function;
7511 call->base.type = function_type->return_type;
7515 if (function_type == NULL && is_type_valid(type)) {
7517 "called object '%E' (type '%T') is not a pointer to a function",
7518 expression, orig_type);
7521 /* parse arguments */
7523 add_anchor_token(')');
7524 add_anchor_token(',');
7526 if (token.type != ')') {
7527 call_argument_t **anchor = &call->arguments;
7529 call_argument_t *argument = allocate_ast_zero(sizeof(*argument));
7530 argument->expression = parse_assignment_expression();
7533 anchor = &argument->next;
7535 if (token.type != ',')
7540 rem_anchor_token(',');
7541 rem_anchor_token(')');
7542 expect(')', end_error);
7544 if (function_type == NULL)
7547 /* check type and count of call arguments */
7548 function_parameter_t *parameter = function_type->parameters;
7549 call_argument_t *argument = call->arguments;
7550 if (!function_type->unspecified_parameters) {
7551 for (unsigned pos = 0; parameter != NULL && argument != NULL;
7552 parameter = parameter->next, argument = argument->next) {
7553 check_call_argument(parameter->type, argument, ++pos);
7556 if (parameter != NULL) {
7557 errorf(HERE, "too few arguments to function '%E'", expression);
7558 } else if (argument != NULL && !function_type->variadic) {
7559 errorf(HERE, "too many arguments to function '%E'", expression);
7563 /* do default promotion for other arguments */
7564 for (; argument != NULL; argument = argument->next) {
7565 type_t *type = argument->expression->base.type;
7567 type = get_default_promoted_type(type);
7569 argument->expression
7570 = create_implicit_cast(argument->expression, type);
7573 check_format(&result->call);
7575 if (warning.aggregate_return &&
7576 is_type_compound(skip_typeref(function_type->return_type))) {
7577 warningf(&result->base.source_position,
7578 "function call has aggregate value");
7581 if (call->function->kind == EXPR_REFERENCE) {
7582 reference_expression_t *reference = &call->function->reference;
7583 if (reference->entity->kind == ENTITY_FUNCTION &&
7584 reference->entity->function.btk != bk_none)
7585 handle_builtin_argument_restrictions(call);
7592 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
7594 static bool same_compound_type(const type_t *type1, const type_t *type2)
7597 is_type_compound(type1) &&
7598 type1->kind == type2->kind &&
7599 type1->compound.compound == type2->compound.compound;
7602 static expression_t const *get_reference_address(expression_t const *expr)
7604 bool regular_take_address = true;
7606 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7607 expr = expr->unary.value;
7609 regular_take_address = false;
7612 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7615 expr = expr->unary.value;
7618 if (expr->kind != EXPR_REFERENCE)
7621 /* special case for functions which are automatically converted to a
7622 * pointer to function without an extra TAKE_ADDRESS operation */
7623 if (!regular_take_address &&
7624 expr->reference.entity->kind != ENTITY_FUNCTION) {
7631 static void warn_reference_address_as_bool(expression_t const* expr)
7633 if (!warning.address)
7636 expr = get_reference_address(expr);
7638 warningf(&expr->base.source_position,
7639 "the address of '%Y' will always evaluate as 'true'",
7640 expr->reference.entity->base.symbol);
7644 static void warn_assignment_in_condition(const expression_t *const expr)
7646 if (!warning.parentheses)
7648 if (expr->base.kind != EXPR_BINARY_ASSIGN)
7650 if (expr->base.parenthesized)
7652 warningf(&expr->base.source_position,
7653 "suggest parentheses around assignment used as truth value");
7656 static void semantic_condition(expression_t const *const expr,
7657 char const *const context)
7659 type_t *const type = skip_typeref(expr->base.type);
7660 if (is_type_scalar(type)) {
7661 warn_reference_address_as_bool(expr);
7662 warn_assignment_in_condition(expr);
7663 } else if (is_type_valid(type)) {
7664 errorf(&expr->base.source_position,
7665 "%s must have scalar type", context);
7670 * Parse a conditional expression, ie. 'expression ? ... : ...'.
7672 * @param expression the conditional expression
7674 static expression_t *parse_conditional_expression(expression_t *expression)
7676 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
7678 conditional_expression_t *conditional = &result->conditional;
7679 conditional->condition = expression;
7682 add_anchor_token(':');
7684 /* §6.5.15:2 The first operand shall have scalar type. */
7685 semantic_condition(expression, "condition of conditional operator");
7687 expression_t *true_expression = expression;
7688 bool gnu_cond = false;
7689 if (GNU_MODE && token.type == ':') {
7692 true_expression = parse_expression();
7694 rem_anchor_token(':');
7695 expect(':', end_error);
7697 expression_t *false_expression =
7698 parse_sub_expression(c_mode & _CXX ? PREC_ASSIGNMENT : PREC_CONDITIONAL);
7700 type_t *const orig_true_type = true_expression->base.type;
7701 type_t *const orig_false_type = false_expression->base.type;
7702 type_t *const true_type = skip_typeref(orig_true_type);
7703 type_t *const false_type = skip_typeref(orig_false_type);
7706 type_t *result_type;
7707 if (is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7708 is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
7709 /* ISO/IEC 14882:1998(E) §5.16:2 */
7710 if (true_expression->kind == EXPR_UNARY_THROW) {
7711 result_type = false_type;
7712 } else if (false_expression->kind == EXPR_UNARY_THROW) {
7713 result_type = true_type;
7715 if (warning.other && (
7716 !is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
7717 !is_type_atomic(false_type, ATOMIC_TYPE_VOID)
7719 warningf(&conditional->base.source_position,
7720 "ISO C forbids conditional expression with only one void side");
7722 result_type = type_void;
7724 } else if (is_type_arithmetic(true_type)
7725 && is_type_arithmetic(false_type)) {
7726 result_type = semantic_arithmetic(true_type, false_type);
7728 true_expression = create_implicit_cast(true_expression, result_type);
7729 false_expression = create_implicit_cast(false_expression, result_type);
7731 conditional->true_expression = true_expression;
7732 conditional->false_expression = false_expression;
7733 conditional->base.type = result_type;
7734 } else if (same_compound_type(true_type, false_type)) {
7735 /* just take 1 of the 2 types */
7736 result_type = true_type;
7737 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
7738 type_t *pointer_type;
7740 expression_t *other_expression;
7741 if (is_type_pointer(true_type) &&
7742 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
7743 pointer_type = true_type;
7744 other_type = false_type;
7745 other_expression = false_expression;
7747 pointer_type = false_type;
7748 other_type = true_type;
7749 other_expression = true_expression;
7752 if (is_null_pointer_constant(other_expression)) {
7753 result_type = pointer_type;
7754 } else if (is_type_pointer(other_type)) {
7755 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
7756 type_t *to2 = skip_typeref(other_type->pointer.points_to);
7759 if (is_type_atomic(to1, ATOMIC_TYPE_VOID) ||
7760 is_type_atomic(to2, ATOMIC_TYPE_VOID)) {
7762 } else if (types_compatible(get_unqualified_type(to1),
7763 get_unqualified_type(to2))) {
7766 if (warning.other) {
7767 warningf(&conditional->base.source_position,
7768 "pointer types '%T' and '%T' in conditional expression are incompatible",
7769 true_type, false_type);
7774 type_t *const type =
7775 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
7776 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7777 } else if (is_type_integer(other_type)) {
7778 if (warning.other) {
7779 warningf(&conditional->base.source_position,
7780 "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7782 result_type = pointer_type;
7784 if (is_type_valid(other_type)) {
7785 type_error_incompatible("while parsing conditional",
7786 &expression->base.source_position, true_type, false_type);
7788 result_type = type_error_type;
7791 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7792 type_error_incompatible("while parsing conditional",
7793 &conditional->base.source_position, true_type,
7796 result_type = type_error_type;
7799 conditional->true_expression
7800 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7801 conditional->false_expression
7802 = create_implicit_cast(false_expression, result_type);
7803 conditional->base.type = result_type;
7808 * Parse an extension expression.
7810 static expression_t *parse_extension(void)
7812 eat(T___extension__);
7814 bool old_gcc_extension = in_gcc_extension;
7815 in_gcc_extension = true;
7816 expression_t *expression = parse_sub_expression(PREC_UNARY);
7817 in_gcc_extension = old_gcc_extension;
7822 * Parse a __builtin_classify_type() expression.
7824 static expression_t *parse_builtin_classify_type(void)
7826 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7827 result->base.type = type_int;
7829 eat(T___builtin_classify_type);
7831 expect('(', end_error);
7832 add_anchor_token(')');
7833 expression_t *expression = parse_expression();
7834 rem_anchor_token(')');
7835 expect(')', end_error);
7836 result->classify_type.type_expression = expression;
7840 return create_invalid_expression();
7844 * Parse a delete expression
7845 * ISO/IEC 14882:1998(E) §5.3.5
7847 static expression_t *parse_delete(void)
7849 expression_t *const result = allocate_expression_zero(EXPR_UNARY_DELETE);
7850 result->base.type = type_void;
7854 if (token.type == '[') {
7856 result->kind = EXPR_UNARY_DELETE_ARRAY;
7857 expect(']', end_error);
7861 expression_t *const value = parse_sub_expression(PREC_CAST);
7862 result->unary.value = value;
7864 type_t *const type = skip_typeref(value->base.type);
7865 if (!is_type_pointer(type)) {
7866 if (is_type_valid(type)) {
7867 errorf(&value->base.source_position,
7868 "operand of delete must have pointer type");
7870 } else if (warning.other &&
7871 is_type_atomic(skip_typeref(type->pointer.points_to), ATOMIC_TYPE_VOID)) {
7872 warningf(&value->base.source_position,
7873 "deleting 'void*' is undefined");
7880 * Parse a throw expression
7881 * ISO/IEC 14882:1998(E) §15:1
7883 static expression_t *parse_throw(void)
7885 expression_t *const result = allocate_expression_zero(EXPR_UNARY_THROW);
7886 result->base.type = type_void;
7890 expression_t *value = NULL;
7891 switch (token.type) {
7893 value = parse_assignment_expression();
7894 /* ISO/IEC 14882:1998(E) §15.1:3 */
7895 type_t *const orig_type = value->base.type;
7896 type_t *const type = skip_typeref(orig_type);
7897 if (is_type_incomplete(type)) {
7898 errorf(&value->base.source_position,
7899 "cannot throw object of incomplete type '%T'", orig_type);
7900 } else if (is_type_pointer(type)) {
7901 type_t *const points_to = skip_typeref(type->pointer.points_to);
7902 if (is_type_incomplete(points_to) &&
7903 !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7904 errorf(&value->base.source_position,
7905 "cannot throw pointer to incomplete type '%T'", orig_type);
7913 result->unary.value = value;
7918 static bool check_pointer_arithmetic(const source_position_t *source_position,
7919 type_t *pointer_type,
7920 type_t *orig_pointer_type)
7922 type_t *points_to = pointer_type->pointer.points_to;
7923 points_to = skip_typeref(points_to);
7925 if (is_type_incomplete(points_to)) {
7926 if (!GNU_MODE || !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7927 errorf(source_position,
7928 "arithmetic with pointer to incomplete type '%T' not allowed",
7931 } else if (warning.pointer_arith) {
7932 warningf(source_position,
7933 "pointer of type '%T' used in arithmetic",
7936 } else if (is_type_function(points_to)) {
7938 errorf(source_position,
7939 "arithmetic with pointer to function type '%T' not allowed",
7942 } else if (warning.pointer_arith) {
7943 warningf(source_position,
7944 "pointer to a function '%T' used in arithmetic",
7951 static bool is_lvalue(const expression_t *expression)
7953 /* TODO: doesn't seem to be consistent with §6.3.2.1:1 */
7954 switch (expression->kind) {
7955 case EXPR_ARRAY_ACCESS:
7956 case EXPR_COMPOUND_LITERAL:
7957 case EXPR_REFERENCE:
7959 case EXPR_UNARY_DEREFERENCE:
7963 type_t *type = skip_typeref(expression->base.type);
7965 /* ISO/IEC 14882:1998(E) §3.10:3 */
7966 is_type_reference(type) ||
7967 /* Claim it is an lvalue, if the type is invalid. There was a parse
7968 * error before, which maybe prevented properly recognizing it as
7970 !is_type_valid(type);
7975 static void semantic_incdec(unary_expression_t *expression)
7977 type_t *const orig_type = expression->value->base.type;
7978 type_t *const type = skip_typeref(orig_type);
7979 if (is_type_pointer(type)) {
7980 if (!check_pointer_arithmetic(&expression->base.source_position,
7984 } else if (!is_type_real(type) && is_type_valid(type)) {
7985 /* TODO: improve error message */
7986 errorf(&expression->base.source_position,
7987 "operation needs an arithmetic or pointer type");
7990 if (!is_lvalue(expression->value)) {
7991 /* TODO: improve error message */
7992 errorf(&expression->base.source_position, "lvalue required as operand");
7994 expression->base.type = orig_type;
7997 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
7999 type_t *const orig_type = expression->value->base.type;
8000 type_t *const type = skip_typeref(orig_type);
8001 if (!is_type_arithmetic(type)) {
8002 if (is_type_valid(type)) {
8003 /* TODO: improve error message */
8004 errorf(&expression->base.source_position,
8005 "operation needs an arithmetic type");
8010 expression->base.type = orig_type;
8013 static void semantic_unexpr_plus(unary_expression_t *expression)
8015 semantic_unexpr_arithmetic(expression);
8016 if (warning.traditional)
8017 warningf(&expression->base.source_position,
8018 "traditional C rejects the unary plus operator");
8021 static void semantic_not(unary_expression_t *expression)
8023 /* §6.5.3.3:1 The operand [...] of the ! operator, scalar type. */
8024 semantic_condition(expression->value, "operand of !");
8025 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8028 static void semantic_unexpr_integer(unary_expression_t *expression)
8030 type_t *const orig_type = expression->value->base.type;
8031 type_t *const type = skip_typeref(orig_type);
8032 if (!is_type_integer(type)) {
8033 if (is_type_valid(type)) {
8034 errorf(&expression->base.source_position,
8035 "operand of ~ must be of integer type");
8040 expression->base.type = orig_type;
8043 static void semantic_dereference(unary_expression_t *expression)
8045 type_t *const orig_type = expression->value->base.type;
8046 type_t *const type = skip_typeref(orig_type);
8047 if (!is_type_pointer(type)) {
8048 if (is_type_valid(type)) {
8049 errorf(&expression->base.source_position,
8050 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
8055 type_t *result_type = type->pointer.points_to;
8056 result_type = automatic_type_conversion(result_type);
8057 expression->base.type = result_type;
8061 * Record that an address is taken (expression represents an lvalue).
8063 * @param expression the expression
8064 * @param may_be_register if true, the expression might be an register
8066 static void set_address_taken(expression_t *expression, bool may_be_register)
8068 if (expression->kind != EXPR_REFERENCE)
8071 entity_t *const entity = expression->reference.entity;
8073 if (entity->kind != ENTITY_VARIABLE && entity->kind != ENTITY_PARAMETER)
8076 if (entity->declaration.storage_class == STORAGE_CLASS_REGISTER
8077 && !may_be_register) {
8078 errorf(&expression->base.source_position,
8079 "address of register %s '%Y' requested",
8080 get_entity_kind_name(entity->kind), entity->base.symbol);
8083 if (entity->kind == ENTITY_VARIABLE) {
8084 entity->variable.address_taken = true;
8086 assert(entity->kind == ENTITY_PARAMETER);
8087 entity->parameter.address_taken = true;
8092 * Check the semantic of the address taken expression.
8094 static void semantic_take_addr(unary_expression_t *expression)
8096 expression_t *value = expression->value;
8097 value->base.type = revert_automatic_type_conversion(value);
8099 type_t *orig_type = value->base.type;
8100 type_t *type = skip_typeref(orig_type);
8101 if (!is_type_valid(type))
8105 if (!is_lvalue(value)) {
8106 errorf(&expression->base.source_position, "'&' requires an lvalue");
8108 if (type->kind == TYPE_BITFIELD) {
8109 errorf(&expression->base.source_position,
8110 "'&' not allowed on object with bitfield type '%T'",
8114 set_address_taken(value, false);
8116 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
8119 #define CREATE_UNARY_EXPRESSION_PARSER(token_type, unexpression_type, sfunc) \
8120 static expression_t *parse_##unexpression_type(void) \
8122 expression_t *unary_expression \
8123 = allocate_expression_zero(unexpression_type); \
8125 unary_expression->unary.value = parse_sub_expression(PREC_UNARY); \
8127 sfunc(&unary_expression->unary); \
8129 return unary_expression; \
8132 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
8133 semantic_unexpr_arithmetic)
8134 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
8135 semantic_unexpr_plus)
8136 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
8138 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
8139 semantic_dereference)
8140 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
8142 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
8143 semantic_unexpr_integer)
8144 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
8146 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
8149 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_type, unexpression_type, \
8151 static expression_t *parse_##unexpression_type(expression_t *left) \
8153 expression_t *unary_expression \
8154 = allocate_expression_zero(unexpression_type); \
8156 unary_expression->unary.value = left; \
8158 sfunc(&unary_expression->unary); \
8160 return unary_expression; \
8163 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
8164 EXPR_UNARY_POSTFIX_INCREMENT,
8166 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
8167 EXPR_UNARY_POSTFIX_DECREMENT,
8170 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
8172 /* TODO: handle complex + imaginary types */
8174 type_left = get_unqualified_type(type_left);
8175 type_right = get_unqualified_type(type_right);
8177 /* §6.3.1.8 Usual arithmetic conversions */
8178 if (type_left == type_long_double || type_right == type_long_double) {
8179 return type_long_double;
8180 } else if (type_left == type_double || type_right == type_double) {
8182 } else if (type_left == type_float || type_right == type_float) {
8186 type_left = promote_integer(type_left);
8187 type_right = promote_integer(type_right);
8189 if (type_left == type_right)
8192 bool const signed_left = is_type_signed(type_left);
8193 bool const signed_right = is_type_signed(type_right);
8194 int const rank_left = get_rank(type_left);
8195 int const rank_right = get_rank(type_right);
8197 if (signed_left == signed_right)
8198 return rank_left >= rank_right ? type_left : type_right;
8207 u_rank = rank_right;
8208 u_type = type_right;
8210 s_rank = rank_right;
8211 s_type = type_right;
8216 if (u_rank >= s_rank)
8219 /* casting rank to atomic_type_kind is a bit hacky, but makes things
8221 if (get_atomic_type_size((atomic_type_kind_t) s_rank)
8222 > get_atomic_type_size((atomic_type_kind_t) u_rank))
8226 case ATOMIC_TYPE_INT: return type_unsigned_int;
8227 case ATOMIC_TYPE_LONG: return type_unsigned_long;
8228 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
8230 default: panic("invalid atomic type");
8235 * Check the semantic restrictions for a binary expression.
8237 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
8239 expression_t *const left = expression->left;
8240 expression_t *const right = expression->right;
8241 type_t *const orig_type_left = left->base.type;
8242 type_t *const orig_type_right = right->base.type;
8243 type_t *const type_left = skip_typeref(orig_type_left);
8244 type_t *const type_right = skip_typeref(orig_type_right);
8246 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8247 /* TODO: improve error message */
8248 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8249 errorf(&expression->base.source_position,
8250 "operation needs arithmetic types");
8255 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8256 expression->left = create_implicit_cast(left, arithmetic_type);
8257 expression->right = create_implicit_cast(right, arithmetic_type);
8258 expression->base.type = arithmetic_type;
8261 static void warn_div_by_zero(binary_expression_t const *const expression)
8263 if (!warning.div_by_zero ||
8264 !is_type_integer(expression->base.type))
8267 expression_t const *const right = expression->right;
8268 /* The type of the right operand can be different for /= */
8269 if (is_type_integer(right->base.type) &&
8270 is_constant_expression(right) &&
8271 !fold_constant_to_bool(right)) {
8272 warningf(&expression->base.source_position, "division by zero");
8277 * Check the semantic restrictions for a div/mod expression.
8279 static void semantic_divmod_arithmetic(binary_expression_t *expression)
8281 semantic_binexpr_arithmetic(expression);
8282 warn_div_by_zero(expression);
8285 static void warn_addsub_in_shift(const expression_t *const expr)
8287 if (expr->base.parenthesized)
8291 switch (expr->kind) {
8292 case EXPR_BINARY_ADD: op = '+'; break;
8293 case EXPR_BINARY_SUB: op = '-'; break;
8297 warningf(&expr->base.source_position,
8298 "suggest parentheses around '%c' inside shift", op);
8301 static bool semantic_shift(binary_expression_t *expression)
8303 expression_t *const left = expression->left;
8304 expression_t *const right = expression->right;
8305 type_t *const orig_type_left = left->base.type;
8306 type_t *const orig_type_right = right->base.type;
8307 type_t * type_left = skip_typeref(orig_type_left);
8308 type_t * type_right = skip_typeref(orig_type_right);
8310 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8311 /* TODO: improve error message */
8312 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8313 errorf(&expression->base.source_position,
8314 "operands of shift operation must have integer types");
8319 type_left = promote_integer(type_left);
8321 if (is_constant_expression(right)) {
8322 long count = fold_constant_to_int(right);
8324 warningf(&right->base.source_position,
8325 "shift count must be non-negative");
8326 } else if ((unsigned long)count >=
8327 get_atomic_type_size(type_left->atomic.akind) * 8) {
8328 warningf(&right->base.source_position,
8329 "shift count must be less than type width");
8333 type_right = promote_integer(type_right);
8334 expression->right = create_implicit_cast(right, type_right);
8339 static void semantic_shift_op(binary_expression_t *expression)
8341 expression_t *const left = expression->left;
8342 expression_t *const right = expression->right;
8344 if (!semantic_shift(expression))
8347 if (warning.parentheses) {
8348 warn_addsub_in_shift(left);
8349 warn_addsub_in_shift(right);
8352 type_t *const orig_type_left = left->base.type;
8353 type_t * type_left = skip_typeref(orig_type_left);
8355 type_left = promote_integer(type_left);
8356 expression->left = create_implicit_cast(left, type_left);
8357 expression->base.type = type_left;
8360 static void semantic_add(binary_expression_t *expression)
8362 expression_t *const left = expression->left;
8363 expression_t *const right = expression->right;
8364 type_t *const orig_type_left = left->base.type;
8365 type_t *const orig_type_right = right->base.type;
8366 type_t *const type_left = skip_typeref(orig_type_left);
8367 type_t *const type_right = skip_typeref(orig_type_right);
8370 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8371 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8372 expression->left = create_implicit_cast(left, arithmetic_type);
8373 expression->right = create_implicit_cast(right, arithmetic_type);
8374 expression->base.type = arithmetic_type;
8375 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8376 check_pointer_arithmetic(&expression->base.source_position,
8377 type_left, orig_type_left);
8378 expression->base.type = type_left;
8379 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
8380 check_pointer_arithmetic(&expression->base.source_position,
8381 type_right, orig_type_right);
8382 expression->base.type = type_right;
8383 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8384 errorf(&expression->base.source_position,
8385 "invalid operands to binary + ('%T', '%T')",
8386 orig_type_left, orig_type_right);
8390 static void semantic_sub(binary_expression_t *expression)
8392 expression_t *const left = expression->left;
8393 expression_t *const right = expression->right;
8394 type_t *const orig_type_left = left->base.type;
8395 type_t *const orig_type_right = right->base.type;
8396 type_t *const type_left = skip_typeref(orig_type_left);
8397 type_t *const type_right = skip_typeref(orig_type_right);
8398 source_position_t const *const pos = &expression->base.source_position;
8401 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8402 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8403 expression->left = create_implicit_cast(left, arithmetic_type);
8404 expression->right = create_implicit_cast(right, arithmetic_type);
8405 expression->base.type = arithmetic_type;
8406 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8407 check_pointer_arithmetic(&expression->base.source_position,
8408 type_left, orig_type_left);
8409 expression->base.type = type_left;
8410 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8411 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
8412 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
8413 if (!types_compatible(unqual_left, unqual_right)) {
8415 "subtracting pointers to incompatible types '%T' and '%T'",
8416 orig_type_left, orig_type_right);
8417 } else if (!is_type_object(unqual_left)) {
8418 if (!is_type_atomic(unqual_left, ATOMIC_TYPE_VOID)) {
8419 errorf(pos, "subtracting pointers to non-object types '%T'",
8421 } else if (warning.other) {
8422 warningf(pos, "subtracting pointers to void");
8425 expression->base.type = type_ptrdiff_t;
8426 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8427 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
8428 orig_type_left, orig_type_right);
8432 static void warn_string_literal_address(expression_t const* expr)
8434 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
8435 expr = expr->unary.value;
8436 if (expr->kind != EXPR_UNARY_DEREFERENCE)
8438 expr = expr->unary.value;
8441 if (expr->kind == EXPR_STRING_LITERAL ||
8442 expr->kind == EXPR_WIDE_STRING_LITERAL) {
8443 warningf(&expr->base.source_position,
8444 "comparison with string literal results in unspecified behaviour");
8448 static void warn_comparison_in_comparison(const expression_t *const expr)
8450 if (expr->base.parenthesized)
8452 switch (expr->base.kind) {
8453 case EXPR_BINARY_LESS:
8454 case EXPR_BINARY_GREATER:
8455 case EXPR_BINARY_LESSEQUAL:
8456 case EXPR_BINARY_GREATEREQUAL:
8457 case EXPR_BINARY_NOTEQUAL:
8458 case EXPR_BINARY_EQUAL:
8459 warningf(&expr->base.source_position,
8460 "comparisons like 'x <= y < z' do not have their mathematical meaning");
8467 static bool maybe_negative(expression_t const *const expr)
8470 !is_constant_expression(expr) ||
8471 fold_constant_to_int(expr) < 0;
8475 * Check the semantics of comparison expressions.
8477 * @param expression The expression to check.
8479 static void semantic_comparison(binary_expression_t *expression)
8481 expression_t *left = expression->left;
8482 expression_t *right = expression->right;
8484 if (warning.address) {
8485 warn_string_literal_address(left);
8486 warn_string_literal_address(right);
8488 expression_t const* const func_left = get_reference_address(left);
8489 if (func_left != NULL && is_null_pointer_constant(right)) {
8490 warningf(&expression->base.source_position,
8491 "the address of '%Y' will never be NULL",
8492 func_left->reference.entity->base.symbol);
8495 expression_t const* const func_right = get_reference_address(right);
8496 if (func_right != NULL && is_null_pointer_constant(right)) {
8497 warningf(&expression->base.source_position,
8498 "the address of '%Y' will never be NULL",
8499 func_right->reference.entity->base.symbol);
8503 if (warning.parentheses) {
8504 warn_comparison_in_comparison(left);
8505 warn_comparison_in_comparison(right);
8508 type_t *orig_type_left = left->base.type;
8509 type_t *orig_type_right = right->base.type;
8510 type_t *type_left = skip_typeref(orig_type_left);
8511 type_t *type_right = skip_typeref(orig_type_right);
8513 /* TODO non-arithmetic types */
8514 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8515 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8517 /* test for signed vs unsigned compares */
8518 if (warning.sign_compare && is_type_integer(arithmetic_type)) {
8519 bool const signed_left = is_type_signed(type_left);
8520 bool const signed_right = is_type_signed(type_right);
8521 if (signed_left != signed_right) {
8522 /* FIXME long long needs better const folding magic */
8523 /* TODO check whether constant value can be represented by other type */
8524 if ((signed_left && maybe_negative(left)) ||
8525 (signed_right && maybe_negative(right))) {
8526 warningf(&expression->base.source_position,
8527 "comparison between signed and unsigned");
8532 expression->left = create_implicit_cast(left, arithmetic_type);
8533 expression->right = create_implicit_cast(right, arithmetic_type);
8534 expression->base.type = arithmetic_type;
8535 if (warning.float_equal &&
8536 (expression->base.kind == EXPR_BINARY_EQUAL ||
8537 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
8538 is_type_float(arithmetic_type)) {
8539 warningf(&expression->base.source_position,
8540 "comparing floating point with == or != is unsafe");
8542 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8543 /* TODO check compatibility */
8544 } else if (is_type_pointer(type_left)) {
8545 expression->right = create_implicit_cast(right, type_left);
8546 } else if (is_type_pointer(type_right)) {
8547 expression->left = create_implicit_cast(left, type_right);
8548 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8549 type_error_incompatible("invalid operands in comparison",
8550 &expression->base.source_position,
8551 type_left, type_right);
8553 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8557 * Checks if a compound type has constant fields.
8559 static bool has_const_fields(const compound_type_t *type)
8561 compound_t *compound = type->compound;
8562 entity_t *entry = compound->members.entities;
8564 for (; entry != NULL; entry = entry->base.next) {
8565 if (!is_declaration(entry))
8568 const type_t *decl_type = skip_typeref(entry->declaration.type);
8569 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
8576 static bool is_valid_assignment_lhs(expression_t const* const left)
8578 type_t *const orig_type_left = revert_automatic_type_conversion(left);
8579 type_t *const type_left = skip_typeref(orig_type_left);
8581 if (!is_lvalue(left)) {
8582 errorf(HERE, "left hand side '%E' of assignment is not an lvalue",
8587 if (left->kind == EXPR_REFERENCE
8588 && left->reference.entity->kind == ENTITY_FUNCTION) {
8589 errorf(HERE, "cannot assign to function '%E'", left);
8593 if (is_type_array(type_left)) {
8594 errorf(HERE, "cannot assign to array '%E'", left);
8597 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
8598 errorf(HERE, "assignment to readonly location '%E' (type '%T')", left,
8602 if (is_type_incomplete(type_left)) {
8603 errorf(HERE, "left-hand side '%E' of assignment has incomplete type '%T'",
8604 left, orig_type_left);
8607 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
8608 errorf(HERE, "cannot assign to '%E' because compound type '%T' has readonly fields",
8609 left, orig_type_left);
8616 static void semantic_arithmetic_assign(binary_expression_t *expression)
8618 expression_t *left = expression->left;
8619 expression_t *right = expression->right;
8620 type_t *orig_type_left = left->base.type;
8621 type_t *orig_type_right = right->base.type;
8623 if (!is_valid_assignment_lhs(left))
8626 type_t *type_left = skip_typeref(orig_type_left);
8627 type_t *type_right = skip_typeref(orig_type_right);
8629 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8630 /* TODO: improve error message */
8631 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8632 errorf(&expression->base.source_position,
8633 "operation needs arithmetic types");
8638 /* combined instructions are tricky. We can't create an implicit cast on
8639 * the left side, because we need the uncasted form for the store.
8640 * The ast2firm pass has to know that left_type must be right_type
8641 * for the arithmetic operation and create a cast by itself */
8642 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8643 expression->right = create_implicit_cast(right, arithmetic_type);
8644 expression->base.type = type_left;
8647 static void semantic_divmod_assign(binary_expression_t *expression)
8649 semantic_arithmetic_assign(expression);
8650 warn_div_by_zero(expression);
8653 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
8655 expression_t *const left = expression->left;
8656 expression_t *const right = expression->right;
8657 type_t *const orig_type_left = left->base.type;
8658 type_t *const orig_type_right = right->base.type;
8659 type_t *const type_left = skip_typeref(orig_type_left);
8660 type_t *const type_right = skip_typeref(orig_type_right);
8662 if (!is_valid_assignment_lhs(left))
8665 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8666 /* combined instructions are tricky. We can't create an implicit cast on
8667 * the left side, because we need the uncasted form for the store.
8668 * The ast2firm pass has to know that left_type must be right_type
8669 * for the arithmetic operation and create a cast by itself */
8670 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
8671 expression->right = create_implicit_cast(right, arithmetic_type);
8672 expression->base.type = type_left;
8673 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8674 check_pointer_arithmetic(&expression->base.source_position,
8675 type_left, orig_type_left);
8676 expression->base.type = type_left;
8677 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8678 errorf(&expression->base.source_position,
8679 "incompatible types '%T' and '%T' in assignment",
8680 orig_type_left, orig_type_right);
8684 static void semantic_integer_assign(binary_expression_t *expression)
8686 expression_t *left = expression->left;
8687 expression_t *right = expression->right;
8688 type_t *orig_type_left = left->base.type;
8689 type_t *orig_type_right = right->base.type;
8691 if (!is_valid_assignment_lhs(left))
8694 type_t *type_left = skip_typeref(orig_type_left);
8695 type_t *type_right = skip_typeref(orig_type_right);
8697 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8698 /* TODO: improve error message */
8699 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8700 errorf(&expression->base.source_position,
8701 "operation needs integer types");
8706 /* combined instructions are tricky. We can't create an implicit cast on
8707 * the left side, because we need the uncasted form for the store.
8708 * The ast2firm pass has to know that left_type must be right_type
8709 * for the arithmetic operation and create a cast by itself */
8710 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8711 expression->right = create_implicit_cast(right, arithmetic_type);
8712 expression->base.type = type_left;
8715 static void semantic_shift_assign(binary_expression_t *expression)
8717 expression_t *left = expression->left;
8719 if (!is_valid_assignment_lhs(left))
8722 if (!semantic_shift(expression))
8725 expression->base.type = skip_typeref(left->base.type);
8728 static void warn_logical_and_within_or(const expression_t *const expr)
8730 if (expr->base.kind != EXPR_BINARY_LOGICAL_AND)
8732 if (expr->base.parenthesized)
8734 warningf(&expr->base.source_position,
8735 "suggest parentheses around && within ||");
8739 * Check the semantic restrictions of a logical expression.
8741 static void semantic_logical_op(binary_expression_t *expression)
8743 /* §6.5.13:2 Each of the operands shall have scalar type.
8744 * §6.5.14:2 Each of the operands shall have scalar type. */
8745 semantic_condition(expression->left, "left operand of logical operator");
8746 semantic_condition(expression->right, "right operand of logical operator");
8747 if (expression->base.kind == EXPR_BINARY_LOGICAL_OR &&
8748 warning.parentheses) {
8749 warn_logical_and_within_or(expression->left);
8750 warn_logical_and_within_or(expression->right);
8752 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8756 * Check the semantic restrictions of a binary assign expression.
8758 static void semantic_binexpr_assign(binary_expression_t *expression)
8760 expression_t *left = expression->left;
8761 type_t *orig_type_left = left->base.type;
8763 if (!is_valid_assignment_lhs(left))
8766 assign_error_t error = semantic_assign(orig_type_left, expression->right);
8767 report_assign_error(error, orig_type_left, expression->right,
8768 "assignment", &left->base.source_position);
8769 expression->right = create_implicit_cast(expression->right, orig_type_left);
8770 expression->base.type = orig_type_left;
8774 * Determine if the outermost operation (or parts thereof) of the given
8775 * expression has no effect in order to generate a warning about this fact.
8776 * Therefore in some cases this only examines some of the operands of the
8777 * expression (see comments in the function and examples below).
8779 * f() + 23; // warning, because + has no effect
8780 * x || f(); // no warning, because x controls execution of f()
8781 * x ? y : f(); // warning, because y has no effect
8782 * (void)x; // no warning to be able to suppress the warning
8783 * This function can NOT be used for an "expression has definitely no effect"-
8785 static bool expression_has_effect(const expression_t *const expr)
8787 switch (expr->kind) {
8788 case EXPR_UNKNOWN: break;
8789 case EXPR_INVALID: return true; /* do NOT warn */
8790 case EXPR_REFERENCE: return false;
8791 case EXPR_REFERENCE_ENUM_VALUE: return false;
8792 /* suppress the warning for microsoft __noop operations */
8793 case EXPR_CONST: return expr->conste.is_ms_noop;
8794 case EXPR_CHARACTER_CONSTANT: return false;
8795 case EXPR_WIDE_CHARACTER_CONSTANT: return false;
8796 case EXPR_STRING_LITERAL: return false;
8797 case EXPR_WIDE_STRING_LITERAL: return false;
8798 case EXPR_LABEL_ADDRESS: return false;
8801 const call_expression_t *const call = &expr->call;
8802 if (call->function->kind != EXPR_REFERENCE)
8805 switch (call->function->reference.entity->function.btk) {
8806 /* FIXME: which builtins have no effect? */
8807 default: return true;
8811 /* Generate the warning if either the left or right hand side of a
8812 * conditional expression has no effect */
8813 case EXPR_CONDITIONAL: {
8814 conditional_expression_t const *const cond = &expr->conditional;
8815 expression_t const *const t = cond->true_expression;
8817 (t == NULL || expression_has_effect(t)) &&
8818 expression_has_effect(cond->false_expression);
8821 case EXPR_SELECT: return false;
8822 case EXPR_ARRAY_ACCESS: return false;
8823 case EXPR_SIZEOF: return false;
8824 case EXPR_CLASSIFY_TYPE: return false;
8825 case EXPR_ALIGNOF: return false;
8827 case EXPR_FUNCNAME: return false;
8828 case EXPR_BUILTIN_CONSTANT_P: return false;
8829 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return false;
8830 case EXPR_OFFSETOF: return false;
8831 case EXPR_VA_START: return true;
8832 case EXPR_VA_ARG: return true;
8833 case EXPR_VA_COPY: return true;
8834 case EXPR_STATEMENT: return true; // TODO
8835 case EXPR_COMPOUND_LITERAL: return false;
8837 case EXPR_UNARY_NEGATE: return false;
8838 case EXPR_UNARY_PLUS: return false;
8839 case EXPR_UNARY_BITWISE_NEGATE: return false;
8840 case EXPR_UNARY_NOT: return false;
8841 case EXPR_UNARY_DEREFERENCE: return false;
8842 case EXPR_UNARY_TAKE_ADDRESS: return false;
8843 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
8844 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
8845 case EXPR_UNARY_PREFIX_INCREMENT: return true;
8846 case EXPR_UNARY_PREFIX_DECREMENT: return true;
8848 /* Treat void casts as if they have an effect in order to being able to
8849 * suppress the warning */
8850 case EXPR_UNARY_CAST: {
8851 type_t *const type = skip_typeref(expr->base.type);
8852 return is_type_atomic(type, ATOMIC_TYPE_VOID);
8855 case EXPR_UNARY_CAST_IMPLICIT: return true;
8856 case EXPR_UNARY_ASSUME: return true;
8857 case EXPR_UNARY_DELETE: return true;
8858 case EXPR_UNARY_DELETE_ARRAY: return true;
8859 case EXPR_UNARY_THROW: return true;
8861 case EXPR_BINARY_ADD: return false;
8862 case EXPR_BINARY_SUB: return false;
8863 case EXPR_BINARY_MUL: return false;
8864 case EXPR_BINARY_DIV: return false;
8865 case EXPR_BINARY_MOD: return false;
8866 case EXPR_BINARY_EQUAL: return false;
8867 case EXPR_BINARY_NOTEQUAL: return false;
8868 case EXPR_BINARY_LESS: return false;
8869 case EXPR_BINARY_LESSEQUAL: return false;
8870 case EXPR_BINARY_GREATER: return false;
8871 case EXPR_BINARY_GREATEREQUAL: return false;
8872 case EXPR_BINARY_BITWISE_AND: return false;
8873 case EXPR_BINARY_BITWISE_OR: return false;
8874 case EXPR_BINARY_BITWISE_XOR: return false;
8875 case EXPR_BINARY_SHIFTLEFT: return false;
8876 case EXPR_BINARY_SHIFTRIGHT: return false;
8877 case EXPR_BINARY_ASSIGN: return true;
8878 case EXPR_BINARY_MUL_ASSIGN: return true;
8879 case EXPR_BINARY_DIV_ASSIGN: return true;
8880 case EXPR_BINARY_MOD_ASSIGN: return true;
8881 case EXPR_BINARY_ADD_ASSIGN: return true;
8882 case EXPR_BINARY_SUB_ASSIGN: return true;
8883 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
8884 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
8885 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
8886 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
8887 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
8889 /* Only examine the right hand side of && and ||, because the left hand
8890 * side already has the effect of controlling the execution of the right
8892 case EXPR_BINARY_LOGICAL_AND:
8893 case EXPR_BINARY_LOGICAL_OR:
8894 /* Only examine the right hand side of a comma expression, because the left
8895 * hand side has a separate warning */
8896 case EXPR_BINARY_COMMA:
8897 return expression_has_effect(expr->binary.right);
8899 case EXPR_BINARY_ISGREATER: return false;
8900 case EXPR_BINARY_ISGREATEREQUAL: return false;
8901 case EXPR_BINARY_ISLESS: return false;
8902 case EXPR_BINARY_ISLESSEQUAL: return false;
8903 case EXPR_BINARY_ISLESSGREATER: return false;
8904 case EXPR_BINARY_ISUNORDERED: return false;
8907 internal_errorf(HERE, "unexpected expression");
8910 static void semantic_comma(binary_expression_t *expression)
8912 if (warning.unused_value) {
8913 const expression_t *const left = expression->left;
8914 if (!expression_has_effect(left)) {
8915 warningf(&left->base.source_position,
8916 "left-hand operand of comma expression has no effect");
8919 expression->base.type = expression->right->base.type;
8923 * @param prec_r precedence of the right operand
8925 #define CREATE_BINEXPR_PARSER(token_type, binexpression_type, prec_r, sfunc) \
8926 static expression_t *parse_##binexpression_type(expression_t *left) \
8928 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
8929 binexpr->binary.left = left; \
8932 expression_t *right = parse_sub_expression(prec_r); \
8934 binexpr->binary.right = right; \
8935 sfunc(&binexpr->binary); \
8940 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, PREC_CAST, semantic_binexpr_arithmetic)
8941 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, PREC_CAST, semantic_divmod_arithmetic)
8942 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, PREC_CAST, semantic_divmod_arithmetic)
8943 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, PREC_MULTIPLICATIVE, semantic_add)
8944 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, PREC_MULTIPLICATIVE, semantic_sub)
8945 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT, PREC_ADDITIVE, semantic_shift_op)
8946 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT, PREC_ADDITIVE, semantic_shift_op)
8947 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, PREC_SHIFT, semantic_comparison)
8948 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, PREC_SHIFT, semantic_comparison)
8949 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL, PREC_SHIFT, semantic_comparison)
8950 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL, PREC_SHIFT, semantic_comparison)
8951 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL, PREC_RELATIONAL, semantic_comparison)
8952 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL, PREC_RELATIONAL, semantic_comparison)
8953 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND, PREC_EQUALITY, semantic_binexpr_arithmetic)
8954 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR, PREC_AND, semantic_binexpr_arithmetic)
8955 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR, PREC_XOR, semantic_binexpr_arithmetic)
8956 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND, PREC_OR, semantic_logical_op)
8957 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR, PREC_LOGICAL_AND, semantic_logical_op)
8958 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, PREC_ASSIGNMENT, semantic_binexpr_assign)
8959 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8960 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
8961 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
8962 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8963 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
8964 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8965 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN, PREC_ASSIGNMENT, semantic_shift_assign)
8966 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8967 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8968 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN, PREC_ASSIGNMENT, semantic_integer_assign)
8969 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, PREC_ASSIGNMENT, semantic_comma)
8972 static expression_t *parse_sub_expression(precedence_t precedence)
8974 if (token.type < 0) {
8975 return expected_expression_error();
8978 expression_parser_function_t *parser
8979 = &expression_parsers[token.type];
8980 source_position_t source_position = token.source_position;
8983 if (parser->parser != NULL) {
8984 left = parser->parser();
8986 left = parse_primary_expression();
8988 assert(left != NULL);
8989 left->base.source_position = source_position;
8992 if (token.type < 0) {
8993 return expected_expression_error();
8996 parser = &expression_parsers[token.type];
8997 if (parser->infix_parser == NULL)
8999 if (parser->infix_precedence < precedence)
9002 left = parser->infix_parser(left);
9004 assert(left != NULL);
9005 assert(left->kind != EXPR_UNKNOWN);
9006 left->base.source_position = source_position;
9013 * Parse an expression.
9015 static expression_t *parse_expression(void)
9017 return parse_sub_expression(PREC_EXPRESSION);
9021 * Register a parser for a prefix-like operator.
9023 * @param parser the parser function
9024 * @param token_type the token type of the prefix token
9026 static void register_expression_parser(parse_expression_function parser,
9029 expression_parser_function_t *entry = &expression_parsers[token_type];
9031 if (entry->parser != NULL) {
9032 diagnosticf("for token '%k'\n", (token_type_t)token_type);
9033 panic("trying to register multiple expression parsers for a token");
9035 entry->parser = parser;
9039 * Register a parser for an infix operator with given precedence.
9041 * @param parser the parser function
9042 * @param token_type the token type of the infix operator
9043 * @param precedence the precedence of the operator
9045 static void register_infix_parser(parse_expression_infix_function parser,
9046 int token_type, precedence_t precedence)
9048 expression_parser_function_t *entry = &expression_parsers[token_type];
9050 if (entry->infix_parser != NULL) {
9051 diagnosticf("for token '%k'\n", (token_type_t)token_type);
9052 panic("trying to register multiple infix expression parsers for a "
9055 entry->infix_parser = parser;
9056 entry->infix_precedence = precedence;
9060 * Initialize the expression parsers.
9062 static void init_expression_parsers(void)
9064 memset(&expression_parsers, 0, sizeof(expression_parsers));
9066 register_infix_parser(parse_array_expression, '[', PREC_POSTFIX);
9067 register_infix_parser(parse_call_expression, '(', PREC_POSTFIX);
9068 register_infix_parser(parse_select_expression, '.', PREC_POSTFIX);
9069 register_infix_parser(parse_select_expression, T_MINUSGREATER, PREC_POSTFIX);
9070 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT, T_PLUSPLUS, PREC_POSTFIX);
9071 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT, T_MINUSMINUS, PREC_POSTFIX);
9072 register_infix_parser(parse_EXPR_BINARY_MUL, '*', PREC_MULTIPLICATIVE);
9073 register_infix_parser(parse_EXPR_BINARY_DIV, '/', PREC_MULTIPLICATIVE);
9074 register_infix_parser(parse_EXPR_BINARY_MOD, '%', PREC_MULTIPLICATIVE);
9075 register_infix_parser(parse_EXPR_BINARY_ADD, '+', PREC_ADDITIVE);
9076 register_infix_parser(parse_EXPR_BINARY_SUB, '-', PREC_ADDITIVE);
9077 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, PREC_SHIFT);
9078 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, PREC_SHIFT);
9079 register_infix_parser(parse_EXPR_BINARY_LESS, '<', PREC_RELATIONAL);
9080 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', PREC_RELATIONAL);
9081 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, PREC_RELATIONAL);
9082 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, PREC_RELATIONAL);
9083 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, PREC_EQUALITY);
9084 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL, T_EXCLAMATIONMARKEQUAL, PREC_EQUALITY);
9085 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', PREC_AND);
9086 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', PREC_XOR);
9087 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', PREC_OR);
9088 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, PREC_LOGICAL_AND);
9089 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, PREC_LOGICAL_OR);
9090 register_infix_parser(parse_conditional_expression, '?', PREC_CONDITIONAL);
9091 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', PREC_ASSIGNMENT);
9092 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, PREC_ASSIGNMENT);
9093 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, PREC_ASSIGNMENT);
9094 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, PREC_ASSIGNMENT);
9095 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, PREC_ASSIGNMENT);
9096 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, PREC_ASSIGNMENT);
9097 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN, T_LESSLESSEQUAL, PREC_ASSIGNMENT);
9098 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN, T_GREATERGREATEREQUAL, PREC_ASSIGNMENT);
9099 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN, T_ANDEQUAL, PREC_ASSIGNMENT);
9100 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN, T_PIPEEQUAL, PREC_ASSIGNMENT);
9101 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN, T_CARETEQUAL, PREC_ASSIGNMENT);
9102 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', PREC_EXPRESSION);
9104 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-');
9105 register_expression_parser(parse_EXPR_UNARY_PLUS, '+');
9106 register_expression_parser(parse_EXPR_UNARY_NOT, '!');
9107 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~');
9108 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*');
9109 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&');
9110 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT, T_PLUSPLUS);
9111 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT, T_MINUSMINUS);
9112 register_expression_parser(parse_sizeof, T_sizeof);
9113 register_expression_parser(parse_alignof, T___alignof__);
9114 register_expression_parser(parse_extension, T___extension__);
9115 register_expression_parser(parse_builtin_classify_type, T___builtin_classify_type);
9116 register_expression_parser(parse_delete, T_delete);
9117 register_expression_parser(parse_throw, T_throw);
9121 * Parse a asm statement arguments specification.
9123 static asm_argument_t *parse_asm_arguments(bool is_out)
9125 asm_argument_t *result = NULL;
9126 asm_argument_t **anchor = &result;
9128 while (token.type == T_STRING_LITERAL || token.type == '[') {
9129 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
9130 memset(argument, 0, sizeof(argument[0]));
9132 if (token.type == '[') {
9134 if (token.type != T_IDENTIFIER) {
9135 parse_error_expected("while parsing asm argument",
9136 T_IDENTIFIER, NULL);
9139 argument->symbol = token.v.symbol;
9141 expect(']', end_error);
9144 argument->constraints = parse_string_literals();
9145 expect('(', end_error);
9146 add_anchor_token(')');
9147 expression_t *expression = parse_expression();
9148 rem_anchor_token(')');
9150 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
9151 * change size or type representation (e.g. int -> long is ok, but
9152 * int -> float is not) */
9153 if (expression->kind == EXPR_UNARY_CAST) {
9154 type_t *const type = expression->base.type;
9155 type_kind_t const kind = type->kind;
9156 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
9159 if (kind == TYPE_ATOMIC) {
9160 atomic_type_kind_t const akind = type->atomic.akind;
9161 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9162 size = get_atomic_type_size(akind);
9164 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9165 size = get_atomic_type_size(get_intptr_kind());
9169 expression_t *const value = expression->unary.value;
9170 type_t *const value_type = value->base.type;
9171 type_kind_t const value_kind = value_type->kind;
9173 unsigned value_flags;
9174 unsigned value_size;
9175 if (value_kind == TYPE_ATOMIC) {
9176 atomic_type_kind_t const value_akind = value_type->atomic.akind;
9177 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9178 value_size = get_atomic_type_size(value_akind);
9179 } else if (value_kind == TYPE_POINTER) {
9180 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9181 value_size = get_atomic_type_size(get_intptr_kind());
9186 if (value_flags != flags || value_size != size)
9190 } while (expression->kind == EXPR_UNARY_CAST);
9194 if (!is_lvalue(expression)) {
9195 errorf(&expression->base.source_position,
9196 "asm output argument is not an lvalue");
9199 if (argument->constraints.begin[0] == '+')
9200 mark_vars_read(expression, NULL);
9202 mark_vars_read(expression, NULL);
9204 argument->expression = expression;
9205 expect(')', end_error);
9207 set_address_taken(expression, true);
9210 anchor = &argument->next;
9212 if (token.type != ',')
9223 * Parse a asm statement clobber specification.
9225 static asm_clobber_t *parse_asm_clobbers(void)
9227 asm_clobber_t *result = NULL;
9228 asm_clobber_t *last = NULL;
9230 while (token.type == T_STRING_LITERAL) {
9231 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
9232 clobber->clobber = parse_string_literals();
9235 last->next = clobber;
9241 if (token.type != ',')
9250 * Parse an asm statement.
9252 static statement_t *parse_asm_statement(void)
9254 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
9255 asm_statement_t *asm_statement = &statement->asms;
9259 if (token.type == T_volatile) {
9261 asm_statement->is_volatile = true;
9264 expect('(', end_error);
9265 add_anchor_token(')');
9266 add_anchor_token(':');
9267 asm_statement->asm_text = parse_string_literals();
9269 if (token.type != ':') {
9270 rem_anchor_token(':');
9275 asm_statement->outputs = parse_asm_arguments(true);
9276 if (token.type != ':') {
9277 rem_anchor_token(':');
9282 asm_statement->inputs = parse_asm_arguments(false);
9283 if (token.type != ':') {
9284 rem_anchor_token(':');
9287 rem_anchor_token(':');
9290 asm_statement->clobbers = parse_asm_clobbers();
9293 rem_anchor_token(')');
9294 expect(')', end_error);
9295 expect(';', end_error);
9297 if (asm_statement->outputs == NULL) {
9298 /* GCC: An 'asm' instruction without any output operands will be treated
9299 * identically to a volatile 'asm' instruction. */
9300 asm_statement->is_volatile = true;
9305 return create_invalid_statement();
9309 * Parse a case statement.
9311 static statement_t *parse_case_statement(void)
9313 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9314 source_position_t *const pos = &statement->base.source_position;
9318 expression_t *const expression = parse_expression();
9319 statement->case_label.expression = expression;
9320 if (!is_constant_expression(expression)) {
9321 /* This check does not prevent the error message in all cases of an
9322 * prior error while parsing the expression. At least it catches the
9323 * common case of a mistyped enum entry. */
9324 if (is_type_valid(skip_typeref(expression->base.type))) {
9325 errorf(pos, "case label does not reduce to an integer constant");
9327 statement->case_label.is_bad = true;
9329 long const val = fold_constant_to_int(expression);
9330 statement->case_label.first_case = val;
9331 statement->case_label.last_case = val;
9335 if (token.type == T_DOTDOTDOT) {
9337 expression_t *const end_range = parse_expression();
9338 statement->case_label.end_range = end_range;
9339 if (!is_constant_expression(end_range)) {
9340 /* This check does not prevent the error message in all cases of an
9341 * prior error while parsing the expression. At least it catches the
9342 * common case of a mistyped enum entry. */
9343 if (is_type_valid(skip_typeref(end_range->base.type))) {
9344 errorf(pos, "case range does not reduce to an integer constant");
9346 statement->case_label.is_bad = true;
9348 long const val = fold_constant_to_int(end_range);
9349 statement->case_label.last_case = val;
9351 if (warning.other && val < statement->case_label.first_case) {
9352 statement->case_label.is_empty_range = true;
9353 warningf(pos, "empty range specified");
9359 PUSH_PARENT(statement);
9361 expect(':', end_error);
9364 if (current_switch != NULL) {
9365 if (! statement->case_label.is_bad) {
9366 /* Check for duplicate case values */
9367 case_label_statement_t *c = &statement->case_label;
9368 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
9369 if (l->is_bad || l->is_empty_range || l->expression == NULL)
9372 if (c->last_case < l->first_case || c->first_case > l->last_case)
9375 errorf(pos, "duplicate case value (previously used %P)",
9376 &l->base.source_position);
9380 /* link all cases into the switch statement */
9381 if (current_switch->last_case == NULL) {
9382 current_switch->first_case = &statement->case_label;
9384 current_switch->last_case->next = &statement->case_label;
9386 current_switch->last_case = &statement->case_label;
9388 errorf(pos, "case label not within a switch statement");
9391 statement_t *const inner_stmt = parse_statement();
9392 statement->case_label.statement = inner_stmt;
9393 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9394 errorf(&inner_stmt->base.source_position, "declaration after case label");
9402 * Parse a default statement.
9404 static statement_t *parse_default_statement(void)
9406 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9410 PUSH_PARENT(statement);
9412 expect(':', end_error);
9413 if (current_switch != NULL) {
9414 const case_label_statement_t *def_label = current_switch->default_label;
9415 if (def_label != NULL) {
9416 errorf(HERE, "multiple default labels in one switch (previous declared %P)",
9417 &def_label->base.source_position);
9419 current_switch->default_label = &statement->case_label;
9421 /* link all cases into the switch statement */
9422 if (current_switch->last_case == NULL) {
9423 current_switch->first_case = &statement->case_label;
9425 current_switch->last_case->next = &statement->case_label;
9427 current_switch->last_case = &statement->case_label;
9430 errorf(&statement->base.source_position,
9431 "'default' label not within a switch statement");
9434 statement_t *const inner_stmt = parse_statement();
9435 statement->case_label.statement = inner_stmt;
9436 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9437 errorf(&inner_stmt->base.source_position, "declaration after default label");
9444 return create_invalid_statement();
9448 * Parse a label statement.
9450 static statement_t *parse_label_statement(void)
9452 assert(token.type == T_IDENTIFIER);
9453 symbol_t *symbol = token.v.symbol;
9454 label_t *label = get_label(symbol);
9456 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
9457 statement->label.label = label;
9461 PUSH_PARENT(statement);
9463 /* if statement is already set then the label is defined twice,
9464 * otherwise it was just mentioned in a goto/local label declaration so far
9466 if (label->statement != NULL) {
9467 errorf(HERE, "duplicate label '%Y' (declared %P)",
9468 symbol, &label->base.source_position);
9470 label->base.source_position = token.source_position;
9471 label->statement = statement;
9476 if (token.type == '}') {
9477 /* TODO only warn? */
9478 if (warning.other && false) {
9479 warningf(HERE, "label at end of compound statement");
9480 statement->label.statement = create_empty_statement();
9482 errorf(HERE, "label at end of compound statement");
9483 statement->label.statement = create_invalid_statement();
9485 } else if (token.type == ';') {
9486 /* Eat an empty statement here, to avoid the warning about an empty
9487 * statement after a label. label:; is commonly used to have a label
9488 * before a closing brace. */
9489 statement->label.statement = create_empty_statement();
9492 statement_t *const inner_stmt = parse_statement();
9493 statement->label.statement = inner_stmt;
9494 if (inner_stmt->kind == STATEMENT_DECLARATION) {
9495 errorf(&inner_stmt->base.source_position, "declaration after label");
9499 /* remember the labels in a list for later checking */
9500 *label_anchor = &statement->label;
9501 label_anchor = &statement->label.next;
9508 * Parse an if statement.
9510 static statement_t *parse_if(void)
9512 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
9516 PUSH_PARENT(statement);
9518 add_anchor_token('{');
9520 expect('(', end_error);
9521 add_anchor_token(')');
9522 expression_t *const expr = parse_expression();
9523 statement->ifs.condition = expr;
9524 /* §6.8.4.1:1 The controlling expression of an if statement shall have
9526 semantic_condition(expr, "condition of 'if'-statment");
9527 mark_vars_read(expr, NULL);
9528 rem_anchor_token(')');
9529 expect(')', end_error);
9532 rem_anchor_token('{');
9534 add_anchor_token(T_else);
9535 statement_t *const true_stmt = parse_statement();
9536 statement->ifs.true_statement = true_stmt;
9537 rem_anchor_token(T_else);
9539 if (token.type == T_else) {
9541 statement->ifs.false_statement = parse_statement();
9542 } else if (warning.parentheses &&
9543 true_stmt->kind == STATEMENT_IF &&
9544 true_stmt->ifs.false_statement != NULL) {
9545 warningf(&true_stmt->base.source_position,
9546 "suggest explicit braces to avoid ambiguous 'else'");
9554 * Check that all enums are handled in a switch.
9556 * @param statement the switch statement to check
9558 static void check_enum_cases(const switch_statement_t *statement)
9560 const type_t *type = skip_typeref(statement->expression->base.type);
9561 if (! is_type_enum(type))
9563 const enum_type_t *enumt = &type->enumt;
9565 /* if we have a default, no warnings */
9566 if (statement->default_label != NULL)
9569 /* FIXME: calculation of value should be done while parsing */
9570 /* TODO: quadratic algorithm here. Change to an n log n one */
9571 long last_value = -1;
9572 const entity_t *entry = enumt->enume->base.next;
9573 for (; entry != NULL && entry->kind == ENTITY_ENUM_VALUE;
9574 entry = entry->base.next) {
9575 const expression_t *expression = entry->enum_value.value;
9576 long value = expression != NULL ? fold_constant_to_int(expression) : last_value + 1;
9578 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
9579 if (l->expression == NULL)
9581 if (l->first_case <= value && value <= l->last_case) {
9587 warningf(&statement->base.source_position,
9588 "enumeration value '%Y' not handled in switch",
9589 entry->base.symbol);
9596 * Parse a switch statement.
9598 static statement_t *parse_switch(void)
9600 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
9604 PUSH_PARENT(statement);
9606 expect('(', end_error);
9607 add_anchor_token(')');
9608 expression_t *const expr = parse_expression();
9609 mark_vars_read(expr, NULL);
9610 type_t * type = skip_typeref(expr->base.type);
9611 if (is_type_integer(type)) {
9612 type = promote_integer(type);
9613 if (warning.traditional) {
9614 if (get_rank(type) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
9615 warningf(&expr->base.source_position,
9616 "'%T' switch expression not converted to '%T' in ISO C",
9620 } else if (is_type_valid(type)) {
9621 errorf(&expr->base.source_position,
9622 "switch quantity is not an integer, but '%T'", type);
9623 type = type_error_type;
9625 statement->switchs.expression = create_implicit_cast(expr, type);
9626 expect(')', end_error);
9627 rem_anchor_token(')');
9629 switch_statement_t *rem = current_switch;
9630 current_switch = &statement->switchs;
9631 statement->switchs.body = parse_statement();
9632 current_switch = rem;
9634 if (warning.switch_default &&
9635 statement->switchs.default_label == NULL) {
9636 warningf(&statement->base.source_position, "switch has no default case");
9638 if (warning.switch_enum)
9639 check_enum_cases(&statement->switchs);
9645 return create_invalid_statement();
9648 static statement_t *parse_loop_body(statement_t *const loop)
9650 statement_t *const rem = current_loop;
9651 current_loop = loop;
9653 statement_t *const body = parse_statement();
9660 * Parse a while statement.
9662 static statement_t *parse_while(void)
9664 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
9668 PUSH_PARENT(statement);
9670 expect('(', end_error);
9671 add_anchor_token(')');
9672 expression_t *const cond = parse_expression();
9673 statement->whiles.condition = cond;
9674 /* §6.8.5:2 The controlling expression of an iteration statement shall
9675 * have scalar type. */
9676 semantic_condition(cond, "condition of 'while'-statement");
9677 mark_vars_read(cond, NULL);
9678 rem_anchor_token(')');
9679 expect(')', end_error);
9681 statement->whiles.body = parse_loop_body(statement);
9687 return create_invalid_statement();
9691 * Parse a do statement.
9693 static statement_t *parse_do(void)
9695 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
9699 PUSH_PARENT(statement);
9701 add_anchor_token(T_while);
9702 statement->do_while.body = parse_loop_body(statement);
9703 rem_anchor_token(T_while);
9705 expect(T_while, end_error);
9706 expect('(', end_error);
9707 add_anchor_token(')');
9708 expression_t *const cond = parse_expression();
9709 statement->do_while.condition = cond;
9710 /* §6.8.5:2 The controlling expression of an iteration statement shall
9711 * have scalar type. */
9712 semantic_condition(cond, "condition of 'do-while'-statement");
9713 mark_vars_read(cond, NULL);
9714 rem_anchor_token(')');
9715 expect(')', end_error);
9716 expect(';', end_error);
9722 return create_invalid_statement();
9726 * Parse a for statement.
9728 static statement_t *parse_for(void)
9730 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9734 expect('(', end_error1);
9735 add_anchor_token(')');
9737 PUSH_PARENT(statement);
9739 size_t const top = environment_top();
9740 scope_t *old_scope = scope_push(&statement->fors.scope);
9742 bool old_gcc_extension = in_gcc_extension;
9743 while (token.type == T___extension__) {
9745 in_gcc_extension = true;
9748 if (token.type == ';') {
9750 } else if (is_declaration_specifier(&token, false)) {
9751 parse_declaration(record_entity, DECL_FLAGS_NONE);
9753 add_anchor_token(';');
9754 expression_t *const init = parse_expression();
9755 statement->fors.initialisation = init;
9756 mark_vars_read(init, ENT_ANY);
9757 if (warning.unused_value && !expression_has_effect(init)) {
9758 warningf(&init->base.source_position,
9759 "initialisation of 'for'-statement has no effect");
9761 rem_anchor_token(';');
9762 expect(';', end_error2);
9764 in_gcc_extension = old_gcc_extension;
9766 if (token.type != ';') {
9767 add_anchor_token(';');
9768 expression_t *const cond = parse_expression();
9769 statement->fors.condition = cond;
9770 /* §6.8.5:2 The controlling expression of an iteration statement
9771 * shall have scalar type. */
9772 semantic_condition(cond, "condition of 'for'-statement");
9773 mark_vars_read(cond, NULL);
9774 rem_anchor_token(';');
9776 expect(';', end_error2);
9777 if (token.type != ')') {
9778 expression_t *const step = parse_expression();
9779 statement->fors.step = step;
9780 mark_vars_read(step, ENT_ANY);
9781 if (warning.unused_value && !expression_has_effect(step)) {
9782 warningf(&step->base.source_position,
9783 "step of 'for'-statement has no effect");
9786 expect(')', end_error2);
9787 rem_anchor_token(')');
9788 statement->fors.body = parse_loop_body(statement);
9790 assert(current_scope == &statement->fors.scope);
9791 scope_pop(old_scope);
9792 environment_pop_to(top);
9799 rem_anchor_token(')');
9800 assert(current_scope == &statement->fors.scope);
9801 scope_pop(old_scope);
9802 environment_pop_to(top);
9806 return create_invalid_statement();
9810 * Parse a goto statement.
9812 static statement_t *parse_goto(void)
9814 statement_t *statement = allocate_statement_zero(STATEMENT_GOTO);
9817 if (GNU_MODE && token.type == '*') {
9819 expression_t *expression = parse_expression();
9820 mark_vars_read(expression, NULL);
9822 /* Argh: although documentation says the expression must be of type void*,
9823 * gcc accepts anything that can be casted into void* without error */
9824 type_t *type = expression->base.type;
9826 if (type != type_error_type) {
9827 if (!is_type_pointer(type) && !is_type_integer(type)) {
9828 errorf(&expression->base.source_position,
9829 "cannot convert to a pointer type");
9830 } else if (warning.other && type != type_void_ptr) {
9831 warningf(&expression->base.source_position,
9832 "type of computed goto expression should be 'void*' not '%T'", type);
9834 expression = create_implicit_cast(expression, type_void_ptr);
9837 statement->gotos.expression = expression;
9838 } else if (token.type == T_IDENTIFIER) {
9839 symbol_t *symbol = token.v.symbol;
9841 statement->gotos.label = get_label(symbol);
9844 parse_error_expected("while parsing goto", T_IDENTIFIER, '*', NULL);
9846 parse_error_expected("while parsing goto", T_IDENTIFIER, NULL);
9851 /* remember the goto's in a list for later checking */
9852 *goto_anchor = &statement->gotos;
9853 goto_anchor = &statement->gotos.next;
9855 expect(';', end_error);
9859 return create_invalid_statement();
9863 * Parse a continue statement.
9865 static statement_t *parse_continue(void)
9867 if (current_loop == NULL) {
9868 errorf(HERE, "continue statement not within loop");
9871 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
9874 expect(';', end_error);
9881 * Parse a break statement.
9883 static statement_t *parse_break(void)
9885 if (current_switch == NULL && current_loop == NULL) {
9886 errorf(HERE, "break statement not within loop or switch");
9889 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
9892 expect(';', end_error);
9899 * Parse a __leave statement.
9901 static statement_t *parse_leave_statement(void)
9903 if (current_try == NULL) {
9904 errorf(HERE, "__leave statement not within __try");
9907 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
9910 expect(';', end_error);
9917 * Check if a given entity represents a local variable.
9919 static bool is_local_variable(const entity_t *entity)
9921 if (entity->kind != ENTITY_VARIABLE)
9924 switch ((storage_class_tag_t) entity->declaration.storage_class) {
9925 case STORAGE_CLASS_AUTO:
9926 case STORAGE_CLASS_REGISTER: {
9927 const type_t *type = skip_typeref(entity->declaration.type);
9928 if (is_type_function(type)) {
9940 * Check if a given expression represents a local variable.
9942 static bool expression_is_local_variable(const expression_t *expression)
9944 if (expression->base.kind != EXPR_REFERENCE) {
9947 const entity_t *entity = expression->reference.entity;
9948 return is_local_variable(entity);
9952 * Check if a given expression represents a local variable and
9953 * return its declaration then, else return NULL.
9955 entity_t *expression_is_variable(const expression_t *expression)
9957 if (expression->base.kind != EXPR_REFERENCE) {
9960 entity_t *entity = expression->reference.entity;
9961 if (entity->kind != ENTITY_VARIABLE)
9968 * Parse a return statement.
9970 static statement_t *parse_return(void)
9974 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
9976 expression_t *return_value = NULL;
9977 if (token.type != ';') {
9978 return_value = parse_expression();
9979 mark_vars_read(return_value, NULL);
9982 const type_t *const func_type = skip_typeref(current_function->base.type);
9983 assert(is_type_function(func_type));
9984 type_t *const return_type = skip_typeref(func_type->function.return_type);
9986 source_position_t const *const pos = &statement->base.source_position;
9987 if (return_value != NULL) {
9988 type_t *return_value_type = skip_typeref(return_value->base.type);
9990 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
9991 if (is_type_atomic(return_value_type, ATOMIC_TYPE_VOID)) {
9992 /* ISO/IEC 14882:1998(E) §6.6.3:2 */
9993 /* Only warn in C mode, because GCC does the same */
9994 if (c_mode & _CXX || strict_mode) {
9996 "'return' with a value, in function returning 'void'");
9997 } else if (warning.other) {
9999 "'return' with a value, in function returning 'void'");
10001 } else if (!(c_mode & _CXX)) { /* ISO/IEC 14882:1998(E) §6.6.3:3 */
10002 /* Only warn in C mode, because GCC does the same */
10005 "'return' with expression in function returning 'void'");
10006 } else if (warning.other) {
10008 "'return' with expression in function returning 'void'");
10012 assign_error_t error = semantic_assign(return_type, return_value);
10013 report_assign_error(error, return_type, return_value, "'return'",
10016 return_value = create_implicit_cast(return_value, return_type);
10017 /* check for returning address of a local var */
10018 if (warning.other && return_value != NULL
10019 && return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
10020 const expression_t *expression = return_value->unary.value;
10021 if (expression_is_local_variable(expression)) {
10022 warningf(pos, "function returns address of local variable");
10025 } else if (warning.other && !is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
10026 /* ISO/IEC 14882:1998(E) §6.6.3:3 */
10027 if (c_mode & _CXX || strict_mode) {
10029 "'return' without value, in function returning non-void");
10032 "'return' without value, in function returning non-void");
10035 statement->returns.value = return_value;
10037 expect(';', end_error);
10044 * Parse a declaration statement.
10046 static statement_t *parse_declaration_statement(void)
10048 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
10050 entity_t *before = current_scope->last_entity;
10052 parse_external_declaration();
10054 parse_declaration(record_entity, DECL_FLAGS_NONE);
10057 declaration_statement_t *const decl = &statement->declaration;
10058 entity_t *const begin =
10059 before != NULL ? before->base.next : current_scope->entities;
10060 decl->declarations_begin = begin;
10061 decl->declarations_end = begin != NULL ? current_scope->last_entity : NULL;
10067 * Parse an expression statement, ie. expr ';'.
10069 static statement_t *parse_expression_statement(void)
10071 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10073 expression_t *const expr = parse_expression();
10074 statement->expression.expression = expr;
10075 mark_vars_read(expr, ENT_ANY);
10077 expect(';', end_error);
10084 * Parse a microsoft __try { } __finally { } or
10085 * __try{ } __except() { }
10087 static statement_t *parse_ms_try_statment(void)
10089 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
10092 PUSH_PARENT(statement);
10094 ms_try_statement_t *rem = current_try;
10095 current_try = &statement->ms_try;
10096 statement->ms_try.try_statement = parse_compound_statement(false);
10101 if (token.type == T___except) {
10103 expect('(', end_error);
10104 add_anchor_token(')');
10105 expression_t *const expr = parse_expression();
10106 mark_vars_read(expr, NULL);
10107 type_t * type = skip_typeref(expr->base.type);
10108 if (is_type_integer(type)) {
10109 type = promote_integer(type);
10110 } else if (is_type_valid(type)) {
10111 errorf(&expr->base.source_position,
10112 "__expect expression is not an integer, but '%T'", type);
10113 type = type_error_type;
10115 statement->ms_try.except_expression = create_implicit_cast(expr, type);
10116 rem_anchor_token(')');
10117 expect(')', end_error);
10118 statement->ms_try.final_statement = parse_compound_statement(false);
10119 } else if (token.type == T__finally) {
10121 statement->ms_try.final_statement = parse_compound_statement(false);
10123 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
10124 return create_invalid_statement();
10128 return create_invalid_statement();
10131 static statement_t *parse_empty_statement(void)
10133 if (warning.empty_statement) {
10134 warningf(HERE, "statement is empty");
10136 statement_t *const statement = create_empty_statement();
10141 static statement_t *parse_local_label_declaration(void)
10143 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
10147 entity_t *begin = NULL, *end = NULL;
10150 if (token.type != T_IDENTIFIER) {
10151 parse_error_expected("while parsing local label declaration",
10152 T_IDENTIFIER, NULL);
10155 symbol_t *symbol = token.v.symbol;
10156 entity_t *entity = get_entity(symbol, NAMESPACE_LABEL);
10157 if (entity != NULL && entity->base.parent_scope == current_scope) {
10158 errorf(HERE, "multiple definitions of '__label__ %Y' (previous definition %P)",
10159 symbol, &entity->base.source_position);
10161 entity = allocate_entity_zero(ENTITY_LOCAL_LABEL);
10163 entity->base.parent_scope = current_scope;
10164 entity->base.namespc = NAMESPACE_LABEL;
10165 entity->base.source_position = token.source_position;
10166 entity->base.symbol = symbol;
10169 end->base.next = entity;
10174 environment_push(entity);
10178 if (token.type != ',')
10184 statement->declaration.declarations_begin = begin;
10185 statement->declaration.declarations_end = end;
10189 static void parse_namespace_definition(void)
10193 entity_t *entity = NULL;
10194 symbol_t *symbol = NULL;
10196 if (token.type == T_IDENTIFIER) {
10197 symbol = token.v.symbol;
10200 entity = get_entity(symbol, NAMESPACE_NORMAL);
10201 if (entity != NULL &&
10202 entity->kind != ENTITY_NAMESPACE &&
10203 entity->base.parent_scope == current_scope) {
10204 if (!is_error_entity(entity)) {
10205 error_redefined_as_different_kind(&token.source_position,
10206 entity, ENTITY_NAMESPACE);
10212 if (entity == NULL) {
10213 entity = allocate_entity_zero(ENTITY_NAMESPACE);
10214 entity->base.symbol = symbol;
10215 entity->base.source_position = token.source_position;
10216 entity->base.namespc = NAMESPACE_NORMAL;
10217 entity->base.parent_scope = current_scope;
10220 if (token.type == '=') {
10221 /* TODO: parse namespace alias */
10222 panic("namespace alias definition not supported yet");
10225 environment_push(entity);
10226 append_entity(current_scope, entity);
10228 size_t const top = environment_top();
10229 scope_t *old_scope = scope_push(&entity->namespacee.members);
10231 expect('{', end_error);
10233 expect('}', end_error);
10236 assert(current_scope == &entity->namespacee.members);
10237 scope_pop(old_scope);
10238 environment_pop_to(top);
10242 * Parse a statement.
10243 * There's also parse_statement() which additionally checks for
10244 * "statement has no effect" warnings
10246 static statement_t *intern_parse_statement(void)
10248 statement_t *statement = NULL;
10250 /* declaration or statement */
10251 add_anchor_token(';');
10252 switch (token.type) {
10253 case T_IDENTIFIER: {
10254 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
10255 if (la1_type == ':') {
10256 statement = parse_label_statement();
10257 } else if (is_typedef_symbol(token.v.symbol)) {
10258 statement = parse_declaration_statement();
10260 /* it's an identifier, the grammar says this must be an
10261 * expression statement. However it is common that users mistype
10262 * declaration types, so we guess a bit here to improve robustness
10263 * for incorrect programs */
10264 switch (la1_type) {
10267 if (get_entity(token.v.symbol, NAMESPACE_NORMAL) != NULL)
10268 goto expression_statment;
10273 statement = parse_declaration_statement();
10277 expression_statment:
10278 statement = parse_expression_statement();
10285 case T___extension__:
10286 /* This can be a prefix to a declaration or an expression statement.
10287 * We simply eat it now and parse the rest with tail recursion. */
10290 } while (token.type == T___extension__);
10291 bool old_gcc_extension = in_gcc_extension;
10292 in_gcc_extension = true;
10293 statement = intern_parse_statement();
10294 in_gcc_extension = old_gcc_extension;
10298 statement = parse_declaration_statement();
10302 statement = parse_local_label_declaration();
10305 case ';': statement = parse_empty_statement(); break;
10306 case '{': statement = parse_compound_statement(false); break;
10307 case T___leave: statement = parse_leave_statement(); break;
10308 case T___try: statement = parse_ms_try_statment(); break;
10309 case T_asm: statement = parse_asm_statement(); break;
10310 case T_break: statement = parse_break(); break;
10311 case T_case: statement = parse_case_statement(); break;
10312 case T_continue: statement = parse_continue(); break;
10313 case T_default: statement = parse_default_statement(); break;
10314 case T_do: statement = parse_do(); break;
10315 case T_for: statement = parse_for(); break;
10316 case T_goto: statement = parse_goto(); break;
10317 case T_if: statement = parse_if(); break;
10318 case T_return: statement = parse_return(); break;
10319 case T_switch: statement = parse_switch(); break;
10320 case T_while: statement = parse_while(); break;
10323 statement = parse_expression_statement();
10327 errorf(HERE, "unexpected token %K while parsing statement", &token);
10328 statement = create_invalid_statement();
10333 rem_anchor_token(';');
10335 assert(statement != NULL
10336 && statement->base.source_position.input_name != NULL);
10342 * parse a statement and emits "statement has no effect" warning if needed
10343 * (This is really a wrapper around intern_parse_statement with check for 1
10344 * single warning. It is needed, because for statement expressions we have
10345 * to avoid the warning on the last statement)
10347 static statement_t *parse_statement(void)
10349 statement_t *statement = intern_parse_statement();
10351 if (statement->kind == STATEMENT_EXPRESSION && warning.unused_value) {
10352 expression_t *expression = statement->expression.expression;
10353 if (!expression_has_effect(expression)) {
10354 warningf(&expression->base.source_position,
10355 "statement has no effect");
10363 * Parse a compound statement.
10365 static statement_t *parse_compound_statement(bool inside_expression_statement)
10367 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
10369 PUSH_PARENT(statement);
10372 add_anchor_token('}');
10373 /* tokens, which can start a statement */
10374 /* TODO MS, __builtin_FOO */
10375 add_anchor_token('!');
10376 add_anchor_token('&');
10377 add_anchor_token('(');
10378 add_anchor_token('*');
10379 add_anchor_token('+');
10380 add_anchor_token('-');
10381 add_anchor_token('{');
10382 add_anchor_token('~');
10383 add_anchor_token(T_CHARACTER_CONSTANT);
10384 add_anchor_token(T_COLONCOLON);
10385 add_anchor_token(T_FLOATINGPOINT);
10386 add_anchor_token(T_IDENTIFIER);
10387 add_anchor_token(T_INTEGER);
10388 add_anchor_token(T_MINUSMINUS);
10389 add_anchor_token(T_PLUSPLUS);
10390 add_anchor_token(T_STRING_LITERAL);
10391 add_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10392 add_anchor_token(T_WIDE_STRING_LITERAL);
10393 add_anchor_token(T__Bool);
10394 add_anchor_token(T__Complex);
10395 add_anchor_token(T__Imaginary);
10396 add_anchor_token(T___FUNCTION__);
10397 add_anchor_token(T___PRETTY_FUNCTION__);
10398 add_anchor_token(T___alignof__);
10399 add_anchor_token(T___attribute__);
10400 add_anchor_token(T___builtin_va_start);
10401 add_anchor_token(T___extension__);
10402 add_anchor_token(T___func__);
10403 add_anchor_token(T___imag__);
10404 add_anchor_token(T___label__);
10405 add_anchor_token(T___real__);
10406 add_anchor_token(T___thread);
10407 add_anchor_token(T_asm);
10408 add_anchor_token(T_auto);
10409 add_anchor_token(T_bool);
10410 add_anchor_token(T_break);
10411 add_anchor_token(T_case);
10412 add_anchor_token(T_char);
10413 add_anchor_token(T_class);
10414 add_anchor_token(T_const);
10415 add_anchor_token(T_const_cast);
10416 add_anchor_token(T_continue);
10417 add_anchor_token(T_default);
10418 add_anchor_token(T_delete);
10419 add_anchor_token(T_double);
10420 add_anchor_token(T_do);
10421 add_anchor_token(T_dynamic_cast);
10422 add_anchor_token(T_enum);
10423 add_anchor_token(T_extern);
10424 add_anchor_token(T_false);
10425 add_anchor_token(T_float);
10426 add_anchor_token(T_for);
10427 add_anchor_token(T_goto);
10428 add_anchor_token(T_if);
10429 add_anchor_token(T_inline);
10430 add_anchor_token(T_int);
10431 add_anchor_token(T_long);
10432 add_anchor_token(T_new);
10433 add_anchor_token(T_operator);
10434 add_anchor_token(T_register);
10435 add_anchor_token(T_reinterpret_cast);
10436 add_anchor_token(T_restrict);
10437 add_anchor_token(T_return);
10438 add_anchor_token(T_short);
10439 add_anchor_token(T_signed);
10440 add_anchor_token(T_sizeof);
10441 add_anchor_token(T_static);
10442 add_anchor_token(T_static_cast);
10443 add_anchor_token(T_struct);
10444 add_anchor_token(T_switch);
10445 add_anchor_token(T_template);
10446 add_anchor_token(T_this);
10447 add_anchor_token(T_throw);
10448 add_anchor_token(T_true);
10449 add_anchor_token(T_try);
10450 add_anchor_token(T_typedef);
10451 add_anchor_token(T_typeid);
10452 add_anchor_token(T_typename);
10453 add_anchor_token(T_typeof);
10454 add_anchor_token(T_union);
10455 add_anchor_token(T_unsigned);
10456 add_anchor_token(T_using);
10457 add_anchor_token(T_void);
10458 add_anchor_token(T_volatile);
10459 add_anchor_token(T_wchar_t);
10460 add_anchor_token(T_while);
10462 size_t const top = environment_top();
10463 scope_t *old_scope = scope_push(&statement->compound.scope);
10465 statement_t **anchor = &statement->compound.statements;
10466 bool only_decls_so_far = true;
10467 while (token.type != '}') {
10468 if (token.type == T_EOF) {
10469 errorf(&statement->base.source_position,
10470 "EOF while parsing compound statement");
10473 statement_t *sub_statement = intern_parse_statement();
10474 if (is_invalid_statement(sub_statement)) {
10475 /* an error occurred. if we are at an anchor, return */
10481 if (warning.declaration_after_statement) {
10482 if (sub_statement->kind != STATEMENT_DECLARATION) {
10483 only_decls_so_far = false;
10484 } else if (!only_decls_so_far) {
10485 warningf(&sub_statement->base.source_position,
10486 "ISO C90 forbids mixed declarations and code");
10490 *anchor = sub_statement;
10492 while (sub_statement->base.next != NULL)
10493 sub_statement = sub_statement->base.next;
10495 anchor = &sub_statement->base.next;
10499 /* look over all statements again to produce no effect warnings */
10500 if (warning.unused_value) {
10501 statement_t *sub_statement = statement->compound.statements;
10502 for (; sub_statement != NULL; sub_statement = sub_statement->base.next) {
10503 if (sub_statement->kind != STATEMENT_EXPRESSION)
10505 /* don't emit a warning for the last expression in an expression
10506 * statement as it has always an effect */
10507 if (inside_expression_statement && sub_statement->base.next == NULL)
10510 expression_t *expression = sub_statement->expression.expression;
10511 if (!expression_has_effect(expression)) {
10512 warningf(&expression->base.source_position,
10513 "statement has no effect");
10519 rem_anchor_token(T_while);
10520 rem_anchor_token(T_wchar_t);
10521 rem_anchor_token(T_volatile);
10522 rem_anchor_token(T_void);
10523 rem_anchor_token(T_using);
10524 rem_anchor_token(T_unsigned);
10525 rem_anchor_token(T_union);
10526 rem_anchor_token(T_typeof);
10527 rem_anchor_token(T_typename);
10528 rem_anchor_token(T_typeid);
10529 rem_anchor_token(T_typedef);
10530 rem_anchor_token(T_try);
10531 rem_anchor_token(T_true);
10532 rem_anchor_token(T_throw);
10533 rem_anchor_token(T_this);
10534 rem_anchor_token(T_template);
10535 rem_anchor_token(T_switch);
10536 rem_anchor_token(T_struct);
10537 rem_anchor_token(T_static_cast);
10538 rem_anchor_token(T_static);
10539 rem_anchor_token(T_sizeof);
10540 rem_anchor_token(T_signed);
10541 rem_anchor_token(T_short);
10542 rem_anchor_token(T_return);
10543 rem_anchor_token(T_restrict);
10544 rem_anchor_token(T_reinterpret_cast);
10545 rem_anchor_token(T_register);
10546 rem_anchor_token(T_operator);
10547 rem_anchor_token(T_new);
10548 rem_anchor_token(T_long);
10549 rem_anchor_token(T_int);
10550 rem_anchor_token(T_inline);
10551 rem_anchor_token(T_if);
10552 rem_anchor_token(T_goto);
10553 rem_anchor_token(T_for);
10554 rem_anchor_token(T_float);
10555 rem_anchor_token(T_false);
10556 rem_anchor_token(T_extern);
10557 rem_anchor_token(T_enum);
10558 rem_anchor_token(T_dynamic_cast);
10559 rem_anchor_token(T_do);
10560 rem_anchor_token(T_double);
10561 rem_anchor_token(T_delete);
10562 rem_anchor_token(T_default);
10563 rem_anchor_token(T_continue);
10564 rem_anchor_token(T_const_cast);
10565 rem_anchor_token(T_const);
10566 rem_anchor_token(T_class);
10567 rem_anchor_token(T_char);
10568 rem_anchor_token(T_case);
10569 rem_anchor_token(T_break);
10570 rem_anchor_token(T_bool);
10571 rem_anchor_token(T_auto);
10572 rem_anchor_token(T_asm);
10573 rem_anchor_token(T___thread);
10574 rem_anchor_token(T___real__);
10575 rem_anchor_token(T___label__);
10576 rem_anchor_token(T___imag__);
10577 rem_anchor_token(T___func__);
10578 rem_anchor_token(T___extension__);
10579 rem_anchor_token(T___builtin_va_start);
10580 rem_anchor_token(T___attribute__);
10581 rem_anchor_token(T___alignof__);
10582 rem_anchor_token(T___PRETTY_FUNCTION__);
10583 rem_anchor_token(T___FUNCTION__);
10584 rem_anchor_token(T__Imaginary);
10585 rem_anchor_token(T__Complex);
10586 rem_anchor_token(T__Bool);
10587 rem_anchor_token(T_WIDE_STRING_LITERAL);
10588 rem_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10589 rem_anchor_token(T_STRING_LITERAL);
10590 rem_anchor_token(T_PLUSPLUS);
10591 rem_anchor_token(T_MINUSMINUS);
10592 rem_anchor_token(T_INTEGER);
10593 rem_anchor_token(T_IDENTIFIER);
10594 rem_anchor_token(T_FLOATINGPOINT);
10595 rem_anchor_token(T_COLONCOLON);
10596 rem_anchor_token(T_CHARACTER_CONSTANT);
10597 rem_anchor_token('~');
10598 rem_anchor_token('{');
10599 rem_anchor_token('-');
10600 rem_anchor_token('+');
10601 rem_anchor_token('*');
10602 rem_anchor_token('(');
10603 rem_anchor_token('&');
10604 rem_anchor_token('!');
10605 rem_anchor_token('}');
10606 assert(current_scope == &statement->compound.scope);
10607 scope_pop(old_scope);
10608 environment_pop_to(top);
10615 * Check for unused global static functions and variables
10617 static void check_unused_globals(void)
10619 if (!warning.unused_function && !warning.unused_variable)
10622 for (const entity_t *entity = file_scope->entities; entity != NULL;
10623 entity = entity->base.next) {
10624 if (!is_declaration(entity))
10627 const declaration_t *declaration = &entity->declaration;
10628 if (declaration->used ||
10629 declaration->modifiers & DM_UNUSED ||
10630 declaration->modifiers & DM_USED ||
10631 declaration->storage_class != STORAGE_CLASS_STATIC)
10634 type_t *const type = declaration->type;
10636 if (entity->kind == ENTITY_FUNCTION) {
10637 /* inhibit warning for static inline functions */
10638 if (entity->function.is_inline)
10641 s = entity->function.statement != NULL ? "defined" : "declared";
10646 warningf(&declaration->base.source_position, "'%#T' %s but not used",
10647 type, declaration->base.symbol, s);
10651 static void parse_global_asm(void)
10653 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
10656 expect('(', end_error);
10658 statement->asms.asm_text = parse_string_literals();
10659 statement->base.next = unit->global_asm;
10660 unit->global_asm = statement;
10662 expect(')', end_error);
10663 expect(';', end_error);
10668 static void parse_linkage_specification(void)
10671 assert(token.type == T_STRING_LITERAL);
10673 const char *linkage = parse_string_literals().begin;
10675 linkage_kind_t old_linkage = current_linkage;
10676 linkage_kind_t new_linkage;
10677 if (strcmp(linkage, "C") == 0) {
10678 new_linkage = LINKAGE_C;
10679 } else if (strcmp(linkage, "C++") == 0) {
10680 new_linkage = LINKAGE_CXX;
10682 errorf(HERE, "linkage string \"%s\" not recognized", linkage);
10683 new_linkage = LINKAGE_INVALID;
10685 current_linkage = new_linkage;
10687 if (token.type == '{') {
10690 expect('}', end_error);
10696 assert(current_linkage == new_linkage);
10697 current_linkage = old_linkage;
10700 static void parse_external(void)
10702 switch (token.type) {
10703 DECLARATION_START_NO_EXTERN
10705 case T___extension__:
10706 /* tokens below are for implicit int */
10707 case '&': /* & x; -> int& x; (and error later, because C++ has no
10709 case '*': /* * x; -> int* x; */
10710 case '(': /* (x); -> int (x); */
10711 parse_external_declaration();
10715 if (look_ahead(1)->type == T_STRING_LITERAL) {
10716 parse_linkage_specification();
10718 parse_external_declaration();
10723 parse_global_asm();
10727 parse_namespace_definition();
10731 if (!strict_mode) {
10733 warningf(HERE, "stray ';' outside of function");
10740 errorf(HERE, "stray %K outside of function", &token);
10741 if (token.type == '(' || token.type == '{' || token.type == '[')
10742 eat_until_matching_token(token.type);
10748 static void parse_externals(void)
10750 add_anchor_token('}');
10751 add_anchor_token(T_EOF);
10754 unsigned char token_anchor_copy[T_LAST_TOKEN];
10755 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
10758 while (token.type != T_EOF && token.type != '}') {
10760 bool anchor_leak = false;
10761 for (int i = 0; i != T_LAST_TOKEN; ++i) {
10762 unsigned char count = token_anchor_set[i] - token_anchor_copy[i];
10764 errorf(HERE, "Leaked anchor token %k %d times", i, count);
10765 anchor_leak = true;
10768 if (in_gcc_extension) {
10769 errorf(HERE, "Leaked __extension__");
10770 anchor_leak = true;
10780 rem_anchor_token(T_EOF);
10781 rem_anchor_token('}');
10785 * Parse a translation unit.
10787 static void parse_translation_unit(void)
10789 add_anchor_token(T_EOF);
10794 if (token.type == T_EOF)
10797 errorf(HERE, "stray %K outside of function", &token);
10798 if (token.type == '(' || token.type == '{' || token.type == '[')
10799 eat_until_matching_token(token.type);
10807 * @return the translation unit or NULL if errors occurred.
10809 void start_parsing(void)
10811 environment_stack = NEW_ARR_F(stack_entry_t, 0);
10812 label_stack = NEW_ARR_F(stack_entry_t, 0);
10813 diagnostic_count = 0;
10817 type_set_output(stderr);
10818 ast_set_output(stderr);
10820 assert(unit == NULL);
10821 unit = allocate_ast_zero(sizeof(unit[0]));
10823 assert(file_scope == NULL);
10824 file_scope = &unit->scope;
10826 assert(current_scope == NULL);
10827 scope_push(&unit->scope);
10829 create_gnu_builtins();
10831 create_microsoft_intrinsics();
10834 translation_unit_t *finish_parsing(void)
10836 assert(current_scope == &unit->scope);
10839 assert(file_scope == &unit->scope);
10840 check_unused_globals();
10843 DEL_ARR_F(environment_stack);
10844 DEL_ARR_F(label_stack);
10846 translation_unit_t *result = unit;
10851 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
10852 * are given length one. */
10853 static void complete_incomplete_arrays(void)
10855 size_t n = ARR_LEN(incomplete_arrays);
10856 for (size_t i = 0; i != n; ++i) {
10857 declaration_t *const decl = incomplete_arrays[i];
10858 type_t *const orig_type = decl->type;
10859 type_t *const type = skip_typeref(orig_type);
10861 if (!is_type_incomplete(type))
10864 if (warning.other) {
10865 warningf(&decl->base.source_position,
10866 "array '%#T' assumed to have one element",
10867 orig_type, decl->base.symbol);
10870 type_t *const new_type = duplicate_type(type);
10871 new_type->array.size_constant = true;
10872 new_type->array.has_implicit_size = true;
10873 new_type->array.size = 1;
10875 type_t *const result = identify_new_type(new_type);
10877 decl->type = result;
10883 lookahead_bufpos = 0;
10884 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
10887 current_linkage = c_mode & _CXX ? LINKAGE_CXX : LINKAGE_C;
10888 incomplete_arrays = NEW_ARR_F(declaration_t*, 0);
10889 parse_translation_unit();
10890 complete_incomplete_arrays();
10891 DEL_ARR_F(incomplete_arrays);
10892 incomplete_arrays = NULL;
10896 * create a builtin function.
10898 static entity_t *create_builtin_function(builtin_kind_t kind, const char *name, type_t *function_type)
10900 symbol_t *symbol = symbol_table_insert(name);
10901 entity_t *entity = allocate_entity_zero(ENTITY_FUNCTION);
10902 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
10903 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
10904 entity->declaration.type = function_type;
10905 entity->declaration.implicit = true;
10906 entity->base.symbol = symbol;
10907 entity->base.source_position = builtin_source_position;
10909 entity->function.btk = kind;
10911 record_entity(entity, /*is_definition=*/false);
10917 * Create predefined gnu builtins.
10919 static void create_gnu_builtins(void)
10921 #define GNU_BUILTIN(a, b) create_builtin_function(bk_gnu_builtin_##a, "__builtin_" #a, b)
10923 GNU_BUILTIN(alloca, make_function_1_type(type_void_ptr, type_size_t));
10924 GNU_BUILTIN(huge_val, make_function_0_type(type_double));
10925 GNU_BUILTIN(inf, make_function_0_type(type_double));
10926 GNU_BUILTIN(inff, make_function_0_type(type_float));
10927 GNU_BUILTIN(infl, make_function_0_type(type_long_double));
10928 GNU_BUILTIN(nan, make_function_1_type(type_double, type_char_ptr));
10929 GNU_BUILTIN(nanf, make_function_1_type(type_float, type_char_ptr));
10930 GNU_BUILTIN(nanl, make_function_1_type(type_long_double, type_char_ptr));
10931 GNU_BUILTIN(va_end, make_function_1_type(type_void, type_valist));
10932 GNU_BUILTIN(expect, make_function_2_type(type_long, type_long, type_long));
10933 GNU_BUILTIN(return_address, make_function_1_type(type_void_ptr, type_unsigned_int));
10934 GNU_BUILTIN(frame_address, make_function_1_type(type_void_ptr, type_unsigned_int));
10935 GNU_BUILTIN(ffs, make_function_1_type(type_int, type_unsigned_int));
10936 GNU_BUILTIN(clz, make_function_1_type(type_int, type_unsigned_int));
10937 GNU_BUILTIN(ctz, make_function_1_type(type_int, type_unsigned_int));
10938 GNU_BUILTIN(popcount, make_function_1_type(type_int, type_unsigned_int));
10939 GNU_BUILTIN(parity, make_function_1_type(type_int, type_unsigned_int));
10940 GNU_BUILTIN(prefetch, make_function_1_type_variadic(type_float, type_void_ptr));
10941 GNU_BUILTIN(trap, make_function_0_type_noreturn(type_void));
10947 * Create predefined MS intrinsics.
10949 static void create_microsoft_intrinsics(void)
10951 #define MS_BUILTIN(a, b) create_builtin_function(bk_ms##a, #a, b)
10953 /* intrinsics for all architectures */
10954 MS_BUILTIN(_rotl, make_function_2_type(type_unsigned_int, type_unsigned_int, type_int));
10955 MS_BUILTIN(_rotr, make_function_2_type(type_unsigned_int, type_unsigned_int, type_int));
10956 MS_BUILTIN(_rotl64, make_function_2_type(type_unsigned_int64, type_unsigned_int64, type_int));
10957 MS_BUILTIN(_rotr64, make_function_2_type(type_unsigned_int64, type_unsigned_int64, type_int));
10958 MS_BUILTIN(_byteswap_ushort, make_function_1_type(type_unsigned_short, type_unsigned_short));
10959 MS_BUILTIN(_byteswap_ulong, make_function_1_type(type_unsigned_long, type_unsigned_long));
10960 MS_BUILTIN(_byteswap_uint64, make_function_1_type(type_unsigned_int64, type_unsigned_int64));
10962 MS_BUILTIN(__debugbreak, make_function_0_type(type_void));
10963 MS_BUILTIN(_ReturnAddress, make_function_0_type(type_void_ptr));
10964 MS_BUILTIN(_AddressOfReturnAddress, make_function_0_type(type_void_ptr));
10965 MS_BUILTIN(__popcount, make_function_1_type(type_unsigned_int, type_unsigned_int));
10968 MS_BUILTIN(_enable, make_function_0_type(type_void));
10969 MS_BUILTIN(_disable, make_function_0_type(type_void));
10970 MS_BUILTIN(__inbyte, make_function_1_type(type_unsigned_char, type_unsigned_short));
10971 MS_BUILTIN(__inword, make_function_1_type(type_unsigned_short, type_unsigned_short));
10972 MS_BUILTIN(__indword, make_function_1_type(type_unsigned_long, type_unsigned_short));
10973 MS_BUILTIN(__outbyte, make_function_2_type(type_void, type_unsigned_short, type_unsigned_char));
10974 MS_BUILTIN(__outword, make_function_2_type(type_void, type_unsigned_short, type_unsigned_short));
10975 MS_BUILTIN(__outdword, make_function_2_type(type_void, type_unsigned_short, type_unsigned_long));
10976 MS_BUILTIN(__ud2, make_function_0_type_noreturn(type_void));
10977 MS_BUILTIN(_BitScanForward, make_function_2_type(type_unsigned_char, type_unsigned_long_ptr, type_unsigned_long));
10978 MS_BUILTIN(_BitScanReverse, make_function_2_type(type_unsigned_char, type_unsigned_long_ptr, type_unsigned_long));
10979 MS_BUILTIN(_InterlockedExchange, make_function_2_type(type_long, type_long_ptr, type_long));
10980 MS_BUILTIN(_InterlockedExchange64, make_function_2_type(type_int64, type_int64_ptr, type_int64));
10982 if (machine_size <= 32) {
10983 MS_BUILTIN(__readeflags, make_function_0_type(type_unsigned_int));
10984 MS_BUILTIN(__writeeflags, make_function_1_type(type_void, type_unsigned_int));
10986 MS_BUILTIN(__readeflags, make_function_0_type(type_unsigned_int64));
10987 MS_BUILTIN(__writeeflags, make_function_1_type(type_void, type_unsigned_int64));
10994 * Initialize the parser.
10996 void init_parser(void)
10998 sym_anonymous = symbol_table_insert("<anonymous>");
11000 memset(token_anchor_set, 0, sizeof(token_anchor_set));
11002 init_expression_parsers();
11003 obstack_init(&temp_obst);
11005 symbol_t *const va_list_sym = symbol_table_insert("__builtin_va_list");
11006 type_valist = create_builtin_type(va_list_sym, type_void_ptr);
11010 * Terminate the parser.
11012 void exit_parser(void)
11014 obstack_free(&temp_obst, NULL);