| blob | 9c3dd327fb6c090279818fa0a390e886f400e060 |
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. */
55 /* We are about to generate some complex initialization code.
56 Conceptually, it is all a single expression. However, we may want
57 to include conditionals, loops, and other such statement-level
58 constructs. Therefore, we build the initialization code inside a
59 statement-expression. This function starts such an expression.
60 STMT_EXPR_P and COMPOUND_STMT_P are filled in by this function;
61 pass them back to finish_init_stmts when the expression is
62 complete. */
64 static bool
66 {
73 }
75 /* Finish out the statement-expression begun by the previous call to
76 begin_init_stmts. Returns the statement-expression itself. */
78 static tree
80 {
88 }
90 /* Constructors */
92 /* Called from initialize_vtbl_ptrs via dfs_walk. BINFO is the base
93 which we want to initialize the vtable pointer for, DATA is
94 TREE_LIST whose TREE_VALUE is the this ptr expression. */
96 static tree
98 {
103 {
109 }
112 }
114 /* Initialize all the vtable pointers in the object pointed to by
115 ADDR. */
117 void
119 {
120 tree list;
121 tree type;
126 /* Walk through the hierarchy, initializing the vptr in each base
127 class. We do these in pre-order because we can't find the virtual
128 bases for a class until we've initialized the vtbl for that
129 class. */
131 }
133 /* Return an expression for the zero-initialization of an object with
134 type T. This expression will either be a constant (in the case
135 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
136 aggregate), or NULL (in the case that T does not require
137 initialization). In either case, the value can be used as
138 DECL_INITIAL for a decl of the indicated TYPE; it is a valid static
139 initializer. If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS
140 is the number of elements in the array. If STATIC_STORAGE_P is
141 TRUE, initializers are only generated for entities for which
142 zero-initialization does not simply mean filling the storage with
143 zero bytes. */
145 tree
147 {
150 /* [dcl.init]
152 To zero-initialize an object of type T means:
154 -- if T is a scalar type, the storage is set to the value of zero
155 converted to T.
157 -- if T is a non-union class type, the storage for each nonstatic
158 data member and each base-class subobject is zero-initialized.
160 -- if T is a union type, the storage for its first data member is
161 zero-initialized.
163 -- if T is an array type, the storage for each element is
164 zero-initialized.
166 -- if T is a reference type, no initialization is performed. */
171 ;
173 /* In order to save space, we do not explicitly build initializers
174 for items that do not need them. GCC's semantics are that
175 items with static storage duration that are not otherwise
176 initialized are initialized to zero. */
177 ;
181 {
182 tree field;
185 /* Iterate over the fields, building initializations. */
187 {
191 /* Note that for class types there will be FIELD_DECLs
192 corresponding to base classes as well. Thus, iterating
193 over TYPE_FIELDs will result in correct initialization of
194 all of the subobjects. */
196 {
199 static_storage_p);
202 }
204 /* For unions, only the first field is initialized. */
207 }
209 /* Build a constructor to contain the initializations. */
211 }
213 {
214 tree max_index;
217 /* Iterate over the array elements, building initializations. */
222 else
225 /* If we have an error_mark here, we should just return error mark
226 as we don't know the size of the array yet. */
231 /* A zero-sized array, which is accepted as an extension, will
232 have an upper bound of -1. */
234 {
240 /* If this is a one element array, we just use a regular init. */
243 else
245 max_index);
249 static_storage_p);
250 }
252 /* Build a constructor to contain the initializations. */
254 }
257 else
260 /* In all cases, the initializer is a constant. */
265 }
267 /* Return a suitable initializer for value-initializing an object of type
268 TYPE, as described in [dcl.init]. */
270 tree
272 {
273 /* [dcl.init]
275 To value-initialize an object of type T means:
277 - if T is a class type (clause 9) with a user-provided constructor
278 (12.1), then the default constructor for T is called (and the
279 initialization is ill-formed if T has no accessible default
280 constructor);
282 - if T is a non-union class type without a user-provided constructor,
283 then every non-static data member and base-class component of T is
284 value-initialized;92)
286 - if T is an array type, then each element is value-initialized;
288 - otherwise, the object is zero-initialized.
290 A program that calls for default-initialization or
291 value-initialization of an entity of reference type is ill-formed.
293 92) Value-initialization for such a class object may be implemented by
294 zero-initializing the object and then calling the default
295 constructor. */
297 /* The AGGR_INIT_EXPR tweaking below breaks in templates. */
301 {
303 return build_aggr_init_expr
307 complain));
309 {
310 /* This is a class that needs constructing, but doesn't have
311 a user-provided constructor. So we need to zero-initialize
312 the object and then call the implicitly defined ctor.
313 This will be handled in simplify_aggr_init_expr. */
314 tree ctor = build_special_member_call
318 {
321 }
323 }
324 }
326 }
328 /* Like build_value_init, but don't call the constructor for TYPE. Used
329 for base initializers. */
331 tree
333 {
335 {
339 {
340 tree field;
343 /* Iterate over the fields, building initializations. */
345 {
354 {
357 else
359 }
361 /* We could skip vfields and fields of types with
362 user-defined constructors, but I think that won't improve
363 performance at all; it should be simpler in general just
364 to zero out the entire object than try to only zero the
365 bits that actually need it. */
367 /* Note that for class types there will be FIELD_DECLs
368 corresponding to base classes as well. Thus, iterating
369 over TYPE_FIELDs will result in correct initialization of
370 all of the subobjects. */
375 }
377 /* Build a constructor to contain the zero- initializations. */
379 }
380 }
382 {
385 /* Iterate over the array elements, building initializations. */
388 /* If we have an error_mark here, we should just return error mark
389 as we don't know the size of the array yet. */
391 {
394 }
397 /* A zero-sized array, which is accepted as an extension, will
398 have an upper bound of -1. */
400 {
406 /* If this is a one element array, we just use a regular init. */
409 else
411 max_index);
415 /* The gimplifier can't deal with a RANGE_EXPR of TARGET_EXPRs. */
418 }
420 /* Build a constructor to contain the initializations. */
422 }
425 }
427 /* Initialize MEMBER, a FIELD_DECL, with INIT, a TREE_LIST of
428 arguments. If TREE_LIST is void_type_node, an empty initializer
429 list was given; if NULL_TREE no initializer was given. */
431 static void
433 {
434 tree decl;
437 /* Effective C++ rule 12 requires that all data members be
438 initialized. */
442 member);
444 /* Get an lvalue for the data member. */
448 tf_warning_or_error);
453 {
454 /* mem() means value-initialization. */
456 {
460 }
461 else
462 {
466 member);
467 else
468 {
472 }
473 }
474 }
475 /* Deal with this here, as we will get confused if we try to call the
476 assignment op for an anonymous union. This can happen in a
477 synthesized copy constructor. */
479 {
481 {
484 }
485 }
487 {
489 {
491 {
494 }
498 {
502 }
503 else
505 }
506 else
507 {
514 /* TYPE_NEEDS_CONSTRUCTING can be set just because we have a
515 vtable; still give this diagnostic. */
520 tf_warning_or_error));
521 }
522 }
523 else
524 {
526 {
527 tree core_type;
528 /* member traversal: note it leaves init NULL */
532 member);
540 {
543 member);
545 }
554 }
556 /* There was an explicit member initialization. Do some work
557 in that case. */
559 tf_warning_or_error);
563 tf_warning_or_error));
564 }
567 {
568 tree expr;
573 tf_warning_or_error);
579 }
580 }
582 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
583 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
585 static tree
587 {
588 tree fields;
592 /* Note whether or not T is a union. */
597 {
598 tree fieldtype;
600 /* Skip CONST_DECLs for enumeration constants and so forth. */
605 /* Keep track of whether or not any fields are unions. */
609 /* For an anonymous struct or union, we must recursively
610 consider the fields of the anonymous type. They can be
611 directly initialized from the constructor. */
613 {
614 /* Add this field itself. Synthesized copy constructors
615 initialize the entire aggregate. */
617 /* And now add the fields in the anonymous aggregate. */
619 }
620 /* Add this field. */
623 }
626 }
628 /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives
629 a FIELD_DECL or BINFO in T that needs initialization. The
630 TREE_VALUE gives the initializer, or list of initializer arguments.
632 Return a TREE_LIST containing all of the initializations required
633 for T, in the order in which they should be performed. The output
634 list has the same format as the input. */
636 static tree
638 {
639 tree init;
641 tree sorted_inits;
642 tree next_subobject;
647 /* Build up a list of initializations. The TREE_PURPOSE of entry
648 will be the subobject (a FIELD_DECL or BINFO) to initialize. The
649 TREE_VALUE will be the constructor arguments, or NULL if no
650 explicit initialization was provided. */
653 /* Process the virtual bases. */
658 /* Process the direct bases. */
664 /* Process the non-static data members. */
666 /* Reverse the entire list of initializations, so that they are in
667 the order that they will actually be performed. */
670 /* If the user presented the initializers in an order different from
671 that in which they will actually occur, we issue a warning. Keep
672 track of the next subobject which can be explicitly initialized
673 without issuing a warning. */
676 /* Go through the explicit initializers, filling in TREE_PURPOSE in
677 the SORTED_INITS. */
679 {
680 tree subobject;
681 tree subobject_init;
685 /* If the explicit initializers are in sorted order, then
686 SUBOBJECT will be NEXT_SUBOBJECT, or something following
687 it. */
689 subobject_init;
694 /* Issue a warning if the explicit initializer order does not
695 match that which will actually occur.
696 ??? Are all these on the correct lines? */
698 {
702 else
707 else
711 }
713 /* Look again, from the beginning of the list. */
715 {
719 }
721 /* It is invalid to initialize the same subobject more than
722 once. */
724 {
728 subobject);
729 else
732 subobject);
733 }
735 /* Record the initialization. */
738 }
740 /* [class.base.init]
742 If a ctor-initializer specifies more than one mem-initializer for
743 multiple members of the same union (including members of
744 anonymous unions), the ctor-initializer is ill-formed.
746 Here we also splice out uninitialized union members. */
748 {
752 {
753 tree field;
754 tree ctx;
761 /* Skip base classes. */
765 /* If this is an anonymous union with no explicit initializer,
766 splice it out. */
770 /* See if this field is a member of a union, or a member of a
771 structure contained in a union, etc. */
777 /* If this field is not a member of a union, skip it. */
781 /* If this union member has no explicit initializer, splice
782 it out. */
786 /* It's only an error if we have two initializers for the same
787 union type. */
789 {
792 }
794 /* See if LAST_FIELD and the field initialized by INIT are
795 members of the same union. If so, there's a problem,
796 unless they're actually members of the same structure
797 which is itself a member of a union. For example, given:
799 union { struct { int i; int j; }; };
801 initializing both `i' and `j' makes sense. */
804 do
805 {
806 tree last_ctx;
810 {
812 {
816 last_ctx);
819 }
825 }
827 /* If we've reached the outermost class, then we're
828 done. */
833 }
838 next:
841 splice:
844 }
845 }
848 }
850 /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS
851 is a TREE_LIST giving the explicit mem-initializer-list for the
852 constructor. The TREE_PURPOSE of each entry is a subobject (a
853 FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE
854 is a TREE_LIST giving the arguments to the constructor or
855 void_type_node for an empty list of arguments. */
857 void
859 {
862 /* We will already have issued an error message about the fact that
863 the type is incomplete. */
870 /* Sort the mem-initializers into the order in which the
871 initializations should be performed. */
876 /* Initialize base classes. */
879 {
884 {
885 /* If these initializations are taking place in a copy constructor,
886 the base class should probably be explicitly initialized if there
887 is a user-defined constructor in the base class (other than the
888 default constructor, which will be called anyway). */
898 && !(type_has_constexpr_default_constructor
900 {
905 }
906 }
908 /* Initialize the base. */
911 else
912 {
913 tree base_addr;
919 tf_warning_or_error),
920 arguments,
921 flags,
922 tf_warning_or_error);
924 }
927 }
930 /* Initialize the vptrs. */
933 /* Initialize the data members. */
935 {
939 }
940 }
942 /* Returns the address of the vtable (i.e., the value that should be
943 assigned to the vptr) for BINFO. */
945 static tree
947 {
949 tree vtbl;
952 /* If this is a virtual primary base, then the vtable we want to store
953 is that for the base this is being used as the primary base of. We
954 can't simply skip the initialization, because we may be expanding the
955 inits of a subobject constructor where the virtual base layout
956 can be different. */
960 /* Figure out what vtable BINFO's vtable is based on, and mark it as
961 used. */
965 /* Now compute the address to use when initializing the vptr. */
971 }
973 /* This code sets up the virtual function tables appropriate for
974 the pointer DECL. It is a one-ply initialization.
976 BINFO is the exact type that DECL is supposed to be. In
977 multiple inheritance, this might mean "C's A" if C : A, B. */
979 static void
981 {
983 tree vtt_index;
985 /* Compute the initializer for vptr. */
988 /* We may get this vptr from a VTT, if this is a subobject
989 constructor or subobject destructor. */
992 {
993 tree vtbl2;
994 tree vtt_parm;
996 /* Compute the value to use, when there's a VTT. */
1000 vtt_parm,
1001 vtt_index);
1005 /* The actual initializer is the VTT value only in the subobject
1006 constructor. In maybe_clone_body we'll substitute NULL for
1007 the vtt_parm in the case of the non-subobject constructor. */
1012 vtbl2,
1013 vtbl);
1014 }
1016 /* Compute the location of the vtpr. */
1018 tf_warning_or_error),
1022 /* Assign the vtable to the vptr. */
1025 tf_warning_or_error));
1026 }
1028 /* If an exception is thrown in a constructor, those base classes already
1029 constructed must be destroyed. This function creates the cleanup
1030 for BINFO, which has just been constructed. If FLAG is non-NULL,
1031 it is a DECL which is nonzero when this base needs to be
1032 destroyed. */
1034 static void
1036 {
1037 tree expr;
1042 /* Call the destructor. */
1044 base_dtor_identifier,
1045 NULL,
1046 binfo,
1048 tf_warning_or_error);
1056 }
1058 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its
1059 constructor. */
1061 static void
1063 {
1064 tree inner_if_stmt;
1065 tree exp;
1066 tree flag;
1068 /* If there are virtual base classes with destructors, we need to
1069 emit cleanups to destroy them if an exception is thrown during
1070 the construction process. These exception regions (i.e., the
1071 period during which the cleanups must occur) begin from the time
1072 the construction is complete to the end of the function. If we
1073 create a conditional block in which to initialize the
1074 base-classes, then the cleanup region for the virtual base begins
1075 inside a block, and ends outside of that block. This situation
1076 confuses the sjlj exception-handling code. Therefore, we do not
1077 create a single conditional block, but one for each
1078 initialization. (That way the cleanup regions always begin
1079 in the outer block.) We trust the back end to figure out
1080 that the FLAG will not change across initializations, and
1081 avoid doing multiple tests. */
1086 /* Compute the location of the virtual base. If we're
1087 constructing virtual bases, then we must be the most derived
1088 class. Therefore, we don't have to look up the virtual base;
1089 we already know where it is. */
1098 }
1100 /* Find the context in which this FIELD can be initialized. */
1102 static tree
1104 {
1107 /* Anonymous union members can be initialized in the first enclosing
1108 non-anonymous union context. */
1112 }
1114 /* Function to give error message if member initialization specification
1115 is erroneous. FIELD is the member we decided to initialize.
1116 TYPE is the type for which the initialization is being performed.
1117 FIELD must be a member of TYPE.
1119 MEMBER_NAME is the name of the member. */
1121 static int
1123 {
1127 {
1129 member_name);
1131 }
1133 {
1136 field);
1138 }
1140 {
1144 }
1146 {
1148 member_name);
1150 }
1153 }
1155 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it
1156 is a _TYPE node or TYPE_DECL which names a base for that type.
1157 Check the validity of NAME, and return either the base _TYPE, base
1158 binfo, or the FIELD_DECL of the member. If NAME is invalid, return
1159 NULL_TREE and issue a diagnostic.
1161 An old style unnamed direct single base construction is permitted,
1162 where NAME is NULL. */
1164 tree
1166 {
1167 tree basetype;
1168 tree field;
1174 {
1175 /* This is an obsolete unnamed base class initializer. The
1176 parser will already have warned about its use. */
1178 {
1181 current_class_type);
1184 basetype = BINFO_TYPE
1189 current_class_type);
1191 }
1192 }
1194 {
1197 }
1200 else
1204 {
1205 tree class_binfo;
1206 tree direct_binfo;
1207 tree virtual_binfo;
1217 /* Look for a direct base. */
1222 /* Look for a virtual base -- unless the direct base is itself
1223 virtual. */
1227 /* [class.base.init]
1229 If a mem-initializer-id is ambiguous because it designates
1230 both a direct non-virtual base class and an inherited virtual
1231 base class, the mem-initializer is ill-formed. */
1233 {
1235 basetype);
1237 }
1240 {
1244 else
1248 }
1251 }
1252 else
1253 {
1256 else
1261 }
1264 }
1266 /* This is like `expand_member_init', only it stores one aggregate
1267 value into another.
1269 INIT comes in two flavors: it is either a value which
1270 is to be stored in EXP, or it is a parameter list
1271 to go to a constructor, which will operate on EXP.
1272 If INIT is not a parameter list for a constructor, then set
1273 LOOKUP_ONLYCONVERTING.
1274 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1275 the initializer, if FLAGS is 0, then it is the (init) form.
1276 If `init' is a CONSTRUCTOR, then we emit a warning message,
1277 explaining that such initializations are invalid.
1279 If INIT resolves to a CALL_EXPR which happens to return
1280 something of the type we are looking for, then we know
1281 that we can safely use that call to perform the
1282 initialization.
1284 The virtual function table pointer cannot be set up here, because
1285 we do not really know its type.
1287 This never calls operator=().
1289 When initializing, nothing is CONST.
1291 A default copy constructor may have to be used to perform the
1292 initialization.
1294 A constructor or a conversion operator may have to be used to
1295 perform the initialization, but not both, as it would be ambiguous. */
1297 tree
1299 {
1300 tree stmt_expr;
1301 tree compound_stmt;
1320 {
1321 tree itype;
1323 /* An array may not be initialized use the parenthesized
1324 initialization form -- unless the initializer is "()". */
1326 {
1330 }
1331 /* Must arrange to initialize each element of EXP
1332 from elements of INIT. */
1342 complain);
1349 }
1352 /* Just know that we've seen something for this node. */
1366 }
1368 static void
1370 tsubst_flags_t complain)
1371 {
1373 tree ctor_name;
1375 /* It fails because there may not be a constructor which takes
1376 its own type as the first (or only parameter), but which does
1377 take other types via a conversion. So, if the thing initializing
1378 the expression is a unit element of type X, first try X(X&),
1379 followed by initialization by X. If neither of these work
1380 out, then look hard. */
1381 tree rval;
1386 {
1387 /* A brace-enclosed initializer for an aggregate. In C++0x this can
1388 happen for direct-initialization, too. */
1394 }
1398 {
1399 /* Base subobjects should only get direct-initialization. */
1403 /* Do nothing. We hit this in two cases: Reference initialization,
1404 where we aren't initializing a real variable, so we don't want
1405 to run a new constructor; and catching an exception, where we
1406 have already built up the constructor call so we could wrap it
1408 else
1412 /* We need to protect the initialization of a catch parm with a
1413 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
1414 around the TARGET_EXPR for the copy constructor. See
1415 initialize_handler_parm. */
1416 {
1420 }
1421 else
1426 }
1431 {
1435 }
1436 else
1441 else
1445 complain);
1451 {
1454 {
1458 }
1459 }
1461 /* FIXME put back convert_to_void? */
1464 }
1466 /* This function is responsible for initializing EXP with INIT
1467 (if any).
1469 BINFO is the binfo of the type for who we are performing the
1470 initialization. For example, if W is a virtual base class of A and B,
1471 and C : A, B.
1472 If we are initializing B, then W must contain B's W vtable, whereas
1473 were we initializing C, W must contain C's W vtable.
1475 TRUE_EXP is nonzero if it is the true expression being initialized.
1476 In this case, it may be EXP, or may just contain EXP. The reason we
1477 need this is because if EXP is a base element of TRUE_EXP, we
1478 don't necessarily know by looking at EXP where its virtual
1479 baseclass fields should really be pointing. But we do know
1480 from TRUE_EXP. In constructors, we don't know anything about
1481 the value being initialized.
1483 FLAGS is just passed to `build_new_method_call'. See that function
1484 for its description. */
1486 static void
1488 tsubst_flags_t complain)
1489 {
1495 /* Use a function returning the desired type to initialize EXP for us.
1496 If the function is a constructor, and its first argument is
1497 NULL_TREE, know that it was meant for us--just slide exp on
1498 in and expand the constructor. Constructors now come
1499 as TARGET_EXPRs. */
1503 {
1504 /* If store_init_value returns NULL_TREE, the INIT has been
1505 recorded as the DECL_INITIAL for EXP. That means there's
1506 nothing more we have to do. */
1511 }
1513 /* If an explicit -- but empty -- initializer list was present,
1514 that's value-initialization. */
1516 {
1517 /* If there's a user-provided constructor, we just call that. */
1520 /* If there isn't, but we still need to call the constructor,
1521 zero out the object first. */
1523 {
1527 /* And then call the constructor. */
1528 }
1529 /* If we don't need to mess with the constructor at all,
1530 then just zero out the object and we're done. */
1531 else
1532 {
1537 }
1539 }
1541 /* We know that expand_default_init can handle everything we want
1542 at this point. */
1544 }
1546 /* Report an error if TYPE is not a user-defined, class type. If
1547 OR_ELSE is nonzero, give an error message. */
1549 int
1551 {
1556 {
1560 }
1562 }
1564 tree
1566 {
1572 else
1574 }
1576 /* Build a reference to a member of an aggregate. This is not a C++
1577 `&', but really something which can have its address taken, and
1578 then act as a pointer to member, for example TYPE :: FIELD can have
1579 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if
1580 this expression is the operand of "&".
1582 @@ Prints out lousy diagnostics for operator <typename>
1583 @@ fields.
1585 @@ This function should be rewritten and placed in search.c. */
1587 tree
1589 {
1590 tree decl;
1593 /* class templates can come in as TEMPLATE_DECLs here. */
1606 /* Callers should call mark_used before this point. */
1611 {
1614 }
1616 /* Entities other than non-static members need no further
1617 processing. */
1624 {
1627 }
1629 /* Set up BASEBINFO for member lookup. */
1632 /* A lot of this logic is now handled in lookup_member. */
1634 {
1635 /* Go from the TREE_BASELINK to the member function info. */
1639 {
1640 /* Get rid of a potential OVERLOAD around it. */
1643 /* Unique functions are handled easily. */
1645 /* For non-static member of base class, we need a special rule
1646 for access checking [class.protected]:
1648 If the access is to form a pointer to member, the
1649 nested-name-specifier shall name the derived class
1650 (or any class derived from that class). */
1654 else
1660 }
1661 else
1663 }
1665 /* We need additional test besides the one in
1666 check_accessibility_of_qualified_id in case it is
1667 a pointer to non-static member. */
1671 {
1672 /* If MEMBER is non-static, then the program has fallen afoul of
1673 [expr.prim]:
1675 An id-expression that denotes a nonstatic data member or
1676 nonstatic member function of a class can only be used:
1678 -- as part of a class member access (_expr.ref_) in which the
1679 object-expression refers to the member's class or a class
1680 derived from that class, or
1682 -- to form a pointer to member (_expr.unary.op_), or
1684 -- in the body of a nonstatic member function of that class or
1685 of a class derived from that class (_class.mfct.nonstatic_), or
1687 -- in a mem-initializer for a constructor for that class or for
1688 a class derived from that class (_class.base.init_). */
1690 {
1691 /* Build a representation of the qualified name suitable
1692 for use as the operand to "&" -- even though the "&" is
1693 not actually present. */
1695 /* In Microsoft mode, treat a non-static member function as if
1696 it were a pointer-to-member. */
1698 {
1701 }
1705 }
1707 {
1710 }
1712 }
1717 }
1719 /* If DECL is a scalar enumeration constant or variable with a
1720 constant initializer, return the initializer (or, its initializers,
1721 recursively); otherwise, return DECL. If INTEGRAL_P, the
1722 initializer is only returned if DECL is an integral
1723 constant-expression. */
1725 static tree
1727 {
1729 || (integral_p
1733 {
1734 tree init;
1735 /* If DECL is a static data member in a template
1736 specialization, we must instantiate it here. The
1737 initializer for the static data member is not processed
1738 until needed; we need it now. */
1743 {
1745 /* Treat the error as a constant to avoid cascading errors on
1746 excessively recursive template instantiation (c++/9335). */
1748 else
1750 }
1751 /* Initializers in templates are generally expanded during
1752 instantiation, so before that for const int i(2)
1753 INIT is a TREE_LIST with the actual initializer as
1754 TREE_VALUE. */
1756 && init
1763 || (integral_p
1766 /* Do not return an aggregate constant (of which
1767 string literals are a special case), as we do not
1768 want to make inadvertent copies of such entities,
1769 and we must be sure that their addresses are the
1770 same everywhere. */
1775 }
1777 }
1779 /* If DECL is a CONST_DECL, or a constant VAR_DECL initialized by
1780 constant of integral or enumeration type, then return that value.
1781 These are those variables permitted in constant expressions by
1782 [5.19/1]. */
1784 tree
1786 {
1788 }
1790 /* A more relaxed version of integral_constant_value, used by the
1791 common C/C++ code and by the C++ front end for optimization
1792 purposes. */
1794 tree
1796 {
1799 }
1800 \f
1801 /* Common subroutines of build_new and build_vec_delete. */
1803 /* Call the global __builtin_delete to delete ADDR. */
1805 static tree
1807 {
1810 }
1811 \f
1812 /* Build and return a NEW_EXPR. If NELTS is non-NULL, TYPE[NELTS] is
1813 the type of the object being allocated; otherwise, it's just TYPE.
1814 INIT is the initializer, if any. USE_GLOBAL_NEW is true if the
1815 user explicitly wrote "::operator new". PLACEMENT, if non-NULL, is
1816 a vector of arguments to be provided as arguments to a placement
1817 new operator. This routine performs no semantic checks; it just
1818 creates and returns a NEW_EXPR. */
1820 static tree
1823 {
1824 tree init_list;
1825 tree new_expr;
1827 /* If INIT is NULL, the we want to store NULL_TREE in the NEW_EXPR.
1828 If INIT is not NULL, then we want to store VOID_ZERO_NODE. This
1829 permits us to distinguish the case of a missing initializer "new
1830 int" from an empty initializer "new int()". */
1835 else
1840 init_list);
1845 }
1847 /* Diagnose uninitialized const members or reference members of type
1848 TYPE. USING_NEW is used to disambiguate the diagnostic between a
1849 new expression without a new-initializer and a declaration. Returns
1850 the error count. */
1852 static int
1855 {
1856 tree field;
1863 {
1864 tree field_type;
1872 {
1875 {
1879 else
1883 }
1884 }
1887 {
1890 {
1894 else
1898 }
1899 }
1902 error_count
1905 }
1907 }
1909 int
1911 {
1913 }
1915 /* Generate code for a new-expression, including calling the "operator
1916 new" function, initializing the object, and, if an exception occurs
1917 during construction, cleaning up. The arguments are as for
1918 build_raw_new_expr. This may change PLACEMENT and INIT. */
1920 static tree
1923 tsubst_flags_t complain)
1924 {
1926 /* True iff this is a call to "operator new[]" instead of just
1927 "operator new". */
1929 /* If ARRAY_P is true, the element type of the array. This is never
1930 an ARRAY_TYPE; for something like "new int[3][4]", the
1931 ELT_TYPE is "int". If ARRAY_P is false, this is the same type as
1932 TYPE. */
1933 tree elt_type;
1934 /* The type of the new-expression. (This type is always a pointer
1935 type.) */
1936 tree pointer_type;
1937 tree non_const_pointer_type;
1940 /* The address returned by the call to "operator new". This node is
1941 a VAR_DECL and is therefore reusable. */
1942 tree alloc_node;
1943 tree alloc_fn;
1947 /* If non-NULL, the number of extra bytes to allocate at the
1948 beginning of the storage allocated for an array-new expression in
1949 order to store the number of elements. */
1951 tree placement_first;
1953 /* True if the function we are calling is a placement allocation
1954 function. */
1956 /* True if the storage must be initialized, either by a constructor
1957 or due to an explicit new-initializer. */
1959 /* The address of the thing allocated, not including any cookie. In
1960 particular, if an array cookie is in use, DATA_ADDR is the
1961 address of the first array element. This node is a VAR_DECL, and
1962 is therefore reusable. */
1963 tree data_addr;
1967 {
1970 }
1972 {
1977 }
1979 /* If our base type is an array, then make sure we know how many elements
1980 it has. */
1987 complain);
1990 {
1994 }
2002 {
2004 /* A program that calls for default-initialization [...] of an
2005 entity of reference type is ill-formed. */
2009 /* A new-expression that creates an object of type T initializes
2010 that object as follows:
2011 - If the new-initializer is omitted:
2012 -- If T is a (possibly cv-qualified) non-POD class type
2013 (or array thereof), the object is default-initialized (8.5).
2014 [...]
2015 -- Otherwise, the object created has indeterminate
2016 value. If T is a const-qualified type, or a (possibly
2017 cv-qualified) POD class type (or array thereof)
2018 containing (directly or indirectly) a member of
2019 const-qualified type, the program is ill-formed; */
2029 }
2033 {
2037 }
2045 /* If PLACEMENT is a single simple pointer type not passed by
2046 reference, prepare to capture it in a temporary variable. Do
2047 this now, since PLACEMENT will change in the calls below. */
2054 /* Allocate the object. */
2056 {
2057 tree class_addr;
2067 {
2071 }
2073 {
2077 }
2082 }
2084 {
2087 }
2088 else
2089 {
2090 tree fnname;
2091 tree fns;
2097 && (array_p
2100 {
2101 /* Use a class-specific operator new. */
2102 /* If a cookie is required, add some extra space. */
2104 {
2107 }
2108 /* Create the argument list. */
2110 /* Do name-lookup to find the appropriate operator. */
2113 {
2117 }
2119 {
2121 {
2124 }
2126 }
2130 LOOKUP_NORMAL,
2132 complain);
2133 }
2134 else
2135 {
2136 /* Use a global operator new. */
2137 /* See if a cookie might be required. */
2140 else
2146 }
2147 }
2154 /* If we found a simple case of PLACEMENT_EXPR above, then copy it
2155 into a temporary variable. */
2162 {
2167 {
2171 }
2172 }
2174 /* In the simple case, we can stop now. */
2179 /* Store the result of the allocation call in a variable so that we can
2180 use it more than once. */
2184 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */
2188 /* Now, check to see if this function is actually a placement
2189 allocation function. This can happen even when PLACEMENT is NULL
2190 because we might have something like:
2192 struct S { void* operator new (size_t, int i = 0); };
2194 A call to `new S' will get this allocation function, even though
2195 there is no explicit placement argument. If there is more than
2196 one argument, or there are variable arguments, then this is a
2197 placement allocation function. */
2198 placement_allocation_fn_p
2202 /* Preevaluate the placement args so that we don't reevaluate them for a
2203 placement delete. */
2205 {
2206 tree inits;
2210 alloc_expr);
2211 }
2213 /* unless an allocation function is declared with an empty excep-
2214 tion-specification (_except.spec_), throw(), it indicates failure to
2215 allocate storage by throwing a bad_alloc exception (clause _except_,
2216 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2217 cation function is declared with an empty exception-specification,
2218 throw(), it returns null to indicate failure to allocate storage and a
2219 non-null pointer otherwise.
2221 So check for a null exception spec on the op new we just called. */
2227 {
2228 tree cookie;
2229 tree cookie_ptr;
2230 tree size_ptr_type;
2232 /* Adjust so we're pointing to the start of the object. */
2236 /* Store the number of bytes allocated so that we can know how
2237 many elements to destroy later. We use the last sizeof
2238 (size_t) bytes to store the number of elements. */
2250 {
2251 /* Also store the element size. */
2262 }
2263 }
2264 else
2265 {
2268 }
2270 /* Now use a pointer to the type we've actually allocated. */
2272 /* But we want to operate on a non-const version to start with,
2273 since we'll be modifying the elements. */
2274 non_const_pointer_type = build_pointer_type
2278 /* Any further uses of alloc_node will want this type, too. */
2281 /* Now initialize the allocated object. Note that we preevaluate the
2282 initialization expression, apart from the actual constructor call or
2283 assignment--we do this because we want to delay the allocation as long
2284 as possible in order to minimize the size of the exception region for
2285 placement delete. */
2287 {
2292 {
2295 }
2298 {
2303 {
2308 else
2309 {
2314 }
2317 }
2319 {
2322 else
2325 }
2326 init_expr
2330 integer_one_node,
2331 complain),
2332 vecinit,
2333 explicit_value_init_p,
2335 complain);
2337 /* An array initialization is stable because the initialization
2338 of each element is a full-expression, so the temporaries don't
2339 leak out. */
2341 }
2342 else
2343 {
2348 {
2350 complete_ctor_identifier,
2352 LOOKUP_NORMAL,
2353 complain);
2354 }
2356 {
2358 /* Don't worry about it, we'll handle this properly at
2360 else
2361 {
2362 /* Something like `new int()'. */
2367 }
2368 }
2369 else
2370 {
2371 tree ie;
2373 /* We are processing something like `new int (10)', which
2374 means allocate an int, and initialize it with 10. */
2378 complain);
2379 }
2381 }
2386 /* If any part of the object initialization terminates by throwing an
2387 exception and a suitable deallocation function can be found, the
2388 deallocation function is called to free the memory in which the
2389 object was being constructed, after which the exception continues
2390 to propagate in the context of the new-expression. If no
2391 unambiguous matching deallocation function can be found,
2392 propagating the exception does not cause the object's memory to be
2393 freed. */
2395 {
2397 tree cleanup;
2399 /* The Standard is unclear here, but the right thing to do
2400 is to use the same method for finding deallocation
2401 functions that we use for finding allocation functions. */
2402 cleanup = (build_op_delete_call
2404 alloc_node,
2405 size,
2406 globally_qualified_p,
2408 alloc_fn));
2413 /* This is much simpler if we were able to preevaluate all of
2414 the arguments to the constructor call. */
2415 {
2416 /* CLEANUP is compiler-generated, so no diagnostics. */
2420 /* Likewise, this try-catch is compiler-generated. */
2422 }
2423 else
2424 /* Ack! First we allocate the memory. Then we set our sentry
2425 variable to true, and expand a cleanup that deletes the
2426 memory if sentry is true. Then we run the constructor, and
2427 finally clear the sentry.
2429 We need to do this because we allocate the space first, so
2430 if there are any temporaries with cleanups in the
2431 constructor args and we weren't able to preevaluate them, we
2432 need this EH region to extend until end of full-expression
2433 to preserve nesting. */
2434 {
2442 /* CLEANUP is compiler-generated, so no diagnostics. */
2452 init_expr
2455 end));
2456 /* Likewise, this is compiler-generated. */
2458 }
2459 }
2460 }
2461 else
2464 /* Now build up the return value in reverse order. */
2474 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
2475 and return the call (which doesn't need to be adjusted). */
2477 else
2478 {
2480 {
2483 integer_zero_node,
2484 complain);
2486 complain);
2487 }
2489 /* Perform the allocation before anything else, so that ALLOC_NODE
2490 has been initialized before we start using it. */
2492 }
2497 /* A new-expression is never an lvalue. */
2501 }
2503 /* Generate a representation for a C++ "new" expression. *PLACEMENT
2504 is a vector of placement-new arguments (or NULL if none). If NELTS
2505 is NULL, TYPE is the type of the storage to be allocated. If NELTS
2506 is not NULL, then this is an array-new allocation; TYPE is the type
2507 of the elements in the array and NELTS is the number of elements in
2508 the array. *INIT, if non-NULL, is the initializer for the new
2509 object, or an empty vector to indicate an initializer of "()". If
2510 USE_GLOBAL_NEW is true, then the user explicitly wrote "::new"
2511 rather than just "new". This may change PLACEMENT and INIT. */
2513 tree
2516 {
2517 tree rval;
2526 {
2529 {
2534 }
2535 }
2538 {
2544 use_global_new);
2554 }
2557 {
2559 {
2562 else
2564 }
2567 }
2569 /* ``A reference cannot be created by the new operator. A reference
2570 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
2571 returned by new.'' ARM 5.3.3 */
2573 {
2576 else
2579 }
2582 {
2586 }
2588 /* The type allocated must be complete. If the new-type-id was
2589 "T[N]" then we are just checking that "T" is complete here, but
2590 that is equivalent, since the value of "N" doesn't matter. */
2599 {
2605 }
2607 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
2612 }
2614 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
2616 tree
2618 {
2624 {
2627 {
2630 }
2632 }
2634 /* Mangle the class$ field. */
2635 {
2636 tree field;
2639 {
2643 }
2645 {
2648 }
2649 }
2653 {
2663 }
2665 }
2666 \f
2667 static tree
2670 {
2671 tree virtual_size;
2675 /* Temporary variables used by the loop. */
2678 /* This is the body of the loop that implements the deletion of a
2679 single element, and moves temp variables to next elements. */
2680 tree body;
2682 /* This is the LOOP_EXPR that governs the deletion of the elements. */
2685 /* This is the thing that governs what to do after the loop has run. */
2688 /* This is the BIND_EXPR which holds the outermost iterator of the
2689 loop. It is convenient to set this variable up and test it before
2690 executing any other code in the loop.
2691 This is also the containing expression returned by this function. */
2693 tree tmp;
2695 /* We should only have 1-D arrays here. */
2701 /* The below is short by the cookie size. */
2710 virtual_size),
2711 tf_warning_or_error);
2720 body = build_compound_expr
2724 tf_warning_or_error));
2725 body = build_compound_expr
2733 no_destructor:
2734 /* If the delete flag is one, or anything else with the low bit set,
2735 delete the storage. */
2737 {
2738 tree base_tbd;
2740 /* The below is short by the cookie size. */
2745 /* no header */
2747 else
2748 {
2749 tree cookie_size;
2752 base_tbd
2755 MINUS_EXPR,
2757 base),
2758 cookie_size,
2759 tf_warning_or_error));
2760 /* True size with header. */
2762 }
2770 }
2774 ;
2777 else
2783 /* Outermost wrapper: If pointer is null, punt. */
2788 integer_zero_node)),
2793 {
2796 }
2799 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
2803 }
2805 /* Create an unnamed variable of the indicated TYPE. */
2807 tree
2809 {
2810 tree decl;
2820 }
2822 /* Create a new temporary variable of the indicated TYPE, initialized
2823 to INIT.
2825 It is not entered into current_binding_level, because that breaks
2826 things when it comes time to do final cleanups (which take place
2827 "outside" the binding contour of the function). */
2829 static tree
2831 {
2832 tree decl;
2838 tf_warning_or_error));
2841 }
2843 /* `build_vec_init' returns tree structure that performs
2844 initialization of a vector of aggregate types.
2846 BASE is a reference to the vector, of ARRAY_TYPE, or a pointer
2847 to the first element, of POINTER_TYPE.
2848 MAXINDEX is the maximum index of the array (one less than the
2849 number of elements). It is only used if BASE is a pointer or
2850 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
2852 INIT is the (possibly NULL) initializer.
2854 If EXPLICIT_VALUE_INIT_P is true, then INIT must be NULL. All
2855 elements in the array are value-initialized.
2857 FROM_ARRAY is 0 if we should init everything with INIT
2858 (i.e., every element initialized from INIT).
2859 FROM_ARRAY is 1 if we should index into INIT in parallel
2860 with initialization of DECL.
2861 FROM_ARRAY is 2 if we should index into INIT in parallel,
2862 but use assignment instead of initialization. */
2864 tree
2868 {
2869 tree rval;
2872 tree iterator;
2873 /* The type of BASE. */
2875 /* The type of an element in the array. */
2877 /* The element type reached after removing all outer array
2878 types. */
2879 tree inner_elt_type;
2880 /* The type of a pointer to an element in the array. */
2881 tree ptype;
2882 tree stmt_expr;
2883 tree compound_stmt;
2903 /* Look through the TARGET_EXPR around a compound literal. */
2916 /* Don't do this if the CONSTRUCTOR might contain something
2917 that might throw and require us to clean up. */
2921 {
2922 /* Do non-default initialization of trivial arrays resulting from
2923 brace-enclosed initializers. In this case, digest_init and
2924 store_constructor will handle the semantics for us. */
2928 }
2932 {
2935 }
2936 else
2939 /* The code we are generating looks like:
2940 ({
2941 T* t1 = (T*) base;
2942 T* rval = t1;
2943 ptrdiff_t iterator = maxindex;
2944 try {
2945 for (; iterator != -1; --iterator) {
2946 ... initialize *t1 ...
2947 ++t1;
2948 }
2949 } catch (...) {
2950 ... destroy elements that were constructed ...
2951 }
2952 rval;
2953 })
2955 We can omit the try and catch blocks if we know that the
2956 initialization will never throw an exception, or if the array
2957 elements do not have destructors. We can omit the loop completely if
2958 the elements of the array do not have constructors.
2960 We actually wrap the entire body of the above in a STMT_EXPR, for
2961 tidiness.
2963 When copying from array to another, when the array elements have
2964 only trivial copy constructors, we should use __builtin_memcpy
2965 rather than generating a loop. That way, we could take advantage
2966 of whatever cleverness the back end has for dealing with copies
2967 of blocks of memory. */
2976 /* If initializing one array from another, initialize element by
2977 element. We rely upon the below calls to do the argument
2978 checking. Evaluate the initializer before entering the try block. */
2980 {
2987 }
2989 /* Protect the entire array initialization so that we can destroy
2990 the partially constructed array if an exception is thrown.
2991 But don't do this if we're assigning. */
2994 {
2996 }
2998 /* Maybe pull out constant value when from_array? */
3001 {
3002 /* Do non-default initialization of non-trivial arrays resulting from
3003 brace-enclosed initializers. */
3006 /* Should we try to create a constant initializer? */
3011 /* If we're initializing a static array, we want to do static
3012 initialization of any elements with constant initializers even if
3013 some are non-constant. */
3020 else
3024 {
3026 tree one_init;
3028 num_initialized_elts++;
3033 else
3038 {
3047 {
3051 else
3054 }
3055 else
3056 {
3062 }
3063 }
3070 complain));
3072 complain));
3073 }
3076 {
3081 else
3083 }
3085 /* Clear out INIT so that we don't get confused below. */
3087 }
3089 {
3095 {
3099 }
3100 }
3102 /* Now, default-initialize any remaining elements. We don't need to
3103 do that if a) the type does not need constructing, or b) we've
3104 already initialized all the elements.
3106 We do need to keep going if we're copying an array. */
3111 && (num_initialized_elts
3113 {
3114 /* If the ITERATOR is equal to -1, then we don't have to loop;
3115 we've already initialized all the elements. */
3116 tree for_stmt;
3117 tree elt_init;
3118 tree to;
3124 for_stmt);
3126 complain),
3127 for_stmt);
3132 {
3133 tree from;
3136 {
3140 }
3141 else
3146 complain);
3151 complain);
3152 else
3154 }
3156 {
3158 sorry
3162 explicit_value_init_p,
3164 }
3166 {
3170 else
3172 }
3173 else
3174 {
3177 }
3184 complain));
3187 complain));
3190 }
3192 /* Make sure to cleanup any partially constructed elements. */
3195 {
3196 tree e;
3199 complain);
3201 /* Flatten multi-dimensional array since build_vec_delete only
3202 expects one-dimensional array. */
3207 complain);
3214 }
3216 /* The value of the array initialization is the array itself, RVAL
3217 is a pointer to the first element. */
3222 /* Now make the result have the correct type. */
3224 {
3229 }
3236 }
3238 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
3239 build_delete. */
3241 static tree
3243 {
3244 tree name;
3245 tree fn;
3247 {
3262 }
3267 flags,
3269 tf_warning_or_error);
3270 }
3272 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
3273 ADDR is an expression which yields the store to be destroyed.
3274 AUTO_DELETE is the name of the destructor to call, i.e., either
3275 sfk_complete_destructor, sfk_base_destructor, or
3276 sfk_deleting_destructor.
3278 FLAGS is the logical disjunction of zero or more LOOKUP_
3279 flags. See cp-tree.h for more info. */
3281 tree
3284 {
3285 tree expr;
3290 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
3291 set to `error_mark_node' before it gets properly cleaned up. */
3300 {
3307 /* We don't want to warn about delete of void*, only other
3308 incomplete types. Deleting other incomplete types
3309 invokes undefined behavior, but it is not ill-formed, so
3310 compile to something that would even do The Right Thing
3311 (TM) should the type have a trivial dtor and no delete
3312 operator. */
3314 {
3317 {
3320 {
3323 "operator delete will be called, even if they are "
3325 }
3327 }
3328 }
3330 /* Call the builtin operator delete. */
3335 /* Throw away const and volatile on target type of addr. */
3337 }
3339 {
3340 handle_array:
3343 {
3346 }
3349 }
3350 else
3351 {
3352 /* Don't check PROTECT here; leave that decision to the
3353 destructor. If the destructor is accessible, call it,
3354 else report error. */
3360 }
3365 {
3371 use_global_delete,
3374 }
3375 else
3376 {
3379 tree ifexp;
3384 /* For `::delete x', we must not use the deleting destructor
3385 since then we would not be sure to get the global `operator
3386 delete'. */
3388 {
3389 /* We will use ADDR multiple times so we must save it. */
3392 /* Delete the object. */
3394 /* Otherwise, treat this like a complete object destructor
3395 call. */
3397 }
3398 /* If the destructor is non-virtual, there is no deleting
3399 variant. Instead, we must explicitly call the appropriate
3400 `operator delete' here. */
3403 {
3404 /* We will use ADDR multiple times so we must save it. */
3406 /* Build the call. */
3408 addr,
3413 /* Call the complete object destructor. */
3415 }
3418 {
3419 /* Make sure we have access to the member op delete, even though
3420 we'll actually be calling it from the destructor. */
3425 }
3428 tf_warning_or_error),
3433 /* We need to calculate this before the dtor changes the vptr. */
3438 /* Explicit destructor call; don't check for null pointer. */
3440 else
3441 /* Handle deleting a null pointer. */
3444 tf_warning_or_error));
3451 }
3452 }
3454 /* At the beginning of a destructor, push cleanups that will call the
3455 destructors for our base classes and members.
3457 Called from begin_destructor_body. */
3459 void
3461 {
3464 tree member;
3465 tree expr;
3468 /* Run destructors for all virtual baseclasses. */
3470 {
3471 tree cond = (condition_conversion
3473 current_in_charge_parm,
3474 integer_two_node)));
3476 /* The CLASSTYPE_VBASECLASSES vector is in initialization
3477 order, which is also the right order for pushing cleanups. */
3480 {
3482 {
3484 base_dtor_identifier,
3485 NULL,
3486 base_binfo,
3487 (LOOKUP_NORMAL
3489 tf_warning_or_error);
3493 }
3494 }
3495 }
3497 /* Take care of the remaining baseclasses. */
3500 {
3506 base_dtor_identifier,
3509 tf_warning_or_error);
3511 }
3513 /* Don't automatically destroy union members. */
3519 {
3528 {
3529 tree this_member = (build_class_member_access_expr
3533 tf_warning_or_error));
3535 sfk_complete_destructor,
3539 }
3540 }
3541 }
3543 /* Build a C++ vector delete expression.
3544 MAXINDEX is the number of elements to be deleted.
3545 ELT_SIZE is the nominal size of each element in the vector.
3546 BASE is the expression that should yield the store to be deleted.
3547 This function expands (or synthesizes) these calls itself.
3548 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
3550 This also calls delete for virtual baseclasses of elements of the vector.
3552 Update: MAXINDEX is no longer needed. The size can be extracted from the
3553 start of the vector for pointers, and from the type for arrays. We still
3554 use MAXINDEX for arrays because it happens to already have one of the
3555 values we'd have to extract. (We could use MAXINDEX with pointers to
3556 confirm the size, and trap if the numbers differ; not clear that it'd
3557 be worth bothering.) */
3559 tree
3562 {
3563 tree type;
3564 tree rval;
3570 {
3571 /* Step back one from start of vector, and read dimension. */
3572 tree cookie_addr;
3576 {
3579 }
3584 size_ptr_type,
3586 cookie_addr);
3588 }
3590 {
3591 /* Get the total number of things in the array, maxindex is a
3592 bad name. */
3597 {
3600 }
3601 }
3602 else
3603 {
3607 }
3610 use_global_delete);
3615 }