| blob | 7f5d04539a5e5d0fd8f28f5dcc4806d4e03ff0b7 |
1 /* Handle initialization things in C++.
2 Copyright (C) 1987-2014 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. */
51 /* We are about to generate some complex initialization code.
52 Conceptually, it is all a single expression. However, we may want
53 to include conditionals, loops, and other such statement-level
54 constructs. Therefore, we build the initialization code inside a
55 statement-expression. This function starts such an expression.
56 STMT_EXPR_P and COMPOUND_STMT_P are filled in by this function;
57 pass them back to finish_init_stmts when the expression is
58 complete. */
60 static bool
62 {
69 }
71 /* Finish out the statement-expression begun by the previous call to
72 begin_init_stmts. Returns the statement-expression itself. */
74 static tree
76 {
84 }
86 /* Constructors */
88 /* Called from initialize_vtbl_ptrs via dfs_walk. BINFO is the base
89 which we want to initialize the vtable pointer for, DATA is
90 TREE_LIST whose TREE_VALUE is the this ptr expression. */
92 static tree
94 {
99 {
103 tf_warning_or_error);
106 }
109 }
111 /* Initialize all the vtable pointers in the object pointed to by
112 ADDR. */
114 void
116 {
117 tree list;
118 tree type;
123 /* Walk through the hierarchy, initializing the vptr in each base
124 class. We do these in pre-order because we can't find the virtual
125 bases for a class until we've initialized the vtbl for that
126 class. */
128 }
130 /* Return an expression for the zero-initialization of an object with
131 type T. This expression will either be a constant (in the case
132 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
133 aggregate), or NULL (in the case that T does not require
134 initialization). In either case, the value can be used as
135 DECL_INITIAL for a decl of the indicated TYPE; it is a valid static
136 initializer. If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS
137 is the number of elements in the array. If STATIC_STORAGE_P is
138 TRUE, initializers are only generated for entities for which
139 zero-initialization does not simply mean filling the storage with
140 zero bytes. FIELD_SIZE, if non-NULL, is the bit size of the field,
141 subfields with bit positions at or above that bit size shouldn't
142 be added. Note that this only works when the result is assigned
143 to a base COMPONENT_REF; if we only have a pointer to the base subobject,
144 expand_assignment will end up clearing the full size of TYPE. */
146 static tree
148 tree field_size)
149 {
152 /* [dcl.init]
154 To zero-initialize an object of type T means:
156 -- if T is a scalar type, the storage is set to the value of zero
157 converted to T.
159 -- if T is a non-union class type, the storage for each nonstatic
160 data member and each base-class subobject is zero-initialized.
162 -- if T is a union type, the storage for its first data member is
163 zero-initialized.
165 -- if T is an array type, the storage for each element is
166 zero-initialized.
168 -- if T is a reference type, no initialization is performed. */
173 ;
175 /* In order to save space, we do not explicitly build initializers
176 for items that do not need them. GCC's semantics are that
177 items with static storage duration that are not otherwise
178 initialized are initialized to zero. */
179 ;
185 {
186 tree field;
189 /* Iterate over the fields, building initializations. */
191 {
195 /* Don't add virtual bases for base classes if they are beyond
196 the size of the current field, that means it is present
197 somewhere else in the object. */
199 {
204 }
206 /* Note that for class types there will be FIELD_DECLs
207 corresponding to base classes as well. Thus, iterating
208 over TYPE_FIELDs will result in correct initialization of
209 all of the subobjects. */
211 {
212 tree new_field_size
219 static_storage_p,
220 new_field_size);
223 }
225 /* For unions, only the first field is initialized. */
228 }
230 /* Build a constructor to contain the initializations. */
232 }
234 {
235 tree max_index;
238 /* Iterate over the array elements, building initializations. */
243 else
246 /* If we have an error_mark here, we should just return error mark
247 as we don't know the size of the array yet. */
252 /* A zero-sized array, which is accepted as an extension, will
253 have an upper bound of -1. */
255 {
256 constructor_elt ce;
258 /* If this is a one element array, we just use a regular init. */
261 else
263 max_index);
269 {
272 }
273 }
275 /* Build a constructor to contain the initializations. */
277 }
280 else
283 /* In all cases, the initializer is a constant. */
288 }
290 /* Return an expression for the zero-initialization of an object with
291 type T. This expression will either be a constant (in the case
292 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
293 aggregate), or NULL (in the case that T does not require
294 initialization). In either case, the value can be used as
295 DECL_INITIAL for a decl of the indicated TYPE; it is a valid static
296 initializer. If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS
297 is the number of elements in the array. If STATIC_STORAGE_P is
298 TRUE, initializers are only generated for entities for which
299 zero-initialization does not simply mean filling the storage with
300 zero bytes. */
302 tree
304 {
306 }
308 /* Return a suitable initializer for value-initializing an object of type
309 TYPE, as described in [dcl.init]. */
311 tree
313 {
314 /* [dcl.init]
316 To value-initialize an object of type T means:
318 - if T is a class type (clause 9) with either no default constructor
319 (12.1) or a default constructor that is user-provided or deleted,
320 then then the object is default-initialized;
322 - if T is a (possibly cv-qualified) class type without a user-provided
323 or deleted default constructor, then the object is zero-initialized
324 and the semantic constraints for default-initialization are checked,
325 and if T has a non-trivial default constructor, the object is
326 default-initialized;
328 - if T is an array type, then each element is value-initialized;
330 - otherwise, the object is zero-initialized.
332 A program that calls for default-initialization or
333 value-initialization of an entity of reference type is ill-formed. */
335 /* The AGGR_INIT_EXPR tweaking below breaks in templates. */
340 {
341 tree ctor = build_aggr_init_expr
345 complain));
350 {
351 /* This is a class that needs constructing, but doesn't have
352 a user-provided constructor. So we need to zero-initialize
353 the object and then call the implicitly defined ctor.
354 This will be handled in simplify_aggr_init_expr. */
357 }
358 }
360 /* Discard any access checking during subobject initialization;
361 the checks are implied by the call to the ctor which we have
362 verified is OK (cpp0x/defaulted46.C). */
367 }
369 /* Like build_value_init, but don't call the constructor for TYPE. Used
370 for base initializers. */
372 tree
374 {
376 {
380 }
381 /* FIXME the class and array cases should just use digest_init once it is
382 SFINAE-enabled. */
384 {
389 {
390 tree field;
393 /* Iterate over the fields, building initializations. */
395 {
406 /* We could skip vfields and fields of types with
407 user-defined constructors, but I think that won't improve
408 performance at all; it should be simpler in general just
409 to zero out the entire object than try to only zero the
410 bits that actually need it. */
412 /* Note that for class types there will be FIELD_DECLs
413 corresponding to base classes as well. Thus, iterating
414 over TYPE_FIELDs will result in correct initialization of
415 all of the subobjects. */
423 }
425 /* Build a constructor to contain the zero- initializations. */
427 }
428 }
430 {
433 /* Iterate over the array elements, building initializations. */
436 /* If we have an error_mark here, we should just return error mark
437 as we don't know the size of the array yet. */
439 {
442 type);
444 }
447 /* A zero-sized array, which is accepted as an extension, will
448 have an upper bound of -1. */
450 {
451 constructor_elt ce;
453 /* If this is a one element array, we just use a regular init. */
456 else
461 {
468 /* We shouldn't have gotten here for anything that would need
469 non-trivial initialization, and gimplify_init_ctor_preeval
470 would need to be fixed to allow it. */
473 }
474 }
476 /* Build a constructor to contain the initializations. */
478 }
480 {
484 }
486 {
490 }
493 }
495 /* Initialize current class with INIT, a TREE_LIST of
496 arguments for a target constructor. If TREE_LIST is void_type_node,
497 an empty initializer list was given. */
499 static void
501 {
507 tf_warning_or_error));
509 {
511 LOOKUP_NORMAL
512 |LOOKUP_NONVIRTUAL
518 }
519 }
521 /* Initialize MEMBER, a FIELD_DECL, with INIT, a TREE_LIST of
522 arguments. If TREE_LIST is void_type_node, an empty initializer
523 list was given; if NULL_TREE no initializer was given. */
525 static void
527 {
528 tree decl;
531 /* Use the non-static data member initializer if there was no
532 mem-initializer for this field. */
534 {
536 /* Do deferred instantiation of the NSDMI. */
537 init = (tsubst_copy_and_build
542 else
543 {
546 {
550 }
551 /* Strip redundant TARGET_EXPR so we don't need to remap it, and
552 so the aggregate init code below will see a CONSTRUCTOR. */
557 }
558 }
563 /* Effective C++ rule 12 requires that all data members be
564 initialized. */
568 member);
570 /* Get an lvalue for the data member. */
574 tf_warning_or_error);
580 {
586 member);
587 }
590 {
591 /* mem() means value-initialization. */
593 {
597 }
598 else
599 {
605 }
606 }
607 /* Deal with this here, as we will get confused if we try to call the
608 assignment op for an anonymous union. This can happen in a
609 synthesized copy constructor. */
611 {
613 {
616 }
617 }
620 /* Pre-digested NSDMI. */
623 /* { } mem-initializer. */
629 {
630 /* With references and list-initialization, we need to deal with
631 extending temporary lifetimes. 12.2p5: "A temporary bound to a
632 reference member in a constructor’s ctor-initializer (12.6.2)
633 persists until the constructor exits." */
638 tf_warning_or_error);
640 {
645 }
648 /* A FIELD_DECL doesn't really have a suitable lifetime, but
649 make_temporary_var_for_ref_to_temp will treat it as automatic and
650 set_up_extended_ref_temp wants to use the decl in a warning. */
660 }
663 {
665 {
667 {
670 else
674 }
678 {
682 }
683 else
685 }
686 else
687 {
694 /* TYPE_NEEDS_CONSTRUCTING can be set just because we have a
695 vtable; still give this diagnostic. */
700 tf_warning_or_error));
701 }
702 }
703 else
704 {
706 {
707 tree core_type;
708 /* member traversal: note it leaves init NULL */
712 member);
726 }
728 /* There was an explicit member initialization. Do some work
729 in that case. */
731 tf_warning_or_error);
735 tf_warning_or_error));
736 }
739 {
740 tree expr;
745 tf_warning_or_error);
748 tf_warning_or_error);
753 }
754 }
756 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
757 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
759 static tree
761 {
762 tree fields;
764 /* Note whether or not T is a union. */
769 {
770 tree fieldtype;
772 /* Skip CONST_DECLs for enumeration constants and so forth. */
777 /* Keep track of whether or not any fields are unions. */
781 /* For an anonymous struct or union, we must recursively
782 consider the fields of the anonymous type. They can be
783 directly initialized from the constructor. */
785 {
786 /* Add this field itself. Synthesized copy constructors
787 initialize the entire aggregate. */
789 /* And now add the fields in the anonymous aggregate. */
791 }
792 /* Add this field. */
795 }
798 }
800 /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives
801 a FIELD_DECL or BINFO in T that needs initialization. The
802 TREE_VALUE gives the initializer, or list of initializer arguments.
804 Return a TREE_LIST containing all of the initializations required
805 for T, in the order in which they should be performed. The output
806 list has the same format as the input. */
808 static tree
810 {
811 tree init;
813 tree sorted_inits;
814 tree next_subobject;
819 /* Build up a list of initializations. The TREE_PURPOSE of entry
820 will be the subobject (a FIELD_DECL or BINFO) to initialize. The
821 TREE_VALUE will be the constructor arguments, or NULL if no
822 explicit initialization was provided. */
825 /* Process the virtual bases. */
830 /* Process the direct bases. */
836 /* Process the non-static data members. */
838 /* Reverse the entire list of initializations, so that they are in
839 the order that they will actually be performed. */
842 /* If the user presented the initializers in an order different from
843 that in which they will actually occur, we issue a warning. Keep
844 track of the next subobject which can be explicitly initialized
845 without issuing a warning. */
848 /* Go through the explicit initializers, filling in TREE_PURPOSE in
849 the SORTED_INITS. */
851 {
852 tree subobject;
853 tree subobject_init;
857 /* If the explicit initializers are in sorted order, then
858 SUBOBJECT will be NEXT_SUBOBJECT, or something following
859 it. */
861 subobject_init;
866 /* Issue a warning if the explicit initializer order does not
867 match that which will actually occur.
868 ??? Are all these on the correct lines? */
870 {
874 else
879 else
883 }
885 /* Look again, from the beginning of the list. */
887 {
891 }
893 /* It is invalid to initialize the same subobject more than
894 once. */
896 {
900 subobject);
901 else
904 subobject);
905 }
907 /* Record the initialization. */
910 }
912 /* [class.base.init]
914 If a ctor-initializer specifies more than one mem-initializer for
915 multiple members of the same union (including members of
916 anonymous unions), the ctor-initializer is ill-formed.
918 Here we also splice out uninitialized union members. */
920 {
924 {
925 tree field;
926 tree ctx;
932 /* Skip base classes. */
936 /* If this is an anonymous union with no explicit initializer,
937 splice it out. */
941 /* See if this field is a member of a union, or a member of a
942 structure contained in a union, etc. */
949 /* If this field is not a member of a union, skip it. */
953 /* If this union member has no explicit initializer and no NSDMI,
954 splice it out. */
957 else
960 /* It's only an error if we have two initializers for the same
961 union type. */
963 {
966 }
968 /* See if LAST_FIELD and the field initialized by INIT are
969 members of the same union. If so, there's a problem,
970 unless they're actually members of the same structure
971 which is itself a member of a union. For example, given:
973 union { struct { int i; int j; }; };
975 initializing both `i' and `j' makes sense. */
980 {
981 /* A mem-initializer hides an NSDMI. */
986 else
987 {
990 ctx);
992 }
993 }
997 next:
1000 splice:
1003 }
1004 }
1007 }
1009 /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS
1010 is a TREE_LIST giving the explicit mem-initializer-list for the
1011 constructor. The TREE_PURPOSE of each entry is a subobject (a
1012 FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE
1013 is a TREE_LIST giving the arguments to the constructor or
1014 void_type_node for an empty list of arguments. */
1016 void
1018 {
1021 /* We will already have issued an error message about the fact that
1022 the type is incomplete. */
1029 {
1030 /* Delegating constructor. */
1034 }
1040 /* Sort the mem-initializers into the order in which the
1041 initializations should be performed. */
1046 /* Initialize base classes. */
1050 {
1054 /* We already have issued an error message. */
1059 {
1060 /* If these initializations are taking place in a copy constructor,
1061 the base class should probably be explicitly initialized if there
1062 is a user-defined constructor in the base class (other than the
1063 default constructor, which will be called anyway). */
1071 }
1073 /* Initialize the base. */
1076 else
1077 {
1078 tree base_addr;
1084 tf_warning_or_error),
1085 arguments,
1086 flags,
1087 tf_warning_or_error);
1089 }
1090 }
1093 /* Initialize the vptrs. */
1096 /* Initialize the data members. */
1098 {
1102 }
1103 }
1105 /* Returns the address of the vtable (i.e., the value that should be
1106 assigned to the vptr) for BINFO. */
1108 tree
1110 {
1112 tree vtbl;
1115 /* If this is a virtual primary base, then the vtable we want to store
1116 is that for the base this is being used as the primary base of. We
1117 can't simply skip the initialization, because we may be expanding the
1118 inits of a subobject constructor where the virtual base layout
1119 can be different. */
1123 /* Figure out what vtable BINFO's vtable is based on, and mark it as
1124 used. */
1128 /* Make sure the destructor gets synthesized so that it can be
1129 inlined after devirtualization even if the vtable is never
1130 emitted. */
1134 /* Now compute the address to use when initializing the vptr. */
1140 }
1142 /* This code sets up the virtual function tables appropriate for
1143 the pointer DECL. It is a one-ply initialization.
1145 BINFO is the exact type that DECL is supposed to be. In
1146 multiple inheritance, this might mean "C's A" if C : A, B. */
1148 static void
1150 {
1152 tree vtt_index;
1154 /* Compute the initializer for vptr. */
1157 /* We may get this vptr from a VTT, if this is a subobject
1158 constructor or subobject destructor. */
1161 {
1162 tree vtbl2;
1163 tree vtt_parm;
1165 /* Compute the value to use, when there's a VTT. */
1171 /* The actual initializer is the VTT value only in the subobject
1172 constructor. In maybe_clone_body we'll substitute NULL for
1173 the vtt_parm in the case of the non-subobject constructor. */
1178 vtbl2,
1179 vtbl);
1180 }
1182 /* Compute the location of the vtpr. */
1184 tf_warning_or_error),
1188 /* Assign the vtable to the vptr. */
1191 tf_warning_or_error));
1192 }
1194 /* If an exception is thrown in a constructor, those base classes already
1195 constructed must be destroyed. This function creates the cleanup
1196 for BINFO, which has just been constructed. If FLAG is non-NULL,
1197 it is a DECL which is nonzero when this base needs to be
1198 destroyed. */
1200 static void
1202 {
1203 tree expr;
1208 /* Call the destructor. */
1210 base_dtor_identifier,
1211 NULL,
1212 binfo,
1214 tf_warning_or_error);
1226 }
1228 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its
1229 constructor. */
1231 static void
1233 {
1234 tree inner_if_stmt;
1235 tree exp;
1236 tree flag;
1238 /* If there are virtual base classes with destructors, we need to
1239 emit cleanups to destroy them if an exception is thrown during
1240 the construction process. These exception regions (i.e., the
1241 period during which the cleanups must occur) begin from the time
1242 the construction is complete to the end of the function. If we
1243 create a conditional block in which to initialize the
1244 base-classes, then the cleanup region for the virtual base begins
1245 inside a block, and ends outside of that block. This situation
1246 confuses the sjlj exception-handling code. Therefore, we do not
1247 create a single conditional block, but one for each
1248 initialization. (That way the cleanup regions always begin
1249 in the outer block.) We trust the back end to figure out
1250 that the FLAG will not change across initializations, and
1251 avoid doing multiple tests. */
1256 /* Compute the location of the virtual base. If we're
1257 constructing virtual bases, then we must be the most derived
1258 class. Therefore, we don't have to look up the virtual base;
1259 we already know where it is. */
1268 }
1270 /* Find the context in which this FIELD can be initialized. */
1272 static tree
1274 {
1277 /* Anonymous union members can be initialized in the first enclosing
1278 non-anonymous union context. */
1282 }
1284 /* Function to give error message if member initialization specification
1285 is erroneous. FIELD is the member we decided to initialize.
1286 TYPE is the type for which the initialization is being performed.
1287 FIELD must be a member of TYPE.
1289 MEMBER_NAME is the name of the member. */
1291 static int
1293 {
1297 {
1299 member_name);
1301 }
1303 {
1306 field);
1308 }
1310 {
1314 }
1316 {
1318 member_name);
1320 }
1323 }
1325 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it
1326 is a _TYPE node or TYPE_DECL which names a base for that type.
1327 Check the validity of NAME, and return either the base _TYPE, base
1328 binfo, or the FIELD_DECL of the member. If NAME is invalid, return
1329 NULL_TREE and issue a diagnostic.
1331 An old style unnamed direct single base construction is permitted,
1332 where NAME is NULL. */
1334 tree
1336 {
1337 tree basetype;
1338 tree field;
1344 {
1345 /* This is an obsolete unnamed base class initializer. The
1346 parser will already have warned about its use. */
1348 {
1351 current_class_type);
1354 basetype = BINFO_TYPE
1359 current_class_type);
1361 }
1362 }
1364 {
1367 }
1370 else
1374 {
1375 tree class_binfo;
1376 tree direct_binfo;
1377 tree virtual_binfo;
1388 /* Look for a direct base. */
1393 /* Look for a virtual base -- unless the direct base is itself
1394 virtual. */
1398 /* [class.base.init]
1400 If a mem-initializer-id is ambiguous because it designates
1401 both a direct non-virtual base class and an inherited virtual
1402 base class, the mem-initializer is ill-formed. */
1404 {
1406 basetype);
1408 }
1411 {
1415 else
1419 }
1422 }
1423 else
1424 {
1427 else
1432 }
1435 }
1437 /* This is like `expand_member_init', only it stores one aggregate
1438 value into another.
1440 INIT comes in two flavors: it is either a value which
1441 is to be stored in EXP, or it is a parameter list
1442 to go to a constructor, which will operate on EXP.
1443 If INIT is not a parameter list for a constructor, then set
1444 LOOKUP_ONLYCONVERTING.
1445 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1446 the initializer, if FLAGS is 0, then it is the (init) form.
1447 If `init' is a CONSTRUCTOR, then we emit a warning message,
1448 explaining that such initializations are invalid.
1450 If INIT resolves to a CALL_EXPR which happens to return
1451 something of the type we are looking for, then we know
1452 that we can safely use that call to perform the
1453 initialization.
1455 The virtual function table pointer cannot be set up here, because
1456 we do not really know its type.
1458 This never calls operator=().
1460 When initializing, nothing is CONST.
1462 A default copy constructor may have to be used to perform the
1463 initialization.
1465 A constructor or a conversion operator may have to be used to
1466 perform the initialization, but not both, as it would be ambiguous. */
1468 tree
1470 {
1471 tree stmt_expr;
1472 tree compound_stmt;
1494 {
1495 tree itype;
1497 /* An array may not be initialized use the parenthesized
1498 initialization form -- unless the initializer is "()". */
1500 {
1504 }
1505 /* Must arrange to initialize each element of EXP
1506 from elements of INIT. */
1516 complain);
1520 /* Restore the type of init unless it was used directly. */
1524 }
1528 /* Just know that we've seen something for this node. */
1542 }
1544 static void
1546 tsubst_flags_t complain)
1547 {
1549 tree ctor_name;
1551 /* It fails because there may not be a constructor which takes
1552 its own type as the first (or only parameter), but which does
1553 take other types via a conversion. So, if the thing initializing
1554 the expression is a unit element of type X, first try X(X&),
1555 followed by initialization by X. If neither of these work
1556 out, then look hard. */
1557 tree rval;
1560 /* If we have direct-initialization from an initializer list, pull
1561 it out of the TREE_LIST so the code below can see it. */
1565 {
1569 }
1573 /* A brace-enclosed initializer for an aggregate. In C++0x this can
1574 happen for direct-initialization, too. */
1577 /* A CONSTRUCTOR of the target's type is a previously digested
1578 initializer, whether that happened just above or in
1579 cp_parser_late_parsing_nsdmi.
1581 A TARGET_EXPR with TARGET_EXPR_DIRECT_INIT_P or TARGET_EXPR_LIST_INIT_P
1582 set represents the whole initialization, so we shouldn't build up
1583 another ctor call. */
1590 {
1591 /* Early initialization via a TARGET_EXPR only works for
1592 complete objects. */
1599 }
1603 {
1604 /* Base subobjects should only get direct-initialization. */
1608 /* Do nothing. We hit this in two cases: Reference initialization,
1609 where we aren't initializing a real variable, so we don't want
1610 to run a new constructor; and catching an exception, where we
1611 have already built up the constructor call so we could wrap it
1613 else
1618 /* We need to protect the initialization of a catch parm with a
1619 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
1620 around the TARGET_EXPR for the copy constructor. See
1621 initialize_handler_parm. */
1622 {
1626 }
1627 else
1632 }
1637 {
1641 }
1642 else
1647 {
1648 /* Delegating constructor. */
1649 tree complete;
1650 tree base;
1653 /* Unshare the arguments for the second call. */
1656 {
1659 }
1662 complain);
1668 complain);
1673 base,
1674 complete);
1675 }
1676 else
1677 {
1680 else
1683 complain);
1684 }
1690 {
1693 {
1697 }
1698 }
1700 /* FIXME put back convert_to_void? */
1703 }
1705 /* This function is responsible for initializing EXP with INIT
1706 (if any).
1708 BINFO is the binfo of the type for who we are performing the
1709 initialization. For example, if W is a virtual base class of A and B,
1710 and C : A, B.
1711 If we are initializing B, then W must contain B's W vtable, whereas
1712 were we initializing C, W must contain C's W vtable.
1714 TRUE_EXP is nonzero if it is the true expression being initialized.
1715 In this case, it may be EXP, or may just contain EXP. The reason we
1716 need this is because if EXP is a base element of TRUE_EXP, we
1717 don't necessarily know by looking at EXP where its virtual
1718 baseclass fields should really be pointing. But we do know
1719 from TRUE_EXP. In constructors, we don't know anything about
1720 the value being initialized.
1722 FLAGS is just passed to `build_new_method_call'. See that function
1723 for its description. */
1725 static void
1727 tsubst_flags_t complain)
1728 {
1734 /* Use a function returning the desired type to initialize EXP for us.
1735 If the function is a constructor, and its first argument is
1736 NULL_TREE, know that it was meant for us--just slide exp on
1737 in and expand the constructor. Constructors now come
1738 as TARGET_EXPRs. */
1742 {
1744 /* If store_init_value returns NULL_TREE, the INIT has been
1745 recorded as the DECL_INITIAL for EXP. That means there's
1746 nothing more we have to do. */
1752 }
1754 /* If an explicit -- but empty -- initializer list was present,
1755 that's value-initialization. */
1757 {
1758 /* If the type has data but no user-provided ctor, we need to zero
1759 out the object. */
1762 {
1765 /* Don't clobber already initialized virtual bases. */
1768 field_size);
1771 }
1773 /* If we don't need to mess with the constructor at all,
1774 then we're done. */
1778 /* Otherwise fall through and call the constructor. */
1780 }
1782 /* We know that expand_default_init can handle everything we want
1783 at this point. */
1785 }
1787 /* Report an error if TYPE is not a user-defined, class type. If
1788 OR_ELSE is nonzero, give an error message. */
1790 int
1792 {
1797 {
1801 }
1803 }
1805 tree
1807 {
1813 else
1815 }
1817 /* Build a reference to a member of an aggregate. This is not a C++
1818 `&', but really something which can have its address taken, and
1819 then act as a pointer to member, for example TYPE :: FIELD can have
1820 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if
1821 this expression is the operand of "&".
1823 @@ Prints out lousy diagnostics for operator <typename>
1824 @@ fields.
1826 @@ This function should be rewritten and placed in search.c. */
1828 tree
1830 tsubst_flags_t complain)
1831 {
1832 tree decl;
1835 /* class templates can come in as TEMPLATE_DECLs here. */
1848 /* Callers should call mark_used before this point. */
1853 {
1857 }
1859 /* Entities other than non-static members need no further
1860 processing. */
1867 {
1871 }
1873 /* Set up BASEBINFO for member lookup. */
1876 /* A lot of this logic is now handled in lookup_member. */
1878 {
1879 /* Go from the TREE_BASELINK to the member function info. */
1883 {
1884 /* Get rid of a potential OVERLOAD around it. */
1887 /* Unique functions are handled easily. */
1889 /* For non-static member of base class, we need a special rule
1890 for access checking [class.protected]:
1892 If the access is to form a pointer to member, the
1893 nested-name-specifier shall name the derived class
1894 (or any class derived from that class). */
1898 complain);
1899 else
1901 complain);
1906 }
1907 else
1909 }
1911 /* We need additional test besides the one in
1912 check_accessibility_of_qualified_id in case it is
1913 a pointer to non-static member. */
1915 complain);
1918 {
1919 /* If MEMBER is non-static, then the program has fallen afoul of
1920 [expr.prim]:
1922 An id-expression that denotes a nonstatic data member or
1923 nonstatic member function of a class can only be used:
1925 -- as part of a class member access (_expr.ref_) in which the
1926 object-expression refers to the member's class or a class
1927 derived from that class, or
1929 -- to form a pointer to member (_expr.unary.op_), or
1931 -- in the body of a nonstatic member function of that class or
1932 of a class derived from that class (_class.mfct.nonstatic_), or
1934 -- in a mem-initializer for a constructor for that class or for
1935 a class derived from that class (_class.base.init_). */
1937 {
1938 /* Build a representation of the qualified name suitable
1939 for use as the operand to "&" -- even though the "&" is
1940 not actually present. */
1942 /* In Microsoft mode, treat a non-static member function as if
1943 it were a pointer-to-member. */
1945 {
1948 }
1953 }
1955 {
1959 }
1961 }
1966 }
1968 /* If DECL is a scalar enumeration constant or variable with a
1969 constant initializer, return the initializer (or, its initializers,
1970 recursively); otherwise, return DECL. If INTEGRAL_P, the
1971 initializer is only returned if DECL is an integral
1972 constant-expression. If RETURN_AGGREGATE_CST_OK_P, it is ok to
1973 return an aggregate constant. */
1975 static tree
1977 {
1979 || (integral_p
1983 {
1984 tree init;
1985 /* If DECL is a static data member in a template
1986 specialization, we must instantiate it here. The
1987 initializer for the static data member is not processed
1988 until needed; we need it now. */
1993 {
1995 /* Treat the error as a constant to avoid cascading errors on
1996 excessively recursive template instantiation (c++/9335). */
1998 else
2000 }
2001 /* Initializers in templates are generally expanded during
2002 instantiation, so before that for const int i(2)
2003 INIT is a TREE_LIST with the actual initializer as
2004 TREE_VALUE. */
2006 && init
2014 /* Unless RETURN_AGGREGATE_CST_OK_P is true, do not
2015 return an aggregate constant (of which string
2016 literals are a special case), as we do not want
2017 to make inadvertent copies of such entities, and
2018 we must be sure that their addresses are the
2019 same everywhere. */
2024 }
2026 }
2028 /* If DECL is a CONST_DECL, or a constant VAR_DECL initialized by
2029 constant of integral or enumeration type, then return that value.
2030 These are those variables permitted in constant expressions by
2031 [5.19/1]. */
2033 tree
2035 {
2038 }
2040 /* A more relaxed version of integral_constant_value, used by the
2041 common C/C++ code. */
2043 tree
2045 {
2048 }
2050 /* A version of integral_constant_value used by the C++ front end for
2051 optimization purposes. */
2053 tree
2055 {
2058 }
2059 \f
2060 /* Common subroutines of build_new and build_vec_delete. */
2062 /* Call the global __builtin_delete to delete ADDR. */
2064 static tree
2066 {
2069 }
2070 \f
2071 /* Build and return a NEW_EXPR. If NELTS is non-NULL, TYPE[NELTS] is
2072 the type of the object being allocated; otherwise, it's just TYPE.
2073 INIT is the initializer, if any. USE_GLOBAL_NEW is true if the
2074 user explicitly wrote "::operator new". PLACEMENT, if non-NULL, is
2075 a vector of arguments to be provided as arguments to a placement
2076 new operator. This routine performs no semantic checks; it just
2077 creates and returns a NEW_EXPR. */
2079 static tree
2082 {
2083 tree init_list;
2084 tree new_expr;
2086 /* If INIT is NULL, the we want to store NULL_TREE in the NEW_EXPR.
2087 If INIT is not NULL, then we want to store VOID_ZERO_NODE. This
2088 permits us to distinguish the case of a missing initializer "new
2089 int" from an empty initializer "new int()". */
2094 else
2099 init_list);
2104 }
2106 /* Diagnose uninitialized const members or reference members of type
2107 TYPE. USING_NEW is used to disambiguate the diagnostic between a
2108 new expression without a new-initializer and a declaration. Returns
2109 the error count. */
2111 static int
2114 {
2115 tree field;
2122 {
2123 tree field_type;
2134 {
2137 {
2139 {
2143 else
2145 }
2146 else
2147 {
2152 else
2155 }
2158 }
2159 }
2162 {
2165 {
2167 {
2171 else
2173 }
2174 else
2175 {
2180 else
2183 }
2186 }
2187 }
2190 error_count
2193 }
2195 }
2197 int
2199 {
2201 }
2203 /* Call __cxa_bad_array_new_length to indicate that the size calculation
2204 overflowed. Pretend it returns sizetype so that it plays nicely in the
2205 COND_EXPR. */
2207 tree
2209 {
2213 NULL_TREE));
2216 }
2218 /* Call __cxa_bad_array_length to indicate that there were too many
2219 initializers. */
2221 tree
2223 {
2227 NULL_TREE));
2230 }
2232 /* Generate code for a new-expression, including calling the "operator
2233 new" function, initializing the object, and, if an exception occurs
2234 during construction, cleaning up. The arguments are as for
2235 build_raw_new_expr. This may change PLACEMENT and INIT. */
2237 static tree
2240 tsubst_flags_t complain)
2241 {
2243 /* True iff this is a call to "operator new[]" instead of just
2244 "operator new". */
2246 /* If ARRAY_P is true, the element type of the array. This is never
2247 an ARRAY_TYPE; for something like "new int[3][4]", the
2248 ELT_TYPE is "int". If ARRAY_P is false, this is the same type as
2249 TYPE. */
2250 tree elt_type;
2251 /* The type of the new-expression. (This type is always a pointer
2252 type.) */
2253 tree pointer_type;
2254 tree non_const_pointer_type;
2256 /* For arrays, a bounds checks on the NELTS parameter. */
2261 /* Size of the inner array elements. */
2262 double_int inner_size;
2263 /* The address returned by the call to "operator new". This node is
2264 a VAR_DECL and is therefore reusable. */
2265 tree alloc_node;
2266 tree alloc_fn;
2270 /* If non-NULL, the number of extra bytes to allocate at the
2271 beginning of the storage allocated for an array-new expression in
2272 order to store the number of elements. */
2274 tree placement_first;
2276 /* True if the function we are calling is a placement allocation
2277 function. */
2279 /* True if the storage must be initialized, either by a constructor
2280 or due to an explicit new-initializer. */
2282 /* The address of the thing allocated, not including any cookie. In
2283 particular, if an array cookie is in use, DATA_ADDR is the
2284 address of the first array element. This node is a VAR_DECL, and
2285 is therefore reusable. */
2286 tree data_addr;
2291 {
2294 }
2296 {
2297 /* Transforms new (T[N]) to new T[N]. The former is a GNU
2298 extension for variable N. (This also covers new T where T is
2299 a VLA typedef.) */
2305 }
2307 /* If our base type is an array, then make sure we know how many elements
2308 it has. */
2312 {
2316 {
2322 {
2326 }
2328 }
2329 else
2330 {
2332 {
2336 }
2338 }
2342 inner_nelts_cst,
2343 complain);
2344 }
2347 {
2350 }
2355 /* Warn if we performed the (T[N]) to T[N] transformation and N is
2356 variable. */
2359 {
2361 {
2366 else
2371 }
2372 else
2374 }
2377 {
2381 }
2389 {
2391 /* A program that calls for default-initialization [...] of an
2392 entity of reference type is ill-formed. */
2396 /* A new-expression that creates an object of type T initializes
2397 that object as follows:
2398 - If the new-initializer is omitted:
2399 -- If T is a (possibly cv-qualified) non-POD class type
2400 (or array thereof), the object is default-initialized (8.5).
2401 [...]
2402 -- Otherwise, the object created has indeterminate
2403 value. If T is a const-qualified type, or a (possibly
2404 cv-qualified) POD class type (or array thereof)
2405 containing (directly or indirectly) a member of
2406 const-qualified type, the program is ill-formed; */
2416 }
2420 {
2424 }
2428 {
2429 /* Maximum available size in bytes. Half of the address space
2430 minus the cookie size. */
2431 double_int max_size
2433 HOST_BITS_PER_DOUBLE_INT);
2434 /* Maximum number of outer elements which can be allocated. */
2435 double_int max_outer_nelts;
2436 tree max_outer_nelts_tree;
2442 /* Unconditionally subtract the cookie size. This decreases the
2443 maximum object size and is safe even if we choose not to use
2444 a cookie after all. */
2450 {
2454 }
2456 /* Only keep the top-most seven bits, to simplify encoding the
2457 constant in the instruction stream. */
2458 {
2462 max_outer_nelts
2465 }
2470 outer_nelts,
2471 max_outer_nelts_tree);
2472 }
2476 /* If PLACEMENT is a single simple pointer type not passed by
2477 reference, prepare to capture it in a temporary variable. Do
2478 this now, since PLACEMENT will change in the calls below. */
2484 /* Allocate the object. */
2486 {
2487 tree class_addr;
2488 tree class_decl;
2492 {
2495 }
2504 {
2508 }
2510 {
2514 }
2519 }
2521 {
2524 }
2525 else
2526 {
2527 tree fnname;
2528 tree fns;
2534 && (array_p
2537 {
2538 /* Use a class-specific operator new. */
2539 /* If a cookie is required, add some extra space. */
2542 else
2543 {
2545 /* No size arithmetic necessary, so the size check is
2546 not needed. */
2549 }
2550 /* Perform the overflow check. */
2557 /* Create the argument list. */
2559 /* Do name-lookup to find the appropriate operator. */
2562 {
2566 }
2568 {
2570 {
2573 }
2575 }
2579 LOOKUP_NORMAL,
2581 complain);
2582 }
2583 else
2584 {
2585 /* Use a global operator new. */
2586 /* See if a cookie might be required. */
2588 {
2590 /* No size arithmetic necessary, so the size check is
2591 not needed. */
2594 }
2598 outer_nelts_check,
2600 }
2601 }
2608 /* If we found a simple case of PLACEMENT_EXPR above, then copy it
2609 into a temporary variable. */
2616 {
2621 {
2625 }
2626 }
2628 /* In the simple case, we can stop now. */
2633 /* Store the result of the allocation call in a variable so that we can
2634 use it more than once. */
2638 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */
2642 /* Now, check to see if this function is actually a placement
2643 allocation function. This can happen even when PLACEMENT is NULL
2644 because we might have something like:
2646 struct S { void* operator new (size_t, int i = 0); };
2648 A call to `new S' will get this allocation function, even though
2649 there is no explicit placement argument. If there is more than
2650 one argument, or there are variable arguments, then this is a
2651 placement allocation function. */
2652 placement_allocation_fn_p
2656 /* Preevaluate the placement args so that we don't reevaluate them for a
2657 placement delete. */
2659 {
2660 tree inits;
2664 alloc_expr);
2665 }
2667 /* unless an allocation function is declared with an empty excep-
2668 tion-specification (_except.spec_), throw(), it indicates failure to
2669 allocate storage by throwing a bad_alloc exception (clause _except_,
2670 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2671 cation function is declared with an empty exception-specification,
2672 throw(), it returns null to indicate failure to allocate storage and a
2673 non-null pointer otherwise.
2675 So check for a null exception spec on the op new we just called. */
2681 {
2682 tree cookie;
2683 tree cookie_ptr;
2684 tree size_ptr_type;
2686 /* Adjust so we're pointing to the start of the object. */
2689 /* Store the number of bytes allocated so that we can know how
2690 many elements to destroy later. We use the last sizeof
2691 (size_t) bytes to store the number of elements. */
2702 {
2703 /* Also store the element size. */
2714 }
2715 }
2716 else
2717 {
2720 }
2722 /* Now use a pointer to the type we've actually allocated. */
2724 /* But we want to operate on a non-const version to start with,
2725 since we'll be modifying the elements. */
2726 non_const_pointer_type = build_pointer_type
2730 /* Any further uses of alloc_node will want this type, too. */
2733 /* Now initialize the allocated object. Note that we preevaluate the
2734 initialization expression, apart from the actual constructor call or
2735 assignment--we do this because we want to delay the allocation as long
2736 as possible in order to minimize the size of the exception region for
2737 placement delete. */
2739 {
2744 {
2747 }
2750 {
2751 /* build_value_init doesn't work in templates, and we don't need
2752 the initializer anyway since we're going to throw it away and
2753 rebuild it at instantiation time, so just build up a single
2754 constructor call to get any appropriate diagnostics. */
2758 complete_ctor_identifier,
2760 LOOKUP_NORMAL,
2761 complain);
2763 }
2765 {
2770 {
2774 else
2775 {
2779 complain);
2780 else
2781 /* We'll check the length at runtime. */
2785 }
2786 }
2788 {
2792 else
2795 }
2796 init_expr
2800 integer_one_node,
2801 complain),
2802 vecinit,
2803 explicit_value_init_p,
2805 complain);
2807 /* An array initialization is stable because the initialization
2808 of each element is a full-expression, so the temporaries don't
2809 leak out. */
2811 }
2812 else
2813 {
2817 {
2819 complete_ctor_identifier,
2821 LOOKUP_NORMAL,
2822 complain);
2823 }
2825 {
2826 /* Something like `new int()'. */
2831 }
2832 else
2833 {
2834 tree ie;
2836 /* We are processing something like `new int (10)', which
2837 means allocate an int, and initialize it with 10. */
2840 complain);
2842 complain);
2843 }
2845 }
2850 /* If any part of the object initialization terminates by throwing an
2851 exception and a suitable deallocation function can be found, the
2852 deallocation function is called to free the memory in which the
2853 object was being constructed, after which the exception continues
2854 to propagate in the context of the new-expression. If no
2855 unambiguous matching deallocation function can be found,
2856 propagating the exception does not cause the object's memory to be
2857 freed. */
2859 {
2861 tree cleanup;
2863 /* The Standard is unclear here, but the right thing to do
2864 is to use the same method for finding deallocation
2865 functions that we use for finding allocation functions. */
2866 cleanup = (build_op_delete_call
2868 alloc_node,
2869 size,
2870 globally_qualified_p,
2872 alloc_fn,
2873 complain));
2878 /* This is much simpler if we were able to preevaluate all of
2879 the arguments to the constructor call. */
2880 {
2881 /* CLEANUP is compiler-generated, so no diagnostics. */
2885 /* Likewise, this try-catch is compiler-generated. */
2887 }
2888 else
2889 /* Ack! First we allocate the memory. Then we set our sentry
2890 variable to true, and expand a cleanup that deletes the
2891 memory if sentry is true. Then we run the constructor, and
2892 finally clear the sentry.
2894 We need to do this because we allocate the space first, so
2895 if there are any temporaries with cleanups in the
2896 constructor args and we weren't able to preevaluate them, we
2897 need this EH region to extend until end of full-expression
2898 to preserve nesting. */
2899 {
2907 /* CLEANUP is compiler-generated, so no diagnostics. */
2917 init_expr
2920 end));
2921 /* Likewise, this is compiler-generated. */
2923 }
2924 }
2925 }
2926 else
2929 /* Now build up the return value in reverse order. */
2939 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
2940 and return the call (which doesn't need to be adjusted). */
2942 else
2943 {
2945 {
2948 nullptr_node,
2949 complain);
2952 }
2954 /* Perform the allocation before anything else, so that ALLOC_NODE
2955 has been initialized before we start using it. */
2957 }
2962 /* A new-expression is never an lvalue. */
2966 }
2968 /* Generate a representation for a C++ "new" expression. *PLACEMENT
2969 is a vector of placement-new arguments (or NULL if none). If NELTS
2970 is NULL, TYPE is the type of the storage to be allocated. If NELTS
2971 is not NULL, then this is an array-new allocation; TYPE is the type
2972 of the elements in the array and NELTS is the number of elements in
2973 the array. *INIT, if non-NULL, is the initializer for the new
2974 object, or an empty vector to indicate an initializer of "()". If
2975 USE_GLOBAL_NEW is true, then the user explicitly wrote "::new"
2976 rather than just "new". This may change PLACEMENT and INIT. */
2978 tree
2981 {
2982 tree rval;
2991 /* Don't do auto deduction where it might affect mangling. */
2993 {
2996 {
3000 }
3001 }
3004 {
3011 use_global_new);
3022 }
3025 {
3027 {
3030 else
3032 }
3035 }
3037 /* ``A reference cannot be created by the new operator. A reference
3038 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
3039 returned by new.'' ARM 5.3.3 */
3041 {
3044 else
3047 }
3050 {
3054 }
3056 /* The type allocated must be complete. If the new-type-id was
3057 "T[N]" then we are just checking that "T" is complete here, but
3058 that is equivalent, since the value of "N" doesn't matter. */
3067 {
3073 }
3075 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
3080 }
3082 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
3084 tree
3086 {
3092 {
3095 {
3098 }
3100 }
3102 /* Mangle the class$ field. */
3103 {
3104 tree field;
3107 {
3111 }
3113 {
3116 }
3117 }
3121 {
3131 }
3133 }
3134 \f
3135 static tree
3137 special_function_kind auto_delete_vec,
3139 {
3140 tree virtual_size;
3142 tree size_exp;
3144 /* Temporary variables used by the loop. */
3147 /* This is the body of the loop that implements the deletion of a
3148 single element, and moves temp variables to next elements. */
3149 tree body;
3151 /* This is the LOOP_EXPR that governs the deletion of the elements. */
3154 /* This is the thing that governs what to do after the loop has run. */
3157 /* This is the BIND_EXPR which holds the outermost iterator of the
3158 loop. It is convenient to set this variable up and test it before
3159 executing any other code in the loop.
3160 This is also the containing expression returned by this function. */
3162 tree tmp;
3164 /* We should only have 1-D arrays here. */
3171 {
3174 "possible problem detected in invocation of "
3176 {
3179 "class-specific operator delete [] will be called, "
3181 }
3183 }
3190 {
3191 /* Make sure the destructor is callable. */
3193 {
3196 complain);
3199 }
3201 }
3203 /* The below is short by the cookie size. */
3208 tbase_init
3212 base),
3213 virtual_size),
3214 complain);
3232 complain);
3240 no_destructor:
3241 /* Delete the storage if appropriate. */
3243 {
3244 tree base_tbd;
3246 /* The below is short by the cookie size. */
3251 /* no header */
3253 else
3254 {
3255 tree cookie_size;
3259 MINUS_EXPR,
3262 cookie_size,
3263 complain);
3267 /* True size with header. */
3269 }
3276 complain);
3277 }
3281 ;
3284 else
3290 /* Outermost wrapper: If pointer is null, punt. */
3295 nullptr_node)),
3300 {
3303 }
3306 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
3310 }
3312 /* Create an unnamed variable of the indicated TYPE. */
3314 tree
3316 {
3317 tree decl;
3327 }
3329 /* Create a new temporary variable of the indicated TYPE, initialized
3330 to INIT.
3332 It is not entered into current_binding_level, because that breaks
3333 things when it comes time to do final cleanups (which take place
3334 "outside" the binding contour of the function). */
3336 tree
3338 {
3339 tree decl;
3345 tf_warning_or_error));
3348 }
3350 /* `build_vec_init' returns tree structure that performs
3351 initialization of a vector of aggregate types.
3353 BASE is a reference to the vector, of ARRAY_TYPE, or a pointer
3354 to the first element, of POINTER_TYPE.
3355 MAXINDEX is the maximum index of the array (one less than the
3356 number of elements). It is only used if BASE is a pointer or
3357 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
3359 INIT is the (possibly NULL) initializer.
3361 If EXPLICIT_VALUE_INIT_P is true, then INIT must be NULL. All
3362 elements in the array are value-initialized.
3364 FROM_ARRAY is 0 if we should init everything with INIT
3365 (i.e., every element initialized from INIT).
3366 FROM_ARRAY is 1 if we should index into INIT in parallel
3367 with initialization of DECL.
3368 FROM_ARRAY is 2 if we should index into INIT in parallel,
3369 but use assignment instead of initialization. */
3371 tree
3375 {
3376 tree rval;
3379 tree iterator;
3380 /* The type of BASE. */
3382 /* The type of an element in the array. */
3384 /* The element type reached after removing all outer array
3385 types. */
3386 tree inner_elt_type;
3387 /* The type of a pointer to an element in the array. */
3388 tree ptype;
3389 tree stmt_expr;
3390 tree compound_stmt;
3412 /* Look through the TARGET_EXPR around a compound literal. */
3418 /* If we have a braced-init-list, make sure that the array
3419 is big enough for all the initializers. */
3435 /* Don't do this if the CONSTRUCTOR might contain something
3436 that might throw and require us to clean up. */
3440 {
3441 /* Do non-default initialization of trivial arrays resulting from
3442 brace-enclosed initializers. In this case, digest_init and
3443 store_constructor will handle the semantics for us. */
3451 stmt_expr);
3453 }
3457 {
3463 }
3464 else
3467 /* The code we are generating looks like:
3468 ({
3469 T* t1 = (T*) base;
3470 T* rval = t1;
3471 ptrdiff_t iterator = maxindex;
3472 try {
3473 for (; iterator != -1; --iterator) {
3474 ... initialize *t1 ...
3475 ++t1;
3476 }
3477 } catch (...) {
3478 ... destroy elements that were constructed ...
3479 }
3480 rval;
3481 })
3483 We can omit the try and catch blocks if we know that the
3484 initialization will never throw an exception, or if the array
3485 elements do not have destructors. We can omit the loop completely if
3486 the elements of the array do not have constructors.
3488 We actually wrap the entire body of the above in a STMT_EXPR, for
3489 tidiness.
3491 When copying from array to another, when the array elements have
3492 only trivial copy constructors, we should use __builtin_memcpy
3493 rather than generating a loop. That way, we could take advantage
3494 of whatever cleverness the back end has for dealing with copies
3495 of blocks of memory. */
3504 /* If initializing one array from another, initialize element by
3505 element. We rely upon the below calls to do the argument
3506 checking. Evaluate the initializer before entering the try block. */
3508 {
3517 }
3519 /* Protect the entire array initialization so that we can destroy
3520 the partially constructed array if an exception is thrown.
3521 But don't do this if we're assigning. */
3524 {
3526 }
3528 /* If the initializer is {}, then all elements are initialized from {}.
3529 But for non-classes, that's the same as value-initialization. */
3532 {
3535 else
3536 {
3539 }
3540 }
3542 /* Maybe pull out constant value when from_array? */
3545 {
3546 /* Do non-default initialization of non-trivial arrays resulting from
3547 brace-enclosed initializers. */
3550 /* Should we try to create a constant initializer? */
3555 /* If the constructor already has the array type, it's been through
3556 digest_init, so we shouldn't try to do anything more. */
3560 /* If we're initializing a static array, we want to do static
3561 initialization of any elements with constant initializers even if
3562 some are non-constant. */
3568 {
3569 tree throw_call;
3572 else
3577 }
3581 else
3585 {
3587 tree one_init;
3589 num_initialized_elts++;
3596 else
3602 {
3611 {
3615 else
3618 }
3619 else
3620 {
3622 {
3627 }
3629 }
3630 }
3639 else
3643 complain);
3646 else
3648 }
3651 {
3656 else
3658 }
3660 /* Any elements without explicit initializers get {}. */
3663 else
3664 {
3667 }
3668 }
3670 {
3675 {
3679 }
3680 }
3682 /* Now, default-initialize any remaining elements. We don't need to
3683 do that if a) the type does not need constructing, or b) we've
3684 already initialized all the elements.
3686 We do need to keep going if we're copying an array. */
3691 && (num_initialized_elts
3693 {
3694 /* If the ITERATOR is equal to -1, then we don't have to loop;
3695 we've already initialized all the elements. */
3696 tree for_stmt;
3697 tree elt_init;
3698 tree to;
3706 complain);
3714 {
3715 tree from;
3718 {
3722 }
3723 else
3728 complain);
3733 complain);
3734 else
3736 }
3738 {
3740 sorry
3744 explicit_value_init_p,
3746 }
3748 {
3752 }
3753 else
3754 {
3758 else
3759 {
3762 complain);
3764 }
3765 }
3775 complain));
3778 complain));
3781 }
3783 /* Make sure to cleanup any partially constructed elements. */
3786 {
3787 tree e;
3790 complain);
3792 /* Flatten multi-dimensional array since build_vec_delete only
3793 expects one-dimensional array. */
3797 /* Avoid mixing signed and unsigned. */
3800 complain);
3809 }
3811 /* The value of the array initialization is the array itself, RVAL
3812 is a pointer to the first element. */
3817 /* Now make the result have the correct type. */
3819 {
3824 }
3833 }
3835 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
3836 build_delete. */
3838 static tree
3840 tsubst_flags_t complain)
3841 {
3842 tree name;
3843 tree fn;
3845 {
3860 }
3865 flags,
3867 complain);
3868 }
3870 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
3871 ADDR is an expression which yields the store to be destroyed.
3872 AUTO_DELETE is the name of the destructor to call, i.e., either
3873 sfk_complete_destructor, sfk_base_destructor, or
3874 sfk_deleting_destructor.
3876 FLAGS is the logical disjunction of zero or more LOOKUP_
3877 flags. See cp-tree.h for more info. */
3879 tree
3882 {
3883 tree expr;
3890 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
3891 set to `error_mark_node' before it gets properly cleaned up. */
3899 {
3901 {
3905 }
3908 }
3911 {
3916 /* We don't want to warn about delete of void*, only other
3917 incomplete types. Deleting other incomplete types
3918 invokes undefined behavior, but it is not ill-formed, so
3919 compile to something that would even do The Right Thing
3920 (TM) should the type have a trivial dtor and no delete
3921 operator. */
3923 {
3926 {
3929 "possible problem detected in invocation of "
3931 {
3934 "neither the destructor nor the class-specific "
3935 "operator delete will be called, even if they are "
3937 }
3939 }
3943 {
3944 tree dtor;
3947 {
3950 "deleting object of abstract class type %qT"
3951 " which has non-virtual destructor"
3953 else
3955 "deleting object of polymorphic class type %qT"
3956 " which has non-virtual destructor"
3958 }
3959 }
3960 }
3962 /* Call the builtin operator delete. */
3967 /* Throw away const and volatile on target type of addr. */
3969 }
3970 else
3971 {
3972 /* Don't check PROTECT here; leave that decision to the
3973 destructor. If the destructor is accessible, call it,
3974 else report error. */
3982 }
3985 {
3986 /* Make sure the destructor is callable. */
3988 {
3990 complain),
3994 }
4001 use_global_delete,
4004 complain);
4005 }
4006 else
4007 {
4010 tree ifexp;
4015 /* For `::delete x', we must not use the deleting destructor
4016 since then we would not be sure to get the global `operator
4017 delete'. */
4019 {
4020 /* We will use ADDR multiple times so we must save it. */
4023 /* Delete the object. */
4025 /* Otherwise, treat this like a complete object destructor
4026 call. */
4028 }
4029 /* If the destructor is non-virtual, there is no deleting
4030 variant. Instead, we must explicitly call the appropriate
4031 `operator delete' here. */
4034 {
4035 /* We will use ADDR multiple times so we must save it. */
4037 /* Build the call. */
4039 addr,
4044 complain);
4045 /* Call the complete object destructor. */
4047 }
4050 {
4051 /* Make sure we have access to the member op delete, even though
4052 we'll actually be calling it from the destructor. */
4057 complain);
4058 }
4067 /* We need to calculate this before the dtor changes the vptr. */
4072 /* Explicit destructor call; don't check for null pointer. */
4074 else
4075 {
4076 /* Handle deleting a null pointer. */
4079 complain));
4082 }
4089 }
4090 }
4092 /* At the beginning of a destructor, push cleanups that will call the
4093 destructors for our base classes and members.
4095 Called from begin_destructor_body. */
4097 void
4099 {
4102 tree member;
4103 tree expr;
4106 /* Run destructors for all virtual baseclasses. */
4108 {
4109 tree cond = (condition_conversion
4111 current_in_charge_parm,
4112 integer_two_node)));
4114 /* The CLASSTYPE_VBASECLASSES vector is in initialization
4115 order, which is also the right order for pushing cleanups. */
4118 {
4120 {
4122 base_dtor_identifier,
4123 NULL,
4124 base_binfo,
4125 (LOOKUP_NORMAL
4127 tf_warning_or_error);
4129 {
4133 }
4134 }
4135 }
4136 }
4138 /* Take care of the remaining baseclasses. */
4141 {
4147 base_dtor_identifier,
4150 tf_warning_or_error);
4153 }
4155 /* Don't automatically destroy union members. */
4161 {
4170 {
4171 tree this_member = (build_class_member_access_expr
4175 tf_warning_or_error));
4177 sfk_complete_destructor,
4182 }
4183 }
4184 }
4186 /* Build a C++ vector delete expression.
4187 MAXINDEX is the number of elements to be deleted.
4188 ELT_SIZE is the nominal size of each element in the vector.
4189 BASE is the expression that should yield the store to be deleted.
4190 This function expands (or synthesizes) these calls itself.
4191 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
4193 This also calls delete for virtual baseclasses of elements of the vector.
4195 Update: MAXINDEX is no longer needed. The size can be extracted from the
4196 start of the vector for pointers, and from the type for arrays. We still
4197 use MAXINDEX for arrays because it happens to already have one of the
4198 values we'd have to extract. (We could use MAXINDEX with pointers to
4199 confirm the size, and trap if the numbers differ; not clear that it'd
4200 be worth bothering.) */
4202 tree
4204 special_function_kind auto_delete_vec,
4206 {
4207 tree type;
4208 tree rval;
4214 {
4215 /* Step back one from start of vector, and read dimension. */
4216 tree cookie_addr;
4221 {
4224 }
4229 cookie_addr);
4231 }
4233 {
4234 /* Get the total number of things in the array, maxindex is a
4235 bad name. */
4242 {
4245 }
4246 }
4247 else
4248 {
4252 }
4260 }