| blob | 8edf5193750440a758ed81f315378e5c1b471622 |
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. */
428 }
430 /* Build a constructor to contain the zero- initializations. */
432 }
433 }
435 {
438 /* Iterate over the array elements, building initializations. */
441 /* If we have an error_mark here, we should just return error mark
442 as we don't know the size of the array yet. */
444 {
447 type);
449 }
452 /* A zero-sized array, which is accepted as an extension, will
453 have an upper bound of -1. */
455 {
456 constructor_elt ce;
458 /* If this is a one element array, we just use a regular init. */
461 else
466 {
473 /* We shouldn't have gotten here for anything that would need
474 non-trivial initialization, and gimplify_init_ctor_preeval
475 would need to be fixed to allow it. */
478 }
479 }
481 /* Build a constructor to contain the initializations. */
483 }
485 {
489 }
491 {
495 }
498 }
500 /* Initialize current class with INIT, a TREE_LIST of
501 arguments for a target constructor. If TREE_LIST is void_type_node,
502 an empty initializer list was given. */
504 static void
506 {
512 tf_warning_or_error));
514 {
516 LOOKUP_NORMAL
517 |LOOKUP_NONVIRTUAL
523 }
524 }
526 /* Return the non-static data initializer for FIELD_DECL MEMBER. */
528 tree
530 {
531 tree init;
537 {
538 /* Do deferred instantiation of the NSDMI. */
539 init = (tsubst_copy_and_build
546 }
547 else
548 {
551 {
556 }
557 /* Strip redundant TARGET_EXPR so we don't need to remap it, and
558 so the aggregate init code below will see a CONSTRUCTOR. */
563 }
567 }
569 /* Initialize MEMBER, a FIELD_DECL, with INIT, a TREE_LIST of
570 arguments. If TREE_LIST is void_type_node, an empty initializer
571 list was given; if NULL_TREE no initializer was given. */
573 static void
575 {
576 tree decl;
579 /* Use the non-static data member initializer if there was no
580 mem-initializer for this field. */
587 /* Effective C++ rule 12 requires that all data members be
588 initialized. */
592 member);
594 /* Get an lvalue for the data member. */
598 tf_warning_or_error);
604 {
610 member);
611 }
614 {
615 /* mem() means value-initialization. */
617 {
621 }
622 else
623 {
629 }
630 }
631 /* Deal with this here, as we will get confused if we try to call the
632 assignment op for an anonymous union. This can happen in a
633 synthesized copy constructor. */
635 {
637 {
640 }
641 }
644 /* Pre-digested NSDMI. */
647 /* { } mem-initializer. */
652 {
653 /* With references and list-initialization, we need to deal with
654 extending temporary lifetimes. 12.2p5: "A temporary bound to a
655 reference member in a constructor’s ctor-initializer (12.6.2)
656 persists until the constructor exits." */
661 tf_warning_or_error);
663 {
668 }
671 /* A FIELD_DECL doesn't really have a suitable lifetime, but
672 make_temporary_var_for_ref_to_temp will treat it as automatic and
673 set_up_extended_ref_temp wants to use the decl in a warning. */
683 }
686 {
688 {
690 {
693 else
697 }
701 {
705 }
706 else
708 }
709 else
710 {
717 {
718 /* TYPE_NEEDS_CONSTRUCTING can be set just because we have a
719 vtable; still give this diagnostic. */
724 }
726 tf_warning_or_error));
727 }
728 }
729 else
730 {
732 {
733 tree core_type;
734 /* member traversal: note it leaves init NULL */
736 {
741 }
743 {
748 }
758 }
760 /* There was an explicit member initialization. Do some work
761 in that case. */
763 tf_warning_or_error);
767 tf_warning_or_error));
768 }
771 {
772 tree expr;
777 tf_warning_or_error);
780 tf_warning_or_error);
785 }
786 }
788 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
789 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
791 static tree
793 {
794 tree fields;
796 /* Note whether or not T is a union. */
801 {
802 tree fieldtype;
804 /* Skip CONST_DECLs for enumeration constants and so forth. */
809 /* Keep track of whether or not any fields are unions. */
813 /* For an anonymous struct or union, we must recursively
814 consider the fields of the anonymous type. They can be
815 directly initialized from the constructor. */
817 {
818 /* Add this field itself. Synthesized copy constructors
819 initialize the entire aggregate. */
821 /* And now add the fields in the anonymous aggregate. */
823 }
824 /* Add this field. */
827 }
830 }
832 /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives
833 a FIELD_DECL or BINFO in T that needs initialization. The
834 TREE_VALUE gives the initializer, or list of initializer arguments.
836 Return a TREE_LIST containing all of the initializations required
837 for T, in the order in which they should be performed. The output
838 list has the same format as the input. */
840 static tree
842 {
843 tree init;
845 tree sorted_inits;
846 tree next_subobject;
851 /* Build up a list of initializations. The TREE_PURPOSE of entry
852 will be the subobject (a FIELD_DECL or BINFO) to initialize. The
853 TREE_VALUE will be the constructor arguments, or NULL if no
854 explicit initialization was provided. */
857 /* Process the virtual bases. */
862 /* Process the direct bases. */
868 /* Process the non-static data members. */
870 /* Reverse the entire list of initializations, so that they are in
871 the order that they will actually be performed. */
874 /* If the user presented the initializers in an order different from
875 that in which they will actually occur, we issue a warning. Keep
876 track of the next subobject which can be explicitly initialized
877 without issuing a warning. */
880 /* Go through the explicit initializers, filling in TREE_PURPOSE in
881 the SORTED_INITS. */
883 {
884 tree subobject;
885 tree subobject_init;
889 /* If the explicit initializers are in sorted order, then
890 SUBOBJECT will be NEXT_SUBOBJECT, or something following
891 it. */
893 subobject_init;
898 /* Issue a warning if the explicit initializer order does not
899 match that which will actually occur.
900 ??? Are all these on the correct lines? */
902 {
906 else
911 else
915 }
917 /* Look again, from the beginning of the list. */
919 {
923 }
925 /* It is invalid to initialize the same subobject more than
926 once. */
928 {
932 subobject);
933 else
936 subobject);
937 }
939 /* Record the initialization. */
942 }
944 /* [class.base.init]
946 If a ctor-initializer specifies more than one mem-initializer for
947 multiple members of the same union (including members of
948 anonymous unions), the ctor-initializer is ill-formed.
950 Here we also splice out uninitialized union members. */
952 {
956 {
957 tree field;
958 tree ctx;
964 /* Skip base classes. */
968 /* If this is an anonymous union with no explicit initializer,
969 splice it out. */
973 /* See if this field is a member of a union, or a member of a
974 structure contained in a union, etc. */
981 /* If this field is not a member of a union, skip it. */
985 /* If this union member has no explicit initializer and no NSDMI,
986 splice it out. */
989 else
992 /* It's only an error if we have two initializers for the same
993 union type. */
995 {
998 }
1000 /* See if LAST_FIELD and the field initialized by INIT are
1001 members of the same union. If so, there's a problem,
1002 unless they're actually members of the same structure
1003 which is itself a member of a union. For example, given:
1005 union { struct { int i; int j; }; };
1007 initializing both `i' and `j' makes sense. */
1012 {
1013 /* A mem-initializer hides an NSDMI. */
1018 else
1019 {
1022 ctx);
1024 }
1025 }
1029 next:
1032 splice:
1035 }
1036 }
1039 }
1041 /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS
1042 is a TREE_LIST giving the explicit mem-initializer-list for the
1043 constructor. The TREE_PURPOSE of each entry is a subobject (a
1044 FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE
1045 is a TREE_LIST giving the arguments to the constructor or
1046 void_type_node for an empty list of arguments. */
1048 void
1050 {
1053 /* We will already have issued an error message about the fact that
1054 the type is incomplete. */
1061 {
1062 /* Delegating constructor. */
1066 }
1072 /* Sort the mem-initializers into the order in which the
1073 initializations should be performed. */
1078 /* Initialize base classes. */
1082 {
1086 /* We already have issued an error message. */
1091 {
1092 /* If these initializations are taking place in a copy constructor,
1093 the base class should probably be explicitly initialized if there
1094 is a user-defined constructor in the base class (other than the
1095 default constructor, which will be called anyway). */
1103 }
1105 /* Initialize the base. */
1108 else
1109 {
1110 tree base_addr;
1116 tf_warning_or_error),
1117 arguments,
1118 flags,
1119 tf_warning_or_error);
1121 }
1122 }
1125 /* Initialize the vptrs. */
1128 /* Initialize the data members. */
1130 {
1134 }
1135 }
1137 /* Returns the address of the vtable (i.e., the value that should be
1138 assigned to the vptr) for BINFO. */
1140 tree
1142 {
1144 tree vtbl;
1147 /* If this is a virtual primary base, then the vtable we want to store
1148 is that for the base this is being used as the primary base of. We
1149 can't simply skip the initialization, because we may be expanding the
1150 inits of a subobject constructor where the virtual base layout
1151 can be different. */
1155 /* Figure out what vtable BINFO's vtable is based on, and mark it as
1156 used. */
1160 /* Make sure the destructor gets synthesized so that it can be
1161 inlined after devirtualization even if the vtable is never
1162 emitted. */
1166 /* Now compute the address to use when initializing the vptr. */
1172 }
1174 /* This code sets up the virtual function tables appropriate for
1175 the pointer DECL. It is a one-ply initialization.
1177 BINFO is the exact type that DECL is supposed to be. In
1178 multiple inheritance, this might mean "C's A" if C : A, B. */
1180 static void
1182 {
1184 tree vtt_index;
1186 /* Compute the initializer for vptr. */
1189 /* We may get this vptr from a VTT, if this is a subobject
1190 constructor or subobject destructor. */
1193 {
1194 tree vtbl2;
1195 tree vtt_parm;
1197 /* Compute the value to use, when there's a VTT. */
1203 /* The actual initializer is the VTT value only in the subobject
1204 constructor. In maybe_clone_body we'll substitute NULL for
1205 the vtt_parm in the case of the non-subobject constructor. */
1210 vtbl2,
1211 vtbl);
1212 }
1214 /* Compute the location of the vtpr. */
1216 tf_warning_or_error),
1220 /* Assign the vtable to the vptr. */
1223 tf_warning_or_error));
1224 }
1226 /* If an exception is thrown in a constructor, those base classes already
1227 constructed must be destroyed. This function creates the cleanup
1228 for BINFO, which has just been constructed. If FLAG is non-NULL,
1229 it is a DECL which is nonzero when this base needs to be
1230 destroyed. */
1232 static void
1234 {
1235 tree expr;
1240 /* Call the destructor. */
1242 base_dtor_identifier,
1243 NULL,
1244 binfo,
1246 tf_warning_or_error);
1258 }
1260 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its
1261 constructor. */
1263 static void
1265 {
1266 tree inner_if_stmt;
1267 tree exp;
1268 tree flag;
1270 /* If there are virtual base classes with destructors, we need to
1271 emit cleanups to destroy them if an exception is thrown during
1272 the construction process. These exception regions (i.e., the
1273 period during which the cleanups must occur) begin from the time
1274 the construction is complete to the end of the function. If we
1275 create a conditional block in which to initialize the
1276 base-classes, then the cleanup region for the virtual base begins
1277 inside a block, and ends outside of that block. This situation
1278 confuses the sjlj exception-handling code. Therefore, we do not
1279 create a single conditional block, but one for each
1280 initialization. (That way the cleanup regions always begin
1281 in the outer block.) We trust the back end to figure out
1282 that the FLAG will not change across initializations, and
1283 avoid doing multiple tests. */
1288 /* Compute the location of the virtual base. If we're
1289 constructing virtual bases, then we must be the most derived
1290 class. Therefore, we don't have to look up the virtual base;
1291 we already know where it is. */
1300 }
1302 /* Find the context in which this FIELD can be initialized. */
1304 static tree
1306 {
1309 /* Anonymous union members can be initialized in the first enclosing
1310 non-anonymous union context. */
1314 }
1316 /* Function to give error message if member initialization specification
1317 is erroneous. FIELD is the member we decided to initialize.
1318 TYPE is the type for which the initialization is being performed.
1319 FIELD must be a member of TYPE.
1321 MEMBER_NAME is the name of the member. */
1323 static int
1325 {
1329 {
1331 member_name);
1333 }
1335 {
1338 field);
1340 }
1342 {
1346 }
1348 {
1350 member_name);
1352 }
1355 }
1357 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it
1358 is a _TYPE node or TYPE_DECL which names a base for that type.
1359 Check the validity of NAME, and return either the base _TYPE, base
1360 binfo, or the FIELD_DECL of the member. If NAME is invalid, return
1361 NULL_TREE and issue a diagnostic.
1363 An old style unnamed direct single base construction is permitted,
1364 where NAME is NULL. */
1366 tree
1368 {
1369 tree basetype;
1370 tree field;
1376 {
1377 /* This is an obsolete unnamed base class initializer. The
1378 parser will already have warned about its use. */
1380 {
1383 current_class_type);
1386 basetype = BINFO_TYPE
1391 current_class_type);
1393 }
1394 }
1396 {
1399 }
1402 else
1406 {
1407 tree class_binfo;
1408 tree direct_binfo;
1409 tree virtual_binfo;
1420 /* Look for a direct base. */
1425 /* Look for a virtual base -- unless the direct base is itself
1426 virtual. */
1430 /* [class.base.init]
1432 If a mem-initializer-id is ambiguous because it designates
1433 both a direct non-virtual base class and an inherited virtual
1434 base class, the mem-initializer is ill-formed. */
1436 {
1438 basetype);
1440 }
1443 {
1447 else
1451 }
1454 }
1455 else
1456 {
1459 else
1464 }
1467 }
1469 /* This is like `expand_member_init', only it stores one aggregate
1470 value into another.
1472 INIT comes in two flavors: it is either a value which
1473 is to be stored in EXP, or it is a parameter list
1474 to go to a constructor, which will operate on EXP.
1475 If INIT is not a parameter list for a constructor, then set
1476 LOOKUP_ONLYCONVERTING.
1477 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1478 the initializer, if FLAGS is 0, then it is the (init) form.
1479 If `init' is a CONSTRUCTOR, then we emit a warning message,
1480 explaining that such initializations are invalid.
1482 If INIT resolves to a CALL_EXPR which happens to return
1483 something of the type we are looking for, then we know
1484 that we can safely use that call to perform the
1485 initialization.
1487 The virtual function table pointer cannot be set up here, because
1488 we do not really know its type.
1490 This never calls operator=().
1492 When initializing, nothing is CONST.
1494 A default copy constructor may have to be used to perform the
1495 initialization.
1497 A constructor or a conversion operator may have to be used to
1498 perform the initialization, but not both, as it would be ambiguous. */
1500 tree
1502 {
1503 tree stmt_expr;
1504 tree compound_stmt;
1525 {
1526 tree itype;
1528 /* An array may not be initialized use the parenthesized
1529 initialization form -- unless the initializer is "()". */
1531 {
1535 }
1536 /* Must arrange to initialize each element of EXP
1537 from elements of INIT. */
1547 complain);
1551 /* Restore the type of init unless it was used directly. */
1555 }
1559 /* Just know that we've seen something for this node. */
1573 }
1575 static void
1577 tsubst_flags_t complain)
1578 {
1580 tree ctor_name;
1582 /* It fails because there may not be a constructor which takes
1583 its own type as the first (or only parameter), but which does
1584 take other types via a conversion. So, if the thing initializing
1585 the expression is a unit element of type X, first try X(X&),
1586 followed by initialization by X. If neither of these work
1587 out, then look hard. */
1588 tree rval;
1591 /* If we have direct-initialization from an initializer list, pull
1592 it out of the TREE_LIST so the code below can see it. */
1595 {
1599 }
1603 /* A brace-enclosed initializer for an aggregate. In C++0x this can
1604 happen for direct-initialization, too. */
1607 /* A CONSTRUCTOR of the target's type is a previously digested
1608 initializer, whether that happened just above or in
1609 cp_parser_late_parsing_nsdmi.
1611 A TARGET_EXPR with TARGET_EXPR_DIRECT_INIT_P or TARGET_EXPR_LIST_INIT_P
1612 set represents the whole initialization, so we shouldn't build up
1613 another ctor call. */
1620 {
1621 /* Early initialization via a TARGET_EXPR only works for
1622 complete objects. */
1629 }
1633 {
1634 /* Base subobjects should only get direct-initialization. */
1638 /* Do nothing. We hit this in two cases: Reference initialization,
1639 where we aren't initializing a real variable, so we don't want
1640 to run a new constructor; and catching an exception, where we
1641 have already built up the constructor call so we could wrap it
1643 else
1648 /* We need to protect the initialization of a catch parm with a
1649 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
1650 around the TARGET_EXPR for the copy constructor. See
1651 initialize_handler_parm. */
1652 {
1656 }
1657 else
1662 }
1667 {
1671 }
1672 else
1677 {
1678 /* Delegating constructor. */
1679 tree complete;
1680 tree base;
1683 /* Unshare the arguments for the second call. */
1686 {
1689 }
1692 complain);
1698 complain);
1703 base,
1704 complete);
1705 }
1706 else
1707 {
1710 else
1713 complain);
1714 }
1720 {
1723 {
1727 }
1728 }
1730 /* FIXME put back convert_to_void? */
1733 }
1735 /* This function is responsible for initializing EXP with INIT
1736 (if any).
1738 BINFO is the binfo of the type for who we are performing the
1739 initialization. For example, if W is a virtual base class of A and B,
1740 and C : A, B.
1741 If we are initializing B, then W must contain B's W vtable, whereas
1742 were we initializing C, W must contain C's W vtable.
1744 TRUE_EXP is nonzero if it is the true expression being initialized.
1745 In this case, it may be EXP, or may just contain EXP. The reason we
1746 need this is because if EXP is a base element of TRUE_EXP, we
1747 don't necessarily know by looking at EXP where its virtual
1748 baseclass fields should really be pointing. But we do know
1749 from TRUE_EXP. In constructors, we don't know anything about
1750 the value being initialized.
1752 FLAGS is just passed to `build_new_method_call'. See that function
1753 for its description. */
1755 static void
1757 tsubst_flags_t complain)
1758 {
1764 /* Use a function returning the desired type to initialize EXP for us.
1765 If the function is a constructor, and its first argument is
1766 NULL_TREE, know that it was meant for us--just slide exp on
1767 in and expand the constructor. Constructors now come
1768 as TARGET_EXPRs. */
1772 {
1774 /* If store_init_value returns NULL_TREE, the INIT has been
1775 recorded as the DECL_INITIAL for EXP. That means there's
1776 nothing more we have to do. */
1782 }
1784 /* If an explicit -- but empty -- initializer list was present,
1785 that's value-initialization. */
1787 {
1788 /* If the type has data but no user-provided ctor, we need to zero
1789 out the object. */
1792 {
1795 /* Don't clobber already initialized virtual bases. */
1798 field_size);
1801 }
1803 /* If we don't need to mess with the constructor at all,
1804 then we're done. */
1808 /* Otherwise fall through and call the constructor. */
1810 }
1812 /* We know that expand_default_init can handle everything we want
1813 at this point. */
1815 }
1817 /* Report an error if TYPE is not a user-defined, class type. If
1818 OR_ELSE is nonzero, give an error message. */
1820 int
1822 {
1827 {
1831 }
1833 }
1835 tree
1837 {
1843 else
1845 }
1847 /* Build a reference to a member of an aggregate. This is not a C++
1848 `&', but really something which can have its address taken, and
1849 then act as a pointer to member, for example TYPE :: FIELD can have
1850 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if
1851 this expression is the operand of "&".
1853 @@ Prints out lousy diagnostics for operator <typename>
1854 @@ fields.
1856 @@ This function should be rewritten and placed in search.c. */
1858 tree
1860 tsubst_flags_t complain)
1861 {
1862 tree decl;
1865 /* class templates can come in as TEMPLATE_DECLs here. */
1878 /* Callers should call mark_used before this point. */
1883 {
1887 }
1889 /* Entities other than non-static members need no further
1890 processing. */
1897 {
1901 }
1903 /* Set up BASEBINFO for member lookup. */
1906 /* A lot of this logic is now handled in lookup_member. */
1908 {
1909 /* Go from the TREE_BASELINK to the member function info. */
1913 {
1914 /* Get rid of a potential OVERLOAD around it. */
1917 /* Unique functions are handled easily. */
1919 /* For non-static member of base class, we need a special rule
1920 for access checking [class.protected]:
1922 If the access is to form a pointer to member, the
1923 nested-name-specifier shall name the derived class
1924 (or any class derived from that class). */
1928 complain);
1929 else
1931 complain);
1936 }
1937 else
1939 }
1941 /* We need additional test besides the one in
1942 check_accessibility_of_qualified_id in case it is
1943 a pointer to non-static member. */
1945 complain);
1948 {
1949 /* If MEMBER is non-static, then the program has fallen afoul of
1950 [expr.prim]:
1952 An id-expression that denotes a nonstatic data member or
1953 nonstatic member function of a class can only be used:
1955 -- as part of a class member access (_expr.ref_) in which the
1956 object-expression refers to the member's class or a class
1957 derived from that class, or
1959 -- to form a pointer to member (_expr.unary.op_), or
1961 -- in the body of a nonstatic member function of that class or
1962 of a class derived from that class (_class.mfct.nonstatic_), or
1964 -- in a mem-initializer for a constructor for that class or for
1965 a class derived from that class (_class.base.init_). */
1967 {
1968 /* Build a representation of the qualified name suitable
1969 for use as the operand to "&" -- even though the "&" is
1970 not actually present. */
1972 /* In Microsoft mode, treat a non-static member function as if
1973 it were a pointer-to-member. */
1975 {
1978 }
1983 }
1985 {
1989 }
1991 }
1996 }
1998 /* If DECL is a scalar enumeration constant or variable with a
1999 constant initializer, return the initializer (or, its initializers,
2000 recursively); otherwise, return DECL. If INTEGRAL_P, the
2001 initializer is only returned if DECL is an integral
2002 constant-expression. If RETURN_AGGREGATE_CST_OK_P, it is ok to
2003 return an aggregate constant. */
2005 static tree
2007 {
2009 || (integral_p
2013 {
2014 tree init;
2015 /* If DECL is a static data member in a template
2016 specialization, we must instantiate it here. The
2017 initializer for the static data member is not processed
2018 until needed; we need it now. */
2023 {
2025 /* Treat the error as a constant to avoid cascading errors on
2026 excessively recursive template instantiation (c++/9335). */
2028 else
2030 }
2031 /* Initializers in templates are generally expanded during
2032 instantiation, so before that for const int i(2)
2033 INIT is a TREE_LIST with the actual initializer as
2034 TREE_VALUE. */
2036 && init
2044 /* Unless RETURN_AGGREGATE_CST_OK_P is true, do not
2045 return an aggregate constant (of which string
2046 literals are a special case), as we do not want
2047 to make inadvertent copies of such entities, and
2048 we must be sure that their addresses are the
2049 same everywhere. */
2054 }
2056 }
2058 /* If DECL is a CONST_DECL, or a constant VAR_DECL initialized by
2059 constant of integral or enumeration type, then return that value.
2060 These are those variables permitted in constant expressions by
2061 [5.19/1]. */
2063 tree
2065 {
2068 }
2070 /* A more relaxed version of integral_constant_value, used by the
2071 common C/C++ code. */
2073 tree
2075 {
2078 }
2080 /* A version of integral_constant_value used by the C++ front end for
2081 optimization purposes. */
2083 tree
2085 {
2088 }
2089 \f
2090 /* Common subroutines of build_new and build_vec_delete. */
2092 /* Call the global __builtin_delete to delete ADDR. */
2094 static tree
2096 {
2099 }
2100 \f
2101 /* Build and return a NEW_EXPR. If NELTS is non-NULL, TYPE[NELTS] is
2102 the type of the object being allocated; otherwise, it's just TYPE.
2103 INIT is the initializer, if any. USE_GLOBAL_NEW is true if the
2104 user explicitly wrote "::operator new". PLACEMENT, if non-NULL, is
2105 a vector of arguments to be provided as arguments to a placement
2106 new operator. This routine performs no semantic checks; it just
2107 creates and returns a NEW_EXPR. */
2109 static tree
2112 {
2113 tree init_list;
2114 tree new_expr;
2116 /* If INIT is NULL, the we want to store NULL_TREE in the NEW_EXPR.
2117 If INIT is not NULL, then we want to store VOID_ZERO_NODE. This
2118 permits us to distinguish the case of a missing initializer "new
2119 int" from an empty initializer "new int()". */
2124 else
2129 init_list);
2134 }
2136 /* Diagnose uninitialized const members or reference members of type
2137 TYPE. USING_NEW is used to disambiguate the diagnostic between a
2138 new expression without a new-initializer and a declaration. Returns
2139 the error count. */
2141 static int
2144 {
2145 tree field;
2152 {
2153 tree field_type;
2164 {
2167 {
2169 {
2173 else
2175 }
2176 else
2177 {
2182 else
2185 }
2188 }
2189 }
2192 {
2195 {
2197 {
2201 else
2203 }
2204 else
2205 {
2210 else
2213 }
2216 }
2217 }
2220 error_count
2223 }
2225 }
2227 int
2229 {
2231 }
2233 /* Call __cxa_bad_array_new_length to indicate that the size calculation
2234 overflowed. Pretend it returns sizetype so that it plays nicely in the
2235 COND_EXPR. */
2237 tree
2239 {
2243 NULL_TREE));
2246 }
2248 /* Call __cxa_bad_array_length to indicate that there were too many
2249 initializers. */
2251 tree
2253 {
2257 NULL_TREE));
2260 }
2262 /* Generate code for a new-expression, including calling the "operator
2263 new" function, initializing the object, and, if an exception occurs
2264 during construction, cleaning up. The arguments are as for
2265 build_raw_new_expr. This may change PLACEMENT and INIT. */
2267 static tree
2270 tsubst_flags_t complain)
2271 {
2273 /* True iff this is a call to "operator new[]" instead of just
2274 "operator new". */
2276 /* If ARRAY_P is true, the element type of the array. This is never
2277 an ARRAY_TYPE; for something like "new int[3][4]", the
2278 ELT_TYPE is "int". If ARRAY_P is false, this is the same type as
2279 TYPE. */
2280 tree elt_type;
2281 /* The type of the new-expression. (This type is always a pointer
2282 type.) */
2283 tree pointer_type;
2284 tree non_const_pointer_type;
2286 /* For arrays, a bounds checks on the NELTS parameter. */
2291 /* Size of the inner array elements. */
2292 offset_int inner_size;
2293 /* The address returned by the call to "operator new". This node is
2294 a VAR_DECL and is therefore reusable. */
2295 tree alloc_node;
2296 tree alloc_fn;
2300 /* If non-NULL, the number of extra bytes to allocate at the
2301 beginning of the storage allocated for an array-new expression in
2302 order to store the number of elements. */
2304 tree placement_first;
2306 /* True if the function we are calling is a placement allocation
2307 function. */
2309 /* True if the storage must be initialized, either by a constructor
2310 or due to an explicit new-initializer. */
2312 /* The address of the thing allocated, not including any cookie. In
2313 particular, if an array cookie is in use, DATA_ADDR is the
2314 address of the first array element. This node is a VAR_DECL, and
2315 is therefore reusable. */
2316 tree data_addr;
2321 {
2324 }
2326 {
2327 /* Transforms new (T[N]) to new T[N]. The former is a GNU
2328 extension for variable N. (This also covers new T where T is
2329 a VLA typedef.) */
2335 }
2337 /* If our base type is an array, then make sure we know how many elements
2338 it has. */
2342 {
2346 {
2351 {
2355 }
2357 }
2358 else
2359 {
2361 {
2365 }
2367 }
2371 inner_nelts_cst,
2372 complain);
2373 }
2376 {
2379 }
2384 /* Warn if we performed the (T[N]) to T[N] transformation and N is
2385 variable. */
2388 {
2390 {
2395 else
2400 }
2401 else
2403 }
2406 {
2410 }
2418 {
2420 /* A program that calls for default-initialization [...] of an
2421 entity of reference type is ill-formed. */
2425 /* A new-expression that creates an object of type T initializes
2426 that object as follows:
2427 - If the new-initializer is omitted:
2428 -- If T is a (possibly cv-qualified) non-POD class type
2429 (or array thereof), the object is default-initialized (8.5).
2430 [...]
2431 -- Otherwise, the object created has indeterminate
2432 value. If T is a const-qualified type, or a (possibly
2433 cv-qualified) POD class type (or array thereof)
2434 containing (directly or indirectly) a member of
2435 const-qualified type, the program is ill-formed; */
2445 }
2449 {
2453 }
2457 {
2458 /* Maximum available size in bytes. Half of the address space
2459 minus the cookie size. */
2460 offset_int max_size
2462 /* Maximum number of outer elements which can be allocated. */
2463 offset_int max_outer_nelts;
2464 tree max_outer_nelts_tree;
2470 /* Unconditionally subtract the cookie size. This decreases the
2471 maximum object size and is safe even if we choose not to use
2472 a cookie after all. */
2478 {
2482 }
2485 /* Only keep the top-most seven bits, to simplify encoding the
2486 constant in the instruction stream. */
2487 {
2491 shift);
2492 }
2497 outer_nelts,
2498 max_outer_nelts_tree);
2499 }
2503 /* If PLACEMENT is a single simple pointer type not passed by
2504 reference, prepare to capture it in a temporary variable. Do
2505 this now, since PLACEMENT will change in the calls below. */
2511 /* Allocate the object. */
2513 {
2514 tree class_addr;
2515 tree class_decl;
2519 {
2522 }
2531 {
2535 }
2537 {
2541 }
2546 }
2548 {
2551 }
2552 else
2553 {
2554 tree fnname;
2555 tree fns;
2561 && (array_p
2564 {
2565 /* Use a class-specific operator new. */
2566 /* If a cookie is required, add some extra space. */
2569 else
2570 {
2572 /* No size arithmetic necessary, so the size check is
2573 not needed. */
2576 }
2577 /* Perform the overflow check. */
2584 /* Create the argument list. */
2586 /* Do name-lookup to find the appropriate operator. */
2589 {
2593 }
2595 {
2597 {
2600 }
2602 }
2606 LOOKUP_NORMAL,
2608 complain);
2609 }
2610 else
2611 {
2612 /* Use a global operator new. */
2613 /* See if a cookie might be required. */
2615 {
2617 /* No size arithmetic necessary, so the size check is
2618 not needed. */
2621 }
2625 outer_nelts_check,
2627 }
2628 }
2635 /* If we found a simple case of PLACEMENT_EXPR above, then copy it
2636 into a temporary variable. */
2643 {
2648 {
2652 }
2653 }
2655 /* In the simple case, we can stop now. */
2660 /* Store the result of the allocation call in a variable so that we can
2661 use it more than once. */
2665 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */
2669 /* Now, check to see if this function is actually a placement
2670 allocation function. This can happen even when PLACEMENT is NULL
2671 because we might have something like:
2673 struct S { void* operator new (size_t, int i = 0); };
2675 A call to `new S' will get this allocation function, even though
2676 there is no explicit placement argument. If there is more than
2677 one argument, or there are variable arguments, then this is a
2678 placement allocation function. */
2679 placement_allocation_fn_p
2683 /* Preevaluate the placement args so that we don't reevaluate them for a
2684 placement delete. */
2686 {
2687 tree inits;
2691 alloc_expr);
2692 }
2694 /* unless an allocation function is declared with an empty excep-
2695 tion-specification (_except.spec_), throw(), it indicates failure to
2696 allocate storage by throwing a bad_alloc exception (clause _except_,
2697 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2698 cation function is declared with an empty exception-specification,
2699 throw(), it returns null to indicate failure to allocate storage and a
2700 non-null pointer otherwise.
2702 So check for a null exception spec on the op new we just called. */
2708 {
2709 tree cookie;
2710 tree cookie_ptr;
2711 tree size_ptr_type;
2713 /* Adjust so we're pointing to the start of the object. */
2716 /* Store the number of bytes allocated so that we can know how
2717 many elements to destroy later. We use the last sizeof
2718 (size_t) bytes to store the number of elements. */
2729 {
2730 /* Also store the element size. */
2741 }
2742 }
2743 else
2744 {
2747 }
2749 /* Now use a pointer to the type we've actually allocated. */
2751 /* But we want to operate on a non-const version to start with,
2752 since we'll be modifying the elements. */
2753 non_const_pointer_type = build_pointer_type
2757 /* Any further uses of alloc_node will want this type, too. */
2760 /* Now initialize the allocated object. Note that we preevaluate the
2761 initialization expression, apart from the actual constructor call or
2762 assignment--we do this because we want to delay the allocation as long
2763 as possible in order to minimize the size of the exception region for
2764 placement delete. */
2766 {
2771 {
2774 }
2777 {
2778 /* build_value_init doesn't work in templates, and we don't need
2779 the initializer anyway since we're going to throw it away and
2780 rebuild it at instantiation time, so just build up a single
2781 constructor call to get any appropriate diagnostics. */
2785 complete_ctor_identifier,
2787 LOOKUP_NORMAL,
2788 complain);
2790 }
2792 {
2796 {
2800 else
2801 {
2805 complain);
2806 else
2807 /* We'll check the length at runtime. */
2811 }
2812 }
2814 {
2818 else
2821 }
2822 init_expr
2826 integer_one_node,
2827 complain),
2828 vecinit,
2829 explicit_value_init_p,
2831 complain);
2833 /* An array initialization is stable because the initialization
2834 of each element is a full-expression, so the temporaries don't
2835 leak out. */
2837 }
2838 else
2839 {
2843 {
2845 complete_ctor_identifier,
2847 LOOKUP_NORMAL,
2848 complain);
2849 }
2851 {
2852 /* Something like `new int()'. */
2857 }
2858 else
2859 {
2860 tree ie;
2862 /* We are processing something like `new int (10)', which
2863 means allocate an int, and initialize it with 10. */
2866 complain);
2868 complain);
2869 }
2871 }
2876 /* If any part of the object initialization terminates by throwing an
2877 exception and a suitable deallocation function can be found, the
2878 deallocation function is called to free the memory in which the
2879 object was being constructed, after which the exception continues
2880 to propagate in the context of the new-expression. If no
2881 unambiguous matching deallocation function can be found,
2882 propagating the exception does not cause the object's memory to be
2883 freed. */
2885 {
2887 tree cleanup;
2889 /* The Standard is unclear here, but the right thing to do
2890 is to use the same method for finding deallocation
2891 functions that we use for finding allocation functions. */
2892 cleanup = (build_op_delete_call
2894 alloc_node,
2895 size,
2896 globally_qualified_p,
2898 alloc_fn,
2899 complain));
2904 /* This is much simpler if we were able to preevaluate all of
2905 the arguments to the constructor call. */
2906 {
2907 /* CLEANUP is compiler-generated, so no diagnostics. */
2911 /* Likewise, this try-catch is compiler-generated. */
2913 }
2914 else
2915 /* Ack! First we allocate the memory. Then we set our sentry
2916 variable to true, and expand a cleanup that deletes the
2917 memory if sentry is true. Then we run the constructor, and
2918 finally clear the sentry.
2920 We need to do this because we allocate the space first, so
2921 if there are any temporaries with cleanups in the
2922 constructor args and we weren't able to preevaluate them, we
2923 need this EH region to extend until end of full-expression
2924 to preserve nesting. */
2925 {
2933 /* CLEANUP is compiler-generated, so no diagnostics. */
2943 init_expr
2946 end));
2947 /* Likewise, this is compiler-generated. */
2949 }
2950 }
2951 }
2952 else
2955 /* Now build up the return value in reverse order. */
2965 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
2966 and return the call (which doesn't need to be adjusted). */
2968 else
2969 {
2971 {
2974 nullptr_node,
2975 complain);
2978 }
2980 /* Perform the allocation before anything else, so that ALLOC_NODE
2981 has been initialized before we start using it. */
2983 }
2988 /* A new-expression is never an lvalue. */
2992 }
2994 /* Generate a representation for a C++ "new" expression. *PLACEMENT
2995 is a vector of placement-new arguments (or NULL if none). If NELTS
2996 is NULL, TYPE is the type of the storage to be allocated. If NELTS
2997 is not NULL, then this is an array-new allocation; TYPE is the type
2998 of the elements in the array and NELTS is the number of elements in
2999 the array. *INIT, if non-NULL, is the initializer for the new
3000 object, or an empty vector to indicate an initializer of "()". If
3001 USE_GLOBAL_NEW is true, then the user explicitly wrote "::new"
3002 rather than just "new". This may change PLACEMENT and INIT. */
3004 tree
3007 {
3008 tree rval;
3017 /* Don't do auto deduction where it might affect mangling. */
3019 {
3022 {
3026 }
3027 }
3030 {
3037 use_global_new);
3048 }
3051 {
3053 {
3056 else
3058 }
3061 }
3063 /* ``A reference cannot be created by the new operator. A reference
3064 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
3065 returned by new.'' ARM 5.3.3 */
3067 {
3070 else
3073 }
3076 {
3080 }
3082 /* The type allocated must be complete. If the new-type-id was
3083 "T[N]" then we are just checking that "T" is complete here, but
3084 that is equivalent, since the value of "N" doesn't matter. */
3093 {
3099 }
3101 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
3106 }
3108 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
3110 tree
3112 {
3118 {
3121 {
3124 }
3126 }
3128 /* Mangle the class$ field. */
3129 {
3130 tree field;
3133 {
3137 }
3139 {
3142 }
3143 }
3147 {
3157 }
3159 }
3160 \f
3161 static tree
3163 special_function_kind auto_delete_vec,
3165 {
3166 tree virtual_size;
3168 tree size_exp;
3170 /* Temporary variables used by the loop. */
3173 /* This is the body of the loop that implements the deletion of a
3174 single element, and moves temp variables to next elements. */
3175 tree body;
3177 /* This is the LOOP_EXPR that governs the deletion of the elements. */
3180 /* This is the thing that governs what to do after the loop has run. */
3183 /* This is the BIND_EXPR which holds the outermost iterator of the
3184 loop. It is convenient to set this variable up and test it before
3185 executing any other code in the loop.
3186 This is also the containing expression returned by this function. */
3188 tree tmp;
3190 /* We should only have 1-D arrays here. */
3197 {
3200 "possible problem detected in invocation of "
3202 {
3205 "class-specific operator delete [] will be called, "
3207 }
3209 }
3216 {
3217 /* Make sure the destructor is callable. */
3219 {
3222 complain);
3225 }
3227 }
3229 /* The below is short by the cookie size. */
3234 tbase_init
3238 base),
3239 virtual_size),
3240 complain);
3258 complain);
3266 no_destructor:
3267 /* Delete the storage if appropriate. */
3269 {
3270 tree base_tbd;
3272 /* The below is short by the cookie size. */
3277 /* no header */
3279 else
3280 {
3281 tree cookie_size;
3285 MINUS_EXPR,
3288 cookie_size,
3289 complain);
3293 /* True size with header. */
3295 }
3302 complain);
3303 }
3307 ;
3310 else
3316 /* Outermost wrapper: If pointer is null, punt. */
3321 nullptr_node)),
3326 {
3329 }
3332 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
3336 }
3338 /* Create an unnamed variable of the indicated TYPE. */
3340 tree
3342 {
3343 tree decl;
3353 }
3355 /* Create a new temporary variable of the indicated TYPE, initialized
3356 to INIT.
3358 It is not entered into current_binding_level, because that breaks
3359 things when it comes time to do final cleanups (which take place
3360 "outside" the binding contour of the function). */
3362 tree
3364 {
3365 tree decl;
3371 tf_warning_or_error));
3374 }
3376 /* `build_vec_init' returns tree structure that performs
3377 initialization of a vector of aggregate types.
3379 BASE is a reference to the vector, of ARRAY_TYPE, or a pointer
3380 to the first element, of POINTER_TYPE.
3381 MAXINDEX is the maximum index of the array (one less than the
3382 number of elements). It is only used if BASE is a pointer or
3383 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
3385 INIT is the (possibly NULL) initializer.
3387 If EXPLICIT_VALUE_INIT_P is true, then INIT must be NULL. All
3388 elements in the array are value-initialized.
3390 FROM_ARRAY is 0 if we should init everything with INIT
3391 (i.e., every element initialized from INIT).
3392 FROM_ARRAY is 1 if we should index into INIT in parallel
3393 with initialization of DECL.
3394 FROM_ARRAY is 2 if we should index into INIT in parallel,
3395 but use assignment instead of initialization. */
3397 tree
3401 {
3402 tree rval;
3405 tree iterator;
3406 /* The type of BASE. */
3408 /* The type of an element in the array. */
3410 /* The element type reached after removing all outer array
3411 types. */
3412 tree inner_elt_type;
3413 /* The type of a pointer to an element in the array. */
3414 tree ptype;
3415 tree stmt_expr;
3416 tree compound_stmt;
3438 /* Look through the TARGET_EXPR around a compound literal. */
3444 /* If we have a braced-init-list, make sure that the array
3445 is big enough for all the initializers. */
3461 /* Don't do this if the CONSTRUCTOR might contain something
3462 that might throw and require us to clean up. */
3466 {
3467 /* Do non-default initialization of trivial arrays resulting from
3468 brace-enclosed initializers. In this case, digest_init and
3469 store_constructor will handle the semantics for us. */
3477 stmt_expr);
3479 }
3483 {
3489 }
3490 else
3493 /* The code we are generating looks like:
3494 ({
3495 T* t1 = (T*) base;
3496 T* rval = t1;
3497 ptrdiff_t iterator = maxindex;
3498 try {
3499 for (; iterator != -1; --iterator) {
3500 ... initialize *t1 ...
3501 ++t1;
3502 }
3503 } catch (...) {
3504 ... destroy elements that were constructed ...
3505 }
3506 rval;
3507 })
3509 We can omit the try and catch blocks if we know that the
3510 initialization will never throw an exception, or if the array
3511 elements do not have destructors. We can omit the loop completely if
3512 the elements of the array do not have constructors.
3514 We actually wrap the entire body of the above in a STMT_EXPR, for
3515 tidiness.
3517 When copying from array to another, when the array elements have
3518 only trivial copy constructors, we should use __builtin_memcpy
3519 rather than generating a loop. That way, we could take advantage
3520 of whatever cleverness the back end has for dealing with copies
3521 of blocks of memory. */
3530 /* If initializing one array from another, initialize element by
3531 element. We rely upon the below calls to do the argument
3532 checking. Evaluate the initializer before entering the try block. */
3534 {
3543 }
3545 /* Protect the entire array initialization so that we can destroy
3546 the partially constructed array if an exception is thrown.
3547 But don't do this if we're assigning. */
3550 {
3552 }
3554 /* If the initializer is {}, then all elements are initialized from {}.
3555 But for non-classes, that's the same as value-initialization. */
3558 {
3561 else
3562 {
3565 }
3566 }
3568 /* Maybe pull out constant value when from_array? */
3571 {
3572 /* Do non-default initialization of non-trivial arrays resulting from
3573 brace-enclosed initializers. */
3576 /* Should we try to create a constant initializer? */
3581 /* If the constructor already has the array type, it's been through
3582 digest_init, so we shouldn't try to do anything more. */
3586 /* If we're initializing a static array, we want to do static
3587 initialization of any elements with constant initializers even if
3588 some are non-constant. */
3594 {
3595 tree throw_call;
3598 else
3603 }
3607 else
3611 {
3613 tree one_init;
3615 num_initialized_elts++;
3622 else
3628 {
3637 {
3641 else
3644 }
3645 else
3646 {
3648 {
3653 }
3655 }
3656 }
3665 else
3669 complain);
3672 else
3674 }
3677 {
3682 else
3684 }
3686 /* Any elements without explicit initializers get {}. */
3689 else
3690 {
3693 }
3694 }
3696 {
3701 {
3705 }
3706 }
3708 /* Now, default-initialize any remaining elements. We don't need to
3709 do that if a) the type does not need constructing, or b) we've
3710 already initialized all the elements.
3712 We do need to keep going if we're copying an array. */
3717 && (num_initialized_elts
3719 {
3720 /* If the ITERATOR is equal to -1, then we don't have to loop;
3721 we've already initialized all the elements. */
3722 tree for_stmt;
3723 tree elt_init;
3724 tree to;
3732 complain);
3740 {
3741 tree from;
3744 {
3748 }
3749 else
3754 complain);
3759 complain);
3760 else
3762 }
3764 {
3766 sorry
3770 explicit_value_init_p,
3772 }
3774 {
3778 }
3779 else
3780 {
3784 else
3785 {
3788 complain);
3790 }
3791 }
3801 complain));
3804 complain));
3807 }
3809 /* Make sure to cleanup any partially constructed elements. */
3812 {
3813 tree e;
3816 complain);
3818 /* Flatten multi-dimensional array since build_vec_delete only
3819 expects one-dimensional array. */
3823 /* Avoid mixing signed and unsigned. */
3826 complain);
3835 }
3837 /* The value of the array initialization is the array itself, RVAL
3838 is a pointer to the first element. */
3843 /* Now make the result have the correct type. */
3845 {
3850 }
3859 }
3861 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
3862 build_delete. */
3864 static tree
3866 tsubst_flags_t complain)
3867 {
3868 tree name;
3869 tree fn;
3871 {
3886 }
3891 flags,
3893 complain);
3894 }
3896 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
3897 ADDR is an expression which yields the store to be destroyed.
3898 AUTO_DELETE is the name of the destructor to call, i.e., either
3899 sfk_complete_destructor, sfk_base_destructor, or
3900 sfk_deleting_destructor.
3902 FLAGS is the logical disjunction of zero or more LOOKUP_
3903 flags. See cp-tree.h for more info. */
3905 tree
3908 {
3909 tree expr;
3916 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
3917 set to `error_mark_node' before it gets properly cleaned up. */
3925 {
3927 {
3931 }
3934 }
3937 {
3942 /* We don't want to warn about delete of void*, only other
3943 incomplete types. Deleting other incomplete types
3944 invokes undefined behavior, but it is not ill-formed, so
3945 compile to something that would even do The Right Thing
3946 (TM) should the type have a trivial dtor and no delete
3947 operator. */
3949 {
3952 {
3955 "possible problem detected in invocation of "
3957 {
3960 "neither the destructor nor the class-specific "
3961 "operator delete will be called, even if they are "
3963 }
3965 }
3969 {
3970 tree dtor;
3973 {
3976 "deleting object of abstract class type %qT"
3977 " which has non-virtual destructor"
3979 else
3981 "deleting object of polymorphic class type %qT"
3982 " which has non-virtual destructor"
3984 }
3985 }
3986 }
3988 /* Call the builtin operator delete. */
3993 /* Throw away const and volatile on target type of addr. */
3995 }
3996 else
3997 {
3998 /* Don't check PROTECT here; leave that decision to the
3999 destructor. If the destructor is accessible, call it,
4000 else report error. */
4008 }
4011 {
4012 /* Make sure the destructor is callable. */
4014 {
4016 complain),
4020 }
4027 use_global_delete,
4030 complain);
4031 }
4032 else
4033 {
4036 tree ifexp;
4041 /* For `::delete x', we must not use the deleting destructor
4042 since then we would not be sure to get the global `operator
4043 delete'. */
4045 {
4046 /* We will use ADDR multiple times so we must save it. */
4049 /* Delete the object. */
4051 /* Otherwise, treat this like a complete object destructor
4052 call. */
4054 }
4055 /* If the destructor is non-virtual, there is no deleting
4056 variant. Instead, we must explicitly call the appropriate
4057 `operator delete' here. */
4060 {
4061 /* We will use ADDR multiple times so we must save it. */
4063 /* Build the call. */
4065 addr,
4070 complain);
4071 /* Call the complete object destructor. */
4073 }
4076 {
4077 /* Make sure we have access to the member op delete, even though
4078 we'll actually be calling it from the destructor. */
4083 complain);
4084 }
4093 /* We need to calculate this before the dtor changes the vptr. */
4098 /* Explicit destructor call; don't check for null pointer. */
4100 else
4101 {
4102 /* Handle deleting a null pointer. */
4105 complain));
4108 }
4114 }
4115 }
4117 /* At the beginning of a destructor, push cleanups that will call the
4118 destructors for our base classes and members.
4120 Called from begin_destructor_body. */
4122 void
4124 {
4127 tree member;
4128 tree expr;
4131 /* Run destructors for all virtual baseclasses. */
4133 {
4134 tree cond = (condition_conversion
4136 current_in_charge_parm,
4137 integer_two_node)));
4139 /* The CLASSTYPE_VBASECLASSES vector is in initialization
4140 order, which is also the right order for pushing cleanups. */
4143 {
4145 {
4147 base_dtor_identifier,
4148 NULL,
4149 base_binfo,
4150 (LOOKUP_NORMAL
4152 tf_warning_or_error);
4154 {
4158 }
4159 }
4160 }
4161 }
4163 /* Take care of the remaining baseclasses. */
4166 {
4172 base_dtor_identifier,
4175 tf_warning_or_error);
4178 }
4180 /* Don't automatically destroy union members. */
4186 {
4195 {
4196 tree this_member = (build_class_member_access_expr
4200 tf_warning_or_error));
4202 sfk_complete_destructor,
4207 }
4208 }
4209 }
4211 /* Build a C++ vector delete expression.
4212 MAXINDEX is the number of elements to be deleted.
4213 ELT_SIZE is the nominal size of each element in the vector.
4214 BASE is the expression that should yield the store to be deleted.
4215 This function expands (or synthesizes) these calls itself.
4216 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
4218 This also calls delete for virtual baseclasses of elements of the vector.
4220 Update: MAXINDEX is no longer needed. The size can be extracted from the
4221 start of the vector for pointers, and from the type for arrays. We still
4222 use MAXINDEX for arrays because it happens to already have one of the
4223 values we'd have to extract. (We could use MAXINDEX with pointers to
4224 confirm the size, and trap if the numbers differ; not clear that it'd
4225 be worth bothering.) */
4227 tree
4229 special_function_kind auto_delete_vec,
4231 {
4232 tree type;
4233 tree rval;
4239 {
4240 /* Step back one from start of vector, and read dimension. */
4241 tree cookie_addr;
4246 {
4249 }
4254 cookie_addr);
4256 }
4258 {
4259 /* Get the total number of things in the array, maxindex is a
4260 bad name. */
4267 {
4270 }
4271 }
4272 else
4273 {
4277 }
4285 }