| blob | 9e6e3aff779158ffd9e86b90aa0398e2bc5194fa |
1 /* Handle initialization things in C++.
2 Copyright (C) 1987-2017 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. */
54 /* We are about to generate some complex initialization code.
55 Conceptually, it is all a single expression. However, we may want
56 to include conditionals, loops, and other such statement-level
57 constructs. Therefore, we build the initialization code inside a
58 statement-expression. This function starts such an expression.
59 STMT_EXPR_P and COMPOUND_STMT_P are filled in by this function;
60 pass them back to finish_init_stmts when the expression is
61 complete. */
63 static bool
65 {
72 }
74 /* Finish out the statement-expression begun by the previous call to
75 begin_init_stmts. Returns the statement-expression itself. */
77 static tree
79 {
87 }
89 /* Constructors */
91 /* Called from initialize_vtbl_ptrs via dfs_walk. BINFO is the base
92 which we want to initialize the vtable pointer for, DATA is
93 TREE_LIST whose TREE_VALUE is the this ptr expression. */
95 static tree
97 {
102 {
106 tf_warning_or_error);
109 }
112 }
114 /* Initialize all the vtable pointers in the object pointed to by
115 ADDR. */
117 void
119 {
120 tree list;
121 tree type;
126 /* Walk through the hierarchy, initializing the vptr in each base
127 class. We do these in pre-order because we can't find the virtual
128 bases for a class until we've initialized the vtbl for that
129 class. */
131 }
133 /* Return an expression for the zero-initialization of an object with
134 type T. This expression will either be a constant (in the case
135 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
136 aggregate), or NULL (in the case that T does not require
137 initialization). In either case, the value can be used as
138 DECL_INITIAL for a decl of the indicated TYPE; it is a valid static
139 initializer. If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS
140 is the number of elements in the array. If STATIC_STORAGE_P is
141 TRUE, initializers are only generated for entities for which
142 zero-initialization does not simply mean filling the storage with
143 zero bytes. FIELD_SIZE, if non-NULL, is the bit size of the field,
144 subfields with bit positions at or above that bit size shouldn't
145 be added. Note that this only works when the result is assigned
146 to a base COMPONENT_REF; if we only have a pointer to the base subobject,
147 expand_assignment will end up clearing the full size of TYPE. */
149 static tree
151 tree field_size)
152 {
155 /* [dcl.init]
157 To zero-initialize an object of type T means:
159 -- if T is a scalar type, the storage is set to the value of zero
160 converted to T.
162 -- if T is a non-union class type, the storage for each nonstatic
163 data member and each base-class subobject is zero-initialized.
165 -- if T is a union type, the storage for its first data member is
166 zero-initialized.
168 -- if T is an array type, the storage for each element is
169 zero-initialized.
171 -- if T is a reference type, no initialization is performed. */
176 ;
178 /* In order to save space, we do not explicitly build initializers
179 for items that do not need them. GCC's semantics are that
180 items with static storage duration that are not otherwise
181 initialized are initialized to zero. */
182 ;
188 {
189 tree field;
192 /* Iterate over the fields, building initializations. */
194 {
201 /* Don't add virtual bases for base classes if they are beyond
202 the size of the current field, that means it is present
203 somewhere else in the object. */
205 {
210 }
212 /* Note that for class types there will be FIELD_DECLs
213 corresponding to base classes as well. Thus, iterating
214 over TYPE_FIELDs will result in correct initialization of
215 all of the subobjects. */
217 {
218 tree new_field_size
225 static_storage_p,
226 new_field_size);
229 }
231 /* For unions, only the first field is initialized. */
234 }
236 /* Build a constructor to contain the initializations. */
238 }
240 {
241 tree max_index;
244 /* Iterate over the array elements, building initializations. */
249 else
252 /* If we have an error_mark here, we should just return error mark
253 as we don't know the size of the array yet. */
258 /* A zero-sized array, which is accepted as an extension, will
259 have an upper bound of -1. */
261 {
262 constructor_elt ce;
264 /* If this is a one element array, we just use a regular init. */
267 else
269 max_index);
275 {
278 }
279 }
281 /* Build a constructor to contain the initializations. */
283 }
286 else
289 /* In all cases, the initializer is a constant. */
294 }
296 /* Return an expression for the zero-initialization of an object with
297 type T. This expression will either be a constant (in the case
298 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
299 aggregate), or NULL (in the case that T does not require
300 initialization). In either case, the value can be used as
301 DECL_INITIAL for a decl of the indicated TYPE; it is a valid static
302 initializer. If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS
303 is the number of elements in the array. If STATIC_STORAGE_P is
304 TRUE, initializers are only generated for entities for which
305 zero-initialization does not simply mean filling the storage with
306 zero bytes. */
308 tree
310 {
312 }
314 /* Return a suitable initializer for value-initializing an object of type
315 TYPE, as described in [dcl.init]. */
317 tree
319 {
320 /* [dcl.init]
322 To value-initialize an object of type T means:
324 - if T is a class type (clause 9) with either no default constructor
325 (12.1) or a default constructor that is user-provided or deleted,
326 then the object is default-initialized;
328 - if T is a (possibly cv-qualified) class type without a user-provided
329 or deleted default constructor, then the object is zero-initialized
330 and the semantic constraints for default-initialization are checked,
331 and if T has a non-trivial default constructor, the object is
332 default-initialized;
334 - if T is an array type, then each element is value-initialized;
336 - otherwise, the object is zero-initialized.
338 A program that calls for default-initialization or
339 value-initialization of an entity of reference type is ill-formed. */
341 /* The AGGR_INIT_EXPR tweaking below breaks in templates. */
347 {
348 tree ctor =
351 complain);
361 {
362 /* This is a class that needs constructing, but doesn't have
363 a user-provided constructor. So we need to zero-initialize
364 the object and then call the implicitly defined ctor.
365 This will be handled in simplify_aggr_init_expr. */
368 }
369 }
371 /* Discard any access checking during subobject initialization;
372 the checks are implied by the call to the ctor which we have
373 verified is OK (cpp0x/defaulted46.C). */
378 }
380 /* Like build_value_init, but don't call the constructor for TYPE. Used
381 for base initializers. */
383 tree
385 {
387 {
391 }
392 /* FIXME the class and array cases should just use digest_init once it is
393 SFINAE-enabled. */
395 {
400 {
401 tree field;
404 /* Iterate over the fields, building initializations. */
406 {
417 /* We could skip vfields and fields of types with
418 user-defined constructors, but I think that won't improve
419 performance at all; it should be simpler in general just
420 to zero out the entire object than try to only zero the
421 bits that actually need it. */
423 /* Note that for class types there will be FIELD_DECLs
424 corresponding to base classes as well. Thus, iterating
425 over TYPE_FIELDs will result in correct initialization of
426 all of the subobjects. */
435 /* We shouldn't have gotten here for anything that would need
436 non-trivial initialization, and gimplify_init_ctor_preeval
437 would need to be fixed to allow it. */
440 }
442 /* Build a constructor to contain the zero- initializations. */
444 }
445 }
447 {
450 /* Iterate over the array elements, building initializations. */
453 /* If we have an error_mark here, we should just return error mark
454 as we don't know the size of the array yet. */
456 {
459 type);
461 }
464 /* A zero-sized array, which is accepted as an extension, will
465 have an upper bound of -1. */
467 {
468 constructor_elt ce;
470 /* If this is a one element array, we just use a regular init. */
473 else
484 /* We shouldn't have gotten here for anything that would need
485 non-trivial initialization, and gimplify_init_ctor_preeval
486 would need to be fixed to allow it. */
489 }
491 /* Build a constructor to contain the initializations. */
493 }
495 {
499 }
501 {
505 }
508 }
510 /* Initialize current class with INIT, a TREE_LIST of
511 arguments for a target constructor. If TREE_LIST is void_type_node,
512 an empty initializer list was given. */
514 static void
516 {
522 tf_warning_or_error));
524 {
526 LOOKUP_NORMAL
527 |LOOKUP_NONVIRTUAL
533 }
534 }
536 /* Return the non-static data initializer for FIELD_DECL MEMBER. */
540 tree
542 {
543 tree init;
548 {
550 location_t expr_loc
557 /* Check recursive instantiation. */
559 {
564 }
565 else
566 {
579 /* Do deferred instantiation of the NSDMI. */
580 init = (tsubst_copy_and_build
591 {
595 }
599 }
600 }
601 else
605 {
607 {
612 }
614 }
617 {
620 }
621 else
622 {
623 /* Use a PLACEHOLDER_EXPR when we don't have a 'this' parameter to
624 refer to; constexpr evaluation knows what to do with it. */
627 }
629 /* Strip redundant TARGET_EXPR so we don't need to remap it, and
630 so the aggregate init code below will see a CONSTRUCTOR. */
636 /* Now put it back so C++17 copy elision works. */
642 }
644 /* Diagnose the flexible array MEMBER if its INITializer is non-null
645 and return true if so. Otherwise return false. */
647 bool
649 {
657 /* Point at the flexible array member declaration if it's initialized
658 in-class, and at the ctor if it's initialized in a ctor member
659 initializer list. */
660 location_t loc;
662 || !current_function_decl
665 else
670 }
672 /* Initialize MEMBER, a FIELD_DECL, with INIT, a TREE_LIST of
673 arguments. If TREE_LIST is void_type_node, an empty initializer
674 list was given; if NULL_TREE no initializer was given. */
676 static void
678 {
679 tree decl;
682 /* Use the non-static data member initializer if there was no
683 mem-initializer for this field. */
690 /* Effective C++ rule 12 requires that all data members be
691 initialized. */
695 member);
697 /* Get an lvalue for the data member. */
701 tf_warning_or_error);
707 {
709 /* Handle references. */
716 member);
717 }
720 {
721 /* mem() means value-initialization. */
723 {
727 }
728 else
729 {
735 }
736 }
737 /* Deal with this here, as we will get confused if we try to call the
738 assignment op for an anonymous union. This can happen in a
739 synthesized copy constructor. */
741 {
743 {
746 }
747 }
750 /* Pre-digested NSDMI. */
753 /* { } mem-initializer. */
758 {
759 /* With references and list-initialization, we need to deal with
760 extending temporary lifetimes. 12.2p5: "A temporary bound to a
761 reference member in a constructor’s ctor-initializer (12.6.2)
762 persists until the constructor exits." */
767 tf_warning_or_error);
769 {
774 }
777 /* A FIELD_DECL doesn't really have a suitable lifetime, but
778 make_temporary_var_for_ref_to_temp will treat it as automatic and
779 set_up_extended_ref_temp wants to use the decl in a warning. */
789 }
792 {
794 {
796 {
797 /* Check to make sure the member initializer is valid and
798 something like a CONSTRUCTOR in: T a[] = { 1, 2 } and
799 if it isn't, return early to avoid triggering another
800 error below. */
806 else
811 }
815 {
817 {
818 /* Initialize the array only if it's not a flexible
819 array member (i.e., if it has an upper bound). */
823 }
824 }
825 else
827 }
828 else
829 {
836 {
837 /* TYPE_NEEDS_CONSTRUCTING can be set just because we have a
838 vtable; still give this diagnostic. */
843 }
845 tf_warning_or_error));
846 }
847 }
848 else
849 {
851 {
852 tree core_type;
853 /* member traversal: note it leaves init NULL */
855 {
860 }
862 {
867 }
877 }
879 /* There was an explicit member initialization. Do some work
880 in that case. */
882 tf_warning_or_error);
884 /* Reject a member initializer for a flexible array member. */
888 tf_warning_or_error));
889 }
892 {
893 tree expr;
898 tf_warning_or_error);
901 tf_warning_or_error);
906 }
907 }
909 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
910 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
912 static tree
914 {
915 tree fields;
917 /* Note whether or not T is a union. */
922 {
923 tree fieldtype;
925 /* Skip CONST_DECLs for enumeration constants and so forth. */
931 /* For an anonymous struct or union, we must recursively
932 consider the fields of the anonymous type. They can be
933 directly initialized from the constructor. */
935 {
936 /* Add this field itself. Synthesized copy constructors
937 initialize the entire aggregate. */
939 /* And now add the fields in the anonymous aggregate. */
942 }
943 /* Add this field. */
946 }
949 }
951 /* Return the innermost aggregate scope for FIELD, whether that is
952 the enclosing class or an anonymous aggregate within it. */
954 static tree
956 {
959 else
961 }
963 /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives
964 a FIELD_DECL or BINFO in T that needs initialization. The
965 TREE_VALUE gives the initializer, or list of initializer arguments.
967 Return a TREE_LIST containing all of the initializations required
968 for T, in the order in which they should be performed. The output
969 list has the same format as the input. */
971 static tree
973 {
974 tree init;
976 tree sorted_inits;
977 tree next_subobject;
982 /* Build up a list of initializations. The TREE_PURPOSE of entry
983 will be the subobject (a FIELD_DECL or BINFO) to initialize. The
984 TREE_VALUE will be the constructor arguments, or NULL if no
985 explicit initialization was provided. */
988 /* Process the virtual bases. */
993 /* Process the direct bases. */
999 /* Process the non-static data members. */
1001 /* Reverse the entire list of initializations, so that they are in
1002 the order that they will actually be performed. */
1005 /* If the user presented the initializers in an order different from
1006 that in which they will actually occur, we issue a warning. Keep
1007 track of the next subobject which can be explicitly initialized
1008 without issuing a warning. */
1011 /* Go through the explicit initializers, filling in TREE_PURPOSE in
1012 the SORTED_INITS. */
1014 {
1015 tree subobject;
1016 tree subobject_init;
1020 /* If the explicit initializers are in sorted order, then
1021 SUBOBJECT will be NEXT_SUBOBJECT, or something following
1022 it. */
1024 subobject_init;
1029 /* Issue a warning if the explicit initializer order does not
1030 match that which will actually occur.
1031 ??? Are all these on the correct lines? */
1033 {
1038 else
1044 else
1048 }
1050 /* Look again, from the beginning of the list. */
1052 {
1056 }
1058 /* It is invalid to initialize the same subobject more than
1059 once. */
1061 {
1065 subobject);
1066 else
1069 subobject);
1070 }
1072 /* Record the initialization. */
1075 }
1077 /* [class.base.init]
1079 If a ctor-initializer specifies more than one mem-initializer for
1080 multiple members of the same union (including members of
1081 anonymous unions), the ctor-initializer is ill-formed.
1083 Here we also splice out uninitialized union members. */
1085 {
1089 {
1090 tree field;
1091 tree ctx;
1097 /* Skip base classes. */
1101 /* If this is an anonymous aggregate with no explicit initializer,
1102 splice it out. */
1106 /* See if this field is a member of a union, or a member of a
1107 structure contained in a union, etc. */
1110 /* If this field is not a member of a union, skip it. */
1115 /* If this union member has no explicit initializer and no NSDMI,
1116 splice it out. */
1119 else
1122 /* It's only an error if we have two initializers for the same
1123 union type. */
1125 {
1128 }
1130 /* See if LAST_FIELD and the field initialized by INIT are
1131 members of the same union (or the union itself). If so, there's
1132 a problem, unless they're actually members of the same structure
1133 which is itself a member of a union. For example, given:
1135 union { struct { int i; int j; }; };
1137 initializing both `i' and `j' makes sense. */
1138 ctx = common_enclosing_class
1144 {
1145 /* A mem-initializer hides an NSDMI. */
1150 else
1151 {
1154 ctx);
1156 }
1157 }
1161 next:
1164 splice:
1167 }
1168 }
1171 }
1173 /* Callback for cp_walk_tree to mark all PARM_DECLs in a tree as read. */
1175 static tree
1177 {
1182 }
1184 /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS
1185 is a TREE_LIST giving the explicit mem-initializer-list for the
1186 constructor. The TREE_PURPOSE of each entry is a subobject (a
1187 FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE
1188 is a TREE_LIST giving the arguments to the constructor or
1189 void_type_node for an empty list of arguments. */
1191 void
1193 {
1196 /* We will already have issued an error message about the fact that
1197 the type is incomplete. */
1204 {
1205 /* Delegating constructor. */
1209 }
1215 /* Sort the mem-initializers into the order in which the
1216 initializations should be performed. */
1221 /* Initialize base classes. */
1225 {
1229 /* We already have issued an error message. */
1233 /* Suppress access control when calling the inherited ctor. */
1235 && flag_new_inheriting_ctors
1241 {
1242 /* If these initializations are taking place in a copy constructor,
1243 the base class should probably be explicitly initialized if there
1244 is a user-defined constructor in the base class (other than the
1245 default constructor, which will be called anyway). */
1253 }
1255 /* Initialize the base. */
1257 {
1258 tree base_addr;
1264 tf_warning_or_error),
1265 arguments,
1266 flags,
1267 tf_warning_or_error);
1269 }
1271 /* C++14 DR1658 Means we do not have to construct vbases of
1272 abstract classes. */
1274 else
1275 /* When not constructing vbases of abstract classes, at least mark
1276 the arguments expressions as read to avoid
1277 -Wunused-but-set-parameter false positives. */
1282 }
1285 /* Initialize the vptrs. */
1288 /* Initialize the data members. */
1290 {
1294 }
1295 }
1297 /* Returns the address of the vtable (i.e., the value that should be
1298 assigned to the vptr) for BINFO. */
1300 tree
1302 {
1304 tree vtbl;
1307 /* If this is a virtual primary base, then the vtable we want to store
1308 is that for the base this is being used as the primary base of. We
1309 can't simply skip the initialization, because we may be expanding the
1310 inits of a subobject constructor where the virtual base layout
1311 can be different. */
1315 /* Figure out what vtable BINFO's vtable is based on, and mark it as
1316 used. */
1320 /* Now compute the address to use when initializing the vptr. */
1326 }
1328 /* This code sets up the virtual function tables appropriate for
1329 the pointer DECL. It is a one-ply initialization.
1331 BINFO is the exact type that DECL is supposed to be. In
1332 multiple inheritance, this might mean "C's A" if C : A, B. */
1334 static void
1336 {
1338 tree vtt_index;
1340 /* Compute the initializer for vptr. */
1343 /* We may get this vptr from a VTT, if this is a subobject
1344 constructor or subobject destructor. */
1347 {
1348 tree vtbl2;
1349 tree vtt_parm;
1351 /* Compute the value to use, when there's a VTT. */
1357 /* The actual initializer is the VTT value only in the subobject
1358 constructor. In maybe_clone_body we'll substitute NULL for
1359 the vtt_parm in the case of the non-subobject constructor. */
1361 }
1363 /* Compute the location of the vtpr. */
1365 tf_warning_or_error),
1369 /* Assign the vtable to the vptr. */
1373 }
1375 /* If an exception is thrown in a constructor, those base classes already
1376 constructed must be destroyed. This function creates the cleanup
1377 for BINFO, which has just been constructed. If FLAG is non-NULL,
1378 it is a DECL which is nonzero when this base needs to be
1379 destroyed. */
1381 static void
1383 {
1384 tree expr;
1389 /* Call the destructor. */
1391 base_dtor_identifier,
1392 NULL,
1393 binfo,
1395 tf_warning_or_error);
1407 }
1409 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its
1410 constructor. */
1412 static void
1414 {
1415 tree inner_if_stmt;
1416 tree exp;
1417 tree flag;
1419 /* If there are virtual base classes with destructors, we need to
1420 emit cleanups to destroy them if an exception is thrown during
1421 the construction process. These exception regions (i.e., the
1422 period during which the cleanups must occur) begin from the time
1423 the construction is complete to the end of the function. If we
1424 create a conditional block in which to initialize the
1425 base-classes, then the cleanup region for the virtual base begins
1426 inside a block, and ends outside of that block. This situation
1427 confuses the sjlj exception-handling code. Therefore, we do not
1428 create a single conditional block, but one for each
1429 initialization. (That way the cleanup regions always begin
1430 in the outer block.) We trust the back end to figure out
1431 that the FLAG will not change across initializations, and
1432 avoid doing multiple tests. */
1437 /* Compute the location of the virtual base. If we're
1438 constructing virtual bases, then we must be the most derived
1439 class. Therefore, we don't have to look up the virtual base;
1440 we already know where it is. */
1449 }
1451 /* Find the context in which this FIELD can be initialized. */
1453 static tree
1455 {
1458 /* Anonymous union members can be initialized in the first enclosing
1459 non-anonymous union context. */
1463 }
1465 /* Function to give error message if member initialization specification
1466 is erroneous. FIELD is the member we decided to initialize.
1467 TYPE is the type for which the initialization is being performed.
1468 FIELD must be a member of TYPE.
1470 MEMBER_NAME is the name of the member. */
1472 static int
1474 {
1478 {
1480 member_name);
1482 }
1484 {
1487 field);
1489 }
1491 {
1495 }
1497 {
1499 member_name);
1501 }
1504 }
1506 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it
1507 is a _TYPE node or TYPE_DECL which names a base for that type.
1508 Check the validity of NAME, and return either the base _TYPE, base
1509 binfo, or the FIELD_DECL of the member. If NAME is invalid, return
1510 NULL_TREE and issue a diagnostic.
1512 An old style unnamed direct single base construction is permitted,
1513 where NAME is NULL. */
1515 tree
1517 {
1518 tree basetype;
1519 tree field;
1525 {
1526 /* This is an obsolete unnamed base class initializer. The
1527 parser will already have warned about its use. */
1529 {
1532 current_class_type);
1535 basetype = BINFO_TYPE
1540 current_class_type);
1542 }
1543 }
1545 {
1548 }
1551 else
1555 {
1556 tree class_binfo;
1557 tree direct_binfo;
1558 tree virtual_binfo;
1569 /* Look for a direct base. */
1574 /* Look for a virtual base -- unless the direct base is itself
1575 virtual. */
1579 /* [class.base.init]
1581 If a mem-initializer-id is ambiguous because it designates
1582 both a direct non-virtual base class and an inherited virtual
1583 base class, the mem-initializer is ill-formed. */
1585 {
1587 basetype);
1589 }
1592 {
1596 else
1600 }
1603 }
1604 else
1605 {
1608 else
1613 }
1616 }
1618 /* This is like `expand_member_init', only it stores one aggregate
1619 value into another.
1621 INIT comes in two flavors: it is either a value which
1622 is to be stored in EXP, or it is a parameter list
1623 to go to a constructor, which will operate on EXP.
1624 If INIT is not a parameter list for a constructor, then set
1625 LOOKUP_ONLYCONVERTING.
1626 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1627 the initializer, if FLAGS is 0, then it is the (init) form.
1628 If `init' is a CONSTRUCTOR, then we emit a warning message,
1629 explaining that such initializations are invalid.
1631 If INIT resolves to a CALL_EXPR which happens to return
1632 something of the type we are looking for, then we know
1633 that we can safely use that call to perform the
1634 initialization.
1636 The virtual function table pointer cannot be set up here, because
1637 we do not really know its type.
1639 This never calls operator=().
1641 When initializing, nothing is CONST.
1643 A default copy constructor may have to be used to perform the
1644 initialization.
1646 A constructor or a conversion operator may have to be used to
1647 perform the initialization, but not both, as it would be ambiguous. */
1649 tree
1651 {
1652 tree stmt_expr;
1653 tree compound_stmt;
1663 location_t init_loc = (init
1671 {
1676 {
1680 {
1681 /* Wrap the initializer in a CONSTRUCTOR so that build_vec_init
1682 recognizes it as direct-initialization. */
1686 }
1687 }
1688 else
1689 {
1690 /* An array may not be initialized use the parenthesized
1691 initialization form -- unless the initializer is "()". */
1693 {
1697 }
1698 /* Must arrange to initialize each element of EXP
1699 from elements of INIT. */
1709 {
1713 else
1715 }
1716 }
1720 from_array,
1721 complain);
1725 /* Restore the type of init unless it was used directly. */
1729 }
1740 /* Just know that we've seen something for this node. */
1754 }
1756 static void
1758 tsubst_flags_t complain)
1759 {
1762 /* It fails because there may not be a constructor which takes
1763 its own type as the first (or only parameter), but which does
1764 take other types via a conversion. So, if the thing initializing
1765 the expression is a unit element of type X, first try X(X&),
1766 followed by initialization by X. If neither of these work
1767 out, then look hard. */
1768 tree rval;
1771 /* If we have direct-initialization from an initializer list, pull
1772 it out of the TREE_LIST so the code below can see it. */
1775 {
1779 /* Only call reshape_init if it has not been called earlier
1780 by the callers. */
1783 }
1787 /* A brace-enclosed initializer for an aggregate. In C++0x this can
1788 happen for direct-initialization, too. */
1791 /* A CONSTRUCTOR of the target's type is a previously digested
1792 initializer, whether that happened just above or in
1793 cp_parser_late_parsing_nsdmi.
1795 A TARGET_EXPR with TARGET_EXPR_DIRECT_INIT_P or TARGET_EXPR_LIST_INIT_P
1796 set represents the whole initialization, so we shouldn't build up
1797 another ctor call. */
1804 {
1805 /* Early initialization via a TARGET_EXPR only works for
1806 complete objects. */
1813 }
1817 {
1818 /* Base subobjects should only get direct-initialization. */
1822 /* Do nothing. We hit this in two cases: Reference initialization,
1823 where we aren't initializing a real variable, so we don't want
1824 to run a new constructor; and catching an exception, where we
1825 have already built up the constructor call so we could wrap it
1827 else
1832 /* We need to protect the initialization of a catch parm with a
1833 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
1834 around the TARGET_EXPR for the copy constructor. See
1835 initialize_handler_parm. */
1836 {
1840 }
1841 else
1846 }
1851 {
1855 }
1856 else
1861 {
1862 /* Delegating constructor. */
1863 tree complete;
1864 tree base;
1867 /* Unshare the arguments for the second call. */
1870 {
1873 }
1876 complain);
1882 complain);
1885 }
1886 else
1887 {
1892 complain);
1893 }
1899 {
1902 {
1906 }
1907 }
1909 /* FIXME put back convert_to_void? */
1912 }
1914 /* This function is responsible for initializing EXP with INIT
1915 (if any).
1917 BINFO is the binfo of the type for who we are performing the
1918 initialization. For example, if W is a virtual base class of A and B,
1919 and C : A, B.
1920 If we are initializing B, then W must contain B's W vtable, whereas
1921 were we initializing C, W must contain C's W vtable.
1923 TRUE_EXP is nonzero if it is the true expression being initialized.
1924 In this case, it may be EXP, or may just contain EXP. The reason we
1925 need this is because if EXP is a base element of TRUE_EXP, we
1926 don't necessarily know by looking at EXP where its virtual
1927 baseclass fields should really be pointing. But we do know
1928 from TRUE_EXP. In constructors, we don't know anything about
1929 the value being initialized.
1931 FLAGS is just passed to `build_new_method_call'. See that function
1932 for its description. */
1934 static void
1936 tsubst_flags_t complain)
1937 {
1943 /* Use a function returning the desired type to initialize EXP for us.
1944 If the function is a constructor, and its first argument is
1945 NULL_TREE, know that it was meant for us--just slide exp on
1946 in and expand the constructor. Constructors now come
1947 as TARGET_EXPRs. */
1951 {
1953 /* If store_init_value returns NULL_TREE, the INIT has been
1954 recorded as the DECL_INITIAL for EXP. That means there's
1955 nothing more we have to do. */
1961 }
1963 /* List-initialization from {} becomes value-initialization for non-aggregate
1964 classes with default constructors. Handle this here when we're
1965 initializing a base, so protected access works. */
1967 {
1974 }
1976 /* If an explicit -- but empty -- initializer list was present,
1977 that's value-initialization. */
1979 {
1980 /* If the type has data but no user-provided ctor, we need to zero
1981 out the object. */
1984 {
1987 /* Don't clobber already initialized virtual bases. */
1990 field_size);
1993 }
1995 /* If we don't need to mess with the constructor at all,
1996 then we're done. */
2000 /* Otherwise fall through and call the constructor. */
2002 }
2004 /* We know that expand_default_init can handle everything we want
2005 at this point. */
2007 }
2009 /* Report an error if TYPE is not a user-defined, class type. If
2010 OR_ELSE is nonzero, give an error message. */
2012 int
2014 {
2019 {
2023 }
2025 }
2027 tree
2029 {
2035 else
2037 }
2039 /* Build a reference to a member of an aggregate. This is not a C++
2040 `&', but really something which can have its address taken, and
2041 then act as a pointer to member, for example TYPE :: FIELD can have
2042 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if
2043 this expression is the operand of "&".
2045 @@ Prints out lousy diagnostics for operator <typename>
2046 @@ fields.
2048 @@ This function should be rewritten and placed in search.c. */
2050 tree
2052 tsubst_flags_t complain)
2053 {
2054 tree decl;
2057 /* class templates can come in as TEMPLATE_DECLs here. */
2070 /* Callers should call mark_used before this point. */
2075 {
2079 }
2081 /* Entities other than non-static members need no further
2082 processing. */
2089 {
2093 }
2095 /* Set up BASEBINFO for member lookup. */
2098 /* A lot of this logic is now handled in lookup_member. */
2100 {
2101 /* Go from the TREE_BASELINK to the member function info. */
2105 {
2106 /* Get rid of a potential OVERLOAD around it. */
2109 /* Unique functions are handled easily. */
2111 /* For non-static member of base class, we need a special rule
2112 for access checking [class.protected]:
2114 If the access is to form a pointer to member, the
2115 nested-name-specifier shall name the derived class
2116 (or any class derived from that class). */
2121 complain);
2122 else
2124 complain);
2130 }
2131 else
2133 }
2135 {
2136 /* We need additional test besides the one in
2137 check_accessibility_of_qualified_id in case it is
2138 a pointer to non-static member. */
2140 complain))
2142 }
2145 {
2146 /* If MEMBER is non-static, then the program has fallen afoul of
2147 [expr.prim]:
2149 An id-expression that denotes a nonstatic data member or
2150 nonstatic member function of a class can only be used:
2152 -- as part of a class member access (_expr.ref_) in which the
2153 object-expression refers to the member's class or a class
2154 derived from that class, or
2156 -- to form a pointer to member (_expr.unary.op_), or
2158 -- in the body of a nonstatic member function of that class or
2159 of a class derived from that class (_class.mfct.nonstatic_), or
2161 -- in a mem-initializer for a constructor for that class or for
2162 a class derived from that class (_class.base.init_). */
2164 {
2165 /* Build a representation of the qualified name suitable
2166 for use as the operand to "&" -- even though the "&" is
2167 not actually present. */
2169 /* In Microsoft mode, treat a non-static member function as if
2170 it were a pointer-to-member. */
2172 {
2175 }
2180 }
2182 {
2186 }
2188 }
2193 }
2195 /* If DECL is a scalar enumeration constant or variable with a
2196 constant initializer, return the initializer (or, its initializers,
2197 recursively); otherwise, return DECL. If STRICT_P, the
2198 initializer is only returned if DECL is a
2199 constant-expression. If RETURN_AGGREGATE_CST_OK_P, it is ok to
2200 return an aggregate constant. */
2202 static tree
2204 {
2209 {
2210 tree init;
2211 /* If DECL is a static data member in a template
2212 specialization, we must instantiate it here. The
2213 initializer for the static data member is not processed
2214 until needed; we need it now. */
2218 {
2221 /* Treat the error as a constant to avoid cascading errors on
2222 excessively recursive template instantiation (c++/9335). */
2224 else
2226 }
2227 /* Initializers in templates are generally expanded during
2228 instantiation, so before that for const int i(2)
2229 INIT is a TREE_LIST with the actual initializer as
2230 TREE_VALUE. */
2232 && init
2236 /* Instantiate a non-dependent initializer for user variables. We
2237 mustn't do this for the temporary for an array compound literal;
2238 trying to instatiate the initializer will keep creating new
2239 temporaries until we crash. Probably it's not useful to do it for
2240 other artificial variables, either. */
2246 || (!return_aggregate_cst_ok_p
2247 /* Unless RETURN_AGGREGATE_CST_OK_P is true, do not
2248 return an aggregate constant (of which string
2249 literals are a special case), as we do not want
2250 to make inadvertent copies of such entities, and
2251 we must be sure that their addresses are the
2252 same everywhere. */
2256 /* Don't return a CONSTRUCTOR for a variable with partial run-time
2257 initialization, since it doesn't represent the entire value. */
2261 /* If the variable has a dynamic initializer, don't use its
2262 DECL_INITIAL which doesn't reflect the real value. */
2269 }
2271 }
2273 /* If DECL is a CONST_DECL, or a constant VAR_DECL initialized by constant
2274 of integral or enumeration type, or a constexpr variable of scalar type,
2275 then return that value. These are those variables permitted in constant
2276 expressions by [5.19/1]. */
2278 tree
2280 {
2283 }
2285 /* Like scalar_constant_value, but can also return aggregate initializers. */
2287 tree
2289 {
2292 }
2294 /* A more relaxed version of scalar_constant_value, used by the
2295 common C/C++ code. */
2297 tree
2299 {
2302 }
2303 \f
2304 /* Common subroutines of build_new and build_vec_delete. */
2305 \f
2306 /* Build and return a NEW_EXPR. If NELTS is non-NULL, TYPE[NELTS] is
2307 the type of the object being allocated; otherwise, it's just TYPE.
2308 INIT is the initializer, if any. USE_GLOBAL_NEW is true if the
2309 user explicitly wrote "::operator new". PLACEMENT, if non-NULL, is
2310 a vector of arguments to be provided as arguments to a placement
2311 new operator. This routine performs no semantic checks; it just
2312 creates and returns a NEW_EXPR. */
2314 static tree
2317 {
2318 tree init_list;
2319 tree new_expr;
2321 /* If INIT is NULL, the we want to store NULL_TREE in the NEW_EXPR.
2322 If INIT is not NULL, then we want to store VOID_ZERO_NODE. This
2323 permits us to distinguish the case of a missing initializer "new
2324 int" from an empty initializer "new int()". */
2329 else
2334 init_list);
2339 }
2341 /* Diagnose uninitialized const members or reference members of type
2342 TYPE. USING_NEW is used to disambiguate the diagnostic between a
2343 new expression without a new-initializer and a declaration. Returns
2344 the error count. */
2346 static int
2349 {
2350 tree field;
2357 {
2358 tree field_type;
2369 {
2372 {
2374 {
2378 else
2380 }
2381 else
2382 {
2387 else
2390 }
2393 }
2394 }
2397 {
2400 {
2402 {
2406 else
2408 }
2409 else
2410 {
2415 else
2418 }
2421 }
2422 }
2425 error_count
2428 }
2430 }
2432 int
2434 {
2436 }
2438 /* Call __cxa_bad_array_new_length to indicate that the size calculation
2439 overflowed. Pretend it returns sizetype so that it plays nicely in the
2440 COND_EXPR. */
2442 tree
2444 {
2446 {
2451 fn = push_throw_library_fn
2453 }
2456 }
2458 /* Attempt to find the initializer for field T in the initializer INIT,
2459 when non-null. Returns the initializer when successful and NULL
2460 otherwise. */
2461 static tree
2463 {
2470 /* Iterate over all top-level initializer elements. */
2472 {
2473 /* If the member T is found, return it. */
2477 /* Otherwise continue and/or recurse into nested initializers. */
2481 }
2483 }
2485 /* Attempt to verify that the argument, OPER, of a placement new expression
2486 refers to an object sufficiently large for an object of TYPE or an array
2487 of NELTS of such objects when NELTS is non-null, and issue a warning when
2488 it does not. SIZE specifies the size needed to construct the object or
2489 array and captures the result of NELTS * sizeof (TYPE). (SIZE could be
2490 greater when the array under construction requires a cookie to store
2491 NELTS. GCC's placement new expression stores the cookie when invoking
2492 a user-defined placement new operator function but not the default one.
2493 Placement new expressions with user-defined placement new operator are
2494 not diagnosed since we don't know how they use the buffer (this could
2495 be a future extension). */
2496 static void
2498 {
2501 /* The number of bytes to add to or subtract from the size of the provided
2502 buffer based on an offset into an array or an array element reference.
2503 Although intermediate results may be negative (as in a[3] - 2) the final
2504 result cannot be. */
2506 /* True when the size of the entire destination object should be used
2507 to compute the possibly optimistic estimate of the available space. */
2509 /* True when the reference to the destination buffer is an ADDR_EXPR. */
2514 /* Using a function argument or a (non-array) variable as an argument
2515 to placement new is not checked since it's unknown what it might
2516 point to. */
2522 /* Evaluate any constant expressions. */
2525 /* Handle the common case of array + offset expression when the offset
2526 is a constant. */
2528 {
2529 /* If the offset is comple-time constant, use it to compute a more
2530 accurate estimate of the size of the buffer. Since the operand
2531 of POINTER_PLUS_EXPR is represented as an unsigned type, convert
2532 it to signed first.
2533 Otherwise, use the size of the entire array as an optimistic
2534 estimate (this may lead to false negatives). */
2538 else
2544 }
2549 {
2552 }
2558 {
2559 /* Similar to the offset computed above, see if the array index
2560 is a compile-time constant. If so, and unless the offset was
2561 not a compile-time constant, use the index to determine the
2562 size of the buffer. Otherwise, use the entire array as
2563 an optimistic estimate of the size. */
2567 else
2568 {
2571 }
2574 }
2576 /* Refers to the declared object that constains the subobject referenced
2577 by OPER. When the object is initialized, makes it possible to determine
2578 the actual size of a flexible array member used as the buffer passed
2579 as OPER to placement new. */
2581 /* True when operand is a COMPONENT_REF, to distinguish flexible array
2582 members from arrays of unspecified size. */
2585 /* Descend into a struct or union to find the member whose address
2586 is being used as the argument. */
2588 {
2594 }
2600 {
2601 /* A possibly optimistic estimate of the number of bytes available
2602 in the destination buffer. */
2604 /* True when the estimate above is in fact the exact size
2605 of the destination buffer rather than an estimate. */
2608 /* Treat members of unions and members of structs uniformly, even
2609 though the size of a member of a union may be viewed as extending
2610 to the end of the union itself (it is by __builtin_object_size). */
2614 {
2615 /* Use the size of the entire array object when the expression
2616 refers to a variable or its size depends on an expression
2617 that's not a compile-time constant. */
2620 }
2623 {
2624 /* Use the size of the type of the destination buffer object
2625 as the optimistic estimate of the available space in it. */
2627 }
2629 {
2630 /* Constructing into a buffer provided by the flexible array
2631 member of a declared object (which is permitted as a G++
2632 extension). If the array member has been initialized,
2633 determine its size from the initializer. Otherwise,
2634 the array size is zero. */
2639 }
2640 else
2641 {
2642 /* Bail if neither the size of the object nor its type is known. */
2644 }
2649 {
2650 /* Avoid diagnosing flexible array members (which are accepted
2651 as an extension and diagnosed with -Wpedantic) and zero-length
2652 arrays (also an extension).
2653 Overflowing construction in one-element arrays is diagnosed
2654 only at level 2. */
2662 && !var_decl
2665 }
2667 /* The size of the buffer can only be adjusted down but not up. */
2670 /* Reduce the size of the buffer by the adjustment computed above
2671 from the offset and/or the index into the array. */
2674 else
2677 /* The minimum amount of space needed for the allocation. This
2678 is an optimistic estimate that makes it possible to detect
2679 placement new invocation for some undersize buffers but not
2680 others. */
2690 else
2691 {
2692 /* The type is a VLA. */
2694 }
2697 {
2701 exact_size ?
2702 "placement new constructing an object of type "
2703 "%<%T [%wu]%> and size %qwu in a region of type %qT "
2704 "and size %qwi"
2706 "%<%T [%wu]%> and size %qwu in a region of type %qT "
2710 bytes_avail);
2711 else
2713 exact_size ?
2714 "placement new constructing an array of objects "
2715 "of type %qT and size %qwu in a region of type %qT "
2716 "and size %qwi"
2718 "of type %qT and size %qwu in a region of type %qT "
2721 bytes_avail);
2722 else
2724 exact_size ?
2725 "placement new constructing an object of type %qT "
2726 "and size %qwu in a region of type %qT and size %qwi"
2728 "and size %qwu in a region of type %qT and size "
2731 bytes_avail);
2732 }
2733 }
2734 }
2736 /* True if alignof(T) > __STDCPP_DEFAULT_NEW_ALIGNMENT__. */
2738 bool
2740 {
2743 }
2745 /* Return the alignment we expect malloc to guarantee. This should just be
2746 MALLOC_ABI_ALIGNMENT, but that macro defaults to only BITS_PER_WORD for some
2747 reason, so don't let the threshold be smaller than max_align_t_align. */
2749 unsigned
2751 {
2753 }
2755 /* Determine whether an allocation function is a namespace-scope
2756 non-replaceable placement new function. See DR 1748.
2757 TODO: Enable in all standard modes. */
2758 static bool
2760 {
2762 {
2767 }
2769 }
2771 /* Generate code for a new-expression, including calling the "operator
2772 new" function, initializing the object, and, if an exception occurs
2773 during construction, cleaning up. The arguments are as for
2774 build_raw_new_expr. This may change PLACEMENT and INIT.
2775 TYPE is the type of the object being constructed, possibly an array
2776 of NELTS elements when NELTS is non-null (in "new T[NELTS]", T may
2777 be an array of the form U[inner], with the whole expression being
2778 "new U[NELTS][inner]"). */
2780 static tree
2783 tsubst_flags_t complain)
2784 {
2786 /* True iff this is a call to "operator new[]" instead of just
2787 "operator new". */
2789 /* If ARRAY_P is true, the element type of the array. This is never
2790 an ARRAY_TYPE; for something like "new int[3][4]", the
2791 ELT_TYPE is "int". If ARRAY_P is false, this is the same type as
2792 TYPE. */
2793 tree elt_type;
2794 /* The type of the new-expression. (This type is always a pointer
2795 type.) */
2796 tree pointer_type;
2797 tree non_const_pointer_type;
2798 /* The most significant array bound in int[OUTER_NELTS][inner]. */
2800 /* For arrays with a non-constant number of elements, a bounds checks
2801 on the NELTS parameter to avoid integer overflow at runtime. */
2804 /* Number of the "inner" elements in "new T[OUTER_NELTS][inner]". */
2807 /* Size of the inner array elements (those with constant dimensions). */
2808 offset_int inner_size;
2809 /* The address returned by the call to "operator new". This node is
2810 a VAR_DECL and is therefore reusable. */
2811 tree alloc_node;
2812 tree alloc_fn;
2815 /* If non-NULL, the number of extra bytes to allocate at the
2816 beginning of the storage allocated for an array-new expression in
2817 order to store the number of elements. */
2819 tree placement_first;
2821 /* True if the function we are calling is a placement allocation
2822 function. */
2824 /* True if the storage must be initialized, either by a constructor
2825 or due to an explicit new-initializer. */
2827 /* The address of the thing allocated, not including any cookie. In
2828 particular, if an array cookie is in use, DATA_ADDR is the
2829 address of the first array element. This node is a VAR_DECL, and
2830 is therefore reusable. */
2831 tree data_addr;
2836 {
2839 }
2841 {
2842 /* Transforms new (T[N]) to new T[N]. The former is a GNU
2843 extension for variable N. (This also covers new T where T is
2844 a VLA typedef.) */
2850 }
2852 /* Lots of logic below. depends on whether we have a constant number of
2853 elements, so go ahead and fold it now. */
2857 /* If our base type is an array, then make sure we know how many elements
2858 it has. */
2862 {
2866 {
2871 {
2875 }
2877 }
2878 else
2879 {
2881 {
2885 }
2887 }
2891 inner_nelts_cst,
2892 complain);
2893 }
2896 {
2899 }
2904 /* Warn if we performed the (T[N]) to T[N] transformation and N is
2905 variable. */
2908 {
2910 {
2917 }
2918 else
2920 }
2923 {
2927 }
2935 {
2937 /* A program that calls for default-initialization [...] of an
2938 entity of reference type is ill-formed. */
2942 /* A new-expression that creates an object of type T initializes
2943 that object as follows:
2944 - If the new-initializer is omitted:
2945 -- If T is a (possibly cv-qualified) non-POD class type
2946 (or array thereof), the object is default-initialized (8.5).
2947 [...]
2948 -- Otherwise, the object created has indeterminate
2949 value. If T is a const-qualified type, or a (possibly
2950 cv-qualified) POD class type (or array thereof)
2951 containing (directly or indirectly) a member of
2952 const-qualified type, the program is ill-formed; */
2962 }
2966 {
2970 }
2974 {
2975 /* Maximum available size in bytes. Half of the address space
2976 minus the cookie size. */
2977 offset_int max_size
2979 /* Maximum number of outer elements which can be allocated. */
2980 offset_int max_outer_nelts;
2981 tree max_outer_nelts_tree;
2987 /* Unconditionally subtract the cookie size. This decreases the
2988 maximum object size and is safe even if we choose not to use
2989 a cookie after all. */
2995 {
2999 }
3007 {
3009 {
3010 /* When the array size is constant, check it at compile time
3011 to make sure it doesn't exceed the implementation-defined
3012 maximum, as required by C++ 14 (in C++ 11 this requirement
3013 isn't explicitly stated but it's enforced anyway -- see
3014 grokdeclarator in cp/decl.c). */
3018 }
3019 }
3020 else
3021 {
3022 /* When a runtime check is necessary because the array size
3023 isn't constant, keep only the top-most seven bits (starting
3024 with the most significant non-zero bit) of the maximum size
3025 to compare the array size against, to simplify encoding the
3026 constant maximum size in the instruction stream. */
3033 outer_nelts,
3034 max_outer_nelts_tree);
3035 }
3036 }
3044 /* If PLACEMENT is a single simple pointer type not passed by
3045 reference, prepare to capture it in a temporary variable. Do
3046 this now, since PLACEMENT will change in the calls below. */
3054 /* Allocate the object. */
3055 tree fnname;
3056 tree fns;
3060 member_new_p = !globally_qualified_p
3062 && (array_p
3067 {
3068 /* Use a class-specific operator new. */
3069 /* If a cookie is required, add some extra space. */
3072 else
3073 {
3075 /* No size arithmetic necessary, so the size check is
3076 not needed. */
3079 }
3080 /* Perform the overflow check. */
3087 /* Create the argument list. */
3089 /* Do name-lookup to find the appropriate operator. */
3092 {
3096 }
3098 {
3100 {
3103 }
3105 }
3109 {
3112 alloc_call
3116 /* If no matching function is found and the allocated object type
3117 has new-extended alignment, the alignment argument is removed
3118 from the argument list, and overload resolution is performed
3119 again. */
3122 }
3126 LOOKUP_NORMAL,
3128 }
3129 else
3130 {
3131 /* Use a global operator new. */
3132 /* See if a cookie might be required. */
3134 {
3136 /* No size arithmetic necessary, so the size check is
3137 not needed. */
3140 }
3146 }
3153 /* Now, check to see if this function is actually a placement
3154 allocation function. This can happen even when PLACEMENT is NULL
3155 because we might have something like:
3157 struct S { void* operator new (size_t, int i = 0); };
3159 A call to `new S' will get this allocation function, even though
3160 there is no explicit placement argument. If there is more than
3161 one argument, or there are variable arguments, then this is a
3162 placement allocation function. */
3163 placement_allocation_fn_p
3168 && !placement_allocation_fn_p
3173 {
3176 {
3182 }
3183 }
3185 /* If we found a simple case of PLACEMENT_EXPR above, then copy it
3186 into a temporary variable. */
3192 {
3198 {
3202 }
3206 {
3207 /* Attempt to make the warning point at the operator new argument. */
3212 }
3213 }
3215 /* In the simple case, we can stop now. */
3220 /* Store the result of the allocation call in a variable so that we can
3221 use it more than once. */
3225 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */
3229 /* Preevaluate the placement args so that we don't reevaluate them for a
3230 placement delete. */
3232 {
3233 tree inits;
3237 alloc_expr);
3238 }
3240 /* unless an allocation function is declared with an empty excep-
3241 tion-specification (_except.spec_), throw(), it indicates failure to
3242 allocate storage by throwing a bad_alloc exception (clause _except_,
3243 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
3244 cation function is declared with an empty exception-specification,
3245 throw(), it returns null to indicate failure to allocate storage and a
3246 non-null pointer otherwise.
3248 So check for a null exception spec on the op new we just called. */
3251 check_new
3255 {
3256 tree cookie;
3257 tree cookie_ptr;
3258 tree size_ptr_type;
3260 /* Adjust so we're pointing to the start of the object. */
3263 /* Store the number of bytes allocated so that we can know how
3264 many elements to destroy later. We use the last sizeof
3265 (size_t) bytes to store the number of elements. */
3276 {
3277 /* Also store the element size. */
3288 }
3289 }
3290 else
3291 {
3294 }
3296 /* Now use a pointer to the type we've actually allocated. */
3298 /* But we want to operate on a non-const version to start with,
3299 since we'll be modifying the elements. */
3300 non_const_pointer_type = build_pointer_type
3304 /* Any further uses of alloc_node will want this type, too. */
3307 /* Now initialize the allocated object. Note that we preevaluate the
3308 initialization expression, apart from the actual constructor call or
3309 assignment--we do this because we want to delay the allocation as long
3310 as possible in order to minimize the size of the exception region for
3311 placement delete. */
3313 {
3318 {
3321 }
3324 {
3325 /* build_value_init doesn't work in templates, and we don't need
3326 the initializer anyway since we're going to throw it away and
3327 rebuild it at instantiation time, so just build up a single
3328 constructor call to get any appropriate diagnostics. */
3332 complete_ctor_identifier,
3334 LOOKUP_NORMAL,
3335 complain);
3337 }
3339 {
3343 {
3347 else
3348 {
3352 complain);
3353 else
3354 /* We'll check the length at runtime. */
3358 }
3359 }
3361 {
3365 else
3368 }
3369 init_expr
3373 integer_one_node,
3374 complain),
3375 vecinit,
3376 explicit_value_init_p,
3378 complain);
3380 /* An array initialization is stable because the initialization
3381 of each element is a full-expression, so the temporaries don't
3382 leak out. */
3384 }
3385 else
3386 {
3390 {
3392 complete_ctor_identifier,
3394 LOOKUP_NORMAL,
3395 complain);
3396 }
3398 {
3399 /* Something like `new int()'. NO_CLEANUP is needed so
3400 we don't try and build a (possibly ill-formed)
3401 destructor. */
3406 }
3407 else
3408 {
3409 tree ie;
3411 /* We are processing something like `new int (10)', which
3412 means allocate an int, and initialize it with 10. */
3415 complain);
3418 }
3419 /* If the initializer uses C++14 aggregate NSDMI that refer to the
3420 object being initialized, replace them now and don't try to
3421 preevaluate. */
3429 stable = (!had_placeholder
3431 }
3436 /* If any part of the object initialization terminates by throwing an
3437 exception and a suitable deallocation function can be found, the
3438 deallocation function is called to free the memory in which the
3439 object was being constructed, after which the exception continues
3440 to propagate in the context of the new-expression. If no
3441 unambiguous matching deallocation function can be found,
3442 propagating the exception does not cause the object's memory to be
3443 freed. */
3445 {
3447 tree cleanup;
3449 /* The Standard is unclear here, but the right thing to do
3450 is to use the same method for finding deallocation
3451 functions that we use for finding allocation functions. */
3452 cleanup = (build_op_delete_call
3454 alloc_node,
3455 size,
3456 globally_qualified_p,
3458 alloc_fn,
3459 complain));
3464 /* This is much simpler if we were able to preevaluate all of
3465 the arguments to the constructor call. */
3466 {
3467 /* CLEANUP is compiler-generated, so no diagnostics. */
3471 /* Likewise, this try-catch is compiler-generated. */
3473 }
3474 else
3475 /* Ack! First we allocate the memory. Then we set our sentry
3476 variable to true, and expand a cleanup that deletes the
3477 memory if sentry is true. Then we run the constructor, and
3478 finally clear the sentry.
3480 We need to do this because we allocate the space first, so
3481 if there are any temporaries with cleanups in the
3482 constructor args and we weren't able to preevaluate them, we
3483 need this EH region to extend until end of full-expression
3484 to preserve nesting. */
3485 {
3493 /* CLEANUP is compiler-generated, so no diagnostics. */
3503 init_expr
3506 end));
3507 /* Likewise, this is compiler-generated. */
3509 }
3510 }
3511 }
3512 else
3515 /* Now build up the return value in reverse order. */
3525 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
3526 and return the call (which doesn't need to be adjusted). */
3528 else
3529 {
3531 {
3534 nullptr_node,
3535 complain);
3538 }
3540 /* Perform the allocation before anything else, so that ALLOC_NODE
3541 has been initialized before we start using it. */
3543 }
3548 /* A new-expression is never an lvalue. */
3552 }
3554 /* Generate a representation for a C++ "new" expression. *PLACEMENT
3555 is a vector of placement-new arguments (or NULL if none). If NELTS
3556 is NULL, TYPE is the type of the storage to be allocated. If NELTS
3557 is not NULL, then this is an array-new allocation; TYPE is the type
3558 of the elements in the array and NELTS is the number of elements in
3559 the array. *INIT, if non-NULL, is the initializer for the new
3560 object, or an empty vector to indicate an initializer of "()". If
3561 USE_GLOBAL_NEW is true, then the user explicitly wrote "::new"
3562 rather than just "new". This may change PLACEMENT and INIT. */
3564 tree
3567 {
3568 tree rval;
3577 /* Don't do auto deduction where it might affect mangling. */
3579 {
3582 {
3585 {
3588 }
3590 }
3591 }
3594 {
3601 use_global_new);
3606 {
3608 /* Also copy any CONSTRUCTORs in *init, since reshape_init and
3609 digest_init clobber them in place. */
3611 {
3615 }
3616 }
3622 }
3625 {
3627 {
3630 else
3632 }
3634 /* Try to determine the constant value only for the purposes
3635 of the diagnostic below but continue to use the original
3636 value and handle const folding later. */
3639 /* The expression in a noptr-new-declarator is erroneous if it's of
3640 non-class type and its value before converting to std::size_t is
3641 less than zero. ... If the expression is a constant expression,
3642 the program is ill-fomed. */
3645 {
3649 }
3653 }
3655 /* ``A reference cannot be created by the new operator. A reference
3656 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
3657 returned by new.'' ARM 5.3.3 */
3659 {
3662 else
3665 }
3668 {
3672 }
3674 /* The type allocated must be complete. If the new-type-id was
3675 "T[N]" then we are just checking that "T" is complete here, but
3676 that is equivalent, since the value of "N" doesn't matter. */
3685 {
3691 }
3693 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
3698 }
3699 \f
3700 static tree
3702 special_function_kind auto_delete_vec,
3704 {
3705 tree virtual_size;
3707 tree size_exp;
3709 /* Temporary variables used by the loop. */
3712 /* This is the body of the loop that implements the deletion of a
3713 single element, and moves temp variables to next elements. */
3714 tree body;
3716 /* This is the LOOP_EXPR that governs the deletion of the elements. */
3719 /* This is the thing that governs what to do after the loop has run. */
3722 /* This is the BIND_EXPR which holds the outermost iterator of the
3723 loop. It is convenient to set this variable up and test it before
3724 executing any other code in the loop.
3725 This is also the containing expression returned by this function. */
3727 tree tmp;
3729 /* We should only have 1-D arrays here. */
3736 {
3739 "possible problem detected in invocation of "
3741 {
3744 "class-specific operator delete [] will be called, "
3746 }
3747 /* This size won't actually be used. */
3750 }
3757 {
3758 /* Make sure the destructor is callable. */
3760 {
3763 complain);
3766 }
3768 }
3770 /* The below is short by the cookie size. */
3775 tbase_init
3779 base),
3780 virtual_size),
3781 complain);
3799 complain);
3807 no_destructor:
3808 /* Delete the storage if appropriate. */
3810 {
3811 tree base_tbd;
3813 /* The below is short by the cookie size. */
3818 /* no header */
3820 else
3821 {
3822 tree cookie_size;
3826 MINUS_EXPR,
3829 cookie_size,
3830 complain);
3834 /* True size with header. */
3836 }
3843 complain);
3844 }
3848 ;
3851 else
3852 /* The delete operator mist be called, even if a destructor
3853 throws. */
3859 /* Outermost wrapper: If pointer is null, punt. */
3862 /* This is a compiler generated comparison, don't emit
3863 e.g. -Wnonnull-compare warning for it. */
3871 {
3874 }
3877 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
3881 }
3883 /* Create an unnamed variable of the indicated TYPE. */
3885 tree
3887 {
3888 tree decl;
3898 }
3900 /* Create a new temporary variable of the indicated TYPE, initialized
3901 to INIT.
3903 It is not entered into current_binding_level, because that breaks
3904 things when it comes time to do final cleanups (which take place
3905 "outside" the binding contour of the function). */
3907 tree
3909 {
3910 tree decl;
3919 }
3921 /* Subroutine of build_vec_init. Returns true if assigning to an array of
3922 INNER_ELT_TYPE from INIT is trivial. */
3924 static bool
3926 {
3931 }
3933 /* Subroutine of build_vec_init: Check that the array has at least N
3934 elements. Other parameters are local variables in build_vec_init. */
3936 void
3938 {
3941 {
3943 {
3945 nelts);
3949 }
3950 /* Don't check an array new when -fno-exceptions. */
3951 }
3954 {
3955 /* Make sure the last element of the initializer is in bounds. */
3956 finish_expr_stmt
3957 (ubsan_instrument_bounds
3959 }
3960 }
3962 /* `build_vec_init' returns tree structure that performs
3963 initialization of a vector of aggregate types.
3965 BASE is a reference to the vector, of ARRAY_TYPE, or a pointer
3966 to the first element, of POINTER_TYPE.
3967 MAXINDEX is the maximum index of the array (one less than the
3968 number of elements). It is only used if BASE is a pointer or
3969 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
3971 INIT is the (possibly NULL) initializer.
3973 If EXPLICIT_VALUE_INIT_P is true, then INIT must be NULL. All
3974 elements in the array are value-initialized.
3976 FROM_ARRAY is 0 if we should init everything with INIT
3977 (i.e., every element initialized from INIT).
3978 FROM_ARRAY is 1 if we should index into INIT in parallel
3979 with initialization of DECL.
3980 FROM_ARRAY is 2 if we should index into INIT in parallel,
3981 but use assignment instead of initialization. */
3983 tree
3987 {
3988 tree rval;
3991 tree iterator;
3992 /* The type of BASE. */
3994 /* The type of an element in the array. */
3996 /* The element type reached after removing all outer array
3997 types. */
3998 tree inner_elt_type;
3999 /* The type of a pointer to an element in the array. */
4000 tree ptype;
4001 tree stmt_expr;
4002 tree compound_stmt;
4025 /* Look through the TARGET_EXPR around a compound literal. */
4034 {
4037 {
4040 }
4041 }
4043 /* If we have a braced-init-list or string constant, make sure that the array
4044 is big enough for all the initializers. */
4059 || (same_type_ignoring_top_level_qualifiers_p
4061 /* Don't do this if the CONSTRUCTOR might contain something
4062 that might throw and require us to clean up. */
4066 {
4067 /* Do non-default initialization of trivial arrays resulting from
4068 brace-enclosed initializers. In this case, digest_init and
4069 store_constructor will handle the semantics for us. */
4075 }
4081 {
4087 }
4088 else
4091 /* The code we are generating looks like:
4092 ({
4093 T* t1 = (T*) base;
4094 T* rval = t1;
4095 ptrdiff_t iterator = maxindex;
4096 try {
4097 for (; iterator != -1; --iterator) {
4098 ... initialize *t1 ...
4099 ++t1;
4100 }
4101 } catch (...) {
4102 ... destroy elements that were constructed ...
4103 }
4104 rval;
4105 })
4107 We can omit the try and catch blocks if we know that the
4108 initialization will never throw an exception, or if the array
4109 elements do not have destructors. We can omit the loop completely if
4110 the elements of the array do not have constructors.
4112 We actually wrap the entire body of the above in a STMT_EXPR, for
4113 tidiness.
4115 When copying from array to another, when the array elements have
4116 only trivial copy constructors, we should use __builtin_memcpy
4117 rather than generating a loop. That way, we could take advantage
4118 of whatever cleverness the back end has for dealing with copies
4119 of blocks of memory. */
4128 /* If initializing one array from another, initialize element by
4129 element. We rely upon the below calls to do the argument
4130 checking. Evaluate the initializer before entering the try block. */
4132 {
4141 }
4143 /* Protect the entire array initialization so that we can destroy
4144 the partially constructed array if an exception is thrown.
4145 But don't do this if we're assigning. */
4148 {
4150 }
4152 /* Should we try to create a constant initializer? */
4156 : (type_has_constexpr_default_constructor
4162 /* If we're initializing a static array, we want to do static
4163 initialization of any elements with constant initializers even if
4164 some are non-constant. */
4170 /* Skip over the handling of non-empty init lists. */
4173 /* Maybe pull out constant value when from_array? */
4176 {
4177 /* Do non-default initialization of non-trivial arrays resulting from
4178 brace-enclosed initializers. */
4181 /* If the constructor already has the array type, it's been through
4182 digest_init, so we shouldn't try to do anything more. */
4193 {
4195 tree one_init;
4197 num_initialized_elts++;
4204 else
4210 {
4213 {
4217 else
4219 }
4220 else
4221 {
4223 {
4228 }
4230 }
4231 }
4238 complain);
4241 else
4245 complain);
4248 else
4250 }
4252 /* Any elements without explicit initializers get T{}. */
4254 }
4256 {
4257 /* Check that the array is at least as long as the string. */
4264 /* Copy the string to the first part of the array. */
4270 /* Adjust the counter and pointer. */
4279 /* And set the rest of the array to NUL. */
4282 }
4284 {
4289 {
4293 }
4294 }
4296 /* Now, default-initialize any remaining elements. We don't need to
4297 do that if a) the type does not need constructing, or b) we've
4298 already initialized all the elements.
4300 We do need to keep going if we're copying an array. */
4303 /* With a constexpr default constructor, which we checked for when
4304 setting try_const above, default-initialization is equivalent to
4305 value-initialization, and build_value_init gives us something more
4306 friendly to maybe_constant_init. */
4311 && (num_initialized_elts
4313 {
4314 /* If the ITERATOR is lesser or equal to -1, then we don't have to loop;
4315 we've already initialized all the elements. */
4316 tree for_stmt;
4317 tree elt_init;
4318 tree to;
4326 complain);
4333 /* If the initializer is {}, then all elements are initialized from T{}.
4334 But for non-classes, that's the same as value-initialization. */
4336 {
4338 {
4340 }
4341 else
4342 {
4345 }
4346 }
4349 {
4350 tree from;
4353 {
4359 }
4360 else
4370 complain);
4371 else
4373 }
4375 {
4377 sorry
4381 explicit_value_init_p,
4383 }
4385 {
4389 }
4390 else
4391 {
4395 else
4396 {
4399 complain);
4401 }
4402 }
4408 {
4409 /* FIXME refs to earlier elts */
4412 {
4414 /* Don't fill the CONSTRUCTOR with zeros. */
4418 }
4419 else
4420 {
4424 else
4426 }
4429 {
4432 {
4435 }
4436 }
4437 }
4445 complain));
4448 complain));
4451 }
4453 /* Make sure to cleanup any partially constructed elements. */
4456 {
4457 tree e;
4460 complain);
4462 /* Flatten multi-dimensional array since build_vec_delete only
4463 expects one-dimensional array. */
4467 /* Avoid mixing signed and unsigned. */
4470 complain);
4479 }
4481 /* The value of the array initialization is the array itself, RVAL
4482 is a pointer to the first element. */
4493 {
4495 {
4498 }
4501 else
4503 }
4505 /* Now make the result have the correct type. */
4507 {
4512 }
4515 }
4517 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
4518 build_delete. */
4520 static tree
4522 tsubst_flags_t complain)
4523 {
4524 tree name;
4525 tree fn;
4527 {
4542 }
4547 flags,
4549 complain);
4550 }
4552 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
4553 ADDR is an expression which yields the store to be destroyed.
4554 AUTO_DELETE is the name of the destructor to call, i.e., either
4555 sfk_complete_destructor, sfk_base_destructor, or
4556 sfk_deleting_destructor.
4558 FLAGS is the logical disjunction of zero or more LOOKUP_
4559 flags. See cp-tree.h for more info. */
4561 tree
4564 {
4565 tree expr;
4572 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
4573 set to `error_mark_node' before it gets properly cleaned up. */
4581 {
4583 {
4587 }
4590 }
4593 {
4596 /* We don't want to warn about delete of void*, only other
4597 incomplete types. Deleting other incomplete types
4598 invokes undefined behavior, but it is not ill-formed, so
4599 compile to something that would even do The Right Thing
4600 (TM) should the type have a trivial dtor and no delete
4601 operator. */
4603 {
4606 {
4609 "possible problem detected in invocation of "
4611 {
4614 "neither the destructor nor the class-specific "
4615 "operator delete will be called, even if they are "
4617 }
4618 }
4622 {
4625 {
4628 "deleting object of abstract class type %qT"
4629 " which has non-virtual destructor"
4631 else
4633 "deleting object of polymorphic class type %qT"
4634 " which has non-virtual destructor"
4636 }
4637 }
4638 }
4642 /* Throw away const and volatile on target type of addr. */
4644 }
4645 else
4646 {
4647 /* Don't check PROTECT here; leave that decision to the
4648 destructor. If the destructor is accessible, call it,
4649 else report error. */
4657 }
4660 {
4661 /* Make sure the destructor is callable. */
4663 {
4665 complain),
4669 }
4676 use_global_delete,
4679 complain);
4680 }
4681 else
4682 {
4685 tree ifexp;
4690 /* For `::delete x', we must not use the deleting destructor
4691 since then we would not be sure to get the global `operator
4692 delete'. */
4694 {
4695 /* We will use ADDR multiple times so we must save it. */
4698 /* Delete the object. */
4700 head,
4705 complain);
4706 /* Otherwise, treat this like a complete object destructor
4707 call. */
4709 }
4710 /* If the destructor is non-virtual, there is no deleting
4711 variant. Instead, we must explicitly call the appropriate
4712 `operator delete' here. */
4715 {
4716 /* We will use ADDR multiple times so we must save it. */
4718 /* Build the call. */
4720 addr,
4725 complain);
4726 /* Call the complete object destructor. */
4728 }
4731 {
4732 /* Make sure we have access to the member op delete, even though
4733 we'll actually be calling it from the destructor. */
4738 complain);
4739 }
4746 /* The delete operator must be called, regardless of whether
4747 the destructor throws.
4749 [expr.delete]/7 The deallocation function is called
4750 regardless of whether the destructor for the object or some
4751 element of the array throws an exception. */
4754 /* We need to calculate this before the dtor changes the vptr. */
4759 /* Explicit destructor call; don't check for null pointer. */
4761 else
4762 {
4763 /* Handle deleting a null pointer. */
4769 /* This is a compiler generated comparison, don't emit
4770 e.g. -Wnonnull-compare warning for it. */
4773 }
4779 }
4780 }
4782 /* At the beginning of a destructor, push cleanups that will call the
4783 destructors for our base classes and members.
4785 Called from begin_destructor_body. */
4787 void
4789 {
4792 tree member;
4793 tree expr;
4796 /* Run destructors for all virtual baseclasses. */
4799 {
4800 tree cond = (condition_conversion
4802 current_in_charge_parm,
4803 integer_two_node)));
4805 /* The CLASSTYPE_VBASECLASSES vector is in initialization
4806 order, which is also the right order for pushing cleanups. */
4809 {
4811 {
4813 base_dtor_identifier,
4814 NULL,
4815 base_binfo,
4816 (LOOKUP_NORMAL
4818 tf_warning_or_error);
4820 {
4824 }
4825 }
4826 }
4827 }
4829 /* Take care of the remaining baseclasses. */
4832 {
4838 base_dtor_identifier,
4841 tf_warning_or_error);
4844 }
4846 /* Don't automatically destroy union members. */
4852 {
4861 {
4862 tree this_member = (build_class_member_access_expr
4866 tf_warning_or_error));
4868 sfk_complete_destructor,
4873 }
4874 }
4875 }
4877 /* Build a C++ vector delete expression.
4878 MAXINDEX is the number of elements to be deleted.
4879 ELT_SIZE is the nominal size of each element in the vector.
4880 BASE is the expression that should yield the store to be deleted.
4881 This function expands (or synthesizes) these calls itself.
4882 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
4884 This also calls delete for virtual baseclasses of elements of the vector.
4886 Update: MAXINDEX is no longer needed. The size can be extracted from the
4887 start of the vector for pointers, and from the type for arrays. We still
4888 use MAXINDEX for arrays because it happens to already have one of the
4889 values we'd have to extract. (We could use MAXINDEX with pointers to
4890 confirm the size, and trap if the numbers differ; not clear that it'd
4891 be worth bothering.) */
4893 tree
4895 special_function_kind auto_delete_vec,
4897 {
4898 tree type;
4899 tree rval;
4905 {
4906 /* Step back one from start of vector, and read dimension. */
4907 tree cookie_addr;
4912 {
4915 }
4920 cookie_addr);
4922 }
4924 {
4925 /* Get the total number of things in the array, maxindex is a
4926 bad name. */
4933 {
4936 }
4937 }
4938 else
4939 {
4943 }
4951 }