| blob | 6ccda365b048f7f4594b6c2ec7a0433b1ca4494e |
1 /* Handle initialization things in -*- C++ -*-
2 Copyright (C) 1987-2023 Free Software Foundation, Inc.
3 Contributed by Michael Tiemann (tiemann@cygnus.com)
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
10 any later version.
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
21 /* High-level class interface. */
55 /* We are about to generate some complex initialization code.
56 Conceptually, it is all a single expression. However, we may want
57 to include conditionals, loops, and other such statement-level
58 constructs. Therefore, we build the initialization code inside a
59 statement-expression. This function starts such an expression.
60 STMT_EXPR_P and COMPOUND_STMT_P are filled in by this function;
61 pass them back to finish_init_stmts when the expression is
62 complete. */
64 static bool
66 {
73 }
75 /* Finish out the statement-expression begun by the previous call to
76 begin_init_stmts. Returns the statement-expression itself. */
78 static tree
80 {
88 }
90 /* Constructors */
92 /* Called from initialize_vtbl_ptrs via dfs_walk. BINFO is the base
93 which we want to initialize the vtable pointer for, DATA is
94 TREE_LIST whose TREE_VALUE is the this ptr expression. */
96 static tree
98 {
103 {
107 tf_warning_or_error);
110 }
113 }
115 /* Initialize all the vtable pointers in the object pointed to by
116 ADDR. */
118 void
120 {
121 tree list;
122 tree type;
127 /* Walk through the hierarchy, initializing the vptr in each base
128 class. We do these in pre-order because we can't find the virtual
129 bases for a class until we've initialized the vtbl for that
130 class. */
132 }
134 /* Return an expression for the zero-initialization of an object with
135 type T. This expression will either be a constant (in the case
136 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
137 aggregate), or NULL (in the case that T does not require
138 initialization). In either case, the value can be used as
139 DECL_INITIAL for a decl of the indicated TYPE; it is a valid static
140 initializer. If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS
141 is the number of elements in the array. If STATIC_STORAGE_P is
142 TRUE, initializers are only generated for entities for which
143 zero-initialization does not simply mean filling the storage with
144 zero bytes. FIELD_SIZE, if non-NULL, is the bit size of the field,
145 subfields with bit positions at or above that bit size shouldn't
146 be added. Note that this only works when the result is assigned
147 to a base COMPONENT_REF; if we only have a pointer to the base subobject,
148 expand_assignment will end up clearing the full size of TYPE. */
150 static tree
152 tree field_size)
153 {
156 /* [dcl.init]
158 To zero-initialize an object of type T means:
160 -- if T is a scalar type, the storage is set to the value of zero
161 converted to T.
163 -- if T is a non-union class type, the storage for each non-static
164 data member and each base-class subobject is zero-initialized.
166 -- if T is a union type, the storage for its first data member is
167 zero-initialized.
169 -- if T is an array type, the storage for each element is
170 zero-initialized.
172 -- if T is a reference type, no initialization is performed. */
177 ;
179 /* In order to save space, we do not explicitly build initializers
180 for items that do not need them. GCC's semantics are that
181 items with static storage duration that are not otherwise
182 initialized are initialized to zero. */
183 ;
191 {
195 /* Iterate over the fields, building initializations. */
197 {
203 /* For unions, only the first field is initialized. */
210 /* Don't add virtual bases for base classes if they are beyond
211 the size of the current field, that means it is present
212 somewhere else in the object. */
214 {
219 }
221 /* Don't add zero width bitfields. */
226 /* Note that for class types there will be FIELD_DECLs
227 corresponding to base classes as well. Thus, iterating
228 over TYPE_FIELDs will result in correct initialization of
229 all of the subobjects. */
231 {
232 tree new_field_size
239 static_storage_p,
240 new_field_size);
243 }
244 }
246 /* Build a constructor to contain the initializations. */
248 }
250 {
251 tree max_index;
254 /* Iterate over the array elements, building initializations. */
259 /* Treat flexible array members like [0] arrays. */
262 else
265 /* If we have an error_mark here, we should just return error mark
266 as we don't know the size of the array yet. */
271 /* A zero-sized array, which is accepted as an extension, will
272 have an upper bound of -1. */
274 {
275 constructor_elt ce;
277 /* If this is a one element array, we just use a regular init. */
280 else
282 max_index);
287 {
290 }
291 }
293 /* Build a constructor to contain the initializations. */
295 }
298 else
301 /* In all cases, the initializer is a constant. */
306 }
308 /* Return an expression for the zero-initialization of an object with
309 type T. This expression will either be a constant (in the case
310 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
311 aggregate), or NULL (in the case that T does not require
312 initialization). In either case, the value can be used as
313 DECL_INITIAL for a decl of the indicated TYPE; it is a valid static
314 initializer. If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS
315 is the number of elements in the array. If STATIC_STORAGE_P is
316 TRUE, initializers are only generated for entities for which
317 zero-initialization does not simply mean filling the storage with
318 zero bytes. */
320 tree
322 {
324 }
326 /* Return a suitable initializer for value-initializing an object of type
327 TYPE, as described in [dcl.init]. */
329 tree
331 {
332 /* [dcl.init]
334 To value-initialize an object of type T means:
336 - if T is a class type (clause 9) with either no default constructor
337 (12.1) or a default constructor that is user-provided or deleted,
338 then the object is default-initialized;
340 - if T is a (possibly cv-qualified) class type without a user-provided
341 or deleted default constructor, then the object is zero-initialized
342 and the semantic constraints for default-initialization are checked,
343 and if T has a non-trivial default constructor, the object is
344 default-initialized;
346 - if T is an array type, then each element is value-initialized;
348 - otherwise, the object is zero-initialized.
350 A program that calls for default-initialization or
351 value-initialization of an entity of reference type is ill-formed. */
354 {
355 tree ctor
361 /* The AGGR_INIT_EXPR tweaking below breaks in templates. */
370 {
371 /* This is a class that needs constructing, but doesn't have
372 a user-provided constructor. So we need to zero-initialize
373 the object and then call the implicitly defined ctor.
374 This will be handled in simplify_aggr_init_expr. */
377 }
378 }
380 /* Discard any access checking during subobject initialization;
381 the checks are implied by the call to the ctor which we have
382 verified is OK (cpp0x/defaulted46.C). */
387 }
389 /* Like build_value_init, but don't call the constructor for TYPE. Used
390 for base initializers. */
392 tree
394 {
396 {
400 }
401 /* FIXME the class and array cases should just use digest_init once it is
402 SFINAE-enabled. */
404 {
409 {
410 tree field;
413 /* Iterate over the fields, building initializations. */
415 {
426 /* Ignore flexible array members for value initialization. */
435 /* Ignore unnamed zero-width bitfields. */
440 /* We could skip vfields and fields of types with
441 user-defined constructors, but I think that won't improve
442 performance at all; it should be simpler in general just
443 to zero out the entire object than try to only zero the
444 bits that actually need it. */
446 /* Note that for class types there will be FIELD_DECLs
447 corresponding to base classes as well. Thus, iterating
448 over TYPE_FIELDs will result in correct initialization of
449 all of the subobjects. */
458 /* We shouldn't have gotten here for anything that would need
459 non-trivial initialization, and gimplify_init_ctor_preeval
460 would need to be fixed to allow it. */
463 }
465 /* Build a constructor to contain the zero- initializations. */
467 }
468 }
470 {
473 /* Iterate over the array elements, building initializations. */
476 /* If we have an error_mark here, we should just return error mark
477 as we don't know the size of the array yet. */
479 {
482 type);
484 }
487 /* A zero-sized array, which is accepted as an extension, will
488 have an upper bound of -1. */
490 {
491 constructor_elt ce;
493 /* If this is a one element array, we just use a regular init. */
496 else
507 /* We shouldn't have gotten here for anything that would need
508 non-trivial initialization, and gimplify_init_ctor_preeval
509 would need to be fixed to allow it. */
512 }
514 /* Build a constructor to contain the initializations. */
516 }
518 {
522 }
524 {
528 }
531 }
533 /* Initialize current class with INIT, a TREE_LIST of arguments for
534 a target constructor. If TREE_LIST is void_type_node, an empty
535 initializer list was given. Return the target constructor. */
537 static tree
539 {
544 tf_warning_or_error);
547 {
550 LOOKUP_NORMAL
551 |LOOKUP_NONVIRTUAL
555 {
558 LOOKUP_NORMAL
559 |LOOKUP_NONVIRTUAL
563 }
567 }
569 }
571 /* Instantiate the default member initializer of MEMBER, if needed.
572 Only get_nsdmi should use the return value of this function. */
574 tree
576 {
579 /* tsubst_decl uses void_node to indicate an uninstantiated DMI. */
581 {
583 location_t expr_loc
587 /* Check recursive instantiation. */
589 {
594 }
595 else
596 {
597 cp_evaluated ev;
609 {
613 }
619 /* Do deferred instantiation of the NSDMI. */
632 {
635 }
639 }
640 }
643 }
645 /* Return the non-static data initializer for FIELD_DECL MEMBER. */
647 tree
649 {
656 {
658 {
663 }
665 }
668 {
671 }
672 else
673 {
674 /* Use a PLACEHOLDER_EXPR when we don't have a 'this' parameter to
675 refer to; constexpr evaluation knows what to do with it. */
678 }
680 /* Clear processing_template_decl for sake of break_out_target_exprs;
681 INIT is always non-templated. */
682 processing_template_decl_sentinel ptds;
684 /* Strip redundant TARGET_EXPR so we don't need to remap it, and
685 so the aggregate init code below will see a CONSTRUCTOR. */
691 /* In a constructor, this expresses the full initialization, prevent
692 perform_member_init from calling another constructor (58162). */
695 /* Now put it back so C++17 copy elision works. */
703 }
705 /* Diagnose the flexible array MEMBER if its INITializer is non-null
706 and return true if so. Otherwise return false. */
708 bool
710 {
718 /* Point at the flexible array member declaration if it's initialized
719 in-class, and at the ctor if it's initialized in a ctor member
720 initializer list. */
721 location_t loc;
723 || !current_function_decl
726 else
731 }
733 /* If INIT's value can come from a call to std::initializer_list<T>::begin,
734 return that function. Otherwise, NULL_TREE. */
736 static tree
738 {
744 {
752 }
759 }
761 /* If INIT initializing MEMBER is copying the address of the underlying array
762 of an initializer_list, warn. */
764 static void
766 {
776 /* Do not warn if the parameter is an lvalue reference to non-const. */
794 "initializing %qD from %qE does not extend the lifetime "
796 }
798 /* Data structure for find_uninit_fields_r, below. */
801 /* The set tracking the yet-uninitialized members. */
803 /* The data member we are currently initializing. It can be either
804 a type (initializing a base class/delegating constructors), or
805 a COMPONENT_REF. */
806 tree member;
807 };
809 /* walk_tree callback that warns about using uninitialized data in
810 a member-initializer-list. */
812 static tree
814 {
820 /* No need to look into types or unevaluated operands. */
822 {
825 }
828 {
829 /* We'd need data flow info to avoid false positives. */
833 /* We might see a MODIFY_EXPR in cases like S() : a((b = 42)), c(b) { }
834 where the initializer for 'a' surreptitiously initializes 'b'. Let's
835 not bother with these complicated scenarios in the front end. */
837 /* Don't attempt to handle statement-expressions, either. */
841 /* If we're just taking the address of an object, it doesn't matter
842 whether it's been initialized. */
848 }
850 /* We'd need data flow info to avoid false positives. */
853 /* Attempt to handle a simple a{b}, but no more. */
855 {
859 else
861 }
862 /* Warn about uninitialized 'this'. */
864 {
867 {
873 }
874 /* Functions (whether static or nonstatic member) may have side effects
875 and initialize other members; it's not the front end's job to try to
876 figure it out. But don't give up for constructors: we still want to
877 warn when initializing base classes:
879 struct D : public B {
880 int x;
881 D() : B(x) {}
882 };
884 so carry on to detect that 'x' is used uninitialized. */
887 }
889 /* If we find FIELD in the uninitialized set, we warn. */
891 {
895 /* We're initializing a reference member with itself. */
901 {
904 "reference %qD is not yet bound to a value when used "
910 }
911 }
915 give_up:
919 }
921 /* Wrapper around find_uninit_fields_r above. */
923 static void
925 {
927 {
930 }
931 }
933 /* Initialize MEMBER, a FIELD_DECL, with INIT, a TREE_LIST of
934 arguments. If TREE_LIST is void_type_node, an empty initializer
935 list was given; if NULL_TREE no initializer was given. UNINITIALIZED
936 is the hash set that tracks uninitialized fields. */
938 static void
940 {
941 tree decl;
944 /* Use the non-static data member initializer if there was no
945 mem-initializer for this field. */
952 /* Effective C++ rule 12 requires that all data members be
953 initialized. */
957 member);
959 /* Get an lvalue for the data member. */
963 tf_warning_or_error);
968 && init
971 {
973 /* Handle references. */
980 member);
981 else
983 }
986 {
989 }
992 {
993 /* A(): a{e} */
996 tf_warning_or_error);
997 /* We are trying to initialize an array from a ()-list. If we
998 should attempt to do so, conjure up a CONSTRUCTOR. */
1000 /* P0960 is a C++20 feature. */
1005 tf_warning_or_error);
1006 /* If we're initializing a class from a ()-list, leave the TREE_LIST
1007 alone: we might call an appropriate constructor, or (in C++20)
1008 do aggregate-initialization. */
1009 }
1011 /* Assume we are initializing the member. */
1015 {
1016 /* mem() means value-initialization. */
1018 {
1022 }
1023 else
1024 {
1030 }
1031 }
1032 /* Deal with this here, as we will get confused if we try to call the
1033 assignment op for an anonymous union. This can happen in a
1034 synthesized copy constructor. */
1036 {
1038 {
1041 }
1042 }
1048 {
1049 /* With references and list-initialization, we need to deal with
1050 extending temporary lifetimes. 12.2p5: "A temporary bound to a
1051 reference member in a constructor’s ctor-initializer (12.6.2)
1052 persists until the constructor exits." */
1054 releasing_vec cleanups;
1056 {
1061 }
1066 /* Don't add trivial initialization of an empty base/field, as they
1067 might not be ordered the way the back-end expects. */
1069 /* A FIELD_DECL doesn't really have a suitable lifetime, but
1070 make_temporary_var_for_ref_to_temp will treat it as automatic and
1071 set_up_extended_ref_temp wants to use the decl in a warning. */
1080 }
1083 {
1085 {
1089 {
1091 {
1092 /* Initialize the array only if it's not a flexible
1093 array member (i.e., if it has an upper bound). */
1097 }
1098 }
1099 else
1101 }
1102 else
1103 {
1110 {
1111 /* TYPE_NEEDS_CONSTRUCTING can be set just because we have a
1112 vtable; still give this diagnostic. */
1113 auto_diagnostic_group d;
1118 }
1120 tf_warning_or_error));
1121 }
1122 }
1123 else
1124 {
1126 {
1127 tree core_type;
1128 /* member traversal: note it leaves init NULL */
1130 {
1131 auto_diagnostic_group d;
1136 }
1138 {
1139 auto_diagnostic_group d;
1144 }
1155 /* We left the member uninitialized. */
1157 }
1164 tf_warning_or_error));
1165 }
1168 /* This member is now initialized, remove it from the uninitialized
1169 set. */
1173 {
1174 tree expr;
1179 tf_warning_or_error);
1183 tf_warning_or_error);
1188 }
1189 }
1191 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
1192 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
1194 static tree
1196 {
1197 tree fields;
1199 /* Note whether or not T is a union. */
1204 {
1205 tree fieldtype;
1207 /* Skip CONST_DECLs for enumeration constants and so forth. */
1213 /* For an anonymous struct or union, we must recursively
1214 consider the fields of the anonymous type. They can be
1215 directly initialized from the constructor. */
1217 {
1218 /* Add this field itself. Synthesized copy constructors
1219 initialize the entire aggregate. */
1221 /* And now add the fields in the anonymous aggregate. */
1224 }
1225 /* Add this field. */
1228 }
1231 }
1233 /* Return the innermost aggregate scope for FIELD, whether that is
1234 the enclosing class or an anonymous aggregate within it. */
1236 static tree
1238 {
1241 else
1243 }
1245 /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives
1246 a FIELD_DECL or BINFO in T that needs initialization. The
1247 TREE_VALUE gives the initializer, or list of initializer arguments.
1249 Return a TREE_LIST containing all of the initializations required
1250 for T, in the order in which they should be performed. The output
1251 list has the same format as the input. */
1253 static tree
1255 {
1256 tree init;
1258 tree sorted_inits;
1259 tree next_subobject;
1264 /* Build up a list of initializations. The TREE_PURPOSE of entry
1265 will be the subobject (a FIELD_DECL or BINFO) to initialize. The
1266 TREE_VALUE will be the constructor arguments, or NULL if no
1267 explicit initialization was provided. */
1270 /* Process the virtual bases. */
1275 /* Process the direct bases. */
1281 /* Process the non-static data members. */
1283 /* Reverse the entire list of initializations, so that they are in
1284 the order that they will actually be performed. */
1287 /* If the user presented the initializers in an order different from
1288 that in which they will actually occur, we issue a warning. Keep
1289 track of the next subobject which can be explicitly initialized
1290 without issuing a warning. */
1293 /* Go through the explicit initializers, filling in TREE_PURPOSE in
1294 the SORTED_INITS. */
1296 {
1297 tree subobject;
1298 tree subobject_init;
1302 /* If the explicit initializers are in sorted order, then
1303 SUBOBJECT will be NEXT_SUBOBJECT, or something following
1304 it. */
1306 subobject_init;
1311 /* Issue a warning if the explicit initializer order does not
1312 match that which will actually occur.
1313 ??? Are all these on the correct lines? */
1315 {
1320 else
1326 else
1330 }
1332 /* Look again, from the beginning of the list. */
1334 {
1338 }
1340 /* It is invalid to initialize the same subobject more than
1341 once. */
1343 {
1347 subobject);
1348 else
1351 subobject);
1352 }
1354 /* Record the initialization. */
1356 /* Carry over the dummy TREE_TYPE node containing the source location. */
1359 }
1361 /* [class.base.init]
1363 If a ctor-initializer specifies more than one mem-initializer for
1364 multiple members of the same union (including members of
1365 anonymous unions), the ctor-initializer is ill-formed.
1367 Here we also splice out uninitialized union members. */
1369 {
1373 {
1374 tree field;
1375 tree ctx;
1381 /* Skip base classes. */
1385 /* If this is an anonymous aggregate with no explicit initializer,
1386 splice it out. */
1390 /* See if this field is a member of a union, or a member of a
1391 structure contained in a union, etc. */
1394 /* If this field is not a member of a union, skip it. */
1399 /* If this union member has no explicit initializer and no NSDMI,
1400 splice it out. */
1403 else
1406 /* It's only an error if we have two initializers for the same
1407 union type. */
1409 {
1412 }
1414 /* See if LAST_FIELD and the field initialized by INIT are
1415 members of the same union (or the union itself). If so, there's
1416 a problem, unless they're actually members of the same structure
1417 which is itself a member of a union. For example, given:
1419 union { struct { int i; int j; }; };
1421 initializing both `i' and `j' makes sense. */
1422 ctx = common_enclosing_class
1428 {
1429 /* A mem-initializer hides an NSDMI. */
1434 else
1435 {
1438 ctx);
1440 }
1441 }
1445 next:
1448 splice:
1450 }
1451 }
1454 }
1456 /* Callback for cp_walk_tree to mark all PARM_DECLs in a tree as read. */
1458 static tree
1460 {
1465 }
1467 /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS
1468 is a TREE_LIST giving the explicit mem-initializer-list for the
1469 constructor. The TREE_PURPOSE of each entry is a subobject (a
1470 FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE
1471 is a TREE_LIST giving the arguments to the constructor or
1472 void_type_node for an empty list of arguments. */
1474 void
1476 {
1479 /* We will already have issued an error message about the fact that
1480 the type is incomplete. */
1484 /* Keep a set holding fields that are not initialized. */
1487 /* Initially that is all of them. */
1499 {
1500 /* Delegating constructor. */
1505 }
1511 /* Sort the mem-initializers into the order in which the
1512 initializations should be performed. */
1517 /* Initialize base classes. */
1521 {
1525 /* We already have issued an error message. */
1529 /* Suppress access control when calling the inherited ctor. */
1531 && flag_new_inheriting_ctors
1537 {
1538 /* If these initializations are taking place in a copy constructor,
1539 the base class should probably be explicitly initialized if there
1540 is a user-defined constructor in the base class (other than the
1541 default constructor, which will be called anyway). */
1549 }
1551 /* Initialize the base. */
1553 {
1554 tree base_addr;
1560 arguments,
1561 flags,
1562 tf_warning_or_error);
1567 }
1569 /* C++14 DR1658 Means we do not have to construct vbases of
1570 abstract classes. */
1572 else
1573 /* When not constructing vbases of abstract classes, at least mark
1574 the arguments expressions as read to avoid
1575 -Wunused-but-set-parameter false positives. */
1580 }
1583 /* Initialize the vptrs. */
1586 /* Initialize the data members. */
1588 {
1589 /* If this initializer was explicitly provided, then the dummy TREE_TYPE
1590 node contains the source location. */
1595 uninitialized);
1598 }
1599 }
1601 /* Returns the address of the vtable (i.e., the value that should be
1602 assigned to the vptr) for BINFO. */
1604 tree
1606 {
1608 tree vtbl;
1611 /* If this is a virtual primary base, then the vtable we want to store
1612 is that for the base this is being used as the primary base of. We
1613 can't simply skip the initialization, because we may be expanding the
1614 inits of a subobject constructor where the virtual base layout
1615 can be different. */
1619 /* Figure out what vtable BINFO's vtable is based on, and mark it as
1620 used. */
1624 /* Now compute the address to use when initializing the vptr. */
1630 }
1632 /* This code sets up the virtual function tables appropriate for
1633 the pointer DECL. It is a one-ply initialization.
1635 BINFO is the exact type that DECL is supposed to be. In
1636 multiple inheritance, this might mean "C's A" if C : A, B. */
1638 static void
1640 {
1642 tree vtt_index;
1644 /* Compute the initializer for vptr. */
1647 /* We may get this vptr from a VTT, if this is a subobject
1648 constructor or subobject destructor. */
1651 {
1652 tree vtbl2;
1653 tree vtt_parm;
1655 /* Compute the value to use, when there's a VTT. */
1661 /* The actual initializer is the VTT value only in the subobject
1662 constructor. In maybe_clone_body we'll substitute NULL for
1663 the vtt_parm in the case of the non-subobject constructor. */
1665 }
1667 /* Compute the location of the vtpr. */
1672 /* Assign the vtable to the vptr. */
1676 }
1678 /* If an exception is thrown in a constructor, those base classes already
1679 constructed must be destroyed. This function creates the cleanup
1680 for BINFO, which has just been constructed. If FLAG is non-NULL,
1681 it is a DECL which is nonzero when this base needs to be
1682 destroyed. */
1684 static void
1686 {
1687 tree expr;
1692 /* Call the destructor. */
1694 base_dtor_identifier,
1695 NULL,
1696 binfo,
1698 tf_warning_or_error);
1710 }
1712 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its
1713 constructor. */
1715 static void
1717 {
1718 tree inner_if_stmt;
1719 tree exp;
1720 tree flag;
1722 /* If there are virtual base classes with destructors, we need to
1723 emit cleanups to destroy them if an exception is thrown during
1724 the construction process. These exception regions (i.e., the
1725 period during which the cleanups must occur) begin from the time
1726 the construction is complete to the end of the function. If we
1727 create a conditional block in which to initialize the
1728 base-classes, then the cleanup region for the virtual base begins
1729 inside a block, and ends outside of that block. This situation
1730 confuses the sjlj exception-handling code. Therefore, we do not
1731 create a single conditional block, but one for each
1732 initialization. (That way the cleanup regions always begin
1733 in the outer block.) We trust the back end to figure out
1734 that the FLAG will not change across initializations, and
1735 avoid doing multiple tests. */
1740 /* Compute the location of the virtual base. If we're
1741 constructing virtual bases, then we must be the most derived
1742 class. Therefore, we don't have to look up the virtual base;
1743 we already know where it is. */
1752 }
1754 /* Find the context in which this FIELD can be initialized. */
1756 static tree
1758 {
1761 /* Anonymous union members can be initialized in the first enclosing
1762 non-anonymous union context. */
1766 }
1768 /* Function to give error message if member initialization specification
1769 is erroneous. FIELD is the member we decided to initialize.
1770 TYPE is the type for which the initialization is being performed.
1771 FIELD must be a member of TYPE.
1773 MEMBER_NAME is the name of the member. */
1775 static int
1777 {
1781 {
1783 member_name);
1785 }
1787 {
1790 field);
1792 }
1794 {
1798 }
1800 {
1802 member_name);
1804 }
1807 }
1809 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it
1810 is a _TYPE node or TYPE_DECL which names a base for that type.
1811 Check the validity of NAME, and return either the base _TYPE, base
1812 binfo, or the FIELD_DECL of the member. If NAME is invalid, return
1813 NULL_TREE and issue a diagnostic.
1815 An old style unnamed direct single base construction is permitted,
1816 where NAME is NULL. */
1818 tree
1820 {
1821 tree basetype;
1822 tree field;
1828 {
1829 /* This is an obsolete unnamed base class initializer. The
1830 parser will already have warned about its use. */
1832 {
1835 current_class_type);
1838 basetype = BINFO_TYPE
1843 current_class_type);
1845 }
1846 }
1848 {
1851 }
1854 else
1858 {
1859 tree class_binfo;
1860 tree direct_binfo;
1861 tree virtual_binfo;
1872 /* Look for a direct base. */
1877 /* Look for a virtual base -- unless the direct base is itself
1878 virtual. */
1882 /* [class.base.init]
1884 If a mem-initializer-id is ambiguous because it designates
1885 both a direct non-virtual base class and an inherited virtual
1886 base class, the mem-initializer is ill-formed. */
1888 {
1890 basetype);
1892 }
1895 {
1899 else
1903 }
1906 }
1907 else
1908 {
1911 else
1916 }
1919 }
1921 /* This is like `expand_member_init', only it stores one aggregate
1922 value into another.
1924 INIT comes in two flavors: it is either a value which
1925 is to be stored in EXP, or it is a parameter list
1926 to go to a constructor, which will operate on EXP.
1927 If INIT is not a parameter list for a constructor, then set
1928 LOOKUP_ONLYCONVERTING.
1929 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1930 the initializer, if FLAGS is 0, then it is the (init) form.
1931 If `init' is a CONSTRUCTOR, then we emit a warning message,
1932 explaining that such initializations are invalid.
1934 If INIT resolves to a CALL_EXPR which happens to return
1935 something of the type we are looking for, then we know
1936 that we can safely use that call to perform the
1937 initialization.
1939 The virtual function table pointer cannot be set up here, because
1940 we do not really know its type.
1942 This never calls operator=().
1944 When initializing, nothing is CONST.
1946 A default copy constructor may have to be used to perform the
1947 initialization.
1949 A constructor or a conversion operator may have to be used to
1950 perform the initialization, but not both, as it would be ambiguous. */
1952 tree
1954 {
1955 tree stmt_expr;
1956 tree compound_stmt;
1966 location_t init_loc = (init
1974 {
1979 {
1985 {
1986 /* Wrap the initializer in a CONSTRUCTOR so that build_vec_init
1987 recognizes it as direct-initialization. */
1991 }
1992 }
1993 else
1994 {
1995 /* Must arrange to initialize each element of EXP
1996 from elements of INIT. */
2005 && (!from_array
2007 /* Can happen, eg, handling the compound-literals
2008 extension (ext/complit12.C). */
2010 {
2015 }
2016 }
2020 from_array,
2021 complain);
2025 /* Restore the type of init unless it was used directly. */
2029 }
2049 /* Just know that we've seen something for this node. */
2053 }
2055 static bool
2057 tsubst_flags_t complain)
2058 {
2061 /* It fails because there may not be a constructor which takes
2062 its own type as the first (or only parameter), but which does
2063 take other types via a conversion. So, if the thing initializing
2064 the expression is a unit element of type X, first try X(X&),
2065 followed by initialization by X. If neither of these work
2066 out, then look hard. */
2067 tree rval;
2070 /* If we have direct-initialization from an initializer list, pull
2071 it out of the TREE_LIST so the code below can see it. */
2074 {
2078 /* Only call reshape_init if it has not been called earlier
2079 by the callers. */
2082 }
2086 /* A brace-enclosed initializer for an aggregate. In C++0x this can
2087 happen for direct-initialization, too. */
2093 /* A CONSTRUCTOR of the target's type is a previously digested
2094 initializer, whether that happened just above or in
2095 cp_parser_late_parsing_nsdmi.
2097 A TARGET_EXPR with TARGET_EXPR_DIRECT_INIT_P or TARGET_EXPR_LIST_INIT_P
2098 set represents the whole initialization, so we shouldn't build up
2099 another ctor call. */
2106 {
2107 /* Early initialization via a TARGET_EXPR only works for
2108 complete objects. */
2115 }
2120 {
2121 /* Base subobjects should only get direct-initialization. */
2125 /* Do nothing. We hit this in two cases: Reference initialization,
2126 where we aren't initializing a real variable, so we don't want
2127 to run a new constructor; and catching an exception, where we
2128 have already built up the constructor call so we could wrap it
2130 else
2131 {
2136 }
2138 /* We need to protect the initialization of a catch parm with a
2139 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
2140 around the TARGET_EXPR for the copy constructor. See
2141 initialize_handler_parm. */
2145 {
2146 /* Avoid voidify_wrapper_expr making a temporary. */
2149 }
2153 }
2158 {
2162 }
2163 else
2168 {
2169 /* Delegating constructor. */
2170 tree complete;
2171 tree base;
2174 /* Unshare the arguments for the second call. */
2175 releasing_vec parms2;
2177 {
2180 }
2183 complain);
2188 complain);
2193 }
2194 else
2195 {
2200 complain);
2203 }
2209 {
2212 {
2216 }
2217 }
2219 /* FIXME put back convert_to_void? */
2224 }
2226 /* This function is responsible for initializing EXP with INIT
2227 (if any). Returns true on success, false on failure.
2229 BINFO is the binfo of the type for who we are performing the
2230 initialization. For example, if W is a virtual base class of A and B,
2231 and C : A, B.
2232 If we are initializing B, then W must contain B's W vtable, whereas
2233 were we initializing C, W must contain C's W vtable.
2235 TRUE_EXP is nonzero if it is the true expression being initialized.
2236 In this case, it may be EXP, or may just contain EXP. The reason we
2237 need this is because if EXP is a base element of TRUE_EXP, we
2238 don't necessarily know by looking at EXP where its virtual
2239 baseclass fields should really be pointing. But we do know
2240 from TRUE_EXP. In constructors, we don't know anything about
2241 the value being initialized.
2243 FLAGS is just passed to `build_new_method_call'. See that function
2244 for its description. */
2246 static bool
2248 tsubst_flags_t complain)
2249 {
2255 /* Use a function returning the desired type to initialize EXP for us.
2256 If the function is a constructor, and its first argument is
2257 NULL_TREE, know that it was meant for us--just slide exp on
2258 in and expand the constructor. Constructors now come
2259 as TARGET_EXPRs. */
2263 {
2265 /* If store_init_value returns NULL_TREE, the INIT has been
2266 recorded as the DECL_INITIAL for EXP. That means there's
2267 nothing more we have to do. */
2273 }
2275 /* List-initialization from {} becomes value-initialization for non-aggregate
2276 classes with default constructors. Handle this here when we're
2277 initializing a base, so protected access works. */
2279 {
2286 }
2288 /* If an explicit -- but empty -- initializer list was present,
2289 that's value-initialization. */
2291 {
2292 /* If the type has data but no user-provided default ctor, we need to zero
2293 out the object. */
2296 {
2299 /* Don't clobber already initialized virtual bases. */
2302 field_size);
2305 }
2307 /* If we don't need to mess with the constructor at all,
2308 then we're done. */
2312 /* Otherwise fall through and call the constructor. */
2314 }
2316 /* We know that expand_default_init can handle everything we want
2317 at this point. */
2319 }
2321 /* Report an error if TYPE is not a user-defined, class type. If
2322 OR_ELSE is nonzero, give an error message. */
2324 int
2326 {
2331 {
2335 }
2337 }
2339 /* Returns true iff the initializer INIT represents copy-initialization
2340 (and therefore we must set LOOKUP_ONLYCONVERTING when processing it). */
2342 bool
2344 {
2350 }
2352 /* Build a reference to a member of an aggregate. This is not a C++
2353 `&', but really something which can have its address taken, and
2354 then act as a pointer to member, for example TYPE :: FIELD can have
2355 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if
2356 this expression is the operand of "&".
2358 @@ Prints out lousy diagnostics for operator <typename>
2359 @@ fields.
2361 @@ This function should be rewritten and placed in search.cc. */
2363 tree
2365 tsubst_flags_t complain)
2366 {
2367 tree decl;
2370 /* class templates can come in as TEMPLATE_DECLs here. */
2383 /* Callers should call mark_used before this point, except for functions. */
2389 {
2393 }
2395 /* Entities other than non-static members need no further
2396 processing. */
2403 {
2407 }
2409 /* Set up BASEBINFO for member lookup. */
2412 /* A lot of this logic is now handled in lookup_member. */
2414 {
2415 /* Go from the TREE_BASELINK to the member function info. */
2419 {
2420 /* Get rid of a potential OVERLOAD around it. */
2423 /* Unique functions are handled easily. */
2425 /* For non-static member of base class, we need a special rule
2426 for access checking [class.protected]:
2428 If the access is to form a pointer to member, the
2429 nested-name-specifier shall name the derived class
2430 (or any class derived from that class). */
2435 complain);
2436 else
2438 complain);
2444 }
2445 else
2447 }
2449 {
2450 /* We need additional test besides the one in
2451 check_accessibility_of_qualified_id in case it is
2452 a pointer to non-static member. */
2454 complain))
2456 }
2459 {
2460 /* If MEMBER is non-static, then the program has fallen afoul of
2461 [expr.prim]:
2463 An id-expression that denotes a non-static data member or
2464 non-static member function of a class can only be used:
2466 -- as part of a class member access (_expr.ref_) in which the
2467 object-expression refers to the member's class or a class
2468 derived from that class, or
2470 -- to form a pointer to member (_expr.unary.op_), or
2472 -- in the body of a non-static member function of that class or
2473 of a class derived from that class (_class.mfct.non-static_), or
2475 -- in a mem-initializer for a constructor for that class or for
2476 a class derived from that class (_class.base.init_). */
2478 {
2479 /* Build a representation of the qualified name suitable
2480 for use as the operand to "&" -- even though the "&" is
2481 not actually present. */
2483 /* In Microsoft mode, treat a non-static member function as if
2484 it were a pointer-to-member. */
2486 {
2489 }
2494 }
2496 {
2500 }
2502 }
2507 }
2509 /* If DECL is a scalar enumeration constant or variable with a
2510 constant initializer, return the initializer (or, its initializers,
2511 recursively); otherwise, return DECL. If STRICT_P, the
2512 initializer is only returned if DECL is a
2513 constant-expression. If RETURN_AGGREGATE_CST_OK_P, it is ok to
2514 return an aggregate constant. If UNSHARE_P, return an unshared
2515 copy of the initializer. */
2517 static tree
2520 {
2525 {
2526 tree init;
2527 /* If DECL is a static data member in a template
2528 specialization, we must instantiate it here. The
2529 initializer for the static data member is not processed
2530 until needed; we need it now. */
2534 {
2537 /* Treat the error as a constant to avoid cascading errors on
2538 excessively recursive template instantiation (c++/9335). */
2540 else
2542 }
2543 /* Initializers in templates are generally expanded during
2544 instantiation, so before that for const int i(2)
2545 INIT is a TREE_LIST with the actual initializer as
2546 TREE_VALUE. */
2548 && init
2552 /* Instantiate a non-dependent initializer for user variables. We
2553 mustn't do this for the temporary for an array compound literal;
2554 trying to instatiate the initializer will keep creating new
2555 temporaries until we crash. Probably it's not useful to do it for
2556 other artificial variables, either. */
2562 || (!return_aggregate_cst_ok_p
2563 /* Unless RETURN_AGGREGATE_CST_OK_P is true, do not
2564 return an aggregate constant (of which string
2565 literals are a special case), as we do not want
2566 to make inadvertent copies of such entities, and
2567 we must be sure that their addresses are the
2568 same everywhere. */
2572 /* Don't return a CONSTRUCTOR for a variable with partial run-time
2573 initialization, since it doesn't represent the entire value.
2574 Similarly for VECTOR_CSTs created by cp_folding those
2575 CONSTRUCTORs. */
2580 /* If the variable has a dynamic initializer, don't use its
2581 DECL_INITIAL which doesn't reflect the real value. */
2588 }
2590 }
2592 /* If DECL is a CONST_DECL, or a constant VAR_DECL initialized by constant
2593 of integral or enumeration type, or a constexpr variable of scalar type,
2594 then return that value. These are those variables permitted in constant
2595 expressions by [5.19/1]. */
2597 tree
2599 {
2603 }
2605 /* Like scalar_constant_value, but can also return aggregate initializers.
2606 If UNSHARE_P, return an unshared copy of the initializer. */
2608 tree
2610 {
2614 }
2616 /* A more relaxed version of decl_really_constant_value, used by the
2617 common C/C++ code. */
2619 tree
2621 {
2625 }
2627 tree
2629 {
2631 }
2632 \f
2633 /* Common subroutines of build_new and build_vec_delete. */
2634 \f
2635 /* Build and return a NEW_EXPR. If NELTS is non-NULL, TYPE[NELTS] is
2636 the type of the object being allocated; otherwise, it's just TYPE.
2637 INIT is the initializer, if any. USE_GLOBAL_NEW is true if the
2638 user explicitly wrote "::operator new". PLACEMENT, if non-NULL, is
2639 a vector of arguments to be provided as arguments to a placement
2640 new operator. This routine performs no semantic checks; it just
2641 creates and returns a NEW_EXPR. */
2643 static tree
2646 {
2647 tree init_list;
2648 tree new_expr;
2650 /* If INIT is NULL, the we want to store NULL_TREE in the NEW_EXPR.
2651 If INIT is not NULL, then we want to store VOID_ZERO_NODE. This
2652 permits us to distinguish the case of a missing initializer "new
2653 int" from an empty initializer "new int()". */
2658 else
2663 init_list);
2668 }
2670 /* Diagnose uninitialized const members or reference members of type
2671 TYPE. USING_NEW is used to disambiguate the diagnostic between a
2672 new expression without a new-initializer and a declaration. Returns
2673 the error count. */
2675 static int
2678 {
2679 tree field;
2686 {
2687 tree field_type;
2698 {
2701 {
2703 {
2707 else
2709 }
2710 else
2711 {
2716 else
2719 }
2722 }
2723 }
2726 {
2729 {
2731 {
2735 else
2737 }
2738 else
2739 {
2744 else
2747 }
2750 }
2751 }
2754 error_count
2757 }
2759 }
2761 int
2763 {
2765 }
2767 /* Call __cxa_bad_array_new_length to indicate that the size calculation
2768 overflowed. Pretend it returns sizetype so that it plays nicely in the
2769 COND_EXPR. */
2771 tree
2773 {
2775 {
2780 fn = push_throw_library_fn
2782 }
2785 }
2787 /* Attempt to verify that the argument, OPER, of a placement new expression
2788 refers to an object sufficiently large for an object of TYPE or an array
2789 of NELTS of such objects when NELTS is non-null, and issue a warning when
2790 it does not. SIZE specifies the size needed to construct the object or
2791 array and captures the result of NELTS * sizeof (TYPE). (SIZE could be
2792 greater when the array under construction requires a cookie to store
2793 NELTS. GCC's placement new expression stores the cookie when invoking
2794 a user-defined placement new operator function but not the default one.
2795 Placement new expressions with user-defined placement new operator are
2796 not diagnosed since we don't know how they use the buffer (this could
2797 be a future extension). */
2798 static void
2800 {
2805 /* Using a function argument or a (non-array) variable as an argument
2806 to placement new is not checked since it's unknown what it might
2807 point to. */
2813 /* Evaluate any constant expressions. */
2816 access_ref ref;
2823 /* We can only draw conclusions if ref.deref == -1,
2824 i.e. oper is the address of the object. */
2829 offset_int bytes_need;
2838 else
2839 {
2840 /* The type is a VLA. */
2842 }
2847 /* True when the size to mention in the warning is exact as opposed
2848 to "at least N". */
2859 (exact_size
2861 "of type %<%T [%wu]%> and size %qwu "
2864 "of type %<%T [%wu]%> and size %qwu "
2865 "in a region of type %qT and size "
2870 else
2872 (exact_size
2874 "of objects of type %qT and size %qwu "
2877 "of objects of type %qT and size %qwu "
2878 "in a region of type %qT and size "
2882 else
2884 (exact_size
2886 "of type %qT and size %qwu in a region "
2889 "of type %qT "
2890 "and size %qwu in a region of type %qT "
2899 /* Avoid mentioning the offset when its lower bound is zero
2900 or when it's impossibly large. */
2907 else
2911 }
2913 /* True if alignof(T) > __STDCPP_DEFAULT_NEW_ALIGNMENT__. */
2915 bool
2917 {
2920 }
2922 /* Return the alignment we expect malloc to guarantee. This should just be
2923 MALLOC_ABI_ALIGNMENT, but that macro defaults to only BITS_PER_WORD for some
2924 reason, so don't let the threshold be smaller than max_align_t_align. */
2926 unsigned
2928 {
2930 }
2932 /* Determine whether an allocation function is a namespace-scope
2933 non-replaceable placement new function. See DR 1748. */
2934 static bool
2936 {
2938 {
2943 }
2945 }
2947 /* For element type ELT_TYPE, return the appropriate type of the heap object
2948 containing such element(s). COOKIE_SIZE is the size of cookie in bytes.
2949 Return
2950 struct { size_t[COOKIE_SIZE/sizeof(size_t)]; ELT_TYPE[N]; }
2951 where N is nothing (flexible array member) if ITYPE2 is NULL, otherwise
2952 the array has ITYPE2 as its TYPE_DOMAIN. */
2954 tree
2956 {
2975 }
2977 /* Help the constexpr code to find the right type for the heap variable
2978 by adding a NOP_EXPR around ALLOC_CALL if needed for cookie_size.
2979 Return ALLOC_CALL or ALLOC_CALL cast to a pointer to
2980 struct { size_t[cookie_size/sizeof(size_t)]; elt_type[]; }. */
2982 static tree
2984 {
3003 NULL_TREE);
3005 }
3007 /* Generate code for a new-expression, including calling the "operator
3008 new" function, initializing the object, and, if an exception occurs
3009 during construction, cleaning up. The arguments are as for
3010 build_raw_new_expr. This may change PLACEMENT and INIT.
3011 TYPE is the type of the object being constructed, possibly an array
3012 of NELTS elements when NELTS is non-null (in "new T[NELTS]", T may
3013 be an array of the form U[inner], with the whole expression being
3014 "new U[NELTS][inner]"). */
3016 static tree
3019 tsubst_flags_t complain)
3020 {
3022 /* True iff this is a call to "operator new[]" instead of just
3023 "operator new". */
3025 /* If ARRAY_P is true, the element type of the array. This is never
3026 an ARRAY_TYPE; for something like "new int[3][4]", the
3027 ELT_TYPE is "int". If ARRAY_P is false, this is the same type as
3028 TYPE. */
3029 tree elt_type;
3030 /* The type of the new-expression. (This type is always a pointer
3031 type.) */
3032 tree pointer_type;
3033 tree non_const_pointer_type;
3034 /* The most significant array bound in int[OUTER_NELTS][inner]. */
3036 /* For arrays with a non-constant number of elements, a bounds checks
3037 on the NELTS parameter to avoid integer overflow at runtime. */
3040 /* Number of the "inner" elements in "new T[OUTER_NELTS][inner]". */
3043 /* Size of the inner array elements (those with constant dimensions). */
3044 offset_int inner_size;
3045 /* The address returned by the call to "operator new". This node is
3046 a VAR_DECL and is therefore reusable. */
3047 tree alloc_node;
3048 tree alloc_fn;
3051 /* If non-NULL, the number of extra bytes to allocate at the
3052 beginning of the storage allocated for an array-new expression in
3053 order to store the number of elements. */
3055 tree placement_first;
3057 /* True if the function we are calling is a placement allocation
3058 function. */
3060 /* True if the storage must be initialized, either by a constructor
3061 or due to an explicit new-initializer. */
3063 /* The address of the thing allocated, not including any cookie. In
3064 particular, if an array cookie is in use, DATA_ADDR is the
3065 address of the first array element. This node is a VAR_DECL, and
3066 is therefore reusable. */
3067 tree data_addr;
3071 {
3074 }
3076 {
3077 /* Transforms new (T[N]) to new T[N]. The former is a GNU
3078 extension for variable N. (This also covers new T where T is
3079 a VLA typedef.) */
3085 }
3087 /* Lots of logic below depends on whether we have a constant number of
3088 elements, so go ahead and fold it now. */
3091 /* If our base type is an array, then make sure we know how many elements
3092 it has. */
3096 {
3100 {
3105 {
3109 }
3111 }
3112 else
3113 {
3115 {
3119 }
3121 }
3125 inner_nelts_cst,
3126 complain);
3127 }
3134 {
3137 }
3142 /* Warn if we performed the (T[N]) to T[N] transformation and N is
3143 variable. */
3146 {
3148 {
3155 }
3156 else
3158 }
3161 {
3165 }
3169 "%<new%> of %<initializer_list%> does not "
3178 {
3180 /* A program that calls for default-initialization [...] of an
3181 entity of reference type is ill-formed. */
3185 /* A new-expression that creates an object of type T initializes
3186 that object as follows:
3187 - If the new-initializer is omitted:
3188 -- If T is a (possibly cv-qualified) non-POD class type
3189 (or array thereof), the object is default-initialized (8.5).
3190 [...]
3191 -- Otherwise, the object created has indeterminate
3192 value. If T is a const-qualified type, or a (possibly
3193 cv-qualified) POD class type (or array thereof)
3194 containing (directly or indirectly) a member of
3195 const-qualified type, the program is ill-formed; */
3205 }
3209 {
3213 }
3217 {
3218 /* Maximum available size in bytes. Half of the address space
3219 minus the cookie size. */
3220 offset_int max_size
3222 /* Maximum number of outer elements which can be allocated. */
3223 offset_int max_outer_nelts;
3224 tree max_outer_nelts_tree;
3230 /* Unconditionally subtract the cookie size. This decreases the
3231 maximum object size and is safe even if we choose not to use
3232 a cookie after all. */
3238 {
3240 {
3241 cst_size_error error;
3244 else
3245 {
3249 inner_nelts_count));
3251 }
3254 }
3256 }
3264 {
3266 {
3267 /* When the array size is constant, check it at compile time
3268 to make sure it doesn't exceed the implementation-defined
3269 maximum, as required by C++ 14 (in C++ 11 this requirement
3270 isn't explicitly stated but it's enforced anyway -- see
3271 grokdeclarator in cp/decl.cc). */
3273 {
3277 }
3279 }
3280 }
3281 else
3282 {
3283 /* When a runtime check is necessary because the array size
3284 isn't constant, keep only the top-most seven bits (starting
3285 with the most significant non-zero bit) of the maximum size
3286 to compare the array size against, to simplify encoding the
3287 constant maximum size in the instruction stream. */
3294 outer_nelts,
3295 max_outer_nelts_tree);
3296 }
3297 }
3301 {
3303 /* Also consider the alignment of the cookie, if any. */
3307 }
3311 /* If PLACEMENT is a single simple pointer type not passed by
3312 reference, prepare to capture it in a temporary variable. Do
3313 this now, since PLACEMENT will change in the calls below. */
3321 /* Allocate the object. */
3322 tree fnname;
3323 tree fns;
3327 member_new_p = !globally_qualified_p
3329 && (array_p
3335 && (array_p
3340 {
3341 /* Use a class-specific operator new. */
3342 /* If a cookie is required, add some extra space. */
3345 else
3346 {
3348 /* No size arithmetic necessary, so the size check is
3349 not needed. */
3352 }
3353 /* Perform the overflow check. */
3360 /* Create the argument list. */
3362 /* Do name-lookup to find the appropriate operator. */
3365 {
3369 }
3371 {
3373 {
3376 }
3378 }
3382 {
3385 alloc_call
3389 /* If no matching function is found and the allocated object type
3390 has new-extended alignment, the alignment argument is removed
3391 from the argument list, and overload resolution is performed
3392 again. */
3395 }
3399 LOOKUP_NORMAL,
3401 }
3402 else
3403 {
3404 /* Use a global operator new. */
3405 /* See if a cookie might be required. */
3407 {
3409 /* No size arithmetic necessary, so the size check is
3410 not needed. */
3413 }
3415 /* If size is zero e.g. due to type having zero size, try to
3416 preserve outer_nelts for constant expression evaluation
3417 purposes. */
3425 }
3432 /* Now, check to see if this function is actually a placement
3433 allocation function. This can happen even when PLACEMENT is NULL
3434 because we might have something like:
3436 struct S { void* operator new (size_t, int i = 0); };
3438 A call to `new S' will get this allocation function, even though
3439 there is no explicit placement argument. If there is more than
3440 one argument, or there are variable arguments, then this is a
3441 placement allocation function. */
3442 placement_allocation_fn_p
3447 && warn_aligned_new
3448 && !placement_allocation_fn_p
3453 {
3454 auto_diagnostic_group d;
3457 {
3463 }
3464 }
3466 /* If we found a simple case of PLACEMENT_EXPR above, then copy it
3467 into a temporary variable. */
3473 {
3479 {
3483 }
3487 {
3488 /* Attempt to make the warning point at the operator new argument. */
3493 }
3494 }
3499 cookie_size);
3501 /* In the simple case, we can stop now. */
3506 /* Store the result of the allocation call in a variable so that we can
3507 use it more than once. */
3511 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */
3515 /* Preevaluate the placement args so that we don't reevaluate them for a
3516 placement delete. */
3518 {
3519 tree inits;
3523 alloc_expr);
3524 }
3526 /* unless an allocation function is declared with an empty excep-
3527 tion-specification (_except.spec_), throw(), it indicates failure to
3528 allocate storage by throwing a bad_alloc exception (clause _except_,
3529 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
3530 cation function is declared with an empty exception-specification,
3531 throw(), it returns null to indicate failure to allocate storage and a
3532 non-null pointer otherwise.
3534 So check for a null exception spec on the op new we just called. */
3537 check_new
3541 {
3542 tree cookie;
3543 tree cookie_ptr;
3544 tree size_ptr_type;
3546 /* Adjust so we're pointing to the start of the object. */
3549 /* Store the number of bytes allocated so that we can know how
3550 many elements to destroy later. We use the last sizeof
3551 (size_t) bytes to store the number of elements. */
3562 {
3563 /* Also store the element size. */
3574 }
3575 }
3576 else
3577 {
3580 }
3582 /* Now use a pointer to the type we've actually allocated. */
3584 /* But we want to operate on a non-const version to start with,
3585 since we'll be modifying the elements. */
3586 non_const_pointer_type = build_pointer_type
3590 /* Any further uses of alloc_node will want this type, too. */
3593 /* Now initialize the allocated object. Note that we preevaluate the
3594 initialization expression, apart from the actual constructor call or
3595 assignment--we do this because we want to delay the allocation as long
3596 as possible in order to minimize the size of the exception region for
3597 placement delete. */
3599 {
3603 {
3606 }
3609 {
3610 /* Avoid an ICE when converting to a base in build_simple_base_path.
3611 We'll throw this all away anyway, and build_new will create
3612 a NEW_EXPR. */
3614 /* build_value_init doesn't work in templates, and we don't need
3615 the initializer anyway since we're going to throw it away and
3616 rebuild it at instantiation time, so just build up a single
3617 constructor call to get any appropriate diagnostics. */
3621 complete_ctor_identifier,
3623 LOOKUP_NORMAL,
3624 complain);
3625 }
3627 {
3631 {
3635 else
3636 {
3640 complain);
3641 else
3642 /* We'll check the length at runtime. */
3645 /* If we have new char[4]{"foo"}, we have to reshape
3646 so that the STRING_CST isn't wrapped in { }. */
3648 /* The middle end doesn't cope with the location wrapper
3649 around a STRING_CST. */
3652 }
3653 }
3655 {
3659 }
3660 init_expr
3664 integer_one_node,
3665 complain),
3666 vecinit,
3667 explicit_value_init_p,
3669 complain);
3670 }
3671 else
3672 {
3676 {
3678 complete_ctor_identifier,
3680 LOOKUP_NORMAL,
3682 }
3684 {
3685 /* Something like `new int()'. NO_CLEANUP is needed so
3686 we don't try and build a (possibly ill-formed)
3687 destructor. */
3692 }
3693 else
3694 {
3695 tree ie;
3697 /* We are processing something like `new int (10)', which
3698 means allocate an int, and initialize it with 10.
3700 In C++20, also handle `new A(1, 2)'. */
3704 {
3709 }
3710 else
3712 complain);
3715 }
3716 /* If the initializer uses C++14 aggregate NSDMI that refer to the
3717 object being initialized, replace them now and don't try to
3718 preevaluate. */
3726 }
3730 }
3731 else
3734 /* If any part of the object initialization terminates by throwing an
3735 exception and a suitable deallocation function can be found, the
3736 deallocation function is called to free the memory in which the
3737 object was being constructed, after which the exception continues
3738 to propagate in the context of the new-expression. If no
3739 unambiguous matching deallocation function can be found,
3740 propagating the exception does not cause the object's memory to be
3741 freed. */
3743 {
3745 tree cleanup;
3747 /* The Standard is unclear here, but the right thing to do
3748 is to use the same method for finding deallocation
3749 functions that we use for finding allocation functions. */
3750 cleanup = (build_op_delete_call
3752 alloc_node,
3753 size,
3754 globally_qualified_p,
3756 alloc_fn,
3757 complain));
3760 /* Ack! First we allocate the memory. Then we set our sentry
3761 variable to true, and expand a cleanup that deletes the
3762 memory if sentry is true. Then we run the constructor, and
3763 finally clear the sentry.
3765 We need to do this because we allocate the space first, so
3766 if there are any temporaries with cleanups in the
3767 constructor args, we need this EH region to extend until
3768 end of full-expression to preserve nesting.
3770 We used to try to evaluate the args first to avoid this, but
3771 since C++17 [expr.new] says that "The invocation of the
3772 allocation function is sequenced before the evaluations of
3773 expressions in the new-initializer." */
3774 {
3782 /* CLEANUP is compiler-generated, so no diagnostics. */
3792 init_expr
3795 end));
3796 /* Likewise, this is compiler-generated. */
3798 }
3799 }
3801 /* Now build up the return value in reverse order. */
3813 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
3814 and return the call (which doesn't need to be adjusted). */
3816 else
3817 {
3819 {
3822 nullptr_node,
3823 complain);
3826 }
3828 /* Perform the allocation before anything else, so that ALLOC_NODE
3829 has been initialized before we start using it. */
3831 }
3833 /* A new-expression is never an lvalue. */
3837 }
3839 /* Generate a representation for a C++ "new" expression. *PLACEMENT
3840 is a vector of placement-new arguments (or NULL if none). If NELTS
3841 is NULL, TYPE is the type of the storage to be allocated. If NELTS
3842 is not NULL, then this is an array-new allocation; TYPE is the type
3843 of the elements in the array and NELTS is the number of elements in
3844 the array. *INIT, if non-NULL, is the initializer for the new
3845 object, or an empty vector to indicate an initializer of "()". If
3846 USE_GLOBAL_NEW is true, then the user explicitly wrote "::new"
3847 rather than just "new". This may change PLACEMENT and INIT. */
3849 tree
3852 tsubst_flags_t complain)
3853 {
3854 tree rval;
3863 /* Don't do auto deduction where it might affect mangling. */
3865 {
3868 {
3871 /* E.g. new auto(x) must have exactly one element, or
3872 a {} initializer will have one element. */
3874 {
3877 }
3878 /* For the rest, e.g. new A(1, 2, 3), create a list. */
3880 {
3882 tree t;
3885 {
3889 }
3890 }
3892 }
3893 }
3896 {
3903 use_global_new);
3908 {
3910 /* Also copy any CONSTRUCTORs in *init, since reshape_init and
3911 digest_init clobber them in place. */
3913 {
3917 }
3918 }
3924 }
3927 {
3930 {
3934 else
3936 }
3938 /* Try to determine the constant value only for the purposes
3939 of the diagnostic below but continue to use the original
3940 value and handle const folding later. */
3943 /* The expression in a noptr-new-declarator is erroneous if it's of
3944 non-class type and its value before converting to std::size_t is
3945 less than zero. ... If the expression is a constant expression,
3946 the program is ill-fomed. */
3954 }
3956 /* ``A reference cannot be created by the new operator. A reference
3957 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
3958 returned by new.'' ARM 5.3.3 */
3960 {
3963 else
3966 }
3969 {
3973 }
3975 /* P1009: Array size deduction in new-expressions. */
3978 /* If ARRAY_P, we have to deduce the array bound. For C++20 paren-init,
3979 we have to process the parenthesized-list. But don't do it for (),
3980 which is value-initialization, and INIT should stay empty. */
3982 {
3983 /* This means we have 'new T[]()'. */
3985 {
3989 }
3991 /* The C++20 'new T[](e_0, ..., e_k)' case allowed by P0960. */
3993 {
3998 /* We've squashed all the vector elements into the first one;
3999 truncate the rest. */
4001 }
4002 /* Otherwise we should have 'new T[]{e_0, ..., e_k}'. */
4004 {
4005 /* We need to reshape before deducing the bounds to handle code like
4007 struct S { int x, y; };
4008 new S[]{1, 2, 3, 4};
4010 which should deduce S[2]. But don't change ELT itself: we want to
4011 pass a list-initializer to build_new_1, even for STRING_CSTs. */
4016 }
4017 }
4019 /* The type allocated must be complete. If the new-type-id was
4020 "T[N]" then we are just checking that "T" is complete here, but
4021 that is equivalent, since the value of "N" doesn't matter. */
4030 {
4036 }
4038 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
4043 }
4044 \f
4045 static tree
4047 special_function_kind auto_delete_vec,
4050 {
4051 tree virtual_size;
4053 tree size_exp;
4055 /* Temporary variables used by the loop. */
4058 /* This is the body of the loop that implements the deletion of a
4059 single element, and moves temp variables to next elements. */
4060 tree body;
4062 /* This is the LOOP_EXPR that governs the deletion of the elements. */
4065 /* This is the thing that governs what to do after the loop has run. */
4068 /* This is the BIND_EXPR which holds the outermost iterator of the
4069 loop. It is convenient to set this variable up and test it before
4070 executing any other code in the loop.
4071 This is also the containing expression returned by this function. */
4073 tree tmp;
4075 /* We should only have 1-D arrays here. */
4086 {
4088 {
4089 auto_diagnostic_group d;
4091 "possible problem detected in invocation of "
4093 {
4096 "class-specific operator %<delete []%> will be called, "
4098 }
4099 }
4100 /* This size won't actually be used. */
4103 }
4110 {
4111 /* Make sure the destructor is callable. */
4113 {
4116 complain);
4119 }
4121 }
4123 /* The below is short by the cookie size. */
4130 virtual_size);
4147 complain);
4154 /* If one destructor throws, keep trying to clean up the rest, unless we're
4155 already in a build_vec_init cleanup. */
4157 {
4160 /* Tell honor_protect_cleanup_actions to discard this on the
4161 exceptional path. */
4163 }
4167 no_destructor:
4168 /* Delete the storage if appropriate. */
4170 {
4171 tree base_tbd;
4173 /* The below is short by the cookie size. */
4178 /* no header */
4180 else
4181 {
4182 tree cookie_size;
4186 MINUS_EXPR,
4189 cookie_size,
4190 complain);
4194 /* True size with header. */
4196 }
4203 complain);
4204 }
4210 ;
4213 else
4214 /* The delete operator must be called, even if a destructor
4215 throws. */
4221 /* Outermost wrapper: If pointer is null, punt. */
4224 /* This is a compiler generated comparison, don't emit
4225 e.g. -Wnonnull-compare warning for it. */
4233 {
4236 }
4239 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
4243 }
4245 /* Create an unnamed variable of the indicated TYPE. */
4247 tree
4249 {
4250 tree decl;
4260 }
4262 /* Create a new temporary variable of the indicated TYPE, initialized
4263 to INIT.
4265 It is not entered into current_binding_level, because that breaks
4266 things when it comes time to do final cleanups (which take place
4267 "outside" the binding contour of the function). */
4269 tree
4271 {
4272 tree decl;
4281 }
4283 /* Subroutine of build_vec_init. Returns true if assigning to an array of
4284 INNER_ELT_TYPE from INIT is trivial. */
4286 static bool
4288 {
4293 }
4295 /* Subroutine of build_vec_init: Check that the array has at least N
4296 elements. Other parameters are local variables in build_vec_init. */
4298 void
4300 {
4303 {
4305 {
4307 nelts);
4311 }
4312 /* Don't check an array new when -fno-exceptions. */
4313 }
4316 {
4317 /* Make sure the last element of the initializer is in bounds. */
4318 finish_expr_stmt
4319 (ubsan_instrument_bounds
4321 }
4322 }
4324 /* walk_tree callback to collect temporaries in an expression. */
4326 tree
4328 {
4338 }
4340 /* walk_tree callback to collect temporaries in an expression that
4341 are allocator arguments to standard library classes. */
4343 static tree
4345 {
4349 {
4352 }
4354 /* If this is a call to a constructor for a std:: class, look for
4355 a reference-to-allocator argument. */
4359 {
4362 {
4367 {
4370 {
4374 }
4375 }
4376 }
4377 }
4380 }
4382 /* If INIT initializes a standard library class, and involves a temporary
4383 std::allocator<T>, use ALLOC_OBJ for all such temporaries.
4385 Note that this can clobber the input to build_vec_init; no unsharing is
4386 done. To make this safe we use the TARGET_EXPR in all places rather than
4387 pulling out the TARGET_EXPR_SLOT.
4389 Used by build_vec_init when initializing an array of e.g. strings to reuse
4390 the same temporary allocator for all of the strings. We can do this because
4391 std::allocator has no data and the standard library doesn't care about the
4392 address of allocator objects.
4394 ??? Add an attribute to allow users to assert the same property for other
4395 classes, i.e. one object of the type is interchangeable with any other? */
4397 static void
4399 {
4403 {
4406 else
4408 }
4409 }
4411 /* `build_vec_init' returns tree structure that performs
4412 initialization of a vector of aggregate types.
4414 BASE is a reference to the vector, of ARRAY_TYPE, or a pointer
4415 to the first element, of POINTER_TYPE.
4416 MAXINDEX is the maximum index of the array (one less than the
4417 number of elements). It is only used if BASE is a pointer or
4418 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
4420 INIT is the (possibly NULL) initializer.
4422 If EXPLICIT_VALUE_INIT_P is true, then INIT must be NULL. All
4423 elements in the array are value-initialized.
4425 FROM_ARRAY is 0 if we should init everything with INIT
4426 (i.e., every element initialized from INIT).
4427 FROM_ARRAY is 1 if we should index into INIT in parallel
4428 with initialization of DECL.
4429 FROM_ARRAY is 2 if we should index into INIT in parallel,
4430 but use assignment instead of initialization. */
4432 tree
4436 tsubst_flags_t complain,
4438 {
4439 tree rval;
4442 tree iterator;
4443 /* The type of BASE. */
4445 /* The type of an element in the array. */
4447 /* The element type reached after removing all outer array
4448 types. */
4449 tree inner_elt_type;
4450 /* The type of a pointer to an element in the array. */
4451 tree ptype;
4452 tree stmt_expr;
4453 tree compound_stmt;
4475 /* Look through the TARGET_EXPR around a compound literal. */
4487 {
4491 {
4494 }
4495 }
4497 /* from_array doesn't apply to initialization from CONSTRUCTOR. */
4501 /* If we have a braced-init-list or string constant, make sure that the array
4502 is big enough for all the initializers. */
4518 || (same_type_ignoring_top_level_qualifiers_p
4520 /* Don't do this if the CONSTRUCTOR might contain something
4521 that might throw and require us to clean up. */
4525 {
4526 /* Do non-default initialization of trivial arrays resulting from
4527 brace-enclosed initializers. In this case, digest_init and
4528 store_constructor will handle the semantics for us. */
4534 }
4540 {
4546 }
4547 else
4551 {
4552 /* Shortcut zero element case to avoid unneeded constructor synthesis. */
4556 }
4558 /* The code we are generating looks like:
4559 ({
4560 T* t1 = (T*) base;
4561 T* rval = t1;
4562 ptrdiff_t iterator = maxindex;
4563 try {
4564 for (; iterator != -1; --iterator) {
4565 ... initialize *t1 ...
4566 ++t1;
4567 }
4568 } catch (...) {
4569 ... destroy elements that were constructed ...
4570 }
4571 rval;
4572 })
4574 We can omit the try and catch blocks if we know that the
4575 initialization will never throw an exception, or if the array
4576 elements do not have destructors. We can omit the loop completely if
4577 the elements of the array do not have constructors.
4579 We actually wrap the entire body of the above in a STMT_EXPR, for
4580 tidiness.
4582 When copying from array to another, when the array elements have
4583 only trivial copy constructors, we should use __builtin_memcpy
4584 rather than generating a loop. That way, we could take advantage
4585 of whatever cleverness the back end has for dealing with copies
4586 of blocks of memory. */
4597 /* If initializing one array from another, initialize element by
4598 element. We rely upon the below calls to do the argument
4599 checking. Evaluate the initializer before entering the try block. */
4601 {
4610 }
4612 /* Protect the entire array initialization so that we can destroy
4613 the partially constructed array if an exception is thrown.
4614 But don't do this if we're assigning. */
4617 {
4618 tree e;
4621 complain);
4623 /* Flatten multi-dimensional array since build_vec_delete only
4624 expects one-dimensional array. */
4628 /* Avoid mixing signed and unsigned. */
4631 complain);
4642 /* Since we push this cleanup before doing any initialization, cleanups
4643 for any temporaries in the initialization are naturally within our
4644 cleanup region, so we don't want wrap_temporary_cleanups to do
4645 anything for arrays. But if the array is a subobject, we need to
4646 tell split_nonconstant_init how to turn off this cleanup in favor of
4647 the cleanup for the complete object. */
4650 }
4652 /* Should we try to create a constant initializer? */
4656 : (type_has_constexpr_default_constructor
4662 /* If we're initializing a static array, we want to do static
4663 initialization of any elements with constant initializers even if
4664 some are non-constant. */
4670 /* Skip over the handling of non-empty init lists. */
4673 /* Maybe pull out constant value when from_array? */
4676 {
4677 /* Do non-default initialization of non-trivial arrays resulting from
4678 brace-enclosed initializers. */
4681 /* If the constructor already has the array type, it's been through
4682 digest_init, so we shouldn't try to do anything more. */
4695 {
4697 tree one_init;
4699 num_initialized_elts++;
4701 /* We need to see sub-array TARGET_EXPR before cp_fold_r so we can
4702 handle cleanup flags properly. */
4709 cleanup_flags);
4712 else
4718 {
4723 {
4727 else
4729 }
4730 else
4731 {
4733 {
4738 }
4740 }
4741 }
4744 {
4745 /* Only create one std::allocator temporary. */
4748 }
4751 complain);
4754 else
4758 complain);
4761 else
4763 }
4765 /* Any elements without explicit initializers get T{}. */
4767 }
4769 {
4770 /* Check that the array is at least as long as the string. */
4777 /* Copy the string to the first part of the array. */
4783 /* Adjust the counter and pointer. */
4792 /* And set the rest of the array to NUL. */
4795 }
4797 {
4802 {
4806 }
4807 }
4809 /* Now, default-initialize any remaining elements. We don't need to
4810 do that if a) the type does not need constructing, or b) we've
4811 already initialized all the elements.
4813 We do need to keep going if we're copying an array. */
4818 /* With a constexpr default constructor, which we checked for when
4819 setting try_const above, default-initialization is equivalent to
4820 value-initialization, and build_value_init gives us something more
4821 friendly to maybe_constant_init. Except in C++20 and up a constexpr
4822 constructor need not initialize all the members. */
4827 && (num_initialized_elts
4829 {
4830 /* If the ITERATOR is lesser or equal to -1, then we don't have to loop;
4831 we've already initialized all the elements. */
4832 tree for_stmt;
4833 tree elt_init;
4834 tree to;
4841 /* We used to pass this decrement to finish_for_expr; now we add it to
4842 elt_init below so it's part of the same full-expression as the
4843 initialization, and thus happens before any potentially throwing
4844 temporary cleanups. */
4846 complain);
4851 /* If the initializer is {}, then all elements are initialized from T{}.
4852 But for non-classes, that's the same as value-initialization. */
4854 {
4856 {
4858 }
4859 else
4860 {
4863 }
4864 }
4867 {
4868 tree from;
4871 {
4877 }
4878 else
4891 complain);
4892 else
4894 }
4896 {
4898 {
4903 }
4904 else
4907 explicit_value_init_p,
4909 }
4911 {
4915 }
4916 else
4917 {
4921 else
4922 {
4925 complain);
4927 ? error_mark_node
4929 }
4930 }
4936 {
4937 /* FIXME refs to earlier elts */
4940 {
4942 /* Don't fill the CONSTRUCTOR with zeros. */
4946 }
4947 else
4948 {
4952 else
4954 }
4957 {
4960 {
4966 }
4967 }
4968 }
4970 /* [class.temporary]: "There are three contexts in which temporaries are
4971 destroyed at a different point than the end of the full-
4972 expression. The first context is when a default constructor is called
4973 to initialize an element of an array with no corresponding
4974 initializer. The second context is when a copy constructor is called
4975 to copy an element of an array while the entire array is copied. In
4976 either case, if the constructor has one or more default arguments, the
4977 destruction of every temporary created in a default argument is
4978 sequenced before the construction of the next array element, if any."
4980 So, for this loop, statements are full-expressions. */
4984 else
4990 complain));
4993 complain));
4996 }
4998 /* The value of the array initialization is the array itself, RVAL
4999 is a pointer to the first element. */
5010 {
5012 {
5015 }
5018 else
5020 }
5022 /* Now make the result have the correct type. */
5024 {
5028 }
5031 }
5033 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
5034 build_delete. */
5036 static tree
5038 tsubst_flags_t complain)
5039 {
5040 tree name;
5042 {
5057 }
5062 flags,
5063 complain);
5064 }
5066 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
5067 ADDR is an expression which yields the store to be destroyed.
5068 AUTO_DELETE is the name of the destructor to call, i.e., either
5069 sfk_complete_destructor, sfk_base_destructor, or
5070 sfk_deleting_destructor.
5072 FLAGS is the logical disjunction of zero or more LOOKUP_
5073 flags. See cp-tree.h for more info. */
5075 tree
5077 special_function_kind auto_delete,
5079 {
5080 tree expr;
5087 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
5088 set to `error_mark_node' before it gets properly cleaned up. */
5096 {
5098 {
5102 }
5105 }
5111 {
5114 /* We don't want to warn about delete of void*, only other
5115 incomplete types. Deleting other incomplete types
5116 invokes undefined behavior, but it is not ill-formed, so
5117 compile to something that would even do The Right Thing
5118 (TM) should the type have a trivial dtor and no delete
5119 operator. */
5121 {
5129 {
5131 {
5132 auto_diagnostic_group d;
5134 "possible problem detected in invocation of "
5136 {
5139 "neither the destructor nor the class-specific "
5140 "%<operator delete%> will be called, even if "
5142 }
5143 }
5144 }
5148 {
5151 {
5154 "deleting object of abstract class type %qT"
5155 " which has non-virtual destructor"
5157 else
5159 "deleting object of polymorphic class type %qT"
5160 " which has non-virtual destructor"
5162 }
5163 }
5164 }
5166 /* Throw away const and volatile on target type of addr. */
5168 }
5169 else
5170 {
5171 /* Don't check PROTECT here; leave that decision to the
5172 destructor. If the destructor is accessible, call it,
5173 else report error. */
5179 }
5182 /* We will use ADDR multiple times so we must save it. */
5187 {
5191 }
5198 {
5199 /* Leave do_delete null. */
5200 }
5201 /* For `::delete x', we must not use the deleting destructor
5202 since then we would not be sure to get the global `operator
5203 delete'. */
5205 {
5207 /* Delete the object. */
5209 head,
5214 complain);
5215 /* Otherwise, treat this like a complete object destructor
5216 call. */
5218 }
5219 /* If the destructor is non-virtual, there is no deleting
5220 variant. Instead, we must explicitly call the appropriate
5221 `operator delete' here. */
5223 {
5224 /* Build the call. */
5226 addr,
5231 complain);
5232 /* Call the complete object destructor. */
5235 {
5238 }
5239 }
5241 {
5242 /* Make sure we have access to the member op delete, even though
5243 we'll actually be calling it from the destructor. */
5248 complain);
5249 }
5252 /* The operator delete will call the destructor. */
5257 else
5263 {
5266 }
5274 /* The delete operator must be called, regardless of whether
5275 the destructor throws.
5277 [expr.delete]/7 The deallocation function is called
5278 regardless of whether the destructor for the object or some
5279 element of the array throws an exception. */
5282 /* We need to calculate this before the dtor changes the vptr. */
5286 /* Handle deleting a null pointer. */
5294 /* This is a compiler generated comparison, don't emit
5295 e.g. -Wnonnull-compare warning for it. */
5304 }
5306 /* At the beginning of a destructor, push cleanups that will call the
5307 destructors for our base classes and members.
5309 Called from begin_destructor_body. */
5311 void
5313 {
5316 tree member;
5317 tree expr;
5320 /* Run destructors for all virtual baseclasses. */
5323 {
5324 tree cond = (condition_conversion
5326 current_in_charge_parm,
5327 integer_two_node)));
5329 /* The CLASSTYPE_VBASECLASSES vector is in initialization
5330 order, which is also the right order for pushing cleanups. */
5333 {
5335 {
5337 base_dtor_identifier,
5338 NULL,
5339 base_binfo,
5340 (LOOKUP_NORMAL
5342 tf_warning_or_error);
5344 {
5348 }
5349 }
5350 }
5351 }
5353 /* Take care of the remaining baseclasses. */
5356 {
5362 base_dtor_identifier,
5365 tf_warning_or_error);
5368 }
5370 /* Don't automatically destroy union members. */
5376 {
5385 {
5386 tree this_member = (build_class_member_access_expr
5390 tf_warning_or_error));
5392 sfk_complete_destructor,
5397 }
5398 }
5399 }
5401 /* Build a C++ vector delete expression.
5402 MAXINDEX is the number of elements to be deleted.
5403 ELT_SIZE is the nominal size of each element in the vector.
5404 BASE is the expression that should yield the store to be deleted.
5405 This function expands (or synthesizes) these calls itself.
5406 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
5408 This also calls delete for virtual baseclasses of elements of the vector.
5410 Update: MAXINDEX is no longer needed. The size can be extracted from the
5411 start of the vector for pointers, and from the type for arrays. We still
5412 use MAXINDEX for arrays because it happens to already have one of the
5413 values we'd have to extract. (We could use MAXINDEX with pointers to
5414 confirm the size, and trap if the numbers differ; not clear that it'd
5415 be worth bothering.) */
5417 tree
5419 special_function_kind auto_delete_vec,
5421 {
5422 tree type;
5423 tree rval;
5429 {
5430 /* Step back one from start of vector, and read dimension. */
5431 tree cookie_addr;
5436 {
5439 }
5444 cookie_addr);
5446 }
5448 {
5449 /* Get the total number of things in the array, maxindex is a
5450 bad name. */
5457 {
5460 }
5461 }
5462 else
5463 {
5468 }
5477 }