| blob | 4edd150d91360b3d3b22fda5d6619bf9fb92c462 |
1 /* Handle initialization things in C++.
2 Copyright (C) 1987-2013 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. */
49 /* We are about to generate some complex initialization code.
50 Conceptually, it is all a single expression. However, we may want
51 to include conditionals, loops, and other such statement-level
52 constructs. Therefore, we build the initialization code inside a
53 statement-expression. This function starts such an expression.
54 STMT_EXPR_P and COMPOUND_STMT_P are filled in by this function;
55 pass them back to finish_init_stmts when the expression is
56 complete. */
58 static bool
60 {
67 }
69 /* Finish out the statement-expression begun by the previous call to
70 begin_init_stmts. Returns the statement-expression itself. */
72 static tree
74 {
82 }
84 /* Constructors */
86 /* Called from initialize_vtbl_ptrs via dfs_walk. BINFO is the base
87 which we want to initialize the vtable pointer for, DATA is
88 TREE_LIST whose TREE_VALUE is the this ptr expression. */
90 static tree
92 {
97 {
101 tf_warning_or_error);
104 }
107 }
109 /* Initialize all the vtable pointers in the object pointed to by
110 ADDR. */
112 void
114 {
115 tree list;
116 tree type;
121 /* Walk through the hierarchy, initializing the vptr in each base
122 class. We do these in pre-order because we can't find the virtual
123 bases for a class until we've initialized the vtbl for that
124 class. */
126 }
128 /* Return an expression for the zero-initialization of an object with
129 type T. This expression will either be a constant (in the case
130 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
131 aggregate), or NULL (in the case that T does not require
132 initialization). In either case, the value can be used as
133 DECL_INITIAL for a decl of the indicated TYPE; it is a valid static
134 initializer. If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS
135 is the number of elements in the array. If STATIC_STORAGE_P is
136 TRUE, initializers are only generated for entities for which
137 zero-initialization does not simply mean filling the storage with
138 zero bytes. FIELD_SIZE, if non-NULL, is the bit size of the field,
139 subfields with bit positions at or above that bit size shouldn't
140 be added. Note that this only works when the result is assigned
141 to a base COMPONENT_REF; if we only have a pointer to the base subobject,
142 expand_assignment will end up clearing the full size of TYPE. */
144 static tree
146 tree field_size)
147 {
150 /* [dcl.init]
152 To zero-initialize an object of type T means:
154 -- if T is a scalar type, the storage is set to the value of zero
155 converted to T.
157 -- if T is a non-union class type, the storage for each nonstatic
158 data member and each base-class subobject is zero-initialized.
160 -- if T is a union type, the storage for its first data member is
161 zero-initialized.
163 -- if T is an array type, the storage for each element is
164 zero-initialized.
166 -- if T is a reference type, no initialization is performed. */
171 ;
173 /* In order to save space, we do not explicitly build initializers
174 for items that do not need them. GCC's semantics are that
175 items with static storage duration that are not otherwise
176 initialized are initialized to zero. */
177 ;
183 {
184 tree field;
187 /* Iterate over the fields, building initializations. */
189 {
193 /* Don't add virtual bases for base classes if they are beyond
194 the size of the current field, that means it is present
195 somewhere else in the object. */
197 {
202 }
204 /* Note that for class types there will be FIELD_DECLs
205 corresponding to base classes as well. Thus, iterating
206 over TYPE_FIELDs will result in correct initialization of
207 all of the subobjects. */
209 {
210 tree new_field_size
217 static_storage_p,
218 new_field_size);
221 }
223 /* For unions, only the first field is initialized. */
226 }
228 /* Build a constructor to contain the initializations. */
230 }
232 {
233 tree max_index;
236 /* Iterate over the array elements, building initializations. */
241 else
244 /* If we have an error_mark here, we should just return error mark
245 as we don't know the size of the array yet. */
250 /* A zero-sized array, which is accepted as an extension, will
251 have an upper bound of -1. */
253 {
254 constructor_elt ce;
256 /* If this is a one element array, we just use a regular init. */
259 else
261 max_index);
267 {
270 }
271 }
273 /* Build a constructor to contain the initializations. */
275 }
278 else
281 /* In all cases, the initializer is a constant. */
286 }
288 /* Return an expression for the zero-initialization of an object with
289 type T. This expression will either be a constant (in the case
290 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
291 aggregate), or NULL (in the case that T does not require
292 initialization). In either case, the value can be used as
293 DECL_INITIAL for a decl of the indicated TYPE; it is a valid static
294 initializer. If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS
295 is the number of elements in the array. If STATIC_STORAGE_P is
296 TRUE, initializers are only generated for entities for which
297 zero-initialization does not simply mean filling the storage with
298 zero bytes. */
300 tree
302 {
304 }
306 /* Return a suitable initializer for value-initializing an object of type
307 TYPE, as described in [dcl.init]. */
309 tree
311 {
312 /* [dcl.init]
314 To value-initialize an object of type T means:
316 - if T is a class type (clause 9) with a user-provided constructor
317 (12.1), then the default constructor for T is called (and the
318 initialization is ill-formed if T has no accessible default
319 constructor);
321 - if T is a non-union class type without a user-provided constructor,
322 then every non-static data member and base-class component of T is
323 value-initialized;92)
325 - if T is an array type, then each element is value-initialized;
327 - otherwise, the object is zero-initialized.
329 A program that calls for default-initialization or
330 value-initialization of an entity of reference type is ill-formed.
332 92) Value-initialization for such a class object may be implemented by
333 zero-initializing the object and then calling the default
334 constructor. */
336 /* The AGGR_INIT_EXPR tweaking below breaks in templates. */
341 {
342 /* Instead of the above, only consider the user-providedness of the
343 default constructor itself so value-initializing a class with an
344 explicitly defaulted default constructor and another user-provided
345 constructor works properly (c++std-core-19883). */
349 return build_aggr_init_expr
353 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. */
360 tree ctor = build_special_member_call
367 }
368 }
370 }
372 /* Like build_value_init, but don't call the constructor for TYPE. Used
373 for base initializers. */
375 tree
377 {
379 {
383 }
384 /* FIXME the class and array cases should just use digest_init once it is
385 SFINAE-enabled. */
387 {
391 {
392 tree field;
395 /* Iterate over the fields, building initializations. */
397 {
405 /* We could skip vfields and fields of types with
406 user-defined constructors, but I think that won't improve
407 performance at all; it should be simpler in general just
408 to zero out the entire object than try to only zero the
409 bits that actually need it. */
411 /* Note that for class types there will be FIELD_DECLs
412 corresponding to base classes as well. Thus, iterating
413 over TYPE_FIELDs will result in correct initialization of
414 all of the subobjects. */
422 }
424 /* Build a constructor to contain the zero- initializations. */
426 }
427 }
429 {
432 /* Iterate over the array elements, building initializations. */
435 /* If we have an error_mark here, we should just return error mark
436 as we don't know the size of the array yet. */
438 {
441 type);
443 }
446 /* A zero-sized array, which is accepted as an extension, will
447 have an upper bound of -1. */
449 {
450 constructor_elt ce;
452 /* If this is a one element array, we just use a regular init. */
455 else
460 {
467 /* We shouldn't have gotten here for anything that would need
468 non-trivial initialization, and gimplify_init_ctor_preeval
469 would need to be fixed to allow it. */
472 }
473 }
475 /* Build a constructor to contain the initializations. */
477 }
479 {
483 }
485 {
489 }
492 }
494 /* Initialize current class with INIT, a TREE_LIST of
495 arguments for a target constructor. If TREE_LIST is void_type_node,
496 an empty initializer list was given. */
498 static void
500 {
505 tf_warning_or_error));
507 {
509 LOOKUP_NORMAL
510 |LOOKUP_NONVIRTUAL
515 }
516 }
518 /* Initialize MEMBER, a FIELD_DECL, with INIT, a TREE_LIST of
519 arguments. If TREE_LIST is void_type_node, an empty initializer
520 list was given; if NULL_TREE no initializer was given. */
522 static void
524 {
525 tree decl;
528 /* Use the non-static data member initializer if there was no
529 mem-initializer for this field. */
531 {
533 /* Do deferred instantiation of the NSDMI. */
534 init = (tsubst_copy_and_build
539 else
540 {
543 {
547 }
548 /* Strip redundant TARGET_EXPR so we don't need to remap it, and
549 so the aggregate init code below will see a CONSTRUCTOR. */
554 }
555 }
560 /* Effective C++ rule 12 requires that all data members be
561 initialized. */
565 member);
567 /* Get an lvalue for the data member. */
571 tf_warning_or_error);
577 {
583 member);
584 }
587 {
588 /* mem() means value-initialization. */
590 {
594 }
595 else
596 {
602 }
603 }
604 /* Deal with this here, as we will get confused if we try to call the
605 assignment op for an anonymous union. This can happen in a
606 synthesized copy constructor. */
608 {
610 {
613 }
614 }
617 /* Pre-digested NSDMI. */
620 /* { } mem-initializer. */
626 {
627 /* With references and list-initialization, we need to deal with
628 extending temporary lifetimes. 12.2p5: "A temporary bound to a
629 reference member in a constructor’s ctor-initializer (12.6.2)
630 persists until the constructor exits." */
635 tf_warning_or_error);
637 {
642 }
645 /* A FIELD_DECL doesn't really have a suitable lifetime, but
646 make_temporary_var_for_ref_to_temp will treat it as automatic and
647 set_up_extended_ref_temp wants to use the decl in a warning. */
657 }
660 {
662 {
664 {
667 else
671 }
675 {
679 }
680 else
682 }
683 else
684 {
691 /* TYPE_NEEDS_CONSTRUCTING can be set just because we have a
692 vtable; still give this diagnostic. */
697 tf_warning_or_error));
698 }
699 }
700 else
701 {
703 {
704 tree core_type;
705 /* member traversal: note it leaves init NULL */
709 member);
723 }
725 /* There was an explicit member initialization. Do some work
726 in that case. */
728 tf_warning_or_error);
732 tf_warning_or_error));
733 }
736 {
737 tree expr;
742 tf_warning_or_error);
745 tf_warning_or_error);
749 }
750 }
752 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
753 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
755 static tree
757 {
758 tree fields;
760 /* Note whether or not T is a union. */
765 {
766 tree fieldtype;
768 /* Skip CONST_DECLs for enumeration constants and so forth. */
773 /* Keep track of whether or not any fields are unions. */
777 /* For an anonymous struct or union, we must recursively
778 consider the fields of the anonymous type. They can be
779 directly initialized from the constructor. */
781 {
782 /* Add this field itself. Synthesized copy constructors
783 initialize the entire aggregate. */
785 /* And now add the fields in the anonymous aggregate. */
787 }
788 /* Add this field. */
791 }
794 }
796 /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives
797 a FIELD_DECL or BINFO in T that needs initialization. The
798 TREE_VALUE gives the initializer, or list of initializer arguments.
800 Return a TREE_LIST containing all of the initializations required
801 for T, in the order in which they should be performed. The output
802 list has the same format as the input. */
804 static tree
806 {
807 tree init;
809 tree sorted_inits;
810 tree next_subobject;
815 /* Build up a list of initializations. The TREE_PURPOSE of entry
816 will be the subobject (a FIELD_DECL or BINFO) to initialize. The
817 TREE_VALUE will be the constructor arguments, or NULL if no
818 explicit initialization was provided. */
821 /* Process the virtual bases. */
826 /* Process the direct bases. */
832 /* Process the non-static data members. */
834 /* Reverse the entire list of initializations, so that they are in
835 the order that they will actually be performed. */
838 /* If the user presented the initializers in an order different from
839 that in which they will actually occur, we issue a warning. Keep
840 track of the next subobject which can be explicitly initialized
841 without issuing a warning. */
844 /* Go through the explicit initializers, filling in TREE_PURPOSE in
845 the SORTED_INITS. */
847 {
848 tree subobject;
849 tree subobject_init;
853 /* If the explicit initializers are in sorted order, then
854 SUBOBJECT will be NEXT_SUBOBJECT, or something following
855 it. */
857 subobject_init;
862 /* Issue a warning if the explicit initializer order does not
863 match that which will actually occur.
864 ??? Are all these on the correct lines? */
866 {
870 else
875 else
879 }
881 /* Look again, from the beginning of the list. */
883 {
887 }
889 /* It is invalid to initialize the same subobject more than
890 once. */
892 {
896 subobject);
897 else
900 subobject);
901 }
903 /* Record the initialization. */
906 }
908 /* [class.base.init]
910 If a ctor-initializer specifies more than one mem-initializer for
911 multiple members of the same union (including members of
912 anonymous unions), the ctor-initializer is ill-formed.
914 Here we also splice out uninitialized union members. */
916 {
920 {
921 tree field;
922 tree ctx;
928 /* Skip base classes. */
932 /* If this is an anonymous union with no explicit initializer,
933 splice it out. */
937 /* See if this field is a member of a union, or a member of a
938 structure contained in a union, etc. */
945 /* If this field is not a member of a union, skip it. */
949 /* If this union member has no explicit initializer and no NSDMI,
950 splice it out. */
953 else
956 /* It's only an error if we have two initializers for the same
957 union type. */
959 {
962 }
964 /* See if LAST_FIELD and the field initialized by INIT are
965 members of the same union. If so, there's a problem,
966 unless they're actually members of the same structure
967 which is itself a member of a union. For example, given:
969 union { struct { int i; int j; }; };
971 initializing both `i' and `j' makes sense. */
976 {
977 /* A mem-initializer hides an NSDMI. */
982 else
985 ctx);
986 }
990 next:
993 splice:
996 }
997 }
1000 }
1002 /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS
1003 is a TREE_LIST giving the explicit mem-initializer-list for the
1004 constructor. The TREE_PURPOSE of each entry is a subobject (a
1005 FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE
1006 is a TREE_LIST giving the arguments to the constructor or
1007 void_type_node for an empty list of arguments. */
1009 void
1011 {
1014 /* We will already have issued an error message about the fact that
1015 the type is incomplete. */
1022 {
1023 /* Delegating constructor. */
1027 }
1033 /* Sort the mem-initializers into the order in which the
1034 initializations should be performed. */
1039 /* Initialize base classes. */
1043 {
1047 /* We already have issued an error message. */
1052 {
1053 /* If these initializations are taking place in a copy constructor,
1054 the base class should probably be explicitly initialized if there
1055 is a user-defined constructor in the base class (other than the
1056 default constructor, which will be called anyway). */
1064 }
1066 /* Initialize the base. */
1069 else
1070 {
1071 tree base_addr;
1077 tf_warning_or_error),
1078 arguments,
1079 flags,
1080 tf_warning_or_error);
1082 }
1083 }
1086 /* Initialize the vptrs. */
1089 /* Initialize the data members. */
1091 {
1095 }
1096 }
1098 /* Returns the address of the vtable (i.e., the value that should be
1099 assigned to the vptr) for BINFO. */
1101 static tree
1103 {
1105 tree vtbl;
1108 /* If this is a virtual primary base, then the vtable we want to store
1109 is that for the base this is being used as the primary base of. We
1110 can't simply skip the initialization, because we may be expanding the
1111 inits of a subobject constructor where the virtual base layout
1112 can be different. */
1116 /* Figure out what vtable BINFO's vtable is based on, and mark it as
1117 used. */
1121 /* Now compute the address to use when initializing the vptr. */
1127 }
1129 /* This code sets up the virtual function tables appropriate for
1130 the pointer DECL. It is a one-ply initialization.
1132 BINFO is the exact type that DECL is supposed to be. In
1133 multiple inheritance, this might mean "C's A" if C : A, B. */
1135 static void
1137 {
1139 tree vtt_index;
1141 /* Compute the initializer for vptr. */
1144 /* We may get this vptr from a VTT, if this is a subobject
1145 constructor or subobject destructor. */
1148 {
1149 tree vtbl2;
1150 tree vtt_parm;
1152 /* Compute the value to use, when there's a VTT. */
1158 /* The actual initializer is the VTT value only in the subobject
1159 constructor. In maybe_clone_body we'll substitute NULL for
1160 the vtt_parm in the case of the non-subobject constructor. */
1165 vtbl2,
1166 vtbl);
1167 }
1169 /* Compute the location of the vtpr. */
1171 tf_warning_or_error),
1175 /* Assign the vtable to the vptr. */
1178 tf_warning_or_error));
1179 }
1181 /* If an exception is thrown in a constructor, those base classes already
1182 constructed must be destroyed. This function creates the cleanup
1183 for BINFO, which has just been constructed. If FLAG is non-NULL,
1184 it is a DECL which is nonzero when this base needs to be
1185 destroyed. */
1187 static void
1189 {
1190 tree expr;
1195 /* Call the destructor. */
1197 base_dtor_identifier,
1198 NULL,
1199 binfo,
1201 tf_warning_or_error);
1209 }
1211 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its
1212 constructor. */
1214 static void
1216 {
1217 tree inner_if_stmt;
1218 tree exp;
1219 tree flag;
1221 /* If there are virtual base classes with destructors, we need to
1222 emit cleanups to destroy them if an exception is thrown during
1223 the construction process. These exception regions (i.e., the
1224 period during which the cleanups must occur) begin from the time
1225 the construction is complete to the end of the function. If we
1226 create a conditional block in which to initialize the
1227 base-classes, then the cleanup region for the virtual base begins
1228 inside a block, and ends outside of that block. This situation
1229 confuses the sjlj exception-handling code. Therefore, we do not
1230 create a single conditional block, but one for each
1231 initialization. (That way the cleanup regions always begin
1232 in the outer block.) We trust the back end to figure out
1233 that the FLAG will not change across initializations, and
1234 avoid doing multiple tests. */
1239 /* Compute the location of the virtual base. If we're
1240 constructing virtual bases, then we must be the most derived
1241 class. Therefore, we don't have to look up the virtual base;
1242 we already know where it is. */
1251 }
1253 /* Find the context in which this FIELD can be initialized. */
1255 static tree
1257 {
1260 /* Anonymous union members can be initialized in the first enclosing
1261 non-anonymous union context. */
1265 }
1267 /* Function to give error message if member initialization specification
1268 is erroneous. FIELD is the member we decided to initialize.
1269 TYPE is the type for which the initialization is being performed.
1270 FIELD must be a member of TYPE.
1272 MEMBER_NAME is the name of the member. */
1274 static int
1276 {
1280 {
1282 member_name);
1284 }
1286 {
1289 field);
1291 }
1293 {
1297 }
1299 {
1301 member_name);
1303 }
1306 }
1308 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it
1309 is a _TYPE node or TYPE_DECL which names a base for that type.
1310 Check the validity of NAME, and return either the base _TYPE, base
1311 binfo, or the FIELD_DECL of the member. If NAME is invalid, return
1312 NULL_TREE and issue a diagnostic.
1314 An old style unnamed direct single base construction is permitted,
1315 where NAME is NULL. */
1317 tree
1319 {
1320 tree basetype;
1321 tree field;
1327 {
1328 /* This is an obsolete unnamed base class initializer. The
1329 parser will already have warned about its use. */
1331 {
1334 current_class_type);
1337 basetype = BINFO_TYPE
1342 current_class_type);
1344 }
1345 }
1347 {
1350 }
1353 else
1357 {
1358 tree class_binfo;
1359 tree direct_binfo;
1360 tree virtual_binfo;
1371 /* Look for a direct base. */
1376 /* Look for a virtual base -- unless the direct base is itself
1377 virtual. */
1381 /* [class.base.init]
1383 If a mem-initializer-id is ambiguous because it designates
1384 both a direct non-virtual base class and an inherited virtual
1385 base class, the mem-initializer is ill-formed. */
1387 {
1389 basetype);
1391 }
1394 {
1398 else
1402 }
1405 }
1406 else
1407 {
1410 else
1415 }
1418 }
1420 /* This is like `expand_member_init', only it stores one aggregate
1421 value into another.
1423 INIT comes in two flavors: it is either a value which
1424 is to be stored in EXP, or it is a parameter list
1425 to go to a constructor, which will operate on EXP.
1426 If INIT is not a parameter list for a constructor, then set
1427 LOOKUP_ONLYCONVERTING.
1428 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1429 the initializer, if FLAGS is 0, then it is the (init) form.
1430 If `init' is a CONSTRUCTOR, then we emit a warning message,
1431 explaining that such initializations are invalid.
1433 If INIT resolves to a CALL_EXPR which happens to return
1434 something of the type we are looking for, then we know
1435 that we can safely use that call to perform the
1436 initialization.
1438 The virtual function table pointer cannot be set up here, because
1439 we do not really know its type.
1441 This never calls operator=().
1443 When initializing, nothing is CONST.
1445 A default copy constructor may have to be used to perform the
1446 initialization.
1448 A constructor or a conversion operator may have to be used to
1449 perform the initialization, but not both, as it would be ambiguous. */
1451 tree
1453 {
1454 tree stmt_expr;
1455 tree compound_stmt;
1476 {
1477 tree itype;
1479 /* An array may not be initialized use the parenthesized
1480 initialization form -- unless the initializer is "()". */
1482 {
1486 }
1487 /* Must arrange to initialize each element of EXP
1488 from elements of INIT. */
1498 complain);
1505 }
1508 /* Just know that we've seen something for this node. */
1522 }
1524 static void
1526 tsubst_flags_t complain)
1527 {
1529 tree ctor_name;
1531 /* It fails because there may not be a constructor which takes
1532 its own type as the first (or only parameter), but which does
1533 take other types via a conversion. So, if the thing initializing
1534 the expression is a unit element of type X, first try X(X&),
1535 followed by initialization by X. If neither of these work
1536 out, then look hard. */
1537 tree rval;
1540 /* If we have direct-initialization from an initializer list, pull
1541 it out of the TREE_LIST so the code below can see it. */
1545 {
1549 }
1553 /* A brace-enclosed initializer for an aggregate. In C++0x this can
1554 happen for direct-initialization, too. */
1557 /* A CONSTRUCTOR of the target's type is a previously digested
1558 initializer, whether that happened just above or in
1559 cp_parser_late_parsing_nsdmi.
1561 A TARGET_EXPR with TARGET_EXPR_DIRECT_INIT_P or TARGET_EXPR_LIST_INIT_P
1562 set represents the whole initialization, so we shouldn't build up
1563 another ctor call. */
1570 {
1571 /* Early initialization via a TARGET_EXPR only works for
1572 complete objects. */
1579 }
1583 {
1584 /* Base subobjects should only get direct-initialization. */
1588 /* Do nothing. We hit this in two cases: Reference initialization,
1589 where we aren't initializing a real variable, so we don't want
1590 to run a new constructor; and catching an exception, where we
1591 have already built up the constructor call so we could wrap it
1593 else
1598 /* We need to protect the initialization of a catch parm with a
1599 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
1600 around the TARGET_EXPR for the copy constructor. See
1601 initialize_handler_parm. */
1602 {
1606 }
1607 else
1612 }
1617 {
1621 }
1622 else
1627 {
1628 /* Delegating constructor. */
1629 tree complete;
1630 tree base;
1633 /* Unshare the arguments for the second call. */
1636 {
1639 }
1642 complain);
1648 complain);
1653 base,
1654 complete);
1655 }
1656 else
1657 {
1660 else
1663 complain);
1664 }
1670 {
1673 {
1677 }
1678 }
1680 /* FIXME put back convert_to_void? */
1683 }
1685 /* This function is responsible for initializing EXP with INIT
1686 (if any).
1688 BINFO is the binfo of the type for who we are performing the
1689 initialization. For example, if W is a virtual base class of A and B,
1690 and C : A, B.
1691 If we are initializing B, then W must contain B's W vtable, whereas
1692 were we initializing C, W must contain C's W vtable.
1694 TRUE_EXP is nonzero if it is the true expression being initialized.
1695 In this case, it may be EXP, or may just contain EXP. The reason we
1696 need this is because if EXP is a base element of TRUE_EXP, we
1697 don't necessarily know by looking at EXP where its virtual
1698 baseclass fields should really be pointing. But we do know
1699 from TRUE_EXP. In constructors, we don't know anything about
1700 the value being initialized.
1702 FLAGS is just passed to `build_new_method_call'. See that function
1703 for its description. */
1705 static void
1707 tsubst_flags_t complain)
1708 {
1714 /* Use a function returning the desired type to initialize EXP for us.
1715 If the function is a constructor, and its first argument is
1716 NULL_TREE, know that it was meant for us--just slide exp on
1717 in and expand the constructor. Constructors now come
1718 as TARGET_EXPRs. */
1722 {
1724 /* If store_init_value returns NULL_TREE, the INIT has been
1725 recorded as the DECL_INITIAL for EXP. That means there's
1726 nothing more we have to do. */
1732 }
1734 /* If an explicit -- but empty -- initializer list was present,
1735 that's value-initialization. */
1737 {
1738 /* If the type has data but no user-provided ctor, we need to zero
1739 out the object. */
1742 {
1745 /* Don't clobber already initialized virtual bases. */
1748 field_size);
1751 }
1753 /* If we don't need to mess with the constructor at all,
1754 then we're done. */
1758 /* Otherwise fall through and call the constructor. */
1760 }
1762 /* We know that expand_default_init can handle everything we want
1763 at this point. */
1765 }
1767 /* Report an error if TYPE is not a user-defined, class type. If
1768 OR_ELSE is nonzero, give an error message. */
1770 int
1772 {
1777 {
1781 }
1783 }
1785 tree
1787 {
1793 else
1795 }
1797 /* Build a reference to a member of an aggregate. This is not a C++
1798 `&', but really something which can have its address taken, and
1799 then act as a pointer to member, for example TYPE :: FIELD can have
1800 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if
1801 this expression is the operand of "&".
1803 @@ Prints out lousy diagnostics for operator <typename>
1804 @@ fields.
1806 @@ This function should be rewritten and placed in search.c. */
1808 tree
1810 tsubst_flags_t complain)
1811 {
1812 tree decl;
1815 /* class templates can come in as TEMPLATE_DECLs here. */
1828 /* Callers should call mark_used before this point. */
1833 {
1837 }
1839 /* Entities other than non-static members need no further
1840 processing. */
1847 {
1851 }
1853 /* Set up BASEBINFO for member lookup. */
1856 /* A lot of this logic is now handled in lookup_member. */
1858 {
1859 /* Go from the TREE_BASELINK to the member function info. */
1863 {
1864 /* Get rid of a potential OVERLOAD around it. */
1867 /* Unique functions are handled easily. */
1869 /* For non-static member of base class, we need a special rule
1870 for access checking [class.protected]:
1872 If the access is to form a pointer to member, the
1873 nested-name-specifier shall name the derived class
1874 (or any class derived from that class). */
1878 complain);
1879 else
1881 complain);
1886 }
1887 else
1889 }
1891 /* We need additional test besides the one in
1892 check_accessibility_of_qualified_id in case it is
1893 a pointer to non-static member. */
1895 complain);
1898 {
1899 /* If MEMBER is non-static, then the program has fallen afoul of
1900 [expr.prim]:
1902 An id-expression that denotes a nonstatic data member or
1903 nonstatic member function of a class can only be used:
1905 -- as part of a class member access (_expr.ref_) in which the
1906 object-expression refers to the member's class or a class
1907 derived from that class, or
1909 -- to form a pointer to member (_expr.unary.op_), or
1911 -- in the body of a nonstatic member function of that class or
1912 of a class derived from that class (_class.mfct.nonstatic_), or
1914 -- in a mem-initializer for a constructor for that class or for
1915 a class derived from that class (_class.base.init_). */
1917 {
1918 /* Build a representation of the qualified name suitable
1919 for use as the operand to "&" -- even though the "&" is
1920 not actually present. */
1922 /* In Microsoft mode, treat a non-static member function as if
1923 it were a pointer-to-member. */
1925 {
1928 }
1933 }
1935 {
1939 }
1941 }
1946 }
1948 /* If DECL is a scalar enumeration constant or variable with a
1949 constant initializer, return the initializer (or, its initializers,
1950 recursively); otherwise, return DECL. If INTEGRAL_P, the
1951 initializer is only returned if DECL is an integral
1952 constant-expression. If RETURN_AGGREGATE_CST_OK_P, it is ok to
1953 return an aggregate constant. */
1955 static tree
1957 {
1959 || (integral_p
1963 {
1964 tree init;
1965 /* If DECL is a static data member in a template
1966 specialization, we must instantiate it here. The
1967 initializer for the static data member is not processed
1968 until needed; we need it now. */
1973 {
1975 /* Treat the error as a constant to avoid cascading errors on
1976 excessively recursive template instantiation (c++/9335). */
1978 else
1980 }
1981 /* Initializers in templates are generally expanded during
1982 instantiation, so before that for const int i(2)
1983 INIT is a TREE_LIST with the actual initializer as
1984 TREE_VALUE. */
1986 && init
1994 /* Unless RETURN_AGGREGATE_CST_OK_P is true, do not
1995 return an aggregate constant (of which string
1996 literals are a special case), as we do not want
1997 to make inadvertent copies of such entities, and
1998 we must be sure that their addresses are the
1999 same everywhere. */
2004 }
2006 }
2008 /* If DECL is a CONST_DECL, or a constant VAR_DECL initialized by
2009 constant of integral or enumeration type, then return that value.
2010 These are those variables permitted in constant expressions by
2011 [5.19/1]. */
2013 tree
2015 {
2018 }
2020 /* A more relaxed version of integral_constant_value, used by the
2021 common C/C++ code. */
2023 tree
2025 {
2028 }
2030 /* A version of integral_constant_value used by the C++ front end for
2031 optimization purposes. */
2033 tree
2035 {
2038 }
2039 \f
2040 /* Common subroutines of build_new and build_vec_delete. */
2042 /* Call the global __builtin_delete to delete ADDR. */
2044 static tree
2046 {
2049 }
2050 \f
2051 /* Build and return a NEW_EXPR. If NELTS is non-NULL, TYPE[NELTS] is
2052 the type of the object being allocated; otherwise, it's just TYPE.
2053 INIT is the initializer, if any. USE_GLOBAL_NEW is true if the
2054 user explicitly wrote "::operator new". PLACEMENT, if non-NULL, is
2055 a vector of arguments to be provided as arguments to a placement
2056 new operator. This routine performs no semantic checks; it just
2057 creates and returns a NEW_EXPR. */
2059 static tree
2062 {
2063 tree init_list;
2064 tree new_expr;
2066 /* If INIT is NULL, the we want to store NULL_TREE in the NEW_EXPR.
2067 If INIT is not NULL, then we want to store VOID_ZERO_NODE. This
2068 permits us to distinguish the case of a missing initializer "new
2069 int" from an empty initializer "new int()". */
2074 else
2079 init_list);
2084 }
2086 /* Diagnose uninitialized const members or reference members of type
2087 TYPE. USING_NEW is used to disambiguate the diagnostic between a
2088 new expression without a new-initializer and a declaration. Returns
2089 the error count. */
2091 static int
2094 {
2095 tree field;
2102 {
2103 tree field_type;
2114 {
2117 {
2121 else
2125 }
2126 }
2129 {
2132 {
2136 else
2140 }
2141 }
2144 error_count
2147 }
2149 }
2151 int
2153 {
2155 }
2157 /* Call __cxa_bad_array_new_length to indicate that the size calculation
2158 overflowed. Pretend it returns sizetype so that it plays nicely in the
2159 COND_EXPR. */
2161 tree
2163 {
2167 NULL_TREE));
2170 }
2172 /* Call __cxa_bad_array_length to indicate that there were too many
2173 initializers. */
2175 tree
2177 {
2181 NULL_TREE));
2184 }
2186 /* Generate code for a new-expression, including calling the "operator
2187 new" function, initializing the object, and, if an exception occurs
2188 during construction, cleaning up. The arguments are as for
2189 build_raw_new_expr. This may change PLACEMENT and INIT. */
2191 static tree
2194 tsubst_flags_t complain)
2195 {
2197 /* True iff this is a call to "operator new[]" instead of just
2198 "operator new". */
2200 /* If ARRAY_P is true, the element type of the array. This is never
2201 an ARRAY_TYPE; for something like "new int[3][4]", the
2202 ELT_TYPE is "int". If ARRAY_P is false, this is the same type as
2203 TYPE. */
2204 tree elt_type;
2205 /* The type of the new-expression. (This type is always a pointer
2206 type.) */
2207 tree pointer_type;
2208 tree non_const_pointer_type;
2210 /* For arrays, a bounds checks on the NELTS parameter. */
2215 /* Size of the inner array elements. */
2216 double_int inner_size;
2217 /* The address returned by the call to "operator new". This node is
2218 a VAR_DECL and is therefore reusable. */
2219 tree alloc_node;
2220 tree alloc_fn;
2224 /* If non-NULL, the number of extra bytes to allocate at the
2225 beginning of the storage allocated for an array-new expression in
2226 order to store the number of elements. */
2228 tree placement_first;
2230 /* True if the function we are calling is a placement allocation
2231 function. */
2233 /* True if the storage must be initialized, either by a constructor
2234 or due to an explicit new-initializer. */
2236 /* The address of the thing allocated, not including any cookie. In
2237 particular, if an array cookie is in use, DATA_ADDR is the
2238 address of the first array element. This node is a VAR_DECL, and
2239 is therefore reusable. */
2240 tree data_addr;
2244 {
2247 }
2249 {
2250 /* Transforms new (T[N]) to new T[N]. The former is a GNU
2251 extension for variable N. (This also covers new T where T is
2252 a VLA typedef.) */
2258 }
2260 /* If our base type is an array, then make sure we know how many elements
2261 it has. */
2265 {
2269 {
2275 {
2279 }
2281 }
2282 else
2283 {
2285 {
2289 }
2291 }
2295 inner_nelts_cst,
2296 complain);
2297 }
2300 {
2303 }
2308 /* Warn if we performed the (T[N]) to T[N] transformation and N is
2309 variable. */
2312 {
2316 else
2318 }
2321 {
2325 }
2333 {
2335 /* A program that calls for default-initialization [...] of an
2336 entity of reference type is ill-formed. */
2340 /* A new-expression that creates an object of type T initializes
2341 that object as follows:
2342 - If the new-initializer is omitted:
2343 -- If T is a (possibly cv-qualified) non-POD class type
2344 (or array thereof), the object is default-initialized (8.5).
2345 [...]
2346 -- Otherwise, the object created has indeterminate
2347 value. If T is a const-qualified type, or a (possibly
2348 cv-qualified) POD class type (or array thereof)
2349 containing (directly or indirectly) a member of
2350 const-qualified type, the program is ill-formed; */
2360 }
2364 {
2368 }
2372 {
2373 /* Maximum available size in bytes. Half of the address space
2374 minus the cookie size. */
2375 double_int max_size
2377 HOST_BITS_PER_DOUBLE_INT);
2378 /* Maximum number of outer elements which can be allocated. */
2379 double_int max_outer_nelts;
2380 tree max_outer_nelts_tree;
2386 /* Unconditionally substract the cookie size. This decreases the
2387 maximum object size and is safe even if we choose not to use
2388 a cookie after all. */
2394 {
2398 }
2400 /* Only keep the top-most seven bits, to simplify encoding the
2401 constant in the instruction stream. */
2402 {
2406 max_outer_nelts
2409 }
2414 outer_nelts,
2415 max_outer_nelts_tree);
2416 }
2420 /* If PLACEMENT is a single simple pointer type not passed by
2421 reference, prepare to capture it in a temporary variable. Do
2422 this now, since PLACEMENT will change in the calls below. */
2428 /* Allocate the object. */
2430 {
2431 tree class_addr;
2441 {
2445 }
2447 {
2451 }
2456 }
2458 {
2461 }
2462 else
2463 {
2464 tree fnname;
2465 tree fns;
2471 && (array_p
2474 {
2475 /* Use a class-specific operator new. */
2476 /* If a cookie is required, add some extra space. */
2479 else
2480 {
2482 /* No size arithmetic necessary, so the size check is
2483 not needed. */
2486 }
2487 /* Perform the overflow check. */
2494 /* Create the argument list. */
2496 /* Do name-lookup to find the appropriate operator. */
2499 {
2503 }
2505 {
2507 {
2510 }
2512 }
2516 LOOKUP_NORMAL,
2518 complain);
2519 }
2520 else
2521 {
2522 /* Use a global operator new. */
2523 /* See if a cookie might be required. */
2525 {
2527 /* No size arithmetic necessary, so the size check is
2528 not needed. */
2531 }
2535 outer_nelts_check,
2537 }
2538 }
2545 /* If we found a simple case of PLACEMENT_EXPR above, then copy it
2546 into a temporary variable. */
2553 {
2558 {
2562 }
2563 }
2565 /* In the simple case, we can stop now. */
2570 /* Store the result of the allocation call in a variable so that we can
2571 use it more than once. */
2575 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */
2579 /* Now, check to see if this function is actually a placement
2580 allocation function. This can happen even when PLACEMENT is NULL
2581 because we might have something like:
2583 struct S { void* operator new (size_t, int i = 0); };
2585 A call to `new S' will get this allocation function, even though
2586 there is no explicit placement argument. If there is more than
2587 one argument, or there are variable arguments, then this is a
2588 placement allocation function. */
2589 placement_allocation_fn_p
2593 /* Preevaluate the placement args so that we don't reevaluate them for a
2594 placement delete. */
2596 {
2597 tree inits;
2601 alloc_expr);
2602 }
2604 /* unless an allocation function is declared with an empty excep-
2605 tion-specification (_except.spec_), throw(), it indicates failure to
2606 allocate storage by throwing a bad_alloc exception (clause _except_,
2607 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2608 cation function is declared with an empty exception-specification,
2609 throw(), it returns null to indicate failure to allocate storage and a
2610 non-null pointer otherwise.
2612 So check for a null exception spec on the op new we just called. */
2618 {
2619 tree cookie;
2620 tree cookie_ptr;
2621 tree size_ptr_type;
2623 /* Adjust so we're pointing to the start of the object. */
2626 /* Store the number of bytes allocated so that we can know how
2627 many elements to destroy later. We use the last sizeof
2628 (size_t) bytes to store the number of elements. */
2639 {
2640 /* Also store the element size. */
2651 }
2652 }
2653 else
2654 {
2657 }
2659 /* Now use a pointer to the type we've actually allocated. */
2661 /* But we want to operate on a non-const version to start with,
2662 since we'll be modifying the elements. */
2663 non_const_pointer_type = build_pointer_type
2667 /* Any further uses of alloc_node will want this type, too. */
2670 /* Now initialize the allocated object. Note that we preevaluate the
2671 initialization expression, apart from the actual constructor call or
2672 assignment--we do this because we want to delay the allocation as long
2673 as possible in order to minimize the size of the exception region for
2674 placement delete. */
2676 {
2681 {
2684 }
2687 {
2688 /* build_value_init doesn't work in templates, and we don't need
2689 the initializer anyway since we're going to throw it away and
2690 rebuild it at instantiation time, so just build up a single
2691 constructor call to get any appropriate diagnostics. */
2695 complete_ctor_identifier,
2697 LOOKUP_NORMAL,
2698 complain);
2700 }
2702 {
2707 {
2711 else
2712 {
2716 complain);
2717 else
2718 /* We'll check the length at runtime. */
2722 }
2723 }
2725 {
2729 else
2732 }
2733 init_expr
2737 integer_one_node,
2738 complain),
2739 vecinit,
2740 explicit_value_init_p,
2742 complain);
2744 /* An array initialization is stable because the initialization
2745 of each element is a full-expression, so the temporaries don't
2746 leak out. */
2748 }
2749 else
2750 {
2754 {
2756 complete_ctor_identifier,
2758 LOOKUP_NORMAL,
2759 complain);
2760 }
2762 {
2763 /* Something like `new int()'. */
2768 }
2769 else
2770 {
2771 tree ie;
2773 /* We are processing something like `new int (10)', which
2774 means allocate an int, and initialize it with 10. */
2777 complain);
2779 complain);
2780 }
2782 }
2787 /* If any part of the object initialization terminates by throwing an
2788 exception and a suitable deallocation function can be found, the
2789 deallocation function is called to free the memory in which the
2790 object was being constructed, after which the exception continues
2791 to propagate in the context of the new-expression. If no
2792 unambiguous matching deallocation function can be found,
2793 propagating the exception does not cause the object's memory to be
2794 freed. */
2796 {
2798 tree cleanup;
2800 /* The Standard is unclear here, but the right thing to do
2801 is to use the same method for finding deallocation
2802 functions that we use for finding allocation functions. */
2803 cleanup = (build_op_delete_call
2805 alloc_node,
2806 size,
2807 globally_qualified_p,
2809 alloc_fn,
2810 complain));
2815 /* This is much simpler if we were able to preevaluate all of
2816 the arguments to the constructor call. */
2817 {
2818 /* CLEANUP is compiler-generated, so no diagnostics. */
2822 /* Likewise, this try-catch is compiler-generated. */
2824 }
2825 else
2826 /* Ack! First we allocate the memory. Then we set our sentry
2827 variable to true, and expand a cleanup that deletes the
2828 memory if sentry is true. Then we run the constructor, and
2829 finally clear the sentry.
2831 We need to do this because we allocate the space first, so
2832 if there are any temporaries with cleanups in the
2833 constructor args and we weren't able to preevaluate them, we
2834 need this EH region to extend until end of full-expression
2835 to preserve nesting. */
2836 {
2844 /* CLEANUP is compiler-generated, so no diagnostics. */
2854 init_expr
2857 end));
2858 /* Likewise, this is compiler-generated. */
2860 }
2861 }
2862 }
2863 else
2866 /* Now build up the return value in reverse order. */
2876 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
2877 and return the call (which doesn't need to be adjusted). */
2879 else
2880 {
2882 {
2885 nullptr_node,
2886 complain);
2889 }
2891 /* Perform the allocation before anything else, so that ALLOC_NODE
2892 has been initialized before we start using it. */
2894 }
2899 /* A new-expression is never an lvalue. */
2903 }
2905 /* Generate a representation for a C++ "new" expression. *PLACEMENT
2906 is a vector of placement-new arguments (or NULL if none). If NELTS
2907 is NULL, TYPE is the type of the storage to be allocated. If NELTS
2908 is not NULL, then this is an array-new allocation; TYPE is the type
2909 of the elements in the array and NELTS is the number of elements in
2910 the array. *INIT, if non-NULL, is the initializer for the new
2911 object, or an empty vector to indicate an initializer of "()". If
2912 USE_GLOBAL_NEW is true, then the user explicitly wrote "::new"
2913 rather than just "new". This may change PLACEMENT and INIT. */
2915 tree
2918 {
2919 tree rval;
2928 /* Don't do auto deduction where it might affect mangling. */
2930 {
2933 {
2937 }
2938 }
2941 {
2948 use_global_new);
2959 }
2962 {
2964 {
2967 else
2969 }
2972 }
2974 /* ``A reference cannot be created by the new operator. A reference
2975 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
2976 returned by new.'' ARM 5.3.3 */
2978 {
2981 else
2984 }
2987 {
2991 }
2993 /* The type allocated must be complete. If the new-type-id was
2994 "T[N]" then we are just checking that "T" is complete here, but
2995 that is equivalent, since the value of "N" doesn't matter. */
3004 {
3010 }
3012 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
3017 }
3019 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
3021 tree
3023 {
3029 {
3032 {
3035 }
3037 }
3039 /* Mangle the class$ field. */
3040 {
3041 tree field;
3044 {
3048 }
3050 {
3053 }
3054 }
3058 {
3068 }
3070 }
3071 \f
3072 static tree
3074 special_function_kind auto_delete_vec,
3076 {
3077 tree virtual_size;
3081 /* Temporary variables used by the loop. */
3084 /* This is the body of the loop that implements the deletion of a
3085 single element, and moves temp variables to next elements. */
3086 tree body;
3088 /* This is the LOOP_EXPR that governs the deletion of the elements. */
3091 /* This is the thing that governs what to do after the loop has run. */
3094 /* This is the BIND_EXPR which holds the outermost iterator of the
3095 loop. It is convenient to set this variable up and test it before
3096 executing any other code in the loop.
3097 This is also the containing expression returned by this function. */
3099 tree tmp;
3101 /* We should only have 1-D arrays here. */
3110 /* The below is short by the cookie size. */
3115 tbase_init
3119 base),
3120 virtual_size),
3121 complain);
3139 complain);
3147 no_destructor:
3148 /* Delete the storage if appropriate. */
3150 {
3151 tree base_tbd;
3153 /* The below is short by the cookie size. */
3158 /* no header */
3160 else
3161 {
3162 tree cookie_size;
3166 MINUS_EXPR,
3169 cookie_size,
3170 complain);
3174 /* True size with header. */
3176 }
3183 complain);
3184 }
3188 ;
3191 else
3197 /* Outermost wrapper: If pointer is null, punt. */
3202 nullptr_node)),
3207 {
3210 }
3213 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
3217 }
3219 /* Create an unnamed variable of the indicated TYPE. */
3221 tree
3223 {
3224 tree decl;
3234 }
3236 /* Create a new temporary variable of the indicated TYPE, initialized
3237 to INIT.
3239 It is not entered into current_binding_level, because that breaks
3240 things when it comes time to do final cleanups (which take place
3241 "outside" the binding contour of the function). */
3243 tree
3245 {
3246 tree decl;
3252 tf_warning_or_error));
3255 }
3257 /* `build_vec_init' returns tree structure that performs
3258 initialization of a vector of aggregate types.
3260 BASE is a reference to the vector, of ARRAY_TYPE, or a pointer
3261 to the first element, of POINTER_TYPE.
3262 MAXINDEX is the maximum index of the array (one less than the
3263 number of elements). It is only used if BASE is a pointer or
3264 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
3266 INIT is the (possibly NULL) initializer.
3268 If EXPLICIT_VALUE_INIT_P is true, then INIT must be NULL. All
3269 elements in the array are value-initialized.
3271 FROM_ARRAY is 0 if we should init everything with INIT
3272 (i.e., every element initialized from INIT).
3273 FROM_ARRAY is 1 if we should index into INIT in parallel
3274 with initialization of DECL.
3275 FROM_ARRAY is 2 if we should index into INIT in parallel,
3276 but use assignment instead of initialization. */
3278 tree
3282 {
3283 tree rval;
3286 tree iterator;
3287 /* The type of BASE. */
3289 /* The type of an element in the array. */
3291 /* The element type reached after removing all outer array
3292 types. */
3293 tree inner_elt_type;
3294 /* The type of a pointer to an element in the array. */
3295 tree ptype;
3296 tree stmt_expr;
3297 tree compound_stmt;
3319 /* Look through the TARGET_EXPR around a compound literal. */
3325 /* If we have a braced-init-list, make sure that the array
3326 is big enough for all the initializers. */
3340 /* Don't do this if the CONSTRUCTOR might contain something
3341 that might throw and require us to clean up. */
3345 {
3346 /* Do non-default initialization of trivial arrays resulting from
3347 brace-enclosed initializers. In this case, digest_init and
3348 store_constructor will handle the semantics for us. */
3354 stmt_expr);
3356 }
3360 {
3366 }
3367 else
3370 /* The code we are generating looks like:
3371 ({
3372 T* t1 = (T*) base;
3373 T* rval = t1;
3374 ptrdiff_t iterator = maxindex;
3375 try {
3376 for (; iterator != -1; --iterator) {
3377 ... initialize *t1 ...
3378 ++t1;
3379 }
3380 } catch (...) {
3381 ... destroy elements that were constructed ...
3382 }
3383 rval;
3384 })
3386 We can omit the try and catch blocks if we know that the
3387 initialization will never throw an exception, or if the array
3388 elements do not have destructors. We can omit the loop completely if
3389 the elements of the array do not have constructors.
3391 We actually wrap the entire body of the above in a STMT_EXPR, for
3392 tidiness.
3394 When copying from array to another, when the array elements have
3395 only trivial copy constructors, we should use __builtin_memcpy
3396 rather than generating a loop. That way, we could take advantage
3397 of whatever cleverness the back end has for dealing with copies
3398 of blocks of memory. */
3407 /* If initializing one array from another, initialize element by
3408 element. We rely upon the below calls to do the argument
3409 checking. Evaluate the initializer before entering the try block. */
3411 {
3420 }
3422 /* Protect the entire array initialization so that we can destroy
3423 the partially constructed array if an exception is thrown.
3424 But don't do this if we're assigning. */
3427 {
3429 }
3431 /* If the initializer is {}, then all elements are initialized from {}.
3432 But for non-classes, that's the same as value-initialization. */
3435 {
3438 else
3439 {
3442 }
3443 }
3445 /* Maybe pull out constant value when from_array? */
3448 {
3449 /* Do non-default initialization of non-trivial arrays resulting from
3450 brace-enclosed initializers. */
3453 /* Should we try to create a constant initializer? */
3457 /* If the constructor already has the array type, it's been through
3458 digest_init, so we shouldn't try to do anything more. */
3462 /* If we're initializing a static array, we want to do static
3463 initialization of any elements with constant initializers even if
3464 some are non-constant. */
3470 {
3471 tree throw_call;
3474 else
3479 }
3483 else
3487 {
3489 tree one_init;
3491 num_initialized_elts++;
3498 else
3504 {
3513 {
3517 else
3520 }
3521 else
3522 {
3524 {
3529 }
3531 }
3532 }
3541 else
3545 complain);
3548 else
3550 }
3553 {
3558 else
3560 }
3562 /* Clear out INIT so that we don't get confused below. */
3564 }
3566 {
3571 {
3575 }
3576 }
3578 /* Now, default-initialize any remaining elements. We don't need to
3579 do that if a) the type does not need constructing, or b) we've
3580 already initialized all the elements.
3582 We do need to keep going if we're copying an array. */
3587 && (num_initialized_elts
3589 {
3590 /* If the ITERATOR is equal to -1, then we don't have to loop;
3591 we've already initialized all the elements. */
3592 tree for_stmt;
3593 tree elt_init;
3594 tree to;
3600 for_stmt);
3602 complain);
3610 {
3611 tree from;
3614 {
3618 }
3619 else
3624 complain);
3629 complain);
3630 else
3632 }
3634 {
3636 sorry
3640 explicit_value_init_p,
3642 }
3644 {
3648 }
3649 else
3650 {
3654 else
3655 {
3658 complain);
3660 }
3661 }
3671 complain));
3674 complain));
3677 }
3679 /* Make sure to cleanup any partially constructed elements. */
3682 {
3683 tree e;
3686 complain);
3688 /* Flatten multi-dimensional array since build_vec_delete only
3689 expects one-dimensional array. */
3693 /* Avoid mixing signed and unsigned. */
3696 complain);
3705 }
3707 /* The value of the array initialization is the array itself, RVAL
3708 is a pointer to the first element. */
3713 /* Now make the result have the correct type. */
3715 {
3720 }
3729 }
3731 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
3732 build_delete. */
3734 static tree
3736 tsubst_flags_t complain)
3737 {
3738 tree name;
3739 tree fn;
3741 {
3756 }
3761 flags,
3763 complain);
3764 }
3766 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
3767 ADDR is an expression which yields the store to be destroyed.
3768 AUTO_DELETE is the name of the destructor to call, i.e., either
3769 sfk_complete_destructor, sfk_base_destructor, or
3770 sfk_deleting_destructor.
3772 FLAGS is the logical disjunction of zero or more LOOKUP_
3773 flags. See cp-tree.h for more info. */
3775 tree
3778 {
3779 tree expr;
3784 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
3785 set to `error_mark_node' before it gets properly cleaned up. */
3794 {
3801 /* We don't want to warn about delete of void*, only other
3802 incomplete types. Deleting other incomplete types
3803 invokes undefined behavior, but it is not ill-formed, so
3804 compile to something that would even do The Right Thing
3805 (TM) should the type have a trivial dtor and no delete
3806 operator. */
3808 {
3811 {
3815 {
3818 "operator delete will be called, even if they are "
3820 }
3822 }
3826 {
3827 tree dtor;
3830 {
3833 "deleting object of abstract class type %qT"
3834 " which has non-virtual destructor"
3836 else
3838 "deleting object of polymorphic class type %qT"
3839 " which has non-virtual destructor"
3841 }
3842 }
3843 }
3845 /* Call the builtin operator delete. */
3850 /* Throw away const and volatile on target type of addr. */
3852 }
3854 {
3855 handle_array:
3858 {
3862 }
3865 }
3866 else
3867 {
3868 /* Don't check PROTECT here; leave that decision to the
3869 destructor. If the destructor is accessible, call it,
3870 else report error. */
3878 }
3883 {
3889 use_global_delete,
3892 complain);
3893 }
3894 else
3895 {
3898 tree ifexp;
3903 /* For `::delete x', we must not use the deleting destructor
3904 since then we would not be sure to get the global `operator
3905 delete'. */
3907 {
3908 /* We will use ADDR multiple times so we must save it. */
3911 /* Delete the object. */
3913 /* Otherwise, treat this like a complete object destructor
3914 call. */
3916 }
3917 /* If the destructor is non-virtual, there is no deleting
3918 variant. Instead, we must explicitly call the appropriate
3919 `operator delete' here. */
3922 {
3923 /* We will use ADDR multiple times so we must save it. */
3925 /* Build the call. */
3927 addr,
3932 complain);
3933 /* Call the complete object destructor. */
3935 }
3938 {
3939 /* Make sure we have access to the member op delete, even though
3940 we'll actually be calling it from the destructor. */
3945 complain);
3946 }
3955 /* We need to calculate this before the dtor changes the vptr. */
3960 /* Explicit destructor call; don't check for null pointer. */
3962 else
3963 {
3964 /* Handle deleting a null pointer. */
3967 complain));
3970 }
3977 }
3978 }
3980 /* At the beginning of a destructor, push cleanups that will call the
3981 destructors for our base classes and members.
3983 Called from begin_destructor_body. */
3985 void
3987 {
3990 tree member;
3991 tree expr;
3994 /* Run destructors for all virtual baseclasses. */
3996 {
3997 tree cond = (condition_conversion
3999 current_in_charge_parm,
4000 integer_two_node)));
4002 /* The CLASSTYPE_VBASECLASSES vector is in initialization
4003 order, which is also the right order for pushing cleanups. */
4006 {
4008 {
4010 base_dtor_identifier,
4011 NULL,
4012 base_binfo,
4013 (LOOKUP_NORMAL
4015 tf_warning_or_error);
4019 }
4020 }
4021 }
4023 /* Take care of the remaining baseclasses. */
4026 {
4032 base_dtor_identifier,
4035 tf_warning_or_error);
4037 }
4039 /* Don't automatically destroy union members. */
4045 {
4054 {
4055 tree this_member = (build_class_member_access_expr
4059 tf_warning_or_error));
4061 sfk_complete_destructor,
4065 }
4066 }
4067 }
4069 /* Build a C++ vector delete expression.
4070 MAXINDEX is the number of elements to be deleted.
4071 ELT_SIZE is the nominal size of each element in the vector.
4072 BASE is the expression that should yield the store to be deleted.
4073 This function expands (or synthesizes) these calls itself.
4074 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
4076 This also calls delete for virtual baseclasses of elements of the vector.
4078 Update: MAXINDEX is no longer needed. The size can be extracted from the
4079 start of the vector for pointers, and from the type for arrays. We still
4080 use MAXINDEX for arrays because it happens to already have one of the
4081 values we'd have to extract. (We could use MAXINDEX with pointers to
4082 confirm the size, and trap if the numbers differ; not clear that it'd
4083 be worth bothering.) */
4085 tree
4087 special_function_kind auto_delete_vec,
4089 {
4090 tree type;
4091 tree rval;
4097 {
4098 /* Step back one from start of vector, and read dimension. */
4099 tree cookie_addr;
4103 {
4106 }
4111 cookie_addr);
4113 }
4115 {
4116 /* Get the total number of things in the array, maxindex is a
4117 bad name. */
4124 {
4127 }
4128 }
4129 else
4130 {
4134 }
4142 }