| blob | d18dc5e8deb900c87cdcfe053c43ec90d709cf30 |
1 /* Handle initialization things in C++.
2 Copyright (C) 1987-2013 Free Software Foundation, Inc.
3 Contributed by Michael Tiemann (tiemann@cygnus.com)
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
10 any later version.
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
21 /* High-level class interface. */
48 /* We are about to generate some complex initialization code.
49 Conceptually, it is all a single expression. However, we may want
50 to include conditionals, loops, and other such statement-level
51 constructs. Therefore, we build the initialization code inside a
52 statement-expression. This function starts such an expression.
53 STMT_EXPR_P and COMPOUND_STMT_P are filled in by this function;
54 pass them back to finish_init_stmts when the expression is
55 complete. */
57 static bool
59 {
66 }
68 /* Finish out the statement-expression begun by the previous call to
69 begin_init_stmts. Returns the statement-expression itself. */
71 static tree
73 {
81 }
83 /* Constructors */
85 /* Called from initialize_vtbl_ptrs via dfs_walk. BINFO is the base
86 which we want to initialize the vtable pointer for, DATA is
87 TREE_LIST whose TREE_VALUE is the this ptr expression. */
89 static tree
91 {
96 {
100 tf_warning_or_error);
103 }
106 }
108 /* Initialize all the vtable pointers in the object pointed to by
109 ADDR. */
111 void
113 {
114 tree list;
115 tree type;
120 /* Walk through the hierarchy, initializing the vptr in each base
121 class. We do these in pre-order because we can't find the virtual
122 bases for a class until we've initialized the vtbl for that
123 class. */
125 }
127 /* Return an expression for the zero-initialization of an object with
128 type T. This expression will either be a constant (in the case
129 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
130 aggregate), or NULL (in the case that T does not require
131 initialization). In either case, the value can be used as
132 DECL_INITIAL for a decl of the indicated TYPE; it is a valid static
133 initializer. If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS
134 is the number of elements in the array. If STATIC_STORAGE_P is
135 TRUE, initializers are only generated for entities for which
136 zero-initialization does not simply mean filling the storage with
137 zero bytes. FIELD_SIZE, if non-NULL, is the bit size of the field,
138 subfields with bit positions at or above that bit size shouldn't
139 be added. Note that this only works when the result is assigned
140 to a base COMPONENT_REF; if we only have a pointer to the base subobject,
141 expand_assignment will end up clearing the full size of TYPE. */
143 static tree
145 tree field_size)
146 {
149 /* [dcl.init]
151 To zero-initialize an object of type T means:
153 -- if T is a scalar type, the storage is set to the value of zero
154 converted to T.
156 -- if T is a non-union class type, the storage for each nonstatic
157 data member and each base-class subobject is zero-initialized.
159 -- if T is a union type, the storage for its first data member is
160 zero-initialized.
162 -- if T is an array type, the storage for each element is
163 zero-initialized.
165 -- if T is a reference type, no initialization is performed. */
170 ;
172 /* In order to save space, we do not explicitly build initializers
173 for items that do not need them. GCC's semantics are that
174 items with static storage duration that are not otherwise
175 initialized are initialized to zero. */
176 ;
182 {
183 tree field;
186 /* Iterate over the fields, building initializations. */
188 {
192 /* Don't add virtual bases for base classes if they are beyond
193 the size of the current field, that means it is present
194 somewhere else in the object. */
196 {
201 }
203 /* Note that for class types there will be FIELD_DECLs
204 corresponding to base classes as well. Thus, iterating
205 over TYPE_FIELDs will result in correct initialization of
206 all of the subobjects. */
208 {
209 tree new_field_size
216 static_storage_p,
217 new_field_size);
220 }
222 /* For unions, only the first field is initialized. */
225 }
227 /* Build a constructor to contain the initializations. */
229 }
231 {
232 tree max_index;
235 /* Iterate over the array elements, building initializations. */
240 else
243 /* If we have an error_mark here, we should just return error mark
244 as we don't know the size of the array yet. */
249 /* A zero-sized array, which is accepted as an extension, will
250 have an upper bound of -1. */
252 {
253 constructor_elt ce;
255 /* If this is a one element array, we just use a regular init. */
258 else
260 max_index);
266 {
269 }
270 }
272 /* Build a constructor to contain the initializations. */
274 }
277 else
280 /* In all cases, the initializer is a constant. */
285 }
287 /* Return an expression for the zero-initialization of an object with
288 type T. This expression will either be a constant (in the case
289 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
290 aggregate), or NULL (in the case that T does not require
291 initialization). In either case, the value can be used as
292 DECL_INITIAL for a decl of the indicated TYPE; it is a valid static
293 initializer. If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS
294 is the number of elements in the array. If STATIC_STORAGE_P is
295 TRUE, initializers are only generated for entities for which
296 zero-initialization does not simply mean filling the storage with
297 zero bytes. */
299 tree
301 {
303 }
305 /* Return a suitable initializer for value-initializing an object of type
306 TYPE, as described in [dcl.init]. */
308 tree
310 {
311 /* [dcl.init]
313 To value-initialize an object of type T means:
315 - if T is a class type (clause 9) with a user-provided constructor
316 (12.1), then the default constructor for T is called (and the
317 initialization is ill-formed if T has no accessible default
318 constructor);
320 - if T is a non-union class type without a user-provided constructor,
321 then every non-static data member and base-class component of T is
322 value-initialized;92)
324 - if T is an array type, then each element is value-initialized;
326 - otherwise, the object is zero-initialized.
328 A program that calls for default-initialization or
329 value-initialization of an entity of reference type is ill-formed.
331 92) Value-initialization for such a class object may be implemented by
332 zero-initializing the object and then calling the default
333 constructor. */
335 /* The AGGR_INIT_EXPR tweaking below breaks in templates. */
340 {
341 /* Instead of the above, only consider the user-providedness of the
342 default constructor itself so value-initializing a class with an
343 explicitly defaulted default constructor and another user-provided
344 constructor works properly (c++std-core-19883). */
348 return build_aggr_init_expr
352 complain));
354 {
355 /* This is a class that needs constructing, but doesn't have
356 a user-provided constructor. So we need to zero-initialize
357 the object and then call the implicitly defined ctor.
358 This will be handled in simplify_aggr_init_expr. */
359 tree ctor = build_special_member_call
366 }
367 }
369 }
371 /* Like build_value_init, but don't call the constructor for TYPE. Used
372 for base initializers. */
374 tree
376 {
378 {
382 }
383 /* FIXME the class and array cases should just use digest_init once it is
384 SFINAE-enabled. */
386 {
390 {
391 tree field;
394 /* Iterate over the fields, building initializations. */
396 {
404 /* We could skip vfields and fields of types with
405 user-defined constructors, but I think that won't improve
406 performance at all; it should be simpler in general just
407 to zero out the entire object than try to only zero the
408 bits that actually need it. */
410 /* Note that for class types there will be FIELD_DECLs
411 corresponding to base classes as well. Thus, iterating
412 over TYPE_FIELDs will result in correct initialization of
413 all of the subobjects. */
421 }
423 /* Build a constructor to contain the zero- initializations. */
425 }
426 }
428 {
431 /* Iterate over the array elements, building initializations. */
434 /* If we have an error_mark here, we should just return error mark
435 as we don't know the size of the array yet. */
437 {
440 type);
442 }
445 /* A zero-sized array, which is accepted as an extension, will
446 have an upper bound of -1. */
448 {
449 constructor_elt ce;
451 /* If this is a one element array, we just use a regular init. */
454 else
459 {
466 /* We shouldn't have gotten here for anything that would need
467 non-trivial initialization, and gimplify_init_ctor_preeval
468 would need to be fixed to allow it. */
471 }
472 }
474 /* Build a constructor to contain the initializations. */
476 }
478 {
482 }
484 {
488 }
491 }
493 /* Initialize current class with INIT, a TREE_LIST of
494 arguments for a target constructor. If TREE_LIST is void_type_node,
495 an empty initializer list was given. */
497 static void
499 {
505 tf_warning_or_error));
507 {
509 LOOKUP_NORMAL
510 |LOOKUP_NONVIRTUAL
515 }
516 }
518 /* Initialize MEMBER, a FIELD_DECL, with INIT, a TREE_LIST of
519 arguments. If TREE_LIST is void_type_node, an empty initializer
520 list was given; if NULL_TREE no initializer was given. */
522 static void
524 {
525 tree decl;
528 /* Use the non-static data member initializer if there was no
529 mem-initializer for this field. */
531 {
533 /* Do deferred instantiation of the NSDMI. */
534 init = (tsubst_copy_and_build
539 else
540 {
543 {
547 }
548 /* Strip redundant TARGET_EXPR so we don't need to remap it, and
549 so the aggregate init code below will see a CONSTRUCTOR. */
554 }
555 }
560 /* Effective C++ rule 12 requires that all data members be
561 initialized. */
565 member);
567 /* Get an lvalue for the data member. */
571 tf_warning_or_error);
577 {
583 member);
584 }
587 {
588 /* mem() means value-initialization. */
590 {
594 }
595 else
596 {
602 }
603 }
604 /* Deal with this here, as we will get confused if we try to call the
605 assignment op for an anonymous union. This can happen in a
606 synthesized copy constructor. */
608 {
610 {
613 }
614 }
617 /* Pre-digested NSDMI. */
620 /* { } mem-initializer. */
626 {
627 /* With references and list-initialization, we need to deal with
628 extending temporary lifetimes. 12.2p5: "A temporary bound to a
629 reference member in a constructor’s ctor-initializer (12.6.2)
630 persists until the constructor exits." */
635 tf_warning_or_error);
637 {
642 }
645 /* A FIELD_DECL doesn't really have a suitable lifetime, but
646 make_temporary_var_for_ref_to_temp will treat it as automatic and
647 set_up_extended_ref_temp wants to use the decl in a warning. */
657 }
660 {
662 {
664 {
667 else
671 }
675 {
679 }
680 else
682 }
683 else
684 {
691 /* TYPE_NEEDS_CONSTRUCTING can be set just because we have a
692 vtable; still give this diagnostic. */
697 tf_warning_or_error));
698 }
699 }
700 else
701 {
703 {
704 tree core_type;
705 /* member traversal: note it leaves init NULL */
709 member);
723 }
725 /* There was an explicit member initialization. Do some work
726 in that case. */
728 tf_warning_or_error);
732 tf_warning_or_error));
733 }
736 {
737 tree expr;
742 tf_warning_or_error);
745 tf_warning_or_error);
749 }
750 }
752 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
753 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
755 static tree
757 {
758 tree fields;
760 /* Note whether or not T is a union. */
765 {
766 tree fieldtype;
768 /* Skip CONST_DECLs for enumeration constants and so forth. */
773 /* Keep track of whether or not any fields are unions. */
777 /* For an anonymous struct or union, we must recursively
778 consider the fields of the anonymous type. They can be
779 directly initialized from the constructor. */
781 {
782 /* Add this field itself. Synthesized copy constructors
783 initialize the entire aggregate. */
785 /* And now add the fields in the anonymous aggregate. */
787 }
788 /* Add this field. */
791 }
794 }
796 /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives
797 a FIELD_DECL or BINFO in T that needs initialization. The
798 TREE_VALUE gives the initializer, or list of initializer arguments.
800 Return a TREE_LIST containing all of the initializations required
801 for T, in the order in which they should be performed. The output
802 list has the same format as the input. */
804 static tree
806 {
807 tree init;
809 tree sorted_inits;
810 tree next_subobject;
815 /* Build up a list of initializations. The TREE_PURPOSE of entry
816 will be the subobject (a FIELD_DECL or BINFO) to initialize. The
817 TREE_VALUE will be the constructor arguments, or NULL if no
818 explicit initialization was provided. */
821 /* Process the virtual bases. */
826 /* Process the direct bases. */
832 /* Process the non-static data members. */
834 /* Reverse the entire list of initializations, so that they are in
835 the order that they will actually be performed. */
838 /* If the user presented the initializers in an order different from
839 that in which they will actually occur, we issue a warning. Keep
840 track of the next subobject which can be explicitly initialized
841 without issuing a warning. */
844 /* Go through the explicit initializers, filling in TREE_PURPOSE in
845 the SORTED_INITS. */
847 {
848 tree subobject;
849 tree subobject_init;
853 /* If the explicit initializers are in sorted order, then
854 SUBOBJECT will be NEXT_SUBOBJECT, or something following
855 it. */
857 subobject_init;
862 /* Issue a warning if the explicit initializer order does not
863 match that which will actually occur.
864 ??? Are all these on the correct lines? */
866 {
870 else
875 else
879 }
881 /* Look again, from the beginning of the list. */
883 {
887 }
889 /* It is invalid to initialize the same subobject more than
890 once. */
892 {
896 subobject);
897 else
900 subobject);
901 }
903 /* Record the initialization. */
906 }
908 /* [class.base.init]
910 If a ctor-initializer specifies more than one mem-initializer for
911 multiple members of the same union (including members of
912 anonymous unions), the ctor-initializer is ill-formed.
914 Here we also splice out uninitialized union members. */
916 {
920 {
921 tree field;
922 tree ctx;
928 /* Skip base classes. */
932 /* If this is an anonymous union with no explicit initializer,
933 splice it out. */
937 /* See if this field is a member of a union, or a member of a
938 structure contained in a union, etc. */
945 /* If this field is not a member of a union, skip it. */
949 /* If this union member has no explicit initializer and no NSDMI,
950 splice it out. */
953 else
956 /* It's only an error if we have two initializers for the same
957 union type. */
959 {
962 }
964 /* See if LAST_FIELD and the field initialized by INIT are
965 members of the same union. If so, there's a problem,
966 unless they're actually members of the same structure
967 which is itself a member of a union. For example, given:
969 union { struct { int i; int j; }; };
971 initializing both `i' and `j' makes sense. */
976 {
977 /* A mem-initializer hides an NSDMI. */
982 else
983 {
986 ctx);
988 }
989 }
993 next:
996 splice:
999 }
1000 }
1003 }
1005 /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS
1006 is a TREE_LIST giving the explicit mem-initializer-list for the
1007 constructor. The TREE_PURPOSE of each entry is a subobject (a
1008 FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE
1009 is a TREE_LIST giving the arguments to the constructor or
1010 void_type_node for an empty list of arguments. */
1012 void
1014 {
1017 /* We will already have issued an error message about the fact that
1018 the type is incomplete. */
1025 {
1026 /* Delegating constructor. */
1030 }
1036 /* Sort the mem-initializers into the order in which the
1037 initializations should be performed. */
1042 /* Initialize base classes. */
1046 {
1050 /* We already have issued an error message. */
1055 {
1056 /* If these initializations are taking place in a copy constructor,
1057 the base class should probably be explicitly initialized if there
1058 is a user-defined constructor in the base class (other than the
1059 default constructor, which will be called anyway). */
1067 }
1069 /* Initialize the base. */
1072 else
1073 {
1074 tree base_addr;
1080 tf_warning_or_error),
1081 arguments,
1082 flags,
1083 tf_warning_or_error);
1085 }
1086 }
1089 /* Initialize the vptrs. */
1092 /* Initialize the data members. */
1094 {
1098 }
1099 }
1101 /* Returns the address of the vtable (i.e., the value that should be
1102 assigned to the vptr) for BINFO. */
1104 tree
1106 {
1108 tree vtbl;
1111 /* If this is a virtual primary base, then the vtable we want to store
1112 is that for the base this is being used as the primary base of. We
1113 can't simply skip the initialization, because we may be expanding the
1114 inits of a subobject constructor where the virtual base layout
1115 can be different. */
1119 /* Figure out what vtable BINFO's vtable is based on, and mark it as
1120 used. */
1124 /* Now compute the address to use when initializing the vptr. */
1130 }
1132 /* This code sets up the virtual function tables appropriate for
1133 the pointer DECL. It is a one-ply initialization.
1135 BINFO is the exact type that DECL is supposed to be. In
1136 multiple inheritance, this might mean "C's A" if C : A, B. */
1138 static void
1140 {
1142 tree vtt_index;
1144 /* Compute the initializer for vptr. */
1147 /* We may get this vptr from a VTT, if this is a subobject
1148 constructor or subobject destructor. */
1151 {
1152 tree vtbl2;
1153 tree vtt_parm;
1155 /* Compute the value to use, when there's a VTT. */
1161 /* The actual initializer is the VTT value only in the subobject
1162 constructor. In maybe_clone_body we'll substitute NULL for
1163 the vtt_parm in the case of the non-subobject constructor. */
1168 vtbl2,
1169 vtbl);
1170 }
1172 /* Compute the location of the vtpr. */
1174 tf_warning_or_error),
1178 /* Assign the vtable to the vptr. */
1181 tf_warning_or_error));
1182 }
1184 /* If an exception is thrown in a constructor, those base classes already
1185 constructed must be destroyed. This function creates the cleanup
1186 for BINFO, which has just been constructed. If FLAG is non-NULL,
1187 it is a DECL which is nonzero when this base needs to be
1188 destroyed. */
1190 static void
1192 {
1193 tree expr;
1198 /* Call the destructor. */
1200 base_dtor_identifier,
1201 NULL,
1202 binfo,
1204 tf_warning_or_error);
1212 }
1214 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its
1215 constructor. */
1217 static void
1219 {
1220 tree inner_if_stmt;
1221 tree exp;
1222 tree flag;
1224 /* If there are virtual base classes with destructors, we need to
1225 emit cleanups to destroy them if an exception is thrown during
1226 the construction process. These exception regions (i.e., the
1227 period during which the cleanups must occur) begin from the time
1228 the construction is complete to the end of the function. If we
1229 create a conditional block in which to initialize the
1230 base-classes, then the cleanup region for the virtual base begins
1231 inside a block, and ends outside of that block. This situation
1232 confuses the sjlj exception-handling code. Therefore, we do not
1233 create a single conditional block, but one for each
1234 initialization. (That way the cleanup regions always begin
1235 in the outer block.) We trust the back end to figure out
1236 that the FLAG will not change across initializations, and
1237 avoid doing multiple tests. */
1242 /* Compute the location of the virtual base. If we're
1243 constructing virtual bases, then we must be the most derived
1244 class. Therefore, we don't have to look up the virtual base;
1245 we already know where it is. */
1254 }
1256 /* Find the context in which this FIELD can be initialized. */
1258 static tree
1260 {
1263 /* Anonymous union members can be initialized in the first enclosing
1264 non-anonymous union context. */
1268 }
1270 /* Function to give error message if member initialization specification
1271 is erroneous. FIELD is the member we decided to initialize.
1272 TYPE is the type for which the initialization is being performed.
1273 FIELD must be a member of TYPE.
1275 MEMBER_NAME is the name of the member. */
1277 static int
1279 {
1283 {
1285 member_name);
1287 }
1289 {
1292 field);
1294 }
1296 {
1300 }
1302 {
1304 member_name);
1306 }
1309 }
1311 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it
1312 is a _TYPE node or TYPE_DECL which names a base for that type.
1313 Check the validity of NAME, and return either the base _TYPE, base
1314 binfo, or the FIELD_DECL of the member. If NAME is invalid, return
1315 NULL_TREE and issue a diagnostic.
1317 An old style unnamed direct single base construction is permitted,
1318 where NAME is NULL. */
1320 tree
1322 {
1323 tree basetype;
1324 tree field;
1330 {
1331 /* This is an obsolete unnamed base class initializer. The
1332 parser will already have warned about its use. */
1334 {
1337 current_class_type);
1340 basetype = BINFO_TYPE
1345 current_class_type);
1347 }
1348 }
1350 {
1353 }
1356 else
1360 {
1361 tree class_binfo;
1362 tree direct_binfo;
1363 tree virtual_binfo;
1374 /* Look for a direct base. */
1379 /* Look for a virtual base -- unless the direct base is itself
1380 virtual. */
1384 /* [class.base.init]
1386 If a mem-initializer-id is ambiguous because it designates
1387 both a direct non-virtual base class and an inherited virtual
1388 base class, the mem-initializer is ill-formed. */
1390 {
1392 basetype);
1394 }
1397 {
1401 else
1405 }
1408 }
1409 else
1410 {
1413 else
1418 }
1421 }
1423 /* This is like `expand_member_init', only it stores one aggregate
1424 value into another.
1426 INIT comes in two flavors: it is either a value which
1427 is to be stored in EXP, or it is a parameter list
1428 to go to a constructor, which will operate on EXP.
1429 If INIT is not a parameter list for a constructor, then set
1430 LOOKUP_ONLYCONVERTING.
1431 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1432 the initializer, if FLAGS is 0, then it is the (init) form.
1433 If `init' is a CONSTRUCTOR, then we emit a warning message,
1434 explaining that such initializations are invalid.
1436 If INIT resolves to a CALL_EXPR which happens to return
1437 something of the type we are looking for, then we know
1438 that we can safely use that call to perform the
1439 initialization.
1441 The virtual function table pointer cannot be set up here, because
1442 we do not really know its type.
1444 This never calls operator=().
1446 When initializing, nothing is CONST.
1448 A default copy constructor may have to be used to perform the
1449 initialization.
1451 A constructor or a conversion operator may have to be used to
1452 perform the initialization, but not both, as it would be ambiguous. */
1454 tree
1456 {
1457 tree stmt_expr;
1458 tree compound_stmt;
1480 {
1481 tree itype;
1483 /* An array may not be initialized use the parenthesized
1484 initialization form -- unless the initializer is "()". */
1486 {
1490 }
1491 /* Must arrange to initialize each element of EXP
1492 from elements of INIT. */
1502 complain);
1509 }
1513 /* Just know that we've seen something for this node. */
1527 }
1529 static void
1531 tsubst_flags_t complain)
1532 {
1534 tree ctor_name;
1536 /* It fails because there may not be a constructor which takes
1537 its own type as the first (or only parameter), but which does
1538 take other types via a conversion. So, if the thing initializing
1539 the expression is a unit element of type X, first try X(X&),
1540 followed by initialization by X. If neither of these work
1541 out, then look hard. */
1542 tree rval;
1545 /* If we have direct-initialization from an initializer list, pull
1546 it out of the TREE_LIST so the code below can see it. */
1550 {
1554 }
1558 /* A brace-enclosed initializer for an aggregate. In C++0x this can
1559 happen for direct-initialization, too. */
1562 /* A CONSTRUCTOR of the target's type is a previously digested
1563 initializer, whether that happened just above or in
1564 cp_parser_late_parsing_nsdmi.
1566 A TARGET_EXPR with TARGET_EXPR_DIRECT_INIT_P or TARGET_EXPR_LIST_INIT_P
1567 set represents the whole initialization, so we shouldn't build up
1568 another ctor call. */
1575 {
1576 /* Early initialization via a TARGET_EXPR only works for
1577 complete objects. */
1584 }
1588 {
1589 /* Base subobjects should only get direct-initialization. */
1593 /* Do nothing. We hit this in two cases: Reference initialization,
1594 where we aren't initializing a real variable, so we don't want
1595 to run a new constructor; and catching an exception, where we
1596 have already built up the constructor call so we could wrap it
1598 else
1603 /* We need to protect the initialization of a catch parm with a
1604 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
1605 around the TARGET_EXPR for the copy constructor. See
1606 initialize_handler_parm. */
1607 {
1611 }
1612 else
1617 }
1622 {
1626 }
1627 else
1632 {
1633 /* Delegating constructor. */
1634 tree complete;
1635 tree base;
1638 /* Unshare the arguments for the second call. */
1641 {
1644 }
1647 complain);
1653 complain);
1658 base,
1659 complete);
1660 }
1661 else
1662 {
1665 else
1668 complain);
1669 }
1675 {
1678 {
1682 }
1683 }
1685 /* FIXME put back convert_to_void? */
1688 }
1690 /* This function is responsible for initializing EXP with INIT
1691 (if any).
1693 BINFO is the binfo of the type for who we are performing the
1694 initialization. For example, if W is a virtual base class of A and B,
1695 and C : A, B.
1696 If we are initializing B, then W must contain B's W vtable, whereas
1697 were we initializing C, W must contain C's W vtable.
1699 TRUE_EXP is nonzero if it is the true expression being initialized.
1700 In this case, it may be EXP, or may just contain EXP. The reason we
1701 need this is because if EXP is a base element of TRUE_EXP, we
1702 don't necessarily know by looking at EXP where its virtual
1703 baseclass fields should really be pointing. But we do know
1704 from TRUE_EXP. In constructors, we don't know anything about
1705 the value being initialized.
1707 FLAGS is just passed to `build_new_method_call'. See that function
1708 for its description. */
1710 static void
1712 tsubst_flags_t complain)
1713 {
1719 /* Use a function returning the desired type to initialize EXP for us.
1720 If the function is a constructor, and its first argument is
1721 NULL_TREE, know that it was meant for us--just slide exp on
1722 in and expand the constructor. Constructors now come
1723 as TARGET_EXPRs. */
1727 {
1729 /* If store_init_value returns NULL_TREE, the INIT has been
1730 recorded as the DECL_INITIAL for EXP. That means there's
1731 nothing more we have to do. */
1737 }
1739 /* If an explicit -- but empty -- initializer list was present,
1740 that's value-initialization. */
1742 {
1743 /* If the type has data but no user-provided ctor, we need to zero
1744 out the object. */
1747 {
1750 /* Don't clobber already initialized virtual bases. */
1753 field_size);
1756 }
1758 /* If we don't need to mess with the constructor at all,
1759 then we're done. */
1763 /* Otherwise fall through and call the constructor. */
1765 }
1767 /* We know that expand_default_init can handle everything we want
1768 at this point. */
1770 }
1772 /* Report an error if TYPE is not a user-defined, class type. If
1773 OR_ELSE is nonzero, give an error message. */
1775 int
1777 {
1782 {
1786 }
1788 }
1790 tree
1792 {
1798 else
1800 }
1802 /* Build a reference to a member of an aggregate. This is not a C++
1803 `&', but really something which can have its address taken, and
1804 then act as a pointer to member, for example TYPE :: FIELD can have
1805 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if
1806 this expression is the operand of "&".
1808 @@ Prints out lousy diagnostics for operator <typename>
1809 @@ fields.
1811 @@ This function should be rewritten and placed in search.c. */
1813 tree
1815 tsubst_flags_t complain)
1816 {
1817 tree decl;
1820 /* class templates can come in as TEMPLATE_DECLs here. */
1833 /* Callers should call mark_used before this point. */
1838 {
1842 }
1844 /* Entities other than non-static members need no further
1845 processing. */
1852 {
1856 }
1858 /* Set up BASEBINFO for member lookup. */
1861 /* A lot of this logic is now handled in lookup_member. */
1863 {
1864 /* Go from the TREE_BASELINK to the member function info. */
1868 {
1869 /* Get rid of a potential OVERLOAD around it. */
1872 /* Unique functions are handled easily. */
1874 /* For non-static member of base class, we need a special rule
1875 for access checking [class.protected]:
1877 If the access is to form a pointer to member, the
1878 nested-name-specifier shall name the derived class
1879 (or any class derived from that class). */
1883 complain);
1884 else
1886 complain);
1891 }
1892 else
1894 }
1896 /* We need additional test besides the one in
1897 check_accessibility_of_qualified_id in case it is
1898 a pointer to non-static member. */
1900 complain);
1903 {
1904 /* If MEMBER is non-static, then the program has fallen afoul of
1905 [expr.prim]:
1907 An id-expression that denotes a nonstatic data member or
1908 nonstatic member function of a class can only be used:
1910 -- as part of a class member access (_expr.ref_) in which the
1911 object-expression refers to the member's class or a class
1912 derived from that class, or
1914 -- to form a pointer to member (_expr.unary.op_), or
1916 -- in the body of a nonstatic member function of that class or
1917 of a class derived from that class (_class.mfct.nonstatic_), or
1919 -- in a mem-initializer for a constructor for that class or for
1920 a class derived from that class (_class.base.init_). */
1922 {
1923 /* Build a representation of the qualified name suitable
1924 for use as the operand to "&" -- even though the "&" is
1925 not actually present. */
1927 /* In Microsoft mode, treat a non-static member function as if
1928 it were a pointer-to-member. */
1930 {
1933 }
1938 }
1940 {
1944 }
1946 }
1951 }
1953 /* If DECL is a scalar enumeration constant or variable with a
1954 constant initializer, return the initializer (or, its initializers,
1955 recursively); otherwise, return DECL. If INTEGRAL_P, the
1956 initializer is only returned if DECL is an integral
1957 constant-expression. If RETURN_AGGREGATE_CST_OK_P, it is ok to
1958 return an aggregate constant. */
1960 static tree
1962 {
1964 || (integral_p
1968 {
1969 tree init;
1970 /* If DECL is a static data member in a template
1971 specialization, we must instantiate it here. The
1972 initializer for the static data member is not processed
1973 until needed; we need it now. */
1978 {
1980 /* Treat the error as a constant to avoid cascading errors on
1981 excessively recursive template instantiation (c++/9335). */
1983 else
1985 }
1986 /* Initializers in templates are generally expanded during
1987 instantiation, so before that for const int i(2)
1988 INIT is a TREE_LIST with the actual initializer as
1989 TREE_VALUE. */
1991 && init
1999 /* Unless RETURN_AGGREGATE_CST_OK_P is true, do not
2000 return an aggregate constant (of which string
2001 literals are a special case), as we do not want
2002 to make inadvertent copies of such entities, and
2003 we must be sure that their addresses are the
2004 same everywhere. */
2009 }
2011 }
2013 /* If DECL is a CONST_DECL, or a constant VAR_DECL initialized by
2014 constant of integral or enumeration type, then return that value.
2015 These are those variables permitted in constant expressions by
2016 [5.19/1]. */
2018 tree
2020 {
2023 }
2025 /* A more relaxed version of integral_constant_value, used by the
2026 common C/C++ code. */
2028 tree
2030 {
2033 }
2035 /* A version of integral_constant_value used by the C++ front end for
2036 optimization purposes. */
2038 tree
2040 {
2043 }
2044 \f
2045 /* Common subroutines of build_new and build_vec_delete. */
2047 /* Call the global __builtin_delete to delete ADDR. */
2049 static tree
2051 {
2054 }
2055 \f
2056 /* Build and return a NEW_EXPR. If NELTS is non-NULL, TYPE[NELTS] is
2057 the type of the object being allocated; otherwise, it's just TYPE.
2058 INIT is the initializer, if any. USE_GLOBAL_NEW is true if the
2059 user explicitly wrote "::operator new". PLACEMENT, if non-NULL, is
2060 a vector of arguments to be provided as arguments to a placement
2061 new operator. This routine performs no semantic checks; it just
2062 creates and returns a NEW_EXPR. */
2064 static tree
2067 {
2068 tree init_list;
2069 tree new_expr;
2071 /* If INIT is NULL, the we want to store NULL_TREE in the NEW_EXPR.
2072 If INIT is not NULL, then we want to store VOID_ZERO_NODE. This
2073 permits us to distinguish the case of a missing initializer "new
2074 int" from an empty initializer "new int()". */
2079 else
2084 init_list);
2089 }
2091 /* Diagnose uninitialized const members or reference members of type
2092 TYPE. USING_NEW is used to disambiguate the diagnostic between a
2093 new expression without a new-initializer and a declaration. Returns
2094 the error count. */
2096 static int
2099 {
2100 tree field;
2107 {
2108 tree field_type;
2119 {
2122 {
2124 {
2128 else
2130 }
2131 else
2132 {
2137 else
2140 }
2143 }
2144 }
2147 {
2150 {
2152 {
2156 else
2158 }
2159 else
2160 {
2165 else
2168 }
2171 }
2172 }
2175 error_count
2178 }
2180 }
2182 int
2184 {
2186 }
2188 /* Call __cxa_bad_array_new_length to indicate that the size calculation
2189 overflowed. Pretend it returns sizetype so that it plays nicely in the
2190 COND_EXPR. */
2192 tree
2194 {
2198 NULL_TREE));
2201 }
2203 /* Call __cxa_bad_array_length to indicate that there were too many
2204 initializers. */
2206 tree
2208 {
2212 NULL_TREE));
2215 }
2217 /* Generate code for a new-expression, including calling the "operator
2218 new" function, initializing the object, and, if an exception occurs
2219 during construction, cleaning up. The arguments are as for
2220 build_raw_new_expr. This may change PLACEMENT and INIT. */
2222 static tree
2225 tsubst_flags_t complain)
2226 {
2228 /* True iff this is a call to "operator new[]" instead of just
2229 "operator new". */
2231 /* If ARRAY_P is true, the element type of the array. This is never
2232 an ARRAY_TYPE; for something like "new int[3][4]", the
2233 ELT_TYPE is "int". If ARRAY_P is false, this is the same type as
2234 TYPE. */
2235 tree elt_type;
2236 /* The type of the new-expression. (This type is always a pointer
2237 type.) */
2238 tree pointer_type;
2239 tree non_const_pointer_type;
2241 /* For arrays, a bounds checks on the NELTS parameter. */
2246 /* Size of the inner array elements. */
2247 double_int inner_size;
2248 /* The address returned by the call to "operator new". This node is
2249 a VAR_DECL and is therefore reusable. */
2250 tree alloc_node;
2251 tree alloc_fn;
2255 /* If non-NULL, the number of extra bytes to allocate at the
2256 beginning of the storage allocated for an array-new expression in
2257 order to store the number of elements. */
2259 tree placement_first;
2261 /* True if the function we are calling is a placement allocation
2262 function. */
2264 /* True if the storage must be initialized, either by a constructor
2265 or due to an explicit new-initializer. */
2267 /* The address of the thing allocated, not including any cookie. In
2268 particular, if an array cookie is in use, DATA_ADDR is the
2269 address of the first array element. This node is a VAR_DECL, and
2270 is therefore reusable. */
2271 tree data_addr;
2275 {
2278 }
2280 {
2281 /* Transforms new (T[N]) to new T[N]. The former is a GNU
2282 extension for variable N. (This also covers new T where T is
2283 a VLA typedef.) */
2289 }
2291 /* If our base type is an array, then make sure we know how many elements
2292 it has. */
2296 {
2300 {
2306 {
2310 }
2312 }
2313 else
2314 {
2316 {
2320 }
2322 }
2326 inner_nelts_cst,
2327 complain);
2328 }
2331 {
2334 }
2339 /* Warn if we performed the (T[N]) to T[N] transformation and N is
2340 variable. */
2343 {
2347 else
2349 }
2352 {
2356 }
2364 {
2366 /* A program that calls for default-initialization [...] of an
2367 entity of reference type is ill-formed. */
2371 /* A new-expression that creates an object of type T initializes
2372 that object as follows:
2373 - If the new-initializer is omitted:
2374 -- If T is a (possibly cv-qualified) non-POD class type
2375 (or array thereof), the object is default-initialized (8.5).
2376 [...]
2377 -- Otherwise, the object created has indeterminate
2378 value. If T is a const-qualified type, or a (possibly
2379 cv-qualified) POD class type (or array thereof)
2380 containing (directly or indirectly) a member of
2381 const-qualified type, the program is ill-formed; */
2391 }
2395 {
2399 }
2403 {
2404 /* Maximum available size in bytes. Half of the address space
2405 minus the cookie size. */
2406 double_int max_size
2408 HOST_BITS_PER_DOUBLE_INT);
2409 /* Maximum number of outer elements which can be allocated. */
2410 double_int max_outer_nelts;
2411 tree max_outer_nelts_tree;
2417 /* Unconditionally subtract the cookie size. This decreases the
2418 maximum object size and is safe even if we choose not to use
2419 a cookie after all. */
2425 {
2429 }
2431 /* Only keep the top-most seven bits, to simplify encoding the
2432 constant in the instruction stream. */
2433 {
2437 max_outer_nelts
2440 }
2445 outer_nelts,
2446 max_outer_nelts_tree);
2447 }
2451 /* If PLACEMENT is a single simple pointer type not passed by
2452 reference, prepare to capture it in a temporary variable. Do
2453 this now, since PLACEMENT will change in the calls below. */
2459 /* Allocate the object. */
2461 {
2462 tree class_addr;
2472 {
2476 }
2478 {
2482 }
2487 }
2489 {
2492 }
2493 else
2494 {
2495 tree fnname;
2496 tree fns;
2502 && (array_p
2505 {
2506 /* Use a class-specific operator new. */
2507 /* If a cookie is required, add some extra space. */
2510 else
2511 {
2513 /* No size arithmetic necessary, so the size check is
2514 not needed. */
2517 }
2518 /* Perform the overflow check. */
2525 /* Create the argument list. */
2527 /* Do name-lookup to find the appropriate operator. */
2530 {
2534 }
2536 {
2538 {
2541 }
2543 }
2547 LOOKUP_NORMAL,
2549 complain);
2550 }
2551 else
2552 {
2553 /* Use a global operator new. */
2554 /* See if a cookie might be required. */
2556 {
2558 /* No size arithmetic necessary, so the size check is
2559 not needed. */
2562 }
2566 outer_nelts_check,
2568 }
2569 }
2576 /* If we found a simple case of PLACEMENT_EXPR above, then copy it
2577 into a temporary variable. */
2584 {
2589 {
2593 }
2594 }
2596 /* In the simple case, we can stop now. */
2601 /* Store the result of the allocation call in a variable so that we can
2602 use it more than once. */
2606 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */
2610 /* Now, check to see if this function is actually a placement
2611 allocation function. This can happen even when PLACEMENT is NULL
2612 because we might have something like:
2614 struct S { void* operator new (size_t, int i = 0); };
2616 A call to `new S' will get this allocation function, even though
2617 there is no explicit placement argument. If there is more than
2618 one argument, or there are variable arguments, then this is a
2619 placement allocation function. */
2620 placement_allocation_fn_p
2624 /* Preevaluate the placement args so that we don't reevaluate them for a
2625 placement delete. */
2627 {
2628 tree inits;
2632 alloc_expr);
2633 }
2635 /* unless an allocation function is declared with an empty excep-
2636 tion-specification (_except.spec_), throw(), it indicates failure to
2637 allocate storage by throwing a bad_alloc exception (clause _except_,
2638 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2639 cation function is declared with an empty exception-specification,
2640 throw(), it returns null to indicate failure to allocate storage and a
2641 non-null pointer otherwise.
2643 So check for a null exception spec on the op new we just called. */
2649 {
2650 tree cookie;
2651 tree cookie_ptr;
2652 tree size_ptr_type;
2654 /* Adjust so we're pointing to the start of the object. */
2657 /* Store the number of bytes allocated so that we can know how
2658 many elements to destroy later. We use the last sizeof
2659 (size_t) bytes to store the number of elements. */
2670 {
2671 /* Also store the element size. */
2682 }
2683 }
2684 else
2685 {
2688 }
2690 /* Now use a pointer to the type we've actually allocated. */
2692 /* But we want to operate on a non-const version to start with,
2693 since we'll be modifying the elements. */
2694 non_const_pointer_type = build_pointer_type
2698 /* Any further uses of alloc_node will want this type, too. */
2701 /* Now initialize the allocated object. Note that we preevaluate the
2702 initialization expression, apart from the actual constructor call or
2703 assignment--we do this because we want to delay the allocation as long
2704 as possible in order to minimize the size of the exception region for
2705 placement delete. */
2707 {
2712 {
2715 }
2718 {
2719 /* build_value_init doesn't work in templates, and we don't need
2720 the initializer anyway since we're going to throw it away and
2721 rebuild it at instantiation time, so just build up a single
2722 constructor call to get any appropriate diagnostics. */
2726 complete_ctor_identifier,
2728 LOOKUP_NORMAL,
2729 complain);
2731 }
2733 {
2738 {
2742 else
2743 {
2747 complain);
2748 else
2749 /* We'll check the length at runtime. */
2753 }
2754 }
2756 {
2760 else
2763 }
2764 init_expr
2768 integer_one_node,
2769 complain),
2770 vecinit,
2771 explicit_value_init_p,
2773 complain);
2775 /* An array initialization is stable because the initialization
2776 of each element is a full-expression, so the temporaries don't
2777 leak out. */
2779 }
2780 else
2781 {
2785 {
2787 complete_ctor_identifier,
2789 LOOKUP_NORMAL,
2790 complain);
2791 }
2793 {
2794 /* Something like `new int()'. */
2799 }
2800 else
2801 {
2802 tree ie;
2804 /* We are processing something like `new int (10)', which
2805 means allocate an int, and initialize it with 10. */
2808 complain);
2810 complain);
2811 }
2813 }
2818 /* If any part of the object initialization terminates by throwing an
2819 exception and a suitable deallocation function can be found, the
2820 deallocation function is called to free the memory in which the
2821 object was being constructed, after which the exception continues
2822 to propagate in the context of the new-expression. If no
2823 unambiguous matching deallocation function can be found,
2824 propagating the exception does not cause the object's memory to be
2825 freed. */
2827 {
2829 tree cleanup;
2831 /* The Standard is unclear here, but the right thing to do
2832 is to use the same method for finding deallocation
2833 functions that we use for finding allocation functions. */
2834 cleanup = (build_op_delete_call
2836 alloc_node,
2837 size,
2838 globally_qualified_p,
2840 alloc_fn,
2841 complain));
2846 /* This is much simpler if we were able to preevaluate all of
2847 the arguments to the constructor call. */
2848 {
2849 /* CLEANUP is compiler-generated, so no diagnostics. */
2853 /* Likewise, this try-catch is compiler-generated. */
2855 }
2856 else
2857 /* Ack! First we allocate the memory. Then we set our sentry
2858 variable to true, and expand a cleanup that deletes the
2859 memory if sentry is true. Then we run the constructor, and
2860 finally clear the sentry.
2862 We need to do this because we allocate the space first, so
2863 if there are any temporaries with cleanups in the
2864 constructor args and we weren't able to preevaluate them, we
2865 need this EH region to extend until end of full-expression
2866 to preserve nesting. */
2867 {
2875 /* CLEANUP is compiler-generated, so no diagnostics. */
2885 init_expr
2888 end));
2889 /* Likewise, this is compiler-generated. */
2891 }
2892 }
2893 }
2894 else
2897 /* Now build up the return value in reverse order. */
2907 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
2908 and return the call (which doesn't need to be adjusted). */
2910 else
2911 {
2913 {
2916 nullptr_node,
2917 complain);
2920 }
2922 /* Perform the allocation before anything else, so that ALLOC_NODE
2923 has been initialized before we start using it. */
2925 }
2930 /* A new-expression is never an lvalue. */
2934 }
2936 /* Generate a representation for a C++ "new" expression. *PLACEMENT
2937 is a vector of placement-new arguments (or NULL if none). If NELTS
2938 is NULL, TYPE is the type of the storage to be allocated. If NELTS
2939 is not NULL, then this is an array-new allocation; TYPE is the type
2940 of the elements in the array and NELTS is the number of elements in
2941 the array. *INIT, if non-NULL, is the initializer for the new
2942 object, or an empty vector to indicate an initializer of "()". If
2943 USE_GLOBAL_NEW is true, then the user explicitly wrote "::new"
2944 rather than just "new". This may change PLACEMENT and INIT. */
2946 tree
2949 {
2950 tree rval;
2959 /* Don't do auto deduction where it might affect mangling. */
2961 {
2964 {
2968 }
2969 }
2972 {
2979 use_global_new);
2990 }
2993 {
2995 {
2998 else
3000 }
3003 }
3005 /* ``A reference cannot be created by the new operator. A reference
3006 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
3007 returned by new.'' ARM 5.3.3 */
3009 {
3012 else
3015 }
3018 {
3022 }
3024 /* The type allocated must be complete. If the new-type-id was
3025 "T[N]" then we are just checking that "T" is complete here, but
3026 that is equivalent, since the value of "N" doesn't matter. */
3035 {
3041 }
3043 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
3048 }
3050 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
3052 tree
3054 {
3060 {
3063 {
3066 }
3068 }
3070 /* Mangle the class$ field. */
3071 {
3072 tree field;
3075 {
3079 }
3081 {
3084 }
3085 }
3089 {
3099 }
3101 }
3102 \f
3103 static tree
3105 special_function_kind auto_delete_vec,
3107 {
3108 tree virtual_size;
3110 tree size_exp;
3112 /* Temporary variables used by the loop. */
3115 /* This is the body of the loop that implements the deletion of a
3116 single element, and moves temp variables to next elements. */
3117 tree body;
3119 /* This is the LOOP_EXPR that governs the deletion of the elements. */
3122 /* This is the thing that governs what to do after the loop has run. */
3125 /* This is the BIND_EXPR which holds the outermost iterator of the
3126 loop. It is convenient to set this variable up and test it before
3127 executing any other code in the loop.
3128 This is also the containing expression returned by this function. */
3130 tree tmp;
3132 /* We should only have 1-D arrays here. */
3139 {
3142 "possible problem detected in invocation of "
3144 {
3147 "class-specific operator delete [] will be called, "
3149 }
3151 }
3158 /* The below is short by the cookie size. */
3163 tbase_init
3167 base),
3168 virtual_size),
3169 complain);
3187 complain);
3195 no_destructor:
3196 /* Delete the storage if appropriate. */
3198 {
3199 tree base_tbd;
3201 /* The below is short by the cookie size. */
3206 /* no header */
3208 else
3209 {
3210 tree cookie_size;
3214 MINUS_EXPR,
3217 cookie_size,
3218 complain);
3222 /* True size with header. */
3224 }
3231 complain);
3232 }
3236 ;
3239 else
3245 /* Outermost wrapper: If pointer is null, punt. */
3250 nullptr_node)),
3255 {
3258 }
3261 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
3265 }
3267 /* Create an unnamed variable of the indicated TYPE. */
3269 tree
3271 {
3272 tree decl;
3282 }
3284 /* Create a new temporary variable of the indicated TYPE, initialized
3285 to INIT.
3287 It is not entered into current_binding_level, because that breaks
3288 things when it comes time to do final cleanups (which take place
3289 "outside" the binding contour of the function). */
3291 tree
3293 {
3294 tree decl;
3300 tf_warning_or_error));
3303 }
3305 /* `build_vec_init' returns tree structure that performs
3306 initialization of a vector of aggregate types.
3308 BASE is a reference to the vector, of ARRAY_TYPE, or a pointer
3309 to the first element, of POINTER_TYPE.
3310 MAXINDEX is the maximum index of the array (one less than the
3311 number of elements). It is only used if BASE is a pointer or
3312 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
3314 INIT is the (possibly NULL) initializer.
3316 If EXPLICIT_VALUE_INIT_P is true, then INIT must be NULL. All
3317 elements in the array are value-initialized.
3319 FROM_ARRAY is 0 if we should init everything with INIT
3320 (i.e., every element initialized from INIT).
3321 FROM_ARRAY is 1 if we should index into INIT in parallel
3322 with initialization of DECL.
3323 FROM_ARRAY is 2 if we should index into INIT in parallel,
3324 but use assignment instead of initialization. */
3326 tree
3330 {
3331 tree rval;
3334 tree iterator;
3335 /* The type of BASE. */
3337 /* The type of an element in the array. */
3339 /* The element type reached after removing all outer array
3340 types. */
3341 tree inner_elt_type;
3342 /* The type of a pointer to an element in the array. */
3343 tree ptype;
3344 tree stmt_expr;
3345 tree compound_stmt;
3367 /* Look through the TARGET_EXPR around a compound literal. */
3373 /* If we have a braced-init-list, make sure that the array
3374 is big enough for all the initializers. */
3389 /* Don't do this if the CONSTRUCTOR might contain something
3390 that might throw and require us to clean up. */
3394 {
3395 /* Do non-default initialization of trivial arrays resulting from
3396 brace-enclosed initializers. In this case, digest_init and
3397 store_constructor will handle the semantics for us. */
3403 stmt_expr);
3405 }
3409 {
3415 }
3416 else
3419 /* The code we are generating looks like:
3420 ({
3421 T* t1 = (T*) base;
3422 T* rval = t1;
3423 ptrdiff_t iterator = maxindex;
3424 try {
3425 for (; iterator != -1; --iterator) {
3426 ... initialize *t1 ...
3427 ++t1;
3428 }
3429 } catch (...) {
3430 ... destroy elements that were constructed ...
3431 }
3432 rval;
3433 })
3435 We can omit the try and catch blocks if we know that the
3436 initialization will never throw an exception, or if the array
3437 elements do not have destructors. We can omit the loop completely if
3438 the elements of the array do not have constructors.
3440 We actually wrap the entire body of the above in a STMT_EXPR, for
3441 tidiness.
3443 When copying from array to another, when the array elements have
3444 only trivial copy constructors, we should use __builtin_memcpy
3445 rather than generating a loop. That way, we could take advantage
3446 of whatever cleverness the back end has for dealing with copies
3447 of blocks of memory. */
3456 /* If initializing one array from another, initialize element by
3457 element. We rely upon the below calls to do the argument
3458 checking. Evaluate the initializer before entering the try block. */
3460 {
3469 }
3471 /* Protect the entire array initialization so that we can destroy
3472 the partially constructed array if an exception is thrown.
3473 But don't do this if we're assigning. */
3476 {
3478 }
3480 /* If the initializer is {}, then all elements are initialized from {}.
3481 But for non-classes, that's the same as value-initialization. */
3484 {
3487 else
3488 {
3491 }
3492 }
3494 /* Maybe pull out constant value when from_array? */
3497 {
3498 /* Do non-default initialization of non-trivial arrays resulting from
3499 brace-enclosed initializers. */
3502 /* Should we try to create a constant initializer? */
3507 /* If the constructor already has the array type, it's been through
3508 digest_init, so we shouldn't try to do anything more. */
3512 /* If we're initializing a static array, we want to do static
3513 initialization of any elements with constant initializers even if
3514 some are non-constant. */
3520 {
3521 tree throw_call;
3524 else
3529 }
3533 else
3537 {
3539 tree one_init;
3541 num_initialized_elts++;
3548 else
3554 {
3563 {
3567 else
3570 }
3571 else
3572 {
3574 {
3579 }
3581 }
3582 }
3591 else
3595 complain);
3598 else
3600 }
3603 {
3608 else
3610 }
3612 /* Any elements without explicit initializers get {}. */
3615 else
3616 {
3619 }
3620 }
3622 {
3627 {
3631 }
3632 }
3634 /* Now, default-initialize any remaining elements. We don't need to
3635 do that if a) the type does not need constructing, or b) we've
3636 already initialized all the elements.
3638 We do need to keep going if we're copying an array. */
3643 && (num_initialized_elts
3645 {
3646 /* If the ITERATOR is equal to -1, then we don't have to loop;
3647 we've already initialized all the elements. */
3648 tree for_stmt;
3649 tree elt_init;
3650 tree to;
3656 for_stmt);
3658 complain);
3666 {
3667 tree from;
3670 {
3674 }
3675 else
3680 complain);
3685 complain);
3686 else
3688 }
3690 {
3692 sorry
3696 explicit_value_init_p,
3698 }
3700 {
3704 }
3705 else
3706 {
3710 else
3711 {
3714 complain);
3716 }
3717 }
3727 complain));
3730 complain));
3733 }
3735 /* Make sure to cleanup any partially constructed elements. */
3738 {
3739 tree e;
3742 complain);
3744 /* Flatten multi-dimensional array since build_vec_delete only
3745 expects one-dimensional array. */
3749 /* Avoid mixing signed and unsigned. */
3752 complain);
3761 }
3763 /* The value of the array initialization is the array itself, RVAL
3764 is a pointer to the first element. */
3769 /* Now make the result have the correct type. */
3771 {
3776 }
3785 }
3787 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
3788 build_delete. */
3790 static tree
3792 tsubst_flags_t complain)
3793 {
3794 tree name;
3795 tree fn;
3797 {
3812 }
3817 flags,
3819 complain);
3820 }
3822 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
3823 ADDR is an expression which yields the store to be destroyed.
3824 AUTO_DELETE is the name of the destructor to call, i.e., either
3825 sfk_complete_destructor, sfk_base_destructor, or
3826 sfk_deleting_destructor.
3828 FLAGS is the logical disjunction of zero or more LOOKUP_
3829 flags. See cp-tree.h for more info. */
3831 tree
3834 {
3835 tree expr;
3840 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
3841 set to `error_mark_node' before it gets properly cleaned up. */
3850 {
3857 /* We don't want to warn about delete of void*, only other
3858 incomplete types. Deleting other incomplete types
3859 invokes undefined behavior, but it is not ill-formed, so
3860 compile to something that would even do The Right Thing
3861 (TM) should the type have a trivial dtor and no delete
3862 operator. */
3864 {
3867 {
3870 "possible problem detected in invocation of "
3872 {
3875 "neither the destructor nor the class-specific "
3876 "operator delete will be called, even if they are "
3878 }
3880 }
3884 {
3885 tree dtor;
3888 {
3891 "deleting object of abstract class type %qT"
3892 " which has non-virtual destructor"
3894 else
3896 "deleting object of polymorphic class type %qT"
3897 " which has non-virtual destructor"
3899 }
3900 }
3901 }
3903 /* Call the builtin operator delete. */
3908 /* Throw away const and volatile on target type of addr. */
3910 }
3912 {
3913 handle_array:
3916 {
3920 }
3923 }
3924 else
3925 {
3926 /* Don't check PROTECT here; leave that decision to the
3927 destructor. If the destructor is accessible, call it,
3928 else report error. */
3936 }
3941 {
3947 use_global_delete,
3950 complain);
3951 }
3952 else
3953 {
3956 tree ifexp;
3961 /* For `::delete x', we must not use the deleting destructor
3962 since then we would not be sure to get the global `operator
3963 delete'. */
3965 {
3966 /* We will use ADDR multiple times so we must save it. */
3969 /* Delete the object. */
3971 /* Otherwise, treat this like a complete object destructor
3972 call. */
3974 }
3975 /* If the destructor is non-virtual, there is no deleting
3976 variant. Instead, we must explicitly call the appropriate
3977 `operator delete' here. */
3980 {
3981 /* We will use ADDR multiple times so we must save it. */
3983 /* Build the call. */
3985 addr,
3990 complain);
3991 /* Call the complete object destructor. */
3993 }
3996 {
3997 /* Make sure we have access to the member op delete, even though
3998 we'll actually be calling it from the destructor. */
4003 complain);
4004 }
4013 /* We need to calculate this before the dtor changes the vptr. */
4018 /* Explicit destructor call; don't check for null pointer. */
4020 else
4021 {
4022 /* Handle deleting a null pointer. */
4025 complain));
4028 }
4035 }
4036 }
4038 /* At the beginning of a destructor, push cleanups that will call the
4039 destructors for our base classes and members.
4041 Called from begin_destructor_body. */
4043 void
4045 {
4048 tree member;
4049 tree expr;
4052 /* Run destructors for all virtual baseclasses. */
4054 {
4055 tree cond = (condition_conversion
4057 current_in_charge_parm,
4058 integer_two_node)));
4060 /* The CLASSTYPE_VBASECLASSES vector is in initialization
4061 order, which is also the right order for pushing cleanups. */
4064 {
4066 {
4068 base_dtor_identifier,
4069 NULL,
4070 base_binfo,
4071 (LOOKUP_NORMAL
4073 tf_warning_or_error);
4077 }
4078 }
4079 }
4081 /* Take care of the remaining baseclasses. */
4084 {
4090 base_dtor_identifier,
4093 tf_warning_or_error);
4095 }
4097 /* Don't automatically destroy union members. */
4103 {
4112 {
4113 tree this_member = (build_class_member_access_expr
4117 tf_warning_or_error));
4119 sfk_complete_destructor,
4123 }
4124 }
4125 }
4127 /* Build a C++ vector delete expression.
4128 MAXINDEX is the number of elements to be deleted.
4129 ELT_SIZE is the nominal size of each element in the vector.
4130 BASE is the expression that should yield the store to be deleted.
4131 This function expands (or synthesizes) these calls itself.
4132 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
4134 This also calls delete for virtual baseclasses of elements of the vector.
4136 Update: MAXINDEX is no longer needed. The size can be extracted from the
4137 start of the vector for pointers, and from the type for arrays. We still
4138 use MAXINDEX for arrays because it happens to already have one of the
4139 values we'd have to extract. (We could use MAXINDEX with pointers to
4140 confirm the size, and trap if the numbers differ; not clear that it'd
4141 be worth bothering.) */
4143 tree
4145 special_function_kind auto_delete_vec,
4147 {
4148 tree type;
4149 tree rval;
4155 {
4156 /* Step back one from start of vector, and read dimension. */
4157 tree cookie_addr;
4162 {
4165 }
4170 cookie_addr);
4172 }
4174 {
4175 /* Get the total number of things in the array, maxindex is a
4176 bad name. */
4183 {
4186 }
4187 }
4188 else
4189 {
4193 }
4201 }