| blob | 8a7dca32b46daed3d6f41e3ae05c436d2c5ea788 |
1 /* Handle initialization things in C++.
2 Copyright (C) 1987-2014 Free Software Foundation, Inc.
3 Contributed by Michael Tiemann (tiemann@cygnus.com)
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
10 any later version.
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
21 /* High-level class interface. */
51 /* We are about to generate some complex initialization code.
52 Conceptually, it is all a single expression. However, we may want
53 to include conditionals, loops, and other such statement-level
54 constructs. Therefore, we build the initialization code inside a
55 statement-expression. This function starts such an expression.
56 STMT_EXPR_P and COMPOUND_STMT_P are filled in by this function;
57 pass them back to finish_init_stmts when the expression is
58 complete. */
60 static bool
62 {
69 }
71 /* Finish out the statement-expression begun by the previous call to
72 begin_init_stmts. Returns the statement-expression itself. */
74 static tree
76 {
84 }
86 /* Constructors */
88 /* Called from initialize_vtbl_ptrs via dfs_walk. BINFO is the base
89 which we want to initialize the vtable pointer for, DATA is
90 TREE_LIST whose TREE_VALUE is the this ptr expression. */
92 static tree
94 {
99 {
103 tf_warning_or_error);
106 }
109 }
111 /* Initialize all the vtable pointers in the object pointed to by
112 ADDR. */
114 void
116 {
117 tree list;
118 tree type;
123 /* Walk through the hierarchy, initializing the vptr in each base
124 class. We do these in pre-order because we can't find the virtual
125 bases for a class until we've initialized the vtbl for that
126 class. */
128 }
130 /* Return an expression for the zero-initialization of an object with
131 type T. This expression will either be a constant (in the case
132 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
133 aggregate), or NULL (in the case that T does not require
134 initialization). In either case, the value can be used as
135 DECL_INITIAL for a decl of the indicated TYPE; it is a valid static
136 initializer. If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS
137 is the number of elements in the array. If STATIC_STORAGE_P is
138 TRUE, initializers are only generated for entities for which
139 zero-initialization does not simply mean filling the storage with
140 zero bytes. FIELD_SIZE, if non-NULL, is the bit size of the field,
141 subfields with bit positions at or above that bit size shouldn't
142 be added. Note that this only works when the result is assigned
143 to a base COMPONENT_REF; if we only have a pointer to the base subobject,
144 expand_assignment will end up clearing the full size of TYPE. */
146 static tree
148 tree field_size)
149 {
152 /* [dcl.init]
154 To zero-initialize an object of type T means:
156 -- if T is a scalar type, the storage is set to the value of zero
157 converted to T.
159 -- if T is a non-union class type, the storage for each nonstatic
160 data member and each base-class subobject is zero-initialized.
162 -- if T is a union type, the storage for its first data member is
163 zero-initialized.
165 -- if T is an array type, the storage for each element is
166 zero-initialized.
168 -- if T is a reference type, no initialization is performed. */
173 ;
175 /* In order to save space, we do not explicitly build initializers
176 for items that do not need them. GCC's semantics are that
177 items with static storage duration that are not otherwise
178 initialized are initialized to zero. */
179 ;
185 {
186 tree field;
189 /* Iterate over the fields, building initializations. */
191 {
198 /* Don't add virtual bases for base classes if they are beyond
199 the size of the current field, that means it is present
200 somewhere else in the object. */
202 {
207 }
209 /* Note that for class types there will be FIELD_DECLs
210 corresponding to base classes as well. Thus, iterating
211 over TYPE_FIELDs will result in correct initialization of
212 all of the subobjects. */
214 {
215 tree new_field_size
222 static_storage_p,
223 new_field_size);
226 }
228 /* For unions, only the first field is initialized. */
231 }
233 /* Build a constructor to contain the initializations. */
235 }
237 {
238 tree max_index;
241 /* Iterate over the array elements, building initializations. */
246 else
249 /* If we have an error_mark here, we should just return error mark
250 as we don't know the size of the array yet. */
255 /* A zero-sized array, which is accepted as an extension, will
256 have an upper bound of -1. */
258 {
259 constructor_elt ce;
261 /* If this is a one element array, we just use a regular init. */
264 else
266 max_index);
272 {
275 }
276 }
278 /* Build a constructor to contain the initializations. */
280 }
283 else
286 /* In all cases, the initializer is a constant. */
291 }
293 /* Return an expression for the zero-initialization of an object with
294 type T. This expression will either be a constant (in the case
295 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
296 aggregate), or NULL (in the case that T does not require
297 initialization). In either case, the value can be used as
298 DECL_INITIAL for a decl of the indicated TYPE; it is a valid static
299 initializer. If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS
300 is the number of elements in the array. If STATIC_STORAGE_P is
301 TRUE, initializers are only generated for entities for which
302 zero-initialization does not simply mean filling the storage with
303 zero bytes. */
305 tree
307 {
309 }
311 /* Return a suitable initializer for value-initializing an object of type
312 TYPE, as described in [dcl.init]. */
314 tree
316 {
317 /* [dcl.init]
319 To value-initialize an object of type T means:
321 - if T is a class type (clause 9) with either no default constructor
322 (12.1) or a default constructor that is user-provided or deleted,
323 then then the object is default-initialized;
325 - if T is a (possibly cv-qualified) class type without a user-provided
326 or deleted default constructor, then the object is zero-initialized
327 and the semantic constraints for default-initialization are checked,
328 and if T has a non-trivial default constructor, the object is
329 default-initialized;
331 - if T is an array type, then each element is value-initialized;
333 - otherwise, the object is zero-initialized.
335 A program that calls for default-initialization or
336 value-initialization of an entity of reference type is ill-formed. */
338 /* The AGGR_INIT_EXPR tweaking below breaks in templates. */
344 {
345 tree ctor =
348 complain);
358 {
359 /* This is a class that needs constructing, but doesn't have
360 a user-provided constructor. So we need to zero-initialize
361 the object and then call the implicitly defined ctor.
362 This will be handled in simplify_aggr_init_expr. */
365 }
366 }
368 /* Discard any access checking during subobject initialization;
369 the checks are implied by the call to the ctor which we have
370 verified is OK (cpp0x/defaulted46.C). */
375 }
377 /* Like build_value_init, but don't call the constructor for TYPE. Used
378 for base initializers. */
380 tree
382 {
384 {
388 }
389 /* FIXME the class and array cases should just use digest_init once it is
390 SFINAE-enabled. */
392 {
397 {
398 tree field;
401 /* Iterate over the fields, building initializations. */
403 {
414 /* We could skip vfields and fields of types with
415 user-defined constructors, but I think that won't improve
416 performance at all; it should be simpler in general just
417 to zero out the entire object than try to only zero the
418 bits that actually need it. */
420 /* Note that for class types there will be FIELD_DECLs
421 corresponding to base classes as well. Thus, iterating
422 over TYPE_FIELDs will result in correct initialization of
423 all of the subobjects. */
432 /* We shouldn't have gotten here for anything that would need
433 non-trivial initialization, and gimplify_init_ctor_preeval
434 would need to be fixed to allow it. */
437 }
439 /* Build a constructor to contain the zero- initializations. */
441 }
442 }
444 {
447 /* Iterate over the array elements, building initializations. */
450 /* If we have an error_mark here, we should just return error mark
451 as we don't know the size of the array yet. */
453 {
456 type);
458 }
461 /* A zero-sized array, which is accepted as an extension, will
462 have an upper bound of -1. */
464 {
465 constructor_elt ce;
467 /* If this is a one element array, we just use a regular init. */
470 else
481 /* We shouldn't have gotten here for anything that would need
482 non-trivial initialization, and gimplify_init_ctor_preeval
483 would need to be fixed to allow it. */
486 }
488 /* Build a constructor to contain the initializations. */
490 }
492 {
496 }
498 {
502 }
505 }
507 /* Initialize current class with INIT, a TREE_LIST of
508 arguments for a target constructor. If TREE_LIST is void_type_node,
509 an empty initializer list was given. */
511 static void
513 {
519 tf_warning_or_error));
521 {
523 LOOKUP_NORMAL
524 |LOOKUP_NONVIRTUAL
530 }
531 }
533 /* Return the non-static data initializer for FIELD_DECL MEMBER. */
535 tree
537 {
538 tree init;
542 {
543 /* Use a PLACEHOLDER_EXPR when we don't have a 'this' parameter to
544 refer to; constexpr evaluation knows what to do with it. */
547 }
549 {
550 /* Do deferred instantiation of the NSDMI. */
551 init = (tsubst_copy_and_build
558 }
559 else
560 {
563 {
568 }
569 /* Strip redundant TARGET_EXPR so we don't need to remap it, and
570 so the aggregate init code below will see a CONSTRUCTOR. */
575 }
579 }
581 /* Initialize MEMBER, a FIELD_DECL, with INIT, a TREE_LIST of
582 arguments. If TREE_LIST is void_type_node, an empty initializer
583 list was given; if NULL_TREE no initializer was given. */
585 static void
587 {
588 tree decl;
591 /* Use the non-static data member initializer if there was no
592 mem-initializer for this field. */
599 /* Effective C++ rule 12 requires that all data members be
600 initialized. */
604 member);
606 /* Get an lvalue for the data member. */
610 tf_warning_or_error);
616 {
622 member);
623 }
626 {
627 /* mem() means value-initialization. */
629 {
633 }
634 else
635 {
641 }
642 }
643 /* Deal with this here, as we will get confused if we try to call the
644 assignment op for an anonymous union. This can happen in a
645 synthesized copy constructor. */
647 {
649 {
652 }
653 }
656 /* Pre-digested NSDMI. */
659 /* { } mem-initializer. */
664 {
665 /* With references and list-initialization, we need to deal with
666 extending temporary lifetimes. 12.2p5: "A temporary bound to a
667 reference member in a constructor’s ctor-initializer (12.6.2)
668 persists until the constructor exits." */
673 tf_warning_or_error);
675 {
680 }
683 /* A FIELD_DECL doesn't really have a suitable lifetime, but
684 make_temporary_var_for_ref_to_temp will treat it as automatic and
685 set_up_extended_ref_temp wants to use the decl in a warning. */
695 }
698 {
700 {
702 {
705 else
709 }
713 {
717 }
718 else
720 }
721 else
722 {
729 {
730 /* TYPE_NEEDS_CONSTRUCTING can be set just because we have a
731 vtable; still give this diagnostic. */
736 }
738 tf_warning_or_error));
739 }
740 }
741 else
742 {
744 {
745 tree core_type;
746 /* member traversal: note it leaves init NULL */
748 {
753 }
755 {
760 }
770 }
772 /* There was an explicit member initialization. Do some work
773 in that case. */
775 tf_warning_or_error);
779 tf_warning_or_error));
780 }
783 {
784 tree expr;
789 tf_warning_or_error);
792 tf_warning_or_error);
797 }
798 }
800 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
801 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
803 static tree
805 {
806 tree fields;
808 /* Note whether or not T is a union. */
813 {
814 tree fieldtype;
816 /* Skip CONST_DECLs for enumeration constants and so forth. */
821 /* Keep track of whether or not any fields are unions. */
825 /* For an anonymous struct or union, we must recursively
826 consider the fields of the anonymous type. They can be
827 directly initialized from the constructor. */
829 {
830 /* Add this field itself. Synthesized copy constructors
831 initialize the entire aggregate. */
833 /* And now add the fields in the anonymous aggregate. */
835 }
836 /* Add this field. */
839 }
842 }
844 /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives
845 a FIELD_DECL or BINFO in T that needs initialization. The
846 TREE_VALUE gives the initializer, or list of initializer arguments.
848 Return a TREE_LIST containing all of the initializations required
849 for T, in the order in which they should be performed. The output
850 list has the same format as the input. */
852 static tree
854 {
855 tree init;
857 tree sorted_inits;
858 tree next_subobject;
863 /* Build up a list of initializations. The TREE_PURPOSE of entry
864 will be the subobject (a FIELD_DECL or BINFO) to initialize. The
865 TREE_VALUE will be the constructor arguments, or NULL if no
866 explicit initialization was provided. */
869 /* Process the virtual bases. */
874 /* Process the direct bases. */
880 /* Process the non-static data members. */
882 /* Reverse the entire list of initializations, so that they are in
883 the order that they will actually be performed. */
886 /* If the user presented the initializers in an order different from
887 that in which they will actually occur, we issue a warning. Keep
888 track of the next subobject which can be explicitly initialized
889 without issuing a warning. */
892 /* Go through the explicit initializers, filling in TREE_PURPOSE in
893 the SORTED_INITS. */
895 {
896 tree subobject;
897 tree subobject_init;
901 /* If the explicit initializers are in sorted order, then
902 SUBOBJECT will be NEXT_SUBOBJECT, or something following
903 it. */
905 subobject_init;
910 /* Issue a warning if the explicit initializer order does not
911 match that which will actually occur.
912 ??? Are all these on the correct lines? */
914 {
918 else
923 else
927 }
929 /* Look again, from the beginning of the list. */
931 {
935 }
937 /* It is invalid to initialize the same subobject more than
938 once. */
940 {
944 subobject);
945 else
948 subobject);
949 }
951 /* Record the initialization. */
954 }
956 /* [class.base.init]
958 If a ctor-initializer specifies more than one mem-initializer for
959 multiple members of the same union (including members of
960 anonymous unions), the ctor-initializer is ill-formed.
962 Here we also splice out uninitialized union members. */
964 {
968 {
969 tree field;
970 tree ctx;
976 /* Skip base classes. */
980 /* If this is an anonymous union with no explicit initializer,
981 splice it out. */
985 /* See if this field is a member of a union, or a member of a
986 structure contained in a union, etc. */
993 /* If this field is not a member of a union, skip it. */
997 /* If this union member has no explicit initializer and no NSDMI,
998 splice it out. */
1001 else
1004 /* It's only an error if we have two initializers for the same
1005 union type. */
1007 {
1010 }
1012 /* See if LAST_FIELD and the field initialized by INIT are
1013 members of the same union. If so, there's a problem,
1014 unless they're actually members of the same structure
1015 which is itself a member of a union. For example, given:
1017 union { struct { int i; int j; }; };
1019 initializing both `i' and `j' makes sense. */
1024 {
1025 /* A mem-initializer hides an NSDMI. */
1030 else
1031 {
1034 ctx);
1036 }
1037 }
1041 next:
1044 splice:
1047 }
1048 }
1051 }
1053 /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS
1054 is a TREE_LIST giving the explicit mem-initializer-list for the
1055 constructor. The TREE_PURPOSE of each entry is a subobject (a
1056 FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE
1057 is a TREE_LIST giving the arguments to the constructor or
1058 void_type_node for an empty list of arguments. */
1060 void
1062 {
1065 /* We will already have issued an error message about the fact that
1066 the type is incomplete. */
1073 {
1074 /* Delegating constructor. */
1078 }
1084 /* Sort the mem-initializers into the order in which the
1085 initializations should be performed. */
1090 /* Initialize base classes. */
1094 {
1098 /* We already have issued an error message. */
1103 {
1104 /* If these initializations are taking place in a copy constructor,
1105 the base class should probably be explicitly initialized if there
1106 is a user-defined constructor in the base class (other than the
1107 default constructor, which will be called anyway). */
1115 }
1117 /* Initialize the base. */
1120 else
1121 {
1122 tree base_addr;
1128 tf_warning_or_error),
1129 arguments,
1130 flags,
1131 tf_warning_or_error);
1133 }
1134 }
1137 /* Initialize the vptrs. */
1140 /* Initialize the data members. */
1142 {
1146 }
1147 }
1149 /* Returns the address of the vtable (i.e., the value that should be
1150 assigned to the vptr) for BINFO. */
1152 tree
1154 {
1156 tree vtbl;
1159 /* If this is a virtual primary base, then the vtable we want to store
1160 is that for the base this is being used as the primary base of. We
1161 can't simply skip the initialization, because we may be expanding the
1162 inits of a subobject constructor where the virtual base layout
1163 can be different. */
1167 /* Figure out what vtable BINFO's vtable is based on, and mark it as
1168 used. */
1172 /* Now compute the address to use when initializing the vptr. */
1178 }
1180 /* This code sets up the virtual function tables appropriate for
1181 the pointer DECL. It is a one-ply initialization.
1183 BINFO is the exact type that DECL is supposed to be. In
1184 multiple inheritance, this might mean "C's A" if C : A, B. */
1186 static void
1188 {
1190 tree vtt_index;
1192 /* Compute the initializer for vptr. */
1195 /* We may get this vptr from a VTT, if this is a subobject
1196 constructor or subobject destructor. */
1199 {
1200 tree vtbl2;
1201 tree vtt_parm;
1203 /* Compute the value to use, when there's a VTT. */
1209 /* The actual initializer is the VTT value only in the subobject
1210 constructor. In maybe_clone_body we'll substitute NULL for
1211 the vtt_parm in the case of the non-subobject constructor. */
1216 vtbl2,
1217 vtbl);
1218 }
1220 /* Compute the location of the vtpr. */
1222 tf_warning_or_error),
1226 /* Assign the vtable to the vptr. */
1229 tf_warning_or_error));
1230 }
1232 /* If an exception is thrown in a constructor, those base classes already
1233 constructed must be destroyed. This function creates the cleanup
1234 for BINFO, which has just been constructed. If FLAG is non-NULL,
1235 it is a DECL which is nonzero when this base needs to be
1236 destroyed. */
1238 static void
1240 {
1241 tree expr;
1246 /* Call the destructor. */
1248 base_dtor_identifier,
1249 NULL,
1250 binfo,
1252 tf_warning_or_error);
1264 }
1266 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its
1267 constructor. */
1269 static void
1271 {
1272 tree inner_if_stmt;
1273 tree exp;
1274 tree flag;
1276 /* If there are virtual base classes with destructors, we need to
1277 emit cleanups to destroy them if an exception is thrown during
1278 the construction process. These exception regions (i.e., the
1279 period during which the cleanups must occur) begin from the time
1280 the construction is complete to the end of the function. If we
1281 create a conditional block in which to initialize the
1282 base-classes, then the cleanup region for the virtual base begins
1283 inside a block, and ends outside of that block. This situation
1284 confuses the sjlj exception-handling code. Therefore, we do not
1285 create a single conditional block, but one for each
1286 initialization. (That way the cleanup regions always begin
1287 in the outer block.) We trust the back end to figure out
1288 that the FLAG will not change across initializations, and
1289 avoid doing multiple tests. */
1294 /* Compute the location of the virtual base. If we're
1295 constructing virtual bases, then we must be the most derived
1296 class. Therefore, we don't have to look up the virtual base;
1297 we already know where it is. */
1306 }
1308 /* Find the context in which this FIELD can be initialized. */
1310 static tree
1312 {
1315 /* Anonymous union members can be initialized in the first enclosing
1316 non-anonymous union context. */
1320 }
1322 /* Function to give error message if member initialization specification
1323 is erroneous. FIELD is the member we decided to initialize.
1324 TYPE is the type for which the initialization is being performed.
1325 FIELD must be a member of TYPE.
1327 MEMBER_NAME is the name of the member. */
1329 static int
1331 {
1335 {
1337 member_name);
1339 }
1341 {
1344 field);
1346 }
1348 {
1352 }
1354 {
1356 member_name);
1358 }
1361 }
1363 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it
1364 is a _TYPE node or TYPE_DECL which names a base for that type.
1365 Check the validity of NAME, and return either the base _TYPE, base
1366 binfo, or the FIELD_DECL of the member. If NAME is invalid, return
1367 NULL_TREE and issue a diagnostic.
1369 An old style unnamed direct single base construction is permitted,
1370 where NAME is NULL. */
1372 tree
1374 {
1375 tree basetype;
1376 tree field;
1382 {
1383 /* This is an obsolete unnamed base class initializer. The
1384 parser will already have warned about its use. */
1386 {
1389 current_class_type);
1392 basetype = BINFO_TYPE
1397 current_class_type);
1399 }
1400 }
1402 {
1405 }
1408 else
1412 {
1413 tree class_binfo;
1414 tree direct_binfo;
1415 tree virtual_binfo;
1426 /* Look for a direct base. */
1431 /* Look for a virtual base -- unless the direct base is itself
1432 virtual. */
1436 /* [class.base.init]
1438 If a mem-initializer-id is ambiguous because it designates
1439 both a direct non-virtual base class and an inherited virtual
1440 base class, the mem-initializer is ill-formed. */
1442 {
1444 basetype);
1446 }
1449 {
1453 else
1457 }
1460 }
1461 else
1462 {
1465 else
1470 }
1473 }
1475 /* This is like `expand_member_init', only it stores one aggregate
1476 value into another.
1478 INIT comes in two flavors: it is either a value which
1479 is to be stored in EXP, or it is a parameter list
1480 to go to a constructor, which will operate on EXP.
1481 If INIT is not a parameter list for a constructor, then set
1482 LOOKUP_ONLYCONVERTING.
1483 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1484 the initializer, if FLAGS is 0, then it is the (init) form.
1485 If `init' is a CONSTRUCTOR, then we emit a warning message,
1486 explaining that such initializations are invalid.
1488 If INIT resolves to a CALL_EXPR which happens to return
1489 something of the type we are looking for, then we know
1490 that we can safely use that call to perform the
1491 initialization.
1493 The virtual function table pointer cannot be set up here, because
1494 we do not really know its type.
1496 This never calls operator=().
1498 When initializing, nothing is CONST.
1500 A default copy constructor may have to be used to perform the
1501 initialization.
1503 A constructor or a conversion operator may have to be used to
1504 perform the initialization, but not both, as it would be ambiguous. */
1506 tree
1508 {
1509 tree stmt_expr;
1510 tree compound_stmt;
1531 {
1532 tree itype;
1534 /* An array may not be initialized use the parenthesized
1535 initialization form -- unless the initializer is "()". */
1537 {
1541 }
1542 /* Must arrange to initialize each element of EXP
1543 from elements of INIT. */
1553 complain);
1557 /* Restore the type of init unless it was used directly. */
1561 }
1565 /* Just know that we've seen something for this node. */
1579 }
1581 static void
1583 tsubst_flags_t complain)
1584 {
1586 tree ctor_name;
1588 /* It fails because there may not be a constructor which takes
1589 its own type as the first (or only parameter), but which does
1590 take other types via a conversion. So, if the thing initializing
1591 the expression is a unit element of type X, first try X(X&),
1592 followed by initialization by X. If neither of these work
1593 out, then look hard. */
1594 tree rval;
1597 /* If we have direct-initialization from an initializer list, pull
1598 it out of the TREE_LIST so the code below can see it. */
1601 {
1605 }
1609 /* A brace-enclosed initializer for an aggregate. In C++0x this can
1610 happen for direct-initialization, too. */
1613 /* A CONSTRUCTOR of the target's type is a previously digested
1614 initializer, whether that happened just above or in
1615 cp_parser_late_parsing_nsdmi.
1617 A TARGET_EXPR with TARGET_EXPR_DIRECT_INIT_P or TARGET_EXPR_LIST_INIT_P
1618 set represents the whole initialization, so we shouldn't build up
1619 another ctor call. */
1626 {
1627 /* Early initialization via a TARGET_EXPR only works for
1628 complete objects. */
1635 }
1639 {
1640 /* Base subobjects should only get direct-initialization. */
1644 /* Do nothing. We hit this in two cases: Reference initialization,
1645 where we aren't initializing a real variable, so we don't want
1646 to run a new constructor; and catching an exception, where we
1647 have already built up the constructor call so we could wrap it
1649 else
1654 /* We need to protect the initialization of a catch parm with a
1655 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
1656 around the TARGET_EXPR for the copy constructor. See
1657 initialize_handler_parm. */
1658 {
1662 }
1663 else
1668 }
1673 {
1677 }
1678 else
1683 {
1684 /* Delegating constructor. */
1685 tree complete;
1686 tree base;
1689 /* Unshare the arguments for the second call. */
1692 {
1695 }
1698 complain);
1704 complain);
1709 base,
1710 complete);
1711 }
1712 else
1713 {
1716 else
1719 complain);
1720 }
1726 {
1729 {
1733 }
1734 }
1736 /* FIXME put back convert_to_void? */
1739 }
1741 /* This function is responsible for initializing EXP with INIT
1742 (if any).
1744 BINFO is the binfo of the type for who we are performing the
1745 initialization. For example, if W is a virtual base class of A and B,
1746 and C : A, B.
1747 If we are initializing B, then W must contain B's W vtable, whereas
1748 were we initializing C, W must contain C's W vtable.
1750 TRUE_EXP is nonzero if it is the true expression being initialized.
1751 In this case, it may be EXP, or may just contain EXP. The reason we
1752 need this is because if EXP is a base element of TRUE_EXP, we
1753 don't necessarily know by looking at EXP where its virtual
1754 baseclass fields should really be pointing. But we do know
1755 from TRUE_EXP. In constructors, we don't know anything about
1756 the value being initialized.
1758 FLAGS is just passed to `build_new_method_call'. See that function
1759 for its description. */
1761 static void
1763 tsubst_flags_t complain)
1764 {
1770 /* Use a function returning the desired type to initialize EXP for us.
1771 If the function is a constructor, and its first argument is
1772 NULL_TREE, know that it was meant for us--just slide exp on
1773 in and expand the constructor. Constructors now come
1774 as TARGET_EXPRs. */
1778 {
1780 /* If store_init_value returns NULL_TREE, the INIT has been
1781 recorded as the DECL_INITIAL for EXP. That means there's
1782 nothing more we have to do. */
1788 }
1790 /* If an explicit -- but empty -- initializer list was present,
1791 that's value-initialization. */
1793 {
1794 /* If the type has data but no user-provided ctor, we need to zero
1795 out the object. */
1798 {
1801 /* Don't clobber already initialized virtual bases. */
1804 field_size);
1807 }
1809 /* If we don't need to mess with the constructor at all,
1810 then we're done. */
1814 /* Otherwise fall through and call the constructor. */
1816 }
1818 /* We know that expand_default_init can handle everything we want
1819 at this point. */
1821 }
1823 /* Report an error if TYPE is not a user-defined, class type. If
1824 OR_ELSE is nonzero, give an error message. */
1826 int
1828 {
1833 {
1837 }
1839 }
1841 tree
1843 {
1849 else
1851 }
1853 /* Build a reference to a member of an aggregate. This is not a C++
1854 `&', but really something which can have its address taken, and
1855 then act as a pointer to member, for example TYPE :: FIELD can have
1856 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if
1857 this expression is the operand of "&".
1859 @@ Prints out lousy diagnostics for operator <typename>
1860 @@ fields.
1862 @@ This function should be rewritten and placed in search.c. */
1864 tree
1866 tsubst_flags_t complain)
1867 {
1868 tree decl;
1871 /* class templates can come in as TEMPLATE_DECLs here. */
1884 /* Callers should call mark_used before this point. */
1889 {
1893 }
1895 /* Entities other than non-static members need no further
1896 processing. */
1903 {
1907 }
1909 /* Set up BASEBINFO for member lookup. */
1912 /* A lot of this logic is now handled in lookup_member. */
1914 {
1915 /* Go from the TREE_BASELINK to the member function info. */
1919 {
1920 /* Get rid of a potential OVERLOAD around it. */
1923 /* Unique functions are handled easily. */
1925 /* For non-static member of base class, we need a special rule
1926 for access checking [class.protected]:
1928 If the access is to form a pointer to member, the
1929 nested-name-specifier shall name the derived class
1930 (or any class derived from that class). */
1934 complain);
1935 else
1937 complain);
1942 }
1943 else
1945 }
1947 /* We need additional test besides the one in
1948 check_accessibility_of_qualified_id in case it is
1949 a pointer to non-static member. */
1951 complain);
1954 {
1955 /* If MEMBER is non-static, then the program has fallen afoul of
1956 [expr.prim]:
1958 An id-expression that denotes a nonstatic data member or
1959 nonstatic member function of a class can only be used:
1961 -- as part of a class member access (_expr.ref_) in which the
1962 object-expression refers to the member's class or a class
1963 derived from that class, or
1965 -- to form a pointer to member (_expr.unary.op_), or
1967 -- in the body of a nonstatic member function of that class or
1968 of a class derived from that class (_class.mfct.nonstatic_), or
1970 -- in a mem-initializer for a constructor for that class or for
1971 a class derived from that class (_class.base.init_). */
1973 {
1974 /* Build a representation of the qualified name suitable
1975 for use as the operand to "&" -- even though the "&" is
1976 not actually present. */
1978 /* In Microsoft mode, treat a non-static member function as if
1979 it were a pointer-to-member. */
1981 {
1984 }
1989 }
1991 {
1995 }
1997 }
2002 }
2004 /* If DECL is a scalar enumeration constant or variable with a
2005 constant initializer, return the initializer (or, its initializers,
2006 recursively); otherwise, return DECL. If STRICT_P, the
2007 initializer is only returned if DECL is a
2008 constant-expression. If RETURN_AGGREGATE_CST_OK_P, it is ok to
2009 return an aggregate constant. */
2011 static tree
2013 {
2015 || (strict_p
2019 {
2020 tree init;
2021 /* If DECL is a static data member in a template
2022 specialization, we must instantiate it here. The
2023 initializer for the static data member is not processed
2024 until needed; we need it now. */
2029 {
2031 /* Treat the error as a constant to avoid cascading errors on
2032 excessively recursive template instantiation (c++/9335). */
2034 else
2036 }
2037 /* Initializers in templates are generally expanded during
2038 instantiation, so before that for const int i(2)
2039 INIT is a TREE_LIST with the actual initializer as
2040 TREE_VALUE. */
2042 && init
2049 || (!return_aggregate_cst_ok_p
2050 /* Unless RETURN_AGGREGATE_CST_OK_P is true, do not
2051 return an aggregate constant (of which string
2052 literals are a special case), as we do not want
2053 to make inadvertent copies of such entities, and
2054 we must be sure that their addresses are the
2055 same everywhere. */
2060 }
2062 }
2064 /* If DECL is a CONST_DECL, or a constant VAR_DECL initialized by constant
2065 of integral or enumeration type, or a constexpr variable of scalar type,
2066 then return that value. These are those variables permitted in constant
2067 expressions by [5.19/1]. */
2069 tree
2071 {
2074 }
2076 /* Like scalar_constant_value, but can also return aggregate initializers. */
2078 tree
2080 {
2083 }
2085 /* A more relaxed version of scalar_constant_value, used by the
2086 common C/C++ code. */
2088 tree
2090 {
2093 }
2094 \f
2095 /* Common subroutines of build_new and build_vec_delete. */
2096 \f
2097 /* Build and return a NEW_EXPR. If NELTS is non-NULL, TYPE[NELTS] is
2098 the type of the object being allocated; otherwise, it's just TYPE.
2099 INIT is the initializer, if any. USE_GLOBAL_NEW is true if the
2100 user explicitly wrote "::operator new". PLACEMENT, if non-NULL, is
2101 a vector of arguments to be provided as arguments to a placement
2102 new operator. This routine performs no semantic checks; it just
2103 creates and returns a NEW_EXPR. */
2105 static tree
2108 {
2109 tree init_list;
2110 tree new_expr;
2112 /* If INIT is NULL, the we want to store NULL_TREE in the NEW_EXPR.
2113 If INIT is not NULL, then we want to store VOID_ZERO_NODE. This
2114 permits us to distinguish the case of a missing initializer "new
2115 int" from an empty initializer "new int()". */
2120 else
2125 init_list);
2130 }
2132 /* Diagnose uninitialized const members or reference members of type
2133 TYPE. USING_NEW is used to disambiguate the diagnostic between a
2134 new expression without a new-initializer and a declaration. Returns
2135 the error count. */
2137 static int
2140 {
2141 tree field;
2148 {
2149 tree field_type;
2160 {
2163 {
2165 {
2169 else
2171 }
2172 else
2173 {
2178 else
2181 }
2184 }
2185 }
2188 {
2191 {
2193 {
2197 else
2199 }
2200 else
2201 {
2206 else
2209 }
2212 }
2213 }
2216 error_count
2219 }
2221 }
2223 int
2225 {
2227 }
2229 /* Call __cxa_bad_array_new_length to indicate that the size calculation
2230 overflowed. Pretend it returns sizetype so that it plays nicely in the
2231 COND_EXPR. */
2233 tree
2235 {
2239 NULL_TREE));
2242 }
2244 /* Call __cxa_bad_array_length to indicate that there were too many
2245 initializers. */
2247 tree
2249 {
2253 NULL_TREE));
2256 }
2258 /* Generate code for a new-expression, including calling the "operator
2259 new" function, initializing the object, and, if an exception occurs
2260 during construction, cleaning up. The arguments are as for
2261 build_raw_new_expr. This may change PLACEMENT and INIT. */
2263 static tree
2266 tsubst_flags_t complain)
2267 {
2269 /* True iff this is a call to "operator new[]" instead of just
2270 "operator new". */
2272 /* If ARRAY_P is true, the element type of the array. This is never
2273 an ARRAY_TYPE; for something like "new int[3][4]", the
2274 ELT_TYPE is "int". If ARRAY_P is false, this is the same type as
2275 TYPE. */
2276 tree elt_type;
2277 /* The type of the new-expression. (This type is always a pointer
2278 type.) */
2279 tree pointer_type;
2280 tree non_const_pointer_type;
2282 /* For arrays, a bounds checks on the NELTS parameter. */
2287 /* Size of the inner array elements. */
2288 offset_int inner_size;
2289 /* The address returned by the call to "operator new". This node is
2290 a VAR_DECL and is therefore reusable. */
2291 tree alloc_node;
2292 tree alloc_fn;
2296 /* If non-NULL, the number of extra bytes to allocate at the
2297 beginning of the storage allocated for an array-new expression in
2298 order to store the number of elements. */
2300 tree placement_first;
2302 /* True if the function we are calling is a placement allocation
2303 function. */
2305 /* True if the storage must be initialized, either by a constructor
2306 or due to an explicit new-initializer. */
2308 /* The address of the thing allocated, not including any cookie. In
2309 particular, if an array cookie is in use, DATA_ADDR is the
2310 address of the first array element. This node is a VAR_DECL, and
2311 is therefore reusable. */
2312 tree data_addr;
2317 {
2320 }
2322 {
2323 /* Transforms new (T[N]) to new T[N]. The former is a GNU
2324 extension for variable N. (This also covers new T where T is
2325 a VLA typedef.) */
2331 }
2333 /* If our base type is an array, then make sure we know how many elements
2334 it has. */
2338 {
2342 {
2347 {
2351 }
2353 }
2354 else
2355 {
2357 {
2361 }
2363 }
2367 inner_nelts_cst,
2368 complain);
2369 }
2372 {
2375 }
2380 /* Warn if we performed the (T[N]) to T[N] transformation and N is
2381 variable. */
2384 {
2386 {
2391 else
2396 }
2397 else
2399 }
2402 {
2406 }
2414 {
2416 /* A program that calls for default-initialization [...] of an
2417 entity of reference type is ill-formed. */
2421 /* A new-expression that creates an object of type T initializes
2422 that object as follows:
2423 - If the new-initializer is omitted:
2424 -- If T is a (possibly cv-qualified) non-POD class type
2425 (or array thereof), the object is default-initialized (8.5).
2426 [...]
2427 -- Otherwise, the object created has indeterminate
2428 value. If T is a const-qualified type, or a (possibly
2429 cv-qualified) POD class type (or array thereof)
2430 containing (directly or indirectly) a member of
2431 const-qualified type, the program is ill-formed; */
2441 }
2445 {
2449 }
2453 {
2454 /* Maximum available size in bytes. Half of the address space
2455 minus the cookie size. */
2456 offset_int max_size
2458 /* Maximum number of outer elements which can be allocated. */
2459 offset_int max_outer_nelts;
2460 tree max_outer_nelts_tree;
2466 /* Unconditionally subtract the cookie size. This decreases the
2467 maximum object size and is safe even if we choose not to use
2468 a cookie after all. */
2474 {
2478 }
2481 /* Only keep the top-most seven bits, to simplify encoding the
2482 constant in the instruction stream. */
2483 {
2487 shift);
2488 }
2493 outer_nelts,
2494 max_outer_nelts_tree);
2495 }
2499 /* If PLACEMENT is a single simple pointer type not passed by
2500 reference, prepare to capture it in a temporary variable. Do
2501 this now, since PLACEMENT will change in the calls below. */
2507 /* Allocate the object. */
2509 {
2510 tree class_addr;
2511 tree class_decl;
2515 {
2518 }
2527 {
2531 }
2533 {
2537 }
2542 }
2544 {
2547 }
2548 else
2549 {
2550 tree fnname;
2551 tree fns;
2557 && (array_p
2560 {
2561 /* Use a class-specific operator new. */
2562 /* If a cookie is required, add some extra space. */
2565 else
2566 {
2568 /* No size arithmetic necessary, so the size check is
2569 not needed. */
2572 }
2573 /* Perform the overflow check. */
2580 /* Create the argument list. */
2582 /* Do name-lookup to find the appropriate operator. */
2585 {
2589 }
2591 {
2593 {
2596 }
2598 }
2602 LOOKUP_NORMAL,
2604 complain);
2605 }
2606 else
2607 {
2608 /* Use a global operator new. */
2609 /* See if a cookie might be required. */
2611 {
2613 /* No size arithmetic necessary, so the size check is
2614 not needed. */
2617 }
2621 outer_nelts_check,
2623 }
2624 }
2631 /* If we found a simple case of PLACEMENT_EXPR above, then copy it
2632 into a temporary variable. */
2639 {
2644 {
2648 }
2649 }
2651 /* In the simple case, we can stop now. */
2656 /* Store the result of the allocation call in a variable so that we can
2657 use it more than once. */
2661 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */
2665 /* Now, check to see if this function is actually a placement
2666 allocation function. This can happen even when PLACEMENT is NULL
2667 because we might have something like:
2669 struct S { void* operator new (size_t, int i = 0); };
2671 A call to `new S' will get this allocation function, even though
2672 there is no explicit placement argument. If there is more than
2673 one argument, or there are variable arguments, then this is a
2674 placement allocation function. */
2675 placement_allocation_fn_p
2679 /* Preevaluate the placement args so that we don't reevaluate them for a
2680 placement delete. */
2682 {
2683 tree inits;
2687 alloc_expr);
2688 }
2690 /* unless an allocation function is declared with an empty excep-
2691 tion-specification (_except.spec_), throw(), it indicates failure to
2692 allocate storage by throwing a bad_alloc exception (clause _except_,
2693 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2694 cation function is declared with an empty exception-specification,
2695 throw(), it returns null to indicate failure to allocate storage and a
2696 non-null pointer otherwise.
2698 So check for a null exception spec on the op new we just called. */
2704 {
2705 tree cookie;
2706 tree cookie_ptr;
2707 tree size_ptr_type;
2709 /* Adjust so we're pointing to the start of the object. */
2712 /* Store the number of bytes allocated so that we can know how
2713 many elements to destroy later. We use the last sizeof
2714 (size_t) bytes to store the number of elements. */
2725 {
2726 /* Also store the element size. */
2737 }
2738 }
2739 else
2740 {
2743 }
2745 /* Now use a pointer to the type we've actually allocated. */
2747 /* But we want to operate on a non-const version to start with,
2748 since we'll be modifying the elements. */
2749 non_const_pointer_type = build_pointer_type
2753 /* Any further uses of alloc_node will want this type, too. */
2756 /* Now initialize the allocated object. Note that we preevaluate the
2757 initialization expression, apart from the actual constructor call or
2758 assignment--we do this because we want to delay the allocation as long
2759 as possible in order to minimize the size of the exception region for
2760 placement delete. */
2762 {
2767 {
2770 }
2773 {
2774 /* build_value_init doesn't work in templates, and we don't need
2775 the initializer anyway since we're going to throw it away and
2776 rebuild it at instantiation time, so just build up a single
2777 constructor call to get any appropriate diagnostics. */
2781 complete_ctor_identifier,
2783 LOOKUP_NORMAL,
2784 complain);
2786 }
2788 {
2792 {
2796 else
2797 {
2801 complain);
2802 else
2803 /* We'll check the length at runtime. */
2807 }
2808 }
2810 {
2814 else
2817 }
2818 init_expr
2822 integer_one_node,
2823 complain),
2824 vecinit,
2825 explicit_value_init_p,
2827 complain);
2829 /* An array initialization is stable because the initialization
2830 of each element is a full-expression, so the temporaries don't
2831 leak out. */
2833 }
2834 else
2835 {
2839 {
2841 complete_ctor_identifier,
2843 LOOKUP_NORMAL,
2844 complain);
2845 }
2847 {
2848 /* Something like `new int()'. */
2853 }
2854 else
2855 {
2856 tree ie;
2858 /* We are processing something like `new int (10)', which
2859 means allocate an int, and initialize it with 10. */
2862 complain);
2864 complain);
2865 }
2867 }
2872 /* If any part of the object initialization terminates by throwing an
2873 exception and a suitable deallocation function can be found, the
2874 deallocation function is called to free the memory in which the
2875 object was being constructed, after which the exception continues
2876 to propagate in the context of the new-expression. If no
2877 unambiguous matching deallocation function can be found,
2878 propagating the exception does not cause the object's memory to be
2879 freed. */
2881 {
2883 tree cleanup;
2885 /* The Standard is unclear here, but the right thing to do
2886 is to use the same method for finding deallocation
2887 functions that we use for finding allocation functions. */
2888 cleanup = (build_op_delete_call
2890 alloc_node,
2891 size,
2892 globally_qualified_p,
2894 alloc_fn,
2895 complain));
2900 /* This is much simpler if we were able to preevaluate all of
2901 the arguments to the constructor call. */
2902 {
2903 /* CLEANUP is compiler-generated, so no diagnostics. */
2907 /* Likewise, this try-catch is compiler-generated. */
2909 }
2910 else
2911 /* Ack! First we allocate the memory. Then we set our sentry
2912 variable to true, and expand a cleanup that deletes the
2913 memory if sentry is true. Then we run the constructor, and
2914 finally clear the sentry.
2916 We need to do this because we allocate the space first, so
2917 if there are any temporaries with cleanups in the
2918 constructor args and we weren't able to preevaluate them, we
2919 need this EH region to extend until end of full-expression
2920 to preserve nesting. */
2921 {
2929 /* CLEANUP is compiler-generated, so no diagnostics. */
2939 init_expr
2942 end));
2943 /* Likewise, this is compiler-generated. */
2945 }
2946 }
2947 }
2948 else
2951 /* Now build up the return value in reverse order. */
2961 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
2962 and return the call (which doesn't need to be adjusted). */
2964 else
2965 {
2967 {
2970 nullptr_node,
2971 complain);
2974 }
2976 /* Perform the allocation before anything else, so that ALLOC_NODE
2977 has been initialized before we start using it. */
2979 }
2984 /* A new-expression is never an lvalue. */
2988 }
2990 /* Generate a representation for a C++ "new" expression. *PLACEMENT
2991 is a vector of placement-new arguments (or NULL if none). If NELTS
2992 is NULL, TYPE is the type of the storage to be allocated. If NELTS
2993 is not NULL, then this is an array-new allocation; TYPE is the type
2994 of the elements in the array and NELTS is the number of elements in
2995 the array. *INIT, if non-NULL, is the initializer for the new
2996 object, or an empty vector to indicate an initializer of "()". If
2997 USE_GLOBAL_NEW is true, then the user explicitly wrote "::new"
2998 rather than just "new". This may change PLACEMENT and INIT. */
3000 tree
3003 {
3004 tree rval;
3013 /* Don't do auto deduction where it might affect mangling. */
3015 {
3018 {
3022 }
3023 }
3026 {
3033 use_global_new);
3044 }
3047 {
3049 {
3052 else
3054 }
3057 }
3059 /* ``A reference cannot be created by the new operator. A reference
3060 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
3061 returned by new.'' ARM 5.3.3 */
3063 {
3066 else
3069 }
3072 {
3076 }
3078 /* The type allocated must be complete. If the new-type-id was
3079 "T[N]" then we are just checking that "T" is complete here, but
3080 that is equivalent, since the value of "N" doesn't matter. */
3089 {
3095 }
3097 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
3102 }
3104 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
3106 tree
3108 {
3114 {
3117 {
3120 }
3122 }
3124 /* Mangle the class$ field. */
3125 {
3126 tree field;
3129 {
3133 }
3135 {
3138 }
3139 }
3143 {
3153 }
3155 }
3156 \f
3157 static tree
3159 special_function_kind auto_delete_vec,
3161 {
3162 tree virtual_size;
3164 tree size_exp;
3166 /* Temporary variables used by the loop. */
3169 /* This is the body of the loop that implements the deletion of a
3170 single element, and moves temp variables to next elements. */
3171 tree body;
3173 /* This is the LOOP_EXPR that governs the deletion of the elements. */
3176 /* This is the thing that governs what to do after the loop has run. */
3179 /* This is the BIND_EXPR which holds the outermost iterator of the
3180 loop. It is convenient to set this variable up and test it before
3181 executing any other code in the loop.
3182 This is also the containing expression returned by this function. */
3184 tree tmp;
3186 /* We should only have 1-D arrays here. */
3193 {
3196 "possible problem detected in invocation of "
3198 {
3201 "class-specific operator delete [] will be called, "
3203 }
3204 /* This size won't actually be used. */
3207 }
3214 {
3215 /* Make sure the destructor is callable. */
3217 {
3220 complain);
3223 }
3225 }
3227 /* The below is short by the cookie size. */
3232 tbase_init
3236 base),
3237 virtual_size),
3238 complain);
3256 complain);
3264 no_destructor:
3265 /* Delete the storage if appropriate. */
3267 {
3268 tree base_tbd;
3270 /* The below is short by the cookie size. */
3275 /* no header */
3277 else
3278 {
3279 tree cookie_size;
3283 MINUS_EXPR,
3286 cookie_size,
3287 complain);
3291 /* True size with header. */
3293 }
3300 complain);
3301 }
3305 ;
3308 else
3314 /* Outermost wrapper: If pointer is null, punt. */
3319 nullptr_node)),
3324 {
3327 }
3330 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
3334 }
3336 /* Create an unnamed variable of the indicated TYPE. */
3338 tree
3340 {
3341 tree decl;
3351 }
3353 /* Create a new temporary variable of the indicated TYPE, initialized
3354 to INIT.
3356 It is not entered into current_binding_level, because that breaks
3357 things when it comes time to do final cleanups (which take place
3358 "outside" the binding contour of the function). */
3360 tree
3362 {
3363 tree decl;
3369 tf_warning_or_error));
3372 }
3374 /* `build_vec_init' returns tree structure that performs
3375 initialization of a vector of aggregate types.
3377 BASE is a reference to the vector, of ARRAY_TYPE, or a pointer
3378 to the first element, of POINTER_TYPE.
3379 MAXINDEX is the maximum index of the array (one less than the
3380 number of elements). It is only used if BASE is a pointer or
3381 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
3383 INIT is the (possibly NULL) initializer.
3385 If EXPLICIT_VALUE_INIT_P is true, then INIT must be NULL. All
3386 elements in the array are value-initialized.
3388 FROM_ARRAY is 0 if we should init everything with INIT
3389 (i.e., every element initialized from INIT).
3390 FROM_ARRAY is 1 if we should index into INIT in parallel
3391 with initialization of DECL.
3392 FROM_ARRAY is 2 if we should index into INIT in parallel,
3393 but use assignment instead of initialization. */
3395 tree
3399 {
3400 tree rval;
3403 tree iterator;
3404 /* The type of BASE. */
3406 /* The type of an element in the array. */
3408 /* The element type reached after removing all outer array
3409 types. */
3410 tree inner_elt_type;
3411 /* The type of a pointer to an element in the array. */
3412 tree ptype;
3413 tree stmt_expr;
3414 tree compound_stmt;
3435 /* Look through the TARGET_EXPR around a compound literal. */
3441 /* If we have a braced-init-list, make sure that the array
3442 is big enough for all the initializers. */
3458 /* Don't do this if the CONSTRUCTOR might contain something
3459 that might throw and require us to clean up. */
3463 {
3464 /* Do non-default initialization of trivial arrays resulting from
3465 brace-enclosed initializers. In this case, digest_init and
3466 store_constructor will handle the semantics for us. */
3474 stmt_expr);
3476 }
3480 {
3486 }
3487 else
3490 /* The code we are generating looks like:
3491 ({
3492 T* t1 = (T*) base;
3493 T* rval = t1;
3494 ptrdiff_t iterator = maxindex;
3495 try {
3496 for (; iterator != -1; --iterator) {
3497 ... initialize *t1 ...
3498 ++t1;
3499 }
3500 } catch (...) {
3501 ... destroy elements that were constructed ...
3502 }
3503 rval;
3504 })
3506 We can omit the try and catch blocks if we know that the
3507 initialization will never throw an exception, or if the array
3508 elements do not have destructors. We can omit the loop completely if
3509 the elements of the array do not have constructors.
3511 We actually wrap the entire body of the above in a STMT_EXPR, for
3512 tidiness.
3514 When copying from array to another, when the array elements have
3515 only trivial copy constructors, we should use __builtin_memcpy
3516 rather than generating a loop. That way, we could take advantage
3517 of whatever cleverness the back end has for dealing with copies
3518 of blocks of memory. */
3527 /* If initializing one array from another, initialize element by
3528 element. We rely upon the below calls to do the argument
3529 checking. Evaluate the initializer before entering the try block. */
3531 {
3540 }
3542 /* Protect the entire array initialization so that we can destroy
3543 the partially constructed array if an exception is thrown.
3544 But don't do this if we're assigning. */
3547 {
3549 }
3551 /* Should we try to create a constant initializer? */
3559 /* If we're initializing a static array, we want to do static
3560 initialization of any elements with constant initializers even if
3561 some are non-constant. */
3567 /* Skip over the handling of non-empty init lists. */
3570 /* Maybe pull out constant value when from_array? */
3573 {
3574 /* Do non-default initialization of non-trivial arrays resulting from
3575 brace-enclosed initializers. */
3578 /* If the constructor already has the array type, it's been through
3579 digest_init, so we shouldn't try to do anything more. */
3584 {
3585 tree throw_call;
3590 }
3596 {
3598 tree one_init;
3600 num_initialized_elts++;
3607 else
3613 {
3616 {
3620 else
3622 }
3623 else
3624 {
3626 {
3631 }
3633 }
3634 }
3643 else
3647 complain);
3650 else
3652 }
3654 /* Any elements without explicit initializers get T{}. */
3656 }
3658 {
3663 {
3667 }
3668 }
3670 /* Now, default-initialize any remaining elements. We don't need to
3671 do that if a) the type does not need constructing, or b) we've
3672 already initialized all the elements.
3674 We do need to keep going if we're copying an array. */
3679 && (num_initialized_elts
3681 {
3682 /* If the ITERATOR is equal to -1, then we don't have to loop;
3683 we've already initialized all the elements. */
3684 tree for_stmt;
3685 tree elt_init;
3686 tree to;
3694 complain);
3701 /* If the initializer is {}, then all elements are initialized from T{}.
3702 But for non-classes, that's the same as value-initialization. */
3704 {
3706 {
3710 else
3713 }
3714 else
3715 {
3718 }
3719 }
3722 {
3723 tree from;
3726 {
3730 }
3731 else
3736 complain);
3741 complain);
3742 else
3744 }
3746 {
3748 sorry
3752 explicit_value_init_p,
3754 }
3756 {
3760 }
3761 else
3762 {
3766 else
3767 {
3770 complain);
3772 }
3773 }
3779 {
3782 {
3784 /* Don't fill the CONSTRUCTOR with zeros. */
3788 }
3789 else
3790 {
3794 }
3797 {
3800 {
3803 }
3804 }
3805 }
3813 complain));
3816 complain));
3819 }
3821 /* Make sure to cleanup any partially constructed elements. */
3824 {
3825 tree e;
3828 complain);
3830 /* Flatten multi-dimensional array since build_vec_delete only
3831 expects one-dimensional array. */
3835 /* Avoid mixing signed and unsigned. */
3838 complain);
3847 }
3849 /* The value of the array initialization is the array itself, RVAL
3850 is a pointer to the first element. */
3861 {
3863 {
3866 }
3869 else
3871 }
3873 /* Now make the result have the correct type. */
3875 {
3880 }
3883 }
3885 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
3886 build_delete. */
3888 static tree
3890 tsubst_flags_t complain)
3891 {
3892 tree name;
3893 tree fn;
3895 {
3910 }
3915 flags,
3917 complain);
3918 }
3920 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
3921 ADDR is an expression which yields the store to be destroyed.
3922 AUTO_DELETE is the name of the destructor to call, i.e., either
3923 sfk_complete_destructor, sfk_base_destructor, or
3924 sfk_deleting_destructor.
3926 FLAGS is the logical disjunction of zero or more LOOKUP_
3927 flags. See cp-tree.h for more info. */
3929 tree
3932 {
3933 tree expr;
3940 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
3941 set to `error_mark_node' before it gets properly cleaned up. */
3949 {
3951 {
3955 }
3958 }
3961 {
3964 /* We don't want to warn about delete of void*, only other
3965 incomplete types. Deleting other incomplete types
3966 invokes undefined behavior, but it is not ill-formed, so
3967 compile to something that would even do The Right Thing
3968 (TM) should the type have a trivial dtor and no delete
3969 operator. */
3971 {
3974 {
3977 "possible problem detected in invocation of "
3979 {
3982 "neither the destructor nor the class-specific "
3983 "operator delete will be called, even if they are "
3985 }
3986 }
3990 {
3991 tree dtor;
3994 {
3997 "deleting object of abstract class type %qT"
3998 " which has non-virtual destructor"
4000 else
4002 "deleting object of polymorphic class type %qT"
4003 " which has non-virtual destructor"
4005 }
4006 }
4007 }
4011 /* Throw away const and volatile on target type of addr. */
4013 }
4014 else
4015 {
4016 /* Don't check PROTECT here; leave that decision to the
4017 destructor. If the destructor is accessible, call it,
4018 else report error. */
4026 }
4029 {
4030 /* Make sure the destructor is callable. */
4032 {
4034 complain),
4038 }
4045 use_global_delete,
4048 complain);
4049 }
4050 else
4051 {
4054 tree ifexp;
4059 /* For `::delete x', we must not use the deleting destructor
4060 since then we would not be sure to get the global `operator
4061 delete'. */
4063 {
4064 /* We will use ADDR multiple times so we must save it. */
4067 /* Delete the object. */
4069 head,
4074 complain);
4075 /* Otherwise, treat this like a complete object destructor
4076 call. */
4078 }
4079 /* If the destructor is non-virtual, there is no deleting
4080 variant. Instead, we must explicitly call the appropriate
4081 `operator delete' here. */
4084 {
4085 /* We will use ADDR multiple times so we must save it. */
4087 /* Build the call. */
4089 addr,
4094 complain);
4095 /* Call the complete object destructor. */
4097 }
4100 {
4101 /* Make sure we have access to the member op delete, even though
4102 we'll actually be calling it from the destructor. */
4107 complain);
4108 }
4117 /* We need to calculate this before the dtor changes the vptr. */
4122 /* Explicit destructor call; don't check for null pointer. */
4124 else
4125 {
4126 /* Handle deleting a null pointer. */
4129 complain));
4132 }
4138 }
4139 }
4141 /* At the beginning of a destructor, push cleanups that will call the
4142 destructors for our base classes and members.
4144 Called from begin_destructor_body. */
4146 void
4148 {
4151 tree member;
4152 tree expr;
4155 /* Run destructors for all virtual baseclasses. */
4157 {
4158 tree cond = (condition_conversion
4160 current_in_charge_parm,
4161 integer_two_node)));
4163 /* The CLASSTYPE_VBASECLASSES vector is in initialization
4164 order, which is also the right order for pushing cleanups. */
4167 {
4169 {
4171 base_dtor_identifier,
4172 NULL,
4173 base_binfo,
4174 (LOOKUP_NORMAL
4176 tf_warning_or_error);
4178 {
4182 }
4183 }
4184 }
4185 }
4187 /* Take care of the remaining baseclasses. */
4190 {
4196 base_dtor_identifier,
4199 tf_warning_or_error);
4202 }
4204 /* Don't automatically destroy union members. */
4210 {
4219 {
4220 tree this_member = (build_class_member_access_expr
4224 tf_warning_or_error));
4226 sfk_complete_destructor,
4231 }
4232 }
4233 }
4235 /* Build a C++ vector delete expression.
4236 MAXINDEX is the number of elements to be deleted.
4237 ELT_SIZE is the nominal size of each element in the vector.
4238 BASE is the expression that should yield the store to be deleted.
4239 This function expands (or synthesizes) these calls itself.
4240 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
4242 This also calls delete for virtual baseclasses of elements of the vector.
4244 Update: MAXINDEX is no longer needed. The size can be extracted from the
4245 start of the vector for pointers, and from the type for arrays. We still
4246 use MAXINDEX for arrays because it happens to already have one of the
4247 values we'd have to extract. (We could use MAXINDEX with pointers to
4248 confirm the size, and trap if the numbers differ; not clear that it'd
4249 be worth bothering.) */
4251 tree
4253 special_function_kind auto_delete_vec,
4255 {
4256 tree type;
4257 tree rval;
4263 {
4264 /* Step back one from start of vector, and read dimension. */
4265 tree cookie_addr;
4270 {
4273 }
4278 cookie_addr);
4280 }
4282 {
4283 /* Get the total number of things in the array, maxindex is a
4284 bad name. */
4291 {
4294 }
4295 }
4296 else
4297 {
4301 }
4309 }