gcc/cp/init.c

   1 /* Handle initialization things in C++.
   2    Copyright (C) 1987, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
   3    1999, 2000, 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
   4    Contributed by Michael Tiemann (tiemann@cygnus.com)
   5
   6 This file is part of GCC.
   7
   8 GCC is free software; you can redistribute it and/or modify
   9 it under the terms of the GNU General Public License as published by
  10 the Free Software Foundation; either version 2, or (at your option)
  11 any later version.
  12
  13 GCC is distributed in the hope that it will be useful,
  14 but WITHOUT ANY WARRANTY; without even the implied warranty of
  15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  16 GNU General Public License for more details.
  17
  18 You should have received a copy of the GNU General Public License
  19 along with GCC; see the file COPYING.  If not, write to
  20 the Free Software Foundation, 59 Temple Place - Suite 330,
  21 Boston, MA 02111-1307, USA.  */
  22
  23 /* High-level class interface.  */
  24
  25 #include "config.h"
  26 #include "system.h"
  27 #include "coretypes.h"
  28 #include "tm.h"
  29 #include "tree.h"
  30 #include "rtl.h"
  31 #include "expr.h"
  32 #include "cp-tree.h"
  33 #include "flags.h"
  34 #include "output.h"
  35 #include "except.h"
  36 #include "toplev.h"
  37
  38 static bool begin_init_stmts (tree *, tree *);
  39 static tree finish_init_stmts (bool, tree, tree);
  40 static void construct_virtual_base (tree, tree);
  41 static void expand_aggr_init_1 (tree, tree, tree, tree, int);
  42 static void expand_default_init (tree, tree, tree, tree, int);
  43 static tree build_vec_delete_1 (tree, tree, tree, special_function_kind, int);
  44 static void perform_member_init (tree, tree);
  45 static tree build_builtin_delete_call (tree);
  46 static int member_init_ok_or_else (tree, tree, tree);
  47 static void expand_virtual_init (tree, tree);
  48 static tree sort_mem_initializers (tree, tree);
  49 static tree initializing_context (tree);
  50 static void expand_cleanup_for_base (tree, tree);
  51 static tree get_temp_regvar (tree, tree);
  52 static tree dfs_initialize_vtbl_ptrs (tree, void *);
  53 static tree build_default_init (tree, tree);
  54 static tree build_new_1 (tree);
  55 static tree get_cookie_size (tree);
  56 static tree build_dtor_call (tree, special_function_kind, int);
  57 static tree build_field_list (tree, tree, int *);
  58 static tree build_vtbl_address (tree);
  59
  60 /* We are about to generate some complex initialization code.
  61    Conceptually, it is all a single expression.  However, we may want
  62    to include conditionals, loops, and other such statement-level
  63    constructs.  Therefore, we build the initialization code inside a
  64    statement-expression.  This function starts such an expression.
  65    STMT_EXPR_P and COMPOUND_STMT_P are filled in by this function;
  66    pass them back to finish_init_stmts when the expression is
  67    complete.  */
  68
  69 static bool
  70 begin_init_stmts (tree *stmt_expr_p, tree *compound_stmt_p)
  71 {
  72   bool is_global = !building_stmt_tree ();
  73
  74   *stmt_expr_p = begin_stmt_expr ();
  75   *compound_stmt_p = begin_compound_stmt (BCS_NO_SCOPE);
  76
  77   return is_global;
  78 }
  79
  80 /* Finish out the statement-expression begun by the previous call to
  81    begin_init_stmts.  Returns the statement-expression itself.  */
  82
  83 static tree
  84 finish_init_stmts (bool is_global, tree stmt_expr, tree compound_stmt)
  85 {
  86   finish_compound_stmt (compound_stmt);
  87
  88   stmt_expr = finish_stmt_expr (stmt_expr, true);
  89
  90   my_friendly_assert (!building_stmt_tree () == is_global, 20030726);
  91
  92   return stmt_expr;
  93 }
  94
  95 /* Constructors */
  96
  97 /* Called from initialize_vtbl_ptrs via dfs_walk.  BINFO is the base
  98    which we want to initialize the vtable pointer for, DATA is
  99    TREE_LIST whose TREE_VALUE is the this ptr expression.  */
 100
 101 static tree
 102 dfs_initialize_vtbl_ptrs (tree binfo, void *data)
 103 {
 104   if ((!BINFO_PRIMARY_P (binfo) || TREE_VIA_VIRTUAL (binfo))
 105       && CLASSTYPE_VFIELDS (BINFO_TYPE (binfo)))
 106     {
 107       tree base_ptr = TREE_VALUE ((tree) data);
 108
 109       base_ptr = build_base_path (PLUS_EXPR, base_ptr, binfo, /*nonnull=*/1);
 110
 111       expand_virtual_init (binfo, base_ptr);
 112     }
 113
 114   BINFO_MARKED (binfo) = 1;
 115
 116   return NULL_TREE;
 117 }
 118
 119 /* Initialize all the vtable pointers in the object pointed to by
 120    ADDR.  */
 121
 122 void
 123 initialize_vtbl_ptrs (tree addr)
 124 {
 125   tree list;
 126   tree type;
 127
 128   type = TREE_TYPE (TREE_TYPE (addr));
 129   list = build_tree_list (type, addr);
 130
 131   /* Walk through the hierarchy, initializing the vptr in each base
 132      class.  We do these in pre-order because we can't find the virtual
 133      bases for a class until we've initialized the vtbl for that
 134      class.  */
 135   dfs_walk_real (TYPE_BINFO (type), dfs_initialize_vtbl_ptrs,
 136                  NULL, unmarkedp, list);
 137   dfs_walk (TYPE_BINFO (type), dfs_unmark, markedp, type);
 138 }
 139
 140 /* Return an expression for the zero-initialization of an object with
 141    type T.  This expression will either be a constant (in the case
 142    that T is a scalar), or a CONSTRUCTOR (in the case that T is an
 143    aggregate).  In either case, the value can be used as DECL_INITIAL
 144    for a decl of the indicated TYPE; it is a valid static initializer.
 145    If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS is the
 146    number of elements in the array.  If STATIC_STORAGE_P is TRUE,
 147    initializers are only generated for entities for which
 148    zero-initialization does not simply mean filling the storage with
 149    zero bytes.  */
 150
 151 tree
 152 build_zero_init (tree type, tree nelts, bool static_storage_p)
 153 {
 154   tree init = NULL_TREE;
 155
 156   /* [dcl.init]
 157
 158      To zero-initialization storage for an object of type T means:
 159
 160      -- if T is a scalar type, the storage is set to the value of zero
 161         converted to T.
 162
 163      -- if T is a non-union class type, the storage for each nonstatic
 164         data member and each base-class subobject is zero-initialized.
 165
 166      -- if T is a union type, the storage for its first data member is
 167         zero-initialized.
 168
 169      -- if T is an array type, the storage for each element is
 170         zero-initialized.
 171
 172      -- if T is a reference type, no initialization is performed.  */
 173
 174   my_friendly_assert (nelts == NULL_TREE || TREE_CODE (nelts) == INTEGER_CST,
 175                       20030618);
 176
 177   if (type == error_mark_node)
 178     ;
 179   else if (static_storage_p && zero_init_p (type))
 180     /* In order to save space, we do not explicitly build initializers
 181        for items that do not need them.  GCC's semantics are that
 182        items with static storage duration that are not otherwise
 183        initialized are initialized to zero.  */
 184     ;
 185   else if (SCALAR_TYPE_P (type))
 186     init = convert (type, integer_zero_node);
 187   else if (CLASS_TYPE_P (type))
 188     {
 189       tree field;
 190       tree inits;
 191
 192       /* Build a constructor to contain the initializations.  */
 193       init = build_constructor (type, NULL_TREE);
 194       /* Iterate over the fields, building initializations.  */
 195       inits = NULL_TREE;
 196       for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
 197         {
 198           if (TREE_CODE (field) != FIELD_DECL)
 199             continue;
 200
 201           /* Note that for class types there will be FIELD_DECLs
 202              corresponding to base classes as well.  Thus, iterating
 203              over TYPE_FIELDs will result in correct initialization of
 204              all of the subobjects.  */
 205           if (static_storage_p && !zero_init_p (TREE_TYPE (field)))
 206             inits = tree_cons (field,
 207                                build_zero_init (TREE_TYPE (field),
 208                                                 /*nelts=*/NULL_TREE,
 209                                                 static_storage_p),
 210                                inits);
 211
 212           /* For unions, only the first field is initialized.  */
 213           if (TREE_CODE (type) == UNION_TYPE)
 214             break;
 215         }
 216       CONSTRUCTOR_ELTS (init) = nreverse (inits);
 217     }
 218   else if (TREE_CODE (type) == ARRAY_TYPE)
 219     {
 220       tree index;
 221       tree max_index;
 222       tree inits;
 223
 224       /* Build a constructor to contain the initializations.  */
 225       init = build_constructor (type, NULL_TREE);
 226       /* Iterate over the array elements, building initializations.  */
 227       inits = NULL_TREE;
 228       max_index = nelts ? nelts : array_type_nelts (type);
 229       my_friendly_assert (TREE_CODE (max_index) == INTEGER_CST, 20030618);
 230
 231       /* A zero-sized array, which is accepted as an extension, will
 232          have an upper bound of -1.  */
 233       if (!tree_int_cst_equal (max_index, integer_minus_one_node))
 234         for (index = size_zero_node;
 235              !tree_int_cst_lt (max_index, index);
 236              index = size_binop (PLUS_EXPR, index, size_one_node))
 237           inits = tree_cons (index,
 238                              build_zero_init (TREE_TYPE (type),
 239                                               /*nelts=*/NULL_TREE,
 240                                               static_storage_p),
 241                              inits);
 242       CONSTRUCTOR_ELTS (init) = nreverse (inits);
 243     }
 244   else if (TREE_CODE (type) == REFERENCE_TYPE)
 245     ;
 246   else
 247     abort ();
 248
 249   /* In all cases, the initializer is a constant.  */
 250   if (init)
 251     {
 252       TREE_CONSTANT (init) = 1;
 253       TREE_INVARIANT (init) = 1;
 254     }
 255
 256   return init;
 257 }
 258
 259 /* Build an expression for the default-initialization of an object of
 260    the indicated TYPE.  If NELTS is non-NULL, and TYPE is an
 261    ARRAY_TYPE, NELTS is the number of elements in the array.  If
 262    initialization of TYPE requires calling constructors, this function
 263    returns NULL_TREE; the caller is responsible for arranging for the
 264    constructors to be called.  */
 265
 266 static tree
 267 build_default_init (tree type, tree nelts)
 268 {
 269   /* [dcl.init]:
 270
 271     To default-initialize an object of type T means:
 272
 273     --if T is a non-POD class type (clause _class_), the default construc-
 274       tor  for  T is called (and the initialization is ill-formed if T has
 275       no accessible default constructor);
 276
 277     --if T is an array type, each element is default-initialized;
 278
 279     --otherwise, the storage for the object is zero-initialized.
 280
 281     A program that calls for default-initialization of an entity of refer-
 282     ence type is ill-formed.  */
 283
 284   /* If TYPE_NEEDS_CONSTRUCTING is true, the caller is responsible for
 285      performing the initialization.  This is confusing in that some
 286      non-PODs do not have TYPE_NEEDS_CONSTRUCTING set.  (For example,
 287      a class with a pointer-to-data member as a non-static data member
 288      does not have TYPE_NEEDS_CONSTRUCTING set.)  Therefore, we end up
 289      passing non-PODs to build_zero_init below, which is contrary to
 290      the semantics quoted above from [dcl.init].
 291
 292      It happens, however, that the behavior of the constructor the
 293      standard says we should have generated would be precisely the
 294      same as that obtained by calling build_zero_init below, so things
 295      work out OK.  */
 296   if (TYPE_NEEDS_CONSTRUCTING (type)
 297       || (nelts && TREE_CODE (nelts) != INTEGER_CST))
 298     return NULL_TREE;
 299
 300   /* At this point, TYPE is either a POD class type, an array of POD
 301      classes, or something even more innocuous.  */
 302   return build_zero_init (type, nelts, /*static_storage_p=*/false);
 303 }
 304
 305 /* Initialize MEMBER, a FIELD_DECL, with INIT, a TREE_LIST of
 306    arguments.  If TREE_LIST is void_type_node, an empty initializer
 307    list was given; if NULL_TREE no initializer was given.  */
 308
 309 static void
 310 perform_member_init (tree member, tree init)
 311 {
 312   tree decl;
 313   tree type = TREE_TYPE (member);
 314   bool explicit;
 315
 316   explicit = (init != NULL_TREE);
 317
 318   /* Effective C++ rule 12 requires that all data members be
 319      initialized.  */
 320   if (warn_ecpp && !explicit && TREE_CODE (type) != ARRAY_TYPE)
 321     warning ("`%D' should be initialized in the member initialization "
 322              "list",
 323              member);
 324
 325   if (init == void_type_node)
 326     init = NULL_TREE;
 327
 328   /* Get an lvalue for the data member.  */
 329   decl = build_class_member_access_expr (current_class_ref, member,
 330                                          /*access_path=*/NULL_TREE,
 331                                          /*preserve_reference=*/true);
 332   if (decl == error_mark_node)
 333     return;
 334
 335   /* Deal with this here, as we will get confused if we try to call the
 336      assignment op for an anonymous union.  This can happen in a
 337      synthesized copy constructor.  */
 338   if (ANON_AGGR_TYPE_P (type))
 339     {
 340       if (init)
 341         {
 342           init = build (INIT_EXPR, type, decl, TREE_VALUE (init));
 343           finish_expr_stmt (init);
 344         }
 345     }
 346   else if (TYPE_NEEDS_CONSTRUCTING (type))
 347     {
 348       if (explicit
 349           && TREE_CODE (type) == ARRAY_TYPE
 350           && init != NULL_TREE
 351           && TREE_CHAIN (init) == NULL_TREE
 352           && TREE_CODE (TREE_TYPE (TREE_VALUE (init))) == ARRAY_TYPE)
 353         {
 354           /* Initialization of one array from another.  */
 355           finish_expr_stmt (build_vec_init (decl, NULL_TREE, TREE_VALUE (init),
 356                                             /* from_array=*/1));
 357         }
 358       else
 359         finish_expr_stmt (build_aggr_init (decl, init, 0));
 360     }
 361   else
 362     {
 363       if (init == NULL_TREE)
 364         {
 365           if (explicit)
 366             {
 367               init = build_default_init (type, /*nelts=*/NULL_TREE);
 368               if (TREE_CODE (type) == REFERENCE_TYPE)
 369                 warning
 370                   ("default-initialization of `%#D', which has reference type",
 371                    member);
 372             }
 373           /* member traversal: note it leaves init NULL */
 374           else if (TREE_CODE (type) == REFERENCE_TYPE)
 375             pedwarn ("uninitialized reference member `%D'", member);
 376           else if (CP_TYPE_CONST_P (type))
 377             pedwarn ("uninitialized member `%D' with `const' type `%T'",
 378                      member, type);
 379         }
 380       else if (TREE_CODE (init) == TREE_LIST)
 381         /* There was an explicit member initialization.  Do some work
 382            in that case.  */
 383         init = build_x_compound_expr_from_list (init, "member initializer");
 384
 385       if (init)
 386         finish_expr_stmt (build_modify_expr (decl, INIT_EXPR, init));
 387     }
 388
 389   if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
 390     {
 391       tree expr;
 392
 393       expr = build_class_member_access_expr (current_class_ref, member,
 394                                              /*access_path=*/NULL_TREE,
 395                                              /*preserve_reference=*/false);
 396       expr = build_delete (type, expr, sfk_complete_destructor,
 397                            LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR, 0);
 398
 399       if (expr != error_mark_node)
 400         finish_eh_cleanup (expr);
 401     }
 402 }
 403
 404 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
 405    the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order.  */
 406
 407 static tree
 408 build_field_list (tree t, tree list, int *uses_unions_p)
 409 {
 410   tree fields;
 411
 412   *uses_unions_p = 0;
 413
 414   /* Note whether or not T is a union.  */
 415   if (TREE_CODE (t) == UNION_TYPE)
 416     *uses_unions_p = 1;
 417
 418   for (fields = TYPE_FIELDS (t); fields; fields = TREE_CHAIN (fields))
 419     {
 420       /* Skip CONST_DECLs for enumeration constants and so forth.  */
 421       if (TREE_CODE (fields) != FIELD_DECL || DECL_ARTIFICIAL (fields))
 422         continue;
 423
 424       /* Keep track of whether or not any fields are unions.  */
 425       if (TREE_CODE (TREE_TYPE (fields)) == UNION_TYPE)
 426         *uses_unions_p = 1;
 427
 428       /* For an anonymous struct or union, we must recursively
 429          consider the fields of the anonymous type.  They can be
 430          directly initialized from the constructor.  */
 431       if (ANON_AGGR_TYPE_P (TREE_TYPE (fields)))
 432         {
 433           /* Add this field itself.  Synthesized copy constructors
 434              initialize the entire aggregate.  */
 435           list = tree_cons (fields, NULL_TREE, list);
 436           /* And now add the fields in the anonymous aggregate.  */
 437           list = build_field_list (TREE_TYPE (fields), list,
 438                                    uses_unions_p);
 439         }
 440       /* Add this field.  */
 441       else if (DECL_NAME (fields))
 442         list = tree_cons (fields, NULL_TREE, list);
 443     }
 444
 445   return list;
 446 }
 447
 448 /* The MEM_INITS are a TREE_LIST.  The TREE_PURPOSE of each list gives
 449    a FIELD_DECL or BINFO in T that needs initialization.  The
 450    TREE_VALUE gives the initializer, or list of initializer arguments.
 451
 452    Return a TREE_LIST containing all of the initializations required
 453    for T, in the order in which they should be performed.  The output
 454    list has the same format as the input.  */
 455
 456 static tree
 457 sort_mem_initializers (tree t, tree mem_inits)
 458 {
 459   tree init;
 460   tree base;
 461   tree sorted_inits;
 462   tree next_subobject;
 463   int i;
 464   int uses_unions_p;
 465
 466   /* Build up a list of initializations.  The TREE_PURPOSE of entry
 467      will be the subobject (a FIELD_DECL or BINFO) to initialize.  The
 468      TREE_VALUE will be the constructor arguments, or NULL if no
 469      explicit initialization was provided.  */
 470   sorted_inits = NULL_TREE;
 471   /* Process the virtual bases.  */
 472   for (base = CLASSTYPE_VBASECLASSES (t); base; base = TREE_CHAIN (base))
 473     sorted_inits = tree_cons (TREE_VALUE (base), NULL_TREE, sorted_inits);
 474   /* Process the direct bases.  */
 475   for (i = 0; i < CLASSTYPE_N_BASECLASSES (t); ++i)
 476     {
 477       base = BINFO_BASETYPE (TYPE_BINFO (t), i);
 478       if (!TREE_VIA_VIRTUAL (base))
 479         sorted_inits = tree_cons (base, NULL_TREE, sorted_inits);
 480     }
 481   /* Process the non-static data members.  */
 482   sorted_inits = build_field_list (t, sorted_inits, &uses_unions_p);
 483   /* Reverse the entire list of initializations, so that they are in
 484      the order that they will actually be performed.  */
 485   sorted_inits = nreverse (sorted_inits);
 486
 487   /* If the user presented the initializers in an order different from
 488      that in which they will actually occur, we issue a warning.  Keep
 489      track of the next subobject which can be explicitly initialized
 490      without issuing a warning.  */
 491   next_subobject = sorted_inits;
 492
 493   /* Go through the explicit initializers, filling in TREE_PURPOSE in
 494      the SORTED_INITS.  */
 495   for (init = mem_inits; init; init = TREE_CHAIN (init))
 496     {
 497       tree subobject;
 498       tree subobject_init;
 499
 500       subobject = TREE_PURPOSE (init);
 501
 502       /* If the explicit initializers are in sorted order, then
 503          SUBOBJECT will be NEXT_SUBOBJECT, or something following
 504          it.  */
 505       for (subobject_init = next_subobject;
 506            subobject_init;
 507            subobject_init = TREE_CHAIN (subobject_init))
 508         if (TREE_PURPOSE (subobject_init) == subobject)
 509           break;
 510
 511       /* Issue a warning if the explicit initializer order does not
 512          match that which will actually occur.  */
 513       if (warn_reorder && !subobject_init)
 514         {
 515           if (TREE_CODE (TREE_PURPOSE (next_subobject)) == FIELD_DECL)
 516             cp_warning_at ("`%D' will be initialized after",
 517                            TREE_PURPOSE (next_subobject));
 518           else
 519             warning ("base `%T' will be initialized after",
 520                      TREE_PURPOSE (next_subobject));
 521           if (TREE_CODE (subobject) == FIELD_DECL)
 522             cp_warning_at ("  `%#D'", subobject);
 523           else
 524             warning ("  base `%T'", subobject);
 525           warning ("  when initialized here");
 526         }
 527
 528       /* Look again, from the beginning of the list.  */
 529       if (!subobject_init)
 530         {
 531           subobject_init = sorted_inits;
 532           while (TREE_PURPOSE (subobject_init) != subobject)
 533             subobject_init = TREE_CHAIN (subobject_init);
 534         }
 535
 536       /* It is invalid to initialize the same subobject more than
 537          once.  */
 538       if (TREE_VALUE (subobject_init))
 539         {
 540           if (TREE_CODE (subobject) == FIELD_DECL)
 541             error ("multiple initializations given for `%D'", subobject);
 542           else
 543             error ("multiple initializations given for base `%T'",
 544                    subobject);
 545         }
 546
 547       /* Record the initialization.  */
 548       TREE_VALUE (subobject_init) = TREE_VALUE (init);
 549       next_subobject = subobject_init;
 550     }
 551
 552   /* [class.base.init]
 553
 554      If a ctor-initializer specifies more than one mem-initializer for
 555      multiple members of the same union (including members of
 556      anonymous unions), the ctor-initializer is ill-formed.  */
 557   if (uses_unions_p)
 558     {
 559       tree last_field = NULL_TREE;
 560       for (init = sorted_inits; init; init = TREE_CHAIN (init))
 561         {
 562           tree field;
 563           tree field_type;
 564           int done;
 565
 566           /* Skip uninitialized members and base classes.  */
 567           if (!TREE_VALUE (init)
 568               || TREE_CODE (TREE_PURPOSE (init)) != FIELD_DECL)
 569             continue;
 570           /* See if this field is a member of a union, or a member of a
 571              structure contained in a union, etc.  */
 572           field = TREE_PURPOSE (init);
 573           for (field_type = DECL_CONTEXT (field);
 574                !same_type_p (field_type, t);
 575                field_type = TYPE_CONTEXT (field_type))
 576             if (TREE_CODE (field_type) == UNION_TYPE)
 577               break;
 578           /* If this field is not a member of a union, skip it.  */
 579           if (TREE_CODE (field_type) != UNION_TYPE)
 580             continue;
 581
 582           /* It's only an error if we have two initializers for the same
 583              union type.  */
 584           if (!last_field)
 585             {
 586               last_field = field;
 587               continue;
 588             }
 589
 590           /* See if LAST_FIELD and the field initialized by INIT are
 591              members of the same union.  If so, there's a problem,
 592              unless they're actually members of the same structure
 593              which is itself a member of a union.  For example, given:
 594
 595                union { struct { int i; int j; }; };
 596
 597              initializing both `i' and `j' makes sense.  */
 598           field_type = DECL_CONTEXT (field);
 599           done = 0;
 600           do
 601             {
 602               tree last_field_type;
 603
 604               last_field_type = DECL_CONTEXT (last_field);
 605               while (1)
 606                 {
 607                   if (same_type_p (last_field_type, field_type))
 608                     {
 609                       if (TREE_CODE (field_type) == UNION_TYPE)
 610                         error ("initializations for multiple members of `%T'",
 611                                   last_field_type);
 612                       done = 1;
 613                       break;
 614                     }
 615
 616                   if (same_type_p (last_field_type, t))
 617                     break;
 618
 619                   last_field_type = TYPE_CONTEXT (last_field_type);
 620                 }
 621
 622               /* If we've reached the outermost class, then we're
 623                  done.  */
 624               if (same_type_p (field_type, t))
 625                 break;
 626
 627               field_type = TYPE_CONTEXT (field_type);
 628             }
 629           while (!done);
 630
 631           last_field = field;
 632         }
 633     }
 634
 635   return sorted_inits;
 636 }
 637
 638 /* Initialize all bases and members of CURRENT_CLASS_TYPE.  MEM_INITS
 639    is a TREE_LIST giving the explicit mem-initializer-list for the
 640    constructor.  The TREE_PURPOSE of each entry is a subobject (a
 641    FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE.  The TREE_VALUE
 642    is a TREE_LIST giving the arguments to the constructor or
 643    void_type_node for an empty list of arguments.  */
 644
 645 void
 646 emit_mem_initializers (tree mem_inits)
 647 {
 648   /* Sort the mem-initializers into the order in which the
 649      initializations should be performed.  */
 650   mem_inits = sort_mem_initializers (current_class_type, mem_inits);
 651
 652   in_base_initializer = 1;
 653
 654   /* Initialize base classes.  */
 655   while (mem_inits
 656          && TREE_CODE (TREE_PURPOSE (mem_inits)) != FIELD_DECL)
 657     {
 658       tree subobject = TREE_PURPOSE (mem_inits);
 659       tree arguments = TREE_VALUE (mem_inits);
 660
 661       /* If these initializations are taking place in a copy
 662          constructor, the base class should probably be explicitly
 663          initialized.  */
 664       if (extra_warnings && !arguments
 665           && DECL_COPY_CONSTRUCTOR_P (current_function_decl)
 666           && TYPE_NEEDS_CONSTRUCTING (BINFO_TYPE (subobject)))
 667         warning ("base class `%#T' should be explicitly initialized in the "
 668                  "copy constructor",
 669                  BINFO_TYPE (subobject));
 670
 671       /* If an explicit -- but empty -- initializer list was present,
 672          treat it just like default initialization at this point.  */
 673       if (arguments == void_type_node)
 674         arguments = NULL_TREE;
 675
 676       /* Initialize the base.  */
 677       if (TREE_VIA_VIRTUAL (subobject))
 678         construct_virtual_base (subobject, arguments);
 679       else
 680         {
 681           tree base_addr;
 682
 683           base_addr = build_base_path (PLUS_EXPR, current_class_ptr,
 684                                        subobject, 1);
 685           expand_aggr_init_1 (subobject, NULL_TREE,
 686                               build_indirect_ref (base_addr, NULL),
 687                               arguments,
 688                               LOOKUP_NORMAL);
 689           expand_cleanup_for_base (subobject, NULL_TREE);
 690         }
 691
 692       mem_inits = TREE_CHAIN (mem_inits);
 693     }
 694   in_base_initializer = 0;
 695
 696   /* Initialize the vptrs.  */
 697   initialize_vtbl_ptrs (current_class_ptr);
 698
 699   /* Initialize the data members.  */
 700   while (mem_inits)
 701     {
 702       perform_member_init (TREE_PURPOSE (mem_inits),
 703                            TREE_VALUE (mem_inits));
 704       mem_inits = TREE_CHAIN (mem_inits);
 705     }
 706 }
 707
 708 /* Returns the address of the vtable (i.e., the value that should be
 709    assigned to the vptr) for BINFO.  */
 710
 711 static tree
 712 build_vtbl_address (tree binfo)
 713 {
 714   tree binfo_for = binfo;
 715   tree vtbl;
 716
 717   if (BINFO_VPTR_INDEX (binfo) && TREE_VIA_VIRTUAL (binfo)
 718       && BINFO_PRIMARY_P (binfo))
 719     /* If this is a virtual primary base, then the vtable we want to store
 720        is that for the base this is being used as the primary base of.  We
 721        can't simply skip the initialization, because we may be expanding the
 722        inits of a subobject constructor where the virtual base layout
 723        can be different.  */
 724     while (BINFO_PRIMARY_BASE_OF (binfo_for))
 725       binfo_for = BINFO_PRIMARY_BASE_OF (binfo_for);
 726
 727   /* Figure out what vtable BINFO's vtable is based on, and mark it as
 728      used.  */
 729   vtbl = get_vtbl_decl_for_binfo (binfo_for);
 730   assemble_external (vtbl);
 731   TREE_USED (vtbl) = 1;
 732
 733   /* Now compute the address to use when initializing the vptr.  */
 734   vtbl = unshare_expr (BINFO_VTABLE (binfo_for));
 735   if (TREE_CODE (vtbl) == VAR_DECL)
 736     vtbl = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (vtbl)), vtbl);
 737
 738   return vtbl;
 739 }
 740
 741 /* This code sets up the virtual function tables appropriate for
 742    the pointer DECL.  It is a one-ply initialization.
 743
 744    BINFO is the exact type that DECL is supposed to be.  In
 745    multiple inheritance, this might mean "C's A" if C : A, B.  */
 746
 747 static void
 748 expand_virtual_init (tree binfo, tree decl)
 749 {
 750   tree vtbl, vtbl_ptr;
 751   tree vtt_index;
 752
 753   /* Compute the initializer for vptr.  */
 754   vtbl = build_vtbl_address (binfo);
 755
 756   /* We may get this vptr from a VTT, if this is a subobject
 757      constructor or subobject destructor.  */
 758   vtt_index = BINFO_VPTR_INDEX (binfo);
 759   if (vtt_index)
 760     {
 761       tree vtbl2;
 762       tree vtt_parm;
 763
 764       /* Compute the value to use, when there's a VTT.  */
 765       vtt_parm = current_vtt_parm;
 766       vtbl2 = build (PLUS_EXPR,
 767                      TREE_TYPE (vtt_parm),
 768                      vtt_parm,
 769                      vtt_index);
 770       vtbl2 = build_indirect_ref (vtbl2, NULL);
 771       vtbl2 = convert (TREE_TYPE (vtbl), vtbl2);
 772
 773       /* The actual initializer is the VTT value only in the subobject
 774          constructor.  In maybe_clone_body we'll substitute NULL for
 775          the vtt_parm in the case of the non-subobject constructor.  */
 776       vtbl = build (COND_EXPR,
 777                     TREE_TYPE (vtbl),
 778                     build (EQ_EXPR, boolean_type_node,
 779                            current_in_charge_parm, integer_zero_node),
 780                     vtbl2,
 781                     vtbl);
 782     }
 783
 784   /* Compute the location of the vtpr.  */
 785   vtbl_ptr = build_vfield_ref (build_indirect_ref (decl, NULL),
 786                                TREE_TYPE (binfo));
 787   my_friendly_assert (vtbl_ptr != error_mark_node, 20010730);
 788
 789   /* Assign the vtable to the vptr.  */
 790   vtbl = convert_force (TREE_TYPE (vtbl_ptr), vtbl, 0);
 791   finish_expr_stmt (build_modify_expr (vtbl_ptr, NOP_EXPR, vtbl));
 792 }
 793
 794 /* If an exception is thrown in a constructor, those base classes already
 795    constructed must be destroyed.  This function creates the cleanup
 796    for BINFO, which has just been constructed.  If FLAG is non-NULL,
 797    it is a DECL which is nonzero when this base needs to be
 798    destroyed.  */
 799
 800 static void
 801 expand_cleanup_for_base (tree binfo, tree flag)
 802 {
 803   tree expr;
 804
 805   if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (binfo)))
 806     return;
 807
 808   /* Call the destructor.  */
 809   expr = build_special_member_call (current_class_ref,
 810                                     base_dtor_identifier,
 811                                     NULL_TREE,
 812                                     binfo,
 813                                     LOOKUP_NORMAL | LOOKUP_NONVIRTUAL);
 814   if (flag)
 815     expr = fold (build (COND_EXPR, void_type_node,
 816                         c_common_truthvalue_conversion (flag),
 817                         expr, integer_zero_node));
 818
 819   finish_eh_cleanup (expr);
 820 }
 821
 822 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its
 823    constructor.  */
 824
 825 static void
 826 construct_virtual_base (tree vbase, tree arguments)
 827 {
 828   tree inner_if_stmt;
 829   tree exp;
 830   tree flag;
 831
 832   /* If there are virtual base classes with destructors, we need to
 833      emit cleanups to destroy them if an exception is thrown during
 834      the construction process.  These exception regions (i.e., the
 835      period during which the cleanups must occur) begin from the time
 836      the construction is complete to the end of the function.  If we
 837      create a conditional block in which to initialize the
 838      base-classes, then the cleanup region for the virtual base begins
 839      inside a block, and ends outside of that block.  This situation
 840      confuses the sjlj exception-handling code.  Therefore, we do not
 841      create a single conditional block, but one for each
 842      initialization.  (That way the cleanup regions always begin
 843      in the outer block.)  We trust the back-end to figure out
 844      that the FLAG will not change across initializations, and
 845      avoid doing multiple tests.  */
 846   flag = TREE_CHAIN (DECL_ARGUMENTS (current_function_decl));
 847   inner_if_stmt = begin_if_stmt ();
 848   finish_if_stmt_cond (flag, inner_if_stmt);
 849
 850   /* Compute the location of the virtual base.  If we're
 851      constructing virtual bases, then we must be the most derived
 852      class.  Therefore, we don't have to look up the virtual base;
 853      we already know where it is.  */
 854   exp = convert_to_base_statically (current_class_ref, vbase);
 855
 856   expand_aggr_init_1 (vbase, current_class_ref, exp, arguments,
 857                       LOOKUP_COMPLAIN);
 858   finish_then_clause (inner_if_stmt);
 859   finish_if_stmt (inner_if_stmt);
 860
 861   expand_cleanup_for_base (vbase, flag);
 862 }
 863
 864 /* Find the context in which this FIELD can be initialized.  */
 865
 866 static tree
 867 initializing_context (tree field)
 868 {
 869   tree t = DECL_CONTEXT (field);
 870
 871   /* Anonymous union members can be initialized in the first enclosing
 872      non-anonymous union context.  */
 873   while (t && ANON_AGGR_TYPE_P (t))
 874     t = TYPE_CONTEXT (t);
 875   return t;
 876 }
 877
 878 /* Function to give error message if member initialization specification
 879    is erroneous.  FIELD is the member we decided to initialize.
 880    TYPE is the type for which the initialization is being performed.
 881    FIELD must be a member of TYPE.
 882
 883    MEMBER_NAME is the name of the member.  */
 884
 885 static int
 886 member_init_ok_or_else (tree field, tree type, tree member_name)
 887 {
 888   if (field == error_mark_node)
 889     return 0;
 890   if (!field)
 891     {
 892       error ("class `%T' does not have any field named `%D'", type,
 893              member_name);
 894       return 0;
 895     }
 896   if (TREE_CODE (field) == VAR_DECL)
 897     {
 898       error ("`%#D' is a static data member; it can only be "
 899              "initialized at its definition",
 900              field);
 901       return 0;
 902     }
 903   if (TREE_CODE (field) != FIELD_DECL)
 904     {
 905       error ("`%#D' is not a non-static data member of `%T'",
 906              field, type);
 907       return 0;
 908     }
 909   if (initializing_context (field) != type)
 910     {
 911       error ("class `%T' does not have any field named `%D'", type,
 912                 member_name);
 913       return 0;
 914     }
 915
 916   return 1;
 917 }
 918
 919 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it
 920    is a _TYPE node or TYPE_DECL which names a base for that type.
 921    Check the validity of NAME, and return either the base _TYPE, base
 922    binfo, or the FIELD_DECL of the member.  If NAME is invalid, return
 923    NULL_TREE and issue a diagnostic.
 924
 925    An old style unnamed direct single base construction is permitted,
 926    where NAME is NULL.  */
 927
 928 tree
 929 expand_member_init (tree name)
 930 {
 931   tree basetype;
 932   tree field;
 933
 934   if (!current_class_ref)
 935     return NULL_TREE;
 936
 937   if (!name)
 938     {
 939       /* This is an obsolete unnamed base class initializer.  The
 940          parser will already have warned about its use.  */
 941       switch (CLASSTYPE_N_BASECLASSES (current_class_type))
 942         {
 943         case 0:
 944           error ("unnamed initializer for `%T', which has no base classes",
 945                  current_class_type);
 946           return NULL_TREE;
 947         case 1:
 948           basetype = TYPE_BINFO_BASETYPE (current_class_type, 0);
 949           break;
 950         default:
 951           error ("unnamed initializer for `%T', which uses multiple inheritance",
 952                  current_class_type);
 953           return NULL_TREE;
 954       }
 955     }
 956   else if (TYPE_P (name))
 957     {
 958       basetype = TYPE_MAIN_VARIANT (name);
 959       name = TYPE_NAME (name);
 960     }
 961   else if (TREE_CODE (name) == TYPE_DECL)
 962     basetype = TYPE_MAIN_VARIANT (TREE_TYPE (name));
 963   else
 964     basetype = NULL_TREE;
 965
 966   if (basetype)
 967     {
 968       tree class_binfo;
 969       tree direct_binfo;
 970       tree virtual_binfo;
 971       int i;
 972
 973       if (current_template_parms)
 974         return basetype;
 975
 976       class_binfo = TYPE_BINFO (current_class_type);
 977       direct_binfo = NULL_TREE;
 978       virtual_binfo = NULL_TREE;
 979
 980       /* Look for a direct base.  */
 981       for (i = 0; i < BINFO_N_BASETYPES (class_binfo); ++i)
 982         if (same_type_p (basetype,
 983                          TYPE_BINFO_BASETYPE (current_class_type, i)))
 984           {
 985             direct_binfo = BINFO_BASETYPE (class_binfo, i);
 986             break;
 987           }
 988       /* Look for a virtual base -- unless the direct base is itself
 989          virtual.  */
 990       if (!direct_binfo || !TREE_VIA_VIRTUAL (direct_binfo))
 991         {
 992           virtual_binfo
 993             = purpose_member (basetype,
 994                               CLASSTYPE_VBASECLASSES (current_class_type));
 995           if (virtual_binfo)
 996             virtual_binfo = TREE_VALUE (virtual_binfo);
 997         }
 998
 999       /* [class.base.init]
1000
1001          If a mem-initializer-id is ambiguous because it designates
1002          both a direct non-virtual base class and an inherited virtual
1003          base class, the mem-initializer is ill-formed.  */
1004       if (direct_binfo && virtual_binfo)
1005         {
1006           error ("'%D' is both a direct base and an indirect virtual base",
1007                  basetype);
1008           return NULL_TREE;
1009         }
1010
1011       if (!direct_binfo && !virtual_binfo)
1012         {
1013           if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type))
1014             error ("type `%D' is not a direct or virtual base of `%T'",
1015                    name, current_class_type);
1016           else
1017             error ("type `%D' is not a direct base of `%T'",
1018                    name, current_class_type);
1019           return NULL_TREE;
1020         }
1021
1022       return direct_binfo ? direct_binfo : virtual_binfo;
1023     }
1024   else
1025     {
1026       if (TREE_CODE (name) == IDENTIFIER_NODE)
1027         field = lookup_field (current_class_type, name, 1, false);
1028       else
1029         field = name;
1030
1031       if (member_init_ok_or_else (field, current_class_type, name))
1032         return field;
1033     }
1034
1035   return NULL_TREE;
1036 }
1037
1038 /* This is like `expand_member_init', only it stores one aggregate
1039    value into another.
1040
1041    INIT comes in two flavors: it is either a value which
1042    is to be stored in EXP, or it is a parameter list
1043    to go to a constructor, which will operate on EXP.
1044    If INIT is not a parameter list for a constructor, then set
1045    LOOKUP_ONLYCONVERTING.
1046    If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1047    the initializer, if FLAGS is 0, then it is the (init) form.
1048    If `init' is a CONSTRUCTOR, then we emit a warning message,
1049    explaining that such initializations are invalid.
1050
1051    If INIT resolves to a CALL_EXPR which happens to return
1052    something of the type we are looking for, then we know
1053    that we can safely use that call to perform the
1054    initialization.
1055
1056    The virtual function table pointer cannot be set up here, because
1057    we do not really know its type.
1058
1059    This never calls operator=().
1060
1061    When initializing, nothing is CONST.
1062
1063    A default copy constructor may have to be used to perform the
1064    initialization.
1065
1066    A constructor or a conversion operator may have to be used to
1067    perform the initialization, but not both, as it would be ambiguous.  */
1068
1069 tree
1070 build_aggr_init (tree exp, tree init, int flags)
1071 {
1072   tree stmt_expr;
1073   tree compound_stmt;
1074   int destroy_temps;
1075   tree type = TREE_TYPE (exp);
1076   int was_const = TREE_READONLY (exp);
1077   int was_volatile = TREE_THIS_VOLATILE (exp);
1078   int is_global;
1079
1080   if (init == error_mark_node)
1081     return error_mark_node;
1082
1083   TREE_READONLY (exp) = 0;
1084   TREE_THIS_VOLATILE (exp) = 0;
1085
1086   if (init && TREE_CODE (init) != TREE_LIST)
1087     flags |= LOOKUP_ONLYCONVERTING;
1088
1089   if (TREE_CODE (type) == ARRAY_TYPE)
1090     {
1091       tree itype;
1092
1093       /* An array may not be initialized use the parenthesized
1094          initialization form -- unless the initializer is "()".  */
1095       if (init && TREE_CODE (init) == TREE_LIST)
1096         {
1097           error ("bad array initializer");
1098           return error_mark_node;
1099         }
1100       /* Must arrange to initialize each element of EXP
1101          from elements of INIT.  */
1102       itype = init ? TREE_TYPE (init) : NULL_TREE;
1103       if (cp_type_quals (type) != TYPE_UNQUALIFIED)
1104         TREE_TYPE (exp) = TYPE_MAIN_VARIANT (type);
1105       if (itype && cp_type_quals (itype) != TYPE_UNQUALIFIED)
1106         itype = TREE_TYPE (init) = TYPE_MAIN_VARIANT (itype);
1107       stmt_expr = build_vec_init (exp, NULL_TREE, init,
1108                                   itype && same_type_p (itype,
1109                                                         TREE_TYPE (exp)));
1110       TREE_READONLY (exp) = was_const;
1111       TREE_THIS_VOLATILE (exp) = was_volatile;
1112       TREE_TYPE (exp) = type;
1113       if (init)
1114         TREE_TYPE (init) = itype;
1115       return stmt_expr;
1116     }
1117
1118   if (TREE_CODE (exp) == VAR_DECL || TREE_CODE (exp) == PARM_DECL)
1119     /* Just know that we've seen something for this node.  */
1120     TREE_USED (exp) = 1;
1121
1122   TREE_TYPE (exp) = TYPE_MAIN_VARIANT (type);
1123   is_global = begin_init_stmts (&stmt_expr, &compound_stmt);
1124   destroy_temps = stmts_are_full_exprs_p ();
1125   current_stmt_tree ()->stmts_are_full_exprs_p = 0;
1126   expand_aggr_init_1 (TYPE_BINFO (type), exp, exp,
1127                       init, LOOKUP_NORMAL|flags);
1128   stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt);
1129   current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
1130   TREE_TYPE (exp) = type;
1131   TREE_READONLY (exp) = was_const;
1132   TREE_THIS_VOLATILE (exp) = was_volatile;
1133
1134   return stmt_expr;
1135 }
1136
1137 /* Like build_aggr_init, but not just for aggregates.  */
1138
1139 tree
1140 build_init (tree decl, tree init, int flags)
1141 {
1142   tree expr;
1143
1144   if (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
1145     expr = build_aggr_init (decl, init, flags);
1146   else if (CLASS_TYPE_P (TREE_TYPE (decl)))
1147     expr = build_special_member_call (decl, complete_ctor_identifier,
1148                                       build_tree_list (NULL_TREE, init),
1149                                       TYPE_BINFO (TREE_TYPE (decl)),
1150                                       LOOKUP_NORMAL|flags);
1151   else
1152     expr = build (INIT_EXPR, TREE_TYPE (decl), decl, init);
1153
1154   return expr;
1155 }
1156
1157 static void
1158 expand_default_init (tree binfo, tree true_exp, tree exp, tree init, int flags)
1159 {
1160   tree type = TREE_TYPE (exp);
1161   tree ctor_name;
1162
1163   /* It fails because there may not be a constructor which takes
1164      its own type as the first (or only parameter), but which does
1165      take other types via a conversion.  So, if the thing initializing
1166      the expression is a unit element of type X, first try X(X&),
1167      followed by initialization by X.  If neither of these work
1168      out, then look hard.  */
1169   tree rval;
1170   tree parms;
1171
1172   if (init && TREE_CODE (init) != TREE_LIST
1173       && (flags & LOOKUP_ONLYCONVERTING))
1174     {
1175       /* Base subobjects should only get direct-initialization.  */
1176       if (true_exp != exp)
1177         abort ();
1178
1179       if (flags & DIRECT_BIND)
1180         /* Do nothing.  We hit this in two cases:  Reference initialization,
1181            where we aren't initializing a real variable, so we don't want
1182            to run a new constructor; and catching an exception, where we
1183            have already built up the constructor call so we could wrap it
1184            in an exception region.  */;
1185       else if (BRACE_ENCLOSED_INITIALIZER_P (init))
1186         {
1187           /* A brace-enclosed initializer for an aggregate.  */
1188           my_friendly_assert (CP_AGGREGATE_TYPE_P (type), 20021016);
1189           init = digest_init (type, init, (tree *)NULL);
1190         }
1191       else
1192         init = ocp_convert (type, init, CONV_IMPLICIT|CONV_FORCE_TEMP, flags);
1193
1194       if (TREE_CODE (init) == MUST_NOT_THROW_EXPR)
1195         /* We need to protect the initialization of a catch parm with a
1196            call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
1197            around the TARGET_EXPR for the copy constructor.  See
1198            initialize_handler_parm.  */
1199         {
1200           TREE_OPERAND (init, 0) = build (INIT_EXPR, TREE_TYPE (exp), exp,
1201                                           TREE_OPERAND (init, 0));
1202           TREE_TYPE (init) = void_type_node;
1203         }
1204       else
1205         init = build (INIT_EXPR, TREE_TYPE (exp), exp, init);
1206       TREE_SIDE_EFFECTS (init) = 1;
1207       finish_expr_stmt (init);
1208       return;
1209     }
1210
1211   if (init == NULL_TREE
1212       || (TREE_CODE (init) == TREE_LIST && ! TREE_TYPE (init)))
1213     {
1214       parms = init;
1215       if (parms)
1216         init = TREE_VALUE (parms);
1217     }
1218   else
1219     parms = build_tree_list (NULL_TREE, init);
1220
1221   if (true_exp == exp)
1222     ctor_name = complete_ctor_identifier;
1223   else
1224     ctor_name = base_ctor_identifier;
1225
1226   rval = build_special_member_call (exp, ctor_name, parms, binfo, flags);
1227   if (TREE_SIDE_EFFECTS (rval))
1228     finish_expr_stmt (convert_to_void (rval, NULL));
1229 }
1230
1231 /* This function is responsible for initializing EXP with INIT
1232    (if any).
1233
1234    BINFO is the binfo of the type for who we are performing the
1235    initialization.  For example, if W is a virtual base class of A and B,
1236    and C : A, B.
1237    If we are initializing B, then W must contain B's W vtable, whereas
1238    were we initializing C, W must contain C's W vtable.
1239
1240    TRUE_EXP is nonzero if it is the true expression being initialized.
1241    In this case, it may be EXP, or may just contain EXP.  The reason we
1242    need this is because if EXP is a base element of TRUE_EXP, we
1243    don't necessarily know by looking at EXP where its virtual
1244    baseclass fields should really be pointing.  But we do know
1245    from TRUE_EXP.  In constructors, we don't know anything about
1246    the value being initialized.
1247
1248    FLAGS is just passed to `build_new_method_call'.  See that function
1249    for its description.  */
1250
1251 static void
1252 expand_aggr_init_1 (tree binfo, tree true_exp, tree exp, tree init, int flags)
1253 {
1254   tree type = TREE_TYPE (exp);
1255
1256   my_friendly_assert (init != error_mark_node && type != error_mark_node, 211);
1257   my_friendly_assert (building_stmt_tree (), 20021010);
1258
1259   /* Use a function returning the desired type to initialize EXP for us.
1260      If the function is a constructor, and its first argument is
1261      NULL_TREE, know that it was meant for us--just slide exp on
1262      in and expand the constructor.  Constructors now come
1263      as TARGET_EXPRs.  */
1264
1265   if (init && TREE_CODE (exp) == VAR_DECL
1266       && TREE_CODE (init) == CONSTRUCTOR
1267       && TREE_HAS_CONSTRUCTOR (init))
1268     {
1269       /* If store_init_value returns NULL_TREE, the INIT has been
1270          record in the DECL_INITIAL for EXP.  That means there's
1271          nothing more we have to do.  */
1272       init = store_init_value (exp, init);
1273       if (init)
1274         finish_expr_stmt (init);
1275       return;
1276     }
1277
1278   /* We know that expand_default_init can handle everything we want
1279      at this point.  */
1280   expand_default_init (binfo, true_exp, exp, init, flags);
1281 }
1282
1283 /* Report an error if TYPE is not a user-defined, aggregate type.  If
1284    OR_ELSE is nonzero, give an error message.  */
1285
1286 int
1287 is_aggr_type (tree type, int or_else)
1288 {
1289   if (type == error_mark_node)
1290     return 0;
1291
1292   if (! IS_AGGR_TYPE (type)
1293       && TREE_CODE (type) != TEMPLATE_TYPE_PARM
1294       && TREE_CODE (type) != BOUND_TEMPLATE_TEMPLATE_PARM)
1295     {
1296       if (or_else)
1297         error ("`%T' is not an aggregate type", type);
1298       return 0;
1299     }
1300   return 1;
1301 }
1302
1303 /* Like is_aggr_typedef, but returns typedef if successful.  */
1304
1305 tree
1306 get_aggr_from_typedef (tree name, int or_else)
1307 {
1308   tree type;
1309
1310   if (name == error_mark_node)
1311     return NULL_TREE;
1312
1313   if (IDENTIFIER_HAS_TYPE_VALUE (name))
1314     type = IDENTIFIER_TYPE_VALUE (name);
1315   else
1316     {
1317       if (or_else)
1318         error ("`%T' fails to be an aggregate typedef", name);
1319       return NULL_TREE;
1320     }
1321
1322   if (! IS_AGGR_TYPE (type)
1323       && TREE_CODE (type) != TEMPLATE_TYPE_PARM
1324       && TREE_CODE (type) != BOUND_TEMPLATE_TEMPLATE_PARM)
1325     {
1326       if (or_else)
1327         error ("type `%T' is of non-aggregate type", type);
1328       return NULL_TREE;
1329     }
1330   return type;
1331 }
1332
1333 tree
1334 get_type_value (tree name)
1335 {
1336   if (name == error_mark_node)
1337     return NULL_TREE;
1338
1339   if (IDENTIFIER_HAS_TYPE_VALUE (name))
1340     return IDENTIFIER_TYPE_VALUE (name);
1341   else
1342     return NULL_TREE;
1343 }
1344
1345 /* Build a reference to a member of an aggregate.  This is not a C++
1346    `&', but really something which can have its address taken, and
1347    then act as a pointer to member, for example TYPE :: FIELD can have
1348    its address taken by saying & TYPE :: FIELD.  ADDRESS_P is true if
1349    this expression is the operand of "&".
1350
1351    @@ Prints out lousy diagnostics for operator <typename>
1352    @@ fields.
1353
1354    @@ This function should be rewritten and placed in search.c.  */
1355
1356 tree
1357 build_offset_ref (tree type, tree name, bool address_p)
1358 {
1359   tree decl;
1360   tree member;
1361   tree basebinfo = NULL_TREE;
1362   tree orig_name = name;
1363
1364   /* class templates can come in as TEMPLATE_DECLs here.  */
1365   if (TREE_CODE (name) == TEMPLATE_DECL)
1366     return name;
1367
1368   if (processing_template_decl || uses_template_parms (type))
1369     return build_min_nt (SCOPE_REF, type, name);
1370
1371   if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
1372     {
1373       /* If the NAME is a TEMPLATE_ID_EXPR, we are looking at
1374          something like `a.template f<int>' or the like.  For the most
1375          part, we treat this just like a.f.  We do remember, however,
1376          the template-id that was used.  */
1377       name = TREE_OPERAND (orig_name, 0);
1378
1379       if (DECL_P (name))
1380         name = DECL_NAME (name);
1381       else
1382         {
1383           if (TREE_CODE (name) == COMPONENT_REF)
1384             name = TREE_OPERAND (name, 1);
1385           if (TREE_CODE (name) == OVERLOAD)
1386             name = DECL_NAME (OVL_CURRENT (name));
1387         }
1388
1389       my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 0);
1390     }
1391
1392   if (type == NULL_TREE)
1393     return error_mark_node;
1394
1395   /* Handle namespace names fully here.  */
1396   if (TREE_CODE (type) == NAMESPACE_DECL)
1397     {
1398       tree t = lookup_namespace_name (type, name);
1399       if (t == error_mark_node)
1400         return t;
1401       if (TREE_CODE (orig_name) == TEMPLATE_ID_EXPR)
1402         /* Reconstruct the TEMPLATE_ID_EXPR.  */
1403         t = build (TEMPLATE_ID_EXPR, TREE_TYPE (t),
1404                    t, TREE_OPERAND (orig_name, 1));
1405       if (! type_unknown_p (t))
1406         {
1407           mark_used (t);
1408           t = convert_from_reference (t);
1409         }
1410       return t;
1411     }
1412
1413   if (! is_aggr_type (type, 1))
1414     return error_mark_node;
1415
1416   if (TREE_CODE (name) == BIT_NOT_EXPR)
1417     {
1418       if (! check_dtor_name (type, name))
1419         error ("qualified type `%T' does not match destructor name `~%T'",
1420                   type, TREE_OPERAND (name, 0));
1421       name = dtor_identifier;
1422     }
1423
1424   if (!COMPLETE_TYPE_P (complete_type (type))
1425       && !TYPE_BEING_DEFINED (type))
1426     {
1427       error ("incomplete type `%T' does not have member `%D'", type,
1428                 name);
1429       return error_mark_node;
1430     }
1431
1432   decl = maybe_dummy_object (type, &basebinfo);
1433
1434   if (BASELINK_P (name) || DECL_P (name))
1435     member = name;
1436   else
1437     {
1438       member = lookup_member (basebinfo, name, 1, 0);
1439
1440       if (member == error_mark_node)
1441         return error_mark_node;
1442     }
1443
1444   if (!member)
1445     {
1446       error ("`%D' is not a member of type `%T'", name, type);
1447       return error_mark_node;
1448     }
1449
1450   if (TREE_CODE (member) == TYPE_DECL)
1451     {
1452       TREE_USED (member) = 1;
1453       return member;
1454     }
1455   /* static class members and class-specific enum
1456      values can be returned without further ado.  */
1457   if (TREE_CODE (member) == VAR_DECL || TREE_CODE (member) == CONST_DECL)
1458     {
1459       mark_used (member);
1460       return convert_from_reference (member);
1461     }
1462
1463   if (TREE_CODE (member) == FIELD_DECL && DECL_C_BIT_FIELD (member))
1464     {
1465       error ("invalid pointer to bit-field `%D'", member);
1466       return error_mark_node;
1467     }
1468
1469   /* A lot of this logic is now handled in lookup_member.  */
1470   if (BASELINK_P (member))
1471     {
1472       /* Go from the TREE_BASELINK to the member function info.  */
1473       tree fnfields = member;
1474       tree t = BASELINK_FUNCTIONS (fnfields);
1475
1476       if (TREE_CODE (orig_name) == TEMPLATE_ID_EXPR)
1477         {
1478           /* The FNFIELDS are going to contain functions that aren't
1479              necessarily templates, and templates that don't
1480              necessarily match the explicit template parameters.  We
1481              save all the functions, and the explicit parameters, and
1482              then figure out exactly what to instantiate with what
1483              arguments in instantiate_type.  */
1484
1485           if (TREE_CODE (t) != OVERLOAD)
1486             /* The code in instantiate_type which will process this
1487                expects to encounter OVERLOADs, not raw functions.  */
1488             t = ovl_cons (t, NULL_TREE);
1489
1490           t = build (TEMPLATE_ID_EXPR, TREE_TYPE (t), t,
1491                      TREE_OPERAND (orig_name, 1));
1492           t = build (OFFSET_REF, unknown_type_node, decl, t);
1493
1494           PTRMEM_OK_P (t) = 1;
1495
1496           return t;
1497         }
1498
1499       if (TREE_CODE (t) != TEMPLATE_ID_EXPR && !really_overloaded_fn (t))
1500         {
1501           /* Get rid of a potential OVERLOAD around it.  */
1502           t = OVL_CURRENT (t);
1503
1504           /* Unique functions are handled easily.  */
1505
1506           /* For non-static member of base class, we need a special rule
1507              for access checking [class.protected]:
1508
1509                If the access is to form a pointer to member, the
1510                nested-name-specifier shall name the derived class
1511                (or any class derived from that class).  */
1512           if (address_p && DECL_P (t)
1513               && DECL_NONSTATIC_MEMBER_P (t))
1514             perform_or_defer_access_check (TYPE_BINFO (type), t);
1515           else
1516             perform_or_defer_access_check (basebinfo, t);
1517
1518           mark_used (t);
1519           if (DECL_STATIC_FUNCTION_P (t))
1520             return t;
1521           member = t;
1522         }
1523       else
1524         {
1525           TREE_TYPE (fnfields) = unknown_type_node;
1526           member = fnfields;
1527         }
1528     }
1529   else if (address_p && TREE_CODE (member) == FIELD_DECL)
1530     /* We need additional test besides the one in
1531        check_accessibility_of_qualified_id in case it is
1532        a pointer to non-static member.  */
1533     perform_or_defer_access_check (TYPE_BINFO (type), member);
1534
1535   if (!address_p)
1536     {
1537       /* If MEMBER is non-static, then the program has fallen afoul of
1538          [expr.prim]:
1539
1540            An id-expression that denotes a nonstatic data member or
1541            nonstatic member function of a class can only be used:
1542
1543            -- as part of a class member access (_expr.ref_) in which the
1544            object-expression refers to the member's class or a class
1545            derived from that class, or
1546
1547            -- to form a pointer to member (_expr.unary.op_), or
1548
1549            -- in the body of a nonstatic member function of that class or
1550            of a class derived from that class (_class.mfct.nonstatic_), or
1551
1552            -- in a mem-initializer for a constructor for that class or for
1553            a class derived from that class (_class.base.init_).  */
1554       if (DECL_NONSTATIC_MEMBER_FUNCTION_P (member))
1555         {
1556           /* Build a representation of a the qualified name suitable
1557              for use as the operand to "&" -- even though the "&" is
1558              not actually present.  */
1559           member = build (OFFSET_REF, TREE_TYPE (member), decl, member);
1560           /* In Microsoft mode, treat a non-static member function as if
1561              it were a pointer-to-member.  */
1562           if (flag_ms_extensions)
1563             {
1564               PTRMEM_OK_P (member) = 1;
1565               return build_unary_op (ADDR_EXPR, member, 0);
1566             }
1567           error ("invalid use of non-static member function `%D'",
1568                  TREE_OPERAND (member, 1));
1569           return member;
1570         }
1571       else if (TREE_CODE (member) == FIELD_DECL)
1572         {
1573           error ("invalid use of non-static data member `%D'", member);
1574           return error_mark_node;
1575         }
1576       return member;
1577     }
1578
1579   /* In member functions, the form `type::name' is no longer
1580      equivalent to `this->type::name', at least not until
1581      resolve_offset_ref.  */
1582   member = build (OFFSET_REF, TREE_TYPE (member), decl, member);
1583   PTRMEM_OK_P (member) = 1;
1584   return member;
1585 }
1586
1587 /* If DECL is a `const' declaration, and its value is a known
1588    constant, then return that value.  */
1589
1590 tree
1591 decl_constant_value (tree decl)
1592 {
1593   /* When we build a COND_EXPR, we don't know whether it will be used
1594      as an lvalue or as an rvalue.  If it is an lvalue, it's not safe
1595      to replace the second and third operands with their
1596      initializers.  So, we do that here.  */
1597   if (TREE_CODE (decl) == COND_EXPR)
1598     {
1599       tree d1;
1600       tree d2;
1601
1602       d1 = decl_constant_value (TREE_OPERAND (decl, 1));
1603       d2 = decl_constant_value (TREE_OPERAND (decl, 2));
1604
1605       if (d1 != TREE_OPERAND (decl, 1) || d2 != TREE_OPERAND (decl, 2))
1606         return build (COND_EXPR,
1607                       TREE_TYPE (decl),
1608                       TREE_OPERAND (decl, 0), d1, d2);
1609     }
1610
1611   if (DECL_P (decl)
1612       && (/* Enumeration constants are constant.  */
1613           TREE_CODE (decl) == CONST_DECL
1614           /* And so are variables with a 'const' type -- unless they
1615              are also 'volatile'.  */
1616           || CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (decl)))
1617       && TREE_CODE (decl) != PARM_DECL
1618       && DECL_INITIAL (decl)
1619       && DECL_INITIAL (decl) != error_mark_node
1620       /* This is invalid if initial value is not constant.
1621          If it has either a function call, a memory reference,
1622          or a variable, then re-evaluating it could give different results.  */
1623       && TREE_CONSTANT (DECL_INITIAL (decl))
1624       /* Check for cases where this is sub-optimal, even though valid.  */
1625       && TREE_CODE (DECL_INITIAL (decl)) != CONSTRUCTOR)
1626     return DECL_INITIAL (decl);
1627   return decl;
1628 }
1629 \f
1630 /* Common subroutines of build_new and build_vec_delete.  */
1631
1632 /* Call the global __builtin_delete to delete ADDR.  */
1633
1634 static tree
1635 build_builtin_delete_call (tree addr)
1636 {
1637   mark_used (global_delete_fndecl);
1638   return build_call (global_delete_fndecl, build_tree_list (NULL_TREE, addr));
1639 }
1640 \f
1641 /* Generate a C++ "new" expression. DECL is either a TREE_LIST
1642    (which needs to go through some sort of groktypename) or it
1643    is the name of the class we are newing. INIT is an initialization value.
1644    It is either an EXPRLIST, an EXPR_NO_COMMAS, or something in braces.
1645    If INIT is void_type_node, it means do *not* call a constructor
1646    for this instance.
1647
1648    For types with constructors, the data returned is initialized
1649    by the appropriate constructor.
1650
1651    Whether the type has a constructor or not, if it has a pointer
1652    to a virtual function table, then that pointer is set up
1653    here.
1654
1655    Unless I am mistaken, a call to new () will return initialized
1656    data regardless of whether the constructor itself is private or
1657    not.  NOPE; new fails if the constructor is private (jcm).
1658
1659    Note that build_new does nothing to assure that any special
1660    alignment requirements of the type are met.  Rather, it leaves
1661    it up to malloc to do the right thing.  Otherwise, folding to
1662    the right alignment cal cause problems if the user tries to later
1663    free the memory returned by `new'.
1664
1665    PLACEMENT is the `placement' list for user-defined operator new ().  */
1666
1667 tree
1668 build_new (tree placement, tree decl, tree init, int use_global_new)
1669 {
1670   tree type, rval;
1671   tree nelts = NULL_TREE, t;
1672   int has_array = 0;
1673
1674   if (decl == error_mark_node)
1675     return error_mark_node;
1676
1677   if (TREE_CODE (decl) == TREE_LIST)
1678     {
1679       tree absdcl = TREE_VALUE (decl);
1680       tree last_absdcl = NULL_TREE;
1681
1682       if (current_function_decl
1683           && DECL_CONSTRUCTOR_P (current_function_decl))
1684         my_friendly_assert (immediate_size_expand == 0, 19990926);
1685
1686       nelts = integer_one_node;
1687
1688       if (absdcl && TREE_CODE (absdcl) == CALL_EXPR)
1689         abort ();
1690       while (absdcl && TREE_CODE (absdcl) == INDIRECT_REF)
1691         {
1692           last_absdcl = absdcl;
1693           absdcl = TREE_OPERAND (absdcl, 0);
1694         }
1695
1696       if (absdcl && TREE_CODE (absdcl) == ARRAY_REF)
1697         {
1698           /* Probably meant to be a vec new.  */
1699           tree this_nelts;
1700
1701           while (TREE_OPERAND (absdcl, 0)
1702                  && TREE_CODE (TREE_OPERAND (absdcl, 0)) == ARRAY_REF)
1703             {
1704               last_absdcl = absdcl;
1705               absdcl = TREE_OPERAND (absdcl, 0);
1706             }
1707
1708           has_array = 1;
1709           this_nelts = TREE_OPERAND (absdcl, 1);
1710           if (this_nelts != error_mark_node)
1711             {
1712               if (this_nelts == NULL_TREE)
1713                 error ("new of array type fails to specify size");
1714               else if (processing_template_decl)
1715                 {
1716                   nelts = this_nelts;
1717                   absdcl = TREE_OPERAND (absdcl, 0);
1718                 }
1719               else
1720                 {
1721                   if (build_expr_type_conversion (WANT_INT | WANT_ENUM,
1722                                                   this_nelts, false)
1723                       == NULL_TREE)
1724                     pedwarn ("size in array new must have integral type");
1725
1726                   this_nelts = save_expr (cp_convert (sizetype, this_nelts));
1727                   absdcl = TREE_OPERAND (absdcl, 0);
1728                   if (this_nelts == integer_zero_node)
1729                     {
1730                       warning ("zero size array reserves no space");
1731                       nelts = integer_zero_node;
1732                     }
1733                   else
1734                     nelts = cp_build_binary_op (MULT_EXPR, nelts, this_nelts);
1735                 }
1736             }
1737           else
1738             nelts = integer_zero_node;
1739         }
1740
1741       if (last_absdcl)
1742         TREE_OPERAND (last_absdcl, 0) = absdcl;
1743       else
1744         TREE_VALUE (decl) = absdcl;
1745
1746       type = groktypename (decl);
1747       if (! type || type == error_mark_node)
1748         return error_mark_node;
1749     }
1750   else if (TREE_CODE (decl) == IDENTIFIER_NODE)
1751     {
1752       if (IDENTIFIER_HAS_TYPE_VALUE (decl))
1753         {
1754           /* An aggregate type.  */
1755           type = IDENTIFIER_TYPE_VALUE (decl);
1756           decl = TYPE_MAIN_DECL (type);
1757         }
1758       else
1759         {
1760           /* A builtin type.  */
1761           decl = lookup_name (decl, 1);
1762           my_friendly_assert (TREE_CODE (decl) == TYPE_DECL, 215);
1763           type = TREE_TYPE (decl);
1764         }
1765     }
1766   else if (TREE_CODE (decl) == TYPE_DECL)
1767     {
1768       type = TREE_TYPE (decl);
1769     }
1770   else
1771     {
1772       type = decl;
1773       decl = TYPE_MAIN_DECL (type);
1774     }
1775
1776   if (processing_template_decl)
1777     {
1778       if (has_array)
1779         t = tree_cons (tree_cons (NULL_TREE, type, NULL_TREE),
1780                        build_min_nt (ARRAY_REF, NULL_TREE, nelts),
1781                        NULL_TREE);
1782       else
1783         t = type;
1784
1785       rval = build_min (NEW_EXPR, build_pointer_type (type),
1786                         placement, t, init);
1787       NEW_EXPR_USE_GLOBAL (rval) = use_global_new;
1788       TREE_SIDE_EFFECTS (rval) = 1;
1789       return rval;
1790     }
1791
1792   /* ``A reference cannot be created by the new operator.  A reference
1793      is not an object (8.2.2, 8.4.3), so a pointer to it could not be
1794      returned by new.'' ARM 5.3.3 */
1795   if (TREE_CODE (type) == REFERENCE_TYPE)
1796     {
1797       error ("new cannot be applied to a reference type");
1798       type = TREE_TYPE (type);
1799     }
1800
1801   if (TREE_CODE (type) == FUNCTION_TYPE)
1802     {
1803       error ("new cannot be applied to a function type");
1804       return error_mark_node;
1805     }
1806
1807   /* When the object being created is an array, the new-expression yields a
1808      pointer to the initial element (if any) of the array.  For example,
1809      both new int and new int[10] return an int*.  5.3.4.  */
1810   if (TREE_CODE (type) == ARRAY_TYPE && has_array == 0)
1811     {
1812       nelts = array_type_nelts_top (type);
1813       has_array = 1;
1814       type = TREE_TYPE (type);
1815     }
1816
1817   if (has_array)
1818     t = build_nt (ARRAY_REF, type, nelts);
1819   else
1820     t = type;
1821
1822   rval = build (NEW_EXPR, build_pointer_type (type), placement, t, init);
1823   NEW_EXPR_USE_GLOBAL (rval) = use_global_new;
1824   TREE_SIDE_EFFECTS (rval) = 1;
1825   rval = build_new_1 (rval);
1826   if (rval == error_mark_node)
1827     return error_mark_node;
1828
1829   /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain.  */
1830   rval = build1 (NOP_EXPR, TREE_TYPE (rval), rval);
1831   TREE_NO_WARNING (rval) = 1;
1832
1833   return rval;
1834 }
1835
1836 /* Given a Java class, return a decl for the corresponding java.lang.Class.  */
1837
1838 tree
1839 build_java_class_ref (tree type)
1840 {
1841   tree name = NULL_TREE, class_decl;
1842   static tree CL_suffix = NULL_TREE;
1843   if (CL_suffix == NULL_TREE)
1844     CL_suffix = get_identifier("class$");
1845   if (jclass_node == NULL_TREE)
1846     {
1847       jclass_node = IDENTIFIER_GLOBAL_VALUE (get_identifier ("jclass"));
1848       if (jclass_node == NULL_TREE)
1849         fatal_error ("call to Java constructor, while `jclass' undefined");
1850
1851       jclass_node = TREE_TYPE (jclass_node);
1852     }
1853
1854   /* Mangle the class$ field.  */
1855   {
1856     tree field;
1857     for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1858       if (DECL_NAME (field) == CL_suffix)
1859         {
1860           mangle_decl (field);
1861           name = DECL_ASSEMBLER_NAME (field);
1862           break;
1863         }
1864     if (!field)
1865       internal_error ("can't find class$");
1866     }
1867
1868   class_decl = IDENTIFIER_GLOBAL_VALUE (name);
1869   if (class_decl == NULL_TREE)
1870     {
1871       class_decl = build_decl (VAR_DECL, name, TREE_TYPE (jclass_node));
1872       TREE_STATIC (class_decl) = 1;
1873       DECL_EXTERNAL (class_decl) = 1;
1874       TREE_PUBLIC (class_decl) = 1;
1875       DECL_ARTIFICIAL (class_decl) = 1;
1876       DECL_IGNORED_P (class_decl) = 1;
1877       pushdecl_top_level (class_decl);
1878       make_decl_rtl (class_decl, NULL);
1879     }
1880   return class_decl;
1881 }
1882
1883 /* Returns the size of the cookie to use when allocating an array
1884    whose elements have the indicated TYPE.  Assumes that it is already
1885    known that a cookie is needed.  */
1886
1887 static tree
1888 get_cookie_size (tree type)
1889 {
1890   tree cookie_size;
1891
1892   /* We need to allocate an additional max (sizeof (size_t), alignof
1893      (true_type)) bytes.  */
1894   tree sizetype_size;
1895   tree type_align;
1896
1897   sizetype_size = size_in_bytes (sizetype);
1898   type_align = size_int (TYPE_ALIGN_UNIT (type));
1899   if (INT_CST_LT_UNSIGNED (type_align, sizetype_size))
1900     cookie_size = sizetype_size;
1901   else
1902     cookie_size = type_align;
1903
1904   return cookie_size;
1905 }
1906
1907 /* Called from cplus_expand_expr when expanding a NEW_EXPR.  The return
1908    value is immediately handed to expand_expr.  */
1909
1910 static tree
1911 build_new_1 (tree exp)
1912 {
1913   tree placement, init;
1914   tree true_type, size, rval;
1915   /* The type of the new-expression.  (This type is always a pointer
1916      type.)  */
1917   tree pointer_type;
1918   /* The type pointed to by POINTER_TYPE.  */
1919   tree type;
1920   /* The type being allocated.  For "new T[...]" this will be an
1921      ARRAY_TYPE.  */
1922   tree full_type;
1923   /* A pointer type pointing to to the FULL_TYPE.  */
1924   tree full_pointer_type;
1925   tree outer_nelts = NULL_TREE;
1926   tree nelts = NULL_TREE;
1927   tree alloc_call, alloc_expr;
1928   /* The address returned by the call to "operator new".  This node is
1929      a VAR_DECL and is therefore reusable.  */
1930   tree alloc_node;
1931   tree alloc_fn;
1932   tree cookie_expr, init_expr;
1933   int has_array = 0;
1934   enum tree_code code;
1935   int nothrow, check_new;
1936   /* Nonzero if the user wrote `::new' rather than just `new'.  */
1937   int globally_qualified_p;
1938   int use_java_new = 0;
1939   /* If non-NULL, the number of extra bytes to allocate at the
1940      beginning of the storage allocated for an array-new expression in
1941      order to store the number of elements.  */
1942   tree cookie_size = NULL_TREE;
1943   /* True if the function we are calling is a placement allocation
1944      function.  */
1945   bool placement_allocation_fn_p;
1946   tree args = NULL_TREE;
1947   /* True if the storage must be initialized, either by a constructor
1948      or due to an explicit new-initializer.  */
1949   bool is_initialized;
1950   /* The address of the thing allocated, not including any cookie.  In
1951      particular, if an array cookie is in use, DATA_ADDR is the
1952      address of the first array element.  This node is a VAR_DECL, and
1953      is therefore reusable.  */
1954   tree data_addr;
1955   tree init_preeval_expr = NULL_TREE;
1956
1957   placement = TREE_OPERAND (exp, 0);
1958   type = TREE_OPERAND (exp, 1);
1959   init = TREE_OPERAND (exp, 2);
1960   globally_qualified_p = NEW_EXPR_USE_GLOBAL (exp);
1961
1962   if (TREE_CODE (type) == ARRAY_REF)
1963     {
1964       has_array = 1;
1965       nelts = outer_nelts = TREE_OPERAND (type, 1);
1966       type = TREE_OPERAND (type, 0);
1967
1968       /* Use an incomplete array type to avoid VLA headaches.  */
1969       full_type = build_cplus_array_type (type, NULL_TREE);
1970     }
1971   else
1972     full_type = type;
1973
1974   true_type = type;
1975
1976   code = has_array ? VEC_NEW_EXPR : NEW_EXPR;
1977
1978   /* If our base type is an array, then make sure we know how many elements
1979      it has.  */
1980   while (TREE_CODE (true_type) == ARRAY_TYPE)
1981     {
1982       tree this_nelts = array_type_nelts_top (true_type);
1983       nelts = cp_build_binary_op (MULT_EXPR, nelts, this_nelts);
1984       true_type = TREE_TYPE (true_type);
1985     }
1986
1987   if (!complete_type_or_else (true_type, exp))
1988     return error_mark_node;
1989
1990   if (TREE_CODE (true_type) == VOID_TYPE)
1991     {
1992       error ("invalid type `void' for new");
1993       return error_mark_node;
1994     }
1995
1996   if (abstract_virtuals_error (NULL_TREE, true_type))
1997     return error_mark_node;
1998
1999   is_initialized = (TYPE_NEEDS_CONSTRUCTING (type) || init);
2000   if (CP_TYPE_CONST_P (true_type) && !is_initialized)
2001     {
2002       error ("uninitialized const in `new' of `%#T'", true_type);
2003       return error_mark_node;
2004     }
2005
2006   size = size_in_bytes (true_type);
2007   if (has_array)
2008     size = size_binop (MULT_EXPR, size, convert (sizetype, nelts));
2009
2010   /* Allocate the object.  */
2011   if (! placement && TYPE_FOR_JAVA (true_type))
2012     {
2013       tree class_addr, alloc_decl;
2014       tree class_decl = build_java_class_ref (true_type);
2015       static const char alloc_name[] = "_Jv_AllocObject";
2016
2017       use_java_new = 1;
2018       alloc_decl = NULL;
2019       if (!get_global_value_if_present (get_identifier (alloc_name),
2020                                         &alloc_decl))
2021         {
2022           error ("call to Java constructor with `%s' undefined", alloc_name);
2023           return error_mark_node;
2024         }
2025       else if (really_overloaded_fn (alloc_decl))
2026         {
2027           error ("`%D' should never be overloaded", alloc_decl);
2028           return error_mark_node;
2029         }
2030       alloc_decl = OVL_CURRENT (alloc_decl);
2031       class_addr = build1 (ADDR_EXPR, jclass_node, class_decl);
2032       alloc_call = (build_function_call
2033                     (alloc_decl,
2034                      build_tree_list (NULL_TREE, class_addr)));
2035     }
2036   else
2037     {
2038       tree fnname;
2039       tree fns;
2040
2041       fnname = ansi_opname (code);
2042
2043       if (!globally_qualified_p
2044           && CLASS_TYPE_P (true_type)
2045           && (has_array
2046               ? TYPE_HAS_ARRAY_NEW_OPERATOR (true_type)
2047               : TYPE_HAS_NEW_OPERATOR (true_type)))
2048         {
2049           /* Use a class-specific operator new.  */
2050           /* If a cookie is required, add some extra space.  */
2051           if (has_array && TYPE_VEC_NEW_USES_COOKIE (true_type))
2052             {
2053               cookie_size = get_cookie_size (true_type);
2054               size = size_binop (PLUS_EXPR, size, cookie_size);
2055             }
2056           /* Create the argument list.  */
2057           args = tree_cons (NULL_TREE, size, placement);
2058           /* Do name-lookup to find the appropriate operator.  */
2059           fns = lookup_fnfields (true_type, fnname, /*protect=*/2);
2060           if (TREE_CODE (fns) == TREE_LIST)
2061             {
2062               error ("request for member `%D' is ambiguous", fnname);
2063               print_candidates (fns);
2064               return error_mark_node;
2065             }
2066           alloc_call = build_new_method_call (build_dummy_object (true_type),
2067                                               fns, args,
2068                                               /*conversion_path=*/NULL_TREE,
2069                                               LOOKUP_NORMAL);
2070         }
2071       else
2072         {
2073           /* Use a global operator new.  */
2074           /* See if a cookie might be required.  */
2075           if (has_array && TYPE_VEC_NEW_USES_COOKIE (true_type))
2076             cookie_size = get_cookie_size (true_type);
2077           else
2078             cookie_size = NULL_TREE;
2079
2080           alloc_call = build_operator_new_call (fnname, placement,
2081                                                 &size, &cookie_size);
2082         }
2083     }
2084
2085   if (alloc_call == error_mark_node)
2086     return error_mark_node;
2087
2088   /* In the simple case, we can stop now.  */
2089   pointer_type = build_pointer_type (type);
2090   if (!cookie_size && !is_initialized)
2091     return build_nop (pointer_type, alloc_call);
2092
2093   /* While we're working, use a pointer to the type we've actually
2094      allocated. Store the result of the call in a variable so that we
2095      can use it more than once.  */
2096   full_pointer_type = build_pointer_type (full_type);
2097   alloc_expr = get_target_expr (build_nop (full_pointer_type, alloc_call));
2098   alloc_node = TARGET_EXPR_SLOT (alloc_expr);
2099
2100   /* Strip any COMPOUND_EXPRs from ALLOC_CALL.  */
2101   while (TREE_CODE (alloc_call) == COMPOUND_EXPR)
2102     alloc_call = TREE_OPERAND (alloc_call, 1);
2103   alloc_fn = get_callee_fndecl (alloc_call);
2104   my_friendly_assert (alloc_fn != NULL_TREE, 20020325);
2105
2106   /* Now, check to see if this function is actually a placement
2107      allocation function.  This can happen even when PLACEMENT is NULL
2108      because we might have something like:
2109
2110        struct S { void* operator new (size_t, int i = 0); };
2111
2112      A call to `new S' will get this allocation function, even though
2113      there is no explicit placement argument.  If there is more than
2114      one argument, or there are variable arguments, then this is a
2115      placement allocation function.  */
2116   placement_allocation_fn_p
2117     = (type_num_arguments (TREE_TYPE (alloc_fn)) > 1
2118        || varargs_function_p (alloc_fn));
2119
2120   /* Preevaluate the placement args so that we don't reevaluate them for a
2121      placement delete.  */
2122   if (placement_allocation_fn_p)
2123     {
2124       tree inits;
2125       stabilize_call (alloc_call, &inits);
2126       if (inits)
2127         alloc_expr = build (COMPOUND_EXPR, TREE_TYPE (alloc_expr), inits,
2128                             alloc_expr);
2129     }
2130
2131   /*        unless an allocation function is declared with an empty  excep-
2132      tion-specification  (_except.spec_),  throw(), it indicates failure to
2133      allocate storage by throwing a bad_alloc exception  (clause  _except_,
2134      _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2135      cation function is declared  with  an  empty  exception-specification,
2136      throw(), it returns null to indicate failure to allocate storage and a
2137      non-null pointer otherwise.
2138
2139      So check for a null exception spec on the op new we just called.  */
2140
2141   nothrow = TYPE_NOTHROW_P (TREE_TYPE (alloc_fn));
2142   check_new = (flag_check_new || nothrow) && ! use_java_new;
2143
2144   if (cookie_size)
2145     {
2146       tree cookie;
2147
2148       /* Adjust so we're pointing to the start of the object.  */
2149       data_addr = get_target_expr (build (PLUS_EXPR, full_pointer_type,
2150                                           alloc_node, cookie_size));
2151
2152       /* Store the number of bytes allocated so that we can know how
2153          many elements to destroy later.  We use the last sizeof
2154          (size_t) bytes to store the number of elements.  */
2155       cookie = build (MINUS_EXPR, build_pointer_type (sizetype),
2156                       data_addr, size_in_bytes (sizetype));
2157       cookie = build_indirect_ref (cookie, NULL);
2158
2159       cookie_expr = build (MODIFY_EXPR, sizetype, cookie, nelts);
2160       data_addr = TARGET_EXPR_SLOT (data_addr);
2161     }
2162   else
2163     {
2164       cookie_expr = NULL_TREE;
2165       data_addr = alloc_node;
2166     }
2167
2168   /* Now initialize the allocated object.  Note that we preevaluate the
2169      initialization expression, apart from the actual constructor call or
2170      assignment--we do this because we want to delay the allocation as long
2171      as possible in order to minimize the size of the exception region for
2172      placement delete.  */
2173   if (is_initialized)
2174     {
2175       bool stable;
2176
2177       init_expr = build_indirect_ref (data_addr, NULL);
2178
2179       if (init == void_zero_node)
2180         init = build_default_init (full_type, nelts);
2181       else if (init && has_array)
2182         pedwarn ("ISO C++ forbids initialization in array new");
2183
2184       if (has_array)
2185         {
2186           init_expr
2187             = build_vec_init (init_expr,
2188                               cp_build_binary_op (MINUS_EXPR, outer_nelts,
2189                                                   integer_one_node),
2190                               init, /*from_array=*/0);
2191
2192           /* An array initialization is stable because the initialization
2193              of each element is a full-expression, so the temporaries don't
2194              leak out.  */
2195           stable = true;
2196         }
2197       else if (TYPE_NEEDS_CONSTRUCTING (type))
2198         {
2199           init_expr = build_special_member_call (init_expr,
2200                                                  complete_ctor_identifier,
2201                                                  init, TYPE_BINFO (true_type),
2202                                                  LOOKUP_NORMAL);
2203           stable = stabilize_init (init_expr, &init_preeval_expr);
2204         }
2205       else
2206         {
2207           /* We are processing something like `new int (10)', which
2208              means allocate an int, and initialize it with 10.  */
2209
2210           if (TREE_CODE (init) == TREE_LIST)
2211             init = build_x_compound_expr_from_list (init, "new initializer");
2212
2213           else if (TREE_CODE (init) == CONSTRUCTOR
2214                    && TREE_TYPE (init) == NULL_TREE)
2215             abort ();
2216
2217           init_expr = build_modify_expr (init_expr, INIT_EXPR, init);
2218           stable = stabilize_init (init_expr, &init_preeval_expr);
2219         }
2220
2221       if (init_expr == error_mark_node)
2222         return error_mark_node;
2223
2224       /* If any part of the object initialization terminates by throwing an
2225          exception and a suitable deallocation function can be found, the
2226          deallocation function is called to free the memory in which the
2227          object was being constructed, after which the exception continues
2228          to propagate in the context of the new-expression. If no
2229          unambiguous matching deallocation function can be found,
2230          propagating the exception does not cause the object's memory to be
2231          freed.  */
2232       if (flag_exceptions && ! use_java_new)
2233         {
2234           enum tree_code dcode = has_array ? VEC_DELETE_EXPR : DELETE_EXPR;
2235           tree cleanup;
2236
2237           /* The Standard is unclear here, but the right thing to do
2238              is to use the same method for finding deallocation
2239              functions that we use for finding allocation functions.  */
2240           cleanup = build_op_delete_call (dcode, alloc_node, size,
2241                                           globally_qualified_p,
2242                                           (placement_allocation_fn_p
2243                                            ? alloc_call : NULL_TREE));
2244
2245           if (!cleanup)
2246             /* We're done.  */;
2247           else if (stable)
2248             /* This is much simpler if we were able to preevaluate all of
2249                the arguments to the constructor call.  */
2250             init_expr = build (TRY_CATCH_EXPR, void_type_node,
2251                                init_expr, cleanup);
2252           else
2253             /* Ack!  First we allocate the memory.  Then we set our sentry
2254                variable to true, and expand a cleanup that deletes the
2255                memory if sentry is true.  Then we run the constructor, and
2256                finally clear the sentry.
2257
2258                We need to do this because we allocate the space first, so
2259                if there are any temporaries with cleanups in the
2260                constructor args and we weren't able to preevaluate them, we
2261                need this EH region to extend until end of full-expression
2262                to preserve nesting.  */
2263             {
2264               tree end, sentry, begin;
2265
2266               begin = get_target_expr (boolean_true_node);
2267               CLEANUP_EH_ONLY (begin) = 1;
2268
2269               sentry = TARGET_EXPR_SLOT (begin);
2270
2271               TARGET_EXPR_CLEANUP (begin)
2272                 = build (COND_EXPR, void_type_node, sentry,
2273                          cleanup, void_zero_node);
2274
2275               end = build (MODIFY_EXPR, TREE_TYPE (sentry),
2276                            sentry, boolean_false_node);
2277
2278               init_expr
2279                 = build (COMPOUND_EXPR, void_type_node, begin,
2280                          build (COMPOUND_EXPR, void_type_node, init_expr,
2281                                 end));
2282             }
2283
2284         }
2285     }
2286   else
2287     init_expr = NULL_TREE;
2288
2289   /* Now build up the return value in reverse order.  */
2290
2291   rval = data_addr;
2292
2293   if (init_expr)
2294     rval = build (COMPOUND_EXPR, TREE_TYPE (rval), init_expr, rval);
2295   if (cookie_expr)
2296     rval = build (COMPOUND_EXPR, TREE_TYPE (rval), cookie_expr, rval);
2297
2298   if (rval == alloc_node)
2299     /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
2300        and return the call (which doesn't need to be adjusted).  */
2301     rval = TARGET_EXPR_INITIAL (alloc_expr);
2302   else
2303     {
2304       if (check_new)
2305         {
2306           tree ifexp = cp_build_binary_op (NE_EXPR, alloc_node,
2307                                            integer_zero_node);
2308           rval = build_conditional_expr (ifexp, rval, alloc_node);
2309         }
2310
2311       /* Perform the allocation before anything else, so that ALLOC_NODE
2312          has been initialized before we start using it.  */
2313       rval = build (COMPOUND_EXPR, TREE_TYPE (rval), alloc_expr, rval);
2314     }
2315
2316   if (init_preeval_expr)
2317     rval = build (COMPOUND_EXPR, TREE_TYPE (rval), init_preeval_expr, rval);
2318
2319   /* Convert to the final type.  */
2320   rval = build_nop (pointer_type, rval);
2321
2322   /* A new-expression is never an lvalue.  */
2323   if (real_lvalue_p (rval))
2324     rval = build1 (NON_LVALUE_EXPR, TREE_TYPE (rval), rval);
2325
2326   return rval;
2327 }
2328 \f
2329 static tree
2330 build_vec_delete_1 (tree base, tree maxindex, tree type,
2331     special_function_kind auto_delete_vec, int use_global_delete)
2332 {
2333   tree virtual_size;
2334   tree ptype = build_pointer_type (type = complete_type (type));
2335   tree size_exp = size_in_bytes (type);
2336
2337   /* Temporary variables used by the loop.  */
2338   tree tbase, tbase_init;
2339
2340   /* This is the body of the loop that implements the deletion of a
2341      single element, and moves temp variables to next elements.  */
2342   tree body;
2343
2344   /* This is the LOOP_EXPR that governs the deletion of the elements.  */
2345   tree loop = 0;
2346
2347   /* This is the thing that governs what to do after the loop has run.  */
2348   tree deallocate_expr = 0;
2349
2350   /* This is the BIND_EXPR which holds the outermost iterator of the
2351      loop.  It is convenient to set this variable up and test it before
2352      executing any other code in the loop.
2353      This is also the containing expression returned by this function.  */
2354   tree controller = NULL_TREE;
2355
2356   /* We should only have 1-D arrays here.  */
2357   if (TREE_CODE (type) == ARRAY_TYPE)
2358     abort ();
2359
2360   if (! IS_AGGR_TYPE (type) || TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
2361     goto no_destructor;
2362
2363   /* The below is short by the cookie size.  */
2364   virtual_size = size_binop (MULT_EXPR, size_exp,
2365                              convert (sizetype, maxindex));
2366
2367   tbase = create_temporary_var (ptype);
2368   tbase_init = build_modify_expr (tbase, NOP_EXPR,
2369                                   fold (build (PLUS_EXPR, ptype,
2370                                                base,
2371                                                virtual_size)));
2372   DECL_REGISTER (tbase) = 1;
2373   controller = build (BIND_EXPR, void_type_node, tbase, NULL_TREE, NULL_TREE);
2374   TREE_SIDE_EFFECTS (controller) = 1;
2375
2376   body = build (EXIT_EXPR, void_type_node,
2377                 build (EQ_EXPR, boolean_type_node, base, tbase));
2378   body = build_compound_expr
2379     (body, build_modify_expr (tbase, NOP_EXPR,
2380                               build (MINUS_EXPR, ptype, tbase, size_exp)));
2381   body = build_compound_expr
2382     (body, build_delete (ptype, tbase, sfk_complete_destructor,
2383                          LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 1));
2384
2385   loop = build (LOOP_EXPR, void_type_node, body);
2386   loop = build_compound_expr (tbase_init, loop);
2387
2388  no_destructor:
2389   /* If the delete flag is one, or anything else with the low bit set,
2390      delete the storage.  */
2391   if (auto_delete_vec != sfk_base_destructor)
2392     {
2393       tree base_tbd;
2394
2395       /* The below is short by the cookie size.  */
2396       virtual_size = size_binop (MULT_EXPR, size_exp,
2397                                  convert (sizetype, maxindex));
2398
2399       if (! TYPE_VEC_NEW_USES_COOKIE (type))
2400         /* no header */
2401         base_tbd = base;
2402       else
2403         {
2404           tree cookie_size;
2405
2406           cookie_size = get_cookie_size (type);
2407           base_tbd
2408             = cp_convert (ptype,
2409                           cp_build_binary_op (MINUS_EXPR,
2410                                               cp_convert (string_type_node,
2411                                                           base),
2412                                               cookie_size));
2413           /* True size with header.  */
2414           virtual_size = size_binop (PLUS_EXPR, virtual_size, cookie_size);
2415         }
2416
2417       if (auto_delete_vec == sfk_deleting_destructor)
2418         deallocate_expr = build_x_delete (base_tbd,
2419                                           2 | use_global_delete,
2420                                           virtual_size);
2421     }
2422
2423   body = loop;
2424   if (!deallocate_expr)
2425     ;
2426   else if (!body)
2427     body = deallocate_expr;
2428   else
2429     body = build_compound_expr (body, deallocate_expr);
2430
2431   if (!body)
2432     body = integer_zero_node;
2433
2434   /* Outermost wrapper: If pointer is null, punt.  */
2435   body = fold (build (COND_EXPR, void_type_node,
2436                       fold (build (NE_EXPR, boolean_type_node, base,
2437                                    convert (TREE_TYPE (base),
2438                                             integer_zero_node))),
2439                       body, integer_zero_node));
2440   body = build1 (NOP_EXPR, void_type_node, body);
2441
2442   if (controller)
2443     {
2444       TREE_OPERAND (controller, 1) = body;
2445       body = controller;
2446     }
2447
2448   if (TREE_CODE (base) == SAVE_EXPR)
2449     /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR.  */
2450     body = build (COMPOUND_EXPR, void_type_node, base, body);
2451
2452   return convert_to_void (body, /*implicit=*/NULL);
2453 }
2454
2455 /* Create an unnamed variable of the indicated TYPE.  */
2456
2457 tree
2458 create_temporary_var (tree type)
2459 {
2460   tree decl;
2461
2462   decl = build_decl (VAR_DECL, NULL_TREE, type);
2463   TREE_USED (decl) = 1;
2464   DECL_ARTIFICIAL (decl) = 1;
2465   DECL_SOURCE_LOCATION (decl) = input_location;
2466   DECL_IGNORED_P (decl) = 1;
2467   DECL_CONTEXT (decl) = current_function_decl;
2468
2469   return decl;
2470 }
2471
2472 /* Create a new temporary variable of the indicated TYPE, initialized
2473    to INIT.
2474
2475    It is not entered into current_binding_level, because that breaks
2476    things when it comes time to do final cleanups (which take place
2477    "outside" the binding contour of the function).  */
2478
2479 static tree
2480 get_temp_regvar (tree type, tree init)
2481 {
2482   tree decl;
2483
2484   decl = create_temporary_var (type);
2485   add_decl_stmt (decl);
2486
2487   finish_expr_stmt (build_modify_expr (decl, INIT_EXPR, init));
2488
2489   return decl;
2490 }
2491
2492 /* `build_vec_init' returns tree structure that performs
2493    initialization of a vector of aggregate types.
2494
2495    BASE is a reference to the vector, of ARRAY_TYPE.
2496    MAXINDEX is the maximum index of the array (one less than the
2497      number of elements).  It is only used if
2498      TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
2499    INIT is the (possibly NULL) initializer.
2500
2501    FROM_ARRAY is 0 if we should init everything with INIT
2502    (i.e., every element initialized from INIT).
2503    FROM_ARRAY is 1 if we should index into INIT in parallel
2504    with initialization of DECL.
2505    FROM_ARRAY is 2 if we should index into INIT in parallel,
2506    but use assignment instead of initialization.  */
2507
2508 tree
2509 build_vec_init (tree base, tree maxindex, tree init, int from_array)
2510 {
2511   tree rval;
2512   tree base2 = NULL_TREE;
2513   tree size;
2514   tree itype = NULL_TREE;
2515   tree iterator;
2516   /* The type of the array.  */
2517   tree atype = TREE_TYPE (base);
2518   /* The type of an element in the array.  */
2519   tree type = TREE_TYPE (atype);
2520   /* The type of a pointer to an element in the array.  */
2521   tree ptype;
2522   tree stmt_expr;
2523   tree compound_stmt;
2524   int destroy_temps;
2525   tree try_block = NULL_TREE;
2526   int num_initialized_elts = 0;
2527   bool is_global;
2528
2529   if (TYPE_DOMAIN (atype))
2530     maxindex = array_type_nelts (atype);
2531
2532   if (maxindex == NULL_TREE || maxindex == error_mark_node)
2533     return error_mark_node;
2534
2535   if (init
2536       && (from_array == 2
2537           ? (!CLASS_TYPE_P (type) || !TYPE_HAS_COMPLEX_ASSIGN_REF (type))
2538           : !TYPE_NEEDS_CONSTRUCTING (type))
2539       && ((TREE_CODE (init) == CONSTRUCTOR
2540            /* Don't do this if the CONSTRUCTOR might contain something
2541               that might throw and require us to clean up.  */
2542            && (CONSTRUCTOR_ELTS (init) == NULL_TREE
2543                || ! TYPE_HAS_NONTRIVIAL_DESTRUCTOR (target_type (type))))
2544           || from_array))
2545     {
2546       /* Do non-default initialization of POD arrays resulting from
2547          brace-enclosed initializers.  In this case, digest_init and
2548          store_constructor will handle the semantics for us.  */
2549
2550       stmt_expr = build (INIT_EXPR, atype, base, init);
2551       return stmt_expr;
2552     }
2553
2554   maxindex = cp_convert (ptrdiff_type_node, maxindex);
2555   ptype = build_pointer_type (type);
2556   size = size_in_bytes (type);
2557   if (TREE_CODE (TREE_TYPE (base)) == ARRAY_TYPE)
2558     base = cp_convert (ptype, decay_conversion (base));
2559
2560   /* The code we are generating looks like:
2561      ({
2562        T* t1 = (T*) base;
2563        T* rval = t1;
2564        ptrdiff_t iterator = maxindex;
2565        try {
2566          for (; iterator != -1; --iterator) {
2567            ... initialize *t1 ...
2568            ++t1;
2569          }
2570        } catch (...) {
2571          ... destroy elements that were constructed ...
2572        }
2573        rval;
2574      })
2575
2576      We can omit the try and catch blocks if we know that the
2577      initialization will never throw an exception, or if the array
2578      elements do not have destructors.  We can omit the loop completely if
2579      the elements of the array do not have constructors.
2580
2581      We actually wrap the entire body of the above in a STMT_EXPR, for
2582      tidiness.
2583
2584      When copying from array to another, when the array elements have
2585      only trivial copy constructors, we should use __builtin_memcpy
2586      rather than generating a loop.  That way, we could take advantage
2587      of whatever cleverness the back-end has for dealing with copies
2588      of blocks of memory.  */
2589
2590   is_global = begin_init_stmts (&stmt_expr, &compound_stmt);
2591   destroy_temps = stmts_are_full_exprs_p ();
2592   current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2593   rval = get_temp_regvar (ptype, base);
2594   base = get_temp_regvar (ptype, rval);
2595   iterator = get_temp_regvar (ptrdiff_type_node, maxindex);
2596
2597   /* Protect the entire array initialization so that we can destroy
2598      the partially constructed array if an exception is thrown.
2599      But don't do this if we're assigning.  */
2600   if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2601       && from_array != 2)
2602     {
2603       try_block = begin_try_block ();
2604     }
2605
2606   if (init != NULL_TREE && TREE_CODE (init) == CONSTRUCTOR)
2607     {
2608       /* Do non-default initialization of non-POD arrays resulting from
2609          brace-enclosed initializers.  */
2610
2611       tree elts;
2612       from_array = 0;
2613
2614       for (elts = CONSTRUCTOR_ELTS (init); elts; elts = TREE_CHAIN (elts))
2615         {
2616           tree elt = TREE_VALUE (elts);
2617           tree baseref = build1 (INDIRECT_REF, type, base);
2618
2619           num_initialized_elts++;
2620
2621           current_stmt_tree ()->stmts_are_full_exprs_p = 1;
2622           if (IS_AGGR_TYPE (type) || TREE_CODE (type) == ARRAY_TYPE)
2623             finish_expr_stmt (build_aggr_init (baseref, elt, 0));
2624           else
2625             finish_expr_stmt (build_modify_expr (baseref, NOP_EXPR,
2626                                                  elt));
2627           current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2628
2629           finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base, 0));
2630           finish_expr_stmt (build_unary_op (PREDECREMENT_EXPR, iterator, 0));
2631         }
2632
2633       /* Clear out INIT so that we don't get confused below.  */
2634       init = NULL_TREE;
2635     }
2636   else if (from_array)
2637     {
2638       /* If initializing one array from another, initialize element by
2639          element.  We rely upon the below calls the do argument
2640          checking.  */
2641       if (init)
2642         {
2643           base2 = decay_conversion (init);
2644           itype = TREE_TYPE (base2);
2645           base2 = get_temp_regvar (itype, base2);
2646           itype = TREE_TYPE (itype);
2647         }
2648       else if (TYPE_LANG_SPECIFIC (type)
2649                && TYPE_NEEDS_CONSTRUCTING (type)
2650                && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (type))
2651         {
2652           error ("initializer ends prematurely");
2653           return error_mark_node;
2654         }
2655     }
2656
2657   /* Now, default-initialize any remaining elements.  We don't need to
2658      do that if a) the type does not need constructing, or b) we've
2659      already initialized all the elements.
2660
2661      We do need to keep going if we're copying an array.  */
2662
2663   if (from_array
2664       || (TYPE_NEEDS_CONSTRUCTING (type)
2665           && ! (host_integerp (maxindex, 0)
2666                 && (num_initialized_elts
2667                     == tree_low_cst (maxindex, 0) + 1))))
2668     {
2669       /* If the ITERATOR is equal to -1, then we don't have to loop;
2670          we've already initialized all the elements.  */
2671       tree for_stmt;
2672       tree elt_init;
2673
2674       for_stmt = begin_for_stmt ();
2675       finish_for_init_stmt (for_stmt);
2676       finish_for_cond (build (NE_EXPR, boolean_type_node,
2677                               iterator, integer_minus_one_node),
2678                        for_stmt);
2679       finish_for_expr (build_unary_op (PREDECREMENT_EXPR, iterator, 0),
2680                        for_stmt);
2681
2682       if (from_array)
2683         {
2684           tree to = build1 (INDIRECT_REF, type, base);
2685           tree from;
2686
2687           if (base2)
2688             from = build1 (INDIRECT_REF, itype, base2);
2689           else
2690             from = NULL_TREE;
2691
2692           if (from_array == 2)
2693             elt_init = build_modify_expr (to, NOP_EXPR, from);
2694           else if (TYPE_NEEDS_CONSTRUCTING (type))
2695             elt_init = build_aggr_init (to, from, 0);
2696           else if (from)
2697             elt_init = build_modify_expr (to, NOP_EXPR, from);
2698           else
2699             abort ();
2700         }
2701       else if (TREE_CODE (type) == ARRAY_TYPE)
2702         {
2703           if (init != 0)
2704             sorry
2705               ("cannot initialize multi-dimensional array with initializer");
2706           elt_init = build_vec_init (build1 (INDIRECT_REF, type, base),
2707                                      0, 0, 0);
2708         }
2709       else
2710         elt_init = build_aggr_init (build1 (INDIRECT_REF, type, base),
2711                                     init, 0);
2712
2713       current_stmt_tree ()->stmts_are_full_exprs_p = 1;
2714       finish_expr_stmt (elt_init);
2715       current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2716
2717       finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base, 0));
2718       if (base2)
2719         finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base2, 0));
2720
2721       finish_for_stmt (for_stmt);
2722     }
2723
2724   /* Make sure to cleanup any partially constructed elements.  */
2725   if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2726       && from_array != 2)
2727     {
2728       tree e;
2729       tree m = cp_build_binary_op (MINUS_EXPR, maxindex, iterator);
2730
2731       /* Flatten multi-dimensional array since build_vec_delete only
2732          expects one-dimensional array.  */
2733       if (TREE_CODE (type) == ARRAY_TYPE)
2734         {
2735           m = cp_build_binary_op (MULT_EXPR, m,
2736                                   array_type_nelts_total (type));
2737           type = strip_array_types (type);
2738         }
2739
2740       finish_cleanup_try_block (try_block);
2741       e = build_vec_delete_1 (rval, m, type, sfk_base_destructor,
2742                               /*use_global_delete=*/0);
2743       finish_cleanup (e, try_block);
2744     }
2745
2746   /* The value of the array initialization is the array itself, RVAL
2747      is a pointer to the first element.  */
2748   finish_stmt_expr_expr (rval, stmt_expr);
2749
2750   stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt);
2751
2752   /* Now convert make the result have the correct type.  */
2753   atype = build_pointer_type (atype);
2754   stmt_expr = build1 (NOP_EXPR, atype, stmt_expr);
2755   stmt_expr = build_indirect_ref (stmt_expr, NULL);
2756
2757   current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
2758   return stmt_expr;
2759 }
2760
2761 /* Free up storage of type TYPE, at address ADDR.
2762
2763    TYPE is a POINTER_TYPE and can be ptr_type_node for no special type
2764    of pointer.
2765
2766    VIRTUAL_SIZE is the amount of storage that was allocated, and is
2767    used as the second argument to operator delete.  It can include
2768    things like padding and magic size cookies.  It has virtual in it,
2769    because if you have a base pointer and you delete through a virtual
2770    destructor, it should be the size of the dynamic object, not the
2771    static object, see Free Store 12.5 ISO C++.
2772
2773    This does not call any destructors.  */
2774
2775 tree
2776 build_x_delete (tree addr, int which_delete, tree virtual_size)
2777 {
2778   int use_global_delete = which_delete & 1;
2779   int use_vec_delete = !!(which_delete & 2);
2780   enum tree_code code = use_vec_delete ? VEC_DELETE_EXPR : DELETE_EXPR;
2781
2782   return build_op_delete_call (code, addr, virtual_size, use_global_delete,
2783                                NULL_TREE);
2784 }
2785
2786 /* Call the DTOR_KIND destructor for EXP.  FLAGS are as for
2787    build_delete.  */
2788
2789 static tree
2790 build_dtor_call (tree exp, special_function_kind dtor_kind, int flags)
2791 {
2792   tree name;
2793   tree fn;
2794   switch (dtor_kind)
2795     {
2796     case sfk_complete_destructor:
2797       name = complete_dtor_identifier;
2798       break;
2799
2800     case sfk_base_destructor:
2801       name = base_dtor_identifier;
2802       break;
2803
2804     case sfk_deleting_destructor:
2805       name = deleting_dtor_identifier;
2806       break;
2807
2808     default:
2809       abort ();
2810     }
2811
2812   exp = convert_from_reference (exp);
2813   fn = lookup_fnfields (TREE_TYPE (exp), name, /*protect=*/2);
2814   return build_new_method_call (exp, fn,
2815                                 /*args=*/NULL_TREE,
2816                                 /*conversion_path=*/NULL_TREE,
2817                                 flags);
2818 }
2819
2820 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
2821    ADDR is an expression which yields the store to be destroyed.
2822    AUTO_DELETE is the name of the destructor to call, i.e., either
2823    sfk_complete_destructor, sfk_base_destructor, or
2824    sfk_deleting_destructor.
2825
2826    FLAGS is the logical disjunction of zero or more LOOKUP_
2827    flags.  See cp-tree.h for more info.  */
2828
2829 tree
2830 build_delete (tree type, tree addr, special_function_kind auto_delete,
2831     int flags, int use_global_delete)
2832 {
2833   tree expr;
2834
2835   if (addr == error_mark_node)
2836     return error_mark_node;
2837
2838   /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
2839      set to `error_mark_node' before it gets properly cleaned up.  */
2840   if (type == error_mark_node)
2841     return error_mark_node;
2842
2843   type = TYPE_MAIN_VARIANT (type);
2844
2845   if (TREE_CODE (type) == POINTER_TYPE)
2846     {
2847       bool complete_p = true;
2848
2849       type = TYPE_MAIN_VARIANT (TREE_TYPE (type));
2850       if (TREE_CODE (type) == ARRAY_TYPE)
2851         goto handle_array;
2852
2853       /* We don't want to warn about delete of void*, only other
2854           incomplete types.  Deleting other incomplete types
2855           invokes undefined behavior, but it is not ill-formed, so
2856           compile to something that would even do The Right Thing
2857           (TM) should the type have a trivial dtor and no delete
2858           operator.  */
2859       if (!VOID_TYPE_P (type))
2860         {
2861           complete_type (type);
2862           if (!COMPLETE_TYPE_P (type))
2863             {
2864               warning ("possible problem detected in invocation of "
2865                        "delete operator:");
2866               cxx_incomplete_type_diagnostic (addr, type, 1);
2867               inform ("neither the destructor nor the class-specific "
2868                       "operator delete will be called, even if they are "
2869                       "declared when the class is defined.");
2870               complete_p = false;
2871             }
2872         }
2873       if (VOID_TYPE_P (type) || !complete_p || !IS_AGGR_TYPE (type))
2874         /* Call the builtin operator delete.  */
2875         return build_builtin_delete_call (addr);
2876       if (TREE_SIDE_EFFECTS (addr))
2877         addr = save_expr (addr);
2878
2879       /* Throw away const and volatile on target type of addr.  */
2880       addr = convert_force (build_pointer_type (type), addr, 0);
2881     }
2882   else if (TREE_CODE (type) == ARRAY_TYPE)
2883     {
2884     handle_array:
2885
2886       if (TYPE_DOMAIN (type) == NULL_TREE)
2887         {
2888           error ("unknown array size in delete");
2889           return error_mark_node;
2890         }
2891       return build_vec_delete (addr, array_type_nelts (type),
2892                                auto_delete, use_global_delete);
2893     }
2894   else
2895     {
2896       /* Don't check PROTECT here; leave that decision to the
2897          destructor.  If the destructor is accessible, call it,
2898          else report error.  */
2899       addr = build_unary_op (ADDR_EXPR, addr, 0);
2900       if (TREE_SIDE_EFFECTS (addr))
2901         addr = save_expr (addr);
2902
2903       addr = convert_force (build_pointer_type (type), addr, 0);
2904     }
2905
2906   my_friendly_assert (IS_AGGR_TYPE (type), 220);
2907
2908   if (TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
2909     {
2910       if (auto_delete != sfk_deleting_destructor)
2911         return void_zero_node;
2912
2913       return build_op_delete_call
2914         (DELETE_EXPR, addr, cxx_sizeof_nowarn (type), use_global_delete,
2915          NULL_TREE);
2916     }
2917   else
2918     {
2919       tree do_delete = NULL_TREE;
2920       tree ifexp;
2921
2922       my_friendly_assert (TYPE_HAS_DESTRUCTOR (type), 20011213);
2923
2924       /* For `::delete x', we must not use the deleting destructor
2925          since then we would not be sure to get the global `operator
2926          delete'.  */
2927       if (use_global_delete && auto_delete == sfk_deleting_destructor)
2928         {
2929           /* We will use ADDR multiple times so we must save it.  */
2930           addr = save_expr (addr);
2931           /* Delete the object.  */
2932           do_delete = build_builtin_delete_call (addr);
2933           /* Otherwise, treat this like a complete object destructor
2934              call.  */
2935           auto_delete = sfk_complete_destructor;
2936         }
2937       /* If the destructor is non-virtual, there is no deleting
2938          variant.  Instead, we must explicitly call the appropriate
2939          `operator delete' here.  */
2940       else if (!DECL_VIRTUAL_P (CLASSTYPE_DESTRUCTORS (type))
2941                && auto_delete == sfk_deleting_destructor)
2942         {
2943           /* We will use ADDR multiple times so we must save it.  */
2944           addr = save_expr (addr);
2945           /* Build the call.  */
2946           do_delete = build_op_delete_call (DELETE_EXPR,
2947                                             addr,
2948                                             cxx_sizeof_nowarn (type),
2949                                             /*global_p=*/false,
2950                                             NULL_TREE);
2951           /* Call the complete object destructor.  */
2952           auto_delete = sfk_complete_destructor;
2953         }
2954       else if (auto_delete == sfk_deleting_destructor
2955                && TYPE_GETS_REG_DELETE (type))
2956         {
2957           /* Make sure we have access to the member op delete, even though
2958              we'll actually be calling it from the destructor.  */
2959           build_op_delete_call (DELETE_EXPR, addr, cxx_sizeof_nowarn (type),
2960                                 /*global_p=*/false, NULL_TREE);
2961         }
2962
2963       expr = build_dtor_call (build_indirect_ref (addr, NULL),
2964                               auto_delete, flags);
2965       if (do_delete)
2966         expr = build (COMPOUND_EXPR, void_type_node, expr, do_delete);
2967
2968       if (flags & LOOKUP_DESTRUCTOR)
2969         /* Explicit destructor call; don't check for null pointer.  */
2970         ifexp = integer_one_node;
2971       else
2972         /* Handle deleting a null pointer.  */
2973         ifexp = fold (cp_build_binary_op (NE_EXPR, addr, integer_zero_node));
2974
2975       if (ifexp != integer_one_node)
2976         expr = build (COND_EXPR, void_type_node,
2977                       ifexp, expr, void_zero_node);
2978
2979       return expr;
2980     }
2981 }
2982
2983 /* At the beginning of a destructor, push cleanups that will call the
2984    destructors for our base classes and members.
2985
2986    Called from begin_destructor_body.  */
2987
2988 void
2989 push_base_cleanups (void)
2990 {
2991   tree binfos;
2992   int i, n_baseclasses;
2993   tree member;
2994   tree expr;
2995
2996   /* Run destructors for all virtual baseclasses.  */
2997   if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type))
2998     {
2999       tree vbases;
3000       tree cond = (condition_conversion
3001                    (build (BIT_AND_EXPR, integer_type_node,
3002                            current_in_charge_parm,
3003                            integer_two_node)));
3004
3005       vbases = CLASSTYPE_VBASECLASSES (current_class_type);
3006       /* The CLASSTYPE_VBASECLASSES list is in initialization
3007          order, which is also the right order for pushing cleanups.  */
3008       for (; vbases;
3009            vbases = TREE_CHAIN (vbases))
3010         {
3011           tree vbase = TREE_VALUE (vbases);
3012           tree base_type = BINFO_TYPE (vbase);
3013
3014           if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (base_type))
3015             {
3016               expr = build_special_member_call (current_class_ref,
3017                                                 base_dtor_identifier,
3018                                                 NULL_TREE,
3019                                                 vbase,
3020                                                 (LOOKUP_NORMAL
3021                                                  | LOOKUP_NONVIRTUAL));
3022               expr = build (COND_EXPR, void_type_node, cond,
3023                             expr, void_zero_node);
3024               finish_decl_cleanup (NULL_TREE, expr);
3025             }
3026         }
3027     }
3028
3029   binfos = BINFO_BASETYPES (TYPE_BINFO (current_class_type));
3030   n_baseclasses = CLASSTYPE_N_BASECLASSES (current_class_type);
3031
3032   /* Take care of the remaining baseclasses.  */
3033   for (i = 0; i < n_baseclasses; i++)
3034     {
3035       tree base_binfo = TREE_VEC_ELT (binfos, i);
3036       if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo))
3037           || TREE_VIA_VIRTUAL (base_binfo))
3038         continue;
3039
3040       expr = build_special_member_call (current_class_ref,
3041                                         base_dtor_identifier,
3042                                         NULL_TREE, base_binfo,
3043                                         LOOKUP_NORMAL | LOOKUP_NONVIRTUAL);
3044       finish_decl_cleanup (NULL_TREE, expr);
3045     }
3046
3047   for (member = TYPE_FIELDS (current_class_type); member;
3048        member = TREE_CHAIN (member))
3049     {
3050       if (TREE_CODE (member) != FIELD_DECL || DECL_ARTIFICIAL (member))
3051         continue;
3052       if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (member)))
3053         {
3054           tree this_member = (build_class_member_access_expr
3055                               (current_class_ref, member,
3056                                /*access_path=*/NULL_TREE,
3057                                /*preserve_reference=*/false));
3058           tree this_type = TREE_TYPE (member);
3059           expr = build_delete (this_type, this_member,
3060                                sfk_complete_destructor,
3061                                LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR|LOOKUP_NORMAL,
3062                                0);
3063           finish_decl_cleanup (NULL_TREE, expr);
3064         }
3065     }
3066 }
3067
3068 /* For type TYPE, delete the virtual baseclass objects of DECL.  */
3069
3070 tree
3071 build_vbase_delete (tree type, tree decl)
3072 {
3073   tree vbases = CLASSTYPE_VBASECLASSES (type);
3074   tree result;
3075   tree addr = build_unary_op (ADDR_EXPR, decl, 0);
3076
3077   my_friendly_assert (addr != error_mark_node, 222);
3078
3079   for (result = convert_to_void (integer_zero_node, NULL);
3080        vbases; vbases = TREE_CHAIN (vbases))
3081     {
3082       tree base_addr = convert_force
3083         (build_pointer_type (BINFO_TYPE (TREE_VALUE (vbases))), addr, 0);
3084       tree base_delete = build_delete
3085         (TREE_TYPE (base_addr), base_addr, sfk_base_destructor,
3086          LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 0);
3087
3088       result = build_compound_expr (result, base_delete);
3089     }
3090   return result;
3091 }
3092
3093 /* Build a C++ vector delete expression.
3094    MAXINDEX is the number of elements to be deleted.
3095    ELT_SIZE is the nominal size of each element in the vector.
3096    BASE is the expression that should yield the store to be deleted.
3097    This function expands (or synthesizes) these calls itself.
3098    AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
3099
3100    This also calls delete for virtual baseclasses of elements of the vector.
3101
3102    Update: MAXINDEX is no longer needed.  The size can be extracted from the
3103    start of the vector for pointers, and from the type for arrays.  We still
3104    use MAXINDEX for arrays because it happens to already have one of the
3105    values we'd have to extract.  (We could use MAXINDEX with pointers to
3106    confirm the size, and trap if the numbers differ; not clear that it'd
3107    be worth bothering.)  */
3108
3109 tree
3110 build_vec_delete (tree base, tree maxindex,
3111     special_function_kind auto_delete_vec, int use_global_delete)
3112 {
3113   tree type;
3114   tree rval;
3115   tree base_init = NULL_TREE;
3116
3117   type = TREE_TYPE (base);
3118
3119   if (TREE_CODE (type) == POINTER_TYPE)
3120     {
3121       /* Step back one from start of vector, and read dimension.  */
3122       tree cookie_addr;
3123
3124       if (TREE_SIDE_EFFECTS (base))
3125         {
3126           base_init = get_target_expr (base);
3127           base = TARGET_EXPR_SLOT (base_init);
3128         }
3129       type = strip_array_types (TREE_TYPE (type));
3130       cookie_addr = build (MINUS_EXPR,
3131                            build_pointer_type (sizetype),
3132                            base,
3133                            TYPE_SIZE_UNIT (sizetype));
3134       maxindex = build_indirect_ref (cookie_addr, NULL);
3135     }
3136   else if (TREE_CODE (type) == ARRAY_TYPE)
3137     {
3138       /* Get the total number of things in the array, maxindex is a
3139          bad name.  */
3140       maxindex = array_type_nelts_total (type);
3141       type = strip_array_types (type);
3142       base = build_unary_op (ADDR_EXPR, base, 1);
3143       if (TREE_SIDE_EFFECTS (base))
3144         {
3145           base_init = get_target_expr (base);
3146           base = TARGET_EXPR_SLOT (base_init);
3147         }
3148     }
3149   else
3150     {
3151       if (base != error_mark_node)
3152         error ("type to vector delete is neither pointer or array type");
3153       return error_mark_node;
3154     }
3155
3156   rval = build_vec_delete_1 (base, maxindex, type, auto_delete_vec,
3157                              use_global_delete);
3158   if (base_init)
3159     rval = build (COMPOUND_EXPR, TREE_TYPE (rval), base_init, rval);
3160
3161   return rval;
3162 }