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