| blob | 5c20e32a79f0476ffacd58f80eb6c4cc0697bdc3 |
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 {
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. */
145 static tree
147 tree field_size)
148 {
151 /* [dcl.init]
153 To zero-initialize an object of type T means:
155 -- if T is a scalar type, the storage is set to the value of zero
156 converted to T.
158 -- if T is a non-union class type, the storage for each nonstatic
159 data member and each base-class subobject is zero-initialized.
161 -- if T is a union type, the storage for its first data member is
162 zero-initialized.
164 -- if T is an array type, the storage for each element is
165 zero-initialized.
167 -- if T is a reference type, no initialization is performed. */
172 ;
174 /* In order to save space, we do not explicitly build initializers
175 for items that do not need them. GCC's semantics are that
176 items with static storage duration that are not otherwise
177 initialized are initialized to zero. */
178 ;
184 {
185 tree field;
188 /* Iterate over the fields, building initializations. */
190 {
194 /* Don't add virtual bases for base classes if they are beyond
195 the size of the current field, that means it is present
196 somewhere else in the object. */
198 {
203 }
205 /* Note that for class types there will be FIELD_DECLs
206 corresponding to base classes as well. Thus, iterating
207 over TYPE_FIELDs will result in correct initialization of
208 all of the subobjects. */
210 {
211 tree new_field_size
218 static_storage_p,
219 new_field_size);
222 }
224 /* For unions, only the first field is initialized. */
227 }
229 /* Build a constructor to contain the initializations. */
231 }
233 {
234 tree max_index;
237 /* Iterate over the array elements, building initializations. */
242 else
245 /* If we have an error_mark here, we should just return error mark
246 as we don't know the size of the array yet. */
251 /* A zero-sized array, which is accepted as an extension, will
252 have an upper bound of -1. */
254 {
260 /* If this is a one element array, we just use a regular init. */
263 else
265 max_index);
270 }
272 /* Build a constructor to contain the initializations. */
274 }
277 else
280 /* In all cases, the initializer is a constant. */
285 }
287 /* Return an expression for the zero-initialization of an object with
288 type T. This expression will either be a constant (in the case
289 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
290 aggregate), or NULL (in the case that T does not require
291 initialization). In either case, the value can be used as
292 DECL_INITIAL for a decl of the indicated TYPE; it is a valid static
293 initializer. If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS
294 is the number of elements in the array. If STATIC_STORAGE_P is
295 TRUE, initializers are only generated for entities for which
296 zero-initialization does not simply mean filling the storage with
297 zero bytes. */
299 tree
301 {
303 }
305 /* Return a suitable initializer for value-initializing an object of type
306 TYPE, as described in [dcl.init]. */
308 tree
310 {
311 /* [dcl.init]
313 To value-initialize an object of type T means:
315 - if T is a class type (clause 9) with a user-provided constructor
316 (12.1), then the default constructor for T is called (and the
317 initialization is ill-formed if T has no accessible default
318 constructor);
320 - if T is a non-union class type without a user-provided constructor,
321 then every non-static data member and base-class component of T is
322 value-initialized;92)
324 - if T is an array type, then each element is value-initialized;
326 - otherwise, the object is zero-initialized.
328 A program that calls for default-initialization or
329 value-initialization of an entity of reference type is ill-formed.
331 92) Value-initialization for such a class object may be implemented by
332 zero-initializing the object and then calling the default
333 constructor. */
335 /* The AGGR_INIT_EXPR tweaking below breaks in templates. */
339 {
340 /* Instead of the above, only consider the user-providedness of the
341 default constructor itself so value-initializing a class with an
342 explicitly defaulted default constructor and another user-provided
343 constructor works properly (c++std-core-19883). */
347 return build_aggr_init_expr
351 complain),
352 complain);
354 {
355 /* This is a class that needs constructing, but doesn't have
356 a user-provided constructor. So we need to zero-initialize
357 the object and then call the implicitly defined ctor.
358 This will be handled in simplify_aggr_init_expr. */
359 tree ctor = build_special_member_call
363 {
366 }
368 }
369 }
371 }
373 /* Like build_value_init, but don't call the constructor for TYPE. Used
374 for base initializers. */
376 tree
378 {
379 /* FIXME the class and array cases should just use digest_init once it is
380 SFINAE-enabled. */
382 {
386 {
387 tree field;
390 /* Iterate over the fields, building initializations. */
392 {
400 /* We could skip vfields and fields of types with
401 user-defined constructors, but I think that won't improve
402 performance at all; it should be simpler in general just
403 to zero out the entire object than try to only zero the
404 bits that actually need it. */
406 /* Note that for class types there will be FIELD_DECLs
407 corresponding to base classes as well. Thus, iterating
408 over TYPE_FIELDs will result in correct initialization of
409 all of the subobjects. */
417 }
419 /* Build a constructor to contain the zero- initializations. */
421 }
422 }
424 {
427 /* Iterate over the array elements, building initializations. */
430 /* If we have an error_mark here, we should just return error mark
431 as we don't know the size of the array yet. */
433 {
436 type);
438 }
441 /* A zero-sized array, which is accepted as an extension, will
442 have an upper bound of -1. */
444 {
450 /* If this is a one element array, we just use a regular init. */
453 else
455 max_index);
462 /* We shouldn't have gotten here for anything that would need
463 non-trivial initialization, and gimplify_init_ctor_preeval
464 would need to be fixed to allow it. */
467 }
469 /* Build a constructor to contain the initializations. */
471 }
473 {
477 }
479 {
483 }
486 }
488 /* Initialize MEMBER, a FIELD_DECL, with INIT, a TREE_LIST of
489 arguments. If TREE_LIST is void_type_node, an empty initializer
490 list was given; if NULL_TREE no initializer was given. */
492 static void
494 {
495 tree decl;
498 /* Use the non-static data member initializer if there was no
499 mem-initializer for this field. */
501 {
503 /* Do deferred instantiation of the NSDMI. */
504 init = (tsubst_copy_and_build
509 else
510 {
512 /* Strip redundant TARGET_EXPR so we don't need to remap it, and
513 so the aggregate init code below will see a CONSTRUCTOR. */
518 }
519 }
521 /* Effective C++ rule 12 requires that all data members be
522 initialized. */
526 member);
528 /* Get an lvalue for the data member. */
532 tf_warning_or_error);
538 {
544 member);
545 }
548 {
549 /* mem() means value-initialization. */
551 {
555 }
556 else
557 {
563 }
564 }
565 /* Deal with this here, as we will get confused if we try to call the
566 assignment op for an anonymous union. This can happen in a
567 synthesized copy constructor. */
569 {
571 {
574 }
575 }
578 /* Pre-digested NSDMI. */
581 /* { } mem-initializer. */
587 {
588 /* With references and list-initialization, we need to deal with
589 extending temporary lifetimes. 12.2p5: "A temporary bound to a
590 reference member in a constructor’s ctor-initializer (12.6.2)
591 persists until the constructor exits." */
596 tf_warning_or_error);
601 /* Use 'this' as the decl, as it has the lifetime we want. */
611 }
614 {
616 {
618 {
621 else
625 }
629 {
633 }
634 else
636 }
637 else
638 {
645 /* TYPE_NEEDS_CONSTRUCTING can be set just because we have a
646 vtable; still give this diagnostic. */
651 tf_warning_or_error));
652 }
653 }
654 else
655 {
657 {
658 tree core_type;
659 /* member traversal: note it leaves init NULL */
663 member);
677 }
679 /* There was an explicit member initialization. Do some work
680 in that case. */
682 tf_warning_or_error);
686 tf_warning_or_error));
687 }
690 {
691 tree expr;
696 tf_warning_or_error);
699 tf_warning_or_error);
703 }
704 }
706 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
707 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
709 static tree
711 {
712 tree fields;
714 /* Note whether or not T is a union. */
719 {
720 tree fieldtype;
722 /* Skip CONST_DECLs for enumeration constants and so forth. */
727 /* Keep track of whether or not any fields are unions. */
731 /* For an anonymous struct or union, we must recursively
732 consider the fields of the anonymous type. They can be
733 directly initialized from the constructor. */
735 {
736 /* Add this field itself. Synthesized copy constructors
737 initialize the entire aggregate. */
739 /* And now add the fields in the anonymous aggregate. */
741 }
742 /* Add this field. */
745 }
748 }
750 /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives
751 a FIELD_DECL or BINFO in T that needs initialization. The
752 TREE_VALUE gives the initializer, or list of initializer arguments.
754 Return a TREE_LIST containing all of the initializations required
755 for T, in the order in which they should be performed. The output
756 list has the same format as the input. */
758 static tree
760 {
761 tree init;
763 tree sorted_inits;
764 tree next_subobject;
769 /* Build up a list of initializations. The TREE_PURPOSE of entry
770 will be the subobject (a FIELD_DECL or BINFO) to initialize. The
771 TREE_VALUE will be the constructor arguments, or NULL if no
772 explicit initialization was provided. */
775 /* Process the virtual bases. */
780 /* Process the direct bases. */
786 /* Process the non-static data members. */
788 /* Reverse the entire list of initializations, so that they are in
789 the order that they will actually be performed. */
792 /* If the user presented the initializers in an order different from
793 that in which they will actually occur, we issue a warning. Keep
794 track of the next subobject which can be explicitly initialized
795 without issuing a warning. */
798 /* Go through the explicit initializers, filling in TREE_PURPOSE in
799 the SORTED_INITS. */
801 {
802 tree subobject;
803 tree subobject_init;
807 /* If the explicit initializers are in sorted order, then
808 SUBOBJECT will be NEXT_SUBOBJECT, or something following
809 it. */
811 subobject_init;
816 /* Issue a warning if the explicit initializer order does not
817 match that which will actually occur.
818 ??? Are all these on the correct lines? */
820 {
824 else
829 else
833 }
835 /* Look again, from the beginning of the list. */
837 {
841 }
843 /* It is invalid to initialize the same subobject more than
844 once. */
846 {
850 subobject);
851 else
854 subobject);
855 }
857 /* Record the initialization. */
860 }
862 /* [class.base.init]
864 If a ctor-initializer specifies more than one mem-initializer for
865 multiple members of the same union (including members of
866 anonymous unions), the ctor-initializer is ill-formed.
868 Here we also splice out uninitialized union members. */
870 {
874 {
875 tree field;
876 tree ctx;
883 /* Skip base classes. */
887 /* If this is an anonymous union with no explicit initializer,
888 splice it out. */
892 /* See if this field is a member of a union, or a member of a
893 structure contained in a union, etc. */
899 /* If this field is not a member of a union, skip it. */
903 /* If this union member has no explicit initializer, splice
904 it out. */
908 /* It's only an error if we have two initializers for the same
909 union type. */
911 {
914 }
916 /* See if LAST_FIELD and the field initialized by INIT are
917 members of the same union. If so, there's a problem,
918 unless they're actually members of the same structure
919 which is itself a member of a union. For example, given:
921 union { struct { int i; int j; }; };
923 initializing both `i' and `j' makes sense. */
926 do
927 {
928 tree last_ctx;
932 {
934 {
938 last_ctx);
941 }
947 }
949 /* If we've reached the outermost class, then we're
950 done. */
955 }
960 next:
963 splice:
966 }
967 }
970 }
972 /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS
973 is a TREE_LIST giving the explicit mem-initializer-list for the
974 constructor. The TREE_PURPOSE of each entry is a subobject (a
975 FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE
976 is a TREE_LIST giving the arguments to the constructor or
977 void_type_node for an empty list of arguments. */
979 void
981 {
984 /* We will already have issued an error message about the fact that
985 the type is incomplete. */
992 /* Sort the mem-initializers into the order in which the
993 initializations should be performed. */
998 /* Initialize base classes. */
1001 {
1006 {
1007 /* If these initializations are taking place in a copy constructor,
1008 the base class should probably be explicitly initialized if there
1009 is a user-defined constructor in the base class (other than the
1010 default constructor, which will be called anyway). */
1018 }
1020 /* Initialize the base. */
1023 else
1024 {
1025 tree base_addr;
1031 tf_warning_or_error),
1032 arguments,
1033 flags,
1034 tf_warning_or_error);
1036 }
1039 }
1042 /* Initialize the vptrs. */
1045 /* Initialize the data members. */
1047 {
1051 }
1052 }
1054 /* Returns the address of the vtable (i.e., the value that should be
1055 assigned to the vptr) for BINFO. */
1057 static tree
1059 {
1061 tree vtbl;
1064 /* If this is a virtual primary base, then the vtable we want to store
1065 is that for the base this is being used as the primary base of. We
1066 can't simply skip the initialization, because we may be expanding the
1067 inits of a subobject constructor where the virtual base layout
1068 can be different. */
1072 /* Figure out what vtable BINFO's vtable is based on, and mark it as
1073 used. */
1077 /* Now compute the address to use when initializing the vptr. */
1083 }
1085 /* This code sets up the virtual function tables appropriate for
1086 the pointer DECL. It is a one-ply initialization.
1088 BINFO is the exact type that DECL is supposed to be. In
1089 multiple inheritance, this might mean "C's A" if C : A, B. */
1091 static void
1093 {
1095 tree vtt_index;
1097 /* Compute the initializer for vptr. */
1100 /* We may get this vptr from a VTT, if this is a subobject
1101 constructor or subobject destructor. */
1104 {
1105 tree vtbl2;
1106 tree vtt_parm;
1108 /* Compute the value to use, when there's a VTT. */
1114 /* The actual initializer is the VTT value only in the subobject
1115 constructor. In maybe_clone_body we'll substitute NULL for
1116 the vtt_parm in the case of the non-subobject constructor. */
1121 vtbl2,
1122 vtbl);
1123 }
1125 /* Compute the location of the vtpr. */
1127 tf_warning_or_error),
1131 /* Assign the vtable to the vptr. */
1134 tf_warning_or_error));
1135 }
1137 /* If an exception is thrown in a constructor, those base classes already
1138 constructed must be destroyed. This function creates the cleanup
1139 for BINFO, which has just been constructed. If FLAG is non-NULL,
1140 it is a DECL which is nonzero when this base needs to be
1141 destroyed. */
1143 static void
1145 {
1146 tree expr;
1151 /* Call the destructor. */
1153 base_dtor_identifier,
1154 NULL,
1155 binfo,
1157 tf_warning_or_error);
1165 }
1167 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its
1168 constructor. */
1170 static void
1172 {
1173 tree inner_if_stmt;
1174 tree exp;
1175 tree flag;
1177 /* If there are virtual base classes with destructors, we need to
1178 emit cleanups to destroy them if an exception is thrown during
1179 the construction process. These exception regions (i.e., the
1180 period during which the cleanups must occur) begin from the time
1181 the construction is complete to the end of the function. If we
1182 create a conditional block in which to initialize the
1183 base-classes, then the cleanup region for the virtual base begins
1184 inside a block, and ends outside of that block. This situation
1185 confuses the sjlj exception-handling code. Therefore, we do not
1186 create a single conditional block, but one for each
1187 initialization. (That way the cleanup regions always begin
1188 in the outer block.) We trust the back end to figure out
1189 that the FLAG will not change across initializations, and
1190 avoid doing multiple tests. */
1195 /* Compute the location of the virtual base. If we're
1196 constructing virtual bases, then we must be the most derived
1197 class. Therefore, we don't have to look up the virtual base;
1198 we already know where it is. */
1207 }
1209 /* Find the context in which this FIELD can be initialized. */
1211 static tree
1213 {
1216 /* Anonymous union members can be initialized in the first enclosing
1217 non-anonymous union context. */
1221 }
1223 /* Function to give error message if member initialization specification
1224 is erroneous. FIELD is the member we decided to initialize.
1225 TYPE is the type for which the initialization is being performed.
1226 FIELD must be a member of TYPE.
1228 MEMBER_NAME is the name of the member. */
1230 static int
1232 {
1236 {
1238 member_name);
1240 }
1242 {
1245 field);
1247 }
1249 {
1253 }
1255 {
1257 member_name);
1259 }
1262 }
1264 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it
1265 is a _TYPE node or TYPE_DECL which names a base for that type.
1266 Check the validity of NAME, and return either the base _TYPE, base
1267 binfo, or the FIELD_DECL of the member. If NAME is invalid, return
1268 NULL_TREE and issue a diagnostic.
1270 An old style unnamed direct single base construction is permitted,
1271 where NAME is NULL. */
1273 tree
1275 {
1276 tree basetype;
1277 tree field;
1283 {
1284 /* This is an obsolete unnamed base class initializer. The
1285 parser will already have warned about its use. */
1287 {
1290 current_class_type);
1293 basetype = BINFO_TYPE
1298 current_class_type);
1300 }
1301 }
1303 {
1306 }
1309 else
1313 {
1314 tree class_binfo;
1315 tree direct_binfo;
1316 tree virtual_binfo;
1326 /* Look for a direct base. */
1331 /* Look for a virtual base -- unless the direct base is itself
1332 virtual. */
1336 /* [class.base.init]
1338 If a mem-initializer-id is ambiguous because it designates
1339 both a direct non-virtual base class and an inherited virtual
1340 base class, the mem-initializer is ill-formed. */
1342 {
1344 basetype);
1346 }
1349 {
1353 else
1357 }
1360 }
1361 else
1362 {
1365 else
1370 }
1373 }
1375 /* This is like `expand_member_init', only it stores one aggregate
1376 value into another.
1378 INIT comes in two flavors: it is either a value which
1379 is to be stored in EXP, or it is a parameter list
1380 to go to a constructor, which will operate on EXP.
1381 If INIT is not a parameter list for a constructor, then set
1382 LOOKUP_ONLYCONVERTING.
1383 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1384 the initializer, if FLAGS is 0, then it is the (init) form.
1385 If `init' is a CONSTRUCTOR, then we emit a warning message,
1386 explaining that such initializations are invalid.
1388 If INIT resolves to a CALL_EXPR which happens to return
1389 something of the type we are looking for, then we know
1390 that we can safely use that call to perform the
1391 initialization.
1393 The virtual function table pointer cannot be set up here, because
1394 we do not really know its type.
1396 This never calls operator=().
1398 When initializing, nothing is CONST.
1400 A default copy constructor may have to be used to perform the
1401 initialization.
1403 A constructor or a conversion operator may have to be used to
1404 perform the initialization, but not both, as it would be ambiguous. */
1406 tree
1408 {
1409 tree stmt_expr;
1410 tree compound_stmt;
1431 {
1432 tree itype;
1434 /* An array may not be initialized use the parenthesized
1435 initialization form -- unless the initializer is "()". */
1437 {
1441 }
1442 /* Must arrange to initialize each element of EXP
1443 from elements of INIT. */
1453 complain);
1460 }
1463 /* Just know that we've seen something for this node. */
1477 }
1479 static void
1481 tsubst_flags_t complain)
1482 {
1484 tree ctor_name;
1486 /* It fails because there may not be a constructor which takes
1487 its own type as the first (or only parameter), but which does
1488 take other types via a conversion. So, if the thing initializing
1489 the expression is a unit element of type X, first try X(X&),
1490 followed by initialization by X. If neither of these work
1491 out, then look hard. */
1492 tree rval;
1495 /* If we have direct-initialization from an initializer list, pull
1496 it out of the TREE_LIST so the code below can see it. */
1500 {
1504 }
1508 /* A brace-enclosed initializer for an aggregate. In C++0x this can
1509 happen for direct-initialization, too. */
1512 /* A CONSTRUCTOR of the target's type is a previously digested
1513 initializer, whether that happened just above or in
1514 cp_parser_late_parsing_nsdmi.
1516 A TARGET_EXPR with TARGET_EXPR_DIRECT_INIT_P or TARGET_EXPR_LIST_INIT_P
1517 set represents the whole initialization, so we shouldn't build up
1518 another ctor call. */
1525 {
1526 /* Early initialization via a TARGET_EXPR only works for
1527 complete objects. */
1534 }
1538 {
1539 /* Base subobjects should only get direct-initialization. */
1543 /* Do nothing. We hit this in two cases: Reference initialization,
1544 where we aren't initializing a real variable, so we don't want
1545 to run a new constructor; and catching an exception, where we
1546 have already built up the constructor call so we could wrap it
1548 else
1552 /* We need to protect the initialization of a catch parm with a
1553 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
1554 around the TARGET_EXPR for the copy constructor. See
1555 initialize_handler_parm. */
1556 {
1560 }
1561 else
1566 }
1571 {
1575 }
1576 else
1581 else
1585 complain);
1591 {
1594 {
1598 }
1599 }
1601 /* FIXME put back convert_to_void? */
1604 }
1606 /* This function is responsible for initializing EXP with INIT
1607 (if any).
1609 BINFO is the binfo of the type for who we are performing the
1610 initialization. For example, if W is a virtual base class of A and B,
1611 and C : A, B.
1612 If we are initializing B, then W must contain B's W vtable, whereas
1613 were we initializing C, W must contain C's W vtable.
1615 TRUE_EXP is nonzero if it is the true expression being initialized.
1616 In this case, it may be EXP, or may just contain EXP. The reason we
1617 need this is because if EXP is a base element of TRUE_EXP, we
1618 don't necessarily know by looking at EXP where its virtual
1619 baseclass fields should really be pointing. But we do know
1620 from TRUE_EXP. In constructors, we don't know anything about
1621 the value being initialized.
1623 FLAGS is just passed to `build_new_method_call'. See that function
1624 for its description. */
1626 static void
1628 tsubst_flags_t complain)
1629 {
1635 /* Use a function returning the desired type to initialize EXP for us.
1636 If the function is a constructor, and its first argument is
1637 NULL_TREE, know that it was meant for us--just slide exp on
1638 in and expand the constructor. Constructors now come
1639 as TARGET_EXPRs. */
1643 {
1645 /* If store_init_value returns NULL_TREE, the INIT has been
1646 recorded as the DECL_INITIAL for EXP. That means there's
1647 nothing more we have to do. */
1653 }
1655 /* If an explicit -- but empty -- initializer list was present,
1656 that's value-initialization. */
1658 {
1659 /* If no user-provided ctor, we need to zero out the object. */
1661 {
1664 /* Don't clobber already initialized virtual bases. */
1667 field_size);
1670 }
1672 /* If we don't need to mess with the constructor at all,
1673 then we're done. */
1677 /* Otherwise fall through and call the constructor. */
1679 }
1681 /* We know that expand_default_init can handle everything we want
1682 at this point. */
1684 }
1686 /* Report an error if TYPE is not a user-defined, class type. If
1687 OR_ELSE is nonzero, give an error message. */
1689 int
1691 {
1696 {
1700 }
1702 }
1704 tree
1706 {
1712 else
1714 }
1716 /* Build a reference to a member of an aggregate. This is not a C++
1717 `&', but really something which can have its address taken, and
1718 then act as a pointer to member, for example TYPE :: FIELD can have
1719 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if
1720 this expression is the operand of "&".
1722 @@ Prints out lousy diagnostics for operator <typename>
1723 @@ fields.
1725 @@ This function should be rewritten and placed in search.c. */
1727 tree
1729 {
1730 tree decl;
1733 /* class templates can come in as TEMPLATE_DECLs here. */
1746 /* Callers should call mark_used before this point. */
1751 {
1754 }
1756 /* Entities other than non-static members need no further
1757 processing. */
1764 {
1767 }
1769 /* Set up BASEBINFO for member lookup. */
1772 /* A lot of this logic is now handled in lookup_member. */
1774 {
1775 /* Go from the TREE_BASELINK to the member function info. */
1779 {
1780 /* Get rid of a potential OVERLOAD around it. */
1783 /* Unique functions are handled easily. */
1785 /* For non-static member of base class, we need a special rule
1786 for access checking [class.protected]:
1788 If the access is to form a pointer to member, the
1789 nested-name-specifier shall name the derived class
1790 (or any class derived from that class). */
1794 else
1800 }
1801 else
1803 }
1805 /* We need additional test besides the one in
1806 check_accessibility_of_qualified_id in case it is
1807 a pointer to non-static member. */
1811 {
1812 /* If MEMBER is non-static, then the program has fallen afoul of
1813 [expr.prim]:
1815 An id-expression that denotes a nonstatic data member or
1816 nonstatic member function of a class can only be used:
1818 -- as part of a class member access (_expr.ref_) in which the
1819 object-expression refers to the member's class or a class
1820 derived from that class, or
1822 -- to form a pointer to member (_expr.unary.op_), or
1824 -- in the body of a nonstatic member function of that class or
1825 of a class derived from that class (_class.mfct.nonstatic_), or
1827 -- in a mem-initializer for a constructor for that class or for
1828 a class derived from that class (_class.base.init_). */
1830 {
1831 /* Build a representation of the qualified name suitable
1832 for use as the operand to "&" -- even though the "&" is
1833 not actually present. */
1835 /* In Microsoft mode, treat a non-static member function as if
1836 it were a pointer-to-member. */
1838 {
1841 }
1845 }
1847 {
1850 }
1852 }
1857 }
1859 /* If DECL is a scalar enumeration constant or variable with a
1860 constant initializer, return the initializer (or, its initializers,
1861 recursively); otherwise, return DECL. If INTEGRAL_P, the
1862 initializer is only returned if DECL is an integral
1863 constant-expression. If RETURN_AGGREGATE_CST_OK_P, it is ok to
1864 return an aggregate constant. */
1866 static tree
1868 {
1870 || (integral_p
1874 {
1875 tree init;
1876 /* If DECL is a static data member in a template
1877 specialization, we must instantiate it here. The
1878 initializer for the static data member is not processed
1879 until needed; we need it now. */
1884 {
1886 /* Treat the error as a constant to avoid cascading errors on
1887 excessively recursive template instantiation (c++/9335). */
1889 else
1891 }
1892 /* Initializers in templates are generally expanded during
1893 instantiation, so before that for const int i(2)
1894 INIT is a TREE_LIST with the actual initializer as
1895 TREE_VALUE. */
1897 && init
1905 /* Unless RETURN_AGGREGATE_CST_OK_P is true, do not
1906 return an aggregate constant (of which string
1907 literals are a special case), as we do not want
1908 to make inadvertent copies of such entities, and
1909 we must be sure that their addresses are the
1910 same everywhere. */
1915 }
1917 }
1919 /* If DECL is a CONST_DECL, or a constant VAR_DECL initialized by
1920 constant of integral or enumeration type, then return that value.
1921 These are those variables permitted in constant expressions by
1922 [5.19/1]. */
1924 tree
1926 {
1929 }
1931 /* A more relaxed version of integral_constant_value, used by the
1932 common C/C++ code. */
1934 tree
1936 {
1939 }
1941 /* A version of integral_constant_value used by the C++ front end for
1942 optimization purposes. */
1944 tree
1946 {
1949 }
1950 \f
1951 /* Common subroutines of build_new and build_vec_delete. */
1953 /* Call the global __builtin_delete to delete ADDR. */
1955 static tree
1957 {
1960 }
1961 \f
1962 /* Build and return a NEW_EXPR. If NELTS is non-NULL, TYPE[NELTS] is
1963 the type of the object being allocated; otherwise, it's just TYPE.
1964 INIT is the initializer, if any. USE_GLOBAL_NEW is true if the
1965 user explicitly wrote "::operator new". PLACEMENT, if non-NULL, is
1966 a vector of arguments to be provided as arguments to a placement
1967 new operator. This routine performs no semantic checks; it just
1968 creates and returns a NEW_EXPR. */
1970 static tree
1973 {
1974 tree init_list;
1975 tree new_expr;
1977 /* If INIT is NULL, the we want to store NULL_TREE in the NEW_EXPR.
1978 If INIT is not NULL, then we want to store VOID_ZERO_NODE. This
1979 permits us to distinguish the case of a missing initializer "new
1980 int" from an empty initializer "new int()". */
1985 else
1990 init_list);
1995 }
1997 /* Diagnose uninitialized const members or reference members of type
1998 TYPE. USING_NEW is used to disambiguate the diagnostic between a
1999 new expression without a new-initializer and a declaration. Returns
2000 the error count. */
2002 static int
2005 {
2006 tree field;
2013 {
2014 tree field_type;
2025 {
2028 {
2032 else
2036 }
2037 }
2040 {
2043 {
2047 else
2051 }
2052 }
2055 error_count
2058 }
2060 }
2062 int
2064 {
2066 }
2068 /* Generate code for a new-expression, including calling the "operator
2069 new" function, initializing the object, and, if an exception occurs
2070 during construction, cleaning up. The arguments are as for
2071 build_raw_new_expr. This may change PLACEMENT and INIT. */
2073 static tree
2076 tsubst_flags_t complain)
2077 {
2079 /* True iff this is a call to "operator new[]" instead of just
2080 "operator new". */
2082 /* If ARRAY_P is true, the element type of the array. This is never
2083 an ARRAY_TYPE; for something like "new int[3][4]", the
2084 ELT_TYPE is "int". If ARRAY_P is false, this is the same type as
2085 TYPE. */
2086 tree elt_type;
2087 /* The type of the new-expression. (This type is always a pointer
2088 type.) */
2089 tree pointer_type;
2090 tree non_const_pointer_type;
2093 /* The address returned by the call to "operator new". This node is
2094 a VAR_DECL and is therefore reusable. */
2095 tree alloc_node;
2096 tree alloc_fn;
2100 /* If non-NULL, the number of extra bytes to allocate at the
2101 beginning of the storage allocated for an array-new expression in
2102 order to store the number of elements. */
2104 tree placement_first;
2106 /* True if the function we are calling is a placement allocation
2107 function. */
2109 /* True if the storage must be initialized, either by a constructor
2110 or due to an explicit new-initializer. */
2112 /* The address of the thing allocated, not including any cookie. In
2113 particular, if an array cookie is in use, DATA_ADDR is the
2114 address of the first array element. This node is a VAR_DECL, and
2115 is therefore reusable. */
2116 tree data_addr;
2120 {
2123 }
2125 {
2130 }
2132 /* If our base type is an array, then make sure we know how many elements
2133 it has. */
2140 complain);
2143 {
2147 }
2155 {
2157 /* A program that calls for default-initialization [...] of an
2158 entity of reference type is ill-formed. */
2162 /* A new-expression that creates an object of type T initializes
2163 that object as follows:
2164 - If the new-initializer is omitted:
2165 -- If T is a (possibly cv-qualified) non-POD class type
2166 (or array thereof), the object is default-initialized (8.5).
2167 [...]
2168 -- Otherwise, the object created has indeterminate
2169 value. If T is a const-qualified type, or a (possibly
2170 cv-qualified) POD class type (or array thereof)
2171 containing (directly or indirectly) a member of
2172 const-qualified type, the program is ill-formed; */
2182 }
2186 {
2190 }
2198 /* If PLACEMENT is a single simple pointer type not passed by
2199 reference, prepare to capture it in a temporary variable. Do
2200 this now, since PLACEMENT will change in the calls below. */
2207 /* Allocate the object. */
2209 {
2210 tree class_addr;
2220 {
2224 }
2226 {
2230 }
2235 }
2237 {
2240 }
2241 else
2242 {
2243 tree fnname;
2244 tree fns;
2250 && (array_p
2253 {
2254 /* Use a class-specific operator new. */
2255 /* If a cookie is required, add some extra space. */
2257 {
2260 }
2261 /* Create the argument list. */
2263 /* Do name-lookup to find the appropriate operator. */
2266 {
2270 }
2272 {
2274 {
2277 }
2279 }
2283 LOOKUP_NORMAL,
2285 complain);
2286 }
2287 else
2288 {
2289 /* Use a global operator new. */
2290 /* See if a cookie might be required. */
2293 else
2299 }
2300 }
2307 /* If we found a simple case of PLACEMENT_EXPR above, then copy it
2308 into a temporary variable. */
2315 {
2320 {
2324 }
2325 }
2327 /* In the simple case, we can stop now. */
2332 /* Store the result of the allocation call in a variable so that we can
2333 use it more than once. */
2337 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */
2341 /* Now, check to see if this function is actually a placement
2342 allocation function. This can happen even when PLACEMENT is NULL
2343 because we might have something like:
2345 struct S { void* operator new (size_t, int i = 0); };
2347 A call to `new S' will get this allocation function, even though
2348 there is no explicit placement argument. If there is more than
2349 one argument, or there are variable arguments, then this is a
2350 placement allocation function. */
2351 placement_allocation_fn_p
2355 /* Preevaluate the placement args so that we don't reevaluate them for a
2356 placement delete. */
2358 {
2359 tree inits;
2363 alloc_expr);
2364 }
2366 /* unless an allocation function is declared with an empty excep-
2367 tion-specification (_except.spec_), throw(), it indicates failure to
2368 allocate storage by throwing a bad_alloc exception (clause _except_,
2369 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2370 cation function is declared with an empty exception-specification,
2371 throw(), it returns null to indicate failure to allocate storage and a
2372 non-null pointer otherwise.
2374 So check for a null exception spec on the op new we just called. */
2380 {
2381 tree cookie;
2382 tree cookie_ptr;
2383 tree size_ptr_type;
2385 /* Adjust so we're pointing to the start of the object. */
2388 /* Store the number of bytes allocated so that we can know how
2389 many elements to destroy later. We use the last sizeof
2390 (size_t) bytes to store the number of elements. */
2401 {
2402 /* Also store the element size. */
2413 }
2414 }
2415 else
2416 {
2419 }
2421 /* Now use a pointer to the type we've actually allocated. */
2423 /* But we want to operate on a non-const version to start with,
2424 since we'll be modifying the elements. */
2425 non_const_pointer_type = build_pointer_type
2429 /* Any further uses of alloc_node will want this type, too. */
2432 /* Now initialize the allocated object. Note that we preevaluate the
2433 initialization expression, apart from the actual constructor call or
2434 assignment--we do this because we want to delay the allocation as long
2435 as possible in order to minimize the size of the exception region for
2436 placement delete. */
2438 {
2443 {
2446 }
2449 {
2450 /* build_value_init doesn't work in templates, and we don't need
2451 the initializer anyway since we're going to throw it away and
2452 rebuild it at instantiation time, so just build up a single
2453 constructor call to get any appropriate diagnostics. */
2457 complete_ctor_identifier,
2459 LOOKUP_NORMAL,
2460 complain);
2462 }
2464 {
2469 {
2473 else
2474 {
2478 complain);
2479 else
2480 {
2485 }
2488 }
2489 }
2491 {
2495 else
2498 }
2499 init_expr
2503 integer_one_node,
2504 complain),
2505 vecinit,
2506 explicit_value_init_p,
2508 complain);
2510 /* An array initialization is stable because the initialization
2511 of each element is a full-expression, so the temporaries don't
2512 leak out. */
2514 }
2515 else
2516 {
2520 {
2522 complete_ctor_identifier,
2524 LOOKUP_NORMAL,
2525 complain);
2526 }
2528 {
2529 /* Something like `new int()'. */
2534 }
2535 else
2536 {
2537 tree ie;
2539 /* We are processing something like `new int (10)', which
2540 means allocate an int, and initialize it with 10. */
2544 complain);
2545 }
2547 }
2552 /* If any part of the object initialization terminates by throwing an
2553 exception and a suitable deallocation function can be found, the
2554 deallocation function is called to free the memory in which the
2555 object was being constructed, after which the exception continues
2556 to propagate in the context of the new-expression. If no
2557 unambiguous matching deallocation function can be found,
2558 propagating the exception does not cause the object's memory to be
2559 freed. */
2561 {
2563 tree cleanup;
2565 /* The Standard is unclear here, but the right thing to do
2566 is to use the same method for finding deallocation
2567 functions that we use for finding allocation functions. */
2568 cleanup = (build_op_delete_call
2570 alloc_node,
2571 size,
2572 globally_qualified_p,
2574 alloc_fn));
2579 /* This is much simpler if we were able to preevaluate all of
2580 the arguments to the constructor call. */
2581 {
2582 /* CLEANUP is compiler-generated, so no diagnostics. */
2586 /* Likewise, this try-catch is compiler-generated. */
2588 }
2589 else
2590 /* Ack! First we allocate the memory. Then we set our sentry
2591 variable to true, and expand a cleanup that deletes the
2592 memory if sentry is true. Then we run the constructor, and
2593 finally clear the sentry.
2595 We need to do this because we allocate the space first, so
2596 if there are any temporaries with cleanups in the
2597 constructor args and we weren't able to preevaluate them, we
2598 need this EH region to extend until end of full-expression
2599 to preserve nesting. */
2600 {
2608 /* CLEANUP is compiler-generated, so no diagnostics. */
2618 init_expr
2621 end));
2622 /* Likewise, this is compiler-generated. */
2624 }
2625 }
2626 }
2627 else
2630 /* Now build up the return value in reverse order. */
2640 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
2641 and return the call (which doesn't need to be adjusted). */
2643 else
2644 {
2646 {
2649 nullptr_node,
2650 complain);
2652 complain);
2653 }
2655 /* Perform the allocation before anything else, so that ALLOC_NODE
2656 has been initialized before we start using it. */
2658 }
2663 /* A new-expression is never an lvalue. */
2667 }
2669 /* Generate a representation for a C++ "new" expression. *PLACEMENT
2670 is a vector of placement-new arguments (or NULL if none). If NELTS
2671 is NULL, TYPE is the type of the storage to be allocated. If NELTS
2672 is not NULL, then this is an array-new allocation; TYPE is the type
2673 of the elements in the array and NELTS is the number of elements in
2674 the array. *INIT, if non-NULL, is the initializer for the new
2675 object, or an empty vector to indicate an initializer of "()". If
2676 USE_GLOBAL_NEW is true, then the user explicitly wrote "::new"
2677 rather than just "new". This may change PLACEMENT and INIT. */
2679 tree
2682 {
2683 tree rval;
2692 {
2695 {
2699 }
2700 }
2703 {
2709 use_global_new);
2719 }
2722 {
2724 {
2727 else
2729 }
2732 }
2734 /* ``A reference cannot be created by the new operator. A reference
2735 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
2736 returned by new.'' ARM 5.3.3 */
2738 {
2741 else
2744 }
2747 {
2751 }
2753 /* The type allocated must be complete. If the new-type-id was
2754 "T[N]" then we are just checking that "T" is complete here, but
2755 that is equivalent, since the value of "N" doesn't matter. */
2764 {
2770 }
2772 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
2777 }
2779 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
2781 tree
2783 {
2789 {
2792 {
2795 }
2797 }
2799 /* Mangle the class$ field. */
2800 {
2801 tree field;
2804 {
2808 }
2810 {
2813 }
2814 }
2818 {
2828 }
2830 }
2831 \f
2832 static tree
2834 special_function_kind auto_delete_vec,
2836 {
2837 tree virtual_size;
2841 /* Temporary variables used by the loop. */
2844 /* This is the body of the loop that implements the deletion of a
2845 single element, and moves temp variables to next elements. */
2846 tree body;
2848 /* This is the LOOP_EXPR that governs the deletion of the elements. */
2851 /* This is the thing that governs what to do after the loop has run. */
2854 /* This is the BIND_EXPR which holds the outermost iterator of the
2855 loop. It is convenient to set this variable up and test it before
2856 executing any other code in the loop.
2857 This is also the containing expression returned by this function. */
2859 tree tmp;
2861 /* We should only have 1-D arrays here. */
2870 /* The below is short by the cookie size. */
2875 tbase_init
2879 base),
2880 virtual_size),
2881 complain);
2899 complain);
2907 no_destructor:
2908 /* Delete the storage if appropriate. */
2910 {
2911 tree base_tbd;
2913 /* The below is short by the cookie size. */
2918 /* no header */
2920 else
2921 {
2922 tree cookie_size;
2926 MINUS_EXPR,
2928 base),
2929 cookie_size,
2930 complain);
2934 /* True size with header. */
2936 }
2943 }
2947 ;
2950 else
2956 /* Outermost wrapper: If pointer is null, punt. */
2961 nullptr_node)),
2966 {
2969 }
2972 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
2976 }
2978 /* Create an unnamed variable of the indicated TYPE. */
2980 tree
2982 {
2983 tree decl;
2993 }
2995 /* Create a new temporary variable of the indicated TYPE, initialized
2996 to INIT.
2998 It is not entered into current_binding_level, because that breaks
2999 things when it comes time to do final cleanups (which take place
3000 "outside" the binding contour of the function). */
3002 tree
3004 {
3005 tree decl;
3011 tf_warning_or_error));
3014 }
3016 /* `build_vec_init' returns tree structure that performs
3017 initialization of a vector of aggregate types.
3019 BASE is a reference to the vector, of ARRAY_TYPE, or a pointer
3020 to the first element, of POINTER_TYPE.
3021 MAXINDEX is the maximum index of the array (one less than the
3022 number of elements). It is only used if BASE is a pointer or
3023 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
3025 INIT is the (possibly NULL) initializer.
3027 If EXPLICIT_VALUE_INIT_P is true, then INIT must be NULL. All
3028 elements in the array are value-initialized.
3030 FROM_ARRAY is 0 if we should init everything with INIT
3031 (i.e., every element initialized from INIT).
3032 FROM_ARRAY is 1 if we should index into INIT in parallel
3033 with initialization of DECL.
3034 FROM_ARRAY is 2 if we should index into INIT in parallel,
3035 but use assignment instead of initialization. */
3037 tree
3041 {
3042 tree rval;
3045 tree iterator;
3046 /* The type of BASE. */
3048 /* The type of an element in the array. */
3050 /* The element type reached after removing all outer array
3051 types. */
3052 tree inner_elt_type;
3053 /* The type of a pointer to an element in the array. */
3054 tree ptype;
3055 tree stmt_expr;
3056 tree compound_stmt;
3078 /* Look through the TARGET_EXPR around a compound literal. */
3091 /* Don't do this if the CONSTRUCTOR might contain something
3092 that might throw and require us to clean up. */
3096 {
3097 /* Do non-default initialization of trivial arrays resulting from
3098 brace-enclosed initializers. In this case, digest_init and
3099 store_constructor will handle the semantics for us. */
3103 }
3107 {
3110 }
3111 else
3114 /* The code we are generating looks like:
3115 ({
3116 T* t1 = (T*) base;
3117 T* rval = t1;
3118 ptrdiff_t iterator = maxindex;
3119 try {
3120 for (; iterator != -1; --iterator) {
3121 ... initialize *t1 ...
3122 ++t1;
3123 }
3124 } catch (...) {
3125 ... destroy elements that were constructed ...
3126 }
3127 rval;
3128 })
3130 We can omit the try and catch blocks if we know that the
3131 initialization will never throw an exception, or if the array
3132 elements do not have destructors. We can omit the loop completely if
3133 the elements of the array do not have constructors.
3135 We actually wrap the entire body of the above in a STMT_EXPR, for
3136 tidiness.
3138 When copying from array to another, when the array elements have
3139 only trivial copy constructors, we should use __builtin_memcpy
3140 rather than generating a loop. That way, we could take advantage
3141 of whatever cleverness the back end has for dealing with copies
3142 of blocks of memory. */
3151 /* If initializing one array from another, initialize element by
3152 element. We rely upon the below calls to do the argument
3153 checking. Evaluate the initializer before entering the try block. */
3155 {
3162 }
3164 /* Protect the entire array initialization so that we can destroy
3165 the partially constructed array if an exception is thrown.
3166 But don't do this if we're assigning. */
3169 {
3171 }
3173 /* If the initializer is {}, then all elements are initialized from {}.
3174 But for non-classes, that's the same as value-initialization. */
3177 {
3180 else
3181 {
3184 }
3185 }
3187 /* Maybe pull out constant value when from_array? */
3190 {
3191 /* Do non-default initialization of non-trivial arrays resulting from
3192 brace-enclosed initializers. */
3195 /* Should we try to create a constant initializer? */
3199 /* If the constructor already has the array type, it's been through
3200 digest_init, so we shouldn't try to do anything more. */
3204 /* If we're initializing a static array, we want to do static
3205 initialization of any elements with constant initializers even if
3206 some are non-constant. */
3213 else
3217 {
3219 tree one_init;
3221 num_initialized_elts++;
3228 else
3234 {
3243 {
3247 else
3250 }
3251 else
3252 {
3258 }
3259 }
3268 else
3272 complain);
3275 else
3277 }
3280 {
3285 else
3287 }
3289 /* Clear out INIT so that we don't get confused below. */
3291 }
3293 {
3298 {
3302 }
3303 }
3305 /* Now, default-initialize any remaining elements. We don't need to
3306 do that if a) the type does not need constructing, or b) we've
3307 already initialized all the elements.
3309 We do need to keep going if we're copying an array. */
3314 && (num_initialized_elts
3316 {
3317 /* If the ITERATOR is equal to -1, then we don't have to loop;
3318 we've already initialized all the elements. */
3319 tree for_stmt;
3320 tree elt_init;
3321 tree to;
3327 for_stmt);
3329 complain);
3337 {
3338 tree from;
3341 {
3345 }
3346 else
3351 complain);
3356 complain);
3357 else
3359 }
3361 {
3363 sorry
3367 explicit_value_init_p,
3369 }
3371 {
3375 }
3376 else
3377 {
3381 else
3382 {
3385 complain);
3387 }
3388 }
3398 complain));
3401 complain));
3404 }
3406 /* Make sure to cleanup any partially constructed elements. */
3409 {
3410 tree e;
3413 complain);
3415 /* Flatten multi-dimensional array since build_vec_delete only
3416 expects one-dimensional array. */
3421 complain);
3430 }
3432 /* The value of the array initialization is the array itself, RVAL
3433 is a pointer to the first element. */
3438 /* Now make the result have the correct type. */
3440 {
3445 }
3454 }
3456 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
3457 build_delete. */
3459 static tree
3461 tsubst_flags_t complain)
3462 {
3463 tree name;
3464 tree fn;
3466 {
3481 }
3486 flags,
3488 complain);
3489 }
3491 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
3492 ADDR is an expression which yields the store to be destroyed.
3493 AUTO_DELETE is the name of the destructor to call, i.e., either
3494 sfk_complete_destructor, sfk_base_destructor, or
3495 sfk_deleting_destructor.
3497 FLAGS is the logical disjunction of zero or more LOOKUP_
3498 flags. See cp-tree.h for more info. */
3500 tree
3503 {
3504 tree expr;
3509 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
3510 set to `error_mark_node' before it gets properly cleaned up. */
3519 {
3526 /* We don't want to warn about delete of void*, only other
3527 incomplete types. Deleting other incomplete types
3528 invokes undefined behavior, but it is not ill-formed, so
3529 compile to something that would even do The Right Thing
3530 (TM) should the type have a trivial dtor and no delete
3531 operator. */
3533 {
3536 {
3540 {
3543 "operator delete will be called, even if they are "
3545 }
3547 }
3551 {
3552 tree dtor;
3555 {
3558 "deleting object of abstract class type %qT"
3559 " which has non-virtual destructor"
3561 else
3563 "deleting object of polymorphic class type %qT"
3564 " which has non-virtual destructor"
3566 }
3567 }
3568 }
3570 /* Call the builtin operator delete. */
3575 /* Throw away const and volatile on target type of addr. */
3577 }
3579 {
3580 handle_array:
3583 {
3587 }
3590 }
3591 else
3592 {
3593 /* Don't check PROTECT here; leave that decision to the
3594 destructor. If the destructor is accessible, call it,
3595 else report error. */
3603 }
3608 {
3614 use_global_delete,
3617 }
3618 else
3619 {
3622 tree ifexp;
3627 /* For `::delete x', we must not use the deleting destructor
3628 since then we would not be sure to get the global `operator
3629 delete'. */
3631 {
3632 /* We will use ADDR multiple times so we must save it. */
3635 /* Delete the object. */
3637 /* Otherwise, treat this like a complete object destructor
3638 call. */
3640 }
3641 /* If the destructor is non-virtual, there is no deleting
3642 variant. Instead, we must explicitly call the appropriate
3643 `operator delete' here. */
3646 {
3647 /* We will use ADDR multiple times so we must save it. */
3649 /* Build the call. */
3651 addr,
3656 /* Call the complete object destructor. */
3658 }
3661 {
3662 /* Make sure we have access to the member op delete, even though
3663 we'll actually be calling it from the destructor. */
3668 }
3677 /* We need to calculate this before the dtor changes the vptr. */
3682 /* Explicit destructor call; don't check for null pointer. */
3684 else
3685 {
3686 /* Handle deleting a null pointer. */
3689 complain));
3692 }
3699 }
3700 }
3702 /* At the beginning of a destructor, push cleanups that will call the
3703 destructors for our base classes and members.
3705 Called from begin_destructor_body. */
3707 void
3709 {
3712 tree member;
3713 tree expr;
3716 /* Run destructors for all virtual baseclasses. */
3718 {
3719 tree cond = (condition_conversion
3721 current_in_charge_parm,
3722 integer_two_node)));
3724 /* The CLASSTYPE_VBASECLASSES vector is in initialization
3725 order, which is also the right order for pushing cleanups. */
3728 {
3730 {
3732 base_dtor_identifier,
3733 NULL,
3734 base_binfo,
3735 (LOOKUP_NORMAL
3737 tf_warning_or_error);
3741 }
3742 }
3743 }
3745 /* Take care of the remaining baseclasses. */
3748 {
3754 base_dtor_identifier,
3757 tf_warning_or_error);
3759 }
3761 /* Don't automatically destroy union members. */
3767 {
3776 {
3777 tree this_member = (build_class_member_access_expr
3781 tf_warning_or_error));
3783 sfk_complete_destructor,
3787 }
3788 }
3789 }
3791 /* Build a C++ vector delete expression.
3792 MAXINDEX is the number of elements to be deleted.
3793 ELT_SIZE is the nominal size of each element in the vector.
3794 BASE is the expression that should yield the store to be deleted.
3795 This function expands (or synthesizes) these calls itself.
3796 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
3798 This also calls delete for virtual baseclasses of elements of the vector.
3800 Update: MAXINDEX is no longer needed. The size can be extracted from the
3801 start of the vector for pointers, and from the type for arrays. We still
3802 use MAXINDEX for arrays because it happens to already have one of the
3803 values we'd have to extract. (We could use MAXINDEX with pointers to
3804 confirm the size, and trap if the numbers differ; not clear that it'd
3805 be worth bothering.) */
3807 tree
3809 special_function_kind auto_delete_vec,
3811 {
3812 tree type;
3813 tree rval;
3819 {
3820 /* Step back one from start of vector, and read dimension. */
3821 tree cookie_addr;
3825 {
3828 }
3833 cookie_addr);
3835 }
3837 {
3838 /* Get the total number of things in the array, maxindex is a
3839 bad name. */
3846 {
3849 }
3850 }
3851 else
3852 {
3856 }
3864 }