| blob | 3a6e2e7f4ebd2e55953623cf4ab519b09ce537c8 |
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 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. */
56 /* We are about to generate some complex initialization code.
57 Conceptually, it is all a single expression. However, we may want
58 to include conditionals, loops, and other such statement-level
59 constructs. Therefore, we build the initialization code inside a
60 statement-expression. This function starts such an expression.
61 STMT_EXPR_P and COMPOUND_STMT_P are filled in by this function;
62 pass them back to finish_init_stmts when the expression is
63 complete. */
65 static bool
67 {
74 }
76 /* Finish out the statement-expression begun by the previous call to
77 begin_init_stmts. Returns the statement-expression itself. */
79 static tree
81 {
89 }
91 /* Constructors */
93 /* Called from initialize_vtbl_ptrs via dfs_walk. BINFO is the base
94 which we want to initialize the vtable pointer for, DATA is
95 TREE_LIST whose TREE_VALUE is the this ptr expression. */
97 static tree
99 {
104 {
110 }
113 }
115 /* Initialize all the vtable pointers in the object pointed to by
116 ADDR. */
118 void
120 {
121 tree list;
122 tree type;
127 /* Walk through the hierarchy, initializing the vptr in each base
128 class. We do these in pre-order because we can't find the virtual
129 bases for a class until we've initialized the vtbl for that
130 class. */
132 }
134 /* Return an expression for the zero-initialization of an object with
135 type T. This expression will either be a constant (in the case
136 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
137 aggregate), or NULL (in the case that T does not require
138 initialization). In either case, the value can be used as
139 DECL_INITIAL for a decl of the indicated TYPE; it is a valid static
140 initializer. If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS
141 is the number of elements in the array. If STATIC_STORAGE_P is
142 TRUE, initializers are only generated for entities for which
143 zero-initialization does not simply mean filling the storage with
144 zero bytes. */
146 tree
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 ;
182 {
183 tree field;
186 /* Iterate over the fields, building initializations. */
188 {
192 /* Note that for class types there will be FIELD_DECLs
193 corresponding to base classes as well. Thus, iterating
194 over TYPE_FIELDs will result in correct initialization of
195 all of the subobjects. */
197 {
200 static_storage_p);
203 }
205 /* For unions, only the first field is initialized. */
208 }
210 /* Build a constructor to contain the initializations. */
212 }
214 {
215 tree max_index;
218 /* Iterate over the array elements, building initializations. */
223 else
226 /* If we have an error_mark here, we should just return error mark
227 as we don't know the size of the array yet. */
232 /* A zero-sized array, which is accepted as an extension, will
233 have an upper bound of -1. */
235 {
241 /* If this is a one element array, we just use a regular init. */
244 else
246 max_index);
250 static_storage_p);
251 }
253 /* Build a constructor to contain the initializations. */
255 }
258 else
261 /* In all cases, the initializer is a constant. */
266 }
268 /* Return a suitable initializer for value-initializing an object of type
269 TYPE, as described in [dcl.init]. */
271 tree
273 {
274 /* [dcl.init]
276 To value-initialize an object of type T means:
278 - if T is a class type (clause 9) with a user-provided constructor
279 (12.1), then the default constructor for T is called (and the
280 initialization is ill-formed if T has no accessible default
281 constructor);
283 - if T is a non-union class type without a user-provided constructor,
284 then every non-static data member and base-class component of T is
285 value-initialized;92)
287 - if T is an array type, then each element is value-initialized;
289 - otherwise, the object is zero-initialized.
291 A program that calls for default-initialization or
292 value-initialization of an entity of reference type is ill-formed.
294 92) Value-initialization for such a class object may be implemented by
295 zero-initializing the object and then calling the default
296 constructor. */
298 /* The AGGR_INIT_EXPR tweaking below breaks in templates. */
302 {
304 return build_aggr_init_expr
308 complain));
310 {
311 /* This is a class that needs constructing, but doesn't have
312 a user-provided constructor. So we need to zero-initialize
313 the object and then call the implicitly defined ctor.
314 This will be handled in simplify_aggr_init_expr. */
315 tree ctor = build_special_member_call
322 }
323 }
325 }
327 /* Like build_value_init, but don't call the constructor for TYPE. Used
328 for base initializers. */
330 tree
332 {
334 {
338 {
339 tree field;
342 /* Iterate over the fields, building initializations. */
344 {
353 {
356 else
358 }
360 /* We could skip vfields and fields of types with
361 user-defined constructors, but I think that won't improve
362 performance at all; it should be simpler in general just
363 to zero out the entire object than try to only zero the
364 bits that actually need it. */
366 /* Note that for class types there will be FIELD_DECLs
367 corresponding to base classes as well. Thus, iterating
368 over TYPE_FIELDs will result in correct initialization of
369 all of the subobjects. */
374 }
376 /* Build a constructor to contain the zero- initializations. */
378 }
379 }
381 {
384 /* Iterate over the array elements, building initializations. */
387 /* If we have an error_mark here, we should just return error mark
388 as we don't know the size of the array yet. */
390 {
393 }
396 /* A zero-sized array, which is accepted as an extension, will
397 have an upper bound of -1. */
399 {
405 /* If this is a one element array, we just use a regular init. */
408 else
410 max_index);
414 /* The gimplifier can't deal with a RANGE_EXPR of TARGET_EXPRs. */
417 }
419 /* Build a constructor to contain the initializations. */
421 }
424 }
426 /* Initialize MEMBER, a FIELD_DECL, with INIT, a TREE_LIST of
427 arguments. If TREE_LIST is void_type_node, an empty initializer
428 list was given; if NULL_TREE no initializer was given. */
430 static void
432 {
433 tree decl;
436 /* Effective C++ rule 12 requires that all data members be
437 initialized. */
441 member);
443 /* Get an lvalue for the data member. */
447 tf_warning_or_error);
452 {
453 /* mem() means value-initialization. */
455 {
459 tf_warning_or_error);
461 }
462 else
463 {
467 member);
468 else
469 {
473 }
474 }
475 }
476 /* Deal with this here, as we will get confused if we try to call the
477 assignment op for an anonymous union. This can happen in a
478 synthesized copy constructor. */
480 {
482 {
485 }
486 }
488 {
490 {
492 {
495 }
499 {
503 }
504 else
506 }
507 else
508 {
512 /* TYPE_NEEDS_CONSTRUCTING can be set just because we have a
513 vtable; still give this diagnostic. */
518 tf_warning_or_error));
519 }
520 }
521 else
522 {
524 {
525 tree core_type;
526 /* member traversal: note it leaves init NULL */
530 member);
538 {
541 member);
543 }
552 }
554 /* There was an explicit member initialization. Do some work
555 in that case. */
557 tf_warning_or_error);
561 tf_warning_or_error));
562 }
565 {
566 tree expr;
571 tf_warning_or_error);
577 }
578 }
580 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
581 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
583 static tree
585 {
586 tree fields;
590 /* Note whether or not T is a union. */
595 {
596 tree fieldtype;
598 /* Skip CONST_DECLs for enumeration constants and so forth. */
603 /* Keep track of whether or not any fields are unions. */
607 /* For an anonymous struct or union, we must recursively
608 consider the fields of the anonymous type. They can be
609 directly initialized from the constructor. */
611 {
612 /* Add this field itself. Synthesized copy constructors
613 initialize the entire aggregate. */
615 /* And now add the fields in the anonymous aggregate. */
617 }
618 /* Add this field. */
621 }
624 }
626 /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives
627 a FIELD_DECL or BINFO in T that needs initialization. The
628 TREE_VALUE gives the initializer, or list of initializer arguments.
630 Return a TREE_LIST containing all of the initializations required
631 for T, in the order in which they should be performed. The output
632 list has the same format as the input. */
634 static tree
636 {
637 tree init;
639 tree sorted_inits;
640 tree next_subobject;
645 /* Build up a list of initializations. The TREE_PURPOSE of entry
646 will be the subobject (a FIELD_DECL or BINFO) to initialize. The
647 TREE_VALUE will be the constructor arguments, or NULL if no
648 explicit initialization was provided. */
651 /* Process the virtual bases. */
656 /* Process the direct bases. */
662 /* Process the non-static data members. */
664 /* Reverse the entire list of initializations, so that they are in
665 the order that they will actually be performed. */
668 /* If the user presented the initializers in an order different from
669 that in which they will actually occur, we issue a warning. Keep
670 track of the next subobject which can be explicitly initialized
671 without issuing a warning. */
674 /* Go through the explicit initializers, filling in TREE_PURPOSE in
675 the SORTED_INITS. */
677 {
678 tree subobject;
679 tree subobject_init;
683 /* If the explicit initializers are in sorted order, then
684 SUBOBJECT will be NEXT_SUBOBJECT, or something following
685 it. */
687 subobject_init;
692 /* Issue a warning if the explicit initializer order does not
693 match that which will actually occur.
694 ??? Are all these on the correct lines? */
696 {
700 else
705 else
709 }
711 /* Look again, from the beginning of the list. */
713 {
717 }
719 /* It is invalid to initialize the same subobject more than
720 once. */
722 {
726 subobject);
727 else
730 subobject);
731 }
733 /* Record the initialization. */
736 }
738 /* [class.base.init]
740 If a ctor-initializer specifies more than one mem-initializer for
741 multiple members of the same union (including members of
742 anonymous unions), the ctor-initializer is ill-formed.
744 Here we also splice out uninitialized union members. */
746 {
750 {
751 tree field;
752 tree ctx;
759 /* Skip base classes. */
763 /* If this is an anonymous union with no explicit initializer,
764 splice it out. */
768 /* See if this field is a member of a union, or a member of a
769 structure contained in a union, etc. */
775 /* If this field is not a member of a union, skip it. */
779 /* If this union member has no explicit initializer, splice
780 it out. */
784 /* It's only an error if we have two initializers for the same
785 union type. */
787 {
790 }
792 /* See if LAST_FIELD and the field initialized by INIT are
793 members of the same union. If so, there's a problem,
794 unless they're actually members of the same structure
795 which is itself a member of a union. For example, given:
797 union { struct { int i; int j; }; };
799 initializing both `i' and `j' makes sense. */
802 do
803 {
804 tree last_ctx;
808 {
810 {
814 last_ctx);
817 }
823 }
825 /* If we've reached the outermost class, then we're
826 done. */
831 }
836 next:
839 splice:
842 }
843 }
846 }
848 /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS
849 is a TREE_LIST giving the explicit mem-initializer-list for the
850 constructor. The TREE_PURPOSE of each entry is a subobject (a
851 FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE
852 is a TREE_LIST giving the arguments to the constructor or
853 void_type_node for an empty list of arguments. */
855 void
857 {
858 /* We will already have issued an error message about the fact that
859 the type is incomplete. */
863 /* Sort the mem-initializers into the order in which the
864 initializations should be performed. */
869 /* Initialize base classes. */
872 {
877 {
878 /* If these initializations are taking place in a copy constructor,
879 the base class should probably be explicitly initialized if there
880 is a user-defined constructor in the base class (other than the
881 default constructor, which will be called anyway). */
891 && !(type_has_constexpr_default_constructor
893 {
898 }
899 }
901 /* Initialize the base. */
904 else
905 {
906 tree base_addr;
912 tf_warning_or_error),
913 arguments,
914 LOOKUP_NORMAL,
915 tf_warning_or_error);
917 }
920 }
923 /* Initialize the vptrs. */
926 /* Initialize the data members. */
928 {
932 }
933 }
935 /* Returns the address of the vtable (i.e., the value that should be
936 assigned to the vptr) for BINFO. */
938 static tree
940 {
942 tree vtbl;
945 /* If this is a virtual primary base, then the vtable we want to store
946 is that for the base this is being used as the primary base of. We
947 can't simply skip the initialization, because we may be expanding the
948 inits of a subobject constructor where the virtual base layout
949 can be different. */
953 /* Figure out what vtable BINFO's vtable is based on, and mark it as
954 used. */
958 /* Now compute the address to use when initializing the vptr. */
964 }
966 /* This code sets up the virtual function tables appropriate for
967 the pointer DECL. It is a one-ply initialization.
969 BINFO is the exact type that DECL is supposed to be. In
970 multiple inheritance, this might mean "C's A" if C : A, B. */
972 static void
974 {
976 tree vtt_index;
978 /* Compute the initializer for vptr. */
981 /* We may get this vptr from a VTT, if this is a subobject
982 constructor or subobject destructor. */
985 {
986 tree vtbl2;
987 tree vtt_parm;
989 /* Compute the value to use, when there's a VTT. */
993 vtt_parm,
994 vtt_index);
998 /* The actual initializer is the VTT value only in the subobject
999 constructor. In maybe_clone_body we'll substitute NULL for
1000 the vtt_parm in the case of the non-subobject constructor. */
1005 vtbl2,
1006 vtbl);
1007 }
1009 /* Compute the location of the vtpr. */
1011 tf_warning_or_error),
1015 /* Assign the vtable to the vptr. */
1018 tf_warning_or_error));
1019 }
1021 /* If an exception is thrown in a constructor, those base classes already
1022 constructed must be destroyed. This function creates the cleanup
1023 for BINFO, which has just been constructed. If FLAG is non-NULL,
1024 it is a DECL which is nonzero when this base needs to be
1025 destroyed. */
1027 static void
1029 {
1030 tree expr;
1035 /* Call the destructor. */
1037 base_dtor_identifier,
1038 NULL,
1039 binfo,
1041 tf_warning_or_error);
1049 }
1051 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its
1052 constructor. */
1054 static void
1056 {
1057 tree inner_if_stmt;
1058 tree exp;
1059 tree flag;
1061 /* If there are virtual base classes with destructors, we need to
1062 emit cleanups to destroy them if an exception is thrown during
1063 the construction process. These exception regions (i.e., the
1064 period during which the cleanups must occur) begin from the time
1065 the construction is complete to the end of the function. If we
1066 create a conditional block in which to initialize the
1067 base-classes, then the cleanup region for the virtual base begins
1068 inside a block, and ends outside of that block. This situation
1069 confuses the sjlj exception-handling code. Therefore, we do not
1070 create a single conditional block, but one for each
1071 initialization. (That way the cleanup regions always begin
1072 in the outer block.) We trust the back end to figure out
1073 that the FLAG will not change across initializations, and
1074 avoid doing multiple tests. */
1079 /* Compute the location of the virtual base. If we're
1080 constructing virtual bases, then we must be the most derived
1081 class. Therefore, we don't have to look up the virtual base;
1082 we already know where it is. */
1091 }
1093 /* Find the context in which this FIELD can be initialized. */
1095 static tree
1097 {
1100 /* Anonymous union members can be initialized in the first enclosing
1101 non-anonymous union context. */
1105 }
1107 /* Function to give error message if member initialization specification
1108 is erroneous. FIELD is the member we decided to initialize.
1109 TYPE is the type for which the initialization is being performed.
1110 FIELD must be a member of TYPE.
1112 MEMBER_NAME is the name of the member. */
1114 static int
1116 {
1120 {
1122 member_name);
1124 }
1126 {
1129 field);
1131 }
1133 {
1137 }
1139 {
1141 member_name);
1143 }
1146 }
1148 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it
1149 is a _TYPE node or TYPE_DECL which names a base for that type.
1150 Check the validity of NAME, and return either the base _TYPE, base
1151 binfo, or the FIELD_DECL of the member. If NAME is invalid, return
1152 NULL_TREE and issue a diagnostic.
1154 An old style unnamed direct single base construction is permitted,
1155 where NAME is NULL. */
1157 tree
1159 {
1160 tree basetype;
1161 tree field;
1167 {
1168 /* This is an obsolete unnamed base class initializer. The
1169 parser will already have warned about its use. */
1171 {
1174 current_class_type);
1177 basetype = BINFO_TYPE
1182 current_class_type);
1184 }
1185 }
1187 {
1190 }
1193 else
1197 {
1198 tree class_binfo;
1199 tree direct_binfo;
1200 tree virtual_binfo;
1210 /* Look for a direct base. */
1215 /* Look for a virtual base -- unless the direct base is itself
1216 virtual. */
1220 /* [class.base.init]
1222 If a mem-initializer-id is ambiguous because it designates
1223 both a direct non-virtual base class and an inherited virtual
1224 base class, the mem-initializer is ill-formed. */
1226 {
1228 basetype);
1230 }
1233 {
1237 else
1241 }
1244 }
1245 else
1246 {
1249 else
1254 }
1257 }
1259 /* This is like `expand_member_init', only it stores one aggregate
1260 value into another.
1262 INIT comes in two flavors: it is either a value which
1263 is to be stored in EXP, or it is a parameter list
1264 to go to a constructor, which will operate on EXP.
1265 If INIT is not a parameter list for a constructor, then set
1266 LOOKUP_ONLYCONVERTING.
1267 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1268 the initializer, if FLAGS is 0, then it is the (init) form.
1269 If `init' is a CONSTRUCTOR, then we emit a warning message,
1270 explaining that such initializations are invalid.
1272 If INIT resolves to a CALL_EXPR which happens to return
1273 something of the type we are looking for, then we know
1274 that we can safely use that call to perform the
1275 initialization.
1277 The virtual function table pointer cannot be set up here, because
1278 we do not really know its type.
1280 This never calls operator=().
1282 When initializing, nothing is CONST.
1284 A default copy constructor may have to be used to perform the
1285 initialization.
1287 A constructor or a conversion operator may have to be used to
1288 perform the initialization, but not both, as it would be ambiguous. */
1290 tree
1292 {
1293 tree stmt_expr;
1294 tree compound_stmt;
1313 {
1314 tree itype;
1316 /* An array may not be initialized use the parenthesized
1317 initialization form -- unless the initializer is "()". */
1319 {
1323 }
1324 /* Must arrange to initialize each element of EXP
1325 from elements of INIT. */
1335 complain);
1342 }
1345 /* Just know that we've seen something for this node. */
1359 }
1361 static void
1363 tsubst_flags_t complain)
1364 {
1366 tree ctor_name;
1368 /* It fails because there may not be a constructor which takes
1369 its own type as the first (or only parameter), but which does
1370 take other types via a conversion. So, if the thing initializing
1371 the expression is a unit element of type X, first try X(X&),
1372 followed by initialization by X. If neither of these work
1373 out, then look hard. */
1374 tree rval;
1379 {
1380 /* A brace-enclosed initializer for an aggregate. In C++0x this can
1381 happen for direct-initialization, too. */
1387 }
1391 {
1392 /* Base subobjects should only get direct-initialization. */
1396 /* Do nothing. We hit this in two cases: Reference initialization,
1397 where we aren't initializing a real variable, so we don't want
1398 to run a new constructor; and catching an exception, where we
1399 have already built up the constructor call so we could wrap it
1401 else
1405 /* We need to protect the initialization of a catch parm with a
1406 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
1407 around the TARGET_EXPR for the copy constructor. See
1408 initialize_handler_parm. */
1409 {
1413 }
1414 else
1419 }
1424 {
1428 }
1429 else
1434 else
1438 complain);
1445 }
1447 /* This function is responsible for initializing EXP with INIT
1448 (if any).
1450 BINFO is the binfo of the type for who we are performing the
1451 initialization. For example, if W is a virtual base class of A and B,
1452 and C : A, B.
1453 If we are initializing B, then W must contain B's W vtable, whereas
1454 were we initializing C, W must contain C's W vtable.
1456 TRUE_EXP is nonzero if it is the true expression being initialized.
1457 In this case, it may be EXP, or may just contain EXP. The reason we
1458 need this is because if EXP is a base element of TRUE_EXP, we
1459 don't necessarily know by looking at EXP where its virtual
1460 baseclass fields should really be pointing. But we do know
1461 from TRUE_EXP. In constructors, we don't know anything about
1462 the value being initialized.
1464 FLAGS is just passed to `build_new_method_call'. See that function
1465 for its description. */
1467 static void
1469 tsubst_flags_t complain)
1470 {
1476 /* Use a function returning the desired type to initialize EXP for us.
1477 If the function is a constructor, and its first argument is
1478 NULL_TREE, know that it was meant for us--just slide exp on
1479 in and expand the constructor. Constructors now come
1480 as TARGET_EXPRs. */
1484 {
1485 /* If store_init_value returns NULL_TREE, the INIT has been
1486 recorded as the DECL_INITIAL for EXP. That means there's
1487 nothing more we have to do. */
1492 }
1494 /* If an explicit -- but empty -- initializer list was present,
1495 that's value-initialization. */
1497 {
1498 /* If there's a user-provided constructor, we just call that. */
1501 /* If there isn't, but we still need to call the constructor,
1502 zero out the object first. */
1504 {
1508 /* And then call the constructor. */
1509 }
1510 /* If we don't need to mess with the constructor at all,
1511 then just zero out the object and we're done. */
1512 else
1513 {
1518 }
1520 }
1522 /* We know that expand_default_init can handle everything we want
1523 at this point. */
1525 }
1527 /* Report an error if TYPE is not a user-defined, class type. If
1528 OR_ELSE is nonzero, give an error message. */
1530 int
1532 {
1537 {
1541 }
1543 }
1545 tree
1547 {
1553 else
1555 }
1557 /* Build a reference to a member of an aggregate. This is not a C++
1558 `&', but really something which can have its address taken, and
1559 then act as a pointer to member, for example TYPE :: FIELD can have
1560 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if
1561 this expression is the operand of "&".
1563 @@ Prints out lousy diagnostics for operator <typename>
1564 @@ fields.
1566 @@ This function should be rewritten and placed in search.c. */
1568 tree
1570 {
1571 tree decl;
1574 /* class templates can come in as TEMPLATE_DECLs here. */
1587 /* Callers should call mark_used before this point. */
1592 {
1595 }
1597 /* Entities other than non-static members need no further
1598 processing. */
1605 {
1608 }
1610 /* Set up BASEBINFO for member lookup. */
1613 /* A lot of this logic is now handled in lookup_member. */
1615 {
1616 /* Go from the TREE_BASELINK to the member function info. */
1620 {
1621 /* Get rid of a potential OVERLOAD around it. */
1624 /* Unique functions are handled easily. */
1626 /* For non-static member of base class, we need a special rule
1627 for access checking [class.protected]:
1629 If the access is to form a pointer to member, the
1630 nested-name-specifier shall name the derived class
1631 (or any class derived from that class). */
1635 else
1641 }
1642 else
1644 }
1646 /* We need additional test besides the one in
1647 check_accessibility_of_qualified_id in case it is
1648 a pointer to non-static member. */
1652 {
1653 /* If MEMBER is non-static, then the program has fallen afoul of
1654 [expr.prim]:
1656 An id-expression that denotes a nonstatic data member or
1657 nonstatic member function of a class can only be used:
1659 -- as part of a class member access (_expr.ref_) in which the
1660 object-expression refers to the member's class or a class
1661 derived from that class, or
1663 -- to form a pointer to member (_expr.unary.op_), or
1665 -- in the body of a nonstatic member function of that class or
1666 of a class derived from that class (_class.mfct.nonstatic_), or
1668 -- in a mem-initializer for a constructor for that class or for
1669 a class derived from that class (_class.base.init_). */
1671 {
1672 /* Build a representation of the qualified name suitable
1673 for use as the operand to "&" -- even though the "&" is
1674 not actually present. */
1676 /* In Microsoft mode, treat a non-static member function as if
1677 it were a pointer-to-member. */
1679 {
1682 }
1686 }
1688 {
1691 }
1693 }
1698 }
1700 /* If DECL is a scalar enumeration constant or variable with a
1701 constant initializer, return the initializer (or, its initializers,
1702 recursively); otherwise, return DECL. If INTEGRAL_P, the
1703 initializer is only returned if DECL is an integral
1704 constant-expression. */
1706 static tree
1708 {
1710 || (integral_p
1714 {
1715 tree init;
1716 /* Static data members in template classes may have
1717 non-dependent initializers. References to such non-static
1718 data members are not value-dependent, so we must retrieve the
1719 initializer here. The DECL_INITIAL will have the right type,
1720 but will not have been folded because that would prevent us
1721 from performing all appropriate semantic checks at
1722 instantiation time. */
1727 {
1731 }
1732 else
1733 {
1734 /* If DECL is a static data member in a template
1735 specialization, we must instantiate it here. The
1736 initializer for the static data member is not processed
1737 until needed; we need it now. */
1740 }
1742 {
1744 /* Treat the error as a constant to avoid cascading errors on
1745 excessively recursive template instantiation (c++/9335). */
1747 else
1749 }
1750 /* Initializers in templates are generally expanded during
1751 instantiation, so before that for const int i(2)
1752 INIT is a TREE_LIST with the actual initializer as
1753 TREE_VALUE. */
1755 && init
1761 || (integral_p
1764 /* Do not return an aggregate constant (of which
1765 string literals are a special case), as we do not
1766 want to make inadvertent copies of such entities,
1767 and we must be sure that their addresses are the
1768 same everywhere. */
1773 }
1775 }
1777 /* If DECL is a CONST_DECL, or a constant VAR_DECL initialized by
1778 constant of integral or enumeration type, then return that value.
1779 These are those variables permitted in constant expressions by
1780 [5.19/1]. */
1782 tree
1784 {
1786 }
1788 /* A more relaxed version of integral_constant_value, used by the
1789 common C/C++ code and by the C++ front end for optimization
1790 purposes. */
1792 tree
1794 {
1797 }
1798 \f
1799 /* Common subroutines of build_new and build_vec_delete. */
1801 /* Call the global __builtin_delete to delete ADDR. */
1803 static tree
1805 {
1808 }
1809 \f
1810 /* Build and return a NEW_EXPR. If NELTS is non-NULL, TYPE[NELTS] is
1811 the type of the object being allocated; otherwise, it's just TYPE.
1812 INIT is the initializer, if any. USE_GLOBAL_NEW is true if the
1813 user explicitly wrote "::operator new". PLACEMENT, if non-NULL, is
1814 a vector of arguments to be provided as arguments to a placement
1815 new operator. This routine performs no semantic checks; it just
1816 creates and returns a NEW_EXPR. */
1818 static tree
1821 {
1822 tree init_list;
1823 tree new_expr;
1825 /* If INIT is NULL, the we want to store NULL_TREE in the NEW_EXPR.
1826 If INIT is not NULL, then we want to store VOID_ZERO_NODE. This
1827 permits us to distinguish the case of a missing initializer "new
1828 int" from an empty initializer "new int()". */
1833 else
1838 init_list);
1843 }
1845 /* Diagnose uninitialized const members or reference members of type
1846 TYPE. USING_NEW is used to disambiguate the diagnostic between a
1847 new expression without a new-initializer and a declaration. Returns
1848 the error count. */
1850 static int
1853 {
1854 tree field;
1861 {
1862 tree field_type;
1870 {
1873 {
1877 else
1881 }
1882 }
1885 {
1888 {
1892 else
1896 }
1897 }
1900 error_count
1903 }
1905 }
1907 int
1909 {
1911 }
1913 /* Generate code for a new-expression, including calling the "operator
1914 new" function, initializing the object, and, if an exception occurs
1915 during construction, cleaning up. The arguments are as for
1916 build_raw_new_expr. This may change PLACEMENT and INIT. */
1918 static tree
1921 tsubst_flags_t complain)
1922 {
1924 /* True iff this is a call to "operator new[]" instead of just
1925 "operator new". */
1927 /* If ARRAY_P is true, the element type of the array. This is never
1928 an ARRAY_TYPE; for something like "new int[3][4]", the
1929 ELT_TYPE is "int". If ARRAY_P is false, this is the same type as
1930 TYPE. */
1931 tree elt_type;
1932 /* The type of the new-expression. (This type is always a pointer
1933 type.) */
1934 tree pointer_type;
1935 tree non_const_pointer_type;
1938 /* The address returned by the call to "operator new". This node is
1939 a VAR_DECL and is therefore reusable. */
1940 tree alloc_node;
1941 tree alloc_fn;
1945 /* If non-NULL, the number of extra bytes to allocate at the
1946 beginning of the storage allocated for an array-new expression in
1947 order to store the number of elements. */
1949 tree placement_first;
1951 /* True if the function we are calling is a placement allocation
1952 function. */
1954 /* True if the storage must be initialized, either by a constructor
1955 or due to an explicit new-initializer. */
1957 /* The address of the thing allocated, not including any cookie. In
1958 particular, if an array cookie is in use, DATA_ADDR is the
1959 address of the first array element. This node is a VAR_DECL, and
1960 is therefore reusable. */
1961 tree data_addr;
1965 {
1968 }
1970 {
1975 }
1977 /* If our base type is an array, then make sure we know how many elements
1978 it has. */
1985 complain);
1988 {
1992 }
2000 {
2002 /* A program that calls for default-initialization [...] of an
2003 entity of reference type is ill-formed. */
2007 /* A new-expression that creates an object of type T initializes
2008 that object as follows:
2009 - If the new-initializer is omitted:
2010 -- If T is a (possibly cv-qualified) non-POD class type
2011 (or array thereof), the object is default-initialized (8.5).
2012 [...]
2013 -- Otherwise, the object created has indeterminate
2014 value. If T is a const-qualified type, or a (possibly
2015 cv-qualified) POD class type (or array thereof)
2016 containing (directly or indirectly) a member of
2017 const-qualified type, the program is ill-formed; */
2027 }
2031 {
2035 }
2043 /* If PLACEMENT is a single simple pointer type not passed by
2044 reference, prepare to capture it in a temporary variable. Do
2045 this now, since PLACEMENT will change in the calls below. */
2052 /* Allocate the object. */
2054 {
2055 tree class_addr;
2065 {
2069 }
2071 {
2075 }
2080 }
2082 {
2085 }
2086 else
2087 {
2088 tree fnname;
2089 tree fns;
2095 && (array_p
2098 {
2099 /* Use a class-specific operator new. */
2100 /* If a cookie is required, add some extra space. */
2102 {
2105 }
2106 /* Create the argument list. */
2108 /* Do name-lookup to find the appropriate operator. */
2111 {
2115 }
2117 {
2119 {
2122 }
2124 }
2128 LOOKUP_NORMAL,
2130 complain);
2131 }
2132 else
2133 {
2134 /* Use a global operator new. */
2135 /* See if a cookie might be required. */
2138 else
2144 }
2145 }
2152 /* If we found a simple case of PLACEMENT_EXPR above, then copy it
2153 into a temporary variable. */
2160 {
2165 {
2169 }
2170 }
2172 /* In the simple case, we can stop now. */
2177 /* Store the result of the allocation call in a variable so that we can
2178 use it more than once. */
2182 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */
2186 /* Now, check to see if this function is actually a placement
2187 allocation function. This can happen even when PLACEMENT is NULL
2188 because we might have something like:
2190 struct S { void* operator new (size_t, int i = 0); };
2192 A call to `new S' will get this allocation function, even though
2193 there is no explicit placement argument. If there is more than
2194 one argument, or there are variable arguments, then this is a
2195 placement allocation function. */
2196 placement_allocation_fn_p
2200 /* Preevaluate the placement args so that we don't reevaluate them for a
2201 placement delete. */
2203 {
2204 tree inits;
2208 alloc_expr);
2209 }
2211 /* unless an allocation function is declared with an empty excep-
2212 tion-specification (_except.spec_), throw(), it indicates failure to
2213 allocate storage by throwing a bad_alloc exception (clause _except_,
2214 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2215 cation function is declared with an empty exception-specification,
2216 throw(), it returns null to indicate failure to allocate storage and a
2217 non-null pointer otherwise.
2219 So check for a null exception spec on the op new we just called. */
2225 {
2226 tree cookie;
2227 tree cookie_ptr;
2228 tree size_ptr_type;
2230 /* Adjust so we're pointing to the start of the object. */
2234 /* Store the number of bytes allocated so that we can know how
2235 many elements to destroy later. We use the last sizeof
2236 (size_t) bytes to store the number of elements. */
2248 {
2249 /* Also store the element size. */
2260 }
2261 }
2262 else
2263 {
2266 }
2268 /* Now use a pointer to the type we've actually allocated. */
2270 /* But we want to operate on a non-const version to start with,
2271 since we'll be modifying the elements. */
2272 non_const_pointer_type = build_pointer_type
2276 /* Any further uses of alloc_node will want this type, too. */
2279 /* Now initialize the allocated object. Note that we preevaluate the
2280 initialization expression, apart from the actual constructor call or
2281 assignment--we do this because we want to delay the allocation as long
2282 as possible in order to minimize the size of the exception region for
2283 placement delete. */
2285 {
2290 {
2293 }
2296 {
2301 {
2306 else
2307 {
2312 }
2315 }
2317 {
2320 else
2323 }
2324 init_expr
2328 integer_one_node,
2329 complain),
2330 vecinit,
2331 explicit_value_init_p,
2333 complain);
2335 /* An array initialization is stable because the initialization
2336 of each element is a full-expression, so the temporaries don't
2337 leak out. */
2339 }
2340 else
2341 {
2346 {
2348 complete_ctor_identifier,
2350 LOOKUP_NORMAL,
2351 complain);
2352 }
2354 {
2356 /* Don't worry about it, we'll handle this properly at
2358 else
2359 {
2360 /* Something like `new int()'. */
2365 }
2366 }
2367 else
2368 {
2369 tree ie;
2371 /* We are processing something like `new int (10)', which
2372 means allocate an int, and initialize it with 10. */
2376 complain);
2377 }
2379 }
2384 /* If any part of the object initialization terminates by throwing an
2385 exception and a suitable deallocation function can be found, the
2386 deallocation function is called to free the memory in which the
2387 object was being constructed, after which the exception continues
2388 to propagate in the context of the new-expression. If no
2389 unambiguous matching deallocation function can be found,
2390 propagating the exception does not cause the object's memory to be
2391 freed. */
2393 {
2395 tree cleanup;
2397 /* The Standard is unclear here, but the right thing to do
2398 is to use the same method for finding deallocation
2399 functions that we use for finding allocation functions. */
2400 cleanup = (build_op_delete_call
2402 alloc_node,
2403 size,
2404 globally_qualified_p,
2406 alloc_fn));
2411 /* This is much simpler if we were able to preevaluate all of
2412 the arguments to the constructor call. */
2413 {
2414 /* CLEANUP is compiler-generated, so no diagnostics. */
2418 /* Likewise, this try-catch is compiler-generated. */
2420 }
2421 else
2422 /* Ack! First we allocate the memory. Then we set our sentry
2423 variable to true, and expand a cleanup that deletes the
2424 memory if sentry is true. Then we run the constructor, and
2425 finally clear the sentry.
2427 We need to do this because we allocate the space first, so
2428 if there are any temporaries with cleanups in the
2429 constructor args and we weren't able to preevaluate them, we
2430 need this EH region to extend until end of full-expression
2431 to preserve nesting. */
2432 {
2440 /* CLEANUP is compiler-generated, so no diagnostics. */
2450 init_expr
2453 end));
2454 /* Likewise, this is compiler-generated. */
2456 }
2457 }
2458 }
2459 else
2462 /* Now build up the return value in reverse order. */
2472 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
2473 and return the call (which doesn't need to be adjusted). */
2475 else
2476 {
2478 {
2481 integer_zero_node,
2482 complain);
2484 complain);
2485 }
2487 /* Perform the allocation before anything else, so that ALLOC_NODE
2488 has been initialized before we start using it. */
2490 }
2495 /* A new-expression is never an lvalue. */
2499 }
2501 /* Generate a representation for a C++ "new" expression. *PLACEMENT
2502 is a vector of placement-new arguments (or NULL if none). If NELTS
2503 is NULL, TYPE is the type of the storage to be allocated. If NELTS
2504 is not NULL, then this is an array-new allocation; TYPE is the type
2505 of the elements in the array and NELTS is the number of elements in
2506 the array. *INIT, if non-NULL, is the initializer for the new
2507 object, or an empty vector to indicate an initializer of "()". If
2508 USE_GLOBAL_NEW is true, then the user explicitly wrote "::new"
2509 rather than just "new". This may change PLACEMENT and INIT. */
2511 tree
2514 {
2515 tree rval;
2524 {
2528 }
2531 {
2537 use_global_new);
2547 }
2550 {
2552 {
2555 else
2557 }
2560 }
2562 /* ``A reference cannot be created by the new operator. A reference
2563 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
2564 returned by new.'' ARM 5.3.3 */
2566 {
2569 else
2572 }
2575 {
2579 }
2581 /* The type allocated must be complete. If the new-type-id was
2582 "T[N]" then we are just checking that "T" is complete here, but
2583 that is equivalent, since the value of "N" doesn't matter. */
2592 {
2598 }
2600 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
2605 }
2607 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
2609 tree
2611 {
2617 {
2620 {
2623 }
2625 }
2627 /* Mangle the class$ field. */
2628 {
2629 tree field;
2632 {
2636 }
2638 {
2641 }
2642 }
2646 {
2656 }
2658 }
2659 \f
2660 static tree
2663 {
2664 tree virtual_size;
2668 /* Temporary variables used by the loop. */
2671 /* This is the body of the loop that implements the deletion of a
2672 single element, and moves temp variables to next elements. */
2673 tree body;
2675 /* This is the LOOP_EXPR that governs the deletion of the elements. */
2678 /* This is the thing that governs what to do after the loop has run. */
2681 /* This is the BIND_EXPR which holds the outermost iterator of the
2682 loop. It is convenient to set this variable up and test it before
2683 executing any other code in the loop.
2684 This is also the containing expression returned by this function. */
2686 tree tmp;
2688 /* We should only have 1-D arrays here. */
2694 /* The below is short by the cookie size. */
2703 virtual_size),
2704 tf_warning_or_error);
2713 body = build_compound_expr
2717 tf_warning_or_error));
2718 body = build_compound_expr
2726 no_destructor:
2727 /* If the delete flag is one, or anything else with the low bit set,
2728 delete the storage. */
2730 {
2731 tree base_tbd;
2733 /* The below is short by the cookie size. */
2738 /* no header */
2740 else
2741 {
2742 tree cookie_size;
2745 base_tbd
2748 MINUS_EXPR,
2750 base),
2751 cookie_size,
2752 tf_warning_or_error));
2753 /* True size with header. */
2755 }
2763 }
2767 ;
2770 else
2776 /* Outermost wrapper: If pointer is null, punt. */
2781 integer_zero_node)),
2786 {
2789 }
2792 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
2796 }
2798 /* Create an unnamed variable of the indicated TYPE. */
2800 tree
2802 {
2803 tree decl;
2813 }
2815 /* Create a new temporary variable of the indicated TYPE, initialized
2816 to INIT.
2818 It is not entered into current_binding_level, because that breaks
2819 things when it comes time to do final cleanups (which take place
2820 "outside" the binding contour of the function). */
2822 static tree
2824 {
2825 tree decl;
2831 tf_warning_or_error));
2834 }
2836 /* `build_vec_init' returns tree structure that performs
2837 initialization of a vector of aggregate types.
2839 BASE is a reference to the vector, of ARRAY_TYPE, or a pointer
2840 to the first element, of POINTER_TYPE.
2841 MAXINDEX is the maximum index of the array (one less than the
2842 number of elements). It is only used if BASE is a pointer or
2843 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
2845 INIT is the (possibly NULL) initializer.
2847 If EXPLICIT_VALUE_INIT_P is true, then INIT must be NULL. All
2848 elements in the array are value-initialized.
2850 FROM_ARRAY is 0 if we should init everything with INIT
2851 (i.e., every element initialized from INIT).
2852 FROM_ARRAY is 1 if we should index into INIT in parallel
2853 with initialization of DECL.
2854 FROM_ARRAY is 2 if we should index into INIT in parallel,
2855 but use assignment instead of initialization. */
2857 tree
2861 {
2862 tree rval;
2865 tree iterator;
2866 /* The type of BASE. */
2868 /* The type of an element in the array. */
2870 /* The element type reached after removing all outer array
2871 types. */
2872 tree inner_elt_type;
2873 /* The type of a pointer to an element in the array. */
2874 tree ptype;
2875 tree stmt_expr;
2876 tree compound_stmt;
2894 /* Look through the TARGET_EXPR around a compound literal. */
2907 /* Don't do this if the CONSTRUCTOR might contain something
2908 that might throw and require us to clean up. */
2912 {
2913 /* Do non-default initialization of trivial arrays resulting from
2914 brace-enclosed initializers. In this case, digest_init and
2915 store_constructor will handle the semantics for us. */
2919 }
2923 {
2926 }
2927 else
2930 /* The code we are generating looks like:
2931 ({
2932 T* t1 = (T*) base;
2933 T* rval = t1;
2934 ptrdiff_t iterator = maxindex;
2935 try {
2936 for (; iterator != -1; --iterator) {
2937 ... initialize *t1 ...
2938 ++t1;
2939 }
2940 } catch (...) {
2941 ... destroy elements that were constructed ...
2942 }
2943 rval;
2944 })
2946 We can omit the try and catch blocks if we know that the
2947 initialization will never throw an exception, or if the array
2948 elements do not have destructors. We can omit the loop completely if
2949 the elements of the array do not have constructors.
2951 We actually wrap the entire body of the above in a STMT_EXPR, for
2952 tidiness.
2954 When copying from array to another, when the array elements have
2955 only trivial copy constructors, we should use __builtin_memcpy
2956 rather than generating a loop. That way, we could take advantage
2957 of whatever cleverness the back end has for dealing with copies
2958 of blocks of memory. */
2967 /* If initializing one array from another, initialize element by
2968 element. We rely upon the below calls to do the argument
2969 checking. Evaluate the initializer before entering the try block. */
2971 {
2978 }
2980 /* Protect the entire array initialization so that we can destroy
2981 the partially constructed array if an exception is thrown.
2982 But don't do this if we're assigning. */
2985 {
2987 }
2990 {
2991 /* Do non-default initialization of non-trivial arrays resulting from
2992 brace-enclosed initializers. */
2994 tree elt;
2998 {
3001 num_initialized_elts++;
3006 else
3012 complain));
3014 complain));
3015 }
3017 /* Clear out INIT so that we don't get confused below. */
3019 }
3021 {
3027 {
3031 }
3032 }
3034 /* Now, default-initialize any remaining elements. We don't need to
3035 do that if a) the type does not need constructing, or b) we've
3036 already initialized all the elements.
3038 We do need to keep going if we're copying an array. */
3043 && (num_initialized_elts
3045 {
3046 /* If the ITERATOR is equal to -1, then we don't have to loop;
3047 we've already initialized all the elements. */
3048 tree for_stmt;
3049 tree elt_init;
3050 tree to;
3056 for_stmt);
3058 complain),
3059 for_stmt);
3064 {
3065 tree from;
3068 {
3072 }
3073 else
3078 complain);
3083 complain);
3084 else
3086 }
3088 {
3090 sorry
3094 explicit_value_init_p,
3096 }
3098 {
3102 else
3104 }
3105 else
3106 {
3109 }
3116 complain));
3119 complain));
3122 }
3124 /* Make sure to cleanup any partially constructed elements. */
3127 {
3128 tree e;
3131 complain);
3133 /* Flatten multi-dimensional array since build_vec_delete only
3134 expects one-dimensional array. */
3139 complain);
3146 }
3148 /* The value of the array initialization is the array itself, RVAL
3149 is a pointer to the first element. */
3154 /* Now make the result have the correct type. */
3156 {
3161 }
3165 }
3167 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
3168 build_delete. */
3170 static tree
3172 {
3173 tree name;
3174 tree fn;
3176 {
3191 }
3196 flags,
3198 tf_warning_or_error);
3199 }
3201 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
3202 ADDR is an expression which yields the store to be destroyed.
3203 AUTO_DELETE is the name of the destructor to call, i.e., either
3204 sfk_complete_destructor, sfk_base_destructor, or
3205 sfk_deleting_destructor.
3207 FLAGS is the logical disjunction of zero or more LOOKUP_
3208 flags. See cp-tree.h for more info. */
3210 tree
3213 {
3214 tree expr;
3219 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
3220 set to `error_mark_node' before it gets properly cleaned up. */
3229 {
3236 /* We don't want to warn about delete of void*, only other
3237 incomplete types. Deleting other incomplete types
3238 invokes undefined behavior, but it is not ill-formed, so
3239 compile to something that would even do The Right Thing
3240 (TM) should the type have a trivial dtor and no delete
3241 operator. */
3243 {
3246 {
3249 {
3252 "operator delete will be called, even if they are "
3254 }
3256 }
3257 }
3259 /* Call the builtin operator delete. */
3264 /* Throw away const and volatile on target type of addr. */
3266 }
3268 {
3269 handle_array:
3272 {
3275 }
3278 }
3279 else
3280 {
3281 /* Don't check PROTECT here; leave that decision to the
3282 destructor. If the destructor is accessible, call it,
3283 else report error. */
3289 }
3294 {
3300 use_global_delete,
3303 }
3304 else
3305 {
3308 tree ifexp;
3313 /* For `::delete x', we must not use the deleting destructor
3314 since then we would not be sure to get the global `operator
3315 delete'. */
3317 {
3318 /* We will use ADDR multiple times so we must save it. */
3321 /* Delete the object. */
3323 /* Otherwise, treat this like a complete object destructor
3324 call. */
3326 }
3327 /* If the destructor is non-virtual, there is no deleting
3328 variant. Instead, we must explicitly call the appropriate
3329 `operator delete' here. */
3332 {
3333 /* We will use ADDR multiple times so we must save it. */
3335 /* Build the call. */
3337 addr,
3342 /* Call the complete object destructor. */
3344 }
3347 {
3348 /* Make sure we have access to the member op delete, even though
3349 we'll actually be calling it from the destructor. */
3354 }
3357 tf_warning_or_error),
3362 /* We need to calculate this before the dtor changes the vptr. */
3367 /* Explicit destructor call; don't check for null pointer. */
3369 else
3370 /* Handle deleting a null pointer. */
3373 tf_warning_or_error));
3380 }
3381 }
3383 /* At the beginning of a destructor, push cleanups that will call the
3384 destructors for our base classes and members.
3386 Called from begin_destructor_body. */
3388 void
3390 {
3393 tree member;
3394 tree expr;
3397 /* Run destructors for all virtual baseclasses. */
3399 {
3400 tree cond = (condition_conversion
3402 current_in_charge_parm,
3403 integer_two_node)));
3405 /* The CLASSTYPE_VBASECLASSES vector is in initialization
3406 order, which is also the right order for pushing cleanups. */
3409 {
3411 {
3413 base_dtor_identifier,
3414 NULL,
3415 base_binfo,
3416 (LOOKUP_NORMAL
3418 tf_warning_or_error);
3422 }
3423 }
3424 }
3426 /* Take care of the remaining baseclasses. */
3429 {
3435 base_dtor_identifier,
3438 tf_warning_or_error);
3440 }
3442 /* Don't automatically destroy union members. */
3448 {
3457 {
3458 tree this_member = (build_class_member_access_expr
3462 tf_warning_or_error));
3464 sfk_complete_destructor,
3468 }
3469 }
3470 }
3472 /* Build a C++ vector delete expression.
3473 MAXINDEX is the number of elements to be deleted.
3474 ELT_SIZE is the nominal size of each element in the vector.
3475 BASE is the expression that should yield the store to be deleted.
3476 This function expands (or synthesizes) these calls itself.
3477 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
3479 This also calls delete for virtual baseclasses of elements of the vector.
3481 Update: MAXINDEX is no longer needed. The size can be extracted from the
3482 start of the vector for pointers, and from the type for arrays. We still
3483 use MAXINDEX for arrays because it happens to already have one of the
3484 values we'd have to extract. (We could use MAXINDEX with pointers to
3485 confirm the size, and trap if the numbers differ; not clear that it'd
3486 be worth bothering.) */
3488 tree
3491 {
3492 tree type;
3493 tree rval;
3499 {
3500 /* Step back one from start of vector, and read dimension. */
3501 tree cookie_addr;
3505 {
3508 }
3513 size_ptr_type,
3515 cookie_addr);
3517 }
3519 {
3520 /* Get the total number of things in the array, maxindex is a
3521 bad name. */
3526 {
3529 }
3530 }
3531 else
3532 {
3536 }
3539 use_global_delete);
3544 }