| blob | 66451b1e356daf4a0f12fd47496dda007c6058be |
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. */
57 /* We are about to generate some complex initialization code.
58 Conceptually, it is all a single expression. However, we may want
59 to include conditionals, loops, and other such statement-level
60 constructs. Therefore, we build the initialization code inside a
61 statement-expression. This function starts such an expression.
62 STMT_EXPR_P and COMPOUND_STMT_P are filled in by this function;
63 pass them back to finish_init_stmts when the expression is
64 complete. */
66 static bool
68 {
75 }
77 /* Finish out the statement-expression begun by the previous call to
78 begin_init_stmts. Returns the statement-expression itself. */
80 static tree
82 {
90 }
92 /* Constructors */
94 /* Called from initialize_vtbl_ptrs via dfs_walk. BINFO is the base
95 which we want to initialize the vtable pointer for, DATA is
96 TREE_LIST whose TREE_VALUE is the this ptr expression. */
98 static tree
100 {
105 {
111 }
114 }
116 /* Initialize all the vtable pointers in the object pointed to by
117 ADDR. */
119 void
121 {
122 tree list;
123 tree type;
128 /* Walk through the hierarchy, initializing the vptr in each base
129 class. We do these in pre-order because we can't find the virtual
130 bases for a class until we've initialized the vtbl for that
131 class. */
133 }
135 /* Return an expression for the zero-initialization of an object with
136 type T. This expression will either be a constant (in the case
137 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
138 aggregate), or NULL (in the case that T does not require
139 initialization). In either case, the value can be used as
140 DECL_INITIAL for a decl of the indicated TYPE; it is a valid static
141 initializer. If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS
142 is the number of elements in the array. If STATIC_STORAGE_P is
143 TRUE, initializers are only generated for entities for which
144 zero-initialization does not simply mean filling the storage with
145 zero bytes. */
147 tree
149 {
152 /* [dcl.init]
154 To zero-initialize an object of type T means:
156 -- if T is a scalar type, the storage is set to the value of zero
157 converted to T.
159 -- if T is a non-union class type, the storage for each nonstatic
160 data member and each base-class subobject is zero-initialized.
162 -- if T is a union type, the storage for its first data member is
163 zero-initialized.
165 -- if T is an array type, the storage for each element is
166 zero-initialized.
168 -- if T is a reference type, no initialization is performed. */
173 ;
175 /* In order to save space, we do not explicitly build initializers
176 for items that do not need them. GCC's semantics are that
177 items with static storage duration that are not otherwise
178 initialized are initialized to zero. */
179 ;
183 {
184 tree field;
187 /* Iterate over the fields, building initializations. */
189 {
193 /* Note that for class types there will be FIELD_DECLs
194 corresponding to base classes as well. Thus, iterating
195 over TYPE_FIELDs will result in correct initialization of
196 all of the subobjects. */
198 {
201 static_storage_p);
204 }
206 /* For unions, only the first field is initialized. */
209 }
211 /* Build a constructor to contain the initializations. */
213 }
215 {
216 tree max_index;
219 /* 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]. */
272 tree
274 {
275 /* [dcl.init]
277 To value-initialize an object of type T means:
279 - if T is a class type (clause 9) with a user-provided constructor
280 (12.1), then the default constructor for T is called (and the
281 initialization is ill-formed if T has no accessible default
282 constructor);
284 - if T is a non-union class type without a user-provided constructor,
285 then every non-static data member and base-class component of T is
286 value-initialized;92)
288 - if T is an array type, then each element is value-initialized;
290 - otherwise, the object is zero-initialized.
292 A program that calls for default-initialization or
293 value-initialization of an entity of reference type is ill-formed.
295 92) Value-initialization for such a class object may be implemented by
296 zero-initializing the object and then calling the default
297 constructor. */
300 {
302 return build_aggr_init_expr
306 tf_warning_or_error));
308 {
309 /* This is a class that needs constructing, but doesn't have
310 a user-provided constructor. So we need to zero-initialize
311 the object and then call the implicitly defined ctor.
312 This will be handled in simplify_aggr_init_expr. */
313 tree ctor = build_special_member_call
320 }
321 }
323 }
325 /* Like build_value_init, but don't call the constructor for TYPE. Used
326 for base initializers. */
328 tree
330 {
332 {
336 {
337 tree field;
340 /* Iterate over the fields, building initializations. */
342 {
353 /* We could skip vfields and fields of types with
354 user-defined constructors, but I think that won't improve
355 performance at all; it should be simpler in general just
356 to zero out the entire object than try to only zero the
357 bits that actually need it. */
359 /* Note that for class types there will be FIELD_DECLs
360 corresponding to base classes as well. Thus, iterating
361 over TYPE_FIELDs will result in correct initialization of
362 all of the subobjects. */
367 }
369 /* Build a constructor to contain the zero- initializations. */
371 }
372 }
374 {
377 /* Iterate over the array elements, building initializations. */
380 /* If we have an error_mark here, we should just return error mark
381 as we don't know the size of the array yet. */
386 /* A zero-sized array, which is accepted as an extension, will
387 have an upper bound of -1. */
389 {
395 /* If this is a one element array, we just use a regular init. */
398 else
400 max_index);
404 /* The gimplifier can't deal with a RANGE_EXPR of TARGET_EXPRs. */
407 }
409 /* Build a constructor to contain the initializations. */
411 }
414 }
416 /* Initialize MEMBER, a FIELD_DECL, with INIT, a TREE_LIST of
417 arguments. If TREE_LIST is void_type_node, an empty initializer
418 list was given; if NULL_TREE no initializer was given. */
420 static void
422 {
423 tree decl;
426 /* Effective C++ rule 12 requires that all data members be
427 initialized. */
431 member);
433 /* Get an lvalue for the data member. */
437 tf_warning_or_error);
442 {
443 /* mem() means value-initialization. */
445 {
449 tf_warning_or_error);
451 }
452 else
453 {
457 member);
458 else
459 {
462 }
463 }
464 }
465 /* Deal with this here, as we will get confused if we try to call the
466 assignment op for an anonymous union. This can happen in a
467 synthesized copy constructor. */
469 {
471 {
474 }
475 }
477 {
482 {
483 /* Initialization of one array from another. */
487 tf_warning_or_error));
488 }
489 else
490 {
494 /* TYPE_NEEDS_CONSTRUCTING can be set just because we have a
495 vtable; still give this diagnostic. */
500 tf_warning_or_error));
501 }
502 }
503 else
504 {
506 {
507 tree core_type;
508 /* member traversal: note it leaves init NULL */
512 member);
525 }
527 /* There was an explicit member initialization. Do some work
528 in that case. */
533 tf_warning_or_error));
534 }
537 {
538 tree expr;
543 tf_warning_or_error);
549 }
550 }
552 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
553 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
555 static tree
557 {
558 tree fields;
562 /* Note whether or not T is a union. */
567 {
568 /* Skip CONST_DECLs for enumeration constants and so forth. */
572 /* Keep track of whether or not any fields are unions. */
576 /* For an anonymous struct or union, we must recursively
577 consider the fields of the anonymous type. They can be
578 directly initialized from the constructor. */
580 {
581 /* Add this field itself. Synthesized copy constructors
582 initialize the entire aggregate. */
584 /* And now add the fields in the anonymous aggregate. */
586 uses_unions_p);
587 }
588 /* Add this field. */
591 }
594 }
596 /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives
597 a FIELD_DECL or BINFO in T that needs initialization. The
598 TREE_VALUE gives the initializer, or list of initializer arguments.
600 Return a TREE_LIST containing all of the initializations required
601 for T, in the order in which they should be performed. The output
602 list has the same format as the input. */
604 static tree
606 {
607 tree init;
609 tree sorted_inits;
610 tree next_subobject;
615 /* Build up a list of initializations. The TREE_PURPOSE of entry
616 will be the subobject (a FIELD_DECL or BINFO) to initialize. The
617 TREE_VALUE will be the constructor arguments, or NULL if no
618 explicit initialization was provided. */
621 /* Process the virtual bases. */
626 /* Process the direct bases. */
632 /* Process the non-static data members. */
634 /* Reverse the entire list of initializations, so that they are in
635 the order that they will actually be performed. */
638 /* If the user presented the initializers in an order different from
639 that in which they will actually occur, we issue a warning. Keep
640 track of the next subobject which can be explicitly initialized
641 without issuing a warning. */
644 /* Go through the explicit initializers, filling in TREE_PURPOSE in
645 the SORTED_INITS. */
647 {
648 tree subobject;
649 tree subobject_init;
653 /* If the explicit initializers are in sorted order, then
654 SUBOBJECT will be NEXT_SUBOBJECT, or something following
655 it. */
657 subobject_init;
662 /* Issue a warning if the explicit initializer order does not
663 match that which will actually occur.
664 ??? Are all these on the correct lines? */
666 {
670 else
675 else
679 }
681 /* Look again, from the beginning of the list. */
683 {
687 }
689 /* It is invalid to initialize the same subobject more than
690 once. */
692 {
696 subobject);
697 else
700 subobject);
701 }
703 /* Record the initialization. */
706 }
708 /* [class.base.init]
710 If a ctor-initializer specifies more than one mem-initializer for
711 multiple members of the same union (including members of
712 anonymous unions), the ctor-initializer is ill-formed. */
714 {
717 {
718 tree field;
719 tree field_type;
722 /* Skip uninitialized members and base classes. */
726 /* See if this field is a member of a union, or a member of a
727 structure contained in a union, etc. */
734 /* If this field is not a member of a union, skip it. */
738 /* It's only an error if we have two initializers for the same
739 union type. */
741 {
744 }
746 /* See if LAST_FIELD and the field initialized by INIT are
747 members of the same union. If so, there's a problem,
748 unless they're actually members of the same structure
749 which is itself a member of a union. For example, given:
751 union { struct { int i; int j; }; };
753 initializing both `i' and `j' makes sense. */
756 do
757 {
758 tree last_field_type;
762 {
764 {
768 last_field_type);
771 }
777 }
779 /* If we've reached the outermost class, then we're
780 done. */
785 }
789 }
790 }
793 }
795 /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS
796 is a TREE_LIST giving the explicit mem-initializer-list for the
797 constructor. The TREE_PURPOSE of each entry is a subobject (a
798 FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE
799 is a TREE_LIST giving the arguments to the constructor or
800 void_type_node for an empty list of arguments. */
802 void
804 {
805 /* We will already have issued an error message about the fact that
806 the type is incomplete. */
810 /* Sort the mem-initializers into the order in which the
811 initializations should be performed. */
816 /* Initialize base classes. */
819 {
823 /* If these initializations are taking place in a copy constructor,
824 the base class should probably be explicitly initialized if there
825 is a user-defined constructor in the base class (other than the
826 default constructor, which will be called anyway). */
831 "base class %q#T should be explicitly initialized in the "
835 /* Initialize the base. */
838 else
839 {
840 tree base_addr;
846 tf_warning_or_error),
847 arguments,
848 LOOKUP_NORMAL,
849 tf_warning_or_error);
851 }
854 }
857 /* Initialize the vptrs. */
860 /* Initialize the data members. */
862 {
866 }
867 }
869 /* Returns the address of the vtable (i.e., the value that should be
870 assigned to the vptr) for BINFO. */
872 static tree
874 {
876 tree vtbl;
879 /* If this is a virtual primary base, then the vtable we want to store
880 is that for the base this is being used as the primary base of. We
881 can't simply skip the initialization, because we may be expanding the
882 inits of a subobject constructor where the virtual base layout
883 can be different. */
887 /* Figure out what vtable BINFO's vtable is based on, and mark it as
888 used. */
892 /* Now compute the address to use when initializing the vptr. */
898 }
900 /* This code sets up the virtual function tables appropriate for
901 the pointer DECL. It is a one-ply initialization.
903 BINFO is the exact type that DECL is supposed to be. In
904 multiple inheritance, this might mean "C's A" if C : A, B. */
906 static void
908 {
910 tree vtt_index;
912 /* Compute the initializer for vptr. */
915 /* We may get this vptr from a VTT, if this is a subobject
916 constructor or subobject destructor. */
919 {
920 tree vtbl2;
921 tree vtt_parm;
923 /* Compute the value to use, when there's a VTT. */
927 vtt_parm,
928 vtt_index);
932 /* The actual initializer is the VTT value only in the subobject
933 constructor. In maybe_clone_body we'll substitute NULL for
934 the vtt_parm in the case of the non-subobject constructor. */
939 vtbl2,
940 vtbl);
941 }
943 /* Compute the location of the vtpr. */
945 tf_warning_or_error),
949 /* Assign the vtable to the vptr. */
952 tf_warning_or_error));
953 }
955 /* If an exception is thrown in a constructor, those base classes already
956 constructed must be destroyed. This function creates the cleanup
957 for BINFO, which has just been constructed. If FLAG is non-NULL,
958 it is a DECL which is nonzero when this base needs to be
959 destroyed. */
961 static void
963 {
964 tree expr;
969 /* Call the destructor. */
971 base_dtor_identifier,
972 NULL,
973 binfo,
975 tf_warning_or_error);
983 }
985 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its
986 constructor. */
988 static void
990 {
991 tree inner_if_stmt;
992 tree exp;
993 tree flag;
995 /* If there are virtual base classes with destructors, we need to
996 emit cleanups to destroy them if an exception is thrown during
997 the construction process. These exception regions (i.e., the
998 period during which the cleanups must occur) begin from the time
999 the construction is complete to the end of the function. If we
1000 create a conditional block in which to initialize the
1001 base-classes, then the cleanup region for the virtual base begins
1002 inside a block, and ends outside of that block. This situation
1003 confuses the sjlj exception-handling code. Therefore, we do not
1004 create a single conditional block, but one for each
1005 initialization. (That way the cleanup regions always begin
1006 in the outer block.) We trust the back end to figure out
1007 that the FLAG will not change across initializations, and
1008 avoid doing multiple tests. */
1013 /* Compute the location of the virtual base. If we're
1014 constructing virtual bases, then we must be the most derived
1015 class. Therefore, we don't have to look up the virtual base;
1016 we already know where it is. */
1025 }
1027 /* Find the context in which this FIELD can be initialized. */
1029 static tree
1031 {
1034 /* Anonymous union members can be initialized in the first enclosing
1035 non-anonymous union context. */
1039 }
1041 /* Function to give error message if member initialization specification
1042 is erroneous. FIELD is the member we decided to initialize.
1043 TYPE is the type for which the initialization is being performed.
1044 FIELD must be a member of TYPE.
1046 MEMBER_NAME is the name of the member. */
1048 static int
1050 {
1054 {
1056 member_name);
1058 }
1060 {
1063 field);
1065 }
1067 {
1071 }
1073 {
1075 member_name);
1077 }
1080 }
1082 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it
1083 is a _TYPE node or TYPE_DECL which names a base for that type.
1084 Check the validity of NAME, and return either the base _TYPE, base
1085 binfo, or the FIELD_DECL of the member. If NAME is invalid, return
1086 NULL_TREE and issue a diagnostic.
1088 An old style unnamed direct single base construction is permitted,
1089 where NAME is NULL. */
1091 tree
1093 {
1094 tree basetype;
1095 tree field;
1101 {
1102 /* This is an obsolete unnamed base class initializer. The
1103 parser will already have warned about its use. */
1105 {
1108 current_class_type);
1111 basetype = BINFO_TYPE
1116 current_class_type);
1118 }
1119 }
1121 {
1124 }
1127 else
1131 {
1132 tree class_binfo;
1133 tree direct_binfo;
1134 tree virtual_binfo;
1144 /* Look for a direct base. */
1149 /* Look for a virtual base -- unless the direct base is itself
1150 virtual. */
1154 /* [class.base.init]
1156 If a mem-initializer-id is ambiguous because it designates
1157 both a direct non-virtual base class and an inherited virtual
1158 base class, the mem-initializer is ill-formed. */
1160 {
1162 basetype);
1164 }
1167 {
1171 else
1175 }
1178 }
1179 else
1180 {
1183 else
1188 }
1191 }
1193 /* This is like `expand_member_init', only it stores one aggregate
1194 value into another.
1196 INIT comes in two flavors: it is either a value which
1197 is to be stored in EXP, or it is a parameter list
1198 to go to a constructor, which will operate on EXP.
1199 If INIT is not a parameter list for a constructor, then set
1200 LOOKUP_ONLYCONVERTING.
1201 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1202 the initializer, if FLAGS is 0, then it is the (init) form.
1203 If `init' is a CONSTRUCTOR, then we emit a warning message,
1204 explaining that such initializations are invalid.
1206 If INIT resolves to a CALL_EXPR which happens to return
1207 something of the type we are looking for, then we know
1208 that we can safely use that call to perform the
1209 initialization.
1211 The virtual function table pointer cannot be set up here, because
1212 we do not really know its type.
1214 This never calls operator=().
1216 When initializing, nothing is CONST.
1218 A default copy constructor may have to be used to perform the
1219 initialization.
1221 A constructor or a conversion operator may have to be used to
1222 perform the initialization, but not both, as it would be ambiguous. */
1224 tree
1226 {
1227 tree stmt_expr;
1228 tree compound_stmt;
1247 {
1248 tree itype;
1250 /* An array may not be initialized use the parenthesized
1251 initialization form -- unless the initializer is "()". */
1253 {
1257 }
1258 /* Must arrange to initialize each element of EXP
1259 from elements of INIT. */
1269 complain);
1276 }
1279 /* Just know that we've seen something for this node. */
1293 }
1295 static void
1297 tsubst_flags_t complain)
1298 {
1300 tree ctor_name;
1302 /* It fails because there may not be a constructor which takes
1303 its own type as the first (or only parameter), but which does
1304 take other types via a conversion. So, if the thing initializing
1305 the expression is a unit element of type X, first try X(X&),
1306 followed by initialization by X. If neither of these work
1307 out, then look hard. */
1308 tree rval;
1313 {
1314 /* A brace-enclosed initializer for an aggregate. In C++0x this can
1315 happen for direct-initialization, too. */
1321 }
1325 {
1326 /* Base subobjects should only get direct-initialization. */
1330 /* Do nothing. We hit this in two cases: Reference initialization,
1331 where we aren't initializing a real variable, so we don't want
1332 to run a new constructor; and catching an exception, where we
1333 have already built up the constructor call so we could wrap it
1335 else
1339 /* We need to protect the initialization of a catch parm with a
1340 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
1341 around the TARGET_EXPR for the copy constructor. See
1342 initialize_handler_parm. */
1343 {
1347 }
1348 else
1353 }
1358 {
1362 }
1363 else
1368 else
1372 complain);
1379 }
1381 /* This function is responsible for initializing EXP with INIT
1382 (if any).
1384 BINFO is the binfo of the type for who we are performing the
1385 initialization. For example, if W is a virtual base class of A and B,
1386 and C : A, B.
1387 If we are initializing B, then W must contain B's W vtable, whereas
1388 were we initializing C, W must contain C's W vtable.
1390 TRUE_EXP is nonzero if it is the true expression being initialized.
1391 In this case, it may be EXP, or may just contain EXP. The reason we
1392 need this is because if EXP is a base element of TRUE_EXP, we
1393 don't necessarily know by looking at EXP where its virtual
1394 baseclass fields should really be pointing. But we do know
1395 from TRUE_EXP. In constructors, we don't know anything about
1396 the value being initialized.
1398 FLAGS is just passed to `build_new_method_call'. See that function
1399 for its description. */
1401 static void
1403 tsubst_flags_t complain)
1404 {
1410 /* Use a function returning the desired type to initialize EXP for us.
1411 If the function is a constructor, and its first argument is
1412 NULL_TREE, know that it was meant for us--just slide exp on
1413 in and expand the constructor. Constructors now come
1414 as TARGET_EXPRs. */
1418 {
1419 /* If store_init_value returns NULL_TREE, the INIT has been
1420 recorded as the DECL_INITIAL for EXP. That means there's
1421 nothing more we have to do. */
1426 }
1428 /* If an explicit -- but empty -- initializer list was present,
1429 that's value-initialization. */
1431 {
1432 /* If there's a user-provided constructor, we just call that. */
1435 /* If there isn't, but we still need to call the constructor,
1436 zero out the object first. */
1438 {
1442 /* And then call the constructor. */
1443 }
1444 /* If we don't need to mess with the constructor at all,
1445 then just zero out the object and we're done. */
1446 else
1447 {
1451 }
1453 }
1455 /* We know that expand_default_init can handle everything we want
1456 at this point. */
1458 }
1460 /* Report an error if TYPE is not a user-defined, class type. If
1461 OR_ELSE is nonzero, give an error message. */
1463 int
1465 {
1470 {
1474 }
1476 }
1478 tree
1480 {
1486 else
1488 }
1490 /* Build a reference to a member of an aggregate. This is not a C++
1491 `&', but really something which can have its address taken, and
1492 then act as a pointer to member, for example TYPE :: FIELD can have
1493 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if
1494 this expression is the operand of "&".
1496 @@ Prints out lousy diagnostics for operator <typename>
1497 @@ fields.
1499 @@ This function should be rewritten and placed in search.c. */
1501 tree
1503 {
1504 tree decl;
1507 /* class templates can come in as TEMPLATE_DECLs here. */
1520 /* Callers should call mark_used before this point. */
1524 {
1527 }
1529 /* Entities other than non-static members need no further
1530 processing. */
1537 {
1540 }
1542 /* Set up BASEBINFO for member lookup. */
1545 /* A lot of this logic is now handled in lookup_member. */
1547 {
1548 /* Go from the TREE_BASELINK to the member function info. */
1552 {
1553 /* Get rid of a potential OVERLOAD around it. */
1556 /* Unique functions are handled easily. */
1558 /* For non-static member of base class, we need a special rule
1559 for access checking [class.protected]:
1561 If the access is to form a pointer to member, the
1562 nested-name-specifier shall name the derived class
1563 (or any class derived from that class). */
1567 else
1573 }
1574 else
1576 }
1578 /* We need additional test besides the one in
1579 check_accessibility_of_qualified_id in case it is
1580 a pointer to non-static member. */
1584 {
1585 /* If MEMBER is non-static, then the program has fallen afoul of
1586 [expr.prim]:
1588 An id-expression that denotes a nonstatic data member or
1589 nonstatic member function of a class can only be used:
1591 -- as part of a class member access (_expr.ref_) in which the
1592 object-expression refers to the member's class or a class
1593 derived from that class, or
1595 -- to form a pointer to member (_expr.unary.op_), or
1597 -- in the body of a nonstatic member function of that class or
1598 of a class derived from that class (_class.mfct.nonstatic_), or
1600 -- in a mem-initializer for a constructor for that class or for
1601 a class derived from that class (_class.base.init_). */
1603 {
1604 /* Build a representation of the qualified name suitable
1605 for use as the operand to "&" -- even though the "&" is
1606 not actually present. */
1608 /* In Microsoft mode, treat a non-static member function as if
1609 it were a pointer-to-member. */
1611 {
1614 tf_warning_or_error);
1615 }
1619 }
1621 {
1624 }
1626 }
1631 }
1633 /* If DECL is a scalar enumeration constant or variable with a
1634 constant initializer, return the initializer (or, its initializers,
1635 recursively); otherwise, return DECL. If INTEGRAL_P, the
1636 initializer is only returned if DECL is an integral
1637 constant-expression. */
1639 static tree
1641 {
1643 || (integral_p
1647 {
1648 tree init;
1649 /* Static data members in template classes may have
1650 non-dependent initializers. References to such non-static
1651 data members are not value-dependent, so we must retrieve the
1652 initializer here. The DECL_INITIAL will have the right type,
1653 but will not have been folded because that would prevent us
1654 from performing all appropriate semantic checks at
1655 instantiation time. */
1660 {
1664 }
1665 else
1666 {
1667 /* If DECL is a static data member in a template
1668 specialization, we must instantiate it here. The
1669 initializer for the static data member is not processed
1670 until needed; we need it now. */
1673 }
1675 {
1677 /* Treat the error as a constant to avoid cascading errors on
1678 excessively recursive template instantiation (c++/9335). */
1680 else
1682 }
1683 /* Initializers in templates are generally expanded during
1684 instantiation, so before that for const int i(2)
1685 INIT is a TREE_LIST with the actual initializer as
1686 TREE_VALUE. */
1688 && init
1694 || (integral_p
1697 /* Do not return an aggregate constant (of which
1698 string literals are a special case), as we do not
1699 want to make inadvertent copies of such entities,
1700 and we must be sure that their addresses are the
1701 same everywhere. */
1706 }
1708 }
1710 /* If DECL is a CONST_DECL, or a constant VAR_DECL initialized by
1711 constant of integral or enumeration type, then return that value.
1712 These are those variables permitted in constant expressions by
1713 [5.19/1]. */
1715 tree
1717 {
1719 }
1721 /* A more relaxed version of integral_constant_value, used by the
1722 common C/C++ code and by the C++ front end for optimization
1723 purposes. */
1725 tree
1727 {
1730 }
1731 \f
1732 /* Common subroutines of build_new and build_vec_delete. */
1734 /* Call the global __builtin_delete to delete ADDR. */
1736 static tree
1738 {
1741 }
1742 \f
1743 /* Build and return a NEW_EXPR. If NELTS is non-NULL, TYPE[NELTS] is
1744 the type of the object being allocated; otherwise, it's just TYPE.
1745 INIT is the initializer, if any. USE_GLOBAL_NEW is true if the
1746 user explicitly wrote "::operator new". PLACEMENT, if non-NULL, is
1747 a vector of arguments to be provided as arguments to a placement
1748 new operator. This routine performs no semantic checks; it just
1749 creates and returns a NEW_EXPR. */
1751 static tree
1754 {
1755 tree init_list;
1756 tree new_expr;
1758 /* If INIT is NULL, the we want to store NULL_TREE in the NEW_EXPR.
1759 If INIT is not NULL, then we want to store VOID_ZERO_NODE. This
1760 permits us to distinguish the case of a missing initializer "new
1761 int" from an empty initializer "new int()". */
1766 else
1771 init_list);
1776 }
1778 /* Diagnose uninitialized const members or reference members of type
1779 TYPE. USING_NEW is used to disambiguate the diagnostic between a
1780 new expression without a new-initializer and a declaration. Returns
1781 the error count. */
1783 static int
1786 {
1787 tree field;
1794 {
1795 tree field_type;
1803 {
1806 {
1810 else
1814 }
1815 }
1818 {
1821 {
1825 else
1829 }
1830 }
1833 error_count
1836 }
1838 }
1840 int
1842 {
1844 }
1846 /* Generate code for a new-expression, including calling the "operator
1847 new" function, initializing the object, and, if an exception occurs
1848 during construction, cleaning up. The arguments are as for
1849 build_raw_new_expr. This may change PLACEMENT and INIT. */
1851 static tree
1854 tsubst_flags_t complain)
1855 {
1857 /* True iff this is a call to "operator new[]" instead of just
1858 "operator new". */
1860 /* If ARRAY_P is true, the element type of the array. This is never
1861 an ARRAY_TYPE; for something like "new int[3][4]", the
1862 ELT_TYPE is "int". If ARRAY_P is false, this is the same type as
1863 TYPE. */
1864 tree elt_type;
1865 /* The type of the new-expression. (This type is always a pointer
1866 type.) */
1867 tree pointer_type;
1868 tree non_const_pointer_type;
1871 /* The address returned by the call to "operator new". This node is
1872 a VAR_DECL and is therefore reusable. */
1873 tree alloc_node;
1874 tree alloc_fn;
1878 /* If non-NULL, the number of extra bytes to allocate at the
1879 beginning of the storage allocated for an array-new expression in
1880 order to store the number of elements. */
1882 tree placement_first;
1884 /* True if the function we are calling is a placement allocation
1885 function. */
1887 /* True if the storage must be initialized, either by a constructor
1888 or due to an explicit new-initializer. */
1890 /* The address of the thing allocated, not including any cookie. In
1891 particular, if an array cookie is in use, DATA_ADDR is the
1892 address of the first array element. This node is a VAR_DECL, and
1893 is therefore reusable. */
1894 tree data_addr;
1898 {
1901 }
1903 {
1908 }
1910 /* If our base type is an array, then make sure we know how many elements
1911 it has. */
1918 complain);
1921 {
1925 }
1933 {
1935 /* A program that calls for default-initialization [...] of an
1936 entity of reference type is ill-formed. */
1940 /* A new-expression that creates an object of type T initializes
1941 that object as follows:
1942 - If the new-initializer is omitted:
1943 -- If T is a (possibly cv-qualified) non-POD class type
1944 (or array thereof), the object is default-initialized (8.5).
1945 [...]
1946 -- Otherwise, the object created has indeterminate
1947 value. If T is a const-qualified type, or a (possibly
1948 cv-qualified) POD class type (or array thereof)
1949 containing (directly or indirectly) a member of
1950 const-qualified type, the program is ill-formed; */
1960 }
1964 {
1968 }
1976 /* If PLACEMENT is a single simple pointer type not passed by
1977 reference, prepare to capture it in a temporary variable. Do
1978 this now, since PLACEMENT will change in the calls below. */
1985 /* Allocate the object. */
1987 {
1988 tree class_addr;
1998 {
2002 }
2004 {
2008 }
2011 alloc_call = (cp_build_function_call
2014 complain));
2015 }
2017 {
2020 }
2021 else
2022 {
2023 tree fnname;
2024 tree fns;
2030 && (array_p
2033 {
2034 /* Use a class-specific operator new. */
2035 /* If a cookie is required, add some extra space. */
2037 {
2040 }
2041 /* Create the argument list. */
2043 /* Do name-lookup to find the appropriate operator. */
2046 {
2050 }
2052 {
2054 {
2057 }
2059 }
2063 LOOKUP_NORMAL,
2065 complain);
2066 }
2067 else
2068 {
2069 /* Use a global operator new. */
2070 /* See if a cookie might be required. */
2073 else
2079 }
2080 }
2087 /* If we found a simple case of PLACEMENT_EXPR above, then copy it
2088 into a temporary variable. */
2095 {
2100 {
2104 }
2105 }
2107 /* In the simple case, we can stop now. */
2112 /* Store the result of the allocation call in a variable so that we can
2113 use it more than once. */
2117 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */
2121 /* Now, check to see if this function is actually a placement
2122 allocation function. This can happen even when PLACEMENT is NULL
2123 because we might have something like:
2125 struct S { void* operator new (size_t, int i = 0); };
2127 A call to `new S' will get this allocation function, even though
2128 there is no explicit placement argument. If there is more than
2129 one argument, or there are variable arguments, then this is a
2130 placement allocation function. */
2131 placement_allocation_fn_p
2135 /* Preevaluate the placement args so that we don't reevaluate them for a
2136 placement delete. */
2138 {
2139 tree inits;
2143 alloc_expr);
2144 }
2146 /* unless an allocation function is declared with an empty excep-
2147 tion-specification (_except.spec_), throw(), it indicates failure to
2148 allocate storage by throwing a bad_alloc exception (clause _except_,
2149 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2150 cation function is declared with an empty exception-specification,
2151 throw(), it returns null to indicate failure to allocate storage and a
2152 non-null pointer otherwise.
2154 So check for a null exception spec on the op new we just called. */
2160 {
2161 tree cookie;
2162 tree cookie_ptr;
2163 tree size_ptr_type;
2165 /* Adjust so we're pointing to the start of the object. */
2169 /* Store the number of bytes allocated so that we can know how
2170 many elements to destroy later. We use the last sizeof
2171 (size_t) bytes to store the number of elements. */
2183 {
2184 /* Also store the element size. */
2195 }
2196 }
2197 else
2198 {
2201 }
2203 /* Now use a pointer to the type we've actually allocated. */
2205 /* But we want to operate on a non-const version to start with,
2206 since we'll be modifying the elements. */
2207 non_const_pointer_type = build_pointer_type
2211 /* Any further uses of alloc_node will want this type, too. */
2214 /* Now initialize the allocated object. Note that we preevaluate the
2215 initialization expression, apart from the actual constructor call or
2216 assignment--we do this because we want to delay the allocation as long
2217 as possible in order to minimize the size of the exception region for
2218 placement delete. */
2220 {
2225 {
2228 }
2231 {
2236 {
2241 else
2242 {
2247 }
2250 }
2252 {
2255 else
2258 }
2259 init_expr
2263 integer_one_node,
2264 complain),
2265 vecinit,
2266 explicit_value_init_p,
2268 complain);
2270 /* An array initialization is stable because the initialization
2271 of each element is a full-expression, so the temporaries don't
2272 leak out. */
2274 }
2275 else
2276 {
2280 {
2282 complete_ctor_identifier,
2284 LOOKUP_NORMAL,
2285 complain);
2286 }
2288 {
2289 /* Something like `new int()'. */
2292 }
2293 else
2294 {
2295 tree ie;
2297 /* We are processing something like `new int (10)', which
2298 means allocate an int, and initialize it with 10. */
2302 complain);
2303 }
2305 }
2310 /* If any part of the object initialization terminates by throwing an
2311 exception and a suitable deallocation function can be found, the
2312 deallocation function is called to free the memory in which the
2313 object was being constructed, after which the exception continues
2314 to propagate in the context of the new-expression. If no
2315 unambiguous matching deallocation function can be found,
2316 propagating the exception does not cause the object's memory to be
2317 freed. */
2319 {
2321 tree cleanup;
2323 /* The Standard is unclear here, but the right thing to do
2324 is to use the same method for finding deallocation
2325 functions that we use for finding allocation functions. */
2326 cleanup = (build_op_delete_call
2328 alloc_node,
2329 size,
2330 globally_qualified_p,
2332 alloc_fn));
2337 /* This is much simpler if we were able to preevaluate all of
2338 the arguments to the constructor call. */
2339 {
2340 /* CLEANUP is compiler-generated, so no diagnostics. */
2344 /* Likewise, this try-catch is compiler-generated. */
2346 }
2347 else
2348 /* Ack! First we allocate the memory. Then we set our sentry
2349 variable to true, and expand a cleanup that deletes the
2350 memory if sentry is true. Then we run the constructor, and
2351 finally clear the sentry.
2353 We need to do this because we allocate the space first, so
2354 if there are any temporaries with cleanups in the
2355 constructor args and we weren't able to preevaluate them, we
2356 need this EH region to extend until end of full-expression
2357 to preserve nesting. */
2358 {
2366 /* CLEANUP is compiler-generated, so no diagnostics. */
2376 init_expr
2379 end));
2380 /* Likewise, this is compiler-generated. */
2382 }
2383 }
2384 }
2385 else
2388 /* Now build up the return value in reverse order. */
2398 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
2399 and return the call (which doesn't need to be adjusted). */
2401 else
2402 {
2404 {
2407 integer_zero_node,
2408 complain);
2410 complain);
2411 }
2413 /* Perform the allocation before anything else, so that ALLOC_NODE
2414 has been initialized before we start using it. */
2416 }
2421 /* A new-expression is never an lvalue. */
2425 }
2427 /* Generate a representation for a C++ "new" expression. *PLACEMENT
2428 is a vector of placement-new arguments (or NULL if none). If NELTS
2429 is NULL, TYPE is the type of the storage to be allocated. If NELTS
2430 is not NULL, then this is an array-new allocation; TYPE is the type
2431 of the elements in the array and NELTS is the number of elements in
2432 the array. *INIT, if non-NULL, is the initializer for the new
2433 object, or an empty vector to indicate an initializer of "()". If
2434 USE_GLOBAL_NEW is true, then the user explicitly wrote "::new"
2435 rather than just "new". This may change PLACEMENT and INIT. */
2437 tree
2440 {
2441 tree rval;
2450 {
2454 }
2457 {
2463 use_global_new);
2473 }
2476 {
2478 {
2481 else
2483 }
2486 }
2488 /* ``A reference cannot be created by the new operator. A reference
2489 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
2490 returned by new.'' ARM 5.3.3 */
2492 {
2495 else
2498 }
2501 {
2505 }
2507 /* The type allocated must be complete. If the new-type-id was
2508 "T[N]" then we are just checking that "T" is complete here, but
2509 that is equivalent, since the value of "N" doesn't matter. */
2518 {
2524 }
2526 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
2531 }
2533 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
2535 tree
2537 {
2543 {
2546 {
2549 }
2551 }
2553 /* Mangle the class$ field. */
2554 {
2555 tree field;
2558 {
2562 }
2564 {
2567 }
2568 }
2572 {
2582 }
2584 }
2585 \f
2586 static tree
2589 {
2590 tree virtual_size;
2594 /* Temporary variables used by the loop. */
2597 /* This is the body of the loop that implements the deletion of a
2598 single element, and moves temp variables to next elements. */
2599 tree body;
2601 /* This is the LOOP_EXPR that governs the deletion of the elements. */
2604 /* This is the thing that governs what to do after the loop has run. */
2607 /* This is the BIND_EXPR which holds the outermost iterator of the
2608 loop. It is convenient to set this variable up and test it before
2609 executing any other code in the loop.
2610 This is also the containing expression returned by this function. */
2612 tree tmp;
2614 /* We should only have 1-D arrays here. */
2620 /* The below is short by the cookie size. */
2629 virtual_size),
2630 tf_warning_or_error);
2639 body = build_compound_expr
2643 tf_warning_or_error));
2644 body = build_compound_expr
2652 no_destructor:
2653 /* If the delete flag is one, or anything else with the low bit set,
2654 delete the storage. */
2656 {
2657 tree base_tbd;
2659 /* The below is short by the cookie size. */
2664 /* no header */
2666 else
2667 {
2668 tree cookie_size;
2671 base_tbd
2674 MINUS_EXPR,
2676 base),
2677 cookie_size,
2678 tf_warning_or_error));
2679 /* True size with header. */
2681 }
2689 }
2693 ;
2696 else
2702 /* Outermost wrapper: If pointer is null, punt. */
2707 integer_zero_node)),
2712 {
2715 }
2718 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
2722 }
2724 /* Create an unnamed variable of the indicated TYPE. */
2726 tree
2728 {
2729 tree decl;
2739 }
2741 /* Create a new temporary variable of the indicated TYPE, initialized
2742 to INIT.
2744 It is not entered into current_binding_level, because that breaks
2745 things when it comes time to do final cleanups (which take place
2746 "outside" the binding contour of the function). */
2748 static tree
2750 {
2751 tree decl;
2757 tf_warning_or_error));
2760 }
2762 /* `build_vec_init' returns tree structure that performs
2763 initialization of a vector of aggregate types.
2765 BASE is a reference to the vector, of ARRAY_TYPE, or a pointer
2766 to the first element, of POINTER_TYPE.
2767 MAXINDEX is the maximum index of the array (one less than the
2768 number of elements). It is only used if BASE is a pointer or
2769 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
2771 INIT is the (possibly NULL) initializer.
2773 If EXPLICIT_VALUE_INIT_P is true, then INIT must be NULL. All
2774 elements in the array are value-initialized.
2776 FROM_ARRAY is 0 if we should init everything with INIT
2777 (i.e., every element initialized from INIT).
2778 FROM_ARRAY is 1 if we should index into INIT in parallel
2779 with initialization of DECL.
2780 FROM_ARRAY is 2 if we should index into INIT in parallel,
2781 but use assignment instead of initialization. */
2783 tree
2787 {
2788 tree rval;
2791 tree iterator;
2792 /* The type of BASE. */
2794 /* The type of an element in the array. */
2796 /* The element type reached after removing all outer array
2797 types. */
2798 tree inner_elt_type;
2799 /* The type of a pointer to an element in the array. */
2800 tree ptype;
2801 tree stmt_expr;
2802 tree compound_stmt;
2819 /* Look through the TARGET_EXPR around a compound literal. */
2832 /* Don't do this if the CONSTRUCTOR might contain something
2833 that might throw and require us to clean up. */
2837 {
2838 /* Do non-default initialization of trivial arrays resulting from
2839 brace-enclosed initializers. In this case, digest_init and
2840 store_constructor will handle the semantics for us. */
2844 }
2848 {
2851 }
2852 else
2855 /* The code we are generating looks like:
2856 ({
2857 T* t1 = (T*) base;
2858 T* rval = t1;
2859 ptrdiff_t iterator = maxindex;
2860 try {
2861 for (; iterator != -1; --iterator) {
2862 ... initialize *t1 ...
2863 ++t1;
2864 }
2865 } catch (...) {
2866 ... destroy elements that were constructed ...
2867 }
2868 rval;
2869 })
2871 We can omit the try and catch blocks if we know that the
2872 initialization will never throw an exception, or if the array
2873 elements do not have destructors. We can omit the loop completely if
2874 the elements of the array do not have constructors.
2876 We actually wrap the entire body of the above in a STMT_EXPR, for
2877 tidiness.
2879 When copying from array to another, when the array elements have
2880 only trivial copy constructors, we should use __builtin_memcpy
2881 rather than generating a loop. That way, we could take advantage
2882 of whatever cleverness the back end has for dealing with copies
2883 of blocks of memory. */
2892 /* If initializing one array from another, initialize element by
2893 element. We rely upon the below calls to do the argument
2894 checking. Evaluate the initializer before entering the try block. */
2896 {
2901 }
2903 /* Protect the entire array initialization so that we can destroy
2904 the partially constructed array if an exception is thrown.
2905 But don't do this if we're assigning. */
2908 {
2910 }
2913 {
2914 /* Do non-default initialization of non-trivial arrays resulting from
2915 brace-enclosed initializers. */
2917 tree elt;
2921 {
2924 num_initialized_elts++;
2929 else
2935 complain));
2937 complain));
2938 }
2940 /* Clear out INIT so that we don't get confused below. */
2942 }
2944 {
2950 {
2954 }
2955 }
2957 /* Now, default-initialize any remaining elements. We don't need to
2958 do that if a) the type does not need constructing, or b) we've
2959 already initialized all the elements.
2961 We do need to keep going if we're copying an array. */
2966 && (num_initialized_elts
2968 {
2969 /* If the ITERATOR is equal to -1, then we don't have to loop;
2970 we've already initialized all the elements. */
2971 tree for_stmt;
2972 tree elt_init;
2973 tree to;
2979 for_stmt);
2981 complain),
2982 for_stmt);
2987 {
2988 tree from;
2992 else
2997 complain);
3002 complain);
3003 else
3005 }
3007 {
3009 sorry
3013 explicit_value_init_p,
3015 }
3019 else
3020 {
3023 }
3030 complain));
3033 complain));
3036 }
3038 /* Make sure to cleanup any partially constructed elements. */
3041 {
3042 tree e;
3045 complain);
3047 /* Flatten multi-dimensional array since build_vec_delete only
3048 expects one-dimensional array. */
3053 complain);
3060 }
3062 /* The value of the array initialization is the array itself, RVAL
3063 is a pointer to the first element. */
3068 /* Now make the result have the correct type. */
3070 {
3075 }
3079 }
3081 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
3082 build_delete. */
3084 static tree
3086 {
3087 tree name;
3088 tree fn;
3090 {
3105 }
3110 flags,
3112 tf_warning_or_error);
3113 }
3115 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
3116 ADDR is an expression which yields the store to be destroyed.
3117 AUTO_DELETE is the name of the destructor to call, i.e., either
3118 sfk_complete_destructor, sfk_base_destructor, or
3119 sfk_deleting_destructor.
3121 FLAGS is the logical disjunction of zero or more LOOKUP_
3122 flags. See cp-tree.h for more info. */
3124 tree
3127 {
3128 tree expr;
3133 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
3134 set to `error_mark_node' before it gets properly cleaned up. */
3143 {
3150 /* We don't want to warn about delete of void*, only other
3151 incomplete types. Deleting other incomplete types
3152 invokes undefined behavior, but it is not ill-formed, so
3153 compile to something that would even do The Right Thing
3154 (TM) should the type have a trivial dtor and no delete
3155 operator. */
3157 {
3160 {
3163 {
3166 "operator delete will be called, even if they are "
3168 }
3170 }
3171 }
3173 /* Call the builtin operator delete. */
3178 /* Throw away const and volatile on target type of addr. */
3180 }
3182 {
3183 handle_array:
3186 {
3189 }
3192 }
3193 else
3194 {
3195 /* Don't check PROTECT here; leave that decision to the
3196 destructor. If the destructor is accessible, call it,
3197 else report error. */
3203 }
3208 {
3214 use_global_delete,
3217 }
3218 else
3219 {
3222 tree ifexp;
3227 /* For `::delete x', we must not use the deleting destructor
3228 since then we would not be sure to get the global `operator
3229 delete'. */
3231 {
3232 /* We will use ADDR multiple times so we must save it. */
3235 /* Delete the object. */
3237 /* Otherwise, treat this like a complete object destructor
3238 call. */
3240 }
3241 /* If the destructor is non-virtual, there is no deleting
3242 variant. Instead, we must explicitly call the appropriate
3243 `operator delete' here. */
3246 {
3247 /* We will use ADDR multiple times so we must save it. */
3249 /* Build the call. */
3251 addr,
3256 /* Call the complete object destructor. */
3258 }
3261 {
3262 /* Make sure we have access to the member op delete, even though
3263 we'll actually be calling it from the destructor. */
3268 }
3271 tf_warning_or_error),
3276 /* We need to calculate this before the dtor changes the vptr. */
3281 /* Explicit destructor call; don't check for null pointer. */
3283 else
3284 /* Handle deleting a null pointer. */
3287 tf_warning_or_error));
3294 }
3295 }
3297 /* At the beginning of a destructor, push cleanups that will call the
3298 destructors for our base classes and members.
3300 Called from begin_destructor_body. */
3302 void
3304 {
3307 tree member;
3308 tree expr;
3311 /* Run destructors for all virtual baseclasses. */
3313 {
3314 tree cond = (condition_conversion
3316 current_in_charge_parm,
3317 integer_two_node)));
3319 /* The CLASSTYPE_VBASECLASSES vector is in initialization
3320 order, which is also the right order for pushing cleanups. */
3323 {
3325 {
3327 base_dtor_identifier,
3328 NULL,
3329 base_binfo,
3330 (LOOKUP_NORMAL
3332 tf_warning_or_error);
3336 }
3337 }
3338 }
3340 /* Take care of the remaining baseclasses. */
3343 {
3349 base_dtor_identifier,
3352 tf_warning_or_error);
3354 }
3358 {
3364 {
3365 tree this_member = (build_class_member_access_expr
3369 tf_warning_or_error));
3372 sfk_complete_destructor,
3376 }
3377 }
3378 }
3380 /* Build a C++ vector delete expression.
3381 MAXINDEX is the number of elements to be deleted.
3382 ELT_SIZE is the nominal size of each element in the vector.
3383 BASE is the expression that should yield the store to be deleted.
3384 This function expands (or synthesizes) these calls itself.
3385 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
3387 This also calls delete for virtual baseclasses of elements of the vector.
3389 Update: MAXINDEX is no longer needed. The size can be extracted from the
3390 start of the vector for pointers, and from the type for arrays. We still
3391 use MAXINDEX for arrays because it happens to already have one of the
3392 values we'd have to extract. (We could use MAXINDEX with pointers to
3393 confirm the size, and trap if the numbers differ; not clear that it'd
3394 be worth bothering.) */
3396 tree
3399 {
3400 tree type;
3401 tree rval;
3407 {
3408 /* Step back one from start of vector, and read dimension. */
3409 tree cookie_addr;
3413 {
3416 }
3421 size_ptr_type,
3423 cookie_addr);
3425 }
3427 {
3428 /* Get the total number of things in the array, maxindex is a
3429 bad name. */
3434 {
3437 }
3438 }
3439 else
3440 {
3444 }
3447 use_global_delete);
3452 }