Make sure that get_type_alignment() is not passed a typedef.
[cparser] / parser.c
1 /*
2  * This file is part of cparser.
3  * Copyright (C) 2007-2009 Matthias Braun <matze@braunis.de>
4  *
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.
9  *
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.
14  *
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
18  * 02111-1307, USA.
19  */
20 #include <config.h>
21
22 #include <assert.h>
23 #include <stdarg.h>
24 #include <stdbool.h>
25
26 #include "parser.h"
27 #include "diagnostic.h"
28 #include "format_check.h"
29 #include "lexer.h"
30 #include "symbol_t.h"
31 #include "token_t.h"
32 #include "types.h"
33 #include "type_t.h"
34 #include "type_hash.h"
35 #include "ast_t.h"
36 #include "entity_t.h"
37 #include "attribute_t.h"
38 #include "lang_features.h"
39 #include "walk.h"
40 #include "warning.h"
41 #include "printer.h"
42 #include "adt/bitfiddle.h"
43 #include "adt/error.h"
44 #include "adt/array.h"
45
46 //#define PRINT_TOKENS
47 #define MAX_LOOKAHEAD 1
48
49 typedef struct {
50         entity_t           *old_entity;
51         symbol_t           *symbol;
52         entity_namespace_t  namespc;
53 } stack_entry_t;
54
55 typedef struct declaration_specifiers_t  declaration_specifiers_t;
56 struct declaration_specifiers_t {
57         source_position_t  source_position;
58         storage_class_t    storage_class;
59         unsigned char      alignment;         /**< Alignment, 0 if not set. */
60         bool               is_inline    : 1;
61         bool               thread_local : 1;  /**< GCC __thread */
62         attribute_t       *attributes;        /**< list of attributes */
63         type_t            *type;
64 };
65
66 /**
67  * An environment for parsing initializers (and compound literals).
68  */
69 typedef struct parse_initializer_env_t {
70         type_t     *type;   /**< the type of the initializer. In case of an
71                                  array type with unspecified size this gets
72                                  adjusted to the actual size. */
73         entity_t   *entity; /**< the variable that is initialized if any */
74         bool        must_be_constant;
75 } parse_initializer_env_t;
76
77 typedef entity_t* (*parsed_declaration_func) (entity_t *declaration, bool is_definition);
78
79 /** The current token. */
80 static token_t              token;
81 /** The lookahead ring-buffer. */
82 static token_t              lookahead_buffer[MAX_LOOKAHEAD];
83 /** Position of the next token in the lookahead buffer. */
84 static size_t               lookahead_bufpos;
85 static stack_entry_t       *environment_stack = NULL;
86 static stack_entry_t       *label_stack       = NULL;
87 static scope_t             *file_scope        = NULL;
88 static scope_t             *current_scope     = NULL;
89 /** Point to the current function declaration if inside a function. */
90 static function_t          *current_function  = NULL;
91 static entity_t            *current_entity    = NULL;
92 static switch_statement_t  *current_switch    = NULL;
93 static statement_t         *current_loop      = NULL;
94 static statement_t         *current_parent    = NULL;
95 static ms_try_statement_t  *current_try       = NULL;
96 static linkage_kind_t       current_linkage;
97 static goto_statement_t    *goto_first        = NULL;
98 static goto_statement_t   **goto_anchor       = NULL;
99 static label_statement_t   *label_first       = NULL;
100 static label_statement_t  **label_anchor      = NULL;
101 /** current translation unit. */
102 static translation_unit_t  *unit              = NULL;
103 /** true if we are in an __extension__ context. */
104 static bool                 in_gcc_extension  = false;
105 static struct obstack       temp_obst;
106 static entity_t            *anonymous_entity;
107 static declaration_t      **incomplete_arrays;
108 static elf_visibility_tag_t default_visibility = ELF_VISIBILITY_DEFAULT;
109
110
111 #define PUSH_PARENT(stmt) \
112         statement_t *const new_parent = (stmt); \
113         statement_t *const old_parent = current_parent; \
114         ((void)(current_parent = new_parent))
115 #define POP_PARENT() (assert(current_parent == new_parent), (void)(current_parent = old_parent))
116
117 #define PUSH_SCOPE(scope) \
118         size_t   const top       = environment_top(); \
119         scope_t *const new_scope = (scope); \
120         scope_t *const old_scope = scope_push(new_scope)
121 #define POP_SCOPE() (assert(current_scope == new_scope), scope_pop(old_scope), environment_pop_to(top))
122
123 #define PUSH_EXTENSION() \
124         (void)0; \
125         bool const old_gcc_extension = in_gcc_extension; \
126         while (next_if(T___extension__)) { \
127                 in_gcc_extension = true; \
128         } \
129         do {} while (0)
130 #define POP_EXTENSION() \
131         ((void)(in_gcc_extension = old_gcc_extension))
132
133 /** special symbol used for anonymous entities. */
134 static symbol_t *sym_anonymous = NULL;
135
136 /** The token anchor set */
137 static unsigned short token_anchor_set[T_LAST_TOKEN];
138
139 /** The current source position. */
140 #define HERE (&token.base.source_position)
141
142 /** true if we are in GCC mode. */
143 #define GNU_MODE ((c_mode & _GNUC) || in_gcc_extension)
144
145 static statement_t *parse_compound_statement(bool inside_expression_statement);
146 static statement_t *parse_statement(void);
147
148 static expression_t *parse_subexpression(precedence_t);
149 static expression_t *parse_expression(void);
150 static type_t       *parse_typename(void);
151 static void          parse_externals(void);
152 static void          parse_external(void);
153
154 static void parse_compound_type_entries(compound_t *compound_declaration);
155
156 static void check_call_argument(type_t          *expected_type,
157                                                                 call_argument_t *argument, unsigned pos);
158
159 typedef enum declarator_flags_t {
160         DECL_FLAGS_NONE             = 0,
161         DECL_MAY_BE_ABSTRACT        = 1U << 0,
162         DECL_CREATE_COMPOUND_MEMBER = 1U << 1,
163         DECL_IS_PARAMETER           = 1U << 2
164 } declarator_flags_t;
165
166 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
167                                   declarator_flags_t flags);
168
169 static void semantic_comparison(binary_expression_t *expression);
170
171 #define STORAGE_CLASSES       \
172         STORAGE_CLASSES_NO_EXTERN \
173         case T_extern:
174
175 #define STORAGE_CLASSES_NO_EXTERN \
176         case T_typedef:         \
177         case T_static:          \
178         case T_auto:            \
179         case T_register:        \
180         case T___thread:
181
182 #define TYPE_QUALIFIERS     \
183         case T_const:           \
184         case T_restrict:        \
185         case T_volatile:        \
186         case T_inline:          \
187         case T__forceinline:    \
188         case T___attribute__:
189
190 #define COMPLEX_SPECIFIERS  \
191         case T__Complex:
192 #define IMAGINARY_SPECIFIERS \
193         case T__Imaginary:
194
195 #define TYPE_SPECIFIERS       \
196         case T__Bool:             \
197         case T___builtin_va_list: \
198         case T___typeof__:        \
199         case T__declspec:         \
200         case T_bool:              \
201         case T_char:              \
202         case T_double:            \
203         case T_enum:              \
204         case T_float:             \
205         case T_int:               \
206         case T_long:              \
207         case T_short:             \
208         case T_signed:            \
209         case T_struct:            \
210         case T_union:             \
211         case T_unsigned:          \
212         case T_void:              \
213         case T_wchar_t:           \
214         case T__int8:             \
215         case T__int16:            \
216         case T__int32:            \
217         case T__int64:            \
218         case T__int128:           \
219         COMPLEX_SPECIFIERS        \
220         IMAGINARY_SPECIFIERS
221
222 #define DECLARATION_START   \
223         STORAGE_CLASSES         \
224         TYPE_QUALIFIERS         \
225         TYPE_SPECIFIERS
226
227 #define DECLARATION_START_NO_EXTERN \
228         STORAGE_CLASSES_NO_EXTERN       \
229         TYPE_QUALIFIERS                 \
230         TYPE_SPECIFIERS
231
232 #define EXPRESSION_START              \
233         case '!':                         \
234         case '&':                         \
235         case '(':                         \
236         case '*':                         \
237         case '+':                         \
238         case '-':                         \
239         case '~':                         \
240         case T_ANDAND:                    \
241         case T_CHARACTER_CONSTANT:        \
242         case T_FLOATINGPOINT:             \
243         case T_FLOATINGPOINT_HEXADECIMAL: \
244         case T_INTEGER:                   \
245         case T_INTEGER_HEXADECIMAL:       \
246         case T_INTEGER_OCTAL:             \
247         case T_MINUSMINUS:                \
248         case T_PLUSPLUS:                  \
249         case T_STRING_LITERAL:            \
250         case T_WIDE_CHARACTER_CONSTANT:   \
251         case T_WIDE_STRING_LITERAL:       \
252         case T___FUNCDNAME__:             \
253         case T___FUNCSIG__:               \
254         case T___FUNCTION__:              \
255         case T___PRETTY_FUNCTION__:       \
256         case T___alignof__:               \
257         case T___builtin_classify_type:   \
258         case T___builtin_constant_p:      \
259         case T___builtin_isgreater:       \
260         case T___builtin_isgreaterequal:  \
261         case T___builtin_isless:          \
262         case T___builtin_islessequal:     \
263         case T___builtin_islessgreater:   \
264         case T___builtin_isunordered:     \
265         case T___builtin_offsetof:        \
266         case T___builtin_va_arg:          \
267         case T___builtin_va_copy:         \
268         case T___builtin_va_start:        \
269         case T___func__:                  \
270         case T___noop:                    \
271         case T__assume:                   \
272         case T_delete:                    \
273         case T_false:                     \
274         case T_sizeof:                    \
275         case T_throw:                     \
276         case T_true:
277
278 /**
279  * Returns the size of a statement node.
280  *
281  * @param kind  the statement kind
282  */
283 static size_t get_statement_struct_size(statement_kind_t kind)
284 {
285         static const size_t sizes[] = {
286                 [STATEMENT_ERROR]       = sizeof(statement_base_t),
287                 [STATEMENT_EMPTY]       = sizeof(statement_base_t),
288                 [STATEMENT_COMPOUND]    = sizeof(compound_statement_t),
289                 [STATEMENT_RETURN]      = sizeof(return_statement_t),
290                 [STATEMENT_DECLARATION] = sizeof(declaration_statement_t),
291                 [STATEMENT_IF]          = sizeof(if_statement_t),
292                 [STATEMENT_SWITCH]      = sizeof(switch_statement_t),
293                 [STATEMENT_EXPRESSION]  = sizeof(expression_statement_t),
294                 [STATEMENT_CONTINUE]    = sizeof(statement_base_t),
295                 [STATEMENT_BREAK]       = sizeof(statement_base_t),
296                 [STATEMENT_GOTO]        = sizeof(goto_statement_t),
297                 [STATEMENT_LABEL]       = sizeof(label_statement_t),
298                 [STATEMENT_CASE_LABEL]  = sizeof(case_label_statement_t),
299                 [STATEMENT_WHILE]       = sizeof(while_statement_t),
300                 [STATEMENT_DO_WHILE]    = sizeof(do_while_statement_t),
301                 [STATEMENT_FOR]         = sizeof(for_statement_t),
302                 [STATEMENT_ASM]         = sizeof(asm_statement_t),
303                 [STATEMENT_MS_TRY]      = sizeof(ms_try_statement_t),
304                 [STATEMENT_LEAVE]       = sizeof(leave_statement_t)
305         };
306         assert((size_t)kind < lengthof(sizes));
307         assert(sizes[kind] != 0);
308         return sizes[kind];
309 }
310
311 /**
312  * Returns the size of an expression node.
313  *
314  * @param kind  the expression kind
315  */
316 static size_t get_expression_struct_size(expression_kind_t kind)
317 {
318         static const size_t sizes[] = {
319                 [EXPR_ERROR]                      = sizeof(expression_base_t),
320                 [EXPR_REFERENCE]                  = sizeof(reference_expression_t),
321                 [EXPR_REFERENCE_ENUM_VALUE]       = sizeof(reference_expression_t),
322                 [EXPR_LITERAL_BOOLEAN]            = sizeof(literal_expression_t),
323                 [EXPR_LITERAL_INTEGER]            = sizeof(literal_expression_t),
324                 [EXPR_LITERAL_INTEGER_OCTAL]      = sizeof(literal_expression_t),
325                 [EXPR_LITERAL_INTEGER_HEXADECIMAL]= sizeof(literal_expression_t),
326                 [EXPR_LITERAL_FLOATINGPOINT]      = sizeof(literal_expression_t),
327                 [EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL] = sizeof(literal_expression_t),
328                 [EXPR_LITERAL_CHARACTER]          = sizeof(literal_expression_t),
329                 [EXPR_LITERAL_WIDE_CHARACTER]     = sizeof(literal_expression_t),
330                 [EXPR_STRING_LITERAL]             = sizeof(string_literal_expression_t),
331                 [EXPR_WIDE_STRING_LITERAL]        = sizeof(string_literal_expression_t),
332                 [EXPR_COMPOUND_LITERAL]           = sizeof(compound_literal_expression_t),
333                 [EXPR_CALL]                       = sizeof(call_expression_t),
334                 [EXPR_UNARY_FIRST]                = sizeof(unary_expression_t),
335                 [EXPR_BINARY_FIRST]               = sizeof(binary_expression_t),
336                 [EXPR_CONDITIONAL]                = sizeof(conditional_expression_t),
337                 [EXPR_SELECT]                     = sizeof(select_expression_t),
338                 [EXPR_ARRAY_ACCESS]               = sizeof(array_access_expression_t),
339                 [EXPR_SIZEOF]                     = sizeof(typeprop_expression_t),
340                 [EXPR_ALIGNOF]                    = sizeof(typeprop_expression_t),
341                 [EXPR_CLASSIFY_TYPE]              = sizeof(classify_type_expression_t),
342                 [EXPR_FUNCNAME]                   = sizeof(funcname_expression_t),
343                 [EXPR_BUILTIN_CONSTANT_P]         = sizeof(builtin_constant_expression_t),
344                 [EXPR_BUILTIN_TYPES_COMPATIBLE_P] = sizeof(builtin_types_compatible_expression_t),
345                 [EXPR_OFFSETOF]                   = sizeof(offsetof_expression_t),
346                 [EXPR_VA_START]                   = sizeof(va_start_expression_t),
347                 [EXPR_VA_ARG]                     = sizeof(va_arg_expression_t),
348                 [EXPR_VA_COPY]                    = sizeof(va_copy_expression_t),
349                 [EXPR_STATEMENT]                  = sizeof(statement_expression_t),
350                 [EXPR_LABEL_ADDRESS]              = sizeof(label_address_expression_t),
351         };
352         if (kind >= EXPR_UNARY_FIRST && kind <= EXPR_UNARY_LAST) {
353                 return sizes[EXPR_UNARY_FIRST];
354         }
355         if (kind >= EXPR_BINARY_FIRST && kind <= EXPR_BINARY_LAST) {
356                 return sizes[EXPR_BINARY_FIRST];
357         }
358         assert((size_t)kind < lengthof(sizes));
359         assert(sizes[kind] != 0);
360         return sizes[kind];
361 }
362
363 /**
364  * Allocate a statement node of given kind and initialize all
365  * fields with zero. Sets its source position to the position
366  * of the current token.
367  */
368 static statement_t *allocate_statement_zero(statement_kind_t kind)
369 {
370         size_t       size = get_statement_struct_size(kind);
371         statement_t *res  = allocate_ast_zero(size);
372
373         res->base.kind            = kind;
374         res->base.parent          = current_parent;
375         res->base.source_position = token.base.source_position;
376         return res;
377 }
378
379 /**
380  * Allocate an expression node of given kind and initialize all
381  * fields with zero.
382  *
383  * @param kind  the kind of the expression to allocate
384  */
385 static expression_t *allocate_expression_zero(expression_kind_t kind)
386 {
387         size_t        size = get_expression_struct_size(kind);
388         expression_t *res  = allocate_ast_zero(size);
389
390         res->base.kind            = kind;
391         res->base.type            = type_error_type;
392         res->base.source_position = token.base.source_position;
393         return res;
394 }
395
396 /**
397  * Creates a new invalid expression at the source position
398  * of the current token.
399  */
400 static expression_t *create_error_expression(void)
401 {
402         expression_t *expression = allocate_expression_zero(EXPR_ERROR);
403         expression->base.type = type_error_type;
404         return expression;
405 }
406
407 /**
408  * Creates a new invalid statement.
409  */
410 static statement_t *create_error_statement(void)
411 {
412         return allocate_statement_zero(STATEMENT_ERROR);
413 }
414
415 /**
416  * Allocate a new empty statement.
417  */
418 static statement_t *create_empty_statement(void)
419 {
420         return allocate_statement_zero(STATEMENT_EMPTY);
421 }
422
423 /**
424  * Returns the size of an initializer node.
425  *
426  * @param kind  the initializer kind
427  */
428 static size_t get_initializer_size(initializer_kind_t kind)
429 {
430         static const size_t sizes[] = {
431                 [INITIALIZER_VALUE]       = sizeof(initializer_value_t),
432                 [INITIALIZER_STRING]      = sizeof(initializer_string_t),
433                 [INITIALIZER_WIDE_STRING] = sizeof(initializer_wide_string_t),
434                 [INITIALIZER_LIST]        = sizeof(initializer_list_t),
435                 [INITIALIZER_DESIGNATOR]  = sizeof(initializer_designator_t)
436         };
437         assert((size_t)kind < lengthof(sizes));
438         assert(sizes[kind] != 0);
439         return sizes[kind];
440 }
441
442 /**
443  * Allocate an initializer node of given kind and initialize all
444  * fields with zero.
445  */
446 static initializer_t *allocate_initializer_zero(initializer_kind_t kind)
447 {
448         initializer_t *result = allocate_ast_zero(get_initializer_size(kind));
449         result->kind          = kind;
450
451         return result;
452 }
453
454 /**
455  * Returns the index of the top element of the environment stack.
456  */
457 static size_t environment_top(void)
458 {
459         return ARR_LEN(environment_stack);
460 }
461
462 /**
463  * Returns the index of the top element of the global label stack.
464  */
465 static size_t label_top(void)
466 {
467         return ARR_LEN(label_stack);
468 }
469
470 /**
471  * Return the next token.
472  */
473 static inline void next_token(void)
474 {
475         token                              = lookahead_buffer[lookahead_bufpos];
476         lookahead_buffer[lookahead_bufpos] = lexer_token;
477         lexer_next_token();
478
479         lookahead_bufpos = (lookahead_bufpos + 1) % MAX_LOOKAHEAD;
480
481 #ifdef PRINT_TOKENS
482         print_token(stderr, &token);
483         fprintf(stderr, "\n");
484 #endif
485 }
486
487 static inline bool next_if(int const type)
488 {
489         if (token.kind == type) {
490                 next_token();
491                 return true;
492         } else {
493                 return false;
494         }
495 }
496
497 /**
498  * Return the next token with a given lookahead.
499  */
500 static inline const token_t *look_ahead(size_t num)
501 {
502         assert(0 < num && num <= MAX_LOOKAHEAD);
503         size_t pos = (lookahead_bufpos + num - 1) % MAX_LOOKAHEAD;
504         return &lookahead_buffer[pos];
505 }
506
507 /**
508  * Adds a token type to the token type anchor set (a multi-set).
509  */
510 static void add_anchor_token(int token_kind)
511 {
512         assert(0 <= token_kind && token_kind < T_LAST_TOKEN);
513         ++token_anchor_set[token_kind];
514 }
515
516 /**
517  * Set the number of tokens types of the given type
518  * to zero and return the old count.
519  */
520 static int save_and_reset_anchor_state(int token_kind)
521 {
522         assert(0 <= token_kind && token_kind < T_LAST_TOKEN);
523         int count = token_anchor_set[token_kind];
524         token_anchor_set[token_kind] = 0;
525         return count;
526 }
527
528 /**
529  * Restore the number of token types to the given count.
530  */
531 static void restore_anchor_state(int token_kind, int count)
532 {
533         assert(0 <= token_kind && token_kind < T_LAST_TOKEN);
534         token_anchor_set[token_kind] = count;
535 }
536
537 /**
538  * Remove a token type from the token type anchor set (a multi-set).
539  */
540 static void rem_anchor_token(int token_kind)
541 {
542         assert(0 <= token_kind && token_kind < T_LAST_TOKEN);
543         assert(token_anchor_set[token_kind] != 0);
544         --token_anchor_set[token_kind];
545 }
546
547 /**
548  * Return true if the token type of the current token is
549  * in the anchor set.
550  */
551 static bool at_anchor(void)
552 {
553         if (token.kind < 0)
554                 return false;
555         return token_anchor_set[token.kind];
556 }
557
558 /**
559  * Eat tokens until a matching token type is found.
560  */
561 static void eat_until_matching_token(int type)
562 {
563         int end_token;
564         switch (type) {
565                 case '(': end_token = ')';  break;
566                 case '{': end_token = '}';  break;
567                 case '[': end_token = ']';  break;
568                 default:  end_token = type; break;
569         }
570
571         unsigned parenthesis_count = 0;
572         unsigned brace_count       = 0;
573         unsigned bracket_count     = 0;
574         while (token.kind        != end_token ||
575                parenthesis_count != 0         ||
576                brace_count       != 0         ||
577                bracket_count     != 0) {
578                 switch (token.kind) {
579                 case T_EOF: return;
580                 case '(': ++parenthesis_count; break;
581                 case '{': ++brace_count;       break;
582                 case '[': ++bracket_count;     break;
583
584                 case ')':
585                         if (parenthesis_count > 0)
586                                 --parenthesis_count;
587                         goto check_stop;
588
589                 case '}':
590                         if (brace_count > 0)
591                                 --brace_count;
592                         goto check_stop;
593
594                 case ']':
595                         if (bracket_count > 0)
596                                 --bracket_count;
597 check_stop:
598                         if (token.kind        == end_token &&
599                             parenthesis_count == 0         &&
600                             brace_count       == 0         &&
601                             bracket_count     == 0)
602                                 return;
603                         break;
604
605                 default:
606                         break;
607                 }
608                 next_token();
609         }
610 }
611
612 /**
613  * Eat input tokens until an anchor is found.
614  */
615 static void eat_until_anchor(void)
616 {
617         while (token_anchor_set[token.kind] == 0) {
618                 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
619                         eat_until_matching_token(token.kind);
620                 next_token();
621         }
622 }
623
624 /**
625  * Eat a whole block from input tokens.
626  */
627 static void eat_block(void)
628 {
629         eat_until_matching_token('{');
630         next_if('}');
631 }
632
633 #define eat(token_kind) (assert(token.kind == (token_kind)), next_token())
634
635 /**
636  * Report a parse error because an expected token was not found.
637  */
638 static
639 #if defined __GNUC__ && __GNUC__ >= 4
640 __attribute__((sentinel))
641 #endif
642 void parse_error_expected(const char *message, ...)
643 {
644         if (message != NULL) {
645                 errorf(HERE, "%s", message);
646         }
647         va_list ap;
648         va_start(ap, message);
649         errorf(HERE, "got %K, expected %#k", &token, &ap, ", ");
650         va_end(ap);
651 }
652
653 /**
654  * Report an incompatible type.
655  */
656 static void type_error_incompatible(const char *msg,
657                 const source_position_t *source_position, type_t *type1, type_t *type2)
658 {
659         errorf(source_position, "%s, incompatible types: '%T' - '%T'",
660                msg, type1, type2);
661 }
662
663 /**
664  * Expect the current token is the expected token.
665  * If not, generate an error, eat the current statement,
666  * and goto the error_label label.
667  */
668 #define expect(expected, error_label)                     \
669         do {                                                  \
670                 if (UNLIKELY(token.kind != (expected))) {         \
671                         parse_error_expected(NULL, (expected), NULL); \
672                         add_anchor_token(expected);                   \
673                         eat_until_anchor();                           \
674                         rem_anchor_token(expected);                   \
675                         if (token.kind != (expected))                 \
676                           goto error_label;                           \
677                 }                                                 \
678                 next_token();                                     \
679         } while (0)
680
681 /**
682  * Push a given scope on the scope stack and make it the
683  * current scope
684  */
685 static scope_t *scope_push(scope_t *new_scope)
686 {
687         if (current_scope != NULL) {
688                 new_scope->depth = current_scope->depth + 1;
689         }
690
691         scope_t *old_scope = current_scope;
692         current_scope      = new_scope;
693         return old_scope;
694 }
695
696 /**
697  * Pop the current scope from the scope stack.
698  */
699 static void scope_pop(scope_t *old_scope)
700 {
701         current_scope = old_scope;
702 }
703
704 /**
705  * Search an entity by its symbol in a given namespace.
706  */
707 static entity_t *get_entity(const symbol_t *const symbol,
708                             namespace_tag_t namespc)
709 {
710         entity_t *entity = symbol->entity;
711         for (; entity != NULL; entity = entity->base.symbol_next) {
712                 if ((namespace_tag_t)entity->base.namespc == namespc)
713                         return entity;
714         }
715
716         return NULL;
717 }
718
719 /* §6.2.3:1 24)  There is only one name space for tags even though three are
720  * possible. */
721 static entity_t *get_tag(symbol_t const *const symbol,
722                          entity_kind_tag_t const kind)
723 {
724         entity_t *entity = get_entity(symbol, NAMESPACE_TAG);
725         if (entity != NULL && (entity_kind_tag_t)entity->kind != kind) {
726                 errorf(HERE,
727                                 "'%Y' defined as wrong kind of tag (previous definition %P)",
728                                 symbol, &entity->base.source_position);
729                 entity = NULL;
730         }
731         return entity;
732 }
733
734 /**
735  * pushs an entity on the environment stack and links the corresponding symbol
736  * it.
737  */
738 static void stack_push(stack_entry_t **stack_ptr, entity_t *entity)
739 {
740         symbol_t           *symbol  = entity->base.symbol;
741         entity_namespace_t  namespc = entity->base.namespc;
742         assert(namespc != 0);
743
744         /* replace/add entity into entity list of the symbol */
745         entity_t **anchor;
746         entity_t  *iter;
747         for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
748                 iter = *anchor;
749                 if (iter == NULL)
750                         break;
751
752                 /* replace an entry? */
753                 if (iter->base.namespc == namespc) {
754                         entity->base.symbol_next = iter->base.symbol_next;
755                         break;
756                 }
757         }
758         *anchor = entity;
759
760         /* remember old declaration */
761         stack_entry_t entry;
762         entry.symbol     = symbol;
763         entry.old_entity = iter;
764         entry.namespc    = namespc;
765         ARR_APP1(stack_entry_t, *stack_ptr, entry);
766 }
767
768 /**
769  * Push an entity on the environment stack.
770  */
771 static void environment_push(entity_t *entity)
772 {
773         assert(entity->base.source_position.input_name != NULL);
774         assert(entity->base.parent_scope != NULL);
775         stack_push(&environment_stack, entity);
776 }
777
778 /**
779  * Push a declaration on the global label stack.
780  *
781  * @param declaration  the declaration
782  */
783 static void label_push(entity_t *label)
784 {
785         /* we abuse the parameters scope as parent for the labels */
786         label->base.parent_scope = &current_function->parameters;
787         stack_push(&label_stack, label);
788 }
789
790 /**
791  * pops symbols from the environment stack until @p new_top is the top element
792  */
793 static void stack_pop_to(stack_entry_t **stack_ptr, size_t new_top)
794 {
795         stack_entry_t *stack = *stack_ptr;
796         size_t         top   = ARR_LEN(stack);
797         size_t         i;
798
799         assert(new_top <= top);
800         if (new_top == top)
801                 return;
802
803         for (i = top; i > new_top; --i) {
804                 stack_entry_t *entry = &stack[i - 1];
805
806                 entity_t           *old_entity = entry->old_entity;
807                 symbol_t           *symbol     = entry->symbol;
808                 entity_namespace_t  namespc    = entry->namespc;
809
810                 /* replace with old_entity/remove */
811                 entity_t **anchor;
812                 entity_t  *iter;
813                 for (anchor = &symbol->entity; ; anchor = &iter->base.symbol_next) {
814                         iter = *anchor;
815                         assert(iter != NULL);
816                         /* replace an entry? */
817                         if (iter->base.namespc == namespc)
818                                 break;
819                 }
820
821                 /* restore definition from outer scopes (if there was one) */
822                 if (old_entity != NULL) {
823                         old_entity->base.symbol_next = iter->base.symbol_next;
824                         *anchor                      = old_entity;
825                 } else {
826                         /* remove entry from list */
827                         *anchor = iter->base.symbol_next;
828                 }
829         }
830
831         ARR_SHRINKLEN(*stack_ptr, new_top);
832 }
833
834 /**
835  * Pop all entries from the environment stack until the new_top
836  * is reached.
837  *
838  * @param new_top  the new stack top
839  */
840 static void environment_pop_to(size_t new_top)
841 {
842         stack_pop_to(&environment_stack, new_top);
843 }
844
845 /**
846  * Pop all entries from the global label stack until the new_top
847  * is reached.
848  *
849  * @param new_top  the new stack top
850  */
851 static void label_pop_to(size_t new_top)
852 {
853         stack_pop_to(&label_stack, new_top);
854 }
855
856 static atomic_type_kind_t get_akind(const type_t *type)
857 {
858         assert(type->kind == TYPE_ATOMIC || type->kind == TYPE_COMPLEX
859                || type->kind == TYPE_IMAGINARY || type->kind == TYPE_ENUM);
860         return type->atomic.akind;
861 }
862
863 /**
864  * §6.3.1.1:2  Do integer promotion for a given type.
865  *
866  * @param type  the type to promote
867  * @return the promoted type
868  */
869 static type_t *promote_integer(type_t *type)
870 {
871         if (get_akind_rank(get_akind(type)) < get_akind_rank(ATOMIC_TYPE_INT))
872                 type = type_int;
873
874         return type;
875 }
876
877 /**
878  * Check if a given expression represents a null pointer constant.
879  *
880  * @param expression  the expression to check
881  */
882 static bool is_null_pointer_constant(const expression_t *expression)
883 {
884         /* skip void* cast */
885         if (expression->kind == EXPR_UNARY_CAST) {
886                 type_t *const type = skip_typeref(expression->base.type);
887                 if (types_compatible(type, type_void_ptr))
888                         expression = expression->unary.value;
889         }
890
891         type_t *const type = skip_typeref(expression->base.type);
892         if (!is_type_integer(type))
893                 return false;
894         switch (is_constant_expression(expression)) {
895                 case EXPR_CLASS_ERROR:    return true;
896                 case EXPR_CLASS_CONSTANT: return !fold_constant_to_bool(expression);
897                 default:                  return false;
898         }
899 }
900
901 /**
902  * Create an implicit cast expression.
903  *
904  * @param expression  the expression to cast
905  * @param dest_type   the destination type
906  */
907 static expression_t *create_implicit_cast(expression_t *expression,
908                                           type_t *dest_type)
909 {
910         type_t *const source_type = expression->base.type;
911
912         if (source_type == dest_type)
913                 return expression;
914
915         expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
916         cast->unary.value   = expression;
917         cast->base.type     = dest_type;
918         cast->base.implicit = true;
919
920         return cast;
921 }
922
923 typedef enum assign_error_t {
924         ASSIGN_SUCCESS,
925         ASSIGN_ERROR_INCOMPATIBLE,
926         ASSIGN_ERROR_POINTER_QUALIFIER_MISSING,
927         ASSIGN_WARNING_POINTER_INCOMPATIBLE,
928         ASSIGN_WARNING_POINTER_FROM_INT,
929         ASSIGN_WARNING_INT_FROM_POINTER
930 } assign_error_t;
931
932 static void report_assign_error(assign_error_t error, type_t *orig_type_left, expression_t const *const right, char const *const context, source_position_t const *const pos)
933 {
934         type_t *const orig_type_right = right->base.type;
935         type_t *const type_left       = skip_typeref(orig_type_left);
936         type_t *const type_right      = skip_typeref(orig_type_right);
937
938         switch (error) {
939         case ASSIGN_SUCCESS:
940                 return;
941         case ASSIGN_ERROR_INCOMPATIBLE:
942                 errorf(pos, "destination type '%T' in %s is incompatible with type '%T'", orig_type_left, context, orig_type_right);
943                 return;
944
945         case ASSIGN_ERROR_POINTER_QUALIFIER_MISSING: {
946                 type_t *points_to_left  = skip_typeref(type_left->pointer.points_to);
947                 type_t *points_to_right = skip_typeref(type_right->pointer.points_to);
948
949                 /* the left type has all qualifiers from the right type */
950                 unsigned missing_qualifiers = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
951                 warningf(WARN_OTHER, pos, "destination type '%T' in %s from type '%T' lacks qualifiers '%Q' in pointer target type", orig_type_left, context, orig_type_right, missing_qualifiers);
952                 return;
953         }
954
955         case ASSIGN_WARNING_POINTER_INCOMPATIBLE:
956                 warningf(WARN_OTHER, pos, "destination type '%T' in %s is incompatible with '%E' of type '%T'", orig_type_left, context, right, orig_type_right);
957                 return;
958
959         case ASSIGN_WARNING_POINTER_FROM_INT:
960                 warningf(WARN_OTHER, pos, "%s makes pointer '%T' from integer '%T' without a cast", context, orig_type_left, orig_type_right);
961                 return;
962
963         case ASSIGN_WARNING_INT_FROM_POINTER:
964                 warningf(WARN_OTHER, pos, "%s makes integer '%T' from pointer '%T' without a cast", context, orig_type_left, orig_type_right);
965                 return;
966
967         default:
968                 panic("invalid error value");
969         }
970 }
971
972 /** Implements the rules from §6.5.16.1 */
973 static assign_error_t semantic_assign(type_t *orig_type_left,
974                                       const expression_t *const right)
975 {
976         type_t *const orig_type_right = right->base.type;
977         type_t *const type_left       = skip_typeref(orig_type_left);
978         type_t *const type_right      = skip_typeref(orig_type_right);
979
980         if (is_type_pointer(type_left)) {
981                 if (is_null_pointer_constant(right)) {
982                         return ASSIGN_SUCCESS;
983                 } else if (is_type_pointer(type_right)) {
984                         type_t *points_to_left
985                                 = skip_typeref(type_left->pointer.points_to);
986                         type_t *points_to_right
987                                 = skip_typeref(type_right->pointer.points_to);
988                         assign_error_t res = ASSIGN_SUCCESS;
989
990                         /* the left type has all qualifiers from the right type */
991                         unsigned missing_qualifiers
992                                 = points_to_right->base.qualifiers & ~points_to_left->base.qualifiers;
993                         if (missing_qualifiers != 0) {
994                                 res = ASSIGN_ERROR_POINTER_QUALIFIER_MISSING;
995                         }
996
997                         points_to_left  = get_unqualified_type(points_to_left);
998                         points_to_right = get_unqualified_type(points_to_right);
999
1000                         if (is_type_atomic(points_to_left, ATOMIC_TYPE_VOID))
1001                                 return res;
1002
1003                         if (is_type_atomic(points_to_right, ATOMIC_TYPE_VOID)) {
1004                                 /* ISO/IEC 14882:1998(E) §C.1.2:6 */
1005                                 return c_mode & _CXX ? ASSIGN_ERROR_INCOMPATIBLE : res;
1006                         }
1007
1008                         if (!types_compatible(points_to_left, points_to_right)) {
1009                                 return ASSIGN_WARNING_POINTER_INCOMPATIBLE;
1010                         }
1011
1012                         return res;
1013                 } else if (is_type_integer(type_right)) {
1014                         return ASSIGN_WARNING_POINTER_FROM_INT;
1015                 }
1016         } else if ((is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) ||
1017                         (is_type_atomic(type_left, ATOMIC_TYPE_BOOL)
1018                                 && is_type_pointer(type_right))) {
1019                 return ASSIGN_SUCCESS;
1020         } else if (is_type_compound(type_left) && is_type_compound(type_right)) {
1021                 type_t *const unqual_type_left  = get_unqualified_type(type_left);
1022                 type_t *const unqual_type_right = get_unqualified_type(type_right);
1023                 if (types_compatible(unqual_type_left, unqual_type_right)) {
1024                         return ASSIGN_SUCCESS;
1025                 }
1026         } else if (is_type_integer(type_left) && is_type_pointer(type_right)) {
1027                 return ASSIGN_WARNING_INT_FROM_POINTER;
1028         }
1029
1030         if (!is_type_valid(type_left) || !is_type_valid(type_right))
1031                 return ASSIGN_SUCCESS;
1032
1033         return ASSIGN_ERROR_INCOMPATIBLE;
1034 }
1035
1036 static expression_t *parse_constant_expression(void)
1037 {
1038         expression_t *result = parse_subexpression(PREC_CONDITIONAL);
1039
1040         if (is_constant_expression(result) == EXPR_CLASS_VARIABLE) {
1041                 errorf(&result->base.source_position,
1042                        "expression '%E' is not constant", result);
1043         }
1044
1045         return result;
1046 }
1047
1048 static expression_t *parse_assignment_expression(void)
1049 {
1050         return parse_subexpression(PREC_ASSIGNMENT);
1051 }
1052
1053 static void warn_string_concat(const source_position_t *pos)
1054 {
1055         warningf(WARN_TRADITIONAL, pos, "traditional C rejects string constant concatenation");
1056 }
1057
1058 static string_t parse_string_literals(void)
1059 {
1060         assert(token.kind == T_STRING_LITERAL);
1061         string_t result = token.string.string;
1062
1063         next_token();
1064
1065         while (token.kind == T_STRING_LITERAL) {
1066                 warn_string_concat(&token.base.source_position);
1067                 result = concat_strings(&result, &token.string.string);
1068                 next_token();
1069         }
1070
1071         return result;
1072 }
1073
1074 /**
1075  * compare two string, ignoring double underscores on the second.
1076  */
1077 static int strcmp_underscore(const char *s1, const char *s2)
1078 {
1079         if (s2[0] == '_' && s2[1] == '_') {
1080                 size_t len2 = strlen(s2);
1081                 size_t len1 = strlen(s1);
1082                 if (len1 == len2-4 && s2[len2-2] == '_' && s2[len2-1] == '_') {
1083                         return strncmp(s1, s2+2, len2-4);
1084                 }
1085         }
1086
1087         return strcmp(s1, s2);
1088 }
1089
1090 static attribute_t *allocate_attribute_zero(attribute_kind_t kind)
1091 {
1092         attribute_t *attribute = allocate_ast_zero(sizeof(*attribute));
1093         attribute->kind            = kind;
1094         attribute->source_position = *HERE;
1095         return attribute;
1096 }
1097
1098 /**
1099  * Parse (gcc) attribute argument. From gcc comments in gcc source:
1100  *
1101  *  attribute:
1102  *    __attribute__ ( ( attribute-list ) )
1103  *
1104  *  attribute-list:
1105  *    attrib
1106  *    attribute_list , attrib
1107  *
1108  *  attrib:
1109  *    empty
1110  *    any-word
1111  *    any-word ( identifier )
1112  *    any-word ( identifier , nonempty-expr-list )
1113  *    any-word ( expr-list )
1114  *
1115  *  where the "identifier" must not be declared as a type, and
1116  *  "any-word" may be any identifier (including one declared as a
1117  *  type), a reserved word storage class specifier, type specifier or
1118  *  type qualifier.  ??? This still leaves out most reserved keywords
1119  *  (following the old parser), shouldn't we include them, and why not
1120  *  allow identifiers declared as types to start the arguments?
1121  *
1122  *  Matze: this all looks confusing and little systematic, so we're even less
1123  *  strict and parse any list of things which are identifiers or
1124  *  (assignment-)expressions.
1125  */
1126 static attribute_argument_t *parse_attribute_arguments(void)
1127 {
1128         attribute_argument_t  *first  = NULL;
1129         attribute_argument_t **anchor = &first;
1130         if (token.kind != ')') do {
1131                 attribute_argument_t *argument = allocate_ast_zero(sizeof(*argument));
1132
1133                 /* is it an identifier */
1134                 if (token.kind == T_IDENTIFIER
1135                                 && (look_ahead(1)->kind == ',' || look_ahead(1)->kind == ')')) {
1136                         symbol_t *symbol   = token.identifier.symbol;
1137                         argument->kind     = ATTRIBUTE_ARGUMENT_SYMBOL;
1138                         argument->v.symbol = symbol;
1139                         next_token();
1140                 } else {
1141                         /* must be an expression */
1142                         expression_t *expression = parse_assignment_expression();
1143
1144                         argument->kind         = ATTRIBUTE_ARGUMENT_EXPRESSION;
1145                         argument->v.expression = expression;
1146                 }
1147
1148                 /* append argument */
1149                 *anchor = argument;
1150                 anchor  = &argument->next;
1151         } while (next_if(','));
1152         expect(')', end_error);
1153
1154         return first;
1155
1156 end_error:
1157         /* TODO... */
1158         return first;
1159 }
1160
1161 static attribute_t *parse_attribute_asm(void)
1162 {
1163         attribute_t *attribute = allocate_attribute_zero(ATTRIBUTE_GNU_ASM);
1164         eat(T_asm);
1165
1166         expect('(', end_error);
1167         attribute->a.arguments = parse_attribute_arguments();
1168         return attribute;
1169
1170 end_error:
1171         return NULL;
1172 }
1173
1174 static symbol_t *get_symbol_from_token(void)
1175 {
1176         switch(token.kind) {
1177         case T_IDENTIFIER:
1178                 return token.identifier.symbol;
1179         case T_auto:
1180         case T_char:
1181         case T_double:
1182         case T_enum:
1183         case T_extern:
1184         case T_float:
1185         case T_int:
1186         case T_long:
1187         case T_register:
1188         case T_short:
1189         case T_static:
1190         case T_struct:
1191         case T_union:
1192         case T_unsigned:
1193         case T_void:
1194         case T_bool:
1195         case T__Bool:
1196         case T_class:
1197         case T_explicit:
1198         case T_export:
1199         case T_wchar_t:
1200         case T_const:
1201         case T_signed:
1202         case T___real__:
1203         case T___imag__:
1204         case T_restrict:
1205         case T_volatile:
1206         case T_inline:
1207                 /* maybe we need more tokens ... add them on demand */
1208                 return get_token_kind_symbol(token.kind);
1209         default:
1210                 return NULL;
1211         }
1212 }
1213
1214 static attribute_t *parse_attribute_gnu_single(void)
1215 {
1216         /* parse "any-word" */
1217         symbol_t *symbol = get_symbol_from_token();
1218         if (symbol == NULL) {
1219                 parse_error_expected("while parsing attribute((", T_IDENTIFIER, NULL);
1220                 return NULL;
1221         }
1222
1223         attribute_kind_t  kind;
1224         char const *const name = symbol->string;
1225         for (kind = ATTRIBUTE_GNU_FIRST;; ++kind) {
1226                 if (kind > ATTRIBUTE_GNU_LAST) {
1227                         warningf(WARN_ATTRIBUTE, HERE, "unknown attribute '%s' ignored", name);
1228                         /* TODO: we should still save the attribute in the list... */
1229                         kind = ATTRIBUTE_UNKNOWN;
1230                         break;
1231                 }
1232
1233                 const char *attribute_name = get_attribute_name(kind);
1234                 if (attribute_name != NULL
1235                                 && strcmp_underscore(attribute_name, name) == 0)
1236                         break;
1237         }
1238
1239         attribute_t *attribute = allocate_attribute_zero(kind);
1240         next_token();
1241
1242         /* parse arguments */
1243         if (next_if('('))
1244                 attribute->a.arguments = parse_attribute_arguments();
1245
1246         return attribute;
1247 }
1248
1249 static attribute_t *parse_attribute_gnu(void)
1250 {
1251         attribute_t  *first  = NULL;
1252         attribute_t **anchor = &first;
1253
1254         eat(T___attribute__);
1255         expect('(', end_error);
1256         expect('(', end_error);
1257
1258         if (token.kind != ')') do {
1259                 attribute_t *attribute = parse_attribute_gnu_single();
1260                 if (attribute == NULL)
1261                         goto end_error;
1262
1263                 *anchor = attribute;
1264                 anchor  = &attribute->next;
1265         } while (next_if(','));
1266         expect(')', end_error);
1267         expect(')', end_error);
1268
1269 end_error:
1270         return first;
1271 }
1272
1273 /** Parse attributes. */
1274 static attribute_t *parse_attributes(attribute_t *first)
1275 {
1276         attribute_t **anchor = &first;
1277         for (;;) {
1278                 while (*anchor != NULL)
1279                         anchor = &(*anchor)->next;
1280
1281                 attribute_t *attribute;
1282                 switch (token.kind) {
1283                 case T___attribute__:
1284                         attribute = parse_attribute_gnu();
1285                         if (attribute == NULL)
1286                                 continue;
1287                         break;
1288
1289                 case T_asm:
1290                         attribute = parse_attribute_asm();
1291                         break;
1292
1293                 case T_cdecl:
1294                         attribute = allocate_attribute_zero(ATTRIBUTE_MS_CDECL);
1295                         eat(T_cdecl);
1296                         break;
1297
1298                 case T__fastcall:
1299                         attribute = allocate_attribute_zero(ATTRIBUTE_MS_FASTCALL);
1300                         eat(T__fastcall);
1301                         break;
1302
1303                 case T__forceinline:
1304                         attribute = allocate_attribute_zero(ATTRIBUTE_MS_FORCEINLINE);
1305                         eat(T__forceinline);
1306                         break;
1307
1308                 case T__stdcall:
1309                         attribute = allocate_attribute_zero(ATTRIBUTE_MS_STDCALL);
1310                         eat(T__stdcall);
1311                         break;
1312
1313                 case T___thiscall:
1314                         /* TODO record modifier */
1315                         warningf(WARN_OTHER, HERE, "Ignoring declaration modifier %K", &token);
1316                         attribute = allocate_attribute_zero(ATTRIBUTE_MS_THISCALL);
1317                         eat(T___thiscall);
1318                         break;
1319
1320                 default:
1321                         return first;
1322                 }
1323
1324                 *anchor = attribute;
1325                 anchor  = &attribute->next;
1326         }
1327 }
1328
1329 static void mark_vars_read(expression_t *expr, entity_t *lhs_ent);
1330
1331 static entity_t *determine_lhs_ent(expression_t *const expr,
1332                                    entity_t *lhs_ent)
1333 {
1334         switch (expr->kind) {
1335                 case EXPR_REFERENCE: {
1336                         entity_t *const entity = expr->reference.entity;
1337                         /* we should only find variables as lvalues... */
1338                         if (entity->base.kind != ENTITY_VARIABLE
1339                                         && entity->base.kind != ENTITY_PARAMETER)
1340                                 return NULL;
1341
1342                         return entity;
1343                 }
1344
1345                 case EXPR_ARRAY_ACCESS: {
1346                         expression_t *const ref = expr->array_access.array_ref;
1347                         entity_t     *      ent = NULL;
1348                         if (is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1349                                 ent     = determine_lhs_ent(ref, lhs_ent);
1350                                 lhs_ent = ent;
1351                         } else {
1352                                 mark_vars_read(ref, lhs_ent);
1353                         }
1354                         mark_vars_read(expr->array_access.index, lhs_ent);
1355                         return ent;
1356                 }
1357
1358                 case EXPR_SELECT: {
1359                         mark_vars_read(expr->select.compound, lhs_ent);
1360                         if (is_type_compound(skip_typeref(expr->base.type)))
1361                                 return determine_lhs_ent(expr->select.compound, lhs_ent);
1362                         return NULL;
1363                 }
1364
1365                 case EXPR_UNARY_DEREFERENCE: {
1366                         expression_t *const val = expr->unary.value;
1367                         if (val->kind == EXPR_UNARY_TAKE_ADDRESS) {
1368                                 /* *&x is a NOP */
1369                                 return determine_lhs_ent(val->unary.value, lhs_ent);
1370                         } else {
1371                                 mark_vars_read(val, NULL);
1372                                 return NULL;
1373                         }
1374                 }
1375
1376                 default:
1377                         mark_vars_read(expr, NULL);
1378                         return NULL;
1379         }
1380 }
1381
1382 #define ENT_ANY ((entity_t*)-1)
1383
1384 /**
1385  * Mark declarations, which are read.  This is used to detect variables, which
1386  * are never read.
1387  * Example:
1388  * x = x + 1;
1389  *   x is not marked as "read", because it is only read to calculate its own new
1390  *   value.
1391  *
1392  * x += y; y += x;
1393  *   x and y are not detected as "not read", because multiple variables are
1394  *   involved.
1395  */
1396 static void mark_vars_read(expression_t *const expr, entity_t *lhs_ent)
1397 {
1398         switch (expr->kind) {
1399                 case EXPR_REFERENCE: {
1400                         entity_t *const entity = expr->reference.entity;
1401                         if (entity->kind != ENTITY_VARIABLE
1402                                         && entity->kind != ENTITY_PARAMETER)
1403                                 return;
1404
1405                         if (lhs_ent != entity && lhs_ent != ENT_ANY) {
1406                                 if (entity->kind == ENTITY_VARIABLE) {
1407                                         entity->variable.read = true;
1408                                 } else {
1409                                         entity->parameter.read = true;
1410                                 }
1411                         }
1412                         return;
1413                 }
1414
1415                 case EXPR_CALL:
1416                         // TODO respect pure/const
1417                         mark_vars_read(expr->call.function, NULL);
1418                         for (call_argument_t *arg = expr->call.arguments; arg != NULL; arg = arg->next) {
1419                                 mark_vars_read(arg->expression, NULL);
1420                         }
1421                         return;
1422
1423                 case EXPR_CONDITIONAL:
1424                         // TODO lhs_decl should depend on whether true/false have an effect
1425                         mark_vars_read(expr->conditional.condition, NULL);
1426                         if (expr->conditional.true_expression != NULL)
1427                                 mark_vars_read(expr->conditional.true_expression, lhs_ent);
1428                         mark_vars_read(expr->conditional.false_expression, lhs_ent);
1429                         return;
1430
1431                 case EXPR_SELECT:
1432                         if (lhs_ent == ENT_ANY
1433                                         && !is_type_compound(skip_typeref(expr->base.type)))
1434                                 lhs_ent = NULL;
1435                         mark_vars_read(expr->select.compound, lhs_ent);
1436                         return;
1437
1438                 case EXPR_ARRAY_ACCESS: {
1439                         mark_vars_read(expr->array_access.index, lhs_ent);
1440                         expression_t *const ref = expr->array_access.array_ref;
1441                         if (!is_type_array(skip_typeref(revert_automatic_type_conversion(ref)))) {
1442                                 if (lhs_ent == ENT_ANY)
1443                                         lhs_ent = NULL;
1444                         }
1445                         mark_vars_read(ref, lhs_ent);
1446                         return;
1447                 }
1448
1449                 case EXPR_VA_ARG:
1450                         mark_vars_read(expr->va_arge.ap, lhs_ent);
1451                         return;
1452
1453                 case EXPR_VA_COPY:
1454                         mark_vars_read(expr->va_copye.src, lhs_ent);
1455                         return;
1456
1457                 case EXPR_UNARY_CAST:
1458                         /* Special case: Use void cast to mark a variable as "read" */
1459                         if (is_type_atomic(skip_typeref(expr->base.type), ATOMIC_TYPE_VOID))
1460                                 lhs_ent = NULL;
1461                         goto unary;
1462
1463
1464                 case EXPR_UNARY_THROW:
1465                         if (expr->unary.value == NULL)
1466                                 return;
1467                         /* FALLTHROUGH */
1468                 case EXPR_UNARY_DEREFERENCE:
1469                 case EXPR_UNARY_DELETE:
1470                 case EXPR_UNARY_DELETE_ARRAY:
1471                         if (lhs_ent == ENT_ANY)
1472                                 lhs_ent = NULL;
1473                         goto unary;
1474
1475                 case EXPR_UNARY_NEGATE:
1476                 case EXPR_UNARY_PLUS:
1477                 case EXPR_UNARY_BITWISE_NEGATE:
1478                 case EXPR_UNARY_NOT:
1479                 case EXPR_UNARY_TAKE_ADDRESS:
1480                 case EXPR_UNARY_POSTFIX_INCREMENT:
1481                 case EXPR_UNARY_POSTFIX_DECREMENT:
1482                 case EXPR_UNARY_PREFIX_INCREMENT:
1483                 case EXPR_UNARY_PREFIX_DECREMENT:
1484                 case EXPR_UNARY_ASSUME:
1485 unary:
1486                         mark_vars_read(expr->unary.value, lhs_ent);
1487                         return;
1488
1489                 case EXPR_BINARY_ADD:
1490                 case EXPR_BINARY_SUB:
1491                 case EXPR_BINARY_MUL:
1492                 case EXPR_BINARY_DIV:
1493                 case EXPR_BINARY_MOD:
1494                 case EXPR_BINARY_EQUAL:
1495                 case EXPR_BINARY_NOTEQUAL:
1496                 case EXPR_BINARY_LESS:
1497                 case EXPR_BINARY_LESSEQUAL:
1498                 case EXPR_BINARY_GREATER:
1499                 case EXPR_BINARY_GREATEREQUAL:
1500                 case EXPR_BINARY_BITWISE_AND:
1501                 case EXPR_BINARY_BITWISE_OR:
1502                 case EXPR_BINARY_BITWISE_XOR:
1503                 case EXPR_BINARY_LOGICAL_AND:
1504                 case EXPR_BINARY_LOGICAL_OR:
1505                 case EXPR_BINARY_SHIFTLEFT:
1506                 case EXPR_BINARY_SHIFTRIGHT:
1507                 case EXPR_BINARY_COMMA:
1508                 case EXPR_BINARY_ISGREATER:
1509                 case EXPR_BINARY_ISGREATEREQUAL:
1510                 case EXPR_BINARY_ISLESS:
1511                 case EXPR_BINARY_ISLESSEQUAL:
1512                 case EXPR_BINARY_ISLESSGREATER:
1513                 case EXPR_BINARY_ISUNORDERED:
1514                         mark_vars_read(expr->binary.left,  lhs_ent);
1515                         mark_vars_read(expr->binary.right, lhs_ent);
1516                         return;
1517
1518                 case EXPR_BINARY_ASSIGN:
1519                 case EXPR_BINARY_MUL_ASSIGN:
1520                 case EXPR_BINARY_DIV_ASSIGN:
1521                 case EXPR_BINARY_MOD_ASSIGN:
1522                 case EXPR_BINARY_ADD_ASSIGN:
1523                 case EXPR_BINARY_SUB_ASSIGN:
1524                 case EXPR_BINARY_SHIFTLEFT_ASSIGN:
1525                 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:
1526                 case EXPR_BINARY_BITWISE_AND_ASSIGN:
1527                 case EXPR_BINARY_BITWISE_XOR_ASSIGN:
1528                 case EXPR_BINARY_BITWISE_OR_ASSIGN: {
1529                         if (lhs_ent == ENT_ANY)
1530                                 lhs_ent = NULL;
1531                         lhs_ent = determine_lhs_ent(expr->binary.left, lhs_ent);
1532                         mark_vars_read(expr->binary.right, lhs_ent);
1533                         return;
1534                 }
1535
1536                 case EXPR_VA_START:
1537                         determine_lhs_ent(expr->va_starte.ap, lhs_ent);
1538                         return;
1539
1540                 EXPR_LITERAL_CASES
1541                 case EXPR_ERROR:
1542                 case EXPR_STRING_LITERAL:
1543                 case EXPR_WIDE_STRING_LITERAL:
1544                 case EXPR_COMPOUND_LITERAL: // TODO init?
1545                 case EXPR_SIZEOF:
1546                 case EXPR_CLASSIFY_TYPE:
1547                 case EXPR_ALIGNOF:
1548                 case EXPR_FUNCNAME:
1549                 case EXPR_BUILTIN_CONSTANT_P:
1550                 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
1551                 case EXPR_OFFSETOF:
1552                 case EXPR_STATEMENT: // TODO
1553                 case EXPR_LABEL_ADDRESS:
1554                 case EXPR_REFERENCE_ENUM_VALUE:
1555                         return;
1556         }
1557
1558         panic("unhandled expression");
1559 }
1560
1561 static designator_t *parse_designation(void)
1562 {
1563         designator_t  *result = NULL;
1564         designator_t **anchor = &result;
1565
1566         for (;;) {
1567                 designator_t *designator;
1568                 switch (token.kind) {
1569                 case '[':
1570                         designator = allocate_ast_zero(sizeof(designator[0]));
1571                         designator->source_position = token.base.source_position;
1572                         next_token();
1573                         add_anchor_token(']');
1574                         designator->array_index = parse_constant_expression();
1575                         rem_anchor_token(']');
1576                         expect(']', end_error);
1577                         break;
1578                 case '.':
1579                         designator = allocate_ast_zero(sizeof(designator[0]));
1580                         designator->source_position = token.base.source_position;
1581                         next_token();
1582                         if (token.kind != T_IDENTIFIER) {
1583                                 parse_error_expected("while parsing designator",
1584                                                      T_IDENTIFIER, NULL);
1585                                 return NULL;
1586                         }
1587                         designator->symbol = token.identifier.symbol;
1588                         next_token();
1589                         break;
1590                 default:
1591                         expect('=', end_error);
1592                         return result;
1593                 }
1594
1595                 assert(designator != NULL);
1596                 *anchor = designator;
1597                 anchor  = &designator->next;
1598         }
1599 end_error:
1600         return NULL;
1601 }
1602
1603 static initializer_t *initializer_from_string(array_type_t *const type,
1604                                               const string_t *const string)
1605 {
1606         /* TODO: check len vs. size of array type */
1607         (void) type;
1608
1609         initializer_t *initializer = allocate_initializer_zero(INITIALIZER_STRING);
1610         initializer->string.string = *string;
1611
1612         return initializer;
1613 }
1614
1615 static initializer_t *initializer_from_wide_string(array_type_t *const type,
1616                                                    const string_t *const string)
1617 {
1618         /* TODO: check len vs. size of array type */
1619         (void) type;
1620
1621         initializer_t *const initializer =
1622                 allocate_initializer_zero(INITIALIZER_WIDE_STRING);
1623         initializer->wide_string.string = *string;
1624
1625         return initializer;
1626 }
1627
1628 /**
1629  * Build an initializer from a given expression.
1630  */
1631 static initializer_t *initializer_from_expression(type_t *orig_type,
1632                                                   expression_t *expression)
1633 {
1634         /* TODO check that expression is a constant expression */
1635
1636         /* §6.7.8.14/15 char array may be initialized by string literals */
1637         type_t *type           = skip_typeref(orig_type);
1638         type_t *expr_type_orig = expression->base.type;
1639         type_t *expr_type      = skip_typeref(expr_type_orig);
1640
1641         if (is_type_array(type) && expr_type->kind == TYPE_POINTER) {
1642                 array_type_t *const array_type   = &type->array;
1643                 type_t       *const element_type = skip_typeref(array_type->element_type);
1644
1645                 if (element_type->kind == TYPE_ATOMIC) {
1646                         atomic_type_kind_t akind = element_type->atomic.akind;
1647                         switch (expression->kind) {
1648                         case EXPR_STRING_LITERAL:
1649                                 if (akind == ATOMIC_TYPE_CHAR
1650                                                 || akind == ATOMIC_TYPE_SCHAR
1651                                                 || akind == ATOMIC_TYPE_UCHAR) {
1652                                         return initializer_from_string(array_type,
1653                                                         &expression->string_literal.value);
1654                                 }
1655                                 break;
1656
1657                         case EXPR_WIDE_STRING_LITERAL: {
1658                                 type_t *bare_wchar_type = skip_typeref(type_wchar_t);
1659                                 if (get_unqualified_type(element_type) == bare_wchar_type) {
1660                                         return initializer_from_wide_string(array_type,
1661                                                         &expression->string_literal.value);
1662                                 }
1663                                 break;
1664                         }
1665
1666                         default:
1667                                 break;
1668                         }
1669                 }
1670         }
1671
1672         assign_error_t error = semantic_assign(type, expression);
1673         if (error == ASSIGN_ERROR_INCOMPATIBLE)
1674                 return NULL;
1675         report_assign_error(error, type, expression, "initializer",
1676                             &expression->base.source_position);
1677
1678         initializer_t *const result = allocate_initializer_zero(INITIALIZER_VALUE);
1679         result->value.value = create_implicit_cast(expression, type);
1680
1681         return result;
1682 }
1683
1684 /**
1685  * Checks if a given expression can be used as a constant initializer.
1686  */
1687 static bool is_initializer_constant(const expression_t *expression)
1688 {
1689         return is_constant_expression(expression) != EXPR_CLASS_VARIABLE ||
1690                is_linker_constant(expression)     != EXPR_CLASS_VARIABLE;
1691 }
1692
1693 /**
1694  * Parses an scalar initializer.
1695  *
1696  * §6.7.8.11; eat {} without warning
1697  */
1698 static initializer_t *parse_scalar_initializer(type_t *type,
1699                                                bool must_be_constant)
1700 {
1701         /* there might be extra {} hierarchies */
1702         int braces = 0;
1703         if (token.kind == '{') {
1704                 warningf(WARN_OTHER, HERE, "extra curly braces around scalar initializer");
1705                 do {
1706                         eat('{');
1707                         ++braces;
1708                 } while (token.kind == '{');
1709         }
1710
1711         expression_t *expression = parse_assignment_expression();
1712         mark_vars_read(expression, NULL);
1713         if (must_be_constant && !is_initializer_constant(expression)) {
1714                 errorf(&expression->base.source_position,
1715                        "initialisation expression '%E' is not constant",
1716                        expression);
1717         }
1718
1719         initializer_t *initializer = initializer_from_expression(type, expression);
1720
1721         if (initializer == NULL) {
1722                 errorf(&expression->base.source_position,
1723                        "expression '%E' (type '%T') doesn't match expected type '%T'",
1724                        expression, expression->base.type, type);
1725                 /* TODO */
1726                 return NULL;
1727         }
1728
1729         bool additional_warning_displayed = false;
1730         while (braces > 0) {
1731                 next_if(',');
1732                 if (token.kind != '}') {
1733                         if (!additional_warning_displayed) {
1734                                 warningf(WARN_OTHER, HERE, "additional elements in scalar initializer");
1735                                 additional_warning_displayed = true;
1736                         }
1737                 }
1738                 eat_block();
1739                 braces--;
1740         }
1741
1742         return initializer;
1743 }
1744
1745 /**
1746  * An entry in the type path.
1747  */
1748 typedef struct type_path_entry_t type_path_entry_t;
1749 struct type_path_entry_t {
1750         type_t *type;       /**< the upper top type. restored to path->top_tye if this entry is popped. */
1751         union {
1752                 size_t         index;          /**< For array types: the current index. */
1753                 declaration_t *compound_entry; /**< For compound types: the current declaration. */
1754         } v;
1755 };
1756
1757 /**
1758  * A type path expression a position inside compound or array types.
1759  */
1760 typedef struct type_path_t type_path_t;
1761 struct type_path_t {
1762         type_path_entry_t *path;         /**< An flexible array containing the current path. */
1763         type_t            *top_type;     /**< type of the element the path points */
1764         size_t             max_index;    /**< largest index in outermost array */
1765 };
1766
1767 /**
1768  * Prints a type path for debugging.
1769  */
1770 static __attribute__((unused)) void debug_print_type_path(
1771                 const type_path_t *path)
1772 {
1773         size_t len = ARR_LEN(path->path);
1774
1775         for (size_t i = 0; i < len; ++i) {
1776                 const type_path_entry_t *entry = & path->path[i];
1777
1778                 type_t *type = skip_typeref(entry->type);
1779                 if (is_type_compound(type)) {
1780                         /* in gcc mode structs can have no members */
1781                         if (entry->v.compound_entry == NULL) {
1782                                 assert(i == len-1);
1783                                 continue;
1784                         }
1785                         fprintf(stderr, ".%s",
1786                                 entry->v.compound_entry->base.symbol->string);
1787                 } else if (is_type_array(type)) {
1788                         fprintf(stderr, "[%u]", (unsigned) entry->v.index);
1789                 } else {
1790                         fprintf(stderr, "-INVALID-");
1791                 }
1792         }
1793         if (path->top_type != NULL) {
1794                 fprintf(stderr, "  (");
1795                 print_type(path->top_type);
1796                 fprintf(stderr, ")");
1797         }
1798 }
1799
1800 /**
1801  * Return the top type path entry, ie. in a path
1802  * (type).a.b returns the b.
1803  */
1804 static type_path_entry_t *get_type_path_top(const type_path_t *path)
1805 {
1806         size_t len = ARR_LEN(path->path);
1807         assert(len > 0);
1808         return &path->path[len-1];
1809 }
1810
1811 /**
1812  * Enlarge the type path by an (empty) element.
1813  */
1814 static type_path_entry_t *append_to_type_path(type_path_t *path)
1815 {
1816         size_t len = ARR_LEN(path->path);
1817         ARR_RESIZE(type_path_entry_t, path->path, len+1);
1818
1819         type_path_entry_t *result = & path->path[len];
1820         memset(result, 0, sizeof(result[0]));
1821         return result;
1822 }
1823
1824 /**
1825  * Descending into a sub-type. Enter the scope of the current top_type.
1826  */
1827 static void descend_into_subtype(type_path_t *path)
1828 {
1829         type_t *orig_top_type = path->top_type;
1830         type_t *top_type      = skip_typeref(orig_top_type);
1831
1832         type_path_entry_t *top = append_to_type_path(path);
1833         top->type              = top_type;
1834
1835         if (is_type_compound(top_type)) {
1836                 compound_t *const compound = top_type->compound.compound;
1837                 entity_t   *const entry    = skip_unnamed_bitfields(compound->members.entities);
1838
1839                 if (entry != NULL) {
1840                         top->v.compound_entry = &entry->declaration;
1841                         path->top_type = entry->declaration.type;
1842                 } else {
1843                         path->top_type = NULL;
1844                 }
1845         } else if (is_type_array(top_type)) {
1846                 top->v.index   = 0;
1847                 path->top_type = top_type->array.element_type;
1848         } else {
1849                 assert(!is_type_valid(top_type));
1850         }
1851 }
1852
1853 /**
1854  * Pop an entry from the given type path, ie. returning from
1855  * (type).a.b to (type).a
1856  */
1857 static void ascend_from_subtype(type_path_t *path)
1858 {
1859         type_path_entry_t *top = get_type_path_top(path);
1860
1861         path->top_type = top->type;
1862
1863         size_t len = ARR_LEN(path->path);
1864         ARR_RESIZE(type_path_entry_t, path->path, len-1);
1865 }
1866
1867 /**
1868  * Pop entries from the given type path until the given
1869  * path level is reached.
1870  */
1871 static void ascend_to(type_path_t *path, size_t top_path_level)
1872 {
1873         size_t len = ARR_LEN(path->path);
1874
1875         while (len > top_path_level) {
1876                 ascend_from_subtype(path);
1877                 len = ARR_LEN(path->path);
1878         }
1879 }
1880
1881 static bool walk_designator(type_path_t *path, const designator_t *designator,
1882                             bool used_in_offsetof)
1883 {
1884         for (; designator != NULL; designator = designator->next) {
1885                 type_path_entry_t *top       = get_type_path_top(path);
1886                 type_t            *orig_type = top->type;
1887
1888                 type_t *type = skip_typeref(orig_type);
1889
1890                 if (designator->symbol != NULL) {
1891                         symbol_t *symbol = designator->symbol;
1892                         if (!is_type_compound(type)) {
1893                                 if (is_type_valid(type)) {
1894                                         errorf(&designator->source_position,
1895                                                "'.%Y' designator used for non-compound type '%T'",
1896                                                symbol, orig_type);
1897                                 }
1898
1899                                 top->type             = type_error_type;
1900                                 top->v.compound_entry = NULL;
1901                                 orig_type             = type_error_type;
1902                         } else {
1903                                 compound_t *compound = type->compound.compound;
1904                                 entity_t   *iter     = compound->members.entities;
1905                                 for (; iter != NULL; iter = iter->base.next) {
1906                                         if (iter->base.symbol == symbol) {
1907                                                 break;
1908                                         }
1909                                 }
1910                                 if (iter == NULL) {
1911                                         errorf(&designator->source_position,
1912                                                "'%T' has no member named '%Y'", orig_type, symbol);
1913                                         return false;
1914                                 }
1915                                 assert(iter->kind == ENTITY_COMPOUND_MEMBER);
1916                                 if (used_in_offsetof && iter->compound_member.bitfield) {
1917                                         errorf(&designator->source_position,
1918                                                    "offsetof designator '%Y' must not specify bitfield",
1919                                                    symbol);
1920                                         return false;
1921                                 }
1922
1923                                 top->type             = orig_type;
1924                                 top->v.compound_entry = &iter->declaration;
1925                                 orig_type             = iter->declaration.type;
1926                         }
1927                 } else {
1928                         expression_t *array_index = designator->array_index;
1929                         assert(designator->array_index != NULL);
1930
1931                         if (!is_type_array(type)) {
1932                                 if (is_type_valid(type)) {
1933                                         errorf(&designator->source_position,
1934                                                "[%E] designator used for non-array type '%T'",
1935                                                array_index, orig_type);
1936                                 }
1937                                 return false;
1938                         }
1939
1940                         long index = fold_constant_to_int(array_index);
1941                         if (!used_in_offsetof) {
1942                                 if (index < 0) {
1943                                         errorf(&designator->source_position,
1944                                                "array index [%E] must be positive", array_index);
1945                                 } else if (type->array.size_constant) {
1946                                         long array_size = type->array.size;
1947                                         if (index >= array_size) {
1948                                                 errorf(&designator->source_position,
1949                                                        "designator [%E] (%d) exceeds array size %d",
1950                                                        array_index, index, array_size);
1951                                         }
1952                                 }
1953                         }
1954
1955                         top->type    = orig_type;
1956                         top->v.index = (size_t) index;
1957                         orig_type    = type->array.element_type;
1958                 }
1959                 path->top_type = orig_type;
1960
1961                 if (designator->next != NULL) {
1962                         descend_into_subtype(path);
1963                 }
1964         }
1965         return true;
1966 }
1967
1968 static void advance_current_object(type_path_t *path, size_t top_path_level)
1969 {
1970         type_path_entry_t *top = get_type_path_top(path);
1971
1972         type_t *type = skip_typeref(top->type);
1973         if (is_type_union(type)) {
1974                 /* in unions only the first element is initialized */
1975                 top->v.compound_entry = NULL;
1976         } else if (is_type_struct(type)) {
1977                 declaration_t *entry = top->v.compound_entry;
1978
1979                 entity_t *const next_entity = skip_unnamed_bitfields(entry->base.next);
1980                 if (next_entity != NULL) {
1981                         assert(is_declaration(next_entity));
1982                         entry = &next_entity->declaration;
1983                 } else {
1984                         entry = NULL;
1985                 }
1986
1987                 top->v.compound_entry = entry;
1988                 if (entry != NULL) {
1989                         path->top_type = entry->type;
1990                         return;
1991                 }
1992         } else if (is_type_array(type)) {
1993                 assert(is_type_array(type));
1994
1995                 top->v.index++;
1996
1997                 if (!type->array.size_constant || top->v.index < type->array.size) {
1998                         return;
1999                 }
2000         } else {
2001                 assert(!is_type_valid(type));
2002                 return;
2003         }
2004
2005         /* we're past the last member of the current sub-aggregate, try if we
2006          * can ascend in the type hierarchy and continue with another subobject */
2007         size_t len = ARR_LEN(path->path);
2008
2009         if (len > top_path_level) {
2010                 ascend_from_subtype(path);
2011                 advance_current_object(path, top_path_level);
2012         } else {
2013                 path->top_type = NULL;
2014         }
2015 }
2016
2017 /**
2018  * skip any {...} blocks until a closing bracket is reached.
2019  */
2020 static void skip_initializers(void)
2021 {
2022         next_if('{');
2023
2024         while (token.kind != '}') {
2025                 if (token.kind == T_EOF)
2026                         return;
2027                 if (token.kind == '{') {
2028                         eat_block();
2029                         continue;
2030                 }
2031                 next_token();
2032         }
2033 }
2034
2035 static initializer_t *create_empty_initializer(void)
2036 {
2037         static initializer_t empty_initializer
2038                 = { .list = { { INITIALIZER_LIST }, 0 } };
2039         return &empty_initializer;
2040 }
2041
2042 /**
2043  * Parse a part of an initialiser for a struct or union,
2044  */
2045 static initializer_t *parse_sub_initializer(type_path_t *path,
2046                 type_t *outer_type, size_t top_path_level,
2047                 parse_initializer_env_t *env)
2048 {
2049         if (token.kind == '}') {
2050                 /* empty initializer */
2051                 return create_empty_initializer();
2052         }
2053
2054         type_t *orig_type = path->top_type;
2055         type_t *type      = NULL;
2056
2057         if (orig_type == NULL) {
2058                 /* We are initializing an empty compound. */
2059         } else {
2060                 type = skip_typeref(orig_type);
2061         }
2062
2063         initializer_t **initializers = NEW_ARR_F(initializer_t*, 0);
2064
2065         while (true) {
2066                 designator_t *designator = NULL;
2067                 if (token.kind == '.' || token.kind == '[') {
2068                         designator = parse_designation();
2069                         goto finish_designator;
2070                 } else if (token.kind == T_IDENTIFIER && look_ahead(1)->kind == ':') {
2071                         /* GNU-style designator ("identifier: value") */
2072                         designator = allocate_ast_zero(sizeof(designator[0]));
2073                         designator->source_position = token.base.source_position;
2074                         designator->symbol          = token.identifier.symbol;
2075                         eat(T_IDENTIFIER);
2076                         eat(':');
2077
2078 finish_designator:
2079                         /* reset path to toplevel, evaluate designator from there */
2080                         ascend_to(path, top_path_level);
2081                         if (!walk_designator(path, designator, false)) {
2082                                 /* can't continue after designation error */
2083                                 goto end_error;
2084                         }
2085
2086                         initializer_t *designator_initializer
2087                                 = allocate_initializer_zero(INITIALIZER_DESIGNATOR);
2088                         designator_initializer->designator.designator = designator;
2089                         ARR_APP1(initializer_t*, initializers, designator_initializer);
2090
2091                         orig_type = path->top_type;
2092                         type      = orig_type != NULL ? skip_typeref(orig_type) : NULL;
2093                 }
2094
2095                 initializer_t *sub;
2096
2097                 if (token.kind == '{') {
2098                         if (type != NULL && is_type_scalar(type)) {
2099                                 sub = parse_scalar_initializer(type, env->must_be_constant);
2100                         } else {
2101                                 if (type == NULL) {
2102                                         if (env->entity != NULL) {
2103                                                 errorf(HERE,
2104                                                      "extra brace group at end of initializer for '%Y'",
2105                                                      env->entity->base.symbol);
2106                                         } else {
2107                                                 errorf(HERE, "extra brace group at end of initializer");
2108                                         }
2109                                         eat('{');
2110                                 } else {
2111                                         eat('{');
2112                                         descend_into_subtype(path);
2113                                 }
2114
2115                                 add_anchor_token('}');
2116                                 sub = parse_sub_initializer(path, orig_type, top_path_level+1,
2117                                                             env);
2118                                 rem_anchor_token('}');
2119
2120                                 if (type != NULL) {
2121                                         ascend_from_subtype(path);
2122                                         expect('}', end_error);
2123                                 } else {
2124                                         expect('}', end_error);
2125                                         goto error_parse_next;
2126                                 }
2127                         }
2128                 } else {
2129                         /* must be an expression */
2130                         expression_t *expression = parse_assignment_expression();
2131                         mark_vars_read(expression, NULL);
2132
2133                         if (env->must_be_constant && !is_initializer_constant(expression)) {
2134                                 errorf(&expression->base.source_position,
2135                                        "Initialisation expression '%E' is not constant",
2136                                        expression);
2137                         }
2138
2139                         if (type == NULL) {
2140                                 /* we are already outside, ... */
2141                                 if (outer_type == NULL)
2142                                         goto error_parse_next;
2143                                 type_t *const outer_type_skip = skip_typeref(outer_type);
2144                                 if (is_type_compound(outer_type_skip) &&
2145                                                 !outer_type_skip->compound.compound->complete) {
2146                                         goto error_parse_next;
2147                                 }
2148
2149                                 source_position_t const* const pos = &expression->base.source_position;
2150                                 if (env->entity != NULL) {
2151                                         warningf(WARN_OTHER, pos, "excess elements in initializer for '%Y'", env->entity->base.symbol);
2152                                 } else {
2153                                         warningf(WARN_OTHER, pos, "excess elements in initializer");
2154                                 }
2155                                 goto error_parse_next;
2156                         }
2157
2158                         /* handle { "string" } special case */
2159                         if ((expression->kind == EXPR_STRING_LITERAL
2160                                         || expression->kind == EXPR_WIDE_STRING_LITERAL)
2161                                         && outer_type != NULL) {
2162                                 sub = initializer_from_expression(outer_type, expression);
2163                                 if (sub != NULL) {
2164                                         next_if(',');
2165                                         if (token.kind != '}') {
2166                                                 warningf(WARN_OTHER, HERE, "excessive elements in initializer for type '%T'", orig_type);
2167                                         }
2168                                         /* TODO: eat , ... */
2169                                         return sub;
2170                                 }
2171                         }
2172
2173                         /* descend into subtypes until expression matches type */
2174                         while (true) {
2175                                 orig_type = path->top_type;
2176                                 type      = skip_typeref(orig_type);
2177
2178                                 sub = initializer_from_expression(orig_type, expression);
2179                                 if (sub != NULL) {
2180                                         break;
2181                                 }
2182                                 if (!is_type_valid(type)) {
2183                                         goto end_error;
2184                                 }
2185                                 if (is_type_scalar(type)) {
2186                                         errorf(&expression->base.source_position,
2187                                                         "expression '%E' doesn't match expected type '%T'",
2188                                                         expression, orig_type);
2189                                         goto end_error;
2190                                 }
2191
2192                                 descend_into_subtype(path);
2193                         }
2194                 }
2195
2196                 /* update largest index of top array */
2197                 const type_path_entry_t *first      = &path->path[0];
2198                 type_t                  *first_type = first->type;
2199                 first_type                          = skip_typeref(first_type);
2200                 if (is_type_array(first_type)) {
2201                         size_t index = first->v.index;
2202                         if (index > path->max_index)
2203                                 path->max_index = index;
2204                 }
2205
2206                 /* append to initializers list */
2207                 ARR_APP1(initializer_t*, initializers, sub);
2208
2209 error_parse_next:
2210                 if (token.kind == '}') {
2211                         break;
2212                 }
2213                 expect(',', end_error);
2214                 if (token.kind == '}') {
2215                         break;
2216                 }
2217
2218                 if (type != NULL) {
2219                         /* advance to the next declaration if we are not at the end */
2220                         advance_current_object(path, top_path_level);
2221                         orig_type = path->top_type;
2222                         if (orig_type != NULL)
2223                                 type = skip_typeref(orig_type);
2224                         else
2225                                 type = NULL;
2226                 }
2227         }
2228
2229         size_t len  = ARR_LEN(initializers);
2230         size_t size = sizeof(initializer_list_t) + len * sizeof(initializers[0]);
2231         initializer_t *result = allocate_ast_zero(size);
2232         result->kind          = INITIALIZER_LIST;
2233         result->list.len      = len;
2234         memcpy(&result->list.initializers, initializers,
2235                len * sizeof(initializers[0]));
2236
2237         DEL_ARR_F(initializers);
2238         ascend_to(path, top_path_level+1);
2239
2240         return result;
2241
2242 end_error:
2243         skip_initializers();
2244         DEL_ARR_F(initializers);
2245         ascend_to(path, top_path_level+1);
2246         return NULL;
2247 }
2248
2249 static expression_t *make_size_literal(size_t value)
2250 {
2251         expression_t *literal = allocate_expression_zero(EXPR_LITERAL_INTEGER);
2252         literal->base.type    = type_size_t;
2253
2254         char buf[128];
2255         snprintf(buf, sizeof(buf), "%u", (unsigned) value);
2256         literal->literal.value = make_string(buf);
2257
2258         return literal;
2259 }
2260
2261 /**
2262  * Parses an initializer. Parsers either a compound literal
2263  * (env->declaration == NULL) or an initializer of a declaration.
2264  */
2265 static initializer_t *parse_initializer(parse_initializer_env_t *env)
2266 {
2267         type_t        *type      = skip_typeref(env->type);
2268         size_t         max_index = 0;
2269         initializer_t *result;
2270
2271         if (is_type_scalar(type)) {
2272                 result = parse_scalar_initializer(type, env->must_be_constant);
2273         } else if (token.kind == '{') {
2274                 eat('{');
2275
2276                 type_path_t path;
2277                 memset(&path, 0, sizeof(path));
2278                 path.top_type = env->type;
2279                 path.path     = NEW_ARR_F(type_path_entry_t, 0);
2280
2281                 descend_into_subtype(&path);
2282
2283                 add_anchor_token('}');
2284                 result = parse_sub_initializer(&path, env->type, 1, env);
2285                 rem_anchor_token('}');
2286
2287                 max_index = path.max_index;
2288                 DEL_ARR_F(path.path);
2289
2290                 expect('}', end_error);
2291 end_error:;
2292         } else {
2293                 /* parse_scalar_initializer() also works in this case: we simply
2294                  * have an expression without {} around it */
2295                 result = parse_scalar_initializer(type, env->must_be_constant);
2296         }
2297
2298         /* §6.7.8:22 array initializers for arrays with unknown size determine
2299          * the array type size */
2300         if (is_type_array(type) && type->array.size_expression == NULL
2301                         && result != NULL) {
2302                 size_t size;
2303                 switch (result->kind) {
2304                 case INITIALIZER_LIST:
2305                         assert(max_index != 0xdeadbeaf);
2306                         size = max_index + 1;
2307                         break;
2308
2309                 case INITIALIZER_STRING:
2310                         size = result->string.string.size;
2311                         break;
2312
2313                 case INITIALIZER_WIDE_STRING:
2314                         size = result->wide_string.string.size;
2315                         break;
2316
2317                 case INITIALIZER_DESIGNATOR:
2318                 case INITIALIZER_VALUE:
2319                         /* can happen for parse errors */
2320                         size = 0;
2321                         break;
2322
2323                 default:
2324                         internal_errorf(HERE, "invalid initializer type");
2325                 }
2326
2327                 type_t *new_type = duplicate_type(type);
2328
2329                 new_type->array.size_expression   = make_size_literal(size);
2330                 new_type->array.size_constant     = true;
2331                 new_type->array.has_implicit_size = true;
2332                 new_type->array.size              = size;
2333                 env->type = new_type;
2334         }
2335
2336         return result;
2337 }
2338
2339 static void append_entity(scope_t *scope, entity_t *entity)
2340 {
2341         if (scope->last_entity != NULL) {
2342                 scope->last_entity->base.next = entity;
2343         } else {
2344                 scope->entities = entity;
2345         }
2346         entity->base.parent_entity = current_entity;
2347         scope->last_entity         = entity;
2348 }
2349
2350
2351 static compound_t *parse_compound_type_specifier(bool is_struct)
2352 {
2353         source_position_t const pos = *HERE;
2354         eat(is_struct ? T_struct : T_union);
2355
2356         symbol_t    *symbol     = NULL;
2357         entity_t    *entity     = NULL;
2358         attribute_t *attributes = NULL;
2359
2360         if (token.kind == T___attribute__) {
2361                 attributes = parse_attributes(NULL);
2362         }
2363
2364         entity_kind_tag_t const kind = is_struct ? ENTITY_STRUCT : ENTITY_UNION;
2365         if (token.kind == T_IDENTIFIER) {
2366                 /* the compound has a name, check if we have seen it already */
2367                 symbol = token.identifier.symbol;
2368                 entity = get_tag(symbol, kind);
2369                 next_token();
2370
2371                 if (entity != NULL) {
2372                         if (entity->base.parent_scope != current_scope &&
2373                             (token.kind == '{' || token.kind == ';')) {
2374                                 /* we're in an inner scope and have a definition. Shadow
2375                                  * existing definition in outer scope */
2376                                 entity = NULL;
2377                         } else if (entity->compound.complete && token.kind == '{') {
2378                                 source_position_t const *const ppos = &entity->base.source_position;
2379                                 errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
2380                                 /* clear members in the hope to avoid further errors */
2381                                 entity->compound.members.entities = NULL;
2382                         }
2383                 }
2384         } else if (token.kind != '{') {
2385                 char const *const msg =
2386                         is_struct ? "while parsing struct type specifier" :
2387                                     "while parsing union type specifier";
2388                 parse_error_expected(msg, T_IDENTIFIER, '{', NULL);
2389
2390                 return NULL;
2391         }
2392
2393         if (entity == NULL) {
2394                 entity = allocate_entity_zero(kind, NAMESPACE_TAG, symbol);
2395                 entity->compound.alignment   = 1;
2396                 entity->base.source_position = pos;
2397                 entity->base.parent_scope    = current_scope;
2398                 if (symbol != NULL) {
2399                         environment_push(entity);
2400                 }
2401                 append_entity(current_scope, entity);
2402         }
2403
2404         if (token.kind == '{') {
2405                 parse_compound_type_entries(&entity->compound);
2406
2407                 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2408                 if (symbol == NULL) {
2409                         assert(anonymous_entity == NULL);
2410                         anonymous_entity = entity;
2411                 }
2412         }
2413
2414         if (attributes != NULL) {
2415                 handle_entity_attributes(attributes, entity);
2416         }
2417
2418         return &entity->compound;
2419 }
2420
2421 static void parse_enum_entries(type_t *const enum_type)
2422 {
2423         eat('{');
2424
2425         if (token.kind == '}') {
2426                 errorf(HERE, "empty enum not allowed");
2427                 next_token();
2428                 return;
2429         }
2430
2431         add_anchor_token('}');
2432         do {
2433                 if (token.kind != T_IDENTIFIER) {
2434                         parse_error_expected("while parsing enum entry", T_IDENTIFIER, NULL);
2435                         eat_block();
2436                         rem_anchor_token('}');
2437                         return;
2438                 }
2439
2440                 symbol_t *symbol       = token.identifier.symbol;
2441                 entity_t *const entity
2442                         = allocate_entity_zero(ENTITY_ENUM_VALUE, NAMESPACE_NORMAL, symbol);
2443                 entity->enum_value.enum_type = enum_type;
2444                 entity->base.source_position = token.base.source_position;
2445                 next_token();
2446
2447                 if (next_if('=')) {
2448                         expression_t *value = parse_constant_expression();
2449
2450                         value = create_implicit_cast(value, enum_type);
2451                         entity->enum_value.value = value;
2452
2453                         /* TODO semantic */
2454                 }
2455
2456                 record_entity(entity, false);
2457         } while (next_if(',') && token.kind != '}');
2458         rem_anchor_token('}');
2459
2460         expect('}', end_error);
2461
2462 end_error:
2463         ;
2464 }
2465
2466 static type_t *parse_enum_specifier(void)
2467 {
2468         source_position_t const pos = *HERE;
2469         entity_t               *entity;
2470         symbol_t               *symbol;
2471
2472         eat(T_enum);
2473         switch (token.kind) {
2474                 case T_IDENTIFIER:
2475                         symbol = token.identifier.symbol;
2476                         entity = get_tag(symbol, ENTITY_ENUM);
2477                         next_token();
2478
2479                         if (entity != NULL) {
2480                                 if (entity->base.parent_scope != current_scope &&
2481                                                 (token.kind == '{' || token.kind == ';')) {
2482                                         /* we're in an inner scope and have a definition. Shadow
2483                                          * existing definition in outer scope */
2484                                         entity = NULL;
2485                                 } else if (entity->enume.complete && token.kind == '{') {
2486                                         source_position_t const *const ppos = &entity->base.source_position;
2487                                         errorf(&pos, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
2488                                 }
2489                         }
2490                         break;
2491
2492                 case '{':
2493                         entity = NULL;
2494                         symbol = NULL;
2495                         break;
2496
2497                 default:
2498                         parse_error_expected("while parsing enum type specifier",
2499                                         T_IDENTIFIER, '{', NULL);
2500                         return NULL;
2501         }
2502
2503         if (entity == NULL) {
2504                 entity = allocate_entity_zero(ENTITY_ENUM, NAMESPACE_TAG, symbol);
2505                 entity->base.source_position = pos;
2506                 entity->base.parent_scope    = current_scope;
2507         }
2508
2509         type_t *const type     = allocate_type_zero(TYPE_ENUM);
2510         type->enumt.enume      = &entity->enume;
2511         type->enumt.base.akind = ATOMIC_TYPE_INT;
2512
2513         if (token.kind == '{') {
2514                 if (symbol != NULL) {
2515                         environment_push(entity);
2516                 }
2517                 append_entity(current_scope, entity);
2518                 entity->enume.complete = true;
2519
2520                 parse_enum_entries(type);
2521                 parse_attributes(NULL);
2522
2523                 /* ISO/IEC 14882:1998(E) §7.1.3:5 */
2524                 if (symbol == NULL) {
2525                         assert(anonymous_entity == NULL);
2526                         anonymous_entity = entity;
2527                 }
2528         } else if (!entity->enume.complete && !(c_mode & _GNUC)) {
2529                 errorf(HERE, "'%T' used before definition (incomplete enums are a GNU extension)", type);
2530         }
2531
2532         return type;
2533 }
2534
2535 /**
2536  * if a symbol is a typedef to another type, return true
2537  */
2538 static bool is_typedef_symbol(symbol_t *symbol)
2539 {
2540         const entity_t *const entity = get_entity(symbol, NAMESPACE_NORMAL);
2541         return entity != NULL && entity->kind == ENTITY_TYPEDEF;
2542 }
2543
2544 static type_t *parse_typeof(void)
2545 {
2546         eat(T___typeof__);
2547
2548         type_t *type;
2549
2550         expect('(', end_error);
2551         add_anchor_token(')');
2552
2553         expression_t *expression  = NULL;
2554
2555         switch (token.kind) {
2556         case T_IDENTIFIER:
2557                 if (is_typedef_symbol(token.identifier.symbol)) {
2558         DECLARATION_START
2559                         type = parse_typename();
2560                 } else {
2561         default:
2562                         expression = parse_expression();
2563                         type       = revert_automatic_type_conversion(expression);
2564                 }
2565                 break;
2566         }
2567
2568         rem_anchor_token(')');
2569         expect(')', end_error);
2570
2571         type_t *typeof_type              = allocate_type_zero(TYPE_TYPEOF);
2572         typeof_type->typeoft.expression  = expression;
2573         typeof_type->typeoft.typeof_type = type;
2574
2575         return typeof_type;
2576 end_error:
2577         return NULL;
2578 }
2579
2580 typedef enum specifiers_t {
2581         SPECIFIER_SIGNED    = 1 << 0,
2582         SPECIFIER_UNSIGNED  = 1 << 1,
2583         SPECIFIER_LONG      = 1 << 2,
2584         SPECIFIER_INT       = 1 << 3,
2585         SPECIFIER_DOUBLE    = 1 << 4,
2586         SPECIFIER_CHAR      = 1 << 5,
2587         SPECIFIER_WCHAR_T   = 1 << 6,
2588         SPECIFIER_SHORT     = 1 << 7,
2589         SPECIFIER_LONG_LONG = 1 << 8,
2590         SPECIFIER_FLOAT     = 1 << 9,
2591         SPECIFIER_BOOL      = 1 << 10,
2592         SPECIFIER_VOID      = 1 << 11,
2593         SPECIFIER_INT8      = 1 << 12,
2594         SPECIFIER_INT16     = 1 << 13,
2595         SPECIFIER_INT32     = 1 << 14,
2596         SPECIFIER_INT64     = 1 << 15,
2597         SPECIFIER_INT128    = 1 << 16,
2598         SPECIFIER_COMPLEX   = 1 << 17,
2599         SPECIFIER_IMAGINARY = 1 << 18,
2600 } specifiers_t;
2601
2602 static type_t *get_typedef_type(symbol_t *symbol)
2603 {
2604         entity_t *entity = get_entity(symbol, NAMESPACE_NORMAL);
2605         if (entity == NULL || entity->kind != ENTITY_TYPEDEF)
2606                 return NULL;
2607
2608         type_t *type            = allocate_type_zero(TYPE_TYPEDEF);
2609         type->typedeft.typedefe = &entity->typedefe;
2610
2611         return type;
2612 }
2613
2614 static attribute_t *parse_attribute_ms_property(attribute_t *attribute)
2615 {
2616         expect('(', end_error);
2617
2618         attribute_property_argument_t *property
2619                 = allocate_ast_zero(sizeof(*property));
2620
2621         do {
2622                 if (token.kind != T_IDENTIFIER) {
2623                         parse_error_expected("while parsing property declspec",
2624                                              T_IDENTIFIER, NULL);
2625                         goto end_error;
2626                 }
2627
2628                 symbol_t **prop;
2629                 symbol_t  *symbol = token.identifier.symbol;
2630                 if (strcmp(symbol->string, "put") == 0) {
2631                         prop = &property->put_symbol;
2632                 } else if (strcmp(symbol->string, "get") == 0) {
2633                         prop = &property->get_symbol;
2634                 } else {
2635                         errorf(HERE, "expected put or get in property declspec");
2636                         prop = NULL;
2637                 }
2638                 eat(T_IDENTIFIER);
2639                 expect('=', end_error);
2640                 if (token.kind != T_IDENTIFIER) {
2641                         parse_error_expected("while parsing property declspec",
2642                                              T_IDENTIFIER, NULL);
2643                         goto end_error;
2644                 }
2645                 if (prop != NULL)
2646                         *prop = token.identifier.symbol;
2647                 next_token();
2648         } while (next_if(','));
2649
2650         attribute->a.property = property;
2651
2652         expect(')', end_error);
2653
2654 end_error:
2655         return attribute;
2656 }
2657
2658 static attribute_t *parse_microsoft_extended_decl_modifier_single(void)
2659 {
2660         attribute_kind_t kind = ATTRIBUTE_UNKNOWN;
2661         if (next_if(T_restrict)) {
2662                 kind = ATTRIBUTE_MS_RESTRICT;
2663         } else if (token.kind == T_IDENTIFIER) {
2664                 const char *name = token.identifier.symbol->string;
2665                 for (attribute_kind_t k = ATTRIBUTE_MS_FIRST; k <= ATTRIBUTE_MS_LAST;
2666                      ++k) {
2667                         const char *attribute_name = get_attribute_name(k);
2668                         if (attribute_name != NULL && strcmp(attribute_name, name) == 0) {
2669                                 kind = k;
2670                                 break;
2671                         }
2672                 }
2673
2674                 if (kind == ATTRIBUTE_UNKNOWN) {
2675                         warningf(WARN_ATTRIBUTE, HERE, "unknown __declspec '%s' ignored", name);
2676                 }
2677         } else {
2678                 parse_error_expected("while parsing __declspec", T_IDENTIFIER, NULL);
2679                 return NULL;
2680         }
2681
2682         attribute_t *attribute = allocate_attribute_zero(kind);
2683         eat(T_IDENTIFIER);
2684
2685         if (kind == ATTRIBUTE_MS_PROPERTY) {
2686                 return parse_attribute_ms_property(attribute);
2687         }
2688
2689         /* parse arguments */
2690         if (next_if('('))
2691                 attribute->a.arguments = parse_attribute_arguments();
2692
2693         return attribute;
2694 }
2695
2696 static attribute_t *parse_microsoft_extended_decl_modifier(attribute_t *first)
2697 {
2698         eat(T__declspec);
2699
2700         expect('(', end_error);
2701
2702         if (next_if(')'))
2703                 return NULL;
2704
2705         add_anchor_token(')');
2706
2707         attribute_t **anchor = &first;
2708         do {
2709                 while (*anchor != NULL)
2710                         anchor = &(*anchor)->next;
2711
2712                 attribute_t *attribute
2713                         = parse_microsoft_extended_decl_modifier_single();
2714                 if (attribute == NULL)
2715                         goto end_error;
2716
2717                 *anchor = attribute;
2718                 anchor  = &attribute->next;
2719         } while (next_if(','));
2720
2721         rem_anchor_token(')');
2722         expect(')', end_error);
2723         return first;
2724
2725 end_error:
2726         rem_anchor_token(')');
2727         return first;
2728 }
2729
2730 static entity_t *create_error_entity(symbol_t *symbol, entity_kind_tag_t kind)
2731 {
2732         entity_t *const entity = allocate_entity_zero(kind, NAMESPACE_NORMAL, symbol);
2733         entity->base.source_position = *HERE;
2734         if (is_declaration(entity)) {
2735                 entity->declaration.type     = type_error_type;
2736                 entity->declaration.implicit = true;
2737         } else if (kind == ENTITY_TYPEDEF) {
2738                 entity->typedefe.type    = type_error_type;
2739                 entity->typedefe.builtin = true;
2740         }
2741         if (kind != ENTITY_COMPOUND_MEMBER)
2742                 record_entity(entity, false);
2743         return entity;
2744 }
2745
2746 static void parse_declaration_specifiers(declaration_specifiers_t *specifiers)
2747 {
2748         type_t            *type            = NULL;
2749         type_qualifiers_t  qualifiers      = TYPE_QUALIFIER_NONE;
2750         unsigned           type_specifiers = 0;
2751         bool               newtype         = false;
2752         bool               saw_error       = false;
2753
2754         memset(specifiers, 0, sizeof(*specifiers));
2755         specifiers->source_position = token.base.source_position;
2756
2757         while (true) {
2758                 specifiers->attributes = parse_attributes(specifiers->attributes);
2759
2760                 switch (token.kind) {
2761                 /* storage class */
2762 #define MATCH_STORAGE_CLASS(token, class)                                  \
2763                 case token:                                                        \
2764                         if (specifiers->storage_class != STORAGE_CLASS_NONE) {         \
2765                                 errorf(HERE, "multiple storage classes in declaration specifiers"); \
2766                         }                                                              \
2767                         specifiers->storage_class = class;                             \
2768                         if (specifiers->thread_local)                                  \
2769                                 goto check_thread_storage_class;                           \
2770                         next_token();                                                  \
2771                         break;
2772
2773                 MATCH_STORAGE_CLASS(T_typedef,  STORAGE_CLASS_TYPEDEF)
2774                 MATCH_STORAGE_CLASS(T_extern,   STORAGE_CLASS_EXTERN)
2775                 MATCH_STORAGE_CLASS(T_static,   STORAGE_CLASS_STATIC)
2776                 MATCH_STORAGE_CLASS(T_auto,     STORAGE_CLASS_AUTO)
2777                 MATCH_STORAGE_CLASS(T_register, STORAGE_CLASS_REGISTER)
2778
2779                 case T__declspec:
2780                         specifiers->attributes
2781                                 = parse_microsoft_extended_decl_modifier(specifiers->attributes);
2782                         break;
2783
2784                 case T___thread:
2785                         if (specifiers->thread_local) {
2786                                 errorf(HERE, "duplicate '__thread'");
2787                         } else {
2788                                 specifiers->thread_local = true;
2789 check_thread_storage_class:
2790                                 switch (specifiers->storage_class) {
2791                                         case STORAGE_CLASS_EXTERN:
2792                                         case STORAGE_CLASS_NONE:
2793                                         case STORAGE_CLASS_STATIC:
2794                                                 break;
2795
2796                                                 char const* wrong;
2797                                         case STORAGE_CLASS_AUTO:     wrong = "auto";     goto wrong_thread_storage_class;
2798                                         case STORAGE_CLASS_REGISTER: wrong = "register"; goto wrong_thread_storage_class;
2799                                         case STORAGE_CLASS_TYPEDEF:  wrong = "typedef";  goto wrong_thread_storage_class;
2800 wrong_thread_storage_class:
2801                                                 errorf(HERE, "'__thread' used with '%s'", wrong);
2802                                                 break;
2803                                 }
2804                         }
2805                         next_token();
2806                         break;
2807
2808                 /* type qualifiers */
2809 #define MATCH_TYPE_QUALIFIER(token, qualifier)                          \
2810                 case token:                                                     \
2811                         qualifiers |= qualifier;                                    \
2812                         next_token();                                               \
2813                         break
2814
2815                 MATCH_TYPE_QUALIFIER(T_const,    TYPE_QUALIFIER_CONST);
2816                 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
2817                 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
2818                 MATCH_TYPE_QUALIFIER(T__w64,     TYPE_QUALIFIER_W64);
2819                 MATCH_TYPE_QUALIFIER(T___ptr32,  TYPE_QUALIFIER_PTR32);
2820                 MATCH_TYPE_QUALIFIER(T___ptr64,  TYPE_QUALIFIER_PTR64);
2821                 MATCH_TYPE_QUALIFIER(T___uptr,   TYPE_QUALIFIER_UPTR);
2822                 MATCH_TYPE_QUALIFIER(T___sptr,   TYPE_QUALIFIER_SPTR);
2823
2824                 /* type specifiers */
2825 #define MATCH_SPECIFIER(token, specifier, name)                         \
2826                 case token:                                                     \
2827                         if (type_specifiers & specifier) {                           \
2828                                 errorf(HERE, "multiple " name " type specifiers given"); \
2829                         } else {                                                    \
2830                                 type_specifiers |= specifier;                           \
2831                         }                                                           \
2832                         next_token();                                               \
2833                         break
2834
2835                 MATCH_SPECIFIER(T__Bool,      SPECIFIER_BOOL,      "_Bool");
2836                 MATCH_SPECIFIER(T__Complex,   SPECIFIER_COMPLEX,   "_Complex");
2837                 MATCH_SPECIFIER(T__Imaginary, SPECIFIER_IMAGINARY, "_Imaginary");
2838                 MATCH_SPECIFIER(T__int128,    SPECIFIER_INT128,    "_int128");
2839                 MATCH_SPECIFIER(T__int16,     SPECIFIER_INT16,     "_int16");
2840                 MATCH_SPECIFIER(T__int32,     SPECIFIER_INT32,     "_int32");
2841                 MATCH_SPECIFIER(T__int64,     SPECIFIER_INT64,     "_int64");
2842                 MATCH_SPECIFIER(T__int8,      SPECIFIER_INT8,      "_int8");
2843                 MATCH_SPECIFIER(T_bool,       SPECIFIER_BOOL,      "bool");
2844                 MATCH_SPECIFIER(T_char,       SPECIFIER_CHAR,      "char");
2845                 MATCH_SPECIFIER(T_double,     SPECIFIER_DOUBLE,    "double");
2846                 MATCH_SPECIFIER(T_float,      SPECIFIER_FLOAT,     "float");
2847                 MATCH_SPECIFIER(T_int,        SPECIFIER_INT,       "int");
2848                 MATCH_SPECIFIER(T_short,      SPECIFIER_SHORT,     "short");
2849                 MATCH_SPECIFIER(T_signed,     SPECIFIER_SIGNED,    "signed");
2850                 MATCH_SPECIFIER(T_unsigned,   SPECIFIER_UNSIGNED,  "unsigned");
2851                 MATCH_SPECIFIER(T_void,       SPECIFIER_VOID,      "void");
2852                 MATCH_SPECIFIER(T_wchar_t,    SPECIFIER_WCHAR_T,   "wchar_t");
2853
2854                 case T_inline:
2855                         next_token();
2856                         specifiers->is_inline = true;
2857                         break;
2858
2859 #if 0
2860                 case T__forceinline:
2861                         next_token();
2862                         specifiers->modifiers |= DM_FORCEINLINE;
2863                         break;
2864 #endif
2865
2866                 case T_long:
2867                         if (type_specifiers & SPECIFIER_LONG_LONG) {
2868                                 errorf(HERE, "too many long type specifiers given");
2869                         } else if (type_specifiers & SPECIFIER_LONG) {
2870                                 type_specifiers |= SPECIFIER_LONG_LONG;
2871                         } else {
2872                                 type_specifiers |= SPECIFIER_LONG;
2873                         }
2874                         next_token();
2875                         break;
2876
2877 #define CHECK_DOUBLE_TYPE() \
2878         (type != NULL ? errorf(HERE, "multiple types in declaration specifiers") : (void)0)
2879
2880                 case T_struct:
2881                         CHECK_DOUBLE_TYPE();
2882                         type = allocate_type_zero(TYPE_COMPOUND_STRUCT);
2883
2884                         type->compound.compound = parse_compound_type_specifier(true);
2885                         break;
2886                 case T_union:
2887                         CHECK_DOUBLE_TYPE();
2888                         type = allocate_type_zero(TYPE_COMPOUND_UNION);
2889                         type->compound.compound = parse_compound_type_specifier(false);
2890                         break;
2891                 case T_enum:
2892                         CHECK_DOUBLE_TYPE();
2893                         type = parse_enum_specifier();
2894                         break;
2895                 case T___typeof__:
2896                         CHECK_DOUBLE_TYPE();
2897                         type = parse_typeof();
2898                         break;
2899                 case T___builtin_va_list:
2900                         CHECK_DOUBLE_TYPE();
2901                         type = duplicate_type(type_valist);
2902                         next_token();
2903                         break;
2904
2905                 case T_IDENTIFIER: {
2906                         /* only parse identifier if we haven't found a type yet */
2907                         if (type != NULL || type_specifiers != 0) {
2908                                 /* Be somewhat resilient to typos like 'unsigned lng* f()' in a
2909                                  * declaration, so it doesn't generate errors about expecting '(' or
2910                                  * '{' later on. */
2911                                 switch (look_ahead(1)->kind) {
2912                                         STORAGE_CLASSES
2913                                         TYPE_SPECIFIERS
2914                                         case T_const:
2915                                         case T_restrict:
2916                                         case T_volatile:
2917                                         case T_inline:
2918                                         case T__forceinline: /* ^ DECLARATION_START except for __attribute__ */
2919                                         case T_IDENTIFIER:
2920                                         case '&':
2921                                         case '*':
2922                                                 errorf(HERE, "discarding stray %K in declaration specifier", &token);
2923                                                 next_token();
2924                                                 continue;
2925
2926                                         default:
2927                                                 goto finish_specifiers;
2928                                 }
2929                         }
2930
2931                         type_t *const typedef_type = get_typedef_type(token.identifier.symbol);
2932                         if (typedef_type == NULL) {
2933                                 /* Be somewhat resilient to typos like 'vodi f()' at the beginning of a
2934                                  * declaration, so it doesn't generate 'implicit int' followed by more
2935                                  * errors later on. */
2936                                 token_kind_t const la1_type = (token_kind_t)look_ahead(1)->kind;
2937                                 switch (la1_type) {
2938                                         DECLARATION_START
2939                                         case T_IDENTIFIER:
2940                                         case '&':
2941                                         case '*': {
2942                                                 errorf(HERE, "%K does not name a type", &token);
2943
2944                                                 symbol_t *symbol = token.identifier.symbol;
2945                                                 entity_t *entity
2946                                                         = create_error_entity(symbol, ENTITY_TYPEDEF);
2947
2948                                                 type = allocate_type_zero(TYPE_TYPEDEF);
2949                                                 type->typedeft.typedefe = &entity->typedefe;
2950
2951                                                 next_token();
2952                                                 saw_error = true;
2953                                                 continue;
2954                                         }
2955
2956                                         default:
2957                                                 goto finish_specifiers;
2958                                 }
2959                         }
2960
2961                         next_token();
2962                         type = typedef_type;
2963                         break;
2964                 }
2965
2966                 /* function specifier */
2967                 default:
2968                         goto finish_specifiers;
2969                 }
2970         }
2971
2972 finish_specifiers:
2973         specifiers->attributes = parse_attributes(specifiers->attributes);
2974
2975         if (type == NULL || (saw_error && type_specifiers != 0)) {
2976                 atomic_type_kind_t atomic_type;
2977
2978                 /* match valid basic types */
2979                 switch (type_specifiers) {
2980                 case SPECIFIER_VOID:
2981                         atomic_type = ATOMIC_TYPE_VOID;
2982                         break;
2983                 case SPECIFIER_WCHAR_T:
2984                         atomic_type = ATOMIC_TYPE_WCHAR_T;
2985                         break;
2986                 case SPECIFIER_CHAR:
2987                         atomic_type = ATOMIC_TYPE_CHAR;
2988                         break;
2989                 case SPECIFIER_SIGNED | SPECIFIER_CHAR:
2990                         atomic_type = ATOMIC_TYPE_SCHAR;
2991                         break;
2992                 case SPECIFIER_UNSIGNED | SPECIFIER_CHAR:
2993                         atomic_type = ATOMIC_TYPE_UCHAR;
2994                         break;
2995                 case SPECIFIER_SHORT:
2996                 case SPECIFIER_SIGNED | SPECIFIER_SHORT:
2997                 case SPECIFIER_SHORT | SPECIFIER_INT:
2998                 case SPECIFIER_SIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
2999                         atomic_type = ATOMIC_TYPE_SHORT;
3000                         break;
3001                 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT:
3002                 case SPECIFIER_UNSIGNED | SPECIFIER_SHORT | SPECIFIER_INT:
3003                         atomic_type = ATOMIC_TYPE_USHORT;
3004                         break;
3005                 case SPECIFIER_INT:
3006                 case SPECIFIER_SIGNED:
3007                 case SPECIFIER_SIGNED | SPECIFIER_INT:
3008                         atomic_type = ATOMIC_TYPE_INT;
3009                         break;
3010                 case SPECIFIER_UNSIGNED:
3011                 case SPECIFIER_UNSIGNED | SPECIFIER_INT:
3012                         atomic_type = ATOMIC_TYPE_UINT;
3013                         break;
3014                 case SPECIFIER_LONG:
3015                 case SPECIFIER_SIGNED | SPECIFIER_LONG:
3016                 case SPECIFIER_LONG | SPECIFIER_INT:
3017                 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3018                         atomic_type = ATOMIC_TYPE_LONG;
3019                         break;
3020                 case SPECIFIER_UNSIGNED | SPECIFIER_LONG:
3021                 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_INT:
3022                         atomic_type = ATOMIC_TYPE_ULONG;
3023                         break;
3024
3025                 case SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3026                 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3027                 case SPECIFIER_LONG | SPECIFIER_LONG_LONG | SPECIFIER_INT:
3028                 case SPECIFIER_SIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3029                         | SPECIFIER_INT:
3030                         atomic_type = ATOMIC_TYPE_LONGLONG;
3031                         goto warn_about_long_long;
3032
3033                 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG:
3034                 case SPECIFIER_UNSIGNED | SPECIFIER_LONG | SPECIFIER_LONG_LONG
3035                         | SPECIFIER_INT:
3036                         atomic_type = ATOMIC_TYPE_ULONGLONG;
3037 warn_about_long_long:
3038                         warningf(WARN_LONG_LONG, &specifiers->source_position, "ISO C90 does not support 'long long'");
3039                         break;
3040
3041                 case SPECIFIER_UNSIGNED | SPECIFIER_INT8:
3042                         atomic_type = unsigned_int8_type_kind;
3043                         break;
3044
3045                 case SPECIFIER_UNSIGNED | SPECIFIER_INT16:
3046                         atomic_type = unsigned_int16_type_kind;
3047                         break;
3048
3049                 case SPECIFIER_UNSIGNED | SPECIFIER_INT32:
3050                         atomic_type = unsigned_int32_type_kind;
3051                         break;
3052
3053                 case SPECIFIER_UNSIGNED | SPECIFIER_INT64:
3054                         atomic_type = unsigned_int64_type_kind;
3055                         break;
3056
3057                 case SPECIFIER_UNSIGNED | SPECIFIER_INT128:
3058                         atomic_type = unsigned_int128_type_kind;
3059                         break;
3060
3061                 case SPECIFIER_INT8:
3062                 case SPECIFIER_SIGNED | SPECIFIER_INT8:
3063                         atomic_type = int8_type_kind;
3064                         break;
3065
3066                 case SPECIFIER_INT16:
3067                 case SPECIFIER_SIGNED | SPECIFIER_INT16:
3068                         atomic_type = int16_type_kind;
3069                         break;
3070
3071                 case SPECIFIER_INT32:
3072                 case SPECIFIER_SIGNED | SPECIFIER_INT32:
3073                         atomic_type = int32_type_kind;
3074                         break;
3075
3076                 case SPECIFIER_INT64:
3077                 case SPECIFIER_SIGNED | SPECIFIER_INT64:
3078                         atomic_type = int64_type_kind;
3079                         break;
3080
3081                 case SPECIFIER_INT128:
3082                 case SPECIFIER_SIGNED | SPECIFIER_INT128:
3083                         atomic_type = int128_type_kind;
3084                         break;
3085
3086                 case SPECIFIER_FLOAT:
3087                         atomic_type = ATOMIC_TYPE_FLOAT;
3088                         break;
3089                 case SPECIFIER_DOUBLE:
3090                         atomic_type = ATOMIC_TYPE_DOUBLE;
3091                         break;
3092                 case SPECIFIER_LONG | SPECIFIER_DOUBLE:
3093                         atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3094                         break;
3095                 case SPECIFIER_BOOL:
3096                         atomic_type = ATOMIC_TYPE_BOOL;
3097                         break;
3098                 case SPECIFIER_FLOAT | SPECIFIER_COMPLEX:
3099                 case SPECIFIER_FLOAT | SPECIFIER_IMAGINARY:
3100                         atomic_type = ATOMIC_TYPE_FLOAT;
3101                         break;
3102                 case SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3103                 case SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3104                         atomic_type = ATOMIC_TYPE_DOUBLE;
3105                         break;
3106                 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_COMPLEX:
3107                 case SPECIFIER_LONG | SPECIFIER_DOUBLE | SPECIFIER_IMAGINARY:
3108                         atomic_type = ATOMIC_TYPE_LONG_DOUBLE;
3109                         break;
3110                 default: {
3111                         /* invalid specifier combination, give an error message */
3112                         source_position_t const* const pos = &specifiers->source_position;
3113                         if (type_specifiers == 0) {
3114                                 if (!saw_error) {
3115                                         /* ISO/IEC 14882:1998(E) §C.1.5:4 */
3116                                         if (!(c_mode & _CXX) && !strict_mode) {
3117                                                 warningf(WARN_IMPLICIT_INT, pos, "no type specifiers in declaration, using 'int'");
3118                                                 atomic_type = ATOMIC_TYPE_INT;
3119                                                 break;
3120                                         } else {
3121                                                 errorf(pos, "no type specifiers given in declaration");
3122                                         }
3123                                 }
3124                         } else if ((type_specifiers & SPECIFIER_SIGNED) &&
3125                                   (type_specifiers & SPECIFIER_UNSIGNED)) {
3126                                 errorf(pos, "signed and unsigned specifiers given");
3127                         } else if (type_specifiers & (SPECIFIER_SIGNED | SPECIFIER_UNSIGNED)) {
3128                                 errorf(pos, "only integer types can be signed or unsigned");
3129                         } else {
3130                                 errorf(pos, "multiple datatypes in declaration");
3131                         }
3132                         goto end_error;
3133                 }
3134                 }
3135
3136                 if (type_specifiers & SPECIFIER_COMPLEX) {
3137                         type = allocate_type_zero(TYPE_COMPLEX);
3138                 } else if (type_specifiers & SPECIFIER_IMAGINARY) {
3139                         type = allocate_type_zero(TYPE_IMAGINARY);
3140                 } else {
3141                         type = allocate_type_zero(TYPE_ATOMIC);
3142                 }
3143                 type->atomic.akind = atomic_type;
3144                 newtype = true;
3145         } else if (type_specifiers != 0) {
3146                 errorf(&specifiers->source_position, "multiple datatypes in declaration");
3147         }
3148
3149         /* FIXME: check type qualifiers here */
3150         type->base.qualifiers = qualifiers;
3151
3152         if (newtype) {
3153                 type = identify_new_type(type);
3154         } else {
3155                 type = typehash_insert(type);
3156         }
3157
3158         if (specifiers->attributes != NULL)
3159                 type = handle_type_attributes(specifiers->attributes, type);
3160         specifiers->type = type;
3161         return;
3162
3163 end_error:
3164         specifiers->type = type_error_type;
3165 }
3166
3167 static type_qualifiers_t parse_type_qualifiers(void)
3168 {
3169         type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
3170
3171         while (true) {
3172                 switch (token.kind) {
3173                 /* type qualifiers */
3174                 MATCH_TYPE_QUALIFIER(T_const,    TYPE_QUALIFIER_CONST);
3175                 MATCH_TYPE_QUALIFIER(T_restrict, TYPE_QUALIFIER_RESTRICT);
3176                 MATCH_TYPE_QUALIFIER(T_volatile, TYPE_QUALIFIER_VOLATILE);
3177                 /* microsoft extended type modifiers */
3178                 MATCH_TYPE_QUALIFIER(T__w64,     TYPE_QUALIFIER_W64);
3179                 MATCH_TYPE_QUALIFIER(T___ptr32,  TYPE_QUALIFIER_PTR32);
3180                 MATCH_TYPE_QUALIFIER(T___ptr64,  TYPE_QUALIFIER_PTR64);
3181                 MATCH_TYPE_QUALIFIER(T___uptr,   TYPE_QUALIFIER_UPTR);
3182                 MATCH_TYPE_QUALIFIER(T___sptr,   TYPE_QUALIFIER_SPTR);
3183
3184                 default:
3185                         return qualifiers;
3186                 }
3187         }
3188 }
3189
3190 /**
3191  * Parses an K&R identifier list
3192  */
3193 static void parse_identifier_list(scope_t *scope)
3194 {
3195         assert(token.kind == T_IDENTIFIER);
3196         do {
3197                 entity_t *const entity = allocate_entity_zero(ENTITY_PARAMETER, NAMESPACE_NORMAL, token.identifier.symbol);
3198                 entity->base.source_position = token.base.source_position;
3199                 /* a K&R parameter has no type, yet */
3200                 next_token();
3201
3202                 if (scope != NULL)
3203                         append_entity(scope, entity);
3204         } while (next_if(',') && token.kind == T_IDENTIFIER);
3205 }
3206
3207 static entity_t *parse_parameter(void)
3208 {
3209         declaration_specifiers_t specifiers;
3210         parse_declaration_specifiers(&specifiers);
3211
3212         entity_t *entity = parse_declarator(&specifiers,
3213                         DECL_MAY_BE_ABSTRACT | DECL_IS_PARAMETER);
3214         anonymous_entity = NULL;
3215         return entity;
3216 }
3217
3218 static void semantic_parameter_incomplete(const entity_t *entity)
3219 {
3220         assert(entity->kind == ENTITY_PARAMETER);
3221
3222         /* §6.7.5.3:4  After adjustment, the parameters in a parameter type
3223          *             list in a function declarator that is part of a
3224          *             definition of that function shall not have
3225          *             incomplete type. */
3226         type_t *type = skip_typeref(entity->declaration.type);
3227         if (is_type_incomplete(type)) {
3228                 errorf(&entity->base.source_position, "'%N' has incomplete type", entity);
3229         }
3230 }
3231
3232 static bool has_parameters(void)
3233 {
3234         /* func(void) is not a parameter */
3235         if (token.kind == T_IDENTIFIER) {
3236                 entity_t const *const entity
3237                         = get_entity(token.identifier.symbol, NAMESPACE_NORMAL);
3238                 if (entity == NULL)
3239                         return true;
3240                 if (entity->kind != ENTITY_TYPEDEF)
3241                         return true;
3242                 if (skip_typeref(entity->typedefe.type) != type_void)
3243                         return true;
3244         } else if (token.kind != T_void) {
3245                 return true;
3246         }
3247         if (look_ahead(1)->kind != ')')
3248                 return true;
3249         next_token();
3250         return false;
3251 }
3252
3253 /**
3254  * Parses function type parameters (and optionally creates variable_t entities
3255  * for them in a scope)
3256  */
3257 static void parse_parameters(function_type_t *type, scope_t *scope)
3258 {
3259         eat('(');
3260         add_anchor_token(')');
3261         int saved_comma_state = save_and_reset_anchor_state(',');
3262
3263         if (token.kind == T_IDENTIFIER
3264             && !is_typedef_symbol(token.identifier.symbol)) {
3265                 token_kind_t la1_type = (token_kind_t)look_ahead(1)->kind;
3266                 if (la1_type == ',' || la1_type == ')') {
3267                         type->kr_style_parameters = true;
3268                         parse_identifier_list(scope);
3269                         goto parameters_finished;
3270                 }
3271         }
3272
3273         if (token.kind == ')') {
3274                 /* ISO/IEC 14882:1998(E) §C.1.6:1 */
3275                 if (!(c_mode & _CXX))
3276                         type->unspecified_parameters = true;
3277         } else if (has_parameters()) {
3278                 function_parameter_t **anchor = &type->parameters;
3279                 do {
3280                         switch (token.kind) {
3281                         case T_DOTDOTDOT:
3282                                 next_token();
3283                                 type->variadic = true;
3284                                 goto parameters_finished;
3285
3286                         case T_IDENTIFIER:
3287                         DECLARATION_START
3288                         {
3289                                 entity_t *entity = parse_parameter();
3290                                 if (entity->kind == ENTITY_TYPEDEF) {
3291                                         errorf(&entity->base.source_position,
3292                                                         "typedef not allowed as function parameter");
3293                                         break;
3294                                 }
3295                                 assert(is_declaration(entity));
3296
3297                                 semantic_parameter_incomplete(entity);
3298
3299                                 function_parameter_t *const parameter =
3300                                         allocate_parameter(entity->declaration.type);
3301
3302                                 if (scope != NULL) {
3303                                         append_entity(scope, entity);
3304                                 }
3305
3306                                 *anchor = parameter;
3307                                 anchor  = &parameter->next;
3308                                 break;
3309                         }
3310
3311                         default:
3312                                 goto parameters_finished;
3313                         }
3314                 } while (next_if(','));
3315         }
3316
3317 parameters_finished:
3318         rem_anchor_token(')');
3319         expect(')', end_error);
3320
3321 end_error:
3322         restore_anchor_state(',', saved_comma_state);
3323 }
3324
3325 typedef enum construct_type_kind_t {
3326         CONSTRUCT_POINTER = 1,
3327         CONSTRUCT_REFERENCE,
3328         CONSTRUCT_FUNCTION,
3329         CONSTRUCT_ARRAY
3330 } construct_type_kind_t;
3331
3332 typedef union construct_type_t construct_type_t;
3333
3334 typedef struct construct_type_base_t {
3335         construct_type_kind_t  kind;
3336         source_position_t      pos;
3337         construct_type_t      *next;
3338 } construct_type_base_t;
3339
3340 typedef struct parsed_pointer_t {
3341         construct_type_base_t  base;
3342         type_qualifiers_t      type_qualifiers;
3343         variable_t            *base_variable;  /**< MS __based extension. */
3344 } parsed_pointer_t;
3345
3346 typedef struct parsed_reference_t {
3347         construct_type_base_t base;
3348 } parsed_reference_t;
3349
3350 typedef struct construct_function_type_t {
3351         construct_type_base_t  base;
3352         type_t                *function_type;
3353 } construct_function_type_t;
3354
3355 typedef struct parsed_array_t {
3356         construct_type_base_t  base;
3357         type_qualifiers_t      type_qualifiers;
3358         bool                   is_static;
3359         bool                   is_variable;
3360         expression_t          *size;
3361 } parsed_array_t;
3362
3363 union construct_type_t {
3364         construct_type_kind_t     kind;
3365         construct_type_base_t     base;
3366         parsed_pointer_t          pointer;
3367         parsed_reference_t        reference;
3368         construct_function_type_t function;
3369         parsed_array_t            array;
3370 };
3371
3372 static construct_type_t *allocate_declarator_zero(construct_type_kind_t const kind, size_t const size)
3373 {
3374         construct_type_t *const cons = obstack_alloc(&temp_obst, size);
3375         memset(cons, 0, size);
3376         cons->kind     = kind;
3377         cons->base.pos = *HERE;
3378         return cons;
3379 }
3380
3381 /* §6.7.5.1 */
3382 static construct_type_t *parse_pointer_declarator(void)
3383 {
3384         construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_POINTER, sizeof(parsed_pointer_t));
3385         eat('*');
3386         cons->pointer.type_qualifiers = parse_type_qualifiers();
3387         //cons->pointer.base_variable   = base_variable;
3388
3389         return cons;
3390 }
3391
3392 /* ISO/IEC 14882:1998(E) §8.3.2 */
3393 static construct_type_t *parse_reference_declarator(void)
3394 {
3395         if (!(c_mode & _CXX))
3396                 errorf(HERE, "references are only available for C++");
3397
3398         construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_REFERENCE, sizeof(parsed_reference_t));
3399         eat('&');
3400
3401         return cons;
3402 }
3403
3404 /* §6.7.5.2 */
3405 static construct_type_t *parse_array_declarator(void)
3406 {
3407         construct_type_t *const cons  = allocate_declarator_zero(CONSTRUCT_ARRAY, sizeof(parsed_array_t));
3408         parsed_array_t   *const array = &cons->array;
3409
3410         eat('[');
3411         add_anchor_token(']');
3412
3413         bool is_static = next_if(T_static);
3414
3415         type_qualifiers_t type_qualifiers = parse_type_qualifiers();
3416
3417         if (!is_static)
3418                 is_static = next_if(T_static);
3419
3420         array->type_qualifiers = type_qualifiers;
3421         array->is_static       = is_static;
3422
3423         expression_t *size = NULL;
3424         if (token.kind == '*' && look_ahead(1)->kind == ']') {
3425                 array->is_variable = true;
3426                 next_token();
3427         } else if (token.kind != ']') {
3428                 size = parse_assignment_expression();
3429
3430                 /* §6.7.5.2:1  Array size must have integer type */
3431                 type_t *const orig_type = size->base.type;
3432                 type_t *const type      = skip_typeref(orig_type);
3433                 if (!is_type_integer(type) && is_type_valid(type)) {
3434                         errorf(&size->base.source_position,
3435                                "array size '%E' must have integer type but has type '%T'",
3436                                size, orig_type);
3437                 }
3438
3439                 array->size = size;
3440                 mark_vars_read(size, NULL);
3441         }
3442
3443         if (is_static && size == NULL)
3444                 errorf(&array->base.pos, "static array parameters require a size");
3445
3446         rem_anchor_token(']');
3447         expect(']', end_error);
3448
3449 end_error:
3450         return cons;
3451 }
3452
3453 /* §6.7.5.3 */
3454 static construct_type_t *parse_function_declarator(scope_t *scope)
3455 {
3456         construct_type_t *const cons = allocate_declarator_zero(CONSTRUCT_FUNCTION, sizeof(construct_function_type_t));
3457
3458         type_t          *type  = allocate_type_zero(TYPE_FUNCTION);
3459         function_type_t *ftype = &type->function;
3460
3461         ftype->linkage            = current_linkage;
3462         ftype->calling_convention = CC_DEFAULT;
3463
3464         parse_parameters(ftype, scope);
3465
3466         cons->function.function_type = type;
3467
3468         return cons;
3469 }
3470
3471 typedef struct parse_declarator_env_t {
3472         bool               may_be_abstract : 1;
3473         bool               must_be_abstract : 1;
3474         decl_modifiers_t   modifiers;
3475         symbol_t          *symbol;
3476         source_position_t  source_position;
3477         scope_t            parameters;
3478         attribute_t       *attributes;
3479 } parse_declarator_env_t;
3480
3481 /* §6.7.5 */
3482 static construct_type_t *parse_inner_declarator(parse_declarator_env_t *env)
3483 {
3484         /* construct a single linked list of construct_type_t's which describe
3485          * how to construct the final declarator type */
3486         construct_type_t  *first      = NULL;
3487         construct_type_t **anchor     = &first;
3488
3489         env->attributes = parse_attributes(env->attributes);
3490
3491         for (;;) {
3492                 construct_type_t *type;
3493                 //variable_t       *based = NULL; /* MS __based extension */
3494                 switch (token.kind) {
3495                         case '&':
3496                                 type = parse_reference_declarator();
3497                                 break;
3498
3499                         case T__based: {
3500                                 panic("based not supported anymore");
3501                                 /* FALLTHROUGH */
3502                         }
3503
3504                         case '*':
3505                                 type = parse_pointer_declarator();
3506                                 break;
3507
3508                         default:
3509                                 goto ptr_operator_end;
3510                 }
3511
3512                 *anchor = type;
3513                 anchor  = &type->base.next;
3514
3515                 /* TODO: find out if this is correct */
3516                 env->attributes = parse_attributes(env->attributes);
3517         }
3518
3519 ptr_operator_end: ;
3520         construct_type_t *inner_types = NULL;
3521
3522         switch (token.kind) {
3523         case T_IDENTIFIER:
3524                 if (env->must_be_abstract) {
3525                         errorf(HERE, "no identifier expected in typename");
3526                 } else {
3527                         env->symbol          = token.identifier.symbol;
3528                         env->source_position = token.base.source_position;
3529                 }
3530                 next_token();
3531                 break;
3532
3533         case '(': {
3534                 /* Parenthesized declarator or function declarator? */
3535                 token_t const *const la1 = look_ahead(1);
3536                 switch (la1->kind) {
3537                         case T_IDENTIFIER:
3538                                 if (is_typedef_symbol(la1->identifier.symbol)) {
3539                         case ')':
3540                                         /* §6.7.6:2 footnote 126:  Empty parentheses in a type name are
3541                                          * interpreted as ``function with no parameter specification'', rather
3542                                          * than redundant parentheses around the omitted identifier. */
3543                         default:
3544                                         /* Function declarator. */
3545                                         if (!env->may_be_abstract) {
3546                                                 errorf(HERE, "function declarator must have a name");
3547                                         }
3548                                 } else {
3549                         case '&':
3550                         case '(':
3551                         case '*':
3552                         case '[':
3553                         case T___attribute__: /* FIXME __attribute__ might also introduce a parameter of a function declarator. */
3554                                         /* Paranthesized declarator. */
3555                                         next_token();
3556                                         add_anchor_token(')');
3557                                         inner_types = parse_inner_declarator(env);
3558                                         if (inner_types != NULL) {
3559                                                 /* All later declarators only modify the return type */
3560                                                 env->must_be_abstract = true;
3561                                         }
3562                                         rem_anchor_token(')');
3563                                         expect(')', end_error);
3564                                 }
3565                                 break;
3566                 }
3567                 break;
3568         }
3569
3570         default:
3571                 if (env->may_be_abstract)
3572                         break;
3573                 parse_error_expected("while parsing declarator", T_IDENTIFIER, '(', NULL);
3574                 eat_until_anchor();
3575                 return NULL;
3576         }
3577
3578         construct_type_t **const p = anchor;
3579
3580         for (;;) {
3581                 construct_type_t *type;
3582                 switch (token.kind) {
3583                 case '(': {
3584                         scope_t *scope = NULL;
3585                         if (!env->must_be_abstract) {
3586                                 scope = &env->parameters;
3587                         }
3588
3589                         type = parse_function_declarator(scope);
3590                         break;
3591                 }
3592                 case '[':
3593                         type = parse_array_declarator();
3594                         break;
3595                 default:
3596                         goto declarator_finished;
3597                 }
3598
3599                 /* insert in the middle of the list (at p) */
3600                 type->base.next = *p;
3601                 *p              = type;
3602                 if (anchor == p)
3603                         anchor = &type->base.next;
3604         }
3605
3606 declarator_finished:
3607         /* append inner_types at the end of the list, we don't to set anchor anymore
3608          * as it's not needed anymore */
3609         *anchor = inner_types;
3610
3611         return first;
3612 end_error:
3613         return NULL;
3614 }
3615
3616 static type_t *construct_declarator_type(construct_type_t *construct_list,
3617                                          type_t *type)
3618 {
3619         construct_type_t *iter = construct_list;
3620         for (; iter != NULL; iter = iter->base.next) {
3621                 source_position_t const* const pos = &iter->base.pos;
3622                 switch (iter->kind) {
3623                 case CONSTRUCT_FUNCTION: {
3624                         construct_function_type_t *function      = &iter->function;
3625                         type_t                    *function_type = function->function_type;
3626
3627                         function_type->function.return_type = type;
3628
3629                         type_t *skipped_return_type = skip_typeref(type);
3630                         /* §6.7.5.3:1 */
3631                         if (is_type_function(skipped_return_type)) {
3632                                 errorf(pos, "function returning function is not allowed");
3633                         } else if (is_type_array(skipped_return_type)) {
3634                                 errorf(pos, "function returning array is not allowed");
3635                         } else {
3636                                 if (skipped_return_type->base.qualifiers != 0) {
3637                                         warningf(WARN_IGNORED_QUALIFIERS, pos, "type qualifiers in return type of function type are meaningless");
3638                                 }
3639                         }
3640
3641                         /* The function type was constructed earlier.  Freeing it here will
3642                          * destroy other types. */
3643                         type = typehash_insert(function_type);
3644                         continue;
3645                 }
3646
3647                 case CONSTRUCT_POINTER: {
3648                         if (is_type_reference(skip_typeref(type)))
3649                                 errorf(pos, "cannot declare a pointer to reference");
3650
3651                         parsed_pointer_t *pointer = &iter->pointer;
3652                         type = make_based_pointer_type(type, pointer->type_qualifiers, pointer->base_variable);
3653                         continue;
3654                 }
3655
3656                 case CONSTRUCT_REFERENCE:
3657                         if (is_type_reference(skip_typeref(type)))
3658                                 errorf(pos, "cannot declare a reference to reference");
3659
3660                         type = make_reference_type(type);
3661                         continue;
3662
3663                 case CONSTRUCT_ARRAY: {
3664                         if (is_type_reference(skip_typeref(type)))
3665                                 errorf(pos, "cannot declare an array of references");
3666
3667                         parsed_array_t *array      = &iter->array;
3668                         type_t         *array_type = allocate_type_zero(TYPE_ARRAY);
3669
3670                         expression_t *size_expression = array->size;
3671                         if (size_expression != NULL) {
3672                                 size_expression
3673                                         = create_implicit_cast(size_expression, type_size_t);
3674                         }
3675
3676                         array_type->base.qualifiers       = array->type_qualifiers;
3677                         array_type->array.element_type    = type;
3678                         array_type->array.is_static       = array->is_static;
3679                         array_type->array.is_variable     = array->is_variable;
3680                         array_type->array.size_expression = size_expression;
3681
3682                         if (size_expression != NULL) {
3683                                 switch (is_constant_expression(size_expression)) {
3684                                 case EXPR_CLASS_CONSTANT: {
3685                                         long const size = fold_constant_to_int(size_expression);
3686                                         array_type->array.size          = size;
3687                                         array_type->array.size_constant = true;
3688                                         /* §6.7.5.2:1  If the expression is a constant expression,
3689                                          * it shall have a value greater than zero. */
3690                                         if (size < 0) {
3691                                                 errorf(&size_expression->base.source_position,
3692                                                            "size of array must be greater than zero");
3693                                         } else if (size == 0 && !GNU_MODE) {
3694                                                 errorf(&size_expression->base.source_position,
3695                                                            "size of array must be greater than zero (zero length arrays are a GCC extension)");
3696                                         }
3697                                         break;
3698                                 }
3699
3700                                 case EXPR_CLASS_VARIABLE:
3701                                         array_type->array.is_vla = true;
3702                                         break;
3703
3704                                 case EXPR_CLASS_ERROR:
3705                                         break;
3706                                 }
3707                         }
3708
3709                         type_t *skipped_type = skip_typeref(type);
3710                         /* §6.7.5.2:1 */
3711                         if (is_type_incomplete(skipped_type)) {
3712                                 errorf(pos, "array of incomplete type '%T' is not allowed", type);
3713                         } else if (is_type_function(skipped_type)) {
3714                                 errorf(pos, "array of functions is not allowed");
3715                         }
3716                         type = identify_new_type(array_type);
3717                         continue;
3718                 }
3719                 }
3720                 internal_errorf(pos, "invalid type construction found");
3721         }
3722
3723         return type;
3724 }
3725
3726 static type_t *automatic_type_conversion(type_t *orig_type);
3727
3728 static type_t *semantic_parameter(const source_position_t *pos,
3729                                   type_t *type,
3730                                   const declaration_specifiers_t *specifiers,
3731                                   entity_t const *const param)
3732 {
3733         /* §6.7.5.3:7  A declaration of a parameter as ``array of type''
3734          *             shall be adjusted to ``qualified pointer to type'',
3735          *             [...]
3736          * §6.7.5.3:8  A declaration of a parameter as ``function returning
3737          *             type'' shall be adjusted to ``pointer to function
3738          *             returning type'', as in 6.3.2.1. */
3739         type = automatic_type_conversion(type);
3740
3741         if (specifiers->is_inline && is_type_valid(type)) {
3742                 errorf(pos, "'%N' declared 'inline'", param);
3743         }
3744
3745         /* §6.9.1:6  The declarations in the declaration list shall contain
3746          *           no storage-class specifier other than register and no
3747          *           initializations. */
3748         if (specifiers->thread_local || (
3749                         specifiers->storage_class != STORAGE_CLASS_NONE   &&
3750                         specifiers->storage_class != STORAGE_CLASS_REGISTER)
3751            ) {
3752                 errorf(pos, "invalid storage class for '%N'", param);
3753         }
3754
3755         /* delay test for incomplete type, because we might have (void)
3756          * which is legal but incomplete... */
3757
3758         return type;
3759 }
3760
3761 static entity_t *parse_declarator(const declaration_specifiers_t *specifiers,
3762                                   declarator_flags_t flags)
3763 {
3764         parse_declarator_env_t env;
3765         memset(&env, 0, sizeof(env));
3766         env.may_be_abstract = (flags & DECL_MAY_BE_ABSTRACT) != 0;
3767
3768         construct_type_t *construct_type = parse_inner_declarator(&env);
3769         type_t           *orig_type      =
3770                 construct_declarator_type(construct_type, specifiers->type);
3771         type_t           *type           = skip_typeref(orig_type);
3772
3773         if (construct_type != NULL) {
3774                 obstack_free(&temp_obst, construct_type);
3775         }
3776
3777         attribute_t *attributes = parse_attributes(env.attributes);
3778         /* append (shared) specifier attribute behind attributes of this
3779          * declarator */
3780         attribute_t **anchor = &attributes;
3781         while (*anchor != NULL)
3782                 anchor = &(*anchor)->next;
3783         *anchor = specifiers->attributes;
3784
3785         entity_t *entity;
3786         if (specifiers->storage_class == STORAGE_CLASS_TYPEDEF) {
3787                 entity = allocate_entity_zero(ENTITY_TYPEDEF, NAMESPACE_NORMAL, env.symbol);
3788                 entity->base.source_position = env.source_position;
3789                 entity->typedefe.type        = orig_type;
3790
3791                 if (anonymous_entity != NULL) {
3792                         if (is_type_compound(type)) {
3793                                 assert(anonymous_entity->compound.alias == NULL);
3794                                 assert(anonymous_entity->kind == ENTITY_STRUCT ||
3795                                        anonymous_entity->kind == ENTITY_UNION);
3796                                 anonymous_entity->compound.alias = entity;
3797                                 anonymous_entity = NULL;
3798                         } else if (is_type_enum(type)) {
3799                                 assert(anonymous_entity->enume.alias == NULL);
3800                                 assert(anonymous_entity->kind == ENTITY_ENUM);
3801                                 anonymous_entity->enume.alias = entity;
3802                                 anonymous_entity = NULL;
3803                         }
3804                 }
3805         } else {
3806                 /* create a declaration type entity */
3807                 if (flags & DECL_CREATE_COMPOUND_MEMBER) {
3808                         entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER, NAMESPACE_NORMAL, env.symbol);
3809
3810                         if (env.symbol != NULL) {
3811                                 if (specifiers->is_inline && is_type_valid(type)) {
3812                                         errorf(&env.source_position,
3813                                                         "compound member '%Y' declared 'inline'", env.symbol);
3814                                 }
3815
3816                                 if (specifiers->thread_local ||
3817                                                 specifiers->storage_class != STORAGE_CLASS_NONE) {
3818                                         errorf(&env.source_position,
3819                                                         "compound member '%Y' must have no storage class",
3820                                                         env.symbol);
3821                                 }
3822                         }
3823                 } else if (flags & DECL_IS_PARAMETER) {
3824                         entity    = allocate_entity_zero(ENTITY_PARAMETER, NAMESPACE_NORMAL, env.symbol);
3825                         orig_type = semantic_parameter(&env.source_position, orig_type, specifiers, entity);
3826                 } else if (is_type_function(type)) {
3827                         entity = allocate_entity_zero(ENTITY_FUNCTION, NAMESPACE_NORMAL, env.symbol);
3828                         entity->function.is_inline      = specifiers->is_inline;
3829                         entity->function.elf_visibility = default_visibility;
3830                         entity->function.parameters     = env.parameters;
3831
3832                         if (env.symbol != NULL) {
3833                                 /* this needs fixes for C++ */
3834                                 bool in_function_scope = current_function != NULL;
3835
3836                                 if (specifiers->thread_local || (
3837                                                         specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3838                                                         specifiers->storage_class != STORAGE_CLASS_NONE   &&
3839                                                         (in_function_scope || specifiers->storage_class != STORAGE_CLASS_STATIC)
3840                                                 )) {
3841                                         errorf(&env.source_position, "invalid storage class for '%N'", entity);
3842                                 }
3843                         }
3844                 } else {
3845                         entity = allocate_entity_zero(ENTITY_VARIABLE, NAMESPACE_NORMAL, env.symbol);
3846                         entity->variable.elf_visibility = default_visibility;
3847                         entity->variable.thread_local   = specifiers->thread_local;
3848
3849                         if (env.symbol != NULL) {
3850                                 if (specifiers->is_inline && is_type_valid(type)) {
3851                                         errorf(&env.source_position, "'%N' declared 'inline'", entity);
3852                                 }
3853
3854                                 bool invalid_storage_class = false;
3855                                 if (current_scope == file_scope) {
3856                                         if (specifiers->storage_class != STORAGE_CLASS_EXTERN &&
3857                                                         specifiers->storage_class != STORAGE_CLASS_NONE   &&
3858                                                         specifiers->storage_class != STORAGE_CLASS_STATIC) {
3859                                                 invalid_storage_class = true;
3860                                         }
3861                                 } else {
3862                                         if (specifiers->thread_local &&
3863                                                         specifiers->storage_class == STORAGE_CLASS_NONE) {
3864                                                 invalid_storage_class = true;
3865                                         }
3866                                 }
3867                                 if (invalid_storage_class) {
3868                                         errorf(&env.source_position, "invalid storage class for variable '%N'", entity);
3869                                 }
3870                         }
3871                 }
3872
3873                 entity->base.source_position   = env.symbol != NULL ? env.source_position : specifiers->source_position;
3874                 entity->declaration.type       = orig_type;
3875                 entity->declaration.alignment  = get_type_alignment(orig_type);
3876                 entity->declaration.modifiers  = env.modifiers;
3877                 entity->declaration.attributes = attributes;
3878
3879                 storage_class_t storage_class = specifiers->storage_class;
3880                 entity->declaration.declared_storage_class = storage_class;
3881
3882                 if (storage_class == STORAGE_CLASS_NONE && current_function != NULL)
3883                         storage_class = STORAGE_CLASS_AUTO;
3884                 entity->declaration.storage_class = storage_class;
3885         }
3886
3887         if (attributes != NULL) {
3888                 handle_entity_attributes(attributes, entity);
3889         }
3890
3891         return entity;
3892 }
3893
3894 static type_t *parse_abstract_declarator(type_t *base_type)
3895 {
3896         parse_declarator_env_t env;
3897         memset(&env, 0, sizeof(env));
3898         env.may_be_abstract = true;
3899         env.must_be_abstract = true;
3900
3901         construct_type_t *construct_type = parse_inner_declarator(&env);
3902
3903         type_t *result = construct_declarator_type(construct_type, base_type);
3904         if (construct_type != NULL) {
3905                 obstack_free(&temp_obst, construct_type);
3906         }
3907         result = handle_type_attributes(env.attributes, result);
3908
3909         return result;
3910 }
3911
3912 /**
3913  * Check if the declaration of main is suspicious.  main should be a
3914  * function with external linkage, returning int, taking either zero
3915  * arguments, two, or three arguments of appropriate types, ie.
3916  *
3917  * int main([ int argc, char **argv [, char **env ] ]).
3918  *
3919  * @param decl    the declaration to check
3920  * @param type    the function type of the declaration
3921  */
3922 static void check_main(const entity_t *entity)
3923 {
3924         const source_position_t *pos = &entity->base.source_position;
3925         if (entity->kind != ENTITY_FUNCTION) {
3926                 warningf(WARN_MAIN, pos, "'main' is not a function");
3927                 return;
3928         }
3929
3930         if (entity->declaration.storage_class == STORAGE_CLASS_STATIC) {
3931                 warningf(WARN_MAIN, pos, "'main' is normally a non-static function");
3932         }
3933
3934         type_t *type = skip_typeref(entity->declaration.type);
3935         assert(is_type_function(type));
3936
3937         function_type_t const *const func_type = &type->function;
3938         type_t                *const ret_type  = func_type->return_type;
3939         if (!types_compatible(skip_typeref(ret_type), type_int)) {
3940                 warningf(WARN_MAIN, pos, "return type of 'main' should be 'int', but is '%T'", ret_type);
3941         }
3942         const function_parameter_t *parm = func_type->parameters;
3943         if (parm != NULL) {
3944                 type_t *const first_type        = skip_typeref(parm->type);
3945                 type_t *const first_type_unqual = get_unqualified_type(first_type);
3946                 if (!types_compatible(first_type_unqual, type_int)) {
3947                         warningf(WARN_MAIN, pos, "first argument of 'main' should be 'int', but is '%T'", parm->type);
3948                 }
3949                 parm = parm->next;
3950                 if (parm != NULL) {
3951                         type_t *const second_type = skip_typeref(parm->type);
3952                         type_t *const second_type_unqual
3953                                 = get_unqualified_type(second_type);
3954                         if (!types_compatible(second_type_unqual, type_char_ptr_ptr)) {
3955                                 warningf(WARN_MAIN, pos, "second argument of 'main' should be 'char**', but is '%T'", parm->type);
3956                         }
3957                         parm = parm->next;
3958                         if (parm != NULL) {
3959                                 type_t *const third_type = skip_typeref(parm->type);
3960                                 type_t *const third_type_unqual
3961                                         = get_unqualified_type(third_type);
3962                                 if (!types_compatible(third_type_unqual, type_char_ptr_ptr)) {
3963                                         warningf(WARN_MAIN, pos, "third argument of 'main' should be 'char**', but is '%T'", parm->type);
3964                                 }
3965                                 parm = parm->next;
3966                                 if (parm != NULL)
3967                                         goto warn_arg_count;
3968                         }
3969                 } else {
3970 warn_arg_count:
3971                         warningf(WARN_MAIN, pos, "'main' takes only zero, two or three arguments");
3972                 }
3973         }
3974 }
3975
3976 /**
3977  * Check if a symbol is the equal to "main".
3978  */
3979 static bool is_sym_main(const symbol_t *const sym)
3980 {
3981         return strcmp(sym->string, "main") == 0;
3982 }
3983
3984 static void error_redefined_as_different_kind(const source_position_t *pos,
3985                 const entity_t *old, entity_kind_t new_kind)
3986 {
3987         char              const *const what = get_entity_kind_name(new_kind);
3988         source_position_t const *const ppos = &old->base.source_position;
3989         errorf(pos, "redeclaration of '%N' as %s (declared %P)", old, what, ppos);
3990 }
3991
3992 static bool is_entity_valid(entity_t *const ent)
3993 {
3994         if (is_declaration(ent)) {
3995                 return is_type_valid(skip_typeref(ent->declaration.type));
3996         } else if (ent->kind == ENTITY_TYPEDEF) {
3997                 return is_type_valid(skip_typeref(ent->typedefe.type));
3998         }
3999         return true;
4000 }
4001
4002 static bool contains_attribute(const attribute_t *list, const attribute_t *attr)
4003 {
4004         for (const attribute_t *tattr = list; tattr != NULL; tattr = tattr->next) {
4005                 if (attributes_equal(tattr, attr))
4006                         return true;
4007         }
4008         return false;
4009 }
4010
4011 /**
4012  * test wether new_list contains any attributes not included in old_list
4013  */
4014 static bool has_new_attributes(const attribute_t *old_list,
4015                                const attribute_t *new_list)
4016 {
4017         for (const attribute_t *attr = new_list; attr != NULL; attr = attr->next) {
4018                 if (!contains_attribute(old_list, attr))
4019                         return true;
4020         }
4021         return false;
4022 }
4023
4024 /**
4025  * Merge in attributes from an attribute list (probably from a previous
4026  * declaration with the same name). Warning: destroys the old structure
4027  * of the attribute list - don't reuse attributes after this call.
4028  */
4029 static void merge_in_attributes(declaration_t *decl, attribute_t *attributes)
4030 {
4031         attribute_t *next;
4032         for (attribute_t *attr = attributes; attr != NULL; attr = next) {
4033                 next = attr->next;
4034                 if (contains_attribute(decl->attributes, attr))
4035                         continue;
4036
4037                 /* move attribute to new declarations attributes list */
4038                 attr->next       = decl->attributes;
4039                 decl->attributes = attr;
4040         }
4041 }
4042
4043 /**
4044  * record entities for the NAMESPACE_NORMAL, and produce error messages/warnings
4045  * for various problems that occur for multiple definitions
4046  */
4047 entity_t *record_entity(entity_t *entity, const bool is_definition)
4048 {
4049         const symbol_t *const    symbol  = entity->base.symbol;
4050         const namespace_tag_t    namespc = (namespace_tag_t)entity->base.namespc;
4051         const source_position_t *pos     = &entity->base.source_position;
4052
4053         /* can happen in error cases */
4054         if (symbol == NULL)
4055                 return entity;
4056
4057         entity_t *const previous_entity = get_entity(symbol, namespc);
4058         /* pushing the same entity twice will break the stack structure */
4059         assert(previous_entity != entity);
4060
4061         if (entity->kind == ENTITY_FUNCTION) {
4062                 type_t *const orig_type = entity->declaration.type;
4063                 type_t *const type      = skip_typeref(orig_type);
4064
4065                 assert(is_type_function(type));
4066                 if (type->function.unspecified_parameters &&
4067                     previous_entity == NULL               &&
4068                     !entity->declaration.implicit) {
4069                         warningf(WARN_STRICT_PROTOTYPES, pos, "function declaration '%#N' is not a prototype", entity);
4070                 }
4071
4072                 if (current_scope == file_scope && is_sym_main(symbol)) {
4073                         check_main(entity);
4074                 }
4075         }
4076
4077         if (is_declaration(entity)                                    &&
4078             entity->declaration.storage_class == STORAGE_CLASS_EXTERN &&
4079             current_scope != file_scope                               &&
4080             !entity->declaration.implicit) {
4081                 warningf(WARN_NESTED_EXTERNS, pos, "nested extern declaration of '%#N'", entity);
4082         }
4083
4084         if (previous_entity != NULL) {
4085                 source_position_t const *const ppos = &previous_entity->base.source_position;
4086
4087                 if (previous_entity->base.parent_scope == &current_function->parameters &&
4088                                 previous_entity->base.parent_scope->depth + 1 == current_scope->depth) {
4089                         assert(previous_entity->kind == ENTITY_PARAMETER);
4090                         errorf(pos, "declaration of '%N' redeclares the '%N' (declared %P)", entity, previous_entity, ppos);
4091                         goto finish;
4092                 }
4093
4094                 if (previous_entity->base.parent_scope == current_scope) {
4095                         if (previous_entity->kind != entity->kind) {
4096                                 if (is_entity_valid(previous_entity) && is_entity_valid(entity)) {
4097                                         error_redefined_as_different_kind(pos, previous_entity,
4098                                                         entity->kind);
4099                                 }
4100                                 goto finish;
4101                         }
4102                         if (previous_entity->kind == ENTITY_ENUM_VALUE) {
4103                                 errorf(pos, "redeclaration of '%N' (declared %P)", entity, ppos);
4104                                 goto finish;
4105                         }
4106                         if (previous_entity->kind == ENTITY_TYPEDEF) {
4107                                 type_t *const type      = skip_typeref(entity->typedefe.type);
4108                                 type_t *const prev_type
4109                                         = skip_typeref(previous_entity->typedefe.type);
4110                                 /* gcc extension redef in system headers is allowed */
4111                                 if ((!(c_mode & _CXX) && !pos->is_system_header)
4112                                         || !types_compatible(type, prev_type)) {
4113                                         errorf(pos, "redefinition of '%N' (declared %P)",
4114                                                entity, ppos);
4115                                 }
4116                                 goto finish;
4117                         }
4118
4119                         /* at this point we should have only VARIABLES or FUNCTIONS */
4120                         assert(is_declaration(previous_entity) && is_declaration(entity));
4121
4122                         declaration_t *const prev_decl = &previous_entity->declaration;
4123                         declaration_t *const decl      = &entity->declaration;
4124
4125                         /* can happen for K&R style declarations */
4126                         if (prev_decl->type       == NULL             &&
4127                                         previous_entity->kind == ENTITY_PARAMETER &&
4128                                         entity->kind          == ENTITY_PARAMETER) {
4129                                 prev_decl->type                   = decl->type;
4130                                 prev_decl->storage_class          = decl->storage_class;
4131                                 prev_decl->declared_storage_class = decl->declared_storage_class;
4132                                 prev_decl->modifiers              = decl->modifiers;
4133                                 return previous_entity;
4134                         }
4135
4136                         type_t *const type      = skip_typeref(decl->type);
4137                         type_t *const prev_type = skip_typeref(prev_decl->type);
4138
4139                         if (!types_compatible(type, prev_type)) {
4140                                 errorf(pos, "declaration '%#N' is incompatible with '%#N' (declared %P)", entity, previous_entity, ppos);
4141                         } else {
4142                                 unsigned old_storage_class = prev_decl->storage_class;
4143
4144                                 if (is_definition                     &&
4145                                                 !prev_decl->used                  &&
4146                                                 !(prev_decl->modifiers & DM_USED) &&
4147                                                 prev_decl->storage_class == STORAGE_CLASS_STATIC) {
4148                                         warningf(WARN_REDUNDANT_DECLS, ppos, "unnecessary static forward declaration for '%#N'", previous_entity);
4149                                 }
4150
4151                                 storage_class_t new_storage_class = decl->storage_class;
4152
4153                                 /* pretend no storage class means extern for function
4154                                  * declarations (except if the previous declaration is neither
4155                                  * none nor extern) */
4156                                 if (entity->kind == ENTITY_FUNCTION) {
4157                                         /* the previous declaration could have unspecified parameters or
4158                                          * be a typedef, so use the new type */
4159                                         if (prev_type->function.unspecified_parameters || is_definition)
4160                                                 prev_decl->type = type;
4161
4162                                         switch (old_storage_class) {
4163                                                 case STORAGE_CLASS_NONE:
4164                                                         old_storage_class = STORAGE_CLASS_EXTERN;
4165                                                         /* FALLTHROUGH */
4166
4167                                                 case STORAGE_CLASS_EXTERN:
4168                                                         if (is_definition) {
4169                                                                 if (prev_type->function.unspecified_parameters && !is_sym_main(symbol)) {
4170                                                                         warningf(WARN_MISSING_PROTOTYPES, pos, "no previous prototype for '%#N'", entity);
4171                                                                 }
4172                                                         } else if (new_storage_class == STORAGE_CLASS_NONE) {
4173                                                                 new_storage_class = STORAGE_CLASS_EXTERN;
4174                                                         }
4175                                                         break;
4176
4177                                                 default:
4178                                                         break;
4179                                         }
4180                                 } else if (is_type_incomplete(prev_type)) {
4181                                         prev_decl->type = type;
4182                                 }
4183
4184                                 if (old_storage_class == STORAGE_CLASS_EXTERN &&
4185                                                 new_storage_class == STORAGE_CLASS_EXTERN) {
4186
4187 warn_redundant_declaration: ;
4188                                         bool has_new_attrs
4189                                                 = has_new_attributes(prev_decl->attributes,
4190                                                                      decl->attributes);
4191                                         if (has_new_attrs) {
4192                                                 merge_in_attributes(decl, prev_decl->attributes);
4193                                         } else if (!is_definition        &&
4194                                                         is_type_valid(prev_type) &&
4195                                                         !pos->is_system_header) {
4196                                                 warningf(WARN_REDUNDANT_DECLS, pos, "redundant declaration for '%Y' (declared %P)", symbol, ppos);
4197                                         }
4198                                 } else if (current_function == NULL) {
4199                                         if (old_storage_class != STORAGE_CLASS_STATIC &&
4200                                                         new_storage_class == STORAGE_CLASS_STATIC) {
4201                                                 errorf(pos, "static declaration of '%Y' follows non-static declaration (declared %P)", symbol, ppos);
4202                                         } else if (old_storage_class == STORAGE_CLASS_EXTERN) {
4203                                                 prev_decl->storage_class          = STORAGE_CLASS_NONE;
4204                                                 prev_decl->declared_storage_class = STORAGE_CLASS_NONE;
4205                                         } else {
4206                                                 /* ISO/IEC 14882:1998(E) §C.1.2:1 */
4207                                                 if (c_mode & _CXX)
4208                                                         goto error_redeclaration;
4209                                                 goto warn_redundant_declaration;
4210                                         }
4211                                 } else if (is_type_valid(prev_type)) {
4212                                         if (old_storage_class == new_storage_class) {
4213 error_redeclaration:
4214                                                 errorf(pos, "redeclaration of '%Y' (declared %P)", symbol, ppos);
4215                                         } else {
4216                                                 errorf(pos, "redeclaration of '%Y' with different linkage (declared %P)", symbol, ppos);
4217                                         }
4218                                 }
4219                         }
4220
4221                         prev_decl->modifiers |= decl->modifiers;
4222                         if (entity->kind == ENTITY_FUNCTION) {
4223                                 previous_entity->function.is_inline |= entity->function.is_inline;
4224                         }
4225                         return previous_entity;
4226                 }
4227
4228                 warning_t why;
4229                 if (is_warn_on(why = WARN_SHADOW) ||
4230                     (is_warn_on(why = WARN_SHADOW_LOCAL) && previous_entity->base.parent_scope != file_scope)) {
4231                         char const *const what = get_entity_kind_name(previous_entity->kind);
4232                         warningf(why, pos, "'%N' shadows %s (declared %P)", entity, what, ppos);
4233                 }
4234         }
4235
4236         if (entity->kind == ENTITY_FUNCTION) {
4237                 if (is_definition &&
4238                                 entity->declaration.storage_class != STORAGE_CLASS_STATIC &&
4239                                 !is_sym_main(symbol)) {
4240                         if (is_warn_on(WARN_MISSING_PROTOTYPES)) {
4241                                 warningf(WARN_MISSING_PROTOTYPES, pos, "no previous prototype for '%#N'", entity);
4242                         } else {
4243                                 goto warn_missing_declaration;
4244                         }
4245                 }
4246         } else if (entity->kind == ENTITY_VARIABLE) {
4247                 if (current_scope                     == file_scope &&
4248                                 entity->declaration.storage_class == STORAGE_CLASS_NONE &&
4249                                 !entity->declaration.implicit) {
4250 warn_missing_declaration:
4251                         warningf(WARN_MISSING_DECLARATIONS, pos, "no previous declaration for '%#N'", entity);
4252                 }
4253         }
4254
4255 finish:
4256         assert(entity->base.parent_scope == NULL);
4257         assert(current_scope != NULL);
4258
4259         entity->base.parent_scope = current_scope;
4260         environment_push(entity);
4261         append_entity(current_scope, entity);
4262
4263         return entity;
4264 }
4265
4266 static void parser_error_multiple_definition(entity_t *entity,
4267                 const source_position_t *source_position)
4268 {
4269         errorf(source_position, "multiple definition of '%Y' (declared %P)",
4270                entity->base.symbol, &entity->base.source_position);
4271 }
4272
4273 static bool is_declaration_specifier(const token_t *token)
4274 {
4275         switch (token->kind) {
4276                 DECLARATION_START
4277                         return true;
4278                 case T_IDENTIFIER:
4279                         return is_typedef_symbol(token->identifier.symbol);
4280
4281                 default:
4282                         return false;
4283         }
4284 }
4285
4286 static void parse_init_declarator_rest(entity_t *entity)
4287 {
4288         type_t *orig_type = type_error_type;
4289
4290         if (entity->base.kind == ENTITY_TYPEDEF) {
4291                 source_position_t const *const pos = &entity->base.source_position;
4292                 errorf(pos, "'%N' is initialized (use __typeof__ instead)", entity);
4293         } else {
4294                 assert(is_declaration(entity));
4295                 orig_type = entity->declaration.type;
4296         }
4297
4298         type_t *type = skip_typeref(orig_type);
4299
4300         if (entity->kind == ENTITY_VARIABLE
4301                         && entity->variable.initializer != NULL) {
4302                 parser_error_multiple_definition(entity, HERE);
4303         }
4304         eat('=');
4305
4306         declaration_t *const declaration = &entity->declaration;
4307         bool must_be_constant = false;
4308         if (declaration->storage_class == STORAGE_CLASS_STATIC ||
4309             entity->base.parent_scope  == file_scope) {
4310                 must_be_constant = true;
4311         }
4312
4313         if (is_type_function(type)) {
4314                 source_position_t const *const pos = &entity->base.source_position;
4315                 errorf(pos, "'%N' is initialized like a variable", entity);
4316                 orig_type = type_error_type;
4317         }
4318
4319         parse_initializer_env_t env;
4320         env.type             = orig_type;
4321         env.must_be_constant = must_be_constant;
4322         env.entity           = entity;
4323
4324         initializer_t *initializer = parse_initializer(&env);
4325
4326         if (entity->kind == ENTITY_VARIABLE) {
4327                 /* §6.7.5:22  array initializers for arrays with unknown size
4328                  * determine the array type size */
4329                 declaration->type            = env.type;
4330                 entity->variable.initializer = initializer;
4331         }
4332 }
4333
4334 /* parse rest of a declaration without any declarator */
4335 static void parse_anonymous_declaration_rest(
4336                 const declaration_specifiers_t *specifiers)
4337 {
4338         eat(';');
4339         anonymous_entity = NULL;
4340
4341         source_position_t const *const pos = &specifiers->source_position;
4342         if (specifiers->storage_class != STORAGE_CLASS_NONE ||
4343                         specifiers->thread_local) {
4344                 warningf(WARN_OTHER, pos, "useless storage class in empty declaration");
4345         }
4346
4347         type_t *type = specifiers->type;
4348         switch (type->kind) {
4349                 case TYPE_COMPOUND_STRUCT:
4350                 case TYPE_COMPOUND_UNION: {
4351                         if (type->compound.compound->base.symbol == NULL) {
4352                                 warningf(WARN_OTHER, pos, "unnamed struct/union that defines no instances");
4353                         }
4354                         break;
4355                 }
4356
4357                 case TYPE_ENUM:
4358                         break;
4359
4360                 default:
4361                         warningf(WARN_OTHER, pos, "empty declaration");
4362                         break;
4363         }
4364 }
4365
4366 static void check_variable_type_complete(entity_t *ent)
4367 {
4368         if (ent->kind != ENTITY_VARIABLE)
4369                 return;
4370
4371         /* §6.7:7  If an identifier for an object is declared with no linkage, the
4372          *         type for the object shall be complete [...] */
4373         declaration_t *decl = &ent->declaration;
4374         if (decl->storage_class == STORAGE_CLASS_EXTERN ||
4375                         decl->storage_class == STORAGE_CLASS_STATIC)
4376                 return;
4377
4378         type_t *const type = skip_typeref(decl->type);
4379         if (!is_type_incomplete(type))
4380                 return;
4381
4382         /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
4383          * are given length one. */
4384         if (is_type_array(type) && ent->base.parent_scope == file_scope) {
4385                 ARR_APP1(declaration_t*, incomplete_arrays, decl);
4386                 return;
4387         }
4388
4389         errorf(&ent->base.source_position, "variable '%#N' has incomplete type", ent);
4390 }
4391
4392
4393 static void parse_declaration_rest(entity_t *ndeclaration,
4394                 const declaration_specifiers_t *specifiers,
4395                 parsed_declaration_func         finished_declaration,
4396                 declarator_flags_t              flags)
4397 {
4398         add_anchor_token(';');
4399         add_anchor_token(',');
4400         while (true) {
4401                 entity_t *entity = finished_declaration(ndeclaration, token.kind == '=');
4402
4403                 if (token.kind == '=') {
4404                         parse_init_declarator_rest(entity);
4405                 } else if (entity->kind == ENTITY_VARIABLE) {
4406                         /* ISO/IEC 14882:1998(E) §8.5.3:3  The initializer can be omitted
4407                          * [...] where the extern specifier is explicitly used. */
4408                         declaration_t *decl = &entity->declaration;
4409                         if (decl->storage_class != STORAGE_CLASS_EXTERN) {
4410                                 type_t *type = decl->type;
4411                                 if (is_type_reference(skip_typeref(type))) {
4412                                         source_position_t const *const pos = &entity->base.source_position;
4413                                         errorf(pos, "reference '%#N' must be initialized", entity);
4414                                 }
4415                         }
4416                 }
4417
4418                 check_variable_type_complete(entity);
4419
4420                 if (!next_if(','))
4421                         break;
4422
4423                 add_anchor_token('=');
4424                 ndeclaration = parse_declarator(specifiers, flags);
4425                 rem_anchor_token('=');
4426         }
4427         expect(';', end_error);
4428
4429 end_error:
4430         anonymous_entity = NULL;
4431         rem_anchor_token(';');
4432         rem_anchor_token(',');
4433 }
4434
4435 static entity_t *finished_kr_declaration(entity_t *entity, bool is_definition)
4436 {
4437         symbol_t *symbol = entity->base.symbol;
4438         if (symbol == NULL)
4439                 return entity;
4440
4441         assert(entity->base.namespc == NAMESPACE_NORMAL);
4442         entity_t *previous_entity = get_entity(symbol, NAMESPACE_NORMAL);
4443         if (previous_entity == NULL
4444                         || previous_entity->base.parent_scope != current_scope) {
4445                 errorf(&entity->base.source_position, "expected declaration of a function parameter, found '%Y'",
4446                        symbol);
4447                 return entity;
4448         }
4449
4450         if (is_definition) {
4451                 errorf(HERE, "'%N' is initialised", entity);
4452         }
4453
4454         return record_entity(entity, false);
4455 }
4456
4457 static void parse_declaration(parsed_declaration_func finished_declaration,
4458                               declarator_flags_t      flags)
4459 {
4460         add_anchor_token(';');
4461         declaration_specifiers_t specifiers;
4462         parse_declaration_specifiers(&specifiers);
4463         rem_anchor_token(';');
4464
4465         if (token.kind == ';') {
4466                 parse_anonymous_declaration_rest(&specifiers);
4467         } else {
4468                 entity_t *entity = parse_declarator(&specifiers, flags);
4469                 parse_declaration_rest(entity, &specifiers, finished_declaration, flags);
4470         }
4471 }
4472
4473 /* §6.5.2.2:6 */
4474 static type_t *get_default_promoted_type(type_t *orig_type)
4475 {
4476         type_t *result = orig_type;
4477
4478         type_t *type = skip_typeref(orig_type);
4479         if (is_type_integer(type)) {
4480                 result = promote_integer(type);
4481         } else if (is_type_atomic(type, ATOMIC_TYPE_FLOAT)) {
4482                 result = type_double;
4483         }
4484
4485         return result;
4486 }
4487
4488 static void parse_kr_declaration_list(entity_t *entity)
4489 {
4490         if (entity->kind != ENTITY_FUNCTION)
4491                 return;
4492
4493         type_t *type = skip_typeref(entity->declaration.type);
4494         assert(is_type_function(type));
4495         if (!type->function.kr_style_parameters)
4496                 return;
4497
4498         add_anchor_token('{');
4499
4500         PUSH_SCOPE(&entity->function.parameters);
4501
4502         entity_t *parameter = entity->function.parameters.entities;
4503         for ( ; parameter != NULL; parameter = parameter->base.next) {
4504                 assert(parameter->base.parent_scope == NULL);
4505                 parameter->base.parent_scope = current_scope;
4506                 environment_push(parameter);
4507         }
4508
4509         /* parse declaration list */
4510         for (;;) {
4511                 switch (token.kind) {
4512                         DECLARATION_START
4513                         /* This covers symbols, which are no type, too, and results in
4514                          * better error messages.  The typical cases are misspelled type
4515                          * names and missing includes. */
4516                         case T_IDENTIFIER:
4517                                 parse_declaration(finished_kr_declaration, DECL_IS_PARAMETER);
4518                                 break;
4519                         default:
4520                                 goto decl_list_end;
4521                 }
4522         }
4523 decl_list_end:
4524
4525         POP_SCOPE();
4526
4527         /* update function type */
4528         type_t *new_type = duplicate_type(type);
4529
4530         function_parameter_t  *parameters = NULL;
4531         function_parameter_t **anchor     = &parameters;
4532
4533         /* did we have an earlier prototype? */
4534         entity_t *proto_type = get_entity(entity->base.symbol, NAMESPACE_NORMAL);
4535         if (proto_type != NULL && proto_type->kind != ENTITY_FUNCTION)
4536                 proto_type = NULL;
4537
4538         function_parameter_t *proto_parameter = NULL;
4539         if (proto_type != NULL) {
4540                 type_t *proto_type_type = proto_type->declaration.type;
4541                 proto_parameter         = proto_type_type->function.parameters;
4542                 /* If a K&R function definition has a variadic prototype earlier, then
4543                  * make the function definition variadic, too. This should conform to
4544                  * §6.7.5.3:15 and §6.9.1:8. */
4545                 new_type->function.variadic = proto_type_type->function.variadic;
4546         } else {
4547                 /* §6.9.1.7: A K&R style parameter list does NOT act as a function
4548                  * prototype */
4549                 new_type->function.unspecified_parameters = true;
4550         }
4551
4552         bool need_incompatible_warning = false;
4553         parameter = entity->function.parameters.entities;
4554         for (; parameter != NULL; parameter = parameter->base.next,
4555                         proto_parameter =
4556                                 proto_parameter == NULL ? NULL : proto_parameter->next) {
4557                 if (parameter->kind != ENTITY_PARAMETER)
4558                         continue;
4559
4560                 type_t *parameter_type = parameter->declaration.type;
4561                 if (parameter_type == NULL) {
4562                         source_position_t const* const pos = &parameter->base.source_position;
4563                         if (strict_mode) {
4564                                 errorf(pos, "no type specified for function '%N'", parameter);
4565                                 parameter_type = type_error_type;
4566                         } else {
4567                                 warningf(WARN_IMPLICIT_INT, pos, "no type specified for function parameter '%N', using 'int'", parameter);
4568                                 parameter_type = type_int;
4569                         }
4570                         parameter->declaration.type = parameter_type;
4571                 }
4572
4573                 semantic_parameter_incomplete(parameter);
4574
4575                 /* we need the default promoted types for the function type */
4576                 type_t *not_promoted = parameter_type;
4577                 parameter_type       = get_default_promoted_type(parameter_type);
4578
4579                 /* gcc special: if the type of the prototype matches the unpromoted
4580                  * type don't promote */
4581                 if (!strict_mode && proto_parameter != NULL) {
4582                         type_t *proto_p_type = skip_typeref(proto_parameter->type);
4583                         type_t *promo_skip   = skip_typeref(parameter_type);
4584                         type_t *param_skip   = skip_typeref(not_promoted);
4585                         if (!types_compatible(proto_p_type, promo_skip)
4586                                 && types_compatible(proto_p_type, param_skip)) {
4587                                 /* don't promote */
4588                                 need_incompatible_warning = true;
4589                                 parameter_type = not_promoted;
4590                         }
4591                 }
4592                 function_parameter_t *const function_parameter
4593                         = allocate_parameter(parameter_type);
4594
4595                 *anchor = function_parameter;
4596                 anchor  = &function_parameter->next;
4597         }
4598
4599         new_type->function.parameters = parameters;
4600         new_type = identify_new_type(new_type);
4601
4602         if (need_incompatible_warning) {
4603                 symbol_t          const *const sym  = entity->base.symbol;
4604                 source_position_t const *const pos  = &entity->base.source_position;
4605                 source_position_t const *const ppos = &proto_type->base.source_position;
4606                 warningf(WARN_OTHER, pos, "declaration '%#N' is incompatible with '%#T' (declared %P)", proto_type, new_type, sym, ppos);
4607         }
4608         entity->declaration.type = new_type;
4609
4610         rem_anchor_token('{');
4611 }
4612
4613 static bool first_err = true;
4614
4615 /**
4616  * When called with first_err set, prints the name of the current function,
4617  * else does noting.
4618  */
4619 static void print_in_function(void)
4620 {
4621         if (first_err) {
4622                 first_err = false;
4623                 char const *const file = current_function->base.base.source_position.input_name;
4624                 diagnosticf("%s: In '%N':\n", file, (entity_t const*)current_function);
4625         }
4626 }
4627
4628 /**
4629  * Check if all labels are defined in the current function.
4630  * Check if all labels are used in the current function.
4631  */
4632 static void check_labels(void)
4633 {
4634         for (const goto_statement_t *goto_statement = goto_first;
4635             goto_statement != NULL;
4636             goto_statement = goto_statement->next) {
4637                 /* skip computed gotos */
4638                 if (goto_statement->expression != NULL)
4639                         continue;
4640
4641                 label_t *label = goto_statement->label;
4642                 if (label->base.source_position.input_name == NULL) {
4643                         print_in_function();
4644                         source_position_t const *const pos = &goto_statement->base.source_position;
4645                         errorf(pos, "'%N' used but not defined", (entity_t const*)label);
4646                  }
4647         }
4648
4649         if (is_warn_on(WARN_UNUSED_LABEL)) {
4650                 for (const label_statement_t *label_statement = label_first;
4651                          label_statement != NULL;
4652                          label_statement = label_statement->next) {
4653                         label_t *label = label_statement->label;
4654
4655                         if (! label->used) {
4656                                 print_in_function();
4657                                 source_position_t const *const pos = &label_statement->base.source_position;
4658                                 warningf(WARN_UNUSED_LABEL, pos, "'%N' defined but not used", (entity_t const*)label);
4659                         }
4660                 }
4661         }
4662 }
4663
4664 static void warn_unused_entity(warning_t const why, entity_t *entity, entity_t *const last)
4665 {
4666         entity_t const *const end = last != NULL ? last->base.next : NULL;
4667         for (; entity != end; entity = entity->base.next) {
4668                 if (!is_declaration(entity))
4669                         continue;
4670
4671                 declaration_t *declaration = &entity->declaration;
4672                 if (declaration->implicit)
4673                         continue;
4674
4675                 if (!declaration->used) {
4676                         print_in_function();
4677                         warningf(why, &entity->base.source_position, "'%N' is unused", entity);
4678                 } else if (entity->kind == ENTITY_VARIABLE && !entity->variable.read) {
4679                         print_in_function();
4680                         warningf(why, &entity->base.source_position, "'%N' is never read", entity);
4681                 }
4682         }
4683 }
4684
4685 static void check_unused_variables(statement_t *const stmt, void *const env)
4686 {
4687         (void)env;
4688
4689         switch (stmt->kind) {
4690                 case STATEMENT_DECLARATION: {
4691                         declaration_statement_t const *const decls = &stmt->declaration;
4692                         warn_unused_entity(WARN_UNUSED_VARIABLE, decls->declarations_begin, decls->declarations_end);
4693                         return;
4694                 }
4695
4696                 case STATEMENT_FOR:
4697                         warn_unused_entity(WARN_UNUSED_VARIABLE, stmt->fors.scope.entities, NULL);
4698                         return;
4699
4700                 default:
4701                         return;
4702         }
4703 }
4704
4705 /**
4706  * Check declarations of current_function for unused entities.
4707  */
4708 static void check_declarations(void)
4709 {
4710         if (is_warn_on(WARN_UNUSED_PARAMETER)) {
4711                 const scope_t *scope = &current_function->parameters;
4712
4713                 /* do not issue unused warnings for main */
4714                 if (!is_sym_main(current_function->base.base.symbol)) {
4715                         warn_unused_entity(WARN_UNUSED_PARAMETER, scope->entities, NULL);
4716                 }
4717         }
4718         if (is_warn_on(WARN_UNUSED_VARIABLE)) {
4719                 walk_statements(current_function->statement, check_unused_variables,
4720                                 NULL);
4721         }
4722 }
4723
4724 static int determine_truth(expression_t const* const cond)
4725 {
4726         return
4727                 is_constant_expression(cond) != EXPR_CLASS_CONSTANT ? 0 :
4728                 fold_constant_to_bool(cond)                         ? 1 :
4729                 -1;
4730 }
4731
4732 static void check_reachable(statement_t *);
4733 static bool reaches_end;
4734
4735 static bool expression_returns(expression_t const *const expr)
4736 {
4737         switch (expr->kind) {
4738                 case EXPR_CALL: {
4739                         expression_t const *const func = expr->call.function;
4740                         if (func->kind == EXPR_REFERENCE) {
4741                                 entity_t *entity = func->reference.entity;
4742                                 if (entity->kind == ENTITY_FUNCTION
4743                                                 && entity->declaration.modifiers & DM_NORETURN)
4744                                         return false;
4745                         }
4746
4747                         if (!expression_returns(func))
4748                                 return false;
4749
4750                         for (call_argument_t const* arg = expr->call.arguments; arg != NULL; arg = arg->next) {
4751                                 if (!expression_returns(arg->expression))
4752                                         return false;
4753                         }
4754
4755                         return true;
4756                 }
4757
4758                 case EXPR_REFERENCE:
4759                 case EXPR_REFERENCE_ENUM_VALUE:
4760                 EXPR_LITERAL_CASES
4761                 case EXPR_STRING_LITERAL:
4762                 case EXPR_WIDE_STRING_LITERAL:
4763                 case EXPR_COMPOUND_LITERAL: // TODO descend into initialisers
4764                 case EXPR_LABEL_ADDRESS:
4765                 case EXPR_CLASSIFY_TYPE:
4766                 case EXPR_SIZEOF: // TODO handle obscure VLA case
4767                 case EXPR_ALIGNOF:
4768                 case EXPR_FUNCNAME:
4769                 case EXPR_BUILTIN_CONSTANT_P:
4770                 case EXPR_BUILTIN_TYPES_COMPATIBLE_P:
4771                 case EXPR_OFFSETOF:
4772                 case EXPR_ERROR:
4773                         return true;
4774
4775                 case EXPR_STATEMENT: {
4776                         bool old_reaches_end = reaches_end;
4777                         reaches_end = false;
4778                         check_reachable(expr->statement.statement);
4779                         bool returns = reaches_end;
4780                         reaches_end = old_reaches_end;
4781                         return returns;
4782                 }
4783
4784                 case EXPR_CONDITIONAL:
4785                         // TODO handle constant expression
4786
4787                         if (!expression_returns(expr->conditional.condition))
4788                                 return false;
4789
4790                         if (expr->conditional.true_expression != NULL
4791                                         && expression_returns(expr->conditional.true_expression))
4792                                 return true;
4793
4794                         return expression_returns(expr->conditional.false_expression);
4795
4796                 case EXPR_SELECT:
4797                         return expression_returns(expr->select.compound);
4798
4799                 case EXPR_ARRAY_ACCESS:
4800                         return
4801                                 expression_returns(expr->array_access.array_ref) &&
4802                                 expression_returns(expr->array_access.index);
4803
4804                 case EXPR_VA_START:
4805                         return expression_returns(expr->va_starte.ap);
4806
4807                 case EXPR_VA_ARG:
4808                         return expression_returns(expr->va_arge.ap);
4809
4810                 case EXPR_VA_COPY:
4811                         return expression_returns(expr->va_copye.src);
4812
4813                 EXPR_UNARY_CASES_MANDATORY
4814                         return expression_returns(expr->unary.value);
4815
4816                 case EXPR_UNARY_THROW:
4817                         return false;
4818
4819                 EXPR_BINARY_CASES
4820                         // TODO handle constant lhs of && and ||
4821                         return
4822                                 expression_returns(expr->binary.left) &&
4823                                 expression_returns(expr->binary.right);
4824         }
4825
4826         panic("unhandled expression");
4827 }
4828
4829 static bool initializer_returns(initializer_t const *const init)
4830 {
4831         switch (init->kind) {
4832                 case INITIALIZER_VALUE:
4833                         return expression_returns(init->value.value);
4834
4835                 case INITIALIZER_LIST: {
4836                         initializer_t * const*       i       = init->list.initializers;
4837                         initializer_t * const* const end     = i + init->list.len;
4838                         bool                         returns = true;
4839                         for (; i != end; ++i) {
4840                                 if (!initializer_returns(*i))
4841                                         returns = false;
4842                         }
4843                         return returns;
4844                 }
4845
4846                 case INITIALIZER_STRING:
4847                 case INITIALIZER_WIDE_STRING:
4848                 case INITIALIZER_DESIGNATOR: // designators have no payload
4849                         return true;
4850         }
4851         panic("unhandled initializer");
4852 }
4853
4854 static bool noreturn_candidate;
4855
4856 static void check_reachable(statement_t *const stmt)
4857 {
4858         if (stmt->base.reachable)
4859                 return;
4860         if (stmt->kind != STATEMENT_DO_WHILE)
4861                 stmt->base.reachable = true;
4862
4863         statement_t *last = stmt;
4864         statement_t *next;
4865         switch (stmt->kind) {
4866                 case STATEMENT_ERROR:
4867                 case STATEMENT_EMPTY:
4868                 case STATEMENT_ASM:
4869                         next = stmt->base.next;
4870                         break;
4871
4872                 case STATEMENT_DECLARATION: {
4873                         declaration_statement_t const *const decl = &stmt->declaration;
4874                         entity_t                const *      ent  = decl->declarations_begin;
4875                         entity_t                const *const last_decl = decl->declarations_end;
4876                         if (ent != NULL) {
4877                                 for (;; ent = ent->base.next) {
4878                                         if (ent->kind                 == ENTITY_VARIABLE &&
4879                                             ent->variable.initializer != NULL            &&
4880                                             !initializer_returns(ent->variable.initializer)) {
4881                                                 return;
4882                                         }
4883                                         if (ent == last_decl)
4884                                                 break;
4885                                 }
4886                         }
4887                         next = stmt->base.next;
4888                         break;
4889                 }
4890
4891                 case STATEMENT_COMPOUND:
4892                         next = stmt->compound.statements;
4893                         if (next == NULL)
4894                                 next = stmt->base.next;
4895                         break;
4896
4897                 case STATEMENT_RETURN: {
4898                         expression_t const *const val = stmt->returns.value;
4899                         if (val == NULL || expression_returns(val))
4900                                 noreturn_candidate = false;
4901                         return;
4902                 }
4903
4904                 case STATEMENT_IF: {
4905                         if_statement_t const *const ifs  = &stmt->ifs;
4906                         expression_t   const *const cond = ifs->condition;
4907
4908                         if (!expression_returns(cond))
4909                                 return;
4910
4911                         int const val = determine_truth(cond);
4912
4913                         if (val >= 0)
4914                                 check_reachable(ifs->true_statement);
4915
4916                         if (val > 0)
4917                                 return;
4918
4919                         if (ifs->false_statement != NULL) {
4920                                 check_reachable(ifs->false_statement);
4921                                 return;
4922                         }
4923
4924                         next = stmt->base.next;
4925                         break;
4926                 }
4927
4928                 case STATEMENT_SWITCH: {
4929                         switch_statement_t const *const switchs = &stmt->switchs;
4930                         expression_t       const *const expr    = switchs->expression;
4931
4932                         if (!expression_returns(expr))
4933                                 return;
4934
4935                         if (is_constant_expression(expr) == EXPR_CLASS_CONSTANT) {
4936                                 long                    const val      = fold_constant_to_int(expr);
4937                                 case_label_statement_t *      defaults = NULL;
4938                                 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
4939                                         if (i->expression == NULL) {
4940                                                 defaults = i;
4941                                                 continue;
4942                                         }
4943
4944                                         if (i->first_case <= val && val <= i->last_case) {
4945                                                 check_reachable((statement_t*)i);
4946                                                 return;
4947                                         }
4948                                 }
4949
4950                                 if (defaults != NULL) {
4951                                         check_reachable((statement_t*)defaults);
4952                                         return;
4953                                 }
4954                         } else {
4955                                 bool has_default = false;
4956                                 for (case_label_statement_t *i = switchs->first_case; i != NULL; i = i->next) {
4957                                         if (i->expression == NULL)
4958                                                 has_default = true;
4959
4960                                         check_reachable((statement_t*)i);
4961                                 }
4962
4963                                 if (has_default)
4964                                         return;
4965                         }
4966
4967                         next = stmt->base.next;
4968                         break;
4969                 }
4970
4971                 case STATEMENT_EXPRESSION: {
4972                         /* Check for noreturn function call */
4973                         expression_t const *const expr = stmt->expression.expression;
4974                         if (!expression_returns(expr))
4975                                 return;
4976
4977                         next = stmt->base.next;
4978                         break;
4979                 }
4980
4981                 case STATEMENT_CONTINUE:
4982                         for (statement_t *parent = stmt;;) {
4983                                 parent = parent->base.parent;
4984                                 if (parent == NULL) /* continue not within loop */
4985                                         return;
4986
4987                                 next = parent;
4988                                 switch (parent->kind) {
4989                                         case STATEMENT_WHILE:    goto continue_while;
4990                                         case STATEMENT_DO_WHILE: goto continue_do_while;
4991                                         case STATEMENT_FOR:      goto continue_for;
4992
4993                                         default: break;
4994                                 }
4995                         }
4996
4997                 case STATEMENT_BREAK:
4998                         for (statement_t *parent = stmt;;) {
4999                                 parent = parent->base.parent;
5000                                 if (parent == NULL) /* break not within loop/switch */
5001                                         return;
5002
5003                                 switch (parent->kind) {
5004                                         case STATEMENT_SWITCH:
5005                                         case STATEMENT_WHILE:
5006                                         case STATEMENT_DO_WHILE:
5007                                         case STATEMENT_FOR:
5008                                                 last = parent;
5009                                                 next = parent->base.next;
5010                                                 goto found_break_parent;
5011
5012                                         default: break;
5013                                 }
5014                         }
5015 found_break_parent:
5016                         break;
5017
5018                 case STATEMENT_GOTO:
5019                         if (stmt->gotos.expression) {
5020                                 if (!expression_returns(stmt->gotos.expression))
5021                                         return;
5022
5023                                 statement_t *parent = stmt->base.parent;
5024                                 if (parent == NULL) /* top level goto */
5025                                         return;
5026                                 next = parent;
5027                         } else {
5028                                 next = stmt->gotos.label->statement;
5029                                 if (next == NULL) /* missing label */
5030                                         return;
5031                         }
5032                         break;
5033
5034                 case STATEMENT_LABEL:
5035                         next = stmt->label.statement;
5036                         break;
5037
5038                 case STATEMENT_CASE_LABEL:
5039                         next = stmt->case_label.statement;
5040                         break;
5041
5042                 case STATEMENT_WHILE: {
5043                         while_statement_t const *const whiles = &stmt->whiles;
5044                         expression_t      const *const cond   = whiles->condition;
5045
5046                         if (!expression_returns(cond))
5047                                 return;
5048
5049                         int const val = determine_truth(cond);
5050
5051                         if (val >= 0)
5052                                 check_reachable(whiles->body);
5053
5054                         if (val > 0)
5055                                 return;
5056
5057                         next = stmt->base.next;
5058                         break;
5059                 }
5060
5061                 case STATEMENT_DO_WHILE:
5062                         next = stmt->do_while.body;
5063                         break;
5064
5065                 case STATEMENT_FOR: {
5066                         for_statement_t *const fors = &stmt->fors;
5067
5068                         if (fors->condition_reachable)
5069                                 return;
5070                         fors->condition_reachable = true;
5071
5072                         expression_t const *const cond = fors->condition;
5073
5074                         int val;
5075                         if (cond == NULL) {
5076                                 val = 1;
5077                         } else if (expression_returns(cond)) {
5078                                 val = determine_truth(cond);
5079                         } else {
5080                                 return;
5081                         }
5082
5083                         if (val >= 0)
5084                                 check_reachable(fors->body);
5085
5086                         if (val > 0)
5087                                 return;
5088
5089                         next = stmt->base.next;
5090                         break;
5091                 }
5092
5093                 case STATEMENT_MS_TRY: {
5094                         ms_try_statement_t const *const ms_try = &stmt->ms_try;
5095                         check_reachable(ms_try->try_statement);
5096                         next = ms_try->final_statement;
5097                         break;
5098                 }
5099
5100                 case STATEMENT_LEAVE: {
5101                         statement_t *parent = stmt;
5102                         for (;;) {
5103                                 parent = parent->base.parent;
5104                                 if (parent == NULL) /* __leave not within __try */
5105                                         return;
5106
5107                                 if (parent->kind == STATEMENT_MS_TRY) {
5108                                         last = parent;
5109                                         next = parent->ms_try.final_statement;
5110                                         break;
5111                                 }
5112                         }
5113                         break;
5114                 }
5115
5116                 default:
5117                         panic("invalid statement kind");
5118         }
5119
5120         while (next == NULL) {
5121                 next = last->base.parent;
5122                 if (next == NULL) {
5123                         noreturn_candidate = false;
5124
5125                         type_t *const type = skip_typeref(current_function->base.type);
5126                         assert(is_type_function(type));
5127                         type_t *const ret  = skip_typeref(type->function.return_type);
5128                         if (!is_type_atomic(ret, ATOMIC_TYPE_VOID) &&
5129                             is_type_valid(ret)                     &&
5130                             !is_sym_main(current_function->base.base.symbol)) {
5131                                 source_position_t const *const pos = &stmt->base.source_position;
5132                                 warningf(WARN_RETURN_TYPE, pos, "control reaches end of non-void function");
5133                         }
5134                         return;
5135                 }
5136
5137                 switch (next->kind) {
5138                         case STATEMENT_ERROR:
5139                         case STATEMENT_EMPTY:
5140                         case STATEMENT_DECLARATION:
5141                         case STATEMENT_EXPRESSION:
5142                         case STATEMENT_ASM:
5143                         case STATEMENT_RETURN:
5144                         case STATEMENT_CONTINUE:
5145                         case STATEMENT_BREAK:
5146                         case STATEMENT_GOTO:
5147                         case STATEMENT_LEAVE:
5148                                 panic("invalid control flow in function");
5149
5150                         case STATEMENT_COMPOUND:
5151                                 if (next->compound.stmt_expr) {
5152                                         reaches_end = true;
5153                                         return;
5154                                 }
5155                                 /* FALLTHROUGH */
5156                         case STATEMENT_IF:
5157                         case STATEMENT_SWITCH:
5158                         case STATEMENT_LABEL:
5159                         case STATEMENT_CASE_LABEL:
5160                                 last = next;
5161                                 next = next->base.next;
5162                                 break;
5163
5164                         case STATEMENT_WHILE: {
5165 continue_while:
5166                                 if (next->base.reachable)
5167                                         return;
5168                                 next->base.reachable = true;
5169
5170                                 while_statement_t const *const whiles = &next->whiles;
5171                                 expression_t      const *const cond   = whiles->condition;
5172
5173                                 if (!expression_returns(cond))
5174                                         return;
5175
5176                                 int const val = determine_truth(cond);
5177
5178                                 if (val >= 0)
5179                                         check_reachable(whiles->body);
5180
5181                                 if (val > 0)
5182                                         return;
5183
5184                                 last = next;
5185                                 next = next->base.next;
5186                                 break;
5187                         }
5188
5189                         case STATEMENT_DO_WHILE: {
5190 continue_do_while:
5191                                 if (next->base.reachable)
5192                                         return;
5193                                 next->base.reachable = true;
5194
5195                                 do_while_statement_t const *const dw   = &next->do_while;
5196                                 expression_t         const *const cond = dw->condition;
5197
5198                                 if (!expression_returns(cond))
5199                                         return;
5200
5201                                 int const val = determine_truth(cond);
5202
5203                                 if (val >= 0)
5204                                         check_reachable(dw->body);
5205
5206                                 if (val > 0)
5207                                         return;
5208
5209                                 last = next;
5210                                 next = next->base.next;
5211                                 break;
5212                         }
5213
5214                         case STATEMENT_FOR: {
5215 continue_for:;
5216                                 for_statement_t *const fors = &next->fors;
5217
5218                                 fors->step_reachable = true;
5219
5220                                 if (fors->condition_reachable)
5221                                         return;
5222                                 fors->condition_reachable = true;
5223
5224                                 expression_t const *const cond = fors->condition;
5225
5226                                 int val;
5227                                 if (cond == NULL) {
5228                                         val = 1;
5229                                 } else if (expression_returns(cond)) {
5230                                         val = determine_truth(cond);
5231                                 } else {
5232                                         return;
5233                                 }
5234
5235                                 if (val >= 0)
5236                                         check_reachable(fors->body);
5237
5238                                 if (val > 0)
5239                                         return;
5240
5241                                 last = next;
5242                                 next = next->base.next;
5243                                 break;
5244                         }
5245
5246                         case STATEMENT_MS_TRY:
5247                                 last = next;
5248                                 next = next->ms_try.final_statement;
5249                                 break;
5250                 }
5251         }
5252
5253         check_reachable(next);
5254 }
5255
5256 static void check_unreachable(statement_t* const stmt, void *const env)
5257 {
5258         (void)env;
5259
5260         switch (stmt->kind) {
5261                 case STATEMENT_DO_WHILE:
5262                         if (!stmt->base.reachable) {
5263                                 expression_t const *const cond = stmt->do_while.condition;
5264                                 if (determine_truth(cond) >= 0) {
5265                                         source_position_t const *const pos = &cond->base.source_position;
5266                                         warningf(WARN_UNREACHABLE_CODE, pos, "condition of do-while-loop is unreachable");
5267                                 }
5268                         }
5269                         return;
5270
5271                 case STATEMENT_FOR: {
5272                         for_statement_t const* const fors = &stmt->fors;
5273
5274                         // if init and step are unreachable, cond is unreachable, too
5275                         if (!stmt->base.reachable && !fors->step_reachable) {
5276                                 goto warn_unreachable;
5277                         } else {
5278                                 if (!stmt->base.reachable && fors->initialisation != NULL) {
5279                                         source_position_t const *const pos = &fors->initialisation->base.source_position;
5280                                         warningf(WARN_UNREACHABLE_CODE, pos, "initialisation of for-statement is unreachable");
5281                                 }
5282
5283                                 if (!fors->condition_reachable && fors->condition != NULL) {
5284                                         source_position_t const *const pos = &fors->condition->base.source_position;
5285                                         warningf(WARN_UNREACHABLE_CODE, pos, "condition of for-statement is unreachable");
5286                                 }
5287
5288                                 if (!fors->step_reachable && fors->step != NULL) {
5289                                         source_position_t const *const pos = &fors->step->base.source_position;
5290                                         warningf(WARN_UNREACHABLE_CODE, pos, "step of for-statement is unreachable");
5291                                 }
5292                         }
5293                         return;
5294                 }
5295
5296                 case STATEMENT_COMPOUND:
5297                         if (stmt->compound.statements != NULL)
5298                                 return;
5299                         goto warn_unreachable;
5300
5301                 case STATEMENT_DECLARATION: {
5302                         /* Only warn if there is at least one declarator with an initializer.
5303                          * This typically occurs in switch statements. */
5304                         declaration_statement_t const *const decl = &stmt->declaration;
5305                         entity_t                const *      ent  = decl->declarations_begin;
5306                         entity_t                const *const last = decl->declarations_end;
5307                         if (ent != NULL) {
5308                                 for (;; ent = ent->base.next) {
5309                                         if (ent->kind                 == ENTITY_VARIABLE &&
5310                                                         ent->variable.initializer != NULL) {
5311                                                 goto warn_unreachable;
5312                                         }
5313                                         if (ent == last)
5314                                                 return;
5315                                 }
5316                         }
5317                 }
5318
5319                 default:
5320 warn_unreachable:
5321                         if (!stmt->base.reachable) {
5322                                 source_position_t const *const pos = &stmt->base.source_position;
5323                                 warningf(WARN_UNREACHABLE_CODE, pos, "statement is unreachable");
5324                         }
5325                         return;
5326         }
5327 }
5328
5329 static void parse_external_declaration(void)
5330 {
5331         /* function-definitions and declarations both start with declaration
5332          * specifiers */
5333         add_anchor_token(';');
5334         declaration_specifiers_t specifiers;
5335         parse_declaration_specifiers(&specifiers);
5336         rem_anchor_token(';');
5337
5338         /* must be a declaration */
5339         if (token.kind == ';') {
5340                 parse_anonymous_declaration_rest(&specifiers);
5341                 return;
5342         }
5343
5344         add_anchor_token(',');
5345         add_anchor_token('=');
5346         add_anchor_token(';');
5347         add_anchor_token('{');
5348
5349         /* declarator is common to both function-definitions and declarations */
5350         entity_t *ndeclaration = parse_declarator(&specifiers, DECL_FLAGS_NONE);
5351
5352         rem_anchor_token('{');
5353         rem_anchor_token(';');
5354         rem_anchor_token('=');
5355         rem_anchor_token(',');
5356
5357         /* must be a declaration */
5358         switch (token.kind) {
5359                 case ',':
5360                 case ';':
5361                 case '=':
5362                         parse_declaration_rest(ndeclaration, &specifiers, record_entity,
5363                                         DECL_FLAGS_NONE);
5364                         return;
5365         }
5366
5367         /* must be a function definition */
5368         parse_kr_declaration_list(ndeclaration);
5369
5370         if (token.kind != '{') {
5371                 parse_error_expected("while parsing function definition", '{', NULL);
5372                 eat_until_matching_token(';');
5373                 return;
5374         }
5375
5376         assert(is_declaration(ndeclaration));
5377         type_t *const orig_type = ndeclaration->declaration.type;
5378         type_t *      type      = skip_typeref(orig_type);
5379
5380         if (!is_type_function(type)) {
5381                 if (is_type_valid(type)) {
5382                         errorf(HERE, "declarator '%#N' has a body but is not a function type", ndeclaration);
5383                 }
5384                 eat_block();
5385                 return;
5386         }
5387
5388         source_position_t const *const pos = &ndeclaration->base.source_position;
5389         if (is_typeref(orig_type)) {
5390                 /* §6.9.1:2 */
5391                 errorf(pos, "type of function definition '%#N' is a typedef", ndeclaration);
5392         }
5393
5394         if (is_type_compound(skip_typeref(type->function.return_type))) {
5395                 warningf(WARN_AGGREGATE_RETURN, pos, "'%N' returns an aggregate", ndeclaration);
5396         }
5397         if (type->function.unspecified_parameters) {
5398                 warningf(WARN_OLD_STYLE_DEFINITION, pos, "old-style definition of '%N'", ndeclaration);
5399         } else {
5400                 warningf(WARN_TRADITIONAL, pos, "traditional C rejects ISO C style definition of '%N'", ndeclaration);
5401         }
5402
5403         /* §6.7.5.3:14 a function definition with () means no
5404          * parameters (and not unspecified parameters) */
5405         if (type->function.unspecified_parameters &&
5406                         type->function.parameters == NULL) {
5407                 type_t *copy                          = duplicate_type(type);
5408                 copy->function.unspecified_parameters = false;
5409                 type                                  = identify_new_type(copy);
5410
5411                 ndeclaration->declaration.type = type;
5412         }
5413
5414         entity_t *const entity = record_entity(ndeclaration, true);
5415         assert(entity->kind == ENTITY_FUNCTION);
5416         assert(ndeclaration->kind == ENTITY_FUNCTION);
5417
5418         function_t *const function = &entity->function;
5419         if (ndeclaration != entity) {
5420                 function->parameters = ndeclaration->function.parameters;
5421         }
5422         assert(is_declaration(entity));
5423         type = skip_typeref(entity->declaration.type);
5424
5425         PUSH_SCOPE(&function->parameters);
5426
5427         entity_t *parameter = function->parameters.entities;
5428         for (; parameter != NULL; parameter = parameter->base.next) {
5429                 if (parameter->base.parent_scope == &ndeclaration->function.parameters) {
5430                         parameter->base.parent_scope = current_scope;
5431                 }
5432                 assert(parameter->base.parent_scope == NULL
5433                                 || parameter->base.parent_scope == current_scope);
5434                 parameter->base.parent_scope = current_scope;
5435                 if (parameter->base.symbol == NULL) {
5436                         errorf(&parameter->base.source_position, "parameter name omitted");
5437                         continue;
5438                 }
5439                 environment_push(parameter);
5440         }
5441
5442         if (function->statement != NULL) {
5443                 parser_error_multiple_definition(entity, HERE);
5444                 eat_block();
5445         } else {
5446                 /* parse function body */
5447                 int         label_stack_top      = label_top();
5448                 function_t *old_current_function = current_function;
5449                 entity_t   *old_current_entity   = current_entity;
5450                 current_function                 = function;
5451                 current_entity                   = entity;
5452                 PUSH_PARENT(NULL);
5453
5454                 goto_first   = NULL;
5455                 goto_anchor  = &goto_first;
5456                 label_first  = NULL;
5457                 label_anchor = &label_first;
5458
5459                 statement_t *const body = parse_compound_statement(false);
5460                 function->statement = body;
5461                 first_err = true;
5462                 check_labels();
5463                 check_declarations();
5464                 if (is_warn_on(WARN_RETURN_TYPE)      ||
5465                     is_warn_on(WARN_UNREACHABLE_CODE) ||
5466                     (is_warn_on(WARN_MISSING_NORETURN) && !(function->base.modifiers & DM_NORETURN))) {
5467                         noreturn_candidate = true;
5468                         check_reachable(body);
5469                         if (is_warn_on(WARN_UNREACHABLE_CODE))
5470                                 walk_statements(body, check_unreachable, NULL);
5471                         if (noreturn_candidate &&
5472                             !(function->base.modifiers & DM_NORETURN)) {
5473                                 source_position_t const *const pos = &body->base.source_position;
5474                                 warningf(WARN_MISSING_NORETURN, pos, "function '%#N' is candidate for attribute 'noreturn'", entity);
5475                         }
5476                 }
5477
5478                 POP_PARENT();
5479                 assert(current_function == function);
5480                 assert(current_entity   == entity);
5481                 current_entity   = old_current_entity;
5482                 current_function = old_current_function;
5483                 label_pop_to(label_stack_top);
5484         }
5485
5486         POP_SCOPE();
5487 }
5488
5489 static entity_t *find_compound_entry(compound_t *compound, symbol_t *symbol)
5490 {
5491         entity_t *iter = compound->members.entities;
5492         for (; iter != NULL; iter = iter->base.next) {
5493                 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5494                         continue;
5495
5496                 if (iter->base.symbol == symbol) {
5497                         return iter;
5498                 } else if (iter->base.symbol == NULL) {
5499                         /* search in anonymous structs and unions */
5500                         type_t *type = skip_typeref(iter->declaration.type);
5501                         if (is_type_compound(type)) {
5502                                 if (find_compound_entry(type->compound.compound, symbol)
5503                                                 != NULL)
5504                                         return iter;
5505                         }
5506                         continue;
5507                 }
5508         }
5509
5510         return NULL;
5511 }
5512
5513 static void check_deprecated(const source_position_t *source_position,
5514                              const entity_t *entity)
5515 {
5516         if (!is_declaration(entity))
5517                 return;
5518         if ((entity->declaration.modifiers & DM_DEPRECATED) == 0)
5519                 return;
5520
5521         source_position_t const *const epos = &entity->base.source_position;
5522         char              const *const msg  = get_deprecated_string(entity->declaration.attributes);
5523         if (msg != NULL) {
5524                 warningf(WARN_DEPRECATED_DECLARATIONS, source_position, "'%N' is deprecated (declared %P): \"%s\"", entity, epos, msg);
5525         } else {
5526                 warningf(WARN_DEPRECATED_DECLARATIONS, source_position, "'%N' is deprecated (declared %P)", entity, epos);
5527         }
5528 }
5529
5530
5531 static expression_t *create_select(const source_position_t *pos,
5532                                    expression_t *addr,
5533                                    type_qualifiers_t qualifiers,
5534                                                                    entity_t *entry)
5535 {
5536         assert(entry->kind == ENTITY_COMPOUND_MEMBER);
5537
5538         check_deprecated(pos, entry);
5539
5540         expression_t *select          = allocate_expression_zero(EXPR_SELECT);
5541         select->select.compound       = addr;
5542         select->select.compound_entry = entry;
5543
5544         type_t *entry_type = entry->declaration.type;
5545         type_t *res_type   = get_qualified_type(entry_type, qualifiers);
5546
5547         /* bitfields need special treatment */
5548         if (entry->compound_member.bitfield) {
5549                 unsigned bit_size = entry->compound_member.bit_size;
5550                 /* if fewer bits than an int, convert to int (see §6.3.1.1) */
5551                 if (bit_size < get_atomic_type_size(ATOMIC_TYPE_INT) * BITS_PER_BYTE) {
5552                         res_type = type_int;
5553                 }
5554         }
5555
5556         /* we always do the auto-type conversions; the & and sizeof parser contains
5557          * code to revert this! */
5558         select->base.type = automatic_type_conversion(res_type);
5559
5560
5561         return select;
5562 }
5563
5564 /**
5565  * Find entry with symbol in compound. Search anonymous structs and unions and
5566  * creates implicit select expressions for them.
5567  * Returns the adress for the innermost compound.
5568  */
5569 static expression_t *find_create_select(const source_position_t *pos,
5570                                         expression_t *addr,
5571                                         type_qualifiers_t qualifiers,
5572                                         compound_t *compound, symbol_t *symbol)
5573 {
5574         entity_t *iter = compound->members.entities;
5575         for (; iter != NULL; iter = iter->base.next) {
5576                 if (iter->kind != ENTITY_COMPOUND_MEMBER)
5577                         continue;
5578
5579                 symbol_t *iter_symbol = iter->base.symbol;
5580                 if (iter_symbol == NULL) {
5581                         type_t *type = iter->declaration.type;
5582                         if (type->kind != TYPE_COMPOUND_STRUCT
5583                                         && type->kind != TYPE_COMPOUND_UNION)
5584                                 continue;
5585
5586                         compound_t *sub_compound = type->compound.compound;
5587
5588                         if (find_compound_entry(sub_compound, symbol) == NULL)
5589                                 continue;
5590
5591                         expression_t *sub_addr = create_select(pos, addr, qualifiers, iter);
5592                         sub_addr->base.source_position = *pos;
5593                         sub_addr->base.implicit        = true;
5594                         return find_create_select(pos, sub_addr, qualifiers, sub_compound,
5595                                                   symbol);
5596                 }
5597
5598                 if (iter_symbol == symbol) {
5599                         return create_select(pos, addr, qualifiers, iter);
5600                 }
5601         }
5602
5603         return NULL;
5604 }
5605
5606 static void parse_bitfield_member(entity_t *entity)
5607 {
5608         eat(':');
5609
5610         expression_t *size = parse_constant_expression();
5611         long          size_long;
5612
5613         assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5614         type_t *type = entity->declaration.type;
5615         if (!is_type_integer(skip_typeref(type))) {
5616                 errorf(HERE, "bitfield base type '%T' is not an integer type",
5617                            type);
5618         }
5619
5620         if (is_constant_expression(size) != EXPR_CLASS_CONSTANT) {
5621                 /* error already reported by parse_constant_expression */
5622                 size_long = get_type_size(type) * 8;
5623         } else {
5624                 size_long = fold_constant_to_int(size);
5625
5626                 const symbol_t *symbol = entity->base.symbol;
5627                 const symbol_t *user_symbol
5628                         = symbol == NULL ? sym_anonymous : symbol;
5629                 unsigned bit_size = get_type_size(type) * 8;
5630                 if (size_long < 0) {
5631                         errorf(HERE, "negative width in bit-field '%Y'", user_symbol);
5632                 } else if (size_long == 0 && symbol != NULL) {
5633                         errorf(HERE, "zero width for bit-field '%Y'", user_symbol);
5634                 } else if (bit_size > 0 && (unsigned)size_long > bit_size) {
5635                         errorf(HERE, "width of bitfield '%Y' exceeds its type",
5636                                    user_symbol);
5637                 } else {
5638                         /* hope that people don't invent crazy types with more bits
5639                          * than our struct can hold */
5640                         assert(size_long <
5641                                    (1 << sizeof(entity->compound_member.bit_size)*8));
5642                 }
5643         }
5644
5645         entity->compound_member.bitfield = true;
5646         entity->compound_member.bit_size = (unsigned char)size_long;
5647 }
5648
5649 static void parse_compound_declarators(compound_t *compound,
5650                 const declaration_specifiers_t *specifiers)
5651 {
5652         do {
5653                 entity_t *entity;
5654
5655                 if (token.kind == ':') {
5656                         /* anonymous bitfield */
5657                         type_t *type = specifiers->type;
5658                         entity_t *entity = allocate_entity_zero(ENTITY_COMPOUND_MEMBER,
5659                                                                 NAMESPACE_NORMAL, NULL);
5660                         entity->base.source_position               = *HERE;
5661                         entity->declaration.declared_storage_class = STORAGE_CLASS_NONE;
5662                         entity->declaration.storage_class          = STORAGE_CLASS_NONE;
5663                         entity->declaration.type                   = type;
5664
5665                         parse_bitfield_member(entity);
5666
5667                         attribute_t  *attributes = parse_attributes(NULL);
5668                         attribute_t **anchor     = &attributes;
5669                         while (*anchor != NULL)
5670                                 anchor = &(*anchor)->next;
5671                         *anchor = specifiers->attributes;
5672                         if (attributes != NULL) {
5673                                 handle_entity_attributes(attributes, entity);
5674                         }
5675                         entity->declaration.attributes = attributes;
5676
5677                         append_entity(&compound->members, entity);
5678                 } else {
5679                         entity = parse_declarator(specifiers,
5680                                         DECL_MAY_BE_ABSTRACT | DECL_CREATE_COMPOUND_MEMBER);
5681                         source_position_t const *const pos = &entity->base.source_position;
5682                         if (entity->kind == ENTITY_TYPEDEF) {
5683                                 errorf(pos, "typedef not allowed as compound member");
5684                         } else {
5685                                 assert(entity->kind == ENTITY_COMPOUND_MEMBER);
5686
5687                                 /* make sure we don't define a symbol multiple times */
5688                                 symbol_t *symbol = entity->base.symbol;
5689                                 if (symbol != NULL) {
5690                                         entity_t *prev = find_compound_entry(compound, symbol);
5691                                         if (prev != NULL) {
5692                                                 source_position_t const *const ppos = &prev->base.source_position;
5693                                                 errorf(pos, "multiple declarations of symbol '%Y' (declared %P)", symbol, ppos);
5694                                         }
5695                                 }
5696
5697                                 if (token.kind == ':') {
5698                                         parse_bitfield_member(entity);
5699
5700                                         attribute_t *attributes = parse_attributes(NULL);
5701                                         handle_entity_attributes(attributes, entity);
5702                                 } else {
5703                                         type_t *orig_type = entity->declaration.type;
5704                                         type_t *type      = skip_typeref(orig_type);
5705                                         if (is_type_function(type)) {
5706                                                 errorf(pos, "'%N' must not have function type '%T'", entity, orig_type);
5707                                         } else if (is_type_incomplete(type)) {
5708                                                 /* §6.7.2.1:16 flexible array member */
5709                                                 if (!is_type_array(type)       ||
5710                                                                 token.kind          != ';' ||
5711                                                                 look_ahead(1)->kind != '}') {
5712                                                         errorf(pos, "'%N' has incomplete type '%T'", entity, orig_type);
5713                                                 }
5714                                         }
5715                                 }
5716
5717                                 append_entity(&compound->members, entity);
5718                         }
5719                 }
5720         } while (next_if(','));
5721         expect(';', end_error);
5722
5723 end_error:
5724         anonymous_entity = NULL;
5725 }
5726
5727 static void parse_compound_type_entries(compound_t *compound)
5728 {
5729         eat('{');
5730         add_anchor_token('}');
5731
5732         for (;;) {
5733                 switch (token.kind) {
5734                         DECLARATION_START
5735                         case T___extension__:
5736                         case T_IDENTIFIER: {
5737                                 PUSH_EXTENSION();
5738                                 declaration_specifiers_t specifiers;
5739                                 parse_declaration_specifiers(&specifiers);
5740                                 parse_compound_declarators(compound, &specifiers);
5741                                 POP_EXTENSION();
5742                                 break;
5743                         }
5744
5745                         default:
5746                                 rem_anchor_token('}');
5747                                 expect('}', end_error);
5748 end_error:
5749                                 /* §6.7.2.1:7 */
5750                                 compound->complete = true;
5751                                 return;
5752                 }
5753         }
5754 }
5755
5756 static type_t *parse_typename(void)
5757 {
5758         declaration_specifiers_t specifiers;
5759         parse_declaration_specifiers(&specifiers);
5760         if (specifiers.storage_class != STORAGE_CLASS_NONE
5761                         || specifiers.thread_local) {
5762                 /* TODO: improve error message, user does probably not know what a
5763                  * storage class is...
5764                  */
5765                 errorf(&specifiers.source_position, "typename must not have a storage class");
5766         }
5767
5768         type_t *result = parse_abstract_declarator(specifiers.type);
5769
5770         return result;
5771 }
5772
5773
5774
5775
5776 typedef expression_t* (*parse_expression_function)(void);
5777 typedef expression_t* (*parse_expression_infix_function)(expression_t *left);
5778
5779 typedef struct expression_parser_function_t expression_parser_function_t;
5780 struct expression_parser_function_t {
5781         parse_expression_function        parser;
5782         precedence_t                     infix_precedence;
5783         parse_expression_infix_function  infix_parser;
5784 };
5785
5786 static expression_parser_function_t expression_parsers[T_LAST_TOKEN];
5787
5788 /**
5789  * Prints an error message if an expression was expected but not read
5790  */
5791 static expression_t *expected_expression_error(void)
5792 {
5793         /* skip the error message if the error token was read */
5794         if (token.kind != T_ERROR) {
5795                 errorf(HERE, "expected expression, got token %K", &token);
5796         }
5797         next_token();
5798
5799         return create_error_expression();
5800 }
5801
5802 static type_t *get_string_type(void)
5803 {
5804         return is_warn_on(WARN_WRITE_STRINGS) ? type_const_char_ptr : type_char_ptr;
5805 }
5806
5807 static type_t *get_wide_string_type(void)
5808 {
5809         return is_warn_on(WARN_WRITE_STRINGS) ? type_const_wchar_t_ptr : type_wchar_t_ptr;
5810 }
5811
5812 /**
5813  * Parse a string constant.
5814  */
5815 static expression_t *parse_string_literal(void)
5816 {
5817         source_position_t begin   = token.base.source_position;
5818         string_t          res     = token.string.string;
5819         bool              is_wide = (token.kind == T_WIDE_STRING_LITERAL);
5820
5821         next_token();
5822         while (token.kind == T_STRING_LITERAL
5823                         || token.kind == T_WIDE_STRING_LITERAL) {
5824                 warn_string_concat(&token.base.source_position);
5825                 res = concat_strings(&res, &token.string.string);
5826                 next_token();
5827                 is_wide |= token.kind == T_WIDE_STRING_LITERAL;
5828         }
5829
5830         expression_t *literal;
5831         if (is_wide) {
5832                 literal = allocate_expression_zero(EXPR_WIDE_STRING_LITERAL);
5833                 literal->base.type = get_wide_string_type();
5834         } else {
5835                 literal = allocate_expression_zero(EXPR_STRING_LITERAL);
5836                 literal->base.type = get_string_type();
5837         }
5838         literal->base.source_position = begin;
5839         literal->literal.value        = res;
5840
5841         return literal;
5842 }
5843
5844 /**
5845  * Parse a boolean constant.
5846  */
5847 static expression_t *parse_boolean_literal(bool value)
5848 {
5849         expression_t *literal = allocate_expression_zero(EXPR_LITERAL_BOOLEAN);
5850         literal->base.type           = type_bool;
5851         literal->literal.value.begin = value ? "true" : "false";
5852         literal->literal.value.size  = value ? 4 : 5;
5853
5854         next_token();
5855         return literal;
5856 }
5857
5858 static void warn_traditional_suffix(void)
5859 {
5860         warningf(WARN_TRADITIONAL, HERE, "traditional C rejects the '%S' suffix",
5861                  &token.number.suffix);
5862 }
5863
5864 static void check_integer_suffix(void)
5865 {
5866         const string_t *suffix = &token.number.suffix;
5867         if (suffix->size == 0)
5868                 return;
5869
5870         bool not_traditional = false;
5871         const char *c = suffix->begin;
5872         if (*c == 'l' || *c == 'L') {
5873                 ++c;
5874                 if (*c == *(c-1)) {
5875                         not_traditional = true;
5876                         ++c;
5877                         if (*c == 'u' || *c == 'U') {
5878                                 ++c;
5879                         }
5880                 } else if (*c == 'u' || *c == 'U') {
5881                         not_traditional = true;
5882                         ++c;
5883                 }
5884         } else if (*c == 'u' || *c == 'U') {
5885                 not_traditional = true;
5886                 ++c;
5887                 if (*c == 'l' || *c == 'L') {
5888                         ++c;
5889                         if (*c == *(c-1)) {
5890                                 ++c;
5891                         }
5892                 }
5893         }
5894         if (*c != '\0') {
5895                 errorf(&token.base.source_position,
5896                        "invalid suffix '%S' on integer constant", suffix);
5897         } else if (not_traditional) {
5898                 warn_traditional_suffix();
5899         }
5900 }
5901
5902 static type_t *check_floatingpoint_suffix(void)
5903 {
5904         const string_t *suffix = &token.number.suffix;
5905         type_t         *type   = type_double;
5906         if (suffix->size == 0)
5907                 return type;
5908
5909         bool not_traditional = false;
5910         const char *c = suffix->begin;
5911         if (*c == 'f' || *c == 'F') {
5912                 ++c;
5913                 type = type_float;
5914         } else if (*c == 'l' || *c == 'L') {
5915                 ++c;
5916                 type = type_long_double;
5917         }
5918         if (*c != '\0') {
5919                 errorf(&token.base.source_position,
5920                        "invalid suffix '%S' on floatingpoint constant", suffix);
5921         } else if (not_traditional) {
5922                 warn_traditional_suffix();
5923         }
5924
5925         return type;
5926 }
5927
5928 /**
5929  * Parse an integer constant.
5930  */
5931 static expression_t *parse_number_literal(void)
5932 {
5933         expression_kind_t  kind;
5934         type_t            *type;
5935
5936         switch (token.kind) {
5937         case T_INTEGER:
5938                 kind = EXPR_LITERAL_INTEGER;
5939                 check_integer_suffix();
5940                 type = type_int;
5941                 break;
5942         case T_INTEGER_OCTAL:
5943                 kind = EXPR_LITERAL_INTEGER_OCTAL;
5944                 check_integer_suffix();
5945                 type = type_int;
5946                 break;
5947         case T_INTEGER_HEXADECIMAL:
5948                 kind = EXPR_LITERAL_INTEGER_HEXADECIMAL;
5949                 check_integer_suffix();
5950                 type = type_int;
5951                 break;
5952         case T_FLOATINGPOINT:
5953                 kind = EXPR_LITERAL_FLOATINGPOINT;
5954                 type = check_floatingpoint_suffix();
5955                 break;
5956         case T_FLOATINGPOINT_HEXADECIMAL:
5957                 kind = EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL;
5958                 type = check_floatingpoint_suffix();
5959                 break;
5960         default:
5961                 panic("unexpected token type in parse_number_literal");
5962         }
5963
5964         expression_t *literal = allocate_expression_zero(kind);
5965         literal->base.type      = type;
5966         literal->literal.value  = token.number.number;
5967         literal->literal.suffix = token.number.suffix;
5968         next_token();
5969
5970         /* integer type depends on the size of the number and the size
5971          * representable by the types. The backend/codegeneration has to determine
5972          * that
5973          */
5974         determine_literal_type(&literal->literal);
5975         return literal;
5976 }
5977
5978 /**
5979  * Parse a character constant.
5980  */
5981 static expression_t *parse_character_constant(void)
5982 {
5983         expression_t *literal = allocate_expression_zero(EXPR_LITERAL_CHARACTER);
5984         literal->base.type     = c_mode & _CXX ? type_char : type_int;
5985         literal->literal.value = token.string.string;
5986
5987         size_t len = literal->literal.value.size;
5988         if (len > 1) {
5989                 if (!GNU_MODE && !(c_mode & _C99)) {
5990                         errorf(HERE, "more than 1 character in character constant");
5991                 } else {
5992                         literal->base.type = type_int;
5993                         warningf(WARN_MULTICHAR, HERE, "multi-character character constant");
5994                 }
5995         }
5996
5997         next_token();
5998         return literal;
5999 }
6000
6001 /**
6002  * Parse a wide character constant.
6003  */
6004 static expression_t *parse_wide_character_constant(void)
6005 {
6006         expression_t *literal = allocate_expression_zero(EXPR_LITERAL_WIDE_CHARACTER);
6007         literal->base.type     = type_int;
6008         literal->literal.value = token.string.string;
6009
6010         size_t len = wstrlen(&literal->literal.value);
6011         if (len > 1) {
6012                 warningf(WARN_MULTICHAR, HERE, "multi-character character constant");
6013         }
6014
6015         next_token();
6016         return literal;
6017 }
6018
6019 static entity_t *create_implicit_function(symbol_t *symbol,
6020                 const source_position_t *source_position)
6021 {
6022         type_t *ntype                          = allocate_type_zero(TYPE_FUNCTION);
6023         ntype->function.return_type            = type_int;
6024         ntype->function.unspecified_parameters = true;
6025         ntype->function.linkage                = LINKAGE_C;
6026         type_t *type                           = identify_new_type(ntype);
6027
6028         entity_t *const entity = allocate_entity_zero(ENTITY_FUNCTION, NAMESPACE_NORMAL, symbol);
6029         entity->declaration.storage_class          = STORAGE_CLASS_EXTERN;
6030         entity->declaration.declared_storage_class = STORAGE_CLASS_EXTERN;
6031         entity->declaration.type                   = type;
6032         entity->declaration.implicit               = true;
6033         entity->base.source_position               = *source_position;
6034
6035         if (current_scope != NULL)
6036                 record_entity(entity, false);
6037
6038         return entity;
6039 }
6040
6041 /**
6042  * Performs automatic type cast as described in §6.3.2.1.
6043  *
6044  * @param orig_type  the original type
6045  */
6046 static type_t *automatic_type_conversion(type_t *orig_type)
6047 {
6048         type_t *type = skip_typeref(orig_type);
6049         if (is_type_array(type)) {
6050                 array_type_t *array_type   = &type->array;
6051                 type_t       *element_type = array_type->element_type;
6052                 unsigned      qualifiers   = array_type->base.qualifiers;
6053
6054                 return make_pointer_type(element_type, qualifiers);
6055         }
6056
6057         if (is_type_function(type)) {
6058                 return make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
6059         }
6060
6061         return orig_type;
6062 }
6063
6064 /**
6065  * reverts the automatic casts of array to pointer types and function
6066  * to function-pointer types as defined §6.3.2.1
6067  */
6068 type_t *revert_automatic_type_conversion(const expression_t *expression)
6069 {
6070         switch (expression->kind) {
6071         case EXPR_REFERENCE: {
6072                 entity_t *entity = expression->reference.entity;
6073                 if (is_declaration(entity)) {
6074                         return entity->declaration.type;
6075                 } else if (entity->kind == ENTITY_ENUM_VALUE) {
6076                         return entity->enum_value.enum_type;
6077                 } else {
6078                         panic("no declaration or enum in reference");
6079                 }
6080         }
6081
6082         case EXPR_SELECT: {
6083                 entity_t *entity = expression->select.compound_entry;
6084                 assert(is_declaration(entity));
6085                 type_t   *type   = entity->declaration.type;
6086                 return get_qualified_type(type, expression->base.type->base.qualifiers);
6087         }
6088
6089         case EXPR_UNARY_DEREFERENCE: {
6090                 const expression_t *const value = expression->unary.value;
6091                 type_t             *const type  = skip_typeref(value->base.type);
6092                 if (!is_type_pointer(type))
6093                         return type_error_type;
6094                 return type->pointer.points_to;
6095         }
6096
6097         case EXPR_ARRAY_ACCESS: {
6098                 const expression_t *array_ref = expression->array_access.array_ref;
6099                 type_t             *type_left = skip_typeref(array_ref->base.type);
6100                 if (!is_type_pointer(type_left))
6101                         return type_error_type;
6102                 return type_left->pointer.points_to;
6103         }
6104
6105         case EXPR_STRING_LITERAL: {
6106                 size_t size = expression->string_literal.value.size;
6107                 return make_array_type(type_char, size, TYPE_QUALIFIER_NONE);
6108         }
6109
6110         case EXPR_WIDE_STRING_LITERAL: {
6111                 size_t size = wstrlen(&expression->string_literal.value);
6112                 return make_array_type(type_wchar_t, size, TYPE_QUALIFIER_NONE);
6113         }
6114
6115         case EXPR_COMPOUND_LITERAL:
6116                 return expression->compound_literal.type;
6117
6118         default:
6119                 break;
6120         }
6121         return expression->base.type;
6122 }
6123
6124 /**
6125  * Find an entity matching a symbol in a scope.
6126  * Uses current scope if scope is NULL
6127  */
6128 static entity_t *lookup_entity(const scope_t *scope, symbol_t *symbol,
6129                                namespace_tag_t namespc)
6130 {
6131         if (scope == NULL) {
6132                 return get_entity(symbol, namespc);
6133         }
6134
6135         /* we should optimize here, if scope grows above a certain size we should
6136            construct a hashmap here... */
6137         entity_t *entity = scope->entities;
6138         for ( ; entity != NULL; entity = entity->base.next) {
6139                 if (entity->base.symbol == symbol
6140                     && (namespace_tag_t)entity->base.namespc == namespc)
6141                         break;
6142         }
6143
6144         return entity;
6145 }
6146
6147 static entity_t *parse_qualified_identifier(void)
6148 {
6149         /* namespace containing the symbol */
6150         symbol_t          *symbol;
6151         source_position_t  pos;
6152         const scope_t     *lookup_scope = NULL;
6153
6154         if (next_if(T_COLONCOLON))
6155                 lookup_scope = &unit->scope;
6156
6157         entity_t *entity;
6158         while (true) {
6159                 if (token.kind != T_IDENTIFIER) {
6160                         parse_error_expected("while parsing identifier", T_IDENTIFIER, NULL);
6161                         return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6162                 }
6163                 symbol = token.identifier.symbol;
6164                 pos    = *HERE;
6165                 next_token();
6166
6167                 /* lookup entity */
6168                 entity = lookup_entity(lookup_scope, symbol, NAMESPACE_NORMAL);
6169
6170                 if (!next_if(T_COLONCOLON))
6171                         break;
6172
6173                 switch (entity->kind) {
6174                 case ENTITY_NAMESPACE:
6175                         lookup_scope = &entity->namespacee.members;
6176                         break;
6177                 case ENTITY_STRUCT:
6178                 case ENTITY_UNION:
6179                 case ENTITY_CLASS:
6180                         lookup_scope = &entity->compound.members;
6181                         break;
6182                 default:
6183                         errorf(&pos, "'%Y' must be a namespace, class, struct or union (but is a %s)",
6184                                symbol, get_entity_kind_name(entity->kind));
6185
6186                         /* skip further qualifications */
6187                         while (next_if(T_IDENTIFIER) && next_if(T_COLONCOLON)) {}
6188
6189                         return create_error_entity(sym_anonymous, ENTITY_VARIABLE);
6190                 }
6191         }
6192
6193         if (entity == NULL) {
6194                 if (!strict_mode && token.kind == '(') {
6195                         /* an implicitly declared function */
6196                         warningf(WARN_IMPLICIT_FUNCTION_DECLARATION, &pos,
6197                                  "implicit declaration of function '%Y'", symbol);
6198                         entity = create_implicit_function(symbol, &pos);
6199                 } else {
6200                         errorf(&pos, "unknown identifier '%Y' found.", symbol);
6201                         entity = create_error_entity(symbol, ENTITY_VARIABLE);
6202                 }
6203         }
6204
6205         return entity;
6206 }
6207
6208 static expression_t *parse_reference(void)
6209 {
6210         source_position_t const pos    = token.base.source_position;
6211         entity_t         *const entity = parse_qualified_identifier();
6212
6213         type_t *orig_type;
6214         if (is_declaration(entity)) {
6215                 orig_type = entity->declaration.type;
6216         } else if (entity->kind == ENTITY_ENUM_VALUE) {
6217                 orig_type = entity->enum_value.enum_type;
6218         } else {
6219                 panic("expected declaration or enum value in reference");
6220         }
6221
6222         /* we always do the auto-type conversions; the & and sizeof parser contains
6223          * code to revert this! */
6224         type_t *type = automatic_type_conversion(orig_type);
6225
6226         expression_kind_t kind = EXPR_REFERENCE;
6227         if (entity->kind == ENTITY_ENUM_VALUE)
6228                 kind = EXPR_REFERENCE_ENUM_VALUE;
6229
6230         expression_t *expression         = allocate_expression_zero(kind);
6231         expression->base.source_position = pos;
6232         expression->base.type            = type;
6233         expression->reference.entity     = entity;
6234
6235         /* this declaration is used */
6236         if (is_declaration(entity)) {
6237                 entity->declaration.used = true;
6238         }
6239
6240         if (entity->base.parent_scope != file_scope
6241                 && (current_function != NULL
6242                         && entity->base.parent_scope->depth < current_function->parameters.depth)
6243                 && (entity->kind == ENTITY_VARIABLE || entity->kind == ENTITY_PARAMETER)) {
6244                 if (entity->kind == ENTITY_VARIABLE) {
6245                         /* access of a variable from an outer function */
6246                         entity->variable.address_taken = true;
6247                 } else if (entity->kind == ENTITY_PARAMETER) {
6248                         entity->parameter.address_taken = true;
6249                 }
6250                 current_function->need_closure = true;
6251         }
6252
6253         check_deprecated(&pos, entity);
6254
6255         return expression;
6256 }
6257
6258 static bool semantic_cast(expression_t *cast)
6259 {
6260         expression_t            *expression      = cast->unary.value;
6261         type_t                  *orig_dest_type  = cast->base.type;
6262         type_t                  *orig_type_right = expression->base.type;
6263         type_t            const *dst_type        = skip_typeref(orig_dest_type);
6264         type_t            const *src_type        = skip_typeref(orig_type_right);
6265         source_position_t const *pos             = &cast->base.source_position;
6266
6267         /* §6.5.4 A (void) cast is explicitly permitted, more for documentation than for utility. */
6268         if (dst_type == type_void)
6269                 return true;
6270
6271         /* only integer and pointer can be casted to pointer */
6272         if (is_type_pointer(dst_type)  &&
6273             !is_type_pointer(src_type) &&
6274             !is_type_integer(src_type) &&
6275             is_type_valid(src_type)) {
6276                 errorf(pos, "cannot convert type '%T' to a pointer type", orig_type_right);
6277                 return false;
6278         }
6279
6280         if (!is_type_scalar(dst_type) && is_type_valid(dst_type)) {
6281                 errorf(pos, "conversion to non-scalar type '%T' requested", orig_dest_type);
6282                 return false;
6283         }
6284
6285         if (!is_type_scalar(src_type) && is_type_valid(src_type)) {
6286                 errorf(pos, "conversion from non-scalar type '%T' requested", orig_type_right);
6287                 return false;
6288         }
6289
6290         if (is_type_pointer(src_type) && is_type_pointer(dst_type)) {
6291                 type_t *src = skip_typeref(src_type->pointer.points_to);
6292                 type_t *dst = skip_typeref(dst_type->pointer.points_to);
6293                 unsigned missing_qualifiers =
6294                         src->base.qualifiers & ~dst->base.qualifiers;
6295                 if (missing_qualifiers != 0) {
6296                         warningf(WARN_CAST_QUAL, pos, "cast discards qualifiers '%Q' in pointer target type of '%T'", missing_qualifiers, orig_type_right);
6297                 }
6298         }
6299         return true;
6300 }
6301
6302 static expression_t *parse_compound_literal(source_position_t const *const pos, type_t *type)
6303 {
6304         expression_t *expression = allocate_expression_zero(EXPR_COMPOUND_LITERAL);
6305         expression->base.source_position = *pos;
6306
6307         parse_initializer_env_t env;
6308         env.type             = type;
6309         env.entity           = NULL;
6310         env.must_be_constant = false;
6311         initializer_t *initializer = parse_initializer(&env);
6312         type = env.type;
6313
6314         expression->compound_literal.initializer = initializer;
6315         expression->compound_literal.type        = type;
6316         expression->base.type                    = automatic_type_conversion(type);
6317
6318         return expression;
6319 }
6320
6321 /**
6322  * Parse a cast expression.
6323  */
6324 static expression_t *parse_cast(void)
6325 {
6326         source_position_t const pos = *HERE;
6327
6328         eat('(');
6329         add_anchor_token(')');
6330
6331         type_t *type = parse_typename();
6332
6333         rem_anchor_token(')');
6334         expect(')', end_error);
6335
6336         if (token.kind == '{') {
6337                 return parse_compound_literal(&pos, type);
6338         }
6339
6340         expression_t *cast = allocate_expression_zero(EXPR_UNARY_CAST);
6341         cast->base.source_position = pos;
6342
6343         expression_t *value = parse_subexpression(PREC_CAST);
6344         cast->base.type   = type;
6345         cast->unary.value = value;
6346
6347         if (! semantic_cast(cast)) {
6348                 /* TODO: record the error in the AST. else it is impossible to detect it */
6349         }
6350
6351         return cast;
6352 end_error:
6353         return create_error_expression();
6354 }
6355
6356 /**
6357  * Parse a statement expression.
6358  */
6359 static expression_t *parse_statement_expression(void)
6360 {
6361         expression_t *expression = allocate_expression_zero(EXPR_STATEMENT);
6362
6363         eat('(');
6364         add_anchor_token(')');
6365
6366         statement_t *statement          = parse_compound_statement(true);
6367         statement->compound.stmt_expr   = true;
6368         expression->statement.statement = statement;
6369
6370         /* find last statement and use its type */
6371         type_t *type = type_void;
6372         const statement_t *stmt = statement->compound.statements;
6373         if (stmt != NULL) {
6374                 while (stmt->base.next != NULL)
6375                         stmt = stmt->base.next;
6376
6377                 if (stmt->kind == STATEMENT_EXPRESSION) {
6378                         type = stmt->expression.expression->base.type;
6379                 }
6380         } else {
6381                 source_position_t const *const pos = &expression->base.source_position;
6382                 warningf(WARN_OTHER, pos, "empty statement expression ({})");
6383         }
6384         expression->base.type = type;
6385
6386         rem_anchor_token(')');
6387         expect(')', end_error);
6388
6389 end_error:
6390         return expression;
6391 }
6392
6393 /**
6394  * Parse a parenthesized expression.
6395  */
6396 static expression_t *parse_parenthesized_expression(void)
6397 {
6398         token_t const* const la1 = look_ahead(1);
6399         switch (la1->kind) {
6400         case '{':
6401                 /* gcc extension: a statement expression */
6402                 return parse_statement_expression();
6403
6404         case T_IDENTIFIER:
6405                 if (is_typedef_symbol(la1->identifier.symbol)) {
6406         DECLARATION_START
6407                         return parse_cast();
6408                 }
6409         }
6410
6411         eat('(');
6412         add_anchor_token(')');
6413         expression_t *result = parse_expression();
6414         result->base.parenthesized = true;
6415         rem_anchor_token(')');
6416         expect(')', end_error);
6417
6418 end_error:
6419         return result;
6420 }
6421
6422 static expression_t *parse_function_keyword(void)
6423 {
6424         /* TODO */
6425
6426         if (current_function == NULL) {
6427                 errorf(HERE, "'__func__' used outside of a function");
6428         }
6429
6430         expression_t *expression  = allocate_expression_zero(EXPR_FUNCNAME);
6431         expression->base.type     = type_char_ptr;
6432         expression->funcname.kind = FUNCNAME_FUNCTION;
6433
6434         next_token();
6435
6436         return expression;
6437 }
6438
6439 static expression_t *parse_pretty_function_keyword(void)
6440 {
6441         if (current_function == NULL) {
6442                 errorf(HERE, "'__PRETTY_FUNCTION__' used outside of a function");
6443         }
6444
6445         expression_t *expression  = allocate_expression_zero(EXPR_FUNCNAME);
6446         expression->base.type     = type_char_ptr;
6447         expression->funcname.kind = FUNCNAME_PRETTY_FUNCTION;
6448
6449         eat(T___PRETTY_FUNCTION__);
6450
6451         return expression;
6452 }
6453
6454 static expression_t *parse_funcsig_keyword(void)
6455 {
6456         if (current_function == NULL) {
6457                 errorf(HERE, "'__FUNCSIG__' used outside of a function");
6458         }
6459
6460         expression_t *expression  = allocate_expression_zero(EXPR_FUNCNAME);
6461         expression->base.type     = type_char_ptr;
6462         expression->funcname.kind = FUNCNAME_FUNCSIG;
6463
6464         eat(T___FUNCSIG__);
6465
6466         return expression;
6467 }
6468
6469 static expression_t *parse_funcdname_keyword(void)
6470 {
6471         if (current_function == NULL) {
6472                 errorf(HERE, "'__FUNCDNAME__' used outside of a function");
6473         }
6474
6475         expression_t *expression  = allocate_expression_zero(EXPR_FUNCNAME);
6476         expression->base.type     = type_char_ptr;
6477         expression->funcname.kind = FUNCNAME_FUNCDNAME;
6478
6479         eat(T___FUNCDNAME__);
6480
6481         return expression;
6482 }
6483
6484 static designator_t *parse_designator(void)
6485 {
6486         designator_t *result    = allocate_ast_zero(sizeof(result[0]));
6487         result->source_position = *HERE;
6488
6489         if (token.kind != T_IDENTIFIER) {
6490                 parse_error_expected("while parsing member designator",
6491                                      T_IDENTIFIER, NULL);
6492                 return NULL;
6493         }
6494         result->symbol = token.identifier.symbol;
6495         next_token();
6496
6497         designator_t *last_designator = result;
6498         while (true) {
6499                 if (next_if('.')) {
6500                         if (token.kind != T_IDENTIFIER) {
6501                                 parse_error_expected("while parsing member designator",
6502                                                      T_IDENTIFIER, NULL);
6503                                 return NULL;
6504                         }
6505                         designator_t *designator    = allocate_ast_zero(sizeof(result[0]));
6506                         designator->source_position = *HERE;
6507                         designator->symbol          = token.identifier.symbol;
6508                         next_token();
6509
6510                         last_designator->next = designator;
6511                         last_designator       = designator;
6512                         continue;
6513                 }
6514                 if (next_if('[')) {
6515                         add_anchor_token(']');
6516                         designator_t *designator    = allocate_ast_zero(sizeof(result[0]));
6517                         designator->source_position = *HERE;
6518                         designator->array_index     = parse_expression();
6519                         rem_anchor_token(']');
6520                         expect(']', end_error);
6521                         if (designator->array_index == NULL) {
6522                                 return NULL;
6523                         }
6524
6525                         last_designator->next = designator;
6526                         last_designator       = designator;
6527                         continue;
6528                 }
6529                 break;
6530         }
6531
6532         return result;
6533 end_error:
6534         return NULL;
6535 }
6536
6537 /**
6538  * Parse the __builtin_offsetof() expression.
6539  */
6540 static expression_t *parse_offsetof(void)
6541 {
6542         expression_t *expression = allocate_expression_zero(EXPR_OFFSETOF);
6543         expression->base.type    = type_size_t;
6544
6545         eat(T___builtin_offsetof);
6546
6547         expect('(', end_error);
6548         add_anchor_token(',');
6549         type_t *type = parse_typename();
6550         rem_anchor_token(',');
6551         expect(',', end_error);
6552         add_anchor_token(')');
6553         designator_t *designator = parse_designator();
6554         rem_anchor_token(')');
6555         expect(')', end_error);
6556
6557         expression->offsetofe.type       = type;
6558         expression->offsetofe.designator = designator;
6559
6560         type_path_t path;
6561         memset(&path, 0, sizeof(path));
6562         path.top_type = type;
6563         path.path     = NEW_ARR_F(type_path_entry_t, 0);
6564
6565         descend_into_subtype(&path);
6566
6567         if (!walk_designator(&path, designator, true)) {
6568                 return create_error_expression();
6569         }
6570
6571         DEL_ARR_F(path.path);
6572
6573         return expression;
6574 end_error:
6575         return create_error_expression();
6576 }
6577
6578 /**
6579  * Parses a _builtin_va_start() expression.
6580  */
6581 static expression_t *parse_va_start(void)
6582 {
6583         expression_t *expression = allocate_expression_zero(EXPR_VA_START);
6584
6585         eat(T___builtin_va_start);
6586
6587         expect('(', end_error);
6588         add_anchor_token(',');
6589         expression->va_starte.ap = parse_assignment_expression();
6590         rem_anchor_token(',');
6591         expect(',', end_error);
6592         expression_t *const expr = parse_assignment_expression();
6593         if (expr->kind == EXPR_REFERENCE) {
6594                 entity_t *const entity = expr->reference.entity;
6595                 if (!current_function->base.type->function.variadic) {
6596                         errorf(&expr->base.source_position,
6597                                         "'va_start' used in non-variadic function");
6598                 } else if (entity->base.parent_scope != &current_function->parameters ||
6599                                 entity->base.next != NULL ||
6600                                 entity->kind != ENTITY_PARAMETER) {
6601                         errorf(&expr->base.source_position,
6602                                "second argument of 'va_start' must be last parameter of the current function");
6603                 } else {
6604                         expression->va_starte.parameter = &entity->variable;
6605                 }
6606                 expect(')', end_error);
6607                 return expression;
6608         }
6609         expect(')', end_error);
6610 end_error:
6611         return create_error_expression();
6612 }
6613
6614 /**
6615  * Parses a __builtin_va_arg() expression.
6616  */
6617 static expression_t *parse_va_arg(void)
6618 {
6619         expression_t *expression = allocate_expression_zero(EXPR_VA_ARG);
6620
6621         eat(T___builtin_va_arg);
6622
6623         expect('(', end_error);
6624         call_argument_t ap;
6625         ap.expression = parse_assignment_expression();
6626         expression->va_arge.ap = ap.expression;
6627         check_call_argument(type_valist, &ap, 1);
6628
6629         expect(',', end_error);
6630         expression->base.type = parse_typename();
6631         expect(')', end_error);
6632
6633         return expression;
6634 end_error:
6635         return create_error_expression();
6636 }
6637
6638 /**
6639  * Parses a __builtin_va_copy() expression.
6640  */
6641 static expression_t *parse_va_copy(void)
6642 {
6643         expression_t *expression = allocate_expression_zero(EXPR_VA_COPY);
6644
6645         eat(T___builtin_va_copy);
6646
6647         expect('(', end_error);
6648         expression_t *dst = parse_assignment_expression();
6649         assign_error_t error = semantic_assign(type_valist, dst);
6650         report_assign_error(error, type_valist, dst, "call argument 1",
6651                             &dst->base.source_position);
6652         expression->va_copye.dst = dst;
6653
6654         expect(',', end_error);
6655
6656         call_argument_t src;
6657         src.expression = parse_assignment_expression();
6658         check_call_argument(type_valist, &src, 2);
6659         expression->va_copye.src = src.expression;
6660         expect(')', end_error);
6661
6662         return expression;
6663 end_error:
6664         return create_error_expression();
6665 }
6666
6667 /**
6668  * Parses a __builtin_constant_p() expression.
6669  */
6670 static expression_t *parse_builtin_constant(void)
6671 {
6672         expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_CONSTANT_P);
6673
6674         eat(T___builtin_constant_p);
6675
6676         expect('(', end_error);
6677         add_anchor_token(')');
6678         expression->builtin_constant.value = parse_assignment_expression();
6679         rem_anchor_token(')');
6680         expect(')', end_error);
6681         expression->base.type = type_int;
6682
6683         return expression;
6684 end_error:
6685         return create_error_expression();
6686 }
6687
6688 /**
6689  * Parses a __builtin_types_compatible_p() expression.
6690  */
6691 static expression_t *parse_builtin_types_compatible(void)
6692 {
6693         expression_t *expression = allocate_expression_zero(EXPR_BUILTIN_TYPES_COMPATIBLE_P);
6694
6695         eat(T___builtin_types_compatible_p);
6696
6697         expect('(', end_error);
6698         add_anchor_token(')');
6699         add_anchor_token(',');
6700         expression->builtin_types_compatible.left = parse_typename();
6701         rem_anchor_token(',');
6702         expect(',', end_error);
6703         expression->builtin_types_compatible.right = parse_typename();
6704         rem_anchor_token(')');
6705         expect(')', end_error);
6706         expression->base.type = type_int;
6707
6708         return expression;
6709 end_error:
6710         return create_error_expression();
6711 }
6712
6713 /**
6714  * Parses a __builtin_is_*() compare expression.
6715  */
6716 static expression_t *parse_compare_builtin(void)
6717 {
6718         expression_t *expression;
6719
6720         switch (token.kind) {
6721         case T___builtin_isgreater:
6722                 expression = allocate_expression_zero(EXPR_BINARY_ISGREATER);
6723                 break;
6724         case T___builtin_isgreaterequal:
6725                 expression = allocate_expression_zero(EXPR_BINARY_ISGREATEREQUAL);
6726                 break;
6727         case T___builtin_isless:
6728                 expression = allocate_expression_zero(EXPR_BINARY_ISLESS);
6729                 break;
6730         case T___builtin_islessequal:
6731                 expression = allocate_expression_zero(EXPR_BINARY_ISLESSEQUAL);
6732                 break;
6733         case T___builtin_islessgreater:
6734                 expression = allocate_expression_zero(EXPR_BINARY_ISLESSGREATER);
6735                 break;
6736         case T___builtin_isunordered:
6737                 expression = allocate_expression_zero(EXPR_BINARY_ISUNORDERED);
6738                 break;
6739         default:
6740                 internal_errorf(HERE, "invalid compare builtin found");
6741         }
6742         expression->base.source_position = *HERE;
6743         next_token();
6744
6745         expect('(', end_error);
6746         expression->binary.left = parse_assignment_expression();
6747         expect(',', end_error);
6748         expression->binary.right = parse_assignment_expression();
6749         expect(')', end_error);
6750
6751         type_t *const orig_type_left  = expression->binary.left->base.type;
6752         type_t *const orig_type_right = expression->binary.right->base.type;
6753
6754         type_t *const type_left  = skip_typeref(orig_type_left);
6755         type_t *const type_right = skip_typeref(orig_type_right);
6756         if (!is_type_float(type_left) && !is_type_float(type_right)) {
6757                 if (is_type_valid(type_left) && is_type_valid(type_right)) {
6758                         type_error_incompatible("invalid operands in comparison",
6759                                 &expression->base.source_position, orig_type_left, orig_type_right);
6760                 }
6761         } else {
6762                 semantic_comparison(&expression->binary);
6763         }
6764
6765         return expression;
6766 end_error:
6767         return create_error_expression();
6768 }
6769
6770 /**
6771  * Parses a MS assume() expression.
6772  */
6773 static expression_t *parse_assume(void)
6774 {
6775         expression_t *expression = allocate_expression_zero(EXPR_UNARY_ASSUME);
6776
6777         eat(T__assume);
6778
6779         expect('(', end_error);
6780         add_anchor_token(')');
6781         expression->unary.value = parse_assignment_expression();
6782         rem_anchor_token(')');
6783         expect(')', end_error);
6784
6785         expression->base.type = type_void;
6786         return expression;
6787 end_error:
6788         return create_error_expression();
6789 }
6790
6791 /**
6792  * Return the label for the current symbol or create a new one.
6793  */
6794 static label_t *get_label(void)
6795 {
6796         assert(token.kind == T_IDENTIFIER);
6797         assert(current_function != NULL);
6798
6799         entity_t *label = get_entity(token.identifier.symbol, NAMESPACE_LABEL);
6800         /* If we find a local label, we already created the declaration. */
6801         if (label != NULL && label->kind == ENTITY_LOCAL_LABEL) {
6802                 if (label->base.parent_scope != current_scope) {
6803                         assert(label->base.parent_scope->depth < current_scope->depth);
6804                         current_function->goto_to_outer = true;
6805                 }
6806         } else if (label == NULL || label->base.parent_scope != &current_function->parameters) {
6807                 /* There is no matching label in the same function, so create a new one. */
6808                 label = allocate_entity_zero(ENTITY_LABEL, NAMESPACE_LABEL, token.identifier.symbol);
6809                 label_push(label);
6810         }
6811
6812         eat(T_IDENTIFIER);
6813         return &label->label;
6814 }
6815
6816 /**
6817  * Parses a GNU && label address expression.
6818  */
6819 static expression_t *parse_label_address(void)
6820 {
6821         source_position_t source_position = token.base.source_position;
6822         eat(T_ANDAND);
6823         if (token.kind != T_IDENTIFIER) {
6824                 parse_error_expected("while parsing label address", T_IDENTIFIER, NULL);
6825                 return create_error_expression();
6826         }
6827
6828         label_t *const label = get_label();
6829         label->used          = true;
6830         label->address_taken = true;
6831
6832         expression_t *expression = allocate_expression_zero(EXPR_LABEL_ADDRESS);
6833         expression->base.source_position = source_position;
6834
6835         /* label address is treated as a void pointer */
6836         expression->base.type           = type_void_ptr;
6837         expression->label_address.label = label;
6838         return expression;
6839 }
6840
6841 /**
6842  * Parse a microsoft __noop expression.
6843  */
6844 static expression_t *parse_noop_expression(void)
6845 {
6846         /* the result is a (int)0 */
6847         expression_t *literal = allocate_expression_zero(EXPR_LITERAL_MS_NOOP);
6848         literal->base.type           = type_int;
6849         literal->literal.value.begin = "__noop";
6850         literal->literal.value.size  = 6;
6851
6852         eat(T___noop);
6853
6854         if (token.kind == '(') {
6855                 /* parse arguments */
6856                 eat('(');
6857                 add_anchor_token(')');
6858                 add_anchor_token(',');
6859
6860                 if (token.kind != ')') do {
6861                         (void)parse_assignment_expression();
6862                 } while (next_if(','));
6863         }
6864         rem_anchor_token(',');
6865         rem_anchor_token(')');
6866         expect(')', end_error);
6867
6868 end_error:
6869         return literal;
6870 }
6871
6872 /**
6873  * Parses a primary expression.
6874  */
6875 static expression_t *parse_primary_expression(void)
6876 {
6877         switch (token.kind) {
6878         case T_false:                        return parse_boolean_literal(false);
6879         case T_true:                         return parse_boolean_literal(true);
6880         case T_INTEGER:
6881         case T_INTEGER_OCTAL:
6882         case T_INTEGER_HEXADECIMAL:
6883         case T_FLOATINGPOINT:
6884         case T_FLOATINGPOINT_HEXADECIMAL:    return parse_number_literal();
6885         case T_CHARACTER_CONSTANT:           return parse_character_constant();
6886         case T_WIDE_CHARACTER_CONSTANT:      return parse_wide_character_constant();
6887         case T_STRING_LITERAL:
6888         case T_WIDE_STRING_LITERAL:          return parse_string_literal();
6889         case T___FUNCTION__:
6890         case T___func__:                     return parse_function_keyword();
6891         case T___PRETTY_FUNCTION__:          return parse_pretty_function_keyword();
6892         case T___FUNCSIG__:                  return parse_funcsig_keyword();
6893         case T___FUNCDNAME__:                return parse_funcdname_keyword();
6894         case T___builtin_offsetof:           return parse_offsetof();
6895         case T___builtin_va_start:           return parse_va_start();
6896         case T___builtin_va_arg:             return parse_va_arg();
6897         case T___builtin_va_copy:            return parse_va_copy();
6898         case T___builtin_isgreater:
6899         case T___builtin_isgreaterequal:
6900         case T___builtin_isless:
6901         case T___builtin_islessequal:
6902         case T___builtin_islessgreater:
6903         case T___builtin_isunordered:        return parse_compare_builtin();
6904         case T___builtin_constant_p:         return parse_builtin_constant();
6905         case T___builtin_types_compatible_p: return parse_builtin_types_compatible();
6906         case T__assume:                      return parse_assume();
6907         case T_ANDAND:
6908                 if (GNU_MODE)
6909                         return parse_label_address();
6910                 break;
6911
6912         case '(':                            return parse_parenthesized_expression();
6913         case T___noop:                       return parse_noop_expression();
6914
6915         /* Gracefully handle type names while parsing expressions. */
6916         case T_COLONCOLON:
6917                 return parse_reference();
6918         case T_IDENTIFIER:
6919                 if (!is_typedef_symbol(token.identifier.symbol)) {
6920                         return parse_reference();
6921                 }
6922                 /* FALLTHROUGH */
6923         DECLARATION_START {
6924                 source_position_t const  pos = *HERE;
6925                 declaration_specifiers_t specifiers;
6926                 parse_declaration_specifiers(&specifiers);
6927                 type_t const *const type = parse_abstract_declarator(specifiers.type);
6928                 errorf(&pos, "encountered type '%T' while parsing expression", type);
6929                 return create_error_expression();
6930         }
6931         }
6932
6933         errorf(HERE, "unexpected token %K, expected an expression", &token);
6934         eat_until_anchor();
6935         return create_error_expression();
6936 }
6937
6938 static expression_t *parse_array_expression(expression_t *left)
6939 {
6940         expression_t              *const expr = allocate_expression_zero(EXPR_ARRAY_ACCESS);
6941         array_access_expression_t *const arr  = &expr->array_access;
6942
6943         eat('[');
6944         add_anchor_token(']');
6945
6946         expression_t *const inside = parse_expression();
6947
6948         type_t *const orig_type_left   = left->base.type;
6949         type_t *const orig_type_inside = inside->base.type;
6950
6951         type_t *const type_left   = skip_typeref(orig_type_left);
6952         type_t *const type_inside = skip_typeref(orig_type_inside);
6953
6954         expression_t *ref;
6955         expression_t *idx;
6956         type_t       *idx_type;
6957         type_t       *res_type;
6958         if (is_type_pointer(type_left)) {
6959                 ref      = left;
6960                 idx      = inside;
6961                 idx_type = type_inside;
6962                 res_type = type_left->pointer.points_to;
6963                 goto check_idx;
6964         } else if (is_type_pointer(type_inside)) {
6965                 arr->flipped = true;
6966                 ref      = inside;
6967                 idx      = left;
6968                 idx_type = type_left;
6969                 res_type = type_inside->pointer.points_to;
6970 check_idx:
6971                 res_type = automatic_type_conversion(res_type);
6972                 if (!is_type_integer(idx_type)) {
6973                         errorf(&idx->base.source_position, "array subscript must have integer type");
6974                 } else if (is_type_atomic(idx_type, ATOMIC_TYPE_CHAR)) {
6975                         source_position_t const *const pos = &idx->base.source_position;
6976                         warningf(WARN_CHAR_SUBSCRIPTS, pos, "array subscript has char type");
6977                 }
6978         } else {
6979                 if (is_type_valid(type_left) && is_type_valid(type_inside)) {
6980                         errorf(&expr->base.source_position, "invalid types '%T[%T]' for array access", orig_type_left, orig_type_inside);
6981                 }
6982                 res_type = type_error_type;
6983                 ref      = left;
6984                 idx      = inside;
6985         }
6986
6987         arr->array_ref = ref;
6988         arr->index     = idx;
6989         arr->base.type = res_type;
6990
6991         rem_anchor_token(']');
6992         expect(']', end_error);
6993 end_error:
6994         return expr;
6995 }
6996
6997 static bool is_bitfield(const expression_t *expression)
6998 {
6999         return expression->kind == EXPR_SELECT
7000                 && expression->select.compound_entry->compound_member.bitfield;
7001 }
7002
7003 static expression_t *parse_typeprop(expression_kind_t const kind)
7004 {
7005         expression_t  *tp_expression = allocate_expression_zero(kind);
7006         tp_expression->base.type     = type_size_t;
7007
7008         eat(kind == EXPR_SIZEOF ? T_sizeof : T___alignof__);
7009
7010         type_t       *orig_type;
7011         expression_t *expression;
7012         if (token.kind == '(' && is_declaration_specifier(look_ahead(1))) {
7013                 source_position_t const pos = *HERE;
7014                 next_token();
7015                 add_anchor_token(')');
7016                 orig_type = parse_typename();
7017                 rem_anchor_token(')');
7018                 expect(')', end_error);
7019
7020                 if (token.kind == '{') {
7021                         /* It was not sizeof(type) after all.  It is sizeof of an expression
7022                          * starting with a compound literal */
7023                         expression = parse_compound_literal(&pos, orig_type);
7024                         goto typeprop_expression;
7025                 }
7026         } else {
7027                 expression = parse_subexpression(PREC_UNARY);
7028
7029 typeprop_expression:
7030                 if (is_bitfield(expression)) {
7031                         char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7032                         errorf(&tp_expression->base.source_position,
7033                                    "operand of %s expression must not be a bitfield", what);
7034                 }
7035
7036                 tp_expression->typeprop.tp_expression = expression;
7037
7038                 orig_type = revert_automatic_type_conversion(expression);
7039                 expression->base.type = orig_type;
7040         }
7041
7042         tp_expression->typeprop.type   = orig_type;
7043         type_t const* const type       = skip_typeref(orig_type);
7044         char   const*       wrong_type = NULL;
7045         if (is_type_incomplete(type)) {
7046                 if (!is_type_atomic(type, ATOMIC_TYPE_VOID) || !GNU_MODE)
7047                         wrong_type = "incomplete";
7048         } else if (type->kind == TYPE_FUNCTION) {
7049                 if (GNU_MODE) {
7050                         /* function types are allowed (and return 1) */
7051                         source_position_t const *const pos  = &tp_expression->base.source_position;
7052                         char              const *const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7053                         warningf(WARN_OTHER, pos, "%s expression with function argument returns invalid result", what);
7054                 } else {
7055                         wrong_type = "function";
7056                 }
7057         }
7058
7059         if (wrong_type != NULL) {
7060                 char const* const what = kind == EXPR_SIZEOF ? "sizeof" : "alignof";
7061                 errorf(&tp_expression->base.source_position,
7062                                 "operand of %s expression must not be of %s type '%T'",
7063                                 what, wrong_type, orig_type);
7064         }
7065
7066 end_error:
7067         return tp_expression;
7068 }
7069
7070 static expression_t *parse_sizeof(void)
7071 {
7072         return parse_typeprop(EXPR_SIZEOF);
7073 }
7074
7075 static expression_t *parse_alignof(void)
7076 {
7077         return parse_typeprop(EXPR_ALIGNOF);
7078 }
7079
7080 static expression_t *parse_select_expression(expression_t *addr)
7081 {
7082         assert(token.kind == '.' || token.kind == T_MINUSGREATER);
7083         bool select_left_arrow = (token.kind == T_MINUSGREATER);
7084         source_position_t const pos = *HERE;
7085         next_token();
7086
7087         if (token.kind != T_IDENTIFIER) {
7088                 parse_error_expected("while parsing select", T_IDENTIFIER, NULL);
7089                 return create_error_expression();
7090         }
7091         symbol_t *symbol = token.identifier.symbol;
7092         next_token();
7093
7094         type_t *const orig_type = addr->base.type;
7095         type_t *const type      = skip_typeref(orig_type);
7096
7097         type_t *type_left;
7098         bool    saw_error = false;
7099         if (is_type_pointer(type)) {
7100                 if (!select_left_arrow) {
7101                         errorf(&pos,
7102                                "request for member '%Y' in something not a struct or union, but '%T'",
7103                                symbol, orig_type);
7104                         saw_error = true;
7105                 }
7106                 type_left = skip_typeref(type->pointer.points_to);
7107         } else {
7108                 if (select_left_arrow && is_type_valid(type)) {
7109                         errorf(&pos, "left hand side of '->' is not a pointer, but '%T'", orig_type);
7110                         saw_error = true;
7111                 }
7112                 type_left = type;
7113         }
7114
7115         if (type_left->kind != TYPE_COMPOUND_STRUCT &&
7116             type_left->kind != TYPE_COMPOUND_UNION) {
7117
7118                 if (is_type_valid(type_left) && !saw_error) {
7119                         errorf(&pos,
7120                                "request for member '%Y' in something not a struct or union, but '%T'",
7121                                symbol, type_left);
7122                 }
7123                 return create_error_expression();
7124         }
7125
7126         compound_t *compound = type_left->compound.compound;
7127         if (!compound->complete) {
7128                 errorf(&pos, "request for member '%Y' in incomplete type '%T'",
7129                        symbol, type_left);
7130                 return create_error_expression();
7131         }
7132
7133         type_qualifiers_t  qualifiers = type_left->base.qualifiers;
7134         expression_t      *result     =
7135                 find_create_select(&pos, addr, qualifiers, compound, symbol);
7136
7137         if (result == NULL) {
7138                 errorf(&pos, "'%T' has no member named '%Y'", orig_type, symbol);
7139                 return create_error_expression();
7140         }
7141
7142         return result;
7143 }
7144
7145 static void check_call_argument(type_t          *expected_type,
7146                                 call_argument_t *argument, unsigned pos)
7147 {
7148         type_t         *expected_type_skip = skip_typeref(expected_type);
7149         assign_error_t  error              = ASSIGN_ERROR_INCOMPATIBLE;
7150         expression_t   *arg_expr           = argument->expression;
7151         type_t         *arg_type           = skip_typeref(arg_expr->base.type);
7152
7153         /* handle transparent union gnu extension */
7154         if (is_type_union(expected_type_skip)
7155                         && (get_type_modifiers(expected_type) & DM_TRANSPARENT_UNION)) {
7156                 compound_t *union_decl  = expected_type_skip->compound.compound;
7157                 type_t     *best_type   = NULL;
7158                 entity_t   *entry       = union_decl->members.entities;
7159                 for ( ; entry != NULL; entry = entry->base.next) {
7160                         assert(is_declaration(entry));
7161                         type_t *decl_type = entry->declaration.type;
7162                         error = semantic_assign(decl_type, arg_expr);
7163                         if (error == ASSIGN_ERROR_INCOMPATIBLE
7164                                 || error == ASSIGN_ERROR_POINTER_QUALIFIER_MISSING)
7165                                 continue;
7166
7167                         if (error == ASSIGN_SUCCESS) {
7168                                 best_type = decl_type;
7169                         } else if (best_type == NULL) {
7170                                 best_type = decl_type;
7171                         }
7172                 }
7173
7174                 if (best_type != NULL) {
7175                         expected_type = best_type;
7176                 }
7177         }
7178
7179         error                = semantic_assign(expected_type, arg_expr);
7180         argument->expression = create_implicit_cast(arg_expr, expected_type);
7181
7182         if (error != ASSIGN_SUCCESS) {
7183                 /* report exact scope in error messages (like "in argument 3") */
7184                 char buf[64];
7185                 snprintf(buf, sizeof(buf), "call argument %u", pos);
7186                 report_assign_error(error, expected_type, arg_expr, buf,
7187                                     &arg_expr->base.source_position);
7188         } else {
7189                 type_t *const promoted_type = get_default_promoted_type(arg_type);
7190                 if (!types_compatible(expected_type_skip, promoted_type) &&
7191                     !types_compatible(expected_type_skip, type_void_ptr) &&
7192                     !types_compatible(type_void_ptr,      promoted_type)) {
7193                         /* Deliberately show the skipped types in this warning */
7194                         source_position_t const *const apos = &arg_expr->base.source_position;
7195                         warningf(WARN_TRADITIONAL, apos, "passing call argument %u as '%T' rather than '%T' due to prototype", pos, expected_type_skip, promoted_type);
7196                 }
7197         }
7198 }
7199
7200 /**
7201  * Handle the semantic restrictions of builtin calls
7202  */
7203 static void handle_builtin_argument_restrictions(call_expression_t *call)
7204 {
7205         entity_t *entity = call->function->reference.entity;
7206         switch (entity->function.btk) {
7207         case BUILTIN_FIRM:
7208                 switch (entity->function.b.firm_builtin_kind) {
7209                 case ir_bk_return_address:
7210                 case ir_bk_frame_address: {
7211                         /* argument must be constant */
7212                         call_argument_t *argument = call->arguments;
7213
7214                         if (is_constant_expression(argument->expression) == EXPR_CLASS_VARIABLE) {
7215                                 errorf(&call->base.source_position,
7216                                            "argument of '%Y' must be a constant expression",
7217                                            call->function->reference.entity->base.symbol);
7218                         }
7219                         break;
7220                 }
7221                 case ir_bk_prefetch:
7222                         /* second and third argument must be constant if existent */
7223                         if (call->arguments == NULL)
7224                                 break;
7225                         call_argument_t *rw = call->arguments->next;
7226                         call_argument_t *locality = NULL;
7227
7228                         if (rw != NULL) {
7229                                 if (is_constant_expression(rw->expression) == EXPR_CLASS_VARIABLE) {
7230                                         errorf(&call->base.source_position,
7231                                                    "second argument of '%Y' must be a constant expression",
7232                                                    call->function->reference.entity->base.symbol);
7233                                 }
7234                                 locality = rw->next;
7235                         }
7236                         if (locality != NULL) {
7237                                 if (is_constant_expression(locality->expression) == EXPR_CLASS_VARIABLE) {
7238                                         errorf(&call->base.source_position,
7239                                                    "third argument of '%Y' must be a constant expression",
7240                                                    call->function->reference.entity->base.symbol);
7241                                 }
7242                                 locality = rw->next;
7243                         }
7244                         break;
7245                 default:
7246                         break;
7247                 }
7248
7249         case BUILTIN_OBJECT_SIZE:
7250                 if (call->arguments == NULL)
7251                         break;
7252
7253                 call_argument_t *arg = call->arguments->next;
7254                 if (arg != NULL && is_constant_expression(arg->expression) == EXPR_CLASS_VARIABLE) {
7255                         errorf(&call->base.source_position,
7256                                    "second argument of '%Y' must be a constant expression",
7257                                    call->function->reference.entity->base.symbol);
7258                 }
7259                 break;
7260         default:
7261                 break;
7262         }
7263 }
7264
7265 /**
7266  * Parse a call expression, ie. expression '( ... )'.
7267  *
7268  * @param expression  the function address
7269  */
7270 static expression_t *parse_call_expression(expression_t *expression)
7271 {
7272         expression_t      *result = allocate_expression_zero(EXPR_CALL);
7273         call_expression_t *call   = &result->call;
7274         call->function            = expression;
7275
7276         type_t *const orig_type = expression->base.type;
7277         type_t *const type      = skip_typeref(orig_type);
7278
7279         function_type_t *function_type = NULL;
7280         if (is_type_pointer(type)) {
7281                 type_t *const to_type = skip_typeref(type->pointer.points_to);
7282
7283                 if (is_type_function(to_type)) {
7284                         function_type   = &to_type->function;
7285                         call->base.type = function_type->return_type;
7286                 }
7287         }
7288
7289         if (function_type == NULL && is_type_valid(type)) {
7290                 errorf(HERE,
7291                        "called object '%E' (type '%T') is not a pointer to a function",
7292                        expression, orig_type);
7293         }
7294
7295         /* parse arguments */
7296         eat('(');
7297         add_anchor_token(')');
7298         add_anchor_token(',');
7299
7300         if (token.kind != ')') {
7301                 call_argument_t **anchor = &call->arguments;
7302                 do {
7303                         call_argument_t *argument = allocate_ast_zero(sizeof(*argument));
7304                         argument->expression = parse_assignment_expression();
7305
7306                         *anchor = argument;
7307                         anchor  = &argument->next;
7308                 } while (next_if(','));
7309         }
7310         rem_anchor_token(',');
7311         rem_anchor_token(')');
7312         expect(')', end_error);
7313
7314         if (function_type == NULL)
7315                 return result;
7316
7317         /* check type and count of call arguments */
7318         function_parameter_t *parameter = function_type->parameters;
7319         call_argument_t      *argument  = call->arguments;
7320         if (!function_type->unspecified_parameters) {
7321                 for (unsigned pos = 0; parameter != NULL && argument != NULL;
7322                                 parameter = parameter->next, argument = argument->next) {
7323                         check_call_argument(parameter->type, argument, ++pos);
7324                 }
7325
7326                 if (parameter != NULL) {
7327                         errorf(&expression->base.source_position, "too few arguments to function '%E'", expression);
7328                 } else if (argument != NULL && !function_type->variadic) {
7329                         errorf(&argument->expression->base.source_position, "too many arguments to function '%E'", expression);
7330                 }
7331         }
7332
7333         /* do default promotion for other arguments */
7334         for (; argument != NULL; argument = argument->next) {
7335                 type_t *argument_type = argument->expression->base.type;
7336                 if (!is_type_object(skip_typeref(argument_type))) {
7337                         errorf(&argument->expression->base.source_position,
7338                                "call argument '%E' must not be void", argument->expression);
7339                 }
7340
7341                 argument_type = get_default_promoted_type(argument_type);
7342
7343                 argument->expression
7344                         = create_implicit_cast(argument->expression, argument_type);
7345         }
7346
7347         check_format(call);
7348
7349         if (is_type_compound(skip_typeref(function_type->return_type))) {
7350                 source_position_t const *const pos = &expression->base.source_position;
7351                 warningf(WARN_AGGREGATE_RETURN, pos, "function call has aggregate value");
7352         }
7353
7354         if (expression->kind == EXPR_REFERENCE) {
7355                 reference_expression_t *reference = &expression->reference;
7356                 if (reference->entity->kind == ENTITY_FUNCTION &&
7357                     reference->entity->function.btk != BUILTIN_NONE)
7358                         handle_builtin_argument_restrictions(call);
7359         }
7360
7361 end_error:
7362         return result;
7363 }
7364
7365 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right);
7366
7367 static bool same_compound_type(const type_t *type1, const type_t *type2)
7368 {
7369         return
7370                 is_type_compound(type1) &&
7371                 type1->kind == type2->kind &&
7372                 type1->compound.compound == type2->compound.compound;
7373 }
7374
7375 static expression_t const *get_reference_address(expression_t const *expr)
7376 {
7377         bool regular_take_address = true;
7378         for (;;) {
7379                 if (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
7380                         expr = expr->unary.value;
7381                 } else {
7382                         regular_take_address = false;
7383                 }
7384
7385                 if (expr->kind != EXPR_UNARY_DEREFERENCE)
7386                         break;
7387
7388                 expr = expr->unary.value;
7389         }
7390
7391         if (expr->kind != EXPR_REFERENCE)
7392                 return NULL;
7393
7394         /* special case for functions which are automatically converted to a
7395          * pointer to function without an extra TAKE_ADDRESS operation */
7396         if (!regular_take_address &&
7397                         expr->reference.entity->kind != ENTITY_FUNCTION) {
7398                 return NULL;
7399         }
7400
7401         return expr;
7402 }
7403
7404 static void warn_reference_address_as_bool(expression_t const* expr)
7405 {
7406         expr = get_reference_address(expr);
7407         if (expr != NULL) {
7408                 source_position_t const *const pos = &expr->base.source_position;
7409                 entity_t          const *const ent = expr->reference.entity;
7410                 warningf(WARN_ADDRESS, pos, "the address of '%N' will always evaluate as 'true'", ent);
7411         }
7412 }
7413
7414 static void warn_assignment_in_condition(const expression_t *const expr)
7415 {
7416         if (expr->base.kind != EXPR_BINARY_ASSIGN)
7417                 return;
7418         if (expr->base.parenthesized)
7419                 return;
7420         source_position_t const *const pos = &expr->base.source_position;
7421         warningf(WARN_PARENTHESES, pos, "suggest parentheses around assignment used as truth value");
7422 }
7423
7424 static void semantic_condition(expression_t const *const expr,
7425                                char const *const context)
7426 {
7427         type_t *const type = skip_typeref(expr->base.type);
7428         if (is_type_scalar(type)) {
7429                 warn_reference_address_as_bool(expr);
7430                 warn_assignment_in_condition(expr);
7431         } else if (is_type_valid(type)) {
7432                 errorf(&expr->base.source_position,
7433                                 "%s must have scalar type", context);
7434         }
7435 }
7436
7437 /**
7438  * Parse a conditional expression, ie. 'expression ? ... : ...'.
7439  *
7440  * @param expression  the conditional expression
7441  */
7442 static expression_t *parse_conditional_expression(expression_t *expression)
7443 {
7444         expression_t *result = allocate_expression_zero(EXPR_CONDITIONAL);
7445
7446         conditional_expression_t *conditional = &result->conditional;
7447         conditional->condition                = expression;
7448
7449         eat('?');
7450         add_anchor_token(':');
7451
7452         /* §6.5.15:2  The first operand shall have scalar type. */
7453         semantic_condition(expression, "condition of conditional operator");
7454
7455         expression_t *true_expression = expression;
7456         bool          gnu_cond = false;
7457         if (GNU_MODE && token.kind == ':') {
7458                 gnu_cond = true;
7459         } else {
7460                 true_expression = parse_expression();
7461         }
7462         rem_anchor_token(':');
7463         expect(':', end_error);
7464 end_error:;
7465         expression_t *false_expression =
7466                 parse_subexpression(c_mode & _CXX ? PREC_ASSIGNMENT : PREC_CONDITIONAL);
7467
7468         type_t *const orig_true_type  = true_expression->base.type;
7469         type_t *const orig_false_type = false_expression->base.type;
7470         type_t *const true_type       = skip_typeref(orig_true_type);
7471         type_t *const false_type      = skip_typeref(orig_false_type);
7472
7473         /* 6.5.15.3 */
7474         source_position_t const *const pos = &conditional->base.source_position;
7475         type_t                        *result_type;
7476         if (is_type_atomic(true_type,  ATOMIC_TYPE_VOID) ||
7477                         is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
7478                 /* ISO/IEC 14882:1998(E) §5.16:2 */
7479                 if (true_expression->kind == EXPR_UNARY_THROW) {
7480                         result_type = false_type;
7481                 } else if (false_expression->kind == EXPR_UNARY_THROW) {
7482                         result_type = true_type;
7483                 } else {
7484                         if (!is_type_atomic(true_type,  ATOMIC_TYPE_VOID) ||
7485                             !is_type_atomic(false_type, ATOMIC_TYPE_VOID)) {
7486                                 warningf(WARN_OTHER, pos, "ISO C forbids conditional expression with only one void side");
7487                         }
7488                         result_type = type_void;
7489                 }
7490         } else if (is_type_arithmetic(true_type)
7491                    && is_type_arithmetic(false_type)) {
7492                 result_type = semantic_arithmetic(true_type, false_type);
7493         } else if (same_compound_type(true_type, false_type)) {
7494                 /* just take 1 of the 2 types */
7495                 result_type = true_type;
7496         } else if (is_type_pointer(true_type) || is_type_pointer(false_type)) {
7497                 type_t *pointer_type;
7498                 type_t *other_type;
7499                 expression_t *other_expression;
7500                 if (is_type_pointer(true_type) &&
7501                                 (!is_type_pointer(false_type) || is_null_pointer_constant(false_expression))) {
7502                         pointer_type     = true_type;
7503                         other_type       = false_type;
7504                         other_expression = false_expression;
7505                 } else {
7506                         pointer_type     = false_type;
7507                         other_type       = true_type;
7508                         other_expression = true_expression;
7509                 }
7510
7511                 if (is_null_pointer_constant(other_expression)) {
7512                         result_type = pointer_type;
7513                 } else if (is_type_pointer(other_type)) {
7514                         type_t *to1 = skip_typeref(pointer_type->pointer.points_to);
7515                         type_t *to2 = skip_typeref(other_type->pointer.points_to);
7516
7517                         type_t *to;
7518                         if (is_type_atomic(to1, ATOMIC_TYPE_VOID) ||
7519                             is_type_atomic(to2, ATOMIC_TYPE_VOID)) {
7520                                 to = type_void;
7521                         } else if (types_compatible(get_unqualified_type(to1),
7522                                                     get_unqualified_type(to2))) {
7523                                 to = to1;
7524                         } else {
7525                                 warningf(WARN_OTHER, pos, "pointer types '%T' and '%T' in conditional expression are incompatible", true_type, false_type);
7526                                 to = type_void;
7527                         }
7528
7529                         type_t *const type =
7530                                 get_qualified_type(to, to1->base.qualifiers | to2->base.qualifiers);
7531                         result_type = make_pointer_type(type, TYPE_QUALIFIER_NONE);
7532                 } else if (is_type_integer(other_type)) {
7533                         warningf(WARN_OTHER, pos, "pointer/integer type mismatch in conditional expression ('%T' and '%T')", true_type, false_type);
7534                         result_type = pointer_type;
7535                 } else {
7536                         goto types_incompatible;
7537                 }
7538         } else {
7539 types_incompatible:
7540                 if (is_type_valid(true_type) && is_type_valid(false_type)) {
7541                         type_error_incompatible("while parsing conditional", pos, true_type, false_type);
7542                 }
7543                 result_type = type_error_type;
7544         }
7545
7546         conditional->true_expression
7547                 = gnu_cond ? NULL : create_implicit_cast(true_expression, result_type);
7548         conditional->false_expression
7549                 = create_implicit_cast(false_expression, result_type);
7550         conditional->base.type = result_type;
7551         return result;
7552 }
7553
7554 /**
7555  * Parse an extension expression.
7556  */
7557 static expression_t *parse_extension(void)
7558 {
7559         PUSH_EXTENSION();
7560         expression_t *expression = parse_subexpression(PREC_UNARY);
7561         POP_EXTENSION();
7562         return expression;
7563 }
7564
7565 /**
7566  * Parse a __builtin_classify_type() expression.
7567  */
7568 static expression_t *parse_builtin_classify_type(void)
7569 {
7570         expression_t *result = allocate_expression_zero(EXPR_CLASSIFY_TYPE);
7571         result->base.type    = type_int;
7572
7573         eat(T___builtin_classify_type);
7574
7575         expect('(', end_error);
7576         add_anchor_token(')');
7577         expression_t *expression = parse_expression();
7578         rem_anchor_token(')');
7579         expect(')', end_error);
7580         result->classify_type.type_expression = expression;
7581
7582         return result;
7583 end_error:
7584         return create_error_expression();
7585 }
7586
7587 /**
7588  * Parse a delete expression
7589  * ISO/IEC 14882:1998(E) §5.3.5
7590  */
7591 static expression_t *parse_delete(void)
7592 {
7593         expression_t *const result = allocate_expression_zero(EXPR_UNARY_DELETE);
7594         result->base.type          = type_void;
7595
7596         eat(T_delete);
7597
7598         if (next_if('[')) {
7599                 result->kind = EXPR_UNARY_DELETE_ARRAY;
7600                 expect(']', end_error);
7601 end_error:;
7602         }
7603
7604         expression_t *const value = parse_subexpression(PREC_CAST);
7605         result->unary.value = value;
7606
7607         type_t *const type = skip_typeref(value->base.type);
7608         if (!is_type_pointer(type)) {
7609                 if (is_type_valid(type)) {
7610                         errorf(&value->base.source_position,
7611                                         "operand of delete must have pointer type");
7612                 }
7613         } else if (is_type_atomic(skip_typeref(type->pointer.points_to), ATOMIC_TYPE_VOID)) {
7614                 source_position_t const *const pos = &value->base.source_position;
7615                 warningf(WARN_OTHER, pos, "deleting 'void*' is undefined");
7616         }
7617
7618         return result;
7619 }
7620
7621 /**
7622  * Parse a throw expression
7623  * ISO/IEC 14882:1998(E) §15:1
7624  */
7625 static expression_t *parse_throw(void)
7626 {
7627         expression_t *const result = allocate_expression_zero(EXPR_UNARY_THROW);
7628         result->base.type          = type_void;
7629
7630         eat(T_throw);
7631
7632         expression_t *value = NULL;
7633         switch (token.kind) {
7634                 EXPRESSION_START {
7635                         value = parse_assignment_expression();
7636                         /* ISO/IEC 14882:1998(E) §15.1:3 */
7637                         type_t *const orig_type = value->base.type;
7638                         type_t *const type      = skip_typeref(orig_type);
7639                         if (is_type_incomplete(type)) {
7640                                 errorf(&value->base.source_position,
7641                                                 "cannot throw object of incomplete type '%T'", orig_type);
7642                         } else if (is_type_pointer(type)) {
7643                                 type_t *const points_to = skip_typeref(type->pointer.points_to);
7644                                 if (is_type_incomplete(points_to) &&
7645                                                 !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7646                                         errorf(&value->base.source_position,
7647                                                         "cannot throw pointer to incomplete type '%T'", orig_type);
7648                                 }
7649                         }
7650                 }
7651
7652                 default:
7653                         break;
7654         }
7655         result->unary.value = value;
7656
7657         return result;
7658 }
7659
7660 static bool check_pointer_arithmetic(const source_position_t *source_position,
7661                                      type_t *pointer_type,
7662                                      type_t *orig_pointer_type)
7663 {
7664         type_t *points_to = pointer_type->pointer.points_to;
7665         points_to = skip_typeref(points_to);
7666
7667         if (is_type_incomplete(points_to)) {
7668                 if (!GNU_MODE || !is_type_atomic(points_to, ATOMIC_TYPE_VOID)) {
7669                         errorf(source_position,
7670                                "arithmetic with pointer to incomplete type '%T' not allowed",
7671                                orig_pointer_type);
7672                         return false;
7673                 } else {
7674                         warningf(WARN_POINTER_ARITH, source_position, "pointer of type '%T' used in arithmetic", orig_pointer_type);
7675                 }
7676         } else if (is_type_function(points_to)) {
7677                 if (!GNU_MODE) {
7678                         errorf(source_position,
7679                                "arithmetic with pointer to function type '%T' not allowed",
7680                                orig_pointer_type);
7681                         return false;
7682                 } else {
7683                         warningf(WARN_POINTER_ARITH, source_position, "pointer to a function '%T' used in arithmetic", orig_pointer_type);
7684                 }
7685         }
7686         return true;
7687 }
7688
7689 static bool is_lvalue(const expression_t *expression)
7690 {
7691         /* TODO: doesn't seem to be consistent with §6.3.2.1:1 */
7692         switch (expression->kind) {
7693         case EXPR_ARRAY_ACCESS:
7694         case EXPR_COMPOUND_LITERAL:
7695         case EXPR_REFERENCE:
7696         case EXPR_SELECT:
7697         case EXPR_UNARY_DEREFERENCE:
7698                 return true;
7699
7700         default: {
7701                 type_t *type = skip_typeref(expression->base.type);
7702                 return
7703                         /* ISO/IEC 14882:1998(E) §3.10:3 */
7704                         is_type_reference(type) ||
7705                         /* Claim it is an lvalue, if the type is invalid.  There was a parse
7706                          * error before, which maybe prevented properly recognizing it as
7707                          * lvalue. */
7708                         !is_type_valid(type);
7709         }
7710         }
7711 }
7712
7713 static void semantic_incdec(unary_expression_t *expression)
7714 {
7715         type_t *const orig_type = expression->value->base.type;
7716         type_t *const type      = skip_typeref(orig_type);
7717         if (is_type_pointer(type)) {
7718                 if (!check_pointer_arithmetic(&expression->base.source_position,
7719                                               type, orig_type)) {
7720                         return;
7721                 }
7722         } else if (!is_type_real(type) && is_type_valid(type)) {
7723                 /* TODO: improve error message */
7724                 errorf(&expression->base.source_position,
7725                        "operation needs an arithmetic or pointer type");
7726                 return;
7727         }
7728         if (!is_lvalue(expression->value)) {
7729                 /* TODO: improve error message */
7730                 errorf(&expression->base.source_position, "lvalue required as operand");
7731         }
7732         expression->base.type = orig_type;
7733 }
7734
7735 static void promote_unary_int_expr(unary_expression_t *const expr, type_t *const type)
7736 {
7737         type_t *const res_type = promote_integer(type);
7738         expr->base.type = res_type;
7739         expr->value     = create_implicit_cast(expr->value, res_type);
7740 }
7741
7742 static void semantic_unexpr_arithmetic(unary_expression_t *expression)
7743 {
7744         type_t *const orig_type = expression->value->base.type;
7745         type_t *const type      = skip_typeref(orig_type);
7746         if (!is_type_arithmetic(type)) {
7747                 if (is_type_valid(type)) {
7748                         /* TODO: improve error message */
7749                         errorf(&expression->base.source_position,
7750                                 "operation needs an arithmetic type");
7751                 }
7752                 return;
7753         } else if (is_type_integer(type)) {
7754                 promote_unary_int_expr(expression, type);
7755         } else {
7756                 expression->base.type = orig_type;
7757         }
7758 }
7759
7760 static void semantic_unexpr_plus(unary_expression_t *expression)
7761 {
7762         semantic_unexpr_arithmetic(expression);
7763         source_position_t const *const pos = &expression->base.source_position;
7764         warningf(WARN_TRADITIONAL, pos, "traditional C rejects the unary plus operator");
7765 }
7766
7767 static void semantic_not(unary_expression_t *expression)
7768 {
7769         /* §6.5.3.3:1  The operand [...] of the ! operator, scalar type. */
7770         semantic_condition(expression->value, "operand of !");
7771         expression->base.type = c_mode & _CXX ? type_bool : type_int;
7772 }
7773
7774 static void semantic_unexpr_integer(unary_expression_t *expression)
7775 {
7776         type_t *const orig_type = expression->value->base.type;
7777         type_t *const type      = skip_typeref(orig_type);
7778         if (!is_type_integer(type)) {
7779                 if (is_type_valid(type)) {
7780                         errorf(&expression->base.source_position,
7781                                "operand of ~ must be of integer type");
7782                 }
7783                 return;
7784         }
7785
7786         promote_unary_int_expr(expression, type);
7787 }
7788
7789 static void semantic_dereference(unary_expression_t *expression)
7790 {
7791         type_t *const orig_type = expression->value->base.type;
7792         type_t *const type      = skip_typeref(orig_type);
7793         if (!is_type_pointer(type)) {
7794                 if (is_type_valid(type)) {
7795                         errorf(&expression->base.source_position,
7796                                "Unary '*' needs pointer or array type, but type '%T' given", orig_type);
7797                 }
7798                 return;
7799         }
7800
7801         type_t *result_type   = type->pointer.points_to;
7802         result_type           = automatic_type_conversion(result_type);
7803         expression->base.type = result_type;
7804 }
7805
7806 /**
7807  * Record that an address is taken (expression represents an lvalue).
7808  *
7809  * @param expression       the expression
7810  * @param may_be_register  if true, the expression might be an register
7811  */
7812 static void set_address_taken(expression_t *expression, bool may_be_register)
7813 {
7814         if (expression->kind != EXPR_REFERENCE)
7815                 return;
7816
7817         entity_t *const entity = expression->reference.entity;
7818
7819         if (entity->kind != ENTITY_VARIABLE && entity->kind != ENTITY_PARAMETER)
7820                 return;
7821
7822         if (entity->declaration.storage_class == STORAGE_CLASS_REGISTER
7823                         && !may_be_register) {
7824                 source_position_t const *const pos = &expression->base.source_position;
7825                 errorf(pos, "address of register '%N' requested", entity);
7826         }
7827
7828         if (entity->kind == ENTITY_VARIABLE) {
7829                 entity->variable.address_taken = true;
7830         } else {
7831                 assert(entity->kind == ENTITY_PARAMETER);
7832                 entity->parameter.address_taken = true;
7833         }
7834 }
7835
7836 /**
7837  * Check the semantic of the address taken expression.
7838  */
7839 static void semantic_take_addr(unary_expression_t *expression)
7840 {
7841         expression_t *value = expression->value;
7842         value->base.type    = revert_automatic_type_conversion(value);
7843
7844         type_t *orig_type = value->base.type;
7845         type_t *type      = skip_typeref(orig_type);
7846         if (!is_type_valid(type))
7847                 return;
7848
7849         /* §6.5.3.2 */
7850         if (!is_lvalue(value)) {
7851                 errorf(&expression->base.source_position, "'&' requires an lvalue");
7852         }
7853         if (is_bitfield(value)) {
7854                 errorf(&expression->base.source_position,
7855                        "'&' not allowed on bitfield");
7856         }
7857
7858         set_address_taken(value, false);
7859
7860         expression->base.type = make_pointer_type(orig_type, TYPE_QUALIFIER_NONE);
7861 }
7862
7863 #define CREATE_UNARY_EXPRESSION_PARSER(token_kind, unexpression_type, sfunc) \
7864 static expression_t *parse_##unexpression_type(void)                         \
7865 {                                                                            \
7866         expression_t *unary_expression                                           \
7867                 = allocate_expression_zero(unexpression_type);                       \
7868         eat(token_kind);                                                         \
7869         unary_expression->unary.value = parse_subexpression(PREC_UNARY);         \
7870                                                                                  \
7871         sfunc(&unary_expression->unary);                                         \
7872                                                                                  \
7873         return unary_expression;                                                 \
7874 }
7875
7876 CREATE_UNARY_EXPRESSION_PARSER('-', EXPR_UNARY_NEGATE,
7877                                semantic_unexpr_arithmetic)
7878 CREATE_UNARY_EXPRESSION_PARSER('+', EXPR_UNARY_PLUS,
7879                                semantic_unexpr_plus)
7880 CREATE_UNARY_EXPRESSION_PARSER('!', EXPR_UNARY_NOT,
7881                                semantic_not)
7882 CREATE_UNARY_EXPRESSION_PARSER('*', EXPR_UNARY_DEREFERENCE,
7883                                semantic_dereference)
7884 CREATE_UNARY_EXPRESSION_PARSER('&', EXPR_UNARY_TAKE_ADDRESS,
7885                                semantic_take_addr)
7886 CREATE_UNARY_EXPRESSION_PARSER('~', EXPR_UNARY_BITWISE_NEGATE,
7887                                semantic_unexpr_integer)
7888 CREATE_UNARY_EXPRESSION_PARSER(T_PLUSPLUS,   EXPR_UNARY_PREFIX_INCREMENT,
7889                                semantic_incdec)
7890 CREATE_UNARY_EXPRESSION_PARSER(T_MINUSMINUS, EXPR_UNARY_PREFIX_DECREMENT,
7891                                semantic_incdec)
7892
7893 #define CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(token_kind, unexpression_type, \
7894                                                sfunc)                         \
7895 static expression_t *parse_##unexpression_type(expression_t *left)            \
7896 {                                                                             \
7897         expression_t *unary_expression                                            \
7898                 = allocate_expression_zero(unexpression_type);                        \
7899         eat(token_kind);                                                          \
7900         unary_expression->unary.value = left;                                     \
7901                                                                                   \
7902         sfunc(&unary_expression->unary);                                          \
7903                                                                               \
7904         return unary_expression;                                                  \
7905 }
7906
7907 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_PLUSPLUS,
7908                                        EXPR_UNARY_POSTFIX_INCREMENT,
7909                                        semantic_incdec)
7910 CREATE_UNARY_POSTFIX_EXPRESSION_PARSER(T_MINUSMINUS,
7911                                        EXPR_UNARY_POSTFIX_DECREMENT,
7912                                        semantic_incdec)
7913
7914 static type_t *semantic_arithmetic(type_t *type_left, type_t *type_right)
7915 {
7916         /* TODO: handle complex + imaginary types */
7917
7918         type_left  = get_unqualified_type(type_left);
7919         type_right = get_unqualified_type(type_right);
7920
7921         /* §6.3.1.8 Usual arithmetic conversions */
7922         if (type_left == type_long_double || type_right == type_long_double) {
7923                 return type_long_double;
7924         } else if (type_left == type_double || type_right == type_double) {
7925                 return type_double;
7926         } else if (type_left == type_float || type_right == type_float) {
7927                 return type_float;
7928         }
7929
7930         type_left  = promote_integer(type_left);
7931         type_right = promote_integer(type_right);
7932
7933         if (type_left == type_right)
7934                 return type_left;
7935
7936         bool     const signed_left  = is_type_signed(type_left);
7937         bool     const signed_right = is_type_signed(type_right);
7938         unsigned const rank_left    = get_akind_rank(get_akind(type_left));
7939         unsigned const rank_right   = get_akind_rank(get_akind(type_right));
7940
7941         if (signed_left == signed_right)
7942                 return rank_left >= rank_right ? type_left : type_right;
7943
7944         unsigned           s_rank;
7945         unsigned           u_rank;
7946         atomic_type_kind_t s_akind;
7947         atomic_type_kind_t u_akind;
7948         type_t *s_type;
7949         type_t *u_type;
7950         if (signed_left) {
7951                 s_type = type_left;
7952                 u_type = type_right;
7953         } else {
7954                 s_type = type_right;
7955                 u_type = type_left;
7956         }
7957         s_akind = get_akind(s_type);
7958         u_akind = get_akind(u_type);
7959         s_rank  = get_akind_rank(s_akind);
7960         u_rank  = get_akind_rank(u_akind);
7961
7962         if (u_rank >= s_rank)
7963                 return u_type;
7964
7965         if (get_atomic_type_size(s_akind) > get_atomic_type_size(u_akind))
7966                 return s_type;
7967
7968         switch (s_akind) {
7969         case ATOMIC_TYPE_INT:      return type_unsigned_int;
7970         case ATOMIC_TYPE_LONG:     return type_unsigned_long;
7971         case ATOMIC_TYPE_LONGLONG: return type_unsigned_long_long;
7972
7973         default: panic("invalid atomic type");
7974         }
7975 }
7976
7977 /**
7978  * Check the semantic restrictions for a binary expression.
7979  */
7980 static void semantic_binexpr_arithmetic(binary_expression_t *expression)
7981 {
7982         expression_t *const left            = expression->left;
7983         expression_t *const right           = expression->right;
7984         type_t       *const orig_type_left  = left->base.type;
7985         type_t       *const orig_type_right = right->base.type;
7986         type_t       *const type_left       = skip_typeref(orig_type_left);
7987         type_t       *const type_right      = skip_typeref(orig_type_right);
7988
7989         if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
7990                 /* TODO: improve error message */
7991                 if (is_type_valid(type_left) && is_type_valid(type_right)) {
7992                         errorf(&expression->base.source_position,
7993                                "operation needs arithmetic types");
7994                 }
7995                 return;
7996         }
7997
7998         type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
7999         expression->left      = create_implicit_cast(left, arithmetic_type);
8000         expression->right     = create_implicit_cast(right, arithmetic_type);
8001         expression->base.type = arithmetic_type;
8002 }
8003
8004 static void semantic_binexpr_integer(binary_expression_t *const expression)
8005 {
8006         expression_t *const left            = expression->left;
8007         expression_t *const right           = expression->right;
8008         type_t       *const orig_type_left  = left->base.type;
8009         type_t       *const orig_type_right = right->base.type;
8010         type_t       *const type_left       = skip_typeref(orig_type_left);
8011         type_t       *const type_right      = skip_typeref(orig_type_right);
8012
8013         if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8014                 /* TODO: improve error message */
8015                 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8016                         errorf(&expression->base.source_position,
8017                                "operation needs integer types");
8018                 }
8019                 return;
8020         }
8021
8022         type_t *const result_type = semantic_arithmetic(type_left, type_right);
8023         expression->left      = create_implicit_cast(left, result_type);
8024         expression->right     = create_implicit_cast(right, result_type);
8025         expression->base.type = result_type;
8026 }
8027
8028 static void warn_div_by_zero(binary_expression_t const *const expression)
8029 {
8030         if (!is_type_integer(expression->base.type))
8031                 return;
8032
8033         expression_t const *const right = expression->right;
8034         /* The type of the right operand can be different for /= */
8035         if (is_type_integer(right->base.type)                    &&
8036             is_constant_expression(right) == EXPR_CLASS_CONSTANT &&
8037             !fold_constant_to_bool(right)) {
8038                 source_position_t const *const pos = &expression->base.source_position;
8039                 warningf(WARN_DIV_BY_ZERO, pos, "division by zero");
8040         }
8041 }
8042
8043 /**
8044  * Check the semantic restrictions for a div/mod expression.
8045  */
8046 static void semantic_divmod_arithmetic(binary_expression_t *expression)
8047 {
8048         semantic_binexpr_arithmetic(expression);
8049         warn_div_by_zero(expression);
8050 }
8051
8052 static void warn_addsub_in_shift(const expression_t *const expr)
8053 {
8054         if (expr->base.parenthesized)
8055                 return;
8056
8057         char op;
8058         switch (expr->kind) {
8059                 case EXPR_BINARY_ADD: op = '+'; break;
8060                 case EXPR_BINARY_SUB: op = '-'; break;
8061                 default:              return;
8062         }
8063
8064         source_position_t const *const pos = &expr->base.source_position;
8065         warningf(WARN_PARENTHESES, pos, "suggest parentheses around '%c' inside shift", op);
8066 }
8067
8068 static bool semantic_shift(binary_expression_t *expression)
8069 {
8070         expression_t *const left            = expression->left;
8071         expression_t *const right           = expression->right;
8072         type_t       *const orig_type_left  = left->base.type;
8073         type_t       *const orig_type_right = right->base.type;
8074         type_t       *      type_left       = skip_typeref(orig_type_left);
8075         type_t       *      type_right      = skip_typeref(orig_type_right);
8076
8077         if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8078                 /* TODO: improve error message */
8079                 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8080                         errorf(&expression->base.source_position,
8081                                "operands of shift operation must have integer types");
8082                 }
8083                 return false;
8084         }
8085
8086         type_left = promote_integer(type_left);
8087
8088         if (is_constant_expression(right) == EXPR_CLASS_CONSTANT) {
8089                 source_position_t const *const pos   = &right->base.source_position;
8090                 long                     const count = fold_constant_to_int(right);
8091                 if (count < 0) {
8092                         warningf(WARN_OTHER, pos, "shift count must be non-negative");
8093                 } else if ((unsigned long)count >=
8094                                 get_atomic_type_size(type_left->atomic.akind) * 8) {
8095                         warningf(WARN_OTHER, pos, "shift count must be less than type width");
8096                 }
8097         }
8098
8099         type_right        = promote_integer(type_right);
8100         expression->right = create_implicit_cast(right, type_right);
8101
8102         return true;
8103 }
8104
8105 static void semantic_shift_op(binary_expression_t *expression)
8106 {
8107         expression_t *const left  = expression->left;
8108         expression_t *const right = expression->right;
8109
8110         if (!semantic_shift(expression))
8111                 return;
8112
8113         warn_addsub_in_shift(left);
8114         warn_addsub_in_shift(right);
8115
8116         type_t *const orig_type_left = left->base.type;
8117         type_t *      type_left      = skip_typeref(orig_type_left);
8118
8119         type_left             = promote_integer(type_left);
8120         expression->left      = create_implicit_cast(left, type_left);
8121         expression->base.type = type_left;
8122 }
8123
8124 static void semantic_add(binary_expression_t *expression)
8125 {
8126         expression_t *const left            = expression->left;
8127         expression_t *const right           = expression->right;
8128         type_t       *const orig_type_left  = left->base.type;
8129         type_t       *const orig_type_right = right->base.type;
8130         type_t       *const type_left       = skip_typeref(orig_type_left);
8131         type_t       *const type_right      = skip_typeref(orig_type_right);
8132
8133         /* §6.5.6 */
8134         if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8135                 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8136                 expression->left  = create_implicit_cast(left, arithmetic_type);
8137                 expression->right = create_implicit_cast(right, arithmetic_type);
8138                 expression->base.type = arithmetic_type;
8139         } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8140                 check_pointer_arithmetic(&expression->base.source_position,
8141                                          type_left, orig_type_left);
8142                 expression->base.type = type_left;
8143         } else if (is_type_pointer(type_right) && is_type_integer(type_left)) {
8144                 check_pointer_arithmetic(&expression->base.source_position,
8145                                          type_right, orig_type_right);
8146                 expression->base.type = type_right;
8147         } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8148                 errorf(&expression->base.source_position,
8149                        "invalid operands to binary + ('%T', '%T')",
8150                        orig_type_left, orig_type_right);
8151         }
8152 }
8153
8154 static void semantic_sub(binary_expression_t *expression)
8155 {
8156         expression_t            *const left            = expression->left;
8157         expression_t            *const right           = expression->right;
8158         type_t                  *const orig_type_left  = left->base.type;
8159         type_t                  *const orig_type_right = right->base.type;
8160         type_t                  *const type_left       = skip_typeref(orig_type_left);
8161         type_t                  *const type_right      = skip_typeref(orig_type_right);
8162         source_position_t const *const pos             = &expression->base.source_position;
8163
8164         /* §5.6.5 */
8165         if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8166                 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8167                 expression->left        = create_implicit_cast(left, arithmetic_type);
8168                 expression->right       = create_implicit_cast(right, arithmetic_type);
8169                 expression->base.type =  arithmetic_type;
8170         } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8171                 check_pointer_arithmetic(&expression->base.source_position,
8172                                          type_left, orig_type_left);
8173                 expression->base.type = type_left;
8174         } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8175                 type_t *const unqual_left  = get_unqualified_type(skip_typeref(type_left->pointer.points_to));
8176                 type_t *const unqual_right = get_unqualified_type(skip_typeref(type_right->pointer.points_to));
8177                 if (!types_compatible(unqual_left, unqual_right)) {
8178                         errorf(pos,
8179                                "subtracting pointers to incompatible types '%T' and '%T'",
8180                                orig_type_left, orig_type_right);
8181                 } else if (!is_type_object(unqual_left)) {
8182                         if (!is_type_atomic(unqual_left, ATOMIC_TYPE_VOID)) {
8183                                 errorf(pos, "subtracting pointers to non-object types '%T'",
8184                                        orig_type_left);
8185                         } else {
8186                                 warningf(WARN_OTHER, pos, "subtracting pointers to void");
8187                         }
8188                 }
8189                 expression->base.type = type_ptrdiff_t;
8190         } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8191                 errorf(pos, "invalid operands of types '%T' and '%T' to binary '-'",
8192                        orig_type_left, orig_type_right);
8193         }
8194 }
8195
8196 static void warn_string_literal_address(expression_t const* expr)
8197 {
8198         while (expr->kind == EXPR_UNARY_TAKE_ADDRESS) {
8199                 expr = expr->unary.value;
8200                 if (expr->kind != EXPR_UNARY_DEREFERENCE)
8201                         return;
8202                 expr = expr->unary.value;
8203         }
8204
8205         if (expr->kind == EXPR_STRING_LITERAL
8206                         || expr->kind == EXPR_WIDE_STRING_LITERAL) {
8207                 source_position_t const *const pos = &expr->base.source_position;
8208                 warningf(WARN_ADDRESS, pos, "comparison with string literal results in unspecified behaviour");
8209         }
8210 }
8211
8212 static bool maybe_negative(expression_t const *const expr)
8213 {
8214         switch (is_constant_expression(expr)) {
8215                 case EXPR_CLASS_ERROR:    return false;
8216                 case EXPR_CLASS_CONSTANT: return constant_is_negative(expr);
8217                 default:                  return true;
8218         }
8219 }
8220
8221 static void warn_comparison(source_position_t const *const pos, expression_t const *const expr, expression_t const *const other)
8222 {
8223         warn_string_literal_address(expr);
8224
8225         expression_t const* const ref = get_reference_address(expr);
8226         if (ref != NULL && is_null_pointer_constant(other)) {
8227                 entity_t const *const ent = ref->reference.entity;
8228                 warningf(WARN_ADDRESS, pos, "the address of '%N' will never be NULL", ent);
8229         }
8230
8231         if (!expr->base.parenthesized) {
8232                 switch (expr->base.kind) {
8233                         case EXPR_BINARY_LESS:
8234                         case EXPR_BINARY_GREATER:
8235                         case EXPR_BINARY_LESSEQUAL:
8236                         case EXPR_BINARY_GREATEREQUAL:
8237                         case EXPR_BINARY_NOTEQUAL:
8238                         case EXPR_BINARY_EQUAL:
8239                                 warningf(WARN_PARENTHESES, pos, "comparisons like 'x <= y < z' do not have their mathematical meaning");
8240                                 break;
8241                         default:
8242                                 break;
8243                 }
8244         }
8245 }
8246
8247 /**
8248  * Check the semantics of comparison expressions.
8249  *
8250  * @param expression   The expression to check.
8251  */
8252 static void semantic_comparison(binary_expression_t *expression)
8253 {
8254         source_position_t const *const pos   = &expression->base.source_position;
8255         expression_t            *const left  = expression->left;
8256         expression_t            *const right = expression->right;
8257
8258         warn_comparison(pos, left, right);
8259         warn_comparison(pos, right, left);
8260
8261         type_t *orig_type_left  = left->base.type;
8262         type_t *orig_type_right = right->base.type;
8263         type_t *type_left       = skip_typeref(orig_type_left);
8264         type_t *type_right      = skip_typeref(orig_type_right);
8265
8266         /* TODO non-arithmetic types */
8267         if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8268                 type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8269
8270                 /* test for signed vs unsigned compares */
8271                 if (is_type_integer(arithmetic_type)) {
8272                         bool const signed_left  = is_type_signed(type_left);
8273                         bool const signed_right = is_type_signed(type_right);
8274                         if (signed_left != signed_right) {
8275                                 /* FIXME long long needs better const folding magic */
8276                                 /* TODO check whether constant value can be represented by other type */
8277                                 if ((signed_left  && maybe_negative(left)) ||
8278                                                 (signed_right && maybe_negative(right))) {
8279                                         warningf(WARN_SIGN_COMPARE, pos, "comparison between signed and unsigned");
8280                                 }
8281                         }
8282                 }
8283
8284                 expression->left        = create_implicit_cast(left, arithmetic_type);
8285                 expression->right       = create_implicit_cast(right, arithmetic_type);
8286                 expression->base.type   = arithmetic_type;
8287                 if ((expression->base.kind == EXPR_BINARY_EQUAL ||
8288                      expression->base.kind == EXPR_BINARY_NOTEQUAL) &&
8289                     is_type_float(arithmetic_type)) {
8290                         warningf(WARN_FLOAT_EQUAL, pos, "comparing floating point with == or != is unsafe");
8291                 }
8292         } else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
8293                 /* TODO check compatibility */
8294         } else if (is_type_pointer(type_left)) {
8295                 expression->right = create_implicit_cast(right, type_left);
8296         } else if (is_type_pointer(type_right)) {
8297                 expression->left = create_implicit_cast(left, type_right);
8298         } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8299                 type_error_incompatible("invalid operands in comparison", pos, type_left, type_right);
8300         }
8301         expression->base.type = c_mode & _CXX ? type_bool : type_int;
8302 }
8303
8304 /**
8305  * Checks if a compound type has constant fields.
8306  */
8307 static bool has_const_fields(const compound_type_t *type)
8308 {
8309         compound_t *compound = type->compound;
8310         entity_t   *entry    = compound->members.entities;
8311
8312         for (; entry != NULL; entry = entry->base.next) {
8313                 if (!is_declaration(entry))
8314                         continue;
8315
8316                 const type_t *decl_type = skip_typeref(entry->declaration.type);
8317                 if (decl_type->base.qualifiers & TYPE_QUALIFIER_CONST)
8318                         return true;
8319         }
8320
8321         return false;
8322 }
8323
8324 static bool is_valid_assignment_lhs(expression_t const* const left)
8325 {
8326         type_t *const orig_type_left = revert_automatic_type_conversion(left);
8327         type_t *const type_left      = skip_typeref(orig_type_left);
8328
8329         if (!is_lvalue(left)) {
8330                 errorf(&left->base.source_position, "left hand side '%E' of assignment is not an lvalue",
8331                        left);
8332                 return false;
8333         }
8334
8335         if (left->kind == EXPR_REFERENCE
8336                         && left->reference.entity->kind == ENTITY_FUNCTION) {
8337                 errorf(&left->base.source_position, "cannot assign to function '%E'", left);
8338                 return false;
8339         }
8340
8341         if (is_type_array(type_left)) {
8342                 errorf(&left->base.source_position, "cannot assign to array '%E'", left);
8343                 return false;
8344         }
8345         if (type_left->base.qualifiers & TYPE_QUALIFIER_CONST) {
8346                 errorf(&left->base.source_position, "assignment to read-only location '%E' (type '%T')", left,
8347                        orig_type_left);
8348                 return false;
8349         }
8350         if (is_type_incomplete(type_left)) {
8351                 errorf(&left->base.source_position, "left-hand side '%E' of assignment has incomplete type '%T'",
8352                        left, orig_type_left);
8353                 return false;
8354         }
8355         if (is_type_compound(type_left) && has_const_fields(&type_left->compound)) {
8356                 errorf(&left->base.source_position, "cannot assign to '%E' because compound type '%T' has read-only fields",
8357                        left, orig_type_left);
8358                 return false;
8359         }
8360
8361         return true;
8362 }
8363
8364 static void semantic_arithmetic_assign(binary_expression_t *expression)
8365 {
8366         expression_t *left            = expression->left;
8367         expression_t *right           = expression->right;
8368         type_t       *orig_type_left  = left->base.type;
8369         type_t       *orig_type_right = right->base.type;
8370
8371         if (!is_valid_assignment_lhs(left))
8372                 return;
8373
8374         type_t *type_left  = skip_typeref(orig_type_left);
8375         type_t *type_right = skip_typeref(orig_type_right);
8376
8377         if (!is_type_arithmetic(type_left) || !is_type_arithmetic(type_right)) {
8378                 /* TODO: improve error message */
8379                 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8380                         errorf(&expression->base.source_position,
8381                                "operation needs arithmetic types");
8382                 }
8383                 return;
8384         }
8385
8386         /* combined instructions are tricky. We can't create an implicit cast on
8387          * the left side, because we need the uncasted form for the store.
8388          * The ast2firm pass has to know that left_type must be right_type
8389          * for the arithmetic operation and create a cast by itself */
8390         type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8391         expression->right       = create_implicit_cast(right, arithmetic_type);
8392         expression->base.type   = type_left;
8393 }
8394
8395 static void semantic_divmod_assign(binary_expression_t *expression)
8396 {
8397         semantic_arithmetic_assign(expression);
8398         warn_div_by_zero(expression);
8399 }
8400
8401 static void semantic_arithmetic_addsubb_assign(binary_expression_t *expression)
8402 {
8403         expression_t *const left            = expression->left;
8404         expression_t *const right           = expression->right;
8405         type_t       *const orig_type_left  = left->base.type;
8406         type_t       *const orig_type_right = right->base.type;
8407         type_t       *const type_left       = skip_typeref(orig_type_left);
8408         type_t       *const type_right      = skip_typeref(orig_type_right);
8409
8410         if (!is_valid_assignment_lhs(left))
8411                 return;
8412
8413         if (is_type_arithmetic(type_left) && is_type_arithmetic(type_right)) {
8414                 /* combined instructions are tricky. We can't create an implicit cast on
8415                  * the left side, because we need the uncasted form for the store.
8416                  * The ast2firm pass has to know that left_type must be right_type
8417                  * for the arithmetic operation and create a cast by itself */
8418                 type_t *const arithmetic_type = semantic_arithmetic(type_left, type_right);
8419                 expression->right     = create_implicit_cast(right, arithmetic_type);
8420                 expression->base.type = type_left;
8421         } else if (is_type_pointer(type_left) && is_type_integer(type_right)) {
8422                 check_pointer_arithmetic(&expression->base.source_position,
8423                                          type_left, orig_type_left);
8424                 expression->base.type = type_left;
8425         } else if (is_type_valid(type_left) && is_type_valid(type_right)) {
8426                 errorf(&expression->base.source_position,
8427                        "incompatible types '%T' and '%T' in assignment",
8428                        orig_type_left, orig_type_right);
8429         }
8430 }
8431
8432 static void semantic_integer_assign(binary_expression_t *expression)
8433 {
8434         expression_t *left            = expression->left;
8435         expression_t *right           = expression->right;
8436         type_t       *orig_type_left  = left->base.type;
8437         type_t       *orig_type_right = right->base.type;
8438
8439         if (!is_valid_assignment_lhs(left))
8440                 return;
8441
8442         type_t *type_left  = skip_typeref(orig_type_left);
8443         type_t *type_right = skip_typeref(orig_type_right);
8444
8445         if (!is_type_integer(type_left) || !is_type_integer(type_right)) {
8446                 /* TODO: improve error message */
8447                 if (is_type_valid(type_left) && is_type_valid(type_right)) {
8448                         errorf(&expression->base.source_position,
8449                                "operation needs integer types");
8450                 }
8451                 return;
8452         }
8453
8454         /* combined instructions are tricky. We can't create an implicit cast on
8455          * the left side, because we need the uncasted form for the store.
8456          * The ast2firm pass has to know that left_type must be right_type
8457          * for the arithmetic operation and create a cast by itself */
8458         type_t *arithmetic_type = semantic_arithmetic(type_left, type_right);
8459         expression->right       = create_implicit_cast(right, arithmetic_type);
8460         expression->base.type   = type_left;
8461 }
8462
8463 static void semantic_shift_assign(binary_expression_t *expression)
8464 {
8465         expression_t *left           = expression->left;
8466
8467         if (!is_valid_assignment_lhs(left))
8468                 return;
8469
8470         if (!semantic_shift(expression))
8471                 return;
8472
8473         expression->base.type = skip_typeref(left->base.type);
8474 }
8475
8476 static void warn_logical_and_within_or(const expression_t *const expr)
8477 {
8478         if (expr->base.kind != EXPR_BINARY_LOGICAL_AND)
8479                 return;
8480         if (expr->base.parenthesized)
8481                 return;
8482         source_position_t const *const pos = &expr->base.source_position;
8483         warningf(WARN_PARENTHESES, pos, "suggest parentheses around && within ||");
8484 }
8485
8486 /**
8487  * Check the semantic restrictions of a logical expression.
8488  */
8489 static void semantic_logical_op(binary_expression_t *expression)
8490 {
8491         /* §6.5.13:2  Each of the operands shall have scalar type.
8492          * §6.5.14:2  Each of the operands shall have scalar type. */
8493         semantic_condition(expression->left,   "left operand of logical operator");
8494         semantic_condition(expression->right, "right operand of logical operator");
8495         if (expression->base.kind == EXPR_BINARY_LOGICAL_OR) {
8496                 warn_logical_and_within_or(expression->left);
8497                 warn_logical_and_within_or(expression->right);
8498         }
8499         expression->base.type = c_mode & _CXX ? type_bool : type_int;
8500 }
8501
8502 /**
8503  * Check the semantic restrictions of a binary assign expression.
8504  */
8505 static void semantic_binexpr_assign(binary_expression_t *expression)
8506 {
8507         expression_t *left           = expression->left;
8508         type_t       *orig_type_left = left->base.type;
8509
8510         if (!is_valid_assignment_lhs(left))
8511                 return;
8512
8513         assign_error_t error = semantic_assign(orig_type_left, expression->right);
8514         report_assign_error(error, orig_type_left, expression->right,
8515                         "assignment", &left->base.source_position);
8516         expression->right = create_implicit_cast(expression->right, orig_type_left);
8517         expression->base.type = orig_type_left;
8518 }
8519
8520 /**
8521  * Determine if the outermost operation (or parts thereof) of the given
8522  * expression has no effect in order to generate a warning about this fact.
8523  * Therefore in some cases this only examines some of the operands of the
8524  * expression (see comments in the function and examples below).
8525  * Examples:
8526  *   f() + 23;    // warning, because + has no effect
8527  *   x || f();    // no warning, because x controls execution of f()
8528  *   x ? y : f(); // warning, because y has no effect
8529  *   (void)x;     // no warning to be able to suppress the warning
8530  * This function can NOT be used for an "expression has definitely no effect"-
8531  * analysis. */
8532 static bool expression_has_effect(const expression_t *const expr)
8533 {
8534         switch (expr->kind) {
8535                 case EXPR_ERROR:                      return true; /* do NOT warn */
8536                 case EXPR_REFERENCE:                  return false;
8537                 case EXPR_REFERENCE_ENUM_VALUE:       return false;
8538                 case EXPR_LABEL_ADDRESS:              return false;
8539
8540                 /* suppress the warning for microsoft __noop operations */
8541                 case EXPR_LITERAL_MS_NOOP:            return true;
8542                 case EXPR_LITERAL_BOOLEAN:
8543                 case EXPR_LITERAL_CHARACTER:
8544                 case EXPR_LITERAL_WIDE_CHARACTER:
8545                 case EXPR_LITERAL_INTEGER:
8546                 case EXPR_LITERAL_INTEGER_OCTAL:
8547                 case EXPR_LITERAL_INTEGER_HEXADECIMAL:
8548                 case EXPR_LITERAL_FLOATINGPOINT:
8549                 case EXPR_LITERAL_FLOATINGPOINT_HEXADECIMAL: return false;
8550                 case EXPR_STRING_LITERAL:             return false;
8551                 case EXPR_WIDE_STRING_LITERAL:        return false;
8552
8553                 case EXPR_CALL: {
8554                         const call_expression_t *const call = &expr->call;
8555                         if (call->function->kind != EXPR_REFERENCE)
8556                                 return true;
8557
8558                         switch (call->function->reference.entity->function.btk) {
8559                                 /* FIXME: which builtins have no effect? */
8560                                 default:                      return true;
8561                         }
8562                 }
8563
8564                 /* Generate the warning if either the left or right hand side of a
8565                  * conditional expression has no effect */
8566                 case EXPR_CONDITIONAL: {
8567                         conditional_expression_t const *const cond = &expr->conditional;
8568                         expression_t             const *const t    = cond->true_expression;
8569                         return
8570                                 (t == NULL || expression_has_effect(t)) &&
8571                                 expression_has_effect(cond->false_expression);
8572                 }
8573
8574                 case EXPR_SELECT:                     return false;
8575                 case EXPR_ARRAY_ACCESS:               return false;
8576                 case EXPR_SIZEOF:                     return false;
8577                 case EXPR_CLASSIFY_TYPE:              return false;
8578                 case EXPR_ALIGNOF:                    return false;
8579
8580                 case EXPR_FUNCNAME:                   return false;
8581                 case EXPR_BUILTIN_CONSTANT_P:         return false;
8582                 case EXPR_BUILTIN_TYPES_COMPATIBLE_P: return false;
8583                 case EXPR_OFFSETOF:                   return false;
8584                 case EXPR_VA_START:                   return true;
8585                 case EXPR_VA_ARG:                     return true;
8586                 case EXPR_VA_COPY:                    return true;
8587                 case EXPR_STATEMENT:                  return true; // TODO
8588                 case EXPR_COMPOUND_LITERAL:           return false;
8589
8590                 case EXPR_UNARY_NEGATE:               return false;
8591                 case EXPR_UNARY_PLUS:                 return false;
8592                 case EXPR_UNARY_BITWISE_NEGATE:       return false;
8593                 case EXPR_UNARY_NOT:                  return false;
8594                 case EXPR_UNARY_DEREFERENCE:          return false;
8595                 case EXPR_UNARY_TAKE_ADDRESS:         return false;
8596                 case EXPR_UNARY_POSTFIX_INCREMENT:    return true;
8597                 case EXPR_UNARY_POSTFIX_DECREMENT:    return true;
8598                 case EXPR_UNARY_PREFIX_INCREMENT:     return true;
8599                 case EXPR_UNARY_PREFIX_DECREMENT:     return true;
8600
8601                 /* Treat void casts as if they have an effect in order to being able to
8602                  * suppress the warning */
8603                 case EXPR_UNARY_CAST: {
8604                         type_t *const type = skip_typeref(expr->base.type);
8605                         return is_type_atomic(type, ATOMIC_TYPE_VOID);
8606                 }
8607
8608                 case EXPR_UNARY_ASSUME:               return true;
8609                 case EXPR_UNARY_DELETE:               return true;
8610                 case EXPR_UNARY_DELETE_ARRAY:         return true;
8611                 case EXPR_UNARY_THROW:                return true;
8612
8613                 case EXPR_BINARY_ADD:                 return false;
8614                 case EXPR_BINARY_SUB:                 return false;
8615                 case EXPR_BINARY_MUL:                 return false;
8616                 case EXPR_BINARY_DIV:                 return false;
8617                 case EXPR_BINARY_MOD:                 return false;
8618                 case EXPR_BINARY_EQUAL:               return false;
8619                 case EXPR_BINARY_NOTEQUAL:            return false;
8620                 case EXPR_BINARY_LESS:                return false;
8621                 case EXPR_BINARY_LESSEQUAL:           return false;
8622                 case EXPR_BINARY_GREATER:             return false;
8623                 case EXPR_BINARY_GREATEREQUAL:        return false;
8624                 case EXPR_BINARY_BITWISE_AND:         return false;
8625                 case EXPR_BINARY_BITWISE_OR:          return false;
8626                 case EXPR_BINARY_BITWISE_XOR:         return false;
8627                 case EXPR_BINARY_SHIFTLEFT:           return false;
8628                 case EXPR_BINARY_SHIFTRIGHT:          return false;
8629                 case EXPR_BINARY_ASSIGN:              return true;
8630                 case EXPR_BINARY_MUL_ASSIGN:          return true;
8631                 case EXPR_BINARY_DIV_ASSIGN:          return true;
8632                 case EXPR_BINARY_MOD_ASSIGN:          return true;
8633                 case EXPR_BINARY_ADD_ASSIGN:          return true;
8634                 case EXPR_BINARY_SUB_ASSIGN:          return true;
8635                 case EXPR_BINARY_SHIFTLEFT_ASSIGN:    return true;
8636                 case EXPR_BINARY_SHIFTRIGHT_ASSIGN:   return true;
8637                 case EXPR_BINARY_BITWISE_AND_ASSIGN:  return true;
8638                 case EXPR_BINARY_BITWISE_XOR_ASSIGN:  return true;
8639                 case EXPR_BINARY_BITWISE_OR_ASSIGN:   return true;
8640
8641                 /* Only examine the right hand side of && and ||, because the left hand
8642                  * side already has the effect of controlling the execution of the right
8643                  * hand side */
8644                 case EXPR_BINARY_LOGICAL_AND:
8645                 case EXPR_BINARY_LOGICAL_OR:
8646                 /* Only examine the right hand side of a comma expression, because the left
8647                  * hand side has a separate warning */
8648                 case EXPR_BINARY_COMMA:
8649                         return expression_has_effect(expr->binary.right);
8650
8651                 case EXPR_BINARY_ISGREATER:           return false;
8652                 case EXPR_BINARY_ISGREATEREQUAL:      return false;
8653                 case EXPR_BINARY_ISLESS:              return false;
8654                 case EXPR_BINARY_ISLESSEQUAL:         return false;
8655                 case EXPR_BINARY_ISLESSGREATER:       return false;
8656                 case EXPR_BINARY_ISUNORDERED:         return false;
8657         }
8658
8659         internal_errorf(HERE, "unexpected expression");
8660 }
8661
8662 static void semantic_comma(binary_expression_t *expression)
8663 {
8664         const expression_t *const left = expression->left;
8665         if (!expression_has_effect(left)) {
8666                 source_position_t const *const pos = &left->base.source_position;
8667                 warningf(WARN_UNUSED_VALUE, pos, "left-hand operand of comma expression has no effect");
8668         }
8669         expression->base.type = expression->right->base.type;
8670 }
8671
8672 /**
8673  * @param prec_r precedence of the right operand
8674  */
8675 #define CREATE_BINEXPR_PARSER(token_kind, binexpression_type, prec_r, sfunc) \
8676 static expression_t *parse_##binexpression_type(expression_t *left)          \
8677 {                                                                            \
8678         expression_t *binexpr = allocate_expression_zero(binexpression_type);    \
8679         binexpr->binary.left  = left;                                            \
8680         eat(token_kind);                                                         \
8681                                                                              \
8682         expression_t *right = parse_subexpression(prec_r);                       \
8683                                                                              \
8684         binexpr->binary.right = right;                                           \
8685         sfunc(&binexpr->binary);                                                 \
8686                                                                              \
8687         return binexpr;                                                          \
8688 }
8689
8690 CREATE_BINEXPR_PARSER('*',                    EXPR_BINARY_MUL,                PREC_CAST,           semantic_binexpr_arithmetic)
8691 CREATE_BINEXPR_PARSER('/',                    EXPR_BINARY_DIV,                PREC_CAST,           semantic_divmod_arithmetic)
8692 CREATE_BINEXPR_PARSER('%',                    EXPR_BINARY_MOD,                PREC_CAST,           semantic_divmod_arithmetic)
8693 CREATE_BINEXPR_PARSER('+',                    EXPR_BINARY_ADD,                PREC_MULTIPLICATIVE, semantic_add)
8694 CREATE_BINEXPR_PARSER('-',                    EXPR_BINARY_SUB,                PREC_MULTIPLICATIVE, semantic_sub)
8695 CREATE_BINEXPR_PARSER(T_LESSLESS,             EXPR_BINARY_SHIFTLEFT,          PREC_ADDITIVE,       semantic_shift_op)
8696 CREATE_BINEXPR_PARSER(T_GREATERGREATER,       EXPR_BINARY_SHIFTRIGHT,         PREC_ADDITIVE,       semantic_shift_op)
8697 CREATE_BINEXPR_PARSER('<',                    EXPR_BINARY_LESS,               PREC_SHIFT,          semantic_comparison)
8698 CREATE_BINEXPR_PARSER('>',                    EXPR_BINARY_GREATER,            PREC_SHIFT,          semantic_comparison)
8699 CREATE_BINEXPR_PARSER(T_LESSEQUAL,            EXPR_BINARY_LESSEQUAL,          PREC_SHIFT,          semantic_comparison)
8700 CREATE_BINEXPR_PARSER(T_GREATEREQUAL,         EXPR_BINARY_GREATEREQUAL,       PREC_SHIFT,          semantic_comparison)
8701 CREATE_BINEXPR_PARSER(T_EXCLAMATIONMARKEQUAL, EXPR_BINARY_NOTEQUAL,           PREC_RELATIONAL,     semantic_comparison)
8702 CREATE_BINEXPR_PARSER(T_EQUALEQUAL,           EXPR_BINARY_EQUAL,              PREC_RELATIONAL,     semantic_comparison)
8703 CREATE_BINEXPR_PARSER('&',                    EXPR_BINARY_BITWISE_AND,        PREC_EQUALITY,       semantic_binexpr_integer)
8704 CREATE_BINEXPR_PARSER('^',                    EXPR_BINARY_BITWISE_XOR,        PREC_AND,            semantic_binexpr_integer)
8705 CREATE_BINEXPR_PARSER('|',                    EXPR_BINARY_BITWISE_OR,         PREC_XOR,            semantic_binexpr_integer)
8706 CREATE_BINEXPR_PARSER(T_ANDAND,               EXPR_BINARY_LOGICAL_AND,        PREC_OR,             semantic_logical_op)
8707 CREATE_BINEXPR_PARSER(T_PIPEPIPE,             EXPR_BINARY_LOGICAL_OR,         PREC_LOGICAL_AND,    semantic_logical_op)
8708 CREATE_BINEXPR_PARSER('=',                    EXPR_BINARY_ASSIGN,             PREC_ASSIGNMENT,     semantic_binexpr_assign)
8709 CREATE_BINEXPR_PARSER(T_PLUSEQUAL,            EXPR_BINARY_ADD_ASSIGN,         PREC_ASSIGNMENT,     semantic_arithmetic_addsubb_assign)
8710 CREATE_BINEXPR_PARSER(T_MINUSEQUAL,           EXPR_BINARY_SUB_ASSIGN,         PREC_ASSIGNMENT,     semantic_arithmetic_addsubb_assign)
8711 CREATE_BINEXPR_PARSER(T_ASTERISKEQUAL,        EXPR_BINARY_MUL_ASSIGN,         PREC_ASSIGNMENT,     semantic_arithmetic_assign)
8712 CREATE_BINEXPR_PARSER(T_SLASHEQUAL,           EXPR_BINARY_DIV_ASSIGN,         PREC_ASSIGNMENT,     semantic_divmod_assign)
8713 CREATE_BINEXPR_PARSER(T_PERCENTEQUAL,         EXPR_BINARY_MOD_ASSIGN,         PREC_ASSIGNMENT,     semantic_divmod_assign)
8714 CREATE_BINEXPR_PARSER(T_LESSLESSEQUAL,        EXPR_BINARY_SHIFTLEFT_ASSIGN,   PREC_ASSIGNMENT,     semantic_shift_assign)
8715 CREATE_BINEXPR_PARSER(T_GREATERGREATEREQUAL,  EXPR_BINARY_SHIFTRIGHT_ASSIGN,  PREC_ASSIGNMENT,     semantic_shift_assign)
8716 CREATE_BINEXPR_PARSER(T_ANDEQUAL,             EXPR_BINARY_BITWISE_AND_ASSIGN, PREC_ASSIGNMENT,     semantic_integer_assign)
8717 CREATE_BINEXPR_PARSER(T_PIPEEQUAL,            EXPR_BINARY_BITWISE_OR_ASSIGN,  PREC_ASSIGNMENT,     semantic_integer_assign)
8718 CREATE_BINEXPR_PARSER(T_CARETEQUAL,           EXPR_BINARY_BITWISE_XOR_ASSIGN, PREC_ASSIGNMENT,     semantic_integer_assign)
8719 CREATE_BINEXPR_PARSER(',',                    EXPR_BINARY_COMMA,              PREC_ASSIGNMENT,     semantic_comma)
8720
8721
8722 static expression_t *parse_subexpression(precedence_t precedence)
8723 {
8724         if (token.kind < 0) {
8725                 return expected_expression_error();
8726         }
8727
8728         expression_parser_function_t *parser
8729                 = &expression_parsers[token.kind];
8730         expression_t                 *left;
8731
8732         if (parser->parser != NULL) {
8733                 left = parser->parser();
8734         } else {
8735                 left = parse_primary_expression();
8736         }
8737         assert(left != NULL);
8738
8739         while (true) {
8740                 if (token.kind < 0) {
8741                         return expected_expression_error();
8742                 }
8743
8744                 parser = &expression_parsers[token.kind];
8745                 if (parser->infix_parser == NULL)
8746                         break;
8747                 if (parser->infix_precedence < precedence)
8748                         break;
8749
8750                 left = parser->infix_parser(left);
8751
8752                 assert(left != NULL);
8753         }
8754
8755         return left;
8756 }
8757
8758 /**
8759  * Parse an expression.
8760  */
8761 static expression_t *parse_expression(void)
8762 {
8763         return parse_subexpression(PREC_EXPRESSION);
8764 }
8765
8766 /**
8767  * Register a parser for a prefix-like operator.
8768  *
8769  * @param parser      the parser function
8770  * @param token_kind  the token type of the prefix token
8771  */
8772 static void register_expression_parser(parse_expression_function parser,
8773                                        int token_kind)
8774 {
8775         expression_parser_function_t *entry = &expression_parsers[token_kind];
8776
8777         if (entry->parser != NULL) {
8778                 diagnosticf("for token '%k'\n", (token_kind_t)token_kind);
8779                 panic("trying to register multiple expression parsers for a token");
8780         }
8781         entry->parser = parser;
8782 }
8783
8784 /**
8785  * Register a parser for an infix operator with given precedence.
8786  *
8787  * @param parser      the parser function
8788  * @param token_kind  the token type of the infix operator
8789  * @param precedence  the precedence of the operator
8790  */
8791 static void register_infix_parser(parse_expression_infix_function parser,
8792                                   int token_kind, precedence_t precedence)
8793 {
8794         expression_parser_function_t *entry = &expression_parsers[token_kind];
8795
8796         if (entry->infix_parser != NULL) {
8797                 diagnosticf("for token '%k'\n", (token_kind_t)token_kind);
8798                 panic("trying to register multiple infix expression parsers for a "
8799                       "token");
8800         }
8801         entry->infix_parser     = parser;
8802         entry->infix_precedence = precedence;
8803 }
8804
8805 /**
8806  * Initialize the expression parsers.
8807  */
8808 static void init_expression_parsers(void)
8809 {
8810         memset(&expression_parsers, 0, sizeof(expression_parsers));
8811
8812         register_infix_parser(parse_array_expression,               '[',                    PREC_POSTFIX);
8813         register_infix_parser(parse_call_expression,                '(',                    PREC_POSTFIX);
8814         register_infix_parser(parse_select_expression,              '.',                    PREC_POSTFIX);
8815         register_infix_parser(parse_select_expression,              T_MINUSGREATER,         PREC_POSTFIX);
8816         register_infix_parser(parse_EXPR_UNARY_POSTFIX_INCREMENT,   T_PLUSPLUS,             PREC_POSTFIX);
8817         register_infix_parser(parse_EXPR_UNARY_POSTFIX_DECREMENT,   T_MINUSMINUS,           PREC_POSTFIX);
8818         register_infix_parser(parse_EXPR_BINARY_MUL,                '*',                    PREC_MULTIPLICATIVE);
8819         register_infix_parser(parse_EXPR_BINARY_DIV,                '/',                    PREC_MULTIPLICATIVE);
8820         register_infix_parser(parse_EXPR_BINARY_MOD,                '%',                    PREC_MULTIPLICATIVE);
8821         register_infix_parser(parse_EXPR_BINARY_ADD,                '+',                    PREC_ADDITIVE);
8822         register_infix_parser(parse_EXPR_BINARY_SUB,                '-',                    PREC_ADDITIVE);
8823         register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT,          T_LESSLESS,             PREC_SHIFT);
8824         register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT,         T_GREATERGREATER,       PREC_SHIFT);
8825         register_infix_parser(parse_EXPR_BINARY_LESS,               '<',                    PREC_RELATIONAL);
8826         register_infix_parser(parse_EXPR_BINARY_GREATER,            '>',                    PREC_RELATIONAL);
8827         register_infix_parser(parse_EXPR_BINARY_LESSEQUAL,          T_LESSEQUAL,            PREC_RELATIONAL);
8828         register_infix_parser(parse_EXPR_BINARY_GREATEREQUAL,       T_GREATEREQUAL,         PREC_RELATIONAL);
8829         register_infix_parser(parse_EXPR_BINARY_EQUAL,              T_EQUALEQUAL,           PREC_EQUALITY);
8830         register_infix_parser(parse_EXPR_BINARY_NOTEQUAL,           T_EXCLAMATIONMARKEQUAL, PREC_EQUALITY);
8831         register_infix_parser(parse_EXPR_BINARY_BITWISE_AND,        '&',                    PREC_AND);
8832         register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR,        '^',                    PREC_XOR);
8833         register_infix_parser(parse_EXPR_BINARY_BITWISE_OR,         '|',                    PREC_OR);
8834         register_infix_parser(parse_EXPR_BINARY_LOGICAL_AND,        T_ANDAND,               PREC_LOGICAL_AND);
8835         register_infix_parser(parse_EXPR_BINARY_LOGICAL_OR,         T_PIPEPIPE,             PREC_LOGICAL_OR);
8836         register_infix_parser(parse_conditional_expression,         '?',                    PREC_CONDITIONAL);
8837         register_infix_parser(parse_EXPR_BINARY_ASSIGN,             '=',                    PREC_ASSIGNMENT);
8838         register_infix_parser(parse_EXPR_BINARY_ADD_ASSIGN,         T_PLUSEQUAL,            PREC_ASSIGNMENT);
8839         register_infix_parser(parse_EXPR_BINARY_SUB_ASSIGN,         T_MINUSEQUAL,           PREC_ASSIGNMENT);
8840         register_infix_parser(parse_EXPR_BINARY_MUL_ASSIGN,         T_ASTERISKEQUAL,        PREC_ASSIGNMENT);
8841         register_infix_parser(parse_EXPR_BINARY_DIV_ASSIGN,         T_SLASHEQUAL,           PREC_ASSIGNMENT);
8842         register_infix_parser(parse_EXPR_BINARY_MOD_ASSIGN,         T_PERCENTEQUAL,         PREC_ASSIGNMENT);
8843         register_infix_parser(parse_EXPR_BINARY_SHIFTLEFT_ASSIGN,   T_LESSLESSEQUAL,        PREC_ASSIGNMENT);
8844         register_infix_parser(parse_EXPR_BINARY_SHIFTRIGHT_ASSIGN,  T_GREATERGREATEREQUAL,  PREC_ASSIGNMENT);
8845         register_infix_parser(parse_EXPR_BINARY_BITWISE_AND_ASSIGN, T_ANDEQUAL,             PREC_ASSIGNMENT);
8846         register_infix_parser(parse_EXPR_BINARY_BITWISE_OR_ASSIGN,  T_PIPEEQUAL,            PREC_ASSIGNMENT);
8847         register_infix_parser(parse_EXPR_BINARY_BITWISE_XOR_ASSIGN, T_CARETEQUAL,           PREC_ASSIGNMENT);
8848         register_infix_parser(parse_EXPR_BINARY_COMMA,              ',',                    PREC_EXPRESSION);
8849
8850         register_expression_parser(parse_EXPR_UNARY_NEGATE,           '-');
8851         register_expression_parser(parse_EXPR_UNARY_PLUS,             '+');
8852         register_expression_parser(parse_EXPR_UNARY_NOT,              '!');
8853         register_expression_parser(parse_EXPR_UNARY_BITWISE_NEGATE,   '~');
8854         register_expression_parser(parse_EXPR_UNARY_DEREFERENCE,      '*');
8855         register_expression_parser(parse_EXPR_UNARY_TAKE_ADDRESS,     '&');
8856         register_expression_parser(parse_EXPR_UNARY_PREFIX_INCREMENT, T_PLUSPLUS);
8857         register_expression_parser(parse_EXPR_UNARY_PREFIX_DECREMENT, T_MINUSMINUS);
8858         register_expression_parser(parse_sizeof,                      T_sizeof);
8859         register_expression_parser(parse_alignof,                     T___alignof__);
8860         register_expression_parser(parse_extension,                   T___extension__);
8861         register_expression_parser(parse_builtin_classify_type,       T___builtin_classify_type);
8862         register_expression_parser(parse_delete,                      T_delete);
8863         register_expression_parser(parse_throw,                       T_throw);
8864 }
8865
8866 /**
8867  * Parse a asm statement arguments specification.
8868  */
8869 static asm_argument_t *parse_asm_arguments(bool is_out)
8870 {
8871         asm_argument_t  *result = NULL;
8872         asm_argument_t **anchor = &result;
8873
8874         while (token.kind == T_STRING_LITERAL || token.kind == '[') {
8875                 asm_argument_t *argument = allocate_ast_zero(sizeof(argument[0]));
8876                 memset(argument, 0, sizeof(argument[0]));
8877
8878                 if (next_if('[')) {
8879                         if (token.kind != T_IDENTIFIER) {
8880                                 parse_error_expected("while parsing asm argument",
8881                                                      T_IDENTIFIER, NULL);
8882                                 return NULL;
8883                         }
8884                         argument->symbol = token.identifier.symbol;
8885
8886                         expect(']', end_error);
8887                 }
8888
8889                 argument->constraints = parse_string_literals();
8890                 expect('(', end_error);
8891                 add_anchor_token(')');
8892                 expression_t *expression = parse_expression();
8893                 rem_anchor_token(')');
8894                 if (is_out) {
8895                         /* Ugly GCC stuff: Allow lvalue casts.  Skip casts, when they do not
8896                          * change size or type representation (e.g. int -> long is ok, but
8897                          * int -> float is not) */
8898                         if (expression->kind == EXPR_UNARY_CAST) {
8899                                 type_t      *const type = expression->base.type;
8900                                 type_kind_t  const kind = type->kind;
8901                                 if (kind == TYPE_ATOMIC || kind == TYPE_POINTER) {
8902                                         unsigned flags;
8903                                         unsigned size;
8904                                         if (kind == TYPE_ATOMIC) {
8905                                                 atomic_type_kind_t const akind = type->atomic.akind;
8906                                                 flags = get_atomic_type_flags(akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8907                                                 size  = get_atomic_type_size(akind);
8908                                         } else {
8909                                                 flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8910                                                 size  = get_type_size(type_void_ptr);
8911                                         }
8912
8913                                         do {
8914                                                 expression_t *const value      = expression->unary.value;
8915                                                 type_t       *const value_type = value->base.type;
8916                                                 type_kind_t   const value_kind = value_type->kind;
8917
8918                                                 unsigned value_flags;
8919                                                 unsigned value_size;
8920                                                 if (value_kind == TYPE_ATOMIC) {
8921                                                         atomic_type_kind_t const value_akind = value_type->atomic.akind;
8922                                                         value_flags = get_atomic_type_flags(value_akind) & ~ATOMIC_TYPE_FLAG_SIGNED;
8923                                                         value_size  = get_atomic_type_size(value_akind);
8924                                                 } else if (value_kind == TYPE_POINTER) {
8925                                                         value_flags = ATOMIC_TYPE_FLAG_INTEGER | ATOMIC_TYPE_FLAG_ARITHMETIC;
8926                                                         value_size  = get_type_size(type_void_ptr);
8927                                                 } else {
8928                                                         break;
8929                                                 }
8930
8931                                                 if (value_flags != flags || value_size != size)
8932                                                         break;
8933
8934                                                 expression = value;
8935                                         } while (expression->kind == EXPR_UNARY_CAST);
8936                                 }
8937                         }
8938
8939                         if (!is_lvalue(expression)) {
8940                                 errorf(&expression->base.source_position,
8941                                        "asm output argument is not an lvalue");
8942                         }
8943
8944                         if (argument->constraints.begin[0] == '=')
8945                                 determine_lhs_ent(expression, NULL);
8946                         else
8947                                 mark_vars_read(expression, NULL);
8948                 } else {
8949                         mark_vars_read(expression, NULL);
8950                 }
8951                 argument->expression = expression;
8952                 expect(')', end_error);
8953
8954                 set_address_taken(expression, true);
8955
8956                 *anchor = argument;
8957                 anchor  = &argument->next;
8958
8959                 if (!next_if(','))
8960                         break;
8961         }
8962
8963         return result;
8964 end_error:
8965         return NULL;
8966 }
8967
8968 /**
8969  * Parse a asm statement clobber specification.
8970  */
8971 static asm_clobber_t *parse_asm_clobbers(void)
8972 {
8973         asm_clobber_t *result  = NULL;
8974         asm_clobber_t **anchor = &result;
8975
8976         while (token.kind == T_STRING_LITERAL) {
8977                 asm_clobber_t *clobber = allocate_ast_zero(sizeof(clobber[0]));
8978                 clobber->clobber       = parse_string_literals();
8979
8980                 *anchor = clobber;
8981                 anchor  = &clobber->next;
8982
8983                 if (!next_if(','))
8984                         break;
8985         }
8986
8987         return result;
8988 }
8989
8990 /**
8991  * Parse an asm statement.
8992  */
8993 static statement_t *parse_asm_statement(void)
8994 {
8995         statement_t     *statement     = allocate_statement_zero(STATEMENT_ASM);
8996         asm_statement_t *asm_statement = &statement->asms;
8997
8998         eat(T_asm);
8999
9000         if (next_if(T_volatile))
9001                 asm_statement->is_volatile = true;
9002
9003         expect('(', end_error);
9004         add_anchor_token(')');
9005         if (token.kind != T_STRING_LITERAL) {
9006                 parse_error_expected("after asm(", T_STRING_LITERAL, NULL);
9007                 goto end_of_asm;
9008         }
9009         asm_statement->asm_text = parse_string_literals();
9010
9011         add_anchor_token(':');
9012         if (!next_if(':')) {
9013                 rem_anchor_token(':');
9014                 goto end_of_asm;
9015         }
9016
9017         asm_statement->outputs = parse_asm_arguments(true);
9018         if (!next_if(':')) {
9019                 rem_anchor_token(':');
9020                 goto end_of_asm;
9021         }
9022
9023         asm_statement->inputs = parse_asm_arguments(false);
9024         if (!next_if(':')) {
9025                 rem_anchor_token(':');
9026                 goto end_of_asm;
9027         }
9028         rem_anchor_token(':');
9029
9030         asm_statement->clobbers = parse_asm_clobbers();
9031
9032 end_of_asm:
9033         rem_anchor_token(')');
9034         expect(')', end_error);
9035         expect(';', end_error);
9036
9037         if (asm_statement->outputs == NULL) {
9038                 /* GCC: An 'asm' instruction without any output operands will be treated
9039                  * identically to a volatile 'asm' instruction. */
9040                 asm_statement->is_volatile = true;
9041         }
9042
9043         return statement;
9044 end_error:
9045         return create_error_statement();
9046 }
9047
9048 static statement_t *parse_label_inner_statement(statement_t const *const label, char const *const label_kind)
9049 {
9050         statement_t *inner_stmt;
9051         switch (token.kind) {
9052                 case '}':
9053                         errorf(&label->base.source_position, "%s at end of compound statement", label_kind);
9054                         inner_stmt = create_error_statement();
9055                         break;
9056
9057                 case ';':
9058                         if (label->kind == STATEMENT_LABEL) {
9059                                 /* Eat an empty statement here, to avoid the warning about an empty
9060                                  * statement after a label.  label:; is commonly used to have a label
9061                                  * before a closing brace. */
9062                                 inner_stmt = create_empty_statement();
9063                                 next_token();
9064                                 break;
9065                         }
9066                         /* FALLTHROUGH */
9067
9068                 default:
9069                         inner_stmt = parse_statement();
9070                         /* ISO/IEC  9899:1999(E) §6.8:1/6.8.2:1  Declarations are no statements */
9071                         /* ISO/IEC 14882:1998(E) §6:1/§6.7       Declarations are statements */
9072                         if (inner_stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
9073                                 errorf(&inner_stmt->base.source_position, "declaration after %s", label_kind);
9074                         }
9075                         break;
9076         }
9077         return inner_stmt;
9078 }
9079
9080 /**
9081  * Parse a case statement.
9082  */
9083 static statement_t *parse_case_statement(void)
9084 {
9085         statement_t       *const statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9086         source_position_t *const pos       = &statement->base.source_position;
9087
9088         eat(T_case);
9089
9090         expression_t *const expression   = parse_expression();
9091         statement->case_label.expression = expression;
9092         expression_classification_t const expr_class = is_constant_expression(expression);
9093         if (expr_class != EXPR_CLASS_CONSTANT) {
9094                 if (expr_class != EXPR_CLASS_ERROR) {
9095                         errorf(pos, "case label does not reduce to an integer constant");
9096                 }
9097                 statement->case_label.is_bad = true;
9098         } else {
9099                 long const val = fold_constant_to_int(expression);
9100                 statement->case_label.first_case = val;
9101                 statement->case_label.last_case  = val;
9102         }
9103
9104         if (GNU_MODE) {
9105                 if (next_if(T_DOTDOTDOT)) {
9106                         expression_t *const end_range   = parse_expression();
9107                         statement->case_label.end_range = end_range;
9108                         expression_classification_t const end_class = is_constant_expression(end_range);
9109                         if (end_class != EXPR_CLASS_CONSTANT) {
9110                                 if (end_class != EXPR_CLASS_ERROR) {
9111                                         errorf(pos, "case range does not reduce to an integer constant");
9112                                 }
9113                                 statement->case_label.is_bad = true;
9114                         } else {
9115                                 long const val = fold_constant_to_int(end_range);
9116                                 statement->case_label.last_case = val;
9117
9118                                 if (val < statement->case_label.first_case) {
9119                                         statement->case_label.is_empty_range = true;
9120                                         warningf(WARN_OTHER, pos, "empty range specified");
9121                                 }
9122                         }
9123                 }
9124         }
9125
9126         PUSH_PARENT(statement);
9127
9128         expect(':', end_error);
9129 end_error:
9130
9131         if (current_switch != NULL) {
9132                 if (! statement->case_label.is_bad) {
9133                         /* Check for duplicate case values */
9134                         case_label_statement_t *c = &statement->case_label;
9135                         for (case_label_statement_t *l = current_switch->first_case; l != NULL; l = l->next) {
9136                                 if (l->is_bad || l->is_empty_range || l->expression == NULL)
9137                                         continue;
9138
9139                                 if (c->last_case < l->first_case || c->first_case > l->last_case)
9140                                         continue;
9141
9142                                 errorf(pos, "duplicate case value (previously used %P)",
9143                                        &l->base.source_position);
9144                                 break;
9145                         }
9146                 }
9147                 /* link all cases into the switch statement */
9148                 if (current_switch->last_case == NULL) {
9149                         current_switch->first_case      = &statement->case_label;
9150                 } else {
9151                         current_switch->last_case->next = &statement->case_label;
9152                 }
9153                 current_switch->last_case = &statement->case_label;
9154         } else {
9155                 errorf(pos, "case label not within a switch statement");
9156         }
9157
9158         statement->case_label.statement = parse_label_inner_statement(statement, "case label");
9159
9160         POP_PARENT();
9161         return statement;
9162 }
9163
9164 /**
9165  * Parse a default statement.
9166  */
9167 static statement_t *parse_default_statement(void)
9168 {
9169         statement_t *statement = allocate_statement_zero(STATEMENT_CASE_LABEL);
9170
9171         eat(T_default);
9172
9173         PUSH_PARENT(statement);
9174
9175         expect(':', end_error);
9176 end_error:
9177
9178         if (current_switch != NULL) {
9179                 const case_label_statement_t *def_label = current_switch->default_label;
9180                 if (def_label != NULL) {
9181                         errorf(&statement->base.source_position, "multiple default labels in one switch (previous declared %P)", &def_label->base.source_position);
9182                 } else {
9183                         current_switch->default_label = &statement->case_label;
9184
9185                         /* link all cases into the switch statement */
9186                         if (current_switch->last_case == NULL) {
9187                                 current_switch->first_case      = &statement->case_label;
9188                         } else {
9189                                 current_switch->last_case->next = &statement->case_label;
9190                         }
9191                         current_switch->last_case = &statement->case_label;
9192                 }
9193         } else {
9194                 errorf(&statement->base.source_position,
9195                         "'default' label not within a switch statement");
9196         }
9197
9198         statement->case_label.statement = parse_label_inner_statement(statement, "default label");
9199
9200         POP_PARENT();
9201         return statement;
9202 }
9203
9204 /**
9205  * Parse a label statement.
9206  */
9207 static statement_t *parse_label_statement(void)
9208 {
9209         statement_t *const statement = allocate_statement_zero(STATEMENT_LABEL);
9210         label_t     *const label     = get_label();
9211         statement->label.label = label;
9212
9213         PUSH_PARENT(statement);
9214
9215         /* if statement is already set then the label is defined twice,
9216          * otherwise it was just mentioned in a goto/local label declaration so far
9217          */
9218         source_position_t const* const pos = &statement->base.source_position;
9219         if (label->statement != NULL) {
9220                 errorf(pos, "duplicate '%N' (declared %P)", (entity_t const*)label, &label->base.source_position);
9221         } else {
9222                 label->base.source_position = *pos;
9223                 label->statement            = statement;
9224         }
9225
9226         eat(':');
9227
9228         if (token.kind == T___attribute__ && !(c_mode & _CXX)) {
9229                 parse_attributes(NULL); // TODO process attributes
9230         }
9231
9232         statement->label.statement = parse_label_inner_statement(statement, "label");
9233
9234         /* remember the labels in a list for later checking */
9235         *label_anchor = &statement->label;
9236         label_anchor  = &statement->label.next;
9237
9238         POP_PARENT();
9239         return statement;
9240 }
9241
9242 static statement_t *parse_inner_statement(void)
9243 {
9244         statement_t *const stmt = parse_statement();
9245         /* ISO/IEC  9899:1999(E) §6.8:1/6.8.2:1  Declarations are no statements */
9246         /* ISO/IEC 14882:1998(E) §6:1/§6.7       Declarations are statements */
9247         if (stmt->kind == STATEMENT_DECLARATION && !(c_mode & _CXX)) {
9248                 errorf(&stmt->base.source_position, "declaration as inner statement, use {}");
9249         }
9250         return stmt;
9251 }
9252
9253 /**
9254  * Parse an if statement.
9255  */
9256 static statement_t *parse_if(void)
9257 {
9258         statement_t *statement = allocate_statement_zero(STATEMENT_IF);
9259
9260         eat(T_if);
9261
9262         PUSH_PARENT(statement);
9263
9264         add_anchor_token('{');
9265
9266         expect('(', end_error);
9267         add_anchor_token(')');
9268         expression_t *const expr = parse_expression();
9269         statement->ifs.condition = expr;
9270         /* §6.8.4.1:1  The controlling expression of an if statement shall have
9271          *             scalar type. */
9272         semantic_condition(expr, "condition of 'if'-statment");
9273         mark_vars_read(expr, NULL);
9274         rem_anchor_token(')');
9275         expect(')', end_error);
9276
9277 end_error:
9278         rem_anchor_token('{');
9279
9280         add_anchor_token(T_else);
9281         statement_t *const true_stmt = parse_inner_statement();
9282         statement->ifs.true_statement = true_stmt;
9283         rem_anchor_token(T_else);
9284
9285         if (true_stmt->kind == STATEMENT_EMPTY) {
9286                 warningf(WARN_EMPTY_BODY, HERE,
9287                         "suggest braces around empty body in an ‘if’ statement");
9288         }
9289
9290         if (next_if(T_else)) {
9291                 statement->ifs.false_statement = parse_inner_statement();
9292
9293                 if (statement->ifs.false_statement->kind == STATEMENT_EMPTY) {
9294                         warningf(WARN_EMPTY_BODY, HERE,
9295                                         "suggest braces around empty body in an ‘if’ statement");
9296                 }
9297         } else if (true_stmt->kind == STATEMENT_IF &&
9298                         true_stmt->ifs.false_statement != NULL) {
9299                 source_position_t const *const pos = &true_stmt->base.source_position;
9300                 warningf(WARN_PARENTHESES, pos, "suggest explicit braces to avoid ambiguous 'else'");
9301         }
9302
9303         POP_PARENT();
9304         return statement;
9305 }
9306
9307 /**
9308  * Check that all enums are handled in a switch.
9309  *
9310  * @param statement  the switch statement to check
9311  */
9312 static void check_enum_cases(const switch_statement_t *statement)
9313 {
9314         if (!is_warn_on(WARN_SWITCH_ENUM))
9315                 return;
9316         const type_t *type = skip_typeref(statement->expression->base.type);
9317         if (! is_type_enum(type))
9318                 return;
9319         const enum_type_t *enumt = &type->enumt;
9320
9321         /* if we have a default, no warnings */
9322         if (statement->default_label != NULL)
9323                 return;
9324
9325         /* FIXME: calculation of value should be done while parsing */
9326         /* TODO: quadratic algorithm here. Change to an n log n one */
9327         long            last_value = -1;
9328         const entity_t *entry      = enumt->enume->base.next;
9329         for (; entry != NULL && entry->kind == ENTITY_ENUM_VALUE;
9330              entry = entry->base.next) {
9331                 const expression_t *expression = entry->enum_value.value;
9332                 long                value      = expression != NULL ? fold_constant_to_int(expression) : last_value + 1;
9333                 bool                found      = false;
9334                 for (const case_label_statement_t *l = statement->first_case; l != NULL; l = l->next) {
9335                         if (l->expression == NULL)
9336                                 continue;
9337                         if (l->first_case <= value && value <= l->last_case) {
9338                                 found = true;
9339                                 break;
9340                         }
9341                 }
9342                 if (!found) {
9343                         source_position_t const *const pos = &statement->base.source_position;
9344                         warningf(WARN_SWITCH_ENUM, pos, "'%N' not handled in switch", entry);
9345                 }
9346                 last_value = value;
9347         }
9348 }
9349
9350 /**
9351  * Parse a switch statement.
9352  */
9353 static statement_t *parse_switch(void)
9354 {
9355         statement_t *statement = allocate_statement_zero(STATEMENT_SWITCH);
9356
9357         eat(T_switch);
9358
9359         PUSH_PARENT(statement);
9360
9361         expect('(', end_error);
9362         add_anchor_token(')');
9363         expression_t *const expr = parse_expression();
9364         mark_vars_read(expr, NULL);
9365         type_t       *      type = skip_typeref(expr->base.type);
9366         if (is_type_integer(type)) {
9367                 type = promote_integer(type);
9368                 if (get_akind_rank(get_akind(type)) >= get_akind_rank(ATOMIC_TYPE_LONG)) {
9369                         warningf(WARN_TRADITIONAL, &expr->base.source_position, "'%T' switch expression not converted to '%T' in ISO C", type, type_int);
9370                 }
9371         } else if (is_type_valid(type)) {
9372                 errorf(&expr->base.source_position,
9373                        "switch quantity is not an integer, but '%T'", type);
9374                 type = type_error_type;
9375         }
9376         statement->switchs.expression = create_implicit_cast(expr, type);
9377         expect(')', end_error);
9378         rem_anchor_token(')');
9379
9380         switch_statement_t *rem = current_switch;
9381         current_switch          = &statement->switchs;
9382         statement->switchs.body = parse_inner_statement();
9383         current_switch          = rem;
9384
9385         if (statement->switchs.default_label == NULL) {
9386                 warningf(WARN_SWITCH_DEFAULT, &statement->base.source_position, "switch has no default case");
9387         }
9388         check_enum_cases(&statement->switchs);
9389
9390         POP_PARENT();
9391         return statement;
9392 end_error:
9393         POP_PARENT();
9394         return create_error_statement();
9395 }
9396
9397 static statement_t *parse_loop_body(statement_t *const loop)
9398 {
9399         statement_t *const rem = current_loop;
9400         current_loop = loop;
9401
9402         statement_t *const body = parse_inner_statement();
9403
9404         current_loop = rem;
9405         return body;
9406 }
9407
9408 /**
9409  * Parse a while statement.
9410  */
9411 static statement_t *parse_while(void)
9412 {
9413         statement_t *statement = allocate_statement_zero(STATEMENT_WHILE);
9414
9415         eat(T_while);
9416
9417         PUSH_PARENT(statement);
9418
9419         expect('(', end_error);
9420         add_anchor_token(')');
9421         expression_t *const cond = parse_expression();
9422         statement->whiles.condition = cond;
9423         /* §6.8.5:2    The controlling expression of an iteration statement shall
9424          *             have scalar type. */
9425         semantic_condition(cond, "condition of 'while'-statement");
9426         mark_vars_read(cond, NULL);
9427         rem_anchor_token(')');
9428         expect(')', end_error);
9429
9430         statement->whiles.body = parse_loop_body(statement);
9431
9432         POP_PARENT();
9433         return statement;
9434 end_error:
9435         POP_PARENT();
9436         return create_error_statement();
9437 }
9438
9439 /**
9440  * Parse a do statement.
9441  */
9442 static statement_t *parse_do(void)
9443 {
9444         statement_t *statement = allocate_statement_zero(STATEMENT_DO_WHILE);
9445
9446         eat(T_do);
9447
9448         PUSH_PARENT(statement);
9449
9450         add_anchor_token(T_while);
9451         statement->do_while.body = parse_loop_body(statement);
9452         rem_anchor_token(T_while);
9453
9454         expect(T_while, end_error);
9455         expect('(', end_error);
9456         add_anchor_token(')');
9457         expression_t *const cond = parse_expression();
9458         statement->do_while.condition = cond;
9459         /* §6.8.5:2    The controlling expression of an iteration statement shall
9460          *             have scalar type. */
9461         semantic_condition(cond, "condition of 'do-while'-statement");
9462         mark_vars_read(cond, NULL);
9463         rem_anchor_token(')');
9464         expect(')', end_error);
9465         expect(';', end_error);
9466
9467         POP_PARENT();
9468         return statement;
9469 end_error:
9470         POP_PARENT();
9471         return create_error_statement();
9472 }
9473
9474 /**
9475  * Parse a for statement.
9476  */
9477 static statement_t *parse_for(void)
9478 {
9479         statement_t *statement = allocate_statement_zero(STATEMENT_FOR);
9480
9481         eat(T_for);
9482
9483         expect('(', end_error1);
9484         add_anchor_token(')');
9485
9486         PUSH_PARENT(statement);
9487         PUSH_SCOPE(&statement->fors.scope);
9488
9489         PUSH_EXTENSION();
9490
9491         if (next_if(';')) {
9492         } else if (is_declaration_specifier(&token)) {
9493                 parse_declaration(record_entity, DECL_FLAGS_NONE);
9494         } else {
9495                 add_anchor_token(';');
9496                 expression_t *const init = parse_expression();
9497                 statement->fors.initialisation = init;
9498                 mark_vars_read(init, ENT_ANY);
9499                 if (!expression_has_effect(init)) {
9500                         warningf(WARN_UNUSED_VALUE, &init->base.source_position, "initialisation of 'for'-statement has no effect");
9501                 }
9502                 rem_anchor_token(';');
9503                 expect(';', end_error2);
9504         }
9505
9506         POP_EXTENSION();
9507
9508         if (token.kind != ';') {
9509                 add_anchor_token(';');
9510                 expression_t *const cond = parse_expression();
9511                 statement->fors.condition = cond;
9512                 /* §6.8.5:2    The controlling expression of an iteration statement
9513                  *             shall have scalar type. */
9514                 semantic_condition(cond, "condition of 'for'-statement");
9515                 mark_vars_read(cond, NULL);
9516                 rem_anchor_token(';');
9517         }
9518         expect(';', end_error2);
9519         if (token.kind != ')') {
9520                 expression_t *const step = parse_expression();
9521                 statement->fors.step = step;
9522                 mark_vars_read(step, ENT_ANY);
9523                 if (!expression_has_effect(step)) {
9524                         warningf(WARN_UNUSED_VALUE, &step->base.source_position, "step of 'for'-statement has no effect");
9525                 }
9526         }
9527         expect(')', end_error2);
9528         rem_anchor_token(')');
9529         statement->fors.body = parse_loop_body(statement);
9530
9531         POP_SCOPE();
9532         POP_PARENT();
9533         return statement;
9534
9535 end_error2:
9536         POP_PARENT();
9537         rem_anchor_token(')');
9538         POP_SCOPE();
9539         /* fallthrough */
9540
9541 end_error1:
9542         return create_error_statement();
9543 }
9544
9545 /**
9546  * Parse a goto statement.
9547  */
9548 static statement_t *parse_goto(void)
9549 {
9550         statement_t *statement = allocate_statement_zero(STATEMENT_GOTO);
9551         eat(T_goto);
9552
9553         if (GNU_MODE && next_if('*')) {
9554                 expression_t *expression = parse_expression();
9555                 mark_vars_read(expression, NULL);
9556
9557                 /* Argh: although documentation says the expression must be of type void*,
9558                  * gcc accepts anything that can be casted into void* without error */
9559                 type_t *type = expression->base.type;
9560
9561                 if (type != type_error_type) {
9562                         if (!is_type_pointer(type) && !is_type_integer(type)) {
9563                                 errorf(&expression->base.source_position,
9564                                         "cannot convert to a pointer type");
9565                         } else if (type != type_void_ptr) {
9566                                 warningf(WARN_OTHER, &expression->base.source_position, "type of computed goto expression should be 'void*' not '%T'", type);
9567                         }
9568                         expression = create_implicit_cast(expression, type_void_ptr);
9569                 }
9570
9571                 statement->gotos.expression = expression;
9572         } else if (token.kind == T_IDENTIFIER) {
9573                 label_t *const label = get_label();
9574                 label->used            = true;
9575                 statement->gotos.label = label;
9576         } else {
9577                 if (GNU_MODE)
9578                         parse_error_expected("while parsing goto", T_IDENTIFIER, '*', NULL);
9579                 else
9580                         parse_error_expected("while parsing goto", T_IDENTIFIER, NULL);
9581                 eat_until_anchor();
9582                 return create_error_statement();
9583         }
9584
9585         /* remember the goto's in a list for later checking */
9586         *goto_anchor = &statement->gotos;
9587         goto_anchor  = &statement->gotos.next;
9588
9589         expect(';', end_error);
9590
9591 end_error:
9592         return statement;
9593 }
9594
9595 /**
9596  * Parse a continue statement.
9597  */
9598 static statement_t *parse_continue(void)
9599 {
9600         if (current_loop == NULL) {
9601                 errorf(HERE, "continue statement not within loop");
9602         }
9603
9604         statement_t *statement = allocate_statement_zero(STATEMENT_CONTINUE);
9605
9606         eat(T_continue);
9607         expect(';', end_error);
9608
9609 end_error:
9610         return statement;
9611 }
9612
9613 /**
9614  * Parse a break statement.
9615  */
9616 static statement_t *parse_break(void)
9617 {
9618         if (current_switch == NULL && current_loop == NULL) {
9619                 errorf(HERE, "break statement not within loop or switch");
9620         }
9621
9622         statement_t *statement = allocate_statement_zero(STATEMENT_BREAK);
9623
9624         eat(T_break);
9625         expect(';', end_error);
9626
9627 end_error:
9628         return statement;
9629 }
9630
9631 /**
9632  * Parse a __leave statement.
9633  */
9634 static statement_t *parse_leave_statement(void)
9635 {
9636         if (current_try == NULL) {
9637                 errorf(HERE, "__leave statement not within __try");
9638         }
9639
9640         statement_t *statement = allocate_statement_zero(STATEMENT_LEAVE);
9641
9642         eat(T___leave);
9643         expect(';', end_error);
9644
9645 end_error:
9646         return statement;
9647 }
9648
9649 /**
9650  * Check if a given entity represents a local variable.
9651  */
9652 static bool is_local_variable(const entity_t *entity)
9653 {
9654         if (entity->kind != ENTITY_VARIABLE)
9655                 return false;
9656
9657         switch ((storage_class_tag_t) entity->declaration.storage_class) {
9658         case STORAGE_CLASS_AUTO:
9659         case STORAGE_CLASS_REGISTER: {
9660                 const type_t *type = skip_typeref(entity->declaration.type);
9661                 if (is_type_function(type)) {
9662                         return false;
9663                 } else {
9664                         return true;
9665                 }
9666         }
9667         default:
9668                 return false;
9669         }
9670 }
9671
9672 /**
9673  * Check if a given expression represents a local variable.
9674  */
9675 static bool expression_is_local_variable(const expression_t *expression)
9676 {
9677         if (expression->base.kind != EXPR_REFERENCE) {
9678                 return false;
9679         }
9680         const entity_t *entity = expression->reference.entity;
9681         return is_local_variable(entity);
9682 }
9683
9684 /**
9685  * Check if a given expression represents a local variable and
9686  * return its declaration then, else return NULL.
9687  */
9688 entity_t *expression_is_variable(const expression_t *expression)
9689 {
9690         if (expression->base.kind != EXPR_REFERENCE) {
9691                 return NULL;
9692         }
9693         entity_t *entity = expression->reference.entity;
9694         if (entity->kind != ENTITY_VARIABLE)
9695                 return NULL;
9696
9697         return entity;
9698 }
9699
9700 /**
9701  * Parse a return statement.
9702  */
9703 static statement_t *parse_return(void)
9704 {
9705         statement_t *statement = allocate_statement_zero(STATEMENT_RETURN);
9706         eat(T_return);
9707
9708         expression_t *return_value = NULL;
9709         if (token.kind != ';') {
9710                 return_value = parse_expression();
9711                 mark_vars_read(return_value, NULL);
9712         }
9713
9714         const type_t *const func_type = skip_typeref(current_function->base.type);
9715         assert(is_type_function(func_type));
9716         type_t *const return_type = skip_typeref(func_type->function.return_type);
9717
9718         source_position_t const *const pos = &statement->base.source_position;
9719         if (return_value != NULL) {
9720                 type_t *return_value_type = skip_typeref(return_value->base.type);
9721
9722                 if (is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
9723                         if (is_type_atomic(return_value_type, ATOMIC_TYPE_VOID)) {
9724                                 /* ISO/IEC 14882:1998(E) §6.6.3:2 */
9725                                 /* Only warn in C mode, because GCC does the same */
9726                                 if (c_mode & _CXX || strict_mode) {
9727                                         errorf(pos,
9728                                                         "'return' with a value, in function returning 'void'");
9729                                 } else {
9730                                         warningf(WARN_OTHER, pos, "'return' with a value, in function returning 'void'");
9731                                 }
9732                         } else if (!(c_mode & _CXX)) { /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9733                                 /* Only warn in C mode, because GCC does the same */
9734                                 if (strict_mode) {
9735                                         errorf(pos,
9736                                                         "'return' with expression in function returning 'void'");
9737                                 } else {
9738                                         warningf(WARN_OTHER, pos, "'return' with expression in function returning 'void'");
9739                                 }
9740                         }
9741                 } else {
9742                         assign_error_t error = semantic_assign(return_type, return_value);
9743                         report_assign_error(error, return_type, return_value, "'return'",
9744                                             pos);
9745                 }
9746                 return_value = create_implicit_cast(return_value, return_type);
9747                 /* check for returning address of a local var */
9748                 if (return_value != NULL && return_value->base.kind == EXPR_UNARY_TAKE_ADDRESS) {
9749                         const expression_t *expression = return_value->unary.value;
9750                         if (expression_is_local_variable(expression)) {
9751                                 warningf(WARN_OTHER, pos, "function returns address of local variable");
9752                         }
9753                 }
9754         } else if (!is_type_atomic(return_type, ATOMIC_TYPE_VOID)) {
9755                 /* ISO/IEC 14882:1998(E) §6.6.3:3 */
9756                 if (c_mode & _CXX || strict_mode) {
9757                         errorf(pos,
9758                                "'return' without value, in function returning non-void");
9759                 } else {
9760                         warningf(WARN_OTHER, pos, "'return' without value, in function returning non-void");
9761                 }
9762         }
9763         statement->returns.value = return_value;
9764
9765         expect(';', end_error);
9766
9767 end_error:
9768         return statement;
9769 }
9770
9771 /**
9772  * Parse a declaration statement.
9773  */
9774 static statement_t *parse_declaration_statement(void)
9775 {
9776         statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9777
9778         entity_t *before = current_scope->last_entity;
9779         if (GNU_MODE) {
9780                 parse_external_declaration();
9781         } else {
9782                 parse_declaration(record_entity, DECL_FLAGS_NONE);
9783         }
9784
9785         declaration_statement_t *const decl  = &statement->declaration;
9786         entity_t                *const begin =
9787                 before != NULL ? before->base.next : current_scope->entities;
9788         decl->declarations_begin = begin;
9789         decl->declarations_end   = begin != NULL ? current_scope->last_entity : NULL;
9790
9791         return statement;
9792 }
9793
9794 /**
9795  * Parse an expression statement, ie. expr ';'.
9796  */
9797 static statement_t *parse_expression_statement(void)
9798 {
9799         statement_t *statement = allocate_statement_zero(STATEMENT_EXPRESSION);
9800
9801         expression_t *const expr         = parse_expression();
9802         statement->expression.expression = expr;
9803         mark_vars_read(expr, ENT_ANY);
9804
9805         expect(';', end_error);
9806
9807 end_error:
9808         return statement;
9809 }
9810
9811 /**
9812  * Parse a microsoft __try { } __finally { } or
9813  * __try{ } __except() { }
9814  */
9815 static statement_t *parse_ms_try_statment(void)
9816 {
9817         statement_t *statement = allocate_statement_zero(STATEMENT_MS_TRY);
9818         eat(T___try);
9819
9820         PUSH_PARENT(statement);
9821
9822         ms_try_statement_t *rem = current_try;
9823         current_try = &statement->ms_try;
9824         statement->ms_try.try_statement = parse_compound_statement(false);
9825         current_try = rem;
9826
9827         POP_PARENT();
9828
9829         if (next_if(T___except)) {
9830                 expect('(', end_error);
9831                 add_anchor_token(')');
9832                 expression_t *const expr = parse_expression();
9833                 mark_vars_read(expr, NULL);
9834                 type_t       *      type = skip_typeref(expr->base.type);
9835                 if (is_type_integer(type)) {
9836                         type = promote_integer(type);
9837                 } else if (is_type_valid(type)) {
9838                         errorf(&expr->base.source_position,
9839                                "__expect expression is not an integer, but '%T'", type);
9840                         type = type_error_type;
9841                 }
9842                 statement->ms_try.except_expression = create_implicit_cast(expr, type);
9843                 rem_anchor_token(')');
9844                 expect(')', end_error);
9845                 statement->ms_try.final_statement = parse_compound_statement(false);
9846         } else if (next_if(T__finally)) {
9847                 statement->ms_try.final_statement = parse_compound_statement(false);
9848         } else {
9849                 parse_error_expected("while parsing __try statement", T___except, T___finally, NULL);
9850                 return create_error_statement();
9851         }
9852         return statement;
9853 end_error:
9854         return create_error_statement();
9855 }
9856
9857 static statement_t *parse_empty_statement(void)
9858 {
9859         warningf(WARN_EMPTY_STATEMENT, HERE, "statement is empty");
9860         statement_t *const statement = create_empty_statement();
9861         eat(';');
9862         return statement;
9863 }
9864
9865 static statement_t *parse_local_label_declaration(void)
9866 {
9867         statement_t *statement = allocate_statement_zero(STATEMENT_DECLARATION);
9868
9869         eat(T___label__);
9870
9871         entity_t *begin   = NULL;
9872         entity_t *end     = NULL;
9873         entity_t **anchor = &begin;
9874         do {
9875                 if (token.kind != T_IDENTIFIER) {
9876                         parse_error_expected("while parsing local label declaration",
9877                                 T_IDENTIFIER, NULL);
9878                         goto end_error;
9879                 }
9880                 symbol_t *symbol = token.identifier.symbol;
9881                 entity_t *entity = get_entity(symbol, NAMESPACE_LABEL);
9882                 if (entity != NULL && entity->base.parent_scope == current_scope) {
9883                         source_position_t const *const ppos = &entity->base.source_position;
9884                         errorf(HERE, "multiple definitions of '%N' (previous definition %P)", entity, ppos);
9885                 } else {
9886                         entity = allocate_entity_zero(ENTITY_LOCAL_LABEL, NAMESPACE_LABEL, symbol);
9887                         entity->base.parent_scope    = current_scope;
9888                         entity->base.source_position = token.base.source_position;
9889
9890                         *anchor = entity;
9891                         anchor  = &entity->base.next;
9892                         end     = entity;
9893
9894                         environment_push(entity);
9895                 }
9896                 next_token();
9897         } while (next_if(','));
9898         expect(';', end_error);
9899 end_error:
9900         statement->declaration.declarations_begin = begin;
9901         statement->declaration.declarations_end   = end;
9902         return statement;
9903 }
9904
9905 static void parse_namespace_definition(void)
9906 {
9907         eat(T_namespace);
9908
9909         entity_t *entity = NULL;
9910         symbol_t *symbol = NULL;
9911
9912         if (token.kind == T_IDENTIFIER) {
9913                 symbol = token.identifier.symbol;
9914                 next_token();
9915
9916                 entity = get_entity(symbol, NAMESPACE_NORMAL);
9917                 if (entity != NULL
9918                                 && entity->kind != ENTITY_NAMESPACE
9919                                 && entity->base.parent_scope == current_scope) {
9920                         if (is_entity_valid(entity)) {
9921                                 error_redefined_as_different_kind(&token.base.source_position,
9922                                                 entity, ENTITY_NAMESPACE);
9923                         }
9924                         entity = NULL;
9925                 }
9926         }
9927
9928         if (entity == NULL) {
9929                 entity = allocate_entity_zero(ENTITY_NAMESPACE, NAMESPACE_NORMAL, symbol);
9930                 entity->base.source_position = token.base.source_position;
9931                 entity->base.parent_scope    = current_scope;
9932         }
9933
9934         if (token.kind == '=') {
9935                 /* TODO: parse namespace alias */
9936                 panic("namespace alias definition not supported yet");
9937         }
9938
9939         environment_push(entity);
9940         append_entity(current_scope, entity);
9941
9942         PUSH_SCOPE(&entity->namespacee.members);
9943
9944         entity_t     *old_current_entity = current_entity;
9945         current_entity = entity;
9946
9947         expect('{', end_error);
9948         parse_externals();
9949         expect('}', end_error);
9950
9951 end_error:
9952         assert(current_entity == entity);
9953         current_entity = old_current_entity;
9954         POP_SCOPE();
9955 }
9956
9957 /**
9958  * Parse a statement.
9959  * There's also parse_statement() which additionally checks for
9960  * "statement has no effect" warnings
9961  */
9962 static statement_t *intern_parse_statement(void)
9963 {
9964         statement_t *statement = NULL;
9965
9966         /* declaration or statement */
9967         add_anchor_token(';');
9968         switch (token.kind) {
9969         case T_IDENTIFIER: {
9970                 token_kind_t la1_type = (token_kind_t)look_ahead(1)->kind;
9971                 if (la1_type == ':') {
9972                         statement = parse_label_statement();
9973                 } else if (is_typedef_symbol(token.identifier.symbol)) {
9974                         statement = parse_declaration_statement();
9975                 } else {
9976                         /* it's an identifier, the grammar says this must be an
9977                          * expression statement. However it is common that users mistype
9978                          * declaration types, so we guess a bit here to improve robustness
9979                          * for incorrect programs */
9980                         switch (la1_type) {
9981                         case '&':
9982                         case '*':
9983                                 if (get_entity(token.identifier.symbol, NAMESPACE_NORMAL) != NULL) {
9984                         default:
9985                                         statement = parse_expression_statement();
9986                                 } else {
9987                         DECLARATION_START
9988                         case T_IDENTIFIER:
9989                                         statement = parse_declaration_statement();
9990                                 }
9991                                 break;
9992                         }
9993                 }
9994                 break;
9995         }
9996
9997         case T___extension__: {
9998                 /* This can be a prefix to a declaration or an expression statement.
9999                  * We simply eat it now and parse the rest with tail recursion. */
10000                 PUSH_EXTENSION();
10001                 statement = intern_parse_statement();
10002                 POP_EXTENSION();
10003                 break;
10004         }
10005
10006         DECLARATION_START
10007                 statement = parse_declaration_statement();
10008                 break;
10009
10010         case T___label__:
10011                 statement = parse_local_label_declaration();
10012                 break;
10013
10014         case ';':         statement = parse_empty_statement();         break;
10015         case '{':         statement = parse_compound_statement(false); break;
10016         case T___leave:   statement = parse_leave_statement();         break;
10017         case T___try:     statement = parse_ms_try_statment();         break;
10018         case T_asm:       statement = parse_asm_statement();           break;
10019         case T_break:     statement = parse_break();                   break;
10020         case T_case:      statement = parse_case_statement();          break;
10021         case T_continue:  statement = parse_continue();                break;
10022         case T_default:   statement = parse_default_statement();       break;
10023         case T_do:        statement = parse_do();                      break;
10024         case T_for:       statement = parse_for();                     break;
10025         case T_goto:      statement = parse_goto();                    break;
10026         case T_if:        statement = parse_if();                      break;
10027         case T_return:    statement = parse_return();                  break;
10028         case T_switch:    statement = parse_switch();                  break;
10029         case T_while:     statement = parse_while();                   break;
10030
10031         EXPRESSION_START
10032                 statement = parse_expression_statement();
10033                 break;
10034
10035         default:
10036                 errorf(HERE, "unexpected token %K while parsing statement", &token);
10037                 statement = create_error_statement();
10038                 if (!at_anchor())
10039                         next_token();
10040                 break;
10041         }
10042         rem_anchor_token(';');
10043
10044         assert(statement != NULL
10045                         && statement->base.source_position.input_name != NULL);
10046
10047         return statement;
10048 }
10049
10050 /**
10051  * parse a statement and emits "statement has no effect" warning if needed
10052  * (This is really a wrapper around intern_parse_statement with check for 1
10053  *  single warning. It is needed, because for statement expressions we have
10054  *  to avoid the warning on the last statement)
10055  */
10056 static statement_t *parse_statement(void)
10057 {
10058         statement_t *statement = intern_parse_statement();
10059
10060         if (statement->kind == STATEMENT_EXPRESSION) {
10061                 expression_t *expression = statement->expression.expression;
10062                 if (!expression_has_effect(expression)) {
10063                         warningf(WARN_UNUSED_VALUE, &expression->base.source_position, "statement has no effect");
10064                 }
10065         }
10066
10067         return statement;
10068 }
10069
10070 /**
10071  * Parse a compound statement.
10072  */
10073 static statement_t *parse_compound_statement(bool inside_expression_statement)
10074 {
10075         statement_t *statement = allocate_statement_zero(STATEMENT_COMPOUND);
10076
10077         PUSH_PARENT(statement);
10078         PUSH_SCOPE(&statement->compound.scope);
10079
10080         eat('{');
10081         add_anchor_token('}');
10082         /* tokens, which can start a statement */
10083         /* TODO MS, __builtin_FOO */
10084         add_anchor_token('!');
10085         add_anchor_token('&');
10086         add_anchor_token('(');
10087         add_anchor_token('*');
10088         add_anchor_token('+');
10089         add_anchor_token('-');
10090         add_anchor_token('{');
10091         add_anchor_token('~');
10092         add_anchor_token(T_CHARACTER_CONSTANT);
10093         add_anchor_token(T_COLONCOLON);
10094         add_anchor_token(T_FLOATINGPOINT);
10095         add_anchor_token(T_IDENTIFIER);
10096         add_anchor_token(T_INTEGER);
10097         add_anchor_token(T_MINUSMINUS);
10098         add_anchor_token(T_PLUSPLUS);
10099         add_anchor_token(T_STRING_LITERAL);
10100         add_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10101         add_anchor_token(T_WIDE_STRING_LITERAL);
10102         add_anchor_token(T__Bool);
10103         add_anchor_token(T__Complex);
10104         add_anchor_token(T__Imaginary);
10105         add_anchor_token(T___FUNCTION__);
10106         add_anchor_token(T___PRETTY_FUNCTION__);
10107         add_anchor_token(T___alignof__);
10108         add_anchor_token(T___attribute__);
10109         add_anchor_token(T___builtin_va_start);
10110         add_anchor_token(T___extension__);
10111         add_anchor_token(T___func__);
10112         add_anchor_token(T___imag__);
10113         add_anchor_token(T___label__);
10114         add_anchor_token(T___real__);
10115         add_anchor_token(T___thread);
10116         add_anchor_token(T_asm);
10117         add_anchor_token(T_auto);
10118         add_anchor_token(T_bool);
10119         add_anchor_token(T_break);
10120         add_anchor_token(T_case);
10121         add_anchor_token(T_char);
10122         add_anchor_token(T_class);
10123         add_anchor_token(T_const);
10124         add_anchor_token(T_const_cast);
10125         add_anchor_token(T_continue);
10126         add_anchor_token(T_default);
10127         add_anchor_token(T_delete);
10128         add_anchor_token(T_double);
10129         add_anchor_token(T_do);
10130         add_anchor_token(T_dynamic_cast);
10131         add_anchor_token(T_enum);
10132         add_anchor_token(T_extern);
10133         add_anchor_token(T_false);
10134         add_anchor_token(T_float);
10135         add_anchor_token(T_for);
10136         add_anchor_token(T_goto);
10137         add_anchor_token(T_if);
10138         add_anchor_token(T_inline);
10139         add_anchor_token(T_int);
10140         add_anchor_token(T_long);
10141         add_anchor_token(T_new);
10142         add_anchor_token(T_operator);
10143         add_anchor_token(T_register);
10144         add_anchor_token(T_reinterpret_cast);
10145         add_anchor_token(T_restrict);
10146         add_anchor_token(T_return);
10147         add_anchor_token(T_short);
10148         add_anchor_token(T_signed);
10149         add_anchor_token(T_sizeof);
10150         add_anchor_token(T_static);
10151         add_anchor_token(T_static_cast);
10152         add_anchor_token(T_struct);
10153         add_anchor_token(T_switch);
10154         add_anchor_token(T_template);
10155         add_anchor_token(T_this);
10156         add_anchor_token(T_throw);
10157         add_anchor_token(T_true);
10158         add_anchor_token(T_try);
10159         add_anchor_token(T_typedef);
10160         add_anchor_token(T_typeid);
10161         add_anchor_token(T_typename);
10162         add_anchor_token(T_typeof);
10163         add_anchor_token(T_union);
10164         add_anchor_token(T_unsigned);
10165         add_anchor_token(T_using);
10166         add_anchor_token(T_void);
10167         add_anchor_token(T_volatile);
10168         add_anchor_token(T_wchar_t);
10169         add_anchor_token(T_while);
10170
10171         statement_t **anchor            = &statement->compound.statements;
10172         bool          only_decls_so_far = true;
10173         while (token.kind != '}') {
10174                 if (token.kind == T_EOF) {
10175                         errorf(&statement->base.source_position,
10176                                "EOF while parsing compound statement");
10177                         break;
10178                 }
10179                 statement_t *sub_statement = intern_parse_statement();
10180                 if (sub_statement->kind == STATEMENT_ERROR) {
10181                         /* an error occurred. if we are at an anchor, return */
10182                         if (at_anchor())
10183                                 goto end_error;
10184                         continue;
10185                 }
10186
10187                 if (sub_statement->kind != STATEMENT_DECLARATION) {
10188                         only_decls_so_far = false;
10189                 } else if (!only_decls_so_far) {
10190                         source_position_t const *const pos = &sub_statement->base.source_position;
10191                         warningf(WARN_DECLARATION_AFTER_STATEMENT, pos, "ISO C90 forbids mixed declarations and code");
10192                 }
10193
10194                 *anchor = sub_statement;
10195
10196                 while (sub_statement->base.next != NULL)
10197                         sub_statement = sub_statement->base.next;
10198
10199                 anchor = &sub_statement->base.next;
10200         }
10201         next_token();
10202
10203         /* look over all statements again to produce no effect warnings */
10204         if (is_warn_on(WARN_UNUSED_VALUE)) {
10205                 statement_t *sub_statement = statement->compound.statements;
10206                 for (; sub_statement != NULL; sub_statement = sub_statement->base.next) {
10207                         if (sub_statement->kind != STATEMENT_EXPRESSION)
10208                                 continue;
10209                         /* don't emit a warning for the last expression in an expression
10210                          * statement as it has always an effect */
10211                         if (inside_expression_statement && sub_statement->base.next == NULL)
10212                                 continue;
10213
10214                         expression_t *expression = sub_statement->expression.expression;
10215                         if (!expression_has_effect(expression)) {
10216                                 warningf(WARN_UNUSED_VALUE, &expression->base.source_position, "statement has no effect");
10217                         }
10218                 }
10219         }
10220
10221 end_error:
10222         rem_anchor_token(T_while);
10223         rem_anchor_token(T_wchar_t);
10224         rem_anchor_token(T_volatile);
10225         rem_anchor_token(T_void);
10226         rem_anchor_token(T_using);
10227         rem_anchor_token(T_unsigned);
10228         rem_anchor_token(T_union);
10229         rem_anchor_token(T_typeof);
10230         rem_anchor_token(T_typename);
10231         rem_anchor_token(T_typeid);
10232         rem_anchor_token(T_typedef);
10233         rem_anchor_token(T_try);
10234         rem_anchor_token(T_true);
10235         rem_anchor_token(T_throw);
10236         rem_anchor_token(T_this);
10237         rem_anchor_token(T_template);
10238         rem_anchor_token(T_switch);
10239         rem_anchor_token(T_struct);
10240         rem_anchor_token(T_static_cast);
10241         rem_anchor_token(T_static);
10242         rem_anchor_token(T_sizeof);
10243         rem_anchor_token(T_signed);
10244         rem_anchor_token(T_short);
10245         rem_anchor_token(T_return);
10246         rem_anchor_token(T_restrict);
10247         rem_anchor_token(T_reinterpret_cast);
10248         rem_anchor_token(T_register);
10249         rem_anchor_token(T_operator);
10250         rem_anchor_token(T_new);
10251         rem_anchor_token(T_long);
10252         rem_anchor_token(T_int);
10253         rem_anchor_token(T_inline);
10254         rem_anchor_token(T_if);
10255         rem_anchor_token(T_goto);
10256         rem_anchor_token(T_for);
10257         rem_anchor_token(T_float);
10258         rem_anchor_token(T_false);
10259         rem_anchor_token(T_extern);
10260         rem_anchor_token(T_enum);
10261         rem_anchor_token(T_dynamic_cast);
10262         rem_anchor_token(T_do);
10263         rem_anchor_token(T_double);
10264         rem_anchor_token(T_delete);
10265         rem_anchor_token(T_default);
10266         rem_anchor_token(T_continue);
10267         rem_anchor_token(T_const_cast);
10268         rem_anchor_token(T_const);
10269         rem_anchor_token(T_class);
10270         rem_anchor_token(T_char);
10271         rem_anchor_token(T_case);
10272         rem_anchor_token(T_break);
10273         rem_anchor_token(T_bool);
10274         rem_anchor_token(T_auto);
10275         rem_anchor_token(T_asm);
10276         rem_anchor_token(T___thread);
10277         rem_anchor_token(T___real__);
10278         rem_anchor_token(T___label__);
10279         rem_anchor_token(T___imag__);
10280         rem_anchor_token(T___func__);
10281         rem_anchor_token(T___extension__);
10282         rem_anchor_token(T___builtin_va_start);
10283         rem_anchor_token(T___attribute__);
10284         rem_anchor_token(T___alignof__);
10285         rem_anchor_token(T___PRETTY_FUNCTION__);
10286         rem_anchor_token(T___FUNCTION__);
10287         rem_anchor_token(T__Imaginary);
10288         rem_anchor_token(T__Complex);
10289         rem_anchor_token(T__Bool);
10290         rem_anchor_token(T_WIDE_STRING_LITERAL);
10291         rem_anchor_token(T_WIDE_CHARACTER_CONSTANT);
10292         rem_anchor_token(T_STRING_LITERAL);
10293         rem_anchor_token(T_PLUSPLUS);
10294         rem_anchor_token(T_MINUSMINUS);
10295         rem_anchor_token(T_INTEGER);
10296         rem_anchor_token(T_IDENTIFIER);
10297         rem_anchor_token(T_FLOATINGPOINT);
10298         rem_anchor_token(T_COLONCOLON);
10299         rem_anchor_token(T_CHARACTER_CONSTANT);
10300         rem_anchor_token('~');
10301         rem_anchor_token('{');
10302         rem_anchor_token('-');
10303         rem_anchor_token('+');
10304         rem_anchor_token('*');
10305         rem_anchor_token('(');
10306         rem_anchor_token('&');
10307         rem_anchor_token('!');
10308         rem_anchor_token('}');
10309
10310         POP_SCOPE();
10311         POP_PARENT();
10312         return statement;
10313 }
10314
10315 /**
10316  * Check for unused global static functions and variables
10317  */
10318 static void check_unused_globals(void)
10319 {
10320         if (!is_warn_on(WARN_UNUSED_FUNCTION) && !is_warn_on(WARN_UNUSED_VARIABLE))
10321                 return;
10322
10323         for (const entity_t *entity = file_scope->entities; entity != NULL;
10324              entity = entity->base.next) {
10325                 if (!is_declaration(entity))
10326                         continue;
10327
10328                 const declaration_t *declaration = &entity->declaration;
10329                 if (declaration->used                  ||
10330                     declaration->modifiers & DM_UNUSED ||
10331                     declaration->modifiers & DM_USED   ||
10332                     declaration->storage_class != STORAGE_CLASS_STATIC)
10333                         continue;
10334
10335                 warning_t   why;
10336                 char const *s;
10337                 if (entity->kind == ENTITY_FUNCTION) {
10338                         /* inhibit warning for static inline functions */
10339                         if (entity->function.is_inline)
10340                                 continue;
10341
10342                         why = WARN_UNUSED_FUNCTION;
10343                         s   = entity->function.statement != NULL ? "defined" : "declared";
10344                 } else {
10345                         why = WARN_UNUSED_VARIABLE;
10346                         s   = "defined";
10347                 }
10348
10349                 warningf(why, &declaration->base.source_position, "'%#N' %s but not used", entity, s);
10350         }
10351 }
10352
10353 static void parse_global_asm(void)
10354 {
10355         statement_t *statement = allocate_statement_zero(STATEMENT_ASM);
10356
10357         eat(T_asm);
10358         expect('(', end_error);
10359
10360         statement->asms.asm_text = parse_string_literals();
10361         statement->base.next     = unit->global_asm;
10362         unit->global_asm         = statement;
10363
10364         expect(')', end_error);
10365         expect(';', end_error);
10366
10367 end_error:;
10368 }
10369
10370 static void parse_linkage_specification(void)
10371 {
10372         eat(T_extern);
10373
10374         source_position_t const pos     = *HERE;
10375         char const       *const linkage = parse_string_literals().begin;
10376
10377         linkage_kind_t old_linkage = current_linkage;
10378         linkage_kind_t new_linkage;
10379         if (strcmp(linkage, "C") == 0) {
10380                 new_linkage = LINKAGE_C;
10381         } else if (strcmp(linkage, "C++") == 0) {
10382                 new_linkage = LINKAGE_CXX;
10383         } else {
10384                 errorf(&pos, "linkage string \"%s\" not recognized", linkage);
10385                 new_linkage = LINKAGE_C;
10386         }
10387         current_linkage = new_linkage;
10388
10389         if (next_if('{')) {
10390                 parse_externals();
10391                 expect('}', end_error);
10392         } else {
10393                 parse_external();
10394         }
10395
10396 end_error:
10397         assert(current_linkage == new_linkage);
10398         current_linkage = old_linkage;
10399 }
10400
10401 static void parse_external(void)
10402 {
10403         switch (token.kind) {
10404                 case T_extern:
10405                         if (look_ahead(1)->kind == T_STRING_LITERAL) {
10406                                 parse_linkage_specification();
10407                         } else {
10408                 DECLARATION_START_NO_EXTERN
10409                 case T_IDENTIFIER:
10410                 case T___extension__:
10411                 /* tokens below are for implicit int */
10412                 case '&':  /* & x; -> int& x; (and error later, because C++ has no
10413                               implicit int) */
10414                 case '*':  /* * x; -> int* x; */
10415                 case '(':  /* (x); -> int (x); */
10416                                 PUSH_EXTENSION();
10417                                 parse_external_declaration();
10418                                 POP_EXTENSION();
10419                         }
10420                         return;
10421
10422                 case T_asm:
10423                         parse_global_asm();
10424                         return;
10425
10426                 case T_namespace:
10427                         parse_namespace_definition();
10428                         return;
10429
10430                 case ';':
10431                         if (!strict_mode) {
10432                                 warningf(WARN_STRAY_SEMICOLON, HERE, "stray ';' outside of function");
10433                                 next_token();
10434                                 return;
10435                         }
10436                         /* FALLTHROUGH */
10437
10438                 default:
10439                         errorf(HERE, "stray %K outside of function", &token);
10440                         if (token.kind == '(' || token.kind == '{' || token.kind == '[')
10441                                 eat_until_matching_token(token.kind);
10442                         next_token();
10443                         return;
10444         }
10445 }
10446
10447 static void parse_externals(void)
10448 {
10449         add_anchor_token('}');
10450         add_anchor_token(T_EOF);
10451
10452 #ifndef NDEBUG
10453         /* make a copy of the anchor set, so we can check if it is restored after parsing */
10454         unsigned short token_anchor_copy[T_LAST_TOKEN];
10455         memcpy(token_anchor_copy, token_anchor_set, sizeof(token_anchor_copy));
10456 #endif
10457
10458         while (token.kind != T_EOF && token.kind != '}') {
10459 #ifndef NDEBUG
10460                 for (int i = 0; i < T_LAST_TOKEN; ++i) {
10461                         unsigned short count = token_anchor_set[i] - token_anchor_copy[i];
10462                         if (count != 0) {
10463                                 /* the anchor set and its copy differs */
10464                                 internal_errorf(HERE, "Leaked anchor token %k %d times", i, count);
10465                         }
10466                 }
10467                 if (in_gcc_extension) {
10468                         /* an gcc extension scope was not closed */
10469                         internal_errorf(HERE, "Leaked __extension__");
10470                 }
10471 #endif
10472
10473                 parse_external();
10474         }
10475
10476         rem_anchor_token(T_EOF);
10477         rem_anchor_token('}');
10478 }
10479
10480 /**
10481  * Parse a translation unit.
10482  */
10483 static void parse_translation_unit(void)
10484 {
10485         add_anchor_token(T_EOF);
10486
10487         while (true) {
10488                 parse_externals();
10489
10490                 if (token.kind == T_EOF)
10491                         break;
10492
10493                 errorf(HERE, "stray %K outside of function", &token);
10494                 if (token.kind == '(' || token.kind == '{' || token.kind == '[')
10495                         eat_until_matching_token(token.kind);
10496                 next_token();
10497         }
10498 }
10499
10500 void set_default_visibility(elf_visibility_tag_t visibility)
10501 {
10502         default_visibility = visibility;
10503 }
10504
10505 /**
10506  * Parse the input.
10507  *
10508  * @return  the translation unit or NULL if errors occurred.
10509  */
10510 void start_parsing(void)
10511 {
10512         environment_stack = NEW_ARR_F(stack_entry_t, 0);
10513         label_stack       = NEW_ARR_F(stack_entry_t, 0);
10514         diagnostic_count  = 0;
10515         error_count       = 0;
10516         warning_count     = 0;
10517
10518         print_to_file(stderr);
10519
10520         assert(unit == NULL);
10521         unit = allocate_ast_zero(sizeof(unit[0]));
10522
10523         assert(file_scope == NULL);
10524         file_scope = &unit->scope;
10525
10526         assert(current_scope == NULL);
10527         scope_push(&unit->scope);
10528
10529         create_gnu_builtins();
10530         if (c_mode & _MS)
10531                 create_microsoft_intrinsics();
10532 }
10533
10534 translation_unit_t *finish_parsing(void)
10535 {
10536         assert(current_scope == &unit->scope);
10537         scope_pop(NULL);
10538
10539         assert(file_scope == &unit->scope);
10540         check_unused_globals();
10541         file_scope = NULL;
10542
10543         DEL_ARR_F(environment_stack);
10544         DEL_ARR_F(label_stack);
10545
10546         translation_unit_t *result = unit;
10547         unit = NULL;
10548         return result;
10549 }
10550
10551 /* §6.9.2:2 and §6.9.2:5: At the end of the translation incomplete arrays
10552  * are given length one. */
10553 static void complete_incomplete_arrays(void)
10554 {
10555         size_t n = ARR_LEN(incomplete_arrays);
10556         for (size_t i = 0; i != n; ++i) {
10557                 declaration_t *const decl = incomplete_arrays[i];
10558                 type_t        *const type = skip_typeref(decl->type);
10559
10560                 if (!is_type_incomplete(type))
10561                         continue;
10562
10563                 source_position_t const *const pos = &decl->base.source_position;
10564                 warningf(WARN_OTHER, pos, "array '%#N' assumed to have one element", (entity_t const*)decl);
10565
10566                 type_t *const new_type = duplicate_type(type);
10567                 new_type->array.size_constant     = true;
10568                 new_type->array.has_implicit_size = true;
10569                 new_type->array.size              = 1;
10570
10571                 type_t *const result = identify_new_type(new_type);
10572
10573                 decl->type = result;
10574         }
10575 }
10576
10577 void prepare_main_collect2(entity_t *entity)
10578 {
10579         // create call to __main
10580         symbol_t *symbol         = symbol_table_insert("__main");
10581         entity_t *subsubmain_ent
10582                 = create_implicit_function(symbol, &builtin_source_position);
10583
10584         expression_t *ref         = allocate_expression_zero(EXPR_REFERENCE);
10585         type_t       *ftype       = subsubmain_ent->declaration.type;
10586         ref->base.source_position = builtin_source_position;
10587         ref->base.type            = make_pointer_type(ftype, TYPE_QUALIFIER_NONE);
10588         ref->reference.entity     = subsubmain_ent;
10589
10590         expression_t *call = allocate_expression_zero(EXPR_CALL);
10591         call->base.source_position = builtin_source_position;
10592         call->base.type            = type_void;
10593         call->call.function        = ref;
10594
10595         statement_t *expr_statement = allocate_statement_zero(STATEMENT_EXPRESSION);
10596         expr_statement->base.source_position  = builtin_source_position;
10597         expr_statement->expression.expression = call;
10598
10599         statement_t *statement = entity->function.statement;
10600         assert(statement->kind == STATEMENT_COMPOUND);
10601         compound_statement_t *compounds = &statement->compound;
10602
10603         expr_statement->base.next = compounds->statements;
10604         compounds->statements     = expr_statement;
10605 }
10606
10607 void parse(void)
10608 {
10609         lookahead_bufpos = 0;
10610         for (int i = 0; i < MAX_LOOKAHEAD + 2; ++i) {
10611                 next_token();
10612         }
10613         current_linkage   = c_mode & _CXX ? LINKAGE_CXX : LINKAGE_C;
10614         incomplete_arrays = NEW_ARR_F(declaration_t*, 0);
10615         parse_translation_unit();
10616         complete_incomplete_arrays();
10617         DEL_ARR_F(incomplete_arrays);
10618         incomplete_arrays = NULL;
10619 }
10620
10621 /**
10622  * Initialize the parser.
10623  */
10624 void init_parser(void)
10625 {
10626         sym_anonymous = symbol_table_insert("<anonymous>");
10627
10628         memset(token_anchor_set, 0, sizeof(token_anchor_set));
10629
10630         init_expression_parsers();
10631         obstack_init(&temp_obst);
10632 }
10633
10634 /**
10635  * Terminate the parser.
10636  */
10637 void exit_parser(void)
10638 {
10639         obstack_free(&temp_obst, NULL);
10640 }