| blob | f85776c5ec7581e0df91e875ff62db3131dcee13 |
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. */
343 {
344 tree ctor = build_aggr_init_expr
348 complain));
353 {
354 /* This is a class that needs constructing, but doesn't have
355 a user-provided constructor. So we need to zero-initialize
356 the object and then call the implicitly defined ctor.
357 This will be handled in simplify_aggr_init_expr. */
360 }
361 }
363 /* Discard any access checking during subobject initialization;
364 the checks are implied by the call to the ctor which we have
365 verified is OK (cpp0x/defaulted46.C). */
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 {
392 {
393 tree field;
396 /* Iterate over the fields, building initializations. */
398 {
409 /* We could skip vfields and fields of types with
410 user-defined constructors, but I think that won't improve
411 performance at all; it should be simpler in general just
412 to zero out the entire object than try to only zero the
413 bits that actually need it. */
415 /* Note that for class types there will be FIELD_DECLs
416 corresponding to base classes as well. Thus, iterating
417 over TYPE_FIELDs will result in correct initialization of
418 all of the subobjects. */
426 }
428 /* Build a constructor to contain the zero- initializations. */
430 }
431 }
433 {
436 /* Iterate over the array elements, building initializations. */
439 /* If we have an error_mark here, we should just return error mark
440 as we don't know the size of the array yet. */
442 {
445 type);
447 }
450 /* A zero-sized array, which is accepted as an extension, will
451 have an upper bound of -1. */
453 {
454 constructor_elt ce;
456 /* If this is a one element array, we just use a regular init. */
459 else
464 {
471 /* We shouldn't have gotten here for anything that would need
472 non-trivial initialization, and gimplify_init_ctor_preeval
473 would need to be fixed to allow it. */
476 }
477 }
479 /* Build a constructor to contain the initializations. */
481 }
483 {
487 }
489 {
493 }
496 }
498 /* Initialize current class with INIT, a TREE_LIST of
499 arguments for a target constructor. If TREE_LIST is void_type_node,
500 an empty initializer list was given. */
502 static void
504 {
510 tf_warning_or_error));
512 {
514 LOOKUP_NORMAL
515 |LOOKUP_NONVIRTUAL
521 }
522 }
524 /* Initialize MEMBER, a FIELD_DECL, with INIT, a TREE_LIST of
525 arguments. If TREE_LIST is void_type_node, an empty initializer
526 list was given; if NULL_TREE no initializer was given. */
528 static void
530 {
531 tree decl;
534 /* Use the non-static data member initializer if there was no
535 mem-initializer for this field. */
537 {
539 /* Do deferred instantiation of the NSDMI. */
540 init = (tsubst_copy_and_build
545 else
546 {
549 {
553 }
554 /* Strip redundant TARGET_EXPR so we don't need to remap it, and
555 so the aggregate init code below will see a CONSTRUCTOR. */
560 }
561 }
566 /* Effective C++ rule 12 requires that all data members be
567 initialized. */
571 member);
573 /* Get an lvalue for the data member. */
577 tf_warning_or_error);
583 {
589 member);
590 }
593 {
594 /* mem() means value-initialization. */
596 {
600 }
601 else
602 {
608 }
609 }
610 /* Deal with this here, as we will get confused if we try to call the
611 assignment op for an anonymous union. This can happen in a
612 synthesized copy constructor. */
614 {
616 {
619 }
620 }
623 /* Pre-digested NSDMI. */
626 /* { } mem-initializer. */
632 {
633 /* With references and list-initialization, we need to deal with
634 extending temporary lifetimes. 12.2p5: "A temporary bound to a
635 reference member in a constructor’s ctor-initializer (12.6.2)
636 persists until the constructor exits." */
641 tf_warning_or_error);
643 {
648 }
651 /* A FIELD_DECL doesn't really have a suitable lifetime, but
652 make_temporary_var_for_ref_to_temp will treat it as automatic and
653 set_up_extended_ref_temp wants to use the decl in a warning. */
663 }
666 {
668 {
670 {
673 else
677 }
681 {
685 }
686 else
688 }
689 else
690 {
697 /* TYPE_NEEDS_CONSTRUCTING can be set just because we have a
698 vtable; still give this diagnostic. */
703 tf_warning_or_error));
704 }
705 }
706 else
707 {
709 {
710 tree core_type;
711 /* member traversal: note it leaves init NULL */
715 member);
729 }
731 /* There was an explicit member initialization. Do some work
732 in that case. */
734 tf_warning_or_error);
738 tf_warning_or_error));
739 }
742 {
743 tree expr;
748 tf_warning_or_error);
751 tf_warning_or_error);
756 }
757 }
759 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
760 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
762 static tree
764 {
765 tree fields;
767 /* Note whether or not T is a union. */
772 {
773 tree fieldtype;
775 /* Skip CONST_DECLs for enumeration constants and so forth. */
780 /* Keep track of whether or not any fields are unions. */
784 /* For an anonymous struct or union, we must recursively
785 consider the fields of the anonymous type. They can be
786 directly initialized from the constructor. */
788 {
789 /* Add this field itself. Synthesized copy constructors
790 initialize the entire aggregate. */
792 /* And now add the fields in the anonymous aggregate. */
794 }
795 /* Add this field. */
798 }
801 }
803 /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives
804 a FIELD_DECL or BINFO in T that needs initialization. The
805 TREE_VALUE gives the initializer, or list of initializer arguments.
807 Return a TREE_LIST containing all of the initializations required
808 for T, in the order in which they should be performed. The output
809 list has the same format as the input. */
811 static tree
813 {
814 tree init;
816 tree sorted_inits;
817 tree next_subobject;
822 /* Build up a list of initializations. The TREE_PURPOSE of entry
823 will be the subobject (a FIELD_DECL or BINFO) to initialize. The
824 TREE_VALUE will be the constructor arguments, or NULL if no
825 explicit initialization was provided. */
828 /* Process the virtual bases. */
833 /* Process the direct bases. */
839 /* Process the non-static data members. */
841 /* Reverse the entire list of initializations, so that they are in
842 the order that they will actually be performed. */
845 /* If the user presented the initializers in an order different from
846 that in which they will actually occur, we issue a warning. Keep
847 track of the next subobject which can be explicitly initialized
848 without issuing a warning. */
851 /* Go through the explicit initializers, filling in TREE_PURPOSE in
852 the SORTED_INITS. */
854 {
855 tree subobject;
856 tree subobject_init;
860 /* If the explicit initializers are in sorted order, then
861 SUBOBJECT will be NEXT_SUBOBJECT, or something following
862 it. */
864 subobject_init;
869 /* Issue a warning if the explicit initializer order does not
870 match that which will actually occur.
871 ??? Are all these on the correct lines? */
873 {
877 else
882 else
886 }
888 /* Look again, from the beginning of the list. */
890 {
894 }
896 /* It is invalid to initialize the same subobject more than
897 once. */
899 {
903 subobject);
904 else
907 subobject);
908 }
910 /* Record the initialization. */
913 }
915 /* [class.base.init]
917 If a ctor-initializer specifies more than one mem-initializer for
918 multiple members of the same union (including members of
919 anonymous unions), the ctor-initializer is ill-formed.
921 Here we also splice out uninitialized union members. */
923 {
927 {
928 tree field;
929 tree ctx;
935 /* Skip base classes. */
939 /* If this is an anonymous union with no explicit initializer,
940 splice it out. */
944 /* See if this field is a member of a union, or a member of a
945 structure contained in a union, etc. */
952 /* If this field is not a member of a union, skip it. */
956 /* If this union member has no explicit initializer and no NSDMI,
957 splice it out. */
960 else
963 /* It's only an error if we have two initializers for the same
964 union type. */
966 {
969 }
971 /* See if LAST_FIELD and the field initialized by INIT are
972 members of the same union. If so, there's a problem,
973 unless they're actually members of the same structure
974 which is itself a member of a union. For example, given:
976 union { struct { int i; int j; }; };
978 initializing both `i' and `j' makes sense. */
983 {
984 /* A mem-initializer hides an NSDMI. */
989 else
990 {
993 ctx);
995 }
996 }
1000 next:
1003 splice:
1006 }
1007 }
1010 }
1012 /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS
1013 is a TREE_LIST giving the explicit mem-initializer-list for the
1014 constructor. The TREE_PURPOSE of each entry is a subobject (a
1015 FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE
1016 is a TREE_LIST giving the arguments to the constructor or
1017 void_type_node for an empty list of arguments. */
1019 void
1021 {
1024 /* We will already have issued an error message about the fact that
1025 the type is incomplete. */
1032 {
1033 /* Delegating constructor. */
1037 }
1043 /* Sort the mem-initializers into the order in which the
1044 initializations should be performed. */
1049 /* Initialize base classes. */
1053 {
1057 /* We already have issued an error message. */
1062 {
1063 /* If these initializations are taking place in a copy constructor,
1064 the base class should probably be explicitly initialized if there
1065 is a user-defined constructor in the base class (other than the
1066 default constructor, which will be called anyway). */
1074 }
1076 /* Initialize the base. */
1079 else
1080 {
1081 tree base_addr;
1087 tf_warning_or_error),
1088 arguments,
1089 flags,
1090 tf_warning_or_error);
1092 }
1093 }
1096 /* Initialize the vptrs. */
1099 /* Initialize the data members. */
1101 {
1105 }
1106 }
1108 /* Returns the address of the vtable (i.e., the value that should be
1109 assigned to the vptr) for BINFO. */
1111 tree
1113 {
1115 tree vtbl;
1118 /* If this is a virtual primary base, then the vtable we want to store
1119 is that for the base this is being used as the primary base of. We
1120 can't simply skip the initialization, because we may be expanding the
1121 inits of a subobject constructor where the virtual base layout
1122 can be different. */
1126 /* Figure out what vtable BINFO's vtable is based on, and mark it as
1127 used. */
1131 /* Make sure the destructor gets synthesized so that it can be
1132 inlined after devirtualization even if the vtable is never
1133 emitted. */
1137 /* Now compute the address to use when initializing the vptr. */
1143 }
1145 /* This code sets up the virtual function tables appropriate for
1146 the pointer DECL. It is a one-ply initialization.
1148 BINFO is the exact type that DECL is supposed to be. In
1149 multiple inheritance, this might mean "C's A" if C : A, B. */
1151 static void
1153 {
1155 tree vtt_index;
1157 /* Compute the initializer for vptr. */
1160 /* We may get this vptr from a VTT, if this is a subobject
1161 constructor or subobject destructor. */
1164 {
1165 tree vtbl2;
1166 tree vtt_parm;
1168 /* Compute the value to use, when there's a VTT. */
1174 /* The actual initializer is the VTT value only in the subobject
1175 constructor. In maybe_clone_body we'll substitute NULL for
1176 the vtt_parm in the case of the non-subobject constructor. */
1181 vtbl2,
1182 vtbl);
1183 }
1185 /* Compute the location of the vtpr. */
1187 tf_warning_or_error),
1191 /* Assign the vtable to the vptr. */
1194 tf_warning_or_error));
1195 }
1197 /* If an exception is thrown in a constructor, those base classes already
1198 constructed must be destroyed. This function creates the cleanup
1199 for BINFO, which has just been constructed. If FLAG is non-NULL,
1200 it is a DECL which is nonzero when this base needs to be
1201 destroyed. */
1203 static void
1205 {
1206 tree expr;
1211 /* Call the destructor. */
1213 base_dtor_identifier,
1214 NULL,
1215 binfo,
1217 tf_warning_or_error);
1229 }
1231 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its
1232 constructor. */
1234 static void
1236 {
1237 tree inner_if_stmt;
1238 tree exp;
1239 tree flag;
1241 /* If there are virtual base classes with destructors, we need to
1242 emit cleanups to destroy them if an exception is thrown during
1243 the construction process. These exception regions (i.e., the
1244 period during which the cleanups must occur) begin from the time
1245 the construction is complete to the end of the function. If we
1246 create a conditional block in which to initialize the
1247 base-classes, then the cleanup region for the virtual base begins
1248 inside a block, and ends outside of that block. This situation
1249 confuses the sjlj exception-handling code. Therefore, we do not
1250 create a single conditional block, but one for each
1251 initialization. (That way the cleanup regions always begin
1252 in the outer block.) We trust the back end to figure out
1253 that the FLAG will not change across initializations, and
1254 avoid doing multiple tests. */
1259 /* Compute the location of the virtual base. If we're
1260 constructing virtual bases, then we must be the most derived
1261 class. Therefore, we don't have to look up the virtual base;
1262 we already know where it is. */
1271 }
1273 /* Find the context in which this FIELD can be initialized. */
1275 static tree
1277 {
1280 /* Anonymous union members can be initialized in the first enclosing
1281 non-anonymous union context. */
1285 }
1287 /* Function to give error message if member initialization specification
1288 is erroneous. FIELD is the member we decided to initialize.
1289 TYPE is the type for which the initialization is being performed.
1290 FIELD must be a member of TYPE.
1292 MEMBER_NAME is the name of the member. */
1294 static int
1296 {
1300 {
1302 member_name);
1304 }
1306 {
1309 field);
1311 }
1313 {
1317 }
1319 {
1321 member_name);
1323 }
1326 }
1328 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it
1329 is a _TYPE node or TYPE_DECL which names a base for that type.
1330 Check the validity of NAME, and return either the base _TYPE, base
1331 binfo, or the FIELD_DECL of the member. If NAME is invalid, return
1332 NULL_TREE and issue a diagnostic.
1334 An old style unnamed direct single base construction is permitted,
1335 where NAME is NULL. */
1337 tree
1339 {
1340 tree basetype;
1341 tree field;
1347 {
1348 /* This is an obsolete unnamed base class initializer. The
1349 parser will already have warned about its use. */
1351 {
1354 current_class_type);
1357 basetype = BINFO_TYPE
1362 current_class_type);
1364 }
1365 }
1367 {
1370 }
1373 else
1377 {
1378 tree class_binfo;
1379 tree direct_binfo;
1380 tree virtual_binfo;
1391 /* Look for a direct base. */
1396 /* Look for a virtual base -- unless the direct base is itself
1397 virtual. */
1401 /* [class.base.init]
1403 If a mem-initializer-id is ambiguous because it designates
1404 both a direct non-virtual base class and an inherited virtual
1405 base class, the mem-initializer is ill-formed. */
1407 {
1409 basetype);
1411 }
1414 {
1418 else
1422 }
1425 }
1426 else
1427 {
1430 else
1435 }
1438 }
1440 /* This is like `expand_member_init', only it stores one aggregate
1441 value into another.
1443 INIT comes in two flavors: it is either a value which
1444 is to be stored in EXP, or it is a parameter list
1445 to go to a constructor, which will operate on EXP.
1446 If INIT is not a parameter list for a constructor, then set
1447 LOOKUP_ONLYCONVERTING.
1448 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1449 the initializer, if FLAGS is 0, then it is the (init) form.
1450 If `init' is a CONSTRUCTOR, then we emit a warning message,
1451 explaining that such initializations are invalid.
1453 If INIT resolves to a CALL_EXPR which happens to return
1454 something of the type we are looking for, then we know
1455 that we can safely use that call to perform the
1456 initialization.
1458 The virtual function table pointer cannot be set up here, because
1459 we do not really know its type.
1461 This never calls operator=().
1463 When initializing, nothing is CONST.
1465 A default copy constructor may have to be used to perform the
1466 initialization.
1468 A constructor or a conversion operator may have to be used to
1469 perform the initialization, but not both, as it would be ambiguous. */
1471 tree
1473 {
1474 tree stmt_expr;
1475 tree compound_stmt;
1497 {
1498 tree itype;
1500 /* An array may not be initialized use the parenthesized
1501 initialization form -- unless the initializer is "()". */
1503 {
1507 }
1508 /* Must arrange to initialize each element of EXP
1509 from elements of INIT. */
1519 complain);
1523 /* Restore the type of init unless it was used directly. */
1527 }
1531 /* Just know that we've seen something for this node. */
1545 }
1547 static void
1549 tsubst_flags_t complain)
1550 {
1552 tree ctor_name;
1554 /* It fails because there may not be a constructor which takes
1555 its own type as the first (or only parameter), but which does
1556 take other types via a conversion. So, if the thing initializing
1557 the expression is a unit element of type X, first try X(X&),
1558 followed by initialization by X. If neither of these work
1559 out, then look hard. */
1560 tree rval;
1563 /* If we have direct-initialization from an initializer list, pull
1564 it out of the TREE_LIST so the code below can see it. */
1568 {
1572 }
1576 /* A brace-enclosed initializer for an aggregate. In C++0x this can
1577 happen for direct-initialization, too. */
1580 /* A CONSTRUCTOR of the target's type is a previously digested
1581 initializer, whether that happened just above or in
1582 cp_parser_late_parsing_nsdmi.
1584 A TARGET_EXPR with TARGET_EXPR_DIRECT_INIT_P or TARGET_EXPR_LIST_INIT_P
1585 set represents the whole initialization, so we shouldn't build up
1586 another ctor call. */
1593 {
1594 /* Early initialization via a TARGET_EXPR only works for
1595 complete objects. */
1602 }
1606 {
1607 /* Base subobjects should only get direct-initialization. */
1611 /* Do nothing. We hit this in two cases: Reference initialization,
1612 where we aren't initializing a real variable, so we don't want
1613 to run a new constructor; and catching an exception, where we
1614 have already built up the constructor call so we could wrap it
1616 else
1621 /* We need to protect the initialization of a catch parm with a
1622 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
1623 around the TARGET_EXPR for the copy constructor. See
1624 initialize_handler_parm. */
1625 {
1629 }
1630 else
1635 }
1640 {
1644 }
1645 else
1650 {
1651 /* Delegating constructor. */
1652 tree complete;
1653 tree base;
1656 /* Unshare the arguments for the second call. */
1659 {
1662 }
1665 complain);
1671 complain);
1676 base,
1677 complete);
1678 }
1679 else
1680 {
1683 else
1686 complain);
1687 }
1693 {
1696 {
1700 }
1701 }
1703 /* FIXME put back convert_to_void? */
1706 }
1708 /* This function is responsible for initializing EXP with INIT
1709 (if any).
1711 BINFO is the binfo of the type for who we are performing the
1712 initialization. For example, if W is a virtual base class of A and B,
1713 and C : A, B.
1714 If we are initializing B, then W must contain B's W vtable, whereas
1715 were we initializing C, W must contain C's W vtable.
1717 TRUE_EXP is nonzero if it is the true expression being initialized.
1718 In this case, it may be EXP, or may just contain EXP. The reason we
1719 need this is because if EXP is a base element of TRUE_EXP, we
1720 don't necessarily know by looking at EXP where its virtual
1721 baseclass fields should really be pointing. But we do know
1722 from TRUE_EXP. In constructors, we don't know anything about
1723 the value being initialized.
1725 FLAGS is just passed to `build_new_method_call'. See that function
1726 for its description. */
1728 static void
1730 tsubst_flags_t complain)
1731 {
1737 /* Use a function returning the desired type to initialize EXP for us.
1738 If the function is a constructor, and its first argument is
1739 NULL_TREE, know that it was meant for us--just slide exp on
1740 in and expand the constructor. Constructors now come
1741 as TARGET_EXPRs. */
1745 {
1747 /* If store_init_value returns NULL_TREE, the INIT has been
1748 recorded as the DECL_INITIAL for EXP. That means there's
1749 nothing more we have to do. */
1755 }
1757 /* If an explicit -- but empty -- initializer list was present,
1758 that's value-initialization. */
1760 {
1761 /* If the type has data but no user-provided ctor, we need to zero
1762 out the object. */
1765 {
1768 /* Don't clobber already initialized virtual bases. */
1771 field_size);
1774 }
1776 /* If we don't need to mess with the constructor at all,
1777 then we're done. */
1781 /* Otherwise fall through and call the constructor. */
1783 }
1785 /* We know that expand_default_init can handle everything we want
1786 at this point. */
1788 }
1790 /* Report an error if TYPE is not a user-defined, class type. If
1791 OR_ELSE is nonzero, give an error message. */
1793 int
1795 {
1800 {
1804 }
1806 }
1808 tree
1810 {
1816 else
1818 }
1820 /* Build a reference to a member of an aggregate. This is not a C++
1821 `&', but really something which can have its address taken, and
1822 then act as a pointer to member, for example TYPE :: FIELD can have
1823 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if
1824 this expression is the operand of "&".
1826 @@ Prints out lousy diagnostics for operator <typename>
1827 @@ fields.
1829 @@ This function should be rewritten and placed in search.c. */
1831 tree
1833 tsubst_flags_t complain)
1834 {
1835 tree decl;
1838 /* class templates can come in as TEMPLATE_DECLs here. */
1851 /* Callers should call mark_used before this point. */
1856 {
1860 }
1862 /* Entities other than non-static members need no further
1863 processing. */
1870 {
1874 }
1876 /* Set up BASEBINFO for member lookup. */
1879 /* A lot of this logic is now handled in lookup_member. */
1881 {
1882 /* Go from the TREE_BASELINK to the member function info. */
1886 {
1887 /* Get rid of a potential OVERLOAD around it. */
1890 /* Unique functions are handled easily. */
1892 /* For non-static member of base class, we need a special rule
1893 for access checking [class.protected]:
1895 If the access is to form a pointer to member, the
1896 nested-name-specifier shall name the derived class
1897 (or any class derived from that class). */
1901 complain);
1902 else
1904 complain);
1909 }
1910 else
1912 }
1914 /* We need additional test besides the one in
1915 check_accessibility_of_qualified_id in case it is
1916 a pointer to non-static member. */
1918 complain);
1921 {
1922 /* If MEMBER is non-static, then the program has fallen afoul of
1923 [expr.prim]:
1925 An id-expression that denotes a nonstatic data member or
1926 nonstatic member function of a class can only be used:
1928 -- as part of a class member access (_expr.ref_) in which the
1929 object-expression refers to the member's class or a class
1930 derived from that class, or
1932 -- to form a pointer to member (_expr.unary.op_), or
1934 -- in the body of a nonstatic member function of that class or
1935 of a class derived from that class (_class.mfct.nonstatic_), or
1937 -- in a mem-initializer for a constructor for that class or for
1938 a class derived from that class (_class.base.init_). */
1940 {
1941 /* Build a representation of the qualified name suitable
1942 for use as the operand to "&" -- even though the "&" is
1943 not actually present. */
1945 /* In Microsoft mode, treat a non-static member function as if
1946 it were a pointer-to-member. */
1948 {
1951 }
1956 }
1958 {
1962 }
1964 }
1969 }
1971 /* If DECL is a scalar enumeration constant or variable with a
1972 constant initializer, return the initializer (or, its initializers,
1973 recursively); otherwise, return DECL. If INTEGRAL_P, the
1974 initializer is only returned if DECL is an integral
1975 constant-expression. If RETURN_AGGREGATE_CST_OK_P, it is ok to
1976 return an aggregate constant. */
1978 static tree
1980 {
1982 || (integral_p
1986 {
1987 tree init;
1988 /* If DECL is a static data member in a template
1989 specialization, we must instantiate it here. The
1990 initializer for the static data member is not processed
1991 until needed; we need it now. */
1996 {
1998 /* Treat the error as a constant to avoid cascading errors on
1999 excessively recursive template instantiation (c++/9335). */
2001 else
2003 }
2004 /* Initializers in templates are generally expanded during
2005 instantiation, so before that for const int i(2)
2006 INIT is a TREE_LIST with the actual initializer as
2007 TREE_VALUE. */
2009 && init
2017 /* Unless RETURN_AGGREGATE_CST_OK_P is true, do not
2018 return an aggregate constant (of which string
2019 literals are a special case), as we do not want
2020 to make inadvertent copies of such entities, and
2021 we must be sure that their addresses are the
2022 same everywhere. */
2027 }
2029 }
2031 /* If DECL is a CONST_DECL, or a constant VAR_DECL initialized by
2032 constant of integral or enumeration type, then return that value.
2033 These are those variables permitted in constant expressions by
2034 [5.19/1]. */
2036 tree
2038 {
2041 }
2043 /* A more relaxed version of integral_constant_value, used by the
2044 common C/C++ code. */
2046 tree
2048 {
2051 }
2053 /* A version of integral_constant_value used by the C++ front end for
2054 optimization purposes. */
2056 tree
2058 {
2061 }
2062 \f
2063 /* Common subroutines of build_new and build_vec_delete. */
2065 /* Call the global __builtin_delete to delete ADDR. */
2067 static tree
2069 {
2072 }
2073 \f
2074 /* Build and return a NEW_EXPR. If NELTS is non-NULL, TYPE[NELTS] is
2075 the type of the object being allocated; otherwise, it's just TYPE.
2076 INIT is the initializer, if any. USE_GLOBAL_NEW is true if the
2077 user explicitly wrote "::operator new". PLACEMENT, if non-NULL, is
2078 a vector of arguments to be provided as arguments to a placement
2079 new operator. This routine performs no semantic checks; it just
2080 creates and returns a NEW_EXPR. */
2082 static tree
2085 {
2086 tree init_list;
2087 tree new_expr;
2089 /* If INIT is NULL, the we want to store NULL_TREE in the NEW_EXPR.
2090 If INIT is not NULL, then we want to store VOID_ZERO_NODE. This
2091 permits us to distinguish the case of a missing initializer "new
2092 int" from an empty initializer "new int()". */
2097 else
2102 init_list);
2107 }
2109 /* Diagnose uninitialized const members or reference members of type
2110 TYPE. USING_NEW is used to disambiguate the diagnostic between a
2111 new expression without a new-initializer and a declaration. Returns
2112 the error count. */
2114 static int
2117 {
2118 tree field;
2125 {
2126 tree field_type;
2137 {
2140 {
2142 {
2146 else
2148 }
2149 else
2150 {
2155 else
2158 }
2161 }
2162 }
2165 {
2168 {
2170 {
2174 else
2176 }
2177 else
2178 {
2183 else
2186 }
2189 }
2190 }
2193 error_count
2196 }
2198 }
2200 int
2202 {
2204 }
2206 /* Call __cxa_bad_array_new_length to indicate that the size calculation
2207 overflowed. Pretend it returns sizetype so that it plays nicely in the
2208 COND_EXPR. */
2210 tree
2212 {
2216 NULL_TREE));
2219 }
2221 /* Call __cxa_bad_array_length to indicate that there were too many
2222 initializers. */
2224 tree
2226 {
2230 NULL_TREE));
2233 }
2235 /* Generate code for a new-expression, including calling the "operator
2236 new" function, initializing the object, and, if an exception occurs
2237 during construction, cleaning up. The arguments are as for
2238 build_raw_new_expr. This may change PLACEMENT and INIT. */
2240 static tree
2243 tsubst_flags_t complain)
2244 {
2246 /* True iff this is a call to "operator new[]" instead of just
2247 "operator new". */
2249 /* If ARRAY_P is true, the element type of the array. This is never
2250 an ARRAY_TYPE; for something like "new int[3][4]", the
2251 ELT_TYPE is "int". If ARRAY_P is false, this is the same type as
2252 TYPE. */
2253 tree elt_type;
2254 /* The type of the new-expression. (This type is always a pointer
2255 type.) */
2256 tree pointer_type;
2257 tree non_const_pointer_type;
2259 /* For arrays, a bounds checks on the NELTS parameter. */
2264 /* Size of the inner array elements. */
2265 double_int inner_size;
2266 /* The address returned by the call to "operator new". This node is
2267 a VAR_DECL and is therefore reusable. */
2268 tree alloc_node;
2269 tree alloc_fn;
2273 /* If non-NULL, the number of extra bytes to allocate at the
2274 beginning of the storage allocated for an array-new expression in
2275 order to store the number of elements. */
2277 tree placement_first;
2279 /* True if the function we are calling is a placement allocation
2280 function. */
2282 /* True if the storage must be initialized, either by a constructor
2283 or due to an explicit new-initializer. */
2285 /* The address of the thing allocated, not including any cookie. In
2286 particular, if an array cookie is in use, DATA_ADDR is the
2287 address of the first array element. This node is a VAR_DECL, and
2288 is therefore reusable. */
2289 tree data_addr;
2294 {
2297 }
2299 {
2300 /* Transforms new (T[N]) to new T[N]. The former is a GNU
2301 extension for variable N. (This also covers new T where T is
2302 a VLA typedef.) */
2308 }
2310 /* If our base type is an array, then make sure we know how many elements
2311 it has. */
2315 {
2319 {
2325 {
2329 }
2331 }
2332 else
2333 {
2335 {
2339 }
2341 }
2345 inner_nelts_cst,
2346 complain);
2347 }
2350 {
2353 }
2358 /* Warn if we performed the (T[N]) to T[N] transformation and N is
2359 variable. */
2362 {
2364 {
2369 else
2374 }
2375 else
2377 }
2380 {
2384 }
2392 {
2394 /* A program that calls for default-initialization [...] of an
2395 entity of reference type is ill-formed. */
2399 /* A new-expression that creates an object of type T initializes
2400 that object as follows:
2401 - If the new-initializer is omitted:
2402 -- If T is a (possibly cv-qualified) non-POD class type
2403 (or array thereof), the object is default-initialized (8.5).
2404 [...]
2405 -- Otherwise, the object created has indeterminate
2406 value. If T is a const-qualified type, or a (possibly
2407 cv-qualified) POD class type (or array thereof)
2408 containing (directly or indirectly) a member of
2409 const-qualified type, the program is ill-formed; */
2419 }
2423 {
2427 }
2431 {
2432 /* Maximum available size in bytes. Half of the address space
2433 minus the cookie size. */
2434 double_int max_size
2436 HOST_BITS_PER_DOUBLE_INT);
2437 /* Maximum number of outer elements which can be allocated. */
2438 double_int max_outer_nelts;
2439 tree max_outer_nelts_tree;
2445 /* Unconditionally subtract the cookie size. This decreases the
2446 maximum object size and is safe even if we choose not to use
2447 a cookie after all. */
2453 {
2457 }
2459 /* Only keep the top-most seven bits, to simplify encoding the
2460 constant in the instruction stream. */
2461 {
2465 max_outer_nelts
2468 }
2473 outer_nelts,
2474 max_outer_nelts_tree);
2475 }
2479 /* If PLACEMENT is a single simple pointer type not passed by
2480 reference, prepare to capture it in a temporary variable. Do
2481 this now, since PLACEMENT will change in the calls below. */
2487 /* Allocate the object. */
2489 {
2490 tree class_addr;
2491 tree class_decl;
2495 {
2498 }
2507 {
2511 }
2513 {
2517 }
2522 }
2524 {
2527 }
2528 else
2529 {
2530 tree fnname;
2531 tree fns;
2537 && (array_p
2540 {
2541 /* Use a class-specific operator new. */
2542 /* If a cookie is required, add some extra space. */
2545 else
2546 {
2548 /* No size arithmetic necessary, so the size check is
2549 not needed. */
2552 }
2553 /* Perform the overflow check. */
2560 /* Create the argument list. */
2562 /* Do name-lookup to find the appropriate operator. */
2565 {
2569 }
2571 {
2573 {
2576 }
2578 }
2582 LOOKUP_NORMAL,
2584 complain);
2585 }
2586 else
2587 {
2588 /* Use a global operator new. */
2589 /* See if a cookie might be required. */
2591 {
2593 /* No size arithmetic necessary, so the size check is
2594 not needed. */
2597 }
2601 outer_nelts_check,
2603 }
2604 }
2611 /* If we found a simple case of PLACEMENT_EXPR above, then copy it
2612 into a temporary variable. */
2619 {
2624 {
2628 }
2629 }
2631 /* In the simple case, we can stop now. */
2636 /* Store the result of the allocation call in a variable so that we can
2637 use it more than once. */
2641 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */
2645 /* Now, check to see if this function is actually a placement
2646 allocation function. This can happen even when PLACEMENT is NULL
2647 because we might have something like:
2649 struct S { void* operator new (size_t, int i = 0); };
2651 A call to `new S' will get this allocation function, even though
2652 there is no explicit placement argument. If there is more than
2653 one argument, or there are variable arguments, then this is a
2654 placement allocation function. */
2655 placement_allocation_fn_p
2659 /* Preevaluate the placement args so that we don't reevaluate them for a
2660 placement delete. */
2662 {
2663 tree inits;
2667 alloc_expr);
2668 }
2670 /* unless an allocation function is declared with an empty excep-
2671 tion-specification (_except.spec_), throw(), it indicates failure to
2672 allocate storage by throwing a bad_alloc exception (clause _except_,
2673 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2674 cation function is declared with an empty exception-specification,
2675 throw(), it returns null to indicate failure to allocate storage and a
2676 non-null pointer otherwise.
2678 So check for a null exception spec on the op new we just called. */
2684 {
2685 tree cookie;
2686 tree cookie_ptr;
2687 tree size_ptr_type;
2689 /* Adjust so we're pointing to the start of the object. */
2692 /* Store the number of bytes allocated so that we can know how
2693 many elements to destroy later. We use the last sizeof
2694 (size_t) bytes to store the number of elements. */
2705 {
2706 /* Also store the element size. */
2717 }
2718 }
2719 else
2720 {
2723 }
2725 /* Now use a pointer to the type we've actually allocated. */
2727 /* But we want to operate on a non-const version to start with,
2728 since we'll be modifying the elements. */
2729 non_const_pointer_type = build_pointer_type
2733 /* Any further uses of alloc_node will want this type, too. */
2736 /* Now initialize the allocated object. Note that we preevaluate the
2737 initialization expression, apart from the actual constructor call or
2738 assignment--we do this because we want to delay the allocation as long
2739 as possible in order to minimize the size of the exception region for
2740 placement delete. */
2742 {
2747 {
2750 }
2753 {
2754 /* build_value_init doesn't work in templates, and we don't need
2755 the initializer anyway since we're going to throw it away and
2756 rebuild it at instantiation time, so just build up a single
2757 constructor call to get any appropriate diagnostics. */
2761 complete_ctor_identifier,
2763 LOOKUP_NORMAL,
2764 complain);
2766 }
2768 {
2773 {
2777 else
2778 {
2782 complain);
2783 else
2784 /* We'll check the length at runtime. */
2788 }
2789 }
2791 {
2795 else
2798 }
2799 init_expr
2803 integer_one_node,
2804 complain),
2805 vecinit,
2806 explicit_value_init_p,
2808 complain);
2810 /* An array initialization is stable because the initialization
2811 of each element is a full-expression, so the temporaries don't
2812 leak out. */
2814 }
2815 else
2816 {
2820 {
2822 complete_ctor_identifier,
2824 LOOKUP_NORMAL,
2825 complain);
2826 }
2828 {
2829 /* Something like `new int()'. */
2834 }
2835 else
2836 {
2837 tree ie;
2839 /* We are processing something like `new int (10)', which
2840 means allocate an int, and initialize it with 10. */
2843 complain);
2845 complain);
2846 }
2848 }
2853 /* If any part of the object initialization terminates by throwing an
2854 exception and a suitable deallocation function can be found, the
2855 deallocation function is called to free the memory in which the
2856 object was being constructed, after which the exception continues
2857 to propagate in the context of the new-expression. If no
2858 unambiguous matching deallocation function can be found,
2859 propagating the exception does not cause the object's memory to be
2860 freed. */
2862 {
2864 tree cleanup;
2866 /* The Standard is unclear here, but the right thing to do
2867 is to use the same method for finding deallocation
2868 functions that we use for finding allocation functions. */
2869 cleanup = (build_op_delete_call
2871 alloc_node,
2872 size,
2873 globally_qualified_p,
2875 alloc_fn,
2876 complain));
2881 /* This is much simpler if we were able to preevaluate all of
2882 the arguments to the constructor call. */
2883 {
2884 /* CLEANUP is compiler-generated, so no diagnostics. */
2888 /* Likewise, this try-catch is compiler-generated. */
2890 }
2891 else
2892 /* Ack! First we allocate the memory. Then we set our sentry
2893 variable to true, and expand a cleanup that deletes the
2894 memory if sentry is true. Then we run the constructor, and
2895 finally clear the sentry.
2897 We need to do this because we allocate the space first, so
2898 if there are any temporaries with cleanups in the
2899 constructor args and we weren't able to preevaluate them, we
2900 need this EH region to extend until end of full-expression
2901 to preserve nesting. */
2902 {
2910 /* CLEANUP is compiler-generated, so no diagnostics. */
2920 init_expr
2923 end));
2924 /* Likewise, this is compiler-generated. */
2926 }
2927 }
2928 }
2929 else
2932 /* Now build up the return value in reverse order. */
2942 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
2943 and return the call (which doesn't need to be adjusted). */
2945 else
2946 {
2948 {
2951 nullptr_node,
2952 complain);
2955 }
2957 /* Perform the allocation before anything else, so that ALLOC_NODE
2958 has been initialized before we start using it. */
2960 }
2965 /* A new-expression is never an lvalue. */
2969 }
2971 /* Generate a representation for a C++ "new" expression. *PLACEMENT
2972 is a vector of placement-new arguments (or NULL if none). If NELTS
2973 is NULL, TYPE is the type of the storage to be allocated. If NELTS
2974 is not NULL, then this is an array-new allocation; TYPE is the type
2975 of the elements in the array and NELTS is the number of elements in
2976 the array. *INIT, if non-NULL, is the initializer for the new
2977 object, or an empty vector to indicate an initializer of "()". If
2978 USE_GLOBAL_NEW is true, then the user explicitly wrote "::new"
2979 rather than just "new". This may change PLACEMENT and INIT. */
2981 tree
2984 {
2985 tree rval;
2994 /* Don't do auto deduction where it might affect mangling. */
2996 {
2999 {
3003 }
3004 }
3007 {
3014 use_global_new);
3025 }
3028 {
3030 {
3033 else
3035 }
3038 }
3040 /* ``A reference cannot be created by the new operator. A reference
3041 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
3042 returned by new.'' ARM 5.3.3 */
3044 {
3047 else
3050 }
3053 {
3057 }
3059 /* The type allocated must be complete. If the new-type-id was
3060 "T[N]" then we are just checking that "T" is complete here, but
3061 that is equivalent, since the value of "N" doesn't matter. */
3070 {
3076 }
3078 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
3083 }
3085 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
3087 tree
3089 {
3095 {
3098 {
3101 }
3103 }
3105 /* Mangle the class$ field. */
3106 {
3107 tree field;
3110 {
3114 }
3116 {
3119 }
3120 }
3124 {
3134 }
3136 }
3137 \f
3138 static tree
3140 special_function_kind auto_delete_vec,
3142 {
3143 tree virtual_size;
3145 tree size_exp;
3147 /* Temporary variables used by the loop. */
3150 /* This is the body of the loop that implements the deletion of a
3151 single element, and moves temp variables to next elements. */
3152 tree body;
3154 /* This is the LOOP_EXPR that governs the deletion of the elements. */
3157 /* This is the thing that governs what to do after the loop has run. */
3160 /* This is the BIND_EXPR which holds the outermost iterator of the
3161 loop. It is convenient to set this variable up and test it before
3162 executing any other code in the loop.
3163 This is also the containing expression returned by this function. */
3165 tree tmp;
3167 /* We should only have 1-D arrays here. */
3174 {
3177 "possible problem detected in invocation of "
3179 {
3182 "class-specific operator delete [] will be called, "
3184 }
3186 }
3193 {
3194 /* Make sure the destructor is callable. */
3196 {
3199 complain);
3202 }
3204 }
3206 /* The below is short by the cookie size. */
3211 tbase_init
3215 base),
3216 virtual_size),
3217 complain);
3235 complain);
3243 no_destructor:
3244 /* Delete the storage if appropriate. */
3246 {
3247 tree base_tbd;
3249 /* The below is short by the cookie size. */
3254 /* no header */
3256 else
3257 {
3258 tree cookie_size;
3262 MINUS_EXPR,
3265 cookie_size,
3266 complain);
3270 /* True size with header. */
3272 }
3279 complain);
3280 }
3284 ;
3287 else
3293 /* Outermost wrapper: If pointer is null, punt. */
3298 nullptr_node)),
3303 {
3306 }
3309 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
3313 }
3315 /* Create an unnamed variable of the indicated TYPE. */
3317 tree
3319 {
3320 tree decl;
3330 }
3332 /* Create a new temporary variable of the indicated TYPE, initialized
3333 to INIT.
3335 It is not entered into current_binding_level, because that breaks
3336 things when it comes time to do final cleanups (which take place
3337 "outside" the binding contour of the function). */
3339 tree
3341 {
3342 tree decl;
3348 tf_warning_or_error));
3351 }
3353 /* `build_vec_init' returns tree structure that performs
3354 initialization of a vector of aggregate types.
3356 BASE is a reference to the vector, of ARRAY_TYPE, or a pointer
3357 to the first element, of POINTER_TYPE.
3358 MAXINDEX is the maximum index of the array (one less than the
3359 number of elements). It is only used if BASE is a pointer or
3360 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
3362 INIT is the (possibly NULL) initializer.
3364 If EXPLICIT_VALUE_INIT_P is true, then INIT must be NULL. All
3365 elements in the array are value-initialized.
3367 FROM_ARRAY is 0 if we should init everything with INIT
3368 (i.e., every element initialized from INIT).
3369 FROM_ARRAY is 1 if we should index into INIT in parallel
3370 with initialization of DECL.
3371 FROM_ARRAY is 2 if we should index into INIT in parallel,
3372 but use assignment instead of initialization. */
3374 tree
3378 {
3379 tree rval;
3382 tree iterator;
3383 /* The type of BASE. */
3385 /* The type of an element in the array. */
3387 /* The element type reached after removing all outer array
3388 types. */
3389 tree inner_elt_type;
3390 /* The type of a pointer to an element in the array. */
3391 tree ptype;
3392 tree stmt_expr;
3393 tree compound_stmt;
3415 /* Look through the TARGET_EXPR around a compound literal. */
3421 /* If we have a braced-init-list, make sure that the array
3422 is big enough for all the initializers. */
3438 /* Don't do this if the CONSTRUCTOR might contain something
3439 that might throw and require us to clean up. */
3443 {
3444 /* Do non-default initialization of trivial arrays resulting from
3445 brace-enclosed initializers. In this case, digest_init and
3446 store_constructor will handle the semantics for us. */
3454 stmt_expr);
3456 }
3460 {
3466 }
3467 else
3470 /* The code we are generating looks like:
3471 ({
3472 T* t1 = (T*) base;
3473 T* rval = t1;
3474 ptrdiff_t iterator = maxindex;
3475 try {
3476 for (; iterator != -1; --iterator) {
3477 ... initialize *t1 ...
3478 ++t1;
3479 }
3480 } catch (...) {
3481 ... destroy elements that were constructed ...
3482 }
3483 rval;
3484 })
3486 We can omit the try and catch blocks if we know that the
3487 initialization will never throw an exception, or if the array
3488 elements do not have destructors. We can omit the loop completely if
3489 the elements of the array do not have constructors.
3491 We actually wrap the entire body of the above in a STMT_EXPR, for
3492 tidiness.
3494 When copying from array to another, when the array elements have
3495 only trivial copy constructors, we should use __builtin_memcpy
3496 rather than generating a loop. That way, we could take advantage
3497 of whatever cleverness the back end has for dealing with copies
3498 of blocks of memory. */
3507 /* If initializing one array from another, initialize element by
3508 element. We rely upon the below calls to do the argument
3509 checking. Evaluate the initializer before entering the try block. */
3511 {
3520 }
3522 /* Protect the entire array initialization so that we can destroy
3523 the partially constructed array if an exception is thrown.
3524 But don't do this if we're assigning. */
3527 {
3529 }
3531 /* If the initializer is {}, then all elements are initialized from {}.
3532 But for non-classes, that's the same as value-initialization. */
3535 {
3538 else
3539 {
3542 }
3543 }
3545 /* Maybe pull out constant value when from_array? */
3548 {
3549 /* Do non-default initialization of non-trivial arrays resulting from
3550 brace-enclosed initializers. */
3553 /* Should we try to create a constant initializer? */
3558 /* If the constructor already has the array type, it's been through
3559 digest_init, so we shouldn't try to do anything more. */
3563 /* If we're initializing a static array, we want to do static
3564 initialization of any elements with constant initializers even if
3565 some are non-constant. */
3571 {
3572 tree throw_call;
3575 else
3580 }
3584 else
3588 {
3590 tree one_init;
3592 num_initialized_elts++;
3599 else
3605 {
3614 {
3618 else
3621 }
3622 else
3623 {
3625 {
3630 }
3632 }
3633 }
3642 else
3646 complain);
3649 else
3651 }
3654 {
3659 else
3661 }
3663 /* Any elements without explicit initializers get {}. */
3666 else
3667 {
3670 }
3671 }
3673 {
3678 {
3682 }
3683 }
3685 /* Now, default-initialize any remaining elements. We don't need to
3686 do that if a) the type does not need constructing, or b) we've
3687 already initialized all the elements.
3689 We do need to keep going if we're copying an array. */
3694 && (num_initialized_elts
3696 {
3697 /* If the ITERATOR is equal to -1, then we don't have to loop;
3698 we've already initialized all the elements. */
3699 tree for_stmt;
3700 tree elt_init;
3701 tree to;
3709 complain);
3717 {
3718 tree from;
3721 {
3725 }
3726 else
3731 complain);
3736 complain);
3737 else
3739 }
3741 {
3743 sorry
3747 explicit_value_init_p,
3749 }
3751 {
3755 }
3756 else
3757 {
3761 else
3762 {
3765 complain);
3767 }
3768 }
3778 complain));
3781 complain));
3784 }
3786 /* Make sure to cleanup any partially constructed elements. */
3789 {
3790 tree e;
3793 complain);
3795 /* Flatten multi-dimensional array since build_vec_delete only
3796 expects one-dimensional array. */
3800 /* Avoid mixing signed and unsigned. */
3803 complain);
3812 }
3814 /* The value of the array initialization is the array itself, RVAL
3815 is a pointer to the first element. */
3820 /* Now make the result have the correct type. */
3822 {
3827 }
3836 }
3838 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
3839 build_delete. */
3841 static tree
3843 tsubst_flags_t complain)
3844 {
3845 tree name;
3846 tree fn;
3848 {
3863 }
3868 flags,
3870 complain);
3871 }
3873 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
3874 ADDR is an expression which yields the store to be destroyed.
3875 AUTO_DELETE is the name of the destructor to call, i.e., either
3876 sfk_complete_destructor, sfk_base_destructor, or
3877 sfk_deleting_destructor.
3879 FLAGS is the logical disjunction of zero or more LOOKUP_
3880 flags. See cp-tree.h for more info. */
3882 tree
3885 {
3886 tree expr;
3893 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
3894 set to `error_mark_node' before it gets properly cleaned up. */
3902 {
3904 {
3908 }
3911 }
3914 {
3919 /* We don't want to warn about delete of void*, only other
3920 incomplete types. Deleting other incomplete types
3921 invokes undefined behavior, but it is not ill-formed, so
3922 compile to something that would even do The Right Thing
3923 (TM) should the type have a trivial dtor and no delete
3924 operator. */
3926 {
3929 {
3932 "possible problem detected in invocation of "
3934 {
3937 "neither the destructor nor the class-specific "
3938 "operator delete will be called, even if they are "
3940 }
3942 }
3946 {
3947 tree dtor;
3950 {
3953 "deleting object of abstract class type %qT"
3954 " which has non-virtual destructor"
3956 else
3958 "deleting object of polymorphic class type %qT"
3959 " which has non-virtual destructor"
3961 }
3962 }
3963 }
3965 /* Call the builtin operator delete. */
3970 /* Throw away const and volatile on target type of addr. */
3972 }
3973 else
3974 {
3975 /* Don't check PROTECT here; leave that decision to the
3976 destructor. If the destructor is accessible, call it,
3977 else report error. */
3985 }
3988 {
3989 /* Make sure the destructor is callable. */
3991 {
3993 complain),
3997 }
4004 use_global_delete,
4007 complain);
4008 }
4009 else
4010 {
4013 tree ifexp;
4018 /* For `::delete x', we must not use the deleting destructor
4019 since then we would not be sure to get the global `operator
4020 delete'. */
4022 {
4023 /* We will use ADDR multiple times so we must save it. */
4026 /* Delete the object. */
4028 /* Otherwise, treat this like a complete object destructor
4029 call. */
4031 }
4032 /* If the destructor is non-virtual, there is no deleting
4033 variant. Instead, we must explicitly call the appropriate
4034 `operator delete' here. */
4037 {
4038 /* We will use ADDR multiple times so we must save it. */
4040 /* Build the call. */
4042 addr,
4047 complain);
4048 /* Call the complete object destructor. */
4050 }
4053 {
4054 /* Make sure we have access to the member op delete, even though
4055 we'll actually be calling it from the destructor. */
4060 complain);
4061 }
4070 /* We need to calculate this before the dtor changes the vptr. */
4075 /* Explicit destructor call; don't check for null pointer. */
4077 else
4078 {
4079 /* Handle deleting a null pointer. */
4082 complain));
4085 }
4092 }
4093 }
4095 /* At the beginning of a destructor, push cleanups that will call the
4096 destructors for our base classes and members.
4098 Called from begin_destructor_body. */
4100 void
4102 {
4105 tree member;
4106 tree expr;
4109 /* Run destructors for all virtual baseclasses. */
4111 {
4112 tree cond = (condition_conversion
4114 current_in_charge_parm,
4115 integer_two_node)));
4117 /* The CLASSTYPE_VBASECLASSES vector is in initialization
4118 order, which is also the right order for pushing cleanups. */
4121 {
4123 {
4125 base_dtor_identifier,
4126 NULL,
4127 base_binfo,
4128 (LOOKUP_NORMAL
4130 tf_warning_or_error);
4132 {
4136 }
4137 }
4138 }
4139 }
4141 /* Take care of the remaining baseclasses. */
4144 {
4150 base_dtor_identifier,
4153 tf_warning_or_error);
4156 }
4158 /* Don't automatically destroy union members. */
4164 {
4173 {
4174 tree this_member = (build_class_member_access_expr
4178 tf_warning_or_error));
4180 sfk_complete_destructor,
4185 }
4186 }
4187 }
4189 /* Build a C++ vector delete expression.
4190 MAXINDEX is the number of elements to be deleted.
4191 ELT_SIZE is the nominal size of each element in the vector.
4192 BASE is the expression that should yield the store to be deleted.
4193 This function expands (or synthesizes) these calls itself.
4194 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
4196 This also calls delete for virtual baseclasses of elements of the vector.
4198 Update: MAXINDEX is no longer needed. The size can be extracted from the
4199 start of the vector for pointers, and from the type for arrays. We still
4200 use MAXINDEX for arrays because it happens to already have one of the
4201 values we'd have to extract. (We could use MAXINDEX with pointers to
4202 confirm the size, and trap if the numbers differ; not clear that it'd
4203 be worth bothering.) */
4205 tree
4207 special_function_kind auto_delete_vec,
4209 {
4210 tree type;
4211 tree rval;
4217 {
4218 /* Step back one from start of vector, and read dimension. */
4219 tree cookie_addr;
4224 {
4227 }
4232 cookie_addr);
4234 }
4236 {
4237 /* Get the total number of things in the array, maxindex is a
4238 bad name. */
4245 {
4248 }
4249 }
4250 else
4251 {
4255 }
4263 }