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, 2005, 2006, 2007, 2008, 2009, 2010, 4 2011 Free Software Foundation, Inc. 5 Contributed by Michael Tiemann (tiemann@cygnus.com) 6 7 This file is part of GCC. 8 9 GCC is free software; you can redistribute it and/or modify 10 it under the terms of the GNU General Public License as published by 11 the Free Software Foundation; either version 3, or (at your option) 12 any later version. 13 14 GCC is distributed in the hope that it will be useful, 15 but WITHOUT ANY WARRANTY; without even the implied warranty of 16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 17 GNU General Public License for more details. 18 19 You should have received a copy of the GNU General Public License 20 along with GCC; see the file COPYING3. If not see 21 <http://www.gnu.org/licenses/>. */ 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 "cp-tree.h" 31 #include "flags.h" 32 #include "output.h" 33 #include "target.h" 34 35 static bool begin_init_stmts (tree *, tree *); 36 static tree finish_init_stmts (bool, tree, tree); 37 static void construct_virtual_base (tree, tree); 38 static void expand_aggr_init_1 (tree, tree, tree, tree, int, tsubst_flags_t); 39 static void expand_default_init (tree, tree, tree, tree, int, tsubst_flags_t); 40 static void perform_member_init (tree, tree); 41 static tree build_builtin_delete_call (tree); 42 static int member_init_ok_or_else (tree, tree, tree); 43 static void expand_virtual_init (tree, tree); 44 static tree sort_mem_initializers (tree, tree); 45 static tree initializing_context (tree); 46 static void expand_cleanup_for_base (tree, tree); 47 static tree dfs_initialize_vtbl_ptrs (tree, void *); 48 static tree build_field_list (tree, tree, int *); 49 static tree build_vtbl_address (tree); 50 static int diagnose_uninitialized_cst_or_ref_member_1 (tree, tree, bool, bool); 51 52 /* We are about to generate some complex initialization code. 53 Conceptually, it is all a single expression. However, we may want 54 to include conditionals, loops, and other such statement-level 55 constructs. Therefore, we build the initialization code inside a 56 statement-expression. This function starts such an expression. 57 STMT_EXPR_P and COMPOUND_STMT_P are filled in by this function; 58 pass them back to finish_init_stmts when the expression is 59 complete. */ 60 61 static bool 62 begin_init_stmts (tree *stmt_expr_p, tree *compound_stmt_p) 63 { 64 bool is_global = !building_stmt_list_p (); 65 66 *stmt_expr_p = begin_stmt_expr (); 67 *compound_stmt_p = begin_compound_stmt (BCS_NO_SCOPE); 68 69 return is_global; 70 } 71 72 /* Finish out the statement-expression begun by the previous call to 73 begin_init_stmts. Returns the statement-expression itself. */ 74 75 static tree 76 finish_init_stmts (bool is_global, tree stmt_expr, tree compound_stmt) 77 { 78 finish_compound_stmt (compound_stmt); 79 80 stmt_expr = finish_stmt_expr (stmt_expr, true); 81 82 gcc_assert (!building_stmt_list_p () == is_global); 83 84 return stmt_expr; 85 } 86 87 /* Constructors */ 88 89 /* Called from initialize_vtbl_ptrs via dfs_walk. BINFO is the base 90 which we want to initialize the vtable pointer for, DATA is 91 TREE_LIST whose TREE_VALUE is the this ptr expression. */ 92 93 static tree 94 dfs_initialize_vtbl_ptrs (tree binfo, void *data) 95 { 96 if (!TYPE_CONTAINS_VPTR_P (BINFO_TYPE (binfo))) 97 return dfs_skip_bases; 98 99 if (!BINFO_PRIMARY_P (binfo) || BINFO_VIRTUAL_P (binfo)) 100 { 101 tree base_ptr = TREE_VALUE ((tree) data); 102 103 base_ptr = build_base_path (PLUS_EXPR, base_ptr, binfo, /*nonnull=*/1, 104 tf_warning_or_error); 105 106 expand_virtual_init (binfo, base_ptr); 107 } 108 109 return NULL_TREE; 110 } 111 112 /* Initialize all the vtable pointers in the object pointed to by 113 ADDR. */ 114 115 void 116 initialize_vtbl_ptrs (tree addr) 117 { 118 tree list; 119 tree type; 120 121 type = TREE_TYPE (TREE_TYPE (addr)); 122 list = build_tree_list (type, addr); 123 124 /* Walk through the hierarchy, initializing the vptr in each base 125 class. We do these in pre-order because we can't find the virtual 126 bases for a class until we've initialized the vtbl for that 127 class. */ 128 dfs_walk_once (TYPE_BINFO (type), dfs_initialize_vtbl_ptrs, NULL, list); 129 } 130 131 /* Return an expression for the zero-initialization of an object with 132 type T. This expression will either be a constant (in the case 133 that T is a scalar), or a CONSTRUCTOR (in the case that T is an 134 aggregate), or NULL (in the case that T does not require 135 initialization). In either case, the value can be used as 136 DECL_INITIAL for a decl of the indicated TYPE; it is a valid static 137 initializer. If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS 138 is the number of elements in the array. If STATIC_STORAGE_P is 139 TRUE, initializers are only generated for entities for which 140 zero-initialization does not simply mean filling the storage with 141 zero bytes. FIELD_SIZE, if non-NULL, is the bit size of the field, 142 subfields with bit positions at or above that bit size shouldn't 143 be added. Note that this only works when the result is assigned 144 to a base COMPONENT_REF; if we only have a pointer to the base subobject, 145 expand_assignment will end up clearing the full size of TYPE. */ 146 147 static tree 148 build_zero_init_1 (tree type, tree nelts, bool static_storage_p, 149 tree field_size) 150 { 151 tree init = NULL_TREE; 152 153 /* [dcl.init] 154 155 To zero-initialize an object of type T means: 156 157 -- if T is a scalar type, the storage is set to the value of zero 158 converted to T. 159 160 -- if T is a non-union class type, the storage for each nonstatic 161 data member and each base-class subobject is zero-initialized. 162 163 -- if T is a union type, the storage for its first data member is 164 zero-initialized. 165 166 -- if T is an array type, the storage for each element is 167 zero-initialized. 168 169 -- if T is a reference type, no initialization is performed. */ 170 171 gcc_assert (nelts == NULL_TREE || TREE_CODE (nelts) == INTEGER_CST); 172 173 if (type == error_mark_node) 174 ; 175 else if (static_storage_p && zero_init_p (type)) 176 /* In order to save space, we do not explicitly build initializers 177 for items that do not need them. GCC's semantics are that 178 items with static storage duration that are not otherwise 179 initialized are initialized to zero. */ 180 ; 181 else if (TYPE_PTR_P (type) || TYPE_PTR_TO_MEMBER_P (type)) 182 init = convert (type, nullptr_node); 183 else if (SCALAR_TYPE_P (type)) 184 init = convert (type, integer_zero_node); 185 else if (CLASS_TYPE_P (type)) 186 { 187 tree field; 188 VEC(constructor_elt,gc) *v = NULL; 189 190 /* Iterate over the fields, building initializations. */ 191 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field)) 192 { 193 if (TREE_CODE (field) != FIELD_DECL) 194 continue; 195 196 /* Don't add virtual bases for base classes if they are beyond 197 the size of the current field, that means it is present 198 somewhere else in the object. */ 199 if (field_size) 200 { 201 tree bitpos = bit_position (field); 202 if (TREE_CODE (bitpos) == INTEGER_CST 203 && !tree_int_cst_lt (bitpos, field_size)) 204 continue; 205 } 206 207 /* Note that for class types there will be FIELD_DECLs 208 corresponding to base classes as well. Thus, iterating 209 over TYPE_FIELDs will result in correct initialization of 210 all of the subobjects. */ 211 if (!static_storage_p || !zero_init_p (TREE_TYPE (field))) 212 { 213 tree new_field_size 214 = (DECL_FIELD_IS_BASE (field) 215 && DECL_SIZE (field) 216 && TREE_CODE (DECL_SIZE (field)) == INTEGER_CST) 217 ? DECL_SIZE (field) : NULL_TREE; 218 tree value = build_zero_init_1 (TREE_TYPE (field), 219 /*nelts=*/NULL_TREE, 220 static_storage_p, 221 new_field_size); 222 if (value) 223 CONSTRUCTOR_APPEND_ELT(v, field, value); 224 } 225 226 /* For unions, only the first field is initialized. */ 227 if (TREE_CODE (type) == UNION_TYPE) 228 break; 229 } 230 231 /* Build a constructor to contain the initializations. */ 232 init = build_constructor (type, v); 233 } 234 else if (TREE_CODE (type) == ARRAY_TYPE) 235 { 236 tree max_index; 237 VEC(constructor_elt,gc) *v = NULL; 238 239 /* Iterate over the array elements, building initializations. */ 240 if (nelts) 241 max_index = fold_build2_loc (input_location, 242 MINUS_EXPR, TREE_TYPE (nelts), 243 nelts, integer_one_node); 244 else 245 max_index = array_type_nelts (type); 246 247 /* If we have an error_mark here, we should just return error mark 248 as we don't know the size of the array yet. */ 249 if (max_index == error_mark_node) 250 return error_mark_node; 251 gcc_assert (TREE_CODE (max_index) == INTEGER_CST); 252 253 /* A zero-sized array, which is accepted as an extension, will 254 have an upper bound of -1. */ 255 if (!tree_int_cst_equal (max_index, integer_minus_one_node)) 256 { 257 constructor_elt *ce; 258 259 v = VEC_alloc (constructor_elt, gc, 1); 260 ce = VEC_quick_push (constructor_elt, v, NULL); 261 262 /* If this is a one element array, we just use a regular init. */ 263 if (tree_int_cst_equal (size_zero_node, max_index)) 264 ce->index = size_zero_node; 265 else 266 ce->index = build2 (RANGE_EXPR, sizetype, size_zero_node, 267 max_index); 268 269 ce->value = build_zero_init_1 (TREE_TYPE (type), 270 /*nelts=*/NULL_TREE, 271 static_storage_p, NULL_TREE); 272 } 273 274 /* Build a constructor to contain the initializations. */ 275 init = build_constructor (type, v); 276 } 277 else if (TREE_CODE (type) == VECTOR_TYPE) 278 init = build_zero_cst (type); 279 else 280 gcc_assert (TREE_CODE (type) == REFERENCE_TYPE); 281 282 /* In all cases, the initializer is a constant. */ 283 if (init) 284 TREE_CONSTANT (init) = 1; 285 286 return init; 287 } 288 289 /* Return an expression for the zero-initialization of an object with 290 type T. This expression will either be a constant (in the case 291 that T is a scalar), or a CONSTRUCTOR (in the case that T is an 292 aggregate), or NULL (in the case that T does not require 293 initialization). In either case, the value can be used as 294 DECL_INITIAL for a decl of the indicated TYPE; it is a valid static 295 initializer. If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS 296 is the number of elements in the array. If STATIC_STORAGE_P is 297 TRUE, initializers are only generated for entities for which 298 zero-initialization does not simply mean filling the storage with 299 zero bytes. */ 300 301 tree 302 build_zero_init (tree type, tree nelts, bool static_storage_p) 303 { 304 return build_zero_init_1 (type, nelts, static_storage_p, NULL_TREE); 305 } 306 307 /* Return a suitable initializer for value-initializing an object of type 308 TYPE, as described in [dcl.init]. */ 309 310 tree 311 build_value_init (tree type, tsubst_flags_t complain) 312 { 313 /* [dcl.init] 314 315 To value-initialize an object of type T means: 316 317 - if T is a class type (clause 9) with a user-provided constructor 318 (12.1), then the default constructor for T is called (and the 319 initialization is ill-formed if T has no accessible default 320 constructor); 321 322 - if T is a non-union class type without a user-provided constructor, 323 then every non-static data member and base-class component of T is 324 value-initialized;92) 325 326 - if T is an array type, then each element is value-initialized; 327 328 - otherwise, the object is zero-initialized. 329 330 A program that calls for default-initialization or 331 value-initialization of an entity of reference type is ill-formed. 332 333 92) Value-initialization for such a class object may be implemented by 334 zero-initializing the object and then calling the default 335 constructor. */ 336 337 /* The AGGR_INIT_EXPR tweaking below breaks in templates. */ 338 gcc_assert (!processing_template_decl 339 || (SCALAR_TYPE_P (type) || TREE_CODE (type) == ARRAY_TYPE)); 340 341 if (CLASS_TYPE_P (type)) 342 { 343 /* Instead of the above, only consider the user-providedness of the 344 default constructor itself so value-initializing a class with an 345 explicitly defaulted default constructor and another user-provided 346 constructor works properly (c++std-core-19883). */ 347 if (type_has_user_provided_default_constructor (type) 348 || (!TYPE_HAS_DEFAULT_CONSTRUCTOR (type) 349 && type_has_user_provided_constructor (type))) 350 return build_aggr_init_expr 351 (type, 352 build_special_member_call (NULL_TREE, complete_ctor_identifier, 353 NULL, type, LOOKUP_NORMAL, 354 complain), 355 complain); 356 else if (TYPE_HAS_COMPLEX_DFLT (type)) 357 { 358 /* This is a class that needs constructing, but doesn't have 359 a user-provided constructor. So we need to zero-initialize 360 the object and then call the implicitly defined ctor. 361 This will be handled in simplify_aggr_init_expr. */ 362 tree ctor = build_special_member_call 363 (NULL_TREE, complete_ctor_identifier, 364 NULL, type, LOOKUP_NORMAL, complain); 365 ctor = build_aggr_init_expr (type, ctor, complain); 366 if (ctor != error_mark_node) 367 AGGR_INIT_ZERO_FIRST (ctor) = 1; 368 return ctor; 369 } 370 } 371 return build_value_init_noctor (type, complain); 372 } 373 374 /* Like build_value_init, but don't call the constructor for TYPE. Used 375 for base initializers. */ 376 377 tree 378 build_value_init_noctor (tree type, tsubst_flags_t complain) 379 { 380 if (!COMPLETE_TYPE_P (type)) 381 { 382 if (complain & tf_error) 383 error ("value-initialization of incomplete type %qT", type); 384 return error_mark_node; 385 } 386 /* FIXME the class and array cases should just use digest_init once it is 387 SFINAE-enabled. */ 388 if (CLASS_TYPE_P (type)) 389 { 390 gcc_assert (!TYPE_HAS_COMPLEX_DFLT (type)); 391 392 if (TREE_CODE (type) != UNION_TYPE) 393 { 394 tree field; 395 VEC(constructor_elt,gc) *v = NULL; 396 397 /* Iterate over the fields, building initializations. */ 398 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field)) 399 { 400 tree ftype, value; 401 402 if (TREE_CODE (field) != FIELD_DECL) 403 continue; 404 405 ftype = TREE_TYPE (field); 406 407 /* We could skip vfields and fields of types with 408 user-defined constructors, but I think that won't improve 409 performance at all; it should be simpler in general just 410 to zero out the entire object than try to only zero the 411 bits that actually need it. */ 412 413 /* Note that for class types there will be FIELD_DECLs 414 corresponding to base classes as well. Thus, iterating 415 over TYPE_FIELDs will result in correct initialization of 416 all of the subobjects. */ 417 value = build_value_init (ftype, complain); 418 419 if (value == error_mark_node) 420 return error_mark_node; 421 422 if (value) 423 CONSTRUCTOR_APPEND_ELT(v, field, value); 424 } 425 426 /* Build a constructor to contain the zero- initializations. */ 427 return build_constructor (type, v); 428 } 429 } 430 else if (TREE_CODE (type) == ARRAY_TYPE) 431 { 432 VEC(constructor_elt,gc) *v = NULL; 433 434 /* Iterate over the array elements, building initializations. */ 435 tree max_index = array_type_nelts (type); 436 437 /* If we have an error_mark here, we should just return error mark 438 as we don't know the size of the array yet. */ 439 if (max_index == error_mark_node) 440 { 441 if (complain & tf_error) 442 error ("cannot value-initialize array of unknown bound %qT", 443 type); 444 return error_mark_node; 445 } 446 gcc_assert (TREE_CODE (max_index) == INTEGER_CST); 447 448 /* A zero-sized array, which is accepted as an extension, will 449 have an upper bound of -1. */ 450 if (!tree_int_cst_equal (max_index, integer_minus_one_node)) 451 { 452 constructor_elt *ce; 453 454 v = VEC_alloc (constructor_elt, gc, 1); 455 ce = VEC_quick_push (constructor_elt, v, NULL); 456 457 /* If this is a one element array, we just use a regular init. */ 458 if (tree_int_cst_equal (size_zero_node, max_index)) 459 ce->index = size_zero_node; 460 else 461 ce->index = build2 (RANGE_EXPR, sizetype, size_zero_node, 462 max_index); 463 464 ce->value = build_value_init (TREE_TYPE (type), complain); 465 466 if (ce->value == error_mark_node) 467 return error_mark_node; 468 469 /* We shouldn't have gotten here for anything that would need 470 non-trivial initialization, and gimplify_init_ctor_preeval 471 would need to be fixed to allow it. */ 472 gcc_assert (TREE_CODE (ce->value) != TARGET_EXPR 473 && TREE_CODE (ce->value) != AGGR_INIT_EXPR); 474 } 475 476 /* Build a constructor to contain the initializations. */ 477 return build_constructor (type, v); 478 } 479 else if (TREE_CODE (type) == FUNCTION_TYPE) 480 { 481 if (complain & tf_error) 482 error ("value-initialization of function type %qT", type); 483 return error_mark_node; 484 } 485 else if (TREE_CODE (type) == REFERENCE_TYPE) 486 { 487 if (complain & tf_error) 488 error ("value-initialization of reference type %qT", type); 489 return error_mark_node; 490 } 491 492 return build_zero_init (type, NULL_TREE, /*static_storage_p=*/false); 493 } 494 495 /* Initialize current class with INIT, a TREE_LIST of 496 arguments for a target constructor. If TREE_LIST is void_type_node, 497 an empty initializer list was given. */ 498 499 static void 500 perform_target_ctor (tree init) 501 { 502 tree decl = current_class_ref; 503 tree type = current_class_type; 504 505 finish_expr_stmt (build_aggr_init (decl, init, LOOKUP_NORMAL, 506 tf_warning_or_error)); 507 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)) 508 { 509 tree expr = build_delete (type, decl, sfk_complete_destructor, 510 LOOKUP_NORMAL 511 |LOOKUP_NONVIRTUAL 512 |LOOKUP_DESTRUCTOR, 513 0, tf_warning_or_error); 514 if (expr != error_mark_node) 515 finish_eh_cleanup (expr); 516 } 517 } 518 519 /* Initialize MEMBER, a FIELD_DECL, with INIT, a TREE_LIST of 520 arguments. If TREE_LIST is void_type_node, an empty initializer 521 list was given; if NULL_TREE no initializer was given. */ 522 523 static void 524 perform_member_init (tree member, tree init) 525 { 526 tree decl; 527 tree type = TREE_TYPE (member); 528 529 /* Use the non-static data member initializer if there was no 530 mem-initializer for this field. */ 531 if (init == NULL_TREE) 532 { 533 if (DECL_LANG_SPECIFIC (member) && DECL_TEMPLATE_INFO (member)) 534 /* Do deferred instantiation of the NSDMI. */ 535 init = (tsubst_copy_and_build 536 (DECL_INITIAL (DECL_TI_TEMPLATE (member)), 537 DECL_TI_ARGS (member), 538 tf_warning_or_error, member, /*function_p=*/false, 539 /*integral_constant_expression_p=*/false)); 540 else 541 { 542 init = DECL_INITIAL (member); 543 /* Strip redundant TARGET_EXPR so we don't need to remap it, and 544 so the aggregate init code below will see a CONSTRUCTOR. */ 545 if (init && TREE_CODE (init) == TARGET_EXPR 546 && !VOID_TYPE_P (TREE_TYPE (TARGET_EXPR_INITIAL (init)))) 547 init = TARGET_EXPR_INITIAL (init); 548 init = break_out_target_exprs (init); 549 } 550 } 551 552 if (init == error_mark_node) 553 return; 554 555 /* Effective C++ rule 12 requires that all data members be 556 initialized. */ 557 if (warn_ecpp && init == NULL_TREE && TREE_CODE (type) != ARRAY_TYPE) 558 warning_at (DECL_SOURCE_LOCATION (current_function_decl), OPT_Weffc__, 559 "%qD should be initialized in the member initialization list", 560 member); 561 562 /* Get an lvalue for the data member. */ 563 decl = build_class_member_access_expr (current_class_ref, member, 564 /*access_path=*/NULL_TREE, 565 /*preserve_reference=*/true, 566 tf_warning_or_error); 567 if (decl == error_mark_node) 568 return; 569 570 if (warn_init_self && init && TREE_CODE (init) == TREE_LIST 571 && TREE_CHAIN (init) == NULL_TREE) 572 { 573 tree val = TREE_VALUE (init); 574 if (TREE_CODE (val) == COMPONENT_REF && TREE_OPERAND (val, 1) == member 575 && TREE_OPERAND (val, 0) == current_class_ref) 576 warning_at (DECL_SOURCE_LOCATION (current_function_decl), 577 OPT_Wuninitialized, "%qD is initialized with itself", 578 member); 579 } 580 581 if (init == void_type_node) 582 { 583 /* mem() means value-initialization. */ 584 if (TREE_CODE (type) == ARRAY_TYPE) 585 { 586 init = build_vec_init_expr (type, init, tf_warning_or_error); 587 init = build2 (INIT_EXPR, type, decl, init); 588 finish_expr_stmt (init); 589 } 590 else 591 { 592 tree value = build_value_init (type, tf_warning_or_error); 593 if (value == error_mark_node) 594 return; 595 init = build2 (INIT_EXPR, type, decl, value); 596 finish_expr_stmt (init); 597 } 598 } 599 /* Deal with this here, as we will get confused if we try to call the 600 assignment op for an anonymous union. This can happen in a 601 synthesized copy constructor. */ 602 else if (ANON_AGGR_TYPE_P (type)) 603 { 604 if (init) 605 { 606 init = build2 (INIT_EXPR, type, decl, TREE_VALUE (init)); 607 finish_expr_stmt (init); 608 } 609 } 610 else if (init 611 && (TREE_CODE (type) == REFERENCE_TYPE 612 /* Pre-digested NSDMI. */ 613 || (((TREE_CODE (init) == CONSTRUCTOR 614 && TREE_TYPE (init) == type) 615 /* { } mem-initializer. */ 616 || (TREE_CODE (init) == TREE_LIST 617 && TREE_CODE (TREE_VALUE (init)) == CONSTRUCTOR 618 && CONSTRUCTOR_IS_DIRECT_INIT (TREE_VALUE (init)))) 619 && (CP_AGGREGATE_TYPE_P (type) 620 || is_std_init_list (type))))) 621 { 622 /* With references and list-initialization, we need to deal with 623 extending temporary lifetimes. 12.2p5: "A temporary bound to a 624 reference member in a constructor’s ctor-initializer (12.6.2) 625 persists until the constructor exits." */ 626 unsigned i; tree t; 627 VEC(tree,gc) *cleanups = make_tree_vector (); 628 if (TREE_CODE (init) == TREE_LIST) 629 init = build_x_compound_expr_from_list (init, ELK_MEM_INIT, 630 tf_warning_or_error); 631 if (TREE_TYPE (init) != type) 632 init = digest_init (type, init, tf_warning_or_error); 633 if (init == error_mark_node) 634 return; 635 /* A FIELD_DECL doesn't really have a suitable lifetime, but 636 make_temporary_var_for_ref_to_temp will treat it as automatic and 637 set_up_extended_ref_temp wants to use the decl in a warning. */ 638 init = extend_ref_init_temps (member, init, &cleanups); 639 if (TREE_CODE (type) == ARRAY_TYPE 640 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (type))) 641 init = build_vec_init_expr (type, init, tf_warning_or_error); 642 init = build2 (INIT_EXPR, type, decl, init); 643 finish_expr_stmt (init); 644 FOR_EACH_VEC_ELT (tree, cleanups, i, t) 645 push_cleanup (decl, t, false); 646 release_tree_vector (cleanups); 647 } 648 else if (type_build_ctor_call (type) 649 || (init && CLASS_TYPE_P (strip_array_types (type)))) 650 { 651 if (TREE_CODE (type) == ARRAY_TYPE) 652 { 653 if (init) 654 { 655 if (TREE_CHAIN (init)) 656 init = error_mark_node; 657 else 658 init = TREE_VALUE (init); 659 if (BRACE_ENCLOSED_INITIALIZER_P (init)) 660 init = digest_init (type, init, tf_warning_or_error); 661 } 662 if (init == NULL_TREE 663 || same_type_ignoring_top_level_qualifiers_p (type, 664 TREE_TYPE (init))) 665 { 666 init = build_vec_init_expr (type, init, tf_warning_or_error); 667 init = build2 (INIT_EXPR, type, decl, init); 668 finish_expr_stmt (init); 669 } 670 else 671 error ("invalid initializer for array member %q#D", member); 672 } 673 else 674 { 675 int flags = LOOKUP_NORMAL; 676 if (DECL_DEFAULTED_FN (current_function_decl)) 677 flags |= LOOKUP_DEFAULTED; 678 if (CP_TYPE_CONST_P (type) 679 && init == NULL_TREE 680 && default_init_uninitialized_part (type)) 681 /* TYPE_NEEDS_CONSTRUCTING can be set just because we have a 682 vtable; still give this diagnostic. */ 683 permerror (DECL_SOURCE_LOCATION (current_function_decl), 684 "uninitialized member %qD with %<const%> type %qT", 685 member, type); 686 finish_expr_stmt (build_aggr_init (decl, init, flags, 687 tf_warning_or_error)); 688 } 689 } 690 else 691 { 692 if (init == NULL_TREE) 693 { 694 tree core_type; 695 /* member traversal: note it leaves init NULL */ 696 if (TREE_CODE (type) == REFERENCE_TYPE) 697 permerror (DECL_SOURCE_LOCATION (current_function_decl), 698 "uninitialized reference member %qD", 699 member); 700 else if (CP_TYPE_CONST_P (type)) 701 permerror (DECL_SOURCE_LOCATION (current_function_decl), 702 "uninitialized member %qD with %<const%> type %qT", 703 member, type); 704 705 core_type = strip_array_types (type); 706 707 if (CLASS_TYPE_P (core_type) 708 && (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type) 709 || CLASSTYPE_REF_FIELDS_NEED_INIT (core_type))) 710 diagnose_uninitialized_cst_or_ref_member (core_type, 711 /*using_new=*/false, 712 /*complain=*/true); 713 } 714 else if (TREE_CODE (init) == TREE_LIST) 715 /* There was an explicit member initialization. Do some work 716 in that case. */ 717 init = build_x_compound_expr_from_list (init, ELK_MEM_INIT, 718 tf_warning_or_error); 719 720 if (init) 721 finish_expr_stmt (cp_build_modify_expr (decl, INIT_EXPR, init, 722 tf_warning_or_error)); 723 } 724 725 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)) 726 { 727 tree expr; 728 729 expr = build_class_member_access_expr (current_class_ref, member, 730 /*access_path=*/NULL_TREE, 731 /*preserve_reference=*/false, 732 tf_warning_or_error); 733 expr = build_delete (type, expr, sfk_complete_destructor, 734 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR, 0, 735 tf_warning_or_error); 736 737 if (expr != error_mark_node) 738 finish_eh_cleanup (expr); 739 } 740 } 741 742 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all 743 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */ 744 745 static tree 746 build_field_list (tree t, tree list, int *uses_unions_p) 747 { 748 tree fields; 749 750 /* Note whether or not T is a union. */ 751 if (TREE_CODE (t) == UNION_TYPE) 752 *uses_unions_p = 1; 753 754 for (fields = TYPE_FIELDS (t); fields; fields = DECL_CHAIN (fields)) 755 { 756 tree fieldtype; 757 758 /* Skip CONST_DECLs for enumeration constants and so forth. */ 759 if (TREE_CODE (fields) != FIELD_DECL || DECL_ARTIFICIAL (fields)) 760 continue; 761 762 fieldtype = TREE_TYPE (fields); 763 /* Keep track of whether or not any fields are unions. */ 764 if (TREE_CODE (fieldtype) == UNION_TYPE) 765 *uses_unions_p = 1; 766 767 /* For an anonymous struct or union, we must recursively 768 consider the fields of the anonymous type. They can be 769 directly initialized from the constructor. */ 770 if (ANON_AGGR_TYPE_P (fieldtype)) 771 { 772 /* Add this field itself. Synthesized copy constructors 773 initialize the entire aggregate. */ 774 list = tree_cons (fields, NULL_TREE, list); 775 /* And now add the fields in the anonymous aggregate. */ 776 list = build_field_list (fieldtype, list, uses_unions_p); 777 } 778 /* Add this field. */ 779 else if (DECL_NAME (fields)) 780 list = tree_cons (fields, NULL_TREE, list); 781 } 782 783 return list; 784 } 785 786 /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives 787 a FIELD_DECL or BINFO in T that needs initialization. The 788 TREE_VALUE gives the initializer, or list of initializer arguments. 789 790 Return a TREE_LIST containing all of the initializations required 791 for T, in the order in which they should be performed. The output 792 list has the same format as the input. */ 793 794 static tree 795 sort_mem_initializers (tree t, tree mem_inits) 796 { 797 tree init; 798 tree base, binfo, base_binfo; 799 tree sorted_inits; 800 tree next_subobject; 801 VEC(tree,gc) *vbases; 802 int i; 803 int uses_unions_p = 0; 804 805 /* Build up a list of initializations. The TREE_PURPOSE of entry 806 will be the subobject (a FIELD_DECL or BINFO) to initialize. The 807 TREE_VALUE will be the constructor arguments, or NULL if no 808 explicit initialization was provided. */ 809 sorted_inits = NULL_TREE; 810 811 /* Process the virtual bases. */ 812 for (vbases = CLASSTYPE_VBASECLASSES (t), i = 0; 813 VEC_iterate (tree, vbases, i, base); i++) 814 sorted_inits = tree_cons (base, NULL_TREE, sorted_inits); 815 816 /* Process the direct bases. */ 817 for (binfo = TYPE_BINFO (t), i = 0; 818 BINFO_BASE_ITERATE (binfo, i, base_binfo); ++i) 819 if (!BINFO_VIRTUAL_P (base_binfo)) 820 sorted_inits = tree_cons (base_binfo, NULL_TREE, sorted_inits); 821 822 /* Process the non-static data members. */ 823 sorted_inits = build_field_list (t, sorted_inits, &uses_unions_p); 824 /* Reverse the entire list of initializations, so that they are in 825 the order that they will actually be performed. */ 826 sorted_inits = nreverse (sorted_inits); 827 828 /* If the user presented the initializers in an order different from 829 that in which they will actually occur, we issue a warning. Keep 830 track of the next subobject which can be explicitly initialized 831 without issuing a warning. */ 832 next_subobject = sorted_inits; 833 834 /* Go through the explicit initializers, filling in TREE_PURPOSE in 835 the SORTED_INITS. */ 836 for (init = mem_inits; init; init = TREE_CHAIN (init)) 837 { 838 tree subobject; 839 tree subobject_init; 840 841 subobject = TREE_PURPOSE (init); 842 843 /* If the explicit initializers are in sorted order, then 844 SUBOBJECT will be NEXT_SUBOBJECT, or something following 845 it. */ 846 for (subobject_init = next_subobject; 847 subobject_init; 848 subobject_init = TREE_CHAIN (subobject_init)) 849 if (TREE_PURPOSE (subobject_init) == subobject) 850 break; 851 852 /* Issue a warning if the explicit initializer order does not 853 match that which will actually occur. 854 ??? Are all these on the correct lines? */ 855 if (warn_reorder && !subobject_init) 856 { 857 if (TREE_CODE (TREE_PURPOSE (next_subobject)) == FIELD_DECL) 858 warning (OPT_Wreorder, "%q+D will be initialized after", 859 TREE_PURPOSE (next_subobject)); 860 else 861 warning (OPT_Wreorder, "base %qT will be initialized after", 862 TREE_PURPOSE (next_subobject)); 863 if (TREE_CODE (subobject) == FIELD_DECL) 864 warning (OPT_Wreorder, " %q+#D", subobject); 865 else 866 warning (OPT_Wreorder, " base %qT", subobject); 867 warning_at (DECL_SOURCE_LOCATION (current_function_decl), 868 OPT_Wreorder, " when initialized here"); 869 } 870 871 /* Look again, from the beginning of the list. */ 872 if (!subobject_init) 873 { 874 subobject_init = sorted_inits; 875 while (TREE_PURPOSE (subobject_init) != subobject) 876 subobject_init = TREE_CHAIN (subobject_init); 877 } 878 879 /* It is invalid to initialize the same subobject more than 880 once. */ 881 if (TREE_VALUE (subobject_init)) 882 { 883 if (TREE_CODE (subobject) == FIELD_DECL) 884 error_at (DECL_SOURCE_LOCATION (current_function_decl), 885 "multiple initializations given for %qD", 886 subobject); 887 else 888 error_at (DECL_SOURCE_LOCATION (current_function_decl), 889 "multiple initializations given for base %qT", 890 subobject); 891 } 892 893 /* Record the initialization. */ 894 TREE_VALUE (subobject_init) = TREE_VALUE (init); 895 next_subobject = subobject_init; 896 } 897 898 /* [class.base.init] 899 900 If a ctor-initializer specifies more than one mem-initializer for 901 multiple members of the same union (including members of 902 anonymous unions), the ctor-initializer is ill-formed. 903 904 Here we also splice out uninitialized union members. */ 905 if (uses_unions_p) 906 { 907 tree last_field = NULL_TREE; 908 tree *p; 909 for (p = &sorted_inits; *p; ) 910 { 911 tree field; 912 tree ctx; 913 int done; 914 915 init = *p; 916 917 field = TREE_PURPOSE (init); 918 919 /* Skip base classes. */ 920 if (TREE_CODE (field) != FIELD_DECL) 921 goto next; 922 923 /* If this is an anonymous union with no explicit initializer, 924 splice it out. */ 925 if (!TREE_VALUE (init) && ANON_UNION_TYPE_P (TREE_TYPE (field))) 926 goto splice; 927 928 /* See if this field is a member of a union, or a member of a 929 structure contained in a union, etc. */ 930 for (ctx = DECL_CONTEXT (field); 931 !same_type_p (ctx, t); 932 ctx = TYPE_CONTEXT (ctx)) 933 if (TREE_CODE (ctx) == UNION_TYPE) 934 break; 935 /* If this field is not a member of a union, skip it. */ 936 if (TREE_CODE (ctx) != UNION_TYPE) 937 goto next; 938 939 /* If this union member has no explicit initializer, splice 940 it out. */ 941 if (!TREE_VALUE (init)) 942 goto splice; 943 944 /* It's only an error if we have two initializers for the same 945 union type. */ 946 if (!last_field) 947 { 948 last_field = field; 949 goto next; 950 } 951 952 /* See if LAST_FIELD and the field initialized by INIT are 953 members of the same union. If so, there's a problem, 954 unless they're actually members of the same structure 955 which is itself a member of a union. For example, given: 956 957 union { struct { int i; int j; }; }; 958 959 initializing both `i' and `j' makes sense. */ 960 ctx = DECL_CONTEXT (field); 961 done = 0; 962 do 963 { 964 tree last_ctx; 965 966 last_ctx = DECL_CONTEXT (last_field); 967 while (1) 968 { 969 if (same_type_p (last_ctx, ctx)) 970 { 971 if (TREE_CODE (ctx) == UNION_TYPE) 972 error_at (DECL_SOURCE_LOCATION (current_function_decl), 973 "initializations for multiple members of %qT", 974 last_ctx); 975 done = 1; 976 break; 977 } 978 979 if (same_type_p (last_ctx, t)) 980 break; 981 982 last_ctx = TYPE_CONTEXT (last_ctx); 983 } 984 985 /* If we've reached the outermost class, then we're 986 done. */ 987 if (same_type_p (ctx, t)) 988 break; 989 990 ctx = TYPE_CONTEXT (ctx); 991 } 992 while (!done); 993 994 last_field = field; 995 996 next: 997 p = &TREE_CHAIN (*p); 998 continue; 999 splice: 1000 *p = TREE_CHAIN (*p); 1001 continue; 1002 } 1003 } 1004 1005 return sorted_inits; 1006 } 1007 1008 /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS 1009 is a TREE_LIST giving the explicit mem-initializer-list for the 1010 constructor. The TREE_PURPOSE of each entry is a subobject (a 1011 FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE 1012 is a TREE_LIST giving the arguments to the constructor or 1013 void_type_node for an empty list of arguments. */ 1014 1015 void 1016 emit_mem_initializers (tree mem_inits) 1017 { 1018 int flags = LOOKUP_NORMAL; 1019 1020 /* We will already have issued an error message about the fact that 1021 the type is incomplete. */ 1022 if (!COMPLETE_TYPE_P (current_class_type)) 1023 return; 1024 1025 if (mem_inits 1026 && TYPE_P (TREE_PURPOSE (mem_inits)) 1027 && same_type_p (TREE_PURPOSE (mem_inits), current_class_type)) 1028 { 1029 /* Delegating constructor. */ 1030 gcc_assert (TREE_CHAIN (mem_inits) == NULL_TREE); 1031 perform_target_ctor (TREE_VALUE (mem_inits)); 1032 return; 1033 } 1034 1035 if (DECL_DEFAULTED_FN (current_function_decl)) 1036 flags |= LOOKUP_DEFAULTED; 1037 1038 /* Sort the mem-initializers into the order in which the 1039 initializations should be performed. */ 1040 mem_inits = sort_mem_initializers (current_class_type, mem_inits); 1041 1042 in_base_initializer = 1; 1043 1044 /* Initialize base classes. */ 1045 while (mem_inits 1046 && TREE_CODE (TREE_PURPOSE (mem_inits)) != FIELD_DECL) 1047 { 1048 tree subobject = TREE_PURPOSE (mem_inits); 1049 tree arguments = TREE_VALUE (mem_inits); 1050 1051 if (arguments == NULL_TREE) 1052 { 1053 /* If these initializations are taking place in a copy constructor, 1054 the base class should probably be explicitly initialized if there 1055 is a user-defined constructor in the base class (other than the 1056 default constructor, which will be called anyway). */ 1057 if (extra_warnings 1058 && DECL_COPY_CONSTRUCTOR_P (current_function_decl) 1059 && type_has_user_nondefault_constructor (BINFO_TYPE (subobject))) 1060 warning_at (DECL_SOURCE_LOCATION (current_function_decl), 1061 OPT_Wextra, "base class %q#T should be explicitly " 1062 "initialized in the copy constructor", 1063 BINFO_TYPE (subobject)); 1064 } 1065 1066 /* Initialize the base. */ 1067 if (BINFO_VIRTUAL_P (subobject)) 1068 construct_virtual_base (subobject, arguments); 1069 else 1070 { 1071 tree base_addr; 1072 1073 base_addr = build_base_path (PLUS_EXPR, current_class_ptr, 1074 subobject, 1, tf_warning_or_error); 1075 expand_aggr_init_1 (subobject, NULL_TREE, 1076 cp_build_indirect_ref (base_addr, RO_NULL, 1077 tf_warning_or_error), 1078 arguments, 1079 flags, 1080 tf_warning_or_error); 1081 expand_cleanup_for_base (subobject, NULL_TREE); 1082 } 1083 1084 mem_inits = TREE_CHAIN (mem_inits); 1085 } 1086 in_base_initializer = 0; 1087 1088 /* Initialize the vptrs. */ 1089 initialize_vtbl_ptrs (current_class_ptr); 1090 1091 /* Initialize the data members. */ 1092 while (mem_inits) 1093 { 1094 perform_member_init (TREE_PURPOSE (mem_inits), 1095 TREE_VALUE (mem_inits)); 1096 mem_inits = TREE_CHAIN (mem_inits); 1097 } 1098 } 1099 1100 /* Returns the address of the vtable (i.e., the value that should be 1101 assigned to the vptr) for BINFO. */ 1102 1103 static tree 1104 build_vtbl_address (tree binfo) 1105 { 1106 tree binfo_for = binfo; 1107 tree vtbl; 1108 1109 if (BINFO_VPTR_INDEX (binfo) && BINFO_VIRTUAL_P (binfo)) 1110 /* If this is a virtual primary base, then the vtable we want to store 1111 is that for the base this is being used as the primary base of. We 1112 can't simply skip the initialization, because we may be expanding the 1113 inits of a subobject constructor where the virtual base layout 1114 can be different. */ 1115 while (BINFO_PRIMARY_P (binfo_for)) 1116 binfo_for = BINFO_INHERITANCE_CHAIN (binfo_for); 1117 1118 /* Figure out what vtable BINFO's vtable is based on, and mark it as 1119 used. */ 1120 vtbl = get_vtbl_decl_for_binfo (binfo_for); 1121 TREE_USED (vtbl) = 1; 1122 1123 /* Now compute the address to use when initializing the vptr. */ 1124 vtbl = unshare_expr (BINFO_VTABLE (binfo_for)); 1125 if (TREE_CODE (vtbl) == VAR_DECL) 1126 vtbl = build1 (ADDR_EXPR, build_pointer_type (TREE_TYPE (vtbl)), vtbl); 1127 1128 return vtbl; 1129 } 1130 1131 /* This code sets up the virtual function tables appropriate for 1132 the pointer DECL. It is a one-ply initialization. 1133 1134 BINFO is the exact type that DECL is supposed to be. In 1135 multiple inheritance, this might mean "C's A" if C : A, B. */ 1136 1137 static void 1138 expand_virtual_init (tree binfo, tree decl) 1139 { 1140 tree vtbl, vtbl_ptr; 1141 tree vtt_index; 1142 1143 /* Compute the initializer for vptr. */ 1144 vtbl = build_vtbl_address (binfo); 1145 1146 /* We may get this vptr from a VTT, if this is a subobject 1147 constructor or subobject destructor. */ 1148 vtt_index = BINFO_VPTR_INDEX (binfo); 1149 if (vtt_index) 1150 { 1151 tree vtbl2; 1152 tree vtt_parm; 1153 1154 /* Compute the value to use, when there's a VTT. */ 1155 vtt_parm = current_vtt_parm; 1156 vtbl2 = fold_build_pointer_plus (vtt_parm, vtt_index); 1157 vtbl2 = cp_build_indirect_ref (vtbl2, RO_NULL, tf_warning_or_error); 1158 vtbl2 = convert (TREE_TYPE (vtbl), vtbl2); 1159 1160 /* The actual initializer is the VTT value only in the subobject 1161 constructor. In maybe_clone_body we'll substitute NULL for 1162 the vtt_parm in the case of the non-subobject constructor. */ 1163 vtbl = build3 (COND_EXPR, 1164 TREE_TYPE (vtbl), 1165 build2 (EQ_EXPR, boolean_type_node, 1166 current_in_charge_parm, integer_zero_node), 1167 vtbl2, 1168 vtbl); 1169 } 1170 1171 /* Compute the location of the vtpr. */ 1172 vtbl_ptr = build_vfield_ref (cp_build_indirect_ref (decl, RO_NULL, 1173 tf_warning_or_error), 1174 TREE_TYPE (binfo)); 1175 gcc_assert (vtbl_ptr != error_mark_node); 1176 1177 /* Assign the vtable to the vptr. */ 1178 vtbl = convert_force (TREE_TYPE (vtbl_ptr), vtbl, 0); 1179 finish_expr_stmt (cp_build_modify_expr (vtbl_ptr, NOP_EXPR, vtbl, 1180 tf_warning_or_error)); 1181 } 1182 1183 /* If an exception is thrown in a constructor, those base classes already 1184 constructed must be destroyed. This function creates the cleanup 1185 for BINFO, which has just been constructed. If FLAG is non-NULL, 1186 it is a DECL which is nonzero when this base needs to be 1187 destroyed. */ 1188 1189 static void 1190 expand_cleanup_for_base (tree binfo, tree flag) 1191 { 1192 tree expr; 1193 1194 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (binfo))) 1195 return; 1196 1197 /* Call the destructor. */ 1198 expr = build_special_member_call (current_class_ref, 1199 base_dtor_identifier, 1200 NULL, 1201 binfo, 1202 LOOKUP_NORMAL | LOOKUP_NONVIRTUAL, 1203 tf_warning_or_error); 1204 if (flag) 1205 expr = fold_build3_loc (input_location, 1206 COND_EXPR, void_type_node, 1207 c_common_truthvalue_conversion (input_location, flag), 1208 expr, integer_zero_node); 1209 1210 finish_eh_cleanup (expr); 1211 } 1212 1213 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its 1214 constructor. */ 1215 1216 static void 1217 construct_virtual_base (tree vbase, tree arguments) 1218 { 1219 tree inner_if_stmt; 1220 tree exp; 1221 tree flag; 1222 1223 /* If there are virtual base classes with destructors, we need to 1224 emit cleanups to destroy them if an exception is thrown during 1225 the construction process. These exception regions (i.e., the 1226 period during which the cleanups must occur) begin from the time 1227 the construction is complete to the end of the function. If we 1228 create a conditional block in which to initialize the 1229 base-classes, then the cleanup region for the virtual base begins 1230 inside a block, and ends outside of that block. This situation 1231 confuses the sjlj exception-handling code. Therefore, we do not 1232 create a single conditional block, but one for each 1233 initialization. (That way the cleanup regions always begin 1234 in the outer block.) We trust the back end to figure out 1235 that the FLAG will not change across initializations, and 1236 avoid doing multiple tests. */ 1237 flag = DECL_CHAIN (DECL_ARGUMENTS (current_function_decl)); 1238 inner_if_stmt = begin_if_stmt (); 1239 finish_if_stmt_cond (flag, inner_if_stmt); 1240 1241 /* Compute the location of the virtual base. If we're 1242 constructing virtual bases, then we must be the most derived 1243 class. Therefore, we don't have to look up the virtual base; 1244 we already know where it is. */ 1245 exp = convert_to_base_statically (current_class_ref, vbase); 1246 1247 expand_aggr_init_1 (vbase, current_class_ref, exp, arguments, 1248 LOOKUP_COMPLAIN, tf_warning_or_error); 1249 finish_then_clause (inner_if_stmt); 1250 finish_if_stmt (inner_if_stmt); 1251 1252 expand_cleanup_for_base (vbase, flag); 1253 } 1254 1255 /* Find the context in which this FIELD can be initialized. */ 1256 1257 static tree 1258 initializing_context (tree field) 1259 { 1260 tree t = DECL_CONTEXT (field); 1261 1262 /* Anonymous union members can be initialized in the first enclosing 1263 non-anonymous union context. */ 1264 while (t && ANON_AGGR_TYPE_P (t)) 1265 t = TYPE_CONTEXT (t); 1266 return t; 1267 } 1268 1269 /* Function to give error message if member initialization specification 1270 is erroneous. FIELD is the member we decided to initialize. 1271 TYPE is the type for which the initialization is being performed. 1272 FIELD must be a member of TYPE. 1273 1274 MEMBER_NAME is the name of the member. */ 1275 1276 static int 1277 member_init_ok_or_else (tree field, tree type, tree member_name) 1278 { 1279 if (field == error_mark_node) 1280 return 0; 1281 if (!field) 1282 { 1283 error ("class %qT does not have any field named %qD", type, 1284 member_name); 1285 return 0; 1286 } 1287 if (TREE_CODE (field) == VAR_DECL) 1288 { 1289 error ("%q#D is a static data member; it can only be " 1290 "initialized at its definition", 1291 field); 1292 return 0; 1293 } 1294 if (TREE_CODE (field) != FIELD_DECL) 1295 { 1296 error ("%q#D is not a non-static data member of %qT", 1297 field, type); 1298 return 0; 1299 } 1300 if (initializing_context (field) != type) 1301 { 1302 error ("class %qT does not have any field named %qD", type, 1303 member_name); 1304 return 0; 1305 } 1306 1307 return 1; 1308 } 1309 1310 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it 1311 is a _TYPE node or TYPE_DECL which names a base for that type. 1312 Check the validity of NAME, and return either the base _TYPE, base 1313 binfo, or the FIELD_DECL of the member. If NAME is invalid, return 1314 NULL_TREE and issue a diagnostic. 1315 1316 An old style unnamed direct single base construction is permitted, 1317 where NAME is NULL. */ 1318 1319 tree 1320 expand_member_init (tree name) 1321 { 1322 tree basetype; 1323 tree field; 1324 1325 if (!current_class_ref) 1326 return NULL_TREE; 1327 1328 if (!name) 1329 { 1330 /* This is an obsolete unnamed base class initializer. The 1331 parser will already have warned about its use. */ 1332 switch (BINFO_N_BASE_BINFOS (TYPE_BINFO (current_class_type))) 1333 { 1334 case 0: 1335 error ("unnamed initializer for %qT, which has no base classes", 1336 current_class_type); 1337 return NULL_TREE; 1338 case 1: 1339 basetype = BINFO_TYPE 1340 (BINFO_BASE_BINFO (TYPE_BINFO (current_class_type), 0)); 1341 break; 1342 default: 1343 error ("unnamed initializer for %qT, which uses multiple inheritance", 1344 current_class_type); 1345 return NULL_TREE; 1346 } 1347 } 1348 else if (TYPE_P (name)) 1349 { 1350 basetype = TYPE_MAIN_VARIANT (name); 1351 name = TYPE_NAME (name); 1352 } 1353 else if (TREE_CODE (name) == TYPE_DECL) 1354 basetype = TYPE_MAIN_VARIANT (TREE_TYPE (name)); 1355 else 1356 basetype = NULL_TREE; 1357 1358 if (basetype) 1359 { 1360 tree class_binfo; 1361 tree direct_binfo; 1362 tree virtual_binfo; 1363 int i; 1364 1365 if (same_type_p (basetype, current_class_type) 1366 || current_template_parms) 1367 return basetype; 1368 1369 class_binfo = TYPE_BINFO (current_class_type); 1370 direct_binfo = NULL_TREE; 1371 virtual_binfo = NULL_TREE; 1372 1373 /* Look for a direct base. */ 1374 for (i = 0; BINFO_BASE_ITERATE (class_binfo, i, direct_binfo); ++i) 1375 if (SAME_BINFO_TYPE_P (BINFO_TYPE (direct_binfo), basetype)) 1376 break; 1377 1378 /* Look for a virtual base -- unless the direct base is itself 1379 virtual. */ 1380 if (!direct_binfo || !BINFO_VIRTUAL_P (direct_binfo)) 1381 virtual_binfo = binfo_for_vbase (basetype, current_class_type); 1382 1383 /* [class.base.init] 1384 1385 If a mem-initializer-id is ambiguous because it designates 1386 both a direct non-virtual base class and an inherited virtual 1387 base class, the mem-initializer is ill-formed. */ 1388 if (direct_binfo && virtual_binfo) 1389 { 1390 error ("%qD is both a direct base and an indirect virtual base", 1391 basetype); 1392 return NULL_TREE; 1393 } 1394 1395 if (!direct_binfo && !virtual_binfo) 1396 { 1397 if (CLASSTYPE_VBASECLASSES (current_class_type)) 1398 error ("type %qT is not a direct or virtual base of %qT", 1399 basetype, current_class_type); 1400 else 1401 error ("type %qT is not a direct base of %qT", 1402 basetype, current_class_type); 1403 return NULL_TREE; 1404 } 1405 1406 return direct_binfo ? direct_binfo : virtual_binfo; 1407 } 1408 else 1409 { 1410 if (TREE_CODE (name) == IDENTIFIER_NODE) 1411 field = lookup_field (current_class_type, name, 1, false); 1412 else 1413 field = name; 1414 1415 if (member_init_ok_or_else (field, current_class_type, name)) 1416 return field; 1417 } 1418 1419 return NULL_TREE; 1420 } 1421 1422 /* This is like `expand_member_init', only it stores one aggregate 1423 value into another. 1424 1425 INIT comes in two flavors: it is either a value which 1426 is to be stored in EXP, or it is a parameter list 1427 to go to a constructor, which will operate on EXP. 1428 If INIT is not a parameter list for a constructor, then set 1429 LOOKUP_ONLYCONVERTING. 1430 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of 1431 the initializer, if FLAGS is 0, then it is the (init) form. 1432 If `init' is a CONSTRUCTOR, then we emit a warning message, 1433 explaining that such initializations are invalid. 1434 1435 If INIT resolves to a CALL_EXPR which happens to return 1436 something of the type we are looking for, then we know 1437 that we can safely use that call to perform the 1438 initialization. 1439 1440 The virtual function table pointer cannot be set up here, because 1441 we do not really know its type. 1442 1443 This never calls operator=(). 1444 1445 When initializing, nothing is CONST. 1446 1447 A default copy constructor may have to be used to perform the 1448 initialization. 1449 1450 A constructor or a conversion operator may have to be used to 1451 perform the initialization, but not both, as it would be ambiguous. */ 1452 1453 tree 1454 build_aggr_init (tree exp, tree init, int flags, tsubst_flags_t complain) 1455 { 1456 tree stmt_expr; 1457 tree compound_stmt; 1458 int destroy_temps; 1459 tree type = TREE_TYPE (exp); 1460 int was_const = TREE_READONLY (exp); 1461 int was_volatile = TREE_THIS_VOLATILE (exp); 1462 int is_global; 1463 1464 if (init == error_mark_node) 1465 return error_mark_node; 1466 1467 TREE_READONLY (exp) = 0; 1468 TREE_THIS_VOLATILE (exp) = 0; 1469 1470 if (init && TREE_CODE (init) != TREE_LIST 1471 && !(TREE_CODE (init) == TARGET_EXPR 1472 && TARGET_EXPR_DIRECT_INIT_P (init)) 1473 && !(BRACE_ENCLOSED_INITIALIZER_P (init) 1474 && CONSTRUCTOR_IS_DIRECT_INIT (init))) 1475 flags |= LOOKUP_ONLYCONVERTING; 1476 1477 if (TREE_CODE (type) == ARRAY_TYPE) 1478 { 1479 tree itype; 1480 1481 /* An array may not be initialized use the parenthesized 1482 initialization form -- unless the initializer is "()". */ 1483 if (init && TREE_CODE (init) == TREE_LIST) 1484 { 1485 if (complain & tf_error) 1486 error ("bad array initializer"); 1487 return error_mark_node; 1488 } 1489 /* Must arrange to initialize each element of EXP 1490 from elements of INIT. */ 1491 itype = init ? TREE_TYPE (init) : NULL_TREE; 1492 if (cv_qualified_p (type)) 1493 TREE_TYPE (exp) = cv_unqualified (type); 1494 if (itype && cv_qualified_p (itype)) 1495 TREE_TYPE (init) = cv_unqualified (itype); 1496 stmt_expr = build_vec_init (exp, NULL_TREE, init, 1497 /*explicit_value_init_p=*/false, 1498 itype && same_type_p (TREE_TYPE (init), 1499 TREE_TYPE (exp)), 1500 complain); 1501 TREE_READONLY (exp) = was_const; 1502 TREE_THIS_VOLATILE (exp) = was_volatile; 1503 TREE_TYPE (exp) = type; 1504 if (init) 1505 TREE_TYPE (init) = itype; 1506 return stmt_expr; 1507 } 1508 1509 if (TREE_CODE (exp) == VAR_DECL || TREE_CODE (exp) == PARM_DECL) 1510 /* Just know that we've seen something for this node. */ 1511 TREE_USED (exp) = 1; 1512 1513 is_global = begin_init_stmts (&stmt_expr, &compound_stmt); 1514 destroy_temps = stmts_are_full_exprs_p (); 1515 current_stmt_tree ()->stmts_are_full_exprs_p = 0; 1516 expand_aggr_init_1 (TYPE_BINFO (type), exp, exp, 1517 init, LOOKUP_NORMAL|flags, complain); 1518 stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt); 1519 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps; 1520 TREE_READONLY (exp) = was_const; 1521 TREE_THIS_VOLATILE (exp) = was_volatile; 1522 1523 return stmt_expr; 1524 } 1525 1526 static void 1527 expand_default_init (tree binfo, tree true_exp, tree exp, tree init, int flags, 1528 tsubst_flags_t complain) 1529 { 1530 tree type = TREE_TYPE (exp); 1531 tree ctor_name; 1532 1533 /* It fails because there may not be a constructor which takes 1534 its own type as the first (or only parameter), but which does 1535 take other types via a conversion. So, if the thing initializing 1536 the expression is a unit element of type X, first try X(X&), 1537 followed by initialization by X. If neither of these work 1538 out, then look hard. */ 1539 tree rval; 1540 VEC(tree,gc) *parms; 1541 1542 /* If we have direct-initialization from an initializer list, pull 1543 it out of the TREE_LIST so the code below can see it. */ 1544 if (init && TREE_CODE (init) == TREE_LIST 1545 && BRACE_ENCLOSED_INITIALIZER_P (TREE_VALUE (init)) 1546 && CONSTRUCTOR_IS_DIRECT_INIT (TREE_VALUE (init))) 1547 { 1548 gcc_checking_assert ((flags & LOOKUP_ONLYCONVERTING) == 0 1549 && TREE_CHAIN (init) == NULL_TREE); 1550 init = TREE_VALUE (init); 1551 } 1552 1553 if (init && BRACE_ENCLOSED_INITIALIZER_P (init) 1554 && CP_AGGREGATE_TYPE_P (type)) 1555 /* A brace-enclosed initializer for an aggregate. In C++0x this can 1556 happen for direct-initialization, too. */ 1557 init = digest_init (type, init, complain); 1558 1559 /* A CONSTRUCTOR of the target's type is a previously digested 1560 initializer, whether that happened just above or in 1561 cp_parser_late_parsing_nsdmi. 1562 1563 A TARGET_EXPR with TARGET_EXPR_DIRECT_INIT_P or TARGET_EXPR_LIST_INIT_P 1564 set represents the whole initialization, so we shouldn't build up 1565 another ctor call. */ 1566 if (init 1567 && (TREE_CODE (init) == CONSTRUCTOR 1568 || (TREE_CODE (init) == TARGET_EXPR 1569 && (TARGET_EXPR_DIRECT_INIT_P (init) 1570 || TARGET_EXPR_LIST_INIT_P (init)))) 1571 && same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (init), type)) 1572 { 1573 /* Early initialization via a TARGET_EXPR only works for 1574 complete objects. */ 1575 gcc_assert (TREE_CODE (init) == CONSTRUCTOR || true_exp == exp); 1576 1577 init = build2 (INIT_EXPR, TREE_TYPE (exp), exp, init); 1578 TREE_SIDE_EFFECTS (init) = 1; 1579 finish_expr_stmt (init); 1580 return; 1581 } 1582 1583 if (init && TREE_CODE (init) != TREE_LIST 1584 && (flags & LOOKUP_ONLYCONVERTING)) 1585 { 1586 /* Base subobjects should only get direct-initialization. */ 1587 gcc_assert (true_exp == exp); 1588 1589 if (flags & DIRECT_BIND) 1590 /* Do nothing. We hit this in two cases: Reference initialization, 1591 where we aren't initializing a real variable, so we don't want 1592 to run a new constructor; and catching an exception, where we 1593 have already built up the constructor call so we could wrap it 1594 in an exception region. */; 1595 else 1596 init = ocp_convert (type, init, CONV_IMPLICIT|CONV_FORCE_TEMP, flags); 1597 1598 if (TREE_CODE (init) == MUST_NOT_THROW_EXPR) 1599 /* We need to protect the initialization of a catch parm with a 1600 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR 1601 around the TARGET_EXPR for the copy constructor. See 1602 initialize_handler_parm. */ 1603 { 1604 TREE_OPERAND (init, 0) = build2 (INIT_EXPR, TREE_TYPE (exp), exp, 1605 TREE_OPERAND (init, 0)); 1606 TREE_TYPE (init) = void_type_node; 1607 } 1608 else 1609 init = build2 (INIT_EXPR, TREE_TYPE (exp), exp, init); 1610 TREE_SIDE_EFFECTS (init) = 1; 1611 finish_expr_stmt (init); 1612 return; 1613 } 1614 1615 if (init == NULL_TREE) 1616 parms = NULL; 1617 else if (TREE_CODE (init) == TREE_LIST && !TREE_TYPE (init)) 1618 { 1619 parms = make_tree_vector (); 1620 for (; init != NULL_TREE; init = TREE_CHAIN (init)) 1621 VEC_safe_push (tree, gc, parms, TREE_VALUE (init)); 1622 } 1623 else 1624 parms = make_tree_vector_single (init); 1625 1626 if (exp == current_class_ref && current_function_decl 1627 && DECL_HAS_IN_CHARGE_PARM_P (current_function_decl)) 1628 { 1629 /* Delegating constructor. */ 1630 tree complete; 1631 tree base; 1632 tree elt; unsigned i; 1633 1634 /* Unshare the arguments for the second call. */ 1635 VEC(tree,gc) *parms2 = make_tree_vector (); 1636 FOR_EACH_VEC_ELT (tree, parms, i, elt) 1637 { 1638 elt = break_out_target_exprs (elt); 1639 VEC_safe_push (tree, gc, parms2, elt); 1640 } 1641 complete = build_special_member_call (exp, complete_ctor_identifier, 1642 &parms2, binfo, flags, 1643 complain); 1644 complete = fold_build_cleanup_point_expr (void_type_node, complete); 1645 release_tree_vector (parms2); 1646 1647 base = build_special_member_call (exp, base_ctor_identifier, 1648 &parms, binfo, flags, 1649 complain); 1650 base = fold_build_cleanup_point_expr (void_type_node, base); 1651 rval = build3 (COND_EXPR, void_type_node, 1652 build2 (EQ_EXPR, boolean_type_node, 1653 current_in_charge_parm, integer_zero_node), 1654 base, 1655 complete); 1656 } 1657 else 1658 { 1659 if (true_exp == exp) 1660 ctor_name = complete_ctor_identifier; 1661 else 1662 ctor_name = base_ctor_identifier; 1663 rval = build_special_member_call (exp, ctor_name, &parms, binfo, flags, 1664 complain); 1665 } 1666 1667 if (parms != NULL) 1668 release_tree_vector (parms); 1669 1670 if (exp == true_exp && TREE_CODE (rval) == CALL_EXPR) 1671 { 1672 tree fn = get_callee_fndecl (rval); 1673 if (fn && DECL_DECLARED_CONSTEXPR_P (fn)) 1674 { 1675 tree e = maybe_constant_init (rval); 1676 if (TREE_CONSTANT (e)) 1677 rval = build2 (INIT_EXPR, type, exp, e); 1678 } 1679 } 1680 1681 /* FIXME put back convert_to_void? */ 1682 if (TREE_SIDE_EFFECTS (rval)) 1683 finish_expr_stmt (rval); 1684 } 1685 1686 /* This function is responsible for initializing EXP with INIT 1687 (if any). 1688 1689 BINFO is the binfo of the type for who we are performing the 1690 initialization. For example, if W is a virtual base class of A and B, 1691 and C : A, B. 1692 If we are initializing B, then W must contain B's W vtable, whereas 1693 were we initializing C, W must contain C's W vtable. 1694 1695 TRUE_EXP is nonzero if it is the true expression being initialized. 1696 In this case, it may be EXP, or may just contain EXP. The reason we 1697 need this is because if EXP is a base element of TRUE_EXP, we 1698 don't necessarily know by looking at EXP where its virtual 1699 baseclass fields should really be pointing. But we do know 1700 from TRUE_EXP. In constructors, we don't know anything about 1701 the value being initialized. 1702 1703 FLAGS is just passed to `build_new_method_call'. See that function 1704 for its description. */ 1705 1706 static void 1707 expand_aggr_init_1 (tree binfo, tree true_exp, tree exp, tree init, int flags, 1708 tsubst_flags_t complain) 1709 { 1710 tree type = TREE_TYPE (exp); 1711 1712 gcc_assert (init != error_mark_node && type != error_mark_node); 1713 gcc_assert (building_stmt_list_p ()); 1714 1715 /* Use a function returning the desired type to initialize EXP for us. 1716 If the function is a constructor, and its first argument is 1717 NULL_TREE, know that it was meant for us--just slide exp on 1718 in and expand the constructor. Constructors now come 1719 as TARGET_EXPRs. */ 1720 1721 if (init && TREE_CODE (exp) == VAR_DECL 1722 && COMPOUND_LITERAL_P (init)) 1723 { 1724 VEC(tree,gc)* cleanups = NULL; 1725 /* If store_init_value returns NULL_TREE, the INIT has been 1726 recorded as the DECL_INITIAL for EXP. That means there's 1727 nothing more we have to do. */ 1728 init = store_init_value (exp, init, &cleanups, flags); 1729 if (init) 1730 finish_expr_stmt (init); 1731 gcc_assert (!cleanups); 1732 return; 1733 } 1734 1735 /* If an explicit -- but empty -- initializer list was present, 1736 that's value-initialization. */ 1737 if (init == void_type_node) 1738 { 1739 /* If the type has data but no user-provided ctor, we need to zero 1740 out the object. */ 1741 if (!type_has_user_provided_constructor (type) 1742 && !is_really_empty_class (type)) 1743 { 1744 tree field_size = NULL_TREE; 1745 if (exp != true_exp && CLASSTYPE_AS_BASE (type) != type) 1746 /* Don't clobber already initialized virtual bases. */ 1747 field_size = TYPE_SIZE (CLASSTYPE_AS_BASE (type)); 1748 init = build_zero_init_1 (type, NULL_TREE, /*static_storage_p=*/false, 1749 field_size); 1750 init = build2 (INIT_EXPR, type, exp, init); 1751 finish_expr_stmt (init); 1752 } 1753 1754 /* If we don't need to mess with the constructor at all, 1755 then we're done. */ 1756 if (! type_build_ctor_call (type)) 1757 return; 1758 1759 /* Otherwise fall through and call the constructor. */ 1760 init = NULL_TREE; 1761 } 1762 1763 /* We know that expand_default_init can handle everything we want 1764 at this point. */ 1765 expand_default_init (binfo, true_exp, exp, init, flags, complain); 1766 } 1767 1768 /* Report an error if TYPE is not a user-defined, class type. If 1769 OR_ELSE is nonzero, give an error message. */ 1770 1771 int 1772 is_class_type (tree type, int or_else) 1773 { 1774 if (type == error_mark_node) 1775 return 0; 1776 1777 if (! CLASS_TYPE_P (type)) 1778 { 1779 if (or_else) 1780 error ("%qT is not a class type", type); 1781 return 0; 1782 } 1783 return 1; 1784 } 1785 1786 tree 1787 get_type_value (tree name) 1788 { 1789 if (name == error_mark_node) 1790 return NULL_TREE; 1791 1792 if (IDENTIFIER_HAS_TYPE_VALUE (name)) 1793 return IDENTIFIER_TYPE_VALUE (name); 1794 else 1795 return NULL_TREE; 1796 } 1797 1798 /* Build a reference to a member of an aggregate. This is not a C++ 1799 `&', but really something which can have its address taken, and 1800 then act as a pointer to member, for example TYPE :: FIELD can have 1801 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if 1802 this expression is the operand of "&". 1803 1804 @@ Prints out lousy diagnostics for operator <typename> 1805 @@ fields. 1806 1807 @@ This function should be rewritten and placed in search.c. */ 1808 1809 tree 1810 build_offset_ref (tree type, tree member, bool address_p) 1811 { 1812 tree decl; 1813 tree basebinfo = NULL_TREE; 1814 1815 /* class templates can come in as TEMPLATE_DECLs here. */ 1816 if (TREE_CODE (member) == TEMPLATE_DECL) 1817 return member; 1818 1819 if (dependent_scope_p (type) || type_dependent_expression_p (member)) 1820 return build_qualified_name (NULL_TREE, type, member, 1821 /*template_p=*/false); 1822 1823 gcc_assert (TYPE_P (type)); 1824 if (! is_class_type (type, 1)) 1825 return error_mark_node; 1826 1827 gcc_assert (DECL_P (member) || BASELINK_P (member)); 1828 /* Callers should call mark_used before this point. */ 1829 gcc_assert (!DECL_P (member) || TREE_USED (member)); 1830 1831 type = TYPE_MAIN_VARIANT (type); 1832 if (!COMPLETE_OR_OPEN_TYPE_P (complete_type (type))) 1833 { 1834 error ("incomplete type %qT does not have member %qD", type, member); 1835 return error_mark_node; 1836 } 1837 1838 /* Entities other than non-static members need no further 1839 processing. */ 1840 if (TREE_CODE (member) == TYPE_DECL) 1841 return member; 1842 if (TREE_CODE (member) == VAR_DECL || TREE_CODE (member) == CONST_DECL) 1843 return convert_from_reference (member); 1844 1845 if (TREE_CODE (member) == FIELD_DECL && DECL_C_BIT_FIELD (member)) 1846 { 1847 error ("invalid pointer to bit-field %qD", member); 1848 return error_mark_node; 1849 } 1850 1851 /* Set up BASEBINFO for member lookup. */ 1852 decl = maybe_dummy_object (type, &basebinfo); 1853 1854 /* A lot of this logic is now handled in lookup_member. */ 1855 if (BASELINK_P (member)) 1856 { 1857 /* Go from the TREE_BASELINK to the member function info. */ 1858 tree t = BASELINK_FUNCTIONS (member); 1859 1860 if (TREE_CODE (t) != TEMPLATE_ID_EXPR && !really_overloaded_fn (t)) 1861 { 1862 /* Get rid of a potential OVERLOAD around it. */ 1863 t = OVL_CURRENT (t); 1864 1865 /* Unique functions are handled easily. */ 1866 1867 /* For non-static member of base class, we need a special rule 1868 for access checking [class.protected]: 1869 1870 If the access is to form a pointer to member, the 1871 nested-name-specifier shall name the derived class 1872 (or any class derived from that class). */ 1873 if (address_p && DECL_P (t) 1874 && DECL_NONSTATIC_MEMBER_P (t)) 1875 perform_or_defer_access_check (TYPE_BINFO (type), t, t); 1876 else 1877 perform_or_defer_access_check (basebinfo, t, t); 1878 1879 if (DECL_STATIC_FUNCTION_P (t)) 1880 return t; 1881 member = t; 1882 } 1883 else 1884 TREE_TYPE (member) = unknown_type_node; 1885 } 1886 else if (address_p && TREE_CODE (member) == FIELD_DECL) 1887 /* We need additional test besides the one in 1888 check_accessibility_of_qualified_id in case it is 1889 a pointer to non-static member. */ 1890 perform_or_defer_access_check (TYPE_BINFO (type), member, member); 1891 1892 if (!address_p) 1893 { 1894 /* If MEMBER is non-static, then the program has fallen afoul of 1895 [expr.prim]: 1896 1897 An id-expression that denotes a nonstatic data member or 1898 nonstatic member function of a class can only be used: 1899 1900 -- as part of a class member access (_expr.ref_) in which the 1901 object-expression refers to the member's class or a class 1902 derived from that class, or 1903 1904 -- to form a pointer to member (_expr.unary.op_), or 1905 1906 -- in the body of a nonstatic member function of that class or 1907 of a class derived from that class (_class.mfct.nonstatic_), or 1908 1909 -- in a mem-initializer for a constructor for that class or for 1910 a class derived from that class (_class.base.init_). */ 1911 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (member)) 1912 { 1913 /* Build a representation of the qualified name suitable 1914 for use as the operand to "&" -- even though the "&" is 1915 not actually present. */ 1916 member = build2 (OFFSET_REF, TREE_TYPE (member), decl, member); 1917 /* In Microsoft mode, treat a non-static member function as if 1918 it were a pointer-to-member. */ 1919 if (flag_ms_extensions) 1920 { 1921 PTRMEM_OK_P (member) = 1; 1922 return cp_build_addr_expr (member, tf_warning_or_error); 1923 } 1924 error ("invalid use of non-static member function %qD", 1925 TREE_OPERAND (member, 1)); 1926 return error_mark_node; 1927 } 1928 else if (TREE_CODE (member) == FIELD_DECL) 1929 { 1930 error ("invalid use of non-static data member %qD", member); 1931 return error_mark_node; 1932 } 1933 return member; 1934 } 1935 1936 member = build2 (OFFSET_REF, TREE_TYPE (member), decl, member); 1937 PTRMEM_OK_P (member) = 1; 1938 return member; 1939 } 1940 1941 /* If DECL is a scalar enumeration constant or variable with a 1942 constant initializer, return the initializer (or, its initializers, 1943 recursively); otherwise, return DECL. If INTEGRAL_P, the 1944 initializer is only returned if DECL is an integral 1945 constant-expression. If RETURN_AGGREGATE_CST_OK_P, it is ok to 1946 return an aggregate constant. */ 1947 1948 static tree 1949 constant_value_1 (tree decl, bool integral_p, bool return_aggregate_cst_ok_p) 1950 { 1951 while (TREE_CODE (decl) == CONST_DECL 1952 || (integral_p 1953 ? decl_constant_var_p (decl) 1954 : (TREE_CODE (decl) == VAR_DECL 1955 && CP_TYPE_CONST_NON_VOLATILE_P (TREE_TYPE (decl))))) 1956 { 1957 tree init; 1958 /* If DECL is a static data member in a template 1959 specialization, we must instantiate it here. The 1960 initializer for the static data member is not processed 1961 until needed; we need it now. */ 1962 mark_used (decl); 1963 mark_rvalue_use (decl); 1964 init = DECL_INITIAL (decl); 1965 if (init == error_mark_node) 1966 { 1967 if (DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl)) 1968 /* Treat the error as a constant to avoid cascading errors on 1969 excessively recursive template instantiation (c++/9335). */ 1970 return init; 1971 else 1972 return decl; 1973 } 1974 /* Initializers in templates are generally expanded during 1975 instantiation, so before that for const int i(2) 1976 INIT is a TREE_LIST with the actual initializer as 1977 TREE_VALUE. */ 1978 if (processing_template_decl 1979 && init 1980 && TREE_CODE (init) == TREE_LIST 1981 && TREE_CHAIN (init) == NULL_TREE) 1982 init = TREE_VALUE (init); 1983 if (!init 1984 || !TREE_TYPE (init) 1985 || !TREE_CONSTANT (init) 1986 || (!integral_p && !return_aggregate_cst_ok_p 1987 /* Unless RETURN_AGGREGATE_CST_OK_P is true, do not 1988 return an aggregate constant (of which string 1989 literals are a special case), as we do not want 1990 to make inadvertent copies of such entities, and 1991 we must be sure that their addresses are the 1992 same everywhere. */ 1993 && (TREE_CODE (init) == CONSTRUCTOR 1994 || TREE_CODE (init) == STRING_CST))) 1995 break; 1996 decl = unshare_expr (init); 1997 } 1998 return decl; 1999 } 2000 2001 /* If DECL is a CONST_DECL, or a constant VAR_DECL initialized by 2002 constant of integral or enumeration type, then return that value. 2003 These are those variables permitted in constant expressions by 2004 [5.19/1]. */ 2005 2006 tree 2007 integral_constant_value (tree decl) 2008 { 2009 return constant_value_1 (decl, /*integral_p=*/true, 2010 /*return_aggregate_cst_ok_p=*/false); 2011 } 2012 2013 /* A more relaxed version of integral_constant_value, used by the 2014 common C/C++ code. */ 2015 2016 tree 2017 decl_constant_value (tree decl) 2018 { 2019 return constant_value_1 (decl, /*integral_p=*/processing_template_decl, 2020 /*return_aggregate_cst_ok_p=*/true); 2021 } 2022 2023 /* A version of integral_constant_value used by the C++ front end for 2024 optimization purposes. */ 2025 2026 tree 2027 decl_constant_value_safe (tree decl) 2028 { 2029 return constant_value_1 (decl, /*integral_p=*/processing_template_decl, 2030 /*return_aggregate_cst_ok_p=*/false); 2031 } 2032 2033 /* Common subroutines of build_new and build_vec_delete. */ 2034 2035 /* Call the global __builtin_delete to delete ADDR. */ 2036 2037 static tree 2038 build_builtin_delete_call (tree addr) 2039 { 2040 mark_used (global_delete_fndecl); 2041 return build_call_n (global_delete_fndecl, 1, addr); 2042 } 2043 2044 /* Build and return a NEW_EXPR. If NELTS is non-NULL, TYPE[NELTS] is 2045 the type of the object being allocated; otherwise, it's just TYPE. 2046 INIT is the initializer, if any. USE_GLOBAL_NEW is true if the 2047 user explicitly wrote "::operator new". PLACEMENT, if non-NULL, is 2048 a vector of arguments to be provided as arguments to a placement 2049 new operator. This routine performs no semantic checks; it just 2050 creates and returns a NEW_EXPR. */ 2051 2052 static tree 2053 build_raw_new_expr (VEC(tree,gc) *placement, tree type, tree nelts, 2054 VEC(tree,gc) *init, int use_global_new) 2055 { 2056 tree init_list; 2057 tree new_expr; 2058 2059 /* If INIT is NULL, the we want to store NULL_TREE in the NEW_EXPR. 2060 If INIT is not NULL, then we want to store VOID_ZERO_NODE. This 2061 permits us to distinguish the case of a missing initializer "new 2062 int" from an empty initializer "new int()". */ 2063 if (init == NULL) 2064 init_list = NULL_TREE; 2065 else if (VEC_empty (tree, init)) 2066 init_list = void_zero_node; 2067 else 2068 init_list = build_tree_list_vec (init); 2069 2070 new_expr = build4 (NEW_EXPR, build_pointer_type (type), 2071 build_tree_list_vec (placement), type, nelts, 2072 init_list); 2073 NEW_EXPR_USE_GLOBAL (new_expr) = use_global_new; 2074 TREE_SIDE_EFFECTS (new_expr) = 1; 2075 2076 return new_expr; 2077 } 2078 2079 /* Diagnose uninitialized const members or reference members of type 2080 TYPE. USING_NEW is used to disambiguate the diagnostic between a 2081 new expression without a new-initializer and a declaration. Returns 2082 the error count. */ 2083 2084 static int 2085 diagnose_uninitialized_cst_or_ref_member_1 (tree type, tree origin, 2086 bool using_new, bool complain) 2087 { 2088 tree field; 2089 int error_count = 0; 2090 2091 if (type_has_user_provided_constructor (type)) 2092 return 0; 2093 2094 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field)) 2095 { 2096 tree field_type; 2097 2098 if (TREE_CODE (field) != FIELD_DECL) 2099 continue; 2100 2101 field_type = strip_array_types (TREE_TYPE (field)); 2102 2103 if (type_has_user_provided_constructor (field_type)) 2104 continue; 2105 2106 if (TREE_CODE (field_type) == REFERENCE_TYPE) 2107 { 2108 ++ error_count; 2109 if (complain) 2110 { 2111 if (using_new) 2112 error ("uninitialized reference member in %q#T " 2113 "using %<new%> without new-initializer", origin); 2114 else 2115 error ("uninitialized reference member in %q#T", origin); 2116 inform (DECL_SOURCE_LOCATION (field), 2117 "%qD should be initialized", field); 2118 } 2119 } 2120 2121 if (CP_TYPE_CONST_P (field_type)) 2122 { 2123 ++ error_count; 2124 if (complain) 2125 { 2126 if (using_new) 2127 error ("uninitialized const member in %q#T " 2128 "using %<new%> without new-initializer", origin); 2129 else 2130 error ("uninitialized const member in %q#T", origin); 2131 inform (DECL_SOURCE_LOCATION (field), 2132 "%qD should be initialized", field); 2133 } 2134 } 2135 2136 if (CLASS_TYPE_P (field_type)) 2137 error_count 2138 += diagnose_uninitialized_cst_or_ref_member_1 (field_type, origin, 2139 using_new, complain); 2140 } 2141 return error_count; 2142 } 2143 2144 int 2145 diagnose_uninitialized_cst_or_ref_member (tree type, bool using_new, bool complain) 2146 { 2147 return diagnose_uninitialized_cst_or_ref_member_1 (type, type, using_new, complain); 2148 } 2149 2150 /* Generate code for a new-expression, including calling the "operator 2151 new" function, initializing the object, and, if an exception occurs 2152 during construction, cleaning up. The arguments are as for 2153 build_raw_new_expr. This may change PLACEMENT and INIT. */ 2154 2155 static tree 2156 build_new_1 (VEC(tree,gc) **placement, tree type, tree nelts, 2157 VEC(tree,gc) **init, bool globally_qualified_p, 2158 tsubst_flags_t complain) 2159 { 2160 tree size, rval; 2161 /* True iff this is a call to "operator new[]" instead of just 2162 "operator new". */ 2163 bool array_p = false; 2164 /* If ARRAY_P is true, the element type of the array. This is never 2165 an ARRAY_TYPE; for something like "new int[3][4]", the 2166 ELT_TYPE is "int". If ARRAY_P is false, this is the same type as 2167 TYPE. */ 2168 tree elt_type; 2169 /* The type of the new-expression. (This type is always a pointer 2170 type.) */ 2171 tree pointer_type; 2172 tree non_const_pointer_type; 2173 tree outer_nelts = NULL_TREE; 2174 tree alloc_call, alloc_expr; 2175 /* The address returned by the call to "operator new". This node is 2176 a VAR_DECL and is therefore reusable. */ 2177 tree alloc_node; 2178 tree alloc_fn; 2179 tree cookie_expr, init_expr; 2180 int nothrow, check_new; 2181 int use_java_new = 0; 2182 /* If non-NULL, the number of extra bytes to allocate at the 2183 beginning of the storage allocated for an array-new expression in 2184 order to store the number of elements. */ 2185 tree cookie_size = NULL_TREE; 2186 tree placement_first; 2187 tree placement_expr = NULL_TREE; 2188 /* True if the function we are calling is a placement allocation 2189 function. */ 2190 bool placement_allocation_fn_p; 2191 /* True if the storage must be initialized, either by a constructor 2192 or due to an explicit new-initializer. */ 2193 bool is_initialized; 2194 /* The address of the thing allocated, not including any cookie. In 2195 particular, if an array cookie is in use, DATA_ADDR is the 2196 address of the first array element. This node is a VAR_DECL, and 2197 is therefore reusable. */ 2198 tree data_addr; 2199 tree init_preeval_expr = NULL_TREE; 2200 2201 if (nelts) 2202 { 2203 outer_nelts = nelts; 2204 array_p = true; 2205 } 2206 else if (TREE_CODE (type) == ARRAY_TYPE) 2207 { 2208 array_p = true; 2209 nelts = array_type_nelts_top (type); 2210 outer_nelts = nelts; 2211 type = TREE_TYPE (type); 2212 } 2213 2214 /* If our base type is an array, then make sure we know how many elements 2215 it has. */ 2216 for (elt_type = type; 2217 TREE_CODE (elt_type) == ARRAY_TYPE; 2218 elt_type = TREE_TYPE (elt_type)) 2219 nelts = cp_build_binary_op (input_location, 2220 MULT_EXPR, nelts, 2221 array_type_nelts_top (elt_type), 2222 complain); 2223 2224 if (TREE_CODE (elt_type) == VOID_TYPE) 2225 { 2226 if (complain & tf_error) 2227 error ("invalid type %<void%> for new"); 2228 return error_mark_node; 2229 } 2230 2231 if (abstract_virtuals_error_sfinae (NULL_TREE, elt_type, complain)) 2232 return error_mark_node; 2233 2234 is_initialized = (type_build_ctor_call (elt_type) || *init != NULL); 2235 2236 if (*init == NULL) 2237 { 2238 bool maybe_uninitialized_error = false; 2239 /* A program that calls for default-initialization [...] of an 2240 entity of reference type is ill-formed. */ 2241 if (CLASSTYPE_REF_FIELDS_NEED_INIT (elt_type)) 2242 maybe_uninitialized_error = true; 2243 2244 /* A new-expression that creates an object of type T initializes 2245 that object as follows: 2246 - If the new-initializer is omitted: 2247 -- If T is a (possibly cv-qualified) non-POD class type 2248 (or array thereof), the object is default-initialized (8.5). 2249 [...] 2250 -- Otherwise, the object created has indeterminate 2251 value. If T is a const-qualified type, or a (possibly 2252 cv-qualified) POD class type (or array thereof) 2253 containing (directly or indirectly) a member of 2254 const-qualified type, the program is ill-formed; */ 2255 2256 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (elt_type)) 2257 maybe_uninitialized_error = true; 2258 2259 if (maybe_uninitialized_error 2260 && diagnose_uninitialized_cst_or_ref_member (elt_type, 2261 /*using_new=*/true, 2262 complain & tf_error)) 2263 return error_mark_node; 2264 } 2265 2266 if (CP_TYPE_CONST_P (elt_type) && *init == NULL 2267 && default_init_uninitialized_part (elt_type)) 2268 { 2269 if (complain & tf_error) 2270 error ("uninitialized const in %<new%> of %q#T", elt_type); 2271 return error_mark_node; 2272 } 2273 2274 size = size_in_bytes (elt_type); 2275 if (array_p) 2276 size = size_binop (MULT_EXPR, size, convert (sizetype, nelts)); 2277 2278 alloc_fn = NULL_TREE; 2279 2280 /* If PLACEMENT is a single simple pointer type not passed by 2281 reference, prepare to capture it in a temporary variable. Do 2282 this now, since PLACEMENT will change in the calls below. */ 2283 placement_first = NULL_TREE; 2284 if (VEC_length (tree, *placement) == 1 2285 && (TREE_CODE (TREE_TYPE (VEC_index (tree, *placement, 0))) 2286 == POINTER_TYPE)) 2287 placement_first = VEC_index (tree, *placement, 0); 2288 2289 /* Allocate the object. */ 2290 if (VEC_empty (tree, *placement) && TYPE_FOR_JAVA (elt_type)) 2291 { 2292 tree class_addr; 2293 tree class_decl = build_java_class_ref (elt_type); 2294 static const char alloc_name[] = "_Jv_AllocObject"; 2295 2296 if (class_decl == error_mark_node) 2297 return error_mark_node; 2298 2299 use_java_new = 1; 2300 if (!get_global_value_if_present (get_identifier (alloc_name), 2301 &alloc_fn)) 2302 { 2303 if (complain & tf_error) 2304 error ("call to Java constructor with %qs undefined", alloc_name); 2305 return error_mark_node; 2306 } 2307 else if (really_overloaded_fn (alloc_fn)) 2308 { 2309 if (complain & tf_error) 2310 error ("%qD should never be overloaded", alloc_fn); 2311 return error_mark_node; 2312 } 2313 alloc_fn = OVL_CURRENT (alloc_fn); 2314 class_addr = build1 (ADDR_EXPR, jclass_node, class_decl); 2315 alloc_call = cp_build_function_call_nary (alloc_fn, complain, 2316 class_addr, NULL_TREE); 2317 } 2318 else if (TYPE_FOR_JAVA (elt_type) && MAYBE_CLASS_TYPE_P (elt_type)) 2319 { 2320 error ("Java class %q#T object allocated using placement new", elt_type); 2321 return error_mark_node; 2322 } 2323 else 2324 { 2325 tree fnname; 2326 tree fns; 2327 2328 fnname = ansi_opname (array_p ? VEC_NEW_EXPR : NEW_EXPR); 2329 2330 if (!globally_qualified_p 2331 && CLASS_TYPE_P (elt_type) 2332 && (array_p 2333 ? TYPE_HAS_ARRAY_NEW_OPERATOR (elt_type) 2334 : TYPE_HAS_NEW_OPERATOR (elt_type))) 2335 { 2336 /* Use a class-specific operator new. */ 2337 /* If a cookie is required, add some extra space. */ 2338 if (array_p && TYPE_VEC_NEW_USES_COOKIE (elt_type)) 2339 { 2340 cookie_size = targetm.cxx.get_cookie_size (elt_type); 2341 size = size_binop (PLUS_EXPR, size, cookie_size); 2342 } 2343 /* Create the argument list. */ 2344 VEC_safe_insert (tree, gc, *placement, 0, size); 2345 /* Do name-lookup to find the appropriate operator. */ 2346 fns = lookup_fnfields (elt_type, fnname, /*protect=*/2); 2347 if (fns == NULL_TREE) 2348 { 2349 if (complain & tf_error) 2350 error ("no suitable %qD found in class %qT", fnname, elt_type); 2351 return error_mark_node; 2352 } 2353 if (TREE_CODE (fns) == TREE_LIST) 2354 { 2355 if (complain & tf_error) 2356 { 2357 error ("request for member %qD is ambiguous", fnname); 2358 print_candidates (fns); 2359 } 2360 return error_mark_node; 2361 } 2362 alloc_call = build_new_method_call (build_dummy_object (elt_type), 2363 fns, placement, 2364 /*conversion_path=*/NULL_TREE, 2365 LOOKUP_NORMAL, 2366 &alloc_fn, 2367 complain); 2368 } 2369 else 2370 { 2371 /* Use a global operator new. */ 2372 /* See if a cookie might be required. */ 2373 if (array_p && TYPE_VEC_NEW_USES_COOKIE (elt_type)) 2374 cookie_size = targetm.cxx.get_cookie_size (elt_type); 2375 else 2376 cookie_size = NULL_TREE; 2377 2378 alloc_call = build_operator_new_call (fnname, placement, 2379 &size, &cookie_size, 2380 &alloc_fn); 2381 } 2382 } 2383 2384 if (alloc_call == error_mark_node) 2385 return error_mark_node; 2386 2387 gcc_assert (alloc_fn != NULL_TREE); 2388 2389 /* If we found a simple case of PLACEMENT_EXPR above, then copy it 2390 into a temporary variable. */ 2391 if (!processing_template_decl 2392 && placement_first != NULL_TREE 2393 && TREE_CODE (alloc_call) == CALL_EXPR 2394 && call_expr_nargs (alloc_call) == 2 2395 && TREE_CODE (TREE_TYPE (CALL_EXPR_ARG (alloc_call, 0))) == INTEGER_TYPE 2396 && TREE_CODE (TREE_TYPE (CALL_EXPR_ARG (alloc_call, 1))) == POINTER_TYPE) 2397 { 2398 tree placement_arg = CALL_EXPR_ARG (alloc_call, 1); 2399 2400 if (INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (TREE_TYPE (placement_arg))) 2401 || VOID_TYPE_P (TREE_TYPE (TREE_TYPE (placement_arg)))) 2402 { 2403 placement_expr = get_target_expr (placement_first); 2404 CALL_EXPR_ARG (alloc_call, 1) 2405 = convert (TREE_TYPE (placement_arg), placement_expr); 2406 } 2407 } 2408 2409 /* In the simple case, we can stop now. */ 2410 pointer_type = build_pointer_type (type); 2411 if (!cookie_size && !is_initialized) 2412 return build_nop (pointer_type, alloc_call); 2413 2414 /* Store the result of the allocation call in a variable so that we can 2415 use it more than once. */ 2416 alloc_expr = get_target_expr (alloc_call); 2417 alloc_node = TARGET_EXPR_SLOT (alloc_expr); 2418 2419 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */ 2420 while (TREE_CODE (alloc_call) == COMPOUND_EXPR) 2421 alloc_call = TREE_OPERAND (alloc_call, 1); 2422 2423 /* Now, check to see if this function is actually a placement 2424 allocation function. This can happen even when PLACEMENT is NULL 2425 because we might have something like: 2426 2427 struct S { void* operator new (size_t, int i = 0); }; 2428 2429 A call to `new S' will get this allocation function, even though 2430 there is no explicit placement argument. If there is more than 2431 one argument, or there are variable arguments, then this is a 2432 placement allocation function. */ 2433 placement_allocation_fn_p 2434 = (type_num_arguments (TREE_TYPE (alloc_fn)) > 1 2435 || varargs_function_p (alloc_fn)); 2436 2437 /* Preevaluate the placement args so that we don't reevaluate them for a 2438 placement delete. */ 2439 if (placement_allocation_fn_p) 2440 { 2441 tree inits; 2442 stabilize_call (alloc_call, &inits); 2443 if (inits) 2444 alloc_expr = build2 (COMPOUND_EXPR, TREE_TYPE (alloc_expr), inits, 2445 alloc_expr); 2446 } 2447 2448 /* unless an allocation function is declared with an empty excep- 2449 tion-specification (_except.spec_), throw(), it indicates failure to 2450 allocate storage by throwing a bad_alloc exception (clause _except_, 2451 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo- 2452 cation function is declared with an empty exception-specification, 2453 throw(), it returns null to indicate failure to allocate storage and a 2454 non-null pointer otherwise. 2455 2456 So check for a null exception spec on the op new we just called. */ 2457 2458 nothrow = TYPE_NOTHROW_P (TREE_TYPE (alloc_fn)); 2459 check_new = (flag_check_new || nothrow) && ! use_java_new; 2460 2461 if (cookie_size) 2462 { 2463 tree cookie; 2464 tree cookie_ptr; 2465 tree size_ptr_type; 2466 2467 /* Adjust so we're pointing to the start of the object. */ 2468 data_addr = fold_build_pointer_plus (alloc_node, cookie_size); 2469 2470 /* Store the number of bytes allocated so that we can know how 2471 many elements to destroy later. We use the last sizeof 2472 (size_t) bytes to store the number of elements. */ 2473 cookie_ptr = size_binop (MINUS_EXPR, cookie_size, size_in_bytes (sizetype)); 2474 cookie_ptr = fold_build_pointer_plus_loc (input_location, 2475 alloc_node, cookie_ptr); 2476 size_ptr_type = build_pointer_type (sizetype); 2477 cookie_ptr = fold_convert (size_ptr_type, cookie_ptr); 2478 cookie = cp_build_indirect_ref (cookie_ptr, RO_NULL, complain); 2479 2480 cookie_expr = build2 (MODIFY_EXPR, sizetype, cookie, nelts); 2481 2482 if (targetm.cxx.cookie_has_size ()) 2483 { 2484 /* Also store the element size. */ 2485 cookie_ptr = fold_build_pointer_plus (cookie_ptr, 2486 fold_build1_loc (input_location, 2487 NEGATE_EXPR, sizetype, 2488 size_in_bytes (sizetype))); 2489 2490 cookie = cp_build_indirect_ref (cookie_ptr, RO_NULL, complain); 2491 cookie = build2 (MODIFY_EXPR, sizetype, cookie, 2492 size_in_bytes (elt_type)); 2493 cookie_expr = build2 (COMPOUND_EXPR, TREE_TYPE (cookie_expr), 2494 cookie, cookie_expr); 2495 } 2496 } 2497 else 2498 { 2499 cookie_expr = NULL_TREE; 2500 data_addr = alloc_node; 2501 } 2502 2503 /* Now use a pointer to the type we've actually allocated. */ 2504 2505 /* But we want to operate on a non-const version to start with, 2506 since we'll be modifying the elements. */ 2507 non_const_pointer_type = build_pointer_type 2508 (cp_build_qualified_type (type, cp_type_quals (type) & ~TYPE_QUAL_CONST)); 2509 2510 data_addr = fold_convert (non_const_pointer_type, data_addr); 2511 /* Any further uses of alloc_node will want this type, too. */ 2512 alloc_node = fold_convert (non_const_pointer_type, alloc_node); 2513 2514 /* Now initialize the allocated object. Note that we preevaluate the 2515 initialization expression, apart from the actual constructor call or 2516 assignment--we do this because we want to delay the allocation as long 2517 as possible in order to minimize the size of the exception region for 2518 placement delete. */ 2519 if (is_initialized) 2520 { 2521 bool stable; 2522 bool explicit_value_init_p = false; 2523 2524 if (*init != NULL && VEC_empty (tree, *init)) 2525 { 2526 *init = NULL; 2527 explicit_value_init_p = true; 2528 } 2529 2530 if (processing_template_decl && explicit_value_init_p) 2531 { 2532 /* build_value_init doesn't work in templates, and we don't need 2533 the initializer anyway since we're going to throw it away and 2534 rebuild it at instantiation time, so just build up a single 2535 constructor call to get any appropriate diagnostics. */ 2536 init_expr = cp_build_indirect_ref (data_addr, RO_NULL, complain); 2537 if (type_build_ctor_call (elt_type)) 2538 init_expr = build_special_member_call (init_expr, 2539 complete_ctor_identifier, 2540 init, elt_type, 2541 LOOKUP_NORMAL, 2542 complain); 2543 stable = stabilize_init (init_expr, &init_preeval_expr); 2544 } 2545 else if (array_p) 2546 { 2547 tree vecinit = NULL_TREE; 2548 if (*init && VEC_length (tree, *init) == 1 2549 && BRACE_ENCLOSED_INITIALIZER_P (VEC_index (tree, *init, 0)) 2550 && CONSTRUCTOR_IS_DIRECT_INIT (VEC_index (tree, *init, 0))) 2551 { 2552 vecinit = VEC_index (tree, *init, 0); 2553 if (CONSTRUCTOR_NELTS (vecinit) == 0) 2554 /* List-value-initialization, leave it alone. */; 2555 else 2556 { 2557 tree arraytype, domain; 2558 if (TREE_CONSTANT (nelts)) 2559 domain = compute_array_index_type (NULL_TREE, nelts, 2560 complain); 2561 else 2562 { 2563 domain = NULL_TREE; 2564 if (CONSTRUCTOR_NELTS (vecinit) > 0) 2565 warning (0, "non-constant array size in new, unable " 2566 "to verify length of initializer-list"); 2567 } 2568 arraytype = build_cplus_array_type (type, domain); 2569 vecinit = digest_init (arraytype, vecinit, complain); 2570 } 2571 } 2572 else if (*init) 2573 { 2574 if (complain & tf_error) 2575 permerror (input_location, 2576 "parenthesized initializer in array new"); 2577 else 2578 return error_mark_node; 2579 vecinit = build_tree_list_vec (*init); 2580 } 2581 init_expr 2582 = build_vec_init (data_addr, 2583 cp_build_binary_op (input_location, 2584 MINUS_EXPR, outer_nelts, 2585 integer_one_node, 2586 complain), 2587 vecinit, 2588 explicit_value_init_p, 2589 /*from_array=*/0, 2590 complain); 2591 2592 /* An array initialization is stable because the initialization 2593 of each element is a full-expression, so the temporaries don't 2594 leak out. */ 2595 stable = true; 2596 } 2597 else 2598 { 2599 init_expr = cp_build_indirect_ref (data_addr, RO_NULL, complain); 2600 2601 if (type_build_ctor_call (type) && !explicit_value_init_p) 2602 { 2603 init_expr = build_special_member_call (init_expr, 2604 complete_ctor_identifier, 2605 init, elt_type, 2606 LOOKUP_NORMAL, 2607 complain); 2608 } 2609 else if (explicit_value_init_p) 2610 { 2611 /* Something like `new int()'. */ 2612 tree val = build_value_init (type, complain); 2613 if (val == error_mark_node) 2614 return error_mark_node; 2615 init_expr = build2 (INIT_EXPR, type, init_expr, val); 2616 } 2617 else 2618 { 2619 tree ie; 2620 2621 /* We are processing something like `new int (10)', which 2622 means allocate an int, and initialize it with 10. */ 2623 2624 ie = build_x_compound_expr_from_vec (*init, "new initializer"); 2625 init_expr = cp_build_modify_expr (init_expr, INIT_EXPR, ie, 2626 complain); 2627 } 2628 stable = stabilize_init (init_expr, &init_preeval_expr); 2629 } 2630 2631 if (init_expr == error_mark_node) 2632 return error_mark_node; 2633 2634 /* If any part of the object initialization terminates by throwing an 2635 exception and a suitable deallocation function can be found, the 2636 deallocation function is called to free the memory in which the 2637 object was being constructed, after which the exception continues 2638 to propagate in the context of the new-expression. If no 2639 unambiguous matching deallocation function can be found, 2640 propagating the exception does not cause the object's memory to be 2641 freed. */ 2642 if (flag_exceptions && ! use_java_new) 2643 { 2644 enum tree_code dcode = array_p ? VEC_DELETE_EXPR : DELETE_EXPR; 2645 tree cleanup; 2646 2647 /* The Standard is unclear here, but the right thing to do 2648 is to use the same method for finding deallocation 2649 functions that we use for finding allocation functions. */ 2650 cleanup = (build_op_delete_call 2651 (dcode, 2652 alloc_node, 2653 size, 2654 globally_qualified_p, 2655 placement_allocation_fn_p ? alloc_call : NULL_TREE, 2656 alloc_fn)); 2657 2658 if (!cleanup) 2659 /* We're done. */; 2660 else if (stable) 2661 /* This is much simpler if we were able to preevaluate all of 2662 the arguments to the constructor call. */ 2663 { 2664 /* CLEANUP is compiler-generated, so no diagnostics. */ 2665 TREE_NO_WARNING (cleanup) = true; 2666 init_expr = build2 (TRY_CATCH_EXPR, void_type_node, 2667 init_expr, cleanup); 2668 /* Likewise, this try-catch is compiler-generated. */ 2669 TREE_NO_WARNING (init_expr) = true; 2670 } 2671 else 2672 /* Ack! First we allocate the memory. Then we set our sentry 2673 variable to true, and expand a cleanup that deletes the 2674 memory if sentry is true. Then we run the constructor, and 2675 finally clear the sentry. 2676 2677 We need to do this because we allocate the space first, so 2678 if there are any temporaries with cleanups in the 2679 constructor args and we weren't able to preevaluate them, we 2680 need this EH region to extend until end of full-expression 2681 to preserve nesting. */ 2682 { 2683 tree end, sentry, begin; 2684 2685 begin = get_target_expr (boolean_true_node); 2686 CLEANUP_EH_ONLY (begin) = 1; 2687 2688 sentry = TARGET_EXPR_SLOT (begin); 2689 2690 /* CLEANUP is compiler-generated, so no diagnostics. */ 2691 TREE_NO_WARNING (cleanup) = true; 2692 2693 TARGET_EXPR_CLEANUP (begin) 2694 = build3 (COND_EXPR, void_type_node, sentry, 2695 cleanup, void_zero_node); 2696 2697 end = build2 (MODIFY_EXPR, TREE_TYPE (sentry), 2698 sentry, boolean_false_node); 2699 2700 init_expr 2701 = build2 (COMPOUND_EXPR, void_type_node, begin, 2702 build2 (COMPOUND_EXPR, void_type_node, init_expr, 2703 end)); 2704 /* Likewise, this is compiler-generated. */ 2705 TREE_NO_WARNING (init_expr) = true; 2706 } 2707 } 2708 } 2709 else 2710 init_expr = NULL_TREE; 2711 2712 /* Now build up the return value in reverse order. */ 2713 2714 rval = data_addr; 2715 2716 if (init_expr) 2717 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), init_expr, rval); 2718 if (cookie_expr) 2719 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), cookie_expr, rval); 2720 2721 if (rval == data_addr) 2722 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR 2723 and return the call (which doesn't need to be adjusted). */ 2724 rval = TARGET_EXPR_INITIAL (alloc_expr); 2725 else 2726 { 2727 if (check_new) 2728 { 2729 tree ifexp = cp_build_binary_op (input_location, 2730 NE_EXPR, alloc_node, 2731 nullptr_node, 2732 complain); 2733 rval = build_conditional_expr (ifexp, rval, alloc_node, 2734 complain); 2735 } 2736 2737 /* Perform the allocation before anything else, so that ALLOC_NODE 2738 has been initialized before we start using it. */ 2739 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), alloc_expr, rval); 2740 } 2741 2742 if (init_preeval_expr) 2743 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), init_preeval_expr, rval); 2744 2745 /* A new-expression is never an lvalue. */ 2746 gcc_assert (!lvalue_p (rval)); 2747 2748 return convert (pointer_type, rval); 2749 } 2750 2751 /* Generate a representation for a C++ "new" expression. *PLACEMENT 2752 is a vector of placement-new arguments (or NULL if none). If NELTS 2753 is NULL, TYPE is the type of the storage to be allocated. If NELTS 2754 is not NULL, then this is an array-new allocation; TYPE is the type 2755 of the elements in the array and NELTS is the number of elements in 2756 the array. *INIT, if non-NULL, is the initializer for the new 2757 object, or an empty vector to indicate an initializer of "()". If 2758 USE_GLOBAL_NEW is true, then the user explicitly wrote "::new" 2759 rather than just "new". This may change PLACEMENT and INIT. */ 2760 2761 tree 2762 build_new (VEC(tree,gc) **placement, tree type, tree nelts, 2763 VEC(tree,gc) **init, int use_global_new, tsubst_flags_t complain) 2764 { 2765 tree rval; 2766 VEC(tree,gc) *orig_placement = NULL; 2767 tree orig_nelts = NULL_TREE; 2768 VEC(tree,gc) *orig_init = NULL; 2769 2770 if (type == error_mark_node) 2771 return error_mark_node; 2772 2773 if (nelts == NULL_TREE && VEC_length (tree, *init) == 1 2774 /* Don't do auto deduction where it might affect mangling. */ 2775 && (!processing_template_decl || at_function_scope_p ())) 2776 { 2777 tree auto_node = type_uses_auto (type); 2778 if (auto_node) 2779 { 2780 tree d_init = VEC_index (tree, *init, 0); 2781 d_init = resolve_nondeduced_context (d_init); 2782 type = do_auto_deduction (type, d_init, auto_node); 2783 } 2784 } 2785 2786 if (processing_template_decl) 2787 { 2788 if (dependent_type_p (type) 2789 || any_type_dependent_arguments_p (*placement) 2790 || (nelts && type_dependent_expression_p (nelts)) 2791 || any_type_dependent_arguments_p (*init)) 2792 return build_raw_new_expr (*placement, type, nelts, *init, 2793 use_global_new); 2794 2795 orig_placement = make_tree_vector_copy (*placement); 2796 orig_nelts = nelts; 2797 orig_init = make_tree_vector_copy (*init); 2798 2799 make_args_non_dependent (*placement); 2800 if (nelts) 2801 nelts = build_non_dependent_expr (nelts); 2802 make_args_non_dependent (*init); 2803 } 2804 2805 if (nelts) 2806 { 2807 if (!build_expr_type_conversion (WANT_INT | WANT_ENUM, nelts, false)) 2808 { 2809 if (complain & tf_error) 2810 permerror (input_location, "size in array new must have integral type"); 2811 else 2812 return error_mark_node; 2813 } 2814 nelts = mark_rvalue_use (nelts); 2815 nelts = cp_save_expr (cp_convert (sizetype, nelts)); 2816 } 2817 2818 /* ``A reference cannot be created by the new operator. A reference 2819 is not an object (8.2.2, 8.4.3), so a pointer to it could not be 2820 returned by new.'' ARM 5.3.3 */ 2821 if (TREE_CODE (type) == REFERENCE_TYPE) 2822 { 2823 if (complain & tf_error) 2824 error ("new cannot be applied to a reference type"); 2825 else 2826 return error_mark_node; 2827 type = TREE_TYPE (type); 2828 } 2829 2830 if (TREE_CODE (type) == FUNCTION_TYPE) 2831 { 2832 if (complain & tf_error) 2833 error ("new cannot be applied to a function type"); 2834 return error_mark_node; 2835 } 2836 2837 /* The type allocated must be complete. If the new-type-id was 2838 "T[N]" then we are just checking that "T" is complete here, but 2839 that is equivalent, since the value of "N" doesn't matter. */ 2840 if (!complete_type_or_maybe_complain (type, NULL_TREE, complain)) 2841 return error_mark_node; 2842 2843 rval = build_new_1 (placement, type, nelts, init, use_global_new, complain); 2844 if (rval == error_mark_node) 2845 return error_mark_node; 2846 2847 if (processing_template_decl) 2848 { 2849 tree ret = build_raw_new_expr (orig_placement, type, orig_nelts, 2850 orig_init, use_global_new); 2851 release_tree_vector (orig_placement); 2852 release_tree_vector (orig_init); 2853 return ret; 2854 } 2855 2856 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */ 2857 rval = build1 (NOP_EXPR, TREE_TYPE (rval), rval); 2858 TREE_NO_WARNING (rval) = 1; 2859 2860 return rval; 2861 } 2862 2863 /* Given a Java class, return a decl for the corresponding java.lang.Class. */ 2864 2865 tree 2866 build_java_class_ref (tree type) 2867 { 2868 tree name = NULL_TREE, class_decl; 2869 static tree CL_suffix = NULL_TREE; 2870 if (CL_suffix == NULL_TREE) 2871 CL_suffix = get_identifier("class$"); 2872 if (jclass_node == NULL_TREE) 2873 { 2874 jclass_node = IDENTIFIER_GLOBAL_VALUE (get_identifier ("jclass")); 2875 if (jclass_node == NULL_TREE) 2876 { 2877 error ("call to Java constructor, while %<jclass%> undefined"); 2878 return error_mark_node; 2879 } 2880 jclass_node = TREE_TYPE (jclass_node); 2881 } 2882 2883 /* Mangle the class$ field. */ 2884 { 2885 tree field; 2886 for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field)) 2887 if (DECL_NAME (field) == CL_suffix) 2888 { 2889 mangle_decl (field); 2890 name = DECL_ASSEMBLER_NAME (field); 2891 break; 2892 } 2893 if (!field) 2894 { 2895 error ("can%'t find %<class$%> in %qT", type); 2896 return error_mark_node; 2897 } 2898 } 2899 2900 class_decl = IDENTIFIER_GLOBAL_VALUE (name); 2901 if (class_decl == NULL_TREE) 2902 { 2903 class_decl = build_decl (input_location, 2904 VAR_DECL, name, TREE_TYPE (jclass_node)); 2905 TREE_STATIC (class_decl) = 1; 2906 DECL_EXTERNAL (class_decl) = 1; 2907 TREE_PUBLIC (class_decl) = 1; 2908 DECL_ARTIFICIAL (class_decl) = 1; 2909 DECL_IGNORED_P (class_decl) = 1; 2910 pushdecl_top_level (class_decl); 2911 make_decl_rtl (class_decl); 2912 } 2913 return class_decl; 2914 } 2915 2916 static tree 2917 build_vec_delete_1 (tree base, tree maxindex, tree type, 2918 special_function_kind auto_delete_vec, 2919 int use_global_delete, tsubst_flags_t complain) 2920 { 2921 tree virtual_size; 2922 tree ptype = build_pointer_type (type = complete_type (type)); 2923 tree size_exp = size_in_bytes (type); 2924 2925 /* Temporary variables used by the loop. */ 2926 tree tbase, tbase_init; 2927 2928 /* This is the body of the loop that implements the deletion of a 2929 single element, and moves temp variables to next elements. */ 2930 tree body; 2931 2932 /* This is the LOOP_EXPR that governs the deletion of the elements. */ 2933 tree loop = 0; 2934 2935 /* This is the thing that governs what to do after the loop has run. */ 2936 tree deallocate_expr = 0; 2937 2938 /* This is the BIND_EXPR which holds the outermost iterator of the 2939 loop. It is convenient to set this variable up and test it before 2940 executing any other code in the loop. 2941 This is also the containing expression returned by this function. */ 2942 tree controller = NULL_TREE; 2943 tree tmp; 2944 2945 /* We should only have 1-D arrays here. */ 2946 gcc_assert (TREE_CODE (type) != ARRAY_TYPE); 2947 2948 if (base == error_mark_node || maxindex == error_mark_node) 2949 return error_mark_node; 2950 2951 if (! MAYBE_CLASS_TYPE_P (type) || TYPE_HAS_TRIVIAL_DESTRUCTOR (type)) 2952 goto no_destructor; 2953 2954 /* The below is short by the cookie size. */ 2955 virtual_size = size_binop (MULT_EXPR, size_exp, 2956 convert (sizetype, maxindex)); 2957 2958 tbase = create_temporary_var (ptype); 2959 tbase_init 2960 = cp_build_modify_expr (tbase, NOP_EXPR, 2961 fold_build_pointer_plus_loc (input_location, 2962 fold_convert (ptype, 2963 base), 2964 virtual_size), 2965 complain); 2966 if (tbase_init == error_mark_node) 2967 return error_mark_node; 2968 controller = build3 (BIND_EXPR, void_type_node, tbase, 2969 NULL_TREE, NULL_TREE); 2970 TREE_SIDE_EFFECTS (controller) = 1; 2971 2972 body = build1 (EXIT_EXPR, void_type_node, 2973 build2 (EQ_EXPR, boolean_type_node, tbase, 2974 fold_convert (ptype, base))); 2975 tmp = fold_build1_loc (input_location, NEGATE_EXPR, sizetype, size_exp); 2976 tmp = fold_build_pointer_plus (tbase, tmp); 2977 tmp = cp_build_modify_expr (tbase, NOP_EXPR, tmp, complain); 2978 if (tmp == error_mark_node) 2979 return error_mark_node; 2980 body = build_compound_expr (input_location, body, tmp); 2981 tmp = build_delete (ptype, tbase, sfk_complete_destructor, 2982 LOOKUP_NORMAL|LOOKUP_DESTRUCTOR, 1, 2983 complain); 2984 if (tmp == error_mark_node) 2985 return error_mark_node; 2986 body = build_compound_expr (input_location, body, tmp); 2987 2988 loop = build1 (LOOP_EXPR, void_type_node, body); 2989 loop = build_compound_expr (input_location, tbase_init, loop); 2990 2991 no_destructor: 2992 /* Delete the storage if appropriate. */ 2993 if (auto_delete_vec == sfk_deleting_destructor) 2994 { 2995 tree base_tbd; 2996 2997 /* The below is short by the cookie size. */ 2998 virtual_size = size_binop (MULT_EXPR, size_exp, 2999 convert (sizetype, maxindex)); 3000 3001 if (! TYPE_VEC_NEW_USES_COOKIE (type)) 3002 /* no header */ 3003 base_tbd = base; 3004 else 3005 { 3006 tree cookie_size; 3007 3008 cookie_size = targetm.cxx.get_cookie_size (type); 3009 base_tbd = cp_build_binary_op (input_location, 3010 MINUS_EXPR, 3011 cp_convert (string_type_node, 3012 base), 3013 cookie_size, 3014 complain); 3015 if (base_tbd == error_mark_node) 3016 return error_mark_node; 3017 base_tbd = cp_convert (ptype, base_tbd); 3018 /* True size with header. */ 3019 virtual_size = size_binop (PLUS_EXPR, virtual_size, cookie_size); 3020 } 3021 3022 deallocate_expr = build_op_delete_call (VEC_DELETE_EXPR, 3023 base_tbd, virtual_size, 3024 use_global_delete & 1, 3025 /*placement=*/NULL_TREE, 3026 /*alloc_fn=*/NULL_TREE); 3027 } 3028 3029 body = loop; 3030 if (!deallocate_expr) 3031 ; 3032 else if (!body) 3033 body = deallocate_expr; 3034 else 3035 body = build_compound_expr (input_location, body, deallocate_expr); 3036 3037 if (!body) 3038 body = integer_zero_node; 3039 3040 /* Outermost wrapper: If pointer is null, punt. */ 3041 body = fold_build3_loc (input_location, COND_EXPR, void_type_node, 3042 fold_build2_loc (input_location, 3043 NE_EXPR, boolean_type_node, base, 3044 convert (TREE_TYPE (base), 3045 nullptr_node)), 3046 body, integer_zero_node); 3047 body = build1 (NOP_EXPR, void_type_node, body); 3048 3049 if (controller) 3050 { 3051 TREE_OPERAND (controller, 1) = body; 3052 body = controller; 3053 } 3054 3055 if (TREE_CODE (base) == SAVE_EXPR) 3056 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */ 3057 body = build2 (COMPOUND_EXPR, void_type_node, base, body); 3058 3059 return convert_to_void (body, ICV_CAST, complain); 3060 } 3061 3062 /* Create an unnamed variable of the indicated TYPE. */ 3063 3064 tree 3065 create_temporary_var (tree type) 3066 { 3067 tree decl; 3068 3069 decl = build_decl (input_location, 3070 VAR_DECL, NULL_TREE, type); 3071 TREE_USED (decl) = 1; 3072 DECL_ARTIFICIAL (decl) = 1; 3073 DECL_IGNORED_P (decl) = 1; 3074 DECL_CONTEXT (decl) = current_function_decl; 3075 3076 return decl; 3077 } 3078 3079 /* Create a new temporary variable of the indicated TYPE, initialized 3080 to INIT. 3081 3082 It is not entered into current_binding_level, because that breaks 3083 things when it comes time to do final cleanups (which take place 3084 "outside" the binding contour of the function). */ 3085 3086 tree 3087 get_temp_regvar (tree type, tree init) 3088 { 3089 tree decl; 3090 3091 decl = create_temporary_var (type); 3092 add_decl_expr (decl); 3093 3094 finish_expr_stmt (cp_build_modify_expr (decl, INIT_EXPR, init, 3095 tf_warning_or_error)); 3096 3097 return decl; 3098 } 3099 3100 /* `build_vec_init' returns tree structure that performs 3101 initialization of a vector of aggregate types. 3102 3103 BASE is a reference to the vector, of ARRAY_TYPE, or a pointer 3104 to the first element, of POINTER_TYPE. 3105 MAXINDEX is the maximum index of the array (one less than the 3106 number of elements). It is only used if BASE is a pointer or 3107 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE. 3108 3109 INIT is the (possibly NULL) initializer. 3110 3111 If EXPLICIT_VALUE_INIT_P is true, then INIT must be NULL. All 3112 elements in the array are value-initialized. 3113 3114 FROM_ARRAY is 0 if we should init everything with INIT 3115 (i.e., every element initialized from INIT). 3116 FROM_ARRAY is 1 if we should index into INIT in parallel 3117 with initialization of DECL. 3118 FROM_ARRAY is 2 if we should index into INIT in parallel, 3119 but use assignment instead of initialization. */ 3120 3121 tree 3122 build_vec_init (tree base, tree maxindex, tree init, 3123 bool explicit_value_init_p, 3124 int from_array, tsubst_flags_t complain) 3125 { 3126 tree rval; 3127 tree base2 = NULL_TREE; 3128 tree itype = NULL_TREE; 3129 tree iterator; 3130 /* The type of BASE. */ 3131 tree atype = TREE_TYPE (base); 3132 /* The type of an element in the array. */ 3133 tree type = TREE_TYPE (atype); 3134 /* The element type reached after removing all outer array 3135 types. */ 3136 tree inner_elt_type; 3137 /* The type of a pointer to an element in the array. */ 3138 tree ptype; 3139 tree stmt_expr; 3140 tree compound_stmt; 3141 int destroy_temps; 3142 tree try_block = NULL_TREE; 3143 int num_initialized_elts = 0; 3144 bool is_global; 3145 tree const_init = NULL_TREE; 3146 tree obase = base; 3147 bool xvalue = false; 3148 bool errors = false; 3149 3150 if (TREE_CODE (atype) == ARRAY_TYPE && TYPE_DOMAIN (atype)) 3151 maxindex = array_type_nelts (atype); 3152 3153 if (maxindex == NULL_TREE || maxindex == error_mark_node 3154 || integer_all_onesp (maxindex)) 3155 return error_mark_node; 3156 3157 if (explicit_value_init_p) 3158 gcc_assert (!init); 3159 3160 inner_elt_type = strip_array_types (type); 3161 3162 /* Look through the TARGET_EXPR around a compound literal. */ 3163 if (init && TREE_CODE (init) == TARGET_EXPR 3164 && TREE_CODE (TARGET_EXPR_INITIAL (init)) == CONSTRUCTOR 3165 && from_array != 2) 3166 init = TARGET_EXPR_INITIAL (init); 3167 3168 if (init 3169 && TREE_CODE (atype) == ARRAY_TYPE 3170 && (from_array == 2 3171 ? (!CLASS_TYPE_P (inner_elt_type) 3172 || !TYPE_HAS_COMPLEX_COPY_ASSIGN (inner_elt_type)) 3173 : !TYPE_NEEDS_CONSTRUCTING (type)) 3174 && ((TREE_CODE (init) == CONSTRUCTOR 3175 /* Don't do this if the CONSTRUCTOR might contain something 3176 that might throw and require us to clean up. */ 3177 && (VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (init)) 3178 || ! TYPE_HAS_NONTRIVIAL_DESTRUCTOR (inner_elt_type))) 3179 || from_array)) 3180 { 3181 /* Do non-default initialization of trivial arrays resulting from 3182 brace-enclosed initializers. In this case, digest_init and 3183 store_constructor will handle the semantics for us. */ 3184 3185 stmt_expr = build2 (INIT_EXPR, atype, base, init); 3186 return stmt_expr; 3187 } 3188 3189 maxindex = cp_convert (ptrdiff_type_node, maxindex); 3190 if (TREE_CODE (atype) == ARRAY_TYPE) 3191 { 3192 ptype = build_pointer_type (type); 3193 base = cp_convert (ptype, decay_conversion (base)); 3194 } 3195 else 3196 ptype = atype; 3197 3198 /* The code we are generating looks like: 3199 ({ 3200 T* t1 = (T*) base; 3201 T* rval = t1; 3202 ptrdiff_t iterator = maxindex; 3203 try { 3204 for (; iterator != -1; --iterator) { 3205 ... initialize *t1 ... 3206 ++t1; 3207 } 3208 } catch (...) { 3209 ... destroy elements that were constructed ... 3210 } 3211 rval; 3212 }) 3213 3214 We can omit the try and catch blocks if we know that the 3215 initialization will never throw an exception, or if the array 3216 elements do not have destructors. We can omit the loop completely if 3217 the elements of the array do not have constructors. 3218 3219 We actually wrap the entire body of the above in a STMT_EXPR, for 3220 tidiness. 3221 3222 When copying from array to another, when the array elements have 3223 only trivial copy constructors, we should use __builtin_memcpy 3224 rather than generating a loop. That way, we could take advantage 3225 of whatever cleverness the back end has for dealing with copies 3226 of blocks of memory. */ 3227 3228 is_global = begin_init_stmts (&stmt_expr, &compound_stmt); 3229 destroy_temps = stmts_are_full_exprs_p (); 3230 current_stmt_tree ()->stmts_are_full_exprs_p = 0; 3231 rval = get_temp_regvar (ptype, base); 3232 base = get_temp_regvar (ptype, rval); 3233 iterator = get_temp_regvar (ptrdiff_type_node, maxindex); 3234 3235 /* If initializing one array from another, initialize element by 3236 element. We rely upon the below calls to do the argument 3237 checking. Evaluate the initializer before entering the try block. */ 3238 if (from_array && init && TREE_CODE (init) != CONSTRUCTOR) 3239 { 3240 if (lvalue_kind (init) & clk_rvalueref) 3241 xvalue = true; 3242 base2 = decay_conversion (init); 3243 itype = TREE_TYPE (base2); 3244 base2 = get_temp_regvar (itype, base2); 3245 itype = TREE_TYPE (itype); 3246 } 3247 3248 /* Protect the entire array initialization so that we can destroy 3249 the partially constructed array if an exception is thrown. 3250 But don't do this if we're assigning. */ 3251 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type) 3252 && from_array != 2) 3253 { 3254 try_block = begin_try_block (); 3255 } 3256 3257 /* If the initializer is {}, then all elements are initialized from {}. 3258 But for non-classes, that's the same as value-initialization. */ 3259 if (init && BRACE_ENCLOSED_INITIALIZER_P (init) 3260 && CONSTRUCTOR_NELTS (init) == 0) 3261 { 3262 if (CLASS_TYPE_P (type)) 3263 /* Leave init alone. */; 3264 else 3265 { 3266 init = NULL_TREE; 3267 explicit_value_init_p = true; 3268 } 3269 } 3270 3271 /* Maybe pull out constant value when from_array? */ 3272 3273 else if (init != NULL_TREE && TREE_CODE (init) == CONSTRUCTOR) 3274 { 3275 /* Do non-default initialization of non-trivial arrays resulting from 3276 brace-enclosed initializers. */ 3277 unsigned HOST_WIDE_INT idx; 3278 tree field, elt; 3279 /* Should we try to create a constant initializer? */ 3280 bool try_const = (TREE_CODE (atype) == ARRAY_TYPE 3281 && (literal_type_p (inner_elt_type) 3282 || TYPE_HAS_CONSTEXPR_CTOR (inner_elt_type))); 3283 /* If the constructor already has the array type, it's been through 3284 digest_init, so we shouldn't try to do anything more. */ 3285 bool digested = same_type_p (atype, TREE_TYPE (init)); 3286 bool saw_non_const = false; 3287 bool saw_const = false; 3288 /* If we're initializing a static array, we want to do static 3289 initialization of any elements with constant initializers even if 3290 some are non-constant. */ 3291 bool do_static_init = (DECL_P (obase) && TREE_STATIC (obase)); 3292 VEC(constructor_elt,gc) *new_vec; 3293 from_array = 0; 3294 3295 if (try_const) 3296 new_vec = VEC_alloc (constructor_elt, gc, CONSTRUCTOR_NELTS (init)); 3297 else 3298 new_vec = NULL; 3299 3300 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (init), idx, field, elt) 3301 { 3302 tree baseref = build1 (INDIRECT_REF, type, base); 3303 tree one_init; 3304 3305 num_initialized_elts++; 3306 3307 current_stmt_tree ()->stmts_are_full_exprs_p = 1; 3308 if (digested) 3309 one_init = build2 (INIT_EXPR, type, baseref, elt); 3310 else if (MAYBE_CLASS_TYPE_P (type) || TREE_CODE (type) == ARRAY_TYPE) 3311 one_init = build_aggr_init (baseref, elt, 0, complain); 3312 else 3313 one_init = cp_build_modify_expr (baseref, NOP_EXPR, 3314 elt, complain); 3315 if (one_init == error_mark_node) 3316 errors = true; 3317 if (try_const) 3318 { 3319 tree e = one_init; 3320 if (TREE_CODE (e) == EXPR_STMT) 3321 e = TREE_OPERAND (e, 0); 3322 if (TREE_CODE (e) == CONVERT_EXPR 3323 && VOID_TYPE_P (TREE_TYPE (e))) 3324 e = TREE_OPERAND (e, 0); 3325 e = maybe_constant_init (e); 3326 if (reduced_constant_expression_p (e)) 3327 { 3328 CONSTRUCTOR_APPEND_ELT (new_vec, field, e); 3329 if (do_static_init) 3330 one_init = NULL_TREE; 3331 else 3332 one_init = build2 (INIT_EXPR, type, baseref, e); 3333 saw_const = true; 3334 } 3335 else 3336 { 3337 if (do_static_init) 3338 CONSTRUCTOR_APPEND_ELT (new_vec, field, 3339 build_zero_init (TREE_TYPE (e), 3340 NULL_TREE, true)); 3341 saw_non_const = true; 3342 } 3343 } 3344 3345 if (one_init) 3346 finish_expr_stmt (one_init); 3347 current_stmt_tree ()->stmts_are_full_exprs_p = 0; 3348 3349 one_init = cp_build_unary_op (PREINCREMENT_EXPR, base, 0, complain); 3350 if (one_init == error_mark_node) 3351 errors = true; 3352 else 3353 finish_expr_stmt (one_init); 3354 3355 one_init = cp_build_unary_op (PREDECREMENT_EXPR, iterator, 0, 3356 complain); 3357 if (one_init == error_mark_node) 3358 errors = true; 3359 else 3360 finish_expr_stmt (one_init); 3361 } 3362 3363 if (try_const) 3364 { 3365 if (!saw_non_const) 3366 const_init = build_constructor (atype, new_vec); 3367 else if (do_static_init && saw_const) 3368 DECL_INITIAL (obase) = build_constructor (atype, new_vec); 3369 else 3370 VEC_free (constructor_elt, gc, new_vec); 3371 } 3372 3373 /* Clear out INIT so that we don't get confused below. */ 3374 init = NULL_TREE; 3375 } 3376 else if (from_array) 3377 { 3378 if (init) 3379 /* OK, we set base2 above. */; 3380 else if (CLASS_TYPE_P (type) 3381 && ! TYPE_HAS_DEFAULT_CONSTRUCTOR (type)) 3382 { 3383 if (complain & tf_error) 3384 error ("initializer ends prematurely"); 3385 errors = true; 3386 } 3387 } 3388 3389 /* Now, default-initialize any remaining elements. We don't need to 3390 do that if a) the type does not need constructing, or b) we've 3391 already initialized all the elements. 3392 3393 We do need to keep going if we're copying an array. */ 3394 3395 if (from_array 3396 || ((type_build_ctor_call (type) || init || explicit_value_init_p) 3397 && ! (host_integerp (maxindex, 0) 3398 && (num_initialized_elts 3399 == tree_low_cst (maxindex, 0) + 1)))) 3400 { 3401 /* If the ITERATOR is equal to -1, then we don't have to loop; 3402 we've already initialized all the elements. */ 3403 tree for_stmt; 3404 tree elt_init; 3405 tree to; 3406 3407 for_stmt = begin_for_stmt (NULL_TREE, NULL_TREE); 3408 finish_for_init_stmt (for_stmt); 3409 finish_for_cond (build2 (NE_EXPR, boolean_type_node, iterator, 3410 build_int_cst (TREE_TYPE (iterator), -1)), 3411 for_stmt); 3412 elt_init = cp_build_unary_op (PREDECREMENT_EXPR, iterator, 0, 3413 complain); 3414 if (elt_init == error_mark_node) 3415 errors = true; 3416 finish_for_expr (elt_init, for_stmt); 3417 3418 to = build1 (INDIRECT_REF, type, base); 3419 3420 if (from_array) 3421 { 3422 tree from; 3423 3424 if (base2) 3425 { 3426 from = build1 (INDIRECT_REF, itype, base2); 3427 if (xvalue) 3428 from = move (from); 3429 } 3430 else 3431 from = NULL_TREE; 3432 3433 if (from_array == 2) 3434 elt_init = cp_build_modify_expr (to, NOP_EXPR, from, 3435 complain); 3436 else if (type_build_ctor_call (type)) 3437 elt_init = build_aggr_init (to, from, 0, complain); 3438 else if (from) 3439 elt_init = cp_build_modify_expr (to, NOP_EXPR, from, 3440 complain); 3441 else 3442 gcc_unreachable (); 3443 } 3444 else if (TREE_CODE (type) == ARRAY_TYPE) 3445 { 3446 if (init != 0) 3447 sorry 3448 ("cannot initialize multi-dimensional array with initializer"); 3449 elt_init = build_vec_init (build1 (INDIRECT_REF, type, base), 3450 0, 0, 3451 explicit_value_init_p, 3452 0, complain); 3453 } 3454 else if (explicit_value_init_p) 3455 { 3456 elt_init = build_value_init (type, complain); 3457 if (elt_init != error_mark_node) 3458 elt_init = build2 (INIT_EXPR, type, to, elt_init); 3459 } 3460 else 3461 { 3462 gcc_assert (type_build_ctor_call (type) || init); 3463 if (CLASS_TYPE_P (type)) 3464 elt_init = build_aggr_init (to, init, 0, complain); 3465 else 3466 { 3467 if (TREE_CODE (init) == TREE_LIST) 3468 init = build_x_compound_expr_from_list (init, ELK_INIT, 3469 complain); 3470 elt_init = build2 (INIT_EXPR, type, to, init); 3471 } 3472 } 3473 3474 if (elt_init == error_mark_node) 3475 errors = true; 3476 3477 current_stmt_tree ()->stmts_are_full_exprs_p = 1; 3478 finish_expr_stmt (elt_init); 3479 current_stmt_tree ()->stmts_are_full_exprs_p = 0; 3480 3481 finish_expr_stmt (cp_build_unary_op (PREINCREMENT_EXPR, base, 0, 3482 complain)); 3483 if (base2) 3484 finish_expr_stmt (cp_build_unary_op (PREINCREMENT_EXPR, base2, 0, 3485 complain)); 3486 3487 finish_for_stmt (for_stmt); 3488 } 3489 3490 /* Make sure to cleanup any partially constructed elements. */ 3491 if (flag_exceptions && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type) 3492 && from_array != 2) 3493 { 3494 tree e; 3495 tree m = cp_build_binary_op (input_location, 3496 MINUS_EXPR, maxindex, iterator, 3497 complain); 3498 3499 /* Flatten multi-dimensional array since build_vec_delete only 3500 expects one-dimensional array. */ 3501 if (TREE_CODE (type) == ARRAY_TYPE) 3502 m = cp_build_binary_op (input_location, 3503 MULT_EXPR, m, 3504 array_type_nelts_total (type), 3505 complain); 3506 3507 finish_cleanup_try_block (try_block); 3508 e = build_vec_delete_1 (rval, m, 3509 inner_elt_type, sfk_complete_destructor, 3510 /*use_global_delete=*/0, complain); 3511 if (e == error_mark_node) 3512 errors = true; 3513 finish_cleanup (e, try_block); 3514 } 3515 3516 /* The value of the array initialization is the array itself, RVAL 3517 is a pointer to the first element. */ 3518 finish_stmt_expr_expr (rval, stmt_expr); 3519 3520 stmt_expr = finish_init_stmts (is_global, stmt_expr, compound_stmt); 3521 3522 /* Now make the result have the correct type. */ 3523 if (TREE_CODE (atype) == ARRAY_TYPE) 3524 { 3525 atype = build_pointer_type (atype); 3526 stmt_expr = build1 (NOP_EXPR, atype, stmt_expr); 3527 stmt_expr = cp_build_indirect_ref (stmt_expr, RO_NULL, complain); 3528 TREE_NO_WARNING (stmt_expr) = 1; 3529 } 3530 3531 current_stmt_tree ()->stmts_are_full_exprs_p = destroy_temps; 3532 3533 if (const_init) 3534 return build2 (INIT_EXPR, atype, obase, const_init); 3535 if (errors) 3536 return error_mark_node; 3537 return stmt_expr; 3538 } 3539 3540 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for 3541 build_delete. */ 3542 3543 static tree 3544 build_dtor_call (tree exp, special_function_kind dtor_kind, int flags, 3545 tsubst_flags_t complain) 3546 { 3547 tree name; 3548 tree fn; 3549 switch (dtor_kind) 3550 { 3551 case sfk_complete_destructor: 3552 name = complete_dtor_identifier; 3553 break; 3554 3555 case sfk_base_destructor: 3556 name = base_dtor_identifier; 3557 break; 3558 3559 case sfk_deleting_destructor: 3560 name = deleting_dtor_identifier; 3561 break; 3562 3563 default: 3564 gcc_unreachable (); 3565 } 3566 fn = lookup_fnfields (TREE_TYPE (exp), name, /*protect=*/2); 3567 return build_new_method_call (exp, fn, 3568 /*args=*/NULL, 3569 /*conversion_path=*/NULL_TREE, 3570 flags, 3571 /*fn_p=*/NULL, 3572 complain); 3573 } 3574 3575 /* Generate a call to a destructor. TYPE is the type to cast ADDR to. 3576 ADDR is an expression which yields the store to be destroyed. 3577 AUTO_DELETE is the name of the destructor to call, i.e., either 3578 sfk_complete_destructor, sfk_base_destructor, or 3579 sfk_deleting_destructor. 3580 3581 FLAGS is the logical disjunction of zero or more LOOKUP_ 3582 flags. See cp-tree.h for more info. */ 3583 3584 tree 3585 build_delete (tree type, tree addr, special_function_kind auto_delete, 3586 int flags, int use_global_delete, tsubst_flags_t complain) 3587 { 3588 tree expr; 3589 3590 if (addr == error_mark_node) 3591 return error_mark_node; 3592 3593 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type 3594 set to `error_mark_node' before it gets properly cleaned up. */ 3595 if (type == error_mark_node) 3596 return error_mark_node; 3597 3598 type = TYPE_MAIN_VARIANT (type); 3599 3600 addr = mark_rvalue_use (addr); 3601 3602 if (TREE_CODE (type) == POINTER_TYPE) 3603 { 3604 bool complete_p = true; 3605 3606 type = TYPE_MAIN_VARIANT (TREE_TYPE (type)); 3607 if (TREE_CODE (type) == ARRAY_TYPE) 3608 goto handle_array; 3609 3610 /* We don't want to warn about delete of void*, only other 3611 incomplete types. Deleting other incomplete types 3612 invokes undefined behavior, but it is not ill-formed, so 3613 compile to something that would even do The Right Thing 3614 (TM) should the type have a trivial dtor and no delete 3615 operator. */ 3616 if (!VOID_TYPE_P (type)) 3617 { 3618 complete_type (type); 3619 if (!COMPLETE_TYPE_P (type)) 3620 { 3621 if ((complain & tf_warning) 3622 && warning (0, "possible problem detected in invocation of " 3623 "delete operator:")) 3624 { 3625 cxx_incomplete_type_diagnostic (addr, type, DK_WARNING); 3626 inform (input_location, "neither the destructor nor the class-specific " 3627 "operator delete will be called, even if they are " 3628 "declared when the class is defined"); 3629 } 3630 complete_p = false; 3631 } 3632 else if (auto_delete == sfk_deleting_destructor && warn_delnonvdtor 3633 && MAYBE_CLASS_TYPE_P (type) && !CLASSTYPE_FINAL (type) 3634 && TYPE_POLYMORPHIC_P (type)) 3635 { 3636 tree dtor; 3637 dtor = CLASSTYPE_DESTRUCTORS (type); 3638 if (!dtor || !DECL_VINDEX (dtor)) 3639 { 3640 if (CLASSTYPE_PURE_VIRTUALS (type)) 3641 warning (OPT_Wdelete_non_virtual_dtor, 3642 "deleting object of abstract class type %qT" 3643 " which has non-virtual destructor" 3644 " will cause undefined behaviour", type); 3645 else 3646 warning (OPT_Wdelete_non_virtual_dtor, 3647 "deleting object of polymorphic class type %qT" 3648 " which has non-virtual destructor" 3649 " might cause undefined behaviour", type); 3650 } 3651 } 3652 } 3653 if (VOID_TYPE_P (type) || !complete_p || !MAYBE_CLASS_TYPE_P (type)) 3654 /* Call the builtin operator delete. */ 3655 return build_builtin_delete_call (addr); 3656 if (TREE_SIDE_EFFECTS (addr)) 3657 addr = save_expr (addr); 3658 3659 /* Throw away const and volatile on target type of addr. */ 3660 addr = convert_force (build_pointer_type (type), addr, 0); 3661 } 3662 else if (TREE_CODE (type) == ARRAY_TYPE) 3663 { 3664 handle_array: 3665 3666 if (TYPE_DOMAIN (type) == NULL_TREE) 3667 { 3668 if (complain & tf_error) 3669 error ("unknown array size in delete"); 3670 return error_mark_node; 3671 } 3672 return build_vec_delete (addr, array_type_nelts (type), 3673 auto_delete, use_global_delete, complain); 3674 } 3675 else 3676 { 3677 /* Don't check PROTECT here; leave that decision to the 3678 destructor. If the destructor is accessible, call it, 3679 else report error. */ 3680 addr = cp_build_addr_expr (addr, complain); 3681 if (addr == error_mark_node) 3682 return error_mark_node; 3683 if (TREE_SIDE_EFFECTS (addr)) 3684 addr = save_expr (addr); 3685 3686 addr = convert_force (build_pointer_type (type), addr, 0); 3687 } 3688 3689 gcc_assert (MAYBE_CLASS_TYPE_P (type)); 3690 3691 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (type)) 3692 { 3693 if (auto_delete != sfk_deleting_destructor) 3694 return void_zero_node; 3695 3696 return build_op_delete_call (DELETE_EXPR, addr, 3697 cxx_sizeof_nowarn (type), 3698 use_global_delete, 3699 /*placement=*/NULL_TREE, 3700 /*alloc_fn=*/NULL_TREE); 3701 } 3702 else 3703 { 3704 tree head = NULL_TREE; 3705 tree do_delete = NULL_TREE; 3706 tree ifexp; 3707 3708 if (CLASSTYPE_LAZY_DESTRUCTOR (type)) 3709 lazily_declare_fn (sfk_destructor, type); 3710 3711 /* For `::delete x', we must not use the deleting destructor 3712 since then we would not be sure to get the global `operator 3713 delete'. */ 3714 if (use_global_delete && auto_delete == sfk_deleting_destructor) 3715 { 3716 /* We will use ADDR multiple times so we must save it. */ 3717 addr = save_expr (addr); 3718 head = get_target_expr (build_headof (addr)); 3719 /* Delete the object. */ 3720 do_delete = build_builtin_delete_call (head); 3721 /* Otherwise, treat this like a complete object destructor 3722 call. */ 3723 auto_delete = sfk_complete_destructor; 3724 } 3725 /* If the destructor is non-virtual, there is no deleting 3726 variant. Instead, we must explicitly call the appropriate 3727 `operator delete' here. */ 3728 else if (!DECL_VIRTUAL_P (CLASSTYPE_DESTRUCTORS (type)) 3729 && auto_delete == sfk_deleting_destructor) 3730 { 3731 /* We will use ADDR multiple times so we must save it. */ 3732 addr = save_expr (addr); 3733 /* Build the call. */ 3734 do_delete = build_op_delete_call (DELETE_EXPR, 3735 addr, 3736 cxx_sizeof_nowarn (type), 3737 /*global_p=*/false, 3738 /*placement=*/NULL_TREE, 3739 /*alloc_fn=*/NULL_TREE); 3740 /* Call the complete object destructor. */ 3741 auto_delete = sfk_complete_destructor; 3742 } 3743 else if (auto_delete == sfk_deleting_destructor 3744 && TYPE_GETS_REG_DELETE (type)) 3745 { 3746 /* Make sure we have access to the member op delete, even though 3747 we'll actually be calling it from the destructor. */ 3748 build_op_delete_call (DELETE_EXPR, addr, cxx_sizeof_nowarn (type), 3749 /*global_p=*/false, 3750 /*placement=*/NULL_TREE, 3751 /*alloc_fn=*/NULL_TREE); 3752 } 3753 3754 expr = build_dtor_call (cp_build_indirect_ref (addr, RO_NULL, complain), 3755 auto_delete, flags, complain); 3756 if (expr == error_mark_node) 3757 return error_mark_node; 3758 if (do_delete) 3759 expr = build2 (COMPOUND_EXPR, void_type_node, expr, do_delete); 3760 3761 /* We need to calculate this before the dtor changes the vptr. */ 3762 if (head) 3763 expr = build2 (COMPOUND_EXPR, void_type_node, head, expr); 3764 3765 if (flags & LOOKUP_DESTRUCTOR) 3766 /* Explicit destructor call; don't check for null pointer. */ 3767 ifexp = integer_one_node; 3768 else 3769 { 3770 /* Handle deleting a null pointer. */ 3771 ifexp = fold (cp_build_binary_op (input_location, 3772 NE_EXPR, addr, nullptr_node, 3773 complain)); 3774 if (ifexp == error_mark_node) 3775 return error_mark_node; 3776 } 3777 3778 if (ifexp != integer_one_node) 3779 expr = build3 (COND_EXPR, void_type_node, 3780 ifexp, expr, void_zero_node); 3781 3782 return expr; 3783 } 3784 } 3785 3786 /* At the beginning of a destructor, push cleanups that will call the 3787 destructors for our base classes and members. 3788 3789 Called from begin_destructor_body. */ 3790 3791 void 3792 push_base_cleanups (void) 3793 { 3794 tree binfo, base_binfo; 3795 int i; 3796 tree member; 3797 tree expr; 3798 VEC(tree,gc) *vbases; 3799 3800 /* Run destructors for all virtual baseclasses. */ 3801 if (CLASSTYPE_VBASECLASSES (current_class_type)) 3802 { 3803 tree cond = (condition_conversion 3804 (build2 (BIT_AND_EXPR, integer_type_node, 3805 current_in_charge_parm, 3806 integer_two_node))); 3807 3808 /* The CLASSTYPE_VBASECLASSES vector is in initialization 3809 order, which is also the right order for pushing cleanups. */ 3810 for (vbases = CLASSTYPE_VBASECLASSES (current_class_type), i = 0; 3811 VEC_iterate (tree, vbases, i, base_binfo); i++) 3812 { 3813 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo))) 3814 { 3815 expr = build_special_member_call (current_class_ref, 3816 base_dtor_identifier, 3817 NULL, 3818 base_binfo, 3819 (LOOKUP_NORMAL 3820 | LOOKUP_NONVIRTUAL), 3821 tf_warning_or_error); 3822 expr = build3 (COND_EXPR, void_type_node, cond, 3823 expr, void_zero_node); 3824 finish_decl_cleanup (NULL_TREE, expr); 3825 } 3826 } 3827 } 3828 3829 /* Take care of the remaining baseclasses. */ 3830 for (binfo = TYPE_BINFO (current_class_type), i = 0; 3831 BINFO_BASE_ITERATE (binfo, i, base_binfo); i++) 3832 { 3833 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (BINFO_TYPE (base_binfo)) 3834 || BINFO_VIRTUAL_P (base_binfo)) 3835 continue; 3836 3837 expr = build_special_member_call (current_class_ref, 3838 base_dtor_identifier, 3839 NULL, base_binfo, 3840 LOOKUP_NORMAL | LOOKUP_NONVIRTUAL, 3841 tf_warning_or_error); 3842 finish_decl_cleanup (NULL_TREE, expr); 3843 } 3844 3845 /* Don't automatically destroy union members. */ 3846 if (TREE_CODE (current_class_type) == UNION_TYPE) 3847 return; 3848 3849 for (member = TYPE_FIELDS (current_class_type); member; 3850 member = DECL_CHAIN (member)) 3851 { 3852 tree this_type = TREE_TYPE (member); 3853 if (this_type == error_mark_node 3854 || TREE_CODE (member) != FIELD_DECL 3855 || DECL_ARTIFICIAL (member)) 3856 continue; 3857 if (ANON_UNION_TYPE_P (this_type)) 3858 continue; 3859 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (this_type)) 3860 { 3861 tree this_member = (build_class_member_access_expr 3862 (current_class_ref, member, 3863 /*access_path=*/NULL_TREE, 3864 /*preserve_reference=*/false, 3865 tf_warning_or_error)); 3866 expr = build_delete (this_type, this_member, 3867 sfk_complete_destructor, 3868 LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR|LOOKUP_NORMAL, 3869 0, tf_warning_or_error); 3870 finish_decl_cleanup (NULL_TREE, expr); 3871 } 3872 } 3873 } 3874 3875 /* Build a C++ vector delete expression. 3876 MAXINDEX is the number of elements to be deleted. 3877 ELT_SIZE is the nominal size of each element in the vector. 3878 BASE is the expression that should yield the store to be deleted. 3879 This function expands (or synthesizes) these calls itself. 3880 AUTO_DELETE_VEC says whether the container (vector) should be deallocated. 3881 3882 This also calls delete for virtual baseclasses of elements of the vector. 3883 3884 Update: MAXINDEX is no longer needed. The size can be extracted from the 3885 start of the vector for pointers, and from the type for arrays. We still 3886 use MAXINDEX for arrays because it happens to already have one of the 3887 values we'd have to extract. (We could use MAXINDEX with pointers to 3888 confirm the size, and trap if the numbers differ; not clear that it'd 3889 be worth bothering.) */ 3890 3891 tree 3892 build_vec_delete (tree base, tree maxindex, 3893 special_function_kind auto_delete_vec, 3894 int use_global_delete, tsubst_flags_t complain) 3895 { 3896 tree type; 3897 tree rval; 3898 tree base_init = NULL_TREE; 3899 3900 type = TREE_TYPE (base); 3901 3902 if (TREE_CODE (type) == POINTER_TYPE) 3903 { 3904 /* Step back one from start of vector, and read dimension. */ 3905 tree cookie_addr; 3906 tree size_ptr_type = build_pointer_type (sizetype); 3907 3908 if (TREE_SIDE_EFFECTS (base)) 3909 { 3910 base_init = get_target_expr (base); 3911 base = TARGET_EXPR_SLOT (base_init); 3912 } 3913 type = strip_array_types (TREE_TYPE (type)); 3914 cookie_addr = fold_build1_loc (input_location, NEGATE_EXPR, 3915 sizetype, TYPE_SIZE_UNIT (sizetype)); 3916 cookie_addr = fold_build_pointer_plus (fold_convert (size_ptr_type, base), 3917 cookie_addr); 3918 maxindex = cp_build_indirect_ref (cookie_addr, RO_NULL, complain); 3919 } 3920 else if (TREE_CODE (type) == ARRAY_TYPE) 3921 { 3922 /* Get the total number of things in the array, maxindex is a 3923 bad name. */ 3924 maxindex = array_type_nelts_total (type); 3925 type = strip_array_types (type); 3926 base = cp_build_addr_expr (base, complain); 3927 if (base == error_mark_node) 3928 return error_mark_node; 3929 if (TREE_SIDE_EFFECTS (base)) 3930 { 3931 base_init = get_target_expr (base); 3932 base = TARGET_EXPR_SLOT (base_init); 3933 } 3934 } 3935 else 3936 { 3937 if (base != error_mark_node && !(complain & tf_error)) 3938 error ("type to vector delete is neither pointer or array type"); 3939 return error_mark_node; 3940 } 3941 3942 rval = build_vec_delete_1 (base, maxindex, type, auto_delete_vec, 3943 use_global_delete, complain); 3944 if (base_init && rval != error_mark_node) 3945 rval = build2 (COMPOUND_EXPR, TREE_TYPE (rval), base_init, rval); 3946 3947 return rval; 3948 } 3949