| blob | 6851fe9dc7e7d1da79b05c68bfe16e9a6eb2e0ad |
1 /* Handle initialization things in C++.
2 Copyright (C) 1987-2014 Free Software Foundation, Inc.
3 Contributed by Michael Tiemann (tiemann@cygnus.com)
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
10 any later version.
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
21 /* High-level class interface. */
52 /* We are about to generate some complex initialization code.
53 Conceptually, it is all a single expression. However, we may want
54 to include conditionals, loops, and other such statement-level
55 constructs. Therefore, we build the initialization code inside a
56 statement-expression. This function starts such an expression.
57 STMT_EXPR_P and COMPOUND_STMT_P are filled in by this function;
58 pass them back to finish_init_stmts when the expression is
59 complete. */
61 static bool
63 {
70 }
72 /* Finish out the statement-expression begun by the previous call to
73 begin_init_stmts. Returns the statement-expression itself. */
75 static tree
77 {
85 }
87 /* Constructors */
89 /* Called from initialize_vtbl_ptrs via dfs_walk. BINFO is the base
90 which we want to initialize the vtable pointer for, DATA is
91 TREE_LIST whose TREE_VALUE is the this ptr expression. */
93 static tree
95 {
100 {
104 tf_warning_or_error);
107 }
110 }
112 /* Initialize all the vtable pointers in the object pointed to by
113 ADDR. */
115 void
117 {
118 tree list;
119 tree type;
124 /* Walk through the hierarchy, initializing the vptr in each base
125 class. We do these in pre-order because we can't find the virtual
126 bases for a class until we've initialized the vtbl for that
127 class. */
129 }
131 /* Return an expression for the zero-initialization of an object with
132 type T. This expression will either be a constant (in the case
133 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
134 aggregate), or NULL (in the case that T does not require
135 initialization). In either case, the value can be used as
136 DECL_INITIAL for a decl of the indicated TYPE; it is a valid static
137 initializer. If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS
138 is the number of elements in the array. If STATIC_STORAGE_P is
139 TRUE, initializers are only generated for entities for which
140 zero-initialization does not simply mean filling the storage with
141 zero bytes. FIELD_SIZE, if non-NULL, is the bit size of the field,
142 subfields with bit positions at or above that bit size shouldn't
143 be added. Note that this only works when the result is assigned
144 to a base COMPONENT_REF; if we only have a pointer to the base subobject,
145 expand_assignment will end up clearing the full size of TYPE. */
147 static tree
149 tree field_size)
150 {
153 /* [dcl.init]
155 To zero-initialize an object of type T means:
157 -- if T is a scalar type, the storage is set to the value of zero
158 converted to T.
160 -- if T is a non-union class type, the storage for each nonstatic
161 data member and each base-class subobject is zero-initialized.
163 -- if T is a union type, the storage for its first data member is
164 zero-initialized.
166 -- if T is an array type, the storage for each element is
167 zero-initialized.
169 -- if T is a reference type, no initialization is performed. */
174 ;
176 /* In order to save space, we do not explicitly build initializers
177 for items that do not need them. GCC's semantics are that
178 items with static storage duration that are not otherwise
179 initialized are initialized to zero. */
180 ;
186 {
187 tree field;
190 /* Iterate over the fields, building initializations. */
192 {
199 /* Don't add virtual bases for base classes if they are beyond
200 the size of the current field, that means it is present
201 somewhere else in the object. */
203 {
208 }
210 /* Note that for class types there will be FIELD_DECLs
211 corresponding to base classes as well. Thus, iterating
212 over TYPE_FIELDs will result in correct initialization of
213 all of the subobjects. */
215 {
216 tree new_field_size
223 static_storage_p,
224 new_field_size);
227 }
229 /* For unions, only the first field is initialized. */
232 }
234 /* Build a constructor to contain the initializations. */
236 }
238 {
239 tree max_index;
242 /* Iterate over the array elements, building initializations. */
247 else
250 /* If we have an error_mark here, we should just return error mark
251 as we don't know the size of the array yet. */
256 /* A zero-sized array, which is accepted as an extension, will
257 have an upper bound of -1. */
259 {
260 constructor_elt ce;
262 /* If this is a one element array, we just use a regular init. */
265 else
267 max_index);
273 {
276 }
277 }
279 /* Build a constructor to contain the initializations. */
281 }
284 else
287 /* In all cases, the initializer is a constant. */
292 }
294 /* Return an expression for the zero-initialization of an object with
295 type T. This expression will either be a constant (in the case
296 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
297 aggregate), or NULL (in the case that T does not require
298 initialization). In either case, the value can be used as
299 DECL_INITIAL for a decl of the indicated TYPE; it is a valid static
300 initializer. If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS
301 is the number of elements in the array. If STATIC_STORAGE_P is
302 TRUE, initializers are only generated for entities for which
303 zero-initialization does not simply mean filling the storage with
304 zero bytes. */
306 tree
308 {
310 }
312 /* Return a suitable initializer for value-initializing an object of type
313 TYPE, as described in [dcl.init]. */
315 tree
317 {
318 /* [dcl.init]
320 To value-initialize an object of type T means:
322 - if T is a class type (clause 9) with either no default constructor
323 (12.1) or a default constructor that is user-provided or deleted,
324 then then the object is default-initialized;
326 - if T is a (possibly cv-qualified) class type without a user-provided
327 or deleted default constructor, then the object is zero-initialized
328 and the semantic constraints for default-initialization are checked,
329 and if T has a non-trivial default constructor, the object is
330 default-initialized;
332 - if T is an array type, then each element is value-initialized;
334 - otherwise, the object is zero-initialized.
336 A program that calls for default-initialization or
337 value-initialization of an entity of reference type is ill-formed. */
339 /* The AGGR_INIT_EXPR tweaking below breaks in templates. */
345 {
346 tree ctor =
349 complain);
359 {
360 /* This is a class that needs constructing, but doesn't have
361 a user-provided constructor. So we need to zero-initialize
362 the object and then call the implicitly defined ctor.
363 This will be handled in simplify_aggr_init_expr. */
366 }
367 }
369 /* Discard any access checking during subobject initialization;
370 the checks are implied by the call to the ctor which we have
371 verified is OK (cpp0x/defaulted46.C). */
376 }
378 /* Like build_value_init, but don't call the constructor for TYPE. Used
379 for base initializers. */
381 tree
383 {
385 {
389 }
390 /* FIXME the class and array cases should just use digest_init once it is
391 SFINAE-enabled. */
393 {
398 {
399 tree field;
402 /* Iterate over the fields, building initializations. */
404 {
415 /* We could skip vfields and fields of types with
416 user-defined constructors, but I think that won't improve
417 performance at all; it should be simpler in general just
418 to zero out the entire object than try to only zero the
419 bits that actually need it. */
421 /* Note that for class types there will be FIELD_DECLs
422 corresponding to base classes as well. Thus, iterating
423 over TYPE_FIELDs will result in correct initialization of
424 all of the subobjects. */
433 /* We shouldn't have gotten here for anything that would need
434 non-trivial initialization, and gimplify_init_ctor_preeval
435 would need to be fixed to allow it. */
438 }
440 /* Build a constructor to contain the zero- initializations. */
442 }
443 }
445 {
448 /* Iterate over the array elements, building initializations. */
451 /* If we have an error_mark here, we should just return error mark
452 as we don't know the size of the array yet. */
454 {
457 type);
459 }
462 /* A zero-sized array, which is accepted as an extension, will
463 have an upper bound of -1. */
465 {
466 constructor_elt ce;
468 /* If this is a one element array, we just use a regular init. */
471 else
482 /* We shouldn't have gotten here for anything that would need
483 non-trivial initialization, and gimplify_init_ctor_preeval
484 would need to be fixed to allow it. */
487 }
489 /* Build a constructor to contain the initializations. */
491 }
493 {
497 }
499 {
503 }
506 }
508 /* Initialize current class with INIT, a TREE_LIST of
509 arguments for a target constructor. If TREE_LIST is void_type_node,
510 an empty initializer list was given. */
512 static void
514 {
520 tf_warning_or_error));
522 {
524 LOOKUP_NORMAL
525 |LOOKUP_NONVIRTUAL
531 }
532 }
534 /* Return the non-static data initializer for FIELD_DECL MEMBER. */
536 tree
538 {
539 tree init;
545 {
546 /* Do deferred instantiation of the NSDMI. */
547 init = (tsubst_copy_and_build
554 }
555 else
556 {
559 {
564 }
565 /* Strip redundant TARGET_EXPR so we don't need to remap it, and
566 so the aggregate init code below will see a CONSTRUCTOR. */
571 }
575 }
577 /* Initialize MEMBER, a FIELD_DECL, with INIT, a TREE_LIST of
578 arguments. If TREE_LIST is void_type_node, an empty initializer
579 list was given; if NULL_TREE no initializer was given. */
581 static void
583 {
584 tree decl;
587 /* Use the non-static data member initializer if there was no
588 mem-initializer for this field. */
595 /* Effective C++ rule 12 requires that all data members be
596 initialized. */
600 member);
602 /* Get an lvalue for the data member. */
606 tf_warning_or_error);
612 {
618 member);
619 }
622 {
623 /* mem() means value-initialization. */
625 {
629 }
630 else
631 {
637 }
638 }
639 /* Deal with this here, as we will get confused if we try to call the
640 assignment op for an anonymous union. This can happen in a
641 synthesized copy constructor. */
643 {
645 {
648 }
649 }
652 /* Pre-digested NSDMI. */
655 /* { } mem-initializer. */
660 {
661 /* With references and list-initialization, we need to deal with
662 extending temporary lifetimes. 12.2p5: "A temporary bound to a
663 reference member in a constructor’s ctor-initializer (12.6.2)
664 persists until the constructor exits." */
669 tf_warning_or_error);
671 {
676 }
679 /* A FIELD_DECL doesn't really have a suitable lifetime, but
680 make_temporary_var_for_ref_to_temp will treat it as automatic and
681 set_up_extended_ref_temp wants to use the decl in a warning. */
691 }
694 {
696 {
698 {
701 else
705 }
709 {
713 }
714 else
716 }
717 else
718 {
725 {
726 /* TYPE_NEEDS_CONSTRUCTING can be set just because we have a
727 vtable; still give this diagnostic. */
732 }
734 tf_warning_or_error));
735 }
736 }
737 else
738 {
740 {
741 tree core_type;
742 /* member traversal: note it leaves init NULL */
744 {
749 }
751 {
756 }
766 }
768 /* There was an explicit member initialization. Do some work
769 in that case. */
771 tf_warning_or_error);
775 tf_warning_or_error));
776 }
779 {
780 tree expr;
785 tf_warning_or_error);
788 tf_warning_or_error);
793 }
794 }
796 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
797 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
799 static tree
801 {
802 tree fields;
804 /* Note whether or not T is a union. */
809 {
810 tree fieldtype;
812 /* Skip CONST_DECLs for enumeration constants and so forth. */
817 /* Keep track of whether or not any fields are unions. */
821 /* For an anonymous struct or union, we must recursively
822 consider the fields of the anonymous type. They can be
823 directly initialized from the constructor. */
825 {
826 /* Add this field itself. Synthesized copy constructors
827 initialize the entire aggregate. */
829 /* And now add the fields in the anonymous aggregate. */
831 }
832 /* Add this field. */
835 }
838 }
840 /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives
841 a FIELD_DECL or BINFO in T that needs initialization. The
842 TREE_VALUE gives the initializer, or list of initializer arguments.
844 Return a TREE_LIST containing all of the initializations required
845 for T, in the order in which they should be performed. The output
846 list has the same format as the input. */
848 static tree
850 {
851 tree init;
853 tree sorted_inits;
854 tree next_subobject;
859 /* Build up a list of initializations. The TREE_PURPOSE of entry
860 will be the subobject (a FIELD_DECL or BINFO) to initialize. The
861 TREE_VALUE will be the constructor arguments, or NULL if no
862 explicit initialization was provided. */
865 /* Process the virtual bases. */
870 /* Process the direct bases. */
876 /* Process the non-static data members. */
878 /* Reverse the entire list of initializations, so that they are in
879 the order that they will actually be performed. */
882 /* If the user presented the initializers in an order different from
883 that in which they will actually occur, we issue a warning. Keep
884 track of the next subobject which can be explicitly initialized
885 without issuing a warning. */
888 /* Go through the explicit initializers, filling in TREE_PURPOSE in
889 the SORTED_INITS. */
891 {
892 tree subobject;
893 tree subobject_init;
897 /* If the explicit initializers are in sorted order, then
898 SUBOBJECT will be NEXT_SUBOBJECT, or something following
899 it. */
901 subobject_init;
906 /* Issue a warning if the explicit initializer order does not
907 match that which will actually occur.
908 ??? Are all these on the correct lines? */
910 {
914 else
919 else
923 }
925 /* Look again, from the beginning of the list. */
927 {
931 }
933 /* It is invalid to initialize the same subobject more than
934 once. */
936 {
940 subobject);
941 else
944 subobject);
945 }
947 /* Record the initialization. */
950 }
952 /* [class.base.init]
954 If a ctor-initializer specifies more than one mem-initializer for
955 multiple members of the same union (including members of
956 anonymous unions), the ctor-initializer is ill-formed.
958 Here we also splice out uninitialized union members. */
960 {
964 {
965 tree field;
966 tree ctx;
972 /* Skip base classes. */
976 /* If this is an anonymous union with no explicit initializer,
977 splice it out. */
981 /* See if this field is a member of a union, or a member of a
982 structure contained in a union, etc. */
989 /* If this field is not a member of a union, skip it. */
993 /* If this union member has no explicit initializer and no NSDMI,
994 splice it out. */
997 else
1000 /* It's only an error if we have two initializers for the same
1001 union type. */
1003 {
1006 }
1008 /* See if LAST_FIELD and the field initialized by INIT are
1009 members of the same union. If so, there's a problem,
1010 unless they're actually members of the same structure
1011 which is itself a member of a union. For example, given:
1013 union { struct { int i; int j; }; };
1015 initializing both `i' and `j' makes sense. */
1020 {
1021 /* A mem-initializer hides an NSDMI. */
1026 else
1027 {
1030 ctx);
1032 }
1033 }
1037 next:
1040 splice:
1043 }
1044 }
1047 }
1049 /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS
1050 is a TREE_LIST giving the explicit mem-initializer-list for the
1051 constructor. The TREE_PURPOSE of each entry is a subobject (a
1052 FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE
1053 is a TREE_LIST giving the arguments to the constructor or
1054 void_type_node for an empty list of arguments. */
1056 void
1058 {
1061 /* We will already have issued an error message about the fact that
1062 the type is incomplete. */
1069 {
1070 /* Delegating constructor. */
1074 }
1080 /* Sort the mem-initializers into the order in which the
1081 initializations should be performed. */
1086 /* Initialize base classes. */
1090 {
1094 /* We already have issued an error message. */
1099 {
1100 /* If these initializations are taking place in a copy constructor,
1101 the base class should probably be explicitly initialized if there
1102 is a user-defined constructor in the base class (other than the
1103 default constructor, which will be called anyway). */
1111 }
1113 /* Initialize the base. */
1116 else
1117 {
1118 tree base_addr;
1124 tf_warning_or_error),
1125 arguments,
1126 flags,
1127 tf_warning_or_error);
1129 }
1130 }
1133 /* Initialize the vptrs. */
1136 /* Initialize the data members. */
1138 {
1142 }
1143 }
1145 /* Returns the address of the vtable (i.e., the value that should be
1146 assigned to the vptr) for BINFO. */
1148 tree
1150 {
1152 tree vtbl;
1155 /* If this is a virtual primary base, then the vtable we want to store
1156 is that for the base this is being used as the primary base of. We
1157 can't simply skip the initialization, because we may be expanding the
1158 inits of a subobject constructor where the virtual base layout
1159 can be different. */
1163 /* Figure out what vtable BINFO's vtable is based on, and mark it as
1164 used. */
1168 /* Now compute the address to use when initializing the vptr. */
1174 }
1176 /* This code sets up the virtual function tables appropriate for
1177 the pointer DECL. It is a one-ply initialization.
1179 BINFO is the exact type that DECL is supposed to be. In
1180 multiple inheritance, this might mean "C's A" if C : A, B. */
1182 static void
1184 {
1186 tree vtt_index;
1188 /* Compute the initializer for vptr. */
1191 /* We may get this vptr from a VTT, if this is a subobject
1192 constructor or subobject destructor. */
1195 {
1196 tree vtbl2;
1197 tree vtt_parm;
1199 /* Compute the value to use, when there's a VTT. */
1205 /* The actual initializer is the VTT value only in the subobject
1206 constructor. In maybe_clone_body we'll substitute NULL for
1207 the vtt_parm in the case of the non-subobject constructor. */
1212 vtbl2,
1213 vtbl);
1214 }
1216 /* Compute the location of the vtpr. */
1218 tf_warning_or_error),
1222 /* Assign the vtable to the vptr. */
1225 tf_warning_or_error));
1226 }
1228 /* If an exception is thrown in a constructor, those base classes already
1229 constructed must be destroyed. This function creates the cleanup
1230 for BINFO, which has just been constructed. If FLAG is non-NULL,
1231 it is a DECL which is nonzero when this base needs to be
1232 destroyed. */
1234 static void
1236 {
1237 tree expr;
1242 /* Call the destructor. */
1244 base_dtor_identifier,
1245 NULL,
1246 binfo,
1248 tf_warning_or_error);
1260 }
1262 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its
1263 constructor. */
1265 static void
1267 {
1268 tree inner_if_stmt;
1269 tree exp;
1270 tree flag;
1272 /* If there are virtual base classes with destructors, we need to
1273 emit cleanups to destroy them if an exception is thrown during
1274 the construction process. These exception regions (i.e., the
1275 period during which the cleanups must occur) begin from the time
1276 the construction is complete to the end of the function. If we
1277 create a conditional block in which to initialize the
1278 base-classes, then the cleanup region for the virtual base begins
1279 inside a block, and ends outside of that block. This situation
1280 confuses the sjlj exception-handling code. Therefore, we do not
1281 create a single conditional block, but one for each
1282 initialization. (That way the cleanup regions always begin
1283 in the outer block.) We trust the back end to figure out
1284 that the FLAG will not change across initializations, and
1285 avoid doing multiple tests. */
1290 /* Compute the location of the virtual base. If we're
1291 constructing virtual bases, then we must be the most derived
1292 class. Therefore, we don't have to look up the virtual base;
1293 we already know where it is. */
1302 }
1304 /* Find the context in which this FIELD can be initialized. */
1306 static tree
1308 {
1311 /* Anonymous union members can be initialized in the first enclosing
1312 non-anonymous union context. */
1316 }
1318 /* Function to give error message if member initialization specification
1319 is erroneous. FIELD is the member we decided to initialize.
1320 TYPE is the type for which the initialization is being performed.
1321 FIELD must be a member of TYPE.
1323 MEMBER_NAME is the name of the member. */
1325 static int
1327 {
1331 {
1333 member_name);
1335 }
1337 {
1340 field);
1342 }
1344 {
1348 }
1350 {
1352 member_name);
1354 }
1357 }
1359 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it
1360 is a _TYPE node or TYPE_DECL which names a base for that type.
1361 Check the validity of NAME, and return either the base _TYPE, base
1362 binfo, or the FIELD_DECL of the member. If NAME is invalid, return
1363 NULL_TREE and issue a diagnostic.
1365 An old style unnamed direct single base construction is permitted,
1366 where NAME is NULL. */
1368 tree
1370 {
1371 tree basetype;
1372 tree field;
1378 {
1379 /* This is an obsolete unnamed base class initializer. The
1380 parser will already have warned about its use. */
1382 {
1385 current_class_type);
1388 basetype = BINFO_TYPE
1393 current_class_type);
1395 }
1396 }
1398 {
1401 }
1404 else
1408 {
1409 tree class_binfo;
1410 tree direct_binfo;
1411 tree virtual_binfo;
1422 /* Look for a direct base. */
1427 /* Look for a virtual base -- unless the direct base is itself
1428 virtual. */
1432 /* [class.base.init]
1434 If a mem-initializer-id is ambiguous because it designates
1435 both a direct non-virtual base class and an inherited virtual
1436 base class, the mem-initializer is ill-formed. */
1438 {
1440 basetype);
1442 }
1445 {
1449 else
1453 }
1456 }
1457 else
1458 {
1461 else
1466 }
1469 }
1471 /* This is like `expand_member_init', only it stores one aggregate
1472 value into another.
1474 INIT comes in two flavors: it is either a value which
1475 is to be stored in EXP, or it is a parameter list
1476 to go to a constructor, which will operate on EXP.
1477 If INIT is not a parameter list for a constructor, then set
1478 LOOKUP_ONLYCONVERTING.
1479 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1480 the initializer, if FLAGS is 0, then it is the (init) form.
1481 If `init' is a CONSTRUCTOR, then we emit a warning message,
1482 explaining that such initializations are invalid.
1484 If INIT resolves to a CALL_EXPR which happens to return
1485 something of the type we are looking for, then we know
1486 that we can safely use that call to perform the
1487 initialization.
1489 The virtual function table pointer cannot be set up here, because
1490 we do not really know its type.
1492 This never calls operator=().
1494 When initializing, nothing is CONST.
1496 A default copy constructor may have to be used to perform the
1497 initialization.
1499 A constructor or a conversion operator may have to be used to
1500 perform the initialization, but not both, as it would be ambiguous. */
1502 tree
1504 {
1505 tree stmt_expr;
1506 tree compound_stmt;
1527 {
1528 tree itype;
1530 /* An array may not be initialized use the parenthesized
1531 initialization form -- unless the initializer is "()". */
1533 {
1537 }
1538 /* Must arrange to initialize each element of EXP
1539 from elements of INIT. */
1549 complain);
1553 /* Restore the type of init unless it was used directly. */
1557 }
1561 /* Just know that we've seen something for this node. */
1575 }
1577 static void
1579 tsubst_flags_t complain)
1580 {
1582 tree ctor_name;
1584 /* It fails because there may not be a constructor which takes
1585 its own type as the first (or only parameter), but which does
1586 take other types via a conversion. So, if the thing initializing
1587 the expression is a unit element of type X, first try X(X&),
1588 followed by initialization by X. If neither of these work
1589 out, then look hard. */
1590 tree rval;
1593 /* If we have direct-initialization from an initializer list, pull
1594 it out of the TREE_LIST so the code below can see it. */
1597 {
1601 }
1605 /* A brace-enclosed initializer for an aggregate. In C++0x this can
1606 happen for direct-initialization, too. */
1609 /* A CONSTRUCTOR of the target's type is a previously digested
1610 initializer, whether that happened just above or in
1611 cp_parser_late_parsing_nsdmi.
1613 A TARGET_EXPR with TARGET_EXPR_DIRECT_INIT_P or TARGET_EXPR_LIST_INIT_P
1614 set represents the whole initialization, so we shouldn't build up
1615 another ctor call. */
1622 {
1623 /* Early initialization via a TARGET_EXPR only works for
1624 complete objects. */
1631 }
1635 {
1636 /* Base subobjects should only get direct-initialization. */
1640 /* Do nothing. We hit this in two cases: Reference initialization,
1641 where we aren't initializing a real variable, so we don't want
1642 to run a new constructor; and catching an exception, where we
1643 have already built up the constructor call so we could wrap it
1645 else
1650 /* We need to protect the initialization of a catch parm with a
1651 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
1652 around the TARGET_EXPR for the copy constructor. See
1653 initialize_handler_parm. */
1654 {
1658 }
1659 else
1664 }
1669 {
1673 }
1674 else
1679 {
1680 /* Delegating constructor. */
1681 tree complete;
1682 tree base;
1685 /* Unshare the arguments for the second call. */
1688 {
1691 }
1694 complain);
1700 complain);
1705 base,
1706 complete);
1707 }
1708 else
1709 {
1712 else
1715 complain);
1716 }
1722 {
1725 {
1729 }
1730 }
1732 /* FIXME put back convert_to_void? */
1735 }
1737 /* This function is responsible for initializing EXP with INIT
1738 (if any).
1740 BINFO is the binfo of the type for who we are performing the
1741 initialization. For example, if W is a virtual base class of A and B,
1742 and C : A, B.
1743 If we are initializing B, then W must contain B's W vtable, whereas
1744 were we initializing C, W must contain C's W vtable.
1746 TRUE_EXP is nonzero if it is the true expression being initialized.
1747 In this case, it may be EXP, or may just contain EXP. The reason we
1748 need this is because if EXP is a base element of TRUE_EXP, we
1749 don't necessarily know by looking at EXP where its virtual
1750 baseclass fields should really be pointing. But we do know
1751 from TRUE_EXP. In constructors, we don't know anything about
1752 the value being initialized.
1754 FLAGS is just passed to `build_new_method_call'. See that function
1755 for its description. */
1757 static void
1759 tsubst_flags_t complain)
1760 {
1766 /* Use a function returning the desired type to initialize EXP for us.
1767 If the function is a constructor, and its first argument is
1768 NULL_TREE, know that it was meant for us--just slide exp on
1769 in and expand the constructor. Constructors now come
1770 as TARGET_EXPRs. */
1774 {
1776 /* If store_init_value returns NULL_TREE, the INIT has been
1777 recorded as the DECL_INITIAL for EXP. That means there's
1778 nothing more we have to do. */
1784 }
1786 /* If an explicit -- but empty -- initializer list was present,
1787 that's value-initialization. */
1789 {
1790 /* If the type has data but no user-provided ctor, we need to zero
1791 out the object. */
1794 {
1797 /* Don't clobber already initialized virtual bases. */
1800 field_size);
1803 }
1805 /* If we don't need to mess with the constructor at all,
1806 then we're done. */
1810 /* Otherwise fall through and call the constructor. */
1812 }
1814 /* We know that expand_default_init can handle everything we want
1815 at this point. */
1817 }
1819 /* Report an error if TYPE is not a user-defined, class type. If
1820 OR_ELSE is nonzero, give an error message. */
1822 int
1824 {
1829 {
1833 }
1835 }
1837 tree
1839 {
1845 else
1847 }
1849 /* Build a reference to a member of an aggregate. This is not a C++
1850 `&', but really something which can have its address taken, and
1851 then act as a pointer to member, for example TYPE :: FIELD can have
1852 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if
1853 this expression is the operand of "&".
1855 @@ Prints out lousy diagnostics for operator <typename>
1856 @@ fields.
1858 @@ This function should be rewritten and placed in search.c. */
1860 tree
1862 tsubst_flags_t complain)
1863 {
1864 tree decl;
1867 /* class templates can come in as TEMPLATE_DECLs here. */
1880 /* Callers should call mark_used before this point. */
1885 {
1889 }
1891 /* Entities other than non-static members need no further
1892 processing. */
1899 {
1903 }
1905 /* Set up BASEBINFO for member lookup. */
1908 /* A lot of this logic is now handled in lookup_member. */
1910 {
1911 /* Go from the TREE_BASELINK to the member function info. */
1915 {
1916 /* Get rid of a potential OVERLOAD around it. */
1919 /* Unique functions are handled easily. */
1921 /* For non-static member of base class, we need a special rule
1922 for access checking [class.protected]:
1924 If the access is to form a pointer to member, the
1925 nested-name-specifier shall name the derived class
1926 (or any class derived from that class). */
1930 complain);
1931 else
1933 complain);
1938 }
1939 else
1941 }
1943 /* We need additional test besides the one in
1944 check_accessibility_of_qualified_id in case it is
1945 a pointer to non-static member. */
1947 complain);
1950 {
1951 /* If MEMBER is non-static, then the program has fallen afoul of
1952 [expr.prim]:
1954 An id-expression that denotes a nonstatic data member or
1955 nonstatic member function of a class can only be used:
1957 -- as part of a class member access (_expr.ref_) in which the
1958 object-expression refers to the member's class or a class
1959 derived from that class, or
1961 -- to form a pointer to member (_expr.unary.op_), or
1963 -- in the body of a nonstatic member function of that class or
1964 of a class derived from that class (_class.mfct.nonstatic_), or
1966 -- in a mem-initializer for a constructor for that class or for
1967 a class derived from that class (_class.base.init_). */
1969 {
1970 /* Build a representation of the qualified name suitable
1971 for use as the operand to "&" -- even though the "&" is
1972 not actually present. */
1974 /* In Microsoft mode, treat a non-static member function as if
1975 it were a pointer-to-member. */
1977 {
1980 }
1985 }
1987 {
1991 }
1993 }
1998 }
2000 /* If DECL is a scalar enumeration constant or variable with a
2001 constant initializer, return the initializer (or, its initializers,
2002 recursively); otherwise, return DECL. If INTEGRAL_P, the
2003 initializer is only returned if DECL is an integral
2004 constant-expression. If RETURN_AGGREGATE_CST_OK_P, it is ok to
2005 return an aggregate constant. */
2007 static tree
2009 {
2011 || (integral_p
2015 {
2016 tree init;
2017 /* If DECL is a static data member in a template
2018 specialization, we must instantiate it here. The
2019 initializer for the static data member is not processed
2020 until needed; we need it now. */
2025 {
2027 /* Treat the error as a constant to avoid cascading errors on
2028 excessively recursive template instantiation (c++/9335). */
2030 else
2032 }
2033 /* Initializers in templates are generally expanded during
2034 instantiation, so before that for const int i(2)
2035 INIT is a TREE_LIST with the actual initializer as
2036 TREE_VALUE. */
2038 && init
2046 /* Unless RETURN_AGGREGATE_CST_OK_P is true, do not
2047 return an aggregate constant (of which string
2048 literals are a special case), as we do not want
2049 to make inadvertent copies of such entities, and
2050 we must be sure that their addresses are the
2051 same everywhere. */
2056 }
2058 }
2060 /* If DECL is a CONST_DECL, or a constant VAR_DECL initialized by
2061 constant of integral or enumeration type, then return that value.
2062 These are those variables permitted in constant expressions by
2063 [5.19/1]. */
2065 tree
2067 {
2070 }
2072 /* A more relaxed version of integral_constant_value, used by the
2073 common C/C++ code. */
2075 tree
2077 {
2080 }
2082 /* A version of integral_constant_value used by the C++ front end for
2083 optimization purposes. */
2085 tree
2087 {
2090 }
2091 \f
2092 /* Common subroutines of build_new and build_vec_delete. */
2094 /* Call the global __builtin_delete to delete ADDR. */
2096 static tree
2098 {
2101 }
2102 \f
2103 /* Build and return a NEW_EXPR. If NELTS is non-NULL, TYPE[NELTS] is
2104 the type of the object being allocated; otherwise, it's just TYPE.
2105 INIT is the initializer, if any. USE_GLOBAL_NEW is true if the
2106 user explicitly wrote "::operator new". PLACEMENT, if non-NULL, is
2107 a vector of arguments to be provided as arguments to a placement
2108 new operator. This routine performs no semantic checks; it just
2109 creates and returns a NEW_EXPR. */
2111 static tree
2114 {
2115 tree init_list;
2116 tree new_expr;
2118 /* If INIT is NULL, the we want to store NULL_TREE in the NEW_EXPR.
2119 If INIT is not NULL, then we want to store VOID_ZERO_NODE. This
2120 permits us to distinguish the case of a missing initializer "new
2121 int" from an empty initializer "new int()". */
2126 else
2131 init_list);
2136 }
2138 /* Diagnose uninitialized const members or reference members of type
2139 TYPE. USING_NEW is used to disambiguate the diagnostic between a
2140 new expression without a new-initializer and a declaration. Returns
2141 the error count. */
2143 static int
2146 {
2147 tree field;
2154 {
2155 tree field_type;
2166 {
2169 {
2171 {
2175 else
2177 }
2178 else
2179 {
2184 else
2187 }
2190 }
2191 }
2194 {
2197 {
2199 {
2203 else
2205 }
2206 else
2207 {
2212 else
2215 }
2218 }
2219 }
2222 error_count
2225 }
2227 }
2229 int
2231 {
2233 }
2235 /* Call __cxa_bad_array_new_length to indicate that the size calculation
2236 overflowed. Pretend it returns sizetype so that it plays nicely in the
2237 COND_EXPR. */
2239 tree
2241 {
2245 NULL_TREE));
2248 }
2250 /* Call __cxa_bad_array_length to indicate that there were too many
2251 initializers. */
2253 tree
2255 {
2259 NULL_TREE));
2262 }
2264 /* Generate code for a new-expression, including calling the "operator
2265 new" function, initializing the object, and, if an exception occurs
2266 during construction, cleaning up. The arguments are as for
2267 build_raw_new_expr. This may change PLACEMENT and INIT. */
2269 static tree
2272 tsubst_flags_t complain)
2273 {
2275 /* True iff this is a call to "operator new[]" instead of just
2276 "operator new". */
2278 /* If ARRAY_P is true, the element type of the array. This is never
2279 an ARRAY_TYPE; for something like "new int[3][4]", the
2280 ELT_TYPE is "int". If ARRAY_P is false, this is the same type as
2281 TYPE. */
2282 tree elt_type;
2283 /* The type of the new-expression. (This type is always a pointer
2284 type.) */
2285 tree pointer_type;
2286 tree non_const_pointer_type;
2288 /* For arrays, a bounds checks on the NELTS parameter. */
2293 /* Size of the inner array elements. */
2294 offset_int inner_size;
2295 /* The address returned by the call to "operator new". This node is
2296 a VAR_DECL and is therefore reusable. */
2297 tree alloc_node;
2298 tree alloc_fn;
2302 /* If non-NULL, the number of extra bytes to allocate at the
2303 beginning of the storage allocated for an array-new expression in
2304 order to store the number of elements. */
2306 tree placement_first;
2308 /* True if the function we are calling is a placement allocation
2309 function. */
2311 /* True if the storage must be initialized, either by a constructor
2312 or due to an explicit new-initializer. */
2314 /* The address of the thing allocated, not including any cookie. In
2315 particular, if an array cookie is in use, DATA_ADDR is the
2316 address of the first array element. This node is a VAR_DECL, and
2317 is therefore reusable. */
2318 tree data_addr;
2323 {
2326 }
2328 {
2329 /* Transforms new (T[N]) to new T[N]. The former is a GNU
2330 extension for variable N. (This also covers new T where T is
2331 a VLA typedef.) */
2337 }
2339 /* If our base type is an array, then make sure we know how many elements
2340 it has. */
2344 {
2348 {
2353 {
2357 }
2359 }
2360 else
2361 {
2363 {
2367 }
2369 }
2373 inner_nelts_cst,
2374 complain);
2375 }
2378 {
2381 }
2386 /* Warn if we performed the (T[N]) to T[N] transformation and N is
2387 variable. */
2390 {
2392 {
2397 else
2402 }
2403 else
2405 }
2408 {
2412 }
2420 {
2422 /* A program that calls for default-initialization [...] of an
2423 entity of reference type is ill-formed. */
2427 /* A new-expression that creates an object of type T initializes
2428 that object as follows:
2429 - If the new-initializer is omitted:
2430 -- If T is a (possibly cv-qualified) non-POD class type
2431 (or array thereof), the object is default-initialized (8.5).
2432 [...]
2433 -- Otherwise, the object created has indeterminate
2434 value. If T is a const-qualified type, or a (possibly
2435 cv-qualified) POD class type (or array thereof)
2436 containing (directly or indirectly) a member of
2437 const-qualified type, the program is ill-formed; */
2447 }
2451 {
2455 }
2459 {
2460 /* Maximum available size in bytes. Half of the address space
2461 minus the cookie size. */
2462 offset_int max_size
2464 /* Maximum number of outer elements which can be allocated. */
2465 offset_int max_outer_nelts;
2466 tree max_outer_nelts_tree;
2472 /* Unconditionally subtract the cookie size. This decreases the
2473 maximum object size and is safe even if we choose not to use
2474 a cookie after all. */
2480 {
2484 }
2487 /* Only keep the top-most seven bits, to simplify encoding the
2488 constant in the instruction stream. */
2489 {
2493 shift);
2494 }
2499 outer_nelts,
2500 max_outer_nelts_tree);
2501 }
2505 /* If PLACEMENT is a single simple pointer type not passed by
2506 reference, prepare to capture it in a temporary variable. Do
2507 this now, since PLACEMENT will change in the calls below. */
2513 /* Allocate the object. */
2515 {
2516 tree class_addr;
2517 tree class_decl;
2521 {
2524 }
2533 {
2537 }
2539 {
2543 }
2548 }
2550 {
2553 }
2554 else
2555 {
2556 tree fnname;
2557 tree fns;
2563 && (array_p
2566 {
2567 /* Use a class-specific operator new. */
2568 /* If a cookie is required, add some extra space. */
2571 else
2572 {
2574 /* No size arithmetic necessary, so the size check is
2575 not needed. */
2578 }
2579 /* Perform the overflow check. */
2586 /* Create the argument list. */
2588 /* Do name-lookup to find the appropriate operator. */
2591 {
2595 }
2597 {
2599 {
2602 }
2604 }
2608 LOOKUP_NORMAL,
2610 complain);
2611 }
2612 else
2613 {
2614 /* Use a global operator new. */
2615 /* See if a cookie might be required. */
2617 {
2619 /* No size arithmetic necessary, so the size check is
2620 not needed. */
2623 }
2627 outer_nelts_check,
2629 }
2630 }
2637 /* If we found a simple case of PLACEMENT_EXPR above, then copy it
2638 into a temporary variable. */
2645 {
2650 {
2654 }
2655 }
2657 /* In the simple case, we can stop now. */
2662 /* Store the result of the allocation call in a variable so that we can
2663 use it more than once. */
2667 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */
2671 /* Now, check to see if this function is actually a placement
2672 allocation function. This can happen even when PLACEMENT is NULL
2673 because we might have something like:
2675 struct S { void* operator new (size_t, int i = 0); };
2677 A call to `new S' will get this allocation function, even though
2678 there is no explicit placement argument. If there is more than
2679 one argument, or there are variable arguments, then this is a
2680 placement allocation function. */
2681 placement_allocation_fn_p
2685 /* Preevaluate the placement args so that we don't reevaluate them for a
2686 placement delete. */
2688 {
2689 tree inits;
2693 alloc_expr);
2694 }
2696 /* unless an allocation function is declared with an empty excep-
2697 tion-specification (_except.spec_), throw(), it indicates failure to
2698 allocate storage by throwing a bad_alloc exception (clause _except_,
2699 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2700 cation function is declared with an empty exception-specification,
2701 throw(), it returns null to indicate failure to allocate storage and a
2702 non-null pointer otherwise.
2704 So check for a null exception spec on the op new we just called. */
2710 {
2711 tree cookie;
2712 tree cookie_ptr;
2713 tree size_ptr_type;
2715 /* Adjust so we're pointing to the start of the object. */
2718 /* Store the number of bytes allocated so that we can know how
2719 many elements to destroy later. We use the last sizeof
2720 (size_t) bytes to store the number of elements. */
2731 {
2732 /* Also store the element size. */
2743 }
2744 }
2745 else
2746 {
2749 }
2751 /* Now use a pointer to the type we've actually allocated. */
2753 /* But we want to operate on a non-const version to start with,
2754 since we'll be modifying the elements. */
2755 non_const_pointer_type = build_pointer_type
2759 /* Any further uses of alloc_node will want this type, too. */
2762 /* Now initialize the allocated object. Note that we preevaluate the
2763 initialization expression, apart from the actual constructor call or
2764 assignment--we do this because we want to delay the allocation as long
2765 as possible in order to minimize the size of the exception region for
2766 placement delete. */
2768 {
2773 {
2776 }
2779 {
2780 /* build_value_init doesn't work in templates, and we don't need
2781 the initializer anyway since we're going to throw it away and
2782 rebuild it at instantiation time, so just build up a single
2783 constructor call to get any appropriate diagnostics. */
2787 complete_ctor_identifier,
2789 LOOKUP_NORMAL,
2790 complain);
2792 }
2794 {
2798 {
2802 else
2803 {
2807 complain);
2808 else
2809 /* We'll check the length at runtime. */
2813 }
2814 }
2816 {
2820 else
2823 }
2824 init_expr
2828 integer_one_node,
2829 complain),
2830 vecinit,
2831 explicit_value_init_p,
2833 complain);
2835 /* An array initialization is stable because the initialization
2836 of each element is a full-expression, so the temporaries don't
2837 leak out. */
2839 }
2840 else
2841 {
2845 {
2847 complete_ctor_identifier,
2849 LOOKUP_NORMAL,
2850 complain);
2851 }
2853 {
2854 /* Something like `new int()'. */
2859 }
2860 else
2861 {
2862 tree ie;
2864 /* We are processing something like `new int (10)', which
2865 means allocate an int, and initialize it with 10. */
2868 complain);
2870 complain);
2871 }
2873 }
2878 /* If any part of the object initialization terminates by throwing an
2879 exception and a suitable deallocation function can be found, the
2880 deallocation function is called to free the memory in which the
2881 object was being constructed, after which the exception continues
2882 to propagate in the context of the new-expression. If no
2883 unambiguous matching deallocation function can be found,
2884 propagating the exception does not cause the object's memory to be
2885 freed. */
2887 {
2889 tree cleanup;
2891 /* The Standard is unclear here, but the right thing to do
2892 is to use the same method for finding deallocation
2893 functions that we use for finding allocation functions. */
2894 cleanup = (build_op_delete_call
2896 alloc_node,
2897 size,
2898 globally_qualified_p,
2900 alloc_fn,
2901 complain));
2906 /* This is much simpler if we were able to preevaluate all of
2907 the arguments to the constructor call. */
2908 {
2909 /* CLEANUP is compiler-generated, so no diagnostics. */
2913 /* Likewise, this try-catch is compiler-generated. */
2915 }
2916 else
2917 /* Ack! First we allocate the memory. Then we set our sentry
2918 variable to true, and expand a cleanup that deletes the
2919 memory if sentry is true. Then we run the constructor, and
2920 finally clear the sentry.
2922 We need to do this because we allocate the space first, so
2923 if there are any temporaries with cleanups in the
2924 constructor args and we weren't able to preevaluate them, we
2925 need this EH region to extend until end of full-expression
2926 to preserve nesting. */
2927 {
2935 /* CLEANUP is compiler-generated, so no diagnostics. */
2945 init_expr
2948 end));
2949 /* Likewise, this is compiler-generated. */
2951 }
2952 }
2953 }
2954 else
2957 /* Now build up the return value in reverse order. */
2967 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
2968 and return the call (which doesn't need to be adjusted). */
2970 else
2971 {
2973 {
2976 nullptr_node,
2977 complain);
2980 }
2982 /* Perform the allocation before anything else, so that ALLOC_NODE
2983 has been initialized before we start using it. */
2985 }
2990 /* A new-expression is never an lvalue. */
2994 }
2996 /* Generate a representation for a C++ "new" expression. *PLACEMENT
2997 is a vector of placement-new arguments (or NULL if none). If NELTS
2998 is NULL, TYPE is the type of the storage to be allocated. If NELTS
2999 is not NULL, then this is an array-new allocation; TYPE is the type
3000 of the elements in the array and NELTS is the number of elements in
3001 the array. *INIT, if non-NULL, is the initializer for the new
3002 object, or an empty vector to indicate an initializer of "()". If
3003 USE_GLOBAL_NEW is true, then the user explicitly wrote "::new"
3004 rather than just "new". This may change PLACEMENT and INIT. */
3006 tree
3009 {
3010 tree rval;
3019 /* Don't do auto deduction where it might affect mangling. */
3021 {
3024 {
3028 }
3029 }
3032 {
3039 use_global_new);
3050 }
3053 {
3055 {
3058 else
3060 }
3063 }
3065 /* ``A reference cannot be created by the new operator. A reference
3066 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
3067 returned by new.'' ARM 5.3.3 */
3069 {
3072 else
3075 }
3078 {
3082 }
3084 /* The type allocated must be complete. If the new-type-id was
3085 "T[N]" then we are just checking that "T" is complete here, but
3086 that is equivalent, since the value of "N" doesn't matter. */
3095 {
3101 }
3103 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
3108 }
3110 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
3112 tree
3114 {
3120 {
3123 {
3126 }
3128 }
3130 /* Mangle the class$ field. */
3131 {
3132 tree field;
3135 {
3139 }
3141 {
3144 }
3145 }
3149 {
3159 }
3161 }
3162 \f
3163 static tree
3165 special_function_kind auto_delete_vec,
3167 {
3168 tree virtual_size;
3170 tree size_exp;
3172 /* Temporary variables used by the loop. */
3175 /* This is the body of the loop that implements the deletion of a
3176 single element, and moves temp variables to next elements. */
3177 tree body;
3179 /* This is the LOOP_EXPR that governs the deletion of the elements. */
3182 /* This is the thing that governs what to do after the loop has run. */
3185 /* This is the BIND_EXPR which holds the outermost iterator of the
3186 loop. It is convenient to set this variable up and test it before
3187 executing any other code in the loop.
3188 This is also the containing expression returned by this function. */
3190 tree tmp;
3192 /* We should only have 1-D arrays here. */
3199 {
3202 "possible problem detected in invocation of "
3204 {
3207 "class-specific operator delete [] will be called, "
3209 }
3211 }
3218 {
3219 /* Make sure the destructor is callable. */
3221 {
3224 complain);
3227 }
3229 }
3231 /* The below is short by the cookie size. */
3236 tbase_init
3240 base),
3241 virtual_size),
3242 complain);
3260 complain);
3268 no_destructor:
3269 /* Delete the storage if appropriate. */
3271 {
3272 tree base_tbd;
3274 /* The below is short by the cookie size. */
3279 /* no header */
3281 else
3282 {
3283 tree cookie_size;
3287 MINUS_EXPR,
3290 cookie_size,
3291 complain);
3295 /* True size with header. */
3297 }
3304 complain);
3305 }
3309 ;
3312 else
3318 /* Outermost wrapper: If pointer is null, punt. */
3323 nullptr_node)),
3328 {
3331 }
3334 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
3338 }
3340 /* Create an unnamed variable of the indicated TYPE. */
3342 tree
3344 {
3345 tree decl;
3355 }
3357 /* Create a new temporary variable of the indicated TYPE, initialized
3358 to INIT.
3360 It is not entered into current_binding_level, because that breaks
3361 things when it comes time to do final cleanups (which take place
3362 "outside" the binding contour of the function). */
3364 tree
3366 {
3367 tree decl;
3373 tf_warning_or_error));
3376 }
3378 /* `build_vec_init' returns tree structure that performs
3379 initialization of a vector of aggregate types.
3381 BASE is a reference to the vector, of ARRAY_TYPE, or a pointer
3382 to the first element, of POINTER_TYPE.
3383 MAXINDEX is the maximum index of the array (one less than the
3384 number of elements). It is only used if BASE is a pointer or
3385 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
3387 INIT is the (possibly NULL) initializer.
3389 If EXPLICIT_VALUE_INIT_P is true, then INIT must be NULL. All
3390 elements in the array are value-initialized.
3392 FROM_ARRAY is 0 if we should init everything with INIT
3393 (i.e., every element initialized from INIT).
3394 FROM_ARRAY is 1 if we should index into INIT in parallel
3395 with initialization of DECL.
3396 FROM_ARRAY is 2 if we should index into INIT in parallel,
3397 but use assignment instead of initialization. */
3399 tree
3403 {
3404 tree rval;
3407 tree iterator;
3408 /* The type of BASE. */
3410 /* The type of an element in the array. */
3412 /* The element type reached after removing all outer array
3413 types. */
3414 tree inner_elt_type;
3415 /* The type of a pointer to an element in the array. */
3416 tree ptype;
3417 tree stmt_expr;
3418 tree compound_stmt;
3439 /* Look through the TARGET_EXPR around a compound literal. */
3445 /* If we have a braced-init-list, make sure that the array
3446 is big enough for all the initializers. */
3462 /* Don't do this if the CONSTRUCTOR might contain something
3463 that might throw and require us to clean up. */
3467 {
3468 /* Do non-default initialization of trivial arrays resulting from
3469 brace-enclosed initializers. In this case, digest_init and
3470 store_constructor will handle the semantics for us. */
3478 stmt_expr);
3480 }
3484 {
3490 }
3491 else
3494 /* The code we are generating looks like:
3495 ({
3496 T* t1 = (T*) base;
3497 T* rval = t1;
3498 ptrdiff_t iterator = maxindex;
3499 try {
3500 for (; iterator != -1; --iterator) {
3501 ... initialize *t1 ...
3502 ++t1;
3503 }
3504 } catch (...) {
3505 ... destroy elements that were constructed ...
3506 }
3507 rval;
3508 })
3510 We can omit the try and catch blocks if we know that the
3511 initialization will never throw an exception, or if the array
3512 elements do not have destructors. We can omit the loop completely if
3513 the elements of the array do not have constructors.
3515 We actually wrap the entire body of the above in a STMT_EXPR, for
3516 tidiness.
3518 When copying from array to another, when the array elements have
3519 only trivial copy constructors, we should use __builtin_memcpy
3520 rather than generating a loop. That way, we could take advantage
3521 of whatever cleverness the back end has for dealing with copies
3522 of blocks of memory. */
3531 /* If initializing one array from another, initialize element by
3532 element. We rely upon the below calls to do the argument
3533 checking. Evaluate the initializer before entering the try block. */
3535 {
3544 }
3546 /* Protect the entire array initialization so that we can destroy
3547 the partially constructed array if an exception is thrown.
3548 But don't do this if we're assigning. */
3551 {
3553 }
3555 /* Should we try to create a constant initializer? */
3563 /* If we're initializing a static array, we want to do static
3564 initialization of any elements with constant initializers even if
3565 some are non-constant. */
3571 /* Skip over the handling of non-empty init lists. */
3574 /* Maybe pull out constant value when from_array? */
3577 {
3578 /* Do non-default initialization of non-trivial arrays resulting from
3579 brace-enclosed initializers. */
3582 /* If the constructor already has the array type, it's been through
3583 digest_init, so we shouldn't try to do anything more. */
3588 {
3589 tree throw_call;
3592 else
3597 }
3603 {
3605 tree one_init;
3607 num_initialized_elts++;
3614 else
3620 {
3623 {
3627 else
3629 }
3630 else
3631 {
3633 {
3638 }
3640 }
3641 }
3650 else
3654 complain);
3657 else
3659 }
3661 /* Any elements without explicit initializers get T{}. */
3663 }
3665 {
3670 {
3674 }
3675 }
3677 /* Now, default-initialize any remaining elements. We don't need to
3678 do that if a) the type does not need constructing, or b) we've
3679 already initialized all the elements.
3681 We do need to keep going if we're copying an array. */
3686 && (num_initialized_elts
3688 {
3689 /* If the ITERATOR is equal to -1, then we don't have to loop;
3690 we've already initialized all the elements. */
3691 tree for_stmt;
3692 tree elt_init;
3693 tree to;
3701 complain);
3708 /* If the initializer is {}, then all elements are initialized from T{}.
3709 But for non-classes, that's the same as value-initialization. */
3711 {
3713 {
3717 else
3720 }
3721 else
3722 {
3725 }
3726 }
3729 {
3730 tree from;
3733 {
3737 }
3738 else
3743 complain);
3748 complain);
3749 else
3751 }
3753 {
3755 sorry
3759 explicit_value_init_p,
3761 }
3763 {
3767 }
3768 else
3769 {
3773 else
3774 {
3777 complain);
3779 }
3780 }
3786 {
3789 {
3791 /* Don't fill the CONSTRUCTOR with zeros. */
3795 }
3796 else
3797 {
3801 }
3804 {
3807 {
3810 }
3811 }
3812 }
3820 complain));
3823 complain));
3826 }
3828 /* Make sure to cleanup any partially constructed elements. */
3831 {
3832 tree e;
3835 complain);
3837 /* Flatten multi-dimensional array since build_vec_delete only
3838 expects one-dimensional array. */
3842 /* Avoid mixing signed and unsigned. */
3845 complain);
3854 }
3856 /* The value of the array initialization is the array itself, RVAL
3857 is a pointer to the first element. */
3868 {
3870 {
3873 }
3876 else
3878 }
3880 /* Now make the result have the correct type. */
3882 {
3887 }
3890 }
3892 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
3893 build_delete. */
3895 static tree
3897 tsubst_flags_t complain)
3898 {
3899 tree name;
3900 tree fn;
3902 {
3917 }
3922 flags,
3924 complain);
3925 }
3927 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
3928 ADDR is an expression which yields the store to be destroyed.
3929 AUTO_DELETE is the name of the destructor to call, i.e., either
3930 sfk_complete_destructor, sfk_base_destructor, or
3931 sfk_deleting_destructor.
3933 FLAGS is the logical disjunction of zero or more LOOKUP_
3934 flags. See cp-tree.h for more info. */
3936 tree
3939 {
3940 tree expr;
3947 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
3948 set to `error_mark_node' before it gets properly cleaned up. */
3956 {
3958 {
3962 }
3965 }
3968 {
3973 /* We don't want to warn about delete of void*, only other
3974 incomplete types. Deleting other incomplete types
3975 invokes undefined behavior, but it is not ill-formed, so
3976 compile to something that would even do The Right Thing
3977 (TM) should the type have a trivial dtor and no delete
3978 operator. */
3980 {
3983 {
3986 "possible problem detected in invocation of "
3988 {
3991 "neither the destructor nor the class-specific "
3992 "operator delete will be called, even if they are "
3994 }
3996 }
4000 {
4001 tree dtor;
4004 {
4007 "deleting object of abstract class type %qT"
4008 " which has non-virtual destructor"
4010 else
4012 "deleting object of polymorphic class type %qT"
4013 " which has non-virtual destructor"
4015 }
4016 }
4017 }
4019 /* Call the builtin operator delete. */
4024 /* Throw away const and volatile on target type of addr. */
4026 }
4027 else
4028 {
4029 /* Don't check PROTECT here; leave that decision to the
4030 destructor. If the destructor is accessible, call it,
4031 else report error. */
4039 }
4042 {
4043 /* Make sure the destructor is callable. */
4045 {
4047 complain),
4051 }
4058 use_global_delete,
4061 complain);
4062 }
4063 else
4064 {
4067 tree ifexp;
4072 /* For `::delete x', we must not use the deleting destructor
4073 since then we would not be sure to get the global `operator
4074 delete'. */
4076 {
4077 /* We will use ADDR multiple times so we must save it. */
4080 /* Delete the object. */
4082 /* Otherwise, treat this like a complete object destructor
4083 call. */
4085 }
4086 /* If the destructor is non-virtual, there is no deleting
4087 variant. Instead, we must explicitly call the appropriate
4088 `operator delete' here. */
4091 {
4092 /* We will use ADDR multiple times so we must save it. */
4094 /* Build the call. */
4096 addr,
4101 complain);
4102 /* Call the complete object destructor. */
4104 }
4107 {
4108 /* Make sure we have access to the member op delete, even though
4109 we'll actually be calling it from the destructor. */
4114 complain);
4115 }
4124 /* We need to calculate this before the dtor changes the vptr. */
4129 /* Explicit destructor call; don't check for null pointer. */
4131 else
4132 {
4133 /* Handle deleting a null pointer. */
4136 complain));
4139 }
4145 }
4146 }
4148 /* At the beginning of a destructor, push cleanups that will call the
4149 destructors for our base classes and members.
4151 Called from begin_destructor_body. */
4153 void
4155 {
4158 tree member;
4159 tree expr;
4162 /* Run destructors for all virtual baseclasses. */
4164 {
4165 tree cond = (condition_conversion
4167 current_in_charge_parm,
4168 integer_two_node)));
4170 /* The CLASSTYPE_VBASECLASSES vector is in initialization
4171 order, which is also the right order for pushing cleanups. */
4174 {
4176 {
4178 base_dtor_identifier,
4179 NULL,
4180 base_binfo,
4181 (LOOKUP_NORMAL
4183 tf_warning_or_error);
4185 {
4189 }
4190 }
4191 }
4192 }
4194 /* Take care of the remaining baseclasses. */
4197 {
4203 base_dtor_identifier,
4206 tf_warning_or_error);
4209 }
4211 /* Don't automatically destroy union members. */
4217 {
4226 {
4227 tree this_member = (build_class_member_access_expr
4231 tf_warning_or_error));
4233 sfk_complete_destructor,
4238 }
4239 }
4240 }
4242 /* Build a C++ vector delete expression.
4243 MAXINDEX is the number of elements to be deleted.
4244 ELT_SIZE is the nominal size of each element in the vector.
4245 BASE is the expression that should yield the store to be deleted.
4246 This function expands (or synthesizes) these calls itself.
4247 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
4249 This also calls delete for virtual baseclasses of elements of the vector.
4251 Update: MAXINDEX is no longer needed. The size can be extracted from the
4252 start of the vector for pointers, and from the type for arrays. We still
4253 use MAXINDEX for arrays because it happens to already have one of the
4254 values we'd have to extract. (We could use MAXINDEX with pointers to
4255 confirm the size, and trap if the numbers differ; not clear that it'd
4256 be worth bothering.) */
4258 tree
4260 special_function_kind auto_delete_vec,
4262 {
4263 tree type;
4264 tree rval;
4270 {
4271 /* Step back one from start of vector, and read dimension. */
4272 tree cookie_addr;
4277 {
4280 }
4285 cookie_addr);
4287 }
4289 {
4290 /* Get the total number of things in the array, maxindex is a
4291 bad name. */
4298 {
4301 }
4302 }
4303 else
4304 {
4308 }
4316 }