| blob | aa964b9e8e3ac2cf1374fa6a6fbbd2a0a4cccbe9 |
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. */
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 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. */
538 tree
540 {
541 tree init;
546 {
547 /* Use a PLACEHOLDER_EXPR when we don't have a 'this' parameter to
548 refer to; constexpr evaluation knows what to do with it. */
551 }
554 {
559 /* Check recursive instantiation. */
561 {
565 }
566 else
567 {
570 /* Do deferred instantiation of the NSDMI. */
571 init = (tsubst_copy_and_build
578 }
579 }
580 else
581 {
584 {
585 unparsed:
590 }
591 /* Strip redundant TARGET_EXPR so we don't need to remap it, and
592 so the aggregate init code below will see a CONSTRUCTOR. */
597 }
601 }
603 /* Initialize MEMBER, a FIELD_DECL, with INIT, a TREE_LIST of
604 arguments. If TREE_LIST is void_type_node, an empty initializer
605 list was given; if NULL_TREE no initializer was given. */
607 static void
609 {
610 tree decl;
613 /* Use the non-static data member initializer if there was no
614 mem-initializer for this field. */
621 /* Effective C++ rule 12 requires that all data members be
622 initialized. */
626 member);
628 /* Get an lvalue for the data member. */
632 tf_warning_or_error);
638 {
640 /* Handle references. */
647 member);
648 }
651 {
652 /* mem() means value-initialization. */
654 {
658 }
659 else
660 {
666 }
667 }
668 /* Deal with this here, as we will get confused if we try to call the
669 assignment op for an anonymous union. This can happen in a
670 synthesized copy constructor. */
672 {
674 {
677 }
678 }
681 /* Pre-digested NSDMI. */
684 /* { } mem-initializer. */
689 {
690 /* With references and list-initialization, we need to deal with
691 extending temporary lifetimes. 12.2p5: "A temporary bound to a
692 reference member in a constructor’s ctor-initializer (12.6.2)
693 persists until the constructor exits." */
698 tf_warning_or_error);
700 {
705 }
708 /* A FIELD_DECL doesn't really have a suitable lifetime, but
709 make_temporary_var_for_ref_to_temp will treat it as automatic and
710 set_up_extended_ref_temp wants to use the decl in a warning. */
720 }
723 {
725 {
727 {
730 else
734 }
738 {
742 }
743 else
745 }
746 else
747 {
754 {
755 /* TYPE_NEEDS_CONSTRUCTING can be set just because we have a
756 vtable; still give this diagnostic. */
761 }
763 tf_warning_or_error));
764 }
765 }
766 else
767 {
769 {
770 tree core_type;
771 /* member traversal: note it leaves init NULL */
773 {
778 }
780 {
785 }
795 }
797 /* There was an explicit member initialization. Do some work
798 in that case. */
800 tf_warning_or_error);
804 tf_warning_or_error));
805 }
808 {
809 tree expr;
814 tf_warning_or_error);
817 tf_warning_or_error);
822 }
823 }
825 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
826 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
828 static tree
830 {
831 tree fields;
833 /* Note whether or not T is a union. */
838 {
839 tree fieldtype;
841 /* Skip CONST_DECLs for enumeration constants and so forth. */
846 /* Keep track of whether or not any fields are unions. */
850 /* For an anonymous struct or union, we must recursively
851 consider the fields of the anonymous type. They can be
852 directly initialized from the constructor. */
854 {
855 /* Add this field itself. Synthesized copy constructors
856 initialize the entire aggregate. */
858 /* And now add the fields in the anonymous aggregate. */
860 }
861 /* Add this field. */
864 }
867 }
869 /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives
870 a FIELD_DECL or BINFO in T that needs initialization. The
871 TREE_VALUE gives the initializer, or list of initializer arguments.
873 Return a TREE_LIST containing all of the initializations required
874 for T, in the order in which they should be performed. The output
875 list has the same format as the input. */
877 static tree
879 {
880 tree init;
882 tree sorted_inits;
883 tree next_subobject;
888 /* Build up a list of initializations. The TREE_PURPOSE of entry
889 will be the subobject (a FIELD_DECL or BINFO) to initialize. The
890 TREE_VALUE will be the constructor arguments, or NULL if no
891 explicit initialization was provided. */
894 /* Process the virtual bases. */
899 /* Process the direct bases. */
905 /* Process the non-static data members. */
907 /* Reverse the entire list of initializations, so that they are in
908 the order that they will actually be performed. */
911 /* If the user presented the initializers in an order different from
912 that in which they will actually occur, we issue a warning. Keep
913 track of the next subobject which can be explicitly initialized
914 without issuing a warning. */
917 /* Go through the explicit initializers, filling in TREE_PURPOSE in
918 the SORTED_INITS. */
920 {
921 tree subobject;
922 tree subobject_init;
926 /* If the explicit initializers are in sorted order, then
927 SUBOBJECT will be NEXT_SUBOBJECT, or something following
928 it. */
930 subobject_init;
935 /* Issue a warning if the explicit initializer order does not
936 match that which will actually occur.
937 ??? Are all these on the correct lines? */
939 {
943 else
948 else
952 }
954 /* Look again, from the beginning of the list. */
956 {
960 }
962 /* It is invalid to initialize the same subobject more than
963 once. */
965 {
969 subobject);
970 else
973 subobject);
974 }
976 /* Record the initialization. */
979 }
981 /* [class.base.init]
983 If a ctor-initializer specifies more than one mem-initializer for
984 multiple members of the same union (including members of
985 anonymous unions), the ctor-initializer is ill-formed.
987 Here we also splice out uninitialized union members. */
989 {
993 {
994 tree field;
995 tree ctx;
1001 /* Skip base classes. */
1005 /* If this is an anonymous union with no explicit initializer,
1006 splice it out. */
1010 /* See if this field is a member of a union, or a member of a
1011 structure contained in a union, etc. */
1018 /* If this field is not a member of a union, skip it. */
1022 /* If this union member has no explicit initializer and no NSDMI,
1023 splice it out. */
1026 else
1029 /* It's only an error if we have two initializers for the same
1030 union type. */
1032 {
1035 }
1037 /* See if LAST_FIELD and the field initialized by INIT are
1038 members of the same union. If so, there's a problem,
1039 unless they're actually members of the same structure
1040 which is itself a member of a union. For example, given:
1042 union { struct { int i; int j; }; };
1044 initializing both `i' and `j' makes sense. */
1049 {
1050 /* A mem-initializer hides an NSDMI. */
1055 else
1056 {
1059 ctx);
1061 }
1062 }
1066 next:
1069 splice:
1072 }
1073 }
1076 }
1078 /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS
1079 is a TREE_LIST giving the explicit mem-initializer-list for the
1080 constructor. The TREE_PURPOSE of each entry is a subobject (a
1081 FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE
1082 is a TREE_LIST giving the arguments to the constructor or
1083 void_type_node for an empty list of arguments. */
1085 void
1087 {
1090 /* We will already have issued an error message about the fact that
1091 the type is incomplete. */
1098 {
1099 /* Delegating constructor. */
1103 }
1109 /* Sort the mem-initializers into the order in which the
1110 initializations should be performed. */
1115 /* Initialize base classes. */
1119 {
1123 /* We already have issued an error message. */
1128 {
1129 /* If these initializations are taking place in a copy constructor,
1130 the base class should probably be explicitly initialized if there
1131 is a user-defined constructor in the base class (other than the
1132 default constructor, which will be called anyway). */
1140 }
1142 /* Initialize the base. */
1145 else
1146 {
1147 tree base_addr;
1153 tf_warning_or_error),
1154 arguments,
1155 flags,
1156 tf_warning_or_error);
1158 }
1159 }
1162 /* Initialize the vptrs. */
1165 /* Initialize the data members. */
1167 {
1171 }
1172 }
1174 /* Returns the address of the vtable (i.e., the value that should be
1175 assigned to the vptr) for BINFO. */
1177 tree
1179 {
1181 tree vtbl;
1184 /* If this is a virtual primary base, then the vtable we want to store
1185 is that for the base this is being used as the primary base of. We
1186 can't simply skip the initialization, because we may be expanding the
1187 inits of a subobject constructor where the virtual base layout
1188 can be different. */
1192 /* Figure out what vtable BINFO's vtable is based on, and mark it as
1193 used. */
1197 /* Now compute the address to use when initializing the vptr. */
1203 }
1205 /* This code sets up the virtual function tables appropriate for
1206 the pointer DECL. It is a one-ply initialization.
1208 BINFO is the exact type that DECL is supposed to be. In
1209 multiple inheritance, this might mean "C's A" if C : A, B. */
1211 static void
1213 {
1215 tree vtt_index;
1217 /* Compute the initializer for vptr. */
1220 /* We may get this vptr from a VTT, if this is a subobject
1221 constructor or subobject destructor. */
1224 {
1225 tree vtbl2;
1226 tree vtt_parm;
1228 /* Compute the value to use, when there's a VTT. */
1234 /* The actual initializer is the VTT value only in the subobject
1235 constructor. In maybe_clone_body we'll substitute NULL for
1236 the vtt_parm in the case of the non-subobject constructor. */
1241 vtbl2,
1242 vtbl);
1243 }
1245 /* Compute the location of the vtpr. */
1247 tf_warning_or_error),
1251 /* Assign the vtable to the vptr. */
1254 tf_warning_or_error));
1255 }
1257 /* If an exception is thrown in a constructor, those base classes already
1258 constructed must be destroyed. This function creates the cleanup
1259 for BINFO, which has just been constructed. If FLAG is non-NULL,
1260 it is a DECL which is nonzero when this base needs to be
1261 destroyed. */
1263 static void
1265 {
1266 tree expr;
1271 /* Call the destructor. */
1273 base_dtor_identifier,
1274 NULL,
1275 binfo,
1277 tf_warning_or_error);
1289 }
1291 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its
1292 constructor. */
1294 static void
1296 {
1297 tree inner_if_stmt;
1298 tree exp;
1299 tree flag;
1301 /* If there are virtual base classes with destructors, we need to
1302 emit cleanups to destroy them if an exception is thrown during
1303 the construction process. These exception regions (i.e., the
1304 period during which the cleanups must occur) begin from the time
1305 the construction is complete to the end of the function. If we
1306 create a conditional block in which to initialize the
1307 base-classes, then the cleanup region for the virtual base begins
1308 inside a block, and ends outside of that block. This situation
1309 confuses the sjlj exception-handling code. Therefore, we do not
1310 create a single conditional block, but one for each
1311 initialization. (That way the cleanup regions always begin
1312 in the outer block.) We trust the back end to figure out
1313 that the FLAG will not change across initializations, and
1314 avoid doing multiple tests. */
1319 /* Compute the location of the virtual base. If we're
1320 constructing virtual bases, then we must be the most derived
1321 class. Therefore, we don't have to look up the virtual base;
1322 we already know where it is. */
1331 }
1333 /* Find the context in which this FIELD can be initialized. */
1335 static tree
1337 {
1340 /* Anonymous union members can be initialized in the first enclosing
1341 non-anonymous union context. */
1345 }
1347 /* Function to give error message if member initialization specification
1348 is erroneous. FIELD is the member we decided to initialize.
1349 TYPE is the type for which the initialization is being performed.
1350 FIELD must be a member of TYPE.
1352 MEMBER_NAME is the name of the member. */
1354 static int
1356 {
1360 {
1362 member_name);
1364 }
1366 {
1369 field);
1371 }
1373 {
1377 }
1379 {
1381 member_name);
1383 }
1386 }
1388 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it
1389 is a _TYPE node or TYPE_DECL which names a base for that type.
1390 Check the validity of NAME, and return either the base _TYPE, base
1391 binfo, or the FIELD_DECL of the member. If NAME is invalid, return
1392 NULL_TREE and issue a diagnostic.
1394 An old style unnamed direct single base construction is permitted,
1395 where NAME is NULL. */
1397 tree
1399 {
1400 tree basetype;
1401 tree field;
1407 {
1408 /* This is an obsolete unnamed base class initializer. The
1409 parser will already have warned about its use. */
1411 {
1414 current_class_type);
1417 basetype = BINFO_TYPE
1422 current_class_type);
1424 }
1425 }
1427 {
1430 }
1433 else
1437 {
1438 tree class_binfo;
1439 tree direct_binfo;
1440 tree virtual_binfo;
1451 /* Look for a direct base. */
1456 /* Look for a virtual base -- unless the direct base is itself
1457 virtual. */
1461 /* [class.base.init]
1463 If a mem-initializer-id is ambiguous because it designates
1464 both a direct non-virtual base class and an inherited virtual
1465 base class, the mem-initializer is ill-formed. */
1467 {
1469 basetype);
1471 }
1474 {
1478 else
1482 }
1485 }
1486 else
1487 {
1490 else
1495 }
1498 }
1500 /* This is like `expand_member_init', only it stores one aggregate
1501 value into another.
1503 INIT comes in two flavors: it is either a value which
1504 is to be stored in EXP, or it is a parameter list
1505 to go to a constructor, which will operate on EXP.
1506 If INIT is not a parameter list for a constructor, then set
1507 LOOKUP_ONLYCONVERTING.
1508 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1509 the initializer, if FLAGS is 0, then it is the (init) form.
1510 If `init' is a CONSTRUCTOR, then we emit a warning message,
1511 explaining that such initializations are invalid.
1513 If INIT resolves to a CALL_EXPR which happens to return
1514 something of the type we are looking for, then we know
1515 that we can safely use that call to perform the
1516 initialization.
1518 The virtual function table pointer cannot be set up here, because
1519 we do not really know its type.
1521 This never calls operator=().
1523 When initializing, nothing is CONST.
1525 A default copy constructor may have to be used to perform the
1526 initialization.
1528 A constructor or a conversion operator may have to be used to
1529 perform the initialization, but not both, as it would be ambiguous. */
1531 tree
1533 {
1534 tree stmt_expr;
1535 tree compound_stmt;
1556 {
1557 tree itype;
1559 /* An array may not be initialized use the parenthesized
1560 initialization form -- unless the initializer is "()". */
1562 {
1566 }
1567 /* Must arrange to initialize each element of EXP
1568 from elements of INIT. */
1578 complain);
1582 /* Restore the type of init unless it was used directly. */
1586 }
1590 /* Just know that we've seen something for this node. */
1604 }
1606 static void
1608 tsubst_flags_t complain)
1609 {
1611 tree ctor_name;
1613 /* It fails because there may not be a constructor which takes
1614 its own type as the first (or only parameter), but which does
1615 take other types via a conversion. So, if the thing initializing
1616 the expression is a unit element of type X, first try X(X&),
1617 followed by initialization by X. If neither of these work
1618 out, then look hard. */
1619 tree rval;
1622 /* If we have direct-initialization from an initializer list, pull
1623 it out of the TREE_LIST so the code below can see it. */
1626 {
1630 }
1634 /* A brace-enclosed initializer for an aggregate. In C++0x this can
1635 happen for direct-initialization, too. */
1636 {
1639 }
1641 /* A CONSTRUCTOR of the target's type is a previously digested
1642 initializer, whether that happened just above or in
1643 cp_parser_late_parsing_nsdmi.
1645 A TARGET_EXPR with TARGET_EXPR_DIRECT_INIT_P or TARGET_EXPR_LIST_INIT_P
1646 set represents the whole initialization, so we shouldn't build up
1647 another ctor call. */
1654 {
1655 /* Early initialization via a TARGET_EXPR only works for
1656 complete objects. */
1663 }
1667 {
1668 /* Base subobjects should only get direct-initialization. */
1672 /* Do nothing. We hit this in two cases: Reference initialization,
1673 where we aren't initializing a real variable, so we don't want
1674 to run a new constructor; and catching an exception, where we
1675 have already built up the constructor call so we could wrap it
1677 else
1682 /* We need to protect the initialization of a catch parm with a
1683 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
1684 around the TARGET_EXPR for the copy constructor. See
1685 initialize_handler_parm. */
1686 {
1690 }
1691 else
1696 }
1701 {
1705 }
1706 else
1711 {
1712 /* Delegating constructor. */
1713 tree complete;
1714 tree base;
1717 /* Unshare the arguments for the second call. */
1720 {
1723 }
1726 complain);
1732 complain);
1737 base,
1738 complete);
1739 }
1740 else
1741 {
1744 else
1747 complain);
1748 }
1754 {
1757 {
1761 }
1762 }
1764 /* FIXME put back convert_to_void? */
1767 }
1769 /* This function is responsible for initializing EXP with INIT
1770 (if any).
1772 BINFO is the binfo of the type for who we are performing the
1773 initialization. For example, if W is a virtual base class of A and B,
1774 and C : A, B.
1775 If we are initializing B, then W must contain B's W vtable, whereas
1776 were we initializing C, W must contain C's W vtable.
1778 TRUE_EXP is nonzero if it is the true expression being initialized.
1779 In this case, it may be EXP, or may just contain EXP. The reason we
1780 need this is because if EXP is a base element of TRUE_EXP, we
1781 don't necessarily know by looking at EXP where its virtual
1782 baseclass fields should really be pointing. But we do know
1783 from TRUE_EXP. In constructors, we don't know anything about
1784 the value being initialized.
1786 FLAGS is just passed to `build_new_method_call'. See that function
1787 for its description. */
1789 static void
1791 tsubst_flags_t complain)
1792 {
1798 /* Use a function returning the desired type to initialize EXP for us.
1799 If the function is a constructor, and its first argument is
1800 NULL_TREE, know that it was meant for us--just slide exp on
1801 in and expand the constructor. Constructors now come
1802 as TARGET_EXPRs. */
1806 {
1808 /* If store_init_value returns NULL_TREE, the INIT has been
1809 recorded as the DECL_INITIAL for EXP. That means there's
1810 nothing more we have to do. */
1816 }
1818 /* If an explicit -- but empty -- initializer list was present,
1819 that's value-initialization. */
1821 {
1822 /* If the type has data but no user-provided ctor, we need to zero
1823 out the object. */
1826 {
1829 /* Don't clobber already initialized virtual bases. */
1832 field_size);
1835 }
1837 /* If we don't need to mess with the constructor at all,
1838 then we're done. */
1842 /* Otherwise fall through and call the constructor. */
1844 }
1846 /* We know that expand_default_init can handle everything we want
1847 at this point. */
1849 }
1851 /* Report an error if TYPE is not a user-defined, class type. If
1852 OR_ELSE is nonzero, give an error message. */
1854 int
1856 {
1861 {
1865 }
1867 }
1869 tree
1871 {
1877 else
1879 }
1881 /* Build a reference to a member of an aggregate. This is not a C++
1882 `&', but really something which can have its address taken, and
1883 then act as a pointer to member, for example TYPE :: FIELD can have
1884 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if
1885 this expression is the operand of "&".
1887 @@ Prints out lousy diagnostics for operator <typename>
1888 @@ fields.
1890 @@ This function should be rewritten and placed in search.c. */
1892 tree
1894 tsubst_flags_t complain)
1895 {
1896 tree decl;
1899 /* class templates can come in as TEMPLATE_DECLs here. */
1912 /* Callers should call mark_used before this point. */
1917 {
1921 }
1923 /* Entities other than non-static members need no further
1924 processing. */
1931 {
1935 }
1937 /* Set up BASEBINFO for member lookup. */
1940 /* A lot of this logic is now handled in lookup_member. */
1942 {
1943 /* Go from the TREE_BASELINK to the member function info. */
1947 {
1948 /* Get rid of a potential OVERLOAD around it. */
1951 /* Unique functions are handled easily. */
1953 /* For non-static member of base class, we need a special rule
1954 for access checking [class.protected]:
1956 If the access is to form a pointer to member, the
1957 nested-name-specifier shall name the derived class
1958 (or any class derived from that class). */
1962 complain);
1963 else
1965 complain);
1970 }
1971 else
1973 }
1975 /* We need additional test besides the one in
1976 check_accessibility_of_qualified_id in case it is
1977 a pointer to non-static member. */
1979 complain);
1982 {
1983 /* If MEMBER is non-static, then the program has fallen afoul of
1984 [expr.prim]:
1986 An id-expression that denotes a nonstatic data member or
1987 nonstatic member function of a class can only be used:
1989 -- as part of a class member access (_expr.ref_) in which the
1990 object-expression refers to the member's class or a class
1991 derived from that class, or
1993 -- to form a pointer to member (_expr.unary.op_), or
1995 -- in the body of a nonstatic member function of that class or
1996 of a class derived from that class (_class.mfct.nonstatic_), or
1998 -- in a mem-initializer for a constructor for that class or for
1999 a class derived from that class (_class.base.init_). */
2001 {
2002 /* Build a representation of the qualified name suitable
2003 for use as the operand to "&" -- even though the "&" is
2004 not actually present. */
2006 /* In Microsoft mode, treat a non-static member function as if
2007 it were a pointer-to-member. */
2009 {
2012 }
2017 }
2019 {
2023 }
2025 }
2030 }
2032 /* If DECL is a scalar enumeration constant or variable with a
2033 constant initializer, return the initializer (or, its initializers,
2034 recursively); otherwise, return DECL. If STRICT_P, the
2035 initializer is only returned if DECL is a
2036 constant-expression. If RETURN_AGGREGATE_CST_OK_P, it is ok to
2037 return an aggregate constant. */
2039 static tree
2041 {
2043 || (strict_p
2047 {
2048 tree init;
2049 /* If DECL is a static data member in a template
2050 specialization, we must instantiate it here. The
2051 initializer for the static data member is not processed
2052 until needed; we need it now. */
2057 {
2059 /* Treat the error as a constant to avoid cascading errors on
2060 excessively recursive template instantiation (c++/9335). */
2062 else
2064 }
2065 /* Initializers in templates are generally expanded during
2066 instantiation, so before that for const int i(2)
2067 INIT is a TREE_LIST with the actual initializer as
2068 TREE_VALUE. */
2070 && init
2077 || (!return_aggregate_cst_ok_p
2078 /* Unless RETURN_AGGREGATE_CST_OK_P is true, do not
2079 return an aggregate constant (of which string
2080 literals are a special case), as we do not want
2081 to make inadvertent copies of such entities, and
2082 we must be sure that their addresses are the
2083 same everywhere. */
2088 }
2090 }
2092 /* If DECL is a CONST_DECL, or a constant VAR_DECL initialized by constant
2093 of integral or enumeration type, or a constexpr variable of scalar type,
2094 then return that value. These are those variables permitted in constant
2095 expressions by [5.19/1]. */
2097 tree
2099 {
2102 }
2104 /* Like scalar_constant_value, but can also return aggregate initializers. */
2106 tree
2108 {
2111 }
2113 /* A more relaxed version of scalar_constant_value, used by the
2114 common C/C++ code. */
2116 tree
2118 {
2121 }
2122 \f
2123 /* Common subroutines of build_new and build_vec_delete. */
2124 \f
2125 /* Build and return a NEW_EXPR. If NELTS is non-NULL, TYPE[NELTS] is
2126 the type of the object being allocated; otherwise, it's just TYPE.
2127 INIT is the initializer, if any. USE_GLOBAL_NEW is true if the
2128 user explicitly wrote "::operator new". PLACEMENT, if non-NULL, is
2129 a vector of arguments to be provided as arguments to a placement
2130 new operator. This routine performs no semantic checks; it just
2131 creates and returns a NEW_EXPR. */
2133 static tree
2136 {
2137 tree init_list;
2138 tree new_expr;
2140 /* If INIT is NULL, the we want to store NULL_TREE in the NEW_EXPR.
2141 If INIT is not NULL, then we want to store VOID_ZERO_NODE. This
2142 permits us to distinguish the case of a missing initializer "new
2143 int" from an empty initializer "new int()". */
2148 else
2153 init_list);
2158 }
2160 /* Diagnose uninitialized const members or reference members of type
2161 TYPE. USING_NEW is used to disambiguate the diagnostic between a
2162 new expression without a new-initializer and a declaration. Returns
2163 the error count. */
2165 static int
2168 {
2169 tree field;
2176 {
2177 tree field_type;
2188 {
2191 {
2193 {
2197 else
2199 }
2200 else
2201 {
2206 else
2209 }
2212 }
2213 }
2216 {
2219 {
2221 {
2225 else
2227 }
2228 else
2229 {
2234 else
2237 }
2240 }
2241 }
2244 error_count
2247 }
2249 }
2251 int
2253 {
2255 }
2257 /* Call __cxa_bad_array_new_length to indicate that the size calculation
2258 overflowed. Pretend it returns sizetype so that it plays nicely in the
2259 COND_EXPR. */
2261 tree
2263 {
2267 NULL_TREE));
2270 }
2272 /* Generate code for a new-expression, including calling the "operator
2273 new" function, initializing the object, and, if an exception occurs
2274 during construction, cleaning up. The arguments are as for
2275 build_raw_new_expr. This may change PLACEMENT and INIT. */
2277 static tree
2280 tsubst_flags_t complain)
2281 {
2283 /* True iff this is a call to "operator new[]" instead of just
2284 "operator new". */
2286 /* If ARRAY_P is true, the element type of the array. This is never
2287 an ARRAY_TYPE; for something like "new int[3][4]", the
2288 ELT_TYPE is "int". If ARRAY_P is false, this is the same type as
2289 TYPE. */
2290 tree elt_type;
2291 /* The type of the new-expression. (This type is always a pointer
2292 type.) */
2293 tree pointer_type;
2294 tree non_const_pointer_type;
2296 /* For arrays, a bounds checks on the NELTS parameter. */
2301 /* Size of the inner array elements. */
2302 offset_int inner_size;
2303 /* The address returned by the call to "operator new". This node is
2304 a VAR_DECL and is therefore reusable. */
2305 tree alloc_node;
2306 tree alloc_fn;
2310 /* If non-NULL, the number of extra bytes to allocate at the
2311 beginning of the storage allocated for an array-new expression in
2312 order to store the number of elements. */
2314 tree placement_first;
2316 /* True if the function we are calling is a placement allocation
2317 function. */
2319 /* True if the storage must be initialized, either by a constructor
2320 or due to an explicit new-initializer. */
2322 /* The address of the thing allocated, not including any cookie. In
2323 particular, if an array cookie is in use, DATA_ADDR is the
2324 address of the first array element. This node is a VAR_DECL, and
2325 is therefore reusable. */
2326 tree data_addr;
2331 {
2334 }
2336 {
2337 /* Transforms new (T[N]) to new T[N]. The former is a GNU
2338 extension for variable N. (This also covers new T where T is
2339 a VLA typedef.) */
2345 }
2347 /* If our base type is an array, then make sure we know how many elements
2348 it has. */
2352 {
2356 {
2361 {
2365 }
2367 }
2368 else
2369 {
2371 {
2375 }
2377 }
2381 inner_nelts_cst,
2382 complain);
2383 }
2386 {
2389 }
2394 /* Warn if we performed the (T[N]) to T[N] transformation and N is
2395 variable. */
2398 {
2400 {
2405 else
2410 }
2411 else
2413 }
2416 {
2420 }
2428 {
2430 /* A program that calls for default-initialization [...] of an
2431 entity of reference type is ill-formed. */
2435 /* A new-expression that creates an object of type T initializes
2436 that object as follows:
2437 - If the new-initializer is omitted:
2438 -- If T is a (possibly cv-qualified) non-POD class type
2439 (or array thereof), the object is default-initialized (8.5).
2440 [...]
2441 -- Otherwise, the object created has indeterminate
2442 value. If T is a const-qualified type, or a (possibly
2443 cv-qualified) POD class type (or array thereof)
2444 containing (directly or indirectly) a member of
2445 const-qualified type, the program is ill-formed; */
2455 }
2459 {
2463 }
2467 {
2468 /* Maximum available size in bytes. Half of the address space
2469 minus the cookie size. */
2470 offset_int max_size
2472 /* Maximum number of outer elements which can be allocated. */
2473 offset_int max_outer_nelts;
2474 tree max_outer_nelts_tree;
2480 /* Unconditionally subtract the cookie size. This decreases the
2481 maximum object size and is safe even if we choose not to use
2482 a cookie after all. */
2488 {
2492 }
2495 /* Only keep the top-most seven bits, to simplify encoding the
2496 constant in the instruction stream. */
2497 {
2501 shift);
2502 }
2507 outer_nelts,
2508 max_outer_nelts_tree);
2509 }
2513 /* If PLACEMENT is a single simple pointer type not passed by
2514 reference, prepare to capture it in a temporary variable. Do
2515 this now, since PLACEMENT will change in the calls below. */
2521 /* Allocate the object. */
2523 {
2524 tree class_addr;
2525 tree class_decl;
2529 {
2532 }
2541 {
2545 }
2547 {
2551 }
2556 }
2558 {
2561 }
2562 else
2563 {
2564 tree fnname;
2565 tree fns;
2571 && (array_p
2574 {
2575 /* Use a class-specific operator new. */
2576 /* If a cookie is required, add some extra space. */
2579 else
2580 {
2582 /* No size arithmetic necessary, so the size check is
2583 not needed. */
2586 }
2587 /* Perform the overflow check. */
2594 /* Create the argument list. */
2596 /* Do name-lookup to find the appropriate operator. */
2599 {
2603 }
2605 {
2607 {
2610 }
2612 }
2616 LOOKUP_NORMAL,
2618 complain);
2619 }
2620 else
2621 {
2622 /* Use a global operator new. */
2623 /* See if a cookie might be required. */
2625 {
2627 /* No size arithmetic necessary, so the size check is
2628 not needed. */
2631 }
2635 outer_nelts_check,
2637 }
2638 }
2645 /* If we found a simple case of PLACEMENT_EXPR above, then copy it
2646 into a temporary variable. */
2653 {
2658 {
2662 }
2663 }
2665 /* In the simple case, we can stop now. */
2670 /* Store the result of the allocation call in a variable so that we can
2671 use it more than once. */
2675 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */
2679 /* Now, check to see if this function is actually a placement
2680 allocation function. This can happen even when PLACEMENT is NULL
2681 because we might have something like:
2683 struct S { void* operator new (size_t, int i = 0); };
2685 A call to `new S' will get this allocation function, even though
2686 there is no explicit placement argument. If there is more than
2687 one argument, or there are variable arguments, then this is a
2688 placement allocation function. */
2689 placement_allocation_fn_p
2693 /* Preevaluate the placement args so that we don't reevaluate them for a
2694 placement delete. */
2696 {
2697 tree inits;
2701 alloc_expr);
2702 }
2704 /* unless an allocation function is declared with an empty excep-
2705 tion-specification (_except.spec_), throw(), it indicates failure to
2706 allocate storage by throwing a bad_alloc exception (clause _except_,
2707 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2708 cation function is declared with an empty exception-specification,
2709 throw(), it returns null to indicate failure to allocate storage and a
2710 non-null pointer otherwise.
2712 So check for a null exception spec on the op new we just called. */
2718 {
2719 tree cookie;
2720 tree cookie_ptr;
2721 tree size_ptr_type;
2723 /* Adjust so we're pointing to the start of the object. */
2726 /* Store the number of bytes allocated so that we can know how
2727 many elements to destroy later. We use the last sizeof
2728 (size_t) bytes to store the number of elements. */
2739 {
2740 /* Also store the element size. */
2751 }
2752 }
2753 else
2754 {
2757 }
2759 /* Now use a pointer to the type we've actually allocated. */
2761 /* But we want to operate on a non-const version to start with,
2762 since we'll be modifying the elements. */
2763 non_const_pointer_type = build_pointer_type
2767 /* Any further uses of alloc_node will want this type, too. */
2770 /* Now initialize the allocated object. Note that we preevaluate the
2771 initialization expression, apart from the actual constructor call or
2772 assignment--we do this because we want to delay the allocation as long
2773 as possible in order to minimize the size of the exception region for
2774 placement delete. */
2776 {
2781 {
2784 }
2787 {
2788 /* build_value_init doesn't work in templates, and we don't need
2789 the initializer anyway since we're going to throw it away and
2790 rebuild it at instantiation time, so just build up a single
2791 constructor call to get any appropriate diagnostics. */
2795 complete_ctor_identifier,
2797 LOOKUP_NORMAL,
2798 complain);
2800 }
2802 {
2806 {
2810 else
2811 {
2815 complain);
2816 else
2817 /* We'll check the length at runtime. */
2821 }
2822 }
2824 {
2828 else
2831 }
2832 init_expr
2836 integer_one_node,
2837 complain),
2838 vecinit,
2839 explicit_value_init_p,
2841 complain);
2843 /* An array initialization is stable because the initialization
2844 of each element is a full-expression, so the temporaries don't
2845 leak out. */
2847 }
2848 else
2849 {
2853 {
2855 complete_ctor_identifier,
2857 LOOKUP_NORMAL,
2858 complain);
2859 }
2861 {
2862 /* Something like `new int()'. */
2867 }
2868 else
2869 {
2870 tree ie;
2872 /* We are processing something like `new int (10)', which
2873 means allocate an int, and initialize it with 10. */
2876 complain);
2878 complain);
2879 }
2881 }
2886 /* If any part of the object initialization terminates by throwing an
2887 exception and a suitable deallocation function can be found, the
2888 deallocation function is called to free the memory in which the
2889 object was being constructed, after which the exception continues
2890 to propagate in the context of the new-expression. If no
2891 unambiguous matching deallocation function can be found,
2892 propagating the exception does not cause the object's memory to be
2893 freed. */
2895 {
2897 tree cleanup;
2899 /* The Standard is unclear here, but the right thing to do
2900 is to use the same method for finding deallocation
2901 functions that we use for finding allocation functions. */
2902 cleanup = (build_op_delete_call
2904 alloc_node,
2905 size,
2906 globally_qualified_p,
2908 alloc_fn,
2909 complain));
2914 /* This is much simpler if we were able to preevaluate all of
2915 the arguments to the constructor call. */
2916 {
2917 /* CLEANUP is compiler-generated, so no diagnostics. */
2921 /* Likewise, this try-catch is compiler-generated. */
2923 }
2924 else
2925 /* Ack! First we allocate the memory. Then we set our sentry
2926 variable to true, and expand a cleanup that deletes the
2927 memory if sentry is true. Then we run the constructor, and
2928 finally clear the sentry.
2930 We need to do this because we allocate the space first, so
2931 if there are any temporaries with cleanups in the
2932 constructor args and we weren't able to preevaluate them, we
2933 need this EH region to extend until end of full-expression
2934 to preserve nesting. */
2935 {
2943 /* CLEANUP is compiler-generated, so no diagnostics. */
2953 init_expr
2956 end));
2957 /* Likewise, this is compiler-generated. */
2959 }
2960 }
2961 }
2962 else
2965 /* Now build up the return value in reverse order. */
2975 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
2976 and return the call (which doesn't need to be adjusted). */
2978 else
2979 {
2981 {
2984 nullptr_node,
2985 complain);
2988 }
2990 /* Perform the allocation before anything else, so that ALLOC_NODE
2991 has been initialized before we start using it. */
2993 }
2998 /* A new-expression is never an lvalue. */
3002 }
3004 /* Generate a representation for a C++ "new" expression. *PLACEMENT
3005 is a vector of placement-new arguments (or NULL if none). If NELTS
3006 is NULL, TYPE is the type of the storage to be allocated. If NELTS
3007 is not NULL, then this is an array-new allocation; TYPE is the type
3008 of the elements in the array and NELTS is the number of elements in
3009 the array. *INIT, if non-NULL, is the initializer for the new
3010 object, or an empty vector to indicate an initializer of "()". If
3011 USE_GLOBAL_NEW is true, then the user explicitly wrote "::new"
3012 rather than just "new". This may change PLACEMENT and INIT. */
3014 tree
3017 {
3018 tree rval;
3027 /* Don't do auto deduction where it might affect mangling. */
3029 {
3032 {
3036 }
3037 }
3040 {
3047 use_global_new);
3058 }
3061 {
3063 {
3066 else
3068 }
3071 }
3073 /* ``A reference cannot be created by the new operator. A reference
3074 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
3075 returned by new.'' ARM 5.3.3 */
3077 {
3080 else
3083 }
3086 {
3090 }
3092 /* The type allocated must be complete. If the new-type-id was
3093 "T[N]" then we are just checking that "T" is complete here, but
3094 that is equivalent, since the value of "N" doesn't matter. */
3103 {
3109 }
3111 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
3116 }
3118 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
3120 tree
3122 {
3128 {
3131 {
3134 }
3136 }
3138 /* Mangle the class$ field. */
3139 {
3140 tree field;
3143 {
3147 }
3149 {
3152 }
3153 }
3157 {
3167 }
3169 }
3170 \f
3171 static tree
3173 special_function_kind auto_delete_vec,
3175 {
3176 tree virtual_size;
3178 tree size_exp;
3180 /* Temporary variables used by the loop. */
3183 /* This is the body of the loop that implements the deletion of a
3184 single element, and moves temp variables to next elements. */
3185 tree body;
3187 /* This is the LOOP_EXPR that governs the deletion of the elements. */
3190 /* This is the thing that governs what to do after the loop has run. */
3193 /* This is the BIND_EXPR which holds the outermost iterator of the
3194 loop. It is convenient to set this variable up and test it before
3195 executing any other code in the loop.
3196 This is also the containing expression returned by this function. */
3198 tree tmp;
3200 /* We should only have 1-D arrays here. */
3207 {
3210 "possible problem detected in invocation of "
3212 {
3215 "class-specific operator delete [] will be called, "
3217 }
3218 /* This size won't actually be used. */
3221 }
3228 {
3229 /* Make sure the destructor is callable. */
3231 {
3234 complain);
3237 }
3239 }
3241 /* The below is short by the cookie size. */
3246 tbase_init
3250 base),
3251 virtual_size),
3252 complain);
3270 complain);
3278 no_destructor:
3279 /* Delete the storage if appropriate. */
3281 {
3282 tree base_tbd;
3284 /* The below is short by the cookie size. */
3289 /* no header */
3291 else
3292 {
3293 tree cookie_size;
3297 MINUS_EXPR,
3300 cookie_size,
3301 complain);
3305 /* True size with header. */
3307 }
3314 complain);
3315 }
3319 ;
3322 else
3328 /* Outermost wrapper: If pointer is null, punt. */
3333 nullptr_node)),
3338 {
3341 }
3344 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
3348 }
3350 /* Create an unnamed variable of the indicated TYPE. */
3352 tree
3354 {
3355 tree decl;
3365 }
3367 /* Create a new temporary variable of the indicated TYPE, initialized
3368 to INIT.
3370 It is not entered into current_binding_level, because that breaks
3371 things when it comes time to do final cleanups (which take place
3372 "outside" the binding contour of the function). */
3374 tree
3376 {
3377 tree decl;
3383 tf_warning_or_error));
3386 }
3388 /* `build_vec_init' returns tree structure that performs
3389 initialization of a vector of aggregate types.
3391 BASE is a reference to the vector, of ARRAY_TYPE, or a pointer
3392 to the first element, of POINTER_TYPE.
3393 MAXINDEX is the maximum index of the array (one less than the
3394 number of elements). It is only used if BASE is a pointer or
3395 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
3397 INIT is the (possibly NULL) initializer.
3399 If EXPLICIT_VALUE_INIT_P is true, then INIT must be NULL. All
3400 elements in the array are value-initialized.
3402 FROM_ARRAY is 0 if we should init everything with INIT
3403 (i.e., every element initialized from INIT).
3404 FROM_ARRAY is 1 if we should index into INIT in parallel
3405 with initialization of DECL.
3406 FROM_ARRAY is 2 if we should index into INIT in parallel,
3407 but use assignment instead of initialization. */
3409 tree
3413 {
3414 tree rval;
3417 tree iterator;
3418 /* The type of BASE. */
3420 /* The type of an element in the array. */
3422 /* The element type reached after removing all outer array
3423 types. */
3424 tree inner_elt_type;
3425 /* The type of a pointer to an element in the array. */
3426 tree ptype;
3427 tree stmt_expr;
3428 tree compound_stmt;
3448 /* Look through the TARGET_EXPR around a compound literal. */
3454 /* If we have a braced-init-list, make sure that the array
3455 is big enough for all the initializers. */
3468 /* Don't do this if the CONSTRUCTOR might contain something
3469 that might throw and require us to clean up. */
3473 {
3474 /* Do non-default initialization of trivial arrays resulting from
3475 brace-enclosed initializers. In this case, digest_init and
3476 store_constructor will handle the semantics for us. */
3482 }
3486 {
3492 }
3493 else
3496 /* The code we are generating looks like:
3497 ({
3498 T* t1 = (T*) base;
3499 T* rval = t1;
3500 ptrdiff_t iterator = maxindex;
3501 try {
3502 for (; iterator != -1; --iterator) {
3503 ... initialize *t1 ...
3504 ++t1;
3505 }
3506 } catch (...) {
3507 ... destroy elements that were constructed ...
3508 }
3509 rval;
3510 })
3512 We can omit the try and catch blocks if we know that the
3513 initialization will never throw an exception, or if the array
3514 elements do not have destructors. We can omit the loop completely if
3515 the elements of the array do not have constructors.
3517 We actually wrap the entire body of the above in a STMT_EXPR, for
3518 tidiness.
3520 When copying from array to another, when the array elements have
3521 only trivial copy constructors, we should use __builtin_memcpy
3522 rather than generating a loop. That way, we could take advantage
3523 of whatever cleverness the back end has for dealing with copies
3524 of blocks of memory. */
3533 /* If initializing one array from another, initialize element by
3534 element. We rely upon the below calls to do the argument
3535 checking. Evaluate the initializer before entering the try block. */
3537 {
3546 }
3548 /* Protect the entire array initialization so that we can destroy
3549 the partially constructed array if an exception is thrown.
3550 But don't do this if we're assigning. */
3553 {
3555 }
3557 /* Should we try to create a constant initializer? */
3561 : (type_has_constexpr_default_constructor
3567 /* If we're initializing a static array, we want to do static
3568 initialization of any elements with constant initializers even if
3569 some are non-constant. */
3575 /* Skip over the handling of non-empty init lists. */
3578 /* Maybe pull out constant value when from_array? */
3581 {
3582 /* Do non-default initialization of non-trivial arrays resulting from
3583 brace-enclosed initializers. */
3586 /* If the constructor already has the array type, it's been through
3587 digest_init, so we shouldn't try to do anything more. */
3592 {
3595 {
3597 {
3599 nelts);
3603 }
3604 /* Don't check an array new when -fno-exceptions. */
3605 }
3608 {
3609 /* Make sure the last element of the initializer is in bounds. */
3610 finish_expr_stmt
3611 (ubsan_instrument_bounds
3613 }
3614 }
3620 {
3622 tree one_init;
3624 num_initialized_elts++;
3631 else
3637 {
3640 {
3644 else
3646 }
3647 else
3648 {
3650 {
3655 }
3657 }
3658 }
3667 else
3671 complain);
3674 else
3676 }
3678 /* Any elements without explicit initializers get T{}. */
3680 }
3682 {
3687 {
3691 }
3692 }
3694 /* Now, default-initialize any remaining elements. We don't need to
3695 do that if a) the type does not need constructing, or b) we've
3696 already initialized all the elements.
3698 We do need to keep going if we're copying an array. */
3701 /* With a constexpr default constructor, which we checked for when
3702 setting try_const above, default-initialization is equivalent to
3703 value-initialization, and build_value_init gives us something more
3704 friendly to maybe_constant_init. */
3709 && (num_initialized_elts
3711 {
3712 /* If the ITERATOR is equal to -1, then we don't have to loop;
3713 we've already initialized all the elements. */
3714 tree for_stmt;
3715 tree elt_init;
3716 tree to;
3724 complain);
3731 /* If the initializer is {}, then all elements are initialized from T{}.
3732 But for non-classes, that's the same as value-initialization. */
3734 {
3736 {
3738 }
3739 else
3740 {
3743 }
3744 }
3747 {
3748 tree from;
3751 {
3755 }
3756 else
3761 complain);
3766 complain);
3767 else
3769 }
3771 {
3773 sorry
3777 explicit_value_init_p,
3779 }
3781 {
3785 }
3786 else
3787 {
3791 else
3792 {
3795 complain);
3797 }
3798 }
3804 {
3805 /* FIXME refs to earlier elts */
3808 {
3810 /* Don't fill the CONSTRUCTOR with zeros. */
3814 }
3815 else
3816 {
3820 else
3822 }
3825 {
3828 {
3831 }
3832 }
3833 }
3841 complain));
3844 complain));
3847 }
3849 /* Make sure to cleanup any partially constructed elements. */
3852 {
3853 tree e;
3856 complain);
3858 /* Flatten multi-dimensional array since build_vec_delete only
3859 expects one-dimensional array. */
3863 /* Avoid mixing signed and unsigned. */
3866 complain);
3875 }
3877 /* The value of the array initialization is the array itself, RVAL
3878 is a pointer to the first element. */
3889 {
3891 {
3894 }
3897 else
3899 }
3901 /* Now make the result have the correct type. */
3903 {
3908 }
3911 }
3913 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
3914 build_delete. */
3916 static tree
3918 tsubst_flags_t complain)
3919 {
3920 tree name;
3921 tree fn;
3923 {
3938 }
3943 flags,
3945 complain);
3946 }
3948 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
3949 ADDR is an expression which yields the store to be destroyed.
3950 AUTO_DELETE is the name of the destructor to call, i.e., either
3951 sfk_complete_destructor, sfk_base_destructor, or
3952 sfk_deleting_destructor.
3954 FLAGS is the logical disjunction of zero or more LOOKUP_
3955 flags. See cp-tree.h for more info. */
3957 tree
3960 {
3961 tree expr;
3968 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
3969 set to `error_mark_node' before it gets properly cleaned up. */
3977 {
3979 {
3983 }
3986 }
3989 {
3992 /* We don't want to warn about delete of void*, only other
3993 incomplete types. Deleting other incomplete types
3994 invokes undefined behavior, but it is not ill-formed, so
3995 compile to something that would even do The Right Thing
3996 (TM) should the type have a trivial dtor and no delete
3997 operator. */
3999 {
4002 {
4005 "possible problem detected in invocation of "
4007 {
4010 "neither the destructor nor the class-specific "
4011 "operator delete will be called, even if they are "
4013 }
4014 }
4018 {
4019 tree dtor;
4022 {
4025 "deleting object of abstract class type %qT"
4026 " which has non-virtual destructor"
4028 else
4030 "deleting object of polymorphic class type %qT"
4031 " which has non-virtual destructor"
4033 }
4034 }
4035 }
4039 /* Throw away const and volatile on target type of addr. */
4041 }
4042 else
4043 {
4044 /* Don't check PROTECT here; leave that decision to the
4045 destructor. If the destructor is accessible, call it,
4046 else report error. */
4054 }
4057 {
4058 /* Make sure the destructor is callable. */
4060 {
4062 complain),
4066 }
4073 use_global_delete,
4076 complain);
4077 }
4078 else
4079 {
4082 tree ifexp;
4087 /* For `::delete x', we must not use the deleting destructor
4088 since then we would not be sure to get the global `operator
4089 delete'. */
4091 {
4092 /* We will use ADDR multiple times so we must save it. */
4095 /* Delete the object. */
4097 head,
4102 complain);
4103 /* Otherwise, treat this like a complete object destructor
4104 call. */
4106 }
4107 /* If the destructor is non-virtual, there is no deleting
4108 variant. Instead, we must explicitly call the appropriate
4109 `operator delete' here. */
4112 {
4113 /* We will use ADDR multiple times so we must save it. */
4115 /* Build the call. */
4117 addr,
4122 complain);
4123 /* Call the complete object destructor. */
4125 }
4128 {
4129 /* Make sure we have access to the member op delete, even though
4130 we'll actually be calling it from the destructor. */
4135 complain);
4136 }
4145 /* We need to calculate this before the dtor changes the vptr. */
4150 /* Explicit destructor call; don't check for null pointer. */
4152 else
4153 {
4154 /* Handle deleting a null pointer. */
4157 complain));
4160 }
4166 }
4167 }
4169 /* At the beginning of a destructor, push cleanups that will call the
4170 destructors for our base classes and members.
4172 Called from begin_destructor_body. */
4174 void
4176 {
4179 tree member;
4180 tree expr;
4183 /* Run destructors for all virtual baseclasses. */
4185 {
4186 tree cond = (condition_conversion
4188 current_in_charge_parm,
4189 integer_two_node)));
4191 /* The CLASSTYPE_VBASECLASSES vector is in initialization
4192 order, which is also the right order for pushing cleanups. */
4195 {
4197 {
4199 base_dtor_identifier,
4200 NULL,
4201 base_binfo,
4202 (LOOKUP_NORMAL
4204 tf_warning_or_error);
4206 {
4210 }
4211 }
4212 }
4213 }
4215 /* Take care of the remaining baseclasses. */
4218 {
4224 base_dtor_identifier,
4227 tf_warning_or_error);
4230 }
4232 /* Don't automatically destroy union members. */
4238 {
4247 {
4248 tree this_member = (build_class_member_access_expr
4252 tf_warning_or_error));
4254 sfk_complete_destructor,
4259 }
4260 }
4261 }
4263 /* Build a C++ vector delete expression.
4264 MAXINDEX is the number of elements to be deleted.
4265 ELT_SIZE is the nominal size of each element in the vector.
4266 BASE is the expression that should yield the store to be deleted.
4267 This function expands (or synthesizes) these calls itself.
4268 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
4270 This also calls delete for virtual baseclasses of elements of the vector.
4272 Update: MAXINDEX is no longer needed. The size can be extracted from the
4273 start of the vector for pointers, and from the type for arrays. We still
4274 use MAXINDEX for arrays because it happens to already have one of the
4275 values we'd have to extract. (We could use MAXINDEX with pointers to
4276 confirm the size, and trap if the numbers differ; not clear that it'd
4277 be worth bothering.) */
4279 tree
4281 special_function_kind auto_delete_vec,
4283 {
4284 tree type;
4285 tree rval;
4291 {
4292 /* Step back one from start of vector, and read dimension. */
4293 tree cookie_addr;
4298 {
4301 }
4306 cookie_addr);
4308 }
4310 {
4311 /* Get the total number of things in the array, maxindex is a
4312 bad name. */
4319 {
4322 }
4323 }
4324 else
4325 {
4329 }
4337 }