| blob | 4fa627ba8c01c8b98ab9c31ce428e58472558494 |
1 /* Handle initialization things in C++.
2 Copyright (C) 1987, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010,
4 2011 Free Software Foundation, Inc.
5 Contributed by Michael Tiemann (tiemann@cygnus.com)
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 3, or (at your option)
12 any later version.
14 GCC is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING3. If not see
21 <http://www.gnu.org/licenses/>. */
23 /* 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 {
106 }
109 }
111 /* Initialize all the vtable pointers in the object pointed to by
112 ADDR. */
114 void
116 {
117 tree list;
118 tree type;
123 /* Walk through the hierarchy, initializing the vptr in each base
124 class. We do these in pre-order because we can't find the virtual
125 bases for a class until we've initialized the vtbl for that
126 class. */
128 }
130 /* Return an expression for the zero-initialization of an object with
131 type T. This expression will either be a constant (in the case
132 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
133 aggregate), or NULL (in the case that T does not require
134 initialization). In either case, the value can be used as
135 DECL_INITIAL for a decl of the indicated TYPE; it is a valid static
136 initializer. If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS
137 is the number of elements in the array. If STATIC_STORAGE_P is
138 TRUE, initializers are only generated for entities for which
139 zero-initialization does not simply mean filling the storage with
140 zero bytes. FIELD_SIZE, if non-NULL, is the bit size of the field,
141 subfields with bit positions at or above that bit size shouldn't
142 be added. */
144 static tree
146 tree field_size)
147 {
150 /* [dcl.init]
152 To zero-initialize an object of type T means:
154 -- if T is a scalar type, the storage is set to the value of zero
155 converted to T.
157 -- if T is a non-union class type, the storage for each nonstatic
158 data member and each base-class subobject is zero-initialized.
160 -- if T is a union type, the storage for its first data member is
161 zero-initialized.
163 -- if T is an array type, the storage for each element is
164 zero-initialized.
166 -- if T is a reference type, no initialization is performed. */
171 ;
173 /* In order to save space, we do not explicitly build initializers
174 for items that do not need them. GCC's semantics are that
175 items with static storage duration that are not otherwise
176 initialized are initialized to zero. */
177 ;
181 {
182 tree field;
185 /* Iterate over the fields, building initializations. */
187 {
191 /* Don't add virtual bases for base classes if they are beyond
192 the size of the current field, that means it is present
193 somewhere else in the object. */
195 {
200 }
202 /* Note that for class types there will be FIELD_DECLs
203 corresponding to base classes as well. Thus, iterating
204 over TYPE_FIELDs will result in correct initialization of
205 all of the subobjects. */
207 {
208 tree new_field_size
215 static_storage_p,
216 new_field_size);
219 }
221 /* For unions, only the first field is initialized. */
224 }
226 /* Build a constructor to contain the initializations. */
228 }
230 {
231 tree max_index;
234 /* Iterate over the array elements, building initializations. */
239 else
242 /* If we have an error_mark here, we should just return error mark
243 as we don't know the size of the array yet. */
248 /* A zero-sized array, which is accepted as an extension, will
249 have an upper bound of -1. */
251 {
257 /* If this is a one element array, we just use a regular init. */
260 else
262 max_index);
267 }
269 /* Build a constructor to contain the initializations. */
271 }
274 else
277 /* In all cases, the initializer is a constant. */
282 }
284 /* Return an expression for the zero-initialization of an object with
285 type T. This expression will either be a constant (in the case
286 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
287 aggregate), or NULL (in the case that T does not require
288 initialization). In either case, the value can be used as
289 DECL_INITIAL for a decl of the indicated TYPE; it is a valid static
290 initializer. If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS
291 is the number of elements in the array. If STATIC_STORAGE_P is
292 TRUE, initializers are only generated for entities for which
293 zero-initialization does not simply mean filling the storage with
294 zero bytes. */
296 tree
298 {
300 }
302 /* Return a suitable initializer for value-initializing an object of type
303 TYPE, as described in [dcl.init]. */
305 tree
307 {
308 /* [dcl.init]
310 To value-initialize an object of type T means:
312 - if T is a class type (clause 9) with a user-provided constructor
313 (12.1), then the default constructor for T is called (and the
314 initialization is ill-formed if T has no accessible default
315 constructor);
317 - if T is a non-union class type without a user-provided constructor,
318 then every non-static data member and base-class component of T is
319 value-initialized;92)
321 - if T is an array type, then each element is value-initialized;
323 - otherwise, the object is zero-initialized.
325 A program that calls for default-initialization or
326 value-initialization of an entity of reference type is ill-formed.
328 92) Value-initialization for such a class object may be implemented by
329 zero-initializing the object and then calling the default
330 constructor. */
332 /* The AGGR_INIT_EXPR tweaking below breaks in templates. */
336 {
337 /* Instead of the above, only consider the user-providedness of the
338 default constructor itself so value-initializing a class with an
339 explicitly defaulted default constructor and another user-provided
340 constructor works properly (c++std-core-19883). */
344 return build_aggr_init_expr
348 complain),
349 complain);
351 {
352 /* This is a class that needs constructing, but doesn't have
353 a user-provided constructor. So we need to zero-initialize
354 the object and then call the implicitly defined ctor.
355 This will be handled in simplify_aggr_init_expr. */
356 tree ctor = build_special_member_call
360 {
363 }
365 }
366 }
368 }
370 /* Like build_value_init, but don't call the constructor for TYPE. Used
371 for base initializers. */
373 tree
375 {
376 /* FIXME the class and array cases should just use digest_init once it is
377 SFINAE-enabled. */
379 {
383 {
384 tree field;
387 /* Iterate over the fields, building initializations. */
389 {
397 /* We could skip vfields and fields of types with
398 user-defined constructors, but I think that won't improve
399 performance at all; it should be simpler in general just
400 to zero out the entire object than try to only zero the
401 bits that actually need it. */
403 /* Note that for class types there will be FIELD_DECLs
404 corresponding to base classes as well. Thus, iterating
405 over TYPE_FIELDs will result in correct initialization of
406 all of the subobjects. */
414 }
416 /* Build a constructor to contain the zero- initializations. */
418 }
419 }
421 {
424 /* Iterate over the array elements, building initializations. */
427 /* If we have an error_mark here, we should just return error mark
428 as we don't know the size of the array yet. */
430 {
433 type);
435 }
438 /* A zero-sized array, which is accepted as an extension, will
439 have an upper bound of -1. */
441 {
447 /* If this is a one element array, we just use a regular init. */
450 else
452 max_index);
459 /* We shouldn't have gotten here for anything that would need
460 non-trivial initialization, and gimplify_init_ctor_preeval
461 would need to be fixed to allow it. */
464 }
466 /* Build a constructor to contain the initializations. */
468 }
470 {
474 }
476 {
480 }
483 }
485 /* Initialize MEMBER, a FIELD_DECL, with INIT, a TREE_LIST of
486 arguments. If TREE_LIST is void_type_node, an empty initializer
487 list was given; if NULL_TREE no initializer was given. */
489 static void
491 {
492 tree decl;
495 /* Effective C++ rule 12 requires that all data members be
496 initialized. */
500 member);
502 /* Get an lvalue for the data member. */
506 tf_warning_or_error);
512 {
518 member);
519 }
522 {
523 /* mem() means value-initialization. */
525 {
529 }
530 else
531 {
537 }
538 }
539 /* Deal with this here, as we will get confused if we try to call the
540 assignment op for an anonymous union. This can happen in a
541 synthesized copy constructor. */
543 {
545 {
548 }
549 }
552 {
554 {
556 {
559 else
563 }
567 {
571 }
572 else
574 }
575 else
576 {
583 /* TYPE_NEEDS_CONSTRUCTING can be set just because we have a
584 vtable; still give this diagnostic. */
589 tf_warning_or_error));
590 }
591 }
592 else
593 {
595 {
596 tree core_type;
597 /* member traversal: note it leaves init NULL */
601 member);
611 {
614 member);
616 }
624 }
626 /* There was an explicit member initialization. Do some work
627 in that case. */
629 tf_warning_or_error);
633 tf_warning_or_error));
634 }
637 {
638 tree expr;
643 tf_warning_or_error);
646 tf_warning_or_error);
650 }
651 }
653 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
654 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
656 static tree
658 {
659 tree fields;
661 /* Note whether or not T is a union. */
666 {
667 tree fieldtype;
669 /* Skip CONST_DECLs for enumeration constants and so forth. */
674 /* Keep track of whether or not any fields are unions. */
678 /* For an anonymous struct or union, we must recursively
679 consider the fields of the anonymous type. They can be
680 directly initialized from the constructor. */
682 {
683 /* Add this field itself. Synthesized copy constructors
684 initialize the entire aggregate. */
686 /* And now add the fields in the anonymous aggregate. */
688 }
689 /* Add this field. */
692 }
695 }
697 /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives
698 a FIELD_DECL or BINFO in T that needs initialization. The
699 TREE_VALUE gives the initializer, or list of initializer arguments.
701 Return a TREE_LIST containing all of the initializations required
702 for T, in the order in which they should be performed. The output
703 list has the same format as the input. */
705 static tree
707 {
708 tree init;
710 tree sorted_inits;
711 tree next_subobject;
716 /* Build up a list of initializations. The TREE_PURPOSE of entry
717 will be the subobject (a FIELD_DECL or BINFO) to initialize. The
718 TREE_VALUE will be the constructor arguments, or NULL if no
719 explicit initialization was provided. */
722 /* Process the virtual bases. */
727 /* Process the direct bases. */
733 /* Process the non-static data members. */
735 /* Reverse the entire list of initializations, so that they are in
736 the order that they will actually be performed. */
739 /* If the user presented the initializers in an order different from
740 that in which they will actually occur, we issue a warning. Keep
741 track of the next subobject which can be explicitly initialized
742 without issuing a warning. */
745 /* Go through the explicit initializers, filling in TREE_PURPOSE in
746 the SORTED_INITS. */
748 {
749 tree subobject;
750 tree subobject_init;
754 /* If the explicit initializers are in sorted order, then
755 SUBOBJECT will be NEXT_SUBOBJECT, or something following
756 it. */
758 subobject_init;
763 /* Issue a warning if the explicit initializer order does not
764 match that which will actually occur.
765 ??? Are all these on the correct lines? */
767 {
771 else
776 else
780 }
782 /* Look again, from the beginning of the list. */
784 {
788 }
790 /* It is invalid to initialize the same subobject more than
791 once. */
793 {
797 subobject);
798 else
801 subobject);
802 }
804 /* Record the initialization. */
807 }
809 /* [class.base.init]
811 If a ctor-initializer specifies more than one mem-initializer for
812 multiple members of the same union (including members of
813 anonymous unions), the ctor-initializer is ill-formed.
815 Here we also splice out uninitialized union members. */
817 {
821 {
822 tree field;
823 tree ctx;
830 /* Skip base classes. */
834 /* If this is an anonymous union with no explicit initializer,
835 splice it out. */
839 /* See if this field is a member of a union, or a member of a
840 structure contained in a union, etc. */
846 /* If this field is not a member of a union, skip it. */
850 /* If this union member has no explicit initializer, splice
851 it out. */
855 /* It's only an error if we have two initializers for the same
856 union type. */
858 {
861 }
863 /* See if LAST_FIELD and the field initialized by INIT are
864 members of the same union. If so, there's a problem,
865 unless they're actually members of the same structure
866 which is itself a member of a union. For example, given:
868 union { struct { int i; int j; }; };
870 initializing both `i' and `j' makes sense. */
873 do
874 {
875 tree last_ctx;
879 {
881 {
885 last_ctx);
888 }
894 }
896 /* If we've reached the outermost class, then we're
897 done. */
902 }
907 next:
910 splice:
913 }
914 }
917 }
919 /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS
920 is a TREE_LIST giving the explicit mem-initializer-list for the
921 constructor. The TREE_PURPOSE of each entry is a subobject (a
922 FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE
923 is a TREE_LIST giving the arguments to the constructor or
924 void_type_node for an empty list of arguments. */
926 void
928 {
931 /* We will already have issued an error message about the fact that
932 the type is incomplete. */
939 /* Sort the mem-initializers into the order in which the
940 initializations should be performed. */
945 /* Initialize base classes. */
948 {
953 {
954 /* If these initializations are taking place in a copy constructor,
955 the base class should probably be explicitly initialized if there
956 is a user-defined constructor in the base class (other than the
957 default constructor, which will be called anyway). */
967 && !(type_has_constexpr_default_constructor
969 {
974 }
975 }
977 /* Initialize the base. */
980 else
981 {
982 tree base_addr;
988 tf_warning_or_error),
989 arguments,
990 flags,
991 tf_warning_or_error);
993 }
996 }
999 /* Initialize the vptrs. */
1002 /* Initialize the data members. */
1004 {
1008 }
1009 }
1011 /* Returns the address of the vtable (i.e., the value that should be
1012 assigned to the vptr) for BINFO. */
1014 static tree
1016 {
1018 tree vtbl;
1021 /* If this is a virtual primary base, then the vtable we want to store
1022 is that for the base this is being used as the primary base of. We
1023 can't simply skip the initialization, because we may be expanding the
1024 inits of a subobject constructor where the virtual base layout
1025 can be different. */
1029 /* Figure out what vtable BINFO's vtable is based on, and mark it as
1030 used. */
1034 /* Now compute the address to use when initializing the vptr. */
1040 }
1042 /* This code sets up the virtual function tables appropriate for
1043 the pointer DECL. It is a one-ply initialization.
1045 BINFO is the exact type that DECL is supposed to be. In
1046 multiple inheritance, this might mean "C's A" if C : A, B. */
1048 static void
1050 {
1052 tree vtt_index;
1054 /* Compute the initializer for vptr. */
1057 /* We may get this vptr from a VTT, if this is a subobject
1058 constructor or subobject destructor. */
1061 {
1062 tree vtbl2;
1063 tree vtt_parm;
1065 /* Compute the value to use, when there's a VTT. */
1071 /* The actual initializer is the VTT value only in the subobject
1072 constructor. In maybe_clone_body we'll substitute NULL for
1073 the vtt_parm in the case of the non-subobject constructor. */
1078 vtbl2,
1079 vtbl);
1080 }
1082 /* Compute the location of the vtpr. */
1084 tf_warning_or_error),
1088 /* Assign the vtable to the vptr. */
1091 tf_warning_or_error));
1092 }
1094 /* If an exception is thrown in a constructor, those base classes already
1095 constructed must be destroyed. This function creates the cleanup
1096 for BINFO, which has just been constructed. If FLAG is non-NULL,
1097 it is a DECL which is nonzero when this base needs to be
1098 destroyed. */
1100 static void
1102 {
1103 tree expr;
1108 /* Call the destructor. */
1110 base_dtor_identifier,
1111 NULL,
1112 binfo,
1114 tf_warning_or_error);
1122 }
1124 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its
1125 constructor. */
1127 static void
1129 {
1130 tree inner_if_stmt;
1131 tree exp;
1132 tree flag;
1134 /* If there are virtual base classes with destructors, we need to
1135 emit cleanups to destroy them if an exception is thrown during
1136 the construction process. These exception regions (i.e., the
1137 period during which the cleanups must occur) begin from the time
1138 the construction is complete to the end of the function. If we
1139 create a conditional block in which to initialize the
1140 base-classes, then the cleanup region for the virtual base begins
1141 inside a block, and ends outside of that block. This situation
1142 confuses the sjlj exception-handling code. Therefore, we do not
1143 create a single conditional block, but one for each
1144 initialization. (That way the cleanup regions always begin
1145 in the outer block.) We trust the back end to figure out
1146 that the FLAG will not change across initializations, and
1147 avoid doing multiple tests. */
1152 /* Compute the location of the virtual base. If we're
1153 constructing virtual bases, then we must be the most derived
1154 class. Therefore, we don't have to look up the virtual base;
1155 we already know where it is. */
1164 }
1166 /* Find the context in which this FIELD can be initialized. */
1168 static tree
1170 {
1173 /* Anonymous union members can be initialized in the first enclosing
1174 non-anonymous union context. */
1178 }
1180 /* Function to give error message if member initialization specification
1181 is erroneous. FIELD is the member we decided to initialize.
1182 TYPE is the type for which the initialization is being performed.
1183 FIELD must be a member of TYPE.
1185 MEMBER_NAME is the name of the member. */
1187 static int
1189 {
1193 {
1195 member_name);
1197 }
1199 {
1202 field);
1204 }
1206 {
1210 }
1212 {
1214 member_name);
1216 }
1219 }
1221 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it
1222 is a _TYPE node or TYPE_DECL which names a base for that type.
1223 Check the validity of NAME, and return either the base _TYPE, base
1224 binfo, or the FIELD_DECL of the member. If NAME is invalid, return
1225 NULL_TREE and issue a diagnostic.
1227 An old style unnamed direct single base construction is permitted,
1228 where NAME is NULL. */
1230 tree
1232 {
1233 tree basetype;
1234 tree field;
1240 {
1241 /* This is an obsolete unnamed base class initializer. The
1242 parser will already have warned about its use. */
1244 {
1247 current_class_type);
1250 basetype = BINFO_TYPE
1255 current_class_type);
1257 }
1258 }
1260 {
1263 }
1266 else
1270 {
1271 tree class_binfo;
1272 tree direct_binfo;
1273 tree virtual_binfo;
1283 /* Look for a direct base. */
1288 /* Look for a virtual base -- unless the direct base is itself
1289 virtual. */
1293 /* [class.base.init]
1295 If a mem-initializer-id is ambiguous because it designates
1296 both a direct non-virtual base class and an inherited virtual
1297 base class, the mem-initializer is ill-formed. */
1299 {
1301 basetype);
1303 }
1306 {
1310 else
1314 }
1317 }
1318 else
1319 {
1322 else
1327 }
1330 }
1332 /* This is like `expand_member_init', only it stores one aggregate
1333 value into another.
1335 INIT comes in two flavors: it is either a value which
1336 is to be stored in EXP, or it is a parameter list
1337 to go to a constructor, which will operate on EXP.
1338 If INIT is not a parameter list for a constructor, then set
1339 LOOKUP_ONLYCONVERTING.
1340 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1341 the initializer, if FLAGS is 0, then it is the (init) form.
1342 If `init' is a CONSTRUCTOR, then we emit a warning message,
1343 explaining that such initializations are invalid.
1345 If INIT resolves to a CALL_EXPR which happens to return
1346 something of the type we are looking for, then we know
1347 that we can safely use that call to perform the
1348 initialization.
1350 The virtual function table pointer cannot be set up here, because
1351 we do not really know its type.
1353 This never calls operator=().
1355 When initializing, nothing is CONST.
1357 A default copy constructor may have to be used to perform the
1358 initialization.
1360 A constructor or a conversion operator may have to be used to
1361 perform the initialization, but not both, as it would be ambiguous. */
1363 tree
1365 {
1366 tree stmt_expr;
1367 tree compound_stmt;
1386 {
1387 tree itype;
1389 /* An array may not be initialized use the parenthesized
1390 initialization form -- unless the initializer is "()". */
1392 {
1396 }
1397 /* Must arrange to initialize each element of EXP
1398 from elements of INIT. */
1408 complain);
1415 }
1418 /* Just know that we've seen something for this node. */
1432 }
1434 static void
1436 tsubst_flags_t complain)
1437 {
1439 tree ctor_name;
1441 /* It fails because there may not be a constructor which takes
1442 its own type as the first (or only parameter), but which does
1443 take other types via a conversion. So, if the thing initializing
1444 the expression is a unit element of type X, first try X(X&),
1445 followed by initialization by X. If neither of these work
1446 out, then look hard. */
1447 tree rval;
1450 /* If we have direct-initialization from an initializer list, pull
1451 it out of the TREE_LIST so the code below can see it. */
1455 {
1459 }
1463 {
1464 /* A brace-enclosed initializer for an aggregate. In C++0x this can
1465 happen for direct-initialization, too. */
1471 }
1475 {
1476 /* Base subobjects should only get direct-initialization. */
1480 /* Do nothing. We hit this in two cases: Reference initialization,
1481 where we aren't initializing a real variable, so we don't want
1482 to run a new constructor; and catching an exception, where we
1483 have already built up the constructor call so we could wrap it
1485 else
1489 /* We need to protect the initialization of a catch parm with a
1490 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
1491 around the TARGET_EXPR for the copy constructor. See
1492 initialize_handler_parm. */
1493 {
1497 }
1498 else
1503 }
1508 {
1512 }
1513 else
1518 else
1522 complain);
1528 {
1531 {
1535 }
1536 }
1538 /* FIXME put back convert_to_void? */
1541 }
1543 /* This function is responsible for initializing EXP with INIT
1544 (if any).
1546 BINFO is the binfo of the type for who we are performing the
1547 initialization. For example, if W is a virtual base class of A and B,
1548 and C : A, B.
1549 If we are initializing B, then W must contain B's W vtable, whereas
1550 were we initializing C, W must contain C's W vtable.
1552 TRUE_EXP is nonzero if it is the true expression being initialized.
1553 In this case, it may be EXP, or may just contain EXP. The reason we
1554 need this is because if EXP is a base element of TRUE_EXP, we
1555 don't necessarily know by looking at EXP where its virtual
1556 baseclass fields should really be pointing. But we do know
1557 from TRUE_EXP. In constructors, we don't know anything about
1558 the value being initialized.
1560 FLAGS is just passed to `build_new_method_call'. See that function
1561 for its description. */
1563 static void
1565 tsubst_flags_t complain)
1566 {
1572 /* Use a function returning the desired type to initialize EXP for us.
1573 If the function is a constructor, and its first argument is
1574 NULL_TREE, know that it was meant for us--just slide exp on
1575 in and expand the constructor. Constructors now come
1576 as TARGET_EXPRs. */
1580 {
1581 /* If store_init_value returns NULL_TREE, the INIT has been
1582 recorded as the DECL_INITIAL for EXP. That means there's
1583 nothing more we have to do. */
1588 }
1590 /* If an explicit -- but empty -- initializer list was present,
1591 that's value-initialization. */
1593 {
1594 /* If there's a user-provided constructor, we just call that. */
1597 /* If there isn't, but we still need to call the constructor,
1598 zero out the object first. */
1600 {
1604 /* And then call the constructor. */
1605 }
1606 /* If we don't need to mess with the constructor at all,
1607 then just zero out the object and we're done. */
1608 else
1609 {
1614 }
1616 }
1618 /* We know that expand_default_init can handle everything we want
1619 at this point. */
1621 }
1623 /* Report an error if TYPE is not a user-defined, class type. If
1624 OR_ELSE is nonzero, give an error message. */
1626 int
1628 {
1633 {
1637 }
1639 }
1641 tree
1643 {
1649 else
1651 }
1653 /* Build a reference to a member of an aggregate. This is not a C++
1654 `&', but really something which can have its address taken, and
1655 then act as a pointer to member, for example TYPE :: FIELD can have
1656 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if
1657 this expression is the operand of "&".
1659 @@ Prints out lousy diagnostics for operator <typename>
1660 @@ fields.
1662 @@ This function should be rewritten and placed in search.c. */
1664 tree
1666 {
1667 tree decl;
1670 /* class templates can come in as TEMPLATE_DECLs here. */
1683 /* Callers should call mark_used before this point. */
1688 {
1691 }
1693 /* Entities other than non-static members need no further
1694 processing. */
1701 {
1704 }
1706 /* Set up BASEBINFO for member lookup. */
1709 /* A lot of this logic is now handled in lookup_member. */
1711 {
1712 /* Go from the TREE_BASELINK to the member function info. */
1716 {
1717 /* Get rid of a potential OVERLOAD around it. */
1720 /* Unique functions are handled easily. */
1722 /* For non-static member of base class, we need a special rule
1723 for access checking [class.protected]:
1725 If the access is to form a pointer to member, the
1726 nested-name-specifier shall name the derived class
1727 (or any class derived from that class). */
1731 else
1737 }
1738 else
1740 }
1742 /* We need additional test besides the one in
1743 check_accessibility_of_qualified_id in case it is
1744 a pointer to non-static member. */
1748 {
1749 /* If MEMBER is non-static, then the program has fallen afoul of
1750 [expr.prim]:
1752 An id-expression that denotes a nonstatic data member or
1753 nonstatic member function of a class can only be used:
1755 -- as part of a class member access (_expr.ref_) in which the
1756 object-expression refers to the member's class or a class
1757 derived from that class, or
1759 -- to form a pointer to member (_expr.unary.op_), or
1761 -- in the body of a nonstatic member function of that class or
1762 of a class derived from that class (_class.mfct.nonstatic_), or
1764 -- in a mem-initializer for a constructor for that class or for
1765 a class derived from that class (_class.base.init_). */
1767 {
1768 /* Build a representation of the qualified name suitable
1769 for use as the operand to "&" -- even though the "&" is
1770 not actually present. */
1772 /* In Microsoft mode, treat a non-static member function as if
1773 it were a pointer-to-member. */
1775 {
1778 }
1782 }
1784 {
1787 }
1789 }
1794 }
1796 /* If DECL is a scalar enumeration constant or variable with a
1797 constant initializer, return the initializer (or, its initializers,
1798 recursively); otherwise, return DECL. If INTEGRAL_P, the
1799 initializer is only returned if DECL is an integral
1800 constant-expression. */
1802 static tree
1804 {
1806 || (integral_p
1810 {
1811 tree init;
1812 /* If DECL is a static data member in a template
1813 specialization, we must instantiate it here. The
1814 initializer for the static data member is not processed
1815 until needed; we need it now. */
1820 {
1822 /* Treat the error as a constant to avoid cascading errors on
1823 excessively recursive template instantiation (c++/9335). */
1825 else
1827 }
1828 /* Initializers in templates are generally expanded during
1829 instantiation, so before that for const int i(2)
1830 INIT is a TREE_LIST with the actual initializer as
1831 TREE_VALUE. */
1833 && init
1840 || (!integral_p
1841 /* Do not return an aggregate constant (of which
1842 string literals are a special case), as we do not
1843 want to make inadvertent copies of such entities,
1844 and we must be sure that their addresses are the
1845 same everywhere. */
1850 }
1852 }
1854 /* If DECL is a CONST_DECL, or a constant VAR_DECL initialized by
1855 constant of integral or enumeration type, then return that value.
1856 These are those variables permitted in constant expressions by
1857 [5.19/1]. */
1859 tree
1861 {
1863 }
1865 /* A more relaxed version of integral_constant_value, used by the
1866 common C/C++ code and by the C++ front end for optimization
1867 purposes. */
1869 tree
1871 {
1874 }
1875 \f
1876 /* Common subroutines of build_new and build_vec_delete. */
1878 /* Call the global __builtin_delete to delete ADDR. */
1880 static tree
1882 {
1885 }
1886 \f
1887 /* Build and return a NEW_EXPR. If NELTS is non-NULL, TYPE[NELTS] is
1888 the type of the object being allocated; otherwise, it's just TYPE.
1889 INIT is the initializer, if any. USE_GLOBAL_NEW is true if the
1890 user explicitly wrote "::operator new". PLACEMENT, if non-NULL, is
1891 a vector of arguments to be provided as arguments to a placement
1892 new operator. This routine performs no semantic checks; it just
1893 creates and returns a NEW_EXPR. */
1895 static tree
1898 {
1899 tree init_list;
1900 tree new_expr;
1902 /* If INIT is NULL, the we want to store NULL_TREE in the NEW_EXPR.
1903 If INIT is not NULL, then we want to store VOID_ZERO_NODE. This
1904 permits us to distinguish the case of a missing initializer "new
1905 int" from an empty initializer "new int()". */
1910 else
1915 init_list);
1920 }
1922 /* Diagnose uninitialized const members or reference members of type
1923 TYPE. USING_NEW is used to disambiguate the diagnostic between a
1924 new expression without a new-initializer and a declaration. Returns
1925 the error count. */
1927 static int
1930 {
1931 tree field;
1938 {
1939 tree field_type;
1950 {
1953 {
1957 else
1961 }
1962 }
1965 {
1968 {
1972 else
1976 }
1977 }
1980 error_count
1983 }
1985 }
1987 int
1989 {
1991 }
1993 /* Generate code for a new-expression, including calling the "operator
1994 new" function, initializing the object, and, if an exception occurs
1995 during construction, cleaning up. The arguments are as for
1996 build_raw_new_expr. This may change PLACEMENT and INIT. */
1998 static tree
2001 tsubst_flags_t complain)
2002 {
2004 /* True iff this is a call to "operator new[]" instead of just
2005 "operator new". */
2007 /* If ARRAY_P is true, the element type of the array. This is never
2008 an ARRAY_TYPE; for something like "new int[3][4]", the
2009 ELT_TYPE is "int". If ARRAY_P is false, this is the same type as
2010 TYPE. */
2011 tree elt_type;
2012 /* The type of the new-expression. (This type is always a pointer
2013 type.) */
2014 tree pointer_type;
2015 tree non_const_pointer_type;
2018 /* The address returned by the call to "operator new". This node is
2019 a VAR_DECL and is therefore reusable. */
2020 tree alloc_node;
2021 tree alloc_fn;
2025 /* If non-NULL, the number of extra bytes to allocate at the
2026 beginning of the storage allocated for an array-new expression in
2027 order to store the number of elements. */
2029 tree placement_first;
2031 /* True if the function we are calling is a placement allocation
2032 function. */
2034 /* True if the storage must be initialized, either by a constructor
2035 or due to an explicit new-initializer. */
2037 /* The address of the thing allocated, not including any cookie. In
2038 particular, if an array cookie is in use, DATA_ADDR is the
2039 address of the first array element. This node is a VAR_DECL, and
2040 is therefore reusable. */
2041 tree data_addr;
2045 {
2048 }
2050 {
2055 }
2057 /* If our base type is an array, then make sure we know how many elements
2058 it has. */
2065 complain);
2068 {
2072 }
2080 {
2082 /* A program that calls for default-initialization [...] of an
2083 entity of reference type is ill-formed. */
2087 /* A new-expression that creates an object of type T initializes
2088 that object as follows:
2089 - If the new-initializer is omitted:
2090 -- If T is a (possibly cv-qualified) non-POD class type
2091 (or array thereof), the object is default-initialized (8.5).
2092 [...]
2093 -- Otherwise, the object created has indeterminate
2094 value. If T is a const-qualified type, or a (possibly
2095 cv-qualified) POD class type (or array thereof)
2096 containing (directly or indirectly) a member of
2097 const-qualified type, the program is ill-formed; */
2107 }
2111 {
2115 }
2123 /* If PLACEMENT is a single simple pointer type not passed by
2124 reference, prepare to capture it in a temporary variable. Do
2125 this now, since PLACEMENT will change in the calls below. */
2132 /* Allocate the object. */
2134 {
2135 tree class_addr;
2145 {
2149 }
2151 {
2155 }
2160 }
2162 {
2165 }
2166 else
2167 {
2168 tree fnname;
2169 tree fns;
2175 && (array_p
2178 {
2179 /* Use a class-specific operator new. */
2180 /* If a cookie is required, add some extra space. */
2182 {
2185 }
2186 /* Create the argument list. */
2188 /* Do name-lookup to find the appropriate operator. */
2191 {
2195 }
2197 {
2199 {
2202 }
2204 }
2208 LOOKUP_NORMAL,
2210 complain);
2211 }
2212 else
2213 {
2214 /* Use a global operator new. */
2215 /* See if a cookie might be required. */
2218 else
2224 }
2225 }
2232 /* If we found a simple case of PLACEMENT_EXPR above, then copy it
2233 into a temporary variable. */
2240 {
2245 {
2249 }
2250 }
2252 /* In the simple case, we can stop now. */
2257 /* Store the result of the allocation call in a variable so that we can
2258 use it more than once. */
2262 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */
2266 /* Now, check to see if this function is actually a placement
2267 allocation function. This can happen even when PLACEMENT is NULL
2268 because we might have something like:
2270 struct S { void* operator new (size_t, int i = 0); };
2272 A call to `new S' will get this allocation function, even though
2273 there is no explicit placement argument. If there is more than
2274 one argument, or there are variable arguments, then this is a
2275 placement allocation function. */
2276 placement_allocation_fn_p
2280 /* Preevaluate the placement args so that we don't reevaluate them for a
2281 placement delete. */
2283 {
2284 tree inits;
2288 alloc_expr);
2289 }
2291 /* unless an allocation function is declared with an empty excep-
2292 tion-specification (_except.spec_), throw(), it indicates failure to
2293 allocate storage by throwing a bad_alloc exception (clause _except_,
2294 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2295 cation function is declared with an empty exception-specification,
2296 throw(), it returns null to indicate failure to allocate storage and a
2297 non-null pointer otherwise.
2299 So check for a null exception spec on the op new we just called. */
2305 {
2306 tree cookie;
2307 tree cookie_ptr;
2308 tree size_ptr_type;
2310 /* Adjust so we're pointing to the start of the object. */
2313 /* Store the number of bytes allocated so that we can know how
2314 many elements to destroy later. We use the last sizeof
2315 (size_t) bytes to store the number of elements. */
2326 {
2327 /* Also store the element size. */
2338 }
2339 }
2340 else
2341 {
2344 }
2346 /* Now use a pointer to the type we've actually allocated. */
2348 /* But we want to operate on a non-const version to start with,
2349 since we'll be modifying the elements. */
2350 non_const_pointer_type = build_pointer_type
2354 /* Any further uses of alloc_node will want this type, too. */
2357 /* Now initialize the allocated object. Note that we preevaluate the
2358 initialization expression, apart from the actual constructor call or
2359 assignment--we do this because we want to delay the allocation as long
2360 as possible in order to minimize the size of the exception region for
2361 placement delete. */
2363 {
2368 {
2371 }
2374 {
2375 /* build_value_init doesn't work in templates, and we don't need
2376 the initializer anyway since we're going to throw it away and
2377 rebuild it at instantiation time, so just build up a single
2378 constructor call to get any appropriate diagnostics. */
2382 complete_ctor_identifier,
2384 LOOKUP_NORMAL,
2385 complain);
2387 }
2389 {
2394 {
2398 else
2399 {
2403 complain);
2404 else
2405 {
2410 }
2413 }
2414 }
2416 {
2420 else
2423 }
2424 init_expr
2428 integer_one_node,
2429 complain),
2430 vecinit,
2431 explicit_value_init_p,
2433 complain);
2435 /* An array initialization is stable because the initialization
2436 of each element is a full-expression, so the temporaries don't
2437 leak out. */
2439 }
2440 else
2441 {
2445 {
2447 complete_ctor_identifier,
2449 LOOKUP_NORMAL,
2450 complain);
2451 }
2453 {
2454 /* Something like `new int()'. */
2459 }
2460 else
2461 {
2462 tree ie;
2464 /* We are processing something like `new int (10)', which
2465 means allocate an int, and initialize it with 10. */
2469 complain);
2470 }
2472 }
2477 /* If any part of the object initialization terminates by throwing an
2478 exception and a suitable deallocation function can be found, the
2479 deallocation function is called to free the memory in which the
2480 object was being constructed, after which the exception continues
2481 to propagate in the context of the new-expression. If no
2482 unambiguous matching deallocation function can be found,
2483 propagating the exception does not cause the object's memory to be
2484 freed. */
2486 {
2488 tree cleanup;
2490 /* The Standard is unclear here, but the right thing to do
2491 is to use the same method for finding deallocation
2492 functions that we use for finding allocation functions. */
2493 cleanup = (build_op_delete_call
2495 alloc_node,
2496 size,
2497 globally_qualified_p,
2499 alloc_fn));
2504 /* This is much simpler if we were able to preevaluate all of
2505 the arguments to the constructor call. */
2506 {
2507 /* CLEANUP is compiler-generated, so no diagnostics. */
2511 /* Likewise, this try-catch is compiler-generated. */
2513 }
2514 else
2515 /* Ack! First we allocate the memory. Then we set our sentry
2516 variable to true, and expand a cleanup that deletes the
2517 memory if sentry is true. Then we run the constructor, and
2518 finally clear the sentry.
2520 We need to do this because we allocate the space first, so
2521 if there are any temporaries with cleanups in the
2522 constructor args and we weren't able to preevaluate them, we
2523 need this EH region to extend until end of full-expression
2524 to preserve nesting. */
2525 {
2533 /* CLEANUP is compiler-generated, so no diagnostics. */
2543 init_expr
2546 end));
2547 /* Likewise, this is compiler-generated. */
2549 }
2550 }
2551 }
2552 else
2555 /* Now build up the return value in reverse order. */
2565 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
2566 and return the call (which doesn't need to be adjusted). */
2568 else
2569 {
2571 {
2574 integer_zero_node,
2575 complain);
2577 complain);
2578 }
2580 /* Perform the allocation before anything else, so that ALLOC_NODE
2581 has been initialized before we start using it. */
2583 }
2588 /* A new-expression is never an lvalue. */
2592 }
2594 /* Generate a representation for a C++ "new" expression. *PLACEMENT
2595 is a vector of placement-new arguments (or NULL if none). If NELTS
2596 is NULL, TYPE is the type of the storage to be allocated. If NELTS
2597 is not NULL, then this is an array-new allocation; TYPE is the type
2598 of the elements in the array and NELTS is the number of elements in
2599 the array. *INIT, if non-NULL, is the initializer for the new
2600 object, or an empty vector to indicate an initializer of "()". If
2601 USE_GLOBAL_NEW is true, then the user explicitly wrote "::new"
2602 rather than just "new". This may change PLACEMENT and INIT. */
2604 tree
2607 {
2608 tree rval;
2617 {
2620 {
2624 }
2625 }
2628 {
2634 use_global_new);
2644 }
2647 {
2649 {
2652 else
2654 }
2657 }
2659 /* ``A reference cannot be created by the new operator. A reference
2660 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
2661 returned by new.'' ARM 5.3.3 */
2663 {
2666 else
2669 }
2672 {
2676 }
2678 /* The type allocated must be complete. If the new-type-id was
2679 "T[N]" then we are just checking that "T" is complete here, but
2680 that is equivalent, since the value of "N" doesn't matter. */
2689 {
2695 }
2697 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
2702 }
2704 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
2706 tree
2708 {
2714 {
2717 {
2720 }
2722 }
2724 /* Mangle the class$ field. */
2725 {
2726 tree field;
2729 {
2733 }
2735 {
2738 }
2739 }
2743 {
2753 }
2755 }
2756 \f
2757 static tree
2759 special_function_kind auto_delete_vec,
2761 {
2762 tree virtual_size;
2766 /* Temporary variables used by the loop. */
2769 /* This is the body of the loop that implements the deletion of a
2770 single element, and moves temp variables to next elements. */
2771 tree body;
2773 /* This is the LOOP_EXPR that governs the deletion of the elements. */
2776 /* This is the thing that governs what to do after the loop has run. */
2779 /* This is the BIND_EXPR which holds the outermost iterator of the
2780 loop. It is convenient to set this variable up and test it before
2781 executing any other code in the loop.
2782 This is also the containing expression returned by this function. */
2784 tree tmp;
2786 /* We should only have 1-D arrays here. */
2795 /* The below is short by the cookie size. */
2800 tbase_init
2804 base),
2805 virtual_size),
2806 complain);
2824 complain);
2832 no_destructor:
2833 /* Delete the storage if appropriate. */
2835 {
2836 tree base_tbd;
2838 /* The below is short by the cookie size. */
2843 /* no header */
2845 else
2846 {
2847 tree cookie_size;
2851 MINUS_EXPR,
2853 base),
2854 cookie_size,
2855 complain);
2859 /* True size with header. */
2861 }
2868 }
2872 ;
2875 else
2881 /* Outermost wrapper: If pointer is null, punt. */
2886 integer_zero_node)),
2891 {
2894 }
2897 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
2901 }
2903 /* Create an unnamed variable of the indicated TYPE. */
2905 tree
2907 {
2908 tree decl;
2918 }
2920 /* Create a new temporary variable of the indicated TYPE, initialized
2921 to INIT.
2923 It is not entered into current_binding_level, because that breaks
2924 things when it comes time to do final cleanups (which take place
2925 "outside" the binding contour of the function). */
2927 tree
2929 {
2930 tree decl;
2936 tf_warning_or_error));
2939 }
2941 /* `build_vec_init' returns tree structure that performs
2942 initialization of a vector of aggregate types.
2944 BASE is a reference to the vector, of ARRAY_TYPE, or a pointer
2945 to the first element, of POINTER_TYPE.
2946 MAXINDEX is the maximum index of the array (one less than the
2947 number of elements). It is only used if BASE is a pointer or
2948 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
2950 INIT is the (possibly NULL) initializer.
2952 If EXPLICIT_VALUE_INIT_P is true, then INIT must be NULL. All
2953 elements in the array are value-initialized.
2955 FROM_ARRAY is 0 if we should init everything with INIT
2956 (i.e., every element initialized from INIT).
2957 FROM_ARRAY is 1 if we should index into INIT in parallel
2958 with initialization of DECL.
2959 FROM_ARRAY is 2 if we should index into INIT in parallel,
2960 but use assignment instead of initialization. */
2962 tree
2966 {
2967 tree rval;
2970 tree iterator;
2971 /* The type of BASE. */
2973 /* The type of an element in the array. */
2975 /* The element type reached after removing all outer array
2976 types. */
2977 tree inner_elt_type;
2978 /* The type of a pointer to an element in the array. */
2979 tree ptype;
2980 tree stmt_expr;
2981 tree compound_stmt;
3002 /* Look through the TARGET_EXPR around a compound literal. */
3015 /* Don't do this if the CONSTRUCTOR might contain something
3016 that might throw and require us to clean up. */
3020 {
3021 /* Do non-default initialization of trivial arrays resulting from
3022 brace-enclosed initializers. In this case, digest_init and
3023 store_constructor will handle the semantics for us. */
3027 }
3031 {
3034 }
3035 else
3038 /* The code we are generating looks like:
3039 ({
3040 T* t1 = (T*) base;
3041 T* rval = t1;
3042 ptrdiff_t iterator = maxindex;
3043 try {
3044 for (; iterator != -1; --iterator) {
3045 ... initialize *t1 ...
3046 ++t1;
3047 }
3048 } catch (...) {
3049 ... destroy elements that were constructed ...
3050 }
3051 rval;
3052 })
3054 We can omit the try and catch blocks if we know that the
3055 initialization will never throw an exception, or if the array
3056 elements do not have destructors. We can omit the loop completely if
3057 the elements of the array do not have constructors.
3059 We actually wrap the entire body of the above in a STMT_EXPR, for
3060 tidiness.
3062 When copying from array to another, when the array elements have
3063 only trivial copy constructors, we should use __builtin_memcpy
3064 rather than generating a loop. That way, we could take advantage
3065 of whatever cleverness the back end has for dealing with copies
3066 of blocks of memory. */
3075 /* If initializing one array from another, initialize element by
3076 element. We rely upon the below calls to do the argument
3077 checking. Evaluate the initializer before entering the try block. */
3079 {
3086 }
3088 /* Protect the entire array initialization so that we can destroy
3089 the partially constructed array if an exception is thrown.
3090 But don't do this if we're assigning. */
3093 {
3095 }
3097 /* If the initializer is {}, then all elements are initialized from {}.
3098 But for non-classes, that's the same as value-initialization. */
3101 {
3104 else
3105 {
3108 }
3109 }
3111 /* Maybe pull out constant value when from_array? */
3114 {
3115 /* Do non-default initialization of non-trivial arrays resulting from
3116 brace-enclosed initializers. */
3119 /* Should we try to create a constant initializer? */
3125 /* If we're initializing a static array, we want to do static
3126 initialization of any elements with constant initializers even if
3127 some are non-constant. */
3134 else
3138 {
3140 tree one_init;
3142 num_initialized_elts++;
3147 else
3153 {
3162 {
3166 else
3169 }
3170 else
3171 {
3177 }
3178 }
3187 else
3191 complain);
3194 else
3196 }
3199 {
3204 else
3206 }
3208 /* Clear out INIT so that we don't get confused below. */
3210 }
3212 {
3217 {
3221 }
3222 }
3224 /* Now, default-initialize any remaining elements. We don't need to
3225 do that if a) the type does not need constructing, or b) we've
3226 already initialized all the elements.
3228 We do need to keep going if we're copying an array. */
3233 && (num_initialized_elts
3235 {
3236 /* If the ITERATOR is equal to -1, then we don't have to loop;
3237 we've already initialized all the elements. */
3238 tree for_stmt;
3239 tree elt_init;
3240 tree to;
3246 for_stmt);
3248 complain);
3256 {
3257 tree from;
3260 {
3264 }
3265 else
3270 complain);
3275 complain);
3276 else
3278 }
3280 {
3282 sorry
3286 explicit_value_init_p,
3288 }
3290 {
3294 }
3295 else
3296 {
3300 else
3301 {
3304 complain);
3306 }
3307 }
3317 complain));
3320 complain));
3323 }
3325 /* Make sure to cleanup any partially constructed elements. */
3328 {
3329 tree e;
3332 complain);
3334 /* Flatten multi-dimensional array since build_vec_delete only
3335 expects one-dimensional array. */
3340 complain);
3349 }
3351 /* The value of the array initialization is the array itself, RVAL
3352 is a pointer to the first element. */
3357 /* Now make the result have the correct type. */
3359 {
3364 }
3373 }
3375 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
3376 build_delete. */
3378 static tree
3380 tsubst_flags_t complain)
3381 {
3382 tree name;
3383 tree fn;
3385 {
3400 }
3405 flags,
3407 complain);
3408 }
3410 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
3411 ADDR is an expression which yields the store to be destroyed.
3412 AUTO_DELETE is the name of the destructor to call, i.e., either
3413 sfk_complete_destructor, sfk_base_destructor, or
3414 sfk_deleting_destructor.
3416 FLAGS is the logical disjunction of zero or more LOOKUP_
3417 flags. See cp-tree.h for more info. */
3419 tree
3422 {
3423 tree expr;
3428 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
3429 set to `error_mark_node' before it gets properly cleaned up. */
3438 {
3445 /* We don't want to warn about delete of void*, only other
3446 incomplete types. Deleting other incomplete types
3447 invokes undefined behavior, but it is not ill-formed, so
3448 compile to something that would even do The Right Thing
3449 (TM) should the type have a trivial dtor and no delete
3450 operator. */
3452 {
3455 {
3459 {
3462 "operator delete will be called, even if they are "
3464 }
3466 }
3470 {
3471 tree dtor;
3474 {
3477 "deleting object of abstract class type %qT"
3478 " which has non-virtual destructor"
3480 else
3482 "deleting object of polymorphic class type %qT"
3483 " which has non-virtual destructor"
3485 }
3486 }
3487 }
3489 /* Call the builtin operator delete. */
3494 /* Throw away const and volatile on target type of addr. */
3496 }
3498 {
3499 handle_array:
3502 {
3506 }
3509 }
3510 else
3511 {
3512 /* Don't check PROTECT here; leave that decision to the
3513 destructor. If the destructor is accessible, call it,
3514 else report error. */
3522 }
3527 {
3533 use_global_delete,
3536 }
3537 else
3538 {
3541 tree ifexp;
3546 /* For `::delete x', we must not use the deleting destructor
3547 since then we would not be sure to get the global `operator
3548 delete'. */
3550 {
3551 /* We will use ADDR multiple times so we must save it. */
3554 /* Delete the object. */
3556 /* Otherwise, treat this like a complete object destructor
3557 call. */
3559 }
3560 /* If the destructor is non-virtual, there is no deleting
3561 variant. Instead, we must explicitly call the appropriate
3562 `operator delete' here. */
3565 {
3566 /* We will use ADDR multiple times so we must save it. */
3568 /* Build the call. */
3570 addr,
3575 /* Call the complete object destructor. */
3577 }
3580 {
3581 /* Make sure we have access to the member op delete, even though
3582 we'll actually be calling it from the destructor. */
3587 }
3596 /* We need to calculate this before the dtor changes the vptr. */
3601 /* Explicit destructor call; don't check for null pointer. */
3603 else
3604 {
3605 /* Handle deleting a null pointer. */
3608 complain));
3611 }
3618 }
3619 }
3621 /* At the beginning of a destructor, push cleanups that will call the
3622 destructors for our base classes and members.
3624 Called from begin_destructor_body. */
3626 void
3628 {
3631 tree member;
3632 tree expr;
3635 /* Run destructors for all virtual baseclasses. */
3637 {
3638 tree cond = (condition_conversion
3640 current_in_charge_parm,
3641 integer_two_node)));
3643 /* The CLASSTYPE_VBASECLASSES vector is in initialization
3644 order, which is also the right order for pushing cleanups. */
3647 {
3649 {
3651 base_dtor_identifier,
3652 NULL,
3653 base_binfo,
3654 (LOOKUP_NORMAL
3656 tf_warning_or_error);
3660 }
3661 }
3662 }
3664 /* Take care of the remaining baseclasses. */
3667 {
3673 base_dtor_identifier,
3676 tf_warning_or_error);
3678 }
3680 /* Don't automatically destroy union members. */
3686 {
3695 {
3696 tree this_member = (build_class_member_access_expr
3700 tf_warning_or_error));
3702 sfk_complete_destructor,
3706 }
3707 }
3708 }
3710 /* Build a C++ vector delete expression.
3711 MAXINDEX is the number of elements to be deleted.
3712 ELT_SIZE is the nominal size of each element in the vector.
3713 BASE is the expression that should yield the store to be deleted.
3714 This function expands (or synthesizes) these calls itself.
3715 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
3717 This also calls delete for virtual baseclasses of elements of the vector.
3719 Update: MAXINDEX is no longer needed. The size can be extracted from the
3720 start of the vector for pointers, and from the type for arrays. We still
3721 use MAXINDEX for arrays because it happens to already have one of the
3722 values we'd have to extract. (We could use MAXINDEX with pointers to
3723 confirm the size, and trap if the numbers differ; not clear that it'd
3724 be worth bothering.) */
3726 tree
3728 special_function_kind auto_delete_vec,
3730 {
3731 tree type;
3732 tree rval;
3738 {
3739 /* Step back one from start of vector, and read dimension. */
3740 tree cookie_addr;
3744 {
3747 }
3752 cookie_addr);
3754 }
3756 {
3757 /* Get the total number of things in the array, maxindex is a
3758 bad name. */
3765 {
3768 }
3769 }
3770 else
3771 {
3775 }
3783 }