2 * This file is part of cparser.
3 * Copyright (C) 2007-2008 Matthias Braun <matze@braunis.de>
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License
7 * as published by the Free Software Foundation; either version 2
8 * of the License, or (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
27 #include "diagnostic.h"
28 #include "format_check.h"
34 #include "type_hash.h"
37 #include "lang_features.h"
38 #include "walk_statements.h"
40 #include "adt/bitfiddle.h"
41 #include "adt/error.h"
42 #include "adt/array.h"
44 //#define PRINT_TOKENS
45 #define MAX_LOOKAHEAD 1
50 entity_namespace_t namespc;
53 typedef struct argument_list_t argument_list_t;
54 struct argument_list_t {
56 argument_list_t *next;
59 typedef struct gnu_attribute_t gnu_attribute_t;
60 struct gnu_attribute_t {
61 gnu_attribute_kind_t kind; /**< The kind of the GNU attribute. */
62 gnu_attribute_t *next;
63 bool invalid; /**< Set if this attribute had argument errors, */
64 bool has_arguments; /**< True, if this attribute has arguments. */
69 long argument; /**< Single argument. */
70 argument_list_t *arguments; /**< List of argument expressions. */
74 typedef struct declaration_specifiers_t declaration_specifiers_t;
75 struct declaration_specifiers_t {
76 source_position_t source_position;
77 storage_class_t storage_class;
78 unsigned char alignment; /**< Alignment, 0 if not set. */
80 bool thread_local : 1; /**< GCC __thread */
82 decl_modifiers_t modifiers; /**< declaration modifiers */
83 gnu_attribute_t *gnu_attributes; /**< list of GNU attributes */
84 const char *deprecated_string; /**< can be set if declaration was marked deprecated. */
85 symbol_t *get_property_sym; /**< the name of the get property if set. */
86 symbol_t *put_property_sym; /**< the name of the put property if set. */
91 * An environment for parsing initializers (and compound literals).
93 typedef struct parse_initializer_env_t {
94 type_t *type; /**< the type of the initializer. In case of an
95 array type with unspecified size this gets
96 adjusted to the actual size. */
97 entity_t *entity; /**< the variable that is initialized if any */
98 bool must_be_constant;
99 } parse_initializer_env_t;
102 * Capture a MS __base extension.
104 typedef struct based_spec_t {
105 source_position_t source_position;
106 variable_t *base_variable;
109 typedef entity_t* (*parsed_declaration_func) (entity_t *declaration, bool is_definition);
111 /** The current token. */
112 static token_t token;
113 /** The lookahead ring-buffer. */
114 static token_t lookahead_buffer[MAX_LOOKAHEAD];
115 /** Position of the next token in the lookahead buffer. */
116 static size_t lookahead_bufpos;
117 static stack_entry_t *environment_stack = NULL;
118 static stack_entry_t *label_stack = NULL;
119 static scope_t *file_scope = NULL;
120 static scope_t *current_scope = NULL;
121 /** Point to the current function declaration if inside a function. */
122 static function_t *current_function = NULL;
123 static entity_t *current_init_decl = NULL;
124 static switch_statement_t *current_switch = NULL;
125 static statement_t *current_loop = NULL;
126 static statement_t *current_parent = NULL;
127 static ms_try_statement_t *current_try = NULL;
128 static linkage_kind_t current_linkage = LINKAGE_INVALID;
129 static goto_statement_t *goto_first = NULL;
130 static goto_statement_t **goto_anchor = NULL;
131 static label_statement_t *label_first = NULL;
132 static label_statement_t **label_anchor = NULL;
133 /** current translation unit. */
134 static translation_unit_t *unit = NULL;
135 /** true if we are in a type property context (evaluation only for type. */
136 static bool in_type_prop = false;
137 /** true in we are in a __extension__ context. */
138 static bool in_gcc_extension = false;
139 static struct obstack temp_obst;
140 static entity_t *anonymous_entity;
141 static declaration_t **incomplete_arrays;
144 #define PUSH_PARENT(stmt) \
145 statement_t *const prev_parent = current_parent; \
146 ((void)(current_parent = (stmt)))
147 #define POP_PARENT ((void)(current_parent = prev_parent))
149 /** special symbol used for anonymous entities. */
150 static const symbol_t *sym_anonymous = NULL;
152 /* symbols for Microsoft extended-decl-modifier */
153 static const symbol_t *sym_align = NULL;
154 static const symbol_t *sym_allocate = NULL;
155 static const symbol_t *sym_dllimport = NULL;
156 static const symbol_t *sym_dllexport = NULL;
157 static const symbol_t *sym_naked = NULL;
158 static const symbol_t *sym_noinline = NULL;
159 static const symbol_t *sym_returns_twice = NULL;
160 static const symbol_t *sym_noreturn = NULL;
161 static const symbol_t *sym_nothrow = NULL;
162 static const symbol_t *sym_novtable = NULL;
163 static const symbol_t *sym_property = NULL;
164 static const symbol_t *sym_get = NULL;
165 static const symbol_t *sym_put = NULL;
166 static const symbol_t *sym_selectany = NULL;
167 static const symbol_t *sym_thread = NULL;
168 static const symbol_t *sym_uuid = NULL;
169 static const symbol_t *sym_deprecated = NULL;
170 static const symbol_t *sym_restrict = NULL;
171 static const symbol_t *sym_noalias = NULL;
173 /** The token anchor set */
174 static unsigned char token_anchor_set[T_LAST_TOKEN];
176 /** The current source position. */
177 #define HERE (&token.source_position)
179 /** true if we are in GCC mode. */
180 #define GNU_MODE ((c_mode & _GNUC) || in_gcc_extension)
182 static type_t *type_valist;
184 static statement_t *parse_compound_statement(bool inside_expression_statement);
185 static statement_t *parse_statement(void);
187 static expression_t *parse_sub_expression(precedence_t);
188 static expression_t *parse_expression(void);
189 static type_t *parse_typename(void);
190 static void parse_externals(void);
191 static void parse_external(void);
193 static void parse_compound_type_entries(compound_t *compound_declaration);
195 typedef enum declarator_flags_t {
197 DECL_MAY_BE_ABSTRACT = 1U << 0,
198 DECL_CREATE_COMPOUND_MEMBER = 1U << 1,
199 DECL_IS_PARAMETER = 1U << 2
200 } declarator_flags_t;
202 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
203 declarator_flags_t flags);
205 static entity_t *record_entity(entity_t *entity, bool is_definition);
207 static void semantic_comparison(binary_expression_t *expression);
209 #define STORAGE_CLASSES \
210 STORAGE_CLASSES_NO_EXTERN \
213 #define STORAGE_CLASSES_NO_EXTERN \
220 #define TYPE_QUALIFIERS \
225 case T__forceinline: \
226 case T___attribute__:
228 #define COMPLEX_SPECIFIERS \
230 #define IMAGINARY_SPECIFIERS \
233 #define TYPE_SPECIFIERS \
235 case T___builtin_va_list: \
255 #define DECLARATION_START \
260 #define DECLARATION_START_NO_EXTERN \
261 STORAGE_CLASSES_NO_EXTERN \
265 #define TYPENAME_START \
269 #define EXPRESSION_START \
278 case T_CHARACTER_CONSTANT: \
279 case T_FLOATINGPOINT: \
283 case T_STRING_LITERAL: \
284 case T_WIDE_CHARACTER_CONSTANT: \
285 case T_WIDE_STRING_LITERAL: \
286 case T___FUNCDNAME__: \
287 case T___FUNCSIG__: \
288 case T___FUNCTION__: \
289 case T___PRETTY_FUNCTION__: \
290 case T___alignof__: \
291 case T___builtin_alloca: \
292 case T___builtin_classify_type: \
293 case T___builtin_constant_p: \
294 case T___builtin_expect: \
295 case T___builtin_huge_val: \
296 case T___builtin_inf: \
297 case T___builtin_inff: \
298 case T___builtin_infl: \
299 case T___builtin_isgreater: \
300 case T___builtin_isgreaterequal: \
301 case T___builtin_isless: \
302 case T___builtin_islessequal: \
303 case T___builtin_islessgreater: \
304 case T___builtin_isunordered: \
305 case T___builtin_nan: \
306 case T___builtin_nanf: \
307 case T___builtin_nanl: \
308 case T___builtin_offsetof: \
309 case T___builtin_prefetch: \
310 case T___builtin_va_arg: \
311 case T___builtin_va_end: \
312 case T___builtin_va_start: \
323 * Allocate an AST node with given size and
324 * initialize all fields with zero.
326 static void *allocate_ast_zero(size_t size)
328 void *res = allocate_ast(size);
329 memset(res, 0, size);
334 * Returns the size of an entity node.
336 * @param kind the entity kind
338 static size_t get_entity_struct_size(entity_kind_t kind)
340 static const size_t sizes[] = {
341 [ENTITY_VARIABLE] = sizeof(variable_t),
342 [ENTITY_PARAMETER] = sizeof(parameter_t),
343 [ENTITY_COMPOUND_MEMBER] = sizeof(compound_member_t),
344 [ENTITY_FUNCTION] = sizeof(function_t),
345 [ENTITY_TYPEDEF] = sizeof(typedef_t),
346 [ENTITY_STRUCT] = sizeof(compound_t),
347 [ENTITY_UNION] = sizeof(compound_t),
348 [ENTITY_ENUM] = sizeof(enum_t),
349 [ENTITY_ENUM_VALUE] = sizeof(enum_value_t),
350 [ENTITY_LABEL] = sizeof(label_t),
351 [ENTITY_LOCAL_LABEL] = sizeof(label_t),
352 [ENTITY_NAMESPACE] = sizeof(namespace_t)
354 assert(kind < lengthof(sizes));
355 assert(sizes[kind] != 0);
360 * Allocate an entity of given kind and initialize all
363 static entity_t *allocate_entity_zero(entity_kind_t kind)
365 size_t size = get_entity_struct_size(kind);
366 entity_t *entity = allocate_ast_zero(size);
372 * Returns the size of a statement node.
374 * @param kind the statement kind
376 static size_t get_statement_struct_size(statement_kind_t kind)
378 static const size_t sizes[] = {
379 [STATEMENT_INVALID] = sizeof(invalid_statement_t),
380 [STATEMENT_EMPTY] = sizeof(empty_statement_t),
381 [STATEMENT_COMPOUND] = sizeof(compound_statement_t),
382 [STATEMENT_RETURN] = sizeof(return_statement_t),
383 [STATEMENT_DECLARATION] = sizeof(declaration_statement_t),
384 [STATEMENT_IF] = sizeof(if_statement_t),
385 [STATEMENT_SWITCH] = sizeof(switch_statement_t),
386 [STATEMENT_EXPRESSION] = sizeof(expression_statement_t),
387 [STATEMENT_CONTINUE] = sizeof(statement_base_t),
388 [STATEMENT_BREAK] = sizeof(statement_base_t),
389 [STATEMENT_GOTO] = sizeof(goto_statement_t),
390 [STATEMENT_LABEL] = sizeof(label_statement_t),
391 [STATEMENT_CASE_LABEL] = sizeof(case_label_statement_t),
392 [STATEMENT_WHILE] = sizeof(while_statement_t),
393 [STATEMENT_DO_WHILE] = sizeof(do_while_statement_t),
394 [STATEMENT_FOR] = sizeof(for_statement_t),
395 [STATEMENT_ASM] = sizeof(asm_statement_t),
396 [STATEMENT_MS_TRY] = sizeof(ms_try_statement_t),
397 [STATEMENT_LEAVE] = sizeof(leave_statement_t)
399 assert(kind < lengthof(sizes));
400 assert(sizes[kind] != 0);
405 * Returns the size of an expression node.
407 * @param kind the expression kind
409 static size_t get_expression_struct_size(expression_kind_t kind)
411 static const size_t sizes[] = {
412 [EXPR_INVALID] = sizeof(expression_base_t),
413 [EXPR_REFERENCE] = sizeof(reference_expression_t),
414 [EXPR_REFERENCE_ENUM_VALUE] = sizeof(reference_expression_t),
415 [EXPR_CONST] = sizeof(const_expression_t),
416 [EXPR_CHARACTER_CONSTANT] = sizeof(const_expression_t),
417 [EXPR_WIDE_CHARACTER_CONSTANT] = sizeof(const_expression_t),
418 [EXPR_STRING_LITERAL] = sizeof(string_literal_expression_t),
419 [EXPR_WIDE_STRING_LITERAL] = sizeof(wide_string_literal_expression_t),
420 [EXPR_COMPOUND_LITERAL] = sizeof(compound_literal_expression_t),
421 [EXPR_CALL] = sizeof(call_expression_t),
422 [EXPR_UNARY_FIRST] = sizeof(unary_expression_t),
423 [EXPR_BINARY_FIRST] = sizeof(binary_expression_t),
424 [EXPR_CONDITIONAL] = sizeof(conditional_expression_t),
425 [EXPR_SELECT] = sizeof(select_expression_t),
426 [EXPR_ARRAY_ACCESS] = sizeof(array_access_expression_t),
427 [EXPR_SIZEOF] = sizeof(typeprop_expression_t),
428 [EXPR_ALIGNOF] = sizeof(typeprop_expression_t),
429 [EXPR_CLASSIFY_TYPE] = sizeof(classify_type_expression_t),
430 [EXPR_FUNCNAME] = sizeof(funcname_expression_t),
431 [EXPR_BUILTIN_SYMBOL] = sizeof(builtin_symbol_expression_t),
432 [EXPR_BUILTIN_CONSTANT_P] = sizeof(builtin_constant_expression_t),
433 [EXPR_BUILTIN_TYPES_COMPATIBLE_P] = sizeof(builtin_types_compatible_expression_t),
434 [EXPR_OFFSETOF] = sizeof(offsetof_expression_t),
435 [EXPR_VA_START] = sizeof(va_start_expression_t),
436 [EXPR_VA_ARG] = sizeof(va_arg_expression_t),
437 [EXPR_STATEMENT] = sizeof(statement_expression_t),
438 [EXPR_LABEL_ADDRESS] = sizeof(label_address_expression_t),
440 if (kind >= EXPR_UNARY_FIRST && kind <= EXPR_UNARY_LAST) {
441 return sizes[EXPR_UNARY_FIRST];
443 if (kind >= EXPR_BINARY_FIRST && kind <= EXPR_BINARY_LAST) {
444 return sizes[EXPR_BINARY_FIRST];
446 assert(kind < lengthof(sizes));
447 assert(sizes[kind] != 0);
452 * Allocate a statement node of given kind and initialize all
453 * fields with zero. Sets its source position to the position
454 * of the current token.
456 static statement_t *allocate_statement_zero(statement_kind_t kind)
458 size_t size = get_statement_struct_size(kind);
459 statement_t *res = allocate_ast_zero(size);
461 res->base.kind = kind;
462 res->base.parent = current_parent;
463 res->base.source_position = token.source_position;
468 * Allocate an expression node of given kind and initialize all
471 static expression_t *allocate_expression_zero(expression_kind_t kind)
473 size_t size = get_expression_struct_size(kind);
474 expression_t *res = allocate_ast_zero(size);
476 res->base.kind = kind;
477 res->base.type = type_error_type;
478 res->base.source_position = token.source_position;
483 * Creates a new invalid expression at the source position
484 * of the current token.
486 static expression_t *create_invalid_expression(void)
488 return allocate_expression_zero(EXPR_INVALID);
492 * Creates a new invalid statement.
494 static statement_t *create_invalid_statement(void)
496 return allocate_statement_zero(STATEMENT_INVALID);
500 * Allocate a new empty statement.
502 static statement_t *create_empty_statement(void)
504 return allocate_statement_zero(STATEMENT_EMPTY);
508 * Returns the size of a type node.
510 * @param kind the type kind
512 static size_t get_type_struct_size(type_kind_t kind)
514 static const size_t sizes[] = {
515 [TYPE_ATOMIC] = sizeof(atomic_type_t),
516 [TYPE_COMPLEX] = sizeof(complex_type_t),
517 [TYPE_IMAGINARY] = sizeof(imaginary_type_t),
518 [TYPE_BITFIELD] = sizeof(bitfield_type_t),
519 [TYPE_COMPOUND_STRUCT] = sizeof(compound_type_t),
520 [TYPE_COMPOUND_UNION] = sizeof(compound_type_t),
521 [TYPE_ENUM] = sizeof(enum_type_t),
522 [TYPE_FUNCTION] = sizeof(function_type_t),
523 [TYPE_POINTER] = sizeof(pointer_type_t),
524 [TYPE_ARRAY] = sizeof(array_type_t),
525 [TYPE_BUILTIN] = sizeof(builtin_type_t),
526 [TYPE_TYPEDEF] = sizeof(typedef_type_t),
527 [TYPE_TYPEOF] = sizeof(typeof_type_t),
529 assert(lengthof(sizes) == (int)TYPE_TYPEOF + 1);
530 assert(kind <= TYPE_TYPEOF);
531 assert(sizes[kind] != 0);
536 * Allocate a type node of given kind and initialize all
539 * @param kind type kind to allocate
541 static type_t *allocate_type_zero(type_kind_t kind)
543 size_t size = get_type_struct_size(kind);
544 type_t *res = obstack_alloc(type_obst, size);
545 memset(res, 0, size);
546 res->base.kind = kind;
552 * Returns the size of an initializer node.
554 * @param kind the initializer kind
556 static size_t get_initializer_size(initializer_kind_t kind)
558 static const size_t sizes[] = {
559 [INITIALIZER_VALUE] = sizeof(initializer_value_t),
560 [INITIALIZER_STRING] = sizeof(initializer_string_t),
561 [INITIALIZER_WIDE_STRING] = sizeof(initializer_wide_string_t),
562 [INITIALIZER_LIST] = sizeof(initializer_list_t),
563 [INITIALIZER_DESIGNATOR] = sizeof(initializer_designator_t)
565 assert(kind < lengthof(sizes));
566 assert(sizes[kind] != 0);
571 * Allocate an initializer node of given kind and initialize all
574 static initializer_t *allocate_initializer_zero(initializer_kind_t kind)
576 initializer_t *result = allocate_ast_zero(get_initializer_size(kind));
583 * Returns the index of the top element of the environment stack.
585 static size_t environment_top(void)
587 return ARR_LEN(environment_stack);
591 * Returns the index of the top element of the global label stack.
593 static size_t label_top(void)
595 return ARR_LEN(label_stack);
599 * Return the next token.
601 static inline void next_token(void)
603 token = lookahead_buffer[lookahead_bufpos];
604 lookahead_buffer[lookahead_bufpos] = lexer_token;
607 lookahead_bufpos = (lookahead_bufpos + 1) % MAX_LOOKAHEAD;
610 print_token(stderr, &token);
611 fprintf(stderr, "\n");
616 * Return the next token with a given lookahead.
618 static inline const token_t *look_ahead(size_t num)
620 assert(0 < num && num <= MAX_LOOKAHEAD);
621 size_t pos = (lookahead_bufpos + num - 1) % MAX_LOOKAHEAD;
622 return &lookahead_buffer[pos];
626 * Adds a token type to the token type anchor set (a multi-set).
628 static void add_anchor_token(int token_type)
630 assert(0 <= token_type && token_type < T_LAST_TOKEN);
631 ++token_anchor_set[token_type];
635 * Set the number of tokens types of the given type
636 * to zero and return the old count.
638 static int save_and_reset_anchor_state(int token_type)
640 assert(0 <= token_type && token_type < T_LAST_TOKEN);
641 int count = token_anchor_set[token_type];
642 token_anchor_set[token_type] = 0;
647 * Restore the number of token types to the given count.
649 static void restore_anchor_state(int token_type, int count)
651 assert(0 <= token_type && token_type < T_LAST_TOKEN);
652 token_anchor_set[token_type] = count;
656 * Remove a token type from the token type anchor set (a multi-set).
658 static void rem_anchor_token(int token_type)
660 assert(0 <= token_type && token_type < T_LAST_TOKEN);
661 assert(token_anchor_set[token_type] != 0);
662 --token_anchor_set[token_type];
666 * Return true if the token type of the current token is
669 static bool at_anchor(void)
673 return token_anchor_set[token.type];
677 * Eat tokens until a matching token type is found.
679 static void eat_until_matching_token(int type)
683 case '(': end_token = ')'; break;
684 case '{': end_token = '}'; break;
685 case '[': end_token = ']'; break;
686 default: end_token = type; break;
689 unsigned parenthesis_count = 0;
690 unsigned brace_count = 0;
691 unsigned bracket_count = 0;
692 while (token.type != end_token ||
693 parenthesis_count != 0 ||
695 bracket_count != 0) {
696 switch (token.type) {
698 case '(': ++parenthesis_count; break;
699 case '{': ++brace_count; break;
700 case '[': ++bracket_count; break;
703 if (parenthesis_count > 0)
713 if (bracket_count > 0)
716 if (token.type == end_token &&
717 parenthesis_count == 0 &&
731 * Eat input tokens until an anchor is found.
733 static void eat_until_anchor(void)
735 while (token_anchor_set[token.type] == 0) {
736 if (token.type == '(' || token.type == '{' || token.type == '[')
737 eat_until_matching_token(token.type);
743 * Eat a whole block from input tokens.
745 static void eat_block(void)
747 eat_until_matching_token('{');
748 if (token.type == '}')
752 #define eat(token_type) (assert(token.type == (token_type)), next_token())
755 * Report a parse error because an expected token was not found.
758 #if defined __GNUC__ && __GNUC__ >= 4
759 __attribute__((sentinel))
761 void parse_error_expected(const char *message, ...)
763 if (message != NULL) {
764 errorf(HERE, "%s", message);
767 va_start(ap, message);
768 errorf(HERE, "got %K, expected %#k", &token, &ap, ", ");
773 * Report an incompatible type.
775 static void type_error_incompatible(const char *msg,
776 const source_position_t *source_position, type_t *type1, type_t *type2)
778 errorf(source_position, "%s, incompatible types: '%T' - '%T'",
783 * Expect the current token is the expected token.
784 * If not, generate an error, eat the current statement,
785 * and goto the end_error label.
787 #define expect(expected, error_label) \
789 if (UNLIKELY(token.type != (expected))) { \
790 parse_error_expected(NULL, (expected), NULL); \
791 add_anchor_token(expected); \
792 eat_until_anchor(); \
793 if (token.type == expected) \
795 rem_anchor_token(expected); \
802 * Push a given scope on the scope stack and make it the
805 static scope_t *scope_push(scope_t *new_scope)
807 if (current_scope != NULL) {
808 new_scope->depth = current_scope->depth + 1;
811 scope_t *old_scope = current_scope;
812 current_scope = new_scope;
817 * Pop the current scope from the scope stack.
819 static void scope_pop(scope_t *old_scope)
821 current_scope = old_scope;
825 * Search an entity by its symbol in a given namespace.
827 static entity_t *get_entity(const symbol_t *const symbol,
828 namespace_tag_t namespc)
830 entity_t *entity = symbol->entity;
831 for (; entity != NULL; entity = entity->base.symbol_next) {
832 if (entity->base.namespc == namespc)
840 * pushs an entity on the environment stack and links the corresponding symbol
843 static void stack_push(stack_entry_t **stack_ptr, entity_t *entity)
845 symbol_t *symbol = entity->base.symbol;
846 entity_namespace_t namespc = entity->base.namespc;
847 assert(namespc != NAMESPACE_INVALID);
849 /* replace/add entity into entity list of the symbol */
852 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
857 /* replace an entry? */
858 if (iter->base.namespc == namespc) {
859 entity->base.symbol_next = iter->base.symbol_next;
865 /* remember old declaration */
867 entry.symbol = symbol;
868 entry.old_entity = iter;
869 entry.namespc = namespc;
870 ARR_APP1(stack_entry_t, *stack_ptr, entry);
874 * Push an entity on the environment stack.
876 static void environment_push(entity_t *entity)
878 assert(entity->base.source_position.input_name != NULL);
879 assert(entity->base.parent_scope != NULL);
880 stack_push(&environment_stack, entity);
884 * Push a declaration on the global label stack.
886 * @param declaration the declaration
888 static void label_push(entity_t *label)
890 /* we abuse the parameters scope as parent for the labels */
891 label->base.parent_scope = ¤t_function->parameters;
892 stack_push(&label_stack, label);
896 * pops symbols from the environment stack until @p new_top is the top element
898 static void stack_pop_to(stack_entry_t **stack_ptr, size_t new_top)
900 stack_entry_t *stack = *stack_ptr;
901 size_t top = ARR_LEN(stack);
904 assert(new_top <= top);
908 for (i = top; i > new_top; --i) {
909 stack_entry_t *entry = &stack[i - 1];
911 entity_t *old_entity = entry->old_entity;
912 symbol_t *symbol = entry->symbol;
913 entity_namespace_t namespc = entry->namespc;
915 /* replace with old_entity/remove */
918 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
920 assert(iter != NULL);
921 /* replace an entry? */
922 if (iter->base.namespc == namespc)
926 /* restore definition from outer scopes (if there was one) */
927 if (old_entity != NULL) {
928 old_entity->base.symbol_next = iter->base.symbol_next;
929 *anchor = old_entity;
931 /* remove entry from list */
932 *anchor = iter->base.symbol_next;
936 ARR_SHRINKLEN(*stack_ptr, (int) new_top);
940 * Pop all entries from the environment stack until the new_top
943 * @param new_top the new stack top
945 static void environment_pop_to(size_t new_top)
947 stack_pop_to(&environment_stack, new_top);
951 * Pop all entries from the global label stack until the new_top
954 * @param new_top the new stack top
956 static void label_pop_to(size_t new_top)
958 stack_pop_to(&label_stack, new_top);
961 static int get_akind_rank(atomic_type_kind_t akind)
967 * Return the type rank for an atomic type.
969 static int get_rank(const type_t *type)
971 assert(!is_typeref(type));
972 if (type->kind == TYPE_ENUM)
973 return get_akind_rank(type->enumt.akind);
975 assert(type->kind == TYPE_ATOMIC);
976 return get_akind_rank(type->atomic.akind);
980 * Do integer promotion for a given type.
982 * @param type the type to promote
983 * @return the promoted type
985 static type_t *promote_integer(type_t *type)
987 if (type->kind == TYPE_BITFIELD)
988 type = type->bitfield.base_type;
990 if (get_rank(type) < get_akind_rank(ATOMIC_TYPE_INT))
997 * Create a cast expression.
999 * @param expression the expression to cast
1000 * @param dest_type the destination type
1002 static expression_t *create_cast_expression(expression_t *expression,
1005 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST_IMPLICIT);
1007 cast->unary.value = expression;
1008 cast->base.type = dest_type;
1014 * Check if a given expression represents a null pointer constant.
1016 * @param expression the expression to check
1018 static bool is_null_pointer_constant(const expression_t *expression)
1020 /* skip void* cast */
1021 if (expression->kind == EXPR_UNARY_CAST ||
1022 expression->kind == EXPR_UNARY_CAST_IMPLICIT) {
1023 type_t *const type = skip_typeref(expression->base.type);
1024 if (types_compatible(type, type_void_ptr))
1025 expression = expression->unary.value;
1028 type_t *const type = skip_typeref(expression->base.type);
1030 is_type_integer(type) &&
1031 is_constant_expression(expression) &&
1032 fold_constant(expression) == 0;
1036 * Create an implicit cast expression.
1038 * @param expression the expression to cast
1039 * @param dest_type the destination type
1041 static expression_t *create_implicit_cast(expression_t *expression,
1044 type_t *const source_type = expression->base.type;
1046 if (source_type == dest_type)
1049 return create_cast_expression(expression, dest_type);
1052 typedef enum assign_error_t {
1054 ASSIGN_ERROR_INCOMPATIBLE,
1055 ASSIGN_ERROR_POINTER_QUALIFIER_MISSING,
1056 ASSIGN_WARNING_POINTER_INCOMPATIBLE,
1057 ASSIGN_WARNING_POINTER_FROM_INT,
1058 ASSIGN_WARNING_INT_FROM_POINTER
1061 static void report_assign_error(assign_error_t error, type_t *orig_type_left,
1062 const expression_t *const right,
1063 const char *context,
1064 const source_position_t *source_position)
1066 type_t *const orig_type_right = right->base.type;
1067 type_t *const type_left = skip_typeref(orig_type_left);
1068 type_t *const type_right = skip_typeref(orig_type_right);
1071 case ASSIGN_SUCCESS:
1073 case ASSIGN_ERROR_INCOMPATIBLE:
1074 errorf(source_position,
1075 "destination type '%T' in %s is incompatible with type '%T'",
1076 orig_type_left, context, orig_type_right);
1079 case ASSIGN_ERROR_POINTER_QUALIFIER_MISSING: {
1080 if (warning.other) {
1081 type_t *points_to_left = skip_typeref(type_left->pointer.points_to);
1082 type_t *points_to_right = skip_typeref(type_right->pointer.points_to);
1084 /* the left type has all qualifiers from the right type */
1085 unsigned missing_qualifiers
1086 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
1087 warningf(source_position,
1088 "destination type '%T' in %s from type '%T' lacks qualifiers '%Q' in pointer target type",
1089 orig_type_left, context, orig_type_right, missing_qualifiers);
1094 case ASSIGN_WARNING_POINTER_INCOMPATIBLE:
1095 if (warning.other) {
1096 warningf(source_position,
1097 "destination type '%T' in %s is incompatible with '%E' of type '%T'",
1098 orig_type_left, context, right, orig_type_right);
1102 case ASSIGN_WARNING_POINTER_FROM_INT:
1103 if (warning.other) {
1104 warningf(source_position,
1105 "%s makes pointer '%T' from integer '%T' without a cast",
1106 context, orig_type_left, orig_type_right);
1110 case ASSIGN_WARNING_INT_FROM_POINTER:
1111 if (warning.other) {
1112 warningf(source_position,
1113 "%s makes integer '%T' from pointer '%T' without a cast",
1114 context, orig_type_left, orig_type_right);
1119 panic("invalid error value");
1123 /** Implements the rules from §6.5.16.1 */
1124 static assign_error_t semantic_assign(type_t *orig_type_left,
1125 const expression_t *const right)
1127 type_t *const orig_type_right = right->base.type;
1128 type_t *const type_left = skip_typeref(orig_type_left);
1129 type_t *const type_right = skip_typeref(orig_type_right);
1131 if (is_type_pointer(type_left)) {
1132 if (is_null_pointer_constant(right)) {
1133 return ASSIGN_SUCCESS;
1134 } else if (is_type_pointer(type_right)) {
1135 type_t *points_to_left
1136 = skip_typeref(type_left->pointer.points_to);
1137 type_t *points_to_right
1138 = skip_typeref(type_right->pointer.points_to);
1139 assign_error_t res = ASSIGN_SUCCESS;
1141 /* the left type has all qualifiers from the right type */
1142 unsigned missing_qualifiers
1143 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
1144 if (missing_qualifiers != 0) {
1145 res = ASSIGN_ERROR_POINTER_QUALIFIER_MISSING;
1148 points_to_left = get_unqualified_type(points_to_left);
1149 points_to_right = get_unqualified_type(points_to_right);
1151 if (is_type_atomic(points_to_left, ATOMIC_TYPE_VOID))
1154 if (is_type_atomic(points_to_right, ATOMIC_TYPE_VOID)) {
1155 /* ISO/IEC 14882:1998(E) §C.1.2:6 */
1156 return c_mode & _CXX ? ASSIGN_ERROR_INCOMPATIBLE : res;
1159 if (!types_compatible(points_to_left, points_to_right)) {
1160 return ASSIGN_WARNING_POINTER_INCOMPATIBLE;
1164 } else if (is_type_integer(type_right)) {
1165 return ASSIGN_WARNING_POINTER_FROM_INT;
1167 } else if ((is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) ||
1168 (is_type_atomic(type_left, ATOMIC_TYPE_BOOL)
1169 && is_type_pointer(type_right))) {
1170 return ASSIGN_SUCCESS;
1171 } else if ((is_type_compound(type_left) && is_type_compound(type_right))
1172 || (is_type_builtin(type_left) && is_type_builtin(type_right))) {
1173 type_t *const unqual_type_left = get_unqualified_type(type_left);
1174 type_t *const unqual_type_right = get_unqualified_type(type_right);
1175 if (types_compatible(unqual_type_left, unqual_type_right)) {
1176 return ASSIGN_SUCCESS;
1178 } else if (is_type_integer(type_left) && is_type_pointer(type_right)) {
1179 return ASSIGN_WARNING_INT_FROM_POINTER;
1182 if (!is_type_valid(type_left) || !is_type_valid(type_right))
1183 return ASSIGN_SUCCESS;
1185 return ASSIGN_ERROR_INCOMPATIBLE;
1188 static expression_t *parse_constant_expression(void)
1190 expression_t *result = parse_sub_expression(PREC_CONDITIONAL);
1192 if (!is_constant_expression(result)) {
1193 errorf(&result->base.source_position,
1194 "expression '%E' is not constant", result);
1200 static expression_t *parse_assignment_expression(void)
1202 return parse_sub_expression(PREC_ASSIGNMENT);
1205 static string_t parse_string_literals(void)
1207 assert(token.type == T_STRING_LITERAL);
1208 string_t result = token.v.string;
1212 while (token.type == T_STRING_LITERAL) {
1213 result = concat_strings(&result, &token.v.string);
1220 static const char *const gnu_attribute_names[GNU_AK_LAST] = {
1221 [GNU_AK_CONST] = "const",
1222 [GNU_AK_VOLATILE] = "volatile",
1223 [GNU_AK_CDECL] = "cdecl",
1224 [GNU_AK_STDCALL] = "stdcall",
1225 [GNU_AK_FASTCALL] = "fastcall",
1226 [GNU_AK_DEPRECATED] = "deprecated",
1227 [GNU_AK_NOINLINE] = "noinline",
1228 [GNU_AK_RETURNS_TWICE] = "returns_twice",
1229 [GNU_AK_NORETURN] = "noreturn",
1230 [GNU_AK_NAKED] = "naked",
1231 [GNU_AK_PURE] = "pure",
1232 [GNU_AK_ALWAYS_INLINE] = "always_inline",
1233 [GNU_AK_MALLOC] = "malloc",
1234 [GNU_AK_WEAK] = "weak",
1235 [GNU_AK_CONSTRUCTOR] = "constructor",
1236 [GNU_AK_DESTRUCTOR] = "destructor",
1237 [GNU_AK_NOTHROW] = "nothrow",
1238 [GNU_AK_TRANSPARENT_UNION] = "transparent_union",
1239 [GNU_AK_COMMON] = "common",
1240 [GNU_AK_NOCOMMON] = "nocommon",
1241 [GNU_AK_PACKED] = "packed",
1242 [GNU_AK_SHARED] = "shared",
1243 [GNU_AK_NOTSHARED] = "notshared",
1244 [GNU_AK_USED] = "used",
1245 [GNU_AK_UNUSED] = "unused",
1246 [GNU_AK_NO_INSTRUMENT_FUNCTION] = "no_instrument_function",
1247 [GNU_AK_WARN_UNUSED_RESULT] = "warn_unused_result",
1248 [GNU_AK_LONGCALL] = "longcall",
1249 [GNU_AK_SHORTCALL] = "shortcall",
1250 [GNU_AK_LONG_CALL] = "long_call",
1251 [GNU_AK_SHORT_CALL] = "short_call",
1252 [GNU_AK_FUNCTION_VECTOR] = "function_vector",
1253 [GNU_AK_INTERRUPT] = "interrupt",
1254 [GNU_AK_INTERRUPT_HANDLER] = "interrupt_handler",
1255 [GNU_AK_NMI_HANDLER] = "nmi_handler",
1256 [GNU_AK_NESTING] = "nesting",
1257 [GNU_AK_NEAR] = "near",
1258 [GNU_AK_FAR] = "far",
1259 [GNU_AK_SIGNAL] = "signal",
1260 [GNU_AK_EIGTHBIT_DATA] = "eightbit_data",
1261 [GNU_AK_TINY_DATA] = "tiny_data",
1262 [GNU_AK_SAVEALL] = "saveall",
1263 [GNU_AK_FLATTEN] = "flatten",
1264 [GNU_AK_SSEREGPARM] = "sseregparm",
1265 [GNU_AK_EXTERNALLY_VISIBLE] = "externally_visible",
1266 [GNU_AK_RETURN_TWICE] = "return_twice",
1267 [GNU_AK_MAY_ALIAS] = "may_alias",
1268 [GNU_AK_MS_STRUCT] = "ms_struct",
1269 [GNU_AK_GCC_STRUCT] = "gcc_struct",
1270 [GNU_AK_DLLIMPORT] = "dllimport",
1271 [GNU_AK_DLLEXPORT] = "dllexport",
1272 [GNU_AK_ALIGNED] = "aligned",
1273 [GNU_AK_ALIAS] = "alias",
1274 [GNU_AK_SECTION] = "section",
1275 [GNU_AK_FORMAT] = "format",
1276 [GNU_AK_FORMAT_ARG] = "format_arg",
1277 [GNU_AK_WEAKREF] = "weakref",
1278 [GNU_AK_NONNULL] = "nonnull",
1279 [GNU_AK_TLS_MODEL] = "tls_model",
1280 [GNU_AK_VISIBILITY] = "visibility",
1281 [GNU_AK_REGPARM] = "regparm",
1282 [GNU_AK_MODE] = "mode",
1283 [GNU_AK_MODEL] = "model",
1284 [GNU_AK_TRAP_EXIT] = "trap_exit",
1285 [GNU_AK_SP_SWITCH] = "sp_switch",
1286 [GNU_AK_SENTINEL] = "sentinel"
1290 * compare two string, ignoring double underscores on the second.
1292 static int strcmp_underscore(const char *s1, const char *s2)
1294 if (s2[0] == '_' && s2[1] == '_') {
1295 size_t len2 = strlen(s2);
1296 size_t len1 = strlen(s1);
1297 if (len1 == len2-4 && s2[len2-2] == '_' && s2[len2-1] == '_') {
1298 return strncmp(s1, s2+2, len2-4);
1302 return strcmp(s1, s2);
1306 * Allocate a new gnu temporal attribute of given kind.
1308 static gnu_attribute_t *allocate_gnu_attribute(gnu_attribute_kind_t kind)
1310 gnu_attribute_t *attribute = obstack_alloc(&temp_obst, sizeof(*attribute));
1311 attribute->kind = kind;
1312 attribute->next = NULL;
1313 attribute->invalid = false;
1314 attribute->has_arguments = false;
1320 * Parse one constant expression argument of the given attribute.
1322 static void parse_gnu_attribute_const_arg(gnu_attribute_t *attribute)
1324 expression_t *expression;
1325 add_anchor_token(')');
1326 expression = parse_constant_expression();
1327 rem_anchor_token(')');
1328 expect(')', end_error);
1329 attribute->u.argument = fold_constant(expression);
1332 attribute->invalid = true;
1336 * Parse a list of constant expressions arguments of the given attribute.
1338 static void parse_gnu_attribute_const_arg_list(gnu_attribute_t *attribute)
1340 argument_list_t **list = &attribute->u.arguments;
1341 argument_list_t *entry;
1342 expression_t *expression;
1343 add_anchor_token(')');
1344 add_anchor_token(',');
1346 expression = parse_constant_expression();
1347 entry = obstack_alloc(&temp_obst, sizeof(entry));
1348 entry->argument = fold_constant(expression);
1351 list = &entry->next;
1352 if (token.type != ',')
1356 rem_anchor_token(',');
1357 rem_anchor_token(')');
1358 expect(')', end_error);
1361 attribute->invalid = true;
1365 * Parse one string literal argument of the given attribute.
1367 static void parse_gnu_attribute_string_arg(gnu_attribute_t *attribute,
1370 add_anchor_token('(');
1371 if (token.type != T_STRING_LITERAL) {
1372 parse_error_expected("while parsing attribute directive",
1373 T_STRING_LITERAL, NULL);
1376 *string = parse_string_literals();
1377 rem_anchor_token('(');
1378 expect(')', end_error);
1381 attribute->invalid = true;
1385 * Parse one tls model of the given attribute.
1387 static void parse_gnu_attribute_tls_model_arg(gnu_attribute_t *attribute)
1389 static const char *const tls_models[] = {
1395 string_t string = { NULL, 0 };
1396 parse_gnu_attribute_string_arg(attribute, &string);
1397 if (string.begin != NULL) {
1398 for (size_t i = 0; i < 4; ++i) {
1399 if (strcmp(tls_models[i], string.begin) == 0) {
1400 attribute->u.value = i;
1404 errorf(HERE, "'%s' is an unrecognized tls model", string.begin);
1406 attribute->invalid = true;
1410 * Parse one tls model of the given attribute.
1412 static void parse_gnu_attribute_visibility_arg(gnu_attribute_t *attribute)
1414 static const char *const visibilities[] = {
1420 string_t string = { NULL, 0 };
1421 parse_gnu_attribute_string_arg(attribute, &string);
1422 if (string.begin != NULL) {
1423 for (size_t i = 0; i < 4; ++i) {
1424 if (strcmp(visibilities[i], string.begin) == 0) {
1425 attribute->u.value = i;
1429 errorf(HERE, "'%s' is an unrecognized visibility", string.begin);
1431 attribute->invalid = true;
1435 * Parse one (code) model of the given attribute.
1437 static void parse_gnu_attribute_model_arg(gnu_attribute_t *attribute)
1439 static const char *const visibilities[] = {
1444 string_t string = { NULL, 0 };
1445 parse_gnu_attribute_string_arg(attribute, &string);
1446 if (string.begin != NULL) {
1447 for (int i = 0; i < 3; ++i) {
1448 if (strcmp(visibilities[i], string.begin) == 0) {
1449 attribute->u.value = i;
1453 errorf(HERE, "'%s' is an unrecognized model", string.begin);
1455 attribute->invalid = true;
1459 * Parse one mode of the given attribute.
1461 static void parse_gnu_attribute_mode_arg(gnu_attribute_t *attribute)
1463 add_anchor_token(')');
1465 if (token.type != T_IDENTIFIER) {
1466 expect(T_IDENTIFIER, end_error);
1469 attribute->u.symbol = token.v.symbol;
1472 rem_anchor_token(')');
1473 expect(')', end_error);
1476 attribute->invalid = true;
1480 * Parse one interrupt argument of the given attribute.
1482 static void parse_gnu_attribute_interrupt_arg(gnu_attribute_t *attribute)
1484 static const char *const interrupts[] = {
1491 string_t string = { NULL, 0 };
1492 parse_gnu_attribute_string_arg(attribute, &string);
1493 if (string.begin != NULL) {
1494 for (size_t i = 0; i < 5; ++i) {
1495 if (strcmp(interrupts[i], string.begin) == 0) {
1496 attribute->u.value = i;
1500 errorf(HERE, "'%s' is not an interrupt", string.begin);
1502 attribute->invalid = true;
1506 * Parse ( identifier, const expression, const expression )
1508 static void parse_gnu_attribute_format_args(gnu_attribute_t *attribute)
1510 static const char *const format_names[] = {
1518 if (token.type != T_IDENTIFIER) {
1519 parse_error_expected("while parsing format attribute directive", T_IDENTIFIER, NULL);
1522 const char *name = token.v.symbol->string;
1523 for (i = 0; i < 4; ++i) {
1524 if (strcmp_underscore(format_names[i], name) == 0)
1528 if (warning.attribute)
1529 warningf(HERE, "'%s' is an unrecognized format function type", name);
1533 expect(',', end_error);
1534 add_anchor_token(')');
1535 add_anchor_token(',');
1536 parse_constant_expression();
1537 rem_anchor_token(',');
1538 rem_anchor_token(')');
1540 expect(',', end_error);
1541 add_anchor_token(')');
1542 parse_constant_expression();
1543 rem_anchor_token(')');
1544 expect(')', end_error);
1547 attribute->u.value = true;
1551 * Check that a given GNU attribute has no arguments.
1553 static void check_no_argument(gnu_attribute_t *attribute, const char *name)
1555 if (!attribute->has_arguments)
1558 /* should have no arguments */
1559 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1560 eat_until_matching_token('(');
1561 /* we have already consumed '(', so we stop before ')', eat it */
1563 attribute->invalid = true;
1567 * Parse one GNU attribute.
1569 * Note that attribute names can be specified WITH or WITHOUT
1570 * double underscores, ie const or __const__.
1572 * The following attributes are parsed without arguments
1597 * no_instrument_function
1598 * warn_unused_result
1615 * externally_visible
1623 * The following attributes are parsed with arguments
1624 * aligned( const expression )
1625 * alias( string literal )
1626 * section( string literal )
1627 * format( identifier, const expression, const expression )
1628 * format_arg( const expression )
1629 * tls_model( string literal )
1630 * visibility( string literal )
1631 * regparm( const expression )
1632 * model( string leteral )
1633 * trap_exit( const expression )
1634 * sp_switch( string literal )
1636 * The following attributes might have arguments
1637 * weak_ref( string literal )
1638 * non_null( const expression // ',' )
1639 * interrupt( string literal )
1640 * sentinel( constant expression )
1642 static decl_modifiers_t parse_gnu_attribute(gnu_attribute_t **attributes)
1644 gnu_attribute_t *head = *attributes;
1645 gnu_attribute_t *last = *attributes;
1646 decl_modifiers_t modifiers = 0;
1647 gnu_attribute_t *attribute;
1649 eat(T___attribute__);
1650 expect('(', end_error);
1651 expect('(', end_error);
1653 if (token.type != ')') {
1654 /* find the end of the list */
1656 while (last->next != NULL)
1660 /* non-empty attribute list */
1663 if (token.type == T_const) {
1665 } else if (token.type == T_volatile) {
1667 } else if (token.type == T_cdecl) {
1668 /* __attribute__((cdecl)), WITH ms mode */
1670 } else if (token.type == T_IDENTIFIER) {
1671 const symbol_t *sym = token.v.symbol;
1674 parse_error_expected("while parsing GNU attribute", T_IDENTIFIER, NULL);
1681 for (i = 0; i < GNU_AK_LAST; ++i) {
1682 if (strcmp_underscore(gnu_attribute_names[i], name) == 0)
1685 gnu_attribute_kind_t kind = (gnu_attribute_kind_t)i;
1688 if (kind == GNU_AK_LAST) {
1689 if (warning.attribute)
1690 warningf(HERE, "'%s' attribute directive ignored", name);
1692 /* skip possible arguments */
1693 if (token.type == '(') {
1694 eat_until_matching_token(')');
1697 /* check for arguments */
1698 attribute = allocate_gnu_attribute(kind);
1699 if (token.type == '(') {
1701 if (token.type == ')') {
1702 /* empty args are allowed */
1705 attribute->has_arguments = true;
1709 case GNU_AK_VOLATILE:
1714 case GNU_AK_NOCOMMON:
1716 case GNU_AK_NOTSHARED:
1717 case GNU_AK_NO_INSTRUMENT_FUNCTION:
1718 case GNU_AK_WARN_UNUSED_RESULT:
1719 case GNU_AK_LONGCALL:
1720 case GNU_AK_SHORTCALL:
1721 case GNU_AK_LONG_CALL:
1722 case GNU_AK_SHORT_CALL:
1723 case GNU_AK_FUNCTION_VECTOR:
1724 case GNU_AK_INTERRUPT_HANDLER:
1725 case GNU_AK_NMI_HANDLER:
1726 case GNU_AK_NESTING:
1730 case GNU_AK_EIGTHBIT_DATA:
1731 case GNU_AK_TINY_DATA:
1732 case GNU_AK_SAVEALL:
1733 case GNU_AK_FLATTEN:
1734 case GNU_AK_SSEREGPARM:
1735 case GNU_AK_EXTERNALLY_VISIBLE:
1736 case GNU_AK_RETURN_TWICE:
1737 case GNU_AK_MAY_ALIAS:
1738 case GNU_AK_MS_STRUCT:
1739 case GNU_AK_GCC_STRUCT:
1742 case GNU_AK_CDECL: modifiers |= DM_CDECL; goto no_arg;
1743 case GNU_AK_FASTCALL: modifiers |= DM_FASTCALL; goto no_arg;
1744 case GNU_AK_STDCALL: modifiers |= DM_STDCALL; goto no_arg;
1745 case GNU_AK_UNUSED: modifiers |= DM_UNUSED; goto no_arg;
1746 case GNU_AK_USED: modifiers |= DM_USED; goto no_arg;
1747 case GNU_AK_PURE: modifiers |= DM_PURE; goto no_arg;
1748 case GNU_AK_CONST: modifiers |= DM_CONST; goto no_arg;
1749 case GNU_AK_ALWAYS_INLINE: modifiers |= DM_FORCEINLINE; goto no_arg;
1750 case GNU_AK_DLLIMPORT: modifiers |= DM_DLLIMPORT; goto no_arg;
1751 case GNU_AK_DLLEXPORT: modifiers |= DM_DLLEXPORT; goto no_arg;
1752 case GNU_AK_PACKED: modifiers |= DM_PACKED; goto no_arg;
1753 case GNU_AK_NOINLINE: modifiers |= DM_NOINLINE; goto no_arg;
1754 case GNU_AK_RETURNS_TWICE: modifiers |= DM_RETURNS_TWICE; goto no_arg;
1755 case GNU_AK_NORETURN: modifiers |= DM_NORETURN; goto no_arg;
1756 case GNU_AK_NOTHROW: modifiers |= DM_NOTHROW; goto no_arg;
1757 case GNU_AK_TRANSPARENT_UNION: modifiers |= DM_TRANSPARENT_UNION; goto no_arg;
1758 case GNU_AK_CONSTRUCTOR: modifiers |= DM_CONSTRUCTOR; goto no_arg;
1759 case GNU_AK_DESTRUCTOR: modifiers |= DM_DESTRUCTOR; goto no_arg;
1760 case GNU_AK_DEPRECATED: modifiers |= DM_DEPRECATED; goto no_arg;
1762 case GNU_AK_ALIGNED:
1763 /* __align__ may be used without an argument */
1764 if (attribute->has_arguments) {
1765 parse_gnu_attribute_const_arg(attribute);
1769 case GNU_AK_FORMAT_ARG:
1770 case GNU_AK_REGPARM:
1771 case GNU_AK_TRAP_EXIT:
1772 if (!attribute->has_arguments) {
1773 /* should have arguments */
1774 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1775 attribute->invalid = true;
1777 parse_gnu_attribute_const_arg(attribute);
1780 case GNU_AK_SECTION:
1781 case GNU_AK_SP_SWITCH:
1782 if (!attribute->has_arguments) {
1783 /* should have arguments */
1784 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1785 attribute->invalid = true;
1787 parse_gnu_attribute_string_arg(attribute, &attribute->u.string);
1790 if (!attribute->has_arguments) {
1791 /* should have arguments */
1792 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1793 attribute->invalid = true;
1795 parse_gnu_attribute_format_args(attribute);
1797 case GNU_AK_WEAKREF:
1798 /* may have one string argument */
1799 if (attribute->has_arguments)
1800 parse_gnu_attribute_string_arg(attribute, &attribute->u.string);
1802 case GNU_AK_NONNULL:
1803 if (attribute->has_arguments)
1804 parse_gnu_attribute_const_arg_list(attribute);
1806 case GNU_AK_TLS_MODEL:
1807 if (!attribute->has_arguments) {
1808 /* should have arguments */
1809 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1811 parse_gnu_attribute_tls_model_arg(attribute);
1813 case GNU_AK_VISIBILITY:
1814 if (!attribute->has_arguments) {
1815 /* should have arguments */
1816 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1818 parse_gnu_attribute_visibility_arg(attribute);
1821 if (!attribute->has_arguments) {
1822 /* should have arguments */
1823 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1825 parse_gnu_attribute_model_arg(attribute);
1829 if (!attribute->has_arguments) {
1830 /* should have arguments */
1831 errorf(HERE, "wrong number of arguments specified for '%s' attribute", name);
1833 parse_gnu_attribute_mode_arg(attribute);
1836 case GNU_AK_INTERRUPT:
1837 /* may have one string argument */
1838 if (attribute->has_arguments)
1839 parse_gnu_attribute_interrupt_arg(attribute);
1841 case GNU_AK_SENTINEL:
1842 /* may have one string argument */
1843 if (attribute->has_arguments)
1844 parse_gnu_attribute_const_arg(attribute);
1847 /* already handled */
1851 check_no_argument(attribute, name);
1854 if (attribute != NULL) {
1856 last->next = attribute;
1859 head = last = attribute;
1863 if (token.type != ',')
1868 expect(')', end_error);
1869 expect(')', end_error);
1877 * Parse GNU attributes.
1879 static decl_modifiers_t parse_attributes(gnu_attribute_t **attributes)
1881 decl_modifiers_t modifiers = 0;
1884 switch (token.type) {
1885 case T___attribute__:
1886 modifiers |= parse_gnu_attribute(attributes);
1891 expect('(', end_error);
1892 if (token.type != T_STRING_LITERAL) {
1893 parse_error_expected("while parsing assembler attribute",
1894 T_STRING_LITERAL, NULL);
1895 eat_until_matching_token('(');
1898 parse_string_literals();
1900 expect(')', end_error);
1903 case T_cdecl: modifiers |= DM_CDECL; break;
1904 case T__fastcall: modifiers |= DM_FASTCALL; break;
1905 case T__stdcall: modifiers |= DM_STDCALL; break;
1908 /* TODO record modifier */
1910 warningf(HERE, "Ignoring declaration modifier %K", &token);
1914 default: return modifiers;
1921 static void mark_vars_read(expression_t *expr, entity_t *lhs_ent);
1923 static entity_t *determine_lhs_ent(expression_t *const expr,
1926 switch (expr->kind) {
1927 case EXPR_REFERENCE: {
1928 entity_t *const entity = expr->reference.entity;
1929 /* we should only find variables as lvalues... */
1930 if (entity->base.kind != ENTITY_VARIABLE
1931 && entity->base.kind != ENTITY_PARAMETER)
1937 case EXPR_ARRAY_ACCESS: {
1938 expression_t *const ref = expr->array_access.array_ref;
1939 entity_t * ent = NULL;
1940 if (is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1941 ent = determine_lhs_ent(ref, lhs_ent);
1944 mark_vars_read(expr->select.compound, lhs_ent);
1946 mark_vars_read(expr->array_access.index, lhs_ent);
1951 if (is_type_compound(skip_typeref(expr->base.type))) {
1952 return determine_lhs_ent(expr->select.compound, lhs_ent);
1954 mark_vars_read(expr->select.compound, lhs_ent);
1959 case EXPR_UNARY_DEREFERENCE: {
1960 expression_t *const val = expr->unary.value;
1961 if (val->kind == EXPR_UNARY_TAKE_ADDRESS) {
1963 return determine_lhs_ent(val->unary.value, lhs_ent);
1965 mark_vars_read(val, NULL);
1971 mark_vars_read(expr, NULL);
1976 #define ENT_ANY ((entity_t*)-1)
1979 * Mark declarations, which are read. This is used to detect variables, which
1983 * x is not marked as "read", because it is only read to calculate its own new
1987 * x and y are not detected as "not read", because multiple variables are
1990 static void mark_vars_read(expression_t *const expr, entity_t *lhs_ent)
1992 switch (expr->kind) {
1993 case EXPR_REFERENCE: {
1994 entity_t *const entity = expr->reference.entity;
1995 if (entity->kind != ENTITY_VARIABLE
1996 && entity->kind != ENTITY_PARAMETER)
1999 if (lhs_ent != entity && lhs_ent != ENT_ANY) {
2000 if (entity->kind == ENTITY_VARIABLE) {
2001 entity->variable.read = true;
2003 entity->parameter.read = true;
2010 // TODO respect pure/const
2011 mark_vars_read(expr->call.function, NULL);
2012 for (call_argument_t *arg = expr->call.arguments; arg != NULL; arg = arg->next) {
2013 mark_vars_read(arg->expression, NULL);
2017 case EXPR_CONDITIONAL:
2018 // TODO lhs_decl should depend on whether true/false have an effect
2019 mark_vars_read(expr->conditional.condition, NULL);
2020 if (expr->conditional.true_expression != NULL)
2021 mark_vars_read(expr->conditional.true_expression, lhs_ent);
2022 mark_vars_read(expr->conditional.false_expression, lhs_ent);
2026 if (lhs_ent == ENT_ANY
2027 && !is_type_compound(skip_typeref(expr->base.type)))
2029 mark_vars_read(expr->select.compound, lhs_ent);
2032 case EXPR_ARRAY_ACCESS: {
2033 expression_t *const ref = expr->array_access.array_ref;
2034 mark_vars_read(ref, lhs_ent);
2035 lhs_ent = determine_lhs_ent(ref, lhs_ent);
2036 mark_vars_read(expr->array_access.index, lhs_ent);
2041 mark_vars_read(expr->va_arge.ap, lhs_ent);
2044 case EXPR_UNARY_CAST:
2045 /* Special case: Use void cast to mark a variable as "read" */
2046 if (is_type_atomic(skip_typeref(expr->base.type), ATOMIC_TYPE_VOID))
2051 case EXPR_UNARY_THROW:
2052 if (expr->unary.value == NULL)
2055 case EXPR_UNARY_DEREFERENCE:
2056 case EXPR_UNARY_DELETE:
2057 case EXPR_UNARY_DELETE_ARRAY:
2058 if (lhs_ent == ENT_ANY)
2062 case EXPR_UNARY_NEGATE:
2063 case EXPR_UNARY_PLUS:
2064 case EXPR_UNARY_BITWISE_NEGATE:
2065 case EXPR_UNARY_NOT:
2066 case EXPR_UNARY_TAKE_ADDRESS:
2067 case EXPR_UNARY_POSTFIX_INCREMENT:
2068 case EXPR_UNARY_POSTFIX_DECREMENT:
2069 case EXPR_UNARY_PREFIX_INCREMENT:
2070 case EXPR_UNARY_PREFIX_DECREMENT:
2071 case EXPR_UNARY_CAST_IMPLICIT:
2072 case EXPR_UNARY_ASSUME:
2074 mark_vars_read(expr->unary.value, lhs_ent);
2077 case EXPR_BINARY_ADD:
2078 case EXPR_BINARY_SUB:
2079 case EXPR_BINARY_MUL:
2080 case EXPR_BINARY_DIV:
2081 case EXPR_BINARY_MOD:
2082 case EXPR_BINARY_EQUAL:
2083 case EXPR_BINARY_NOTEQUAL:
2084 case EXPR_BINARY_LESS:
2085 case EXPR_BINARY_LESSEQUAL:
2086 case EXPR_BINARY_GREATER:
2087 case EXPR_BINARY_GREATEREQUAL:
2088 case EXPR_BINARY_BITWISE_AND:
2089 case EXPR_BINARY_BITWISE_OR:
2090 case EXPR_BINARY_BITWISE_XOR:
2091 case EXPR_BINARY_LOGICAL_AND:
2092 case EXPR_BINARY_LOGICAL_OR:
2093 case EXPR_BINARY_SHIFTLEFT:
2094 case EXPR_BINARY_SHIFTRIGHT:
2095 case EXPR_BINARY_COMMA:
2096 case EXPR_BINARY_ISGREATER:
2097 case EXPR_BINARY_ISGREATEREQUAL:
2098 case EXPR_BINARY_ISLESS:
2099 case EXPR_BINARY_ISLESSEQUAL:
2100 case EXPR_BINARY_ISLESSGREATER:
2101 case EXPR_BINARY_ISUNORDERED:
2102 mark_vars_read(expr->binary.left, lhs_ent);
2103 mark_vars_read(expr->binary.right, lhs_ent);
2106 case EXPR_BINARY_ASSIGN:
2107 case EXPR_BINARY_MUL_ASSIGN:
2108 case EXPR_BINARY_DIV_ASSIGN:
2109 case EXPR_BINARY_MOD_ASSIGN:
2110 case EXPR_BINARY_ADD_ASSIGN:
2111 case EXPR_BINARY_SUB_ASSIGN:
2112 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
2113 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
2114 case EXPR_BINARY_BITWISE_AND_ASSIGN:
2115 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
2116 case EXPR_BINARY_BITWISE_OR_ASSIGN: {
2117 if (lhs_ent == ENT_ANY)
2119 lhs_ent = determine_lhs_ent(expr->binary.left, lhs_ent);
2120 mark_vars_read(expr->binary.right, lhs_ent);
2125 determine_lhs_ent(expr->va_starte.ap, lhs_ent);
2131 case EXPR_CHARACTER_CONSTANT:
2132 case EXPR_WIDE_CHARACTER_CONSTANT:
2133 case EXPR_STRING_LITERAL:
2134 case EXPR_WIDE_STRING_LITERAL:
2135 case EXPR_COMPOUND_LITERAL: // TODO init?
2137 case EXPR_CLASSIFY_TYPE:
2140 case EXPR_BUILTIN_SYMBOL:
2141 case EXPR_BUILTIN_CONSTANT_P:
2142 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
2144 case EXPR_STATEMENT: // TODO
2145 case EXPR_LABEL_ADDRESS:
2146 case EXPR_REFERENCE_ENUM_VALUE:
2150 panic("unhandled expression");
2153 static designator_t *parse_designation(void)
2155 designator_t *result = NULL;
2156 designator_t *last = NULL;
2159 designator_t *designator;
2160 switch (token.type) {
2162 designator = allocate_ast_zero(sizeof(designator[0]));
2163 designator->source_position = token.source_position;
2165 add_anchor_token(']');
2166 designator->array_index = parse_constant_expression();
2167 rem_anchor_token(']');
2168 expect(']', end_error);
2171 designator = allocate_ast_zero(sizeof(designator[0]));
2172 designator->source_position = token.source_position;
2174 if (token.type != T_IDENTIFIER) {
2175 parse_error_expected("while parsing designator",
2176 T_IDENTIFIER, NULL);
2179 designator->symbol = token.v.symbol;
2183 expect('=', end_error);
2187 assert(designator != NULL);
2189 last->next = designator;
2191 result = designator;
2199 static initializer_t *initializer_from_string(array_type_t *type,
2200 const string_t *const string)
2202 /* TODO: check len vs. size of array type */
2205 initializer_t *initializer = allocate_initializer_zero(INITIALIZER_STRING);
2206 initializer->string.string = *string;
2211 static initializer_t *initializer_from_wide_string(array_type_t *const type,
2212 wide_string_t *const string)
2214 /* TODO: check len vs. size of array type */
2217 initializer_t *const initializer =
2218 allocate_initializer_zero(INITIALIZER_WIDE_STRING);
2219 initializer->wide_string.string = *string;
2225 * Build an initializer from a given expression.
2227 static initializer_t *initializer_from_expression(type_t *orig_type,
2228 expression_t *expression)
2230 /* TODO check that expression is a constant expression */
2232 /* §6.7.8.14/15 char array may be initialized by string literals */
2233 type_t *type = skip_typeref(orig_type);
2234 type_t *expr_type_orig = expression->base.type;
2235 type_t *expr_type = skip_typeref(expr_type_orig);
2236 if (is_type_array(type) && expr_type->kind == TYPE_POINTER) {
2237 array_type_t *const array_type = &type->array;
2238 type_t *const element_type = skip_typeref(array_type->element_type);
2240 if (element_type->kind == TYPE_ATOMIC) {
2241 atomic_type_kind_t akind = element_type->atomic.akind;
2242 switch (expression->kind) {
2243 case EXPR_STRING_LITERAL:
2244 if (akind == ATOMIC_TYPE_CHAR
2245 || akind == ATOMIC_TYPE_SCHAR
2246 || akind == ATOMIC_TYPE_UCHAR) {
2247 return initializer_from_string(array_type,
2248 &expression->string.value);
2252 case EXPR_WIDE_STRING_LITERAL: {
2253 type_t *bare_wchar_type = skip_typeref(type_wchar_t);
2254 if (get_unqualified_type(element_type) == bare_wchar_type) {
2255 return initializer_from_wide_string(array_type,
2256 &expression->wide_string.value);
2267 assign_error_t error = semantic_assign(type, expression);
2268 if (error == ASSIGN_ERROR_INCOMPATIBLE)
2270 report_assign_error(error, type, expression, "initializer",
2271 &expression->base.source_position);
2273 initializer_t *const result = allocate_initializer_zero(INITIALIZER_VALUE);
2275 if (type->kind == TYPE_BITFIELD) {
2276 type = type->bitfield.base_type;
2279 result->value.value = create_implicit_cast(expression, type);
2285 * Checks if a given expression can be used as an constant initializer.
2287 static bool is_initializer_constant(const expression_t *expression)
2289 return is_constant_expression(expression)
2290 || is_address_constant(expression);
2294 * Parses an scalar initializer.
2296 * §6.7.8.11; eat {} without warning
2298 static initializer_t *parse_scalar_initializer(type_t *type,
2299 bool must_be_constant)
2301 /* there might be extra {} hierarchies */
2303 if (token.type == '{') {
2305 warningf(HERE, "extra curly braces around scalar initializer");
2309 } while (token.type == '{');
2312 expression_t *expression = parse_assignment_expression();
2313 mark_vars_read(expression, NULL);
2314 if (must_be_constant && !is_initializer_constant(expression)) {
2315 errorf(&expression->base.source_position,
2316 "Initialisation expression '%E' is not constant",
2320 initializer_t *initializer = initializer_from_expression(type, expression);
2322 if (initializer == NULL) {
2323 errorf(&expression->base.source_position,
2324 "expression '%E' (type '%T') doesn't match expected type '%T'",
2325 expression, expression->base.type, type);
2330 bool additional_warning_displayed = false;
2331 while (braces > 0) {
2332 if (token.type == ',') {
2335 if (token.type != '}') {
2336 if (!additional_warning_displayed && warning.other) {
2337 warningf(HERE, "additional elements in scalar initializer");
2338 additional_warning_displayed = true;
2349 * An entry in the type path.
2351 typedef struct type_path_entry_t type_path_entry_t;
2352 struct type_path_entry_t {
2353 type_t *type; /**< the upper top type. restored to path->top_tye if this entry is popped. */
2355 size_t index; /**< For array types: the current index. */
2356 declaration_t *compound_entry; /**< For compound types: the current declaration. */
2361 * A type path expression a position inside compound or array types.
2363 typedef struct type_path_t type_path_t;
2364 struct type_path_t {
2365 type_path_entry_t *path; /**< An flexible array containing the current path. */
2366 type_t *top_type; /**< type of the element the path points */
2367 size_t max_index; /**< largest index in outermost array */
2371 * Prints a type path for debugging.
2373 static __attribute__((unused)) void debug_print_type_path(
2374 const type_path_t *path)
2376 size_t len = ARR_LEN(path->path);
2378 for (size_t i = 0; i < len; ++i) {
2379 const type_path_entry_t *entry = & path->path[i];
2381 type_t *type = skip_typeref(entry->type);
2382 if (is_type_compound(type)) {
2383 /* in gcc mode structs can have no members */
2384 if (entry->v.compound_entry == NULL) {
2388 fprintf(stderr, ".%s",
2389 entry->v.compound_entry->base.symbol->string);
2390 } else if (is_type_array(type)) {
2391 fprintf(stderr, "[%u]", (unsigned) entry->v.index);
2393 fprintf(stderr, "-INVALID-");
2396 if (path->top_type != NULL) {
2397 fprintf(stderr, " (");
2398 print_type(path->top_type);
2399 fprintf(stderr, ")");
2404 * Return the top type path entry, ie. in a path
2405 * (type).a.b returns the b.
2407 static type_path_entry_t *get_type_path_top(const type_path_t *path)
2409 size_t len = ARR_LEN(path->path);
2411 return &path->path[len-1];
2415 * Enlarge the type path by an (empty) element.
2417 static type_path_entry_t *append_to_type_path(type_path_t *path)
2419 size_t len = ARR_LEN(path->path);
2420 ARR_RESIZE(type_path_entry_t, path->path, len+1);
2422 type_path_entry_t *result = & path->path[len];
2423 memset(result, 0, sizeof(result[0]));
2428 * Descending into a sub-type. Enter the scope of the current top_type.
2430 static void descend_into_subtype(type_path_t *path)
2432 type_t *orig_top_type = path->top_type;
2433 type_t *top_type = skip_typeref(orig_top_type);
2435 type_path_entry_t *top = append_to_type_path(path);
2436 top->type = top_type;
2438 if (is_type_compound(top_type)) {
2439 compound_t *compound = top_type->compound.compound;
2440 entity_t *entry = compound->members.entities;
2442 if (entry != NULL) {
2443 assert(entry->kind == ENTITY_COMPOUND_MEMBER);
2444 top->v.compound_entry = &entry->declaration;
2445 path->top_type = entry->declaration.type;
2447 path->top_type = NULL;
2449 } else if (is_type_array(top_type)) {
2451 path->top_type = top_type->array.element_type;
2453 assert(!is_type_valid(top_type));
2458 * Pop an entry from the given type path, ie. returning from
2459 * (type).a.b to (type).a
2461 static void ascend_from_subtype(type_path_t *path)
2463 type_path_entry_t *top = get_type_path_top(path);
2465 path->top_type = top->type;
2467 size_t len = ARR_LEN(path->path);
2468 ARR_RESIZE(type_path_entry_t, path->path, len-1);
2472 * Pop entries from the given type path until the given
2473 * path level is reached.
2475 static void ascend_to(type_path_t *path, size_t top_path_level)
2477 size_t len = ARR_LEN(path->path);
2479 while (len > top_path_level) {
2480 ascend_from_subtype(path);
2481 len = ARR_LEN(path->path);
2485 static bool walk_designator(type_path_t *path, const designator_t *designator,
2486 bool used_in_offsetof)
2488 for (; designator != NULL; designator = designator->next) {
2489 type_path_entry_t *top = get_type_path_top(path);
2490 type_t *orig_type = top->type;
2492 type_t *type = skip_typeref(orig_type);
2494 if (designator->symbol != NULL) {
2495 symbol_t *symbol = designator->symbol;
2496 if (!is_type_compound(type)) {
2497 if (is_type_valid(type)) {
2498 errorf(&designator->source_position,
2499 "'.%Y' designator used for non-compound type '%T'",
2503 top->type = type_error_type;
2504 top->v.compound_entry = NULL;
2505 orig_type = type_error_type;
2507 compound_t *compound = type->compound.compound;
2508 entity_t *iter = compound->members.entities;
2509 for (; iter != NULL; iter = iter->base.next) {
2510 if (iter->base.symbol == symbol) {
2515 errorf(&designator->source_position,
2516 "'%T' has no member named '%Y'", orig_type, symbol);
2519 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
2520 if (used_in_offsetof) {
2521 type_t *real_type = skip_typeref(iter->declaration.type);
2522 if (real_type->kind == TYPE_BITFIELD) {
2523 errorf(&designator->source_position,
2524 "offsetof designator '%Y' may not specify bitfield",
2530 top->type = orig_type;
2531 top->v.compound_entry = &iter->declaration;
2532 orig_type = iter->declaration.type;
2535 expression_t *array_index = designator->array_index;
2536 assert(designator->array_index != NULL);
2538 if (!is_type_array(type)) {
2539 if (is_type_valid(type)) {
2540 errorf(&designator->source_position,
2541 "[%E] designator used for non-array type '%T'",
2542 array_index, orig_type);
2547 long index = fold_constant(array_index);
2548 if (!used_in_offsetof) {
2550 errorf(&designator->source_position,
2551 "array index [%E] must be positive", array_index);
2552 } else if (type->array.size_constant) {
2553 long array_size = type->array.size;
2554 if (index >= array_size) {
2555 errorf(&designator->source_position,
2556 "designator [%E] (%d) exceeds array size %d",
2557 array_index, index, array_size);
2562 top->type = orig_type;
2563 top->v.index = (size_t) index;
2564 orig_type = type->array.element_type;
2566 path->top_type = orig_type;
2568 if (designator->next != NULL) {
2569 descend_into_subtype(path);
2578 static void advance_current_object(type_path_t *path, size_t top_path_level)
2580 type_path_entry_t *top = get_type_path_top(path);
2582 type_t *type = skip_typeref(top->type);
2583 if (is_type_union(type)) {
2584 /* in unions only the first element is initialized */
2585 top->v.compound_entry = NULL;
2586 } else if (is_type_struct(type)) {
2587 declaration_t *entry = top->v.compound_entry;
2589 entity_t *next_entity = entry->base.next;
2590 if (next_entity != NULL) {
2591 assert(is_declaration(next_entity));
2592 entry = &next_entity->declaration;
2597 top->v.compound_entry = entry;
2598 if (entry != NULL) {
2599 path->top_type = entry->type;
2602 } else if (is_type_array(type)) {
2603 assert(is_type_array(type));
2607 if (!type->array.size_constant || top->v.index < type->array.size) {
2611 assert(!is_type_valid(type));
2615 /* we're past the last member of the current sub-aggregate, try if we
2616 * can ascend in the type hierarchy and continue with another subobject */
2617 size_t len = ARR_LEN(path->path);
2619 if (len > top_path_level) {
2620 ascend_from_subtype(path);
2621 advance_current_object(path, top_path_level);
2623 path->top_type = NULL;
2628 * skip until token is found.
2630 static void skip_until(int type)
2632 while (token.type != type) {
2633 if (token.type == T_EOF)
2640 * skip any {...} blocks until a closing bracket is reached.
2642 static void skip_initializers(void)
2644 if (token.type == '{')
2647 while (token.type != '}') {
2648 if (token.type == T_EOF)
2650 if (token.type == '{') {
2658 static initializer_t *create_empty_initializer(void)
2660 static initializer_t empty_initializer
2661 = { .list = { { INITIALIZER_LIST }, 0 } };
2662 return &empty_initializer;
2666 * Parse a part of an initialiser for a struct or union,
2668 static initializer_t *parse_sub_initializer(type_path_t *path,
2669 type_t *outer_type, size_t top_path_level,
2670 parse_initializer_env_t *env)
2672 if (token.type == '}') {
2673 /* empty initializer */
2674 return create_empty_initializer();
2677 type_t *orig_type = path->top_type;
2678 type_t *type = NULL;
2680 if (orig_type == NULL) {
2681 /* We are initializing an empty compound. */
2683 type = skip_typeref(orig_type);
2686 initializer_t **initializers = NEW_ARR_F(initializer_t*, 0);
2689 designator_t *designator = NULL;
2690 if (token.type == '.' || token.type == '[') {
2691 designator = parse_designation();
2692 goto finish_designator;
2693 } else if (token.type == T_IDENTIFIER && look_ahead(1)->type == ':') {
2694 /* GNU-style designator ("identifier: value") */
2695 designator = allocate_ast_zero(sizeof(designator[0]));
2696 designator->source_position = token.source_position;
2697 designator->symbol = token.v.symbol;
2702 /* reset path to toplevel, evaluate designator from there */
2703 ascend_to(path, top_path_level);
2704 if (!walk_designator(path, designator, false)) {
2705 /* can't continue after designation error */
2709 initializer_t *designator_initializer
2710 = allocate_initializer_zero(INITIALIZER_DESIGNATOR);
2711 designator_initializer->designator.designator = designator;
2712 ARR_APP1(initializer_t*, initializers, designator_initializer);
2714 orig_type = path->top_type;
2715 type = orig_type != NULL ? skip_typeref(orig_type) : NULL;
2720 if (token.type == '{') {
2721 if (type != NULL && is_type_scalar(type)) {
2722 sub = parse_scalar_initializer(type, env->must_be_constant);
2726 if (env->entity != NULL) {
2728 "extra brace group at end of initializer for '%Y'",
2729 env->entity->base.symbol);
2731 errorf(HERE, "extra brace group at end of initializer");
2734 descend_into_subtype(path);
2736 add_anchor_token('}');
2737 sub = parse_sub_initializer(path, orig_type, top_path_level+1,
2739 rem_anchor_token('}');
2742 ascend_from_subtype(path);
2743 expect('}', end_error);
2745 expect('}', end_error);
2746 goto error_parse_next;
2750 /* must be an expression */
2751 expression_t *expression = parse_assignment_expression();
2752 mark_vars_read(expression, NULL);
2754 if (env->must_be_constant && !is_initializer_constant(expression)) {
2755 errorf(&expression->base.source_position,
2756 "Initialisation expression '%E' is not constant",
2761 /* we are already outside, ... */
2762 type_t *const outer_type_skip = skip_typeref(outer_type);
2763 if (is_type_compound(outer_type_skip) &&
2764 !outer_type_skip->compound.compound->complete) {
2765 goto error_parse_next;
2770 /* handle { "string" } special case */
2771 if ((expression->kind == EXPR_STRING_LITERAL
2772 || expression->kind == EXPR_WIDE_STRING_LITERAL)
2773 && outer_type != NULL) {
2774 sub = initializer_from_expression(outer_type, expression);
2776 if (token.type == ',') {
2779 if (token.type != '}' && warning.other) {
2780 warningf(HERE, "excessive elements in initializer for type '%T'",
2783 /* TODO: eat , ... */
2788 /* descend into subtypes until expression matches type */
2790 orig_type = path->top_type;
2791 type = skip_typeref(orig_type);
2793 sub = initializer_from_expression(orig_type, expression);
2797 if (!is_type_valid(type)) {
2800 if (is_type_scalar(type)) {
2801 errorf(&expression->base.source_position,
2802 "expression '%E' doesn't match expected type '%T'",
2803 expression, orig_type);
2807 descend_into_subtype(path);
2811 /* update largest index of top array */
2812 const type_path_entry_t *first = &path->path[0];
2813 type_t *first_type = first->type;
2814 first_type = skip_typeref(first_type);
2815 if (is_type_array(first_type)) {
2816 size_t index = first->v.index;
2817 if (index > path->max_index)
2818 path->max_index = index;
2822 /* append to initializers list */
2823 ARR_APP1(initializer_t*, initializers, sub);
2826 if (warning.other) {
2827 if (env->entity != NULL) {
2828 warningf(HERE, "excess elements in struct initializer for '%Y'",
2829 env->entity->base.symbol);
2831 warningf(HERE, "excess elements in struct initializer");
2837 if (token.type == '}') {
2840 expect(',', end_error);
2841 if (token.type == '}') {
2846 /* advance to the next declaration if we are not at the end */
2847 advance_current_object(path, top_path_level);
2848 orig_type = path->top_type;
2849 if (orig_type != NULL)
2850 type = skip_typeref(orig_type);
2856 size_t len = ARR_LEN(initializers);
2857 size_t size = sizeof(initializer_list_t) + len * sizeof(initializers[0]);
2858 initializer_t *result = allocate_ast_zero(size);
2859 result->kind = INITIALIZER_LIST;
2860 result->list.len = len;
2861 memcpy(&result->list.initializers, initializers,
2862 len * sizeof(initializers[0]));
2864 DEL_ARR_F(initializers);
2865 ascend_to(path, top_path_level+1);
2870 skip_initializers();
2871 DEL_ARR_F(initializers);
2872 ascend_to(path, top_path_level+1);
2877 * Parses an initializer. Parsers either a compound literal
2878 * (env->declaration == NULL) or an initializer of a declaration.
2880 static initializer_t *parse_initializer(parse_initializer_env_t *env)
2882 type_t *type = skip_typeref(env->type);
2883 size_t max_index = 0xdeadbeaf; // TODO: Resolve this uninitialized variable problem
2884 initializer_t *result;
2886 if (is_type_scalar(type)) {
2887 result = parse_scalar_initializer(type, env->must_be_constant);
2888 } else if (token.type == '{') {
2892 memset(&path, 0, sizeof(path));
2893 path.top_type = env->type;
2894 path.path = NEW_ARR_F(type_path_entry_t, 0);
2896 descend_into_subtype(&path);
2898 add_anchor_token('}');
2899 result = parse_sub_initializer(&path, env->type, 1, env);
2900 rem_anchor_token('}');
2902 max_index = path.max_index;
2903 DEL_ARR_F(path.path);
2905 expect('}', end_error);
2907 /* parse_scalar_initializer() also works in this case: we simply
2908 * have an expression without {} around it */
2909 result = parse_scalar_initializer(type, env->must_be_constant);
2912 /* §6.7.8:22 array initializers for arrays with unknown size determine
2913 * the array type size */
2914 if (is_type_array(type) && type->array.size_expression == NULL
2915 && result != NULL) {
2917 switch (result->kind) {
2918 case INITIALIZER_LIST:
2919 assert(max_index != 0xdeadbeaf);
2920 size = max_index + 1;
2923 case INITIALIZER_STRING:
2924 size = result->string.string.size;
2927 case INITIALIZER_WIDE_STRING:
2928 size = result->wide_string.string.size;
2931 case INITIALIZER_DESIGNATOR:
2932 case INITIALIZER_VALUE:
2933 /* can happen for parse errors */
2938 internal_errorf(HERE, "invalid initializer type");
2941 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
2942 cnst->base.type = type_size_t;
2943 cnst->conste.v.int_value = size;
2945 type_t *new_type = duplicate_type(type);
2947 new_type->array.size_expression = cnst;
2948 new_type->array.size_constant = true;
2949 new_type->array.has_implicit_size = true;
2950 new_type->array.size = size;
2951 env->type = new_type;
2959 static void append_entity(scope_t *scope, entity_t *entity)
2961 if (scope->last_entity != NULL) {
2962 scope->last_entity->base.next = entity;
2964 scope->entities = entity;
2966 scope->last_entity = entity;
2970 static compound_t *parse_compound_type_specifier(bool is_struct)
2972 gnu_attribute_t *attributes = NULL;
2973 decl_modifiers_t modifiers = 0;
2980 symbol_t *symbol = NULL;
2981 compound_t *compound = NULL;
2983 if (token.type == T___attribute__) {
2984 modifiers |= parse_attributes(&attributes);
2987 if (token.type == T_IDENTIFIER) {
2988 symbol = token.v.symbol;
2991 namespace_tag_t const namespc =
2992 is_struct ? NAMESPACE_STRUCT : NAMESPACE_UNION;
2993 entity_t *entity = get_entity(symbol, namespc);
2994 if (entity != NULL) {
2995 assert(entity->kind == (is_struct ? ENTITY_STRUCT : ENTITY_UNION));
2996 compound = &entity->compound;
2997 if (compound->base.parent_scope != current_scope &&
2998 (token.type == '{' || token.type == ';')) {
2999 /* we're in an inner scope and have a definition. Shadow
3000 * existing definition in outer scope */
3002 } else if (compound->complete && token.type == '{') {
3003 assert(symbol != NULL);
3004 errorf(HERE, "multiple definitions of '%s %Y' (previous definition %P)",
3005 is_struct ? "struct" : "union", symbol,
3006 &compound->base.source_position);
3007 /* clear members in the hope to avoid further errors */
3008 compound->members.entities = NULL;
3011 } else if (token.type != '{') {
3013 parse_error_expected("while parsing struct type specifier",
3014 T_IDENTIFIER, '{', NULL);
3016 parse_error_expected("while parsing union type specifier",
3017 T_IDENTIFIER, '{', NULL);
3023 if (compound == NULL) {
3024 entity_kind_t kind = is_struct ? ENTITY_STRUCT : ENTITY_UNION;
3025 entity_t *entity = allocate_entity_zero(kind);
3026 compound = &entity->compound;
3028 compound->base.namespc =
3029 (is_struct ? NAMESPACE_STRUCT : NAMESPACE_UNION);
3030 compound->base.source_position = token.source_position;
3031 compound->base.symbol = symbol;
3032 compound->base.parent_scope = current_scope;
3033 if (symbol != NULL) {
3034 environment_push(entity);
3036 append_entity(current_scope, entity);
3039 if (token.type == '{') {
3040 parse_compound_type_entries(compound);
3041 modifiers |= parse_attributes(&attributes);
3043 if (symbol == NULL) {
3044 assert(anonymous_entity == NULL);
3045 anonymous_entity = (entity_t*)compound;
3049 compound->modifiers |= modifiers;
3053 static void parse_enum_entries(type_t *const enum_type)
3057 if (token.type == '}') {
3058 errorf(HERE, "empty enum not allowed");
3063 add_anchor_token('}');
3065 if (token.type != T_IDENTIFIER) {
3066 parse_error_expected("while parsing enum entry", T_IDENTIFIER, NULL);
3068 rem_anchor_token('}');
3072 entity_t *entity = allocate_entity_zero(ENTITY_ENUM_VALUE);
3073 entity->enum_value.enum_type = enum_type;
3074 entity->base.symbol = token.v.symbol;
3075 entity->base.source_position = token.source_position;
3078 if (token.type == '=') {
3080 expression_t *value = parse_constant_expression();
3082 value = create_implicit_cast(value, enum_type);
3083 entity->enum_value.value = value;
3088 record_entity(entity, false);
3090 if (token.type != ',')
3093 } while (token.type != '}');
3094 rem_anchor_token('}');
3096 expect('}', end_error);
3102 static type_t *parse_enum_specifier(void)
3104 gnu_attribute_t *attributes = NULL;
3109 if (token.type == T_IDENTIFIER) {
3110 symbol = token.v.symbol;
3113 entity = get_entity(symbol, NAMESPACE_ENUM);
3114 if (entity != NULL) {
3115 assert(entity->kind == ENTITY_ENUM);
3116 if (entity->base.parent_scope != current_scope &&
3117 (token.type == '{' || token.type == ';')) {
3118 /* we're in an inner scope and have a definition. Shadow
3119 * existing definition in outer scope */
3121 } else if (entity->enume.complete && token.type == '{') {
3122 errorf(HERE, "multiple definitions of 'enum %Y' (previous definition %P)",
3123 symbol, &entity->base.source_position);
3126 } else if (token.type != '{') {
3127 parse_error_expected("while parsing enum type specifier",
3128 T_IDENTIFIER, '{', NULL);
3135 if (entity == NULL) {
3136 entity = allocate_entity_zero(ENTITY_ENUM);
3137 entity->base.namespc = NAMESPACE_ENUM;
3138 entity->base.source_position = token.source_position;
3139 entity->base.symbol = symbol;
3140 entity->base.parent_scope = current_scope;
3143 type_t *const type = allocate_type_zero(TYPE_ENUM);
3144 type->enumt.enume = &entity->enume;
3145 type->enumt.akind = ATOMIC_TYPE_INT;
3147 if (token.type == '{') {
3148 if (symbol != NULL) {
3149 environment_push(entity);
3151 append_entity(current_scope, entity);
3152 entity->enume.complete = true;
3154 parse_enum_entries(type);
3155 parse_attributes(&attributes);
3157 if (symbol == NULL) {
3158 assert(anonymous_entity == NULL);
3159 anonymous_entity = entity;
3161 } else if (!entity->enume.complete && !(c_mode & _GNUC)) {
3162 errorf(HERE, "'enum %Y' used before definition (incomplete enums are a GNU extension)",
3170 * if a symbol is a typedef to another type, return true
3172 static bool is_typedef_symbol(symbol_t *symbol)
3174 const entity_t *const entity = get_entity(symbol, NAMESPACE_NORMAL);
3175 return entity != NULL && entity->kind == ENTITY_TYPEDEF;
3178 static type_t *parse_typeof(void)
3184 expect('(', end_error);
3185 add_anchor_token(')');
3187 expression_t *expression = NULL;
3189 bool old_type_prop = in_type_prop;
3190 bool old_gcc_extension = in_gcc_extension;
3191 in_type_prop = true;
3193 while (token.type == T___extension__) {
3194 /* This can be a prefix to a typename or an expression. */
3196 in_gcc_extension = true;
3198 switch (token.type) {
3200 if (is_typedef_symbol(token.v.symbol)) {
3201 type = parse_typename();
3203 expression = parse_expression();
3204 type = revert_automatic_type_conversion(expression);
3209 type = parse_typename();
3213 expression = parse_expression();
3214 type = expression->base.type;
3217 in_type_prop = old_type_prop;
3218 in_gcc_extension = old_gcc_extension;
3220 rem_anchor_token(')');
3221 expect(')', end_error);
3223 type_t *typeof_type = allocate_type_zero(TYPE_TYPEOF);
3224 typeof_type->typeoft.expression = expression;
3225 typeof_type->typeoft.typeof_type = type;
3232 typedef enum specifiers_t {
3233 SPECIFIER_SIGNED = 1 << 0,
3234 SPECIFIER_UNSIGNED = 1 << 1,
3235 SPECIFIER_LONG = 1 << 2,
3236 SPECIFIER_INT = 1 << 3,
3237 SPECIFIER_DOUBLE = 1 << 4,
3238 SPECIFIER_CHAR = 1 << 5,
3239 SPECIFIER_WCHAR_T = 1 << 6,
3240 SPECIFIER_SHORT = 1 << 7,
3241 SPECIFIER_LONG_LONG = 1 << 8,
3242 SPECIFIER_FLOAT = 1 << 9,
3243 SPECIFIER_BOOL = 1 << 10,
3244 SPECIFIER_VOID = 1 << 11,
3245 SPECIFIER_INT8 = 1 << 12,
3246 SPECIFIER_INT16 = 1 << 13,
3247 SPECIFIER_INT32 = 1 << 14,
3248 SPECIFIER_INT64 = 1 << 15,
3249 SPECIFIER_INT128 = 1 << 16,
3250 SPECIFIER_COMPLEX = 1 << 17,
3251 SPECIFIER_IMAGINARY = 1 << 18,
3254 static type_t *create_builtin_type(symbol_t *const symbol,
3255 type_t *const real_type)
3257 type_t *type = allocate_type_zero(TYPE_BUILTIN);
3258 type->builtin.symbol = symbol;
3259 type->builtin.real_type = real_type;
3260 return identify_new_type(type);
3263 static type_t *get_typedef_type(symbol_t *symbol)
3265 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
3266 if (entity == NULL || entity->kind != ENTITY_TYPEDEF)
3269 type_t *type = allocate_type_zero(TYPE_TYPEDEF);
3270 type->typedeft.typedefe = &entity->typedefe;
3276 * check for the allowed MS alignment values.
3278 static bool check_alignment_value(long long intvalue)
3280 if (intvalue < 1 || intvalue > 8192) {
3281 errorf(HERE, "illegal alignment value");
3284 unsigned v = (unsigned)intvalue;
3285 for (unsigned i = 1; i <= 8192; i += i) {
3289 errorf(HERE, "alignment must be power of two");
3293 #define DET_MOD(name, tag) do { \
3294 if (*modifiers & tag && warning.other) warningf(HERE, #name " used more than once"); \
3295 *modifiers |= tag; \
3298 static void parse_microsoft_extended_decl_modifier(declaration_specifiers_t *specifiers)
3300 decl_modifiers_t *modifiers = &specifiers->modifiers;
3303 if (token.type == T_restrict) {
3305 DET_MOD(restrict, DM_RESTRICT);
3307 } else if (token.type != T_IDENTIFIER)
3309 symbol_t *symbol = token.v.symbol;
3310 if (symbol == sym_align) {
3312 expect('(', end_error);
3313 if (token.type != T_INTEGER)
3315 if (check_alignment_value(token.v.intvalue)) {
3316 if (specifiers->alignment != 0 && warning.other)
3317 warningf(HERE, "align used more than once");
3318 specifiers->alignment = (unsigned char)token.v.intvalue;
3321 expect(')', end_error);
3322 } else if (symbol == sym_allocate) {
3324 expect('(', end_error);
3325 if (token.type != T_IDENTIFIER)
3327 (void)token.v.symbol;
3328 expect(')', end_error);
3329 } else if (symbol == sym_dllimport) {
3331 DET_MOD(dllimport, DM_DLLIMPORT);
3332 } else if (symbol == sym_dllexport) {
3334 DET_MOD(dllexport, DM_DLLEXPORT);
3335 } else if (symbol == sym_thread) {
3337 DET_MOD(thread, DM_THREAD);
3338 } else if (symbol == sym_naked) {
3340 DET_MOD(naked, DM_NAKED);
3341 } else if (symbol == sym_noinline) {
3343 DET_MOD(noinline, DM_NOINLINE);
3344 } else if (symbol == sym_returns_twice) {
3346 DET_MOD(returns_twice, DM_RETURNS_TWICE);
3347 } else if (symbol == sym_noreturn) {
3349 DET_MOD(noreturn, DM_NORETURN);
3350 } else if (symbol == sym_nothrow) {
3352 DET_MOD(nothrow, DM_NOTHROW);
3353 } else if (symbol == sym_novtable) {
3355 DET_MOD(novtable, DM_NOVTABLE);
3356 } else if (symbol == sym_property) {
3358 expect('(', end_error);
3360 bool is_get = false;
3361 if (token.type != T_IDENTIFIER)
3363 if (token.v.symbol == sym_get) {
3365 } else if (token.v.symbol == sym_put) {
3367 errorf(HERE, "Bad property name '%Y'", token.v.symbol);
3371 expect('=', end_error);
3372 if (token.type != T_IDENTIFIER)
3375 if (specifiers->get_property_sym != NULL) {
3376 errorf(HERE, "get property name already specified");
3378 specifiers->get_property_sym = token.v.symbol;
3381 if (specifiers->put_property_sym != NULL) {
3382 errorf(HERE, "put property name already specified");
3384 specifiers->put_property_sym = token.v.symbol;
3388 if (token.type == ',') {
3394 expect(')', end_error);
3395 } else if (symbol == sym_selectany) {
3397 DET_MOD(selectany, DM_SELECTANY);
3398 } else if (symbol == sym_uuid) {
3400 expect('(', end_error);
3401 if (token.type != T_STRING_LITERAL)
3404 expect(')', end_error);
3405 } else if (symbol == sym_deprecated) {
3407 if (specifiers->deprecated != 0 && warning.other)
3408 warningf(HERE, "deprecated used more than once");
3409 specifiers->deprecated = true;
3410 if (token.type == '(') {
3412 if (token.type == T_STRING_LITERAL) {
3413 specifiers->deprecated_string = token.v.string.begin;
3416 errorf(HERE, "string literal expected");
3418 expect(')', end_error);
3420 } else if (symbol == sym_noalias) {
3422 DET_MOD(noalias, DM_NOALIAS);
3425 warningf(HERE, "Unknown modifier '%Y' ignored", token.v.symbol);
3427 if (token.type == '(')
3431 if (token.type == ',')
3438 static entity_t *create_error_entity(symbol_t *symbol, entity_kind_tag_t kind)
3440 entity_t *entity = allocate_entity_zero(kind);
3441 entity->base.source_position = *HERE;
3442 entity->base.symbol = symbol;
3443 if (is_declaration(entity)) {
3444 entity->declaration.type = type_error_type;
3445 entity->declaration.implicit = true;
3446 } else if (kind == ENTITY_TYPEDEF) {
3447 entity->typedefe.type = type_error_type;
3448 entity->typedefe.builtin = true;
3450 if (kind != ENTITY_COMPOUND_MEMBER)
3451 record_entity(entity, false);
3455 static void parse_microsoft_based(based_spec_t *based_spec)
3457 if (token.type != T_IDENTIFIER) {
3458 parse_error_expected("while parsing __based", T_IDENTIFIER, NULL);
3461 symbol_t *symbol = token.v.symbol;
3462 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
3464 if (entity == NULL || entity->base.kind != ENTITY_VARIABLE) {
3465 errorf(HERE, "'%Y' is not a variable name.", symbol);
3466 entity = create_error_entity(symbol, ENTITY_VARIABLE);
3468 variable_t *variable = &entity->variable;
3470 if (based_spec->base_variable != NULL) {
3471 errorf(HERE, "__based type qualifier specified more than once");
3473 based_spec->source_position = token.source_position;
3474 based_spec->base_variable = variable;
3476 type_t *const type = variable->base.type;
3478 if (is_type_valid(type)) {
3479 if (! is_type_pointer(skip_typeref(type))) {
3480 errorf(HERE, "variable in __based modifier must have pointer type instead of '%T'", type);
3482 if (variable->base.base.parent_scope != file_scope) {
3483 errorf(HERE, "a nonstatic local variable may not be used in a __based specification");
3491 * Finish the construction of a struct type by calculating
3492 * its size, offsets, alignment.
3494 static void finish_struct_type(compound_type_t *type)
3496 assert(type->compound != NULL);
3498 compound_t *compound = type->compound;
3499 if (!compound->complete)
3504 il_alignment_t alignment = 1;
3505 bool need_pad = false;
3507 entity_t *entry = compound->members.entities;
3508 for (; entry != NULL; entry = entry->base.next) {
3509 if (entry->kind != ENTITY_COMPOUND_MEMBER)
3512 type_t *m_type = skip_typeref(entry->declaration.type);
3513 if (! is_type_valid(m_type)) {
3514 /* simply ignore errors here */
3517 il_alignment_t m_alignment = m_type->base.alignment;
3518 if (m_alignment > alignment)
3519 alignment = m_alignment;
3521 offset = (size + m_alignment - 1) & -m_alignment;
3525 entry->compound_member.offset = offset;
3526 size = offset + m_type->base.size;
3528 if (type->base.alignment != 0) {
3529 alignment = type->base.alignment;
3532 offset = (size + alignment - 1) & -alignment;
3537 if (warning.padded) {
3538 warningf(&compound->base.source_position, "'%T' needs padding", type);
3541 if (compound->modifiers & DM_PACKED && warning.packed) {
3542 warningf(&compound->base.source_position,
3543 "superfluous packed attribute on '%T'", type);
3547 type->base.size = offset;
3548 type->base.alignment = alignment;
3552 * Finish the construction of an union type by calculating
3553 * its size and alignment.
3555 static void finish_union_type(compound_type_t *type)
3557 assert(type->compound != NULL);
3559 compound_t *compound = type->compound;
3560 if (! compound->complete)
3564 il_alignment_t alignment = 1;
3566 entity_t *entry = compound->members.entities;
3567 for (; entry != NULL; entry = entry->base.next) {
3568 if (entry->kind != ENTITY_COMPOUND_MEMBER)
3571 type_t *m_type = skip_typeref(entry->declaration.type);
3572 if (! is_type_valid(m_type))
3575 entry->compound_member.offset = 0;
3576 if (m_type->base.size > size)
3577 size = m_type->base.size;
3578 if (m_type->base.alignment > alignment)
3579 alignment = m_type->base.alignment;
3581 if (type->base.alignment != 0) {
3582 alignment = type->base.alignment;
3584 size = (size + alignment - 1) & -alignment;
3585 type->base.size = size;
3586 type->base.alignment = alignment;
3589 static type_t *handle_attribute_mode(const gnu_attribute_t *attribute,
3592 type_t *type = skip_typeref(orig_type);
3594 /* at least: byte, word, pointer, list of machine modes
3595 * __XXX___ is interpreted as XXX */
3597 /* This isn't really correct, the backend should provide a list of machine
3598 * specific modes (according to gcc philosophy that is...) */
3599 const char *symbol_str = attribute->u.symbol->string;
3600 bool sign = is_type_signed(type);
3601 atomic_type_kind_t akind;
3602 if (strcmp_underscore("QI", symbol_str) == 0 ||
3603 strcmp_underscore("byte", symbol_str) == 0) {
3604 akind = sign ? ATOMIC_TYPE_CHAR : ATOMIC_TYPE_UCHAR;
3605 } else if (strcmp_underscore("HI", symbol_str) == 0) {
3606 akind = sign ? ATOMIC_TYPE_SHORT : ATOMIC_TYPE_USHORT;
3607 } else if (strcmp_underscore("SI", symbol_str) == 0
3608 || strcmp_underscore("word", symbol_str) == 0
3609 || strcmp_underscore("pointer", symbol_str) == 0) {
3610 akind = sign ? ATOMIC_TYPE_INT : ATOMIC_TYPE_UINT;
3611 } else if (strcmp_underscore("DI", symbol_str) == 0) {
3612 akind = sign ? ATOMIC_TYPE_LONGLONG : ATOMIC_TYPE_ULONGLONG;
3615 warningf(HERE, "ignoring unknown mode '%s'", symbol_str);
3619 if (type->kind == TYPE_ATOMIC) {
3620 type_t *copy = duplicate_type(type);
3621 copy->atomic.akind = akind;
3622 return identify_new_type(copy);
3623 } else if (type->kind == TYPE_ENUM) {
3624 type_t *copy = duplicate_type(type);
3625 copy->enumt.akind = akind;
3626 return identify_new_type(copy);
3627 } else if (is_type_pointer(type)) {
3628 warningf(HERE, "__attribute__((mode)) on pointers not implemented yet (ignored)");
3632 errorf(HERE, "__attribute__((mode)) only allowed on integer, enum or pointer type");
3636 static type_t *handle_type_attributes(const gnu_attribute_t *attributes,
3639 const gnu_attribute_t *attribute = attributes;
3640 for ( ; attribute != NULL; attribute = attribute->next) {
3641 if (attribute->invalid)
3644 if (attribute->kind == GNU_AK_MODE) {
3645 type = handle_attribute_mode(attribute, type);
3646 } else if (attribute->kind == GNU_AK_ALIGNED) {
3647 int alignment = 32; /* TODO: fill in maximum useful alignment for
3649 if (attribute->has_arguments)
3650 alignment = attribute->u.argument;
3652 type_t *copy = duplicate_type(type);
3653 copy->base.alignment = attribute->u.argument;
3654 type = identify_new_type(copy);
3661 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
3663 type_t *type = NULL;
3664 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3665 type_modifiers_t modifiers = TYPE_MODIFIER_NONE;
3666 unsigned type_specifiers = 0;
3667 bool newtype = false;
3668 bool saw_error = false;
3669 bool old_gcc_extension = in_gcc_extension;
3671 specifiers->source_position = token.source_position;
3674 specifiers->modifiers
3675 |= parse_attributes(&specifiers->gnu_attributes);
3677 switch (token.type) {
3679 #define MATCH_STORAGE_CLASS(token, class) \
3681 if (specifiers->storage_class != STORAGE_CLASS_NONE) { \
3682 errorf(HERE, "multiple storage classes in declaration specifiers"); \
3684 specifiers->storage_class = class; \
3685 if (specifiers->thread_local) \
3686 goto check_thread_storage_class; \
3690 MATCH_STORAGE_CLASS(T_typedef, STORAGE_CLASS_TYPEDEF)
3691 MATCH_STORAGE_CLASS(T_extern, STORAGE_CLASS_EXTERN)
3692 MATCH_STORAGE_CLASS(T_static, STORAGE_CLASS_STATIC)
3693 MATCH_STORAGE_CLASS(T_auto, STORAGE_CLASS_AUTO)
3694 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
3698 expect('(', end_error);
3699 add_anchor_token(')');
3700 parse_microsoft_extended_decl_modifier(specifiers);
3701 rem_anchor_token(')');
3702 expect(')', end_error);
3706 if (specifiers->thread_local) {
3707 errorf(HERE, "duplicate '__thread'");
3709 specifiers->thread_local = true;
3710 check_thread_storage_class:
3711 switch (specifiers->storage_class) {
3712 case STORAGE_CLASS_EXTERN:
3713 case STORAGE_CLASS_NONE:
3714 case STORAGE_CLASS_STATIC:
3718 case STORAGE_CLASS_AUTO: wrong = "auto"; goto wrong_thread_stoarge_class;
3719 case STORAGE_CLASS_REGISTER: wrong = "register"; goto wrong_thread_stoarge_class;
3720 case STORAGE_CLASS_TYPEDEF: wrong = "typedef"; goto wrong_thread_stoarge_class;
3721 wrong_thread_stoarge_class:
3722 errorf(HERE, "'__thread' used with '%s'", wrong);
3729 /* type qualifiers */
3730 #define MATCH_TYPE_QUALIFIER(token, qualifier) \
3732 qualifiers |= qualifier; \
3736 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
3737 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3738 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3739 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
3740 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
3741 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
3742 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
3743 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
3745 case T___extension__:
3747 in_gcc_extension = true;
3750 /* type specifiers */
3751 #define MATCH_SPECIFIER(token, specifier, name) \
3753 if (type_specifiers & specifier) { \
3754 errorf(HERE, "multiple " name " type specifiers given"); \
3756 type_specifiers |= specifier; \
3761 MATCH_SPECIFIER(T__Bool, SPECIFIER_BOOL, "_Bool");
3762 MATCH_SPECIFIER(T__Complex, SPECIFIER_COMPLEX, "_Complex");
3763 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
3764 MATCH_SPECIFIER(T__int128, SPECIFIER_INT128, "_int128");
3765 MATCH_SPECIFIER(T__int16, SPECIFIER_INT16, "_int16");
3766 MATCH_SPECIFIER(T__int32, SPECIFIER_INT32, "_int32");
3767 MATCH_SPECIFIER(T__int64, SPECIFIER_INT64, "_int64");
3768 MATCH_SPECIFIER(T__int8, SPECIFIER_INT8, "_int8");
3769 MATCH_SPECIFIER(T_bool, SPECIFIER_BOOL, "bool");
3770 MATCH_SPECIFIER(T_char, SPECIFIER_CHAR, "char");
3771 MATCH_SPECIFIER(T_double, SPECIFIER_DOUBLE, "double");
3772 MATCH_SPECIFIER(T_float, SPECIFIER_FLOAT, "float");
3773 MATCH_SPECIFIER(T_int, SPECIFIER_INT, "int");
3774 MATCH_SPECIFIER(T_short, SPECIFIER_SHORT, "short");
3775 MATCH_SPECIFIER(T_signed, SPECIFIER_SIGNED, "signed");
3776 MATCH_SPECIFIER(T_unsigned, SPECIFIER_UNSIGNED, "unsigned");
3777 MATCH_SPECIFIER(T_void, SPECIFIER_VOID, "void");
3778 MATCH_SPECIFIER(T_wchar_t, SPECIFIER_WCHAR_T, "wchar_t");
3780 case T__forceinline:
3781 /* only in microsoft mode */
3782 specifiers->modifiers |= DM_FORCEINLINE;
3787 specifiers->is_inline = true;
3791 if (type_specifiers & SPECIFIER_LONG_LONG) {
3792 errorf(HERE, "multiple type specifiers given");
3793 } else if (type_specifiers & SPECIFIER_LONG) {
3794 type_specifiers |= SPECIFIER_LONG_LONG;
3796 type_specifiers |= SPECIFIER_LONG;
3802 type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
3804 type->compound.compound = parse_compound_type_specifier(true);
3805 finish_struct_type(&type->compound);
3809 type = allocate_type_zero(TYPE_COMPOUND_UNION);
3810 type->compound.compound = parse_compound_type_specifier(false);
3811 if (type->compound.compound->modifiers & DM_TRANSPARENT_UNION)
3812 modifiers |= TYPE_MODIFIER_TRANSPARENT_UNION;
3813 finish_union_type(&type->compound);
3817 type = parse_enum_specifier();
3820 type = parse_typeof();
3822 case T___builtin_va_list:
3823 type = duplicate_type(type_valist);
3827 case T_IDENTIFIER: {
3828 /* only parse identifier if we haven't found a type yet */
3829 if (type != NULL || type_specifiers != 0) {
3830 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
3831 * declaration, so it doesn't generate errors about expecting '(' or
3833 switch (look_ahead(1)->type) {
3840 case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
3844 errorf(HERE, "discarding stray %K in declaration specifier", &token);
3849 goto finish_specifiers;
3853 type_t *const typedef_type = get_typedef_type(token.v.symbol);
3854 if (typedef_type == NULL) {
3855 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
3856 * declaration, so it doesn't generate 'implicit int' followed by more
3857 * errors later on. */
3858 token_type_t const la1_type = (token_type_t)look_ahead(1)->type;
3864 errorf(HERE, "%K does not name a type", &token);
3867 create_error_entity(token.v.symbol, ENTITY_TYPEDEF);
3869 type = allocate_type_zero(TYPE_TYPEDEF);
3870 type->typedeft.typedefe = &entity->typedefe;
3874 if (la1_type == '&' || la1_type == '*')
3875 goto finish_specifiers;
3880 goto finish_specifiers;
3885 type = typedef_type;
3889 /* function specifier */
3891 goto finish_specifiers;
3896 specifiers->modifiers
3897 |= parse_attributes(&specifiers->gnu_attributes);
3899 in_gcc_extension = old_gcc_extension;
3901 if (type == NULL || (saw_error && type_specifiers != 0)) {
3902 atomic_type_kind_t atomic_type;
3904 /* match valid basic types */
3905 switch (type_specifiers) {
3906 case SPECIFIER_VOID:
3907 atomic_type = ATOMIC_TYPE_VOID;
3909 case SPECIFIER_WCHAR_T:
3910 atomic_type = ATOMIC_TYPE_WCHAR_T;
3912 case SPECIFIER_CHAR:
3913 atomic_type = ATOMIC_TYPE_CHAR;
3915 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
3916 atomic_type = ATOMIC_TYPE_SCHAR;
3918 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
3919 atomic_type = ATOMIC_TYPE_UCHAR;
3921 case SPECIFIER_SHORT:
3922 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
3923 case SPECIFIER_SHORT | SPECIFIER_INT:
3924 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3925 atomic_type = ATOMIC_TYPE_SHORT;
3927 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
3928 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3929 atomic_type = ATOMIC_TYPE_USHORT;
3932 case SPECIFIER_SIGNED:
3933 case SPECIFIER_SIGNED | SPECIFIER_INT:
3934 atomic_type = ATOMIC_TYPE_INT;
3936 case SPECIFIER_UNSIGNED:
3937 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
3938 atomic_type = ATOMIC_TYPE_UINT;
3940 case SPECIFIER_LONG:
3941 case SPECIFIER_SIGNED | SPECIFIER_LONG:
3942 case SPECIFIER_LONG | SPECIFIER_INT:
3943 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3944 atomic_type = ATOMIC_TYPE_LONG;
3946 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
3947 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3948 atomic_type = ATOMIC_TYPE_ULONG;
3951 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3952 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3953 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
3954 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3956 atomic_type = ATOMIC_TYPE_LONGLONG;
3957 goto warn_about_long_long;
3959 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3960 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3962 atomic_type = ATOMIC_TYPE_ULONGLONG;
3963 warn_about_long_long:
3964 if (warning.long_long) {
3965 warningf(&specifiers->source_position,
3966 "ISO C90 does not support 'long long'");
3970 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
3971 atomic_type = unsigned_int8_type_kind;
3974 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
3975 atomic_type = unsigned_int16_type_kind;
3978 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
3979 atomic_type = unsigned_int32_type_kind;
3982 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
3983 atomic_type = unsigned_int64_type_kind;
3986 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
3987 atomic_type = unsigned_int128_type_kind;
3990 case SPECIFIER_INT8:
3991 case SPECIFIER_SIGNED | SPECIFIER_INT8:
3992 atomic_type = int8_type_kind;
3995 case SPECIFIER_INT16:
3996 case SPECIFIER_SIGNED | SPECIFIER_INT16:
3997 atomic_type = int16_type_kind;
4000 case SPECIFIER_INT32:
4001 case SPECIFIER_SIGNED | SPECIFIER_INT32:
4002 atomic_type = int32_type_kind;
4005 case SPECIFIER_INT64:
4006 case SPECIFIER_SIGNED | SPECIFIER_INT64:
4007 atomic_type = int64_type_kind;
4010 case SPECIFIER_INT128:
4011 case SPECIFIER_SIGNED | SPECIFIER_INT128:
4012 atomic_type = int128_type_kind;
4015 case SPECIFIER_FLOAT:
4016 atomic_type = ATOMIC_TYPE_FLOAT;
4018 case SPECIFIER_DOUBLE:
4019 atomic_type = ATOMIC_TYPE_DOUBLE;
4021 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
4022 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
4024 case SPECIFIER_BOOL:
4025 atomic_type = ATOMIC_TYPE_BOOL;
4027 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
4028 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
4029 atomic_type = ATOMIC_TYPE_FLOAT;
4031 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
4032 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
4033 atomic_type = ATOMIC_TYPE_DOUBLE;
4035 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
4036 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
4037 atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
4040 /* invalid specifier combination, give an error message */
4041 if (type_specifiers == 0) {
4045 /* ISO/IEC 14882:1998(E) §C.1.5:4 */
4046 if (!(c_mode & _CXX) && !strict_mode) {
4047 if (warning.implicit_int) {
4048 warningf(HERE, "no type specifiers in declaration, using 'int'");
4050 atomic_type = ATOMIC_TYPE_INT;
4053 errorf(HERE, "no type specifiers given in declaration");
4055 } else if ((type_specifiers & SPECIFIER_SIGNED) &&
4056 (type_specifiers & SPECIFIER_UNSIGNED)) {
4057 errorf(HERE, "signed and unsigned specifiers given");
4058 } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
4059 errorf(HERE, "only integer types can be signed or unsigned");
4061 errorf(HERE, "multiple datatypes in declaration");
4066 if (type_specifiers & SPECIFIER_COMPLEX) {
4067 type = allocate_type_zero(TYPE_COMPLEX);
4068 type->complex.akind = atomic_type;
4069 } else if (type_specifiers & SPECIFIER_IMAGINARY) {
4070 type = allocate_type_zero(TYPE_IMAGINARY);
4071 type->imaginary.akind = atomic_type;
4073 type = allocate_type_zero(TYPE_ATOMIC);
4074 type->atomic.akind = atomic_type;
4076 type->base.alignment = get_atomic_type_alignment(atomic_type);
4077 unsigned const size = get_atomic_type_size(atomic_type);
4079 type_specifiers & SPECIFIER_COMPLEX ? size * 2 : size;
4081 } else if (type_specifiers != 0) {
4082 errorf(HERE, "multiple datatypes in declaration");
4085 /* FIXME: check type qualifiers here */
4087 if (specifiers->modifiers & DM_TRANSPARENT_UNION)
4088 modifiers |= TYPE_MODIFIER_TRANSPARENT_UNION;
4089 type->base.qualifiers = qualifiers;
4090 type->base.modifiers = modifiers;
4093 type = identify_new_type(type);
4095 type = typehash_insert(type);
4098 type = handle_type_attributes(specifiers->gnu_attributes, type);
4099 specifiers->type = type;
4103 specifiers->type = type_error_type;
4107 static type_qualifiers_t parse_type_qualifiers(void)
4109 type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
4112 switch (token.type) {
4113 /* type qualifiers */
4114 MATCH_TYPE_QUALIFIER(T_const, TYPE_QUALIFIER_CONST);
4115 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
4116 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
4117 /* microsoft extended type modifiers */
4118 MATCH_TYPE_QUALIFIER(T__w64, TYPE_QUALIFIER_W64);
4119 MATCH_TYPE_QUALIFIER(T___ptr32, TYPE_QUALIFIER_PTR32);
4120 MATCH_TYPE_QUALIFIER(T___ptr64, TYPE_QUALIFIER_PTR64);
4121 MATCH_TYPE_QUALIFIER(T___uptr, TYPE_QUALIFIER_UPTR);
4122 MATCH_TYPE_QUALIFIER(T___sptr, TYPE_QUALIFIER_SPTR);
4131 * Parses an K&R identifier list
4133 static void parse_identifier_list(scope_t *scope)
4136 entity_t *entity = allocate_entity_zero(ENTITY_PARAMETER);
4137 entity->base.source_position = token.source_position;
4138 entity->base.namespc = NAMESPACE_NORMAL;
4139 entity->base.symbol = token.v.symbol;
4140 /* a K&R parameter has no type, yet */
4144 append_entity(scope, entity);
4146 if (token.type != ',') {
4150 } while (token.type == T_IDENTIFIER);
4153 static entity_t *parse_parameter(void)
4155 declaration_specifiers_t specifiers;
4156 memset(&specifiers, 0, sizeof(specifiers));
4158 parse_declaration_specifiers(&specifiers);
4160 entity_t *entity = parse_declarator(&specifiers,
4161 DECL_MAY_BE_ABSTRACT | DECL_IS_PARAMETER);
4162 anonymous_entity = NULL;
4166 static void semantic_parameter_incomplete(const entity_t *entity)
4168 assert(entity->kind == ENTITY_PARAMETER);
4170 /* §6.7.5.3:4 After adjustment, the parameters in a parameter type
4171 * list in a function declarator that is part of a
4172 * definition of that function shall not have
4173 * incomplete type. */
4174 type_t *type = skip_typeref(entity->declaration.type);
4175 if (is_type_incomplete(type)) {
4176 errorf(&entity->base.source_position,
4177 "parameter '%Y' has incomplete type '%T'", entity->base.symbol,
4178 entity->declaration.type);
4183 * Parses function type parameters (and optionally creates variable_t entities
4184 * for them in a scope)
4186 static void parse_parameters(function_type_t *type, scope_t *scope)
4189 add_anchor_token(')');
4190 int saved_comma_state = save_and_reset_anchor_state(',');
4192 if (token.type == T_IDENTIFIER &&
4193 !is_typedef_symbol(token.v.symbol)) {
4194 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
4195 if (la1_type == ',' || la1_type == ')') {
4196 type->kr_style_parameters = true;
4197 type->unspecified_parameters = true;
4198 parse_identifier_list(scope);
4199 goto parameters_finished;
4203 if (token.type == ')') {
4204 /* ISO/IEC 14882:1998(E) §C.1.6:1 */
4205 if (!(c_mode & _CXX))
4206 type->unspecified_parameters = true;
4207 goto parameters_finished;
4210 function_parameter_t *parameter;
4211 function_parameter_t *last_parameter = NULL;
4214 switch (token.type) {
4217 type->variadic = true;
4218 goto parameters_finished;
4221 case T___extension__:
4224 entity_t *entity = parse_parameter();
4225 if (entity->kind == ENTITY_TYPEDEF) {
4226 errorf(&entity->base.source_position,
4227 "typedef not allowed as function parameter");
4230 assert(is_declaration(entity));
4232 /* func(void) is not a parameter */
4233 if (last_parameter == NULL
4234 && token.type == ')'
4235 && entity->base.symbol == NULL
4236 && skip_typeref(entity->declaration.type) == type_void) {
4237 goto parameters_finished;
4239 semantic_parameter_incomplete(entity);
4241 parameter = obstack_alloc(type_obst, sizeof(parameter[0]));
4242 memset(parameter, 0, sizeof(parameter[0]));
4243 parameter->type = entity->declaration.type;
4245 if (scope != NULL) {
4246 append_entity(scope, entity);
4249 if (last_parameter != NULL) {
4250 last_parameter->next = parameter;
4252 type->parameters = parameter;
4254 last_parameter = parameter;
4259 goto parameters_finished;
4261 if (token.type != ',') {
4262 goto parameters_finished;
4268 parameters_finished:
4269 rem_anchor_token(')');
4270 expect(')', end_error);
4273 restore_anchor_state(',', saved_comma_state);
4276 typedef enum construct_type_kind_t {
4279 CONSTRUCT_REFERENCE,
4282 } construct_type_kind_t;
4284 typedef struct construct_type_t construct_type_t;
4285 struct construct_type_t {
4286 construct_type_kind_t kind;
4287 construct_type_t *next;
4290 typedef struct parsed_pointer_t parsed_pointer_t;
4291 struct parsed_pointer_t {
4292 construct_type_t construct_type;
4293 type_qualifiers_t type_qualifiers;
4294 variable_t *base_variable; /**< MS __based extension. */
4297 typedef struct parsed_reference_t parsed_reference_t;
4298 struct parsed_reference_t {
4299 construct_type_t construct_type;
4302 typedef struct construct_function_type_t construct_function_type_t;
4303 struct construct_function_type_t {
4304 construct_type_t construct_type;
4305 type_t *function_type;
4308 typedef struct parsed_array_t parsed_array_t;
4309 struct parsed_array_t {
4310 construct_type_t construct_type;
4311 type_qualifiers_t type_qualifiers;
4317 typedef struct construct_base_type_t construct_base_type_t;
4318 struct construct_base_type_t {
4319 construct_type_t construct_type;
4323 static construct_type_t *parse_pointer_declarator(variable_t *base_variable)
4327 parsed_pointer_t *pointer = obstack_alloc(&temp_obst, sizeof(pointer[0]));
4328 memset(pointer, 0, sizeof(pointer[0]));
4329 pointer->construct_type.kind = CONSTRUCT_POINTER;
4330 pointer->type_qualifiers = parse_type_qualifiers();
4331 pointer->base_variable = base_variable;
4333 return &pointer->construct_type;
4336 static construct_type_t *parse_reference_declarator(void)
4340 parsed_reference_t *reference = obstack_alloc(&temp_obst, sizeof(reference[0]));
4341 memset(reference, 0, sizeof(reference[0]));
4342 reference->construct_type.kind = CONSTRUCT_REFERENCE;
4344 return (construct_type_t*)reference;
4347 static construct_type_t *parse_array_declarator(void)
4350 add_anchor_token(']');
4352 parsed_array_t *array = obstack_alloc(&temp_obst, sizeof(array[0]));
4353 memset(array, 0, sizeof(array[0]));
4354 array->construct_type.kind = CONSTRUCT_ARRAY;
4356 if (token.type == T_static) {
4357 array->is_static = true;
4361 type_qualifiers_t type_qualifiers = parse_type_qualifiers();
4362 if (type_qualifiers != 0) {
4363 if (token.type == T_static) {
4364 array->is_static = true;
4368 array->type_qualifiers = type_qualifiers;
4370 if (token.type == '*' && look_ahead(1)->type == ']') {
4371 array->is_variable = true;
4373 } else if (token.type != ']') {
4374 expression_t *const size = parse_assignment_expression();
4376 mark_vars_read(size, NULL);
4379 rem_anchor_token(']');
4380 expect(']', end_error);
4383 return &array->construct_type;
4386 static construct_type_t *parse_function_declarator(scope_t *scope,
4387 decl_modifiers_t modifiers)
4389 type_t *type = allocate_type_zero(TYPE_FUNCTION);
4390 function_type_t *ftype = &type->function;
4392 ftype->linkage = current_linkage;
4394 switch (modifiers & (DM_CDECL | DM_STDCALL | DM_FASTCALL | DM_THISCALL)) {
4395 case DM_NONE: break;
4396 case DM_CDECL: ftype->calling_convention = CC_CDECL; break;
4397 case DM_STDCALL: ftype->calling_convention = CC_STDCALL; break;
4398 case DM_FASTCALL: ftype->calling_convention = CC_FASTCALL; break;
4399 case DM_THISCALL: ftype->calling_convention = CC_THISCALL; break;
4402 errorf(HERE, "multiple calling conventions in declaration");
4406 parse_parameters(ftype, scope);
4408 construct_function_type_t *construct_function_type =
4409 obstack_alloc(&temp_obst, sizeof(construct_function_type[0]));
4410 memset(construct_function_type, 0, sizeof(construct_function_type[0]));
4411 construct_function_type->construct_type.kind = CONSTRUCT_FUNCTION;
4412 construct_function_type->function_type = type;
4414 return &construct_function_type->construct_type;
4417 typedef struct parse_declarator_env_t {
4418 decl_modifiers_t modifiers;
4420 source_position_t source_position;
4422 } parse_declarator_env_t;
4424 static construct_type_t *parse_inner_declarator(parse_declarator_env_t *env,
4425 bool may_be_abstract)
4427 /* construct a single linked list of construct_type_t's which describe
4428 * how to construct the final declarator type */
4429 construct_type_t *first = NULL;
4430 construct_type_t *last = NULL;
4431 gnu_attribute_t *attributes = NULL;
4433 decl_modifiers_t modifiers = parse_attributes(&attributes);
4435 /* MS __based extension */
4436 based_spec_t base_spec;
4437 base_spec.base_variable = NULL;
4440 construct_type_t *type;
4441 switch (token.type) {
4443 if (!(c_mode & _CXX))
4444 errorf(HERE, "references are only available for C++");
4445 if (base_spec.base_variable != NULL && warning.other) {
4446 warningf(&base_spec.source_position,
4447 "__based does not precede a pointer operator, ignored");
4449 type = parse_reference_declarator();
4451 base_spec.base_variable = NULL;
4455 type = parse_pointer_declarator(base_spec.base_variable);
4457 base_spec.base_variable = NULL;
4462 expect('(', end_error);
4463 add_anchor_token(')');
4464 parse_microsoft_based(&base_spec);
4465 rem_anchor_token(')');
4466 expect(')', end_error);
4470 goto ptr_operator_end;
4481 /* TODO: find out if this is correct */
4482 modifiers |= parse_attributes(&attributes);
4485 if (base_spec.base_variable != NULL && warning.other) {
4486 warningf(&base_spec.source_position,
4487 "__based does not precede a pointer operator, ignored");
4491 modifiers |= env->modifiers;
4492 env->modifiers = modifiers;
4495 construct_type_t *inner_types = NULL;
4497 switch (token.type) {
4500 errorf(HERE, "no identifier expected in typename");
4502 env->symbol = token.v.symbol;
4503 env->source_position = token.source_position;
4508 /* §6.7.6:2 footnote 126: Empty parentheses in a type name are
4509 * interpreted as ``function with no parameter specification'', rather
4510 * than redundant parentheses around the omitted identifier. */
4511 if (look_ahead(1)->type != ')') {
4513 add_anchor_token(')');
4514 inner_types = parse_inner_declarator(env, may_be_abstract);
4515 if (inner_types != NULL) {
4516 /* All later declarators only modify the return type */
4519 rem_anchor_token(')');
4520 expect(')', end_error);
4524 if (may_be_abstract)
4526 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
4531 construct_type_t *p = last;
4534 construct_type_t *type;
4535 switch (token.type) {
4537 scope_t *scope = NULL;
4539 scope = &env->parameters;
4541 type = parse_function_declarator(scope, modifiers);
4545 type = parse_array_declarator();
4548 goto declarator_finished;
4551 /* insert in the middle of the list (behind p) */
4553 type->next = p->next;
4564 declarator_finished:
4565 /* append inner_types at the end of the list, we don't to set last anymore
4566 * as it's not needed anymore */
4568 assert(first == NULL);
4569 first = inner_types;
4571 last->next = inner_types;
4579 static void parse_declaration_attributes(entity_t *entity)
4581 gnu_attribute_t *attributes = NULL;
4582 decl_modifiers_t modifiers = parse_attributes(&attributes);
4588 if (entity->kind == ENTITY_TYPEDEF) {
4589 modifiers |= entity->typedefe.modifiers;
4590 type = entity->typedefe.type;
4592 assert(is_declaration(entity));
4593 modifiers |= entity->declaration.modifiers;
4594 type = entity->declaration.type;
4599 gnu_attribute_t *attribute = attributes;
4600 for ( ; attribute != NULL; attribute = attribute->next) {
4601 if (attribute->invalid)
4604 if (attribute->kind == GNU_AK_MODE) {
4605 type = handle_attribute_mode(attribute, type);
4606 } else if (attribute->kind == GNU_AK_ALIGNED) {
4607 int alignment = 32; /* TODO: fill in maximum usefull alignment for target machine */
4608 if (attribute->has_arguments)
4609 alignment = attribute->u.argument;
4611 if (entity->kind == ENTITY_TYPEDEF) {
4612 type_t *copy = duplicate_type(type);
4613 copy->base.alignment = attribute->u.argument;
4614 type = identify_new_type(copy);
4615 } else if(entity->kind == ENTITY_VARIABLE) {
4616 entity->variable.alignment = alignment;
4617 } else if(entity->kind == ENTITY_COMPOUND_MEMBER) {
4618 entity->compound_member.alignment = alignment;
4623 type_modifiers_t type_modifiers = type->base.modifiers;
4624 if (modifiers & DM_TRANSPARENT_UNION)
4625 type_modifiers |= TYPE_MODIFIER_TRANSPARENT_UNION;
4627 if (type->base.modifiers != type_modifiers) {
4628 type_t *copy = duplicate_type(type);
4629 copy->base.modifiers = type_modifiers;
4630 type = identify_new_type(copy);
4633 if (entity->kind == ENTITY_TYPEDEF) {
4634 entity->typedefe.type = type;
4635 entity->typedefe.modifiers = modifiers;
4637 entity->declaration.type = type;
4638 entity->declaration.modifiers = modifiers;
4642 static type_t *construct_declarator_type(construct_type_t *construct_list, type_t *type)
4644 construct_type_t *iter = construct_list;
4645 for (; iter != NULL; iter = iter->next) {
4646 switch (iter->kind) {
4647 case CONSTRUCT_INVALID:
4648 internal_errorf(HERE, "invalid type construction found");
4649 case CONSTRUCT_FUNCTION: {
4650 construct_function_type_t *construct_function_type
4651 = (construct_function_type_t*) iter;
4653 type_t *function_type = construct_function_type->function_type;
4655 function_type->function.return_type = type;
4657 type_t *skipped_return_type = skip_typeref(type);
4659 if (is_type_function(skipped_return_type)) {
4660 errorf(HERE, "function returning function is not allowed");
4661 } else if (is_type_array(skipped_return_type)) {
4662 errorf(HERE, "function returning array is not allowed");
4664 if (skipped_return_type->base.qualifiers != 0 && warning.other) {
4666 "type qualifiers in return type of function type are meaningless");
4670 type = function_type;
4674 case CONSTRUCT_POINTER: {
4675 if (is_type_reference(skip_typeref(type)))
4676 errorf(HERE, "cannot declare a pointer to reference");
4678 parsed_pointer_t *parsed_pointer = (parsed_pointer_t*) iter;
4679 type = make_based_pointer_type(type, parsed_pointer->type_qualifiers, parsed_pointer->base_variable);
4683 case CONSTRUCT_REFERENCE:
4684 if (is_type_reference(skip_typeref(type)))
4685 errorf(HERE, "cannot declare a reference to reference");
4687 type = make_reference_type(type);
4690 case CONSTRUCT_ARRAY: {
4691 if (is_type_reference(skip_typeref(type)))
4692 errorf(HERE, "cannot declare an array of references");
4694 parsed_array_t *parsed_array = (parsed_array_t*) iter;
4695 type_t *array_type = allocate_type_zero(TYPE_ARRAY);
4697 expression_t *size_expression = parsed_array->size;
4698 if (size_expression != NULL) {
4700 = create_implicit_cast(size_expression, type_size_t);
4703 array_type->base.qualifiers = parsed_array->type_qualifiers;
4704 array_type->array.element_type = type;
4705 array_type->array.is_static = parsed_array->is_static;
4706 array_type->array.is_variable = parsed_array->is_variable;
4707 array_type->array.size_expression = size_expression;
4709 if (size_expression != NULL) {
4710 if (is_constant_expression(size_expression)) {
4711 array_type->array.size_constant = true;
4712 array_type->array.size
4713 = fold_constant(size_expression);
4715 array_type->array.is_vla = true;
4719 type_t *skipped_type = skip_typeref(type);
4721 if (is_type_incomplete(skipped_type)) {
4722 errorf(HERE, "array of incomplete type '%T' is not allowed", type);
4723 } else if (is_type_function(skipped_type)) {
4724 errorf(HERE, "array of functions is not allowed");
4731 /* The function type was constructed earlier. Freeing it here will
4732 * destroy other types. */
4733 if (iter->kind == CONSTRUCT_FUNCTION) {
4734 type = typehash_insert(type);
4736 type = identify_new_type(type);
4743 static type_t *automatic_type_conversion(type_t *orig_type);
4745 static type_t *semantic_parameter(const source_position_t *pos,
4747 const declaration_specifiers_t *specifiers,
4750 /* §6.7.5.3:7 A declaration of a parameter as ``array of type''
4751 * shall be adjusted to ``qualified pointer to type'',
4753 * §6.7.5.3:8 A declaration of a parameter as ``function returning
4754 * type'' shall be adjusted to ``pointer to function
4755 * returning type'', as in 6.3.2.1. */
4756 type = automatic_type_conversion(type);
4758 if (specifiers->is_inline && is_type_valid(type)) {
4759 errorf(pos, "parameter '%Y' declared 'inline'", symbol);
4762 /* §6.9.1:6 The declarations in the declaration list shall contain
4763 * no storage-class specifier other than register and no
4764 * initializations. */
4765 if (specifiers->thread_local || (
4766 specifiers->storage_class != STORAGE_CLASS_NONE &&
4767 specifiers->storage_class != STORAGE_CLASS_REGISTER)
4769 errorf(pos, "invalid storage class for parameter '%Y'", symbol);
4772 /* delay test for incomplete type, because we might have (void)
4773 * which is legal but incomplete... */
4778 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
4779 declarator_flags_t flags)
4781 parse_declarator_env_t env;
4782 memset(&env, 0, sizeof(env));
4783 env.modifiers = specifiers->modifiers;
4785 construct_type_t *construct_type =
4786 parse_inner_declarator(&env, (flags & DECL_MAY_BE_ABSTRACT) != 0);
4788 construct_declarator_type(construct_type, specifiers->type);
4789 type_t *type = skip_typeref(orig_type);
4791 if (construct_type != NULL) {
4792 obstack_free(&temp_obst, construct_type);
4796 if (specifiers->storage_class == STORAGE_CLASS_TYPEDEF) {
4797 entity = allocate_entity_zero(ENTITY_TYPEDEF);
4798 entity->base.symbol = env.symbol;
4799 entity->base.source_position = env.source_position;
4800 entity->typedefe.type = orig_type;
4802 if (anonymous_entity != NULL) {
4803 if (is_type_compound(type)) {
4804 assert(anonymous_entity->compound.alias == NULL);
4805 assert(anonymous_entity->kind == ENTITY_STRUCT ||
4806 anonymous_entity->kind == ENTITY_UNION);
4807 anonymous_entity->compound.alias = entity;
4808 anonymous_entity = NULL;
4809 } else if (is_type_enum(type)) {
4810 assert(anonymous_entity->enume.alias == NULL);
4811 assert(anonymous_entity->kind == ENTITY_ENUM);
4812 anonymous_entity->enume.alias = entity;
4813 anonymous_entity = NULL;
4817 /* create a declaration type entity */
4818 if (flags & DECL_CREATE_COMPOUND_MEMBER) {
4819 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER);
4821 if (env.symbol != NULL) {
4822 if (specifiers->is_inline && is_type_valid(type)) {
4823 errorf(&env.source_position,
4824 "compound member '%Y' declared 'inline'", env.symbol);
4827 if (specifiers->thread_local ||
4828 specifiers->storage_class != STORAGE_CLASS_NONE) {
4829 errorf(&env.source_position,
4830 "compound member '%Y' must have no storage class",
4834 } else if (flags & DECL_IS_PARAMETER) {
4835 orig_type = semantic_parameter(&env.source_position, orig_type,
4836 specifiers, env.symbol);
4838 entity = allocate_entity_zero(ENTITY_PARAMETER);
4839 } else if (is_type_function(type)) {
4840 entity = allocate_entity_zero(ENTITY_FUNCTION);
4842 entity->function.is_inline = specifiers->is_inline;
4843 entity->function.parameters = env.parameters;
4845 if (env.symbol != NULL) {
4846 if (specifiers->thread_local || (
4847 specifiers->storage_class != STORAGE_CLASS_EXTERN &&
4848 specifiers->storage_class != STORAGE_CLASS_NONE &&
4849 specifiers->storage_class != STORAGE_CLASS_STATIC
4851 errorf(&env.source_position,
4852 "invalid storage class for function '%Y'", env.symbol);
4856 entity = allocate_entity_zero(ENTITY_VARIABLE);
4858 entity->variable.get_property_sym = specifiers->get_property_sym;
4859 entity->variable.put_property_sym = specifiers->put_property_sym;
4861 entity->variable.thread_local = specifiers->thread_local;
4863 if (env.symbol != NULL) {
4864 if (specifiers->is_inline && is_type_valid(type)) {
4865 errorf(&env.source_position,
4866 "variable '%Y' declared 'inline'", env.symbol);
4869 bool invalid_storage_class = false;
4870 if (current_scope == file_scope) {
4871 if (specifiers->storage_class != STORAGE_CLASS_EXTERN &&
4872 specifiers->storage_class != STORAGE_CLASS_NONE &&
4873 specifiers->storage_class != STORAGE_CLASS_STATIC) {
4874 invalid_storage_class = true;
4877 if (specifiers->thread_local &&
4878 specifiers->storage_class == STORAGE_CLASS_NONE) {
4879 invalid_storage_class = true;
4882 if (invalid_storage_class) {
4883 errorf(&env.source_position,
4884 "invalid storage class for variable '%Y'", env.symbol);
4889 if (env.symbol != NULL) {
4890 entity->base.symbol = env.symbol;
4891 entity->base.source_position = env.source_position;
4893 entity->base.source_position = specifiers->source_position;
4895 entity->base.namespc = NAMESPACE_NORMAL;
4896 entity->declaration.type = orig_type;
4897 entity->declaration.modifiers = env.modifiers;
4898 entity->declaration.deprecated_string = specifiers->deprecated_string;
4900 storage_class_t storage_class = specifiers->storage_class;
4901 entity->declaration.declared_storage_class = storage_class;
4903 if (storage_class == STORAGE_CLASS_NONE && current_scope != file_scope)
4904 storage_class = STORAGE_CLASS_AUTO;
4905 entity->declaration.storage_class = storage_class;
4908 parse_declaration_attributes(entity);
4913 static type_t *parse_abstract_declarator(type_t *base_type)
4915 construct_type_t *construct_type = parse_inner_declarator(NULL, 1);
4917 type_t *result = construct_declarator_type(construct_type, base_type);
4918 if (construct_type != NULL) {
4919 obstack_free(&temp_obst, construct_type);
4926 * Check if the declaration of main is suspicious. main should be a
4927 * function with external linkage, returning int, taking either zero
4928 * arguments, two, or three arguments of appropriate types, ie.
4930 * int main([ int argc, char **argv [, char **env ] ]).
4932 * @param decl the declaration to check
4933 * @param type the function type of the declaration
4935 static void check_type_of_main(const entity_t *entity)
4937 const source_position_t *pos = &entity->base.source_position;
4938 if (entity->kind != ENTITY_FUNCTION) {
4939 warningf(pos, "'main' is not a function");
4943 if (entity->declaration.storage_class == STORAGE_CLASS_STATIC) {
4944 warningf(pos, "'main' is normally a non-static function");
4947 type_t *type = skip_typeref(entity->declaration.type);
4948 assert(is_type_function(type));
4950 function_type_t *func_type = &type->function;
4951 if (!types_compatible(skip_typeref(func_type->return_type), type_int)) {
4952 warningf(pos, "return type of 'main' should be 'int', but is '%T'",
4953 func_type->return_type);
4955 const function_parameter_t *parm = func_type->parameters;
4957 type_t *const first_type = parm->type;
4958 if (!types_compatible(skip_typeref(first_type), type_int)) {
4960 "first argument of 'main' should be 'int', but is '%T'",
4965 type_t *const second_type = parm->type;
4966 if (!types_compatible(skip_typeref(second_type), type_char_ptr_ptr)) {
4967 warningf(pos, "second argument of 'main' should be 'char**', but is '%T'", second_type);
4971 type_t *const third_type = parm->type;
4972 if (!types_compatible(skip_typeref(third_type), type_char_ptr_ptr)) {
4973 warningf(pos, "third argument of 'main' should be 'char**', but is '%T'", third_type);
4977 goto warn_arg_count;
4981 warningf(pos, "'main' takes only zero, two or three arguments");
4987 * Check if a symbol is the equal to "main".
4989 static bool is_sym_main(const symbol_t *const sym)
4991 return strcmp(sym->string, "main") == 0;
4994 static void error_redefined_as_different_kind(const source_position_t *pos,
4995 const entity_t *old, entity_kind_t new_kind)
4997 errorf(pos, "redeclaration of %s '%Y' as %s (declared %P)",
4998 get_entity_kind_name(old->kind), old->base.symbol,
4999 get_entity_kind_name(new_kind), &old->base.source_position);
5002 static bool is_error_entity(entity_t *const ent)
5004 if (is_declaration(ent)) {
5005 return is_type_valid(skip_typeref(ent->declaration.type));
5006 } else if (ent->kind == ENTITY_TYPEDEF) {
5007 return is_type_valid(skip_typeref(ent->typedefe.type));
5013 * record entities for the NAMESPACE_NORMAL, and produce error messages/warnings
5014 * for various problems that occur for multiple definitions
5016 static entity_t *record_entity(entity_t *entity, const bool is_definition)
5018 const symbol_t *const symbol = entity->base.symbol;
5019 const namespace_tag_t namespc = (namespace_tag_t)entity->base.namespc;
5020 const source_position_t *pos = &entity->base.source_position;
5022 /* can happen in error cases */
5026 entity_t *const previous_entity = get_entity(symbol, namespc);
5027 /* pushing the same entity twice will break the stack structure */
5028 assert(previous_entity != entity);
5030 if (entity->kind == ENTITY_FUNCTION) {
5031 type_t *const orig_type = entity->declaration.type;
5032 type_t *const type = skip_typeref(orig_type);
5034 assert(is_type_function(type));
5035 if (type->function.unspecified_parameters &&
5036 warning.strict_prototypes &&
5037 previous_entity == NULL) {
5038 warningf(pos, "function declaration '%#T' is not a prototype",
5042 if (warning.main && current_scope == file_scope
5043 && is_sym_main(symbol)) {
5044 check_type_of_main(entity);
5048 if (is_declaration(entity) &&
5049 warning.nested_externs &&
5050 entity->declaration.storage_class == STORAGE_CLASS_EXTERN &&
5051 current_scope != file_scope) {
5052 warningf(pos, "nested extern declaration of '%#T'",
5053 entity->declaration.type, symbol);
5056 if (previous_entity != NULL) {
5057 if (previous_entity->base.parent_scope == ¤t_function->parameters &&
5058 previous_entity->base.parent_scope->depth + 1 == current_scope->depth) {
5059 assert(previous_entity->kind == ENTITY_PARAMETER);
5061 "declaration '%#T' redeclares the parameter '%#T' (declared %P)",
5062 entity->declaration.type, symbol,
5063 previous_entity->declaration.type, symbol,
5064 &previous_entity->base.source_position);
5068 if (previous_entity->base.parent_scope == current_scope) {
5069 if (previous_entity->kind != entity->kind) {
5070 if (!is_error_entity(previous_entity) && !is_error_entity(entity)) {
5071 error_redefined_as_different_kind(pos, previous_entity,
5076 if (previous_entity->kind == ENTITY_ENUM_VALUE) {
5077 errorf(pos, "redeclaration of enum entry '%Y' (declared %P)",
5078 symbol, &previous_entity->base.source_position);
5081 if (previous_entity->kind == ENTITY_TYPEDEF) {
5082 /* TODO: C++ allows this for exactly the same type */
5083 errorf(pos, "redefinition of typedef '%Y' (declared %P)",
5084 symbol, &previous_entity->base.source_position);
5088 /* at this point we should have only VARIABLES or FUNCTIONS */
5089 assert(is_declaration(previous_entity) && is_declaration(entity));
5091 declaration_t *const prev_decl = &previous_entity->declaration;
5092 declaration_t *const decl = &entity->declaration;
5094 /* can happen for K&R style declarations */
5095 if (prev_decl->type == NULL &&
5096 previous_entity->kind == ENTITY_PARAMETER &&
5097 entity->kind == ENTITY_PARAMETER) {
5098 prev_decl->type = decl->type;
5099 prev_decl->storage_class = decl->storage_class;
5100 prev_decl->declared_storage_class = decl->declared_storage_class;
5101 prev_decl->modifiers = decl->modifiers;
5102 prev_decl->deprecated_string = decl->deprecated_string;
5103 return previous_entity;
5106 type_t *const orig_type = decl->type;
5107 assert(orig_type != NULL);
5108 type_t *const type = skip_typeref(orig_type);
5109 type_t *const prev_type = skip_typeref(prev_decl->type);
5111 if (!types_compatible(type, prev_type)) {
5113 "declaration '%#T' is incompatible with '%#T' (declared %P)",
5114 orig_type, symbol, prev_decl->type, symbol,
5115 &previous_entity->base.source_position);
5117 unsigned old_storage_class = prev_decl->storage_class;
5118 if (warning.redundant_decls &&
5121 !(prev_decl->modifiers & DM_USED) &&
5122 prev_decl->storage_class == STORAGE_CLASS_STATIC) {
5123 warningf(&previous_entity->base.source_position,
5124 "unnecessary static forward declaration for '%#T'",
5125 prev_decl->type, symbol);
5128 storage_class_t new_storage_class = decl->storage_class;
5130 /* pretend no storage class means extern for function
5131 * declarations (except if the previous declaration is neither
5132 * none nor extern) */
5133 if (entity->kind == ENTITY_FUNCTION) {
5134 /* the previous declaration could have unspecified parameters or
5135 * be a typedef, so use the new type */
5136 if (prev_type->function.unspecified_parameters || is_definition)
5137 prev_decl->type = type;
5139 switch (old_storage_class) {
5140 case STORAGE_CLASS_NONE:
5141 old_storage_class = STORAGE_CLASS_EXTERN;
5144 case STORAGE_CLASS_EXTERN:
5145 if (is_definition) {
5146 if (warning.missing_prototypes &&
5147 prev_type->function.unspecified_parameters &&
5148 !is_sym_main(symbol)) {
5149 warningf(pos, "no previous prototype for '%#T'",
5152 } else if (new_storage_class == STORAGE_CLASS_NONE) {
5153 new_storage_class = STORAGE_CLASS_EXTERN;
5160 } else if (is_type_incomplete(prev_type)) {
5161 prev_decl->type = type;
5164 if (old_storage_class == STORAGE_CLASS_EXTERN &&
5165 new_storage_class == STORAGE_CLASS_EXTERN) {
5166 warn_redundant_declaration:
5167 if (!is_definition &&
5168 warning.redundant_decls &&
5169 is_type_valid(prev_type) &&
5170 strcmp(previous_entity->base.source_position.input_name,
5171 "<builtin>") != 0) {
5173 "redundant declaration for '%Y' (declared %P)",
5174 symbol, &previous_entity->base.source_position);
5176 } else if (current_function == NULL) {
5177 if (old_storage_class != STORAGE_CLASS_STATIC &&
5178 new_storage_class == STORAGE_CLASS_STATIC) {
5180 "static declaration of '%Y' follows non-static declaration (declared %P)",
5181 symbol, &previous_entity->base.source_position);
5182 } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
5183 prev_decl->storage_class = STORAGE_CLASS_NONE;
5184 prev_decl->declared_storage_class = STORAGE_CLASS_NONE;
5186 /* ISO/IEC 14882:1998(E) §C.1.2:1 */
5188 goto error_redeclaration;
5189 goto warn_redundant_declaration;
5191 } else if (is_type_valid(prev_type)) {
5192 if (old_storage_class == new_storage_class) {
5193 error_redeclaration:
5194 errorf(pos, "redeclaration of '%Y' (declared %P)",
5195 symbol, &previous_entity->base.source_position);
5198 "redeclaration of '%Y' with different linkage (declared %P)",
5199 symbol, &previous_entity->base.source_position);
5204 prev_decl->modifiers |= decl->modifiers;
5205 if (entity->kind == ENTITY_FUNCTION) {
5206 previous_entity->function.is_inline |= entity->function.is_inline;
5208 return previous_entity;
5211 if (warning.shadow) {
5212 warningf(pos, "%s '%Y' shadows %s (declared %P)",
5213 get_entity_kind_name(entity->kind), symbol,
5214 get_entity_kind_name(previous_entity->kind),
5215 &previous_entity->base.source_position);
5219 if (entity->kind == ENTITY_FUNCTION) {
5220 if (is_definition &&
5221 entity->declaration.storage_class != STORAGE_CLASS_STATIC) {
5222 if (warning.missing_prototypes && !is_sym_main(symbol)) {
5223 warningf(pos, "no previous prototype for '%#T'",
5224 entity->declaration.type, symbol);
5225 } else if (warning.missing_declarations && !is_sym_main(symbol)) {
5226 warningf(pos, "no previous declaration for '%#T'",
5227 entity->declaration.type, symbol);
5230 } else if (warning.missing_declarations &&
5231 entity->kind == ENTITY_VARIABLE &&
5232 current_scope == file_scope) {
5233 declaration_t *declaration = &entity->declaration;
5234 if (declaration->storage_class == STORAGE_CLASS_NONE) {
5235 warningf(pos, "no previous declaration for '%#T'",
5236 declaration->type, symbol);
5241 assert(entity->base.parent_scope == NULL);
5242 assert(current_scope != NULL);
5244 entity->base.parent_scope = current_scope;
5245 entity->base.namespc = NAMESPACE_NORMAL;
5246 environment_push(entity);
5247 append_entity(current_scope, entity);
5252 static void parser_error_multiple_definition(entity_t *entity,
5253 const source_position_t *source_position)
5255 errorf(source_position, "multiple definition of '%Y' (declared %P)",
5256 entity->base.symbol, &entity->base.source_position);
5259 static bool is_declaration_specifier(const token_t *token,
5260 bool only_specifiers_qualifiers)
5262 switch (token->type) {
5267 return is_typedef_symbol(token->v.symbol);
5269 case T___extension__:
5271 return !only_specifiers_qualifiers;
5278 static void parse_init_declarator_rest(entity_t *entity)
5280 assert(is_declaration(entity));
5281 declaration_t *const declaration = &entity->declaration;
5285 type_t *orig_type = declaration->type;
5286 type_t *type = skip_typeref(orig_type);
5288 if (entity->kind == ENTITY_VARIABLE
5289 && entity->variable.initializer != NULL) {
5290 parser_error_multiple_definition(entity, HERE);
5293 bool must_be_constant = false;
5294 if (declaration->storage_class == STORAGE_CLASS_STATIC ||
5295 entity->base.parent_scope == file_scope) {
5296 must_be_constant = true;
5299 if (is_type_function(type)) {
5300 errorf(&entity->base.source_position,
5301 "function '%#T' is initialized like a variable",
5302 orig_type, entity->base.symbol);
5303 orig_type = type_error_type;
5306 parse_initializer_env_t env;
5307 env.type = orig_type;
5308 env.must_be_constant = must_be_constant;
5309 env.entity = entity;
5310 current_init_decl = entity;
5312 initializer_t *initializer = parse_initializer(&env);
5313 current_init_decl = NULL;
5315 if (entity->kind == ENTITY_VARIABLE) {
5316 /* §6.7.5:22 array initializers for arrays with unknown size
5317 * determine the array type size */
5318 declaration->type = env.type;
5319 entity->variable.initializer = initializer;
5323 /* parse rest of a declaration without any declarator */
5324 static void parse_anonymous_declaration_rest(
5325 const declaration_specifiers_t *specifiers)
5328 anonymous_entity = NULL;
5330 if (warning.other) {
5331 if (specifiers->storage_class != STORAGE_CLASS_NONE ||
5332 specifiers->thread_local) {
5333 warningf(&specifiers->source_position,
5334 "useless storage class in empty declaration");
5337 type_t *type = specifiers->type;
5338 switch (type->kind) {
5339 case TYPE_COMPOUND_STRUCT:
5340 case TYPE_COMPOUND_UNION: {
5341 if (type->compound.compound->base.symbol == NULL) {
5342 warningf(&specifiers->source_position,
5343 "unnamed struct/union that defines no instances");
5352 warningf(&specifiers->source_position, "empty declaration");
5358 static void check_variable_type_complete(entity_t *ent)
5360 if (ent->kind != ENTITY_VARIABLE)
5363 /* §6.7:7 If an identifier for an object is declared with no linkage, the
5364 * type for the object shall be complete [...] */
5365 declaration_t *decl = &ent->declaration;
5366 if (decl->storage_class != STORAGE_CLASS_NONE)
5369 type_t *const orig_type = decl->type;
5370 type_t *const type = skip_typeref(orig_type);
5371 if (!is_type_incomplete(type))
5374 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
5375 * are given length one. */
5376 if (is_type_array(type) && ent->base.parent_scope == file_scope) {
5377 ARR_APP1(declaration_t*, incomplete_arrays, decl);
5381 errorf(&ent->base.source_position, "variable '%#T' has incomplete type",
5382 orig_type, ent->base.symbol);
5386 static void parse_declaration_rest(entity_t *ndeclaration,
5387 const declaration_specifiers_t *specifiers,
5388 parsed_declaration_func finished_declaration,
5389 declarator_flags_t flags)
5391 add_anchor_token(';');
5392 add_anchor_token(',');
5394 entity_t *entity = finished_declaration(ndeclaration, token.type == '=');
5396 if (token.type == '=') {
5397 parse_init_declarator_rest(entity);
5398 } else if (entity->kind == ENTITY_VARIABLE) {
5399 /* ISO/IEC 14882:1998(E) §8.5.3:3 The initializer can be omitted
5400 * [...] where the extern specifier is explicitly used. */
5401 declaration_t *decl = &entity->declaration;
5402 if (decl->storage_class != STORAGE_CLASS_EXTERN) {
5403 type_t *type = decl->type;
5404 if (is_type_reference(skip_typeref(type))) {
5405 errorf(&entity->base.source_position,
5406 "reference '%#T' must be initialized",
5407 type, entity->base.symbol);
5412 check_variable_type_complete(entity);
5414 if (token.type != ',')
5418 add_anchor_token('=');
5419 ndeclaration = parse_declarator(specifiers, flags);
5420 rem_anchor_token('=');
5422 expect(';', end_error);
5425 anonymous_entity = NULL;
5426 rem_anchor_token(';');
5427 rem_anchor_token(',');
5430 static entity_t *finished_kr_declaration(entity_t *entity, bool is_definition)
5432 symbol_t *symbol = entity->base.symbol;
5433 if (symbol == NULL) {
5434 errorf(HERE, "anonymous declaration not valid as function parameter");
5438 assert(entity->base.namespc == NAMESPACE_NORMAL);
5439 entity_t *previous_entity = get_entity(symbol, NAMESPACE_NORMAL);
5440 if (previous_entity == NULL
5441 || previous_entity->base.parent_scope != current_scope) {
5442 errorf(HERE, "expected declaration of a function parameter, found '%Y'",
5447 if (is_definition) {
5448 errorf(HERE, "parameter '%Y' is initialised", entity->base.symbol);
5451 return record_entity(entity, false);
5454 static void parse_declaration(parsed_declaration_func finished_declaration,
5455 declarator_flags_t flags)
5457 declaration_specifiers_t specifiers;
5458 memset(&specifiers, 0, sizeof(specifiers));
5460 add_anchor_token(';');
5461 parse_declaration_specifiers(&specifiers);
5462 rem_anchor_token(';');
5464 if (token.type == ';') {
5465 parse_anonymous_declaration_rest(&specifiers);
5467 entity_t *entity = parse_declarator(&specifiers, flags);
5468 parse_declaration_rest(entity, &specifiers, finished_declaration, flags);
5472 static type_t *get_default_promoted_type(type_t *orig_type)
5474 type_t *result = orig_type;
5476 type_t *type = skip_typeref(orig_type);
5477 if (is_type_integer(type)) {
5478 result = promote_integer(type);
5479 } else if (is_type_atomic(type, ATOMIC_TYPE_FLOAT)) {
5480 result = type_double;
5486 static void parse_kr_declaration_list(entity_t *entity)
5488 if (entity->kind != ENTITY_FUNCTION)
5491 type_t *type = skip_typeref(entity->declaration.type);
5492 assert(is_type_function(type));
5493 if (!type->function.kr_style_parameters)
5497 add_anchor_token('{');
5499 /* push function parameters */
5500 size_t const top = environment_top();
5501 scope_t *old_scope = scope_push(&entity->function.parameters);
5503 entity_t *parameter = entity->function.parameters.entities;
5504 for ( ; parameter != NULL; parameter = parameter->base.next) {
5505 assert(parameter->base.parent_scope == NULL);
5506 parameter->base.parent_scope = current_scope;
5507 environment_push(parameter);
5510 /* parse declaration list */
5512 switch (token.type) {
5514 case T___extension__:
5515 /* This covers symbols, which are no type, too, and results in
5516 * better error messages. The typical cases are misspelled type
5517 * names and missing includes. */
5519 parse_declaration(finished_kr_declaration, DECL_IS_PARAMETER);
5527 /* pop function parameters */
5528 assert(current_scope == &entity->function.parameters);
5529 scope_pop(old_scope);
5530 environment_pop_to(top);
5532 /* update function type */
5533 type_t *new_type = duplicate_type(type);
5535 function_parameter_t *parameters = NULL;
5536 function_parameter_t *last_parameter = NULL;
5538 parameter = entity->function.parameters.entities;
5539 for (; parameter != NULL; parameter = parameter->base.next) {
5540 if (parameter->kind != ENTITY_PARAMETER)
5543 type_t *parameter_type = parameter->declaration.type;
5544 if (parameter_type == NULL) {
5546 errorf(HERE, "no type specified for function parameter '%Y'",
5547 parameter->base.symbol);
5549 if (warning.implicit_int) {
5550 warningf(HERE, "no type specified for function parameter '%Y', using 'int'",
5551 parameter->base.symbol);
5553 parameter_type = type_int;
5554 parameter->declaration.type = parameter_type;
5558 semantic_parameter_incomplete(parameter);
5559 parameter_type = parameter->declaration.type;
5562 * we need the default promoted types for the function type
5564 parameter_type = get_default_promoted_type(parameter_type);
5566 function_parameter_t *function_parameter
5567 = obstack_alloc(type_obst, sizeof(function_parameter[0]));
5568 memset(function_parameter, 0, sizeof(function_parameter[0]));
5570 function_parameter->type = parameter_type;
5571 if (last_parameter != NULL) {
5572 last_parameter->next = function_parameter;
5574 parameters = function_parameter;
5576 last_parameter = function_parameter;
5579 /* §6.9.1.7: A K&R style parameter list does NOT act as a function
5581 new_type->function.parameters = parameters;
5582 new_type->function.unspecified_parameters = true;
5584 new_type = identify_new_type(new_type);
5586 entity->declaration.type = new_type;
5588 rem_anchor_token('{');
5591 static bool first_err = true;
5594 * When called with first_err set, prints the name of the current function,
5597 static void print_in_function(void)
5601 diagnosticf("%s: In function '%Y':\n",
5602 current_function->base.base.source_position.input_name,
5603 current_function->base.base.symbol);
5608 * Check if all labels are defined in the current function.
5609 * Check if all labels are used in the current function.
5611 static void check_labels(void)
5613 for (const goto_statement_t *goto_statement = goto_first;
5614 goto_statement != NULL;
5615 goto_statement = goto_statement->next) {
5616 /* skip computed gotos */
5617 if (goto_statement->expression != NULL)
5620 label_t *label = goto_statement->label;
5623 if (label->base.source_position.input_name == NULL) {
5624 print_in_function();
5625 errorf(&goto_statement->base.source_position,
5626 "label '%Y' used but not defined", label->base.symbol);
5630 if (warning.unused_label) {
5631 for (const label_statement_t *label_statement = label_first;
5632 label_statement != NULL;
5633 label_statement = label_statement->next) {
5634 label_t *label = label_statement->label;
5636 if (! label->used) {
5637 print_in_function();
5638 warningf(&label_statement->base.source_position,
5639 "label '%Y' defined but not used", label->base.symbol);
5645 static void warn_unused_entity(entity_t *entity, entity_t *last)
5647 entity_t const *const end = last != NULL ? last->base.next : NULL;
5648 for (; entity != end; entity = entity->base.next) {
5649 if (!is_declaration(entity))
5652 declaration_t *declaration = &entity->declaration;
5653 if (declaration->implicit)
5656 if (!declaration->used) {
5657 print_in_function();
5658 const char *what = get_entity_kind_name(entity->kind);
5659 warningf(&entity->base.source_position, "%s '%Y' is unused",
5660 what, entity->base.symbol);
5661 } else if (entity->kind == ENTITY_VARIABLE && !entity->variable.read) {
5662 print_in_function();
5663 const char *what = get_entity_kind_name(entity->kind);
5664 warningf(&entity->base.source_position, "%s '%Y' is never read",
5665 what, entity->base.symbol);
5670 static void check_unused_variables(statement_t *const stmt, void *const env)
5674 switch (stmt->kind) {
5675 case STATEMENT_DECLARATION: {
5676 declaration_statement_t const *const decls = &stmt->declaration;
5677 warn_unused_entity(decls->declarations_begin,
5678 decls->declarations_end);
5683 warn_unused_entity(stmt->fors.scope.entities, NULL);
5692 * Check declarations of current_function for unused entities.
5694 static void check_declarations(void)
5696 if (warning.unused_parameter) {
5697 const scope_t *scope = ¤t_function->parameters;
5699 /* do not issue unused warnings for main */
5700 if (!is_sym_main(current_function->base.base.symbol)) {
5701 warn_unused_entity(scope->entities, NULL);
5704 if (warning.unused_variable) {
5705 walk_statements(current_function->statement, check_unused_variables,
5710 static int determine_truth(expression_t const* const cond)
5713 !is_constant_expression(cond) ? 0 :
5714 fold_constant(cond) != 0 ? 1 :
5718 static void check_reachable(statement_t *);
5719 static bool reaches_end;
5721 static bool expression_returns(expression_t const *const expr)
5723 switch (expr->kind) {
5725 expression_t const *const func = expr->call.function;
5726 if (func->kind == EXPR_REFERENCE) {
5727 entity_t *entity = func->reference.entity;
5728 if (entity->kind == ENTITY_FUNCTION
5729 && entity->declaration.modifiers & DM_NORETURN)
5733 if (!expression_returns(func))
5736 for (call_argument_t const* arg = expr->call.arguments; arg != NULL; arg = arg->next) {
5737 if (!expression_returns(arg->expression))
5744 case EXPR_REFERENCE:
5745 case EXPR_REFERENCE_ENUM_VALUE:
5747 case EXPR_CHARACTER_CONSTANT:
5748 case EXPR_WIDE_CHARACTER_CONSTANT:
5749 case EXPR_STRING_LITERAL:
5750 case EXPR_WIDE_STRING_LITERAL:
5751 case EXPR_COMPOUND_LITERAL: // TODO descend into initialisers
5752 case EXPR_LABEL_ADDRESS:
5753 case EXPR_CLASSIFY_TYPE:
5754 case EXPR_SIZEOF: // TODO handle obscure VLA case
5757 case EXPR_BUILTIN_SYMBOL:
5758 case EXPR_BUILTIN_CONSTANT_P:
5759 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
5764 case EXPR_STATEMENT: {
5765 bool old_reaches_end = reaches_end;
5766 reaches_end = false;
5767 check_reachable(expr->statement.statement);
5768 bool returns = reaches_end;
5769 reaches_end = old_reaches_end;
5773 case EXPR_CONDITIONAL:
5774 // TODO handle constant expression
5776 if (!expression_returns(expr->conditional.condition))
5779 if (expr->conditional.true_expression != NULL
5780 && expression_returns(expr->conditional.true_expression))
5783 return expression_returns(expr->conditional.false_expression);
5786 return expression_returns(expr->select.compound);
5788 case EXPR_ARRAY_ACCESS:
5790 expression_returns(expr->array_access.array_ref) &&
5791 expression_returns(expr->array_access.index);
5794 return expression_returns(expr->va_starte.ap);
5797 return expression_returns(expr->va_arge.ap);
5799 EXPR_UNARY_CASES_MANDATORY
5800 return expression_returns(expr->unary.value);
5802 case EXPR_UNARY_THROW:
5806 // TODO handle constant lhs of && and ||
5808 expression_returns(expr->binary.left) &&
5809 expression_returns(expr->binary.right);
5815 panic("unhandled expression");
5818 static bool initializer_returns(initializer_t const *const init)
5820 switch (init->kind) {
5821 case INITIALIZER_VALUE:
5822 return expression_returns(init->value.value);
5824 case INITIALIZER_LIST: {
5825 initializer_t * const* i = init->list.initializers;
5826 initializer_t * const* const end = i + init->list.len;
5827 bool returns = true;
5828 for (; i != end; ++i) {
5829 if (!initializer_returns(*i))
5835 case INITIALIZER_STRING:
5836 case INITIALIZER_WIDE_STRING:
5837 case INITIALIZER_DESIGNATOR: // designators have no payload
5840 panic("unhandled initializer");
5843 static bool noreturn_candidate;
5845 static void check_reachable(statement_t *const stmt)
5847 if (stmt->base.reachable)
5849 if (stmt->kind != STATEMENT_DO_WHILE)
5850 stmt->base.reachable = true;
5852 statement_t *last = stmt;
5854 switch (stmt->kind) {
5855 case STATEMENT_INVALID:
5856 case STATEMENT_EMPTY:
5858 next = stmt->base.next;
5861 case STATEMENT_DECLARATION: {
5862 declaration_statement_t const *const decl = &stmt->declaration;
5863 entity_t const * ent = decl->declarations_begin;
5864 entity_t const *const last = decl->declarations_end;
5866 for (;; ent = ent->base.next) {
5867 if (ent->kind == ENTITY_VARIABLE &&
5868 ent->variable.initializer != NULL &&
5869 !initializer_returns(ent->variable.initializer)) {
5876 next = stmt->base.next;
5880 case STATEMENT_COMPOUND:
5881 next = stmt->compound.statements;
5883 next = stmt->base.next;
5886 case STATEMENT_RETURN: {
5887 expression_t const *const val = stmt->returns.value;
5888 if (val == NULL || expression_returns(val))
5889 noreturn_candidate = false;
5893 case STATEMENT_IF: {
5894 if_statement_t const *const ifs = &stmt->ifs;
5895 expression_t const *const cond = ifs->condition;
5897 if (!expression_returns(cond))
5900 int const val = determine_truth(cond);
5903 check_reachable(ifs->true_statement);
5908 if (ifs->false_statement != NULL) {
5909 check_reachable(ifs->false_statement);
5913 next = stmt->base.next;
5917 case STATEMENT_SWITCH: {
5918 switch_statement_t const *const switchs = &stmt->switchs;
5919 expression_t const *const expr = switchs->expression;
5921 if (!expression_returns(expr))
5924 if (is_constant_expression(expr)) {
5925 long const val = fold_constant(expr);
5926 case_label_statement_t * defaults = NULL;
5927 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5928 if (i->expression == NULL) {
5933 if (i->first_case <= val && val <= i->last_case) {
5934 check_reachable((statement_t*)i);
5939 if (defaults != NULL) {
5940 check_reachable((statement_t*)defaults);
5944 bool has_default = false;
5945 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
5946 if (i->expression == NULL)
5949 check_reachable((statement_t*)i);
5956 next = stmt->base.next;
5960 case STATEMENT_EXPRESSION: {
5961 /* Check for noreturn function call */
5962 expression_t const *const expr = stmt->expression.expression;
5963 if (!expression_returns(expr))
5966 next = stmt->base.next;
5970 case STATEMENT_CONTINUE: {
5971 statement_t *parent = stmt;
5973 parent = parent->base.parent;
5974 if (parent == NULL) /* continue not within loop */
5978 switch (parent->kind) {
5979 case STATEMENT_WHILE: goto continue_while;
5980 case STATEMENT_DO_WHILE: goto continue_do_while;
5981 case STATEMENT_FOR: goto continue_for;
5988 case STATEMENT_BREAK: {
5989 statement_t *parent = stmt;
5991 parent = parent->base.parent;
5992 if (parent == NULL) /* break not within loop/switch */
5995 switch (parent->kind) {
5996 case STATEMENT_SWITCH:
5997 case STATEMENT_WHILE:
5998 case STATEMENT_DO_WHILE:
6001 next = parent->base.next;
6002 goto found_break_parent;
6011 case STATEMENT_GOTO:
6012 if (stmt->gotos.expression) {
6013 if (!expression_returns(stmt->gotos.expression))
6016 statement_t *parent = stmt->base.parent;
6017 if (parent == NULL) /* top level goto */
6021 next = stmt->gotos.label->statement;
6022 if (next == NULL) /* missing label */
6027 case STATEMENT_LABEL:
6028 next = stmt->label.statement;
6031 case STATEMENT_CASE_LABEL:
6032 next = stmt->case_label.statement;
6035 case STATEMENT_WHILE: {
6036 while_statement_t const *const whiles = &stmt->whiles;
6037 expression_t const *const cond = whiles->condition;
6039 if (!expression_returns(cond))
6042 int const val = determine_truth(cond);
6045 check_reachable(whiles->body);
6050 next = stmt->base.next;
6054 case STATEMENT_DO_WHILE:
6055 next = stmt->do_while.body;
6058 case STATEMENT_FOR: {
6059 for_statement_t *const fors = &stmt->fors;
6061 if (fors->condition_reachable)
6063 fors->condition_reachable = true;
6065 expression_t const *const cond = fors->condition;
6070 } else if (expression_returns(cond)) {
6071 val = determine_truth(cond);
6077 check_reachable(fors->body);
6082 next = stmt->base.next;
6086 case STATEMENT_MS_TRY: {
6087 ms_try_statement_t const *const ms_try = &stmt->ms_try;
6088 check_reachable(ms_try->try_statement);
6089 next = ms_try->final_statement;
6093 case STATEMENT_LEAVE: {
6094 statement_t *parent = stmt;
6096 parent = parent->base.parent;
6097 if (parent == NULL) /* __leave not within __try */
6100 if (parent->kind == STATEMENT_MS_TRY) {
6102 next = parent->ms_try.final_statement;
6110 panic("invalid statement kind");
6113 while (next == NULL) {
6114 next = last->base.parent;
6116 noreturn_candidate = false;
6118 type_t *const type = skip_typeref(current_function->base.type);
6119 assert(is_type_function(type));
6120 type_t *const ret = skip_typeref(type->function.return_type);
6121 if (warning.return_type &&
6122 !is_type_atomic(ret, ATOMIC_TYPE_VOID) &&
6123 is_type_valid(ret) &&
6124 !is_sym_main(current_function->base.base.symbol)) {
6125 warningf(&stmt->base.source_position,
6126 "control reaches end of non-void function");
6131 switch (next->kind) {
6132 case STATEMENT_INVALID:
6133 case STATEMENT_EMPTY:
6134 case STATEMENT_DECLARATION:
6135 case STATEMENT_EXPRESSION:
6137 case STATEMENT_RETURN:
6138 case STATEMENT_CONTINUE:
6139 case STATEMENT_BREAK:
6140 case STATEMENT_GOTO:
6141 case STATEMENT_LEAVE:
6142 panic("invalid control flow in function");
6144 case STATEMENT_COMPOUND:
6145 if (next->compound.stmt_expr) {
6151 case STATEMENT_SWITCH:
6152 case STATEMENT_LABEL:
6153 case STATEMENT_CASE_LABEL:
6155 next = next->base.next;
6158 case STATEMENT_WHILE: {
6160 if (next->base.reachable)
6162 next->base.reachable = true;
6164 while_statement_t const *const whiles = &next->whiles;
6165 expression_t const *const cond = whiles->condition;
6167 if (!expression_returns(cond))
6170 int const val = determine_truth(cond);
6173 check_reachable(whiles->body);
6179 next = next->base.next;
6183 case STATEMENT_DO_WHILE: {
6185 if (next->base.reachable)
6187 next->base.reachable = true;
6189 do_while_statement_t const *const dw = &next->do_while;
6190 expression_t const *const cond = dw->condition;
6192 if (!expression_returns(cond))
6195 int const val = determine_truth(cond);
6198 check_reachable(dw->body);
6204 next = next->base.next;
6208 case STATEMENT_FOR: {
6210 for_statement_t *const fors = &next->fors;
6212 fors->step_reachable = true;
6214 if (fors->condition_reachable)
6216 fors->condition_reachable = true;
6218 expression_t const *const cond = fors->condition;
6223 } else if (expression_returns(cond)) {
6224 val = determine_truth(cond);
6230 check_reachable(fors->body);
6236 next = next->base.next;
6240 case STATEMENT_MS_TRY:
6242 next = next->ms_try.final_statement;
6247 check_reachable(next);
6250 static void check_unreachable(statement_t* const stmt, void *const env)
6254 switch (stmt->kind) {
6255 case STATEMENT_DO_WHILE:
6256 if (!stmt->base.reachable) {
6257 expression_t const *const cond = stmt->do_while.condition;
6258 if (determine_truth(cond) >= 0) {
6259 warningf(&cond->base.source_position,
6260 "condition of do-while-loop is unreachable");
6265 case STATEMENT_FOR: {
6266 for_statement_t const* const fors = &stmt->fors;
6268 // if init and step are unreachable, cond is unreachable, too
6269 if (!stmt->base.reachable && !fors->step_reachable) {
6270 warningf(&stmt->base.source_position, "statement is unreachable");
6272 if (!stmt->base.reachable && fors->initialisation != NULL) {
6273 warningf(&fors->initialisation->base.source_position,
6274 "initialisation of for-statement is unreachable");
6277 if (!fors->condition_reachable && fors->condition != NULL) {
6278 warningf(&fors->condition->base.source_position,
6279 "condition of for-statement is unreachable");
6282 if (!fors->step_reachable && fors->step != NULL) {
6283 warningf(&fors->step->base.source_position,
6284 "step of for-statement is unreachable");
6290 case STATEMENT_COMPOUND:
6291 if (stmt->compound.statements != NULL)
6293 goto warn_unreachable;
6295 case STATEMENT_DECLARATION: {
6296 /* Only warn if there is at least one declarator with an initializer.
6297 * This typically occurs in switch statements. */
6298 declaration_statement_t const *const decl = &stmt->declaration;
6299 entity_t const * ent = decl->declarations_begin;
6300 entity_t const *const last = decl->declarations_end;
6302 for (;; ent = ent->base.next) {
6303 if (ent->kind == ENTITY_VARIABLE &&
6304 ent->variable.initializer != NULL) {
6305 goto warn_unreachable;
6315 if (!stmt->base.reachable)
6316 warningf(&stmt->base.source_position, "statement is unreachable");
6321 static void parse_external_declaration(void)
6323 /* function-definitions and declarations both start with declaration
6325 declaration_specifiers_t specifiers;
6326 memset(&specifiers, 0, sizeof(specifiers));
6328 add_anchor_token(';');
6329 parse_declaration_specifiers(&specifiers);
6330 rem_anchor_token(';');
6332 /* must be a declaration */
6333 if (token.type == ';') {
6334 parse_anonymous_declaration_rest(&specifiers);
6338 add_anchor_token(',');
6339 add_anchor_token('=');
6340 add_anchor_token(';');
6341 add_anchor_token('{');
6343 /* declarator is common to both function-definitions and declarations */
6344 entity_t *ndeclaration = parse_declarator(&specifiers, DECL_FLAGS_NONE);
6346 rem_anchor_token('{');
6347 rem_anchor_token(';');
6348 rem_anchor_token('=');
6349 rem_anchor_token(',');
6351 /* must be a declaration */
6352 switch (token.type) {
6356 parse_declaration_rest(ndeclaration, &specifiers, record_entity,
6361 /* must be a function definition */
6362 parse_kr_declaration_list(ndeclaration);
6364 if (token.type != '{') {
6365 parse_error_expected("while parsing function definition", '{', NULL);
6366 eat_until_matching_token(';');
6370 assert(is_declaration(ndeclaration));
6371 type_t *const orig_type = ndeclaration->declaration.type;
6372 type_t * type = skip_typeref(orig_type);
6374 if (!is_type_function(type)) {
6375 if (is_type_valid(type)) {
6376 errorf(HERE, "declarator '%#T' has a body but is not a function type",
6377 type, ndeclaration->base.symbol);
6381 } else if (is_typeref(orig_type)) {
6383 errorf(&ndeclaration->base.source_position,
6384 "type of function definition '%#T' is a typedef",
6385 orig_type, ndeclaration->base.symbol);
6388 if (warning.aggregate_return &&
6389 is_type_compound(skip_typeref(type->function.return_type))) {
6390 warningf(HERE, "function '%Y' returns an aggregate",
6391 ndeclaration->base.symbol);
6393 if (warning.traditional && !type->function.unspecified_parameters) {
6394 warningf(HERE, "traditional C rejects ISO C style function definition of function '%Y'",
6395 ndeclaration->base.symbol);
6397 if (warning.old_style_definition && type->function.unspecified_parameters) {
6398 warningf(HERE, "old-style function definition '%Y'",
6399 ndeclaration->base.symbol);
6402 /* §6.7.5.3:14 a function definition with () means no
6403 * parameters (and not unspecified parameters) */
6404 if (type->function.unspecified_parameters &&
6405 type->function.parameters == NULL &&
6406 !type->function.kr_style_parameters) {
6407 type_t *copy = duplicate_type(type);
6408 copy->function.unspecified_parameters = false;
6409 type = identify_new_type(copy);
6411 ndeclaration->declaration.type = type;
6414 entity_t *const entity = record_entity(ndeclaration, true);
6415 assert(entity->kind == ENTITY_FUNCTION);
6416 assert(ndeclaration->kind == ENTITY_FUNCTION);
6418 function_t *function = &entity->function;
6419 if (ndeclaration != entity) {
6420 function->parameters = ndeclaration->function.parameters;
6422 assert(is_declaration(entity));
6423 type = skip_typeref(entity->declaration.type);
6425 /* push function parameters and switch scope */
6426 size_t const top = environment_top();
6427 scope_t *old_scope = scope_push(&function->parameters);
6429 entity_t *parameter = function->parameters.entities;
6430 for (; parameter != NULL; parameter = parameter->base.next) {
6431 if (parameter->base.parent_scope == &ndeclaration->function.parameters) {
6432 parameter->base.parent_scope = current_scope;
6434 assert(parameter->base.parent_scope == NULL
6435 || parameter->base.parent_scope == current_scope);
6436 parameter->base.parent_scope = current_scope;
6437 if (parameter->base.symbol == NULL) {
6438 errorf(¶meter->base.source_position, "parameter name omitted");
6441 environment_push(parameter);
6444 if (function->statement != NULL) {
6445 parser_error_multiple_definition(entity, HERE);
6448 /* parse function body */
6449 int label_stack_top = label_top();
6450 function_t *old_current_function = current_function;
6451 current_function = function;
6452 current_parent = NULL;
6455 goto_anchor = &goto_first;
6457 label_anchor = &label_first;
6459 statement_t *const body = parse_compound_statement(false);
6460 function->statement = body;
6463 check_declarations();
6464 if (warning.return_type ||
6465 warning.unreachable_code ||
6466 (warning.missing_noreturn
6467 && !(function->base.modifiers & DM_NORETURN))) {
6468 noreturn_candidate = true;
6469 check_reachable(body);
6470 if (warning.unreachable_code)
6471 walk_statements(body, check_unreachable, NULL);
6472 if (warning.missing_noreturn &&
6473 noreturn_candidate &&
6474 !(function->base.modifiers & DM_NORETURN)) {
6475 warningf(&body->base.source_position,
6476 "function '%#T' is candidate for attribute 'noreturn'",
6477 type, entity->base.symbol);
6481 assert(current_parent == NULL);
6482 assert(current_function == function);
6483 current_function = old_current_function;
6484 label_pop_to(label_stack_top);
6487 assert(current_scope == &function->parameters);
6488 scope_pop(old_scope);
6489 environment_pop_to(top);
6492 static type_t *make_bitfield_type(type_t *base_type, expression_t *size,
6493 source_position_t *source_position,
6494 const symbol_t *symbol)
6496 type_t *type = allocate_type_zero(TYPE_BITFIELD);
6498 type->bitfield.base_type = base_type;
6499 type->bitfield.size_expression = size;
6502 type_t *skipped_type = skip_typeref(base_type);
6503 if (!is_type_integer(skipped_type)) {
6504 errorf(HERE, "bitfield base type '%T' is not an integer type",
6508 bit_size = skipped_type->base.size * 8;
6511 if (is_constant_expression(size)) {
6512 long v = fold_constant(size);
6515 errorf(source_position, "negative width in bit-field '%Y'", symbol);
6516 } else if (v == 0) {
6517 errorf(source_position, "zero width for bit-field '%Y'", symbol);
6518 } else if (bit_size > 0 && (il_size_t)v > bit_size) {
6519 errorf(source_position, "width of '%Y' exceeds its type", symbol);
6521 type->bitfield.bit_size = v;
6528 static entity_t *find_compound_entry(compound_t *compound, symbol_t *symbol)
6530 entity_t *iter = compound->members.entities;
6531 for (; iter != NULL; iter = iter->base.next) {
6532 if (iter->kind != ENTITY_COMPOUND_MEMBER)
6535 if (iter->base.symbol == symbol) {
6537 } else if (iter->base.symbol == NULL) {
6538 type_t *type = skip_typeref(iter->declaration.type);
6539 if (is_type_compound(type)) {
6541 = find_compound_entry(type->compound.compound, symbol);
6552 static void parse_compound_declarators(compound_t *compound,
6553 const declaration_specifiers_t *specifiers)
6558 if (token.type == ':') {
6559 source_position_t source_position = *HERE;
6562 type_t *base_type = specifiers->type;
6563 expression_t *size = parse_constant_expression();
6565 type_t *type = make_bitfield_type(base_type, size,
6566 &source_position, sym_anonymous);
6568 entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER);
6569 entity->base.namespc = NAMESPACE_NORMAL;
6570 entity->base.source_position = source_position;
6571 entity->declaration.declared_storage_class = STORAGE_CLASS_NONE;
6572 entity->declaration.storage_class = STORAGE_CLASS_NONE;
6573 entity->declaration.modifiers = specifiers->modifiers;
6574 entity->declaration.type = type;
6575 append_entity(&compound->members, entity);
6577 entity = parse_declarator(specifiers,
6578 DECL_MAY_BE_ABSTRACT | DECL_CREATE_COMPOUND_MEMBER);
6579 if (entity->kind == ENTITY_TYPEDEF) {
6580 errorf(&entity->base.source_position,
6581 "typedef not allowed as compound member");
6583 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
6585 /* make sure we don't define a symbol multiple times */
6586 symbol_t *symbol = entity->base.symbol;
6587 if (symbol != NULL) {
6588 entity_t *prev = find_compound_entry(compound, symbol);
6590 errorf(&entity->base.source_position,
6591 "multiple declarations of symbol '%Y' (declared %P)",
6592 symbol, &prev->base.source_position);
6596 if (token.type == ':') {
6597 source_position_t source_position = *HERE;
6599 expression_t *size = parse_constant_expression();
6601 type_t *type = entity->declaration.type;
6602 type_t *bitfield_type = make_bitfield_type(type, size,
6603 &source_position, entity->base.symbol);
6604 entity->declaration.type = bitfield_type;
6606 type_t *orig_type = entity->declaration.type;
6607 type_t *type = skip_typeref(orig_type);
6608 if (is_type_function(type)) {
6609 errorf(&entity->base.source_position,
6610 "compound member '%Y' must not have function type '%T'",
6611 entity->base.symbol, orig_type);
6612 } else if (is_type_incomplete(type)) {
6613 /* §6.7.2.1:16 flexible array member */
6614 if (is_type_array(type) &&
6615 token.type == ';' &&
6616 look_ahead(1)->type == '}') {
6617 compound->has_flexible_member = true;
6619 errorf(&entity->base.source_position,
6620 "compound member '%Y' has incomplete type '%T'",
6621 entity->base.symbol, orig_type);
6626 append_entity(&compound->members, entity);
6630 if (token.type != ',')
6634 expect(';', end_error);
6637 anonymous_entity = NULL;
6640 static void parse_compound_type_entries(compound_t *compound)
6643 add_anchor_token('}');
6645 while (token.type != '}') {
6646 if (token.type == T_EOF) {
6647 errorf(HERE, "EOF while parsing struct");
6650 declaration_specifiers_t specifiers;
6651 memset(&specifiers, 0, sizeof(specifiers));
6652 parse_declaration_specifiers(&specifiers);
6654 parse_compound_declarators(compound, &specifiers);
6656 rem_anchor_token('}');
6660 compound->complete = true;
6663 static type_t *parse_typename(void)
6665 declaration_specifiers_t specifiers;
6666 memset(&specifiers, 0, sizeof(specifiers));
6667 parse_declaration_specifiers(&specifiers);
6668 if (specifiers.storage_class != STORAGE_CLASS_NONE ||
6669 specifiers.thread_local) {
6670 /* TODO: improve error message, user does probably not know what a
6671 * storage class is...
6673 errorf(HERE, "typename may not have a storage class");
6676 type_t *result = parse_abstract_declarator(specifiers.type);
6684 typedef expression_t* (*parse_expression_function)(void);
6685 typedef expression_t* (*parse_expression_infix_function)(expression_t *left);
6687 typedef struct expression_parser_function_t expression_parser_function_t;
6688 struct expression_parser_function_t {
6689 parse_expression_function parser;
6690 precedence_t infix_precedence;
6691 parse_expression_infix_function infix_parser;
6694 expression_parser_function_t expression_parsers[T_LAST_TOKEN];
6697 * Prints an error message if an expression was expected but not read
6699 static expression_t *expected_expression_error(void)
6701 /* skip the error message if the error token was read */
6702 if (token.type != T_ERROR) {
6703 errorf(HERE, "expected expression, got token %K", &token);
6707 return create_invalid_expression();
6711 * Parse a string constant.
6713 static expression_t *parse_string_const(void)
6716 if (token.type == T_STRING_LITERAL) {
6717 string_t res = token.v.string;
6719 while (token.type == T_STRING_LITERAL) {
6720 res = concat_strings(&res, &token.v.string);
6723 if (token.type != T_WIDE_STRING_LITERAL) {
6724 expression_t *const cnst = allocate_expression_zero(EXPR_STRING_LITERAL);
6725 /* note: that we use type_char_ptr here, which is already the
6726 * automatic converted type. revert_automatic_type_conversion
6727 * will construct the array type */
6728 cnst->base.type = warning.write_strings ? type_const_char_ptr : type_char_ptr;
6729 cnst->string.value = res;
6733 wres = concat_string_wide_string(&res, &token.v.wide_string);
6735 wres = token.v.wide_string;
6740 switch (token.type) {
6741 case T_WIDE_STRING_LITERAL:
6742 wres = concat_wide_strings(&wres, &token.v.wide_string);
6745 case T_STRING_LITERAL:
6746 wres = concat_wide_string_string(&wres, &token.v.string);
6750 expression_t *const cnst = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
6751 cnst->base.type = warning.write_strings ? type_const_wchar_t_ptr : type_wchar_t_ptr;
6752 cnst->wide_string.value = wres;
6761 * Parse a boolean constant.
6763 static expression_t *parse_bool_const(bool value)
6765 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
6766 cnst->base.type = type_bool;
6767 cnst->conste.v.int_value = value;
6775 * Parse an integer constant.
6777 static expression_t *parse_int_const(void)
6779 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
6780 cnst->base.type = token.datatype;
6781 cnst->conste.v.int_value = token.v.intvalue;
6789 * Parse a character constant.
6791 static expression_t *parse_character_constant(void)
6793 expression_t *cnst = allocate_expression_zero(EXPR_CHARACTER_CONSTANT);
6794 cnst->base.type = token.datatype;
6795 cnst->conste.v.character = token.v.string;
6797 if (cnst->conste.v.character.size != 1) {
6799 errorf(HERE, "more than 1 character in character constant");
6800 } else if (warning.multichar) {
6801 warningf(HERE, "multi-character character constant");
6810 * Parse a wide character constant.
6812 static expression_t *parse_wide_character_constant(void)
6814 expression_t *cnst = allocate_expression_zero(EXPR_WIDE_CHARACTER_CONSTANT);
6815 cnst->base.type = token.datatype;
6816 cnst->conste.v.wide_character = token.v.wide_string;
6818 if (cnst->conste.v.wide_character.size != 1) {
6820 errorf(HERE, "more than 1 character in character constant");
6821 } else if (warning.multichar) {
6822 warningf(HERE, "multi-character character constant");
6831 * Parse a float constant.
6833 static expression_t *parse_float_const(void)
6835 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
6836 cnst->base.type = token.datatype;
6837 cnst->conste.v.float_value = token.v.floatvalue;
6844 static entity_t *create_implicit_function(symbol_t *symbol,
6845 const source_position_t *source_position)
6847 type_t *ntype = allocate_type_zero(TYPE_FUNCTION);
6848 ntype->function.return_type = type_int;
6849 ntype->function.unspecified_parameters = true;
6850 ntype->function.linkage = LINKAGE_C;
6851 type_t *type = identify_new_type(ntype);
6853 entity_t *entity = allocate_entity_zero(ENTITY_FUNCTION);
6854 entity->declaration.storage_class = STORAGE_CLASS_EXTERN;
6855 entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
6856 entity->declaration.type = type;
6857 entity->declaration.implicit = true;
6858 entity->base.symbol = symbol;
6859 entity->base.source_position = *source_position;
6861 bool strict_prototypes_old = warning.strict_prototypes;
6862 warning.strict_prototypes = false;
6863 record_entity(entity, false);
6864 warning.strict_prototypes = strict_prototypes_old;
6870 * Creates a return_type (func)(argument_type) function type if not
6873 static type_t *make_function_2_type(type_t *return_type, type_t *argument_type1,
6874 type_t *argument_type2)
6876 function_parameter_t *parameter2
6877 = obstack_alloc(type_obst, sizeof(parameter2[0]));
6878 memset(parameter2, 0, sizeof(parameter2[0]));
6879 parameter2->type = argument_type2;
6881 function_parameter_t *parameter1
6882 = obstack_alloc(type_obst, sizeof(parameter1[0]));
6883 memset(parameter1, 0, sizeof(parameter1[0]));
6884 parameter1->type = argument_type1;
6885 parameter1->next = parameter2;
6887 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6888 type->function.return_type = return_type;
6889 type->function.parameters = parameter1;
6891 return identify_new_type(type);
6895 * Creates a return_type (func)(argument_type) function type if not
6898 * @param return_type the return type
6899 * @param argument_type the argument type
6901 static type_t *make_function_1_type(type_t *return_type, type_t *argument_type)
6903 function_parameter_t *parameter
6904 = obstack_alloc(type_obst, sizeof(parameter[0]));
6905 memset(parameter, 0, sizeof(parameter[0]));
6906 parameter->type = argument_type;
6908 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6909 type->function.return_type = return_type;
6910 type->function.parameters = parameter;
6912 return identify_new_type(type);
6915 static type_t *make_function_1_type_variadic(type_t *return_type, type_t *argument_type)
6917 type_t *res = make_function_1_type(return_type, argument_type);
6918 res->function.variadic = 1;
6923 * Creates a return_type (func)(void) function type if not
6926 * @param return_type the return type
6928 static type_t *make_function_0_type(type_t *return_type)
6930 type_t *type = allocate_type_zero(TYPE_FUNCTION);
6931 type->function.return_type = return_type;
6932 type->function.parameters = NULL;
6934 return identify_new_type(type);
6938 * Creates a function type for some function like builtins.
6940 * @param symbol the symbol describing the builtin
6942 static type_t *get_builtin_symbol_type(symbol_t *symbol)
6944 switch (symbol->ID) {
6945 case T___builtin_alloca:
6946 return make_function_1_type(type_void_ptr, type_size_t);
6947 case T___builtin_huge_val:
6948 return make_function_0_type(type_double);
6949 case T___builtin_inf:
6950 return make_function_0_type(type_double);
6951 case T___builtin_inff:
6952 return make_function_0_type(type_float);
6953 case T___builtin_infl:
6954 return make_function_0_type(type_long_double);
6955 case T___builtin_nan:
6956 return make_function_1_type(type_double, type_char_ptr);
6957 case T___builtin_nanf:
6958 return make_function_1_type(type_float, type_char_ptr);
6959 case T___builtin_nanl:
6960 return make_function_1_type(type_long_double, type_char_ptr);
6961 case T___builtin_va_end:
6962 return make_function_1_type(type_void, type_valist);
6963 case T___builtin_expect:
6964 return make_function_2_type(type_long, type_long, type_long);
6965 case T___builtin_return_address:
6966 case T___builtin_frame_address:
6967 return make_function_1_type(type_void_ptr, type_unsigned_int);
6968 case T___builtin_ffs:
6969 case T___builtin_clz:
6970 case T___builtin_ctz:
6971 case T___builtin_popcount:
6972 case T___builtin_parity:
6973 return make_function_1_type(type_int, type_unsigned_int);
6974 case T___builtin_prefetch:
6975 return make_function_1_type_variadic(type_float, type_void_ptr);
6976 case T___builtin_trap: {
6977 type_t *type = make_function_0_type(type_void);
6978 type->function.base.modifiers |= DM_NORETURN;
6982 internal_errorf(HERE, "not implemented builtin identifier found");
6987 * Performs automatic type cast as described in §6.3.2.1.
6989 * @param orig_type the original type
6991 static type_t *automatic_type_conversion(type_t *orig_type)
6993 type_t *type = skip_typeref(orig_type);
6994 if (is_type_array(type)) {
6995 array_type_t *array_type = &type->array;
6996 type_t *element_type = array_type->element_type;
6997 unsigned qualifiers = array_type->base.qualifiers;
6999 return make_pointer_type(element_type, qualifiers);
7002 if (is_type_function(type)) {
7003 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
7010 * reverts the automatic casts of array to pointer types and function
7011 * to function-pointer types as defined §6.3.2.1
7013 type_t *revert_automatic_type_conversion(const expression_t *expression)
7015 switch (expression->kind) {
7016 case EXPR_REFERENCE: {
7017 entity_t *entity = expression->reference.entity;
7018 if (is_declaration(entity)) {
7019 return entity->declaration.type;
7020 } else if (entity->kind == ENTITY_ENUM_VALUE) {
7021 return entity->enum_value.enum_type;
7023 panic("no declaration or enum in reference");
7028 entity_t *entity = expression->select.compound_entry;
7029 assert(is_declaration(entity));
7030 type_t *type = entity->declaration.type;
7031 return get_qualified_type(type,
7032 expression->base.type->base.qualifiers);
7035 case EXPR_UNARY_DEREFERENCE: {
7036 const expression_t *const value = expression->unary.value;
7037 type_t *const type = skip_typeref(value->base.type);
7038 if (!is_type_pointer(type))
7039 return type_error_type;
7040 return type->pointer.points_to;
7043 case EXPR_BUILTIN_SYMBOL:
7044 return get_builtin_symbol_type(expression->builtin_symbol.symbol);
7046 case EXPR_ARRAY_ACCESS: {
7047 const expression_t *array_ref = expression->array_access.array_ref;
7048 type_t *type_left = skip_typeref(array_ref->base.type);
7049 if (!is_type_pointer(type_left))
7050 return type_error_type;
7051 return type_left->pointer.points_to;
7054 case EXPR_STRING_LITERAL: {
7055 size_t size = expression->string.value.size;
7056 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
7059 case EXPR_WIDE_STRING_LITERAL: {
7060 size_t size = expression->wide_string.value.size;
7061 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
7064 case EXPR_COMPOUND_LITERAL:
7065 return expression->compound_literal.type;
7068 return expression->base.type;
7072 static expression_t *parse_reference(void)
7074 symbol_t *const symbol = token.v.symbol;
7076 entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
7078 if (entity == NULL) {
7079 if (!strict_mode && look_ahead(1)->type == '(') {
7080 /* an implicitly declared function */
7081 if (warning.error_implicit_function_declaration) {
7082 errorf(HERE, "implicit declaration of function '%Y'", symbol);
7083 } else if (warning.implicit_function_declaration) {
7084 warningf(HERE, "implicit declaration of function '%Y'", symbol);
7087 entity = create_implicit_function(symbol, HERE);
7089 errorf(HERE, "unknown identifier '%Y' found.", symbol);
7090 entity = create_error_entity(symbol, ENTITY_VARIABLE);
7096 if (is_declaration(entity)) {
7097 orig_type = entity->declaration.type;
7098 } else if (entity->kind == ENTITY_ENUM_VALUE) {
7099 orig_type = entity->enum_value.enum_type;
7100 } else if (entity->kind == ENTITY_TYPEDEF) {
7101 errorf(HERE, "encountered typedef name '%Y' while parsing expression",
7104 return create_invalid_expression();
7106 panic("expected declaration or enum value in reference");
7109 /* we always do the auto-type conversions; the & and sizeof parser contains
7110 * code to revert this! */
7111 type_t *type = automatic_type_conversion(orig_type);
7113 expression_kind_t kind = EXPR_REFERENCE;
7114 if (entity->kind == ENTITY_ENUM_VALUE)
7115 kind = EXPR_REFERENCE_ENUM_VALUE;
7117 expression_t *expression = allocate_expression_zero(kind);
7118 expression->reference.entity = entity;
7119 expression->base.type = type;
7121 /* this declaration is used */
7122 if (is_declaration(entity)) {
7123 entity->declaration.used = true;
7126 if (entity->base.parent_scope != file_scope
7127 && entity->base.parent_scope->depth < current_function->parameters.depth
7128 && is_type_valid(orig_type) && !is_type_function(orig_type)) {
7129 if (entity->kind == ENTITY_VARIABLE) {
7130 /* access of a variable from an outer function */
7131 entity->variable.address_taken = true;
7132 } else if (entity->kind == ENTITY_PARAMETER) {
7133 entity->parameter.address_taken = true;
7135 current_function->need_closure = true;
7138 /* check for deprecated functions */
7139 if (warning.deprecated_declarations
7140 && is_declaration(entity)
7141 && entity->declaration.modifiers & DM_DEPRECATED) {
7142 declaration_t *declaration = &entity->declaration;
7144 char const *const prefix = entity->kind == ENTITY_FUNCTION ?
7145 "function" : "variable";
7147 if (declaration->deprecated_string != NULL) {
7148 warningf(HERE, "%s '%Y' is deprecated (declared %P): \"%s\"",
7149 prefix, entity->base.symbol, &entity->base.source_position,
7150 declaration->deprecated_string);
7152 warningf(HERE, "%s '%Y' is deprecated (declared %P)", prefix,
7153 entity->base.symbol, &entity->base.source_position);
7157 if (warning.init_self && entity == current_init_decl && !in_type_prop
7158 && entity->kind == ENTITY_VARIABLE) {
7159 current_init_decl = NULL;
7160 warningf(HERE, "variable '%#T' is initialized by itself",
7161 entity->declaration.type, entity->base.symbol);
7168 static bool semantic_cast(expression_t *cast)
7170 expression_t *expression = cast->unary.value;
7171 type_t *orig_dest_type = cast->base.type;
7172 type_t *orig_type_right = expression->base.type;
7173 type_t const *dst_type = skip_typeref(orig_dest_type);
7174 type_t const *src_type = skip_typeref(orig_type_right);
7175 source_position_t const *pos = &cast->base.source_position;
7177 /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
7178 if (dst_type == type_void)
7181 /* only integer and pointer can be casted to pointer */
7182 if (is_type_pointer(dst_type) &&
7183 !is_type_pointer(src_type) &&
7184 !is_type_integer(src_type) &&
7185 is_type_valid(src_type)) {
7186 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
7190 if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
7191 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
7195 if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
7196 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
7200 if (warning.cast_qual &&
7201 is_type_pointer(src_type) &&
7202 is_type_pointer(dst_type)) {
7203 type_t *src = skip_typeref(src_type->pointer.points_to);
7204 type_t *dst = skip_typeref(dst_type->pointer.points_to);
7205 unsigned missing_qualifiers =
7206 src->base.qualifiers & ~dst->base.qualifiers;
7207 if (missing_qualifiers != 0) {
7209 "cast discards qualifiers '%Q' in pointer target type of '%T'",
7210 missing_qualifiers, orig_type_right);
7216 static expression_t *parse_compound_literal(type_t *type)
7218 expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
7220 parse_initializer_env_t env;
7223 env.must_be_constant = false;
7224 initializer_t *initializer = parse_initializer(&env);
7227 expression->compound_literal.initializer = initializer;
7228 expression->compound_literal.type = type;
7229 expression->base.type = automatic_type_conversion(type);
7235 * Parse a cast expression.
7237 static expression_t *parse_cast(void)
7239 add_anchor_token(')');
7241 source_position_t source_position = token.source_position;
7243 type_t *type = parse_typename();
7245 rem_anchor_token(')');
7246 expect(')', end_error);
7248 if (token.type == '{') {
7249 return parse_compound_literal(type);
7252 expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
7253 cast->base.source_position = source_position;
7255 expression_t *value = parse_sub_expression(PREC_CAST);
7256 cast->base.type = type;
7257 cast->unary.value = value;
7259 if (! semantic_cast(cast)) {
7260 /* TODO: record the error in the AST. else it is impossible to detect it */
7265 return create_invalid_expression();
7269 * Parse a statement expression.
7271 static expression_t *parse_statement_expression(void)
7273 add_anchor_token(')');
7275 expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
7277 statement_t *statement = parse_compound_statement(true);
7278 statement->compound.stmt_expr = true;
7279 expression->statement.statement = statement;
7281 /* find last statement and use its type */
7282 type_t *type = type_void;
7283 const statement_t *stmt = statement->compound.statements;
7285 while (stmt->base.next != NULL)
7286 stmt = stmt->base.next;
7288 if (stmt->kind == STATEMENT_EXPRESSION) {
7289 type = stmt->expression.expression->base.type;
7291 } else if (warning.other) {
7292 warningf(&expression->base.source_position, "empty statement expression ({})");
7294 expression->base.type = type;
7296 rem_anchor_token(')');
7297 expect(')', end_error);
7304 * Parse a parenthesized expression.
7306 static expression_t *parse_parenthesized_expression(void)
7310 switch (token.type) {
7312 /* gcc extension: a statement expression */
7313 return parse_statement_expression();
7317 return parse_cast();
7319 if (is_typedef_symbol(token.v.symbol)) {
7320 return parse_cast();
7324 add_anchor_token(')');
7325 expression_t *result = parse_expression();
7326 result->base.parenthesized = true;
7327 rem_anchor_token(')');
7328 expect(')', end_error);
7334 static expression_t *parse_function_keyword(void)
7338 if (current_function == NULL) {
7339 errorf(HERE, "'__func__' used outside of a function");
7342 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
7343 expression->base.type = type_char_ptr;
7344 expression->funcname.kind = FUNCNAME_FUNCTION;
7351 static expression_t *parse_pretty_function_keyword(void)
7353 if (current_function == NULL) {
7354 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
7357 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
7358 expression->base.type = type_char_ptr;
7359 expression->funcname.kind = FUNCNAME_PRETTY_FUNCTION;
7361 eat(T___PRETTY_FUNCTION__);
7366 static expression_t *parse_funcsig_keyword(void)
7368 if (current_function == NULL) {
7369 errorf(HERE, "'__FUNCSIG__' used outside of a function");
7372 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
7373 expression->base.type = type_char_ptr;
7374 expression->funcname.kind = FUNCNAME_FUNCSIG;
7381 static expression_t *parse_funcdname_keyword(void)
7383 if (current_function == NULL) {
7384 errorf(HERE, "'__FUNCDNAME__' used outside of a function");
7387 expression_t *expression = allocate_expression_zero(EXPR_FUNCNAME);
7388 expression->base.type = type_char_ptr;
7389 expression->funcname.kind = FUNCNAME_FUNCDNAME;
7391 eat(T___FUNCDNAME__);
7396 static designator_t *parse_designator(void)
7398 designator_t *result = allocate_ast_zero(sizeof(result[0]));
7399 result->source_position = *HERE;
7401 if (token.type != T_IDENTIFIER) {
7402 parse_error_expected("while parsing member designator",
7403 T_IDENTIFIER, NULL);
7406 result->symbol = token.v.symbol;
7409 designator_t *last_designator = result;
7411 if (token.type == '.') {
7413 if (token.type != T_IDENTIFIER) {
7414 parse_error_expected("while parsing member designator",
7415 T_IDENTIFIER, NULL);
7418 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
7419 designator->source_position = *HERE;
7420 designator->symbol = token.v.symbol;
7423 last_designator->next = designator;
7424 last_designator = designator;
7427 if (token.type == '[') {
7429 add_anchor_token(']');
7430 designator_t *designator = allocate_ast_zero(sizeof(result[0]));
7431 designator->source_position = *HERE;
7432 designator->array_index = parse_expression();
7433 rem_anchor_token(']');
7434 expect(']', end_error);
7435 if (designator->array_index == NULL) {
7439 last_designator->next = designator;
7440 last_designator = designator;
7452 * Parse the __builtin_offsetof() expression.
7454 static expression_t *parse_offsetof(void)
7456 expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
7457 expression->base.type = type_size_t;
7459 eat(T___builtin_offsetof);
7461 expect('(', end_error);
7462 add_anchor_token(',');
7463 type_t *type = parse_typename();
7464 rem_anchor_token(',');
7465 expect(',', end_error);
7466 add_anchor_token(')');
7467 designator_t *designator = parse_designator();
7468 rem_anchor_token(')');
7469 expect(')', end_error);
7471 expression->offsetofe.type = type;
7472 expression->offsetofe.designator = designator;
7475 memset(&path, 0, sizeof(path));
7476 path.top_type = type;
7477 path.path = NEW_ARR_F(type_path_entry_t, 0);
7479 descend_into_subtype(&path);
7481 if (!walk_designator(&path, designator, true)) {
7482 return create_invalid_expression();
7485 DEL_ARR_F(path.path);
7489 return create_invalid_expression();
7493 * Parses a _builtin_va_start() expression.
7495 static expression_t *parse_va_start(void)
7497 expression_t *expression = allocate_expression_zero(EXPR_VA_START);
7499 eat(T___builtin_va_start);
7501 expect('(', end_error);
7502 add_anchor_token(',');
7503 expression->va_starte.ap = parse_assignment_expression();
7504 rem_anchor_token(',');
7505 expect(',', end_error);
7506 expression_t *const expr = parse_assignment_expression();
7507 if (expr->kind == EXPR_REFERENCE) {
7508 entity_t *const entity = expr->reference.entity;
7509 if (entity->base.parent_scope != ¤t_function->parameters
7510 || entity->base.next != NULL
7511 || entity->kind != ENTITY_PARAMETER) {
7512 errorf(&expr->base.source_position,
7513 "second argument of 'va_start' must be last parameter of the current function");
7515 expression->va_starte.parameter = &entity->variable;
7517 expect(')', end_error);
7520 expect(')', end_error);
7522 return create_invalid_expression();
7526 * Parses a _builtin_va_arg() expression.
7528 static expression_t *parse_va_arg(void)
7530 expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
7532 eat(T___builtin_va_arg);
7534 expect('(', end_error);
7535 expression->va_arge.ap = parse_assignment_expression();
7536 expect(',', end_error);
7537 expression->base.type = parse_typename();
7538 expect(')', end_error);
7542 return create_invalid_expression();
7545 static expression_t *parse_builtin_symbol(void)
7547 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_SYMBOL);
7549 symbol_t *symbol = token.v.symbol;
7551 expression->builtin_symbol.symbol = symbol;
7554 type_t *type = get_builtin_symbol_type(symbol);
7555 type = automatic_type_conversion(type);
7557 expression->base.type = type;
7562 * Parses a __builtin_constant_p() expression.
7564 static expression_t *parse_builtin_constant(void)
7566 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
7568 eat(T___builtin_constant_p);
7570 expect('(', end_error);
7571 add_anchor_token(')');
7572 expression->builtin_constant.value = parse_assignment_expression();
7573 rem_anchor_token(')');
7574 expect(')', end_error);
7575 expression->base.type = type_int;
7579 return create_invalid_expression();
7583 * Parses a __builtin_types_compatible_p() expression.
7585 static expression_t *parse_builtin_types_compatible(void)
7587 expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_TYPES_COMPATIBLE_P);
7589 eat(T___builtin_types_compatible_p);
7591 expect('(', end_error);
7592 add_anchor_token(')');
7593 add_anchor_token(',');
7594 expression->builtin_types_compatible.left = parse_typename();
7595 rem_anchor_token(',');
7596 expect(',', end_error);
7597 expression->builtin_types_compatible.right = parse_typename();
7598 rem_anchor_token(')');
7599 expect(')', end_error);
7600 expression->base.type = type_int;
7604 return create_invalid_expression();
7608 * Parses a __builtin_is_*() compare expression.
7610 static expression_t *parse_compare_builtin(void)
7612 expression_t *expression;
7614 switch (token.type) {
7615 case T___builtin_isgreater:
7616 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
7618 case T___builtin_isgreaterequal:
7619 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
7621 case T___builtin_isless:
7622 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
7624 case T___builtin_islessequal:
7625 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
7627 case T___builtin_islessgreater:
7628 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
7630 case T___builtin_isunordered:
7631 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
7634 internal_errorf(HERE, "invalid compare builtin found");
7636 expression->base.source_position = *HERE;
7639 expect('(', end_error);
7640 expression->binary.left = parse_assignment_expression();
7641 expect(',', end_error);
7642 expression->binary.right = parse_assignment_expression();
7643 expect(')', end_error);
7645 type_t *const orig_type_left = expression->binary.left->base.type;
7646 type_t *const orig_type_right = expression->binary.right->base.type;
7648 type_t *const type_left = skip_typeref(orig_type_left);
7649 type_t *const type_right = skip_typeref(orig_type_right);
7650 if (!is_type_float(type_left) && !is_type_float(type_right)) {
7651 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7652 type_error_incompatible("invalid operands in comparison",
7653 &expression->base.source_position, orig_type_left, orig_type_right);
7656 semantic_comparison(&expression->binary);
7661 return create_invalid_expression();
7666 * Parses a __builtin_expect(, end_error) expression.
7668 static expression_t *parse_builtin_expect(void, end_error)
7670 expression_t *expression
7671 = allocate_expression_zero(EXPR_BINARY_BUILTIN_EXPECT);
7673 eat(T___builtin_expect);
7675 expect('(', end_error);
7676 expression->binary.left = parse_assignment_expression();
7677 expect(',', end_error);
7678 expression->binary.right = parse_constant_expression();
7679 expect(')', end_error);
7681 expression->base.type = expression->binary.left->base.type;
7685 return create_invalid_expression();
7690 * Parses a MS assume() expression.
7692 static expression_t *parse_assume(void)
7694 expression_t *expression = allocate_expression_zero(EXPR_UNARY_ASSUME);
7698 expect('(', end_error);
7699 add_anchor_token(')');
7700 expression->unary.value = parse_assignment_expression();
7701 rem_anchor_token(')');
7702 expect(')', end_error);
7704 expression->base.type = type_void;
7707 return create_invalid_expression();
7711 * Return the declaration for a given label symbol or create a new one.
7713 * @param symbol the symbol of the label
7715 static label_t *get_label(symbol_t *symbol)
7718 assert(current_function != NULL);
7720 label = get_entity(symbol, NAMESPACE_LABEL);
7721 /* if we found a local label, we already created the declaration */
7722 if (label != NULL && label->kind == ENTITY_LOCAL_LABEL) {
7723 if (label->base.parent_scope != current_scope) {
7724 assert(label->base.parent_scope->depth < current_scope->depth);
7725 current_function->goto_to_outer = true;
7727 return &label->label;
7730 label = get_entity(symbol, NAMESPACE_LABEL);
7731 /* if we found a label in the same function, then we already created the
7734 && label->base.parent_scope == ¤t_function->parameters) {
7735 return &label->label;
7738 /* otherwise we need to create a new one */
7739 label = allocate_entity_zero(ENTITY_LABEL);
7740 label->base.namespc = NAMESPACE_LABEL;
7741 label->base.symbol = symbol;
7745 return &label->label;
7749 * Parses a GNU && label address expression.
7751 static expression_t *parse_label_address(void)
7753 source_position_t source_position = token.source_position;
7755 if (token.type != T_IDENTIFIER) {
7756 parse_error_expected("while parsing label address", T_IDENTIFIER, NULL);
7759 symbol_t *symbol = token.v.symbol;
7762 label_t *label = get_label(symbol);
7764 label->address_taken = true;
7766 expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
7767 expression->base.source_position = source_position;
7769 /* label address is threaten as a void pointer */
7770 expression->base.type = type_void_ptr;
7771 expression->label_address.label = label;
7774 return create_invalid_expression();
7778 * Parse a microsoft __noop expression.
7780 static expression_t *parse_noop_expression(void)
7782 /* the result is a (int)0 */
7783 expression_t *cnst = allocate_expression_zero(EXPR_CONST);
7784 cnst->base.type = type_int;
7785 cnst->conste.v.int_value = 0;
7786 cnst->conste.is_ms_noop = true;
7790 if (token.type == '(') {
7791 /* parse arguments */
7793 add_anchor_token(')');
7794 add_anchor_token(',');
7796 if (token.type != ')') {
7798 (void)parse_assignment_expression();
7799 if (token.type != ',')
7805 rem_anchor_token(',');
7806 rem_anchor_token(')');
7807 expect(')', end_error);
7814 * Parses a primary expression.
7816 static expression_t *parse_primary_expression(void)
7818 switch (token.type) {
7819 case T_false: return parse_bool_const(false);
7820 case T_true: return parse_bool_const(true);
7821 case T_INTEGER: return parse_int_const();
7822 case T_CHARACTER_CONSTANT: return parse_character_constant();
7823 case T_WIDE_CHARACTER_CONSTANT: return parse_wide_character_constant();
7824 case T_FLOATINGPOINT: return parse_float_const();
7825 case T_STRING_LITERAL:
7826 case T_WIDE_STRING_LITERAL: return parse_string_const();
7827 case T_IDENTIFIER: return parse_reference();
7828 case T___FUNCTION__:
7829 case T___func__: return parse_function_keyword();
7830 case T___PRETTY_FUNCTION__: return parse_pretty_function_keyword();
7831 case T___FUNCSIG__: return parse_funcsig_keyword();
7832 case T___FUNCDNAME__: return parse_funcdname_keyword();
7833 case T___builtin_offsetof: return parse_offsetof();
7834 case T___builtin_va_start: return parse_va_start();
7835 case T___builtin_va_arg: return parse_va_arg();
7836 case T___builtin_expect:
7837 case T___builtin_alloca:
7838 case T___builtin_inf:
7839 case T___builtin_inff:
7840 case T___builtin_infl:
7841 case T___builtin_nan:
7842 case T___builtin_nanf:
7843 case T___builtin_nanl:
7844 case T___builtin_huge_val:
7845 case T___builtin_va_end:
7846 case T___builtin_return_address:
7847 case T___builtin_frame_address:
7848 case T___builtin_ffs:
7849 case T___builtin_clz:
7850 case T___builtin_ctz:
7851 case T___builtin_popcount:
7852 case T___builtin_parity:
7853 case T___builtin_prefetch:
7854 case T___builtin_trap: return parse_builtin_symbol();
7855 case T___builtin_isgreater:
7856 case T___builtin_isgreaterequal:
7857 case T___builtin_isless:
7858 case T___builtin_islessequal:
7859 case T___builtin_islessgreater:
7860 case T___builtin_isunordered: return parse_compare_builtin();
7861 case T___builtin_constant_p: return parse_builtin_constant();
7862 case T___builtin_types_compatible_p: return parse_builtin_types_compatible();
7863 case T__assume: return parse_assume();
7866 return parse_label_address();
7869 case '(': return parse_parenthesized_expression();
7870 case T___noop: return parse_noop_expression();
7873 errorf(HERE, "unexpected token %K, expected an expression", &token);
7874 return create_invalid_expression();
7878 * Check if the expression has the character type and issue a warning then.
7880 static void check_for_char_index_type(const expression_t *expression)
7882 type_t *const type = expression->base.type;
7883 const type_t *const base_type = skip_typeref(type);
7885 if (is_type_atomic(base_type, ATOMIC_TYPE_CHAR) &&
7886 warning.char_subscripts) {
7887 warningf(&expression->base.source_position,
7888 "array subscript has type '%T'", type);
7892 static expression_t *parse_array_expression(expression_t *left)
7894 expression_t *expression = allocate_expression_zero(EXPR_ARRAY_ACCESS);
7897 add_anchor_token(']');
7899 expression_t *inside = parse_expression();
7901 type_t *const orig_type_left = left->base.type;
7902 type_t *const orig_type_inside = inside->base.type;
7904 type_t *const type_left = skip_typeref(orig_type_left);
7905 type_t *const type_inside = skip_typeref(orig_type_inside);
7907 type_t *return_type;
7908 array_access_expression_t *array_access = &expression->array_access;
7909 if (is_type_pointer(type_left)) {
7910 return_type = type_left->pointer.points_to;
7911 array_access->array_ref = left;
7912 array_access->index = inside;
7913 check_for_char_index_type(inside);
7914 } else if (is_type_pointer(type_inside)) {
7915 return_type = type_inside->pointer.points_to;
7916 array_access->array_ref = inside;
7917 array_access->index = left;
7918 array_access->flipped = true;
7919 check_for_char_index_type(left);
7921 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
7923 "array access on object with non-pointer types '%T', '%T'",
7924 orig_type_left, orig_type_inside);
7926 return_type = type_error_type;
7927 array_access->array_ref = left;
7928 array_access->index = inside;
7931 expression->base.type = automatic_type_conversion(return_type);
7933 rem_anchor_token(']');
7934 expect(']', end_error);
7939 static expression_t *parse_typeprop(expression_kind_t const kind)
7941 expression_t *tp_expression = allocate_expression_zero(kind);
7942 tp_expression->base.type = type_size_t;
7944 eat(kind == EXPR_SIZEOF ? T_sizeof : T___alignof__);
7946 /* we only refer to a type property, mark this case */
7947 bool old = in_type_prop;
7948 in_type_prop = true;
7951 expression_t *expression;
7952 if (token.type == '(' && is_declaration_specifier(look_ahead(1), true)) {
7954 add_anchor_token(')');
7955 orig_type = parse_typename();
7956 rem_anchor_token(')');
7957 expect(')', end_error);
7959 if (token.type == '{') {
7960 /* It was not sizeof(type) after all. It is sizeof of an expression
7961 * starting with a compound literal */
7962 expression = parse_compound_literal(orig_type);
7963 goto typeprop_expression;
7966 expression = parse_sub_expression(PREC_UNARY);
7968 typeprop_expression:
7969 tp_expression->typeprop.tp_expression = expression;
7971 orig_type = revert_automatic_type_conversion(expression);
7972 expression->base.type = orig_type;
7975 tp_expression->typeprop.type = orig_type;
7976 type_t const* const type = skip_typeref(orig_type);
7977 char const* const wrong_type =
7978 GNU_MODE && is_type_atomic(type, ATOMIC_TYPE_VOID) ? NULL :
7979 is_type_incomplete(type) ? "incomplete" :
7980 type->kind == TYPE_FUNCTION ? "function designator" :
7981 type->kind == TYPE_BITFIELD ? "bitfield" :
7983 if (wrong_type != NULL) {
7984 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7985 errorf(&tp_expression->base.source_position,
7986 "operand of %s expression must not be of %s type '%T'",
7987 what, wrong_type, orig_type);
7992 return tp_expression;
7995 static expression_t *parse_sizeof(void)
7997 return parse_typeprop(EXPR_SIZEOF);
8000 static expression_t *parse_alignof(void)
8002 return parse_typeprop(EXPR_ALIGNOF);
8005 static expression_t *parse_select_expression(expression_t *compound)
8007 expression_t *select = allocate_expression_zero(EXPR_SELECT);
8008 select->select.compound = compound;
8010 assert(token.type == '.' || token.type == T_MINUSGREATER);
8011 bool is_pointer = (token.type == T_MINUSGREATER);
8014 if (token.type != T_IDENTIFIER) {
8015 parse_error_expected("while parsing select", T_IDENTIFIER, NULL);
8018 symbol_t *symbol = token.v.symbol;
8021 type_t *const orig_type = compound->base.type;
8022 type_t *const type = skip_typeref(orig_type);
8025 bool saw_error = false;
8026 if (is_type_pointer(type)) {
8029 "request for member '%Y' in something not a struct or union, but '%T'",
8033 type_left = skip_typeref(type->pointer.points_to);
8035 if (is_pointer && is_type_valid(type)) {
8036 errorf(HERE, "left hand side of '->' is not a pointer, but '%T'", orig_type);
8043 if (type_left->kind == TYPE_COMPOUND_STRUCT ||
8044 type_left->kind == TYPE_COMPOUND_UNION) {
8045 compound_t *compound = type_left->compound.compound;
8047 if (!compound->complete) {
8048 errorf(HERE, "request for member '%Y' of incomplete type '%T'",
8050 goto create_error_entry;
8053 entry = find_compound_entry(compound, symbol);
8054 if (entry == NULL) {
8055 errorf(HERE, "'%T' has no member named '%Y'", orig_type, symbol);
8056 goto create_error_entry;
8059 if (is_type_valid(type_left) && !saw_error) {
8061 "request for member '%Y' in something not a struct or union, but '%T'",
8065 entry = create_error_entity(symbol, ENTITY_COMPOUND_MEMBER);
8068 assert(is_declaration(entry));
8069 select->select.compound_entry = entry;
8071 type_t *entry_type = entry->declaration.type;
8073 = get_qualified_type(entry_type, type_left->base.qualifiers);
8075 /* we always do the auto-type conversions; the & and sizeof parser contains
8076 * code to revert this! */
8077 select->base.type = automatic_type_conversion(res_type);
8079 type_t *skipped = skip_typeref(res_type);
8080 if (skipped->kind == TYPE_BITFIELD) {
8081 select->base.type = skipped->bitfield.base_type;
8087 static void check_call_argument(const function_parameter_t *parameter,
8088 call_argument_t *argument, unsigned pos)
8090 type_t *expected_type = parameter->type;
8091 type_t *expected_type_skip = skip_typeref(expected_type);
8092 assign_error_t error = ASSIGN_ERROR_INCOMPATIBLE;
8093 expression_t *arg_expr = argument->expression;
8094 type_t *arg_type = skip_typeref(arg_expr->base.type);
8096 /* handle transparent union gnu extension */
8097 if (is_type_union(expected_type_skip)
8098 && (expected_type_skip->base.modifiers
8099 & TYPE_MODIFIER_TRANSPARENT_UNION)) {
8100 compound_t *union_decl = expected_type_skip->compound.compound;
8101 type_t *best_type = NULL;
8102 entity_t *entry = union_decl->members.entities;
8103 for ( ; entry != NULL; entry = entry->base.next) {
8104 assert(is_declaration(entry));
8105 type_t *decl_type = entry->declaration.type;
8106 error = semantic_assign(decl_type, arg_expr);
8107 if (error == ASSIGN_ERROR_INCOMPATIBLE
8108 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
8111 if (error == ASSIGN_SUCCESS) {
8112 best_type = decl_type;
8113 } else if (best_type == NULL) {
8114 best_type = decl_type;
8118 if (best_type != NULL) {
8119 expected_type = best_type;
8123 error = semantic_assign(expected_type, arg_expr);
8124 argument->expression = create_implicit_cast(argument->expression,
8127 if (error != ASSIGN_SUCCESS) {
8128 /* report exact scope in error messages (like "in argument 3") */
8130 snprintf(buf, sizeof(buf), "call argument %u", pos);
8131 report_assign_error(error, expected_type, arg_expr, buf,
8132 &arg_expr->base.source_position);
8133 } else if (warning.traditional || warning.conversion) {
8134 type_t *const promoted_type = get_default_promoted_type(arg_type);
8135 if (!types_compatible(expected_type_skip, promoted_type) &&
8136 !types_compatible(expected_type_skip, type_void_ptr) &&
8137 !types_compatible(type_void_ptr, promoted_type)) {
8138 /* Deliberately show the skipped types in this warning */
8139 warningf(&arg_expr->base.source_position,
8140 "passing call argument %u as '%T' rather than '%T' due to prototype",
8141 pos, expected_type_skip, promoted_type);
8147 * Handle the semantic restrictions of builtin calls
8149 static void handle_builtin_argument_restrictions(call_expression_t *call) {
8150 switch (call->function->builtin_symbol.symbol->ID) {
8151 case T___builtin_return_address:
8152 case T___builtin_frame_address: {
8153 /* argument must be constant */
8154 call_argument_t *argument = call->arguments;
8156 if (! is_constant_expression(argument->expression)) {
8157 errorf(&call->base.source_position,
8158 "argument of '%Y' must be a constant expression",
8159 call->function->builtin_symbol.symbol);
8163 case T___builtin_prefetch: {
8164 /* second and third argument must be constant if existent */
8165 call_argument_t *rw = call->arguments->next;
8166 call_argument_t *locality = NULL;
8169 if (! is_constant_expression(rw->expression)) {
8170 errorf(&call->base.source_position,
8171 "second argument of '%Y' must be a constant expression",
8172 call->function->builtin_symbol.symbol);
8174 locality = rw->next;
8176 if (locality != NULL) {
8177 if (! is_constant_expression(locality->expression)) {
8178 errorf(&call->base.source_position,
8179 "third argument of '%Y' must be a constant expression",
8180 call->function->builtin_symbol.symbol);
8182 locality = rw->next;
8192 * Parse a call expression, ie. expression '( ... )'.
8194 * @param expression the function address
8196 static expression_t *parse_call_expression(expression_t *expression)
8198 expression_t *result = allocate_expression_zero(EXPR_CALL);
8199 call_expression_t *call = &result->call;
8200 call->function = expression;
8202 type_t *const orig_type = expression->base.type;
8203 type_t *const type = skip_typeref(orig_type);
8205 function_type_t *function_type = NULL;
8206 if (is_type_pointer(type)) {
8207 type_t *const to_type = skip_typeref(type->pointer.points_to);
8209 if (is_type_function(to_type)) {
8210 function_type = &to_type->function;
8211 call->base.type = function_type->return_type;
8215 if (function_type == NULL && is_type_valid(type)) {
8216 errorf(HERE, "called object '%E' (type '%T') is not a pointer to a function", expression, orig_type);
8219 /* parse arguments */
8221 add_anchor_token(')');
8222 add_anchor_token(',');
8224 if (token.type != ')') {
8225 call_argument_t *last_argument = NULL;
8228 call_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
8230 argument->expression = parse_assignment_expression();
8231 if (last_argument == NULL) {
8232 call->arguments = argument;
8234 last_argument->next = argument;
8236 last_argument = argument;
8238 if (token.type != ',')
8243 rem_anchor_token(',');
8244 rem_anchor_token(')');
8245 expect(')', end_error);
8247 if (function_type == NULL)
8250 function_parameter_t *parameter = function_type->parameters;
8251 call_argument_t *argument = call->arguments;
8252 if (!function_type->unspecified_parameters) {
8253 for (unsigned pos = 0; parameter != NULL && argument != NULL;
8254 parameter = parameter->next, argument = argument->next) {
8255 check_call_argument(parameter, argument, ++pos);
8258 if (parameter != NULL) {
8259 errorf(HERE, "too few arguments to function '%E'", expression);
8260 } else if (argument != NULL && !function_type->variadic) {
8261 errorf(HERE, "too many arguments to function '%E'", expression);
8265 /* do default promotion */
8266 for (; argument != NULL; argument = argument->next) {
8267 type_t *type = argument->expression->base.type;
8269 type = get_default_promoted_type(type);
8271 argument->expression
8272 = create_implicit_cast(argument->expression, type);
8275 check_format(&result->call);
8277 if (warning.aggregate_return &&
8278 is_type_compound(skip_typeref(function_type->return_type))) {
8279 warningf(&result->base.source_position,
8280 "function call has aggregate value");
8283 if (call->function->kind == EXPR_BUILTIN_SYMBOL) {
8284 handle_builtin_argument_restrictions(&result->call);
8291 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
8293 static bool same_compound_type(const type_t *type1, const type_t *type2)
8296 is_type_compound(type1) &&
8297 type1->kind == type2->kind &&
8298 type1->compound.compound == type2->compound.compound;
8301 static expression_t const *get_reference_address(expression_t const *expr)
8303 bool regular_take_address = true;
8305 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
8306 expr = expr->unary.value;
8308 regular_take_address = false;
8311 if (expr->kind != EXPR_UNARY_DEREFERENCE)
8314 expr = expr->unary.value;
8317 if (expr->kind != EXPR_REFERENCE)
8320 /* special case for functions which are automatically converted to a
8321 * pointer to function without an extra TAKE_ADDRESS operation */
8322 if (!regular_take_address &&
8323 expr->reference.entity->kind != ENTITY_FUNCTION) {
8330 static void warn_reference_address_as_bool(expression_t const* expr)
8332 if (!warning.address)
8335 expr = get_reference_address(expr);
8337 warningf(&expr->base.source_position,
8338 "the address of '%Y' will always evaluate as 'true'",
8339 expr->reference.entity->base.symbol);
8343 static void warn_assignment_in_condition(const expression_t *const expr)
8345 if (!warning.parentheses)
8347 if (expr->base.kind != EXPR_BINARY_ASSIGN)
8349 if (expr->base.parenthesized)
8351 warningf(&expr->base.source_position,
8352 "suggest parentheses around assignment used as truth value");
8355 static void semantic_condition(expression_t const *const expr,
8356 char const *const context)
8358 type_t *const type = skip_typeref(expr->base.type);
8359 if (is_type_scalar(type)) {
8360 warn_reference_address_as_bool(expr);
8361 warn_assignment_in_condition(expr);
8362 } else if (is_type_valid(type)) {
8363 errorf(&expr->base.source_position,
8364 "%s must have scalar type", context);
8369 * Parse a conditional expression, ie. 'expression ? ... : ...'.
8371 * @param expression the conditional expression
8373 static expression_t *parse_conditional_expression(expression_t *expression)
8375 expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
8377 conditional_expression_t *conditional = &result->conditional;
8378 conditional->condition = expression;
8381 add_anchor_token(':');
8383 /* §6.5.15:2 The first operand shall have scalar type. */
8384 semantic_condition(expression, "condition of conditional operator");
8386 expression_t *true_expression = expression;
8387 bool gnu_cond = false;
8388 if (GNU_MODE && token.type == ':') {
8391 true_expression = parse_expression();
8393 rem_anchor_token(':');
8394 expect(':', end_error);
8396 expression_t *false_expression =
8397 parse_sub_expression(c_mode & _CXX ? PREC_ASSIGNMENT : PREC_CONDITIONAL);
8399 type_t *const orig_true_type = true_expression->base.type;
8400 type_t *const orig_false_type = false_expression->base.type;
8401 type_t *const true_type = skip_typeref(orig_true_type);
8402 type_t *const false_type = skip_typeref(orig_false_type);
8405 type_t *result_type;
8406 if (is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
8407 is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
8408 /* ISO/IEC 14882:1998(E) §5.16:2 */
8409 if (true_expression->kind == EXPR_UNARY_THROW) {
8410 result_type = false_type;
8411 } else if (false_expression->kind == EXPR_UNARY_THROW) {
8412 result_type = true_type;
8414 if (warning.other && (
8415 !is_type_atomic(true_type, ATOMIC_TYPE_VOID) ||
8416 !is_type_atomic(false_type, ATOMIC_TYPE_VOID)
8418 warningf(&conditional->base.source_position,
8419 "ISO C forbids conditional expression with only one void side");
8421 result_type = type_void;
8423 } else if (is_type_arithmetic(true_type)
8424 && is_type_arithmetic(false_type)) {
8425 result_type = semantic_arithmetic(true_type, false_type);
8427 true_expression = create_implicit_cast(true_expression, result_type);
8428 false_expression = create_implicit_cast(false_expression, result_type);
8430 conditional->true_expression = true_expression;
8431 conditional->false_expression = false_expression;
8432 conditional->base.type = result_type;
8433 } else if (same_compound_type(true_type, false_type)) {
8434 /* just take 1 of the 2 types */
8435 result_type = true_type;
8436 } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
8437 type_t *pointer_type;
8439 expression_t *other_expression;
8440 if (is_type_pointer(true_type) &&
8441 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
8442 pointer_type = true_type;
8443 other_type = false_type;
8444 other_expression = false_expression;
8446 pointer_type = false_type;
8447 other_type = true_type;
8448 other_expression = true_expression;
8451 if (is_null_pointer_constant(other_expression)) {
8452 result_type = pointer_type;
8453 } else if (is_type_pointer(other_type)) {
8454 type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
8455 type_t *to2 = skip_typeref(other_type->pointer.points_to);
8458 if (is_type_atomic(to1, ATOMIC_TYPE_VOID) ||
8459 is_type_atomic(to2, ATOMIC_TYPE_VOID)) {
8461 } else if (types_compatible(get_unqualified_type(to1),
8462 get_unqualified_type(to2))) {
8465 if (warning.other) {
8466 warningf(&conditional->base.source_position,
8467 "pointer types '%T' and '%T' in conditional expression are incompatible",
8468 true_type, false_type);
8473 type_t *const type =
8474 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
8475 result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
8476 } else if (is_type_integer(other_type)) {
8477 if (warning.other) {
8478 warningf(&conditional->base.source_position,
8479 "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
8481 result_type = pointer_type;
8483 if (is_type_valid(other_type)) {
8484 type_error_incompatible("while parsing conditional",
8485 &expression->base.source_position, true_type, false_type);
8487 result_type = type_error_type;
8490 if (is_type_valid(true_type) && is_type_valid(false_type)) {
8491 type_error_incompatible("while parsing conditional",
8492 &conditional->base.source_position, true_type,
8495 result_type = type_error_type;
8498 conditional->true_expression
8499 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
8500 conditional->false_expression
8501 = create_implicit_cast(false_expression, result_type);
8502 conditional->base.type = result_type;
8507 * Parse an extension expression.
8509 static expression_t *parse_extension(void)
8511 eat(T___extension__);
8513 bool old_gcc_extension = in_gcc_extension;
8514 in_gcc_extension = true;
8515 expression_t *expression = parse_sub_expression(PREC_UNARY);
8516 in_gcc_extension = old_gcc_extension;
8521 * Parse a __builtin_classify_type() expression.
8523 static expression_t *parse_builtin_classify_type(void)
8525 expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
8526 result->base.type = type_int;
8528 eat(T___builtin_classify_type);
8530 expect('(', end_error);
8531 add_anchor_token(')');
8532 expression_t *expression = parse_expression();
8533 rem_anchor_token(')');
8534 expect(')', end_error);
8535 result->classify_type.type_expression = expression;
8539 return create_invalid_expression();
8543 * Parse a delete expression
8544 * ISO/IEC 14882:1998(E) §5.3.5
8546 static expression_t *parse_delete(void)
8548 expression_t *const result = allocate_expression_zero(EXPR_UNARY_DELETE);
8549 result->base.type = type_void;
8553 if (token.type == '[') {
8555 result->kind = EXPR_UNARY_DELETE_ARRAY;
8556 expect(']', end_error);
8560 expression_t *const value = parse_sub_expression(PREC_CAST);
8561 result->unary.value = value;
8563 type_t *const type = skip_typeref(value->base.type);
8564 if (!is_type_pointer(type)) {
8565 if (is_type_valid(type)) {
8566 errorf(&value->base.source_position,
8567 "operand of delete must have pointer type");
8569 } else if (warning.other &&
8570 is_type_atomic(skip_typeref(type->pointer.points_to), ATOMIC_TYPE_VOID)) {
8571 warningf(&value->base.source_position,
8572 "deleting 'void*' is undefined");
8579 * Parse a throw expression
8580 * ISO/IEC 14882:1998(E) §15:1
8582 static expression_t *parse_throw(void)
8584 expression_t *const result = allocate_expression_zero(EXPR_UNARY_THROW);
8585 result->base.type = type_void;
8589 expression_t *value = NULL;
8590 switch (token.type) {
8592 value = parse_assignment_expression();
8593 /* ISO/IEC 14882:1998(E) §15.1:3 */
8594 type_t *const orig_type = value->base.type;
8595 type_t *const type = skip_typeref(orig_type);
8596 if (is_type_incomplete(type)) {
8597 errorf(&value->base.source_position,
8598 "cannot throw object of incomplete type '%T'", orig_type);
8599 } else if (is_type_pointer(type)) {
8600 type_t *const points_to = skip_typeref(type->pointer.points_to);
8601 if (is_type_incomplete(points_to) &&
8602 !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
8603 errorf(&value->base.source_position,
8604 "cannot throw pointer to incomplete type '%T'", orig_type);
8612 result->unary.value = value;
8617 static bool check_pointer_arithmetic(const source_position_t *source_position,
8618 type_t *pointer_type,
8619 type_t *orig_pointer_type)
8621 type_t *points_to = pointer_type->pointer.points_to;
8622 points_to = skip_typeref(points_to);
8624 if (is_type_incomplete(points_to)) {
8625 if (!GNU_MODE || !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
8626 errorf(source_position,
8627 "arithmetic with pointer to incomplete type '%T' not allowed",
8630 } else if (warning.pointer_arith) {
8631 warningf(source_position,
8632 "pointer of type '%T' used in arithmetic",
8635 } else if (is_type_function(points_to)) {
8637 errorf(source_position,
8638 "arithmetic with pointer to function type '%T' not allowed",
8641 } else if (warning.pointer_arith) {
8642 warningf(source_position,
8643 "pointer to a function '%T' used in arithmetic",
8650 static bool is_lvalue(const expression_t *expression)
8652 /* TODO: doesn't seem to be consistent with §6.3.2.1:1 */
8653 switch (expression->kind) {
8654 case EXPR_ARRAY_ACCESS:
8655 case EXPR_COMPOUND_LITERAL:
8656 case EXPR_REFERENCE:
8658 case EXPR_UNARY_DEREFERENCE:
8662 type_t *type = skip_typeref(expression->base.type);
8664 /* ISO/IEC 14882:1998(E) §3.10:3 */
8665 is_type_reference(type) ||
8666 /* Claim it is an lvalue, if the type is invalid. There was a parse
8667 * error before, which maybe prevented properly recognizing it as
8669 !is_type_valid(type);
8674 static void semantic_incdec(unary_expression_t *expression)
8676 type_t *const orig_type = expression->value->base.type;
8677 type_t *const type = skip_typeref(orig_type);
8678 if (is_type_pointer(type)) {
8679 if (!check_pointer_arithmetic(&expression->base.source_position,
8683 } else if (!is_type_real(type) && is_type_valid(type)) {
8684 /* TODO: improve error message */
8685 errorf(&expression->base.source_position,
8686 "operation needs an arithmetic or pointer type");
8689 if (!is_lvalue(expression->value)) {
8690 /* TODO: improve error message */
8691 errorf(&expression->base.source_position, "lvalue required as operand");
8693 expression->base.type = orig_type;
8696 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
8698 type_t *const orig_type = expression->value->base.type;
8699 type_t *const type = skip_typeref(orig_type);
8700 if (!is_type_arithmetic(type)) {
8701 if (is_type_valid(type)) {
8702 /* TODO: improve error message */
8703 errorf(&expression->base.source_position,
8704 "operation needs an arithmetic type");
8709 expression->base.type = orig_type;
8712 static void semantic_unexpr_plus(unary_expression_t *expression)
8714 semantic_unexpr_arithmetic(expression);
8715 if (warning.traditional)
8716 warningf(&expression->base.source_position,
8717 "traditional C rejects the unary plus operator");
8720 static void semantic_not(unary_expression_t *expression)
8722 /* §6.5.3.3:1 The operand [...] of the ! operator, scalar type. */
8723 semantic_condition(expression->value, "operand of !");
8724 expression->base.type = c_mode & _CXX ? type_bool : type_int;
8727 static void semantic_unexpr_integer(unary_expression_t *expression)
8729 type_t *const orig_type = expression->value->base.type;
8730 type_t *const type = skip_typeref(orig_type);
8731 if (!is_type_integer(type)) {
8732 if (is_type_valid(type)) {
8733 errorf(&expression->base.source_position,
8734 "operand of ~ must be of integer type");
8739 expression->base.type = orig_type;
8742 static void semantic_dereference(unary_expression_t *expression)
8744 type_t *const orig_type = expression->value->base.type;
8745 type_t *const type = skip_typeref(orig_type);
8746 if (!is_type_pointer(type)) {
8747 if (is_type_valid(type)) {
8748 errorf(&expression->base.source_position,
8749 "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
8754 type_t *result_type = type->pointer.points_to;
8755 result_type = automatic_type_conversion(result_type);
8756 expression->base.type = result_type;
8760 * Record that an address is taken (expression represents an lvalue).
8762 * @param expression the expression
8763 * @param may_be_register if true, the expression might be an register
8765 static void set_address_taken(expression_t *expression, bool may_be_register)
8767 if (expression->kind != EXPR_REFERENCE)
8770 entity_t *const entity = expression->reference.entity;
8772 if (entity->kind != ENTITY_VARIABLE && entity->kind != ENTITY_PARAMETER)
8775 if (entity->declaration.storage_class == STORAGE_CLASS_REGISTER
8776 && !may_be_register) {
8777 errorf(&expression->base.source_position,
8778 "address of register %s '%Y' requested",
8779 get_entity_kind_name(entity->kind), entity->base.symbol);
8782 if (entity->kind == ENTITY_VARIABLE) {
8783 entity->variable.address_taken = true;
8785 assert(entity->kind == ENTITY_PARAMETER);
8786 entity->parameter.address_taken = true;
8791 * Check the semantic of the address taken expression.
8793 static void semantic_take_addr(unary_expression_t *expression)
8795 expression_t *value = expression->value;
8796 value->base.type = revert_automatic_type_conversion(value);
8798 type_t *orig_type = value->base.type;
8799 type_t *type = skip_typeref(orig_type);
8800 if (!is_type_valid(type))
8804 if (!is_lvalue(value)) {
8805 errorf(&expression->base.source_position, "'&' requires an lvalue");
8807 if (type->kind == TYPE_BITFIELD) {
8808 errorf(&expression->base.source_position,
8809 "'&' not allowed on object with bitfield type '%T'",
8813 set_address_taken(value, false);
8815 expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
8818 #define CREATE_UNARY_EXPRESSION_PARSER(token_type, unexpression_type, sfunc) \
8819 static expression_t *parse_##unexpression_type(void) \
8821 expression_t *unary_expression \
8822 = allocate_expression_zero(unexpression_type); \
8824 unary_expression->unary.value = parse_sub_expression(PREC_UNARY); \
8826 sfunc(&unary_expression->unary); \
8828 return unary_expression; \
8831 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
8832 semantic_unexpr_arithmetic)
8833 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
8834 semantic_unexpr_plus)
8835 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
8837 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
8838 semantic_dereference)
8839 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
8841 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
8842 semantic_unexpr_integer)
8843 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS, EXPR_UNARY_PREFIX_INCREMENT,
8845 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
8848 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_type, unexpression_type, \
8850 static expression_t *parse_##unexpression_type(expression_t *left) \
8852 expression_t *unary_expression \
8853 = allocate_expression_zero(unexpression_type); \
8855 unary_expression->unary.value = left; \
8857 sfunc(&unary_expression->unary); \
8859 return unary_expression; \
8862 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
8863 EXPR_UNARY_POSTFIX_INCREMENT,
8865 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
8866 EXPR_UNARY_POSTFIX_DECREMENT,
8869 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
8871 /* TODO: handle complex + imaginary types */
8873 type_left = get_unqualified_type(type_left);
8874 type_right = get_unqualified_type(type_right);
8876 /* §6.3.1.8 Usual arithmetic conversions */
8877 if (type_left == type_long_double || type_right == type_long_double) {
8878 return type_long_double;
8879 } else if (type_left == type_double || type_right == type_double) {
8881 } else if (type_left == type_float || type_right == type_float) {
8885 type_left = promote_integer(type_left);
8886 type_right = promote_integer(type_right);
8888 if (type_left == type_right)
8891 bool const signed_left = is_type_signed(type_left);
8892 bool const signed_right = is_type_signed(type_right);
8893 int const rank_left = get_rank(type_left);
8894 int const rank_right = get_rank(type_right);
8896 if (signed_left == signed_right)
8897 return rank_left >= rank_right ? type_left : type_right;
8906 u_rank = rank_right;
8907 u_type = type_right;
8909 s_rank = rank_right;
8910 s_type = type_right;
8915 if (u_rank >= s_rank)
8918 /* casting rank to atomic_type_kind is a bit hacky, but makes things
8920 if (get_atomic_type_size((atomic_type_kind_t) s_rank)
8921 > get_atomic_type_size((atomic_type_kind_t) u_rank))
8925 case ATOMIC_TYPE_INT: return type_unsigned_int;
8926 case ATOMIC_TYPE_LONG: return type_unsigned_long;
8927 case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
8929 default: panic("invalid atomic type");
8934 * Check the semantic restrictions for a binary expression.
8936 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
8938 expression_t *const left = expression->left;
8939 expression_t *const right = expression->right;
8940 type_t *const orig_type_left = left->base.type;
8941 type_t *const orig_type_right = right->base.type;
8942 type_t *const type_left = skip_typeref(orig_type_left);
8943 type_t *const type_right = skip_typeref(orig_type_right);
8945 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8946 /* TODO: improve error message */
8947 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8948 errorf(&expression->base.source_position,
8949 "operation needs arithmetic types");
8954 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8955 expression->left = create_implicit_cast(left, arithmetic_type);
8956 expression->right = create_implicit_cast(right, arithmetic_type);
8957 expression->base.type = arithmetic_type;
8960 static void warn_div_by_zero(binary_expression_t const *const expression)
8962 if (!warning.div_by_zero ||
8963 !is_type_integer(expression->base.type))
8966 expression_t const *const right = expression->right;
8967 /* The type of the right operand can be different for /= */
8968 if (is_type_integer(right->base.type) &&
8969 is_constant_expression(right) &&
8970 fold_constant(right) == 0) {
8971 warningf(&expression->base.source_position, "division by zero");
8976 * Check the semantic restrictions for a div/mod expression.
8978 static void semantic_divmod_arithmetic(binary_expression_t *expression)
8980 semantic_binexpr_arithmetic(expression);
8981 warn_div_by_zero(expression);
8984 static void warn_addsub_in_shift(const expression_t *const expr)
8986 if (expr->base.parenthesized)
8990 switch (expr->kind) {
8991 case EXPR_BINARY_ADD: op = '+'; break;
8992 case EXPR_BINARY_SUB: op = '-'; break;
8996 warningf(&expr->base.source_position,
8997 "suggest parentheses around '%c' inside shift", op);
9000 static void semantic_shift_op(binary_expression_t *expression)
9002 expression_t *const left = expression->left;
9003 expression_t *const right = expression->right;
9004 type_t *const orig_type_left = left->base.type;
9005 type_t *const orig_type_right = right->base.type;
9006 type_t * type_left = skip_typeref(orig_type_left);
9007 type_t * type_right = skip_typeref(orig_type_right);
9009 if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
9010 /* TODO: improve error message */
9011 if (is_type_valid(type_left) && is_type_valid(type_right)) {
9012 errorf(&expression->base.source_position,
9013 "operands of shift operation must have integer types");
9018 if (warning.parentheses) {
9019 warn_addsub_in_shift(left);
9020 warn_addsub_in_shift(right);
9023 type_left = promote_integer(type_left);
9024 type_right = promote_integer(type_right);
9026 expression->left = create_implicit_cast(left, type_left);
9027 expression->right = create_implicit_cast(right, type_right);
9028 expression->base.type = type_left;
9031 static void semantic_add(binary_expression_t *expression)
9033 expression_t *const left = expression->left;
9034 expression_t *const right = expression->right;
9035 type_t *const orig_type_left = left->base.type;
9036 type_t *const orig_type_right = right->base.type;
9037 type_t *const type_left = skip_typeref(orig_type_left);
9038 type_t *const type_right = skip_typeref(orig_type_right);
9041 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
9042 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
9043 expression->left = create_implicit_cast(left, arithmetic_type);
9044 expression->right = create_implicit_cast(right, arithmetic_type);
9045 expression->base.type = arithmetic_type;
9046 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
9047 check_pointer_arithmetic(&expression->base.source_position,
9048 type_left, orig_type_left);
9049 expression->base.type = type_left;
9050 } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
9051 check_pointer_arithmetic(&expression->base.source_position,
9052 type_right, orig_type_right);
9053 expression->base.type = type_right;
9054 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
9055 errorf(&expression->base.source_position,
9056 "invalid operands to binary + ('%T', '%T')",
9057 orig_type_left, orig_type_right);
9061 static void semantic_sub(binary_expression_t *expression)
9063 expression_t *const left = expression->left;
9064 expression_t *const right = expression->right;
9065 type_t *const orig_type_left = left->base.type;
9066 type_t *const orig_type_right = right->base.type;
9067 type_t *const type_left = skip_typeref(orig_type_left);
9068 type_t *const type_right = skip_typeref(orig_type_right);
9069 source_position_t const *const pos = &expression->base.source_position;
9072 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
9073 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
9074 expression->left = create_implicit_cast(left, arithmetic_type);
9075 expression->right = create_implicit_cast(right, arithmetic_type);
9076 expression->base.type = arithmetic_type;
9077 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
9078 check_pointer_arithmetic(&expression->base.source_position,
9079 type_left, orig_type_left);
9080 expression->base.type = type_left;
9081 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
9082 type_t *const unqual_left = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
9083 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
9084 if (!types_compatible(unqual_left, unqual_right)) {
9086 "subtracting pointers to incompatible types '%T' and '%T'",
9087 orig_type_left, orig_type_right);
9088 } else if (!is_type_object(unqual_left)) {
9089 if (!is_type_atomic(unqual_left, ATOMIC_TYPE_VOID)) {
9090 errorf(pos, "subtracting pointers to non-object types '%T'",
9092 } else if (warning.other) {
9093 warningf(pos, "subtracting pointers to void");
9096 expression->base.type = type_ptrdiff_t;
9097 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
9098 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
9099 orig_type_left, orig_type_right);
9103 static void warn_string_literal_address(expression_t const* expr)
9105 while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
9106 expr = expr->unary.value;
9107 if (expr->kind != EXPR_UNARY_DEREFERENCE)
9109 expr = expr->unary.value;
9112 if (expr->kind == EXPR_STRING_LITERAL ||
9113 expr->kind == EXPR_WIDE_STRING_LITERAL) {
9114 warningf(&expr->base.source_position,
9115 "comparison with string literal results in unspecified behaviour");
9119 static void warn_comparison_in_comparison(const expression_t *const expr)
9121 if (expr->base.parenthesized)
9123 switch (expr->base.kind) {
9124 case EXPR_BINARY_LESS:
9125 case EXPR_BINARY_GREATER:
9126 case EXPR_BINARY_LESSEQUAL:
9127 case EXPR_BINARY_GREATEREQUAL:
9128 case EXPR_BINARY_NOTEQUAL:
9129 case EXPR_BINARY_EQUAL:
9130 warningf(&expr->base.source_position,
9131 "comparisons like 'x <= y < z' do not have their mathematical meaning");
9138 static bool maybe_negative(expression_t const *const expr)
9141 !is_constant_expression(expr) ||
9142 fold_constant(expr) < 0;
9146 * Check the semantics of comparison expressions.
9148 * @param expression The expression to check.
9150 static void semantic_comparison(binary_expression_t *expression)
9152 expression_t *left = expression->left;
9153 expression_t *right = expression->right;
9155 if (warning.address) {
9156 warn_string_literal_address(left);
9157 warn_string_literal_address(right);
9159 expression_t const* const func_left = get_reference_address(left);
9160 if (func_left != NULL && is_null_pointer_constant(right)) {
9161 warningf(&expression->base.source_position,
9162 "the address of '%Y' will never be NULL",
9163 func_left->reference.entity->base.symbol);
9166 expression_t const* const func_right = get_reference_address(right);
9167 if (func_right != NULL && is_null_pointer_constant(right)) {
9168 warningf(&expression->base.source_position,
9169 "the address of '%Y' will never be NULL",
9170 func_right->reference.entity->base.symbol);
9174 if (warning.parentheses) {
9175 warn_comparison_in_comparison(left);
9176 warn_comparison_in_comparison(right);
9179 type_t *orig_type_left = left->base.type;
9180 type_t *orig_type_right = right->base.type;
9181 type_t *type_left = skip_typeref(orig_type_left);
9182 type_t *type_right = skip_typeref(orig_type_right);
9184 /* TODO non-arithmetic types */
9185 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
9186 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
9188 /* test for signed vs unsigned compares */
9189 if (warning.sign_compare && is_type_integer(arithmetic_type)) {
9190 bool const signed_left = is_type_signed(type_left);
9191 bool const signed_right = is_type_signed(type_right);
9192 if (signed_left != signed_right) {
9193 /* FIXME long long needs better const folding magic */
9194 /* TODO check whether constant value can be represented by other type */
9195 if ((signed_left && maybe_negative(left)) ||
9196 (signed_right && maybe_negative(right))) {
9197 warningf(&expression->base.source_position,
9198 "comparison between signed and unsigned");
9203 expression->left = create_implicit_cast(left, arithmetic_type);
9204 expression->right = create_implicit_cast(right, arithmetic_type);
9205 expression->base.type = arithmetic_type;
9206 if (warning.float_equal &&
9207 (expression->base.kind == EXPR_BINARY_EQUAL ||
9208 expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
9209 is_type_float(arithmetic_type)) {
9210 warningf(&expression->base.source_position,
9211 "comparing floating point with == or != is unsafe");
9213 } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
9214 /* TODO check compatibility */
9215 } else if (is_type_pointer(type_left)) {
9216 expression->right = create_implicit_cast(right, type_left);
9217 } else if (is_type_pointer(type_right)) {
9218 expression->left = create_implicit_cast(left, type_right);
9219 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
9220 type_error_incompatible("invalid operands in comparison",
9221 &expression->base.source_position,
9222 type_left, type_right);
9224 expression->base.type = c_mode & _CXX ? type_bool : type_int;
9228 * Checks if a compound type has constant fields.
9230 static bool has_const_fields(const compound_type_t *type)
9232 compound_t *compound = type->compound;
9233 entity_t *entry = compound->members.entities;
9235 for (; entry != NULL; entry = entry->base.next) {
9236 if (!is_declaration(entry))
9239 const type_t *decl_type = skip_typeref(entry->declaration.type);
9240 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
9247 static bool is_valid_assignment_lhs(expression_t const* const left)
9249 type_t *const orig_type_left = revert_automatic_type_conversion(left);
9250 type_t *const type_left = skip_typeref(orig_type_left);
9252 if (!is_lvalue(left)) {
9253 errorf(HERE, "left hand side '%E' of assignment is not an lvalue",
9258 if (left->kind == EXPR_REFERENCE
9259 && left->reference.entity->kind == ENTITY_FUNCTION) {
9260 errorf(HERE, "cannot assign to function '%E'", left);
9264 if (is_type_array(type_left)) {
9265 errorf(HERE, "cannot assign to array '%E'", left);
9268 if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
9269 errorf(HERE, "assignment to readonly location '%E' (type '%T')", left,
9273 if (is_type_incomplete(type_left)) {
9274 errorf(HERE, "left-hand side '%E' of assignment has incomplete type '%T'",
9275 left, orig_type_left);
9278 if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
9279 errorf(HERE, "cannot assign to '%E' because compound type '%T' has readonly fields",
9280 left, orig_type_left);
9287 static void semantic_arithmetic_assign(binary_expression_t *expression)
9289 expression_t *left = expression->left;
9290 expression_t *right = expression->right;
9291 type_t *orig_type_left = left->base.type;
9292 type_t *orig_type_right = right->base.type;
9294 if (!is_valid_assignment_lhs(left))
9297 type_t *type_left = skip_typeref(orig_type_left);
9298 type_t *type_right = skip_typeref(orig_type_right);
9300 if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
9301 /* TODO: improve error message */
9302 if (is_type_valid(type_left) && is_type_valid(type_right)) {
9303 errorf(&expression->base.source_position,
9304 "operation needs arithmetic types");
9309 /* combined instructions are tricky. We can't create an implicit cast on
9310 * the left side, because we need the uncasted form for the store.
9311 * The ast2firm pass has to know that left_type must be right_type
9312 * for the arithmetic operation and create a cast by itself */
9313 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
9314 expression->right = create_implicit_cast(right, arithmetic_type);
9315 expression->base.type = type_left;
9318 static void semantic_divmod_assign(binary_expression_t *expression)
9320 semantic_arithmetic_assign(expression);
9321 warn_div_by_zero(expression);
9324 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
9326 expression_t *const left = expression->left;
9327 expression_t *const right = expression->right;
9328 type_t *const orig_type_left = left->base.type;
9329 type_t *const orig_type_right = right->base.type;
9330 type_t *const type_left = skip_typeref(orig_type_left);
9331 type_t *const type_right = skip_typeref(orig_type_right);
9333 if (!is_valid_assignment_lhs(left))
9336 if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
9337 /* combined instructions are tricky. We can't create an implicit cast on
9338 * the left side, because we need the uncasted form for the store.
9339 * The ast2firm pass has to know that left_type must be right_type
9340 * for the arithmetic operation and create a cast by itself */
9341 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
9342 expression->right = create_implicit_cast(right, arithmetic_type);
9343 expression->base.type = type_left;
9344 } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
9345 check_pointer_arithmetic(&expression->base.source_position,
9346 type_left, orig_type_left);
9347 expression->base.type = type_left;
9348 } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
9349 errorf(&expression->base.source_position,
9350 "incompatible types '%T' and '%T' in assignment",
9351 orig_type_left, orig_type_right);
9355 static void warn_logical_and_within_or(const expression_t *const expr)
9357 if (expr->base.kind != EXPR_BINARY_LOGICAL_AND)
9359 if (expr->base.parenthesized)
9361 warningf(&expr->base.source_position,
9362 "suggest parentheses around && within ||");
9366 * Check the semantic restrictions of a logical expression.
9368 static void semantic_logical_op(binary_expression_t *expression)
9370 /* §6.5.13:2 Each of the operands shall have scalar type.
9371 * §6.5.14:2 Each of the operands shall have scalar type. */
9372 semantic_condition(expression->left, "left operand of logical operator");
9373 semantic_condition(expression->right, "right operand of logical operator");
9374 if (expression->base.kind == EXPR_BINARY_LOGICAL_OR &&
9375 warning.parentheses) {
9376 warn_logical_and_within_or(expression->left);
9377 warn_logical_and_within_or(expression->right);
9379 expression->base.type = c_mode & _CXX ? type_bool : type_int;
9383 * Check the semantic restrictions of a binary assign expression.
9385 static void semantic_binexpr_assign(binary_expression_t *expression)
9387 expression_t *left = expression->left;
9388 type_t *orig_type_left = left->base.type;
9390 if (!is_valid_assignment_lhs(left))
9393 assign_error_t error = semantic_assign(orig_type_left, expression->right);
9394 report_assign_error(error, orig_type_left, expression->right,
9395 "assignment", &left->base.source_position);
9396 expression->right = create_implicit_cast(expression->right, orig_type_left);
9397 expression->base.type = orig_type_left;
9401 * Determine if the outermost operation (or parts thereof) of the given
9402 * expression has no effect in order to generate a warning about this fact.
9403 * Therefore in some cases this only examines some of the operands of the
9404 * expression (see comments in the function and examples below).
9406 * f() + 23; // warning, because + has no effect
9407 * x || f(); // no warning, because x controls execution of f()
9408 * x ? y : f(); // warning, because y has no effect
9409 * (void)x; // no warning to be able to suppress the warning
9410 * This function can NOT be used for an "expression has definitely no effect"-
9412 static bool expression_has_effect(const expression_t *const expr)
9414 switch (expr->kind) {
9415 case EXPR_UNKNOWN: break;
9416 case EXPR_INVALID: return true; /* do NOT warn */
9417 case EXPR_REFERENCE: return false;
9418 case EXPR_REFERENCE_ENUM_VALUE: return false;
9419 /* suppress the warning for microsoft __noop operations */
9420 case EXPR_CONST: return expr->conste.is_ms_noop;
9421 case EXPR_CHARACTER_CONSTANT: return false;
9422 case EXPR_WIDE_CHARACTER_CONSTANT: return false;
9423 case EXPR_STRING_LITERAL: return false;
9424 case EXPR_WIDE_STRING_LITERAL: return false;
9425 case EXPR_LABEL_ADDRESS: return false;
9428 const call_expression_t *const call = &expr->call;
9429 if (call->function->kind != EXPR_BUILTIN_SYMBOL)
9432 switch (call->function->builtin_symbol.symbol->ID) {
9433 case T___builtin_prefetch:
9434 case T___builtin_va_end: return true;
9435 default: return false;
9439 /* Generate the warning if either the left or right hand side of a
9440 * conditional expression has no effect */
9441 case EXPR_CONDITIONAL: {
9442 conditional_expression_t const *const cond = &expr->conditional;
9443 expression_t const *const t = cond->true_expression;
9445 (t == NULL || expression_has_effect(t)) &&
9446 expression_has_effect(cond->false_expression);
9449 case EXPR_SELECT: return false;
9450 case EXPR_ARRAY_ACCESS: return false;
9451 case EXPR_SIZEOF: return false;
9452 case EXPR_CLASSIFY_TYPE: return false;
9453 case EXPR_ALIGNOF: return false;
9455 case EXPR_FUNCNAME: return false;
9456 case EXPR_BUILTIN_SYMBOL: break; /* handled in EXPR_CALL */
9457 case EXPR_BUILTIN_CONSTANT_P: return false;
9458 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return false;
9459 case EXPR_OFFSETOF: return false;
9460 case EXPR_VA_START: return true;
9461 case EXPR_VA_ARG: return true;
9462 case EXPR_STATEMENT: return true; // TODO
9463 case EXPR_COMPOUND_LITERAL: return false;
9465 case EXPR_UNARY_NEGATE: return false;
9466 case EXPR_UNARY_PLUS: return false;
9467 case EXPR_UNARY_BITWISE_NEGATE: return false;
9468 case EXPR_UNARY_NOT: return false;
9469 case EXPR_UNARY_DEREFERENCE: return false;
9470 case EXPR_UNARY_TAKE_ADDRESS: return false;
9471 case EXPR_UNARY_POSTFIX_INCREMENT: return true;
9472 case EXPR_UNARY_POSTFIX_DECREMENT: return true;
9473 case EXPR_UNARY_PREFIX_INCREMENT: return true;
9474 case EXPR_UNARY_PREFIX_DECREMENT: return true;
9476 /* Treat void casts as if they have an effect in order to being able to
9477 * suppress the warning */
9478 case EXPR_UNARY_CAST: {
9479 type_t *const type = skip_typeref(expr->base.type);
9480 return is_type_atomic(type, ATOMIC_TYPE_VOID);
9483 case EXPR_UNARY_CAST_IMPLICIT: return true;
9484 case EXPR_UNARY_ASSUME: return true;
9485 case EXPR_UNARY_DELETE: return true;
9486 case EXPR_UNARY_DELETE_ARRAY: return true;
9487 case EXPR_UNARY_THROW: return true;
9489 case EXPR_BINARY_ADD: return false;
9490 case EXPR_BINARY_SUB: return false;
9491 case EXPR_BINARY_MUL: return false;
9492 case EXPR_BINARY_DIV: return false;
9493 case EXPR_BINARY_MOD: return false;
9494 case EXPR_BINARY_EQUAL: return false;
9495 case EXPR_BINARY_NOTEQUAL: return false;
9496 case EXPR_BINARY_LESS: return false;
9497 case EXPR_BINARY_LESSEQUAL: return false;
9498 case EXPR_BINARY_GREATER: return false;
9499 case EXPR_BINARY_GREATEREQUAL: return false;
9500 case EXPR_BINARY_BITWISE_AND: return false;
9501 case EXPR_BINARY_BITWISE_OR: return false;
9502 case EXPR_BINARY_BITWISE_XOR: return false;
9503 case EXPR_BINARY_SHIFTLEFT: return false;
9504 case EXPR_BINARY_SHIFTRIGHT: return false;
9505 case EXPR_BINARY_ASSIGN: return true;
9506 case EXPR_BINARY_MUL_ASSIGN: return true;
9507 case EXPR_BINARY_DIV_ASSIGN: return true;
9508 case EXPR_BINARY_MOD_ASSIGN: return true;
9509 case EXPR_BINARY_ADD_ASSIGN: return true;
9510 case EXPR_BINARY_SUB_ASSIGN: return true;
9511 case EXPR_BINARY_SHIFTLEFT_ASSIGN: return true;
9512 case EXPR_BINARY_SHIFTRIGHT_ASSIGN: return true;
9513 case EXPR_BINARY_BITWISE_AND_ASSIGN: return true;
9514 case EXPR_BINARY_BITWISE_XOR_ASSIGN: return true;
9515 case EXPR_BINARY_BITWISE_OR_ASSIGN: return true;
9517 /* Only examine the right hand side of && and ||, because the left hand
9518 * side already has the effect of controlling the execution of the right
9520 case EXPR_BINARY_LOGICAL_AND:
9521 case EXPR_BINARY_LOGICAL_OR:
9522 /* Only examine the right hand side of a comma expression, because the left
9523 * hand side has a separate warning */
9524 case EXPR_BINARY_COMMA:
9525 return expression_has_effect(expr->binary.right);
9527 case EXPR_BINARY_ISGREATER: return false;
9528 case EXPR_BINARY_ISGREATEREQUAL: return false;
9529 case EXPR_BINARY_ISLESS: return false;
9530 case EXPR_BINARY_ISLESSEQUAL: return false;
9531 case EXPR_BINARY_ISLESSGREATER: return false;
9532 case EXPR_BINARY_ISUNORDERED: return false;
9535 internal_errorf(HERE, "unexpected expression");
9538 static void semantic_comma(binary_expression_t *expression)
9540 if (warning.unused_value) {
9541 const expression_t *const left = expression->left;
9542 if (!expression_has_effect(left)) {
9543 warningf(&left->base.source_position,
9544 "left-hand operand of comma expression has no effect");
9547 expression->base.type = expression->right->base.type;
9551 * @param prec_r precedence of the right operand
9553 #define CREATE_BINEXPR_PARSER(token_type, binexpression_type, prec_r, sfunc) \
9554 static expression_t *parse_##binexpression_type(expression_t *left) \
9556 expression_t *binexpr = allocate_expression_zero(binexpression_type); \
9557 binexpr->binary.left = left; \
9560 expression_t *right = parse_sub_expression(prec_r); \
9562 binexpr->binary.right = right; \
9563 sfunc(&binexpr->binary); \
9568 CREATE_BINEXPR_PARSER('*', EXPR_BINARY_MUL, PREC_CAST, semantic_binexpr_arithmetic)
9569 CREATE_BINEXPR_PARSER('/', EXPR_BINARY_DIV, PREC_CAST, semantic_divmod_arithmetic)
9570 CREATE_BINEXPR_PARSER('%', EXPR_BINARY_MOD, PREC_CAST, semantic_divmod_arithmetic)
9571 CREATE_BINEXPR_PARSER('+', EXPR_BINARY_ADD, PREC_MULTIPLICATIVE, semantic_add)
9572 CREATE_BINEXPR_PARSER('-', EXPR_BINARY_SUB, PREC_MULTIPLICATIVE, semantic_sub)
9573 CREATE_BINEXPR_PARSER(T_LESSLESS, EXPR_BINARY_SHIFTLEFT, PREC_ADDITIVE, semantic_shift_op)
9574 CREATE_BINEXPR_PARSER(T_GREATERGREATER, EXPR_BINARY_SHIFTRIGHT, PREC_ADDITIVE, semantic_shift_op)
9575 CREATE_BINEXPR_PARSER('<', EXPR_BINARY_LESS, PREC_SHIFT, semantic_comparison)
9576 CREATE_BINEXPR_PARSER('>', EXPR_BINARY_GREATER, PREC_SHIFT, semantic_comparison)
9577 CREATE_BINEXPR_PARSER(T_LESSEQUAL, EXPR_BINARY_LESSEQUAL, PREC_SHIFT, semantic_comparison)
9578 CREATE_BINEXPR_PARSER(T_GREATEREQUAL, EXPR_BINARY_GREATEREQUAL, PREC_SHIFT, semantic_comparison)
9579 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL, PREC_RELATIONAL, semantic_comparison)
9580 CREATE_BINEXPR_PARSER(T_EQUALEQUAL, EXPR_BINARY_EQUAL, PREC_RELATIONAL, semantic_comparison)
9581 CREATE_BINEXPR_PARSER('&', EXPR_BINARY_BITWISE_AND, PREC_EQUALITY, semantic_binexpr_arithmetic)
9582 CREATE_BINEXPR_PARSER('^', EXPR_BINARY_BITWISE_XOR, PREC_AND, semantic_binexpr_arithmetic)
9583 CREATE_BINEXPR_PARSER('|', EXPR_BINARY_BITWISE_OR, PREC_XOR, semantic_binexpr_arithmetic)
9584 CREATE_BINEXPR_PARSER(T_ANDAND, EXPR_BINARY_LOGICAL_AND, PREC_OR, semantic_logical_op)
9585 CREATE_BINEXPR_PARSER(T_PIPEPIPE, EXPR_BINARY_LOGICAL_OR, PREC_LOGICAL_AND, semantic_logical_op)
9586 CREATE_BINEXPR_PARSER('=', EXPR_BINARY_ASSIGN, PREC_ASSIGNMENT, semantic_binexpr_assign)
9587 CREATE_BINEXPR_PARSER(T_PLUSEQUAL, EXPR_BINARY_ADD_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
9588 CREATE_BINEXPR_PARSER(T_MINUSEQUAL, EXPR_BINARY_SUB_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_addsubb_assign)
9589 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL, EXPR_BINARY_MUL_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
9590 CREATE_BINEXPR_PARSER(T_SLASHEQUAL, EXPR_BINARY_DIV_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
9591 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL, EXPR_BINARY_MOD_ASSIGN, PREC_ASSIGNMENT, semantic_divmod_assign)
9592 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL, EXPR_BINARY_SHIFTLEFT_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
9593 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL, EXPR_BINARY_SHIFTRIGHT_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
9594 CREATE_BINEXPR_PARSER(T_ANDEQUAL, EXPR_BINARY_BITWISE_AND_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
9595 CREATE_BINEXPR_PARSER(T_PIPEEQUAL, EXPR_BINARY_BITWISE_OR_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
9596 CREATE_BINEXPR_PARSER(T_CARETEQUAL, EXPR_BINARY_BITWISE_XOR_ASSIGN, PREC_ASSIGNMENT, semantic_arithmetic_assign)
9597 CREATE_BINEXPR_PARSER(',', EXPR_BINARY_COMMA, PREC_ASSIGNMENT, semantic_comma)
9600 static expression_t *parse_sub_expression(precedence_t precedence)
9602 if (token.type < 0) {
9603 return expected_expression_error();
9606 expression_parser_function_t *parser
9607 = &expression_parsers[token.type];
9608 source_position_t source_position = token.source_position;
9611 if (parser->parser != NULL) {
9612 left = parser->parser();
9614 left = parse_primary_expression();
9616 assert(left != NULL);
9617 left->base.source_position = source_position;
9620 if (token.type < 0) {
9621 return expected_expression_error();
9624 parser = &expression_parsers[token.type];
9625 if (parser->infix_parser == NULL)
9627 if (parser->infix_precedence < precedence)
9630 left = parser->infix_parser(left);
9632 assert(left != NULL);
9633 assert(left->kind != EXPR_UNKNOWN);
9634 left->base.source_position = source_position;
9641 * Parse an expression.
9643 static expression_t *parse_expression(void)
9645 return parse_sub_expression(PREC_EXPRESSION);
9649 * Register a parser for a prefix-like operator.
9651 * @param parser the parser function
9652 * @param token_type the token type of the prefix token
9654 static void register_expression_parser(parse_expression_function parser,
9657 expression_parser_function_t *entry = &expression_parsers[token_type];
9659 if (entry->parser != NULL) {
9660 diagnosticf("for token '%k'\n", (token_type_t)token_type);
9661 panic("trying to register multiple expression parsers for a token");
9663 entry->parser = parser;
9667 * Register a parser for an infix operator with given precedence.
9669 * @param parser the parser function
9670 * @param token_type the token type of the infix operator
9671 * @param precedence the precedence of the operator
9673 static void register_infix_parser(parse_expression_infix_function parser,
9674 int token_type, precedence_t precedence)
9676 expression_parser_function_t *entry = &expression_parsers[token_type];
9678 if (entry->infix_parser != NULL) {
9679 diagnosticf("for token '%k'\n", (token_type_t)token_type);
9680 panic("trying to register multiple infix expression parsers for a "
9683 entry->infix_parser = parser;
9684 entry->infix_precedence = precedence;
9688 * Initialize the expression parsers.
9690 static void init_expression_parsers(void)
9692 memset(&expression_parsers, 0, sizeof(expression_parsers));
9694 register_infix_parser(parse_array_expression, '[', PREC_POSTFIX);
9695 register_infix_parser(parse_call_expression, '(', PREC_POSTFIX);
9696 register_infix_parser(parse_select_expression, '.', PREC_POSTFIX);
9697 register_infix_parser(parse_select_expression, T_MINUSGREATER, PREC_POSTFIX);
9698 register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT, T_PLUSPLUS, PREC_POSTFIX);
9699 register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT, T_MINUSMINUS, PREC_POSTFIX);
9700 register_infix_parser(parse_EXPR_BINARY_MUL, '*', PREC_MULTIPLICATIVE);
9701 register_infix_parser(parse_EXPR_BINARY_DIV, '/', PREC_MULTIPLICATIVE);
9702 register_infix_parser(parse_EXPR_BINARY_MOD, '%', PREC_MULTIPLICATIVE);
9703 register_infix_parser(parse_EXPR_BINARY_ADD, '+', PREC_ADDITIVE);
9704 register_infix_parser(parse_EXPR_BINARY_SUB, '-', PREC_ADDITIVE);
9705 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT, T_LESSLESS, PREC_SHIFT);
9706 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT, T_GREATERGREATER, PREC_SHIFT);
9707 register_infix_parser(parse_EXPR_BINARY_LESS, '<', PREC_RELATIONAL);
9708 register_infix_parser(parse_EXPR_BINARY_GREATER, '>', PREC_RELATIONAL);
9709 register_infix_parser(parse_EXPR_BINARY_LESSEQUAL, T_LESSEQUAL, PREC_RELATIONAL);
9710 register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL, T_GREATEREQUAL, PREC_RELATIONAL);
9711 register_infix_parser(parse_EXPR_BINARY_EQUAL, T_EQUALEQUAL, PREC_EQUALITY);
9712 register_infix_parser(parse_EXPR_BINARY_NOTEQUAL, T_EXCLAMATIONMARKEQUAL, PREC_EQUALITY);
9713 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND, '&', PREC_AND);
9714 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR, '^', PREC_XOR);
9715 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR, '|', PREC_OR);
9716 register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND, T_ANDAND, PREC_LOGICAL_AND);
9717 register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR, T_PIPEPIPE, PREC_LOGICAL_OR);
9718 register_infix_parser(parse_conditional_expression, '?', PREC_CONDITIONAL);
9719 register_infix_parser(parse_EXPR_BINARY_ASSIGN, '=', PREC_ASSIGNMENT);
9720 register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN, T_PLUSEQUAL, PREC_ASSIGNMENT);
9721 register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN, T_MINUSEQUAL, PREC_ASSIGNMENT);
9722 register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN, T_ASTERISKEQUAL, PREC_ASSIGNMENT);
9723 register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN, T_SLASHEQUAL, PREC_ASSIGNMENT);
9724 register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN, T_PERCENTEQUAL, PREC_ASSIGNMENT);
9725 register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN, T_LESSLESSEQUAL, PREC_ASSIGNMENT);
9726 register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN, T_GREATERGREATEREQUAL, PREC_ASSIGNMENT);
9727 register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN, T_ANDEQUAL, PREC_ASSIGNMENT);
9728 register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN, T_PIPEEQUAL, PREC_ASSIGNMENT);
9729 register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN, T_CARETEQUAL, PREC_ASSIGNMENT);
9730 register_infix_parser(parse_EXPR_BINARY_COMMA, ',', PREC_EXPRESSION);
9732 register_expression_parser(parse_EXPR_UNARY_NEGATE, '-');
9733 register_expression_parser(parse_EXPR_UNARY_PLUS, '+');
9734 register_expression_parser(parse_EXPR_UNARY_NOT, '!');
9735 register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE, '~');
9736 register_expression_parser(parse_EXPR_UNARY_DEREFERENCE, '*');
9737 register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS, '&');
9738 register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT, T_PLUSPLUS);
9739 register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT, T_MINUSMINUS);
9740 register_expression_parser(parse_sizeof, T_sizeof);
9741 register_expression_parser(parse_alignof, T___alignof__);
9742 register_expression_parser(parse_extension, T___extension__);
9743 register_expression_parser(parse_builtin_classify_type, T___builtin_classify_type);
9744 register_expression_parser(parse_delete, T_delete);
9745 register_expression_parser(parse_throw, T_throw);
9749 * Parse a asm statement arguments specification.
9751 static asm_argument_t *parse_asm_arguments(bool is_out)
9753 asm_argument_t *result = NULL;
9754 asm_argument_t **anchor = &result;
9756 while (token.type == T_STRING_LITERAL || token.type == '[') {
9757 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
9758 memset(argument, 0, sizeof(argument[0]));
9760 if (token.type == '[') {
9762 if (token.type != T_IDENTIFIER) {
9763 parse_error_expected("while parsing asm argument",
9764 T_IDENTIFIER, NULL);
9767 argument->symbol = token.v.symbol;
9769 expect(']', end_error);
9772 argument->constraints = parse_string_literals();
9773 expect('(', end_error);
9774 add_anchor_token(')');
9775 expression_t *expression = parse_expression();
9776 rem_anchor_token(')');
9778 /* Ugly GCC stuff: Allow lvalue casts. Skip casts, when they do not
9779 * change size or type representation (e.g. int -> long is ok, but
9780 * int -> float is not) */
9781 if (expression->kind == EXPR_UNARY_CAST) {
9782 type_t *const type = expression->base.type;
9783 type_kind_t const kind = type->kind;
9784 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
9787 if (kind == TYPE_ATOMIC) {
9788 atomic_type_kind_t const akind = type->atomic.akind;
9789 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9790 size = get_atomic_type_size(akind);
9792 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9793 size = get_atomic_type_size(get_intptr_kind());
9797 expression_t *const value = expression->unary.value;
9798 type_t *const value_type = value->base.type;
9799 type_kind_t const value_kind = value_type->kind;
9801 unsigned value_flags;
9802 unsigned value_size;
9803 if (value_kind == TYPE_ATOMIC) {
9804 atomic_type_kind_t const value_akind = value_type->atomic.akind;
9805 value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
9806 value_size = get_atomic_type_size(value_akind);
9807 } else if (value_kind == TYPE_POINTER) {
9808 value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
9809 value_size = get_atomic_type_size(get_intptr_kind());
9814 if (value_flags != flags || value_size != size)
9818 } while (expression->kind == EXPR_UNARY_CAST);
9822 if (!is_lvalue(expression)) {
9823 errorf(&expression->base.source_position,
9824 "asm output argument is not an lvalue");
9827 if (argument->constraints.begin[0] == '+')
9828 mark_vars_read(expression, NULL);
9830 mark_vars_read(expression, NULL);
9832 argument->expression = expression;
9833 expect(')', end_error);
9835 set_address_taken(expression, true);
9838 anchor = &argument->next;
9840 if (token.type != ',')
9851 * Parse a asm statement clobber specification.
9853 static asm_clobber_t *parse_asm_clobbers(void)
9855 asm_clobber_t *result = NULL;
9856 asm_clobber_t *last = NULL;
9858 while (token.type == T_STRING_LITERAL) {
9859 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
9860 clobber->clobber = parse_string_literals();
9863 last->next = clobber;
9869 if (token.type != ',')
9878 * Parse an asm statement.
9880 static statement_t *parse_asm_statement(void)
9882 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
9883 asm_statement_t *asm_statement = &statement->asms;
9887 if (token.type == T_volatile) {
9889 asm_statement->is_volatile = true;
9892 expect('(', end_error);
9893 add_anchor_token(')');
9894 add_anchor_token(':');
9895 asm_statement->asm_text = parse_string_literals();
9897 if (token.type != ':') {
9898 rem_anchor_token(':');
9903 asm_statement->outputs = parse_asm_arguments(true);
9904 if (token.type != ':') {
9905 rem_anchor_token(':');
9910 asm_statement->inputs = parse_asm_arguments(false);
9911 if (token.type != ':') {
9912 rem_anchor_token(':');
9915 rem_anchor_token(':');
9918 asm_statement->clobbers = parse_asm_clobbers();
9921 rem_anchor_token(')');
9922 expect(')', end_error);
9923 expect(';', end_error);
9925 if (asm_statement->outputs == NULL) {
9926 /* GCC: An 'asm' instruction without any output operands will be treated
9927 * identically to a volatile 'asm' instruction. */
9928 asm_statement->is_volatile = true;
9933 return create_invalid_statement();
9937 * Parse a case statement.
9939 static statement_t *parse_case_statement(void)
9941 statement_t *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9942 source_position_t *const pos = &statement->base.source_position;
9946 expression_t *const expression = parse_expression();
9947 statement->case_label.expression = expression;
9948 if (!is_constant_expression(expression)) {
9949 /* This check does not prevent the error message in all cases of an
9950 * prior error while parsing the expression. At least it catches the
9951 * common case of a mistyped enum entry. */
9952 if (is_type_valid(skip_typeref(expression->base.type))) {
9953 errorf(pos, "case label does not reduce to an integer constant");
9955 statement->case_label.is_bad = true;
9957 long const val = fold_constant(expression);
9958 statement->case_label.first_case = val;
9959 statement->case_label.last_case = val;
9963 if (token.type == T_DOTDOTDOT) {
9965 expression_t *const end_range = parse_expression();
9966 statement->case_label.end_range = end_range;
9967 if (!is_constant_expression(end_range)) {
9968 /* This check does not prevent the error message in all cases of an
9969 * prior error while parsing the expression. At least it catches the
9970 * common case of a mistyped enum entry. */
9971 if (is_type_valid(skip_typeref(end_range->base.type))) {
9972 errorf(pos, "case range does not reduce to an integer constant");
9974 statement->case_label.is_bad = true;
9976 long const val = fold_constant(end_range);
9977 statement->case_label.last_case = val;
9979 if (warning.other && val < statement->case_label.first_case) {
9980 statement->case_label.is_empty_range = true;
9981 warningf(pos, "empty range specified");
9987 PUSH_PARENT(statement);
9989 expect(':', end_error);
9992 if (current_switch != NULL) {
9993 if (! statement->case_label.is_bad) {
9994 /* Check for duplicate case values */
9995 case_label_statement_t *c = &statement->case_label;
9996 for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
9997 if (l->is_bad || l->is_empty_range || l->expression == NULL)
10000 if (c->last_case < l->first_case || c->first_case > l->last_case)
10003 errorf(pos, "duplicate case value (previously used %P)",
10004 &l->base.source_position);
10008 /* link all cases into the switch statement */
10009 if (current_switch->last_case == NULL) {
10010 current_switch->first_case = &statement->case_label;
10012 current_switch->last_case->next = &statement->case_label;
10014 current_switch->last_case = &statement->case_label;
10016 errorf(pos, "case label not within a switch statement");
10019 statement_t *const inner_stmt = parse_statement();
10020 statement->case_label.statement = inner_stmt;
10021 if (inner_stmt->kind == STATEMENT_DECLARATION) {
10022 errorf(&inner_stmt->base.source_position, "declaration after case label");
10030 * Parse a default statement.
10032 static statement_t *parse_default_statement(void)
10034 statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
10038 PUSH_PARENT(statement);
10040 expect(':', end_error);
10041 if (current_switch != NULL) {
10042 const case_label_statement_t *def_label = current_switch->default_label;
10043 if (def_label != NULL) {
10044 errorf(HERE, "multiple default labels in one switch (previous declared %P)",
10045 &def_label->base.source_position);
10047 current_switch->default_label = &statement->case_label;
10049 /* link all cases into the switch statement */
10050 if (current_switch->last_case == NULL) {
10051 current_switch->first_case = &statement->case_label;
10053 current_switch->last_case->next = &statement->case_label;
10055 current_switch->last_case = &statement->case_label;
10058 errorf(&statement->base.source_position,
10059 "'default' label not within a switch statement");
10062 statement_t *const inner_stmt = parse_statement();
10063 statement->case_label.statement = inner_stmt;
10064 if (inner_stmt->kind == STATEMENT_DECLARATION) {
10065 errorf(&inner_stmt->base.source_position, "declaration after default label");
10072 return create_invalid_statement();
10076 * Parse a label statement.
10078 static statement_t *parse_label_statement(void)
10080 assert(token.type == T_IDENTIFIER);
10081 symbol_t *symbol = token.v.symbol;
10082 label_t *label = get_label(symbol);
10084 statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
10085 statement->label.label = label;
10089 PUSH_PARENT(statement);
10091 /* if statement is already set then the label is defined twice,
10092 * otherwise it was just mentioned in a goto/local label declaration so far
10094 if (label->statement != NULL) {
10095 errorf(HERE, "duplicate label '%Y' (declared %P)",
10096 symbol, &label->base.source_position);
10098 label->base.source_position = token.source_position;
10099 label->statement = statement;
10104 if (token.type == '}') {
10105 /* TODO only warn? */
10106 if (warning.other && false) {
10107 warningf(HERE, "label at end of compound statement");
10108 statement->label.statement = create_empty_statement();
10110 errorf(HERE, "label at end of compound statement");
10111 statement->label.statement = create_invalid_statement();
10113 } else if (token.type == ';') {
10114 /* Eat an empty statement here, to avoid the warning about an empty
10115 * statement after a label. label:; is commonly used to have a label
10116 * before a closing brace. */
10117 statement->label.statement = create_empty_statement();
10120 statement_t *const inner_stmt = parse_statement();
10121 statement->label.statement = inner_stmt;
10122 if (inner_stmt->kind == STATEMENT_DECLARATION) {
10123 errorf(&inner_stmt->base.source_position, "declaration after label");
10127 /* remember the labels in a list for later checking */
10128 *label_anchor = &statement->label;
10129 label_anchor = &statement->label.next;
10136 * Parse an if statement.
10138 static statement_t *parse_if(void)
10140 statement_t *statement = allocate_statement_zero(STATEMENT_IF);
10144 PUSH_PARENT(statement);
10146 add_anchor_token('{');
10148 expect('(', end_error);
10149 add_anchor_token(')');
10150 expression_t *const expr = parse_expression();
10151 statement->ifs.condition = expr;
10152 /* §6.8.4.1:1 The controlling expression of an if statement shall have
10154 semantic_condition(expr, "condition of 'if'-statment");
10155 mark_vars_read(expr, NULL);
10156 rem_anchor_token(')');
10157 expect(')', end_error);
10160 rem_anchor_token('{');
10162 add_anchor_token(T_else);
10163 statement_t *const true_stmt = parse_statement();
10164 statement->ifs.true_statement = true_stmt;
10165 rem_anchor_token(T_else);
10167 if (token.type == T_else) {
10169 statement->ifs.false_statement = parse_statement();
10170 } else if (warning.parentheses &&
10171 true_stmt->kind == STATEMENT_IF &&
10172 true_stmt->ifs.false_statement != NULL) {
10173 warningf(&true_stmt->base.source_position,
10174 "suggest explicit braces to avoid ambiguous 'else'");
10182 * Check that all enums are handled in a switch.
10184 * @param statement the switch statement to check
10186 static void check_enum_cases(const switch_statement_t *statement)
10188 const type_t *type = skip_typeref(statement->expression->base.type);
10189 if (! is_type_enum(type))
10191 const enum_type_t *enumt = &type->enumt;
10193 /* if we have a default, no warnings */
10194 if (statement->default_label != NULL)
10197 /* FIXME: calculation of value should be done while parsing */
10198 /* TODO: quadratic algorithm here. Change to an n log n one */
10199 long last_value = -1;
10200 const entity_t *entry = enumt->enume->base.next;
10201 for (; entry != NULL && entry->kind == ENTITY_ENUM_VALUE;
10202 entry = entry->base.next) {
10203 const expression_t *expression = entry->enum_value.value;
10204 long value = expression != NULL ? fold_constant(expression) : last_value + 1;
10205 bool found = false;
10206 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
10207 if (l->expression == NULL)
10209 if (l->first_case <= value && value <= l->last_case) {
10215 warningf(&statement->base.source_position,
10216 "enumeration value '%Y' not handled in switch",
10217 entry->base.symbol);
10219 last_value = value;
10224 * Parse a switch statement.
10226 static statement_t *parse_switch(void)
10228 statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
10232 PUSH_PARENT(statement);
10234 expect('(', end_error);
10235 add_anchor_token(')');
10236 expression_t *const expr = parse_expression();
10237 mark_vars_read(expr, NULL);
10238 type_t * type = skip_typeref(expr->base.type);
10239 if (is_type_integer(type)) {
10240 type = promote_integer(type);
10241 if (warning.traditional) {
10242 if (get_rank(type) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
10243 warningf(&expr->base.source_position,
10244 "'%T' switch expression not converted to '%T' in ISO C",
10248 } else if (is_type_valid(type)) {
10249 errorf(&expr->base.source_position,
10250 "switch quantity is not an integer, but '%T'", type);
10251 type = type_error_type;
10253 statement->switchs.expression = create_implicit_cast(expr, type);
10254 expect(')', end_error);
10255 rem_anchor_token(')');
10257 switch_statement_t *rem = current_switch;
10258 current_switch = &statement->switchs;
10259 statement->switchs.body = parse_statement();
10260 current_switch = rem;
10262 if (warning.switch_default &&
10263 statement->switchs.default_label == NULL) {
10264 warningf(&statement->base.source_position, "switch has no default case");
10266 if (warning.switch_enum)
10267 check_enum_cases(&statement->switchs);
10273 return create_invalid_statement();
10276 static statement_t *parse_loop_body(statement_t *const loop)
10278 statement_t *const rem = current_loop;
10279 current_loop = loop;
10281 statement_t *const body = parse_statement();
10283 current_loop = rem;
10288 * Parse a while statement.
10290 static statement_t *parse_while(void)
10292 statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
10296 PUSH_PARENT(statement);
10298 expect('(', end_error);
10299 add_anchor_token(')');
10300 expression_t *const cond = parse_expression();
10301 statement->whiles.condition = cond;
10302 /* §6.8.5:2 The controlling expression of an iteration statement shall
10303 * have scalar type. */
10304 semantic_condition(cond, "condition of 'while'-statement");
10305 mark_vars_read(cond, NULL);
10306 rem_anchor_token(')');
10307 expect(')', end_error);
10309 statement->whiles.body = parse_loop_body(statement);
10315 return create_invalid_statement();
10319 * Parse a do statement.
10321 static statement_t *parse_do(void)
10323 statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
10327 PUSH_PARENT(statement);
10329 add_anchor_token(T_while);
10330 statement->do_while.body = parse_loop_body(statement);
10331 rem_anchor_token(T_while);
10333 expect(T_while, end_error);
10334 expect('(', end_error);
10335 add_anchor_token(')');
10336 expression_t *const cond = parse_expression();
10337 statement->do_while.condition = cond;
10338 /* §6.8.5:2 The controlling expression of an iteration statement shall
10339 * have scalar type. */
10340 semantic_condition(cond, "condition of 'do-while'-statement");
10341 mark_vars_read(cond, NULL);
10342 rem_anchor_token(')');
10343 expect(')', end_error);
10344 expect(';', end_error);
10350 return create_invalid_statement();
10354 * Parse a for statement.
10356 static statement_t *parse_for(void)
10358 statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
10362 expect('(', end_error1);
10363 add_anchor_token(')');
10365 PUSH_PARENT(statement);
10367 size_t const top = environment_top();
10368 scope_t *old_scope = scope_push(&statement->fors.scope);
10370 if (token.type == ';') {
10372 } else if (is_declaration_specifier(&token, false)) {
10373 parse_declaration(record_entity, DECL_FLAGS_NONE);
10375 add_anchor_token(';');
10376 expression_t *const init = parse_expression();
10377 statement->fors.initialisation = init;
10378 mark_vars_read(init, ENT_ANY);
10379 if (warning.unused_value && !expression_has_effect(init)) {
10380 warningf(&init->base.source_position,
10381 "initialisation of 'for'-statement has no effect");
10383 rem_anchor_token(';');
10384 expect(';', end_error2);
10387 if (token.type != ';') {
10388 add_anchor_token(';');
10389 expression_t *const cond = parse_expression();
10390 statement->fors.condition = cond;
10391 /* §6.8.5:2 The controlling expression of an iteration statement
10392 * shall have scalar type. */
10393 semantic_condition(cond, "condition of 'for'-statement");
10394 mark_vars_read(cond, NULL);
10395 rem_anchor_token(';');
10397 expect(';', end_error2);
10398 if (token.type != ')') {
10399 expression_t *const step = parse_expression();
10400 statement->fors.step = step;
10401 mark_vars_read(step, ENT_ANY);
10402 if (warning.unused_value && !expression_has_effect(step)) {
10403 warningf(&step->base.source_position,
10404 "step of 'for'-statement has no effect");
10407 expect(')', end_error2);
10408 rem_anchor_token(')');
10409 statement->fors.body = parse_loop_body(statement);
10411 assert(current_scope == &statement->fors.scope);
10412 scope_pop(old_scope);
10413 environment_pop_to(top);
10420 rem_anchor_token(')');
10421 assert(current_scope == &statement->fors.scope);
10422 scope_pop(old_scope);
10423 environment_pop_to(top);
10427 return create_invalid_statement();
10431 * Parse a goto statement.
10433 static statement_t *parse_goto(void)
10435 statement_t *statement = allocate_statement_zero(STATEMENT_GOTO);
10438 if (GNU_MODE && token.type == '*') {
10440 expression_t *expression = parse_expression();
10441 mark_vars_read(expression, NULL);
10443 /* Argh: although documentation says the expression must be of type void*,
10444 * gcc accepts anything that can be casted into void* without error */
10445 type_t *type = expression->base.type;
10447 if (type != type_error_type) {
10448 if (!is_type_pointer(type) && !is_type_integer(type)) {
10449 errorf(&expression->base.source_position,
10450 "cannot convert to a pointer type");
10451 } else if (warning.other && type != type_void_ptr) {
10452 warningf(&expression->base.source_position,
10453 "type of computed goto expression should be 'void*' not '%T'", type);
10455 expression = create_implicit_cast(expression, type_void_ptr);
10458 statement->gotos.expression = expression;
10460 if (token.type != T_IDENTIFIER) {
10462 parse_error_expected("while parsing goto", T_IDENTIFIER, '*', NULL);
10464 parse_error_expected("while parsing goto", T_IDENTIFIER, NULL);
10465 eat_until_anchor();
10468 symbol_t *symbol = token.v.symbol;
10471 statement->gotos.label = get_label(symbol);
10474 /* remember the goto's in a list for later checking */
10475 *goto_anchor = &statement->gotos;
10476 goto_anchor = &statement->gotos.next;
10478 expect(';', end_error);
10482 return create_invalid_statement();
10486 * Parse a continue statement.
10488 static statement_t *parse_continue(void)
10490 if (current_loop == NULL) {
10491 errorf(HERE, "continue statement not within loop");
10494 statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
10497 expect(';', end_error);
10504 * Parse a break statement.
10506 static statement_t *parse_break(void)
10508 if (current_switch == NULL && current_loop == NULL) {
10509 errorf(HERE, "break statement not within loop or switch");
10512 statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
10515 expect(';', end_error);
10522 * Parse a __leave statement.
10524 static statement_t *parse_leave_statement(void)
10526 if (current_try == NULL) {
10527 errorf(HERE, "__leave statement not within __try");
10530 statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
10533 expect(';', end_error);
10540 * Check if a given entity represents a local variable.
10542 static bool is_local_variable(const entity_t *entity)
10544 if (entity->kind != ENTITY_VARIABLE)
10547 switch ((storage_class_tag_t) entity->declaration.storage_class) {
10548 case STORAGE_CLASS_AUTO:
10549 case STORAGE_CLASS_REGISTER: {
10550 const type_t *type = skip_typeref(entity->declaration.type);
10551 if (is_type_function(type)) {
10563 * Check if a given expression represents a local variable.
10565 static bool expression_is_local_variable(const expression_t *expression)
10567 if (expression->base.kind != EXPR_REFERENCE) {
10570 const entity_t *entity = expression->reference.entity;
10571 return is_local_variable(entity);
10575 * Check if a given expression represents a local variable and
10576 * return its declaration then, else return NULL.
10578 entity_t *expression_is_variable(const expression_t *expression)
10580 if (expression->base.kind != EXPR_REFERENCE) {
10583 entity_t *entity = expression->reference.entity;
10584 if (entity->kind != ENTITY_VARIABLE)
10591 * Parse a return statement.
10593 static statement_t *parse_return(void)
10597 statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
10599 expression_t *return_value = NULL;
10600 if (token.type != ';') {
10601 return_value = parse_expression();
10602 mark_vars_read(return_value, NULL);
10605 const type_t *const func_type = skip_typeref(current_function->base.type);
10606 assert(is_type_function(func_type));
10607 type_t *const return_type = skip_typeref(func_type->function.return_type);
10609 source_position_t const *const pos = &statement->base.source_position;
10610 if (return_value != NULL) {
10611 type_t *return_value_type = skip_typeref(return_value->base.type);
10613 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
10614 if (is_type_atomic(return_value_type, ATOMIC_TYPE_VOID)) {
10615 /* ISO/IEC 14882:1998(E) §6.6.3:2 */
10616 /* Only warn in C mode, because GCC does the same */
10617 if (c_mode & _CXX || strict_mode) {
10619 "'return' with a value, in function returning 'void'");
10620 } else if (warning.other) {
10622 "'return' with a value, in function returning 'void'");
10624 } else if (!(c_mode & _CXX)) { /* ISO/IEC 14882:1998(E) §6.6.3:3 */
10625 /* Only warn in C mode, because GCC does the same */
10628 "'return' with expression in function return 'void'");
10629 } else if (warning.other) {
10631 "'return' with expression in function return 'void'");
10635 assign_error_t error = semantic_assign(return_type, return_value);
10636 report_assign_error(error, return_type, return_value, "'return'",
10639 return_value = create_implicit_cast(return_value, return_type);
10640 /* check for returning address of a local var */
10641 if (warning.other && return_value != NULL
10642 && return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
10643 const expression_t *expression = return_value->unary.value;
10644 if (expression_is_local_variable(expression)) {
10645 warningf(pos, "function returns address of local variable");
10648 } else if (warning.other && !is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
10649 /* ISO/IEC 14882:1998(E) §6.6.3:3 */
10650 if (c_mode & _CXX || strict_mode) {
10652 "'return' without value, in function returning non-void");
10655 "'return' without value, in function returning non-void");
10658 statement->returns.value = return_value;
10660 expect(';', end_error);
10667 * Parse a declaration statement.
10669 static statement_t *parse_declaration_statement(void)
10671 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
10673 entity_t *before = current_scope->last_entity;
10675 parse_external_declaration();
10677 parse_declaration(record_entity, DECL_FLAGS_NONE);
10680 declaration_statement_t *const decl = &statement->declaration;
10681 entity_t *const begin =
10682 before != NULL ? before->base.next : current_scope->entities;
10683 decl->declarations_begin = begin;
10684 decl->declarations_end = begin != NULL ? current_scope->last_entity : NULL;
10690 * Parse an expression statement, ie. expr ';'.
10692 static statement_t *parse_expression_statement(void)
10694 statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10696 expression_t *const expr = parse_expression();
10697 statement->expression.expression = expr;
10698 mark_vars_read(expr, ENT_ANY);
10700 expect(';', end_error);
10707 * Parse a microsoft __try { } __finally { } or
10708 * __try{ } __except() { }
10710 static statement_t *parse_ms_try_statment(void)
10712 statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
10715 PUSH_PARENT(statement);
10717 ms_try_statement_t *rem = current_try;
10718 current_try = &statement->ms_try;
10719 statement->ms_try.try_statement = parse_compound_statement(false);
10724 if (token.type == T___except) {
10726 expect('(', end_error);
10727 add_anchor_token(')');
10728 expression_t *const expr = parse_expression();
10729 mark_vars_read(expr, NULL);
10730 type_t * type = skip_typeref(expr->base.type);
10731 if (is_type_integer(type)) {
10732 type = promote_integer(type);
10733 } else if (is_type_valid(type)) {
10734 errorf(&expr->base.source_position,
10735 "__expect expression is not an integer, but '%T'", type);
10736 type = type_error_type;
10738 statement->ms_try.except_expression = create_implicit_cast(expr, type);
10739 rem_anchor_token(')');
10740 expect(')', end_error);
10741 statement->ms_try.final_statement = parse_compound_statement(false);
10742 } else if (token.type == T__finally) {
10744 statement->ms_try.final_statement = parse_compound_statement(false);
10746 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
10747 return create_invalid_statement();
10751 return create_invalid_statement();
10754 static statement_t *parse_empty_statement(void)
10756 if (warning.empty_statement) {
10757 warningf(HERE, "statement is empty");
10759 statement_t *const statement = create_empty_statement();
10764 static statement_t *parse_local_label_declaration(void)
10766 statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
10770 entity_t *begin = NULL, *end = NULL;
10773 if (token.type != T_IDENTIFIER) {
10774 parse_error_expected("while parsing local label declaration",
10775 T_IDENTIFIER, NULL);
10778 symbol_t *symbol = token.v.symbol;
10779 entity_t *entity = get_entity(symbol, NAMESPACE_LABEL);
10780 if (entity != NULL && entity->base.parent_scope == current_scope) {
10781 errorf(HERE, "multiple definitions of '__label__ %Y' (previous definition %P)",
10782 symbol, &entity->base.source_position);
10784 entity = allocate_entity_zero(ENTITY_LOCAL_LABEL);
10786 entity->base.parent_scope = current_scope;
10787 entity->base.namespc = NAMESPACE_LABEL;
10788 entity->base.source_position = token.source_position;
10789 entity->base.symbol = symbol;
10792 end->base.next = entity;
10797 environment_push(entity);
10801 if (token.type != ',')
10807 statement->declaration.declarations_begin = begin;
10808 statement->declaration.declarations_end = end;
10812 static void parse_namespace_definition(void)
10816 entity_t *entity = NULL;
10817 symbol_t *symbol = NULL;
10819 if (token.type == T_IDENTIFIER) {
10820 symbol = token.v.symbol;
10823 entity = get_entity(symbol, NAMESPACE_NORMAL);
10824 if (entity != NULL &&
10825 entity->kind != ENTITY_NAMESPACE &&
10826 entity->base.parent_scope == current_scope) {
10827 if (!is_error_entity(entity)) {
10828 error_redefined_as_different_kind(&token.source_position,
10829 entity, ENTITY_NAMESPACE);
10835 if (entity == NULL) {
10836 entity = allocate_entity_zero(ENTITY_NAMESPACE);
10837 entity->base.symbol = symbol;
10838 entity->base.source_position = token.source_position;
10839 entity->base.namespc = NAMESPACE_NORMAL;
10840 entity->base.parent_scope = current_scope;
10843 if (token.type == '=') {
10844 /* TODO: parse namespace alias */
10845 panic("namespace alias definition not supported yet");
10848 environment_push(entity);
10849 append_entity(current_scope, entity);
10851 size_t const top = environment_top();
10852 scope_t *old_scope = scope_push(&entity->namespacee.members);
10854 expect('{', end_error);
10856 expect('}', end_error);
10859 assert(current_scope == &entity->namespacee.members);
10860 scope_pop(old_scope);
10861 environment_pop_to(top);
10865 * Parse a statement.
10866 * There's also parse_statement() which additionally checks for
10867 * "statement has no effect" warnings
10869 static statement_t *intern_parse_statement(void)
10871 statement_t *statement = NULL;
10873 /* declaration or statement */
10874 add_anchor_token(';');
10875 switch (token.type) {
10876 case T_IDENTIFIER: {
10877 token_type_t la1_type = (token_type_t)look_ahead(1)->type;
10878 if (la1_type == ':') {
10879 statement = parse_label_statement();
10880 } else if (is_typedef_symbol(token.v.symbol)) {
10881 statement = parse_declaration_statement();
10883 /* it's an identifier, the grammar says this must be an
10884 * expression statement. However it is common that users mistype
10885 * declaration types, so we guess a bit here to improve robustness
10886 * for incorrect programs */
10887 switch (la1_type) {
10890 if (get_entity(token.v.symbol, NAMESPACE_NORMAL) != NULL)
10891 goto expression_statment;
10896 statement = parse_declaration_statement();
10900 expression_statment:
10901 statement = parse_expression_statement();
10908 case T___extension__:
10909 /* This can be a prefix to a declaration or an expression statement.
10910 * We simply eat it now and parse the rest with tail recursion. */
10913 } while (token.type == T___extension__);
10914 bool old_gcc_extension = in_gcc_extension;
10915 in_gcc_extension = true;
10916 statement = intern_parse_statement();
10917 in_gcc_extension = old_gcc_extension;
10921 statement = parse_declaration_statement();
10925 statement = parse_local_label_declaration();
10928 case ';': statement = parse_empty_statement(); break;
10929 case '{': statement = parse_compound_statement(false); break;
10930 case T___leave: statement = parse_leave_statement(); break;
10931 case T___try: statement = parse_ms_try_statment(); break;
10932 case T_asm: statement = parse_asm_statement(); break;
10933 case T_break: statement = parse_break(); break;
10934 case T_case: statement = parse_case_statement(); break;
10935 case T_continue: statement = parse_continue(); break;
10936 case T_default: statement = parse_default_statement(); break;
10937 case T_do: statement = parse_do(); break;
10938 case T_for: statement = parse_for(); break;
10939 case T_goto: statement = parse_goto(); break;
10940 case T_if: statement = parse_if(); break;
10941 case T_return: statement = parse_return(); break;
10942 case T_switch: statement = parse_switch(); break;
10943 case T_while: statement = parse_while(); break;
10946 statement = parse_expression_statement();
10950 errorf(HERE, "unexpected token %K while parsing statement", &token);
10951 statement = create_invalid_statement();
10956 rem_anchor_token(';');
10958 assert(statement != NULL
10959 && statement->base.source_position.input_name != NULL);
10965 * parse a statement and emits "statement has no effect" warning if needed
10966 * (This is really a wrapper around intern_parse_statement with check for 1
10967 * single warning. It is needed, because for statement expressions we have
10968 * to avoid the warning on the last statement)
10970 static statement_t *parse_statement(void)
10972 statement_t *statement = intern_parse_statement();
10974 if (statement->kind == STATEMENT_EXPRESSION && warning.unused_value) {
10975 expression_t *expression = statement->expression.expression;
10976 if (!expression_has_effect(expression)) {
10977 warningf(&expression->base.source_position,
10978 "statement has no effect");
10986 * Parse a compound statement.
10988 static statement_t *parse_compound_statement(bool inside_expression_statement)
10990 statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
10992 PUSH_PARENT(statement);
10995 add_anchor_token('}');
10996 /* tokens, which can start a statement */
10997 /* TODO MS, __builtin_FOO */
10998 add_anchor_token('!');
10999 add_anchor_token('&');
11000 add_anchor_token('(');
11001 add_anchor_token('*');
11002 add_anchor_token('+');
11003 add_anchor_token('-');
11004 add_anchor_token('{');
11005 add_anchor_token('~');
11006 add_anchor_token(T_CHARACTER_CONSTANT);
11007 add_anchor_token(T_COLONCOLON);
11008 add_anchor_token(T_FLOATINGPOINT);
11009 add_anchor_token(T_IDENTIFIER);
11010 add_anchor_token(T_INTEGER);
11011 add_anchor_token(T_MINUSMINUS);
11012 add_anchor_token(T_PLUSPLUS);
11013 add_anchor_token(T_STRING_LITERAL);
11014 add_anchor_token(T_WIDE_CHARACTER_CONSTANT);
11015 add_anchor_token(T_WIDE_STRING_LITERAL);
11016 add_anchor_token(T__Bool);
11017 add_anchor_token(T__Complex);
11018 add_anchor_token(T__Imaginary);
11019 add_anchor_token(T___FUNCTION__);
11020 add_anchor_token(T___PRETTY_FUNCTION__);
11021 add_anchor_token(T___alignof__);
11022 add_anchor_token(T___attribute__);
11023 add_anchor_token(T___builtin_va_start);
11024 add_anchor_token(T___extension__);
11025 add_anchor_token(T___func__);
11026 add_anchor_token(T___imag__);
11027 add_anchor_token(T___label__);
11028 add_anchor_token(T___real__);
11029 add_anchor_token(T___thread);
11030 add_anchor_token(T_asm);
11031 add_anchor_token(T_auto);
11032 add_anchor_token(T_bool);
11033 add_anchor_token(T_break);
11034 add_anchor_token(T_case);
11035 add_anchor_token(T_char);
11036 add_anchor_token(T_class);
11037 add_anchor_token(T_const);
11038 add_anchor_token(T_const_cast);
11039 add_anchor_token(T_continue);
11040 add_anchor_token(T_default);
11041 add_anchor_token(T_delete);
11042 add_anchor_token(T_double);
11043 add_anchor_token(T_do);
11044 add_anchor_token(T_dynamic_cast);
11045 add_anchor_token(T_enum);
11046 add_anchor_token(T_extern);
11047 add_anchor_token(T_false);
11048 add_anchor_token(T_float);
11049 add_anchor_token(T_for);
11050 add_anchor_token(T_goto);
11051 add_anchor_token(T_if);
11052 add_anchor_token(T_inline);
11053 add_anchor_token(T_int);
11054 add_anchor_token(T_long);
11055 add_anchor_token(T_new);
11056 add_anchor_token(T_operator);
11057 add_anchor_token(T_register);
11058 add_anchor_token(T_reinterpret_cast);
11059 add_anchor_token(T_restrict);
11060 add_anchor_token(T_return);
11061 add_anchor_token(T_short);
11062 add_anchor_token(T_signed);
11063 add_anchor_token(T_sizeof);
11064 add_anchor_token(T_static);
11065 add_anchor_token(T_static_cast);
11066 add_anchor_token(T_struct);
11067 add_anchor_token(T_switch);
11068 add_anchor_token(T_template);
11069 add_anchor_token(T_this);
11070 add_anchor_token(T_throw);
11071 add_anchor_token(T_true);
11072 add_anchor_token(T_try);
11073 add_anchor_token(T_typedef);
11074 add_anchor_token(T_typeid);
11075 add_anchor_token(T_typename);
11076 add_anchor_token(T_typeof);
11077 add_anchor_token(T_union);
11078 add_anchor_token(T_unsigned);
11079 add_anchor_token(T_using);
11080 add_anchor_token(T_void);
11081 add_anchor_token(T_volatile);
11082 add_anchor_token(T_wchar_t);
11083 add_anchor_token(T_while);
11085 size_t const top = environment_top();
11086 scope_t *old_scope = scope_push(&statement->compound.scope);
11088 statement_t **anchor = &statement->compound.statements;
11089 bool only_decls_so_far = true;
11090 while (token.type != '}') {
11091 if (token.type == T_EOF) {
11092 errorf(&statement->base.source_position,
11093 "EOF while parsing compound statement");
11096 statement_t *sub_statement = intern_parse_statement();
11097 if (is_invalid_statement(sub_statement)) {
11098 /* an error occurred. if we are at an anchor, return */
11104 if (warning.declaration_after_statement) {
11105 if (sub_statement->kind != STATEMENT_DECLARATION) {
11106 only_decls_so_far = false;
11107 } else if (!only_decls_so_far) {
11108 warningf(&sub_statement->base.source_position,
11109 "ISO C90 forbids mixed declarations and code");
11113 *anchor = sub_statement;
11115 while (sub_statement->base.next != NULL)
11116 sub_statement = sub_statement->base.next;
11118 anchor = &sub_statement->base.next;
11122 /* look over all statements again to produce no effect warnings */
11123 if (warning.unused_value) {
11124 statement_t *sub_statement = statement->compound.statements;
11125 for (; sub_statement != NULL; sub_statement = sub_statement->base.next) {
11126 if (sub_statement->kind != STATEMENT_EXPRESSION)
11128 /* don't emit a warning for the last expression in an expression
11129 * statement as it has always an effect */
11130 if (inside_expression_statement && sub_statement->base.next == NULL)
11133 expression_t *expression = sub_statement->expression.expression;
11134 if (!expression_has_effect(expression)) {
11135 warningf(&expression->base.source_position,
11136 "statement has no effect");
11142 rem_anchor_token(T_while);
11143 rem_anchor_token(T_wchar_t);
11144 rem_anchor_token(T_volatile);
11145 rem_anchor_token(T_void);
11146 rem_anchor_token(T_using);
11147 rem_anchor_token(T_unsigned);
11148 rem_anchor_token(T_union);
11149 rem_anchor_token(T_typeof);
11150 rem_anchor_token(T_typename);
11151 rem_anchor_token(T_typeid);
11152 rem_anchor_token(T_typedef);
11153 rem_anchor_token(T_try);
11154 rem_anchor_token(T_true);
11155 rem_anchor_token(T_throw);
11156 rem_anchor_token(T_this);
11157 rem_anchor_token(T_template);
11158 rem_anchor_token(T_switch);
11159 rem_anchor_token(T_struct);
11160 rem_anchor_token(T_static_cast);
11161 rem_anchor_token(T_static);
11162 rem_anchor_token(T_sizeof);
11163 rem_anchor_token(T_signed);
11164 rem_anchor_token(T_short);
11165 rem_anchor_token(T_return);
11166 rem_anchor_token(T_restrict);
11167 rem_anchor_token(T_reinterpret_cast);
11168 rem_anchor_token(T_register);
11169 rem_anchor_token(T_operator);
11170 rem_anchor_token(T_new);
11171 rem_anchor_token(T_long);
11172 rem_anchor_token(T_int);
11173 rem_anchor_token(T_inline);
11174 rem_anchor_token(T_if);
11175 rem_anchor_token(T_goto);
11176 rem_anchor_token(T_for);
11177 rem_anchor_token(T_float);
11178 rem_anchor_token(T_false);
11179 rem_anchor_token(T_extern);
11180 rem_anchor_token(T_enum);
11181 rem_anchor_token(T_dynamic_cast);
11182 rem_anchor_token(T_do);
11183 rem_anchor_token(T_double);
11184 rem_anchor_token(T_delete);
11185 rem_anchor_token(T_default);
11186 rem_anchor_token(T_continue);
11187 rem_anchor_token(T_const_cast);
11188 rem_anchor_token(T_const);
11189 rem_anchor_token(T_class);
11190 rem_anchor_token(T_char);
11191 rem_anchor_token(T_case);
11192 rem_anchor_token(T_break);
11193 rem_anchor_token(T_bool);
11194 rem_anchor_token(T_auto);
11195 rem_anchor_token(T_asm);
11196 rem_anchor_token(T___thread);
11197 rem_anchor_token(T___real__);
11198 rem_anchor_token(T___label__);
11199 rem_anchor_token(T___imag__);
11200 rem_anchor_token(T___func__);
11201 rem_anchor_token(T___extension__);
11202 rem_anchor_token(T___builtin_va_start);
11203 rem_anchor_token(T___attribute__);
11204 rem_anchor_token(T___alignof__);
11205 rem_anchor_token(T___PRETTY_FUNCTION__);
11206 rem_anchor_token(T___FUNCTION__);
11207 rem_anchor_token(T__Imaginary);
11208 rem_anchor_token(T__Complex);
11209 rem_anchor_token(T__Bool);
11210 rem_anchor_token(T_WIDE_STRING_LITERAL);
11211 rem_anchor_token(T_WIDE_CHARACTER_CONSTANT);
11212 rem_anchor_token(T_STRING_LITERAL);
11213 rem_anchor_token(T_PLUSPLUS);
11214 rem_anchor_token(T_MINUSMINUS);
11215 rem_anchor_token(T_INTEGER);
11216 rem_anchor_token(T_IDENTIFIER);
11217 rem_anchor_token(T_FLOATINGPOINT);
11218 rem_anchor_token(T_COLONCOLON);
11219 rem_anchor_token(T_CHARACTER_CONSTANT);
11220 rem_anchor_token('~');
11221 rem_anchor_token('{');
11222 rem_anchor_token('-');
11223 rem_anchor_token('+');
11224 rem_anchor_token('*');
11225 rem_anchor_token('(');
11226 rem_anchor_token('&');
11227 rem_anchor_token('!');
11228 rem_anchor_token('}');
11229 assert(current_scope == &statement->compound.scope);
11230 scope_pop(old_scope);
11231 environment_pop_to(top);
11238 * Check for unused global static functions and variables
11240 static void check_unused_globals(void)
11242 if (!warning.unused_function && !warning.unused_variable)
11245 for (const entity_t *entity = file_scope->entities; entity != NULL;
11246 entity = entity->base.next) {
11247 if (!is_declaration(entity))
11250 const declaration_t *declaration = &entity->declaration;
11251 if (declaration->used ||
11252 declaration->modifiers & DM_UNUSED ||
11253 declaration->modifiers & DM_USED ||
11254 declaration->storage_class != STORAGE_CLASS_STATIC)
11257 type_t *const type = declaration->type;
11259 if (entity->kind == ENTITY_FUNCTION) {
11260 /* inhibit warning for static inline functions */
11261 if (entity->function.is_inline)
11264 s = entity->function.statement != NULL ? "defined" : "declared";
11269 warningf(&declaration->base.source_position, "'%#T' %s but not used",
11270 type, declaration->base.symbol, s);
11274 static void parse_global_asm(void)
11276 statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
11279 expect('(', end_error);
11281 statement->asms.asm_text = parse_string_literals();
11282 statement->base.next = unit->global_asm;
11283 unit->global_asm = statement;
11285 expect(')', end_error);
11286 expect(';', end_error);
11291 static void parse_linkage_specification(void)
11294 assert(token.type == T_STRING_LITERAL);
11296 const char *linkage = parse_string_literals().begin;
11298 linkage_kind_t old_linkage = current_linkage;
11299 linkage_kind_t new_linkage;
11300 if (strcmp(linkage, "C") == 0) {
11301 new_linkage = LINKAGE_C;
11302 } else if (strcmp(linkage, "C++") == 0) {
11303 new_linkage = LINKAGE_CXX;
11305 errorf(HERE, "linkage string \"%s\" not recognized", linkage);
11306 new_linkage = LINKAGE_INVALID;
11308 current_linkage = new_linkage;
11310 if (token.type == '{') {
11313 expect('}', end_error);
11319 assert(current_linkage == new_linkage);
11320 current_linkage = old_linkage;
11323 static void parse_external(void)
11325 switch (token.type) {
11326 DECLARATION_START_NO_EXTERN
11328 case T___extension__:
11329 /* tokens below are for implicit int */
11330 case '&': /* & x; -> int& x; (and error later, because C++ has no
11332 case '*': /* * x; -> int* x; */
11333 case '(': /* (x); -> int (x); */
11334 parse_external_declaration();
11338 if (look_ahead(1)->type == T_STRING_LITERAL) {
11339 parse_linkage_specification();
11341 parse_external_declaration();
11346 parse_global_asm();
11350 parse_namespace_definition();
11354 if (!strict_mode) {
11356 warningf(HERE, "stray ';' outside of function");
11363 errorf(HERE, "stray %K outside of function", &token);
11364 if (token.type == '(' || token.type == '{' || token.type == '[')
11365 eat_until_matching_token(token.type);
11371 static void parse_externals(void)
11373 add_anchor_token('}');
11374 add_anchor_token(T_EOF);
11377 unsigned char token_anchor_copy[T_LAST_TOKEN];
11378 memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
11381 while (token.type != T_EOF && token.type != '}') {
11383 bool anchor_leak = false;
11384 for (int i = 0; i != T_LAST_TOKEN; ++i) {
11385 unsigned char count = token_anchor_set[i] - token_anchor_copy[i];
11387 errorf(HERE, "Leaked anchor token %k %d times", i, count);
11388 anchor_leak = true;
11391 if (in_gcc_extension) {
11392 errorf(HERE, "Leaked __extension__");
11393 anchor_leak = true;
11403 rem_anchor_token(T_EOF);
11404 rem_anchor_token('}');
11408 * Parse a translation unit.
11410 static void parse_translation_unit(void)
11412 add_anchor_token(T_EOF);
11417 if (token.type == T_EOF)
11420 errorf(HERE, "stray %K outside of function", &token);
11421 if (token.type == '(' || token.type == '{' || token.type == '[')
11422 eat_until_matching_token(token.type);
11430 * @return the translation unit or NULL if errors occurred.
11432 void start_parsing(void)
11434 environment_stack = NEW_ARR_F(stack_entry_t, 0);
11435 label_stack = NEW_ARR_F(stack_entry_t, 0);
11436 diagnostic_count = 0;
11440 type_set_output(stderr);
11441 ast_set_output(stderr);
11443 assert(unit == NULL);
11444 unit = allocate_ast_zero(sizeof(unit[0]));
11446 assert(file_scope == NULL);
11447 file_scope = &unit->scope;
11449 assert(current_scope == NULL);
11450 scope_push(&unit->scope);
11453 translation_unit_t *finish_parsing(void)
11455 assert(current_scope == &unit->scope);
11458 assert(file_scope == &unit->scope);
11459 check_unused_globals();
11462 DEL_ARR_F(environment_stack);
11463 DEL_ARR_F(label_stack);
11465 translation_unit_t *result = unit;
11470 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
11471 * are given length one. */
11472 static void complete_incomplete_arrays(void)
11474 size_t n = ARR_LEN(incomplete_arrays);
11475 for (size_t i = 0; i != n; ++i) {
11476 declaration_t *const decl = incomplete_arrays[i];
11477 type_t *const orig_type = decl->type;
11478 type_t *const type = skip_typeref(orig_type);
11480 if (!is_type_incomplete(type))
11483 if (warning.other) {
11484 warningf(&decl->base.source_position,
11485 "array '%#T' assumed to have one element",
11486 orig_type, decl->base.symbol);
11489 type_t *const new_type = duplicate_type(type);
11490 new_type->array.size_constant = true;
11491 new_type->array.has_implicit_size = true;
11492 new_type->array.size = 1;
11494 type_t *const result = identify_new_type(new_type);
11496 decl->type = result;
11502 lookahead_bufpos = 0;
11503 for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
11506 current_linkage = c_mode & _CXX ? LINKAGE_CXX : LINKAGE_C;
11507 incomplete_arrays = NEW_ARR_F(declaration_t*, 0);
11508 parse_translation_unit();
11509 complete_incomplete_arrays();
11510 DEL_ARR_F(incomplete_arrays);
11511 incomplete_arrays = NULL;
11515 * Initialize the parser.
11517 void init_parser(void)
11519 sym_anonymous = symbol_table_insert("<anonymous>");
11521 if (c_mode & _MS) {
11522 /* add predefined symbols for extended-decl-modifier */
11523 sym_align = symbol_table_insert("align");
11524 sym_allocate = symbol_table_insert("allocate");
11525 sym_dllimport = symbol_table_insert("dllimport");
11526 sym_dllexport = symbol_table_insert("dllexport");
11527 sym_naked = symbol_table_insert("naked");
11528 sym_noinline = symbol_table_insert("noinline");
11529 sym_returns_twice = symbol_table_insert("returns_twice");
11530 sym_noreturn = symbol_table_insert("noreturn");
11531 sym_nothrow = symbol_table_insert("nothrow");
11532 sym_novtable = symbol_table_insert("novtable");
11533 sym_property = symbol_table_insert("property");
11534 sym_get = symbol_table_insert("get");
11535 sym_put = symbol_table_insert("put");
11536 sym_selectany = symbol_table_insert("selectany");
11537 sym_thread = symbol_table_insert("thread");
11538 sym_uuid = symbol_table_insert("uuid");
11539 sym_deprecated = symbol_table_insert("deprecated");
11540 sym_restrict = symbol_table_insert("restrict");
11541 sym_noalias = symbol_table_insert("noalias");
11543 memset(token_anchor_set, 0, sizeof(token_anchor_set));
11545 init_expression_parsers();
11546 obstack_init(&temp_obst);
11548 symbol_t *const va_list_sym = symbol_table_insert("__builtin_va_list");
11549 type_valist = create_builtin_type(va_list_sym, type_void_ptr);
11553 * Terminate the parser.
11555 void exit_parser(void)
11557 obstack_free(&temp_obst, NULL);