| blob | 561477ace5787f8182a93af7d944079f435e246a |
1 /* Handle initialization things in C++.
2 Copyright (C) 1987, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010,
4 2011, 2012 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. */
51 /* We are about to generate some complex initialization code.
52 Conceptually, it is all a single expression. However, we may want
53 to include conditionals, loops, and other such statement-level
54 constructs. Therefore, we build the initialization code inside a
55 statement-expression. This function starts such an expression.
56 STMT_EXPR_P and COMPOUND_STMT_P are filled in by this function;
57 pass them back to finish_init_stmts when the expression is
58 complete. */
60 static bool
62 {
69 }
71 /* Finish out the statement-expression begun by the previous call to
72 begin_init_stmts. Returns the statement-expression itself. */
74 static tree
76 {
84 }
86 /* Constructors */
88 /* Called from initialize_vtbl_ptrs via dfs_walk. BINFO is the base
89 which we want to initialize the vtable pointer for, DATA is
90 TREE_LIST whose TREE_VALUE is the this ptr expression. */
92 static tree
94 {
99 {
103 tf_warning_or_error);
106 }
109 }
111 /* Initialize all the vtable pointers in the object pointed to by
112 ADDR. */
114 void
116 {
117 tree list;
118 tree type;
123 /* Walk through the hierarchy, initializing the vptr in each base
124 class. We do these in pre-order because we can't find the virtual
125 bases for a class until we've initialized the vtbl for that
126 class. */
128 }
130 /* Return an expression for the zero-initialization of an object with
131 type T. This expression will either be a constant (in the case
132 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
133 aggregate), or NULL (in the case that T does not require
134 initialization). In either case, the value can be used as
135 DECL_INITIAL for a decl of the indicated TYPE; it is a valid static
136 initializer. If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS
137 is the number of elements in the array. If STATIC_STORAGE_P is
138 TRUE, initializers are only generated for entities for which
139 zero-initialization does not simply mean filling the storage with
140 zero bytes. FIELD_SIZE, if non-NULL, is the bit size of the field,
141 subfields with bit positions at or above that bit size shouldn't
142 be added. Note that this only works when the result is assigned
143 to a base COMPONENT_REF; if we only have a pointer to the base subobject,
144 expand_assignment will end up clearing the full size of TYPE. */
146 static tree
148 tree field_size)
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 ;
185 {
186 tree field;
189 /* Iterate over the fields, building initializations. */
191 {
195 /* Don't add virtual bases for base classes if they are beyond
196 the size of the current field, that means it is present
197 somewhere else in the object. */
199 {
204 }
206 /* Note that for class types there will be FIELD_DECLs
207 corresponding to base classes as well. Thus, iterating
208 over TYPE_FIELDs will result in correct initialization of
209 all of the subobjects. */
211 {
212 tree new_field_size
219 static_storage_p,
220 new_field_size);
223 }
225 /* For unions, only the first field is initialized. */
228 }
230 /* Build a constructor to contain the initializations. */
232 }
234 {
235 tree max_index;
238 /* Iterate over the array elements, building initializations. */
243 else
246 /* If we have an error_mark here, we should just return error mark
247 as we don't know the size of the array yet. */
252 /* A zero-sized array, which is accepted as an extension, will
253 have an upper bound of -1. */
255 {
261 /* If this is a one element array, we just use a regular init. */
264 else
266 max_index);
271 }
273 /* Build a constructor to contain the initializations. */
275 }
278 else
281 /* In all cases, the initializer is a constant. */
286 }
288 /* Return an expression for the zero-initialization of an object with
289 type T. This expression will either be a constant (in the case
290 that T is a scalar), or a CONSTRUCTOR (in the case that T is an
291 aggregate), or NULL (in the case that T does not require
292 initialization). In either case, the value can be used as
293 DECL_INITIAL for a decl of the indicated TYPE; it is a valid static
294 initializer. If NELTS is non-NULL, and TYPE is an ARRAY_TYPE, NELTS
295 is the number of elements in the array. If STATIC_STORAGE_P is
296 TRUE, initializers are only generated for entities for which
297 zero-initialization does not simply mean filling the storage with
298 zero bytes. */
300 tree
302 {
304 }
306 /* Return a suitable initializer for value-initializing an object of type
307 TYPE, as described in [dcl.init]. */
309 tree
311 {
312 /* [dcl.init]
314 To value-initialize an object of type T means:
316 - if T is a class type (clause 9) with a user-provided constructor
317 (12.1), then the default constructor for T is called (and the
318 initialization is ill-formed if T has no accessible default
319 constructor);
321 - if T is a non-union class type without a user-provided constructor,
322 then every non-static data member and base-class component of T is
323 value-initialized;92)
325 - if T is an array type, then each element is value-initialized;
327 - otherwise, the object is zero-initialized.
329 A program that calls for default-initialization or
330 value-initialization of an entity of reference type is ill-formed.
332 92) Value-initialization for such a class object may be implemented by
333 zero-initializing the object and then calling the default
334 constructor. */
336 /* The AGGR_INIT_EXPR tweaking below breaks in templates. */
341 {
342 /* Instead of the above, only consider the user-providedness of the
343 default constructor itself so value-initializing a class with an
344 explicitly defaulted default constructor and another user-provided
345 constructor works properly (c++std-core-19883). */
349 return build_aggr_init_expr
353 complain),
354 complain);
356 {
357 /* This is a class that needs constructing, but doesn't have
358 a user-provided constructor. So we need to zero-initialize
359 the object and then call the implicitly defined ctor.
360 This will be handled in simplify_aggr_init_expr. */
361 tree ctor = build_special_member_call
368 }
369 }
371 }
373 /* Like build_value_init, but don't call the constructor for TYPE. Used
374 for base initializers. */
376 tree
378 {
380 {
384 }
385 /* FIXME the class and array cases should just use digest_init once it is
386 SFINAE-enabled. */
388 {
392 {
393 tree field;
396 /* Iterate over the fields, building initializations. */
398 {
406 /* We could skip vfields and fields of types with
407 user-defined constructors, but I think that won't improve
408 performance at all; it should be simpler in general just
409 to zero out the entire object than try to only zero the
410 bits that actually need it. */
412 /* Note that for class types there will be FIELD_DECLs
413 corresponding to base classes as well. Thus, iterating
414 over TYPE_FIELDs will result in correct initialization of
415 all of the subobjects. */
423 }
425 /* Build a constructor to contain the zero- initializations. */
427 }
428 }
430 {
433 /* Iterate over the array elements, building initializations. */
436 /* If we have an error_mark here, we should just return error mark
437 as we don't know the size of the array yet. */
439 {
442 type);
444 }
447 /* A zero-sized array, which is accepted as an extension, will
448 have an upper bound of -1. */
450 {
456 /* If this is a one element array, we just use a regular init. */
459 else
461 max_index);
468 /* We shouldn't have gotten here for anything that would need
469 non-trivial initialization, and gimplify_init_ctor_preeval
470 would need to be fixed to allow it. */
473 }
475 /* Build a constructor to contain the initializations. */
477 }
479 {
483 }
485 {
489 }
492 }
494 /* Initialize current class with INIT, a TREE_LIST of
495 arguments for a target constructor. If TREE_LIST is void_type_node,
496 an empty initializer list was given. */
498 static void
500 {
505 tf_warning_or_error));
507 {
509 LOOKUP_NORMAL
510 |LOOKUP_NONVIRTUAL
515 }
516 }
518 /* Initialize MEMBER, a FIELD_DECL, with INIT, a TREE_LIST of
519 arguments. If TREE_LIST is void_type_node, an empty initializer
520 list was given; if NULL_TREE no initializer was given. */
522 static void
524 {
525 tree decl;
528 /* Use the non-static data member initializer if there was no
529 mem-initializer for this field. */
531 {
533 /* Do deferred instantiation of the NSDMI. */
534 init = (tsubst_copy_and_build
539 else
540 {
543 {
547 }
548 /* Strip redundant TARGET_EXPR so we don't need to remap it, and
549 so the aggregate init code below will see a CONSTRUCTOR. */
554 }
555 }
560 /* Effective C++ rule 12 requires that all data members be
561 initialized. */
565 member);
567 /* Get an lvalue for the data member. */
571 tf_warning_or_error);
577 {
583 member);
584 }
587 {
588 /* mem() means value-initialization. */
590 {
594 }
595 else
596 {
602 }
603 }
604 /* Deal with this here, as we will get confused if we try to call the
605 assignment op for an anonymous union. This can happen in a
606 synthesized copy constructor. */
608 {
610 {
613 }
614 }
617 /* Pre-digested NSDMI. */
620 /* { } mem-initializer. */
626 {
627 /* With references and list-initialization, we need to deal with
628 extending temporary lifetimes. 12.2p5: "A temporary bound to a
629 reference member in a constructor’s ctor-initializer (12.6.2)
630 persists until the constructor exits." */
635 tf_warning_or_error);
640 /* A FIELD_DECL doesn't really have a suitable lifetime, but
641 make_temporary_var_for_ref_to_temp will treat it as automatic and
642 set_up_extended_ref_temp wants to use the decl in a warning. */
652 }
655 {
657 {
659 {
662 else
666 }
670 {
674 }
675 else
677 }
678 else
679 {
686 /* TYPE_NEEDS_CONSTRUCTING can be set just because we have a
687 vtable; still give this diagnostic. */
692 tf_warning_or_error));
693 }
694 }
695 else
696 {
698 {
699 tree core_type;
700 /* member traversal: note it leaves init NULL */
704 member);
718 }
720 /* There was an explicit member initialization. Do some work
721 in that case. */
723 tf_warning_or_error);
727 tf_warning_or_error));
728 }
731 {
732 tree expr;
737 tf_warning_or_error);
740 tf_warning_or_error);
744 }
745 }
747 /* Returns a TREE_LIST containing (as the TREE_PURPOSE of each node) all
748 the FIELD_DECLs on the TYPE_FIELDS list for T, in reverse order. */
750 static tree
752 {
753 tree fields;
755 /* Note whether or not T is a union. */
760 {
761 tree fieldtype;
763 /* Skip CONST_DECLs for enumeration constants and so forth. */
768 /* Keep track of whether or not any fields are unions. */
772 /* For an anonymous struct or union, we must recursively
773 consider the fields of the anonymous type. They can be
774 directly initialized from the constructor. */
776 {
777 /* Add this field itself. Synthesized copy constructors
778 initialize the entire aggregate. */
780 /* And now add the fields in the anonymous aggregate. */
782 }
783 /* Add this field. */
786 }
789 }
791 /* The MEM_INITS are a TREE_LIST. The TREE_PURPOSE of each list gives
792 a FIELD_DECL or BINFO in T that needs initialization. The
793 TREE_VALUE gives the initializer, or list of initializer arguments.
795 Return a TREE_LIST containing all of the initializations required
796 for T, in the order in which they should be performed. The output
797 list has the same format as the input. */
799 static tree
801 {
802 tree init;
804 tree sorted_inits;
805 tree next_subobject;
810 /* Build up a list of initializations. The TREE_PURPOSE of entry
811 will be the subobject (a FIELD_DECL or BINFO) to initialize. The
812 TREE_VALUE will be the constructor arguments, or NULL if no
813 explicit initialization was provided. */
816 /* Process the virtual bases. */
821 /* Process the direct bases. */
827 /* Process the non-static data members. */
829 /* Reverse the entire list of initializations, so that they are in
830 the order that they will actually be performed. */
833 /* If the user presented the initializers in an order different from
834 that in which they will actually occur, we issue a warning. Keep
835 track of the next subobject which can be explicitly initialized
836 without issuing a warning. */
839 /* Go through the explicit initializers, filling in TREE_PURPOSE in
840 the SORTED_INITS. */
842 {
843 tree subobject;
844 tree subobject_init;
848 /* If the explicit initializers are in sorted order, then
849 SUBOBJECT will be NEXT_SUBOBJECT, or something following
850 it. */
852 subobject_init;
857 /* Issue a warning if the explicit initializer order does not
858 match that which will actually occur.
859 ??? Are all these on the correct lines? */
861 {
865 else
870 else
874 }
876 /* Look again, from the beginning of the list. */
878 {
882 }
884 /* It is invalid to initialize the same subobject more than
885 once. */
887 {
891 subobject);
892 else
895 subobject);
896 }
898 /* Record the initialization. */
901 }
903 /* [class.base.init]
905 If a ctor-initializer specifies more than one mem-initializer for
906 multiple members of the same union (including members of
907 anonymous unions), the ctor-initializer is ill-formed.
909 Here we also splice out uninitialized union members. */
911 {
915 {
916 tree field;
917 tree ctx;
924 /* Skip base classes. */
928 /* If this is an anonymous union with no explicit initializer,
929 splice it out. */
933 /* See if this field is a member of a union, or a member of a
934 structure contained in a union, etc. */
940 /* If this field is not a member of a union, skip it. */
944 /* If this union member has no explicit initializer, splice
945 it out. */
949 /* It's only an error if we have two initializers for the same
950 union type. */
952 {
955 }
957 /* See if LAST_FIELD and the field initialized by INIT are
958 members of the same union. If so, there's a problem,
959 unless they're actually members of the same structure
960 which is itself a member of a union. For example, given:
962 union { struct { int i; int j; }; };
964 initializing both `i' and `j' makes sense. */
967 do
968 {
969 tree last_ctx;
973 {
975 {
979 last_ctx);
982 }
988 }
990 /* If we've reached the outermost class, then we're
991 done. */
996 }
1001 next:
1004 splice:
1007 }
1008 }
1011 }
1013 /* Initialize all bases and members of CURRENT_CLASS_TYPE. MEM_INITS
1014 is a TREE_LIST giving the explicit mem-initializer-list for the
1015 constructor. The TREE_PURPOSE of each entry is a subobject (a
1016 FIELD_DECL or a BINFO) of the CURRENT_CLASS_TYPE. The TREE_VALUE
1017 is a TREE_LIST giving the arguments to the constructor or
1018 void_type_node for an empty list of arguments. */
1020 void
1022 {
1025 /* We will already have issued an error message about the fact that
1026 the type is incomplete. */
1033 {
1034 /* Delegating constructor. */
1038 }
1043 /* Sort the mem-initializers into the order in which the
1044 initializations should be performed. */
1049 /* Initialize base classes. */
1052 {
1057 {
1058 /* If these initializations are taking place in a copy constructor,
1059 the base class should probably be explicitly initialized if there
1060 is a user-defined constructor in the base class (other than the
1061 default constructor, which will be called anyway). */
1069 }
1071 /* Initialize the base. */
1074 else
1075 {
1076 tree base_addr;
1082 tf_warning_or_error),
1083 arguments,
1084 flags,
1085 tf_warning_or_error);
1087 }
1090 }
1093 /* Initialize the vptrs. */
1096 /* Initialize the data members. */
1098 {
1102 }
1103 }
1105 /* Returns the address of the vtable (i.e., the value that should be
1106 assigned to the vptr) for BINFO. */
1108 static tree
1110 {
1112 tree vtbl;
1115 /* If this is a virtual primary base, then the vtable we want to store
1116 is that for the base this is being used as the primary base of. We
1117 can't simply skip the initialization, because we may be expanding the
1118 inits of a subobject constructor where the virtual base layout
1119 can be different. */
1123 /* Figure out what vtable BINFO's vtable is based on, and mark it as
1124 used. */
1128 /* Now compute the address to use when initializing the vptr. */
1134 }
1136 /* This code sets up the virtual function tables appropriate for
1137 the pointer DECL. It is a one-ply initialization.
1139 BINFO is the exact type that DECL is supposed to be. In
1140 multiple inheritance, this might mean "C's A" if C : A, B. */
1142 static void
1144 {
1146 tree vtt_index;
1148 /* Compute the initializer for vptr. */
1151 /* We may get this vptr from a VTT, if this is a subobject
1152 constructor or subobject destructor. */
1155 {
1156 tree vtbl2;
1157 tree vtt_parm;
1159 /* Compute the value to use, when there's a VTT. */
1165 /* The actual initializer is the VTT value only in the subobject
1166 constructor. In maybe_clone_body we'll substitute NULL for
1167 the vtt_parm in the case of the non-subobject constructor. */
1172 vtbl2,
1173 vtbl);
1174 }
1176 /* Compute the location of the vtpr. */
1178 tf_warning_or_error),
1182 /* Assign the vtable to the vptr. */
1185 tf_warning_or_error));
1186 }
1188 /* If an exception is thrown in a constructor, those base classes already
1189 constructed must be destroyed. This function creates the cleanup
1190 for BINFO, which has just been constructed. If FLAG is non-NULL,
1191 it is a DECL which is nonzero when this base needs to be
1192 destroyed. */
1194 static void
1196 {
1197 tree expr;
1202 /* Call the destructor. */
1204 base_dtor_identifier,
1205 NULL,
1206 binfo,
1208 tf_warning_or_error);
1216 }
1218 /* Construct the virtual base-class VBASE passing the ARGUMENTS to its
1219 constructor. */
1221 static void
1223 {
1224 tree inner_if_stmt;
1225 tree exp;
1226 tree flag;
1228 /* If there are virtual base classes with destructors, we need to
1229 emit cleanups to destroy them if an exception is thrown during
1230 the construction process. These exception regions (i.e., the
1231 period during which the cleanups must occur) begin from the time
1232 the construction is complete to the end of the function. If we
1233 create a conditional block in which to initialize the
1234 base-classes, then the cleanup region for the virtual base begins
1235 inside a block, and ends outside of that block. This situation
1236 confuses the sjlj exception-handling code. Therefore, we do not
1237 create a single conditional block, but one for each
1238 initialization. (That way the cleanup regions always begin
1239 in the outer block.) We trust the back end to figure out
1240 that the FLAG will not change across initializations, and
1241 avoid doing multiple tests. */
1246 /* Compute the location of the virtual base. If we're
1247 constructing virtual bases, then we must be the most derived
1248 class. Therefore, we don't have to look up the virtual base;
1249 we already know where it is. */
1258 }
1260 /* Find the context in which this FIELD can be initialized. */
1262 static tree
1264 {
1267 /* Anonymous union members can be initialized in the first enclosing
1268 non-anonymous union context. */
1272 }
1274 /* Function to give error message if member initialization specification
1275 is erroneous. FIELD is the member we decided to initialize.
1276 TYPE is the type for which the initialization is being performed.
1277 FIELD must be a member of TYPE.
1279 MEMBER_NAME is the name of the member. */
1281 static int
1283 {
1287 {
1289 member_name);
1291 }
1293 {
1296 field);
1298 }
1300 {
1304 }
1306 {
1308 member_name);
1310 }
1313 }
1315 /* NAME is a FIELD_DECL, an IDENTIFIER_NODE which names a field, or it
1316 is a _TYPE node or TYPE_DECL which names a base for that type.
1317 Check the validity of NAME, and return either the base _TYPE, base
1318 binfo, or the FIELD_DECL of the member. If NAME is invalid, return
1319 NULL_TREE and issue a diagnostic.
1321 An old style unnamed direct single base construction is permitted,
1322 where NAME is NULL. */
1324 tree
1326 {
1327 tree basetype;
1328 tree field;
1334 {
1335 /* This is an obsolete unnamed base class initializer. The
1336 parser will already have warned about its use. */
1338 {
1341 current_class_type);
1344 basetype = BINFO_TYPE
1349 current_class_type);
1351 }
1352 }
1354 {
1357 }
1360 else
1364 {
1365 tree class_binfo;
1366 tree direct_binfo;
1367 tree virtual_binfo;
1378 /* Look for a direct base. */
1383 /* Look for a virtual base -- unless the direct base is itself
1384 virtual. */
1388 /* [class.base.init]
1390 If a mem-initializer-id is ambiguous because it designates
1391 both a direct non-virtual base class and an inherited virtual
1392 base class, the mem-initializer is ill-formed. */
1394 {
1396 basetype);
1398 }
1401 {
1405 else
1409 }
1412 }
1413 else
1414 {
1417 else
1422 }
1425 }
1427 /* This is like `expand_member_init', only it stores one aggregate
1428 value into another.
1430 INIT comes in two flavors: it is either a value which
1431 is to be stored in EXP, or it is a parameter list
1432 to go to a constructor, which will operate on EXP.
1433 If INIT is not a parameter list for a constructor, then set
1434 LOOKUP_ONLYCONVERTING.
1435 If FLAGS is LOOKUP_ONLYCONVERTING then it is the = init form of
1436 the initializer, if FLAGS is 0, then it is the (init) form.
1437 If `init' is a CONSTRUCTOR, then we emit a warning message,
1438 explaining that such initializations are invalid.
1440 If INIT resolves to a CALL_EXPR which happens to return
1441 something of the type we are looking for, then we know
1442 that we can safely use that call to perform the
1443 initialization.
1445 The virtual function table pointer cannot be set up here, because
1446 we do not really know its type.
1448 This never calls operator=().
1450 When initializing, nothing is CONST.
1452 A default copy constructor may have to be used to perform the
1453 initialization.
1455 A constructor or a conversion operator may have to be used to
1456 perform the initialization, but not both, as it would be ambiguous. */
1458 tree
1460 {
1461 tree stmt_expr;
1462 tree compound_stmt;
1483 {
1484 tree itype;
1486 /* An array may not be initialized use the parenthesized
1487 initialization form -- unless the initializer is "()". */
1489 {
1493 }
1494 /* Must arrange to initialize each element of EXP
1495 from elements of INIT. */
1505 complain);
1512 }
1515 /* Just know that we've seen something for this node. */
1529 }
1531 static void
1533 tsubst_flags_t complain)
1534 {
1536 tree ctor_name;
1538 /* It fails because there may not be a constructor which takes
1539 its own type as the first (or only parameter), but which does
1540 take other types via a conversion. So, if the thing initializing
1541 the expression is a unit element of type X, first try X(X&),
1542 followed by initialization by X. If neither of these work
1543 out, then look hard. */
1544 tree rval;
1547 /* If we have direct-initialization from an initializer list, pull
1548 it out of the TREE_LIST so the code below can see it. */
1552 {
1556 }
1560 /* A brace-enclosed initializer for an aggregate. In C++0x this can
1561 happen for direct-initialization, too. */
1564 /* A CONSTRUCTOR of the target's type is a previously digested
1565 initializer, whether that happened just above or in
1566 cp_parser_late_parsing_nsdmi.
1568 A TARGET_EXPR with TARGET_EXPR_DIRECT_INIT_P or TARGET_EXPR_LIST_INIT_P
1569 set represents the whole initialization, so we shouldn't build up
1570 another ctor call. */
1577 {
1578 /* Early initialization via a TARGET_EXPR only works for
1579 complete objects. */
1586 }
1590 {
1591 /* Base subobjects should only get direct-initialization. */
1595 /* Do nothing. We hit this in two cases: Reference initialization,
1596 where we aren't initializing a real variable, so we don't want
1597 to run a new constructor; and catching an exception, where we
1598 have already built up the constructor call so we could wrap it
1600 else
1605 /* We need to protect the initialization of a catch parm with a
1606 call to terminate(), which shows up as a MUST_NOT_THROW_EXPR
1607 around the TARGET_EXPR for the copy constructor. See
1608 initialize_handler_parm. */
1609 {
1613 }
1614 else
1619 }
1624 {
1628 }
1629 else
1634 {
1635 /* Delegating constructor. */
1636 tree complete;
1637 tree base;
1640 /* Unshare the arguments for the second call. */
1643 {
1646 }
1649 complain);
1655 complain);
1660 base,
1661 complete);
1662 }
1663 else
1664 {
1667 else
1670 complain);
1671 }
1677 {
1680 {
1684 }
1685 }
1687 /* FIXME put back convert_to_void? */
1690 }
1692 /* This function is responsible for initializing EXP with INIT
1693 (if any).
1695 BINFO is the binfo of the type for who we are performing the
1696 initialization. For example, if W is a virtual base class of A and B,
1697 and C : A, B.
1698 If we are initializing B, then W must contain B's W vtable, whereas
1699 were we initializing C, W must contain C's W vtable.
1701 TRUE_EXP is nonzero if it is the true expression being initialized.
1702 In this case, it may be EXP, or may just contain EXP. The reason we
1703 need this is because if EXP is a base element of TRUE_EXP, we
1704 don't necessarily know by looking at EXP where its virtual
1705 baseclass fields should really be pointing. But we do know
1706 from TRUE_EXP. In constructors, we don't know anything about
1707 the value being initialized.
1709 FLAGS is just passed to `build_new_method_call'. See that function
1710 for its description. */
1712 static void
1714 tsubst_flags_t complain)
1715 {
1721 /* Use a function returning the desired type to initialize EXP for us.
1722 If the function is a constructor, and its first argument is
1723 NULL_TREE, know that it was meant for us--just slide exp on
1724 in and expand the constructor. Constructors now come
1725 as TARGET_EXPRs. */
1729 {
1731 /* If store_init_value returns NULL_TREE, the INIT has been
1732 recorded as the DECL_INITIAL for EXP. That means there's
1733 nothing more we have to do. */
1739 }
1741 /* If an explicit -- but empty -- initializer list was present,
1742 that's value-initialization. */
1744 {
1745 /* If the type has data but no user-provided ctor, we need to zero
1746 out the object. */
1749 {
1752 /* Don't clobber already initialized virtual bases. */
1755 field_size);
1758 }
1760 /* If we don't need to mess with the constructor at all,
1761 then we're done. */
1765 /* Otherwise fall through and call the constructor. */
1767 }
1769 /* We know that expand_default_init can handle everything we want
1770 at this point. */
1772 }
1774 /* Report an error if TYPE is not a user-defined, class type. If
1775 OR_ELSE is nonzero, give an error message. */
1777 int
1779 {
1784 {
1788 }
1790 }
1792 tree
1794 {
1800 else
1802 }
1804 /* Build a reference to a member of an aggregate. This is not a C++
1805 `&', but really something which can have its address taken, and
1806 then act as a pointer to member, for example TYPE :: FIELD can have
1807 its address taken by saying & TYPE :: FIELD. ADDRESS_P is true if
1808 this expression is the operand of "&".
1810 @@ Prints out lousy diagnostics for operator <typename>
1811 @@ fields.
1813 @@ This function should be rewritten and placed in search.c. */
1815 tree
1817 {
1818 tree decl;
1821 /* class templates can come in as TEMPLATE_DECLs here. */
1834 /* Callers should call mark_used before this point. */
1839 {
1842 }
1844 /* Entities other than non-static members need no further
1845 processing. */
1852 {
1855 }
1857 /* Set up BASEBINFO for member lookup. */
1860 /* A lot of this logic is now handled in lookup_member. */
1862 {
1863 /* Go from the TREE_BASELINK to the member function info. */
1867 {
1868 /* Get rid of a potential OVERLOAD around it. */
1871 /* Unique functions are handled easily. */
1873 /* For non-static member of base class, we need a special rule
1874 for access checking [class.protected]:
1876 If the access is to form a pointer to member, the
1877 nested-name-specifier shall name the derived class
1878 (or any class derived from that class). */
1882 tf_warning_or_error);
1883 else
1885 tf_warning_or_error);
1890 }
1891 else
1893 }
1895 /* We need additional test besides the one in
1896 check_accessibility_of_qualified_id in case it is
1897 a pointer to non-static member. */
1899 tf_warning_or_error);
1902 {
1903 /* If MEMBER is non-static, then the program has fallen afoul of
1904 [expr.prim]:
1906 An id-expression that denotes a nonstatic data member or
1907 nonstatic member function of a class can only be used:
1909 -- as part of a class member access (_expr.ref_) in which the
1910 object-expression refers to the member's class or a class
1911 derived from that class, or
1913 -- to form a pointer to member (_expr.unary.op_), or
1915 -- in the body of a nonstatic member function of that class or
1916 of a class derived from that class (_class.mfct.nonstatic_), or
1918 -- in a mem-initializer for a constructor for that class or for
1919 a class derived from that class (_class.base.init_). */
1921 {
1922 /* Build a representation of the qualified name suitable
1923 for use as the operand to "&" -- even though the "&" is
1924 not actually present. */
1926 /* In Microsoft mode, treat a non-static member function as if
1927 it were a pointer-to-member. */
1929 {
1932 }
1936 }
1938 {
1941 }
1943 }
1948 }
1950 /* If DECL is a scalar enumeration constant or variable with a
1951 constant initializer, return the initializer (or, its initializers,
1952 recursively); otherwise, return DECL. If INTEGRAL_P, the
1953 initializer is only returned if DECL is an integral
1954 constant-expression. If RETURN_AGGREGATE_CST_OK_P, it is ok to
1955 return an aggregate constant. */
1957 static tree
1959 {
1961 || (integral_p
1965 {
1966 tree init;
1967 /* If DECL is a static data member in a template
1968 specialization, we must instantiate it here. The
1969 initializer for the static data member is not processed
1970 until needed; we need it now. */
1975 {
1977 /* Treat the error as a constant to avoid cascading errors on
1978 excessively recursive template instantiation (c++/9335). */
1980 else
1982 }
1983 /* Initializers in templates are generally expanded during
1984 instantiation, so before that for const int i(2)
1985 INIT is a TREE_LIST with the actual initializer as
1986 TREE_VALUE. */
1988 && init
1996 /* Unless RETURN_AGGREGATE_CST_OK_P is true, do not
1997 return an aggregate constant (of which string
1998 literals are a special case), as we do not want
1999 to make inadvertent copies of such entities, and
2000 we must be sure that their addresses are the
2001 same everywhere. */
2006 }
2008 }
2010 /* If DECL is a CONST_DECL, or a constant VAR_DECL initialized by
2011 constant of integral or enumeration type, then return that value.
2012 These are those variables permitted in constant expressions by
2013 [5.19/1]. */
2015 tree
2017 {
2020 }
2022 /* A more relaxed version of integral_constant_value, used by the
2023 common C/C++ code. */
2025 tree
2027 {
2030 }
2032 /* A version of integral_constant_value used by the C++ front end for
2033 optimization purposes. */
2035 tree
2037 {
2040 }
2041 \f
2042 /* Common subroutines of build_new and build_vec_delete. */
2044 /* Call the global __builtin_delete to delete ADDR. */
2046 static tree
2048 {
2051 }
2052 \f
2053 /* Build and return a NEW_EXPR. If NELTS is non-NULL, TYPE[NELTS] is
2054 the type of the object being allocated; otherwise, it's just TYPE.
2055 INIT is the initializer, if any. USE_GLOBAL_NEW is true if the
2056 user explicitly wrote "::operator new". PLACEMENT, if non-NULL, is
2057 a vector of arguments to be provided as arguments to a placement
2058 new operator. This routine performs no semantic checks; it just
2059 creates and returns a NEW_EXPR. */
2061 static tree
2064 {
2065 tree init_list;
2066 tree new_expr;
2068 /* If INIT is NULL, the we want to store NULL_TREE in the NEW_EXPR.
2069 If INIT is not NULL, then we want to store VOID_ZERO_NODE. This
2070 permits us to distinguish the case of a missing initializer "new
2071 int" from an empty initializer "new int()". */
2076 else
2081 init_list);
2086 }
2088 /* Diagnose uninitialized const members or reference members of type
2089 TYPE. USING_NEW is used to disambiguate the diagnostic between a
2090 new expression without a new-initializer and a declaration. Returns
2091 the error count. */
2093 static int
2096 {
2097 tree field;
2104 {
2105 tree field_type;
2116 {
2119 {
2123 else
2127 }
2128 }
2131 {
2134 {
2138 else
2142 }
2143 }
2146 error_count
2149 }
2151 }
2153 int
2155 {
2157 }
2159 /* Generate code for a new-expression, including calling the "operator
2160 new" function, initializing the object, and, if an exception occurs
2161 during construction, cleaning up. The arguments are as for
2162 build_raw_new_expr. This may change PLACEMENT and INIT. */
2164 static tree
2167 tsubst_flags_t complain)
2168 {
2170 /* True iff this is a call to "operator new[]" instead of just
2171 "operator new". */
2173 /* If ARRAY_P is true, the element type of the array. This is never
2174 an ARRAY_TYPE; for something like "new int[3][4]", the
2175 ELT_TYPE is "int". If ARRAY_P is false, this is the same type as
2176 TYPE. */
2177 tree elt_type;
2178 /* The type of the new-expression. (This type is always a pointer
2179 type.) */
2180 tree pointer_type;
2181 tree non_const_pointer_type;
2183 /* For arrays, a bounds checks on the NELTS parameter. */
2188 /* The address returned by the call to "operator new". This node is
2189 a VAR_DECL and is therefore reusable. */
2190 tree alloc_node;
2191 tree alloc_fn;
2195 /* If non-NULL, the number of extra bytes to allocate at the
2196 beginning of the storage allocated for an array-new expression in
2197 order to store the number of elements. */
2199 tree placement_first;
2201 /* True if the function we are calling is a placement allocation
2202 function. */
2204 /* True if the storage must be initialized, either by a constructor
2205 or due to an explicit new-initializer. */
2207 /* The address of the thing allocated, not including any cookie. In
2208 particular, if an array cookie is in use, DATA_ADDR is the
2209 address of the first array element. This node is a VAR_DECL, and
2210 is therefore reusable. */
2211 tree data_addr;
2215 {
2218 }
2220 {
2221 /* Transforms new (T[N]) to new T[N]. The former is a GNU
2222 extension for variable N. (This also covers new T where T is
2223 a VLA typedef.) */
2229 }
2231 /* If our base type is an array, then make sure we know how many elements
2232 it has. */
2236 {
2241 {
2242 double_int result;
2247 {
2251 }
2253 }
2254 else
2255 {
2257 {
2261 }
2263 }
2267 inner_nelts_cst,
2268 complain);
2269 }
2272 {
2275 }
2280 /* Warn if we performed the (T[N]) to T[N] transformation and N is
2281 variable. */
2284 {
2288 else
2290 }
2293 {
2297 }
2305 {
2307 /* A program that calls for default-initialization [...] of an
2308 entity of reference type is ill-formed. */
2312 /* A new-expression that creates an object of type T initializes
2313 that object as follows:
2314 - If the new-initializer is omitted:
2315 -- If T is a (possibly cv-qualified) non-POD class type
2316 (or array thereof), the object is default-initialized (8.5).
2317 [...]
2318 -- Otherwise, the object created has indeterminate
2319 value. If T is a const-qualified type, or a (possibly
2320 cv-qualified) POD class type (or array thereof)
2321 containing (directly or indirectly) a member of
2322 const-qualified type, the program is ill-formed; */
2332 }
2336 {
2340 }
2344 {
2345 /* Maximum available size in bytes. Half of the address space
2346 minus the cookie size. */
2347 double_int max_size
2350 /* Size of the inner array elements. */
2351 double_int inner_size;
2352 /* Maximum number of outer elements which can be allocated. */
2353 double_int max_outer_nelts;
2354 tree max_outer_nelts_tree;
2361 /* Unconditionally substract the cookie size. This decreases the
2362 maximum object size and is safe even if we choose not to use
2363 a cookie after all. */
2369 {
2373 }
2375 /* Only keep the top-most seven bits, to simplify encoding the
2376 constant in the instruction stream. */
2377 {
2381 max_outer_nelts
2386 }
2391 outer_nelts,
2392 max_outer_nelts_tree);
2393 }
2397 /* If PLACEMENT is a single simple pointer type not passed by
2398 reference, prepare to capture it in a temporary variable. Do
2399 this now, since PLACEMENT will change in the calls below. */
2406 /* Allocate the object. */
2408 {
2409 tree class_addr;
2419 {
2423 }
2425 {
2429 }
2434 }
2436 {
2439 }
2440 else
2441 {
2442 tree fnname;
2443 tree fns;
2449 && (array_p
2452 {
2453 /* Use a class-specific operator new. */
2454 /* If a cookie is required, add some extra space. */
2457 else
2459 /* Perform the overflow check. */
2463 /* Create the argument list. */
2465 /* Do name-lookup to find the appropriate operator. */
2468 {
2472 }
2474 {
2476 {
2479 }
2481 }
2485 LOOKUP_NORMAL,
2487 complain);
2488 }
2489 else
2490 {
2491 /* Use a global operator new. */
2492 /* See if a cookie might be required. */
2498 outer_nelts_check,
2500 }
2501 }
2508 /* If we found a simple case of PLACEMENT_EXPR above, then copy it
2509 into a temporary variable. */
2516 {
2521 {
2525 }
2526 }
2528 /* In the simple case, we can stop now. */
2533 /* Store the result of the allocation call in a variable so that we can
2534 use it more than once. */
2538 /* Strip any COMPOUND_EXPRs from ALLOC_CALL. */
2542 /* Now, check to see if this function is actually a placement
2543 allocation function. This can happen even when PLACEMENT is NULL
2544 because we might have something like:
2546 struct S { void* operator new (size_t, int i = 0); };
2548 A call to `new S' will get this allocation function, even though
2549 there is no explicit placement argument. If there is more than
2550 one argument, or there are variable arguments, then this is a
2551 placement allocation function. */
2552 placement_allocation_fn_p
2556 /* Preevaluate the placement args so that we don't reevaluate them for a
2557 placement delete. */
2559 {
2560 tree inits;
2564 alloc_expr);
2565 }
2567 /* unless an allocation function is declared with an empty excep-
2568 tion-specification (_except.spec_), throw(), it indicates failure to
2569 allocate storage by throwing a bad_alloc exception (clause _except_,
2570 _lib.bad.alloc_); it returns a non-null pointer otherwise If the allo-
2571 cation function is declared with an empty exception-specification,
2572 throw(), it returns null to indicate failure to allocate storage and a
2573 non-null pointer otherwise.
2575 So check for a null exception spec on the op new we just called. */
2581 {
2582 tree cookie;
2583 tree cookie_ptr;
2584 tree size_ptr_type;
2586 /* Adjust so we're pointing to the start of the object. */
2589 /* Store the number of bytes allocated so that we can know how
2590 many elements to destroy later. We use the last sizeof
2591 (size_t) bytes to store the number of elements. */
2602 {
2603 /* Also store the element size. */
2614 }
2615 }
2616 else
2617 {
2620 }
2622 /* Now use a pointer to the type we've actually allocated. */
2624 /* But we want to operate on a non-const version to start with,
2625 since we'll be modifying the elements. */
2626 non_const_pointer_type = build_pointer_type
2630 /* Any further uses of alloc_node will want this type, too. */
2633 /* Now initialize the allocated object. Note that we preevaluate the
2634 initialization expression, apart from the actual constructor call or
2635 assignment--we do this because we want to delay the allocation as long
2636 as possible in order to minimize the size of the exception region for
2637 placement delete. */
2639 {
2644 {
2647 }
2650 {
2651 /* build_value_init doesn't work in templates, and we don't need
2652 the initializer anyway since we're going to throw it away and
2653 rebuild it at instantiation time, so just build up a single
2654 constructor call to get any appropriate diagnostics. */
2658 complete_ctor_identifier,
2660 LOOKUP_NORMAL,
2661 complain);
2663 }
2665 {
2670 {
2674 else
2675 {
2679 complain);
2680 else
2681 {
2686 }
2689 }
2690 }
2692 {
2696 else
2699 }
2700 init_expr
2704 integer_one_node,
2705 complain),
2706 vecinit,
2707 explicit_value_init_p,
2709 complain);
2711 /* An array initialization is stable because the initialization
2712 of each element is a full-expression, so the temporaries don't
2713 leak out. */
2715 }
2716 else
2717 {
2721 {
2723 complete_ctor_identifier,
2725 LOOKUP_NORMAL,
2726 complain);
2727 }
2729 {
2730 /* Something like `new int()'. */
2735 }
2736 else
2737 {
2738 tree ie;
2740 /* We are processing something like `new int (10)', which
2741 means allocate an int, and initialize it with 10. */
2745 complain);
2746 }
2748 }
2753 /* If any part of the object initialization terminates by throwing an
2754 exception and a suitable deallocation function can be found, the
2755 deallocation function is called to free the memory in which the
2756 object was being constructed, after which the exception continues
2757 to propagate in the context of the new-expression. If no
2758 unambiguous matching deallocation function can be found,
2759 propagating the exception does not cause the object's memory to be
2760 freed. */
2762 {
2764 tree cleanup;
2766 /* The Standard is unclear here, but the right thing to do
2767 is to use the same method for finding deallocation
2768 functions that we use for finding allocation functions. */
2769 cleanup = (build_op_delete_call
2771 alloc_node,
2772 size,
2773 globally_qualified_p,
2775 alloc_fn,
2776 complain));
2781 /* This is much simpler if we were able to preevaluate all of
2782 the arguments to the constructor call. */
2783 {
2784 /* CLEANUP is compiler-generated, so no diagnostics. */
2788 /* Likewise, this try-catch is compiler-generated. */
2790 }
2791 else
2792 /* Ack! First we allocate the memory. Then we set our sentry
2793 variable to true, and expand a cleanup that deletes the
2794 memory if sentry is true. Then we run the constructor, and
2795 finally clear the sentry.
2797 We need to do this because we allocate the space first, so
2798 if there are any temporaries with cleanups in the
2799 constructor args and we weren't able to preevaluate them, we
2800 need this EH region to extend until end of full-expression
2801 to preserve nesting. */
2802 {
2810 /* CLEANUP is compiler-generated, so no diagnostics. */
2820 init_expr
2823 end));
2824 /* Likewise, this is compiler-generated. */
2826 }
2827 }
2828 }
2829 else
2832 /* Now build up the return value in reverse order. */
2842 /* If we don't have an initializer or a cookie, strip the TARGET_EXPR
2843 and return the call (which doesn't need to be adjusted). */
2845 else
2846 {
2848 {
2851 nullptr_node,
2852 complain);
2854 complain);
2855 }
2857 /* Perform the allocation before anything else, so that ALLOC_NODE
2858 has been initialized before we start using it. */
2860 }
2865 /* A new-expression is never an lvalue. */
2869 }
2871 /* Generate a representation for a C++ "new" expression. *PLACEMENT
2872 is a vector of placement-new arguments (or NULL if none). If NELTS
2873 is NULL, TYPE is the type of the storage to be allocated. If NELTS
2874 is not NULL, then this is an array-new allocation; TYPE is the type
2875 of the elements in the array and NELTS is the number of elements in
2876 the array. *INIT, if non-NULL, is the initializer for the new
2877 object, or an empty vector to indicate an initializer of "()". If
2878 USE_GLOBAL_NEW is true, then the user explicitly wrote "::new"
2879 rather than just "new". This may change PLACEMENT and INIT. */
2881 tree
2884 {
2885 tree rval;
2894 /* Don't do auto deduction where it might affect mangling. */
2896 {
2899 {
2903 }
2904 }
2907 {
2913 use_global_new);
2923 }
2926 {
2928 {
2931 else
2933 }
2936 }
2938 /* ``A reference cannot be created by the new operator. A reference
2939 is not an object (8.2.2, 8.4.3), so a pointer to it could not be
2940 returned by new.'' ARM 5.3.3 */
2942 {
2945 else
2948 }
2951 {
2955 }
2957 /* The type allocated must be complete. If the new-type-id was
2958 "T[N]" then we are just checking that "T" is complete here, but
2959 that is equivalent, since the value of "N" doesn't matter. */
2968 {
2974 }
2976 /* Wrap it in a NOP_EXPR so warn_if_unused_value doesn't complain. */
2981 }
2983 /* Given a Java class, return a decl for the corresponding java.lang.Class. */
2985 tree
2987 {
2993 {
2996 {
2999 }
3001 }
3003 /* Mangle the class$ field. */
3004 {
3005 tree field;
3008 {
3012 }
3014 {
3017 }
3018 }
3022 {
3032 }
3034 }
3035 \f
3036 static tree
3038 special_function_kind auto_delete_vec,
3040 {
3041 tree virtual_size;
3045 /* Temporary variables used by the loop. */
3048 /* This is the body of the loop that implements the deletion of a
3049 single element, and moves temp variables to next elements. */
3050 tree body;
3052 /* This is the LOOP_EXPR that governs the deletion of the elements. */
3055 /* This is the thing that governs what to do after the loop has run. */
3058 /* This is the BIND_EXPR which holds the outermost iterator of the
3059 loop. It is convenient to set this variable up and test it before
3060 executing any other code in the loop.
3061 This is also the containing expression returned by this function. */
3063 tree tmp;
3065 /* We should only have 1-D arrays here. */
3074 /* The below is short by the cookie size. */
3079 tbase_init
3083 base),
3084 virtual_size),
3085 complain);
3103 complain);
3111 no_destructor:
3112 /* Delete the storage if appropriate. */
3114 {
3115 tree base_tbd;
3117 /* The below is short by the cookie size. */
3122 /* no header */
3124 else
3125 {
3126 tree cookie_size;
3130 MINUS_EXPR,
3133 cookie_size,
3134 complain);
3138 /* True size with header. */
3140 }
3147 complain);
3148 }
3152 ;
3155 else
3161 /* Outermost wrapper: If pointer is null, punt. */
3166 nullptr_node)),
3171 {
3174 }
3177 /* Pre-evaluate the SAVE_EXPR outside of the BIND_EXPR. */
3181 }
3183 /* Create an unnamed variable of the indicated TYPE. */
3185 tree
3187 {
3188 tree decl;
3198 }
3200 /* Create a new temporary variable of the indicated TYPE, initialized
3201 to INIT.
3203 It is not entered into current_binding_level, because that breaks
3204 things when it comes time to do final cleanups (which take place
3205 "outside" the binding contour of the function). */
3207 tree
3209 {
3210 tree decl;
3216 tf_warning_or_error));
3219 }
3221 /* `build_vec_init' returns tree structure that performs
3222 initialization of a vector of aggregate types.
3224 BASE is a reference to the vector, of ARRAY_TYPE, or a pointer
3225 to the first element, of POINTER_TYPE.
3226 MAXINDEX is the maximum index of the array (one less than the
3227 number of elements). It is only used if BASE is a pointer or
3228 TYPE_DOMAIN (TREE_TYPE (BASE)) == NULL_TREE.
3230 INIT is the (possibly NULL) initializer.
3232 If EXPLICIT_VALUE_INIT_P is true, then INIT must be NULL. All
3233 elements in the array are value-initialized.
3235 FROM_ARRAY is 0 if we should init everything with INIT
3236 (i.e., every element initialized from INIT).
3237 FROM_ARRAY is 1 if we should index into INIT in parallel
3238 with initialization of DECL.
3239 FROM_ARRAY is 2 if we should index into INIT in parallel,
3240 but use assignment instead of initialization. */
3242 tree
3246 {
3247 tree rval;
3250 tree iterator;
3251 /* The type of BASE. */
3253 /* The type of an element in the array. */
3255 /* The element type reached after removing all outer array
3256 types. */
3257 tree inner_elt_type;
3258 /* The type of a pointer to an element in the array. */
3259 tree ptype;
3260 tree stmt_expr;
3261 tree compound_stmt;
3283 /* Look through the TARGET_EXPR around a compound literal. */
3296 /* Don't do this if the CONSTRUCTOR might contain something
3297 that might throw and require us to clean up. */
3301 {
3302 /* Do non-default initialization of trivial arrays resulting from
3303 brace-enclosed initializers. In this case, digest_init and
3304 store_constructor will handle the semantics for us. */
3308 }
3312 {
3318 }
3319 else
3322 /* The code we are generating looks like:
3323 ({
3324 T* t1 = (T*) base;
3325 T* rval = t1;
3326 ptrdiff_t iterator = maxindex;
3327 try {
3328 for (; iterator != -1; --iterator) {
3329 ... initialize *t1 ...
3330 ++t1;
3331 }
3332 } catch (...) {
3333 ... destroy elements that were constructed ...
3334 }
3335 rval;
3336 })
3338 We can omit the try and catch blocks if we know that the
3339 initialization will never throw an exception, or if the array
3340 elements do not have destructors. We can omit the loop completely if
3341 the elements of the array do not have constructors.
3343 We actually wrap the entire body of the above in a STMT_EXPR, for
3344 tidiness.
3346 When copying from array to another, when the array elements have
3347 only trivial copy constructors, we should use __builtin_memcpy
3348 rather than generating a loop. That way, we could take advantage
3349 of whatever cleverness the back end has for dealing with copies
3350 of blocks of memory. */
3359 /* If initializing one array from another, initialize element by
3360 element. We rely upon the below calls to do the argument
3361 checking. Evaluate the initializer before entering the try block. */
3363 {
3372 }
3374 /* Protect the entire array initialization so that we can destroy
3375 the partially constructed array if an exception is thrown.
3376 But don't do this if we're assigning. */
3379 {
3381 }
3383 /* If the initializer is {}, then all elements are initialized from {}.
3384 But for non-classes, that's the same as value-initialization. */
3387 {
3390 else
3391 {
3394 }
3395 }
3397 /* Maybe pull out constant value when from_array? */
3400 {
3401 /* Do non-default initialization of non-trivial arrays resulting from
3402 brace-enclosed initializers. */
3405 /* Should we try to create a constant initializer? */
3409 /* If the constructor already has the array type, it's been through
3410 digest_init, so we shouldn't try to do anything more. */
3414 /* If we're initializing a static array, we want to do static
3415 initialization of any elements with constant initializers even if
3416 some are non-constant. */
3423 else
3427 {
3429 tree one_init;
3431 num_initialized_elts++;
3438 else
3444 {
3453 {
3457 else
3460 }
3461 else
3462 {
3468 }
3469 }
3478 else
3482 complain);
3485 else
3487 }
3490 {
3495 else
3497 }
3499 /* Clear out INIT so that we don't get confused below. */
3501 }
3503 {
3508 {
3512 }
3513 }
3515 /* Now, default-initialize any remaining elements. We don't need to
3516 do that if a) the type does not need constructing, or b) we've
3517 already initialized all the elements.
3519 We do need to keep going if we're copying an array. */
3524 && (num_initialized_elts
3526 {
3527 /* If the ITERATOR is equal to -1, then we don't have to loop;
3528 we've already initialized all the elements. */
3529 tree for_stmt;
3530 tree elt_init;
3531 tree to;
3537 for_stmt);
3539 complain);
3547 {
3548 tree from;
3551 {
3555 }
3556 else
3561 complain);
3566 complain);
3567 else
3569 }
3571 {
3573 sorry
3577 explicit_value_init_p,
3579 }
3581 {
3585 }
3586 else
3587 {
3591 else
3592 {
3595 complain);
3597 }
3598 }
3608 complain));
3611 complain));
3614 }
3616 /* Make sure to cleanup any partially constructed elements. */
3619 {
3620 tree e;
3623 complain);
3625 /* Flatten multi-dimensional array since build_vec_delete only
3626 expects one-dimensional array. */
3631 complain);
3640 }
3642 /* The value of the array initialization is the array itself, RVAL
3643 is a pointer to the first element. */
3648 /* Now make the result have the correct type. */
3650 {
3655 }
3664 }
3666 /* Call the DTOR_KIND destructor for EXP. FLAGS are as for
3667 build_delete. */
3669 static tree
3671 tsubst_flags_t complain)
3672 {
3673 tree name;
3674 tree fn;
3676 {
3691 }
3696 flags,
3698 complain);
3699 }
3701 /* Generate a call to a destructor. TYPE is the type to cast ADDR to.
3702 ADDR is an expression which yields the store to be destroyed.
3703 AUTO_DELETE is the name of the destructor to call, i.e., either
3704 sfk_complete_destructor, sfk_base_destructor, or
3705 sfk_deleting_destructor.
3707 FLAGS is the logical disjunction of zero or more LOOKUP_
3708 flags. See cp-tree.h for more info. */
3710 tree
3713 {
3714 tree expr;
3719 /* Can happen when CURRENT_EXCEPTION_OBJECT gets its type
3720 set to `error_mark_node' before it gets properly cleaned up. */
3729 {
3736 /* We don't want to warn about delete of void*, only other
3737 incomplete types. Deleting other incomplete types
3738 invokes undefined behavior, but it is not ill-formed, so
3739 compile to something that would even do The Right Thing
3740 (TM) should the type have a trivial dtor and no delete
3741 operator. */
3743 {
3746 {
3750 {
3753 "operator delete will be called, even if they are "
3755 }
3757 }
3761 {
3762 tree dtor;
3765 {
3768 "deleting object of abstract class type %qT"
3769 " which has non-virtual destructor"
3771 else
3773 "deleting object of polymorphic class type %qT"
3774 " which has non-virtual destructor"
3776 }
3777 }
3778 }
3780 /* Call the builtin operator delete. */
3785 /* Throw away const and volatile on target type of addr. */
3787 }
3789 {
3790 handle_array:
3793 {
3797 }
3800 }
3801 else
3802 {
3803 /* Don't check PROTECT here; leave that decision to the
3804 destructor. If the destructor is accessible, call it,
3805 else report error. */
3813 }
3818 {
3824 use_global_delete,
3827 complain);
3828 }
3829 else
3830 {
3833 tree ifexp;
3838 /* For `::delete x', we must not use the deleting destructor
3839 since then we would not be sure to get the global `operator
3840 delete'. */
3842 {
3843 /* We will use ADDR multiple times so we must save it. */
3846 /* Delete the object. */
3848 /* Otherwise, treat this like a complete object destructor
3849 call. */
3851 }
3852 /* If the destructor is non-virtual, there is no deleting
3853 variant. Instead, we must explicitly call the appropriate
3854 `operator delete' here. */
3857 {
3858 /* We will use ADDR multiple times so we must save it. */
3860 /* Build the call. */
3862 addr,
3867 complain);
3868 /* Call the complete object destructor. */
3870 }
3873 {
3874 /* Make sure we have access to the member op delete, even though
3875 we'll actually be calling it from the destructor. */
3880 complain);
3881 }
3890 /* We need to calculate this before the dtor changes the vptr. */
3895 /* Explicit destructor call; don't check for null pointer. */
3897 else
3898 {
3899 /* Handle deleting a null pointer. */
3902 complain));
3905 }
3912 }
3913 }
3915 /* At the beginning of a destructor, push cleanups that will call the
3916 destructors for our base classes and members.
3918 Called from begin_destructor_body. */
3920 void
3922 {
3925 tree member;
3926 tree expr;
3929 /* Run destructors for all virtual baseclasses. */
3931 {
3932 tree cond = (condition_conversion
3934 current_in_charge_parm,
3935 integer_two_node)));
3937 /* The CLASSTYPE_VBASECLASSES vector is in initialization
3938 order, which is also the right order for pushing cleanups. */
3941 {
3943 {
3945 base_dtor_identifier,
3946 NULL,
3947 base_binfo,
3948 (LOOKUP_NORMAL
3950 tf_warning_or_error);
3954 }
3955 }
3956 }
3958 /* Take care of the remaining baseclasses. */
3961 {
3967 base_dtor_identifier,
3970 tf_warning_or_error);
3972 }
3974 /* Don't automatically destroy union members. */
3980 {
3989 {
3990 tree this_member = (build_class_member_access_expr
3994 tf_warning_or_error));
3996 sfk_complete_destructor,
4000 }
4001 }
4002 }
4004 /* Build a C++ vector delete expression.
4005 MAXINDEX is the number of elements to be deleted.
4006 ELT_SIZE is the nominal size of each element in the vector.
4007 BASE is the expression that should yield the store to be deleted.
4008 This function expands (or synthesizes) these calls itself.
4009 AUTO_DELETE_VEC says whether the container (vector) should be deallocated.
4011 This also calls delete for virtual baseclasses of elements of the vector.
4013 Update: MAXINDEX is no longer needed. The size can be extracted from the
4014 start of the vector for pointers, and from the type for arrays. We still
4015 use MAXINDEX for arrays because it happens to already have one of the
4016 values we'd have to extract. (We could use MAXINDEX with pointers to
4017 confirm the size, and trap if the numbers differ; not clear that it'd
4018 be worth bothering.) */
4020 tree
4022 special_function_kind auto_delete_vec,
4024 {
4025 tree type;
4026 tree rval;
4032 {
4033 /* Step back one from start of vector, and read dimension. */
4034 tree cookie_addr;
4038 {
4041 }
4046 cookie_addr);
4048 }
4050 {
4051 /* Get the total number of things in the array, maxindex is a
4052 bad name. */
4059 {
4062 }
4063 }
4064 else
4065 {
4069 }
4077 }