| blob | 30774070d3c487608f17cc260cc6f499616d50d9 |
1 /* Handle initialization things in C++.
2 Copyright (C) 1987-2015 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. */
61 /* We are about to generate some complex initialization code.
62 Conceptually, it is all a single expression. However, we may want
63 to include conditionals, loops, and other such statement-level
64 constructs. Therefore, we build the initialization code inside a
65 statement-expression. This function starts such an expression.
66 STMT_EXPR_P and COMPOUND_STMT_P are filled in by this function;
67 pass them back to finish_init_stmts when the expression is
68 complete. */
70 static bool
72 {
79 }
81 /* Finish out the statement-expression begun by the previous call to
82 begin_init_stmts. Returns the statement-expression itself. */
84 static tree
86 {
94 }
96 /* Constructors */
98 /* Called from initialize_vtbl_ptrs via dfs_walk. BINFO is the base
99 which we want to initialize the vtable pointer for, DATA is
100 TREE_LIST whose TREE_VALUE is the this ptr expression. */
102 static tree
104 {
109 {
113 tf_warning_or_error);
116 }
119 }
121 /* Initialize all the vtable pointers in the object pointed to by
122 ADDR. */
124 void
126 {
127 tree list;
128 tree type;
133 /* Walk through the hierarchy, initializing the vptr in each base
134 class. We do these in pre-order because we can't find the virtual
135 bases for a class until we've initialized the vtbl for that
136 class. */
138 }
140 /* Return an expression for the zero-initialization of an object with
141 type T. This expression will either be a constant (in the case
142 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
143 aggregate), or NULL (in the case that T does not require
144 initialization). In either case, the value can be used as
145 DECL_INITIAL for a decl of the indicated TYPE; it is a valid static
146 initializer. If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS
147 is the number of elements in the array. If STATIC_STORAGE_P is
148 TRUE, initializers are only generated for entities for which
149 zero-initialization does not simply mean filling the storage with
150 zero bytes. FIELD_SIZE, if non-NULL, is the bit size of the field,
151 subfields with bit positions at or above that bit size shouldn't
152 be added. Note that this only works when the result is assigned
153 to a base COMPONENT_REF; if we only have a pointer to the base subobject,
154 expand_assignment will end up clearing the full size of TYPE. */
156 static tree
158 tree field_size)
159 {
162 /* [dcl.init]
164 To zero-initialize an object of type T means:
166 -- if T is a scalar type, the storage is set to the value of zero
167 converted to T.
169 -- if T is a non-union class type, the storage for each nonstatic
170 data member and each base-class subobject is zero-initialized.
172 -- if T is a union type, the storage for its first data member is
173 zero-initialized.
175 -- if T is an array type, the storage for each element is
176 zero-initialized.
178 -- if T is a reference type, no initialization is performed. */
183 ;
185 /* In order to save space, we do not explicitly build initializers
186 for items that do not need them. GCC's semantics are that
187 items with static storage duration that are not otherwise
188 initialized are initialized to zero. */
189 ;
195 {
196 tree field;
199 /* Iterate over the fields, building initializations. */
201 {
208 /* Don't add virtual bases for base classes if they are beyond
209 the size of the current field, that means it is present
210 somewhere else in the object. */
212 {
217 }
219 /* Note that for class types there will be FIELD_DECLs
220 corresponding to base classes as well. Thus, iterating
221 over TYPE_FIELDs will result in correct initialization of
222 all of the subobjects. */
224 {
225 tree new_field_size
232 static_storage_p,
233 new_field_size);
236 }
238 /* For unions, only the first field is initialized. */
241 }
243 /* Build a constructor to contain the initializations. */
245 }
247 {
248 tree max_index;
251 /* Iterate over the array elements, building initializations. */
256 else
259 /* If we have an error_mark here, we should just return error mark
260 as we don't know the size of the array yet. */
265 /* A zero-sized array, which is accepted as an extension, will
266 have an upper bound of -1. */
268 {
269 constructor_elt ce;
271 /* If this is a one element array, we just use a regular init. */
274 else
276 max_index);
282 {
285 }
286 }
288 /* Build a constructor to contain the initializations. */
290 }
293 else
296 /* In all cases, the initializer is a constant. */
301 }
303 /* Return an expression for the zero-initialization of an object with
304 type T. This expression will either be a constant (in the case
305 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
306 aggregate), or NULL (in the case that T does not require
307 initialization). In either case, the value can be used as
308 DECL_INITIAL for a decl of the indicated TYPE; it is a valid static
309 initializer. If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS
310 is the number of elements in the array. If STATIC_STORAGE_P is
311 TRUE, initializers are only generated for entities for which
312 zero-initialization does not simply mean filling the storage with
313 zero bytes. */
315 tree
317 {
319 }
321 /* Return a suitable initializer for value-initializing an object of type
322 TYPE, as described in [dcl.init]. */
324 tree
326 {
327 /* [dcl.init]
329 To value-initialize an object of type T means:
331 - if T is a class type (clause 9) with either no default constructor
332 (12.1) or a default constructor that is user-provided or deleted,
333 then then the object is default-initialized;
335 - if T is a (possibly cv-qualified) class type without a user-provided
336 or deleted default constructor, then the object is zero-initialized
337 and the semantic constraints for default-initialization are checked,
338 and if T has a non-trivial default constructor, the object is
339 default-initialized;
341 - if T is an array type, then each element is value-initialized;
343 - otherwise, the object is zero-initialized.
345 A program that calls for default-initialization or
346 value-initialization of an entity of reference type is ill-formed. */
348 /* The AGGR_INIT_EXPR tweaking below breaks in templates. */
354 {
355 tree ctor =
358 complain);
368 {
369 /* This is a class that needs constructing, but doesn't have
370 a user-provided constructor. So we need to zero-initialize
371 the object and then call the implicitly defined ctor.
372 This will be handled in simplify_aggr_init_expr. */
375 }
376 }
378 /* Discard any access checking during subobject initialization;
379 the checks are implied by the call to the ctor which we have
380 verified is OK (cpp0x/defaulted46.C). */
385 }
387 /* Like build_value_init, but don't call the constructor for TYPE. Used
388 for base initializers. */
390 tree
392 {
394 {
398 }
399 /* FIXME the class and array cases should just use digest_init once it is
400 SFINAE-enabled. */
402 {
407 {
408 tree field;
411 /* Iterate over the fields, building initializations. */
413 {
424 /* We could skip vfields and fields of types with
425 user-defined constructors, but I think that won't improve
426 performance at all; it should be simpler in general just
427 to zero out the entire object than try to only zero the
428 bits that actually need it. */
430 /* Note that for class types there will be FIELD_DECLs
431 corresponding to base classes as well. Thus, iterating
432 over TYPE_FIELDs will result in correct initialization of
433 all of the subobjects. */
442 /* We shouldn't have gotten here for anything that would need
443 non-trivial initialization, and gimplify_init_ctor_preeval
444 would need to be fixed to allow it. */
447 }
449 /* Build a constructor to contain the zero- initializations. */
451 }
452 }
454 {
457 /* Iterate over the array elements, building initializations. */
460 /* If we have an error_mark here, we should just return error mark
461 as we don't know the size of the array yet. */
463 {
466 type);
468 }
471 /* A zero-sized array, which is accepted as an extension, will
472 have an upper bound of -1. */
474 {
475 constructor_elt ce;
477 /* If this is a one element array, we just use a regular init. */
480 else
491 /* We shouldn't have gotten here for anything that would need
492 non-trivial initialization, and gimplify_init_ctor_preeval
493 would need to be fixed to allow it. */
496 }
498 /* Build a constructor to contain the initializations. */
500 }
502 {
506 }
508 {
512 }
515 }
517 /* Initialize current class with INIT, a TREE_LIST of
518 arguments for a target constructor. If TREE_LIST is void_type_node,
519 an empty initializer list was given. */
521 static void
523 {
529 tf_warning_or_error));
531 {
533 LOOKUP_NORMAL
534 |LOOKUP_NONVIRTUAL
540 }
541 }
543 /* Return the non-static data initializer for FIELD_DECL MEMBER. */
545 tree
547 {
548 tree init;
552 {
553 /* Use a PLACEHOLDER_EXPR when we don't have a 'this' parameter to
554 refer to; constexpr evaluation knows what to do with it. */
557 }
559 {
560 /* Do deferred instantiation of the NSDMI. */
561 init = (tsubst_copy_and_build
568 }
569 else
570 {
573 {
578 }
579 /* Strip redundant TARGET_EXPR so we don't need to remap it, and
580 so the aggregate init code below will see a CONSTRUCTOR. */
585 }
589 }
591 /* Initialize MEMBER, a FIELD_DECL, with INIT, a TREE_LIST of
592 arguments. If TREE_LIST is void_type_node, an empty initializer
593 list was given; if NULL_TREE no initializer was given. */
595 static void
597 {
598 tree decl;
601 /* Use the non-static data member initializer if there was no
602 mem-initializer for this field. */
609 /* Effective C++ rule 12 requires that all data members be
610 initialized. */
614 member);
616 /* Get an lvalue for the data member. */
620 tf_warning_or_error);
626 {
628 /* Handle references. */
635 member);
636 }
639 {
640 /* mem() means value-initialization. */
642 {
646 }
647 else
648 {
654 }
655 }
656 /* Deal with this here, as we will get confused if we try to call the
657 assignment op for an anonymous union. This can happen in a
658 synthesized copy constructor. */
660 {
662 {
665 }
666 }
669 /* Pre-digested NSDMI. */
672 /* { } mem-initializer. */
677 {
678 /* With references and list-initialization, we need to deal with
679 extending temporary lifetimes. 12.2p5: "A temporary bound to a
680 reference member in a constructor’s ctor-initializer (12.6.2)
681 persists until the constructor exits." */
686 tf_warning_or_error);
688 {
693 }
696 /* A FIELD_DECL doesn't really have a suitable lifetime, but
697 make_temporary_var_for_ref_to_temp will treat it as automatic and
698 set_up_extended_ref_temp wants to use the decl in a warning. */
708 }
711 {
713 {
715 {
718 else
722 }
726 {
730 }
731 else
733 }
734 else
735 {
742 {
743 /* TYPE_NEEDS_CONSTRUCTING can be set just because we have a
744 vtable; still give this diagnostic. */
749 }
751 tf_warning_or_error));
752 }
753 }
754 else
755 {
757 {
758 tree core_type;
759 /* member traversal: note it leaves init NULL */
761 {
766 }
768 {
773 }
783 }
785 /* There was an explicit member initialization. Do some work
786 in that case. */
788 tf_warning_or_error);
792 tf_warning_or_error));
793 }
796 {
797 tree expr;
802 tf_warning_or_error);
805 tf_warning_or_error);
810 }
811 }
813 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
814 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
816 static tree
818 {
819 tree fields;
821 /* Note whether or not T is a union. */
826 {
827 tree fieldtype;
829 /* Skip CONST_DECLs for enumeration constants and so forth. */
834 /* Keep track of whether or not any fields are unions. */
838 /* For an anonymous struct or union, we must recursively
839 consider the fields of the anonymous type. They can be
840 directly initialized from the constructor. */
842 {
843 /* Add this field itself. Synthesized copy constructors
844 initialize the entire aggregate. */
846 /* And now add the fields in the anonymous aggregate. */
848 }
849 /* Add this field. */
852 }
855 }
857 /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives
858 a FIELD_DECL or BINFO in T that needs initialization. The
859 TREE_VALUE gives the initializer, or list of initializer arguments.
861 Return a TREE_LIST containing all of the initializations required
862 for T, in the order in which they should be performed. The output
863 list has the same format as the input. */
865 static tree
867 {
868 tree init;
870 tree sorted_inits;
871 tree next_subobject;
876 /* Build up a list of initializations. The TREE_PURPOSE of entry
877 will be the subobject (a FIELD_DECL or BINFO) to initialize. The
878 TREE_VALUE will be the constructor arguments, or NULL if no
879 explicit initialization was provided. */
882 /* Process the virtual bases. */
887 /* Process the direct bases. */
893 /* Process the non-static data members. */
895 /* Reverse the entire list of initializations, so that they are in
896 the order that they will actually be performed. */
899 /* If the user presented the initializers in an order different from
900 that in which they will actually occur, we issue a warning. Keep
901 track of the next subobject which can be explicitly initialized
902 without issuing a warning. */
905 /* Go through the explicit initializers, filling in TREE_PURPOSE in
906 the SORTED_INITS. */
908 {
909 tree subobject;
910 tree subobject_init;
914 /* If the explicit initializers are in sorted order, then
915 SUBOBJECT will be NEXT_SUBOBJECT, or something following
916 it. */
918 subobject_init;
923 /* Issue a warning if the explicit initializer order does not
924 match that which will actually occur.
925 ??? Are all these on the correct lines? */
927 {
931 else
936 else
940 }
942 /* Look again, from the beginning of the list. */
944 {
948 }
950 /* It is invalid to initialize the same subobject more than
951 once. */
953 {
957 subobject);
958 else
961 subobject);
962 }
964 /* Record the initialization. */
967 }
969 /* [class.base.init]
971 If a ctor-initializer specifies more than one mem-initializer for
972 multiple members of the same union (including members of
973 anonymous unions), the ctor-initializer is ill-formed.
975 Here we also splice out uninitialized union members. */
977 {
981 {
982 tree field;
983 tree ctx;
989 /* Skip base classes. */
993 /* If this is an anonymous union with no explicit initializer,
994 splice it out. */
998 /* See if this field is a member of a union, or a member of a
999 structure contained in a union, etc. */
1006 /* If this field is not a member of a union, skip it. */
1010 /* If this union member has no explicit initializer and no NSDMI,
1011 splice it out. */
1014 else
1017 /* It's only an error if we have two initializers for the same
1018 union type. */
1020 {
1023 }
1025 /* See if LAST_FIELD and the field initialized by INIT are
1026 members of the same union. If so, there's a problem,
1027 unless they're actually members of the same structure
1028 which is itself a member of a union. For example, given:
1030 union { struct { int i; int j; }; };
1032 initializing both `i' and `j' makes sense. */
1037 {
1038 /* A mem-initializer hides an NSDMI. */
1043 else
1044 {
1047 ctx);
1049 }
1050 }
1054 next:
1057 splice:
1060 }
1061 }
1064 }
1066 /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS
1067 is a TREE_LIST giving the explicit mem-initializer-list for the
1068 constructor. The TREE_PURPOSE of each entry is a subobject (a
1069 FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE
1070 is a TREE_LIST giving the arguments to the constructor or
1071 void_type_node for an empty list of arguments. */
1073 void
1075 {
1078 /* We will already have issued an error message about the fact that
1079 the type is incomplete. */
1086 {
1087 /* Delegating constructor. */
1091 }
1097 /* Sort the mem-initializers into the order in which the
1098 initializations should be performed. */
1103 /* Initialize base classes. */
1107 {
1111 /* We already have issued an error message. */
1116 {
1117 /* If these initializations are taking place in a copy constructor,
1118 the base class should probably be explicitly initialized if there
1119 is a user-defined constructor in the base class (other than the
1120 default constructor, which will be called anyway). */
1128 }
1130 /* Initialize the base. */
1133 else
1134 {
1135 tree base_addr;
1141 tf_warning_or_error),
1142 arguments,
1143 flags,
1144 tf_warning_or_error);
1146 }
1147 }
1150 /* Initialize the vptrs. */
1153 /* Initialize the data members. */
1155 {
1159 }
1160 }
1162 /* Returns the address of the vtable (i.e., the value that should be
1163 assigned to the vptr) for BINFO. */
1165 tree
1167 {
1169 tree vtbl;
1172 /* If this is a virtual primary base, then the vtable we want to store
1173 is that for the base this is being used as the primary base of. We
1174 can't simply skip the initialization, because we may be expanding the
1175 inits of a subobject constructor where the virtual base layout
1176 can be different. */
1180 /* Figure out what vtable BINFO's vtable is based on, and mark it as
1181 used. */
1185 /* Now compute the address to use when initializing the vptr. */
1191 }
1193 /* This code sets up the virtual function tables appropriate for
1194 the pointer DECL. It is a one-ply initialization.
1196 BINFO is the exact type that DECL is supposed to be. In
1197 multiple inheritance, this might mean "C's A" if C : A, B. */
1199 static void
1201 {
1203 tree vtt_index;
1205 /* Compute the initializer for vptr. */
1208 /* We may get this vptr from a VTT, if this is a subobject
1209 constructor or subobject destructor. */
1212 {
1213 tree vtbl2;
1214 tree vtt_parm;
1216 /* Compute the value to use, when there's a VTT. */
1222 /* The actual initializer is the VTT value only in the subobject
1223 constructor. In maybe_clone_body we'll substitute NULL for
1224 the vtt_parm in the case of the non-subobject constructor. */
1229 vtbl2,
1230 vtbl);
1231 }
1233 /* Compute the location of the vtpr. */
1235 tf_warning_or_error),
1239 /* Assign the vtable to the vptr. */
1242 tf_warning_or_error));
1243 }
1245 /* If an exception is thrown in a constructor, those base classes already
1246 constructed must be destroyed. This function creates the cleanup
1247 for BINFO, which has just been constructed. If FLAG is non-NULL,
1248 it is a DECL which is nonzero when this base needs to be
1249 destroyed. */
1251 static void
1253 {
1254 tree expr;
1259 /* Call the destructor. */
1261 base_dtor_identifier,
1262 NULL,
1263 binfo,
1265 tf_warning_or_error);
1277 }
1279 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its
1280 constructor. */
1282 static void
1284 {
1285 tree inner_if_stmt;
1286 tree exp;
1287 tree flag;
1289 /* If there are virtual base classes with destructors, we need to
1290 emit cleanups to destroy them if an exception is thrown during
1291 the construction process. These exception regions (i.e., the
1292 period during which the cleanups must occur) begin from the time
1293 the construction is complete to the end of the function. If we
1294 create a conditional block in which to initialize the
1295 base-classes, then the cleanup region for the virtual base begins
1296 inside a block, and ends outside of that block. This situation
1297 confuses the sjlj exception-handling code. Therefore, we do not
1298 create a single conditional block, but one for each
1299 initialization. (That way the cleanup regions always begin
1300 in the outer block.) We trust the back end to figure out
1301 that the FLAG will not change across initializations, and
1302 avoid doing multiple tests. */
1307 /* Compute the location of the virtual base. If we're
1308 constructing virtual bases, then we must be the most derived
1309 class. Therefore, we don't have to look up the virtual base;
1310 we already know where it is. */
1319 }
1321 /* Find the context in which this FIELD can be initialized. */
1323 static tree
1325 {
1328 /* Anonymous union members can be initialized in the first enclosing
1329 non-anonymous union context. */
1333 }
1335 /* Function to give error message if member initialization specification
1336 is erroneous. FIELD is the member we decided to initialize.
1337 TYPE is the type for which the initialization is being performed.
1338 FIELD must be a member of TYPE.
1340 MEMBER_NAME is the name of the member. */
1342 static int
1344 {
1348 {
1350 member_name);
1352 }
1354 {
1357 field);
1359 }
1361 {
1365 }
1367 {
1369 member_name);
1371 }
1374 }
1376 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it
1377 is a _TYPE node or TYPE_DECL which names a base for that type.
1378 Check the validity of NAME, and return either the base _TYPE, base
1379 binfo, or the FIELD_DECL of the member. If NAME is invalid, return
1380 NULL_TREE and issue a diagnostic.
1382 An old style unnamed direct single base construction is permitted,
1383 where NAME is NULL. */
1385 tree
1387 {
1388 tree basetype;
1389 tree field;
1395 {
1396 /* This is an obsolete unnamed base class initializer. The
1397 parser will already have warned about its use. */
1399 {
1402 current_class_type);
1405 basetype = BINFO_TYPE
1410 current_class_type);
1412 }
1413 }
1415 {
1418 }
1421 else
1425 {
1426 tree class_binfo;
1427 tree direct_binfo;
1428 tree virtual_binfo;
1439 /* Look for a direct base. */
1444 /* Look for a virtual base -- unless the direct base is itself
1445 virtual. */
1449 /* [class.base.init]
1451 If a mem-initializer-id is ambiguous because it designates
1452 both a direct non-virtual base class and an inherited virtual
1453 base class, the mem-initializer is ill-formed. */
1455 {
1457 basetype);
1459 }
1462 {
1466 else
1470 }
1473 }
1474 else
1475 {
1478 else
1483 }
1486 }
1488 /* This is like `expand_member_init', only it stores one aggregate
1489 value into another.
1491 INIT comes in two flavors: it is either a value which
1492 is to be stored in EXP, or it is a parameter list
1493 to go to a constructor, which will operate on EXP.
1494 If INIT is not a parameter list for a constructor, then set
1495 LOOKUP_ONLYCONVERTING.
1496 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1497 the initializer, if FLAGS is 0, then it is the (init) form.
1498 If `init' is a CONSTRUCTOR, then we emit a warning message,
1499 explaining that such initializations are invalid.
1501 If INIT resolves to a CALL_EXPR which happens to return
1502 something of the type we are looking for, then we know
1503 that we can safely use that call to perform the
1504 initialization.
1506 The virtual function table pointer cannot be set up here, because
1507 we do not really know its type.
1509 This never calls operator=().
1511 When initializing, nothing is CONST.
1513 A default copy constructor may have to be used to perform the
1514 initialization.
1516 A constructor or a conversion operator may have to be used to
1517 perform the initialization, but not both, as it would be ambiguous. */
1519 tree
1521 {
1522 tree stmt_expr;
1523 tree compound_stmt;
1544 {
1545 tree itype;
1547 /* An array may not be initialized use the parenthesized
1548 initialization form -- unless the initializer is "()". */
1550 {
1554 }
1555 /* Must arrange to initialize each element of EXP
1556 from elements of INIT. */
1566 complain);
1570 /* Restore the type of init unless it was used directly. */
1574 }
1578 /* Just know that we've seen something for this node. */
1592 }
1594 static void
1596 tsubst_flags_t complain)
1597 {
1599 tree ctor_name;
1601 /* It fails because there may not be a constructor which takes
1602 its own type as the first (or only parameter), but which does
1603 take other types via a conversion. So, if the thing initializing
1604 the expression is a unit element of type X, first try X(X&),
1605 followed by initialization by X. If neither of these work
1606 out, then look hard. */
1607 tree rval;
1610 /* If we have direct-initialization from an initializer list, pull
1611 it out of the TREE_LIST so the code below can see it. */
1614 {
1618 }
1622 /* A brace-enclosed initializer for an aggregate. In C++0x this can
1623 happen for direct-initialization, too. */
1626 /* A CONSTRUCTOR of the target's type is a previously digested
1627 initializer, whether that happened just above or in
1628 cp_parser_late_parsing_nsdmi.
1630 A TARGET_EXPR with TARGET_EXPR_DIRECT_INIT_P or TARGET_EXPR_LIST_INIT_P
1631 set represents the whole initialization, so we shouldn't build up
1632 another ctor call. */
1639 {
1640 /* Early initialization via a TARGET_EXPR only works for
1641 complete objects. */
1648 }
1652 {
1653 /* Base subobjects should only get direct-initialization. */
1657 /* Do nothing. We hit this in two cases: Reference initialization,
1658 where we aren't initializing a real variable, so we don't want
1659 to run a new constructor; and catching an exception, where we
1660 have already built up the constructor call so we could wrap it
1662 else
1667 /* We need to protect the initialization of a catch parm with a
1668 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
1669 around the TARGET_EXPR for the copy constructor. See
1670 initialize_handler_parm. */
1671 {
1675 }
1676 else
1681 }
1686 {
1690 }
1691 else
1696 {
1697 /* Delegating constructor. */
1698 tree complete;
1699 tree base;
1702 /* Unshare the arguments for the second call. */
1705 {
1708 }
1711 complain);
1717 complain);
1722 base,
1723 complete);
1724 }
1725 else
1726 {
1729 else
1732 complain);
1733 }
1739 {
1742 {
1746 }
1747 }
1749 /* FIXME put back convert_to_void? */
1752 }
1754 /* This function is responsible for initializing EXP with INIT
1755 (if any).
1757 BINFO is the binfo of the type for who we are performing the
1758 initialization. For example, if W is a virtual base class of A and B,
1759 and C : A, B.
1760 If we are initializing B, then W must contain B's W vtable, whereas
1761 were we initializing C, W must contain C's W vtable.
1763 TRUE_EXP is nonzero if it is the true expression being initialized.
1764 In this case, it may be EXP, or may just contain EXP. The reason we
1765 need this is because if EXP is a base element of TRUE_EXP, we
1766 don't necessarily know by looking at EXP where its virtual
1767 baseclass fields should really be pointing. But we do know
1768 from TRUE_EXP. In constructors, we don't know anything about
1769 the value being initialized.
1771 FLAGS is just passed to `build_new_method_call'. See that function
1772 for its description. */
1774 static void
1776 tsubst_flags_t complain)
1777 {
1783 /* Use a function returning the desired type to initialize EXP for us.
1784 If the function is a constructor, and its first argument is
1785 NULL_TREE, know that it was meant for us--just slide exp on
1786 in and expand the constructor. Constructors now come
1787 as TARGET_EXPRs. */
1791 {
1793 /* If store_init_value returns NULL_TREE, the INIT has been
1794 recorded as the DECL_INITIAL for EXP. That means there's
1795 nothing more we have to do. */
1801 }
1803 /* If an explicit -- but empty -- initializer list was present,
1804 that's value-initialization. */
1806 {
1807 /* If the type has data but no user-provided ctor, we need to zero
1808 out the object. */
1811 {
1814 /* Don't clobber already initialized virtual bases. */
1817 field_size);
1820 }
1822 /* If we don't need to mess with the constructor at all,
1823 then we're done. */
1827 /* Otherwise fall through and call the constructor. */
1829 }
1831 /* We know that expand_default_init can handle everything we want
1832 at this point. */
1834 }
1836 /* Report an error if TYPE is not a user-defined, class type. If
1837 OR_ELSE is nonzero, give an error message. */
1839 int
1841 {
1846 {
1850 }
1852 }
1854 tree
1856 {
1862 else
1864 }
1866 /* Build a reference to a member of an aggregate. This is not a C++
1867 `&', but really something which can have its address taken, and
1868 then act as a pointer to member, for example TYPE :: FIELD can have
1869 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if
1870 this expression is the operand of "&".
1872 @@ Prints out lousy diagnostics for operator <typename>
1873 @@ fields.
1875 @@ This function should be rewritten and placed in search.c. */
1877 tree
1879 tsubst_flags_t complain)
1880 {
1881 tree decl;
1884 /* class templates can come in as TEMPLATE_DECLs here. */
1897 /* Callers should call mark_used before this point. */
1902 {
1906 }
1908 /* Entities other than non-static members need no further
1909 processing. */
1916 {
1920 }
1922 /* Set up BASEBINFO for member lookup. */
1925 /* A lot of this logic is now handled in lookup_member. */
1927 {
1928 /* Go from the TREE_BASELINK to the member function info. */
1932 {
1933 /* Get rid of a potential OVERLOAD around it. */
1936 /* Unique functions are handled easily. */
1938 /* For non-static member of base class, we need a special rule
1939 for access checking [class.protected]:
1941 If the access is to form a pointer to member, the
1942 nested-name-specifier shall name the derived class
1943 (or any class derived from that class). */
1947 complain);
1948 else
1950 complain);
1955 }
1956 else
1958 }
1960 /* We need additional test besides the one in
1961 check_accessibility_of_qualified_id in case it is
1962 a pointer to non-static member. */
1964 complain);
1967 {
1968 /* If MEMBER is non-static, then the program has fallen afoul of
1969 [expr.prim]:
1971 An id-expression that denotes a nonstatic data member or
1972 nonstatic member function of a class can only be used:
1974 -- as part of a class member access (_expr.ref_) in which the
1975 object-expression refers to the member's class or a class
1976 derived from that class, or
1978 -- to form a pointer to member (_expr.unary.op_), or
1980 -- in the body of a nonstatic member function of that class or
1981 of a class derived from that class (_class.mfct.nonstatic_), or
1983 -- in a mem-initializer for a constructor for that class or for
1984 a class derived from that class (_class.base.init_). */
1986 {
1987 /* Build a representation of the qualified name suitable
1988 for use as the operand to "&" -- even though the "&" is
1989 not actually present. */
1991 /* In Microsoft mode, treat a non-static member function as if
1992 it were a pointer-to-member. */
1994 {
1997 }
2002 }
2004 {
2008 }
2010 }
2015 }
2017 /* If DECL is a scalar enumeration constant or variable with a
2018 constant initializer, return the initializer (or, its initializers,
2019 recursively); otherwise, return DECL. If STRICT_P, the
2020 initializer is only returned if DECL is a
2021 constant-expression. If RETURN_AGGREGATE_CST_OK_P, it is ok to
2022 return an aggregate constant. */
2024 static tree
2026 {
2028 || (strict_p
2032 {
2033 tree init;
2034 /* If DECL is a static data member in a template
2035 specialization, we must instantiate it here. The
2036 initializer for the static data member is not processed
2037 until needed; we need it now. */
2042 {
2044 /* Treat the error as a constant to avoid cascading errors on
2045 excessively recursive template instantiation (c++/9335). */
2047 else
2049 }
2050 /* Initializers in templates are generally expanded during
2051 instantiation, so before that for const int i(2)
2052 INIT is a TREE_LIST with the actual initializer as
2053 TREE_VALUE. */
2055 && init
2062 || (!return_aggregate_cst_ok_p
2063 /* Unless RETURN_AGGREGATE_CST_OK_P is true, do not
2064 return an aggregate constant (of which string
2065 literals are a special case), as we do not want
2066 to make inadvertent copies of such entities, and
2067 we must be sure that their addresses are the
2068 same everywhere. */
2073 }
2075 }
2077 /* If DECL is a CONST_DECL, or a constant VAR_DECL initialized by constant
2078 of integral or enumeration type, or a constexpr variable of scalar type,
2079 then return that value. These are those variables permitted in constant
2080 expressions by [5.19/1]. */
2082 tree
2084 {
2087 }
2089 /* Like scalar_constant_value, but can also return aggregate initializers. */
2091 tree
2093 {
2096 }
2098 /* A more relaxed version of scalar_constant_value, used by the
2099 common C/C++ code. */
2101 tree
2103 {
2106 }
2107 \f
2108 /* Common subroutines of build_new and build_vec_delete. */
2109 \f
2110 /* Build and return a NEW_EXPR. If NELTS is non-NULL, TYPE[NELTS] is
2111 the type of the object being allocated; otherwise, it's just TYPE.
2112 INIT is the initializer, if any. USE_GLOBAL_NEW is true if the
2113 user explicitly wrote "::operator new". PLACEMENT, if non-NULL, is
2114 a vector of arguments to be provided as arguments to a placement
2115 new operator. This routine performs no semantic checks; it just
2116 creates and returns a NEW_EXPR. */
2118 static tree
2121 {
2122 tree init_list;
2123 tree new_expr;
2125 /* If INIT is NULL, the we want to store NULL_TREE in the NEW_EXPR.
2126 If INIT is not NULL, then we want to store VOID_ZERO_NODE. This
2127 permits us to distinguish the case of a missing initializer "new
2128 int" from an empty initializer "new int()". */
2133 else
2138 init_list);
2143 }
2145 /* Diagnose uninitialized const members or reference members of type
2146 TYPE. USING_NEW is used to disambiguate the diagnostic between a
2147 new expression without a new-initializer and a declaration. Returns
2148 the error count. */
2150 static int
2153 {
2154 tree field;
2161 {
2162 tree field_type;
2173 {
2176 {
2178 {
2182 else
2184 }
2185 else
2186 {
2191 else
2194 }
2197 }
2198 }
2201 {
2204 {
2206 {
2210 else
2212 }
2213 else
2214 {
2219 else
2222 }
2225 }
2226 }
2229 error_count
2232 }
2234 }
2236 int
2238 {
2240 }
2242 /* Call __cxa_bad_array_new_length to indicate that the size calculation
2243 overflowed. Pretend it returns sizetype so that it plays nicely in the
2244 COND_EXPR. */
2246 tree
2248 {
2252 NULL_TREE));
2255 }
2257 /* Generate code for a new-expression, including calling the "operator
2258 new" function, initializing the object, and, if an exception occurs
2259 during construction, cleaning up. The arguments are as for
2260 build_raw_new_expr. This may change PLACEMENT and INIT. */
2262 static tree
2265 tsubst_flags_t complain)
2266 {
2268 /* True iff this is a call to "operator new[]" instead of just
2269 "operator new". */
2271 /* If ARRAY_P is true, the element type of the array. This is never
2272 an ARRAY_TYPE; for something like "new int[3][4]", the
2273 ELT_TYPE is "int". If ARRAY_P is false, this is the same type as
2274 TYPE. */
2275 tree elt_type;
2276 /* The type of the new-expression. (This type is always a pointer
2277 type.) */
2278 tree pointer_type;
2279 tree non_const_pointer_type;
2281 /* For arrays, a bounds checks on the NELTS parameter. */
2286 /* Size of the inner array elements. */
2287 offset_int inner_size;
2288 /* The address returned by the call to "operator new". This node is
2289 a VAR_DECL and is therefore reusable. */
2290 tree alloc_node;
2291 tree alloc_fn;
2295 /* If non-NULL, the number of extra bytes to allocate at the
2296 beginning of the storage allocated for an array-new expression in
2297 order to store the number of elements. */
2299 tree placement_first;
2301 /* True if the function we are calling is a placement allocation
2302 function. */
2304 /* True if the storage must be initialized, either by a constructor
2305 or due to an explicit new-initializer. */
2307 /* The address of the thing allocated, not including any cookie. In
2308 particular, if an array cookie is in use, DATA_ADDR is the
2309 address of the first array element. This node is a VAR_DECL, and
2310 is therefore reusable. */
2311 tree data_addr;
2316 {
2319 }
2321 {
2322 /* Transforms new (T[N]) to new T[N]. The former is a GNU
2323 extension for variable N. (This also covers new T where T is
2324 a VLA typedef.) */
2330 }
2332 /* If our base type is an array, then make sure we know how many elements
2333 it has. */
2337 {
2341 {
2346 {
2350 }
2352 }
2353 else
2354 {
2356 {
2360 }
2362 }
2366 inner_nelts_cst,
2367 complain);
2368 }
2371 {
2374 }
2379 /* Warn if we performed the (T[N]) to T[N] transformation and N is
2380 variable. */
2383 {
2385 {
2390 else
2395 }
2396 else
2398 }
2401 {
2405 }
2413 {
2415 /* A program that calls for default-initialization [...] of an
2416 entity of reference type is ill-formed. */
2420 /* A new-expression that creates an object of type T initializes
2421 that object as follows:
2422 - If the new-initializer is omitted:
2423 -- If T is a (possibly cv-qualified) non-POD class type
2424 (or array thereof), the object is default-initialized (8.5).
2425 [...]
2426 -- Otherwise, the object created has indeterminate
2427 value. If T is a const-qualified type, or a (possibly
2428 cv-qualified) POD class type (or array thereof)
2429 containing (directly or indirectly) a member of
2430 const-qualified type, the program is ill-formed; */
2440 }
2444 {
2448 }
2452 {
2453 /* Maximum available size in bytes. Half of the address space
2454 minus the cookie size. */
2455 offset_int max_size
2457 /* Maximum number of outer elements which can be allocated. */
2458 offset_int max_outer_nelts;
2459 tree max_outer_nelts_tree;
2465 /* Unconditionally subtract the cookie size. This decreases the
2466 maximum object size and is safe even if we choose not to use
2467 a cookie after all. */
2473 {
2477 }
2480 /* Only keep the top-most seven bits, to simplify encoding the
2481 constant in the instruction stream. */
2482 {
2486 shift);
2487 }
2492 outer_nelts,
2493 max_outer_nelts_tree);
2494 }
2498 /* If PLACEMENT is a single simple pointer type not passed by
2499 reference, prepare to capture it in a temporary variable. Do
2500 this now, since PLACEMENT will change in the calls below. */
2506 /* Allocate the object. */
2508 {
2509 tree class_addr;
2510 tree class_decl;
2514 {
2517 }
2526 {
2530 }
2532 {
2536 }
2541 }
2543 {
2546 }
2547 else
2548 {
2549 tree fnname;
2550 tree fns;
2556 && (array_p
2559 {
2560 /* Use a class-specific operator new. */
2561 /* If a cookie is required, add some extra space. */
2564 else
2565 {
2567 /* No size arithmetic necessary, so the size check is
2568 not needed. */
2571 }
2572 /* Perform the overflow check. */
2579 /* Create the argument list. */
2581 /* Do name-lookup to find the appropriate operator. */
2584 {
2588 }
2590 {
2592 {
2595 }
2597 }
2601 LOOKUP_NORMAL,
2603 complain);
2604 }
2605 else
2606 {
2607 /* Use a global operator new. */
2608 /* See if a cookie might be required. */
2610 {
2612 /* No size arithmetic necessary, so the size check is
2613 not needed. */
2616 }
2620 outer_nelts_check,
2622 }
2623 }
2630 /* If we found a simple case of PLACEMENT_EXPR above, then copy it
2631 into a temporary variable. */
2638 {
2643 {
2647 }
2648 }
2650 /* In the simple case, we can stop now. */
2655 /* Store the result of the allocation call in a variable so that we can
2656 use it more than once. */
2660 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */
2664 /* Now, check to see if this function is actually a placement
2665 allocation function. This can happen even when PLACEMENT is NULL
2666 because we might have something like:
2668 struct S { void* operator new (size_t, int i = 0); };
2670 A call to `new S' will get this allocation function, even though
2671 there is no explicit placement argument. If there is more than
2672 one argument, or there are variable arguments, then this is a
2673 placement allocation function. */
2674 placement_allocation_fn_p
2678 /* Preevaluate the placement args so that we don't reevaluate them for a
2679 placement delete. */
2681 {
2682 tree inits;
2686 alloc_expr);
2687 }
2689 /* unless an allocation function is declared with an empty excep-
2690 tion-specification (_except.spec_), throw(), it indicates failure to
2691 allocate storage by throwing a bad_alloc exception (clause _except_,
2692 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2693 cation function is declared with an empty exception-specification,
2694 throw(), it returns null to indicate failure to allocate storage and a
2695 non-null pointer otherwise.
2697 So check for a null exception spec on the op new we just called. */
2703 {
2704 tree cookie;
2705 tree cookie_ptr;
2706 tree size_ptr_type;
2708 /* Adjust so we're pointing to the start of the object. */
2711 /* Store the number of bytes allocated so that we can know how
2712 many elements to destroy later. We use the last sizeof
2713 (size_t) bytes to store the number of elements. */
2724 {
2725 /* Also store the element size. */
2736 }
2737 }
2738 else
2739 {
2742 }
2744 /* Now use a pointer to the type we've actually allocated. */
2746 /* But we want to operate on a non-const version to start with,
2747 since we'll be modifying the elements. */
2748 non_const_pointer_type = build_pointer_type
2752 /* Any further uses of alloc_node will want this type, too. */
2755 /* Now initialize the allocated object. Note that we preevaluate the
2756 initialization expression, apart from the actual constructor call or
2757 assignment--we do this because we want to delay the allocation as long
2758 as possible in order to minimize the size of the exception region for
2759 placement delete. */
2761 {
2766 {
2769 }
2772 {
2773 /* build_value_init doesn't work in templates, and we don't need
2774 the initializer anyway since we're going to throw it away and
2775 rebuild it at instantiation time, so just build up a single
2776 constructor call to get any appropriate diagnostics. */
2780 complete_ctor_identifier,
2782 LOOKUP_NORMAL,
2783 complain);
2785 }
2787 {
2791 {
2795 else
2796 {
2800 complain);
2801 else
2802 /* We'll check the length at runtime. */
2806 }
2807 }
2809 {
2813 else
2816 }
2817 init_expr
2821 integer_one_node,
2822 complain),
2823 vecinit,
2824 explicit_value_init_p,
2826 complain);
2828 /* An array initialization is stable because the initialization
2829 of each element is a full-expression, so the temporaries don't
2830 leak out. */
2832 }
2833 else
2834 {
2838 {
2840 complete_ctor_identifier,
2842 LOOKUP_NORMAL,
2843 complain);
2844 }
2846 {
2847 /* Something like `new int()'. */
2852 }
2853 else
2854 {
2855 tree ie;
2857 /* We are processing something like `new int (10)', which
2858 means allocate an int, and initialize it with 10. */
2861 complain);
2863 complain);
2864 }
2866 }
2871 /* If any part of the object initialization terminates by throwing an
2872 exception and a suitable deallocation function can be found, the
2873 deallocation function is called to free the memory in which the
2874 object was being constructed, after which the exception continues
2875 to propagate in the context of the new-expression. If no
2876 unambiguous matching deallocation function can be found,
2877 propagating the exception does not cause the object's memory to be
2878 freed. */
2880 {
2882 tree cleanup;
2884 /* The Standard is unclear here, but the right thing to do
2885 is to use the same method for finding deallocation
2886 functions that we use for finding allocation functions. */
2887 cleanup = (build_op_delete_call
2889 alloc_node,
2890 size,
2891 globally_qualified_p,
2893 alloc_fn,
2894 complain));
2899 /* This is much simpler if we were able to preevaluate all of
2900 the arguments to the constructor call. */
2901 {
2902 /* CLEANUP is compiler-generated, so no diagnostics. */
2906 /* Likewise, this try-catch is compiler-generated. */
2908 }
2909 else
2910 /* Ack! First we allocate the memory. Then we set our sentry
2911 variable to true, and expand a cleanup that deletes the
2912 memory if sentry is true. Then we run the constructor, and
2913 finally clear the sentry.
2915 We need to do this because we allocate the space first, so
2916 if there are any temporaries with cleanups in the
2917 constructor args and we weren't able to preevaluate them, we
2918 need this EH region to extend until end of full-expression
2919 to preserve nesting. */
2920 {
2928 /* CLEANUP is compiler-generated, so no diagnostics. */
2938 init_expr
2941 end));
2942 /* Likewise, this is compiler-generated. */
2944 }
2945 }
2946 }
2947 else
2950 /* Now build up the return value in reverse order. */
2960 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
2961 and return the call (which doesn't need to be adjusted). */
2963 else
2964 {
2966 {
2969 nullptr_node,
2970 complain);
2973 }
2975 /* Perform the allocation before anything else, so that ALLOC_NODE
2976 has been initialized before we start using it. */
2978 }
2983 /* A new-expression is never an lvalue. */
2987 }
2989 /* Generate a representation for a C++ "new" expression. *PLACEMENT
2990 is a vector of placement-new arguments (or NULL if none). If NELTS
2991 is NULL, TYPE is the type of the storage to be allocated. If NELTS
2992 is not NULL, then this is an array-new allocation; TYPE is the type
2993 of the elements in the array and NELTS is the number of elements in
2994 the array. *INIT, if non-NULL, is the initializer for the new
2995 object, or an empty vector to indicate an initializer of "()". If
2996 USE_GLOBAL_NEW is true, then the user explicitly wrote "::new"
2997 rather than just "new". This may change PLACEMENT and INIT. */
2999 tree
3002 {
3003 tree rval;
3012 /* Don't do auto deduction where it might affect mangling. */
3014 {
3017 {
3021 }
3022 }
3025 {
3032 use_global_new);
3043 }
3046 {
3048 {
3051 else
3053 }
3056 }
3058 /* ``A reference cannot be created by the new operator. A reference
3059 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
3060 returned by new.'' ARM 5.3.3 */
3062 {
3065 else
3068 }
3071 {
3075 }
3077 /* The type allocated must be complete. If the new-type-id was
3078 "T[N]" then we are just checking that "T" is complete here, but
3079 that is equivalent, since the value of "N" doesn't matter. */
3088 {
3094 }
3096 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
3101 }
3103 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
3105 tree
3107 {
3113 {
3116 {
3119 }
3121 }
3123 /* Mangle the class$ field. */
3124 {
3125 tree field;
3128 {
3132 }
3134 {
3137 }
3138 }
3142 {
3152 }
3154 }
3155 \f
3156 static tree
3158 special_function_kind auto_delete_vec,
3160 {
3161 tree virtual_size;
3163 tree size_exp;
3165 /* Temporary variables used by the loop. */
3168 /* This is the body of the loop that implements the deletion of a
3169 single element, and moves temp variables to next elements. */
3170 tree body;
3172 /* This is the LOOP_EXPR that governs the deletion of the elements. */
3175 /* This is the thing that governs what to do after the loop has run. */
3178 /* This is the BIND_EXPR which holds the outermost iterator of the
3179 loop. It is convenient to set this variable up and test it before
3180 executing any other code in the loop.
3181 This is also the containing expression returned by this function. */
3183 tree tmp;
3185 /* We should only have 1-D arrays here. */
3192 {
3195 "possible problem detected in invocation of "
3197 {
3200 "class-specific operator delete [] will be called, "
3202 }
3203 /* This size won't actually be used. */
3206 }
3213 {
3214 /* Make sure the destructor is callable. */
3216 {
3219 complain);
3222 }
3224 }
3226 /* The below is short by the cookie size. */
3231 tbase_init
3235 base),
3236 virtual_size),
3237 complain);
3255 complain);
3263 no_destructor:
3264 /* Delete the storage if appropriate. */
3266 {
3267 tree base_tbd;
3269 /* The below is short by the cookie size. */
3274 /* no header */
3276 else
3277 {
3278 tree cookie_size;
3282 MINUS_EXPR,
3285 cookie_size,
3286 complain);
3290 /* True size with header. */
3292 }
3299 complain);
3300 }
3304 ;
3307 else
3313 /* Outermost wrapper: If pointer is null, punt. */
3318 nullptr_node)),
3323 {
3326 }
3329 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
3333 }
3335 /* Create an unnamed variable of the indicated TYPE. */
3337 tree
3339 {
3340 tree decl;
3350 }
3352 /* Create a new temporary variable of the indicated TYPE, initialized
3353 to INIT.
3355 It is not entered into current_binding_level, because that breaks
3356 things when it comes time to do final cleanups (which take place
3357 "outside" the binding contour of the function). */
3359 tree
3361 {
3362 tree decl;
3368 tf_warning_or_error));
3371 }
3373 /* `build_vec_init' returns tree structure that performs
3374 initialization of a vector of aggregate types.
3376 BASE is a reference to the vector, of ARRAY_TYPE, or a pointer
3377 to the first element, of POINTER_TYPE.
3378 MAXINDEX is the maximum index of the array (one less than the
3379 number of elements). It is only used if BASE is a pointer or
3380 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
3382 INIT is the (possibly NULL) initializer.
3384 If EXPLICIT_VALUE_INIT_P is true, then INIT must be NULL. All
3385 elements in the array are value-initialized.
3387 FROM_ARRAY is 0 if we should init everything with INIT
3388 (i.e., every element initialized from INIT).
3389 FROM_ARRAY is 1 if we should index into INIT in parallel
3390 with initialization of DECL.
3391 FROM_ARRAY is 2 if we should index into INIT in parallel,
3392 but use assignment instead of initialization. */
3394 tree
3398 {
3399 tree rval;
3402 tree iterator;
3403 /* The type of BASE. */
3405 /* The type of an element in the array. */
3407 /* The element type reached after removing all outer array
3408 types. */
3409 tree inner_elt_type;
3410 /* The type of a pointer to an element in the array. */
3411 tree ptype;
3412 tree stmt_expr;
3413 tree compound_stmt;
3433 /* Look through the TARGET_EXPR around a compound literal. */
3439 /* If we have a braced-init-list, make sure that the array
3440 is big enough for all the initializers. */
3453 /* Don't do this if the CONSTRUCTOR might contain something
3454 that might throw and require us to clean up. */
3458 {
3459 /* Do non-default initialization of trivial arrays resulting from
3460 brace-enclosed initializers. In this case, digest_init and
3461 store_constructor will handle the semantics for us. */
3467 }
3471 {
3477 }
3478 else
3481 /* The code we are generating looks like:
3482 ({
3483 T* t1 = (T*) base;
3484 T* rval = t1;
3485 ptrdiff_t iterator = maxindex;
3486 try {
3487 for (; iterator != -1; --iterator) {
3488 ... initialize *t1 ...
3489 ++t1;
3490 }
3491 } catch (...) {
3492 ... destroy elements that were constructed ...
3493 }
3494 rval;
3495 })
3497 We can omit the try and catch blocks if we know that the
3498 initialization will never throw an exception, or if the array
3499 elements do not have destructors. We can omit the loop completely if
3500 the elements of the array do not have constructors.
3502 We actually wrap the entire body of the above in a STMT_EXPR, for
3503 tidiness.
3505 When copying from array to another, when the array elements have
3506 only trivial copy constructors, we should use __builtin_memcpy
3507 rather than generating a loop. That way, we could take advantage
3508 of whatever cleverness the back end has for dealing with copies
3509 of blocks of memory. */
3518 /* If initializing one array from another, initialize element by
3519 element. We rely upon the below calls to do the argument
3520 checking. Evaluate the initializer before entering the try block. */
3522 {
3531 }
3533 /* Protect the entire array initialization so that we can destroy
3534 the partially constructed array if an exception is thrown.
3535 But don't do this if we're assigning. */
3538 {
3540 }
3542 /* Should we try to create a constant initializer? */
3546 : (type_has_constexpr_default_constructor
3552 /* If we're initializing a static array, we want to do static
3553 initialization of any elements with constant initializers even if
3554 some are non-constant. */
3560 /* Skip over the handling of non-empty init lists. */
3563 /* Maybe pull out constant value when from_array? */
3566 {
3567 /* Do non-default initialization of non-trivial arrays resulting from
3568 brace-enclosed initializers. */
3571 /* If the constructor already has the array type, it's been through
3572 digest_init, so we shouldn't try to do anything more. */
3577 {
3580 {
3582 {
3584 nelts);
3588 }
3589 /* Don't check an array new when -fno-exceptions. */
3590 }
3593 {
3594 /* Make sure the last element of the initializer is in bounds. */
3595 finish_expr_stmt
3596 (ubsan_instrument_bounds
3598 }
3599 }
3605 {
3607 tree one_init;
3609 num_initialized_elts++;
3616 else
3622 {
3625 {
3629 else
3631 }
3632 else
3633 {
3635 {
3640 }
3642 }
3643 }
3652 else
3656 complain);
3659 else
3661 }
3663 /* Any elements without explicit initializers get T{}. */
3665 }
3667 {
3672 {
3676 }
3677 }
3679 /* Now, default-initialize any remaining elements. We don't need to
3680 do that if a) the type does not need constructing, or b) we've
3681 already initialized all the elements.
3683 We do need to keep going if we're copying an array. */
3686 /* With a constexpr default constructor, which we checked for when
3687 setting try_const above, default-initialization is equivalent to
3688 value-initialization, and build_value_init gives us something more
3689 friendly to maybe_constant_init. */
3694 && (num_initialized_elts
3696 {
3697 /* If the ITERATOR is equal to -1, then we don't have to loop;
3698 we've already initialized all the elements. */
3699 tree for_stmt;
3700 tree elt_init;
3701 tree to;
3709 complain);
3716 /* If the initializer is {}, then all elements are initialized from T{}.
3717 But for non-classes, that's the same as value-initialization. */
3719 {
3721 {
3723 }
3724 else
3725 {
3728 }
3729 }
3732 {
3733 tree from;
3736 {
3740 }
3741 else
3746 complain);
3751 complain);
3752 else
3754 }
3756 {
3758 sorry
3762 explicit_value_init_p,
3764 }
3766 {
3770 }
3771 else
3772 {
3776 else
3777 {
3780 complain);
3782 }
3783 }
3789 {
3790 /* FIXME refs to earlier elts */
3793 {
3795 /* Don't fill the CONSTRUCTOR with zeros. */
3799 }
3800 else
3801 {
3805 else
3807 }
3810 {
3813 {
3816 }
3817 }
3818 }
3826 complain));
3829 complain));
3832 }
3834 /* Make sure to cleanup any partially constructed elements. */
3837 {
3838 tree e;
3841 complain);
3843 /* Flatten multi-dimensional array since build_vec_delete only
3844 expects one-dimensional array. */
3848 /* Avoid mixing signed and unsigned. */
3851 complain);
3860 }
3862 /* The value of the array initialization is the array itself, RVAL
3863 is a pointer to the first element. */
3874 {
3876 {
3879 }
3882 else
3884 }
3886 /* Now make the result have the correct type. */
3888 {
3893 }
3896 }
3898 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
3899 build_delete. */
3901 static tree
3903 tsubst_flags_t complain)
3904 {
3905 tree name;
3906 tree fn;
3908 {
3923 }
3928 flags,
3930 complain);
3931 }
3933 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
3934 ADDR is an expression which yields the store to be destroyed.
3935 AUTO_DELETE is the name of the destructor to call, i.e., either
3936 sfk_complete_destructor, sfk_base_destructor, or
3937 sfk_deleting_destructor.
3939 FLAGS is the logical disjunction of zero or more LOOKUP_
3940 flags. See cp-tree.h for more info. */
3942 tree
3945 {
3946 tree expr;
3953 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
3954 set to `error_mark_node' before it gets properly cleaned up. */
3962 {
3964 {
3968 }
3971 }
3974 {
3977 /* We don't want to warn about delete of void*, only other
3978 incomplete types. Deleting other incomplete types
3979 invokes undefined behavior, but it is not ill-formed, so
3980 compile to something that would even do The Right Thing
3981 (TM) should the type have a trivial dtor and no delete
3982 operator. */
3984 {
3987 {
3990 "possible problem detected in invocation of "
3992 {
3995 "neither the destructor nor the class-specific "
3996 "operator delete will be called, even if they are "
3998 }
3999 }
4003 {
4004 tree dtor;
4007 {
4010 "deleting object of abstract class type %qT"
4011 " which has non-virtual destructor"
4013 else
4015 "deleting object of polymorphic class type %qT"
4016 " which has non-virtual destructor"
4018 }
4019 }
4020 }
4024 /* Throw away const and volatile on target type of addr. */
4026 }
4027 else
4028 {
4029 /* Don't check PROTECT here; leave that decision to the
4030 destructor. If the destructor is accessible, call it,
4031 else report error. */
4039 }
4042 {
4043 /* Make sure the destructor is callable. */
4045 {
4047 complain),
4051 }
4058 use_global_delete,
4061 complain);
4062 }
4063 else
4064 {
4067 tree ifexp;
4072 /* For `::delete x', we must not use the deleting destructor
4073 since then we would not be sure to get the global `operator
4074 delete'. */
4076 {
4077 /* We will use ADDR multiple times so we must save it. */
4080 /* Delete the object. */
4082 head,
4087 complain);
4088 /* Otherwise, treat this like a complete object destructor
4089 call. */
4091 }
4092 /* If the destructor is non-virtual, there is no deleting
4093 variant. Instead, we must explicitly call the appropriate
4094 `operator delete' here. */
4097 {
4098 /* We will use ADDR multiple times so we must save it. */
4100 /* Build the call. */
4102 addr,
4107 complain);
4108 /* Call the complete object destructor. */
4110 }
4113 {
4114 /* Make sure we have access to the member op delete, even though
4115 we'll actually be calling it from the destructor. */
4120 complain);
4121 }
4130 /* We need to calculate this before the dtor changes the vptr. */
4135 /* Explicit destructor call; don't check for null pointer. */
4137 else
4138 {
4139 /* Handle deleting a null pointer. */
4142 complain));
4145 }
4151 }
4152 }
4154 /* At the beginning of a destructor, push cleanups that will call the
4155 destructors for our base classes and members.
4157 Called from begin_destructor_body. */
4159 void
4161 {
4164 tree member;
4165 tree expr;
4168 /* Run destructors for all virtual baseclasses. */
4170 {
4171 tree cond = (condition_conversion
4173 current_in_charge_parm,
4174 integer_two_node)));
4176 /* The CLASSTYPE_VBASECLASSES vector is in initialization
4177 order, which is also the right order for pushing cleanups. */
4180 {
4182 {
4184 base_dtor_identifier,
4185 NULL,
4186 base_binfo,
4187 (LOOKUP_NORMAL
4189 tf_warning_or_error);
4191 {
4195 }
4196 }
4197 }
4198 }
4200 /* Take care of the remaining baseclasses. */
4203 {
4209 base_dtor_identifier,
4212 tf_warning_or_error);
4215 }
4217 /* Don't automatically destroy union members. */
4223 {
4232 {
4233 tree this_member = (build_class_member_access_expr
4237 tf_warning_or_error));
4239 sfk_complete_destructor,
4244 }
4245 }
4246 }
4248 /* Build a C++ vector delete expression.
4249 MAXINDEX is the number of elements to be deleted.
4250 ELT_SIZE is the nominal size of each element in the vector.
4251 BASE is the expression that should yield the store to be deleted.
4252 This function expands (or synthesizes) these calls itself.
4253 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
4255 This also calls delete for virtual baseclasses of elements of the vector.
4257 Update: MAXINDEX is no longer needed. The size can be extracted from the
4258 start of the vector for pointers, and from the type for arrays. We still
4259 use MAXINDEX for arrays because it happens to already have one of the
4260 values we'd have to extract. (We could use MAXINDEX with pointers to
4261 confirm the size, and trap if the numbers differ; not clear that it'd
4262 be worth bothering.) */
4264 tree
4266 special_function_kind auto_delete_vec,
4268 {
4269 tree type;
4270 tree rval;
4276 {
4277 /* Step back one from start of vector, and read dimension. */
4278 tree cookie_addr;
4283 {
4286 }
4291 cookie_addr);
4293 }
4295 {
4296 /* Get the total number of things in the array, maxindex is a
4297 bad name. */
4304 {
4307 }
4308 }
4309 else
4310 {
4314 }
4322 }