| blob | e600472c72c978a201e5d05b5476fe5dda581bce |
1 /* Handle initialization things in C++.
2 Copyright (C) 1987-2015 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. */
61 /* We are about to generate some complex initialization code.
62 Conceptually, it is all a single expression. However, we may want
63 to include conditionals, loops, and other such statement-level
64 constructs. Therefore, we build the initialization code inside a
65 statement-expression. This function starts such an expression.
66 STMT_EXPR_P and COMPOUND_STMT_P are filled in by this function;
67 pass them back to finish_init_stmts when the expression is
68 complete. */
70 static bool
72 {
79 }
81 /* Finish out the statement-expression begun by the previous call to
82 begin_init_stmts. Returns the statement-expression itself. */
84 static tree
86 {
94 }
96 /* Constructors */
98 /* Called from initialize_vtbl_ptrs via dfs_walk. BINFO is the base
99 which we want to initialize the vtable pointer for, DATA is
100 TREE_LIST whose TREE_VALUE is the this ptr expression. */
102 static tree
104 {
109 {
113 tf_warning_or_error);
116 }
119 }
121 /* Initialize all the vtable pointers in the object pointed to by
122 ADDR. */
124 void
126 {
127 tree list;
128 tree type;
133 /* Walk through the hierarchy, initializing the vptr in each base
134 class. We do these in pre-order because we can't find the virtual
135 bases for a class until we've initialized the vtbl for that
136 class. */
138 }
140 /* Return an expression for the zero-initialization of an object with
141 type T. This expression will either be a constant (in the case
142 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
143 aggregate), or NULL (in the case that T does not require
144 initialization). In either case, the value can be used as
145 DECL_INITIAL for a decl of the indicated TYPE; it is a valid static
146 initializer. If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS
147 is the number of elements in the array. If STATIC_STORAGE_P is
148 TRUE, initializers are only generated for entities for which
149 zero-initialization does not simply mean filling the storage with
150 zero bytes. FIELD_SIZE, if non-NULL, is the bit size of the field,
151 subfields with bit positions at or above that bit size shouldn't
152 be added. Note that this only works when the result is assigned
153 to a base COMPONENT_REF; if we only have a pointer to the base subobject,
154 expand_assignment will end up clearing the full size of TYPE. */
156 static tree
158 tree field_size)
159 {
162 /* [dcl.init]
164 To zero-initialize an object of type T means:
166 -- if T is a scalar type, the storage is set to the value of zero
167 converted to T.
169 -- if T is a non-union class type, the storage for each nonstatic
170 data member and each base-class subobject is zero-initialized.
172 -- if T is a union type, the storage for its first data member is
173 zero-initialized.
175 -- if T is an array type, the storage for each element is
176 zero-initialized.
178 -- if T is a reference type, no initialization is performed. */
183 ;
185 /* In order to save space, we do not explicitly build initializers
186 for items that do not need them. GCC's semantics are that
187 items with static storage duration that are not otherwise
188 initialized are initialized to zero. */
189 ;
195 {
196 tree field;
199 /* Iterate over the fields, building initializations. */
201 {
208 /* Don't add virtual bases for base classes if they are beyond
209 the size of the current field, that means it is present
210 somewhere else in the object. */
212 {
217 }
219 /* Note that for class types there will be FIELD_DECLs
220 corresponding to base classes as well. Thus, iterating
221 over TYPE_FIELDs will result in correct initialization of
222 all of the subobjects. */
224 {
225 tree new_field_size
232 static_storage_p,
233 new_field_size);
236 }
238 /* For unions, only the first field is initialized. */
241 }
243 /* Build a constructor to contain the initializations. */
245 }
247 {
248 tree max_index;
251 /* Iterate over the array elements, building initializations. */
256 else
259 /* If we have an error_mark here, we should just return error mark
260 as we don't know the size of the array yet. */
265 /* A zero-sized array, which is accepted as an extension, will
266 have an upper bound of -1. */
268 {
269 constructor_elt ce;
271 /* If this is a one element array, we just use a regular init. */
274 else
276 max_index);
282 {
285 }
286 }
288 /* Build a constructor to contain the initializations. */
290 }
293 else
296 /* In all cases, the initializer is a constant. */
301 }
303 /* Return an expression for the zero-initialization of an object with
304 type T. This expression will either be a constant (in the case
305 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
306 aggregate), or NULL (in the case that T does not require
307 initialization). In either case, the value can be used as
308 DECL_INITIAL for a decl of the indicated TYPE; it is a valid static
309 initializer. If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS
310 is the number of elements in the array. If STATIC_STORAGE_P is
311 TRUE, initializers are only generated for entities for which
312 zero-initialization does not simply mean filling the storage with
313 zero bytes. */
315 tree
317 {
319 }
321 /* Return a suitable initializer for value-initializing an object of type
322 TYPE, as described in [dcl.init]. */
324 tree
326 {
327 /* [dcl.init]
329 To value-initialize an object of type T means:
331 - if T is a class type (clause 9) with either no default constructor
332 (12.1) or a default constructor that is user-provided or deleted,
333 then then the object is default-initialized;
335 - if T is a (possibly cv-qualified) class type without a user-provided
336 or deleted default constructor, then the object is zero-initialized
337 and the semantic constraints for default-initialization are checked,
338 and if T has a non-trivial default constructor, the object is
339 default-initialized;
341 - if T is an array type, then each element is value-initialized;
343 - otherwise, the object is zero-initialized.
345 A program that calls for default-initialization or
346 value-initialization of an entity of reference type is ill-formed. */
348 /* The AGGR_INIT_EXPR tweaking below breaks in templates. */
354 {
355 tree ctor =
358 complain);
368 {
369 /* This is a class that needs constructing, but doesn't have
370 a user-provided constructor. So we need to zero-initialize
371 the object and then call the implicitly defined ctor.
372 This will be handled in simplify_aggr_init_expr. */
375 }
376 }
378 /* Discard any access checking during subobject initialization;
379 the checks are implied by the call to the ctor which we have
380 verified is OK (cpp0x/defaulted46.C). */
385 }
387 /* Like build_value_init, but don't call the constructor for TYPE. Used
388 for base initializers. */
390 tree
392 {
394 {
398 }
399 /* FIXME the class and array cases should just use digest_init once it is
400 SFINAE-enabled. */
402 {
407 {
408 tree field;
411 /* Iterate over the fields, building initializations. */
413 {
424 /* We could skip vfields and fields of types with
425 user-defined constructors, but I think that won't improve
426 performance at all; it should be simpler in general just
427 to zero out the entire object than try to only zero the
428 bits that actually need it. */
430 /* Note that for class types there will be FIELD_DECLs
431 corresponding to base classes as well. Thus, iterating
432 over TYPE_FIELDs will result in correct initialization of
433 all of the subobjects. */
442 /* We shouldn't have gotten here for anything that would need
443 non-trivial initialization, and gimplify_init_ctor_preeval
444 would need to be fixed to allow it. */
447 }
449 /* Build a constructor to contain the zero- initializations. */
451 }
452 }
454 {
457 /* Iterate over the array elements, building initializations. */
460 /* If we have an error_mark here, we should just return error mark
461 as we don't know the size of the array yet. */
463 {
466 type);
468 }
471 /* A zero-sized array, which is accepted as an extension, will
472 have an upper bound of -1. */
474 {
475 constructor_elt ce;
477 /* If this is a one element array, we just use a regular init. */
480 else
491 /* We shouldn't have gotten here for anything that would need
492 non-trivial initialization, and gimplify_init_ctor_preeval
493 would need to be fixed to allow it. */
496 }
498 /* Build a constructor to contain the initializations. */
500 }
502 {
506 }
508 {
512 }
515 }
517 /* Initialize current class with INIT, a TREE_LIST of
518 arguments for a target constructor. If TREE_LIST is void_type_node,
519 an empty initializer list was given. */
521 static void
523 {
529 tf_warning_or_error));
531 {
533 LOOKUP_NORMAL
534 |LOOKUP_NONVIRTUAL
540 }
541 }
543 /* Return the non-static data initializer for FIELD_DECL MEMBER. */
545 tree
547 {
548 tree init;
552 {
553 /* Use a PLACEHOLDER_EXPR when we don't have a 'this' parameter to
554 refer to; constexpr evaluation knows what to do with it. */
557 }
559 {
560 /* Do deferred instantiation of the NSDMI. */
561 init = (tsubst_copy_and_build
568 }
569 else
570 {
573 {
578 }
579 /* Strip redundant TARGET_EXPR so we don't need to remap it, and
580 so the aggregate init code below will see a CONSTRUCTOR. */
585 }
589 }
591 /* Initialize MEMBER, a FIELD_DECL, with INIT, a TREE_LIST of
592 arguments. If TREE_LIST is void_type_node, an empty initializer
593 list was given; if NULL_TREE no initializer was given. */
595 static void
597 {
598 tree decl;
601 /* Use the non-static data member initializer if there was no
602 mem-initializer for this field. */
609 /* Effective C++ rule 12 requires that all data members be
610 initialized. */
614 member);
616 /* Get an lvalue for the data member. */
620 tf_warning_or_error);
626 {
632 member);
633 }
636 {
637 /* mem() means value-initialization. */
639 {
643 }
644 else
645 {
651 }
652 }
653 /* Deal with this here, as we will get confused if we try to call the
654 assignment op for an anonymous union. This can happen in a
655 synthesized copy constructor. */
657 {
659 {
662 }
663 }
666 /* Pre-digested NSDMI. */
669 /* { } mem-initializer. */
674 {
675 /* With references and list-initialization, we need to deal with
676 extending temporary lifetimes. 12.2p5: "A temporary bound to a
677 reference member in a constructor’s ctor-initializer (12.6.2)
678 persists until the constructor exits." */
683 tf_warning_or_error);
685 {
690 }
693 /* A FIELD_DECL doesn't really have a suitable lifetime, but
694 make_temporary_var_for_ref_to_temp will treat it as automatic and
695 set_up_extended_ref_temp wants to use the decl in a warning. */
705 }
708 {
710 {
712 {
715 else
719 }
723 {
727 }
728 else
730 }
731 else
732 {
739 {
740 /* TYPE_NEEDS_CONSTRUCTING can be set just because we have a
741 vtable; still give this diagnostic. */
746 }
748 tf_warning_or_error));
749 }
750 }
751 else
752 {
754 {
755 tree core_type;
756 /* member traversal: note it leaves init NULL */
758 {
763 }
765 {
770 }
780 }
782 /* There was an explicit member initialization. Do some work
783 in that case. */
785 tf_warning_or_error);
789 tf_warning_or_error));
790 }
793 {
794 tree expr;
799 tf_warning_or_error);
802 tf_warning_or_error);
807 }
808 }
810 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
811 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
813 static tree
815 {
816 tree fields;
818 /* Note whether or not T is a union. */
823 {
824 tree fieldtype;
826 /* Skip CONST_DECLs for enumeration constants and so forth. */
831 /* Keep track of whether or not any fields are unions. */
835 /* For an anonymous struct or union, we must recursively
836 consider the fields of the anonymous type. They can be
837 directly initialized from the constructor. */
839 {
840 /* Add this field itself. Synthesized copy constructors
841 initialize the entire aggregate. */
843 /* And now add the fields in the anonymous aggregate. */
845 }
846 /* Add this field. */
849 }
852 }
854 /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives
855 a FIELD_DECL or BINFO in T that needs initialization. The
856 TREE_VALUE gives the initializer, or list of initializer arguments.
858 Return a TREE_LIST containing all of the initializations required
859 for T, in the order in which they should be performed. The output
860 list has the same format as the input. */
862 static tree
864 {
865 tree init;
867 tree sorted_inits;
868 tree next_subobject;
873 /* Build up a list of initializations. The TREE_PURPOSE of entry
874 will be the subobject (a FIELD_DECL or BINFO) to initialize. The
875 TREE_VALUE will be the constructor arguments, or NULL if no
876 explicit initialization was provided. */
879 /* Process the virtual bases. */
884 /* Process the direct bases. */
890 /* Process the non-static data members. */
892 /* Reverse the entire list of initializations, so that they are in
893 the order that they will actually be performed. */
896 /* If the user presented the initializers in an order different from
897 that in which they will actually occur, we issue a warning. Keep
898 track of the next subobject which can be explicitly initialized
899 without issuing a warning. */
902 /* Go through the explicit initializers, filling in TREE_PURPOSE in
903 the SORTED_INITS. */
905 {
906 tree subobject;
907 tree subobject_init;
911 /* If the explicit initializers are in sorted order, then
912 SUBOBJECT will be NEXT_SUBOBJECT, or something following
913 it. */
915 subobject_init;
920 /* Issue a warning if the explicit initializer order does not
921 match that which will actually occur.
922 ??? Are all these on the correct lines? */
924 {
928 else
933 else
937 }
939 /* Look again, from the beginning of the list. */
941 {
945 }
947 /* It is invalid to initialize the same subobject more than
948 once. */
950 {
954 subobject);
955 else
958 subobject);
959 }
961 /* Record the initialization. */
964 }
966 /* [class.base.init]
968 If a ctor-initializer specifies more than one mem-initializer for
969 multiple members of the same union (including members of
970 anonymous unions), the ctor-initializer is ill-formed.
972 Here we also splice out uninitialized union members. */
974 {
978 {
979 tree field;
980 tree ctx;
986 /* Skip base classes. */
990 /* If this is an anonymous union with no explicit initializer,
991 splice it out. */
995 /* See if this field is a member of a union, or a member of a
996 structure contained in a union, etc. */
1003 /* If this field is not a member of a union, skip it. */
1007 /* If this union member has no explicit initializer and no NSDMI,
1008 splice it out. */
1011 else
1014 /* It's only an error if we have two initializers for the same
1015 union type. */
1017 {
1020 }
1022 /* See if LAST_FIELD and the field initialized by INIT are
1023 members of the same union. If so, there's a problem,
1024 unless they're actually members of the same structure
1025 which is itself a member of a union. For example, given:
1027 union { struct { int i; int j; }; };
1029 initializing both `i' and `j' makes sense. */
1034 {
1035 /* A mem-initializer hides an NSDMI. */
1040 else
1041 {
1044 ctx);
1046 }
1047 }
1051 next:
1054 splice:
1057 }
1058 }
1061 }
1063 /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS
1064 is a TREE_LIST giving the explicit mem-initializer-list for the
1065 constructor. The TREE_PURPOSE of each entry is a subobject (a
1066 FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE
1067 is a TREE_LIST giving the arguments to the constructor or
1068 void_type_node for an empty list of arguments. */
1070 void
1072 {
1075 /* We will already have issued an error message about the fact that
1076 the type is incomplete. */
1083 {
1084 /* Delegating constructor. */
1088 }
1094 /* Sort the mem-initializers into the order in which the
1095 initializations should be performed. */
1100 /* Initialize base classes. */
1104 {
1108 /* We already have issued an error message. */
1113 {
1114 /* If these initializations are taking place in a copy constructor,
1115 the base class should probably be explicitly initialized if there
1116 is a user-defined constructor in the base class (other than the
1117 default constructor, which will be called anyway). */
1125 }
1127 /* Initialize the base. */
1130 else
1131 {
1132 tree base_addr;
1138 tf_warning_or_error),
1139 arguments,
1140 flags,
1141 tf_warning_or_error);
1143 }
1144 }
1147 /* Initialize the vptrs. */
1150 /* Initialize the data members. */
1152 {
1156 }
1157 }
1159 /* Returns the address of the vtable (i.e., the value that should be
1160 assigned to the vptr) for BINFO. */
1162 tree
1164 {
1166 tree vtbl;
1169 /* If this is a virtual primary base, then the vtable we want to store
1170 is that for the base this is being used as the primary base of. We
1171 can't simply skip the initialization, because we may be expanding the
1172 inits of a subobject constructor where the virtual base layout
1173 can be different. */
1177 /* Figure out what vtable BINFO's vtable is based on, and mark it as
1178 used. */
1182 /* Now compute the address to use when initializing the vptr. */
1188 }
1190 /* This code sets up the virtual function tables appropriate for
1191 the pointer DECL. It is a one-ply initialization.
1193 BINFO is the exact type that DECL is supposed to be. In
1194 multiple inheritance, this might mean "C's A" if C : A, B. */
1196 static void
1198 {
1200 tree vtt_index;
1202 /* Compute the initializer for vptr. */
1205 /* We may get this vptr from a VTT, if this is a subobject
1206 constructor or subobject destructor. */
1209 {
1210 tree vtbl2;
1211 tree vtt_parm;
1213 /* Compute the value to use, when there's a VTT. */
1219 /* The actual initializer is the VTT value only in the subobject
1220 constructor. In maybe_clone_body we'll substitute NULL for
1221 the vtt_parm in the case of the non-subobject constructor. */
1226 vtbl2,
1227 vtbl);
1228 }
1230 /* Compute the location of the vtpr. */
1232 tf_warning_or_error),
1236 /* Assign the vtable to the vptr. */
1239 tf_warning_or_error));
1240 }
1242 /* If an exception is thrown in a constructor, those base classes already
1243 constructed must be destroyed. This function creates the cleanup
1244 for BINFO, which has just been constructed. If FLAG is non-NULL,
1245 it is a DECL which is nonzero when this base needs to be
1246 destroyed. */
1248 static void
1250 {
1251 tree expr;
1256 /* Call the destructor. */
1258 base_dtor_identifier,
1259 NULL,
1260 binfo,
1262 tf_warning_or_error);
1274 }
1276 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its
1277 constructor. */
1279 static void
1281 {
1282 tree inner_if_stmt;
1283 tree exp;
1284 tree flag;
1286 /* If there are virtual base classes with destructors, we need to
1287 emit cleanups to destroy them if an exception is thrown during
1288 the construction process. These exception regions (i.e., the
1289 period during which the cleanups must occur) begin from the time
1290 the construction is complete to the end of the function. If we
1291 create a conditional block in which to initialize the
1292 base-classes, then the cleanup region for the virtual base begins
1293 inside a block, and ends outside of that block. This situation
1294 confuses the sjlj exception-handling code. Therefore, we do not
1295 create a single conditional block, but one for each
1296 initialization. (That way the cleanup regions always begin
1297 in the outer block.) We trust the back end to figure out
1298 that the FLAG will not change across initializations, and
1299 avoid doing multiple tests. */
1304 /* Compute the location of the virtual base. If we're
1305 constructing virtual bases, then we must be the most derived
1306 class. Therefore, we don't have to look up the virtual base;
1307 we already know where it is. */
1316 }
1318 /* Find the context in which this FIELD can be initialized. */
1320 static tree
1322 {
1325 /* Anonymous union members can be initialized in the first enclosing
1326 non-anonymous union context. */
1330 }
1332 /* Function to give error message if member initialization specification
1333 is erroneous. FIELD is the member we decided to initialize.
1334 TYPE is the type for which the initialization is being performed.
1335 FIELD must be a member of TYPE.
1337 MEMBER_NAME is the name of the member. */
1339 static int
1341 {
1345 {
1347 member_name);
1349 }
1351 {
1354 field);
1356 }
1358 {
1362 }
1364 {
1366 member_name);
1368 }
1371 }
1373 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it
1374 is a _TYPE node or TYPE_DECL which names a base for that type.
1375 Check the validity of NAME, and return either the base _TYPE, base
1376 binfo, or the FIELD_DECL of the member. If NAME is invalid, return
1377 NULL_TREE and issue a diagnostic.
1379 An old style unnamed direct single base construction is permitted,
1380 where NAME is NULL. */
1382 tree
1384 {
1385 tree basetype;
1386 tree field;
1392 {
1393 /* This is an obsolete unnamed base class initializer. The
1394 parser will already have warned about its use. */
1396 {
1399 current_class_type);
1402 basetype = BINFO_TYPE
1407 current_class_type);
1409 }
1410 }
1412 {
1415 }
1418 else
1422 {
1423 tree class_binfo;
1424 tree direct_binfo;
1425 tree virtual_binfo;
1436 /* Look for a direct base. */
1441 /* Look for a virtual base -- unless the direct base is itself
1442 virtual. */
1446 /* [class.base.init]
1448 If a mem-initializer-id is ambiguous because it designates
1449 both a direct non-virtual base class and an inherited virtual
1450 base class, the mem-initializer is ill-formed. */
1452 {
1454 basetype);
1456 }
1459 {
1463 else
1467 }
1470 }
1471 else
1472 {
1475 else
1480 }
1483 }
1485 /* This is like `expand_member_init', only it stores one aggregate
1486 value into another.
1488 INIT comes in two flavors: it is either a value which
1489 is to be stored in EXP, or it is a parameter list
1490 to go to a constructor, which will operate on EXP.
1491 If INIT is not a parameter list for a constructor, then set
1492 LOOKUP_ONLYCONVERTING.
1493 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1494 the initializer, if FLAGS is 0, then it is the (init) form.
1495 If `init' is a CONSTRUCTOR, then we emit a warning message,
1496 explaining that such initializations are invalid.
1498 If INIT resolves to a CALL_EXPR which happens to return
1499 something of the type we are looking for, then we know
1500 that we can safely use that call to perform the
1501 initialization.
1503 The virtual function table pointer cannot be set up here, because
1504 we do not really know its type.
1506 This never calls operator=().
1508 When initializing, nothing is CONST.
1510 A default copy constructor may have to be used to perform the
1511 initialization.
1513 A constructor or a conversion operator may have to be used to
1514 perform the initialization, but not both, as it would be ambiguous. */
1516 tree
1518 {
1519 tree stmt_expr;
1520 tree compound_stmt;
1541 {
1542 tree itype;
1544 /* An array may not be initialized use the parenthesized
1545 initialization form -- unless the initializer is "()". */
1547 {
1551 }
1552 /* Must arrange to initialize each element of EXP
1553 from elements of INIT. */
1563 complain);
1567 /* Restore the type of init unless it was used directly. */
1571 }
1575 /* Just know that we've seen something for this node. */
1589 }
1591 static void
1593 tsubst_flags_t complain)
1594 {
1596 tree ctor_name;
1598 /* It fails because there may not be a constructor which takes
1599 its own type as the first (or only parameter), but which does
1600 take other types via a conversion. So, if the thing initializing
1601 the expression is a unit element of type X, first try X(X&),
1602 followed by initialization by X. If neither of these work
1603 out, then look hard. */
1604 tree rval;
1607 /* If we have direct-initialization from an initializer list, pull
1608 it out of the TREE_LIST so the code below can see it. */
1611 {
1615 }
1619 /* A brace-enclosed initializer for an aggregate. In C++0x this can
1620 happen for direct-initialization, too. */
1623 /* A CONSTRUCTOR of the target's type is a previously digested
1624 initializer, whether that happened just above or in
1625 cp_parser_late_parsing_nsdmi.
1627 A TARGET_EXPR with TARGET_EXPR_DIRECT_INIT_P or TARGET_EXPR_LIST_INIT_P
1628 set represents the whole initialization, so we shouldn't build up
1629 another ctor call. */
1636 {
1637 /* Early initialization via a TARGET_EXPR only works for
1638 complete objects. */
1645 }
1649 {
1650 /* Base subobjects should only get direct-initialization. */
1654 /* Do nothing. We hit this in two cases: Reference initialization,
1655 where we aren't initializing a real variable, so we don't want
1656 to run a new constructor; and catching an exception, where we
1657 have already built up the constructor call so we could wrap it
1659 else
1664 /* We need to protect the initialization of a catch parm with a
1665 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
1666 around the TARGET_EXPR for the copy constructor. See
1667 initialize_handler_parm. */
1668 {
1672 }
1673 else
1678 }
1683 {
1687 }
1688 else
1693 {
1694 /* Delegating constructor. */
1695 tree complete;
1696 tree base;
1699 /* Unshare the arguments for the second call. */
1702 {
1705 }
1708 complain);
1714 complain);
1719 base,
1720 complete);
1721 }
1722 else
1723 {
1726 else
1729 complain);
1730 }
1736 {
1739 {
1743 }
1744 }
1746 /* FIXME put back convert_to_void? */
1749 }
1751 /* This function is responsible for initializing EXP with INIT
1752 (if any).
1754 BINFO is the binfo of the type for who we are performing the
1755 initialization. For example, if W is a virtual base class of A and B,
1756 and C : A, B.
1757 If we are initializing B, then W must contain B's W vtable, whereas
1758 were we initializing C, W must contain C's W vtable.
1760 TRUE_EXP is nonzero if it is the true expression being initialized.
1761 In this case, it may be EXP, or may just contain EXP. The reason we
1762 need this is because if EXP is a base element of TRUE_EXP, we
1763 don't necessarily know by looking at EXP where its virtual
1764 baseclass fields should really be pointing. But we do know
1765 from TRUE_EXP. In constructors, we don't know anything about
1766 the value being initialized.
1768 FLAGS is just passed to `build_new_method_call'. See that function
1769 for its description. */
1771 static void
1773 tsubst_flags_t complain)
1774 {
1780 /* Use a function returning the desired type to initialize EXP for us.
1781 If the function is a constructor, and its first argument is
1782 NULL_TREE, know that it was meant for us--just slide exp on
1783 in and expand the constructor. Constructors now come
1784 as TARGET_EXPRs. */
1788 {
1790 /* If store_init_value returns NULL_TREE, the INIT has been
1791 recorded as the DECL_INITIAL for EXP. That means there's
1792 nothing more we have to do. */
1798 }
1800 /* If an explicit -- but empty -- initializer list was present,
1801 that's value-initialization. */
1803 {
1804 /* If the type has data but no user-provided ctor, we need to zero
1805 out the object. */
1808 {
1811 /* Don't clobber already initialized virtual bases. */
1814 field_size);
1817 }
1819 /* If we don't need to mess with the constructor at all,
1820 then we're done. */
1824 /* Otherwise fall through and call the constructor. */
1826 }
1828 /* We know that expand_default_init can handle everything we want
1829 at this point. */
1831 }
1833 /* Report an error if TYPE is not a user-defined, class type. If
1834 OR_ELSE is nonzero, give an error message. */
1836 int
1838 {
1843 {
1847 }
1849 }
1851 tree
1853 {
1859 else
1861 }
1863 /* Build a reference to a member of an aggregate. This is not a C++
1864 `&', but really something which can have its address taken, and
1865 then act as a pointer to member, for example TYPE :: FIELD can have
1866 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if
1867 this expression is the operand of "&".
1869 @@ Prints out lousy diagnostics for operator <typename>
1870 @@ fields.
1872 @@ This function should be rewritten and placed in search.c. */
1874 tree
1876 tsubst_flags_t complain)
1877 {
1878 tree decl;
1881 /* class templates can come in as TEMPLATE_DECLs here. */
1894 /* Callers should call mark_used before this point. */
1899 {
1903 }
1905 /* Entities other than non-static members need no further
1906 processing. */
1913 {
1917 }
1919 /* Set up BASEBINFO for member lookup. */
1922 /* A lot of this logic is now handled in lookup_member. */
1924 {
1925 /* Go from the TREE_BASELINK to the member function info. */
1929 {
1930 /* Get rid of a potential OVERLOAD around it. */
1933 /* Unique functions are handled easily. */
1935 /* For non-static member of base class, we need a special rule
1936 for access checking [class.protected]:
1938 If the access is to form a pointer to member, the
1939 nested-name-specifier shall name the derived class
1940 (or any class derived from that class). */
1944 complain);
1945 else
1947 complain);
1952 }
1953 else
1955 }
1957 /* We need additional test besides the one in
1958 check_accessibility_of_qualified_id in case it is
1959 a pointer to non-static member. */
1961 complain);
1964 {
1965 /* If MEMBER is non-static, then the program has fallen afoul of
1966 [expr.prim]:
1968 An id-expression that denotes a nonstatic data member or
1969 nonstatic member function of a class can only be used:
1971 -- as part of a class member access (_expr.ref_) in which the
1972 object-expression refers to the member's class or a class
1973 derived from that class, or
1975 -- to form a pointer to member (_expr.unary.op_), or
1977 -- in the body of a nonstatic member function of that class or
1978 of a class derived from that class (_class.mfct.nonstatic_), or
1980 -- in a mem-initializer for a constructor for that class or for
1981 a class derived from that class (_class.base.init_). */
1983 {
1984 /* Build a representation of the qualified name suitable
1985 for use as the operand to "&" -- even though the "&" is
1986 not actually present. */
1988 /* In Microsoft mode, treat a non-static member function as if
1989 it were a pointer-to-member. */
1991 {
1994 }
1999 }
2001 {
2005 }
2007 }
2012 }
2014 /* If DECL is a scalar enumeration constant or variable with a
2015 constant initializer, return the initializer (or, its initializers,
2016 recursively); otherwise, return DECL. If STRICT_P, the
2017 initializer is only returned if DECL is a
2018 constant-expression. If RETURN_AGGREGATE_CST_OK_P, it is ok to
2019 return an aggregate constant. */
2021 static tree
2023 {
2025 || (strict_p
2029 {
2030 tree init;
2031 /* If DECL is a static data member in a template
2032 specialization, we must instantiate it here. The
2033 initializer for the static data member is not processed
2034 until needed; we need it now. */
2039 {
2041 /* Treat the error as a constant to avoid cascading errors on
2042 excessively recursive template instantiation (c++/9335). */
2044 else
2046 }
2047 /* Initializers in templates are generally expanded during
2048 instantiation, so before that for const int i(2)
2049 INIT is a TREE_LIST with the actual initializer as
2050 TREE_VALUE. */
2052 && init
2059 || (!return_aggregate_cst_ok_p
2060 /* Unless RETURN_AGGREGATE_CST_OK_P is true, do not
2061 return an aggregate constant (of which string
2062 literals are a special case), as we do not want
2063 to make inadvertent copies of such entities, and
2064 we must be sure that their addresses are the
2065 same everywhere. */
2070 }
2072 }
2074 /* If DECL is a CONST_DECL, or a constant VAR_DECL initialized by constant
2075 of integral or enumeration type, or a constexpr variable of scalar type,
2076 then return that value. These are those variables permitted in constant
2077 expressions by [5.19/1]. */
2079 tree
2081 {
2084 }
2086 /* Like scalar_constant_value, but can also return aggregate initializers. */
2088 tree
2090 {
2093 }
2095 /* A more relaxed version of scalar_constant_value, used by the
2096 common C/C++ code. */
2098 tree
2100 {
2103 }
2104 \f
2105 /* Common subroutines of build_new and build_vec_delete. */
2106 \f
2107 /* Build and return a NEW_EXPR. If NELTS is non-NULL, TYPE[NELTS] is
2108 the type of the object being allocated; otherwise, it's just TYPE.
2109 INIT is the initializer, if any. USE_GLOBAL_NEW is true if the
2110 user explicitly wrote "::operator new". PLACEMENT, if non-NULL, is
2111 a vector of arguments to be provided as arguments to a placement
2112 new operator. This routine performs no semantic checks; it just
2113 creates and returns a NEW_EXPR. */
2115 static tree
2118 {
2119 tree init_list;
2120 tree new_expr;
2122 /* If INIT is NULL, the we want to store NULL_TREE in the NEW_EXPR.
2123 If INIT is not NULL, then we want to store VOID_ZERO_NODE. This
2124 permits us to distinguish the case of a missing initializer "new
2125 int" from an empty initializer "new int()". */
2130 else
2135 init_list);
2140 }
2142 /* Diagnose uninitialized const members or reference members of type
2143 TYPE. USING_NEW is used to disambiguate the diagnostic between a
2144 new expression without a new-initializer and a declaration. Returns
2145 the error count. */
2147 static int
2150 {
2151 tree field;
2158 {
2159 tree field_type;
2170 {
2173 {
2175 {
2179 else
2181 }
2182 else
2183 {
2188 else
2191 }
2194 }
2195 }
2198 {
2201 {
2203 {
2207 else
2209 }
2210 else
2211 {
2216 else
2219 }
2222 }
2223 }
2226 error_count
2229 }
2231 }
2233 int
2235 {
2237 }
2239 /* Call __cxa_bad_array_new_length to indicate that the size calculation
2240 overflowed. Pretend it returns sizetype so that it plays nicely in the
2241 COND_EXPR. */
2243 tree
2245 {
2249 NULL_TREE));
2252 }
2254 /* Generate code for a new-expression, including calling the "operator
2255 new" function, initializing the object, and, if an exception occurs
2256 during construction, cleaning up. The arguments are as for
2257 build_raw_new_expr. This may change PLACEMENT and INIT. */
2259 static tree
2262 tsubst_flags_t complain)
2263 {
2265 /* True iff this is a call to "operator new[]" instead of just
2266 "operator new". */
2268 /* If ARRAY_P is true, the element type of the array. This is never
2269 an ARRAY_TYPE; for something like "new int[3][4]", the
2270 ELT_TYPE is "int". If ARRAY_P is false, this is the same type as
2271 TYPE. */
2272 tree elt_type;
2273 /* The type of the new-expression. (This type is always a pointer
2274 type.) */
2275 tree pointer_type;
2276 tree non_const_pointer_type;
2278 /* For arrays, a bounds checks on the NELTS parameter. */
2283 /* Size of the inner array elements. */
2284 offset_int inner_size;
2285 /* The address returned by the call to "operator new". This node is
2286 a VAR_DECL and is therefore reusable. */
2287 tree alloc_node;
2288 tree alloc_fn;
2292 /* If non-NULL, the number of extra bytes to allocate at the
2293 beginning of the storage allocated for an array-new expression in
2294 order to store the number of elements. */
2296 tree placement_first;
2298 /* True if the function we are calling is a placement allocation
2299 function. */
2301 /* True if the storage must be initialized, either by a constructor
2302 or due to an explicit new-initializer. */
2304 /* The address of the thing allocated, not including any cookie. In
2305 particular, if an array cookie is in use, DATA_ADDR is the
2306 address of the first array element. This node is a VAR_DECL, and
2307 is therefore reusable. */
2308 tree data_addr;
2313 {
2316 }
2318 {
2319 /* Transforms new (T[N]) to new T[N]. The former is a GNU
2320 extension for variable N. (This also covers new T where T is
2321 a VLA typedef.) */
2327 }
2329 /* If our base type is an array, then make sure we know how many elements
2330 it has. */
2334 {
2338 {
2343 {
2347 }
2349 }
2350 else
2351 {
2353 {
2357 }
2359 }
2363 inner_nelts_cst,
2364 complain);
2365 }
2368 {
2371 }
2376 /* Warn if we performed the (T[N]) to T[N] transformation and N is
2377 variable. */
2380 {
2382 {
2387 else
2392 }
2393 else
2395 }
2398 {
2402 }
2410 {
2412 /* A program that calls for default-initialization [...] of an
2413 entity of reference type is ill-formed. */
2417 /* A new-expression that creates an object of type T initializes
2418 that object as follows:
2419 - If the new-initializer is omitted:
2420 -- If T is a (possibly cv-qualified) non-POD class type
2421 (or array thereof), the object is default-initialized (8.5).
2422 [...]
2423 -- Otherwise, the object created has indeterminate
2424 value. If T is a const-qualified type, or a (possibly
2425 cv-qualified) POD class type (or array thereof)
2426 containing (directly or indirectly) a member of
2427 const-qualified type, the program is ill-formed; */
2437 }
2441 {
2445 }
2449 {
2450 /* Maximum available size in bytes. Half of the address space
2451 minus the cookie size. */
2452 offset_int max_size
2454 /* Maximum number of outer elements which can be allocated. */
2455 offset_int max_outer_nelts;
2456 tree max_outer_nelts_tree;
2462 /* Unconditionally subtract the cookie size. This decreases the
2463 maximum object size and is safe even if we choose not to use
2464 a cookie after all. */
2470 {
2474 }
2477 /* Only keep the top-most seven bits, to simplify encoding the
2478 constant in the instruction stream. */
2479 {
2483 shift);
2484 }
2489 outer_nelts,
2490 max_outer_nelts_tree);
2491 }
2495 /* If PLACEMENT is a single simple pointer type not passed by
2496 reference, prepare to capture it in a temporary variable. Do
2497 this now, since PLACEMENT will change in the calls below. */
2503 /* Allocate the object. */
2505 {
2506 tree class_addr;
2507 tree class_decl;
2511 {
2514 }
2523 {
2527 }
2529 {
2533 }
2538 }
2540 {
2543 }
2544 else
2545 {
2546 tree fnname;
2547 tree fns;
2553 && (array_p
2556 {
2557 /* Use a class-specific operator new. */
2558 /* If a cookie is required, add some extra space. */
2561 else
2562 {
2564 /* No size arithmetic necessary, so the size check is
2565 not needed. */
2568 }
2569 /* Perform the overflow check. */
2576 /* Create the argument list. */
2578 /* Do name-lookup to find the appropriate operator. */
2581 {
2585 }
2587 {
2589 {
2592 }
2594 }
2598 LOOKUP_NORMAL,
2600 complain);
2601 }
2602 else
2603 {
2604 /* Use a global operator new. */
2605 /* See if a cookie might be required. */
2607 {
2609 /* No size arithmetic necessary, so the size check is
2610 not needed. */
2613 }
2617 outer_nelts_check,
2619 }
2620 }
2627 /* If we found a simple case of PLACEMENT_EXPR above, then copy it
2628 into a temporary variable. */
2635 {
2640 {
2644 }
2645 }
2647 /* In the simple case, we can stop now. */
2652 /* Store the result of the allocation call in a variable so that we can
2653 use it more than once. */
2657 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */
2661 /* Now, check to see if this function is actually a placement
2662 allocation function. This can happen even when PLACEMENT is NULL
2663 because we might have something like:
2665 struct S { void* operator new (size_t, int i = 0); };
2667 A call to `new S' will get this allocation function, even though
2668 there is no explicit placement argument. If there is more than
2669 one argument, or there are variable arguments, then this is a
2670 placement allocation function. */
2671 placement_allocation_fn_p
2675 /* Preevaluate the placement args so that we don't reevaluate them for a
2676 placement delete. */
2678 {
2679 tree inits;
2683 alloc_expr);
2684 }
2686 /* unless an allocation function is declared with an empty excep-
2687 tion-specification (_except.spec_), throw(), it indicates failure to
2688 allocate storage by throwing a bad_alloc exception (clause _except_,
2689 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2690 cation function is declared with an empty exception-specification,
2691 throw(), it returns null to indicate failure to allocate storage and a
2692 non-null pointer otherwise.
2694 So check for a null exception spec on the op new we just called. */
2700 {
2701 tree cookie;
2702 tree cookie_ptr;
2703 tree size_ptr_type;
2705 /* Adjust so we're pointing to the start of the object. */
2708 /* Store the number of bytes allocated so that we can know how
2709 many elements to destroy later. We use the last sizeof
2710 (size_t) bytes to store the number of elements. */
2721 {
2722 /* Also store the element size. */
2733 }
2734 }
2735 else
2736 {
2739 }
2741 /* Now use a pointer to the type we've actually allocated. */
2743 /* But we want to operate on a non-const version to start with,
2744 since we'll be modifying the elements. */
2745 non_const_pointer_type = build_pointer_type
2749 /* Any further uses of alloc_node will want this type, too. */
2752 /* Now initialize the allocated object. Note that we preevaluate the
2753 initialization expression, apart from the actual constructor call or
2754 assignment--we do this because we want to delay the allocation as long
2755 as possible in order to minimize the size of the exception region for
2756 placement delete. */
2758 {
2763 {
2766 }
2769 {
2770 /* build_value_init doesn't work in templates, and we don't need
2771 the initializer anyway since we're going to throw it away and
2772 rebuild it at instantiation time, so just build up a single
2773 constructor call to get any appropriate diagnostics. */
2777 complete_ctor_identifier,
2779 LOOKUP_NORMAL,
2780 complain);
2782 }
2784 {
2788 {
2792 else
2793 {
2797 complain);
2798 else
2799 /* We'll check the length at runtime. */
2803 }
2804 }
2806 {
2810 else
2813 }
2814 init_expr
2818 integer_one_node,
2819 complain),
2820 vecinit,
2821 explicit_value_init_p,
2823 complain);
2825 /* An array initialization is stable because the initialization
2826 of each element is a full-expression, so the temporaries don't
2827 leak out. */
2829 }
2830 else
2831 {
2835 {
2837 complete_ctor_identifier,
2839 LOOKUP_NORMAL,
2840 complain);
2841 }
2843 {
2844 /* Something like `new int()'. */
2849 }
2850 else
2851 {
2852 tree ie;
2854 /* We are processing something like `new int (10)', which
2855 means allocate an int, and initialize it with 10. */
2858 complain);
2860 complain);
2861 }
2863 }
2868 /* If any part of the object initialization terminates by throwing an
2869 exception and a suitable deallocation function can be found, the
2870 deallocation function is called to free the memory in which the
2871 object was being constructed, after which the exception continues
2872 to propagate in the context of the new-expression. If no
2873 unambiguous matching deallocation function can be found,
2874 propagating the exception does not cause the object's memory to be
2875 freed. */
2877 {
2879 tree cleanup;
2881 /* The Standard is unclear here, but the right thing to do
2882 is to use the same method for finding deallocation
2883 functions that we use for finding allocation functions. */
2884 cleanup = (build_op_delete_call
2886 alloc_node,
2887 size,
2888 globally_qualified_p,
2890 alloc_fn,
2891 complain));
2896 /* This is much simpler if we were able to preevaluate all of
2897 the arguments to the constructor call. */
2898 {
2899 /* CLEANUP is compiler-generated, so no diagnostics. */
2903 /* Likewise, this try-catch is compiler-generated. */
2905 }
2906 else
2907 /* Ack! First we allocate the memory. Then we set our sentry
2908 variable to true, and expand a cleanup that deletes the
2909 memory if sentry is true. Then we run the constructor, and
2910 finally clear the sentry.
2912 We need to do this because we allocate the space first, so
2913 if there are any temporaries with cleanups in the
2914 constructor args and we weren't able to preevaluate them, we
2915 need this EH region to extend until end of full-expression
2916 to preserve nesting. */
2917 {
2925 /* CLEANUP is compiler-generated, so no diagnostics. */
2935 init_expr
2938 end));
2939 /* Likewise, this is compiler-generated. */
2941 }
2942 }
2943 }
2944 else
2947 /* Now build up the return value in reverse order. */
2957 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
2958 and return the call (which doesn't need to be adjusted). */
2960 else
2961 {
2963 {
2966 nullptr_node,
2967 complain);
2970 }
2972 /* Perform the allocation before anything else, so that ALLOC_NODE
2973 has been initialized before we start using it. */
2975 }
2980 /* A new-expression is never an lvalue. */
2984 }
2986 /* Generate a representation for a C++ "new" expression. *PLACEMENT
2987 is a vector of placement-new arguments (or NULL if none). If NELTS
2988 is NULL, TYPE is the type of the storage to be allocated. If NELTS
2989 is not NULL, then this is an array-new allocation; TYPE is the type
2990 of the elements in the array and NELTS is the number of elements in
2991 the array. *INIT, if non-NULL, is the initializer for the new
2992 object, or an empty vector to indicate an initializer of "()". If
2993 USE_GLOBAL_NEW is true, then the user explicitly wrote "::new"
2994 rather than just "new". This may change PLACEMENT and INIT. */
2996 tree
2999 {
3000 tree rval;
3009 /* Don't do auto deduction where it might affect mangling. */
3011 {
3014 {
3018 }
3019 }
3022 {
3029 use_global_new);
3040 }
3043 {
3045 {
3048 else
3050 }
3053 }
3055 /* ``A reference cannot be created by the new operator. A reference
3056 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
3057 returned by new.'' ARM 5.3.3 */
3059 {
3062 else
3065 }
3068 {
3072 }
3074 /* The type allocated must be complete. If the new-type-id was
3075 "T[N]" then we are just checking that "T" is complete here, but
3076 that is equivalent, since the value of "N" doesn't matter. */
3085 {
3091 }
3093 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
3098 }
3100 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
3102 tree
3104 {
3110 {
3113 {
3116 }
3118 }
3120 /* Mangle the class$ field. */
3121 {
3122 tree field;
3125 {
3129 }
3131 {
3134 }
3135 }
3139 {
3149 }
3151 }
3152 \f
3153 static tree
3155 special_function_kind auto_delete_vec,
3157 {
3158 tree virtual_size;
3160 tree size_exp;
3162 /* Temporary variables used by the loop. */
3165 /* This is the body of the loop that implements the deletion of a
3166 single element, and moves temp variables to next elements. */
3167 tree body;
3169 /* This is the LOOP_EXPR that governs the deletion of the elements. */
3172 /* This is the thing that governs what to do after the loop has run. */
3175 /* This is the BIND_EXPR which holds the outermost iterator of the
3176 loop. It is convenient to set this variable up and test it before
3177 executing any other code in the loop.
3178 This is also the containing expression returned by this function. */
3180 tree tmp;
3182 /* We should only have 1-D arrays here. */
3189 {
3192 "possible problem detected in invocation of "
3194 {
3197 "class-specific operator delete [] will be called, "
3199 }
3200 /* This size won't actually be used. */
3203 }
3210 {
3211 /* Make sure the destructor is callable. */
3213 {
3216 complain);
3219 }
3221 }
3223 /* The below is short by the cookie size. */
3228 tbase_init
3232 base),
3233 virtual_size),
3234 complain);
3252 complain);
3260 no_destructor:
3261 /* Delete the storage if appropriate. */
3263 {
3264 tree base_tbd;
3266 /* The below is short by the cookie size. */
3271 /* no header */
3273 else
3274 {
3275 tree cookie_size;
3279 MINUS_EXPR,
3282 cookie_size,
3283 complain);
3287 /* True size with header. */
3289 }
3296 complain);
3297 }
3301 ;
3304 else
3310 /* Outermost wrapper: If pointer is null, punt. */
3315 nullptr_node)),
3320 {
3323 }
3326 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
3330 }
3332 /* Create an unnamed variable of the indicated TYPE. */
3334 tree
3336 {
3337 tree decl;
3347 }
3349 /* Create a new temporary variable of the indicated TYPE, initialized
3350 to INIT.
3352 It is not entered into current_binding_level, because that breaks
3353 things when it comes time to do final cleanups (which take place
3354 "outside" the binding contour of the function). */
3356 tree
3358 {
3359 tree decl;
3365 tf_warning_or_error));
3368 }
3370 /* `build_vec_init' returns tree structure that performs
3371 initialization of a vector of aggregate types.
3373 BASE is a reference to the vector, of ARRAY_TYPE, or a pointer
3374 to the first element, of POINTER_TYPE.
3375 MAXINDEX is the maximum index of the array (one less than the
3376 number of elements). It is only used if BASE is a pointer or
3377 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
3379 INIT is the (possibly NULL) initializer.
3381 If EXPLICIT_VALUE_INIT_P is true, then INIT must be NULL. All
3382 elements in the array are value-initialized.
3384 FROM_ARRAY is 0 if we should init everything with INIT
3385 (i.e., every element initialized from INIT).
3386 FROM_ARRAY is 1 if we should index into INIT in parallel
3387 with initialization of DECL.
3388 FROM_ARRAY is 2 if we should index into INIT in parallel,
3389 but use assignment instead of initialization. */
3391 tree
3395 {
3396 tree rval;
3399 tree iterator;
3400 /* The type of BASE. */
3402 /* The type of an element in the array. */
3404 /* The element type reached after removing all outer array
3405 types. */
3406 tree inner_elt_type;
3407 /* The type of a pointer to an element in the array. */
3408 tree ptype;
3409 tree stmt_expr;
3410 tree compound_stmt;
3430 /* Look through the TARGET_EXPR around a compound literal. */
3436 /* If we have a braced-init-list, make sure that the array
3437 is big enough for all the initializers. */
3450 /* Don't do this if the CONSTRUCTOR might contain something
3451 that might throw and require us to clean up. */
3455 {
3456 /* Do non-default initialization of trivial arrays resulting from
3457 brace-enclosed initializers. In this case, digest_init and
3458 store_constructor will handle the semantics for us. */
3464 }
3468 {
3474 }
3475 else
3478 /* The code we are generating looks like:
3479 ({
3480 T* t1 = (T*) base;
3481 T* rval = t1;
3482 ptrdiff_t iterator = maxindex;
3483 try {
3484 for (; iterator != -1; --iterator) {
3485 ... initialize *t1 ...
3486 ++t1;
3487 }
3488 } catch (...) {
3489 ... destroy elements that were constructed ...
3490 }
3491 rval;
3492 })
3494 We can omit the try and catch blocks if we know that the
3495 initialization will never throw an exception, or if the array
3496 elements do not have destructors. We can omit the loop completely if
3497 the elements of the array do not have constructors.
3499 We actually wrap the entire body of the above in a STMT_EXPR, for
3500 tidiness.
3502 When copying from array to another, when the array elements have
3503 only trivial copy constructors, we should use __builtin_memcpy
3504 rather than generating a loop. That way, we could take advantage
3505 of whatever cleverness the back end has for dealing with copies
3506 of blocks of memory. */
3515 /* If initializing one array from another, initialize element by
3516 element. We rely upon the below calls to do the argument
3517 checking. Evaluate the initializer before entering the try block. */
3519 {
3528 }
3530 /* Protect the entire array initialization so that we can destroy
3531 the partially constructed array if an exception is thrown.
3532 But don't do this if we're assigning. */
3535 {
3537 }
3539 /* Should we try to create a constant initializer? */
3547 /* If we're initializing a static array, we want to do static
3548 initialization of any elements with constant initializers even if
3549 some are non-constant. */
3555 /* Skip over the handling of non-empty init lists. */
3558 /* Maybe pull out constant value when from_array? */
3561 {
3562 /* Do non-default initialization of non-trivial arrays resulting from
3563 brace-enclosed initializers. */
3566 /* If the constructor already has the array type, it's been through
3567 digest_init, so we shouldn't try to do anything more. */
3572 {
3575 {
3577 {
3579 nelts);
3583 }
3584 /* Don't check an array new when -fno-exceptions. */
3585 }
3588 {
3589 /* Make sure the last element of the initializer is in bounds. */
3590 finish_expr_stmt
3591 (ubsan_instrument_bounds
3593 }
3594 }
3600 {
3602 tree one_init;
3604 num_initialized_elts++;
3611 else
3617 {
3620 {
3624 else
3626 }
3627 else
3628 {
3630 {
3635 }
3637 }
3638 }
3647 else
3651 complain);
3654 else
3656 }
3658 /* Any elements without explicit initializers get T{}. */
3660 }
3662 {
3667 {
3671 }
3672 }
3674 /* Now, default-initialize any remaining elements. We don't need to
3675 do that if a) the type does not need constructing, or b) we've
3676 already initialized all the elements.
3678 We do need to keep going if we're copying an array. */
3683 && (num_initialized_elts
3685 {
3686 /* If the ITERATOR is equal to -1, then we don't have to loop;
3687 we've already initialized all the elements. */
3688 tree for_stmt;
3689 tree elt_init;
3690 tree to;
3698 complain);
3705 /* If the initializer is {}, then all elements are initialized from T{}.
3706 But for non-classes, that's the same as value-initialization. */
3708 {
3710 {
3714 else
3717 }
3718 else
3719 {
3722 }
3723 }
3726 {
3727 tree from;
3730 {
3734 }
3735 else
3740 complain);
3745 complain);
3746 else
3748 }
3750 {
3752 sorry
3756 explicit_value_init_p,
3758 }
3760 {
3764 }
3765 else
3766 {
3770 else
3771 {
3774 complain);
3776 }
3777 }
3783 {
3786 {
3788 /* Don't fill the CONSTRUCTOR with zeros. */
3792 }
3793 else
3794 {
3798 }
3801 {
3804 {
3807 }
3808 }
3809 }
3817 complain));
3820 complain));
3823 }
3825 /* Make sure to cleanup any partially constructed elements. */
3828 {
3829 tree e;
3832 complain);
3834 /* Flatten multi-dimensional array since build_vec_delete only
3835 expects one-dimensional array. */
3839 /* Avoid mixing signed and unsigned. */
3842 complain);
3851 }
3853 /* The value of the array initialization is the array itself, RVAL
3854 is a pointer to the first element. */
3865 {
3867 {
3870 }
3873 else
3875 }
3877 /* Now make the result have the correct type. */
3879 {
3884 }
3887 }
3889 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
3890 build_delete. */
3892 static tree
3894 tsubst_flags_t complain)
3895 {
3896 tree name;
3897 tree fn;
3899 {
3914 }
3919 flags,
3921 complain);
3922 }
3924 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
3925 ADDR is an expression which yields the store to be destroyed.
3926 AUTO_DELETE is the name of the destructor to call, i.e., either
3927 sfk_complete_destructor, sfk_base_destructor, or
3928 sfk_deleting_destructor.
3930 FLAGS is the logical disjunction of zero or more LOOKUP_
3931 flags. See cp-tree.h for more info. */
3933 tree
3936 {
3937 tree expr;
3944 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
3945 set to `error_mark_node' before it gets properly cleaned up. */
3953 {
3955 {
3959 }
3962 }
3965 {
3968 /* We don't want to warn about delete of void*, only other
3969 incomplete types. Deleting other incomplete types
3970 invokes undefined behavior, but it is not ill-formed, so
3971 compile to something that would even do The Right Thing
3972 (TM) should the type have a trivial dtor and no delete
3973 operator. */
3975 {
3978 {
3981 "possible problem detected in invocation of "
3983 {
3986 "neither the destructor nor the class-specific "
3987 "operator delete will be called, even if they are "
3989 }
3990 }
3994 {
3995 tree dtor;
3998 {
4001 "deleting object of abstract class type %qT"
4002 " which has non-virtual destructor"
4004 else
4006 "deleting object of polymorphic class type %qT"
4007 " which has non-virtual destructor"
4009 }
4010 }
4011 }
4015 /* Throw away const and volatile on target type of addr. */
4017 }
4018 else
4019 {
4020 /* Don't check PROTECT here; leave that decision to the
4021 destructor. If the destructor is accessible, call it,
4022 else report error. */
4030 }
4033 {
4034 /* Make sure the destructor is callable. */
4036 {
4038 complain),
4042 }
4049 use_global_delete,
4052 complain);
4053 }
4054 else
4055 {
4058 tree ifexp;
4063 /* For `::delete x', we must not use the deleting destructor
4064 since then we would not be sure to get the global `operator
4065 delete'. */
4067 {
4068 /* We will use ADDR multiple times so we must save it. */
4071 /* Delete the object. */
4073 head,
4078 complain);
4079 /* Otherwise, treat this like a complete object destructor
4080 call. */
4082 }
4083 /* If the destructor is non-virtual, there is no deleting
4084 variant. Instead, we must explicitly call the appropriate
4085 `operator delete' here. */
4088 {
4089 /* We will use ADDR multiple times so we must save it. */
4091 /* Build the call. */
4093 addr,
4098 complain);
4099 /* Call the complete object destructor. */
4101 }
4104 {
4105 /* Make sure we have access to the member op delete, even though
4106 we'll actually be calling it from the destructor. */
4111 complain);
4112 }
4121 /* We need to calculate this before the dtor changes the vptr. */
4126 /* Explicit destructor call; don't check for null pointer. */
4128 else
4129 {
4130 /* Handle deleting a null pointer. */
4133 complain));
4136 }
4142 }
4143 }
4145 /* At the beginning of a destructor, push cleanups that will call the
4146 destructors for our base classes and members.
4148 Called from begin_destructor_body. */
4150 void
4152 {
4155 tree member;
4156 tree expr;
4159 /* Run destructors for all virtual baseclasses. */
4161 {
4162 tree cond = (condition_conversion
4164 current_in_charge_parm,
4165 integer_two_node)));
4167 /* The CLASSTYPE_VBASECLASSES vector is in initialization
4168 order, which is also the right order for pushing cleanups. */
4171 {
4173 {
4175 base_dtor_identifier,
4176 NULL,
4177 base_binfo,
4178 (LOOKUP_NORMAL
4180 tf_warning_or_error);
4182 {
4186 }
4187 }
4188 }
4189 }
4191 /* Take care of the remaining baseclasses. */
4194 {
4200 base_dtor_identifier,
4203 tf_warning_or_error);
4206 }
4208 /* Don't automatically destroy union members. */
4214 {
4223 {
4224 tree this_member = (build_class_member_access_expr
4228 tf_warning_or_error));
4230 sfk_complete_destructor,
4235 }
4236 }
4237 }
4239 /* Build a C++ vector delete expression.
4240 MAXINDEX is the number of elements to be deleted.
4241 ELT_SIZE is the nominal size of each element in the vector.
4242 BASE is the expression that should yield the store to be deleted.
4243 This function expands (or synthesizes) these calls itself.
4244 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
4246 This also calls delete for virtual baseclasses of elements of the vector.
4248 Update: MAXINDEX is no longer needed. The size can be extracted from the
4249 start of the vector for pointers, and from the type for arrays. We still
4250 use MAXINDEX for arrays because it happens to already have one of the
4251 values we'd have to extract. (We could use MAXINDEX with pointers to
4252 confirm the size, and trap if the numbers differ; not clear that it'd
4253 be worth bothering.) */
4255 tree
4257 special_function_kind auto_delete_vec,
4259 {
4260 tree type;
4261 tree rval;
4267 {
4268 /* Step back one from start of vector, and read dimension. */
4269 tree cookie_addr;
4274 {
4277 }
4282 cookie_addr);
4284 }
4286 {
4287 /* Get the total number of things in the array, maxindex is a
4288 bad name. */
4295 {
4298 }
4299 }
4300 else
4301 {
4305 }
4313 }