| blob | f0ca9b9a396c5faa0924ff050dfa828115e61895 |
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. */
52 /* We are about to generate some complex initialization code.
53 Conceptually, it is all a single expression. However, we may want
54 to include conditionals, loops, and other such statement-level
55 constructs. Therefore, we build the initialization code inside a
56 statement-expression. This function starts such an expression.
57 STMT_EXPR_P and COMPOUND_STMT_P are filled in by this function;
58 pass them back to finish_init_stmts when the expression is
59 complete. */
61 static bool
63 {
70 }
72 /* Finish out the statement-expression begun by the previous call to
73 begin_init_stmts. Returns the statement-expression itself. */
75 static tree
77 {
85 }
87 /* Constructors */
89 /* Called from initialize_vtbl_ptrs via dfs_walk. BINFO is the base
90 which we want to initialize the vtable pointer for, DATA is
91 TREE_LIST whose TREE_VALUE is the this ptr expression. */
93 static tree
95 {
100 {
104 tf_warning_or_error);
107 }
110 }
112 /* Initialize all the vtable pointers in the object pointed to by
113 ADDR. */
115 void
117 {
118 tree list;
119 tree type;
124 /* Walk through the hierarchy, initializing the vptr in each base
125 class. We do these in pre-order because we can't find the virtual
126 bases for a class until we've initialized the vtbl for that
127 class. */
129 }
131 /* Return an expression for the zero-initialization of an object with
132 type T. This expression will either be a constant (in the case
133 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
134 aggregate), or NULL (in the case that T does not require
135 initialization). In either case, the value can be used as
136 DECL_INITIAL for a decl of the indicated TYPE; it is a valid static
137 initializer. If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS
138 is the number of elements in the array. If STATIC_STORAGE_P is
139 TRUE, initializers are only generated for entities for which
140 zero-initialization does not simply mean filling the storage with
141 zero bytes. FIELD_SIZE, if non-NULL, is the bit size of the field,
142 subfields with bit positions at or above that bit size shouldn't
143 be added. Note that this only works when the result is assigned
144 to a base COMPONENT_REF; if we only have a pointer to the base subobject,
145 expand_assignment will end up clearing the full size of TYPE. */
147 static tree
149 tree field_size)
150 {
153 /* [dcl.init]
155 To zero-initialize an object of type T means:
157 -- if T is a scalar type, the storage is set to the value of zero
158 converted to T.
160 -- if T is a non-union class type, the storage for each nonstatic
161 data member and each base-class subobject is zero-initialized.
163 -- if T is a union type, the storage for its first data member is
164 zero-initialized.
166 -- if T is an array type, the storage for each element is
167 zero-initialized.
169 -- if T is a reference type, no initialization is performed. */
174 ;
176 /* In order to save space, we do not explicitly build initializers
177 for items that do not need them. GCC's semantics are that
178 items with static storage duration that are not otherwise
179 initialized are initialized to zero. */
180 ;
186 {
187 tree field;
190 /* Iterate over the fields, building initializations. */
192 {
199 /* Don't add virtual bases for base classes if they are beyond
200 the size of the current field, that means it is present
201 somewhere else in the object. */
203 {
208 }
210 /* Note that for class types there will be FIELD_DECLs
211 corresponding to base classes as well. Thus, iterating
212 over TYPE_FIELDs will result in correct initialization of
213 all of the subobjects. */
215 {
216 tree new_field_size
223 static_storage_p,
224 new_field_size);
227 }
229 /* For unions, only the first field is initialized. */
232 }
234 /* Build a constructor to contain the initializations. */
236 }
238 {
239 tree max_index;
242 /* Iterate over the array elements, building initializations. */
247 else
250 /* If we have an error_mark here, we should just return error mark
251 as we don't know the size of the array yet. */
256 /* A zero-sized array, which is accepted as an extension, will
257 have an upper bound of -1. */
259 {
260 constructor_elt ce;
262 /* If this is a one element array, we just use a regular init. */
265 else
267 max_index);
273 {
276 }
277 }
279 /* Build a constructor to contain the initializations. */
281 }
284 else
287 /* In all cases, the initializer is a constant. */
292 }
294 /* Return an expression for the zero-initialization of an object with
295 type T. This expression will either be a constant (in the case
296 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
297 aggregate), or NULL (in the case that T does not require
298 initialization). In either case, the value can be used as
299 DECL_INITIAL for a decl of the indicated TYPE; it is a valid static
300 initializer. If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS
301 is the number of elements in the array. If STATIC_STORAGE_P is
302 TRUE, initializers are only generated for entities for which
303 zero-initialization does not simply mean filling the storage with
304 zero bytes. */
306 tree
308 {
310 }
312 /* Return a suitable initializer for value-initializing an object of type
313 TYPE, as described in [dcl.init]. */
315 tree
317 {
318 /* [dcl.init]
320 To value-initialize an object of type T means:
322 - if T is a class type (clause 9) with either no default constructor
323 (12.1) or a default constructor that is user-provided or deleted,
324 then then the object is default-initialized;
326 - if T is a (possibly cv-qualified) class type without a user-provided
327 or deleted default constructor, then the object is zero-initialized
328 and the semantic constraints for default-initialization are checked,
329 and if T has a non-trivial default constructor, the object is
330 default-initialized;
332 - if T is an array type, then each element is value-initialized;
334 - otherwise, the object is zero-initialized.
336 A program that calls for default-initialization or
337 value-initialization of an entity of reference type is ill-formed. */
339 /* The AGGR_INIT_EXPR tweaking below breaks in templates. */
345 {
346 tree ctor = build_aggr_init_expr
350 complain));
355 {
356 /* This is a class that needs constructing, but doesn't have
357 a user-provided constructor. So we need to zero-initialize
358 the object and then call the implicitly defined ctor.
359 This will be handled in simplify_aggr_init_expr. */
362 }
363 }
365 /* Discard any access checking during subobject initialization;
366 the checks are implied by the call to the ctor which we have
367 verified is OK (cpp0x/defaulted46.C). */
372 }
374 /* Like build_value_init, but don't call the constructor for TYPE. Used
375 for base initializers. */
377 tree
379 {
381 {
385 }
386 /* FIXME the class and array cases should just use digest_init once it is
387 SFINAE-enabled. */
389 {
394 {
395 tree field;
398 /* Iterate over the fields, building initializations. */
400 {
411 /* We could skip vfields and fields of types with
412 user-defined constructors, but I think that won't improve
413 performance at all; it should be simpler in general just
414 to zero out the entire object than try to only zero the
415 bits that actually need it. */
417 /* Note that for class types there will be FIELD_DECLs
418 corresponding to base classes as well. Thus, iterating
419 over TYPE_FIELDs will result in correct initialization of
420 all of the subobjects. */
429 /* We shouldn't have gotten here for anything that would need
430 non-trivial initialization, and gimplify_init_ctor_preeval
431 would need to be fixed to allow it. */
434 }
436 /* Build a constructor to contain the zero- initializations. */
438 }
439 }
441 {
444 /* Iterate over the array elements, building initializations. */
447 /* If we have an error_mark here, we should just return error mark
448 as we don't know the size of the array yet. */
450 {
453 type);
455 }
458 /* A zero-sized array, which is accepted as an extension, will
459 have an upper bound of -1. */
461 {
462 constructor_elt ce;
464 /* If this is a one element array, we just use a regular init. */
467 else
478 /* We shouldn't have gotten here for anything that would need
479 non-trivial initialization, and gimplify_init_ctor_preeval
480 would need to be fixed to allow it. */
483 }
485 /* Build a constructor to contain the initializations. */
487 }
489 {
493 }
495 {
499 }
502 }
504 /* Initialize current class with INIT, a TREE_LIST of
505 arguments for a target constructor. If TREE_LIST is void_type_node,
506 an empty initializer list was given. */
508 static void
510 {
516 tf_warning_or_error));
518 {
520 LOOKUP_NORMAL
521 |LOOKUP_NONVIRTUAL
527 }
528 }
530 /* Return the non-static data initializer for FIELD_DECL MEMBER. */
532 tree
534 {
535 tree init;
541 {
542 /* Do deferred instantiation of the NSDMI. */
543 init = (tsubst_copy_and_build
550 }
551 else
552 {
555 {
560 }
561 /* Strip redundant TARGET_EXPR so we don't need to remap it, and
562 so the aggregate init code below will see a CONSTRUCTOR. */
567 }
571 }
573 /* Initialize MEMBER, a FIELD_DECL, with INIT, a TREE_LIST of
574 arguments. If TREE_LIST is void_type_node, an empty initializer
575 list was given; if NULL_TREE no initializer was given. */
577 static void
579 {
580 tree decl;
583 /* Use the non-static data member initializer if there was no
584 mem-initializer for this field. */
591 /* Effective C++ rule 12 requires that all data members be
592 initialized. */
596 member);
598 /* Get an lvalue for the data member. */
602 tf_warning_or_error);
608 {
614 member);
615 }
618 {
619 /* mem() means value-initialization. */
621 {
625 }
626 else
627 {
633 }
634 }
635 /* Deal with this here, as we will get confused if we try to call the
636 assignment op for an anonymous union. This can happen in a
637 synthesized copy constructor. */
639 {
641 {
644 }
645 }
648 /* Pre-digested NSDMI. */
651 /* { } mem-initializer. */
656 {
657 /* With references and list-initialization, we need to deal with
658 extending temporary lifetimes. 12.2p5: "A temporary bound to a
659 reference member in a constructor’s ctor-initializer (12.6.2)
660 persists until the constructor exits." */
665 tf_warning_or_error);
667 {
672 }
675 /* A FIELD_DECL doesn't really have a suitable lifetime, but
676 make_temporary_var_for_ref_to_temp will treat it as automatic and
677 set_up_extended_ref_temp wants to use the decl in a warning. */
687 }
690 {
692 {
694 {
697 else
701 }
705 {
709 }
710 else
712 }
713 else
714 {
721 {
722 /* TYPE_NEEDS_CONSTRUCTING can be set just because we have a
723 vtable; still give this diagnostic. */
728 }
730 tf_warning_or_error));
731 }
732 }
733 else
734 {
736 {
737 tree core_type;
738 /* member traversal: note it leaves init NULL */
740 {
745 }
747 {
752 }
762 }
764 /* There was an explicit member initialization. Do some work
765 in that case. */
767 tf_warning_or_error);
771 tf_warning_or_error));
772 }
775 {
776 tree expr;
781 tf_warning_or_error);
784 tf_warning_or_error);
789 }
790 }
792 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
793 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
795 static tree
797 {
798 tree fields;
800 /* Note whether or not T is a union. */
805 {
806 tree fieldtype;
808 /* Skip CONST_DECLs for enumeration constants and so forth. */
813 /* Keep track of whether or not any fields are unions. */
817 /* For an anonymous struct or union, we must recursively
818 consider the fields of the anonymous type. They can be
819 directly initialized from the constructor. */
821 {
822 /* Add this field itself. Synthesized copy constructors
823 initialize the entire aggregate. */
825 /* And now add the fields in the anonymous aggregate. */
827 }
828 /* Add this field. */
831 }
834 }
836 /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives
837 a FIELD_DECL or BINFO in T that needs initialization. The
838 TREE_VALUE gives the initializer, or list of initializer arguments.
840 Return a TREE_LIST containing all of the initializations required
841 for T, in the order in which they should be performed. The output
842 list has the same format as the input. */
844 static tree
846 {
847 tree init;
849 tree sorted_inits;
850 tree next_subobject;
855 /* Build up a list of initializations. The TREE_PURPOSE of entry
856 will be the subobject (a FIELD_DECL or BINFO) to initialize. The
857 TREE_VALUE will be the constructor arguments, or NULL if no
858 explicit initialization was provided. */
861 /* Process the virtual bases. */
866 /* Process the direct bases. */
872 /* Process the non-static data members. */
874 /* Reverse the entire list of initializations, so that they are in
875 the order that they will actually be performed. */
878 /* If the user presented the initializers in an order different from
879 that in which they will actually occur, we issue a warning. Keep
880 track of the next subobject which can be explicitly initialized
881 without issuing a warning. */
884 /* Go through the explicit initializers, filling in TREE_PURPOSE in
885 the SORTED_INITS. */
887 {
888 tree subobject;
889 tree subobject_init;
893 /* If the explicit initializers are in sorted order, then
894 SUBOBJECT will be NEXT_SUBOBJECT, or something following
895 it. */
897 subobject_init;
902 /* Issue a warning if the explicit initializer order does not
903 match that which will actually occur.
904 ??? Are all these on the correct lines? */
906 {
910 else
915 else
919 }
921 /* Look again, from the beginning of the list. */
923 {
927 }
929 /* It is invalid to initialize the same subobject more than
930 once. */
932 {
936 subobject);
937 else
940 subobject);
941 }
943 /* Record the initialization. */
946 }
948 /* [class.base.init]
950 If a ctor-initializer specifies more than one mem-initializer for
951 multiple members of the same union (including members of
952 anonymous unions), the ctor-initializer is ill-formed.
954 Here we also splice out uninitialized union members. */
956 {
960 {
961 tree field;
962 tree ctx;
968 /* Skip base classes. */
972 /* If this is an anonymous union with no explicit initializer,
973 splice it out. */
977 /* See if this field is a member of a union, or a member of a
978 structure contained in a union, etc. */
985 /* If this field is not a member of a union, skip it. */
989 /* If this union member has no explicit initializer and no NSDMI,
990 splice it out. */
993 else
996 /* It's only an error if we have two initializers for the same
997 union type. */
999 {
1002 }
1004 /* See if LAST_FIELD and the field initialized by INIT are
1005 members of the same union. If so, there's a problem,
1006 unless they're actually members of the same structure
1007 which is itself a member of a union. For example, given:
1009 union { struct { int i; int j; }; };
1011 initializing both `i' and `j' makes sense. */
1016 {
1017 /* A mem-initializer hides an NSDMI. */
1022 else
1023 {
1026 ctx);
1028 }
1029 }
1033 next:
1036 splice:
1039 }
1040 }
1043 }
1045 /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS
1046 is a TREE_LIST giving the explicit mem-initializer-list for the
1047 constructor. The TREE_PURPOSE of each entry is a subobject (a
1048 FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE
1049 is a TREE_LIST giving the arguments to the constructor or
1050 void_type_node for an empty list of arguments. */
1052 void
1054 {
1057 /* We will already have issued an error message about the fact that
1058 the type is incomplete. */
1065 {
1066 /* Delegating constructor. */
1070 }
1076 /* Sort the mem-initializers into the order in which the
1077 initializations should be performed. */
1082 /* Initialize base classes. */
1086 {
1090 /* We already have issued an error message. */
1095 {
1096 /* If these initializations are taking place in a copy constructor,
1097 the base class should probably be explicitly initialized if there
1098 is a user-defined constructor in the base class (other than the
1099 default constructor, which will be called anyway). */
1107 }
1109 /* Initialize the base. */
1112 else
1113 {
1114 tree base_addr;
1120 tf_warning_or_error),
1121 arguments,
1122 flags,
1123 tf_warning_or_error);
1125 }
1126 }
1129 /* Initialize the vptrs. */
1132 /* Initialize the data members. */
1134 {
1138 }
1139 }
1141 /* Returns the address of the vtable (i.e., the value that should be
1142 assigned to the vptr) for BINFO. */
1144 tree
1146 {
1148 tree vtbl;
1151 /* If this is a virtual primary base, then the vtable we want to store
1152 is that for the base this is being used as the primary base of. We
1153 can't simply skip the initialization, because we may be expanding the
1154 inits of a subobject constructor where the virtual base layout
1155 can be different. */
1159 /* Figure out what vtable BINFO's vtable is based on, and mark it as
1160 used. */
1164 /* Now compute the address to use when initializing the vptr. */
1170 }
1172 /* This code sets up the virtual function tables appropriate for
1173 the pointer DECL. It is a one-ply initialization.
1175 BINFO is the exact type that DECL is supposed to be. In
1176 multiple inheritance, this might mean "C's A" if C : A, B. */
1178 static void
1180 {
1182 tree vtt_index;
1184 /* Compute the initializer for vptr. */
1187 /* We may get this vptr from a VTT, if this is a subobject
1188 constructor or subobject destructor. */
1191 {
1192 tree vtbl2;
1193 tree vtt_parm;
1195 /* Compute the value to use, when there's a VTT. */
1201 /* The actual initializer is the VTT value only in the subobject
1202 constructor. In maybe_clone_body we'll substitute NULL for
1203 the vtt_parm in the case of the non-subobject constructor. */
1208 vtbl2,
1209 vtbl);
1210 }
1212 /* Compute the location of the vtpr. */
1214 tf_warning_or_error),
1218 /* Assign the vtable to the vptr. */
1221 tf_warning_or_error));
1222 }
1224 /* If an exception is thrown in a constructor, those base classes already
1225 constructed must be destroyed. This function creates the cleanup
1226 for BINFO, which has just been constructed. If FLAG is non-NULL,
1227 it is a DECL which is nonzero when this base needs to be
1228 destroyed. */
1230 static void
1232 {
1233 tree expr;
1238 /* Call the destructor. */
1240 base_dtor_identifier,
1241 NULL,
1242 binfo,
1244 tf_warning_or_error);
1256 }
1258 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its
1259 constructor. */
1261 static void
1263 {
1264 tree inner_if_stmt;
1265 tree exp;
1266 tree flag;
1268 /* If there are virtual base classes with destructors, we need to
1269 emit cleanups to destroy them if an exception is thrown during
1270 the construction process. These exception regions (i.e., the
1271 period during which the cleanups must occur) begin from the time
1272 the construction is complete to the end of the function. If we
1273 create a conditional block in which to initialize the
1274 base-classes, then the cleanup region for the virtual base begins
1275 inside a block, and ends outside of that block. This situation
1276 confuses the sjlj exception-handling code. Therefore, we do not
1277 create a single conditional block, but one for each
1278 initialization. (That way the cleanup regions always begin
1279 in the outer block.) We trust the back end to figure out
1280 that the FLAG will not change across initializations, and
1281 avoid doing multiple tests. */
1286 /* Compute the location of the virtual base. If we're
1287 constructing virtual bases, then we must be the most derived
1288 class. Therefore, we don't have to look up the virtual base;
1289 we already know where it is. */
1298 }
1300 /* Find the context in which this FIELD can be initialized. */
1302 static tree
1304 {
1307 /* Anonymous union members can be initialized in the first enclosing
1308 non-anonymous union context. */
1312 }
1314 /* Function to give error message if member initialization specification
1315 is erroneous. FIELD is the member we decided to initialize.
1316 TYPE is the type for which the initialization is being performed.
1317 FIELD must be a member of TYPE.
1319 MEMBER_NAME is the name of the member. */
1321 static int
1323 {
1327 {
1329 member_name);
1331 }
1333 {
1336 field);
1338 }
1340 {
1344 }
1346 {
1348 member_name);
1350 }
1353 }
1355 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it
1356 is a _TYPE node or TYPE_DECL which names a base for that type.
1357 Check the validity of NAME, and return either the base _TYPE, base
1358 binfo, or the FIELD_DECL of the member. If NAME is invalid, return
1359 NULL_TREE and issue a diagnostic.
1361 An old style unnamed direct single base construction is permitted,
1362 where NAME is NULL. */
1364 tree
1366 {
1367 tree basetype;
1368 tree field;
1374 {
1375 /* This is an obsolete unnamed base class initializer. The
1376 parser will already have warned about its use. */
1378 {
1381 current_class_type);
1384 basetype = BINFO_TYPE
1389 current_class_type);
1391 }
1392 }
1394 {
1397 }
1400 else
1404 {
1405 tree class_binfo;
1406 tree direct_binfo;
1407 tree virtual_binfo;
1418 /* Look for a direct base. */
1423 /* Look for a virtual base -- unless the direct base is itself
1424 virtual. */
1428 /* [class.base.init]
1430 If a mem-initializer-id is ambiguous because it designates
1431 both a direct non-virtual base class and an inherited virtual
1432 base class, the mem-initializer is ill-formed. */
1434 {
1436 basetype);
1438 }
1441 {
1445 else
1449 }
1452 }
1453 else
1454 {
1457 else
1462 }
1465 }
1467 /* This is like `expand_member_init', only it stores one aggregate
1468 value into another.
1470 INIT comes in two flavors: it is either a value which
1471 is to be stored in EXP, or it is a parameter list
1472 to go to a constructor, which will operate on EXP.
1473 If INIT is not a parameter list for a constructor, then set
1474 LOOKUP_ONLYCONVERTING.
1475 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1476 the initializer, if FLAGS is 0, then it is the (init) form.
1477 If `init' is a CONSTRUCTOR, then we emit a warning message,
1478 explaining that such initializations are invalid.
1480 If INIT resolves to a CALL_EXPR which happens to return
1481 something of the type we are looking for, then we know
1482 that we can safely use that call to perform the
1483 initialization.
1485 The virtual function table pointer cannot be set up here, because
1486 we do not really know its type.
1488 This never calls operator=().
1490 When initializing, nothing is CONST.
1492 A default copy constructor may have to be used to perform the
1493 initialization.
1495 A constructor or a conversion operator may have to be used to
1496 perform the initialization, but not both, as it would be ambiguous. */
1498 tree
1500 {
1501 tree stmt_expr;
1502 tree compound_stmt;
1523 {
1524 tree itype;
1526 /* An array may not be initialized use the parenthesized
1527 initialization form -- unless the initializer is "()". */
1529 {
1533 }
1534 /* Must arrange to initialize each element of EXP
1535 from elements of INIT. */
1545 complain);
1549 /* Restore the type of init unless it was used directly. */
1553 }
1557 /* Just know that we've seen something for this node. */
1571 }
1573 static void
1575 tsubst_flags_t complain)
1576 {
1578 tree ctor_name;
1580 /* It fails because there may not be a constructor which takes
1581 its own type as the first (or only parameter), but which does
1582 take other types via a conversion. So, if the thing initializing
1583 the expression is a unit element of type X, first try X(X&),
1584 followed by initialization by X. If neither of these work
1585 out, then look hard. */
1586 tree rval;
1589 /* If we have direct-initialization from an initializer list, pull
1590 it out of the TREE_LIST so the code below can see it. */
1593 {
1597 }
1601 /* A brace-enclosed initializer for an aggregate. In C++0x this can
1602 happen for direct-initialization, too. */
1605 /* A CONSTRUCTOR of the target's type is a previously digested
1606 initializer, whether that happened just above or in
1607 cp_parser_late_parsing_nsdmi.
1609 A TARGET_EXPR with TARGET_EXPR_DIRECT_INIT_P or TARGET_EXPR_LIST_INIT_P
1610 set represents the whole initialization, so we shouldn't build up
1611 another ctor call. */
1618 {
1619 /* Early initialization via a TARGET_EXPR only works for
1620 complete objects. */
1627 }
1631 {
1632 /* Base subobjects should only get direct-initialization. */
1636 /* Do nothing. We hit this in two cases: Reference initialization,
1637 where we aren't initializing a real variable, so we don't want
1638 to run a new constructor; and catching an exception, where we
1639 have already built up the constructor call so we could wrap it
1641 else
1646 /* We need to protect the initialization of a catch parm with a
1647 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
1648 around the TARGET_EXPR for the copy constructor. See
1649 initialize_handler_parm. */
1650 {
1654 }
1655 else
1660 }
1665 {
1669 }
1670 else
1675 {
1676 /* Delegating constructor. */
1677 tree complete;
1678 tree base;
1681 /* Unshare the arguments for the second call. */
1684 {
1687 }
1690 complain);
1696 complain);
1701 base,
1702 complete);
1703 }
1704 else
1705 {
1708 else
1711 complain);
1712 }
1718 {
1721 {
1725 }
1726 }
1728 /* FIXME put back convert_to_void? */
1731 }
1733 /* This function is responsible for initializing EXP with INIT
1734 (if any).
1736 BINFO is the binfo of the type for who we are performing the
1737 initialization. For example, if W is a virtual base class of A and B,
1738 and C : A, B.
1739 If we are initializing B, then W must contain B's W vtable, whereas
1740 were we initializing C, W must contain C's W vtable.
1742 TRUE_EXP is nonzero if it is the true expression being initialized.
1743 In this case, it may be EXP, or may just contain EXP. The reason we
1744 need this is because if EXP is a base element of TRUE_EXP, we
1745 don't necessarily know by looking at EXP where its virtual
1746 baseclass fields should really be pointing. But we do know
1747 from TRUE_EXP. In constructors, we don't know anything about
1748 the value being initialized.
1750 FLAGS is just passed to `build_new_method_call'. See that function
1751 for its description. */
1753 static void
1755 tsubst_flags_t complain)
1756 {
1762 /* Use a function returning the desired type to initialize EXP for us.
1763 If the function is a constructor, and its first argument is
1764 NULL_TREE, know that it was meant for us--just slide exp on
1765 in and expand the constructor. Constructors now come
1766 as TARGET_EXPRs. */
1770 {
1772 /* If store_init_value returns NULL_TREE, the INIT has been
1773 recorded as the DECL_INITIAL for EXP. That means there's
1774 nothing more we have to do. */
1780 }
1782 /* If an explicit -- but empty -- initializer list was present,
1783 that's value-initialization. */
1785 {
1786 /* If the type has data but no user-provided ctor, we need to zero
1787 out the object. */
1790 {
1793 /* Don't clobber already initialized virtual bases. */
1796 field_size);
1799 }
1801 /* If we don't need to mess with the constructor at all,
1802 then we're done. */
1806 /* Otherwise fall through and call the constructor. */
1808 }
1810 /* We know that expand_default_init can handle everything we want
1811 at this point. */
1813 }
1815 /* Report an error if TYPE is not a user-defined, class type. If
1816 OR_ELSE is nonzero, give an error message. */
1818 int
1820 {
1825 {
1829 }
1831 }
1833 tree
1835 {
1841 else
1843 }
1845 /* Build a reference to a member of an aggregate. This is not a C++
1846 `&', but really something which can have its address taken, and
1847 then act as a pointer to member, for example TYPE :: FIELD can have
1848 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if
1849 this expression is the operand of "&".
1851 @@ Prints out lousy diagnostics for operator <typename>
1852 @@ fields.
1854 @@ This function should be rewritten and placed in search.c. */
1856 tree
1858 tsubst_flags_t complain)
1859 {
1860 tree decl;
1863 /* class templates can come in as TEMPLATE_DECLs here. */
1876 /* Callers should call mark_used before this point. */
1881 {
1885 }
1887 /* Entities other than non-static members need no further
1888 processing. */
1895 {
1899 }
1901 /* Set up BASEBINFO for member lookup. */
1904 /* A lot of this logic is now handled in lookup_member. */
1906 {
1907 /* Go from the TREE_BASELINK to the member function info. */
1911 {
1912 /* Get rid of a potential OVERLOAD around it. */
1915 /* Unique functions are handled easily. */
1917 /* For non-static member of base class, we need a special rule
1918 for access checking [class.protected]:
1920 If the access is to form a pointer to member, the
1921 nested-name-specifier shall name the derived class
1922 (or any class derived from that class). */
1926 complain);
1927 else
1929 complain);
1934 }
1935 else
1937 }
1939 /* We need additional test besides the one in
1940 check_accessibility_of_qualified_id in case it is
1941 a pointer to non-static member. */
1943 complain);
1946 {
1947 /* If MEMBER is non-static, then the program has fallen afoul of
1948 [expr.prim]:
1950 An id-expression that denotes a nonstatic data member or
1951 nonstatic member function of a class can only be used:
1953 -- as part of a class member access (_expr.ref_) in which the
1954 object-expression refers to the member's class or a class
1955 derived from that class, or
1957 -- to form a pointer to member (_expr.unary.op_), or
1959 -- in the body of a nonstatic member function of that class or
1960 of a class derived from that class (_class.mfct.nonstatic_), or
1962 -- in a mem-initializer for a constructor for that class or for
1963 a class derived from that class (_class.base.init_). */
1965 {
1966 /* Build a representation of the qualified name suitable
1967 for use as the operand to "&" -- even though the "&" is
1968 not actually present. */
1970 /* In Microsoft mode, treat a non-static member function as if
1971 it were a pointer-to-member. */
1973 {
1976 }
1981 }
1983 {
1987 }
1989 }
1994 }
1996 /* If DECL is a scalar enumeration constant or variable with a
1997 constant initializer, return the initializer (or, its initializers,
1998 recursively); otherwise, return DECL. If INTEGRAL_P, the
1999 initializer is only returned if DECL is an integral
2000 constant-expression. If RETURN_AGGREGATE_CST_OK_P, it is ok to
2001 return an aggregate constant. */
2003 static tree
2005 {
2007 || (integral_p
2011 {
2012 tree init;
2013 /* If DECL is a static data member in a template
2014 specialization, we must instantiate it here. The
2015 initializer for the static data member is not processed
2016 until needed; we need it now. */
2021 {
2023 /* Treat the error as a constant to avoid cascading errors on
2024 excessively recursive template instantiation (c++/9335). */
2026 else
2028 }
2029 /* Initializers in templates are generally expanded during
2030 instantiation, so before that for const int i(2)
2031 INIT is a TREE_LIST with the actual initializer as
2032 TREE_VALUE. */
2034 && init
2042 /* Unless RETURN_AGGREGATE_CST_OK_P is true, do not
2043 return an aggregate constant (of which string
2044 literals are a special case), as we do not want
2045 to make inadvertent copies of such entities, and
2046 we must be sure that their addresses are the
2047 same everywhere. */
2052 }
2054 }
2056 /* If DECL is a CONST_DECL, or a constant VAR_DECL initialized by
2057 constant of integral or enumeration type, then return that value.
2058 These are those variables permitted in constant expressions by
2059 [5.19/1]. */
2061 tree
2063 {
2066 }
2068 /* A more relaxed version of integral_constant_value, used by the
2069 common C/C++ code. */
2071 tree
2073 {
2076 }
2078 /* A version of integral_constant_value used by the C++ front end for
2079 optimization purposes. */
2081 tree
2083 {
2086 }
2087 \f
2088 /* Common subroutines of build_new and build_vec_delete. */
2090 /* Call the global __builtin_delete to delete ADDR. */
2092 static tree
2094 {
2097 }
2098 \f
2099 /* Build and return a NEW_EXPR. If NELTS is non-NULL, TYPE[NELTS] is
2100 the type of the object being allocated; otherwise, it's just TYPE.
2101 INIT is the initializer, if any. USE_GLOBAL_NEW is true if the
2102 user explicitly wrote "::operator new". PLACEMENT, if non-NULL, is
2103 a vector of arguments to be provided as arguments to a placement
2104 new operator. This routine performs no semantic checks; it just
2105 creates and returns a NEW_EXPR. */
2107 static tree
2110 {
2111 tree init_list;
2112 tree new_expr;
2114 /* If INIT is NULL, the we want to store NULL_TREE in the NEW_EXPR.
2115 If INIT is not NULL, then we want to store VOID_ZERO_NODE. This
2116 permits us to distinguish the case of a missing initializer "new
2117 int" from an empty initializer "new int()". */
2122 else
2127 init_list);
2132 }
2134 /* Diagnose uninitialized const members or reference members of type
2135 TYPE. USING_NEW is used to disambiguate the diagnostic between a
2136 new expression without a new-initializer and a declaration. Returns
2137 the error count. */
2139 static int
2142 {
2143 tree field;
2150 {
2151 tree field_type;
2162 {
2165 {
2167 {
2171 else
2173 }
2174 else
2175 {
2180 else
2183 }
2186 }
2187 }
2190 {
2193 {
2195 {
2199 else
2201 }
2202 else
2203 {
2208 else
2211 }
2214 }
2215 }
2218 error_count
2221 }
2223 }
2225 int
2227 {
2229 }
2231 /* Call __cxa_bad_array_new_length to indicate that the size calculation
2232 overflowed. Pretend it returns sizetype so that it plays nicely in the
2233 COND_EXPR. */
2235 tree
2237 {
2241 NULL_TREE));
2244 }
2246 /* Call __cxa_bad_array_length to indicate that there were too many
2247 initializers. */
2249 tree
2251 {
2255 NULL_TREE));
2258 }
2260 /* Generate code for a new-expression, including calling the "operator
2261 new" function, initializing the object, and, if an exception occurs
2262 during construction, cleaning up. The arguments are as for
2263 build_raw_new_expr. This may change PLACEMENT and INIT. */
2265 static tree
2268 tsubst_flags_t complain)
2269 {
2271 /* True iff this is a call to "operator new[]" instead of just
2272 "operator new". */
2274 /* If ARRAY_P is true, the element type of the array. This is never
2275 an ARRAY_TYPE; for something like "new int[3][4]", the
2276 ELT_TYPE is "int". If ARRAY_P is false, this is the same type as
2277 TYPE. */
2278 tree elt_type;
2279 /* The type of the new-expression. (This type is always a pointer
2280 type.) */
2281 tree pointer_type;
2282 tree non_const_pointer_type;
2284 /* For arrays, a bounds checks on the NELTS parameter. */
2289 /* Size of the inner array elements. */
2290 offset_int inner_size;
2291 /* The address returned by the call to "operator new". This node is
2292 a VAR_DECL and is therefore reusable. */
2293 tree alloc_node;
2294 tree alloc_fn;
2298 /* If non-NULL, the number of extra bytes to allocate at the
2299 beginning of the storage allocated for an array-new expression in
2300 order to store the number of elements. */
2302 tree placement_first;
2304 /* True if the function we are calling is a placement allocation
2305 function. */
2307 /* True if the storage must be initialized, either by a constructor
2308 or due to an explicit new-initializer. */
2310 /* The address of the thing allocated, not including any cookie. In
2311 particular, if an array cookie is in use, DATA_ADDR is the
2312 address of the first array element. This node is a VAR_DECL, and
2313 is therefore reusable. */
2314 tree data_addr;
2319 {
2322 }
2324 {
2325 /* Transforms new (T[N]) to new T[N]. The former is a GNU
2326 extension for variable N. (This also covers new T where T is
2327 a VLA typedef.) */
2333 }
2335 /* If our base type is an array, then make sure we know how many elements
2336 it has. */
2340 {
2344 {
2349 {
2353 }
2355 }
2356 else
2357 {
2359 {
2363 }
2365 }
2369 inner_nelts_cst,
2370 complain);
2371 }
2374 {
2377 }
2382 /* Warn if we performed the (T[N]) to T[N] transformation and N is
2383 variable. */
2386 {
2388 {
2393 else
2398 }
2399 else
2401 }
2404 {
2408 }
2416 {
2418 /* A program that calls for default-initialization [...] of an
2419 entity of reference type is ill-formed. */
2423 /* A new-expression that creates an object of type T initializes
2424 that object as follows:
2425 - If the new-initializer is omitted:
2426 -- If T is a (possibly cv-qualified) non-POD class type
2427 (or array thereof), the object is default-initialized (8.5).
2428 [...]
2429 -- Otherwise, the object created has indeterminate
2430 value. If T is a const-qualified type, or a (possibly
2431 cv-qualified) POD class type (or array thereof)
2432 containing (directly or indirectly) a member of
2433 const-qualified type, the program is ill-formed; */
2443 }
2447 {
2451 }
2455 {
2456 /* Maximum available size in bytes. Half of the address space
2457 minus the cookie size. */
2458 offset_int max_size
2460 /* Maximum number of outer elements which can be allocated. */
2461 offset_int max_outer_nelts;
2462 tree max_outer_nelts_tree;
2468 /* Unconditionally subtract the cookie size. This decreases the
2469 maximum object size and is safe even if we choose not to use
2470 a cookie after all. */
2476 {
2480 }
2483 /* Only keep the top-most seven bits, to simplify encoding the
2484 constant in the instruction stream. */
2485 {
2489 shift);
2490 }
2495 outer_nelts,
2496 max_outer_nelts_tree);
2497 }
2501 /* If PLACEMENT is a single simple pointer type not passed by
2502 reference, prepare to capture it in a temporary variable. Do
2503 this now, since PLACEMENT will change in the calls below. */
2509 /* Allocate the object. */
2511 {
2512 tree class_addr;
2513 tree class_decl;
2517 {
2520 }
2529 {
2533 }
2535 {
2539 }
2544 }
2546 {
2549 }
2550 else
2551 {
2552 tree fnname;
2553 tree fns;
2559 && (array_p
2562 {
2563 /* Use a class-specific operator new. */
2564 /* If a cookie is required, add some extra space. */
2567 else
2568 {
2570 /* No size arithmetic necessary, so the size check is
2571 not needed. */
2574 }
2575 /* Perform the overflow check. */
2582 /* Create the argument list. */
2584 /* Do name-lookup to find the appropriate operator. */
2587 {
2591 }
2593 {
2595 {
2598 }
2600 }
2604 LOOKUP_NORMAL,
2606 complain);
2607 }
2608 else
2609 {
2610 /* Use a global operator new. */
2611 /* See if a cookie might be required. */
2613 {
2615 /* No size arithmetic necessary, so the size check is
2616 not needed. */
2619 }
2623 outer_nelts_check,
2625 }
2626 }
2633 /* If we found a simple case of PLACEMENT_EXPR above, then copy it
2634 into a temporary variable. */
2641 {
2646 {
2650 }
2651 }
2653 /* In the simple case, we can stop now. */
2658 /* Store the result of the allocation call in a variable so that we can
2659 use it more than once. */
2663 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */
2667 /* Now, check to see if this function is actually a placement
2668 allocation function. This can happen even when PLACEMENT is NULL
2669 because we might have something like:
2671 struct S { void* operator new (size_t, int i = 0); };
2673 A call to `new S' will get this allocation function, even though
2674 there is no explicit placement argument. If there is more than
2675 one argument, or there are variable arguments, then this is a
2676 placement allocation function. */
2677 placement_allocation_fn_p
2681 /* Preevaluate the placement args so that we don't reevaluate them for a
2682 placement delete. */
2684 {
2685 tree inits;
2689 alloc_expr);
2690 }
2692 /* unless an allocation function is declared with an empty excep-
2693 tion-specification (_except.spec_), throw(), it indicates failure to
2694 allocate storage by throwing a bad_alloc exception (clause _except_,
2695 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2696 cation function is declared with an empty exception-specification,
2697 throw(), it returns null to indicate failure to allocate storage and a
2698 non-null pointer otherwise.
2700 So check for a null exception spec on the op new we just called. */
2706 {
2707 tree cookie;
2708 tree cookie_ptr;
2709 tree size_ptr_type;
2711 /* Adjust so we're pointing to the start of the object. */
2714 /* Store the number of bytes allocated so that we can know how
2715 many elements to destroy later. We use the last sizeof
2716 (size_t) bytes to store the number of elements. */
2727 {
2728 /* Also store the element size. */
2739 }
2740 }
2741 else
2742 {
2745 }
2747 /* Now use a pointer to the type we've actually allocated. */
2749 /* But we want to operate on a non-const version to start with,
2750 since we'll be modifying the elements. */
2751 non_const_pointer_type = build_pointer_type
2755 /* Any further uses of alloc_node will want this type, too. */
2758 /* Now initialize the allocated object. Note that we preevaluate the
2759 initialization expression, apart from the actual constructor call or
2760 assignment--we do this because we want to delay the allocation as long
2761 as possible in order to minimize the size of the exception region for
2762 placement delete. */
2764 {
2769 {
2772 }
2775 {
2776 /* build_value_init doesn't work in templates, and we don't need
2777 the initializer anyway since we're going to throw it away and
2778 rebuild it at instantiation time, so just build up a single
2779 constructor call to get any appropriate diagnostics. */
2783 complete_ctor_identifier,
2785 LOOKUP_NORMAL,
2786 complain);
2788 }
2790 {
2794 {
2798 else
2799 {
2803 complain);
2804 else
2805 /* We'll check the length at runtime. */
2809 }
2810 }
2812 {
2816 else
2819 }
2820 init_expr
2824 integer_one_node,
2825 complain),
2826 vecinit,
2827 explicit_value_init_p,
2829 complain);
2831 /* An array initialization is stable because the initialization
2832 of each element is a full-expression, so the temporaries don't
2833 leak out. */
2835 }
2836 else
2837 {
2841 {
2843 complete_ctor_identifier,
2845 LOOKUP_NORMAL,
2846 complain);
2847 }
2849 {
2850 /* Something like `new int()'. */
2855 }
2856 else
2857 {
2858 tree ie;
2860 /* We are processing something like `new int (10)', which
2861 means allocate an int, and initialize it with 10. */
2864 complain);
2866 complain);
2867 }
2869 }
2874 /* If any part of the object initialization terminates by throwing an
2875 exception and a suitable deallocation function can be found, the
2876 deallocation function is called to free the memory in which the
2877 object was being constructed, after which the exception continues
2878 to propagate in the context of the new-expression. If no
2879 unambiguous matching deallocation function can be found,
2880 propagating the exception does not cause the object's memory to be
2881 freed. */
2883 {
2885 tree cleanup;
2887 /* The Standard is unclear here, but the right thing to do
2888 is to use the same method for finding deallocation
2889 functions that we use for finding allocation functions. */
2890 cleanup = (build_op_delete_call
2892 alloc_node,
2893 size,
2894 globally_qualified_p,
2896 alloc_fn,
2897 complain));
2902 /* This is much simpler if we were able to preevaluate all of
2903 the arguments to the constructor call. */
2904 {
2905 /* CLEANUP is compiler-generated, so no diagnostics. */
2909 /* Likewise, this try-catch is compiler-generated. */
2911 }
2912 else
2913 /* Ack! First we allocate the memory. Then we set our sentry
2914 variable to true, and expand a cleanup that deletes the
2915 memory if sentry is true. Then we run the constructor, and
2916 finally clear the sentry.
2918 We need to do this because we allocate the space first, so
2919 if there are any temporaries with cleanups in the
2920 constructor args and we weren't able to preevaluate them, we
2921 need this EH region to extend until end of full-expression
2922 to preserve nesting. */
2923 {
2931 /* CLEANUP is compiler-generated, so no diagnostics. */
2941 init_expr
2944 end));
2945 /* Likewise, this is compiler-generated. */
2947 }
2948 }
2949 }
2950 else
2953 /* Now build up the return value in reverse order. */
2963 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
2964 and return the call (which doesn't need to be adjusted). */
2966 else
2967 {
2969 {
2972 nullptr_node,
2973 complain);
2976 }
2978 /* Perform the allocation before anything else, so that ALLOC_NODE
2979 has been initialized before we start using it. */
2981 }
2986 /* A new-expression is never an lvalue. */
2990 }
2992 /* Generate a representation for a C++ "new" expression. *PLACEMENT
2993 is a vector of placement-new arguments (or NULL if none). If NELTS
2994 is NULL, TYPE is the type of the storage to be allocated. If NELTS
2995 is not NULL, then this is an array-new allocation; TYPE is the type
2996 of the elements in the array and NELTS is the number of elements in
2997 the array. *INIT, if non-NULL, is the initializer for the new
2998 object, or an empty vector to indicate an initializer of "()". If
2999 USE_GLOBAL_NEW is true, then the user explicitly wrote "::new"
3000 rather than just "new". This may change PLACEMENT and INIT. */
3002 tree
3005 {
3006 tree rval;
3015 /* Don't do auto deduction where it might affect mangling. */
3017 {
3020 {
3024 }
3025 }
3028 {
3035 use_global_new);
3046 }
3049 {
3051 {
3054 else
3056 }
3059 }
3061 /* ``A reference cannot be created by the new operator. A reference
3062 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
3063 returned by new.'' ARM 5.3.3 */
3065 {
3068 else
3071 }
3074 {
3078 }
3080 /* The type allocated must be complete. If the new-type-id was
3081 "T[N]" then we are just checking that "T" is complete here, but
3082 that is equivalent, since the value of "N" doesn't matter. */
3091 {
3097 }
3099 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
3104 }
3106 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
3108 tree
3110 {
3116 {
3119 {
3122 }
3124 }
3126 /* Mangle the class$ field. */
3127 {
3128 tree field;
3131 {
3135 }
3137 {
3140 }
3141 }
3145 {
3155 }
3157 }
3158 \f
3159 static tree
3161 special_function_kind auto_delete_vec,
3163 {
3164 tree virtual_size;
3166 tree size_exp;
3168 /* Temporary variables used by the loop. */
3171 /* This is the body of the loop that implements the deletion of a
3172 single element, and moves temp variables to next elements. */
3173 tree body;
3175 /* This is the LOOP_EXPR that governs the deletion of the elements. */
3178 /* This is the thing that governs what to do after the loop has run. */
3181 /* This is the BIND_EXPR which holds the outermost iterator of the
3182 loop. It is convenient to set this variable up and test it before
3183 executing any other code in the loop.
3184 This is also the containing expression returned by this function. */
3186 tree tmp;
3188 /* We should only have 1-D arrays here. */
3195 {
3198 "possible problem detected in invocation of "
3200 {
3203 "class-specific operator delete [] will be called, "
3205 }
3207 }
3214 {
3215 /* Make sure the destructor is callable. */
3217 {
3220 complain);
3223 }
3225 }
3227 /* The below is short by the cookie size. */
3232 tbase_init
3236 base),
3237 virtual_size),
3238 complain);
3256 complain);
3264 no_destructor:
3265 /* Delete the storage if appropriate. */
3267 {
3268 tree base_tbd;
3270 /* The below is short by the cookie size. */
3275 /* no header */
3277 else
3278 {
3279 tree cookie_size;
3283 MINUS_EXPR,
3286 cookie_size,
3287 complain);
3291 /* True size with header. */
3293 }
3300 complain);
3301 }
3305 ;
3308 else
3314 /* Outermost wrapper: If pointer is null, punt. */
3319 nullptr_node)),
3324 {
3327 }
3330 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
3334 }
3336 /* Create an unnamed variable of the indicated TYPE. */
3338 tree
3340 {
3341 tree decl;
3351 }
3353 /* Create a new temporary variable of the indicated TYPE, initialized
3354 to INIT.
3356 It is not entered into current_binding_level, because that breaks
3357 things when it comes time to do final cleanups (which take place
3358 "outside" the binding contour of the function). */
3360 tree
3362 {
3363 tree decl;
3369 tf_warning_or_error));
3372 }
3374 /* `build_vec_init' returns tree structure that performs
3375 initialization of a vector of aggregate types.
3377 BASE is a reference to the vector, of ARRAY_TYPE, or a pointer
3378 to the first element, of POINTER_TYPE.
3379 MAXINDEX is the maximum index of the array (one less than the
3380 number of elements). It is only used if BASE is a pointer or
3381 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
3383 INIT is the (possibly NULL) initializer.
3385 If EXPLICIT_VALUE_INIT_P is true, then INIT must be NULL. All
3386 elements in the array are value-initialized.
3388 FROM_ARRAY is 0 if we should init everything with INIT
3389 (i.e., every element initialized from INIT).
3390 FROM_ARRAY is 1 if we should index into INIT in parallel
3391 with initialization of DECL.
3392 FROM_ARRAY is 2 if we should index into INIT in parallel,
3393 but use assignment instead of initialization. */
3395 tree
3399 {
3400 tree rval;
3403 tree iterator;
3404 /* The type of BASE. */
3406 /* The type of an element in the array. */
3408 /* The element type reached after removing all outer array
3409 types. */
3410 tree inner_elt_type;
3411 /* The type of a pointer to an element in the array. */
3412 tree ptype;
3413 tree stmt_expr;
3414 tree compound_stmt;
3435 /* Look through the TARGET_EXPR around a compound literal. */
3441 /* If we have a braced-init-list, make sure that the array
3442 is big enough for all the initializers. */
3458 /* Don't do this if the CONSTRUCTOR might contain something
3459 that might throw and require us to clean up. */
3463 {
3464 /* Do non-default initialization of trivial arrays resulting from
3465 brace-enclosed initializers. In this case, digest_init and
3466 store_constructor will handle the semantics for us. */
3474 stmt_expr);
3476 }
3480 {
3486 }
3487 else
3490 /* The code we are generating looks like:
3491 ({
3492 T* t1 = (T*) base;
3493 T* rval = t1;
3494 ptrdiff_t iterator = maxindex;
3495 try {
3496 for (; iterator != -1; --iterator) {
3497 ... initialize *t1 ...
3498 ++t1;
3499 }
3500 } catch (...) {
3501 ... destroy elements that were constructed ...
3502 }
3503 rval;
3504 })
3506 We can omit the try and catch blocks if we know that the
3507 initialization will never throw an exception, or if the array
3508 elements do not have destructors. We can omit the loop completely if
3509 the elements of the array do not have constructors.
3511 We actually wrap the entire body of the above in a STMT_EXPR, for
3512 tidiness.
3514 When copying from array to another, when the array elements have
3515 only trivial copy constructors, we should use __builtin_memcpy
3516 rather than generating a loop. That way, we could take advantage
3517 of whatever cleverness the back end has for dealing with copies
3518 of blocks of memory. */
3527 /* If initializing one array from another, initialize element by
3528 element. We rely upon the below calls to do the argument
3529 checking. Evaluate the initializer before entering the try block. */
3531 {
3540 }
3542 /* Protect the entire array initialization so that we can destroy
3543 the partially constructed array if an exception is thrown.
3544 But don't do this if we're assigning. */
3547 {
3549 }
3551 /* Should we try to create a constant initializer? */
3559 /* If we're initializing a static array, we want to do static
3560 initialization of any elements with constant initializers even if
3561 some are non-constant. */
3567 /* Skip over the handling of non-empty init lists. */
3570 /* Maybe pull out constant value when from_array? */
3573 {
3574 /* Do non-default initialization of non-trivial arrays resulting from
3575 brace-enclosed initializers. */
3578 /* If the constructor already has the array type, it's been through
3579 digest_init, so we shouldn't try to do anything more. */
3584 {
3585 tree throw_call;
3588 else
3593 }
3599 {
3601 tree one_init;
3603 num_initialized_elts++;
3610 else
3616 {
3619 {
3623 else
3625 }
3626 else
3627 {
3629 {
3634 }
3636 }
3637 }
3646 else
3650 complain);
3653 else
3655 }
3657 /* Any elements without explicit initializers get T{}. */
3659 }
3661 {
3666 {
3670 }
3671 }
3673 /* Now, default-initialize any remaining elements. We don't need to
3674 do that if a) the type does not need constructing, or b) we've
3675 already initialized all the elements.
3677 We do need to keep going if we're copying an array. */
3682 && (num_initialized_elts
3684 {
3685 /* If the ITERATOR is equal to -1, then we don't have to loop;
3686 we've already initialized all the elements. */
3687 tree for_stmt;
3688 tree elt_init;
3689 tree to;
3697 complain);
3704 /* If the initializer is {}, then all elements are initialized from T{}.
3705 But for non-classes, that's the same as value-initialization. */
3707 {
3709 {
3713 else
3716 }
3717 else
3718 {
3721 }
3722 }
3725 {
3726 tree from;
3729 {
3733 }
3734 else
3739 complain);
3744 complain);
3745 else
3747 }
3749 {
3751 sorry
3755 explicit_value_init_p,
3757 }
3759 {
3763 }
3764 else
3765 {
3769 else
3770 {
3773 complain);
3775 }
3776 }
3782 {
3785 {
3787 /* Don't fill the CONSTRUCTOR with zeros. */
3791 }
3792 else
3793 {
3797 }
3800 {
3803 {
3806 }
3807 }
3808 }
3816 complain));
3819 complain));
3822 }
3824 /* Make sure to cleanup any partially constructed elements. */
3827 {
3828 tree e;
3831 complain);
3833 /* Flatten multi-dimensional array since build_vec_delete only
3834 expects one-dimensional array. */
3838 /* Avoid mixing signed and unsigned. */
3841 complain);
3850 }
3852 /* The value of the array initialization is the array itself, RVAL
3853 is a pointer to the first element. */
3864 {
3866 {
3869 }
3872 else
3874 }
3876 /* Now make the result have the correct type. */
3878 {
3883 }
3886 }
3888 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
3889 build_delete. */
3891 static tree
3893 tsubst_flags_t complain)
3894 {
3895 tree name;
3896 tree fn;
3898 {
3913 }
3918 flags,
3920 complain);
3921 }
3923 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
3924 ADDR is an expression which yields the store to be destroyed.
3925 AUTO_DELETE is the name of the destructor to call, i.e., either
3926 sfk_complete_destructor, sfk_base_destructor, or
3927 sfk_deleting_destructor.
3929 FLAGS is the logical disjunction of zero or more LOOKUP_
3930 flags. See cp-tree.h for more info. */
3932 tree
3935 {
3936 tree expr;
3943 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
3944 set to `error_mark_node' before it gets properly cleaned up. */
3952 {
3954 {
3958 }
3961 }
3964 {
3969 /* We don't want to warn about delete of void*, only other
3970 incomplete types. Deleting other incomplete types
3971 invokes undefined behavior, but it is not ill-formed, so
3972 compile to something that would even do The Right Thing
3973 (TM) should the type have a trivial dtor and no delete
3974 operator. */
3976 {
3979 {
3982 "possible problem detected in invocation of "
3984 {
3987 "neither the destructor nor the class-specific "
3988 "operator delete will be called, even if they are "
3990 }
3992 }
3996 {
3997 tree dtor;
4000 {
4003 "deleting object of abstract class type %qT"
4004 " which has non-virtual destructor"
4006 else
4008 "deleting object of polymorphic class type %qT"
4009 " which has non-virtual destructor"
4011 }
4012 }
4013 }
4015 /* Call the builtin operator delete. */
4020 /* Throw away const and volatile on target type of addr. */
4022 }
4023 else
4024 {
4025 /* Don't check PROTECT here; leave that decision to the
4026 destructor. If the destructor is accessible, call it,
4027 else report error. */
4035 }
4038 {
4039 /* Make sure the destructor is callable. */
4041 {
4043 complain),
4047 }
4054 use_global_delete,
4057 complain);
4058 }
4059 else
4060 {
4063 tree ifexp;
4068 /* For `::delete x', we must not use the deleting destructor
4069 since then we would not be sure to get the global `operator
4070 delete'. */
4072 {
4073 /* We will use ADDR multiple times so we must save it. */
4076 /* Delete the object. */
4078 /* Otherwise, treat this like a complete object destructor
4079 call. */
4081 }
4082 /* If the destructor is non-virtual, there is no deleting
4083 variant. Instead, we must explicitly call the appropriate
4084 `operator delete' here. */
4087 {
4088 /* We will use ADDR multiple times so we must save it. */
4090 /* Build the call. */
4092 addr,
4097 complain);
4098 /* Call the complete object destructor. */
4100 }
4103 {
4104 /* Make sure we have access to the member op delete, even though
4105 we'll actually be calling it from the destructor. */
4110 complain);
4111 }
4120 /* We need to calculate this before the dtor changes the vptr. */
4125 /* Explicit destructor call; don't check for null pointer. */
4127 else
4128 {
4129 /* Handle deleting a null pointer. */
4132 complain));
4135 }
4141 }
4142 }
4144 /* At the beginning of a destructor, push cleanups that will call the
4145 destructors for our base classes and members.
4147 Called from begin_destructor_body. */
4149 void
4151 {
4154 tree member;
4155 tree expr;
4158 /* Run destructors for all virtual baseclasses. */
4160 {
4161 tree cond = (condition_conversion
4163 current_in_charge_parm,
4164 integer_two_node)));
4166 /* The CLASSTYPE_VBASECLASSES vector is in initialization
4167 order, which is also the right order for pushing cleanups. */
4170 {
4172 {
4174 base_dtor_identifier,
4175 NULL,
4176 base_binfo,
4177 (LOOKUP_NORMAL
4179 tf_warning_or_error);
4181 {
4185 }
4186 }
4187 }
4188 }
4190 /* Take care of the remaining baseclasses. */
4193 {
4199 base_dtor_identifier,
4202 tf_warning_or_error);
4205 }
4207 /* Don't automatically destroy union members. */
4213 {
4222 {
4223 tree this_member = (build_class_member_access_expr
4227 tf_warning_or_error));
4229 sfk_complete_destructor,
4234 }
4235 }
4236 }
4238 /* Build a C++ vector delete expression.
4239 MAXINDEX is the number of elements to be deleted.
4240 ELT_SIZE is the nominal size of each element in the vector.
4241 BASE is the expression that should yield the store to be deleted.
4242 This function expands (or synthesizes) these calls itself.
4243 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
4245 This also calls delete for virtual baseclasses of elements of the vector.
4247 Update: MAXINDEX is no longer needed. The size can be extracted from the
4248 start of the vector for pointers, and from the type for arrays. We still
4249 use MAXINDEX for arrays because it happens to already have one of the
4250 values we'd have to extract. (We could use MAXINDEX with pointers to
4251 confirm the size, and trap if the numbers differ; not clear that it'd
4252 be worth bothering.) */
4254 tree
4256 special_function_kind auto_delete_vec,
4258 {
4259 tree type;
4260 tree rval;
4266 {
4267 /* Step back one from start of vector, and read dimension. */
4268 tree cookie_addr;
4273 {
4276 }
4281 cookie_addr);
4283 }
4285 {
4286 /* Get the total number of things in the array, maxindex is a
4287 bad name. */
4294 {
4297 }
4298 }
4299 else
4300 {
4304 }
4312 }