| blob | 39d87e3669f0dcd4870782925c8e53e5a1740355 |
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
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. */
58 /* We are about to generate some complex initialization code.
59 Conceptually, it is all a single expression. However, we may want
60 to include conditionals, loops, and other such statement-level
61 constructs. Therefore, we build the initialization code inside a
62 statement-expression. This function starts such an expression.
63 STMT_EXPR_P and COMPOUND_STMT_P are filled in by this function;
64 pass them back to finish_init_stmts when the expression is
65 complete. */
67 static bool
69 {
76 }
78 /* Finish out the statement-expression begun by the previous call to
79 begin_init_stmts. Returns the statement-expression itself. */
81 static tree
83 {
91 }
93 /* Constructors */
95 /* Called from initialize_vtbl_ptrs via dfs_walk. BINFO is the base
96 which we want to initialize the vtable pointer for, DATA is
97 TREE_LIST whose TREE_VALUE is the this ptr expression. */
99 static tree
101 {
106 {
112 }
115 }
117 /* Initialize all the vtable pointers in the object pointed to by
118 ADDR. */
120 void
122 {
123 tree list;
124 tree type;
129 /* Walk through the hierarchy, initializing the vptr in each base
130 class. We do these in pre-order because we can't find the virtual
131 bases for a class until we've initialized the vtbl for that
132 class. */
134 }
136 /* Return an expression for the zero-initialization of an object with
137 type T. This expression will either be a constant (in the case
138 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
139 aggregate), or NULL (in the case that T does not require
140 initialization). In either case, the value can be used as
141 DECL_INITIAL for a decl of the indicated TYPE; it is a valid static
142 initializer. If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS
143 is the number of elements in the array. If STATIC_STORAGE_P is
144 TRUE, initializers are only generated for entities for which
145 zero-initialization does not simply mean filling the storage with
146 zero bytes. */
148 tree
150 {
153 /* [dcl.init]
155 To zero-initialize an object of type T means:
157 -- if T is a scalar type, the storage is set to the value of zero
158 converted to T.
160 -- if T is a non-union class type, the storage for each nonstatic
161 data member and each base-class subobject is zero-initialized.
163 -- if T is a union type, the storage for its first data member is
164 zero-initialized.
166 -- if T is an array type, the storage for each element is
167 zero-initialized.
169 -- if T is a reference type, no initialization is performed. */
174 ;
176 /* In order to save space, we do not explicitly build initializers
177 for items that do not need them. GCC's semantics are that
178 items with static storage duration that are not otherwise
179 initialized are initialized to zero. */
180 ;
184 {
185 tree field;
188 /* Iterate over the fields, building initializations. */
190 {
194 /* Note that for class types there will be FIELD_DECLs
195 corresponding to base classes as well. Thus, iterating
196 over TYPE_FIELDs will result in correct initialization of
197 all of the subobjects. */
199 {
202 static_storage_p);
205 }
207 /* For unions, only the first field is initialized. */
210 }
212 /* Build a constructor to contain the initializations. */
214 }
216 {
217 tree max_index;
220 /* Iterate over the array elements, building initializations. */
224 else
227 /* If we have an error_mark here, we should just return error mark
228 as we don't know the size of the array yet. */
233 /* A zero-sized array, which is accepted as an extension, will
234 have an upper bound of -1. */
236 {
242 /* If this is a one element array, we just use a regular init. */
245 else
247 max_index);
251 static_storage_p);
252 }
254 /* Build a constructor to contain the initializations. */
256 }
259 else
262 /* In all cases, the initializer is a constant. */
267 }
269 /* Return a suitable initializer for value-initializing an object of type
270 TYPE, as described in [dcl.init]. If HAVE_CTOR is true, the initializer
271 for an enclosing object is already calling the constructor for this
272 object. */
274 static tree
276 {
277 /* [dcl.init]
279 To value-initialize an object of type T means:
281 - if T is a class type (clause 9) with a user-provided constructor
282 (12.1), then the default constructor for T is called (and the
283 initialization is ill-formed if T has no accessible default
284 constructor);
286 - if T is a non-union class type without a user-provided constructor,
287 then every non-static data member and base-class component of T is
288 value-initialized;92)
290 - if T is an array type, then each element is value-initialized;
292 - otherwise, the object is zero-initialized.
294 A program that calls for default-initialization or
295 value-initialization of an entity of reference type is ill-formed.
297 92) Value-initialization for such a class object may be implemented by
298 zero-initializing the object and then calling the default
299 constructor. */
302 {
304 return build_aggr_init_expr
308 tf_warning_or_error));
310 {
315 /* Iterate over the fields, building initializations. */
317 {
328 /* We could skip vfields and fields of types with
329 user-defined constructors, but I think that won't improve
330 performance at all; it should be simpler in general just
331 to zero out the entire object than try to only zero the
332 bits that actually need it. */
334 /* Note that for class types there will be FIELD_DECLs
335 corresponding to base classes as well. Thus, iterating
336 over TYPE_FIELDs will result in correct initialization of
337 all of the subobjects. */
342 }
344 /* Build a constructor to contain the zero- initializations. */
347 {
348 /* This is a class that needs constructing, but doesn't have
349 a user-defined constructor. So we need to zero-initialize
350 the object and then call the implicitly defined ctor.
351 Implement this by sticking the zero-initialization inside
352 the TARGET_EXPR for the constructor call;
353 cp_gimplify_init_expr will know how to handle it. */
354 tree ctor = build_special_member_call
365 }
367 }
368 }
370 {
373 /* Iterate over the array elements, building initializations. */
376 /* If we have an error_mark here, we should just return error mark
377 as we don't know the size of the array yet. */
382 /* A zero-sized array, which is accepted as an extension, will
383 have an upper bound of -1. */
385 {
391 /* If this is a one element array, we just use a regular init. */
394 else
396 max_index);
400 /* The gimplifier can't deal with a RANGE_EXPR of TARGET_EXPRs. */
403 }
405 /* Build a constructor to contain the initializations. */
407 }
410 }
412 /* Return a suitable initializer for value-initializing an object of type
413 TYPE, as described in [dcl.init]. */
415 tree
417 {
419 }
421 /* Initialize MEMBER, a FIELD_DECL, with INIT, a TREE_LIST of
422 arguments. If TREE_LIST is void_type_node, an empty initializer
423 list was given; if NULL_TREE no initializer was given. */
425 static void
427 {
428 tree decl;
431 /* Effective C++ rule 12 requires that all data members be
432 initialized. */
437 /* Get an lvalue for the data member. */
441 tf_warning_or_error);
446 {
447 /* mem() means value-initialization. */
452 tf_warning_or_error);
453 else
454 {
460 }
462 }
463 /* Deal with this here, as we will get confused if we try to call the
464 assignment op for an anonymous union. This can happen in a
465 synthesized copy constructor. */
467 {
469 {
472 }
473 }
475 {
480 {
481 /* Initialization of one array from another. */
485 tf_warning_or_error));
486 }
487 else
488 {
492 /* TYPE_NEEDS_CONSTRUCTING can be set just because we have a
493 vtable; still give this diagnostic. */
497 tf_warning_or_error));
498 }
499 }
500 else
501 {
503 {
504 /* member traversal: note it leaves init NULL */
511 }
513 /* There was an explicit member initialization. Do some work
514 in that case. */
519 tf_warning_or_error));
520 }
523 {
524 tree expr;
529 tf_warning_or_error);
535 }
536 }
538 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
539 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
541 static tree
543 {
544 tree fields;
548 /* Note whether or not T is a union. */
553 {
554 /* Skip CONST_DECLs for enumeration constants and so forth. */
558 /* Keep track of whether or not any fields are unions. */
562 /* For an anonymous struct or union, we must recursively
563 consider the fields of the anonymous type. They can be
564 directly initialized from the constructor. */
566 {
567 /* Add this field itself. Synthesized copy constructors
568 initialize the entire aggregate. */
570 /* And now add the fields in the anonymous aggregate. */
572 uses_unions_p);
573 }
574 /* Add this field. */
577 }
580 }
582 /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives
583 a FIELD_DECL or BINFO in T that needs initialization. The
584 TREE_VALUE gives the initializer, or list of initializer arguments.
586 Return a TREE_LIST containing all of the initializations required
587 for T, in the order in which they should be performed. The output
588 list has the same format as the input. */
590 static tree
592 {
593 tree init;
595 tree sorted_inits;
596 tree next_subobject;
601 /* Build up a list of initializations. The TREE_PURPOSE of entry
602 will be the subobject (a FIELD_DECL or BINFO) to initialize. The
603 TREE_VALUE will be the constructor arguments, or NULL if no
604 explicit initialization was provided. */
607 /* Process the virtual bases. */
612 /* Process the direct bases. */
618 /* Process the non-static data members. */
620 /* Reverse the entire list of initializations, so that they are in
621 the order that they will actually be performed. */
624 /* If the user presented the initializers in an order different from
625 that in which they will actually occur, we issue a warning. Keep
626 track of the next subobject which can be explicitly initialized
627 without issuing a warning. */
630 /* Go through the explicit initializers, filling in TREE_PURPOSE in
631 the SORTED_INITS. */
633 {
634 tree subobject;
635 tree subobject_init;
639 /* If the explicit initializers are in sorted order, then
640 SUBOBJECT will be NEXT_SUBOBJECT, or something following
641 it. */
643 subobject_init;
648 /* Issue a warning if the explicit initializer order does not
649 match that which will actually occur.
650 ??? Are all these on the correct lines? */
652 {
656 else
661 else
664 }
666 /* Look again, from the beginning of the list. */
668 {
672 }
674 /* It is invalid to initialize the same subobject more than
675 once. */
677 {
681 else
684 }
686 /* Record the initialization. */
689 }
691 /* [class.base.init]
693 If a ctor-initializer specifies more than one mem-initializer for
694 multiple members of the same union (including members of
695 anonymous unions), the ctor-initializer is ill-formed. */
697 {
700 {
701 tree field;
702 tree field_type;
705 /* Skip uninitialized members and base classes. */
709 /* See if this field is a member of a union, or a member of a
710 structure contained in a union, etc. */
717 /* If this field is not a member of a union, skip it. */
721 /* It's only an error if we have two initializers for the same
722 union type. */
724 {
727 }
729 /* See if LAST_FIELD and the field initialized by INIT are
730 members of the same union. If so, there's a problem,
731 unless they're actually members of the same structure
732 which is itself a member of a union. For example, given:
734 union { struct { int i; int j; }; };
736 initializing both `i' and `j' makes sense. */
739 do
740 {
741 tree last_field_type;
745 {
747 {
753 }
759 }
761 /* If we've reached the outermost class, then we're
762 done. */
767 }
771 }
772 }
775 }
777 /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS
778 is a TREE_LIST giving the explicit mem-initializer-list for the
779 constructor. The TREE_PURPOSE of each entry is a subobject (a
780 FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE
781 is a TREE_LIST giving the arguments to the constructor or
782 void_type_node for an empty list of arguments. */
784 void
786 {
787 /* We will already have issued an error message about the fact that
788 the type is incomplete. */
792 /* Sort the mem-initializers into the order in which the
793 initializations should be performed. */
798 /* Initialize base classes. */
801 {
805 /* If these initializations are taking place in a copy constructor,
806 the base class should probably be explicitly initialized if there
807 is a user-defined constructor in the base class (other than the
808 default constructor, which will be called anyway). */
816 /* If an explicit -- but empty -- initializer list was present,
817 treat it just like default initialization at this point. */
821 /* Initialize the base. */
824 else
825 {
826 tree base_addr;
832 tf_warning_or_error),
833 arguments,
834 LOOKUP_NORMAL,
835 tf_warning_or_error);
837 }
840 }
843 /* Initialize the vptrs. */
846 /* Initialize the data members. */
848 {
852 }
853 }
855 /* Returns the address of the vtable (i.e., the value that should be
856 assigned to the vptr) for BINFO. */
858 static tree
860 {
862 tree vtbl;
865 /* If this is a virtual primary base, then the vtable we want to store
866 is that for the base this is being used as the primary base of. We
867 can't simply skip the initialization, because we may be expanding the
868 inits of a subobject constructor where the virtual base layout
869 can be different. */
873 /* Figure out what vtable BINFO's vtable is based on, and mark it as
874 used. */
879 /* Now compute the address to use when initializing the vptr. */
885 }
887 /* This code sets up the virtual function tables appropriate for
888 the pointer DECL. It is a one-ply initialization.
890 BINFO is the exact type that DECL is supposed to be. In
891 multiple inheritance, this might mean "C's A" if C : A, B. */
893 static void
895 {
897 tree vtt_index;
899 /* Compute the initializer for vptr. */
902 /* We may get this vptr from a VTT, if this is a subobject
903 constructor or subobject destructor. */
906 {
907 tree vtbl2;
908 tree vtt_parm;
910 /* Compute the value to use, when there's a VTT. */
914 vtt_parm,
915 vtt_index);
919 /* The actual initializer is the VTT value only in the subobject
920 constructor. In maybe_clone_body we'll substitute NULL for
921 the vtt_parm in the case of the non-subobject constructor. */
926 vtbl2,
927 vtbl);
928 }
930 /* Compute the location of the vtpr. */
932 tf_warning_or_error),
936 /* Assign the vtable to the vptr. */
939 tf_warning_or_error));
940 }
942 /* If an exception is thrown in a constructor, those base classes already
943 constructed must be destroyed. This function creates the cleanup
944 for BINFO, which has just been constructed. If FLAG is non-NULL,
945 it is a DECL which is nonzero when this base needs to be
946 destroyed. */
948 static void
950 {
951 tree expr;
956 /* Call the destructor. */
958 base_dtor_identifier,
959 NULL_TREE,
960 binfo,
962 tf_warning_or_error);
969 }
971 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its
972 constructor. */
974 static void
976 {
977 tree inner_if_stmt;
978 tree exp;
979 tree flag;
981 /* If there are virtual base classes with destructors, we need to
982 emit cleanups to destroy them if an exception is thrown during
983 the construction process. These exception regions (i.e., the
984 period during which the cleanups must occur) begin from the time
985 the construction is complete to the end of the function. If we
986 create a conditional block in which to initialize the
987 base-classes, then the cleanup region for the virtual base begins
988 inside a block, and ends outside of that block. This situation
989 confuses the sjlj exception-handling code. Therefore, we do not
990 create a single conditional block, but one for each
991 initialization. (That way the cleanup regions always begin
992 in the outer block.) We trust the back end to figure out
993 that the FLAG will not change across initializations, and
994 avoid doing multiple tests. */
999 /* Compute the location of the virtual base. If we're
1000 constructing virtual bases, then we must be the most derived
1001 class. Therefore, we don't have to look up the virtual base;
1002 we already know where it is. */
1011 }
1013 /* Find the context in which this FIELD can be initialized. */
1015 static tree
1017 {
1020 /* Anonymous union members can be initialized in the first enclosing
1021 non-anonymous union context. */
1025 }
1027 /* Function to give error message if member initialization specification
1028 is erroneous. FIELD is the member we decided to initialize.
1029 TYPE is the type for which the initialization is being performed.
1030 FIELD must be a member of TYPE.
1032 MEMBER_NAME is the name of the member. */
1034 static int
1036 {
1040 {
1042 member_name);
1044 }
1046 {
1049 field);
1051 }
1053 {
1057 }
1059 {
1061 member_name);
1063 }
1066 }
1068 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it
1069 is a _TYPE node or TYPE_DECL which names a base for that type.
1070 Check the validity of NAME, and return either the base _TYPE, base
1071 binfo, or the FIELD_DECL of the member. If NAME is invalid, return
1072 NULL_TREE and issue a diagnostic.
1074 An old style unnamed direct single base construction is permitted,
1075 where NAME is NULL. */
1077 tree
1079 {
1080 tree basetype;
1081 tree field;
1087 {
1088 /* This is an obsolete unnamed base class initializer. The
1089 parser will already have warned about its use. */
1091 {
1094 current_class_type);
1097 basetype = BINFO_TYPE
1102 current_class_type);
1104 }
1105 }
1107 {
1110 }
1113 else
1117 {
1118 tree class_binfo;
1119 tree direct_binfo;
1120 tree virtual_binfo;
1130 /* Look for a direct base. */
1135 /* Look for a virtual base -- unless the direct base is itself
1136 virtual. */
1140 /* [class.base.init]
1142 If a mem-initializer-id is ambiguous because it designates
1143 both a direct non-virtual base class and an inherited virtual
1144 base class, the mem-initializer is ill-formed. */
1146 {
1148 basetype);
1150 }
1153 {
1157 else
1161 }
1164 }
1165 else
1166 {
1169 else
1174 }
1177 }
1179 /* This is like `expand_member_init', only it stores one aggregate
1180 value into another.
1182 INIT comes in two flavors: it is either a value which
1183 is to be stored in EXP, or it is a parameter list
1184 to go to a constructor, which will operate on EXP.
1185 If INIT is not a parameter list for a constructor, then set
1186 LOOKUP_ONLYCONVERTING.
1187 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1188 the initializer, if FLAGS is 0, then it is the (init) form.
1189 If `init' is a CONSTRUCTOR, then we emit a warning message,
1190 explaining that such initializations are invalid.
1192 If INIT resolves to a CALL_EXPR which happens to return
1193 something of the type we are looking for, then we know
1194 that we can safely use that call to perform the
1195 initialization.
1197 The virtual function table pointer cannot be set up here, because
1198 we do not really know its type.
1200 This never calls operator=().
1202 When initializing, nothing is CONST.
1204 A default copy constructor may have to be used to perform the
1205 initialization.
1207 A constructor or a conversion operator may have to be used to
1208 perform the initialization, but not both, as it would be ambiguous. */
1210 tree
1212 {
1213 tree stmt_expr;
1214 tree compound_stmt;
1231 {
1232 tree itype;
1234 /* An array may not be initialized use the parenthesized
1235 initialization form -- unless the initializer is "()". */
1237 {
1241 }
1242 /* Must arrange to initialize each element of EXP
1243 from elements of INIT. */
1253 complain);
1260 }
1263 /* Just know that we've seen something for this node. */
1277 }
1279 static void
1281 tsubst_flags_t complain)
1282 {
1284 tree ctor_name;
1286 /* It fails because there may not be a constructor which takes
1287 its own type as the first (or only parameter), but which does
1288 take other types via a conversion. So, if the thing initializing
1289 the expression is a unit element of type X, first try X(X&),
1290 followed by initialization by X. If neither of these work
1291 out, then look hard. */
1292 tree rval;
1293 tree parms;
1297 {
1298 /* Base subobjects should only get direct-initialization. */
1302 /* Do nothing. We hit this in two cases: Reference initialization,
1303 where we aren't initializing a real variable, so we don't want
1304 to run a new constructor; and catching an exception, where we
1305 have already built up the constructor call so we could wrap it
1309 {
1310 /* A brace-enclosed initializer for an aggregate. */
1312 }
1313 else
1317 /* We need to protect the initialization of a catch parm with a
1318 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
1319 around the TARGET_EXPR for the copy constructor. See
1320 initialize_handler_parm. */
1321 {
1325 }
1326 else
1331 }
1335 {
1339 }
1340 else
1345 else
1349 complain);
1352 }
1354 /* This function is responsible for initializing EXP with INIT
1355 (if any).
1357 BINFO is the binfo of the type for who we are performing the
1358 initialization. For example, if W is a virtual base class of A and B,
1359 and C : A, B.
1360 If we are initializing B, then W must contain B's W vtable, whereas
1361 were we initializing C, W must contain C's W vtable.
1363 TRUE_EXP is nonzero if it is the true expression being initialized.
1364 In this case, it may be EXP, or may just contain EXP. The reason we
1365 need this is because if EXP is a base element of TRUE_EXP, we
1366 don't necessarily know by looking at EXP where its virtual
1367 baseclass fields should really be pointing. But we do know
1368 from TRUE_EXP. In constructors, we don't know anything about
1369 the value being initialized.
1371 FLAGS is just passed to `build_new_method_call'. See that function
1372 for its description. */
1374 static void
1376 tsubst_flags_t complain)
1377 {
1383 /* Use a function returning the desired type to initialize EXP for us.
1384 If the function is a constructor, and its first argument is
1385 NULL_TREE, know that it was meant for us--just slide exp on
1386 in and expand the constructor. Constructors now come
1387 as TARGET_EXPRs. */
1391 {
1392 /* If store_init_value returns NULL_TREE, the INIT has been
1393 recorded as the DECL_INITIAL for EXP. That means there's
1394 nothing more we have to do. */
1399 }
1401 /* We know that expand_default_init can handle everything we want
1402 at this point. */
1404 }
1406 /* Report an error if TYPE is not a user-defined, class type. If
1407 OR_ELSE is nonzero, give an error message. */
1409 int
1411 {
1416 {
1420 }
1422 }
1424 tree
1426 {
1432 else
1434 }
1436 /* Build a reference to a member of an aggregate. This is not a C++
1437 `&', but really something which can have its address taken, and
1438 then act as a pointer to member, for example TYPE :: FIELD can have
1439 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if
1440 this expression is the operand of "&".
1442 @@ Prints out lousy diagnostics for operator <typename>
1443 @@ fields.
1445 @@ This function should be rewritten and placed in search.c. */
1447 tree
1449 {
1450 tree decl;
1453 /* class templates can come in as TEMPLATE_DECLs here. */
1466 /* Callers should call mark_used before this point. */
1471 {
1474 }
1476 /* Entities other than non-static members need no further
1477 processing. */
1484 {
1487 }
1489 /* Set up BASEBINFO for member lookup. */
1492 /* A lot of this logic is now handled in lookup_member. */
1494 {
1495 /* Go from the TREE_BASELINK to the member function info. */
1499 {
1500 /* Get rid of a potential OVERLOAD around it. */
1503 /* Unique functions are handled easily. */
1505 /* For non-static member of base class, we need a special rule
1506 for access checking [class.protected]:
1508 If the access is to form a pointer to member, the
1509 nested-name-specifier shall name the derived class
1510 (or any class derived from that class). */
1514 else
1520 }
1521 else
1523 }
1525 /* We need additional test besides the one in
1526 check_accessibility_of_qualified_id in case it is
1527 a pointer to non-static member. */
1531 {
1532 /* If MEMBER is non-static, then the program has fallen afoul of
1533 [expr.prim]:
1535 An id-expression that denotes a nonstatic data member or
1536 nonstatic member function of a class can only be used:
1538 -- as part of a class member access (_expr.ref_) in which the
1539 object-expression refers to the member's class or a class
1540 derived from that class, or
1542 -- to form a pointer to member (_expr.unary.op_), or
1544 -- in the body of a nonstatic member function of that class or
1545 of a class derived from that class (_class.mfct.nonstatic_), or
1547 -- in a mem-initializer for a constructor for that class or for
1548 a class derived from that class (_class.base.init_). */
1550 {
1551 /* Build a representation of the qualified name suitable
1552 for use as the operand to "&" -- even though the "&" is
1553 not actually present. */
1555 /* In Microsoft mode, treat a non-static member function as if
1556 it were a pointer-to-member. */
1558 {
1561 tf_warning_or_error);
1562 }
1566 }
1568 {
1571 }
1573 }
1578 }
1580 /* If DECL is a scalar enumeration constant or variable with a
1581 constant initializer, return the initializer (or, its initializers,
1582 recursively); otherwise, return DECL. If INTEGRAL_P, the
1583 initializer is only returned if DECL is an integral
1584 constant-expression. */
1586 static tree
1588 {
1590 || (integral_p
1594 {
1595 tree init;
1596 /* Static data members in template classes may have
1597 non-dependent initializers. References to such non-static
1598 data members are not value-dependent, so we must retrieve the
1599 initializer here. The DECL_INITIAL will have the right type,
1600 but will not have been folded because that would prevent us
1601 from performing all appropriate semantic checks at
1602 instantiation time. */
1607 {
1611 }
1612 else
1613 {
1614 /* If DECL is a static data member in a template
1615 specialization, we must instantiate it here. The
1616 initializer for the static data member is not processed
1617 until needed; we need it now. */
1620 }
1623 /* Initializers in templates are generally expanded during
1624 instantiation, so before that for const int i(2)
1625 INIT is a TREE_LIST with the actual initializer as
1626 TREE_VALUE. */
1628 && init
1634 || (integral_p
1637 /* Do not return an aggregate constant (of which
1638 string literals are a special case), as we do not
1639 want to make inadvertent copies of such entities,
1640 and we must be sure that their addresses are the
1641 same everywhere. */
1646 }
1648 }
1650 /* If DECL is a CONST_DECL, or a constant VAR_DECL initialized by
1651 constant of integral or enumeration type, then return that value.
1652 These are those variables permitted in constant expressions by
1653 [5.19/1]. */
1655 tree
1657 {
1659 }
1661 /* A more relaxed version of integral_constant_value, used by the
1662 common C/C++ code and by the C++ front end for optimization
1663 purposes. */
1665 tree
1667 {
1670 }
1671 \f
1672 /* Common subroutines of build_new and build_vec_delete. */
1674 /* Call the global __builtin_delete to delete ADDR. */
1676 static tree
1678 {
1681 }
1682 \f
1683 /* Build and return a NEW_EXPR. If NELTS is non-NULL, TYPE[NELTS] is
1684 the type of the object being allocated; otherwise, it's just TYPE.
1685 INIT is the initializer, if any. USE_GLOBAL_NEW is true if the
1686 user explicitly wrote "::operator new". PLACEMENT, if non-NULL, is
1687 the TREE_LIST of arguments to be provided as arguments to a
1688 placement new operator. This routine performs no semantic checks;
1689 it just creates and returns a NEW_EXPR. */
1691 static tree
1694 {
1695 tree new_expr;
1703 }
1705 /* Make sure that there are no aliasing issues with T, a placement new
1706 expression applied to PLACEMENT, by recording the change in dynamic
1707 type. If placement new is inlined, as it is with libstdc++, and if
1708 the type of the placement new differs from the type of the
1709 placement location itself, then alias analysis may think it is OK
1710 to interchange writes to the location from before the placement new
1711 and from after the placement new. We have to prevent type-based
1712 alias analysis from applying. PLACEMENT may be NULL, which means
1713 that we couldn't capture it in a temporary variable, in which case
1714 we use a memory clobber. */
1716 static tree
1718 {
1719 tree type_change;
1724 /* If we are not using type based aliasing, we don't have to do
1725 anything. */
1729 /* If we have a pointer and a location, record the change in dynamic
1730 type. Otherwise we need a general memory clobber. */
1736 placement);
1737 else
1738 {
1739 /* Build a memory clobber. */
1742 NULL_TREE,
1743 NULL_TREE,
1746 NULL_TREE));
1749 }
1752 }
1754 /* Generate code for a new-expression, including calling the "operator
1755 new" function, initializing the object, and, if an exception occurs
1756 during construction, cleaning up. The arguments are as for
1757 build_raw_new_expr. */
1759 static tree
1762 {
1764 /* True iff this is a call to "operator new[]" instead of just
1765 "operator new". */
1767 /* True iff ARRAY_P is true and the bound of the array type is
1768 not necessarily a compile time constant. For example, VLA_P is
1769 true for "new int[f()]". */
1771 /* The type being allocated. If ARRAY_P is true, this will be an
1772 ARRAY_TYPE. */
1773 tree full_type;
1774 /* If ARRAY_P is true, the element type of the array. This is an
1775 never ARRAY_TYPE; for something like "new int[3][4]", the
1776 ELT_TYPE is "int". If ARRAY_P is false, this is the same type as
1777 FULL_TYPE. */
1778 tree elt_type;
1779 /* The type of the new-expression. (This type is always a pointer
1780 type.) */
1781 tree pointer_type;
1782 /* A pointer type pointing to the FULL_TYPE. */
1783 tree full_pointer_type;
1786 /* The address returned by the call to "operator new". This node is
1787 a VAR_DECL and is therefore reusable. */
1788 tree alloc_node;
1789 tree alloc_fn;
1793 /* If non-NULL, the number of extra bytes to allocate at the
1794 beginning of the storage allocated for an array-new expression in
1795 order to store the number of elements. */
1798 /* True if the function we are calling is a placement allocation
1799 function. */
1802 /* True if the storage must be initialized, either by a constructor
1803 or due to an explicit new-initializer. */
1805 /* The address of the thing allocated, not including any cookie. In
1806 particular, if an array cookie is in use, DATA_ADDR is the
1807 address of the first array element. This node is a VAR_DECL, and
1808 is therefore reusable. */
1809 tree data_addr;
1813 {
1814 tree index;
1819 /* ??? The middle-end will error on us for building a VLA outside a
1820 function context. Methinks that's not it's purvey. So we'll do
1821 our own VLA layout later. */
1827 /* We need a copy of the type as build_array_type will return a shared copy
1828 of the incomplete array type. */
1832 }
1833 else
1834 {
1837 {
1842 }
1843 }
1845 /* If our base type is an array, then make sure we know how many elements
1846 it has. */
1853 complain);
1856 {
1860 }
1869 {
1873 }
1877 {
1880 {
1883 /* Do our own VLA layout. Setting TYPE_SIZE/_UNIT is
1884 necessary in order for the <INIT_EXPR <*foo> <CONSTRUCTOR
1885 ...>> to be valid. */
1890 }
1891 }
1895 /* Allocate the object. */
1897 {
1898 tree class_addr;
1908 {
1912 }
1914 {
1918 }
1921 alloc_call = (cp_build_function_call
1924 complain));
1925 }
1927 {
1930 }
1931 else
1932 {
1933 tree fnname;
1934 tree fns;
1940 && (array_p
1943 {
1944 /* Use a class-specific operator new. */
1945 /* If a cookie is required, add some extra space. */
1947 {
1950 }
1951 /* Create the argument list. */
1953 /* Do name-lookup to find the appropriate operator. */
1956 {
1960 }
1962 {
1964 {
1967 }
1969 }
1973 LOOKUP_NORMAL,
1975 complain);
1976 }
1977 else
1978 {
1979 /* Use a global operator new. */
1980 /* See if a cookie might be required. */
1983 else
1989 }
1990 }
1997 /* If PLACEMENT is a simple pointer type and is not passed by reference,
1998 then copy it into PLACEMENT_EXPR. */
2007 {
2012 {
2016 }
2017 }
2019 /* In the simple case, we can stop now. */
2022 {
2027 }
2029 /* Store the result of the allocation call in a variable so that we can
2030 use it more than once. */
2034 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */
2038 /* Now, check to see if this function is actually a placement
2039 allocation function. This can happen even when PLACEMENT is NULL
2040 because we might have something like:
2042 struct S { void* operator new (size_t, int i = 0); };
2044 A call to `new S' will get this allocation function, even though
2045 there is no explicit placement argument. If there is more than
2046 one argument, or there are variable arguments, then this is a
2047 placement allocation function. */
2048 placement_allocation_fn_p
2052 /* Preevaluate the placement args so that we don't reevaluate them for a
2053 placement delete. */
2055 {
2056 tree inits;
2060 alloc_expr);
2061 }
2063 /* unless an allocation function is declared with an empty excep-
2064 tion-specification (_except.spec_), throw(), it indicates failure to
2065 allocate storage by throwing a bad_alloc exception (clause _except_,
2066 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2067 cation function is declared with an empty exception-specification,
2068 throw(), it returns null to indicate failure to allocate storage and a
2069 non-null pointer otherwise.
2071 So check for a null exception spec on the op new we just called. */
2077 {
2078 tree cookie;
2079 tree cookie_ptr;
2080 tree size_ptr_type;
2082 /* Adjust so we're pointing to the start of the object. */
2086 /* Store the number of bytes allocated so that we can know how
2087 many elements to destroy later. We use the last sizeof
2088 (size_t) bytes to store the number of elements. */
2099 {
2100 /* Also store the element size. */
2110 }
2111 }
2112 else
2113 {
2116 }
2118 /* Now use a pointer to the type we've actually allocated. */
2122 /* Now initialize the allocated object. Note that we preevaluate the
2123 initialization expression, apart from the actual constructor call or
2124 assignment--we do this because we want to delay the allocation as long
2125 as possible in order to minimize the size of the exception region for
2126 placement delete. */
2128 {
2135 {
2138 }
2141 {
2143 {
2146 else
2148 }
2149 init_expr
2153 integer_one_node,
2154 complain),
2155 init,
2156 explicit_value_init_p,
2158 complain);
2160 /* An array initialization is stable because the initialization
2161 of each element is a full-expression, so the temporaries don't
2162 leak out. */
2164 }
2165 else
2166 {
2168 {
2170 complete_ctor_identifier,
2172 LOOKUP_NORMAL,
2173 complain);
2174 }
2176 {
2177 /* Something like `new int()'. */
2180 }
2181 else
2182 {
2183 /* We are processing something like `new int (10)', which
2184 means allocate an int, and initialize it with 10. */
2189 else
2194 complain);
2195 }
2197 }
2202 /* If any part of the object initialization terminates by throwing an
2203 exception and a suitable deallocation function can be found, the
2204 deallocation function is called to free the memory in which the
2205 object was being constructed, after which the exception continues
2206 to propagate in the context of the new-expression. If no
2207 unambiguous matching deallocation function can be found,
2208 propagating the exception does not cause the object's memory to be
2209 freed. */
2211 {
2213 tree cleanup;
2215 /* The Standard is unclear here, but the right thing to do
2216 is to use the same method for finding deallocation
2217 functions that we use for finding allocation functions. */
2218 cleanup = (build_op_delete_call
2221 size,
2222 globally_qualified_p,
2224 alloc_fn));
2229 /* This is much simpler if we were able to preevaluate all of
2230 the arguments to the constructor call. */
2233 else
2234 /* Ack! First we allocate the memory. Then we set our sentry
2235 variable to true, and expand a cleanup that deletes the
2236 memory if sentry is true. Then we run the constructor, and
2237 finally clear the sentry.
2239 We need to do this because we allocate the space first, so
2240 if there are any temporaries with cleanups in the
2241 constructor args and we weren't able to preevaluate them, we
2242 need this EH region to extend until end of full-expression
2243 to preserve nesting. */
2244 {
2259 init_expr
2262 end));
2263 }
2265 }
2266 }
2267 else
2270 /* Now build up the return value in reverse order. */
2280 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
2281 and return the call (which doesn't need to be adjusted). */
2283 else
2284 {
2286 {
2289 integer_zero_node,
2290 complain);
2292 complain);
2293 }
2295 /* Perform the allocation before anything else, so that ALLOC_NODE
2296 has been initialized before we start using it. */
2298 }
2303 /* Convert to the final type. */
2306 /* A new-expression is never an lvalue. */
2313 }
2315 /* Generate a representation for a C++ "new" expression. PLACEMENT is
2316 a TREE_LIST of placement-new arguments (or NULL_TREE if none). If
2317 NELTS is NULL, TYPE is the type of the storage to be allocated. If
2318 NELTS is not NULL, then this is an array-new allocation; TYPE is
2319 the type of the elements in the array and NELTS is the number of
2320 elements in the array. INIT, if non-NULL, is the initializer for
2321 the new object, or void_zero_node to indicate an initializer of
2322 "()". If USE_GLOBAL_NEW is true, then the user explicitly wrote
2323 "::new" rather than just "new". */
2325 tree
2328 {
2329 tree rval;
2330 tree orig_placement;
2331 tree orig_nelts;
2332 tree orig_init;
2344 {
2348 }
2351 {
2358 use_global_new);
2364 }
2367 {
2369 {
2372 else
2374 }
2376 }
2378 /* ``A reference cannot be created by the new operator. A reference
2379 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
2380 returned by new.'' ARM 5.3.3 */
2382 {
2385 else
2388 }
2391 {
2395 }
2397 /* The type allocated must be complete. If the new-type-id was
2398 "T[N]" then we are just checking that "T" is complete here, but
2399 that is equivalent, since the value of "N" doesn't matter. */
2409 use_global_new);
2411 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
2416 }
2418 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
2420 tree
2422 {
2428 {
2431 {
2434 }
2436 }
2438 /* Mangle the class$ field. */
2439 {
2440 tree field;
2443 {
2447 }
2449 {
2452 }
2453 }
2457 {
2466 }
2468 }
2469 \f
2470 static tree
2473 {
2474 tree virtual_size;
2478 /* Temporary variables used by the loop. */
2481 /* This is the body of the loop that implements the deletion of a
2482 single element, and moves temp variables to next elements. */
2483 tree body;
2485 /* This is the LOOP_EXPR that governs the deletion of the elements. */
2488 /* This is the thing that governs what to do after the loop has run. */
2491 /* This is the BIND_EXPR which holds the outermost iterator of the
2492 loop. It is convenient to set this variable up and test it before
2493 executing any other code in the loop.
2494 This is also the containing expression returned by this function. */
2496 tree tmp;
2498 /* We should only have 1-D arrays here. */
2504 /* The below is short by the cookie size. */
2512 virtual_size),
2513 tf_warning_or_error);
2523 body = build_compound_expr
2526 tf_warning_or_error));
2527 body = build_compound_expr
2534 no_destructor:
2535 /* If the delete flag is one, or anything else with the low bit set,
2536 delete the storage. */
2538 {
2539 tree base_tbd;
2541 /* The below is short by the cookie size. */
2546 /* no header */
2548 else
2549 {
2550 tree cookie_size;
2553 base_tbd
2556 MINUS_EXPR,
2558 base),
2559 cookie_size,
2560 tf_warning_or_error));
2561 /* True size with header. */
2563 }
2571 }
2575 ;
2578 else
2584 /* Outermost wrapper: If pointer is null, punt. */
2588 integer_zero_node)),
2593 {
2596 }
2599 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
2603 }
2605 /* Create an unnamed variable of the indicated TYPE. */
2607 tree
2609 {
2610 tree decl;
2620 }
2622 /* Create a new temporary variable of the indicated TYPE, initialized
2623 to INIT.
2625 It is not entered into current_binding_level, because that breaks
2626 things when it comes time to do final cleanups (which take place
2627 "outside" the binding contour of the function). */
2629 static tree
2631 {
2632 tree decl;
2638 tf_warning_or_error));
2641 }
2643 /* `build_vec_init' returns tree structure that performs
2644 initialization of a vector of aggregate types.
2646 BASE is a reference to the vector, of ARRAY_TYPE.
2647 MAXINDEX is the maximum index of the array (one less than the
2648 number of elements). It is only used if
2649 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
2651 INIT is the (possibly NULL) initializer.
2653 If EXPLICIT_VALUE_INIT_P is true, then INIT must be NULL. All
2654 elements in the array are value-initialized.
2656 FROM_ARRAY is 0 if we should init everything with INIT
2657 (i.e., every element initialized from INIT).
2658 FROM_ARRAY is 1 if we should index into INIT in parallel
2659 with initialization of DECL.
2660 FROM_ARRAY is 2 if we should index into INIT in parallel,
2661 but use assignment instead of initialization. */
2663 tree
2667 {
2668 tree rval;
2670 tree size;
2672 tree iterator;
2673 /* The type of the array. */
2675 /* The type of an element in the array. */
2677 /* The element type reached after removing all outer array
2678 types. */
2679 tree inner_elt_type;
2680 /* The type of a pointer to an element in the array. */
2681 tree ptype;
2682 tree stmt_expr;
2683 tree compound_stmt;
2705 /* Don't do this if the CONSTRUCTOR might contain something
2706 that might throw and require us to clean up. */
2710 {
2711 /* Do non-default initialization of POD arrays resulting from
2712 brace-enclosed initializers. In this case, digest_init and
2713 store_constructor will handle the semantics for us. */
2717 }
2725 /* The code we are generating looks like:
2726 ({
2727 T* t1 = (T*) base;
2728 T* rval = t1;
2729 ptrdiff_t iterator = maxindex;
2730 try {
2731 for (; iterator != -1; --iterator) {
2732 ... initialize *t1 ...
2733 ++t1;
2734 }
2735 } catch (...) {
2736 ... destroy elements that were constructed ...
2737 }
2738 rval;
2739 })
2741 We can omit the try and catch blocks if we know that the
2742 initialization will never throw an exception, or if the array
2743 elements do not have destructors. We can omit the loop completely if
2744 the elements of the array do not have constructors.
2746 We actually wrap the entire body of the above in a STMT_EXPR, for
2747 tidiness.
2749 When copying from array to another, when the array elements have
2750 only trivial copy constructors, we should use __builtin_memcpy
2751 rather than generating a loop. That way, we could take advantage
2752 of whatever cleverness the back end has for dealing with copies
2753 of blocks of memory. */
2762 /* Protect the entire array initialization so that we can destroy
2763 the partially constructed array if an exception is thrown.
2764 But don't do this if we're assigning. */
2767 {
2769 }
2772 {
2773 /* Do non-default initialization of non-POD arrays resulting from
2774 brace-enclosed initializers. */
2776 tree elt;
2780 {
2783 num_initialized_elts++;
2788 else
2794 complain));
2796 complain));
2797 }
2799 /* Clear out INIT so that we don't get confused below. */
2801 }
2803 {
2804 /* If initializing one array from another, initialize element by
2805 element. We rely upon the below calls the do argument
2806 checking. */
2808 {
2813 }
2817 {
2821 }
2822 }
2824 /* Now, default-initialize any remaining elements. We don't need to
2825 do that if a) the type does not need constructing, or b) we've
2826 already initialized all the elements.
2828 We do need to keep going if we're copying an array. */
2833 && (num_initialized_elts
2835 {
2836 /* If the ITERATOR is equal to -1, then we don't have to loop;
2837 we've already initialized all the elements. */
2838 tree for_stmt;
2839 tree elt_init;
2840 tree to;
2846 for_stmt);
2848 complain),
2849 for_stmt);
2854 {
2855 tree from;
2859 else
2864 complain);
2869 complain);
2870 else
2872 }
2874 {
2876 sorry
2880 explicit_value_init_p,
2882 }
2886 else
2887 {
2890 }
2897 complain));
2900 complain));
2903 }
2905 /* Make sure to cleanup any partially constructed elements. */
2908 {
2909 tree e;
2912 complain);
2914 /* Flatten multi-dimensional array since build_vec_delete only
2915 expects one-dimensional array. */
2920 complain);
2927 }
2929 /* The value of the array initialization is the array itself, RVAL
2930 is a pointer to the first element. */
2935 /* Now convert make the result have the correct type. */
2942 }
2944 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
2945 build_delete. */
2947 static tree
2949 {
2950 tree name;
2951 tree fn;
2953 {
2968 }
2973 flags,
2975 tf_warning_or_error);
2976 }
2978 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
2979 ADDR is an expression which yields the store to be destroyed.
2980 AUTO_DELETE is the name of the destructor to call, i.e., either
2981 sfk_complete_destructor, sfk_base_destructor, or
2982 sfk_deleting_destructor.
2984 FLAGS is the logical disjunction of zero or more LOOKUP_
2985 flags. See cp-tree.h for more info. */
2987 tree
2990 {
2991 tree expr;
2996 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
2997 set to `error_mark_node' before it gets properly cleaned up. */
3004 {
3011 /* We don't want to warn about delete of void*, only other
3012 incomplete types. Deleting other incomplete types
3013 invokes undefined behavior, but it is not ill-formed, so
3014 compile to something that would even do The Right Thing
3015 (TM) should the type have a trivial dtor and no delete
3016 operator. */
3018 {
3021 {
3024 {
3027 "operator delete will be called, even if they are "
3029 }
3031 }
3032 }
3034 /* Call the builtin operator delete. */
3039 /* Throw away const and volatile on target type of addr. */
3041 }
3043 {
3044 handle_array:
3047 {
3050 }
3053 }
3054 else
3055 {
3056 /* Don't check PROTECT here; leave that decision to the
3057 destructor. If the destructor is accessible, call it,
3058 else report error. */
3064 }
3069 {
3075 use_global_delete,
3078 }
3079 else
3080 {
3083 tree ifexp;
3088 /* For `::delete x', we must not use the deleting destructor
3089 since then we would not be sure to get the global `operator
3090 delete'. */
3092 {
3093 /* We will use ADDR multiple times so we must save it. */
3096 /* Delete the object. */
3098 /* Otherwise, treat this like a complete object destructor
3099 call. */
3101 }
3102 /* If the destructor is non-virtual, there is no deleting
3103 variant. Instead, we must explicitly call the appropriate
3104 `operator delete' here. */
3107 {
3108 /* We will use ADDR multiple times so we must save it. */
3110 /* Build the call. */
3112 addr,
3117 /* Call the complete object destructor. */
3119 }
3122 {
3123 /* Make sure we have access to the member op delete, even though
3124 we'll actually be calling it from the destructor. */
3129 }
3132 tf_warning_or_error),
3137 /* We need to calculate this before the dtor changes the vptr. */
3142 /* Explicit destructor call; don't check for null pointer. */
3144 else
3145 /* Handle deleting a null pointer. */
3148 tf_warning_or_error));
3155 }
3156 }
3158 /* At the beginning of a destructor, push cleanups that will call the
3159 destructors for our base classes and members.
3161 Called from begin_destructor_body. */
3163 void
3165 {
3168 tree member;
3169 tree expr;
3172 /* Run destructors for all virtual baseclasses. */
3174 {
3175 tree cond = (condition_conversion
3177 current_in_charge_parm,
3178 integer_two_node)));
3180 /* The CLASSTYPE_VBASECLASSES vector is in initialization
3181 order, which is also the right order for pushing cleanups. */
3184 {
3186 {
3188 base_dtor_identifier,
3189 NULL_TREE,
3190 base_binfo,
3191 (LOOKUP_NORMAL
3193 tf_warning_or_error);
3197 }
3198 }
3199 }
3201 /* Take care of the remaining baseclasses. */
3204 {
3210 base_dtor_identifier,
3213 tf_warning_or_error);
3215 }
3219 {
3225 {
3226 tree this_member = (build_class_member_access_expr
3230 tf_warning_or_error));
3233 sfk_complete_destructor,
3237 }
3238 }
3239 }
3241 /* Build a C++ vector delete expression.
3242 MAXINDEX is the number of elements to be deleted.
3243 ELT_SIZE is the nominal size of each element in the vector.
3244 BASE is the expression that should yield the store to be deleted.
3245 This function expands (or synthesizes) these calls itself.
3246 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
3248 This also calls delete for virtual baseclasses of elements of the vector.
3250 Update: MAXINDEX is no longer needed. The size can be extracted from the
3251 start of the vector for pointers, and from the type for arrays. We still
3252 use MAXINDEX for arrays because it happens to already have one of the
3253 values we'd have to extract. (We could use MAXINDEX with pointers to
3254 confirm the size, and trap if the numbers differ; not clear that it'd
3255 be worth bothering.) */
3257 tree
3260 {
3261 tree type;
3262 tree rval;
3268 {
3269 /* Step back one from start of vector, and read dimension. */
3270 tree cookie_addr;
3274 {
3277 }
3281 size_ptr_type,
3283 cookie_addr);
3285 }
3287 {
3288 /* Get the total number of things in the array, maxindex is a
3289 bad name. */
3294 {
3297 }
3298 }
3299 else
3300 {
3304 }
3307 use_global_delete);
3312 }