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 (/*has_no_scope=*/true);
  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 compound_stmt;
 830   tree exp;
 831   tree flag;
 832
 833   /* If there are virtual base classes with destructors, we need to
 834      emit cleanups to destroy them if an exception is thrown during
 835      the construction process.  These exception regions (i.e., the
 836      period during which the cleanups must occur) begin from the time
 837      the construction is complete to the end of the function.  If we
 838      create a conditional block in which to initialize the
 839      base-classes, then the cleanup region for the virtual base begins
 840      inside a block, and ends outside of that block.  This situation
 841      confuses the sjlj exception-handling code.  Therefore, we do not
 842      create a single conditional block, but one for each
 843      initialization.  (That way the cleanup regions always begin
 844      in the outer block.)  We trust the back-end to figure out
 845      that the FLAG will not change across initializations, and
 846      avoid doing multiple tests.  */
 847   flag = TREE_CHAIN (DECL_ARGUMENTS (current_function_decl));
 848   inner_if_stmt = begin_if_stmt ();
 849   finish_if_stmt_cond (flag, inner_if_stmt);
 850   compound_stmt = begin_compound_stmt (/*has_no_scope=*/true);
 851
 852   /* Compute the location of the virtual base.  If we're
 853      constructing virtual bases, then we must be the most derived
 854      class.  Therefore, we don't have to look up the virtual base;
 855      we already know where it is.  */
 856   exp = convert_to_base_statically (current_class_ref, vbase);
 857
 858   expand_aggr_init_1 (vbase, current_class_ref, exp, arguments,
 859                       LOOKUP_COMPLAIN);
 860   finish_compound_stmt (compound_stmt);
 861   finish_then_clause (inner_if_stmt);
 862   finish_if_stmt ();
 863
 864   expand_cleanup_for_base (vbase, flag);
 865 }
 866
 867 /* Find the context in which this FIELD can be initialized.  */
 868
 869 static tree
 870 initializing_context (tree field)
 871 {
 872   tree t = DECL_CONTEXT (field);
 873
 874   /* Anonymous union members can be initialized in the first enclosing
 875      non-anonymous union context.  */
 876   while (t && ANON_AGGR_TYPE_P (t))
 877     t = TYPE_CONTEXT (t);
 878   return t;
 879 }
 880
 881 /* Function to give error message if member initialization specification
 882    is erroneous.  FIELD is the member we decided to initialize.
 883    TYPE is the type for which the initialization is being performed.
 884    FIELD must be a member of TYPE.
 885
 886    MEMBER_NAME is the name of the member.  */
 887
 888 static int
 889 member_init_ok_or_else (tree field, tree type, tree member_name)
 890 {
 891   if (field == error_mark_node)
 892     return 0;
 893   if (!field)
 894     {
 895       error ("class `%T' does not have any field named `%D'", type,
 896              member_name);
 897       return 0;
 898     }
 899   if (TREE_CODE (field) == VAR_DECL)
 900     {
 901       error ("`%#D' is a static data member; it can only be "
 902              "initialized at its definition",
 903              field);
 904       return 0;
 905     }
 906   if (TREE_CODE (field) != FIELD_DECL)
 907     {
 908       error ("`%#D' is not a non-static data member of `%T'",
 909              field, type);
 910       return 0;
 911     }
 912   if (initializing_context (field) != type)
 913     {
 914       error ("class `%T' does not have any field named `%D'", type,
 915                 member_name);
 916       return 0;
 917     }
 918
 919   return 1;
 920 }
 921
 922 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it
 923    is a _TYPE node or TYPE_DECL which names a base for that type.
 924    Check the validity of NAME, and return either the base _TYPE, base
 925    binfo, or the FIELD_DECL of the member.  If NAME is invalid, return
 926    NULL_TREE and issue a diagnostic.
 927
 928    An old style unnamed direct single base construction is permitted,
 929    where NAME is NULL.  */
 930
 931 tree
 932 expand_member_init (tree name)
 933 {
 934   tree basetype;
 935   tree field;
 936
 937   if (!current_class_ref)
 938     return NULL_TREE;
 939
 940   if (!name)
 941     {
 942       /* This is an obsolete unnamed base class initializer.  The
 943          parser will already have warned about its use.  */
 944       switch (CLASSTYPE_N_BASECLASSES (current_class_type))
 945         {
 946         case 0:
 947           error ("unnamed initializer for `%T', which has no base classes",
 948                  current_class_type);
 949           return NULL_TREE;
 950         case 1:
 951           basetype = TYPE_BINFO_BASETYPE (current_class_type, 0);
 952           break;
 953         default:
 954           error ("unnamed initializer for `%T', which uses multiple inheritance",
 955                  current_class_type);
 956           return NULL_TREE;
 957       }
 958     }
 959   else if (TYPE_P (name))
 960     {
 961       basetype = TYPE_MAIN_VARIANT (name);
 962       name = TYPE_NAME (name);
 963     }
 964   else if (TREE_CODE (name) == TYPE_DECL)
 965     basetype = TYPE_MAIN_VARIANT (TREE_TYPE (name));
 966   else
 967     basetype = NULL_TREE;
 968
 969   if (basetype)
 970     {
 971       tree class_binfo;
 972       tree direct_binfo;
 973       tree virtual_binfo;
 974       int i;
 975
 976       if (current_template_parms)
 977         return basetype;
 978
 979       class_binfo = TYPE_BINFO (current_class_type);
 980       direct_binfo = NULL_TREE;
 981       virtual_binfo = NULL_TREE;
 982
 983       /* Look for a direct base.  */
 984       for (i = 0; i < BINFO_N_BASETYPES (class_binfo); ++i)
 985         if (same_type_p (basetype,
 986                          TYPE_BINFO_BASETYPE (current_class_type, i)))
 987           {
 988             direct_binfo = BINFO_BASETYPE (class_binfo, i);
 989             break;
 990           }
 991       /* Look for a virtual base -- unless the direct base is itself
 992          virtual.  */
 993       if (!direct_binfo || !TREE_VIA_VIRTUAL (direct_binfo))
 994         {
 995           virtual_binfo
 996             = purpose_member (basetype,
 997                               CLASSTYPE_VBASECLASSES (current_class_type));
 998           if (virtual_binfo)
 999             virtual_binfo = TREE_VALUE (virtual_binfo);
1000         }
1001
1002       /* [class.base.init]
1003
1004          If a mem-initializer-id is ambiguous because it designates
1005          both a direct non-virtual base class and an inherited virtual
1006          base class, the mem-initializer is ill-formed.  */
1007       if (direct_binfo && virtual_binfo)
1008         {
1009           error ("'%D' is both a direct base and an indirect virtual base",
1010                  basetype);
1011           return NULL_TREE;
1012         }
1013
1014       if (!direct_binfo && !virtual_binfo)
1015         {
1016           if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type))
1017             error ("type `%D' is not a direct or virtual base of `%T'",
1018                    name, current_class_type);
1019           else
1020             error ("type `%D' is not a direct base of `%T'",
1021                    name, current_class_type);
1022           return NULL_TREE;
1023         }
1024
1025       return direct_binfo ? direct_binfo : virtual_binfo;
1026     }
1027   else
1028     {
1029       if (TREE_CODE (name) == IDENTIFIER_NODE)
1030         field = lookup_field (current_class_type, name, 1, false);
1031       else
1032         field = name;
1033
1034       if (member_init_ok_or_else (field, current_class_type, name))
1035         return field;
1036     }
1037
1038   return NULL_TREE;
1039 }
1040
1041 /* This is like `expand_member_init', only it stores one aggregate
1042    value into another.
1043
1044    INIT comes in two flavors: it is either a value which
1045    is to be stored in EXP, or it is a parameter list
1046    to go to a constructor, which will operate on EXP.
1047    If INIT is not a parameter list for a constructor, then set
1048    LOOKUP_ONLYCONVERTING.
1049    If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1050    the initializer, if FLAGS is 0, then it is the (init) form.
1051    If `init' is a CONSTRUCTOR, then we emit a warning message,
1052    explaining that such initializations are invalid.
1053
1054    If INIT resolves to a CALL_EXPR which happens to return
1055    something of the type we are looking for, then we know
1056    that we can safely use that call to perform the
1057    initialization.
1058
1059    The virtual function table pointer cannot be set up here, because
1060    we do not really know its type.
1061
1062    This never calls operator=().
1063
1064    When initializing, nothing is CONST.
1065
1066    A default copy constructor may have to be used to perform the
1067    initialization.
1068
1069    A constructor or a conversion operator may have to be used to
1070    perform the initialization, but not both, as it would be ambiguous.  */
1071
1072 tree
1073 build_aggr_init (tree exp, tree init, int flags)
1074 {
1075   tree stmt_expr;
1076   tree compound_stmt;
1077   int destroy_temps;
1078   tree type = TREE_TYPE (exp);
1079   int was_const = TREE_READONLY (exp);
1080   int was_volatile = TREE_THIS_VOLATILE (exp);
1081   int is_global;
1082
1083   if (init == error_mark_node)
1084     return error_mark_node;
1085
1086   TREE_READONLY (exp) = 0;
1087   TREE_THIS_VOLATILE (exp) = 0;
1088
1089   if (init && TREE_CODE (init) != TREE_LIST)
1090     flags |= LOOKUP_ONLYCONVERTING;
1091
1092   if (TREE_CODE (type) == ARRAY_TYPE)
1093     {
1094       tree itype;
1095
1096       /* An array may not be initialized use the parenthesized
1097          initialization form -- unless the initializer is "()".  */
1098       if (init && TREE_CODE (init) == TREE_LIST)
1099         {
1100           error ("bad array initializer");
1101           return error_mark_node;
1102         }
1103       /* Must arrange to initialize each element of EXP
1104          from elements of INIT.  */
1105       itype = init ? TREE_TYPE (init) : NULL_TREE;
1106       if (cp_type_quals (type) != TYPE_UNQUALIFIED)
1107         TREE_TYPE (exp) = TYPE_MAIN_VARIANT (type);
1108       if (itype && cp_type_quals (itype) != TYPE_UNQUALIFIED)
1109         itype = TREE_TYPE (init) = TYPE_MAIN_VARIANT (itype);
1110       stmt_expr = build_vec_init (exp, NULL_TREE, init,
1111                                   itype && same_type_p (itype,
1112                                                         TREE_TYPE (exp)));
1113       TREE_READONLY (exp) = was_const;
1114       TREE_THIS_VOLATILE (exp) = was_volatile;
1115       TREE_TYPE (exp) = type;
1116       if (init)
1117         TREE_TYPE (init) = itype;
1118       return stmt_expr;
1119     }
1120
1121   if (TREE_CODE (exp) == VAR_DECL || TREE_CODE (exp) == PARM_DECL)
1122     /* Just know that we've seen something for this node.  */
1123     TREE_USED (exp) = 1;
1124
1125   TREE_TYPE (exp) = TYPE_MAIN_VARIANT (type);
1126   is_global = begin_init_stmts (&stmt_expr, &compound_stmt);
1127   destroy_temps = stmts_are_full_exprs_p ();
1128   current_stmt_tree ()->stmts_are_full_exprs_p = 0;
1129   expand_aggr_init_1 (TYPE_BINFO (type), exp, exp,
1130                       init, LOOKUP_NORMAL|flags);
1131   stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt);
1132   current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
1133   TREE_TYPE (exp) = type;
1134   TREE_READONLY (exp) = was_const;
1135   TREE_THIS_VOLATILE (exp) = was_volatile;
1136
1137   return stmt_expr;
1138 }
1139
1140 /* Like build_aggr_init, but not just for aggregates.  */
1141
1142 tree
1143 build_init (tree decl, tree init, int flags)
1144 {
1145   tree expr;
1146
1147   if (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
1148     expr = build_aggr_init (decl, init, flags);
1149   else if (CLASS_TYPE_P (TREE_TYPE (decl)))
1150     expr = build_special_member_call (decl, complete_ctor_identifier,
1151                                       build_tree_list (NULL_TREE, init),
1152                                       TYPE_BINFO (TREE_TYPE (decl)),
1153                                       LOOKUP_NORMAL|flags);
1154   else
1155     expr = build (INIT_EXPR, TREE_TYPE (decl), decl, init);
1156
1157   return expr;
1158 }
1159
1160 static void
1161 expand_default_init (tree binfo, tree true_exp, tree exp, tree init, int flags)
1162 {
1163   tree type = TREE_TYPE (exp);
1164   tree ctor_name;
1165
1166   /* It fails because there may not be a constructor which takes
1167      its own type as the first (or only parameter), but which does
1168      take other types via a conversion.  So, if the thing initializing
1169      the expression is a unit element of type X, first try X(X&),
1170      followed by initialization by X.  If neither of these work
1171      out, then look hard.  */
1172   tree rval;
1173   tree parms;
1174
1175   if (init && TREE_CODE (init) != TREE_LIST
1176       && (flags & LOOKUP_ONLYCONVERTING))
1177     {
1178       /* Base subobjects should only get direct-initialization.  */
1179       if (true_exp != exp)
1180         abort ();
1181
1182       if (flags & DIRECT_BIND)
1183         /* Do nothing.  We hit this in two cases:  Reference initialization,
1184            where we aren't initializing a real variable, so we don't want
1185            to run a new constructor; and catching an exception, where we
1186            have already built up the constructor call so we could wrap it
1187            in an exception region.  */;
1188       else if (BRACE_ENCLOSED_INITIALIZER_P (init))
1189         {
1190           /* A brace-enclosed initializer for an aggregate.  */
1191           my_friendly_assert (CP_AGGREGATE_TYPE_P (type), 20021016);
1192           init = digest_init (type, init, (tree *)NULL);
1193         }
1194       else
1195         init = ocp_convert (type, init, CONV_IMPLICIT|CONV_FORCE_TEMP, flags);
1196
1197       if (TREE_CODE (init) == MUST_NOT_THROW_EXPR)
1198         /* We need to protect the initialization of a catch parm with a
1199            call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
1200            around the TARGET_EXPR for the copy constructor.  See
1201            initialize_handler_parm.  */
1202         {
1203           TREE_OPERAND (init, 0) = build (INIT_EXPR, TREE_TYPE (exp), exp,
1204                                           TREE_OPERAND (init, 0));
1205           TREE_TYPE (init) = void_type_node;
1206         }
1207       else
1208         init = build (INIT_EXPR, TREE_TYPE (exp), exp, init);
1209       TREE_SIDE_EFFECTS (init) = 1;
1210       finish_expr_stmt (init);
1211       return;
1212     }
1213
1214   if (init == NULL_TREE
1215       || (TREE_CODE (init) == TREE_LIST && ! TREE_TYPE (init)))
1216     {
1217       parms = init;
1218       if (parms)
1219         init = TREE_VALUE (parms);
1220     }
1221   else
1222     parms = build_tree_list (NULL_TREE, init);
1223
1224   if (true_exp == exp)
1225     ctor_name = complete_ctor_identifier;
1226   else
1227     ctor_name = base_ctor_identifier;
1228
1229   rval = build_special_member_call (exp, ctor_name, parms, binfo, flags);
1230   if (TREE_SIDE_EFFECTS (rval))
1231     finish_expr_stmt (convert_to_void (rval, NULL));
1232 }
1233
1234 /* This function is responsible for initializing EXP with INIT
1235    (if any).
1236
1237    BINFO is the binfo of the type for who we are performing the
1238    initialization.  For example, if W is a virtual base class of A and B,
1239    and C : A, B.
1240    If we are initializing B, then W must contain B's W vtable, whereas
1241    were we initializing C, W must contain C's W vtable.
1242
1243    TRUE_EXP is nonzero if it is the true expression being initialized.
1244    In this case, it may be EXP, or may just contain EXP.  The reason we
1245    need this is because if EXP is a base element of TRUE_EXP, we
1246    don't necessarily know by looking at EXP where its virtual
1247    baseclass fields should really be pointing.  But we do know
1248    from TRUE_EXP.  In constructors, we don't know anything about
1249    the value being initialized.
1250
1251    FLAGS is just passed to `build_new_method_call'.  See that function
1252    for its description.  */
1253
1254 static void
1255 expand_aggr_init_1 (tree binfo, tree true_exp, tree exp, tree init, int flags)
1256 {
1257   tree type = TREE_TYPE (exp);
1258
1259   my_friendly_assert (init != error_mark_node && type != error_mark_node, 211);
1260   my_friendly_assert (building_stmt_tree (), 20021010);
1261
1262   /* Use a function returning the desired type to initialize EXP for us.
1263      If the function is a constructor, and its first argument is
1264      NULL_TREE, know that it was meant for us--just slide exp on
1265      in and expand the constructor.  Constructors now come
1266      as TARGET_EXPRs.  */
1267
1268   if (init && TREE_CODE (exp) == VAR_DECL
1269       && TREE_CODE (init) == CONSTRUCTOR
1270       && TREE_HAS_CONSTRUCTOR (init))
1271     {
1272       /* If store_init_value returns NULL_TREE, the INIT has been
1273          record in the DECL_INITIAL for EXP.  That means there's
1274          nothing more we have to do.  */
1275       init = store_init_value (exp, init);
1276       if (init)
1277         finish_expr_stmt (init);
1278       return;
1279     }
1280
1281   /* We know that expand_default_init can handle everything we want
1282      at this point.  */
1283   expand_default_init (binfo, true_exp, exp, init, flags);
1284 }
1285
1286 /* Report an error if TYPE is not a user-defined, aggregate type.  If
1287    OR_ELSE is nonzero, give an error message.  */
1288
1289 int
1290 is_aggr_type (tree type, int or_else)
1291 {
1292   if (type == error_mark_node)
1293     return 0;
1294
1295   if (! IS_AGGR_TYPE (type)
1296       && TREE_CODE (type) != TEMPLATE_TYPE_PARM
1297       && TREE_CODE (type) != BOUND_TEMPLATE_TEMPLATE_PARM)
1298     {
1299       if (or_else)
1300         error ("`%T' is not an aggregate type", type);
1301       return 0;
1302     }
1303   return 1;
1304 }
1305
1306 /* Like is_aggr_typedef, but returns typedef if successful.  */
1307
1308 tree
1309 get_aggr_from_typedef (tree name, int or_else)
1310 {
1311   tree type;
1312
1313   if (name == error_mark_node)
1314     return NULL_TREE;
1315
1316   if (IDENTIFIER_HAS_TYPE_VALUE (name))
1317     type = IDENTIFIER_TYPE_VALUE (name);
1318   else
1319     {
1320       if (or_else)
1321         error ("`%T' fails to be an aggregate typedef", name);
1322       return NULL_TREE;
1323     }
1324
1325   if (! IS_AGGR_TYPE (type)
1326       && TREE_CODE (type) != TEMPLATE_TYPE_PARM
1327       && TREE_CODE (type) != BOUND_TEMPLATE_TEMPLATE_PARM)
1328     {
1329       if (or_else)
1330         error ("type `%T' is of non-aggregate type", type);
1331       return NULL_TREE;
1332     }
1333   return type;
1334 }
1335
1336 tree
1337 get_type_value (tree name)
1338 {
1339   if (name == error_mark_node)
1340     return NULL_TREE;
1341
1342   if (IDENTIFIER_HAS_TYPE_VALUE (name))
1343     return IDENTIFIER_TYPE_VALUE (name);
1344   else
1345     return NULL_TREE;
1346 }
1347
1348 /* Build a reference to a member of an aggregate.  This is not a C++
1349    `&', but really something which can have its address taken, and
1350    then act as a pointer to member, for example TYPE :: FIELD can have
1351    its address taken by saying & TYPE :: FIELD.  ADDRESS_P is true if
1352    this expression is the operand of "&".
1353
1354    @@ Prints out lousy diagnostics for operator <typename>
1355    @@ fields.
1356
1357    @@ This function should be rewritten and placed in search.c.  */
1358
1359 tree
1360 build_offset_ref (tree type, tree name, bool address_p)
1361 {
1362   tree decl;
1363   tree member;
1364   tree basebinfo = NULL_TREE;
1365   tree orig_name = name;
1366
1367   /* class templates can come in as TEMPLATE_DECLs here.  */
1368   if (TREE_CODE (name) == TEMPLATE_DECL)
1369     return name;
1370
1371   if (processing_template_decl || uses_template_parms (type))
1372     return build_min_nt (SCOPE_REF, type, name);
1373
1374   if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
1375     {
1376       /* If the NAME is a TEMPLATE_ID_EXPR, we are looking at
1377          something like `a.template f<int>' or the like.  For the most
1378          part, we treat this just like a.f.  We do remember, however,
1379          the template-id that was used.  */
1380       name = TREE_OPERAND (orig_name, 0);
1381
1382       if (DECL_P (name))
1383         name = DECL_NAME (name);
1384       else
1385         {
1386           if (TREE_CODE (name) == COMPONENT_REF)
1387             name = TREE_OPERAND (name, 1);
1388           if (TREE_CODE (name) == OVERLOAD)
1389             name = DECL_NAME (OVL_CURRENT (name));
1390         }
1391
1392       my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 0);
1393     }
1394
1395   if (type == NULL_TREE)
1396     return error_mark_node;
1397
1398   /* Handle namespace names fully here.  */
1399   if (TREE_CODE (type) == NAMESPACE_DECL)
1400     {
1401       tree t = lookup_namespace_name (type, name);
1402       if (t == error_mark_node)
1403         return t;
1404       if (TREE_CODE (orig_name) == TEMPLATE_ID_EXPR)
1405         /* Reconstruct the TEMPLATE_ID_EXPR.  */
1406         t = build (TEMPLATE_ID_EXPR, TREE_TYPE (t),
1407                    t, TREE_OPERAND (orig_name, 1));
1408       if (! type_unknown_p (t))
1409         {
1410           mark_used (t);
1411           t = convert_from_reference (t);
1412         }
1413       return t;
1414     }
1415
1416   if (! is_aggr_type (type, 1))
1417     return error_mark_node;
1418
1419   if (TREE_CODE (name) == BIT_NOT_EXPR)
1420     {
1421       if (! check_dtor_name (type, name))
1422         error ("qualified type `%T' does not match destructor name `~%T'",
1423                   type, TREE_OPERAND (name, 0));
1424       name = dtor_identifier;
1425     }
1426
1427   if (!COMPLETE_TYPE_P (complete_type (type))
1428       && !TYPE_BEING_DEFINED (type))
1429     {
1430       error ("incomplete type `%T' does not have member `%D'", type,
1431                 name);
1432       return error_mark_node;
1433     }
1434
1435   decl = maybe_dummy_object (type, &basebinfo);
1436
1437   if (BASELINK_P (name) || DECL_P (name))
1438     member = name;
1439   else
1440     {
1441       member = lookup_member (basebinfo, name, 1, 0);
1442
1443       if (member == error_mark_node)
1444         return error_mark_node;
1445     }
1446
1447   if (!member)
1448     {
1449       error ("`%D' is not a member of type `%T'", name, type);
1450       return error_mark_node;
1451     }
1452
1453   if (TREE_CODE (member) == TYPE_DECL)
1454     {
1455       TREE_USED (member) = 1;
1456       return member;
1457     }
1458   /* static class members and class-specific enum
1459      values can be returned without further ado.  */
1460   if (TREE_CODE (member) == VAR_DECL || TREE_CODE (member) == CONST_DECL)
1461     {
1462       mark_used (member);
1463       return convert_from_reference (member);
1464     }
1465
1466   if (TREE_CODE (member) == FIELD_DECL && DECL_C_BIT_FIELD (member))
1467     {
1468       error ("invalid pointer to bit-field `%D'", member);
1469       return error_mark_node;
1470     }
1471
1472   /* A lot of this logic is now handled in lookup_member.  */
1473   if (BASELINK_P (member))
1474     {
1475       /* Go from the TREE_BASELINK to the member function info.  */
1476       tree fnfields = member;
1477       tree t = BASELINK_FUNCTIONS (fnfields);
1478
1479       if (TREE_CODE (orig_name) == TEMPLATE_ID_EXPR)
1480         {
1481           /* The FNFIELDS are going to contain functions that aren't
1482              necessarily templates, and templates that don't
1483              necessarily match the explicit template parameters.  We
1484              save all the functions, and the explicit parameters, and
1485              then figure out exactly what to instantiate with what
1486              arguments in instantiate_type.  */
1487
1488           if (TREE_CODE (t) != OVERLOAD)
1489             /* The code in instantiate_type which will process this
1490                expects to encounter OVERLOADs, not raw functions.  */
1491             t = ovl_cons (t, NULL_TREE);
1492
1493           t = build (TEMPLATE_ID_EXPR, TREE_TYPE (t), t,
1494                      TREE_OPERAND (orig_name, 1));
1495           t = build (OFFSET_REF, unknown_type_node, decl, t);
1496
1497           PTRMEM_OK_P (t) = 1;
1498
1499           return t;
1500         }
1501
1502       if (TREE_CODE (t) != TEMPLATE_ID_EXPR && !really_overloaded_fn (t))
1503         {
1504           /* Get rid of a potential OVERLOAD around it.  */
1505           t = OVL_CURRENT (t);
1506
1507           /* Unique functions are handled easily.  */
1508
1509           /* For non-static member of base class, we need a special rule
1510              for access checking [class.protected]:
1511
1512                If the access is to form a pointer to member, the
1513                nested-name-specifier shall name the derived class
1514                (or any class derived from that class).  */
1515           if (address_p && DECL_P (t)
1516               && DECL_NONSTATIC_MEMBER_P (t))
1517             perform_or_defer_access_check (TYPE_BINFO (type), t);
1518           else
1519             perform_or_defer_access_check (basebinfo, t);
1520
1521           mark_used (t);
1522           if (DECL_STATIC_FUNCTION_P (t))
1523             return t;
1524           member = t;
1525         }
1526       else
1527         {
1528           TREE_TYPE (fnfields) = unknown_type_node;
1529           member = fnfields;
1530         }
1531     }
1532   else if (address_p && TREE_CODE (member) == FIELD_DECL)
1533     /* We need additional test besides the one in
1534        check_accessibility_of_qualified_id in case it is
1535        a pointer to non-static member.  */
1536     perform_or_defer_access_check (TYPE_BINFO (type), member);
1537
1538   if (!address_p)
1539     {
1540       /* If MEMBER is non-static, then the program has fallen afoul of
1541          [expr.prim]:
1542
1543            An id-expression that denotes a nonstatic data member or
1544            nonstatic member function of a class can only be used:
1545
1546            -- as part of a class member access (_expr.ref_) in which the
1547            object-expression refers to the member's class or a class
1548            derived from that class, or
1549
1550            -- to form a pointer to member (_expr.unary.op_), or
1551
1552            -- in the body of a nonstatic member function of that class or
1553            of a class derived from that class (_class.mfct.nonstatic_), or
1554
1555            -- in a mem-initializer for a constructor for that class or for
1556            a class derived from that class (_class.base.init_).  */
1557       if (DECL_NONSTATIC_MEMBER_FUNCTION_P (member))
1558         {
1559           /* Build a representation of a the qualified name suitable
1560              for use as the operand to "&" -- even though the "&" is
1561              not actually present.  */
1562           member = build (OFFSET_REF, TREE_TYPE (member), decl, member);
1563           /* In Microsoft mode, treat a non-static member function as if
1564              it were a pointer-to-member.  */
1565           if (flag_ms_extensions)
1566             {
1567               PTRMEM_OK_P (member) = 1;
1568               return build_unary_op (ADDR_EXPR, member, 0);
1569             }
1570           error ("invalid use of non-static member function `%D'",
1571                  TREE_OPERAND (member, 1));
1572           return member;
1573         }
1574       else if (TREE_CODE (member) == FIELD_DECL)
1575         {
1576           error ("invalid use of non-static data member `%D'", member);
1577           return error_mark_node;
1578         }
1579       return member;
1580     }
1581
1582   /* In member functions, the form `type::name' is no longer
1583      equivalent to `this->type::name', at least not until
1584      resolve_offset_ref.  */
1585   member = build (OFFSET_REF, TREE_TYPE (member), decl, member);
1586   PTRMEM_OK_P (member) = 1;
1587   return member;
1588 }
1589
1590 /* If DECL is a `const' declaration, and its value is a known
1591    constant, then return that value.  */
1592
1593 tree
1594 decl_constant_value (tree decl)
1595 {
1596   /* When we build a COND_EXPR, we don't know whether it will be used
1597      as an lvalue or as an rvalue.  If it is an lvalue, it's not safe
1598      to replace the second and third operands with their
1599      initializers.  So, we do that here.  */
1600   if (TREE_CODE (decl) == COND_EXPR)
1601     {
1602       tree d1;
1603       tree d2;
1604
1605       d1 = decl_constant_value (TREE_OPERAND (decl, 1));
1606       d2 = decl_constant_value (TREE_OPERAND (decl, 2));
1607
1608       if (d1 != TREE_OPERAND (decl, 1) || d2 != TREE_OPERAND (decl, 2))
1609         return build (COND_EXPR,
1610                       TREE_TYPE (decl),
1611                       TREE_OPERAND (decl, 0), d1, d2);
1612     }
1613
1614   if (DECL_P (decl)
1615       && (/* Enumeration constants are constant.  */
1616           TREE_CODE (decl) == CONST_DECL
1617           /* And so are variables with a 'const' type -- unless they
1618              are also 'volatile'.  */
1619           || CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (decl)))
1620       && TREE_CODE (decl) != PARM_DECL
1621       && DECL_INITIAL (decl)
1622       && DECL_INITIAL (decl) != error_mark_node
1623       /* This is invalid if initial value is not constant.
1624          If it has either a function call, a memory reference,
1625          or a variable, then re-evaluating it could give different results.  */
1626       && TREE_CONSTANT (DECL_INITIAL (decl))
1627       /* Check for cases where this is sub-optimal, even though valid.  */
1628       && TREE_CODE (DECL_INITIAL (decl)) != CONSTRUCTOR)
1629     return DECL_INITIAL (decl);
1630   return decl;
1631 }
1632 \f
1633 /* Common subroutines of build_new and build_vec_delete.  */
1634
1635 /* Call the global __builtin_delete to delete ADDR.  */
1636
1637 static tree
1638 build_builtin_delete_call (tree addr)
1639 {
1640   mark_used (global_delete_fndecl);
1641   return build_call (global_delete_fndecl, build_tree_list (NULL_TREE, addr));
1642 }
1643 \f
1644 /* Generate a C++ "new" expression. DECL is either a TREE_LIST
1645    (which needs to go through some sort of groktypename) or it
1646    is the name of the class we are newing. INIT is an initialization value.
1647    It is either an EXPRLIST, an EXPR_NO_COMMAS, or something in braces.
1648    If INIT is void_type_node, it means do *not* call a constructor
1649    for this instance.
1650
1651    For types with constructors, the data returned is initialized
1652    by the appropriate constructor.
1653
1654    Whether the type has a constructor or not, if it has a pointer
1655    to a virtual function table, then that pointer is set up
1656    here.
1657
1658    Unless I am mistaken, a call to new () will return initialized
1659    data regardless of whether the constructor itself is private or
1660    not.  NOPE; new fails if the constructor is private (jcm).
1661
1662    Note that build_new does nothing to assure that any special
1663    alignment requirements of the type are met.  Rather, it leaves
1664    it up to malloc to do the right thing.  Otherwise, folding to
1665    the right alignment cal cause problems if the user tries to later
1666    free the memory returned by `new'.
1667
1668    PLACEMENT is the `placement' list for user-defined operator new ().  */
1669
1670 tree
1671 build_new (tree placement, tree decl, tree init, int use_global_new)
1672 {
1673   tree type, rval;
1674   tree nelts = NULL_TREE, t;
1675   int has_array = 0;
1676
1677   if (decl == error_mark_node)
1678     return error_mark_node;
1679
1680   if (TREE_CODE (decl) == TREE_LIST)
1681     {
1682       tree absdcl = TREE_VALUE (decl);
1683       tree last_absdcl = NULL_TREE;
1684
1685       if (current_function_decl
1686           && DECL_CONSTRUCTOR_P (current_function_decl))
1687         my_friendly_assert (immediate_size_expand == 0, 19990926);
1688
1689       nelts = integer_one_node;
1690
1691       if (absdcl && TREE_CODE (absdcl) == CALL_EXPR)
1692         abort ();
1693       while (absdcl && TREE_CODE (absdcl) == INDIRECT_REF)
1694         {
1695           last_absdcl = absdcl;
1696           absdcl = TREE_OPERAND (absdcl, 0);
1697         }
1698
1699       if (absdcl && TREE_CODE (absdcl) == ARRAY_REF)
1700         {
1701           /* Probably meant to be a vec new.  */
1702           tree this_nelts;
1703
1704           while (TREE_OPERAND (absdcl, 0)
1705                  && TREE_CODE (TREE_OPERAND (absdcl, 0)) == ARRAY_REF)
1706             {
1707               last_absdcl = absdcl;
1708               absdcl = TREE_OPERAND (absdcl, 0);
1709             }
1710
1711           has_array = 1;
1712           this_nelts = TREE_OPERAND (absdcl, 1);
1713           if (this_nelts != error_mark_node)
1714             {
1715               if (this_nelts == NULL_TREE)
1716                 error ("new of array type fails to specify size");
1717               else if (processing_template_decl)
1718                 {
1719                   nelts = this_nelts;
1720                   absdcl = TREE_OPERAND (absdcl, 0);
1721                 }
1722               else
1723                 {
1724                   if (build_expr_type_conversion (WANT_INT | WANT_ENUM,
1725                                                   this_nelts, false)
1726                       == NULL_TREE)
1727                     pedwarn ("size in array new must have integral type");
1728
1729                   this_nelts = save_expr (cp_convert (sizetype, this_nelts));
1730                   absdcl = TREE_OPERAND (absdcl, 0);
1731                   if (this_nelts == integer_zero_node)
1732                     {
1733                       warning ("zero size array reserves no space");
1734                       nelts = integer_zero_node;
1735                     }
1736                   else
1737                     nelts = cp_build_binary_op (MULT_EXPR, nelts, this_nelts);
1738                 }
1739             }
1740           else
1741             nelts = integer_zero_node;
1742         }
1743
1744       if (last_absdcl)
1745         TREE_OPERAND (last_absdcl, 0) = absdcl;
1746       else
1747         TREE_VALUE (decl) = absdcl;
1748
1749       type = groktypename (decl);
1750       if (! type || type == error_mark_node)
1751         return error_mark_node;
1752     }
1753   else if (TREE_CODE (decl) == IDENTIFIER_NODE)
1754     {
1755       if (IDENTIFIER_HAS_TYPE_VALUE (decl))
1756         {
1757           /* An aggregate type.  */
1758           type = IDENTIFIER_TYPE_VALUE (decl);
1759           decl = TYPE_MAIN_DECL (type);
1760         }
1761       else
1762         {
1763           /* A builtin type.  */
1764           decl = lookup_name (decl, 1);
1765           my_friendly_assert (TREE_CODE (decl) == TYPE_DECL, 215);
1766           type = TREE_TYPE (decl);
1767         }
1768     }
1769   else if (TREE_CODE (decl) == TYPE_DECL)
1770     {
1771       type = TREE_TYPE (decl);
1772     }
1773   else
1774     {
1775       type = decl;
1776       decl = TYPE_MAIN_DECL (type);
1777     }
1778
1779   if (processing_template_decl)
1780     {
1781       if (has_array)
1782         t = tree_cons (tree_cons (NULL_TREE, type, NULL_TREE),
1783                        build_min_nt (ARRAY_REF, NULL_TREE, nelts),
1784                        NULL_TREE);
1785       else
1786         t = type;
1787
1788       rval = build_min (NEW_EXPR, build_pointer_type (type),
1789                         placement, t, init);
1790       NEW_EXPR_USE_GLOBAL (rval) = use_global_new;
1791       return rval;
1792     }
1793
1794   /* ``A reference cannot be created by the new operator.  A reference
1795      is not an object (8.2.2, 8.4.3), so a pointer to it could not be
1796      returned by new.'' ARM 5.3.3 */
1797   if (TREE_CODE (type) == REFERENCE_TYPE)
1798     {
1799       error ("new cannot be applied to a reference type");
1800       type = TREE_TYPE (type);
1801     }
1802
1803   if (TREE_CODE (type) == FUNCTION_TYPE)
1804     {
1805       error ("new cannot be applied to a function type");
1806       return error_mark_node;
1807     }
1808
1809   /* When the object being created is an array, the new-expression yields a
1810      pointer to the initial element (if any) of the array.  For example,
1811      both new int and new int[10] return an int*.  5.3.4.  */
1812   if (TREE_CODE (type) == ARRAY_TYPE && has_array == 0)
1813     {
1814       nelts = array_type_nelts_top (type);
1815       has_array = 1;
1816       type = TREE_TYPE (type);
1817     }
1818
1819   if (has_array)
1820     t = build_nt (ARRAY_REF, type, nelts);
1821   else
1822     t = type;
1823
1824   rval = build (NEW_EXPR, build_pointer_type (type), placement, t, init);
1825   NEW_EXPR_USE_GLOBAL (rval) = use_global_new;
1826   TREE_SIDE_EFFECTS (rval) = 1;
1827   rval = build_new_1 (rval);
1828   if (rval == error_mark_node)
1829     return error_mark_node;
1830
1831   /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain.  */
1832   rval = build1 (NOP_EXPR, TREE_TYPE (rval), rval);
1833   TREE_NO_WARNING (rval) = 1;
1834
1835   return rval;
1836 }
1837
1838 /* Given a Java class, return a decl for the corresponding java.lang.Class.  */
1839
1840 tree
1841 build_java_class_ref (tree type)
1842 {
1843   tree name = NULL_TREE, class_decl;
1844   static tree CL_suffix = NULL_TREE;
1845   if (CL_suffix == NULL_TREE)
1846     CL_suffix = get_identifier("class$");
1847   if (jclass_node == NULL_TREE)
1848     {
1849       jclass_node = IDENTIFIER_GLOBAL_VALUE (get_identifier ("jclass"));
1850       if (jclass_node == NULL_TREE)
1851         fatal_error ("call to Java constructor, while `jclass' undefined");
1852
1853       jclass_node = TREE_TYPE (jclass_node);
1854     }
1855
1856   /* Mangle the class$ field.  */
1857   {
1858     tree field;
1859     for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field))
1860       if (DECL_NAME (field) == CL_suffix)
1861         {
1862           mangle_decl (field);
1863           name = DECL_ASSEMBLER_NAME (field);
1864           break;
1865         }
1866     if (!field)
1867       internal_error ("can't find class$");
1868     }
1869
1870   class_decl = IDENTIFIER_GLOBAL_VALUE (name);
1871   if (class_decl == NULL_TREE)
1872     {
1873       class_decl = build_decl (VAR_DECL, name, TREE_TYPE (jclass_node));
1874       TREE_STATIC (class_decl) = 1;
1875       DECL_EXTERNAL (class_decl) = 1;
1876       TREE_PUBLIC (class_decl) = 1;
1877       DECL_ARTIFICIAL (class_decl) = 1;
1878       DECL_IGNORED_P (class_decl) = 1;
1879       pushdecl_top_level (class_decl);
1880       make_decl_rtl (class_decl, NULL);
1881     }
1882   return class_decl;
1883 }
1884
1885 /* Returns the size of the cookie to use when allocating an array
1886    whose elements have the indicated TYPE.  Assumes that it is already
1887    known that a cookie is needed.  */
1888
1889 static tree
1890 get_cookie_size (tree type)
1891 {
1892   tree cookie_size;
1893
1894   /* We need to allocate an additional max (sizeof (size_t), alignof
1895      (true_type)) bytes.  */
1896   tree sizetype_size;
1897   tree type_align;
1898
1899   sizetype_size = size_in_bytes (sizetype);
1900   type_align = size_int (TYPE_ALIGN_UNIT (type));
1901   if (INT_CST_LT_UNSIGNED (type_align, sizetype_size))
1902     cookie_size = sizetype_size;
1903   else
1904     cookie_size = type_align;
1905
1906   return cookie_size;
1907 }
1908
1909 /* Called from cplus_expand_expr when expanding a NEW_EXPR.  The return
1910    value is immediately handed to expand_expr.  */
1911
1912 static tree
1913 build_new_1 (tree exp)
1914 {
1915   tree placement, init;
1916   tree true_type, size, rval;
1917   /* The type of the new-expression.  (This type is always a pointer
1918      type.)  */
1919   tree pointer_type;
1920   /* The type pointed to by POINTER_TYPE.  */
1921   tree type;
1922   /* The type being allocated.  For "new T[...]" this will be an
1923      ARRAY_TYPE.  */
1924   tree full_type;
1925   /* A pointer type pointing to to the FULL_TYPE.  */
1926   tree full_pointer_type;
1927   tree outer_nelts = NULL_TREE;
1928   tree nelts = NULL_TREE;
1929   tree alloc_call, alloc_expr;
1930   /* The address returned by the call to "operator new".  This node is
1931      a VAR_DECL and is therefore reusable.  */
1932   tree alloc_node;
1933   tree alloc_fn;
1934   tree cookie_expr, init_expr;
1935   int has_array = 0;
1936   enum tree_code code;
1937   int nothrow, check_new;
1938   /* Nonzero if the user wrote `::new' rather than just `new'.  */
1939   int globally_qualified_p;
1940   int use_java_new = 0;
1941   /* If non-NULL, the number of extra bytes to allocate at the
1942      beginning of the storage allocated for an array-new expression in
1943      order to store the number of elements.  */
1944   tree cookie_size = NULL_TREE;
1945   /* True if the function we are calling is a placement allocation
1946      function.  */
1947   bool placement_allocation_fn_p;
1948   tree args = NULL_TREE;
1949   /* True if the storage must be initialized, either by a constructor
1950      or due to an explicit new-initializer.  */
1951   bool is_initialized;
1952   /* The address of the thing allocated, not including any cookie.  In
1953      particular, if an array cookie is in use, DATA_ADDR is the
1954      address of the first array element.  This node is a VAR_DECL, and
1955      is therefore reusable.  */
1956   tree data_addr;
1957   tree init_preeval_expr = NULL_TREE;
1958
1959   placement = TREE_OPERAND (exp, 0);
1960   type = TREE_OPERAND (exp, 1);
1961   init = TREE_OPERAND (exp, 2);
1962   globally_qualified_p = NEW_EXPR_USE_GLOBAL (exp);
1963
1964   if (TREE_CODE (type) == ARRAY_REF)
1965     {
1966       has_array = 1;
1967       nelts = outer_nelts = TREE_OPERAND (type, 1);
1968       type = TREE_OPERAND (type, 0);
1969
1970       /* Use an incomplete array type to avoid VLA headaches.  */
1971       full_type = build_cplus_array_type (type, NULL_TREE);
1972     }
1973   else
1974     full_type = type;
1975
1976   true_type = type;
1977
1978   code = has_array ? VEC_NEW_EXPR : NEW_EXPR;
1979
1980   /* If our base type is an array, then make sure we know how many elements
1981      it has.  */
1982   while (TREE_CODE (true_type) == ARRAY_TYPE)
1983     {
1984       tree this_nelts = array_type_nelts_top (true_type);
1985       nelts = cp_build_binary_op (MULT_EXPR, nelts, this_nelts);
1986       true_type = TREE_TYPE (true_type);
1987     }
1988
1989   if (!complete_type_or_else (true_type, exp))
1990     return error_mark_node;
1991
1992   if (TREE_CODE (true_type) == VOID_TYPE)
1993     {
1994       error ("invalid type `void' for new");
1995       return error_mark_node;
1996     }
1997
1998   if (abstract_virtuals_error (NULL_TREE, true_type))
1999     return error_mark_node;
2000
2001   is_initialized = (TYPE_NEEDS_CONSTRUCTING (type) || init);
2002   if (CP_TYPE_CONST_P (true_type) && !is_initialized)
2003     {
2004       error ("uninitialized const in `new' of `%#T'", true_type);
2005       return error_mark_node;
2006     }
2007
2008   size = size_in_bytes (true_type);
2009   if (has_array)
2010     size = size_binop (MULT_EXPR, size, convert (sizetype, nelts));
2011
2012   /* Allocate the object.  */
2013   if (! placement && TYPE_FOR_JAVA (true_type))
2014     {
2015       tree class_addr, alloc_decl;
2016       tree class_decl = build_java_class_ref (true_type);
2017       static const char alloc_name[] = "_Jv_AllocObject";
2018
2019       use_java_new = 1;
2020       alloc_decl = NULL;
2021       if (!get_global_value_if_present (get_identifier (alloc_name),
2022                                         &alloc_decl))
2023         {
2024           error ("call to Java constructor with `%s' undefined", alloc_name);
2025           return error_mark_node;
2026         }
2027       else if (really_overloaded_fn (alloc_decl))
2028         {
2029           error ("`%D' should never be overloaded", alloc_decl);
2030           return error_mark_node;
2031         }
2032       alloc_decl = OVL_CURRENT (alloc_decl);
2033       class_addr = build1 (ADDR_EXPR, jclass_node, class_decl);
2034       alloc_call = (build_function_call
2035                     (alloc_decl,
2036                      build_tree_list (NULL_TREE, class_addr)));
2037     }
2038   else
2039     {
2040       tree fnname;
2041       tree fns;
2042
2043       fnname = ansi_opname (code);
2044
2045       if (!globally_qualified_p
2046           && CLASS_TYPE_P (true_type)
2047           && (has_array
2048               ? TYPE_HAS_ARRAY_NEW_OPERATOR (true_type)
2049               : TYPE_HAS_NEW_OPERATOR (true_type)))
2050         {
2051           /* Use a class-specific operator new.  */
2052           /* If a cookie is required, add some extra space.  */
2053           if (has_array && TYPE_VEC_NEW_USES_COOKIE (true_type))
2054             {
2055               cookie_size = get_cookie_size (true_type);
2056               size = size_binop (PLUS_EXPR, size, cookie_size);
2057             }
2058           /* Create the argument list.  */
2059           args = tree_cons (NULL_TREE, size, placement);
2060           /* Do name-lookup to find the appropriate operator.  */
2061           fns = lookup_fnfields (true_type, fnname, /*protect=*/2);
2062           if (TREE_CODE (fns) == TREE_LIST)
2063             {
2064               error ("request for member `%D' is ambiguous", fnname);
2065               print_candidates (fns);
2066               return error_mark_node;
2067             }
2068           alloc_call = build_new_method_call (build_dummy_object (true_type),
2069                                               fns, args,
2070                                               /*conversion_path=*/NULL_TREE,
2071                                               LOOKUP_NORMAL);
2072         }
2073       else
2074         {
2075           /* Use a global operator new.  */
2076           /* See if a cookie might be required.  */
2077           if (has_array && TYPE_VEC_NEW_USES_COOKIE (true_type))
2078             cookie_size = get_cookie_size (true_type);
2079           else
2080             cookie_size = NULL_TREE;
2081
2082           alloc_call = build_operator_new_call (fnname, placement,
2083                                                 &size, &cookie_size);
2084         }
2085     }
2086
2087   if (alloc_call == error_mark_node)
2088     return error_mark_node;
2089
2090   /* In the simple case, we can stop now.  */
2091   pointer_type = build_pointer_type (type);
2092   if (!cookie_size && !is_initialized)
2093     return build_nop (pointer_type, alloc_call);
2094
2095   /* While we're working, use a pointer to the type we've actually
2096      allocated. Store the result of the call in a variable so that we
2097      can use it more than once.  */
2098   full_pointer_type = build_pointer_type (full_type);
2099   alloc_expr = get_target_expr (build_nop (full_pointer_type, alloc_call));
2100   alloc_node = TARGET_EXPR_SLOT (alloc_expr);
2101
2102   /* Strip any COMPOUND_EXPRs from ALLOC_CALL.  */
2103   while (TREE_CODE (alloc_call) == COMPOUND_EXPR)
2104     alloc_call = TREE_OPERAND (alloc_call, 1);
2105   alloc_fn = get_callee_fndecl (alloc_call);
2106   my_friendly_assert (alloc_fn != NULL_TREE, 20020325);
2107
2108   /* Now, check to see if this function is actually a placement
2109      allocation function.  This can happen even when PLACEMENT is NULL
2110      because we might have something like:
2111
2112        struct S { void* operator new (size_t, int i = 0); };
2113
2114      A call to `new S' will get this allocation function, even though
2115      there is no explicit placement argument.  If there is more than
2116      one argument, or there are variable arguments, then this is a
2117      placement allocation function.  */
2118   placement_allocation_fn_p
2119     = (type_num_arguments (TREE_TYPE (alloc_fn)) > 1
2120        || varargs_function_p (alloc_fn));
2121
2122   /* Preevaluate the placement args so that we don't reevaluate them for a
2123      placement delete.  */
2124   if (placement_allocation_fn_p)
2125     {
2126       tree inits;
2127       stabilize_call (alloc_call, &inits);
2128       if (inits)
2129         alloc_expr = build (COMPOUND_EXPR, TREE_TYPE (alloc_expr), inits,
2130                             alloc_expr);
2131     }
2132
2133   /*        unless an allocation function is declared with an empty  excep-
2134      tion-specification  (_except.spec_),  throw(), it indicates failure to
2135      allocate storage by throwing a bad_alloc exception  (clause  _except_,
2136      _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2137      cation function is declared  with  an  empty  exception-specification,
2138      throw(), it returns null to indicate failure to allocate storage and a
2139      non-null pointer otherwise.
2140
2141      So check for a null exception spec on the op new we just called.  */
2142
2143   nothrow = TYPE_NOTHROW_P (TREE_TYPE (alloc_fn));
2144   check_new = (flag_check_new || nothrow) && ! use_java_new;
2145
2146   if (cookie_size)
2147     {
2148       tree cookie;
2149
2150       /* Adjust so we're pointing to the start of the object.  */
2151       data_addr = get_target_expr (build (PLUS_EXPR, full_pointer_type,
2152                                           alloc_node, cookie_size));
2153
2154       /* Store the number of bytes allocated so that we can know how
2155          many elements to destroy later.  We use the last sizeof
2156          (size_t) bytes to store the number of elements.  */
2157       cookie = build (MINUS_EXPR, build_pointer_type (sizetype),
2158                       data_addr, size_in_bytes (sizetype));
2159       cookie = build_indirect_ref (cookie, NULL);
2160
2161       cookie_expr = build (MODIFY_EXPR, sizetype, cookie, nelts);
2162       data_addr = TARGET_EXPR_SLOT (data_addr);
2163     }
2164   else
2165     {
2166       cookie_expr = NULL_TREE;
2167       data_addr = alloc_node;
2168     }
2169
2170   /* Now initialize the allocated object.  Note that we preevaluate the
2171      initialization expression, apart from the actual constructor call or
2172      assignment--we do this because we want to delay the allocation as long
2173      as possible in order to minimize the size of the exception region for
2174      placement delete.  */
2175   if (is_initialized)
2176     {
2177       bool stable;
2178
2179       init_expr = build_indirect_ref (data_addr, NULL);
2180
2181       if (init == void_zero_node)
2182         init = build_default_init (full_type, nelts);
2183       else if (init && has_array)
2184         pedwarn ("ISO C++ forbids initialization in array new");
2185
2186       if (has_array)
2187         {
2188           init_expr
2189             = build_vec_init (init_expr,
2190                               cp_build_binary_op (MINUS_EXPR, outer_nelts,
2191                                                   integer_one_node),
2192                               init, /*from_array=*/0);
2193
2194           /* An array initialization is stable because the initialization
2195              of each element is a full-expression, so the temporaries don't
2196              leak out.  */
2197           stable = true;
2198         }
2199       else if (TYPE_NEEDS_CONSTRUCTING (type))
2200         {
2201           init_expr = build_special_member_call (init_expr,
2202                                                  complete_ctor_identifier,
2203                                                  init, TYPE_BINFO (true_type),
2204                                                  LOOKUP_NORMAL);
2205           stable = stabilize_init (init_expr, &init_preeval_expr);
2206         }
2207       else
2208         {
2209           /* We are processing something like `new int (10)', which
2210              means allocate an int, and initialize it with 10.  */
2211
2212           if (TREE_CODE (init) == TREE_LIST)
2213             init = build_x_compound_expr_from_list (init, "new initializer");
2214
2215           else if (TREE_CODE (init) == CONSTRUCTOR
2216                    && TREE_TYPE (init) == NULL_TREE)
2217             abort ();
2218
2219           init_expr = build_modify_expr (init_expr, INIT_EXPR, init);
2220           stable = stabilize_init (init_expr, &init_preeval_expr);
2221         }
2222
2223       if (init_expr == error_mark_node)
2224         return error_mark_node;
2225
2226       /* If any part of the object initialization terminates by throwing an
2227          exception and a suitable deallocation function can be found, the
2228          deallocation function is called to free the memory in which the
2229          object was being constructed, after which the exception continues
2230          to propagate in the context of the new-expression. If no
2231          unambiguous matching deallocation function can be found,
2232          propagating the exception does not cause the object's memory to be
2233          freed.  */
2234       if (flag_exceptions && ! use_java_new)
2235         {
2236           enum tree_code dcode = has_array ? VEC_DELETE_EXPR : DELETE_EXPR;
2237           tree cleanup;
2238
2239           /* The Standard is unclear here, but the right thing to do
2240              is to use the same method for finding deallocation
2241              functions that we use for finding allocation functions.  */
2242           cleanup = build_op_delete_call (dcode, alloc_node, size,
2243                                           globally_qualified_p,
2244                                           (placement_allocation_fn_p
2245                                            ? alloc_call : NULL_TREE));
2246
2247           if (!cleanup)
2248             /* We're done.  */;
2249           else if (stable)
2250             /* This is much simpler if we were able to preevaluate all of
2251                the arguments to the constructor call.  */
2252             init_expr = build (TRY_CATCH_EXPR, void_type_node,
2253                                init_expr, cleanup);
2254           else
2255             /* Ack!  First we allocate the memory.  Then we set our sentry
2256                variable to true, and expand a cleanup that deletes the
2257                memory if sentry is true.  Then we run the constructor, and
2258                finally clear the sentry.
2259
2260                We need to do this because we allocate the space first, so
2261                if there are any temporaries with cleanups in the
2262                constructor args and we weren't able to preevaluate them, we
2263                need this EH region to extend until end of full-expression
2264                to preserve nesting.  */
2265             {
2266               tree end, sentry, begin;
2267
2268               begin = get_target_expr (boolean_true_node);
2269               CLEANUP_EH_ONLY (begin) = 1;
2270
2271               sentry = TARGET_EXPR_SLOT (begin);
2272
2273               TARGET_EXPR_CLEANUP (begin)
2274                 = build (COND_EXPR, void_type_node, sentry,
2275                          cleanup, void_zero_node);
2276
2277               end = build (MODIFY_EXPR, TREE_TYPE (sentry),
2278                            sentry, boolean_false_node);
2279
2280               init_expr
2281                 = build (COMPOUND_EXPR, void_type_node, begin,
2282                          build (COMPOUND_EXPR, void_type_node, init_expr,
2283                                 end));
2284             }
2285
2286         }
2287     }
2288   else
2289     init_expr = NULL_TREE;
2290
2291   /* Now build up the return value in reverse order.  */
2292
2293   rval = data_addr;
2294
2295   if (init_expr)
2296     rval = build (COMPOUND_EXPR, TREE_TYPE (rval), init_expr, rval);
2297   if (cookie_expr)
2298     rval = build (COMPOUND_EXPR, TREE_TYPE (rval), cookie_expr, rval);
2299
2300   if (rval == alloc_node)
2301     /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
2302        and return the call (which doesn't need to be adjusted).  */
2303     rval = TARGET_EXPR_INITIAL (alloc_expr);
2304   else
2305     {
2306       if (check_new)
2307         {
2308           tree ifexp = cp_build_binary_op (NE_EXPR, alloc_node,
2309                                            integer_zero_node);
2310           rval = build_conditional_expr (ifexp, rval, alloc_node);
2311         }
2312
2313       /* Perform the allocation before anything else, so that ALLOC_NODE
2314          has been initialized before we start using it.  */
2315       rval = build (COMPOUND_EXPR, TREE_TYPE (rval), alloc_expr, rval);
2316     }
2317
2318   if (init_preeval_expr)
2319     rval = build (COMPOUND_EXPR, TREE_TYPE (rval), init_preeval_expr, rval);
2320
2321   /* Convert to the final type.  */
2322   rval = build_nop (pointer_type, rval);
2323
2324   /* A new-expression is never an lvalue.  */
2325   if (real_lvalue_p (rval))
2326     rval = build1 (NON_LVALUE_EXPR, TREE_TYPE (rval), rval);
2327
2328   return rval;
2329 }
2330 \f
2331 static tree
2332 build_vec_delete_1 (tree base, tree maxindex, tree type,
2333     special_function_kind auto_delete_vec, int use_global_delete)
2334 {
2335   tree virtual_size;
2336   tree ptype = build_pointer_type (type = complete_type (type));
2337   tree size_exp = size_in_bytes (type);
2338
2339   /* Temporary variables used by the loop.  */
2340   tree tbase, tbase_init;
2341
2342   /* This is the body of the loop that implements the deletion of a
2343      single element, and moves temp variables to next elements.  */
2344   tree body;
2345
2346   /* This is the LOOP_EXPR that governs the deletion of the elements.  */
2347   tree loop = 0;
2348
2349   /* This is the thing that governs what to do after the loop has run.  */
2350   tree deallocate_expr = 0;
2351
2352   /* This is the BIND_EXPR which holds the outermost iterator of the
2353      loop.  It is convenient to set this variable up and test it before
2354      executing any other code in the loop.
2355      This is also the containing expression returned by this function.  */
2356   tree controller = NULL_TREE;
2357
2358   /* We should only have 1-D arrays here.  */
2359   if (TREE_CODE (type) == ARRAY_TYPE)
2360     abort ();
2361
2362   if (! IS_AGGR_TYPE (type) || TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
2363     goto no_destructor;
2364
2365   /* The below is short by the cookie size.  */
2366   virtual_size = size_binop (MULT_EXPR, size_exp,
2367                              convert (sizetype, maxindex));
2368
2369   tbase = create_temporary_var (ptype);
2370   tbase_init = build_modify_expr (tbase, NOP_EXPR,
2371                                   fold (build (PLUS_EXPR, ptype,
2372                                                base,
2373                                                virtual_size)));
2374   DECL_REGISTER (tbase) = 1;
2375   controller = build (BIND_EXPR, void_type_node, tbase, NULL_TREE, NULL_TREE);
2376   TREE_SIDE_EFFECTS (controller) = 1;
2377
2378   body = build (EXIT_EXPR, void_type_node,
2379                 build (EQ_EXPR, boolean_type_node, base, tbase));
2380   body = build_compound_expr
2381     (body, build_modify_expr (tbase, NOP_EXPR,
2382                               build (MINUS_EXPR, ptype, tbase, size_exp)));
2383   body = build_compound_expr
2384     (body, build_delete (ptype, tbase, sfk_complete_destructor,
2385                          LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 1));
2386
2387   loop = build (LOOP_EXPR, void_type_node, body);
2388   loop = build_compound_expr (tbase_init, loop);
2389
2390  no_destructor:
2391   /* If the delete flag is one, or anything else with the low bit set,
2392      delete the storage.  */
2393   if (auto_delete_vec != sfk_base_destructor)
2394     {
2395       tree base_tbd;
2396
2397       /* The below is short by the cookie size.  */
2398       virtual_size = size_binop (MULT_EXPR, size_exp,
2399                                  convert (sizetype, maxindex));
2400
2401       if (! TYPE_VEC_NEW_USES_COOKIE (type))
2402         /* no header */
2403         base_tbd = base;
2404       else
2405         {
2406           tree cookie_size;
2407
2408           cookie_size = get_cookie_size (type);
2409           base_tbd
2410             = cp_convert (ptype,
2411                           cp_build_binary_op (MINUS_EXPR,
2412                                               cp_convert (string_type_node,
2413                                                           base),
2414                                               cookie_size));
2415           /* True size with header.  */
2416           virtual_size = size_binop (PLUS_EXPR, virtual_size, cookie_size);
2417         }
2418
2419       if (auto_delete_vec == sfk_deleting_destructor)
2420         deallocate_expr = build_x_delete (base_tbd,
2421                                           2 | use_global_delete,
2422                                           virtual_size);
2423     }
2424
2425   body = loop;
2426   if (!deallocate_expr)
2427     ;
2428   else if (!body)
2429     body = deallocate_expr;
2430   else
2431     body = build_compound_expr (body, deallocate_expr);
2432
2433   if (!body)
2434     body = integer_zero_node;
2435
2436   /* Outermost wrapper: If pointer is null, punt.  */
2437   body = fold (build (COND_EXPR, void_type_node,
2438                       fold (build (NE_EXPR, boolean_type_node, base,
2439                                    convert (TREE_TYPE (base),
2440                                             integer_zero_node))),
2441                       body, integer_zero_node));
2442   body = build1 (NOP_EXPR, void_type_node, body);
2443
2444   if (controller)
2445     {
2446       TREE_OPERAND (controller, 1) = body;
2447       body = controller;
2448     }
2449
2450   if (TREE_CODE (base) == SAVE_EXPR)
2451     /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR.  */
2452     body = build (COMPOUND_EXPR, void_type_node, base, body);
2453
2454   return convert_to_void (body, /*implicit=*/NULL);
2455 }
2456
2457 /* Create an unnamed variable of the indicated TYPE.  */
2458
2459 tree
2460 create_temporary_var (tree type)
2461 {
2462   tree decl;
2463
2464   decl = build_decl (VAR_DECL, NULL_TREE, type);
2465   TREE_USED (decl) = 1;
2466   DECL_ARTIFICIAL (decl) = 1;
2467   DECL_SOURCE_LOCATION (decl) = input_location;
2468   DECL_IGNORED_P (decl) = 1;
2469   DECL_CONTEXT (decl) = current_function_decl;
2470
2471   return decl;
2472 }
2473
2474 /* Create a new temporary variable of the indicated TYPE, initialized
2475    to INIT.
2476
2477    It is not entered into current_binding_level, because that breaks
2478    things when it comes time to do final cleanups (which take place
2479    "outside" the binding contour of the function).  */
2480
2481 static tree
2482 get_temp_regvar (tree type, tree init)
2483 {
2484   tree decl;
2485
2486   decl = create_temporary_var (type);
2487   add_decl_stmt (decl);
2488
2489   finish_expr_stmt (build_modify_expr (decl, INIT_EXPR, init));
2490
2491   return decl;
2492 }
2493
2494 /* `build_vec_init' returns tree structure that performs
2495    initialization of a vector of aggregate types.
2496
2497    BASE is a reference to the vector, of ARRAY_TYPE.
2498    MAXINDEX is the maximum index of the array (one less than the
2499      number of elements).  It is only used if
2500      TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
2501    INIT is the (possibly NULL) initializer.
2502
2503    FROM_ARRAY is 0 if we should init everything with INIT
2504    (i.e., every element initialized from INIT).
2505    FROM_ARRAY is 1 if we should index into INIT in parallel
2506    with initialization of DECL.
2507    FROM_ARRAY is 2 if we should index into INIT in parallel,
2508    but use assignment instead of initialization.  */
2509
2510 tree
2511 build_vec_init (tree base, tree maxindex, tree init, int from_array)
2512 {
2513   tree rval;
2514   tree base2 = NULL_TREE;
2515   tree size;
2516   tree itype = NULL_TREE;
2517   tree iterator;
2518   /* The type of the array.  */
2519   tree atype = TREE_TYPE (base);
2520   /* The type of an element in the array.  */
2521   tree type = TREE_TYPE (atype);
2522   /* The type of a pointer to an element in the array.  */
2523   tree ptype;
2524   tree stmt_expr;
2525   tree compound_stmt;
2526   int destroy_temps;
2527   tree try_block = NULL_TREE;
2528   tree try_body = NULL_TREE;
2529   int num_initialized_elts = 0;
2530   bool is_global;
2531
2532   if (TYPE_DOMAIN (atype))
2533     maxindex = array_type_nelts (atype);
2534
2535   if (maxindex == NULL_TREE || maxindex == error_mark_node)
2536     return error_mark_node;
2537
2538   if (init
2539       && (from_array == 2
2540           ? (!CLASS_TYPE_P (type) || !TYPE_HAS_COMPLEX_ASSIGN_REF (type))
2541           : !TYPE_NEEDS_CONSTRUCTING (type))
2542       && ((TREE_CODE (init) == CONSTRUCTOR
2543            /* Don't do this if the CONSTRUCTOR might contain something
2544               that might throw and require us to clean up.  */
2545            && (CONSTRUCTOR_ELTS (init) == NULL_TREE
2546                || ! TYPE_HAS_NONTRIVIAL_DESTRUCTOR (target_type (type))))
2547           || from_array))
2548     {
2549       /* Do non-default initialization of POD arrays resulting from
2550          brace-enclosed initializers.  In this case, digest_init and
2551          store_constructor will handle the semantics for us.  */
2552
2553       stmt_expr = build (INIT_EXPR, atype, base, init);
2554       return stmt_expr;
2555     }
2556
2557   maxindex = cp_convert (ptrdiff_type_node, maxindex);
2558   ptype = build_pointer_type (type);
2559   size = size_in_bytes (type);
2560   if (TREE_CODE (TREE_TYPE (base)) == ARRAY_TYPE)
2561     base = cp_convert (ptype, decay_conversion (base));
2562
2563   /* The code we are generating looks like:
2564      ({
2565        T* t1 = (T*) base;
2566        T* rval = t1;
2567        ptrdiff_t iterator = maxindex;
2568        try {
2569          for (; iterator != -1; --iterator) {
2570            ... initialize *t1 ...
2571            ++t1;
2572          }
2573        } catch (...) {
2574          ... destroy elements that were constructed ...
2575        }
2576        rval;
2577      })
2578
2579      We can omit the try and catch blocks if we know that the
2580      initialization will never throw an exception, or if the array
2581      elements do not have destructors.  We can omit the loop completely if
2582      the elements of the array do not have constructors.
2583
2584      We actually wrap the entire body of the above in a STMT_EXPR, for
2585      tidiness.
2586
2587      When copying from array to another, when the array elements have
2588      only trivial copy constructors, we should use __builtin_memcpy
2589      rather than generating a loop.  That way, we could take advantage
2590      of whatever cleverness the back-end has for dealing with copies
2591      of blocks of memory.  */
2592
2593   is_global = begin_init_stmts (&stmt_expr, &compound_stmt);
2594   destroy_temps = stmts_are_full_exprs_p ();
2595   current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2596   rval = get_temp_regvar (ptype, base);
2597   base = get_temp_regvar (ptype, rval);
2598   iterator = get_temp_regvar (ptrdiff_type_node, maxindex);
2599
2600   /* Protect the entire array initialization so that we can destroy
2601      the partially constructed array if an exception is thrown.
2602      But don't do this if we're assigning.  */
2603   if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2604       && from_array != 2)
2605     {
2606       try_block = begin_try_block ();
2607       try_body = begin_compound_stmt (/*has_no_scope=*/true);
2608     }
2609
2610   if (init != NULL_TREE && TREE_CODE (init) == CONSTRUCTOR)
2611     {
2612       /* Do non-default initialization of non-POD arrays resulting from
2613          brace-enclosed initializers.  */
2614
2615       tree elts;
2616       from_array = 0;
2617
2618       for (elts = CONSTRUCTOR_ELTS (init); elts; elts = TREE_CHAIN (elts))
2619         {
2620           tree elt = TREE_VALUE (elts);
2621           tree baseref = build1 (INDIRECT_REF, type, base);
2622
2623           num_initialized_elts++;
2624
2625           current_stmt_tree ()->stmts_are_full_exprs_p = 1;
2626           if (IS_AGGR_TYPE (type) || TREE_CODE (type) == ARRAY_TYPE)
2627             finish_expr_stmt (build_aggr_init (baseref, elt, 0));
2628           else
2629             finish_expr_stmt (build_modify_expr (baseref, NOP_EXPR,
2630                                                  elt));
2631           current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2632
2633           finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base, 0));
2634           finish_expr_stmt (build_unary_op (PREDECREMENT_EXPR, iterator, 0));
2635         }
2636
2637       /* Clear out INIT so that we don't get confused below.  */
2638       init = NULL_TREE;
2639     }
2640   else if (from_array)
2641     {
2642       /* If initializing one array from another, initialize element by
2643          element.  We rely upon the below calls the do argument
2644          checking.  */
2645       if (init)
2646         {
2647           base2 = decay_conversion (init);
2648           itype = TREE_TYPE (base2);
2649           base2 = get_temp_regvar (itype, base2);
2650           itype = TREE_TYPE (itype);
2651         }
2652       else if (TYPE_LANG_SPECIFIC (type)
2653                && TYPE_NEEDS_CONSTRUCTING (type)
2654                && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (type))
2655         {
2656           error ("initializer ends prematurely");
2657           return error_mark_node;
2658         }
2659     }
2660
2661   /* Now, default-initialize any remaining elements.  We don't need to
2662      do that if a) the type does not need constructing, or b) we've
2663      already initialized all the elements.
2664
2665      We do need to keep going if we're copying an array.  */
2666
2667   if (from_array
2668       || (TYPE_NEEDS_CONSTRUCTING (type)
2669           && ! (host_integerp (maxindex, 0)
2670                 && (num_initialized_elts
2671                     == tree_low_cst (maxindex, 0) + 1))))
2672     {
2673       /* If the ITERATOR is equal to -1, then we don't have to loop;
2674          we've already initialized all the elements.  */
2675       tree for_stmt;
2676       tree for_body;
2677       tree elt_init;
2678
2679       for_stmt = begin_for_stmt ();
2680       finish_for_init_stmt (for_stmt);
2681       finish_for_cond (build (NE_EXPR, boolean_type_node,
2682                               iterator, integer_minus_one_node),
2683                        for_stmt);
2684       finish_for_expr (build_unary_op (PREDECREMENT_EXPR, iterator, 0),
2685                        for_stmt);
2686
2687       /* Otherwise, loop through the elements.  */
2688       for_body = begin_compound_stmt (/*has_no_scope=*/true);
2689
2690       if (from_array)
2691         {
2692           tree to = build1 (INDIRECT_REF, type, base);
2693           tree from;
2694
2695           if (base2)
2696             from = build1 (INDIRECT_REF, itype, base2);
2697           else
2698             from = NULL_TREE;
2699
2700           if (from_array == 2)
2701             elt_init = build_modify_expr (to, NOP_EXPR, from);
2702           else if (TYPE_NEEDS_CONSTRUCTING (type))
2703             elt_init = build_aggr_init (to, from, 0);
2704           else if (from)
2705             elt_init = build_modify_expr (to, NOP_EXPR, from);
2706           else
2707             abort ();
2708         }
2709       else if (TREE_CODE (type) == ARRAY_TYPE)
2710         {
2711           if (init != 0)
2712             sorry
2713               ("cannot initialize multi-dimensional array with initializer");
2714           elt_init = build_vec_init (build1 (INDIRECT_REF, type, base),
2715                                      0, 0, 0);
2716         }
2717       else
2718         elt_init = build_aggr_init (build1 (INDIRECT_REF, type, base),
2719                                     init, 0);
2720
2721       current_stmt_tree ()->stmts_are_full_exprs_p = 1;
2722       finish_expr_stmt (elt_init);
2723       current_stmt_tree ()->stmts_are_full_exprs_p = 0;
2724
2725       finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base, 0));
2726       if (base2)
2727         finish_expr_stmt (build_unary_op (PREINCREMENT_EXPR, base2, 0));
2728
2729       finish_compound_stmt (for_body);
2730       finish_for_stmt (for_stmt);
2731     }
2732
2733   /* Make sure to cleanup any partially constructed elements.  */
2734   if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2735       && from_array != 2)
2736     {
2737       tree e;
2738       tree m = cp_build_binary_op (MINUS_EXPR, maxindex, iterator);
2739
2740       /* Flatten multi-dimensional array since build_vec_delete only
2741          expects one-dimensional array.  */
2742       if (TREE_CODE (type) == ARRAY_TYPE)
2743         {
2744           m = cp_build_binary_op (MULT_EXPR, m,
2745                                   array_type_nelts_total (type));
2746           type = strip_array_types (type);
2747         }
2748
2749       finish_compound_stmt (try_body);
2750       finish_cleanup_try_block (try_block);
2751       e = build_vec_delete_1 (rval, m, type, sfk_base_destructor,
2752                               /*use_global_delete=*/0);
2753       finish_cleanup (e, try_block);
2754     }
2755
2756   /* The value of the array initialization is the array itself, RVAL
2757      is a pointer to the first element.  */
2758   finish_stmt_expr_expr (rval);
2759
2760   stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt);
2761
2762   /* Now convert make the result have the correct type.  */
2763   atype = build_pointer_type (atype);
2764   stmt_expr = build1 (NOP_EXPR, atype, stmt_expr);
2765   stmt_expr = build_indirect_ref (stmt_expr, NULL);
2766
2767   current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps;
2768   return stmt_expr;
2769 }
2770
2771 /* Free up storage of type TYPE, at address ADDR.
2772
2773    TYPE is a POINTER_TYPE and can be ptr_type_node for no special type
2774    of pointer.
2775
2776    VIRTUAL_SIZE is the amount of storage that was allocated, and is
2777    used as the second argument to operator delete.  It can include
2778    things like padding and magic size cookies.  It has virtual in it,
2779    because if you have a base pointer and you delete through a virtual
2780    destructor, it should be the size of the dynamic object, not the
2781    static object, see Free Store 12.5 ISO C++.
2782
2783    This does not call any destructors.  */
2784
2785 tree
2786 build_x_delete (tree addr, int which_delete, tree virtual_size)
2787 {
2788   int use_global_delete = which_delete & 1;
2789   int use_vec_delete = !!(which_delete & 2);
2790   enum tree_code code = use_vec_delete ? VEC_DELETE_EXPR : DELETE_EXPR;
2791
2792   return build_op_delete_call (code, addr, virtual_size, use_global_delete,
2793                                NULL_TREE);
2794 }
2795
2796 /* Call the DTOR_KIND destructor for EXP.  FLAGS are as for
2797    build_delete.  */
2798
2799 static tree
2800 build_dtor_call (tree exp, special_function_kind dtor_kind, int flags)
2801 {
2802   tree name;
2803   tree fn;
2804   switch (dtor_kind)
2805     {
2806     case sfk_complete_destructor:
2807       name = complete_dtor_identifier;
2808       break;
2809
2810     case sfk_base_destructor:
2811       name = base_dtor_identifier;
2812       break;
2813
2814     case sfk_deleting_destructor:
2815       name = deleting_dtor_identifier;
2816       break;
2817
2818     default:
2819       abort ();
2820     }
2821
2822   exp = convert_from_reference (exp);
2823   fn = lookup_fnfields (TREE_TYPE (exp), name, /*protect=*/2);
2824   return build_new_method_call (exp, fn,
2825                                 /*args=*/NULL_TREE,
2826                                 /*conversion_path=*/NULL_TREE,
2827                                 flags);
2828 }
2829
2830 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
2831    ADDR is an expression which yields the store to be destroyed.
2832    AUTO_DELETE is the name of the destructor to call, i.e., either
2833    sfk_complete_destructor, sfk_base_destructor, or
2834    sfk_deleting_destructor.
2835
2836    FLAGS is the logical disjunction of zero or more LOOKUP_
2837    flags.  See cp-tree.h for more info.  */
2838
2839 tree
2840 build_delete (tree type, tree addr, special_function_kind auto_delete,
2841     int flags, int use_global_delete)
2842 {
2843   tree expr;
2844
2845   if (addr == error_mark_node)
2846     return error_mark_node;
2847
2848   /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
2849      set to `error_mark_node' before it gets properly cleaned up.  */
2850   if (type == error_mark_node)
2851     return error_mark_node;
2852
2853   type = TYPE_MAIN_VARIANT (type);
2854
2855   if (TREE_CODE (type) == POINTER_TYPE)
2856     {
2857       bool complete_p = true;
2858
2859       type = TYPE_MAIN_VARIANT (TREE_TYPE (type));
2860       if (TREE_CODE (type) == ARRAY_TYPE)
2861         goto handle_array;
2862
2863       /* We don't want to warn about delete of void*, only other
2864           incomplete types.  Deleting other incomplete types
2865           invokes undefined behavior, but it is not ill-formed, so
2866           compile to something that would even do The Right Thing
2867           (TM) should the type have a trivial dtor and no delete
2868           operator.  */
2869       if (!VOID_TYPE_P (type))
2870         {
2871           complete_type (type);
2872           if (!COMPLETE_TYPE_P (type))
2873             {
2874               warning ("possible problem detected in invocation of "
2875                        "delete operator:");
2876               cxx_incomplete_type_diagnostic (addr, type, 1);
2877               inform ("neither the destructor nor the class-specific "
2878                       "operator delete will be called, even if they are "
2879                       "declared when the class is defined.");
2880               complete_p = false;
2881             }
2882         }
2883       if (VOID_TYPE_P (type) || !complete_p || !IS_AGGR_TYPE (type))
2884         /* Call the builtin operator delete.  */
2885         return build_builtin_delete_call (addr);
2886       if (TREE_SIDE_EFFECTS (addr))
2887         addr = save_expr (addr);
2888
2889       /* Throw away const and volatile on target type of addr.  */
2890       addr = convert_force (build_pointer_type (type), addr, 0);
2891     }
2892   else if (TREE_CODE (type) == ARRAY_TYPE)
2893     {
2894     handle_array:
2895
2896       if (TYPE_DOMAIN (type) == NULL_TREE)
2897         {
2898           error ("unknown array size in delete");
2899           return error_mark_node;
2900         }
2901       return build_vec_delete (addr, array_type_nelts (type),
2902                                auto_delete, use_global_delete);
2903     }
2904   else
2905     {
2906       /* Don't check PROTECT here; leave that decision to the
2907          destructor.  If the destructor is accessible, call it,
2908          else report error.  */
2909       addr = build_unary_op (ADDR_EXPR, addr, 0);
2910       if (TREE_SIDE_EFFECTS (addr))
2911         addr = save_expr (addr);
2912
2913       addr = convert_force (build_pointer_type (type), addr, 0);
2914     }
2915
2916   my_friendly_assert (IS_AGGR_TYPE (type), 220);
2917
2918   if (TYPE_HAS_TRIVIAL_DESTRUCTOR (type))
2919     {
2920       if (auto_delete != sfk_deleting_destructor)
2921         return void_zero_node;
2922
2923       return build_op_delete_call
2924         (DELETE_EXPR, addr, cxx_sizeof_nowarn (type), use_global_delete,
2925          NULL_TREE);
2926     }
2927   else
2928     {
2929       tree do_delete = NULL_TREE;
2930       tree ifexp;
2931
2932       my_friendly_assert (TYPE_HAS_DESTRUCTOR (type), 20011213);
2933
2934       /* For `::delete x', we must not use the deleting destructor
2935          since then we would not be sure to get the global `operator
2936          delete'.  */
2937       if (use_global_delete && auto_delete == sfk_deleting_destructor)
2938         {
2939           /* We will use ADDR multiple times so we must save it.  */
2940           addr = save_expr (addr);
2941           /* Delete the object.  */
2942           do_delete = build_builtin_delete_call (addr);
2943           /* Otherwise, treat this like a complete object destructor
2944              call.  */
2945           auto_delete = sfk_complete_destructor;
2946         }
2947       /* If the destructor is non-virtual, there is no deleting
2948          variant.  Instead, we must explicitly call the appropriate
2949          `operator delete' here.  */
2950       else if (!DECL_VIRTUAL_P (CLASSTYPE_DESTRUCTORS (type))
2951                && auto_delete == sfk_deleting_destructor)
2952         {
2953           /* We will use ADDR multiple times so we must save it.  */
2954           addr = save_expr (addr);
2955           /* Build the call.  */
2956           do_delete = build_op_delete_call (DELETE_EXPR,
2957                                             addr,
2958                                             cxx_sizeof_nowarn (type),
2959                                             /*global_p=*/false,
2960                                             NULL_TREE);
2961           /* Call the complete object destructor.  */
2962           auto_delete = sfk_complete_destructor;
2963         }
2964       else if (auto_delete == sfk_deleting_destructor
2965                && TYPE_GETS_REG_DELETE (type))
2966         {
2967           /* Make sure we have access to the member op delete, even though
2968              we'll actually be calling it from the destructor.  */
2969           build_op_delete_call (DELETE_EXPR, addr, cxx_sizeof_nowarn (type),
2970                                 /*global_p=*/false, NULL_TREE);
2971         }
2972
2973       expr = build_dtor_call (build_indirect_ref (addr, NULL),
2974                               auto_delete, flags);
2975       if (do_delete)
2976         expr = build (COMPOUND_EXPR, void_type_node, expr, do_delete);
2977
2978       if (flags & LOOKUP_DESTRUCTOR)
2979         /* Explicit destructor call; don't check for null pointer.  */
2980         ifexp = integer_one_node;
2981       else
2982         /* Handle deleting a null pointer.  */
2983         ifexp = fold (cp_build_binary_op (NE_EXPR, addr, integer_zero_node));
2984
2985       if (ifexp != integer_one_node)
2986         expr = build (COND_EXPR, void_type_node,
2987                       ifexp, expr, void_zero_node);
2988
2989       return expr;
2990     }
2991 }
2992
2993 /* At the beginning of a destructor, push cleanups that will call the
2994    destructors for our base classes and members.
2995
2996    Called from begin_destructor_body.  */
2997
2998 void
2999 push_base_cleanups (void)
3000 {
3001   tree binfos;
3002   int i, n_baseclasses;
3003   tree member;
3004   tree expr;
3005
3006   /* Run destructors for all virtual baseclasses.  */
3007   if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type))
3008     {
3009       tree vbases;
3010       tree cond = (condition_conversion
3011                    (build (BIT_AND_EXPR, integer_type_node,
3012                            current_in_charge_parm,
3013                            integer_two_node)));
3014
3015       vbases = CLASSTYPE_VBASECLASSES (current_class_type);
3016       /* The CLASSTYPE_VBASECLASSES list is in initialization
3017          order, which is also the right order for pushing cleanups.  */
3018       for (; vbases;
3019            vbases = TREE_CHAIN (vbases))
3020         {
3021           tree vbase = TREE_VALUE (vbases);
3022           tree base_type = BINFO_TYPE (vbase);
3023
3024           if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (base_type))
3025             {
3026               expr = build_special_member_call (current_class_ref,
3027                                                 base_dtor_identifier,
3028                                                 NULL_TREE,
3029                                                 vbase,
3030                                                 (LOOKUP_NORMAL
3031                                                  | LOOKUP_NONVIRTUAL));
3032               expr = build (COND_EXPR, void_type_node, cond,
3033                             expr, void_zero_node);
3034               finish_decl_cleanup (NULL_TREE, expr);
3035             }
3036         }
3037     }
3038
3039   binfos = BINFO_BASETYPES (TYPE_BINFO (current_class_type));
3040   n_baseclasses = CLASSTYPE_N_BASECLASSES (current_class_type);
3041
3042   /* Take care of the remaining baseclasses.  */
3043   for (i = 0; i < n_baseclasses; i++)
3044     {
3045       tree base_binfo = TREE_VEC_ELT (binfos, i);
3046       if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo))
3047           || TREE_VIA_VIRTUAL (base_binfo))
3048         continue;
3049
3050       expr = build_special_member_call (current_class_ref,
3051                                         base_dtor_identifier,
3052                                         NULL_TREE, base_binfo,
3053                                         LOOKUP_NORMAL | LOOKUP_NONVIRTUAL);
3054       finish_decl_cleanup (NULL_TREE, expr);
3055     }
3056
3057   for (member = TYPE_FIELDS (current_class_type); member;
3058        member = TREE_CHAIN (member))
3059     {
3060       if (TREE_CODE (member) != FIELD_DECL || DECL_ARTIFICIAL (member))
3061         continue;
3062       if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (member)))
3063         {
3064           tree this_member = (build_class_member_access_expr
3065                               (current_class_ref, member,
3066                                /*access_path=*/NULL_TREE,
3067                                /*preserve_reference=*/false));
3068           tree this_type = TREE_TYPE (member);
3069           expr = build_delete (this_type, this_member,
3070                                sfk_complete_destructor,
3071                                LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR|LOOKUP_NORMAL,
3072                                0);
3073           finish_decl_cleanup (NULL_TREE, expr);
3074         }
3075     }
3076 }
3077
3078 /* For type TYPE, delete the virtual baseclass objects of DECL.  */
3079
3080 tree
3081 build_vbase_delete (tree type, tree decl)
3082 {
3083   tree vbases = CLASSTYPE_VBASECLASSES (type);
3084   tree result;
3085   tree addr = build_unary_op (ADDR_EXPR, decl, 0);
3086
3087   my_friendly_assert (addr != error_mark_node, 222);
3088
3089   for (result = convert_to_void (integer_zero_node, NULL);
3090        vbases; vbases = TREE_CHAIN (vbases))
3091     {
3092       tree base_addr = convert_force
3093         (build_pointer_type (BINFO_TYPE (TREE_VALUE (vbases))), addr, 0);
3094       tree base_delete = build_delete
3095         (TREE_TYPE (base_addr), base_addr, sfk_base_destructor,
3096          LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 0);
3097
3098       result = build_compound_expr (result, base_delete);
3099     }
3100   return result;
3101 }
3102
3103 /* Build a C++ vector delete expression.
3104    MAXINDEX is the number of elements to be deleted.
3105    ELT_SIZE is the nominal size of each element in the vector.
3106    BASE is the expression that should yield the store to be deleted.
3107    This function expands (or synthesizes) these calls itself.
3108    AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
3109
3110    This also calls delete for virtual baseclasses of elements of the vector.
3111
3112    Update: MAXINDEX is no longer needed.  The size can be extracted from the
3113    start of the vector for pointers, and from the type for arrays.  We still
3114    use MAXINDEX for arrays because it happens to already have one of the
3115    values we'd have to extract.  (We could use MAXINDEX with pointers to
3116    confirm the size, and trap if the numbers differ; not clear that it'd
3117    be worth bothering.)  */
3118
3119 tree
3120 build_vec_delete (tree base, tree maxindex,
3121     special_function_kind auto_delete_vec, int use_global_delete)
3122 {
3123   tree type;
3124   tree rval;
3125   tree base_init = NULL_TREE;
3126
3127   type = TREE_TYPE (base);
3128
3129   if (TREE_CODE (type) == POINTER_TYPE)
3130     {
3131       /* Step back one from start of vector, and read dimension.  */
3132       tree cookie_addr;
3133
3134       if (TREE_SIDE_EFFECTS (base))
3135         {
3136           base_init = get_target_expr (base);
3137           base = TARGET_EXPR_SLOT (base_init);
3138         }
3139       type = strip_array_types (TREE_TYPE (type));
3140       cookie_addr = build (MINUS_EXPR,
3141                            build_pointer_type (sizetype),
3142                            base,
3143                            TYPE_SIZE_UNIT (sizetype));
3144       maxindex = build_indirect_ref (cookie_addr, NULL);
3145     }
3146   else if (TREE_CODE (type) == ARRAY_TYPE)
3147     {
3148       /* Get the total number of things in the array, maxindex is a
3149          bad name.  */
3150       maxindex = array_type_nelts_total (type);
3151       type = strip_array_types (type);
3152       base = build_unary_op (ADDR_EXPR, base, 1);
3153       if (TREE_SIDE_EFFECTS (base))
3154         {
3155           base_init = get_target_expr (base);
3156           base = TARGET_EXPR_SLOT (base_init);
3157         }
3158     }
3159   else
3160     {
3161       if (base != error_mark_node)
3162         error ("type to vector delete is neither pointer or array type");
3163       return error_mark_node;
3164     }
3165
3166   rval = build_vec_delete_1 (base, maxindex, type, auto_delete_vec,
3167                              use_global_delete);
3168   if (base_init)
3169     rval = build (COMPOUND_EXPR, TREE_TYPE (rval), base_init, rval);
3170
3171   return rval;
3172 }