| blob | 09a897f0ef8d8f865c112ee9abb6dbaa726aaddc |
1 /* Handle initialization things in C++.
2 Copyright (C) 1987-2014 Free Software Foundation, Inc.
3 Contributed by Michael Tiemann (tiemann@cygnus.com)
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
10 any later version.
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
21 /* High-level class interface. */
51 /* We are about to generate some complex initialization code.
52 Conceptually, it is all a single expression. However, we may want
53 to include conditionals, loops, and other such statement-level
54 constructs. Therefore, we build the initialization code inside a
55 statement-expression. This function starts such an expression.
56 STMT_EXPR_P and COMPOUND_STMT_P are filled in by this function;
57 pass them back to finish_init_stmts when the expression is
58 complete. */
60 static bool
62 {
69 }
71 /* Finish out the statement-expression begun by the previous call to
72 begin_init_stmts. Returns the statement-expression itself. */
74 static tree
76 {
84 }
86 /* Constructors */
88 /* Called from initialize_vtbl_ptrs via dfs_walk. BINFO is the base
89 which we want to initialize the vtable pointer for, DATA is
90 TREE_LIST whose TREE_VALUE is the this ptr expression. */
92 static tree
94 {
99 {
103 tf_warning_or_error);
106 }
109 }
111 /* Initialize all the vtable pointers in the object pointed to by
112 ADDR. */
114 void
116 {
117 tree list;
118 tree type;
123 /* Walk through the hierarchy, initializing the vptr in each base
124 class. We do these in pre-order because we can't find the virtual
125 bases for a class until we've initialized the vtbl for that
126 class. */
128 }
130 /* Return an expression for the zero-initialization of an object with
131 type T. This expression will either be a constant (in the case
132 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
133 aggregate), or NULL (in the case that T does not require
134 initialization). In either case, the value can be used as
135 DECL_INITIAL for a decl of the indicated TYPE; it is a valid static
136 initializer. If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS
137 is the number of elements in the array. If STATIC_STORAGE_P is
138 TRUE, initializers are only generated for entities for which
139 zero-initialization does not simply mean filling the storage with
140 zero bytes. FIELD_SIZE, if non-NULL, is the bit size of the field,
141 subfields with bit positions at or above that bit size shouldn't
142 be added. Note that this only works when the result is assigned
143 to a base COMPONENT_REF; if we only have a pointer to the base subobject,
144 expand_assignment will end up clearing the full size of TYPE. */
146 static tree
148 tree field_size)
149 {
152 /* [dcl.init]
154 To zero-initialize an object of type T means:
156 -- if T is a scalar type, the storage is set to the value of zero
157 converted to T.
159 -- if T is a non-union class type, the storage for each nonstatic
160 data member and each base-class subobject is zero-initialized.
162 -- if T is a union type, the storage for its first data member is
163 zero-initialized.
165 -- if T is an array type, the storage for each element is
166 zero-initialized.
168 -- if T is a reference type, no initialization is performed. */
173 ;
175 /* In order to save space, we do not explicitly build initializers
176 for items that do not need them. GCC's semantics are that
177 items with static storage duration that are not otherwise
178 initialized are initialized to zero. */
179 ;
185 {
186 tree field;
189 /* Iterate over the fields, building initializations. */
191 {
198 /* Don't add virtual bases for base classes if they are beyond
199 the size of the current field, that means it is present
200 somewhere else in the object. */
202 {
207 }
209 /* Note that for class types there will be FIELD_DECLs
210 corresponding to base classes as well. Thus, iterating
211 over TYPE_FIELDs will result in correct initialization of
212 all of the subobjects. */
214 {
215 tree new_field_size
222 static_storage_p,
223 new_field_size);
226 }
228 /* For unions, only the first field is initialized. */
231 }
233 /* Build a constructor to contain the initializations. */
235 }
237 {
238 tree max_index;
241 /* Iterate over the array elements, building initializations. */
246 else
249 /* If we have an error_mark here, we should just return error mark
250 as we don't know the size of the array yet. */
255 /* A zero-sized array, which is accepted as an extension, will
256 have an upper bound of -1. */
258 {
259 constructor_elt ce;
261 /* If this is a one element array, we just use a regular init. */
264 else
266 max_index);
272 {
275 }
276 }
278 /* Build a constructor to contain the initializations. */
280 }
283 else
286 /* In all cases, the initializer is a constant. */
291 }
293 /* Return an expression for the zero-initialization of an object with
294 type T. This expression will either be a constant (in the case
295 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
296 aggregate), or NULL (in the case that T does not require
297 initialization). In either case, the value can be used as
298 DECL_INITIAL for a decl of the indicated TYPE; it is a valid static
299 initializer. If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS
300 is the number of elements in the array. If STATIC_STORAGE_P is
301 TRUE, initializers are only generated for entities for which
302 zero-initialization does not simply mean filling the storage with
303 zero bytes. */
305 tree
307 {
309 }
311 /* Return a suitable initializer for value-initializing an object of type
312 TYPE, as described in [dcl.init]. */
314 tree
316 {
317 /* [dcl.init]
319 To value-initialize an object of type T means:
321 - if T is a class type (clause 9) with either no default constructor
322 (12.1) or a default constructor that is user-provided or deleted,
323 then then the object is default-initialized;
325 - if T is a (possibly cv-qualified) class type without a user-provided
326 or deleted default constructor, then the object is zero-initialized
327 and the semantic constraints for default-initialization are checked,
328 and if T has a non-trivial default constructor, the object is
329 default-initialized;
331 - if T is an array type, then each element is value-initialized;
333 - otherwise, the object is zero-initialized.
335 A program that calls for default-initialization or
336 value-initialization of an entity of reference type is ill-formed. */
338 /* The AGGR_INIT_EXPR tweaking below breaks in templates. */
344 {
345 tree ctor = build_aggr_init_expr
349 complain));
354 {
355 /* This is a class that needs constructing, but doesn't have
356 a user-provided constructor. So we need to zero-initialize
357 the object and then call the implicitly defined ctor.
358 This will be handled in simplify_aggr_init_expr. */
361 }
362 }
364 /* Discard any access checking during subobject initialization;
365 the checks are implied by the call to the ctor which we have
366 verified is OK (cpp0x/defaulted46.C). */
371 }
373 /* Like build_value_init, but don't call the constructor for TYPE. Used
374 for base initializers. */
376 tree
378 {
380 {
384 }
385 /* FIXME the class and array cases should just use digest_init once it is
386 SFINAE-enabled. */
388 {
393 {
394 tree field;
397 /* Iterate over the fields, building initializations. */
399 {
410 /* We could skip vfields and fields of types with
411 user-defined constructors, but I think that won't improve
412 performance at all; it should be simpler in general just
413 to zero out the entire object than try to only zero the
414 bits that actually need it. */
416 /* Note that for class types there will be FIELD_DECLs
417 corresponding to base classes as well. Thus, iterating
418 over TYPE_FIELDs will result in correct initialization of
419 all of the subobjects. */
427 }
429 /* Build a constructor to contain the zero- initializations. */
431 }
432 }
434 {
437 /* Iterate over the array elements, building initializations. */
440 /* If we have an error_mark here, we should just return error mark
441 as we don't know the size of the array yet. */
443 {
446 type);
448 }
451 /* A zero-sized array, which is accepted as an extension, will
452 have an upper bound of -1. */
454 {
455 constructor_elt ce;
457 /* If this is a one element array, we just use a regular init. */
460 else
465 {
472 /* We shouldn't have gotten here for anything that would need
473 non-trivial initialization, and gimplify_init_ctor_preeval
474 would need to be fixed to allow it. */
477 }
478 }
480 /* Build a constructor to contain the initializations. */
482 }
484 {
488 }
490 {
494 }
497 }
499 /* Initialize current class with INIT, a TREE_LIST of
500 arguments for a target constructor. If TREE_LIST is void_type_node,
501 an empty initializer list was given. */
503 static void
505 {
511 tf_warning_or_error));
513 {
515 LOOKUP_NORMAL
516 |LOOKUP_NONVIRTUAL
522 }
523 }
525 /* Return the non-static data initializer for FIELD_DECL MEMBER. */
527 tree
529 {
530 tree init;
536 {
537 /* Do deferred instantiation of the NSDMI. */
538 init = (tsubst_copy_and_build
545 }
546 else
547 {
550 {
555 }
556 /* Strip redundant TARGET_EXPR so we don't need to remap it, and
557 so the aggregate init code below will see a CONSTRUCTOR. */
562 }
566 }
568 /* Initialize MEMBER, a FIELD_DECL, with INIT, a TREE_LIST of
569 arguments. If TREE_LIST is void_type_node, an empty initializer
570 list was given; if NULL_TREE no initializer was given. */
572 static void
574 {
575 tree decl;
578 /* Use the non-static data member initializer if there was no
579 mem-initializer for this field. */
586 /* Effective C++ rule 12 requires that all data members be
587 initialized. */
591 member);
593 /* Get an lvalue for the data member. */
597 tf_warning_or_error);
603 {
609 member);
610 }
613 {
614 /* mem() means value-initialization. */
616 {
620 }
621 else
622 {
628 }
629 }
630 /* Deal with this here, as we will get confused if we try to call the
631 assignment op for an anonymous union. This can happen in a
632 synthesized copy constructor. */
634 {
636 {
639 }
640 }
643 /* Pre-digested NSDMI. */
646 /* { } 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;
1526 {
1527 tree itype;
1529 /* An array may not be initialized use the parenthesized
1530 initialization form -- unless the initializer is "()". */
1532 {
1536 }
1537 /* Must arrange to initialize each element of EXP
1538 from elements of INIT. */
1548 complain);
1552 /* Restore the type of init unless it was used directly. */
1556 }
1560 /* Just know that we've seen something for this node. */
1574 }
1576 static void
1578 tsubst_flags_t complain)
1579 {
1581 tree ctor_name;
1583 /* It fails because there may not be a constructor which takes
1584 its own type as the first (or only parameter), but which does
1585 take other types via a conversion. So, if the thing initializing
1586 the expression is a unit element of type X, first try X(X&),
1587 followed by initialization by X. If neither of these work
1588 out, then look hard. */
1589 tree rval;
1592 /* If we have direct-initialization from an initializer list, pull
1593 it out of the TREE_LIST so the code below can see it. */
1597 {
1601 }
1605 /* A brace-enclosed initializer for an aggregate. In C++0x this can
1606 happen for direct-initialization, too. */
1609 /* A CONSTRUCTOR of the target's type is a previously digested
1610 initializer, whether that happened just above or in
1611 cp_parser_late_parsing_nsdmi.
1613 A TARGET_EXPR with TARGET_EXPR_DIRECT_INIT_P or TARGET_EXPR_LIST_INIT_P
1614 set represents the whole initialization, so we shouldn't build up
1615 another ctor call. */
1622 {
1623 /* Early initialization via a TARGET_EXPR only works for
1624 complete objects. */
1631 }
1635 {
1636 /* Base subobjects should only get direct-initialization. */
1640 /* Do nothing. We hit this in two cases: Reference initialization,
1641 where we aren't initializing a real variable, so we don't want
1642 to run a new constructor; and catching an exception, where we
1643 have already built up the constructor call so we could wrap it
1645 else
1650 /* We need to protect the initialization of a catch parm with a
1651 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
1652 around the TARGET_EXPR for the copy constructor. See
1653 initialize_handler_parm. */
1654 {
1658 }
1659 else
1664 }
1669 {
1673 }
1674 else
1679 {
1680 /* Delegating constructor. */
1681 tree complete;
1682 tree base;
1685 /* Unshare the arguments for the second call. */
1688 {
1691 }
1694 complain);
1700 complain);
1705 base,
1706 complete);
1707 }
1708 else
1709 {
1712 else
1715 complain);
1716 }
1722 {
1725 {
1729 }
1730 }
1732 /* FIXME put back convert_to_void? */
1735 }
1737 /* This function is responsible for initializing EXP with INIT
1738 (if any).
1740 BINFO is the binfo of the type for who we are performing the
1741 initialization. For example, if W is a virtual base class of A and B,
1742 and C : A, B.
1743 If we are initializing B, then W must contain B's W vtable, whereas
1744 were we initializing C, W must contain C's W vtable.
1746 TRUE_EXP is nonzero if it is the true expression being initialized.
1747 In this case, it may be EXP, or may just contain EXP. The reason we
1748 need this is because if EXP is a base element of TRUE_EXP, we
1749 don't necessarily know by looking at EXP where its virtual
1750 baseclass fields should really be pointing. But we do know
1751 from TRUE_EXP. In constructors, we don't know anything about
1752 the value being initialized.
1754 FLAGS is just passed to `build_new_method_call'. See that function
1755 for its description. */
1757 static void
1759 tsubst_flags_t complain)
1760 {
1766 /* Use a function returning the desired type to initialize EXP for us.
1767 If the function is a constructor, and its first argument is
1768 NULL_TREE, know that it was meant for us--just slide exp on
1769 in and expand the constructor. Constructors now come
1770 as TARGET_EXPRs. */
1774 {
1776 /* If store_init_value returns NULL_TREE, the INIT has been
1777 recorded as the DECL_INITIAL for EXP. That means there's
1778 nothing more we have to do. */
1784 }
1786 /* If an explicit -- but empty -- initializer list was present,
1787 that's value-initialization. */
1789 {
1790 /* If the type has data but no user-provided ctor, we need to zero
1791 out the object. */
1794 {
1797 /* Don't clobber already initialized virtual bases. */
1800 field_size);
1803 }
1805 /* If we don't need to mess with the constructor at all,
1806 then we're done. */
1810 /* Otherwise fall through and call the constructor. */
1812 }
1814 /* We know that expand_default_init can handle everything we want
1815 at this point. */
1817 }
1819 /* Report an error if TYPE is not a user-defined, class type. If
1820 OR_ELSE is nonzero, give an error message. */
1822 int
1824 {
1829 {
1833 }
1835 }
1837 tree
1839 {
1845 else
1847 }
1849 /* Build a reference to a member of an aggregate. This is not a C++
1850 `&', but really something which can have its address taken, and
1851 then act as a pointer to member, for example TYPE :: FIELD can have
1852 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if
1853 this expression is the operand of "&".
1855 @@ Prints out lousy diagnostics for operator <typename>
1856 @@ fields.
1858 @@ This function should be rewritten and placed in search.c. */
1860 tree
1862 tsubst_flags_t complain)
1863 {
1864 tree decl;
1867 /* class templates can come in as TEMPLATE_DECLs here. */
1880 /* Callers should call mark_used before this point. */
1885 {
1889 }
1891 /* Entities other than non-static members need no further
1892 processing. */
1899 {
1903 }
1905 /* Set up BASEBINFO for member lookup. */
1908 /* A lot of this logic is now handled in lookup_member. */
1910 {
1911 /* Go from the TREE_BASELINK to the member function info. */
1915 {
1916 /* Get rid of a potential OVERLOAD around it. */
1919 /* Unique functions are handled easily. */
1921 /* For non-static member of base class, we need a special rule
1922 for access checking [class.protected]:
1924 If the access is to form a pointer to member, the
1925 nested-name-specifier shall name the derived class
1926 (or any class derived from that class). */
1930 complain);
1931 else
1933 complain);
1938 }
1939 else
1941 }
1943 /* We need additional test besides the one in
1944 check_accessibility_of_qualified_id in case it is
1945 a pointer to non-static member. */
1947 complain);
1950 {
1951 /* If MEMBER is non-static, then the program has fallen afoul of
1952 [expr.prim]:
1954 An id-expression that denotes a nonstatic data member or
1955 nonstatic member function of a class can only be used:
1957 -- as part of a class member access (_expr.ref_) in which the
1958 object-expression refers to the member's class or a class
1959 derived from that class, or
1961 -- to form a pointer to member (_expr.unary.op_), or
1963 -- in the body of a nonstatic member function of that class or
1964 of a class derived from that class (_class.mfct.nonstatic_), or
1966 -- in a mem-initializer for a constructor for that class or for
1967 a class derived from that class (_class.base.init_). */
1969 {
1970 /* Build a representation of the qualified name suitable
1971 for use as the operand to "&" -- even though the "&" is
1972 not actually present. */
1974 /* In Microsoft mode, treat a non-static member function as if
1975 it were a pointer-to-member. */
1977 {
1980 }
1985 }
1987 {
1991 }
1993 }
1998 }
2000 /* If DECL is a scalar enumeration constant or variable with a
2001 constant initializer, return the initializer (or, its initializers,
2002 recursively); otherwise, return DECL. If INTEGRAL_P, the
2003 initializer is only returned if DECL is an integral
2004 constant-expression. If RETURN_AGGREGATE_CST_OK_P, it is ok to
2005 return an aggregate constant. */
2007 static tree
2009 {
2011 || (integral_p
2015 {
2016 tree init;
2017 /* If DECL is a static data member in a template
2018 specialization, we must instantiate it here. The
2019 initializer for the static data member is not processed
2020 until needed; we need it now. */
2025 {
2027 /* Treat the error as a constant to avoid cascading errors on
2028 excessively recursive template instantiation (c++/9335). */
2030 else
2032 }
2033 /* Initializers in templates are generally expanded during
2034 instantiation, so before that for const int i(2)
2035 INIT is a TREE_LIST with the actual initializer as
2036 TREE_VALUE. */
2038 && init
2046 /* Unless RETURN_AGGREGATE_CST_OK_P is true, do not
2047 return an aggregate constant (of which string
2048 literals are a special case), as we do not want
2049 to make inadvertent copies of such entities, and
2050 we must be sure that their addresses are the
2051 same everywhere. */
2056 }
2058 }
2060 /* If DECL is a CONST_DECL, or a constant VAR_DECL initialized by
2061 constant of integral or enumeration type, then return that value.
2062 These are those variables permitted in constant expressions by
2063 [5.19/1]. */
2065 tree
2067 {
2070 }
2072 /* A more relaxed version of integral_constant_value, used by the
2073 common C/C++ code. */
2075 tree
2077 {
2080 }
2082 /* A version of integral_constant_value used by the C++ front end for
2083 optimization purposes. */
2085 tree
2087 {
2090 }
2091 \f
2092 /* Common subroutines of build_new and build_vec_delete. */
2094 /* Call the global __builtin_delete to delete ADDR. */
2096 static tree
2098 {
2101 }
2102 \f
2103 /* Build and return a NEW_EXPR. If NELTS is non-NULL, TYPE[NELTS] is
2104 the type of the object being allocated; otherwise, it's just TYPE.
2105 INIT is the initializer, if any. USE_GLOBAL_NEW is true if the
2106 user explicitly wrote "::operator new". PLACEMENT, if non-NULL, is
2107 a vector of arguments to be provided as arguments to a placement
2108 new operator. This routine performs no semantic checks; it just
2109 creates and returns a NEW_EXPR. */
2111 static tree
2114 {
2115 tree init_list;
2116 tree new_expr;
2118 /* If INIT is NULL, the we want to store NULL_TREE in the NEW_EXPR.
2119 If INIT is not NULL, then we want to store VOID_ZERO_NODE. This
2120 permits us to distinguish the case of a missing initializer "new
2121 int" from an empty initializer "new int()". */
2126 else
2131 init_list);
2136 }
2138 /* Diagnose uninitialized const members or reference members of type
2139 TYPE. USING_NEW is used to disambiguate the diagnostic between a
2140 new expression without a new-initializer and a declaration. Returns
2141 the error count. */
2143 static int
2146 {
2147 tree field;
2154 {
2155 tree field_type;
2166 {
2169 {
2171 {
2175 else
2177 }
2178 else
2179 {
2184 else
2187 }
2190 }
2191 }
2194 {
2197 {
2199 {
2203 else
2205 }
2206 else
2207 {
2212 else
2215 }
2218 }
2219 }
2222 error_count
2225 }
2227 }
2229 int
2231 {
2233 }
2235 /* Call __cxa_bad_array_new_length to indicate that the size calculation
2236 overflowed. Pretend it returns sizetype so that it plays nicely in the
2237 COND_EXPR. */
2239 tree
2241 {
2245 NULL_TREE));
2248 }
2250 /* Call __cxa_bad_array_length to indicate that there were too many
2251 initializers. */
2253 tree
2255 {
2259 NULL_TREE));
2262 }
2264 /* Generate code for a new-expression, including calling the "operator
2265 new" function, initializing the object, and, if an exception occurs
2266 during construction, cleaning up. The arguments are as for
2267 build_raw_new_expr. This may change PLACEMENT and INIT. */
2269 static tree
2272 tsubst_flags_t complain)
2273 {
2275 /* True iff this is a call to "operator new[]" instead of just
2276 "operator new". */
2278 /* If ARRAY_P is true, the element type of the array. This is never
2279 an ARRAY_TYPE; for something like "new int[3][4]", the
2280 ELT_TYPE is "int". If ARRAY_P is false, this is the same type as
2281 TYPE. */
2282 tree elt_type;
2283 /* The type of the new-expression. (This type is always a pointer
2284 type.) */
2285 tree pointer_type;
2286 tree non_const_pointer_type;
2288 /* For arrays, a bounds checks on the NELTS parameter. */
2293 /* Size of the inner array elements. */
2294 double_int inner_size;
2295 /* The address returned by the call to "operator new". This node is
2296 a VAR_DECL and is therefore reusable. */
2297 tree alloc_node;
2298 tree alloc_fn;
2302 /* If non-NULL, the number of extra bytes to allocate at the
2303 beginning of the storage allocated for an array-new expression in
2304 order to store the number of elements. */
2306 tree placement_first;
2308 /* True if the function we are calling is a placement allocation
2309 function. */
2311 /* True if the storage must be initialized, either by a constructor
2312 or due to an explicit new-initializer. */
2314 /* The address of the thing allocated, not including any cookie. In
2315 particular, if an array cookie is in use, DATA_ADDR is the
2316 address of the first array element. This node is a VAR_DECL, and
2317 is therefore reusable. */
2318 tree data_addr;
2323 {
2326 }
2328 {
2329 /* Transforms new (T[N]) to new T[N]. The former is a GNU
2330 extension for variable N. (This also covers new T where T is
2331 a VLA typedef.) */
2337 }
2339 /* If our base type is an array, then make sure we know how many elements
2340 it has. */
2344 {
2348 {
2354 {
2358 }
2360 }
2361 else
2362 {
2364 {
2368 }
2370 }
2374 inner_nelts_cst,
2375 complain);
2376 }
2379 {
2382 }
2387 /* Warn if we performed the (T[N]) to T[N] transformation and N is
2388 variable. */
2391 {
2393 {
2398 else
2403 }
2404 else
2406 }
2409 {
2413 }
2421 {
2423 /* A program that calls for default-initialization [...] of an
2424 entity of reference type is ill-formed. */
2428 /* A new-expression that creates an object of type T initializes
2429 that object as follows:
2430 - If the new-initializer is omitted:
2431 -- If T is a (possibly cv-qualified) non-POD class type
2432 (or array thereof), the object is default-initialized (8.5).
2433 [...]
2434 -- Otherwise, the object created has indeterminate
2435 value. If T is a const-qualified type, or a (possibly
2436 cv-qualified) POD class type (or array thereof)
2437 containing (directly or indirectly) a member of
2438 const-qualified type, the program is ill-formed; */
2448 }
2452 {
2456 }
2460 {
2461 /* Maximum available size in bytes. Half of the address space
2462 minus the cookie size. */
2463 double_int max_size
2465 HOST_BITS_PER_DOUBLE_INT);
2466 /* Maximum number of outer elements which can be allocated. */
2467 double_int max_outer_nelts;
2468 tree max_outer_nelts_tree;
2474 /* Unconditionally subtract the cookie size. This decreases the
2475 maximum object size and is safe even if we choose not to use
2476 a cookie after all. */
2482 {
2486 }
2488 /* Only keep the top-most seven bits, to simplify encoding the
2489 constant in the instruction stream. */
2490 {
2494 max_outer_nelts
2497 }
2502 outer_nelts,
2503 max_outer_nelts_tree);
2504 }
2508 /* If PLACEMENT is a single simple pointer type not passed by
2509 reference, prepare to capture it in a temporary variable. Do
2510 this now, since PLACEMENT will change in the calls below. */
2516 /* Allocate the object. */
2518 {
2519 tree class_addr;
2520 tree class_decl;
2524 {
2527 }
2536 {
2540 }
2542 {
2546 }
2551 }
2553 {
2556 }
2557 else
2558 {
2559 tree fnname;
2560 tree fns;
2566 && (array_p
2569 {
2570 /* Use a class-specific operator new. */
2571 /* If a cookie is required, add some extra space. */
2574 else
2575 {
2577 /* No size arithmetic necessary, so the size check is
2578 not needed. */
2581 }
2582 /* Perform the overflow check. */
2589 /* Create the argument list. */
2591 /* Do name-lookup to find the appropriate operator. */
2594 {
2598 }
2600 {
2602 {
2605 }
2607 }
2611 LOOKUP_NORMAL,
2613 complain);
2614 }
2615 else
2616 {
2617 /* Use a global operator new. */
2618 /* See if a cookie might be required. */
2620 {
2622 /* No size arithmetic necessary, so the size check is
2623 not needed. */
2626 }
2630 outer_nelts_check,
2632 }
2633 }
2640 /* If we found a simple case of PLACEMENT_EXPR above, then copy it
2641 into a temporary variable. */
2648 {
2653 {
2657 }
2658 }
2660 /* In the simple case, we can stop now. */
2665 /* Store the result of the allocation call in a variable so that we can
2666 use it more than once. */
2670 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */
2674 /* Now, check to see if this function is actually a placement
2675 allocation function. This can happen even when PLACEMENT is NULL
2676 because we might have something like:
2678 struct S { void* operator new (size_t, int i = 0); };
2680 A call to `new S' will get this allocation function, even though
2681 there is no explicit placement argument. If there is more than
2682 one argument, or there are variable arguments, then this is a
2683 placement allocation function. */
2684 placement_allocation_fn_p
2688 /* Preevaluate the placement args so that we don't reevaluate them for a
2689 placement delete. */
2691 {
2692 tree inits;
2696 alloc_expr);
2697 }
2699 /* unless an allocation function is declared with an empty excep-
2700 tion-specification (_except.spec_), throw(), it indicates failure to
2701 allocate storage by throwing a bad_alloc exception (clause _except_,
2702 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2703 cation function is declared with an empty exception-specification,
2704 throw(), it returns null to indicate failure to allocate storage and a
2705 non-null pointer otherwise.
2707 So check for a null exception spec on the op new we just called. */
2713 {
2714 tree cookie;
2715 tree cookie_ptr;
2716 tree size_ptr_type;
2718 /* Adjust so we're pointing to the start of the object. */
2721 /* Store the number of bytes allocated so that we can know how
2722 many elements to destroy later. We use the last sizeof
2723 (size_t) bytes to store the number of elements. */
2734 {
2735 /* Also store the element size. */
2746 }
2747 }
2748 else
2749 {
2752 }
2754 /* Now use a pointer to the type we've actually allocated. */
2756 /* But we want to operate on a non-const version to start with,
2757 since we'll be modifying the elements. */
2758 non_const_pointer_type = build_pointer_type
2762 /* Any further uses of alloc_node will want this type, too. */
2765 /* Now initialize the allocated object. Note that we preevaluate the
2766 initialization expression, apart from the actual constructor call or
2767 assignment--we do this because we want to delay the allocation as long
2768 as possible in order to minimize the size of the exception region for
2769 placement delete. */
2771 {
2776 {
2779 }
2782 {
2783 /* build_value_init doesn't work in templates, and we don't need
2784 the initializer anyway since we're going to throw it away and
2785 rebuild it at instantiation time, so just build up a single
2786 constructor call to get any appropriate diagnostics. */
2790 complete_ctor_identifier,
2792 LOOKUP_NORMAL,
2793 complain);
2795 }
2797 {
2802 {
2806 else
2807 {
2811 complain);
2812 else
2813 /* We'll check the length at runtime. */
2817 }
2818 }
2820 {
2824 else
2827 }
2828 init_expr
2832 integer_one_node,
2833 complain),
2834 vecinit,
2835 explicit_value_init_p,
2837 complain);
2839 /* An array initialization is stable because the initialization
2840 of each element is a full-expression, so the temporaries don't
2841 leak out. */
2843 }
2844 else
2845 {
2849 {
2851 complete_ctor_identifier,
2853 LOOKUP_NORMAL,
2854 complain);
2855 }
2857 {
2858 /* Something like `new int()'. */
2863 }
2864 else
2865 {
2866 tree ie;
2868 /* We are processing something like `new int (10)', which
2869 means allocate an int, and initialize it with 10. */
2872 complain);
2874 complain);
2875 }
2877 }
2882 /* If any part of the object initialization terminates by throwing an
2883 exception and a suitable deallocation function can be found, the
2884 deallocation function is called to free the memory in which the
2885 object was being constructed, after which the exception continues
2886 to propagate in the context of the new-expression. If no
2887 unambiguous matching deallocation function can be found,
2888 propagating the exception does not cause the object's memory to be
2889 freed. */
2891 {
2893 tree cleanup;
2895 /* The Standard is unclear here, but the right thing to do
2896 is to use the same method for finding deallocation
2897 functions that we use for finding allocation functions. */
2898 cleanup = (build_op_delete_call
2900 alloc_node,
2901 size,
2902 globally_qualified_p,
2904 alloc_fn,
2905 complain));
2910 /* This is much simpler if we were able to preevaluate all of
2911 the arguments to the constructor call. */
2912 {
2913 /* CLEANUP is compiler-generated, so no diagnostics. */
2917 /* Likewise, this try-catch is compiler-generated. */
2919 }
2920 else
2921 /* Ack! First we allocate the memory. Then we set our sentry
2922 variable to true, and expand a cleanup that deletes the
2923 memory if sentry is true. Then we run the constructor, and
2924 finally clear the sentry.
2926 We need to do this because we allocate the space first, so
2927 if there are any temporaries with cleanups in the
2928 constructor args and we weren't able to preevaluate them, we
2929 need this EH region to extend until end of full-expression
2930 to preserve nesting. */
2931 {
2939 /* CLEANUP is compiler-generated, so no diagnostics. */
2949 init_expr
2952 end));
2953 /* Likewise, this is compiler-generated. */
2955 }
2956 }
2957 }
2958 else
2961 /* Now build up the return value in reverse order. */
2971 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
2972 and return the call (which doesn't need to be adjusted). */
2974 else
2975 {
2977 {
2980 nullptr_node,
2981 complain);
2984 }
2986 /* Perform the allocation before anything else, so that ALLOC_NODE
2987 has been initialized before we start using it. */
2989 }
2994 /* A new-expression is never an lvalue. */
2998 }
3000 /* Generate a representation for a C++ "new" expression. *PLACEMENT
3001 is a vector of placement-new arguments (or NULL if none). If NELTS
3002 is NULL, TYPE is the type of the storage to be allocated. If NELTS
3003 is not NULL, then this is an array-new allocation; TYPE is the type
3004 of the elements in the array and NELTS is the number of elements in
3005 the array. *INIT, if non-NULL, is the initializer for the new
3006 object, or an empty vector to indicate an initializer of "()". If
3007 USE_GLOBAL_NEW is true, then the user explicitly wrote "::new"
3008 rather than just "new". This may change PLACEMENT and INIT. */
3010 tree
3013 {
3014 tree rval;
3023 /* Don't do auto deduction where it might affect mangling. */
3025 {
3028 {
3032 }
3033 }
3036 {
3043 use_global_new);
3054 }
3057 {
3059 {
3062 else
3064 }
3067 }
3069 /* ``A reference cannot be created by the new operator. A reference
3070 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
3071 returned by new.'' ARM 5.3.3 */
3073 {
3076 else
3079 }
3082 {
3086 }
3088 /* The type allocated must be complete. If the new-type-id was
3089 "T[N]" then we are just checking that "T" is complete here, but
3090 that is equivalent, since the value of "N" doesn't matter. */
3099 {
3105 }
3107 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
3112 }
3114 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
3116 tree
3118 {
3124 {
3127 {
3130 }
3132 }
3134 /* Mangle the class$ field. */
3135 {
3136 tree field;
3139 {
3143 }
3145 {
3148 }
3149 }
3153 {
3163 }
3165 }
3166 \f
3167 static tree
3169 special_function_kind auto_delete_vec,
3171 {
3172 tree virtual_size;
3174 tree size_exp;
3176 /* Temporary variables used by the loop. */
3179 /* This is the body of the loop that implements the deletion of a
3180 single element, and moves temp variables to next elements. */
3181 tree body;
3183 /* This is the LOOP_EXPR that governs the deletion of the elements. */
3186 /* This is the thing that governs what to do after the loop has run. */
3189 /* This is the BIND_EXPR which holds the outermost iterator of the
3190 loop. It is convenient to set this variable up and test it before
3191 executing any other code in the loop.
3192 This is also the containing expression returned by this function. */
3194 tree tmp;
3196 /* We should only have 1-D arrays here. */
3203 {
3206 "possible problem detected in invocation of "
3208 {
3211 "class-specific operator delete [] will be called, "
3213 }
3215 }
3222 {
3223 /* Make sure the destructor is callable. */
3225 {
3228 complain);
3231 }
3233 }
3235 /* The below is short by the cookie size. */
3240 tbase_init
3244 base),
3245 virtual_size),
3246 complain);
3264 complain);
3272 no_destructor:
3273 /* Delete the storage if appropriate. */
3275 {
3276 tree base_tbd;
3278 /* The below is short by the cookie size. */
3283 /* no header */
3285 else
3286 {
3287 tree cookie_size;
3291 MINUS_EXPR,
3294 cookie_size,
3295 complain);
3299 /* True size with header. */
3301 }
3308 complain);
3309 }
3313 ;
3316 else
3322 /* Outermost wrapper: If pointer is null, punt. */
3327 nullptr_node)),
3332 {
3335 }
3338 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
3342 }
3344 /* Create an unnamed variable of the indicated TYPE. */
3346 tree
3348 {
3349 tree decl;
3359 }
3361 /* Create a new temporary variable of the indicated TYPE, initialized
3362 to INIT.
3364 It is not entered into current_binding_level, because that breaks
3365 things when it comes time to do final cleanups (which take place
3366 "outside" the binding contour of the function). */
3368 tree
3370 {
3371 tree decl;
3377 tf_warning_or_error));
3380 }
3382 /* Subroutine of build_vec_init. Returns true if assigning to an array of
3383 INNER_ELT_TYPE from INIT is trivial. */
3385 static bool
3387 {
3395 }
3397 /* `build_vec_init' returns tree structure that performs
3398 initialization of a vector of aggregate types.
3400 BASE is a reference to the vector, of ARRAY_TYPE, or a pointer
3401 to the first element, of POINTER_TYPE.
3402 MAXINDEX is the maximum index of the array (one less than the
3403 number of elements). It is only used if BASE is a pointer or
3404 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
3406 INIT is the (possibly NULL) initializer.
3408 If EXPLICIT_VALUE_INIT_P is true, then INIT must be NULL. All
3409 elements in the array are value-initialized.
3411 FROM_ARRAY is 0 if we should init everything with INIT
3412 (i.e., every element initialized from INIT).
3413 FROM_ARRAY is 1 if we should index into INIT in parallel
3414 with initialization of DECL.
3415 FROM_ARRAY is 2 if we should index into INIT in parallel,
3416 but use assignment instead of initialization. */
3418 tree
3422 {
3423 tree rval;
3426 tree iterator;
3427 /* The type of BASE. */
3429 /* The type of an element in the array. */
3431 /* The element type reached after removing all outer array
3432 types. */
3433 tree inner_elt_type;
3434 /* The type of a pointer to an element in the array. */
3435 tree ptype;
3436 tree stmt_expr;
3437 tree compound_stmt;
3459 /* Look through the TARGET_EXPR around a compound literal. */
3465 /* If we have a braced-init-list, make sure that the array
3466 is big enough for all the initializers. */
3481 /* Don't do this if the CONSTRUCTOR might contain something
3482 that might throw and require us to clean up. */
3486 {
3487 /* Do non-default initialization of trivial arrays resulting from
3488 brace-enclosed initializers. In this case, digest_init and
3489 store_constructor will handle the semantics for us. */
3497 stmt_expr);
3499 }
3503 {
3509 }
3510 else
3513 /* The code we are generating looks like:
3514 ({
3515 T* t1 = (T*) base;
3516 T* rval = t1;
3517 ptrdiff_t iterator = maxindex;
3518 try {
3519 for (; iterator != -1; --iterator) {
3520 ... initialize *t1 ...
3521 ++t1;
3522 }
3523 } catch (...) {
3524 ... destroy elements that were constructed ...
3525 }
3526 rval;
3527 })
3529 We can omit the try and catch blocks if we know that the
3530 initialization will never throw an exception, or if the array
3531 elements do not have destructors. We can omit the loop completely if
3532 the elements of the array do not have constructors.
3534 We actually wrap the entire body of the above in a STMT_EXPR, for
3535 tidiness.
3537 When copying from array to another, when the array elements have
3538 only trivial copy constructors, we should use __builtin_memcpy
3539 rather than generating a loop. That way, we could take advantage
3540 of whatever cleverness the back end has for dealing with copies
3541 of blocks of memory. */
3550 /* If initializing one array from another, initialize element by
3551 element. We rely upon the below calls to do the argument
3552 checking. Evaluate the initializer before entering the try block. */
3554 {
3563 }
3565 /* Protect the entire array initialization so that we can destroy
3566 the partially constructed array if an exception is thrown.
3567 But don't do this if we're assigning. */
3570 {
3572 }
3577 /* Skip over the handling of non-empty init lists. */
3580 /* Maybe pull out constant value when from_array? */
3583 {
3584 /* Do non-default initialization of non-trivial arrays resulting from
3585 brace-enclosed initializers. */
3588 /* Should we try to create a constant initializer? */
3593 /* If the constructor already has the array type, it's been through
3594 digest_init, so we shouldn't try to do anything more. */
3598 /* If we're initializing a static array, we want to do static
3599 initialization of any elements with constant initializers even if
3600 some are non-constant. */
3606 {
3607 tree throw_call;
3610 else
3615 }
3619 else
3623 {
3625 tree one_init;
3627 num_initialized_elts++;
3634 else
3640 {
3649 {
3653 else
3656 }
3657 else
3658 {
3660 {
3665 }
3667 }
3668 }
3677 else
3681 complain);
3684 else
3686 }
3689 {
3694 else
3696 }
3698 /* Any elements without explicit initializers get T{}. */
3700 }
3702 {
3707 {
3711 }
3712 }
3714 /* Now, default-initialize any remaining elements. We don't need to
3715 do that if a) the type does not need constructing, or b) we've
3716 already initialized all the elements.
3718 We do need to keep going if we're copying an array. */
3723 && (num_initialized_elts
3725 {
3726 /* If the ITERATOR is equal to -1, then we don't have to loop;
3727 we've already initialized all the elements. */
3728 tree for_stmt;
3729 tree elt_init;
3730 tree to;
3738 complain);
3745 /* If the initializer is {}, then all elements are initialized from T{}.
3746 But for non-classes, that's the same as value-initialization. */
3748 {
3750 {
3753 }
3754 else
3755 {
3758 }
3759 }
3762 {
3763 tree from;
3766 {
3770 }
3771 else
3776 complain);
3781 complain);
3782 else
3784 }
3786 {
3788 sorry
3792 explicit_value_init_p,
3794 }
3796 {
3800 }
3801 else
3802 {
3806 else
3807 {
3810 complain);
3812 }
3813 }
3823 complain));
3826 complain));
3829 }
3831 /* Make sure to cleanup any partially constructed elements. */
3834 {
3835 tree e;
3838 complain);
3840 /* Flatten multi-dimensional array since build_vec_delete only
3841 expects one-dimensional array. */
3845 /* Avoid mixing signed and unsigned. */
3848 complain);
3857 }
3859 /* The value of the array initialization is the array itself, RVAL
3860 is a pointer to the first element. */
3872 /* Now make the result have the correct type. */
3874 {
3879 }
3882 }
3884 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
3885 build_delete. */
3887 static tree
3889 tsubst_flags_t complain)
3890 {
3891 tree name;
3892 tree fn;
3894 {
3909 }
3914 flags,
3916 complain);
3917 }
3919 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
3920 ADDR is an expression which yields the store to be destroyed.
3921 AUTO_DELETE is the name of the destructor to call, i.e., either
3922 sfk_complete_destructor, sfk_base_destructor, or
3923 sfk_deleting_destructor.
3925 FLAGS is the logical disjunction of zero or more LOOKUP_
3926 flags. See cp-tree.h for more info. */
3928 tree
3931 {
3932 tree expr;
3939 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
3940 set to `error_mark_node' before it gets properly cleaned up. */
3948 {
3950 {
3954 }
3957 }
3960 {
3965 /* We don't want to warn about delete of void*, only other
3966 incomplete types. Deleting other incomplete types
3967 invokes undefined behavior, but it is not ill-formed, so
3968 compile to something that would even do The Right Thing
3969 (TM) should the type have a trivial dtor and no delete
3970 operator. */
3972 {
3975 {
3978 "possible problem detected in invocation of "
3980 {
3983 "neither the destructor nor the class-specific "
3984 "operator delete will be called, even if they are "
3986 }
3988 }
3992 {
3993 tree dtor;
3996 {
3999 "deleting object of abstract class type %qT"
4000 " which has non-virtual destructor"
4002 else
4004 "deleting object of polymorphic class type %qT"
4005 " which has non-virtual destructor"
4007 }
4008 }
4009 }
4011 /* Call the builtin operator delete. */
4016 /* Throw away const and volatile on target type of addr. */
4018 }
4019 else
4020 {
4021 /* Don't check PROTECT here; leave that decision to the
4022 destructor. If the destructor is accessible, call it,
4023 else report error. */
4031 }
4034 {
4035 /* Make sure the destructor is callable. */
4037 {
4039 complain),
4043 }
4050 use_global_delete,
4053 complain);
4054 }
4055 else
4056 {
4059 tree ifexp;
4064 /* For `::delete x', we must not use the deleting destructor
4065 since then we would not be sure to get the global `operator
4066 delete'. */
4068 {
4069 /* We will use ADDR multiple times so we must save it. */
4072 /* Delete the object. */
4074 /* Otherwise, treat this like a complete object destructor
4075 call. */
4077 }
4078 /* If the destructor is non-virtual, there is no deleting
4079 variant. Instead, we must explicitly call the appropriate
4080 `operator delete' here. */
4083 {
4084 /* We will use ADDR multiple times so we must save it. */
4086 /* Build the call. */
4088 addr,
4093 complain);
4094 /* Call the complete object destructor. */
4096 }
4099 {
4100 /* Make sure we have access to the member op delete, even though
4101 we'll actually be calling it from the destructor. */
4106 complain);
4107 }
4116 /* We need to calculate this before the dtor changes the vptr. */
4121 /* Explicit destructor call; don't check for null pointer. */
4123 else
4124 {
4125 /* Handle deleting a null pointer. */
4128 complain));
4131 }
4138 }
4139 }
4141 /* At the beginning of a destructor, push cleanups that will call the
4142 destructors for our base classes and members.
4144 Called from begin_destructor_body. */
4146 void
4148 {
4151 tree member;
4152 tree expr;
4155 /* Run destructors for all virtual baseclasses. */
4157 {
4158 tree cond = (condition_conversion
4160 current_in_charge_parm,
4161 integer_two_node)));
4163 /* The CLASSTYPE_VBASECLASSES vector is in initialization
4164 order, which is also the right order for pushing cleanups. */
4167 {
4169 {
4171 base_dtor_identifier,
4172 NULL,
4173 base_binfo,
4174 (LOOKUP_NORMAL
4176 tf_warning_or_error);
4178 {
4182 }
4183 }
4184 }
4185 }
4187 /* Take care of the remaining baseclasses. */
4190 {
4196 base_dtor_identifier,
4199 tf_warning_or_error);
4202 }
4204 /* Don't automatically destroy union members. */
4210 {
4219 {
4220 tree this_member = (build_class_member_access_expr
4224 tf_warning_or_error));
4226 sfk_complete_destructor,
4231 }
4232 }
4233 }
4235 /* Build a C++ vector delete expression.
4236 MAXINDEX is the number of elements to be deleted.
4237 ELT_SIZE is the nominal size of each element in the vector.
4238 BASE is the expression that should yield the store to be deleted.
4239 This function expands (or synthesizes) these calls itself.
4240 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
4242 This also calls delete for virtual baseclasses of elements of the vector.
4244 Update: MAXINDEX is no longer needed. The size can be extracted from the
4245 start of the vector for pointers, and from the type for arrays. We still
4246 use MAXINDEX for arrays because it happens to already have one of the
4247 values we'd have to extract. (We could use MAXINDEX with pointers to
4248 confirm the size, and trap if the numbers differ; not clear that it'd
4249 be worth bothering.) */
4251 tree
4253 special_function_kind auto_delete_vec,
4255 {
4256 tree type;
4257 tree rval;
4263 {
4264 /* Step back one from start of vector, and read dimension. */
4265 tree cookie_addr;
4270 {
4273 }
4278 cookie_addr);
4280 }
4282 {
4283 /* Get the total number of things in the array, maxindex is a
4284 bad name. */
4291 {
4294 }
4295 }
4296 else
4297 {
4301 }
4309 }