| blob | f3ec826c8653cb8e120b1f73729a758f1ff4228a |
1 /* Functions related to building classes and their related objects.
2 Copyright (C) 1987-2015 Free Software Foundation, Inc.
3 Contributed by Michael Tiemann (tiemann@cygnus.com)
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
10 any later version.
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
22 /* High-level class interface. */
61 /* The number of nested classes being processed. If we are not in the
62 scope of any class, this is zero. */
66 /* In order to deal with nested classes, we keep a stack of classes.
67 The topmost entry is the innermost class, and is the entry at index
68 CURRENT_CLASS_DEPTH */
71 /* The name of the class. */
72 tree name;
74 /* The _TYPE node for the class. */
75 tree type;
77 /* The access specifier pending for new declarations in the scope of
78 this class. */
79 tree access;
81 /* If were defining TYPE, the names used in this class. */
82 splay_tree names_used;
84 /* Nonzero if this class is no longer open, because of a call to
85 push_to_top_level. */
90 {
91 /* The base for which we're building initializers. */
92 tree binfo;
93 /* The type of the most-derived type. */
94 tree derived;
95 /* The binfo for the dynamic type. This will be TYPE_BINFO (derived),
96 unless ctor_vtbl_p is true. */
97 tree rtti_binfo;
98 /* The negative-index vtable initializers built up so far. These
99 are in order from least negative index to most negative index. */
101 /* The binfo for the virtual base for which we're building
102 vcall offset initializers. */
103 tree vbase;
104 /* The functions in vbase for which we have already provided vcall
105 offsets. */
107 /* The vtable index of the next vcall or vbase offset. */
108 tree index;
109 /* Nonzero if we are building the initializer for the primary
110 vtable. */
112 /* Nonzero if we are building the initializer for a construction
113 vtable. */
115 /* True when adding vcall offset entries to the vtable. False when
116 merely computing the indices. */
120 /* The type of a function passed to walk_subobject_offsets. */
123 /* The stack itself. This is a dynamically resized array. The
124 number of elements allocated is CURRENT_CLASS_STACK_SIZE. */
128 /* The size of the largest empty class seen in this translation unit. */
131 /* An array of all local classes present in this translation unit, in
132 declaration order. */
215 tree *);
225 splay_tree_key k2);
233 /* Variables shared between class.c and call.c. */
243 /* Convert to or from a base subobject. EXPR is an expression of type
244 `A' or `A*', an expression of type `B' or `B*' is returned. To
245 convert A to a base B, CODE is PLUS_EXPR and BINFO is the binfo for
246 the B base instance within A. To convert base A to derived B, CODE
247 is MINUS_EXPR and BINFO is the binfo for the A instance within B.
248 In this latter case, A must not be a morally virtual base of B.
249 NONNULL is true if EXPR is known to be non-NULL (this is only
250 needed when EXPR is of pointer type). CV qualifiers are preserved
251 from EXPR. */
253 tree
255 tree expr,
256 tree binfo,
258 tsubst_flags_t complain)
259 {
262 tree probe;
263 tree offset;
264 tree target_type;
266 tree ptr_target_type;
277 {
283 }
291 {
292 /* This can happen when adjust_result_of_qualified_name_lookup can't
293 find a unique base binfo in a call to a member function. We
294 couldn't give the diagnostic then since we might have been calling
295 a static member function, so we do it now. */
297 {
301 }
303 }
310 /* Nothing to do. */
314 {
316 {
318 {
321 "pointer to derived class %qT because the base is "
323 else
327 }
328 else
329 {
335 else
339 }
340 }
342 }
345 {
347 /* This must happen before the call to save_expr. */
349 }
350 else
356 /* TARGET_TYPE has been extracted from BINFO, and, is therefore always
357 cv-unqualified. Extract the cv-qualifiers from EXPR so that the
358 expression returned matches the input. */
359 target_type = cp_build_qualified_type
363 /* Do we need to look in the vtable for the real offset? */
366 /* Don't bother with the calculations inside sizeof; they'll ICE if the
367 source type is incomplete and the pointer value doesn't matter. In a
368 template (even in instantiate_non_dependent_expr), we don't have vtables
369 set up properly yet, and the value doesn't matter there either; we're
370 just interested in the result of overload resolution. */
373 {
376 }
378 /* If we're in an NSDMI, we don't have the full constructor context yet
379 that we need for converting to a virtual base, so just build a stub
380 CONVERT_EXPR and expand it later in bot_replace. */
383 {
387 }
389 /* Do we need to check for a null pointer? */
391 {
392 /* If we know the conversion will not actually change the value
393 of EXPR, then we can avoid testing the expression for NULL.
394 We have to avoid generating a COMPONENT_REF for a base class
395 field, because other parts of the compiler know that such
396 expressions are always non-NULL. */
400 }
402 /* Protect against multiple evaluation if necessary. */
406 /* Now that we've saved expr, build the real null test. */
408 {
412 }
414 /* If this is a simple base reference, express it as a COMPONENT_REF. */
416 /* We don't build base fields for empty bases, and they aren't very
417 interesting to the optimizers anyway. */
419 {
428 }
431 {
432 /* Going via virtual base V_BINFO. We need the static offset
433 from V_BINFO to BINFO, and the dynamic offset from D_BINFO to
434 V_BINFO. That offset is an entry in D_BINFO's vtable. */
435 tree v_offset;
438 {
439 /* In a base member initializer, we cannot rely on the
440 vtable being set up. We have to indirect via the
441 vtt_parm. */
442 tree t;
448 }
449 else
450 {
453 {
458 }
460 complain),
462 }
470 v_offset);
482 /* Negative fixed_type_p means this is a constructor or destructor;
483 virtual base layout is fixed in in-charge [cd]tors, but not in
484 base [cd]tors. */
488 v_offset,
491 else
493 }
501 {
506 }
507 else
510 indout:
512 {
516 }
518 out:
524 }
526 /* Subroutine of build_base_path; EXPR and BINFO are as in that function.
527 Perform a derived-to-base conversion by recursively building up a
528 sequence of COMPONENT_REFs to the appropriate base fields. */
530 static tree
532 {
535 tree field;
538 {
539 tree temp;
543 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x'
544 into `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only
545 an lvalue in the front end; only _DECLs and _REFs are lvalues
546 in the back end. */
552 }
554 /* Recurse. */
559 /* Is this the base field created by build_base_field? */
563 /* If we're looking for a field in the most-derived class,
564 also check the field offset; we can have two base fields
565 of the same type if one is an indirect virtual base and one
566 is a direct non-virtual base. */
570 {
571 /* We don't use build_class_member_access_expr here, as that
572 has unnecessary checks, and more importantly results in
573 recursive calls to dfs_walk_once. */
581 /* Mark the expression const or volatile, as appropriate.
582 Even though we've dealt with the type above, we still have
583 to mark the expression itself. */
590 }
592 /* Didn't find the base field?!? */
594 }
596 /* Convert OBJECT to the base TYPE. OBJECT is an expression whose
597 type is a class type or a pointer to a class type. In the former
598 case, TYPE is also a class type; in the latter it is another
599 pointer type. If CHECK_ACCESS is true, an error message is emitted
600 if TYPE is inaccessible. If OBJECT has pointer type, the value is
601 assumed to be non-NULL. */
603 tree
605 tsubst_flags_t complain)
606 {
607 tree binfo;
608 tree object_type;
611 {
614 }
615 else
624 }
626 /* EXPR is an expression with unqualified class type. BASE is a base
627 binfo of that class type. Returns EXPR, converted to the BASE
628 type. This function assumes that EXPR is the most derived class;
629 therefore virtual bases can be found at their static offsets. */
631 tree
633 {
634 tree expr_type;
638 {
639 /* If this is a non-empty base, use a COMPONENT_REF. */
643 /* We use fold_build2 and fold_convert below to simplify the trees
644 provided to the optimizers. It is not safe to call these functions
645 when processing a template because they do not handle C++-specific
646 trees. */
654 }
657 }
659 \f
660 tree
662 {
666 /* Can happen in case of duplicate base types (c++/59082). */
670 /* First, convert to the requested type. */
675 /* Second, the requested type may not be the owner of its own vptr.
676 If not, convert to the base class that owns it. We cannot use
677 convert_to_base here, because VCONTEXT may appear more than once
678 in the inheritance hierarchy of TYPE, and thus direct conversion
679 between the types may be ambiguous. Following the path back up
680 one step at a time via primary bases avoids the problem. */
684 {
687 }
690 }
692 /* Given an object INSTANCE, return an expression which yields the
693 vtable element corresponding to INDEX. There are many special
694 cases for INSTANCE which we take care of here, mainly to avoid
695 creating extra tree nodes when we don't have to. */
697 static tree
699 {
700 tree aref;
703 /* Try to figure out what a reference refers to, and
704 access its virtual function table directly. */
712 {
717 }
726 }
728 tree
730 {
734 }
736 /* Given a stable object pointer INSTANCE_PTR, return an expression which
737 yields a function pointer corresponding to vtable element INDEX. */
739 tree
741 {
742 tree aref;
745 tf_warning_or_error),
746 idx);
748 /* When using function descriptors, the address of the
749 vtable entry is treated as a function pointer. */
754 /* Remember this as a method reference, for later devirtualization. */
758 }
760 /* Return the name of the virtual function table (as an IDENTIFIER_NODE)
761 for the given TYPE. */
763 static tree
765 {
767 }
769 /* DECL is an entity associated with TYPE, like a virtual table or an
770 implicitly generated constructor. Determine whether or not DECL
771 should have external or internal linkage at the object file
772 level. This routine does not deal with COMDAT linkage and other
773 similar complexities; it simply sets TREE_PUBLIC if it possible for
774 entities in other translation units to contain copies of DECL, in
775 the abstract. */
777 void
779 {
782 }
784 /* Create a VAR_DECL for a primary or secondary vtable for CLASS_TYPE.
785 (For a secondary vtable for B-in-D, CLASS_TYPE should be D, not B.)
786 Use NAME for the name of the vtable, and VTABLE_TYPE for its type. */
788 static tree
790 {
791 tree decl;
794 /* vtable names are already mangled; give them their DECL_ASSEMBLER_NAME
795 now to avoid confusion in mangle_decl. */
806 /* The vtable has not been defined -- yet. */
810 /* Mark the VAR_DECL node representing the vtable itself as a
811 "gratuitous" one, thereby forcing dwarfout.c to ignore it. It
812 is rather important that such things be ignored because any
813 effort to actually generate DWARF for them will run into
814 trouble when/if we encounter code like:
816 #pragma interface
817 struct S { virtual void member (); };
819 because the artificial declaration of the vtable itself (as
820 manufactured by the g++ front end) will say that the vtable is
821 a static member of `S' but only *after* the debug output for
822 the definition of `S' has already been output. This causes
823 grief because the DWARF entry for the definition of the vtable
824 will try to refer back to an earlier *declaration* of the
825 vtable as a static member of `S' and there won't be one. We
826 might be able to arrange to have the "vtable static member"
827 attached to the member list for `S' before the debug info for
828 `S' get written (which would solve the problem) but that would
829 require more intrusive changes to the g++ front end. */
833 }
835 /* Get the VAR_DECL of the vtable for TYPE. TYPE need not be polymorphic,
836 or even complete. If this does not exist, create it. If COMPLETE is
837 nonzero, then complete the definition of it -- that will render it
838 impossible to actually build the vtable, but is useful to get at those
839 which are known to exist in the runtime. */
841 tree
843 {
844 tree decl;
853 {
856 }
859 }
861 /* Build the primary virtual function table for TYPE. If BINFO is
862 non-NULL, build the vtable starting with the initial approximation
863 that it is the same as the one which is the head of the association
864 list. Returns a nonzero value if a new vtable is actually
865 created. */
867 static int
869 {
870 tree decl;
871 tree virtuals;
876 {
878 /* We have already created a vtable for this base, so there's
879 no need to do it again. */
886 }
887 else
888 {
891 }
894 {
897 }
899 /* Initialize the association list for this type, based
900 on our first approximation. */
905 }
907 /* Give BINFO a new virtual function table which is initialized
908 with a skeleton-copy of its original initialization. The only
909 entry that changes is the `delta' entry, so we can really
910 share a lot of structure.
912 FOR_TYPE is the most derived type which caused this table to
913 be needed.
915 Returns nonzero if we haven't met BINFO before.
917 The order in which vtables are built (by calling this function) for
918 an object must remain the same, otherwise a binary incompatibility
919 can result. */
921 static int
923 {
925 /* We already created a vtable for this base. There's no need to
926 do it again. */
929 /* Remember that we've created a vtable for this BINFO, so that we
930 don't try to do so again. */
933 /* Make fresh virtual list, so we can smash it later. */
936 /* Secondary vtables are laid out as part of the same structure as
937 the primary vtable. */
940 }
942 /* Create a new vtable for BINFO which is the hierarchy dominated by
943 T. Return nonzero if we actually created a new vtable. */
945 static int
947 {
949 /* In this case, it is *type*'s vtable we are modifying. We start
950 with the approximation that its vtable is that of the
951 immediate base class. */
953 else
954 /* This is our very own copy of `basetype' to play with. Later,
955 we will fill in all the virtual functions that override the
956 virtual functions in these base classes which are not defined
957 by the current type. */
959 }
961 /* Make *VIRTUALS, an entry on the BINFO_VIRTUALS list for BINFO
962 (which is in the hierarchy dominated by T) list FNDECL as its
963 BV_FN. DELTA is the required constant adjustment from the `this'
964 pointer where the vtable entry appears to the `this' required when
965 the function is actually called. */
967 static void
969 tree binfo,
970 tree fndecl,
971 tree delta,
973 {
974 tree v;
980 {
981 /* We need a new vtable for BINFO. */
983 {
984 /* If we really did make a new vtable, we also made a copy
985 of the BINFO_VIRTUALS list. Now, we have to find the
986 corresponding entry in that list. */
991 }
996 }
997 }
999 \f
1000 /* Add method METHOD to class TYPE. If USING_DECL is non-null, it is
1001 the USING_DECL naming METHOD. Returns true if the method could be
1002 added to the method vec. */
1004 bool
1006 {
1008 tree overload;
1014 tree current_fns;
1015 tree fns;
1028 {
1029 /* Make a new method vector. We start with 8 entries. We must
1030 allocate at least two (for constructors and destructors), and
1031 we're going to end up with an assignment operator at some
1032 point as well. */
1034 /* Create slots for constructors and destructors. */
1038 }
1040 /* Maintain TYPE_HAS_USER_CONSTRUCTOR, etc. */
1043 /* Constructors and destructors go in special slots. */
1047 {
1051 {
1057 type);
1058 }
1059 }
1060 else
1061 {
1062 tree m;
1065 /* See if we already have an entry with this name. */
1069 {
1072 {
1077 }
1081 {
1084 }
1089 }
1090 }
1093 /* Check to see if we've already got this method. */
1095 {
1097 tree fn_type;
1098 tree method_type;
1099 tree parms1;
1100 tree parms2;
1105 /* [over.load] Member function declarations with the
1106 same name and the same parameter types cannot be
1107 overloaded if any of them is a static member
1108 function declaration.
1110 [over.load] Member function declarations with the same name and
1111 the same parameter-type-list as well as member function template
1112 declarations with the same name, the same parameter-type-list, and
1113 the same template parameter lists cannot be overloaded if any of
1114 them, but not all, have a ref-qualifier.
1116 [namespace.udecl] When a using-declaration brings names
1117 from a base class into a derived class scope, member
1118 functions in the derived class override and/or hide member
1119 functions with the same name and parameter types in a base
1120 class (rather than conflicting). */
1126 /* Compare the quals on the 'this' parm. Don't compare
1127 the whole types, as used functions are treated as
1128 coming from the using class in overload resolution. */
1131 /* Either both or neither need to be ref-qualified for
1132 differing quals to allow overloading. */
1139 /* For templates, the return type and template parameters
1140 must be identical. */
1157 {
1158 /* For function versions, their parms and types match
1159 but they are not duplicates. Record function versions
1160 as and when they are found. extern "C" functions are
1161 not treated as versions. */
1167 {
1168 /* Mark functions as versions if necessary. Modify the mangled
1169 decl name if necessary. */
1171 {
1175 }
1177 {
1181 }
1184 }
1186 {
1188 {
1195 }
1196 /* Otherwise defer to the other function. */
1198 }
1200 {
1202 /* Defer to the local function. */
1204 }
1205 else
1206 {
1209 }
1211 /* We don't call duplicate_decls here to merge the
1212 declarations because that will confuse things if the
1213 methods have inline definitions. In particular, we
1214 will crash while processing the definitions. */
1216 }
1217 }
1219 /* A class should never have more than one destructor. */
1223 /* Add the new binding. */
1225 {
1228 }
1229 else
1238 {
1241 /* We only expect to add few methods in the COMPLETE_P case, so
1242 just make room for one more method in that case. */
1245 else
1251 else
1253 }
1254 else
1255 /* Replace the current slot. */
1258 }
1260 /* Subroutines of finish_struct. */
1262 /* Change the access of FDECL to ACCESS in T. Return 1 if change was
1263 legit, otherwise return 0. */
1265 static int
1267 {
1268 tree elem;
1277 {
1279 {
1283 else
1286 }
1287 else
1288 {
1289 /* They're changing the access to the same thing they changed
1290 it to before. That's OK. */
1291 ;
1292 }
1293 }
1294 else
1295 {
1297 tf_warning_or_error);
1300 }
1302 }
1304 /* Process the USING_DECL, which is a member of T. */
1306 static void
1308 {
1311 tree access
1316 tree old_value;
1321 tf_warning_or_error);
1323 {
1329 else
1331 }
1339 ;
1341 {
1343 /* It's OK to use functions from a base when there are functions with
1345 else
1346 {
1351 }
1352 }
1354 {
1358 }
1360 /* Make type T see field decl FDECL with access ACCESS. */
1363 {
1366 }
1367 else
1369 }
1370 \f
1371 /* Data structure for find_abi_tags_r, below. */
1373 struct abi_tag_data
1374 {
1378 };
1380 /* Subroutine of find_abi_tags_r. Handle a single TAG found on the class TP
1381 in the context of P. TAG can be either an identifier (the DECL_NAME of
1382 a tag NAMESPACE_DECL) or a STRING_CST (a tag attribute). */
1384 static void
1386 {
1388 {
1390 {
1391 /* We're collecting tags from template arguments or from
1392 the type of a variable or function return type. */
1395 /* Don't inherit this tag multiple times. */
1399 {
1400 /* Tags inherited from type template arguments are only used
1401 to avoid warnings. */
1404 }
1405 /* For functions and variables we want to warn, too. */
1406 }
1408 /* Otherwise we're diagnosing missing tags. */
1410 {
1415 }
1417 {
1421 }
1423 {
1428 }
1429 else
1430 {
1434 {
1438 }
1439 }
1440 }
1441 }
1443 /* Find all the ABI tags in the attribute list ATTR and either call
1444 check_tag (if TP is non-null) or set IDENTIFIER_MARKED to val. */
1446 static void
1448 {
1455 {
1460 else
1462 }
1463 }
1465 /* Find all the ABI tags on T and its enclosing scopes and either call
1466 check_tag (if TP is non-null) or set IDENTIFIER_MARKED to val. */
1468 static void
1470 {
1472 {
1473 tree attr;
1475 {
1478 }
1479 else
1480 {
1483 }
1485 }
1486 }
1488 /* walk_tree callback for check_abi_tags: if the type at *TP involves any
1489 types with ABI tags, add the corresponding identifiers to the VEC in
1490 *DATA and set IDENTIFIER_MARKED. */
1492 static tree
1494 {
1498 /* walk_tree shouldn't be walking into any subtrees of a RECORD_TYPE
1499 anyway, but let's make sure of it. */
1507 }
1509 /* walk_tree callback for mark_abi_tags: if *TP is a class, set
1510 IDENTIFIER_MARKED on its ABI tags. */
1512 static tree
1514 {
1518 /* walk_tree shouldn't be walking into any subtrees of a RECORD_TYPE
1519 anyway, but let's make sure of it. */
1527 }
1529 /* Set IDENTIFIER_MARKED on all the ABI tags on T and its enclosing
1530 scopes. */
1532 static void
1534 {
1537 {
1540 {
1541 /* Template arguments are part of the signature. */
1544 {
1547 }
1548 }
1550 /* A function's parameter types are part of the signature, so
1551 we don't need to inherit any tags that are also in them. */
1556 }
1557 }
1559 /* Check that T has all the ABI tags that subobject SUBOB has, or
1560 warn if not. If T is a (variable or function) declaration, also
1561 add any missing tags. */
1563 static void
1565 {
1573 /* No need to worry about things local to this TU. */
1586 {
1590 else
1594 }
1597 }
1599 /* Check that DECL has all the ABI tags that are used in parts of its type
1600 that are not reflected in its mangled name. */
1602 void
1604 {
1610 }
1612 void
1614 {
1624 {
1627 {
1631 }
1632 }
1634 // If we found some tags on our template arguments, add them to our
1635 // abi_tag attribute.
1637 {
1641 else
1645 }
1648 }
1650 /* Return true, iff class T has a non-virtual destructor that is
1651 accessible from outside the class heirarchy (i.e. is public, or
1652 there's a suitable friend. */
1654 static bool
1656 {
1659 /* An implicitly declared destructor is always public. And,
1660 if it were virtual, we would have created it by now. */
1675 }
1677 /* Run through the base classes of T, updating CANT_HAVE_CONST_CTOR_P,
1678 and NO_CONST_ASN_REF_P. Also set flag bits in T based on
1679 properties of the bases. */
1681 static void
1685 {
1689 tree base_binfo;
1690 tree binfo;
1700 {
1709 /* If any base class is non-literal, so is the derived class. */
1713 /* If the base class doesn't have copy constructors or
1714 assignment operators that take const references, then the
1715 derived class cannot have such a member automatically
1716 generated. */
1725 /* A virtual base does not effect nearly emptiness. */
1726 ;
1728 {
1730 /* And if there is more than one nearly empty base, then the
1731 derived class is not nearly empty either. */
1733 else
1734 /* Remember we've seen one. */
1736 }
1738 /* If the base class is not empty or nearly empty, then this
1739 class cannot be nearly empty. */
1742 /* A lot of properties from the bases also apply to the derived
1743 class. */
1760 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT
1763 SET_CLASSTYPE_REF_FIELDS_NEED_INIT
1767 /* A standard-layout class is a class that:
1768 ...
1769 * has no non-standard-layout base classes, */
1772 {
1773 tree basefield;
1774 /* ...has no base classes of the same type as the first non-static
1775 data member... */
1777 && (same_type_ignoring_top_level_qualifiers_p
1780 else
1781 /* ...either has no non-static data members in the most-derived
1782 class and at most one base class with non-static data
1783 members, or has no base classes with non-static data
1784 members */
1788 {
1791 else
1794 }
1795 }
1797 /* Don't bother collecting tm attributes if transactional memory
1798 support is not enabled. */
1800 {
1804 }
1807 }
1809 /* If one of the base classes had TM attributes, and the current class
1810 doesn't define its own, then the current class inherits one. */
1812 {
1815 }
1816 }
1818 /* Determine all the primary bases within T. Sets BINFO_PRIMARY_BASE_P for
1819 those that are primaries. Sets BINFO_LOST_PRIMARY_P for those
1820 that have had a nearly-empty virtual primary base stolen by some
1821 other base in the hierarchy. Determines CLASSTYPE_PRIMARY_BASE for
1822 T. */
1824 static void
1826 {
1830 tree base_binfo;
1832 /* Determine the primary bases of our bases. */
1835 {
1838 /* See if we're the non-virtual primary of our inheritance
1839 chain. */
1841 {
1848 /* We are the primary binfo. */
1850 }
1851 /* Determine if we have a virtual primary base, and mark it so.
1852 */
1854 {
1858 /* Someone already claimed this base. */
1860 else
1861 {
1862 tree delta;
1867 /* A virtual binfo might have been copied from within
1868 another hierarchy. As we're about to use it as a
1869 primary base, make sure the offsets match. */
1877 }
1878 }
1879 }
1881 /* First look for a dynamic direct non-virtual base. */
1883 {
1887 {
1890 }
1891 }
1893 /* A "nearly-empty" virtual base class can be the primary base
1894 class, if no non-virtual polymorphic base can be found. Look for
1895 a nearly-empty virtual dynamic base that is not already a primary
1896 base of something in the hierarchy. If there is no such base,
1897 just pick the first nearly-empty virtual base. */
1903 {
1905 {
1906 /* Found one that is not primary. */
1909 }
1911 /* Remember the first candidate. */
1913 }
1915 found:
1916 /* If we've got a primary base, use it. */
1918 {
1923 /* We are stealing a primary base. */
1927 {
1928 tree delta;
1931 /* A virtual binfo might have been copied from within
1932 another hierarchy. As we're about to use it as a primary
1933 base, make sure the offsets match. */
1938 }
1945 }
1946 }
1948 /* Update the variant types of T. */
1950 void
1952 {
1953 tree variants;
1959 variants;
1961 {
1962 /* These fields are in the _TYPE part of the node, not in
1963 the TYPE_LANG_SPECIFIC component, so they are not shared. */
1973 /* Copy whatever these are holding today. */
1977 }
1978 }
1980 /* Early variant fixups: we apply attributes at the beginning of the class
1981 definition, and we need to fix up any variants that have already been
1982 made via elaborated-type-specifier so that check_qualified_type works. */
1984 void
1986 {
1987 tree variants;
1997 variants;
1999 {
2000 /* These are the two fields that check_qualified_type looks at and
2001 are affected by attributes. */
2006 else
2009 }
2010 }
2011 \f
2012 /* Set memoizing fields and bits of T (and its variants) for later
2013 use. */
2015 static void
2017 {
2018 /* Fix up variants (if any). */
2022 /* For a class w/o baseclasses, 'finish_struct' has set
2023 CLASSTYPE_PURE_VIRTUALS correctly (by definition).
2024 Similarly for a class whose base classes do not have vtables.
2025 When neither of these is true, we might have removed abstract
2026 virtuals (by providing a definition), added some (by declaring
2027 new ones), or redeclared ones from a base class. We need to
2028 recalculate what's really an abstract virtual at this point (by
2029 looking in the vtables). */
2032 /* If this type has a copy constructor or a destructor, force its
2033 mode to be BLKmode, and force its TREE_ADDRESSABLE bit to be
2034 nonzero. This will cause it to be passed by invisible reference
2035 and prevent it from being returned in a register. */
2038 {
2039 tree variants;
2042 {
2045 }
2046 }
2047 }
2049 /* Issue warnings about T having private constructors, but no friends,
2050 and so forth.
2052 HAS_NONPRIVATE_METHOD is nonzero if T has any non-private methods or
2053 static members. HAS_NONPRIVATE_STATIC_FN is nonzero if T has any
2054 non-private static member functions. */
2056 static void
2058 {
2061 tree fn;
2064 /* If the class has friends, those entities might create and
2065 access instances, so we should not warn. */
2068 /* We will have warned when the template was declared; there's
2069 no need to warn on every instantiation. */
2071 /* There's no reason to even consider warning about this
2072 class. */
2075 /* We only issue one warning, if more than one applies, because
2076 otherwise, on code like:
2078 class A {
2079 // Oops - forgot `public:'
2080 A();
2081 A(const A&);
2082 ~A();
2083 };
2085 we warn several times about essentially the same problem. */
2087 /* Check to see if all (non-constructor, non-destructor) member
2088 functions are private. (Since there are no friends or
2089 non-private statics, we can't ever call any of the private member
2090 functions.) */
2092 /* We're not interested in compiler-generated methods; they don't
2093 provide any way to call private members. */
2095 {
2097 {
2099 /* A non-private static member function is just like a
2100 friend; it can create and invoke private member
2101 functions, and be accessed without a class
2102 instance. */
2106 /* Keep searching for a static member function. */
2107 }
2110 }
2113 {
2114 /* There are no non-private methods, and there's at least one
2115 private member function that isn't a constructor or
2116 destructor. (If all the private members are
2117 constructors/destructors we want to use the code below that
2118 issues error messages specifically referring to
2119 constructors/destructors.) */
2125 {
2128 }
2130 {
2134 }
2135 }
2137 /* Even if some of the member functions are non-private, the class
2138 won't be useful for much if all the constructors or destructors
2139 are private: such an object can never be created or destroyed. */
2142 {
2145 t);
2147 }
2149 /* Warn about classes that have private constructors and no friends. */
2151 /* Implicitly generated constructors are always public. */
2154 {
2157 /* If a non-template class does not define a copy
2158 constructor, one is defined for it, enabling it to avoid
2159 this warning. For a template class, this does not
2160 happen, and so we would normally get a warning on:
2162 template <class T> class C { private: C(); };
2164 To avoid this asymmetry, we check TYPE_HAS_COPY_CTOR. All
2165 complete non-template or fully instantiated classes have this
2166 flag set. */
2169 else
2171 {
2173 /* Ideally, we wouldn't count copy constructors (or, in
2174 fact, any constructor that takes an argument of the
2175 class type as a parameter) because such things cannot
2176 be used to construct an instance of the class unless
2177 you already have one. But, for now at least, we're
2178 more generous. */
2180 {
2183 }
2184 }
2187 {
2190 t);
2192 }
2193 }
2194 }
2197 gt_pointer_operator new_value;
2201 /* Comparison function to compare two TYPE_METHOD_VEC entries by name. */
2203 static int
2205 {
2218 }
2220 /* This routine compares two fields like method_name_cmp but using the
2221 pointer operator in resort_field_decl_data. */
2223 static int
2225 {
2234 {
2241 }
2243 }
2245 /* Resort TYPE_METHOD_VEC because pointers have been reordered. */
2247 void
2250 gt_pointer_operator new_value,
2252 {
2256 tree fn;
2258 /* The type conversion ops have to live at the front of the vec, so we
2259 can't sort them. */
2267 {
2271 resort_method_name_cmp);
2272 }
2273 }
2275 /* Warn about duplicate methods in fn_fields.
2277 Sort methods that are not special (i.e., constructors, destructors,
2278 and type conversion operators) so that we can find them faster in
2279 search. */
2281 static void
2283 {
2284 tree fn_fields;
2294 /* Clear DECL_IN_AGGR_P for all functions. */
2299 /* Issue warnings about private constructors and such. If there are
2300 no methods, then some public defaults are generated. */
2303 /* The type conversion ops have to live at the front of the vec, so we
2304 can't sort them. */
2313 }
2315 /* Make BINFO's vtable have N entries, including RTTI entries,
2316 vbase and vcall offsets, etc. Set its type and call the back end
2317 to lay it out. */
2319 static void
2321 {
2322 tree atype;
2323 tree vtable;
2328 /* We may have to grow the vtable. */
2331 {
2335 }
2336 }
2338 /* True iff FNDECL and BASE_FNDECL (both non-static member functions)
2339 have the same signature. */
2341 int
2343 {
2344 /* One destructor overrides another if they are the same kind of
2345 destructor. */
2349 /* But a non-destructor never overrides a destructor, nor vice
2350 versa, nor do different kinds of destructors override
2351 one-another. For example, a complete object destructor does not
2352 override a deleting destructor. */
2361 {
2369 }
2371 }
2373 /* Returns TRUE if DERIVED is a binfo containing the binfo BASE as a
2374 subobject. */
2376 static bool
2378 {
2379 tree probe;
2382 {
2386 /* If we meet a virtual base, we can't follow the inheritance
2387 any more. See if the complete type of DERIVED contains
2388 such a virtual base. */
2391 }
2393 }
2396 /* The function for which we are trying to find a final overrider. */
2397 tree fn;
2398 /* The base class in which the function was declared. */
2399 tree declaring_base;
2400 /* The candidate overriders. */
2401 tree candidates;
2402 /* Path to most derived. */
2406 /* Add the overrider along the current path to FFOD->CANDIDATES.
2407 Returns true if an overrider was found; false otherwise. */
2409 static bool
2413 {
2414 tree method;
2416 /* If BINFO is not the most derived type, try a more derived class.
2417 A definition there will overrider a definition here. */
2419 {
2420 depth--;
2424 }
2428 {
2431 /* Remove any candidates overridden by this new function. */
2433 {
2434 /* If *CANDIDATE overrides METHOD, then METHOD
2435 cannot override anything else on the list. */
2438 /* If METHOD overrides *CANDIDATE, remove *CANDIDATE. */
2441 else
2443 }
2445 /* Add the new function. */
2448 }
2451 }
2453 /* Called from find_final_overrider via dfs_walk. */
2455 static tree
2457 {
2465 }
2467 static tree
2469 {
2474 }
2476 /* Returns a TREE_LIST whose TREE_PURPOSE is the final overrider for
2477 FN and whose TREE_VALUE is the binfo for the base where the
2478 overriding occurs. BINFO (in the hierarchy dominated by the binfo
2479 DERIVED) is the base object in which FN is declared. */
2481 static tree
2483 {
2484 find_final_overrider_data ffod;
2486 /* Getting this right is a little tricky. This is valid:
2488 struct S { virtual void f (); };
2489 struct T { virtual void f (); };
2490 struct U : public S, public T { };
2492 even though calling `f' in `U' is ambiguous. But,
2494 struct R { virtual void f(); };
2495 struct S : virtual public R { virtual void f (); };
2496 struct T : virtual public R { virtual void f (); };
2497 struct U : public S, public T { };
2499 is not -- there's no way to decide whether to put `S::f' or
2500 `T::f' in the vtable for `R'.
2502 The solution is to look at all paths to BINFO. If we find
2503 different overriders along any two, then there is a problem. */
2507 /* Determine the depth of the hierarchy. */
2518 /* If there was no winner, issue an error message. */
2523 }
2525 /* Return the index of the vcall offset for FN when TYPE is used as a
2526 virtual base. */
2528 static tree
2530 {
2532 tree_pair_p p;
2540 /* There should always be an appropriate index. */
2542 }
2544 /* Update an entry in the vtable for BINFO, which is in the hierarchy
2545 dominated by T. FN is the old function; VIRTUALS points to the
2546 corresponding position in the new BINFO_VIRTUALS list. IX is the index
2547 of that entry in the list. */
2549 static void
2552 {
2553 tree b;
2554 tree overrider;
2555 tree delta;
2556 tree virtual_base;
2557 tree first_defn;
2563 /* Find the nearest primary base (possibly binfo itself) which defines
2564 this function; this is the class the caller will convert to when
2565 calling FN through BINFO. */
2567 {
2572 /* The nearest definition is from a lost primary. */
2575 }
2578 /* Find the final overrider. */
2581 {
2584 }
2587 /* Check for adjusting covariant return types. */
2595 /* If the overrider is invalid, don't even try. */
2597 {
2598 /* If FN is a covariant thunk, we must figure out the adjustment
2599 to the final base FN was converting to. As OVERRIDER_TARGET might
2600 also be converting to the return type of FN, we have to
2601 combine the two conversions here. */
2608 {
2612 }
2613 else
2617 /* Find the equivalent binfo within the return type of the
2618 overriding function. We will want the vbase offset from
2619 there. */
2621 over_return);
2624 {
2625 /* There was no existing virtual thunk (which takes
2626 precedence). So find the binfo of the base function's
2627 return type within the overriding function's return type.
2628 We cannot call lookup base here, because we're inside a
2629 dfs_walk, and will therefore clobber the BINFO_MARKED
2630 flags. Fortunately we know the covariancy is valid (it
2631 has already been checked), so we can just iterate along
2632 the binfos, which have been chained in inheritance graph
2633 order. Of course it is lame that we have to repeat the
2634 search here anyway -- we should really be caching pieces
2635 of the vtable and avoiding this repeated work. */
2638 /* Find the base binfo within the overriding function's
2639 return type. We will always find a thunk_binfo, except
2640 when the covariancy is invalid (which we will have
2641 already diagnosed). */
2644 thunk_binfo;
2650 /* See if virtual inheritance is involved. */
2652 virtual_offset;
2659 {
2663 {
2664 /* We convert via virtual base. Adjust the fixed
2665 offset to be from there. */
2666 offset =
2670 }
2672 /* There was an existing fixed offset, this must be
2673 from the base just converted to, and the base the
2674 FN was thunking to. */
2676 else
2678 }
2679 }
2682 /* Replace the overriding function with a covariant thunk. We
2683 will emit the overriding function in its own slot as
2684 well. */
2687 }
2688 else
2692 /* If we need a covariant thunk, then we may need to adjust first_defn.
2693 The ABI specifies that the thunks emitted with a function are
2694 determined by which bases the function overrides, so we need to be
2695 sure that we're using a thunk for some overridden base; even if we
2696 know that the necessary this adjustment is zero, there may not be an
2697 appropriate zero-this-adjusment thunk for us to use since thunks for
2698 overriding virtual bases always use the vcall offset.
2700 Furthermore, just choosing any base that overrides this function isn't
2701 quite right, as this slot won't be used for calls through a type that
2702 puts a covariant thunk here. Calling the function through such a type
2703 will use a different slot, and that slot is the one that determines
2704 the thunk emitted for that base.
2706 So, keep looking until we find the base that we're really overriding
2707 in this slot: the nearest primary base that doesn't use a covariant
2708 thunk in this slot. */
2710 {
2712 /* We already know that the overrider needs a covariant thunk. */
2715 {
2722 }
2724 }
2726 /* Assume that we will produce a thunk that convert all the way to
2727 the final overrider, and not to an intermediate virtual base. */
2730 /* See if we can convert to an intermediate virtual base first, and then
2731 use the vcall offset located there to finish the conversion. */
2733 {
2734 /* If we find the final overrider, then we can stop
2735 walking. */
2740 /* If we find a virtual base, and we haven't yet found the
2741 overrider, then there is a virtual base between the
2742 declaring base (first_defn) and the final overrider. */
2744 {
2747 }
2748 }
2750 /* Compute the constant adjustment to the `this' pointer. The
2751 `this' pointer, when this function is called, will point at BINFO
2752 (or one of its primary bases, which are at the same offset). */
2754 /* The `this' pointer needs to be adjusted from the declaration to
2755 the nearest virtual base. */
2760 /* If the nearest definition is in a lost primary, we don't need an
2761 entry in our vtable. Except possibly in a constructor vtable,
2762 if we happen to get our primary back. In that case, the offset
2763 will be zero, as it will be a primary base. */
2765 else
2766 /* The `this' pointer needs to be adjusted from pointing to
2767 BINFO to pointing at the base where the final overrider
2768 appears. */
2779 else
2783 }
2785 /* Called from modify_all_vtables via dfs_walk. */
2787 static tree
2789 {
2791 tree virtuals;
2792 tree old_virtuals;
2796 /* A base without a vtable needs no modification, and its bases
2797 are uninteresting. */
2802 /* Don't do the primary vtable, if it's new. */
2806 /* There's no need to modify the vtable for a non-virtual primary
2807 base; we're not going to use that vtable anyhow. We do still
2808 need to do this for virtual primary bases, as they could become
2809 non-primary in a construction vtable. */
2814 /* Now, go through each of the virtual functions in the virtual
2815 function table for BINFO. Find the final overrider, and update
2816 the BINFO_VIRTUALS list appropriately. */
2819 virtuals;
2823 binfo,
2828 }
2830 /* Update all of the primary and secondary vtables for T. Create new
2831 vtables as required, and initialize their RTTI information. Each
2832 of the functions in VIRTUALS is declared in T and may override a
2833 virtual function from a base class; find and modify the appropriate
2834 entries to point to the overriding functions. Returns a list, in
2835 declaration order, of the virtual functions that are declared in T,
2836 but do not appear in the primary base class vtable, and which
2837 should therefore be appended to the end of the vtable for T. */
2839 static tree
2841 {
2845 /* Mangle the vtable name before entering dfs_walk (c++/51884). */
2849 /* Update all of the vtables. */
2852 /* Add virtual functions not already in our primary vtable. These
2853 will be both those introduced by this class, and those overridden
2854 from secondary bases. It does not include virtuals merely
2855 inherited from secondary bases. */
2857 {
2862 {
2863 /* We don't need to adjust the `this' pointer when
2864 calling this function. */
2868 /* This is a function not already in our vtable. Keep it. */
2870 }
2871 else
2872 /* We've already got an entry for this function. Skip it. */
2874 }
2877 }
2879 /* Get the base virtual function declarations in T that have the
2880 indicated NAME. */
2882 static void
2884 {
2885 tree methods;
2889 /* Find virtual functions in T with the indicated NAME. */
2894 methods;
2896 {
2901 {
2904 }
2905 }
2911 {
2914 }
2915 }
2917 /* If this declaration supersedes the declaration of
2918 a method declared virtual in the base class, then
2919 mark this field as being virtual as well. */
2921 void
2923 {
2926 /* In [temp.mem] we have:
2928 A specialization of a member function template does not
2929 override a virtual function from a base class. */
2936 /* Set DECL_VINDEX to a value that is neither an INTEGER_CST nor
2937 the error_mark_node so that we know it is an overriding
2938 function. */
2939 {
2946 }
2949 {
2955 }
2960 }
2962 /* Warn about hidden virtual functions that are not overridden in t.
2963 We know that constructors and destructors don't apply. */
2965 static void
2967 {
2969 tree fns;
2972 /* We go through each separately named virtual function. */
2976 {
2977 tree fn;
2978 tree name;
2979 tree fndecl;
2980 tree base_binfo;
2981 tree binfo;
2984 /* All functions in this slot in the CLASSTYPE_METHOD_VEC will
2985 have the same name. Figure out what name that is. */
2987 /* There are no possibly hidden functions yet. */
2989 /* Iterate through all of the base classes looking for possibly
2990 hidden functions. */
2993 {
2996 }
2998 /* If there are no functions to hide, continue. */
3002 /* Remove any overridden functions. */
3004 {
3008 {
3009 /* If the method from the base class has the same
3010 signature as the method from the derived class, it
3011 has been overridden. */
3016 }
3017 }
3019 /* Now give a warning for all base functions without overriders,
3020 as they are hidden. */
3022 tree base_fndecl;
3025 {
3026 /* Here we know it is a hider, and no overrider exists. */
3029 }
3030 }
3031 }
3033 /* Recursive helper for finish_struct_anon. */
3035 static void
3037 {
3041 {
3042 /* We're generally only interested in entities the user
3043 declared, but we also find nested classes by noticing
3044 the TYPE_DECL that we create implicitly. You're
3045 allowed to put one anonymous union inside another,
3046 though, so we explicitly tolerate that. We use
3047 TYPE_ANONYMOUS_P rather than ANON_AGGR_TYPE_P so that
3048 we also allow unnamed types used for defining fields. */
3055 {
3056 /* We already complained about static data members in
3057 finish_static_data_member_decl. */
3059 {
3062 "%q+#D invalid; an anonymous union can "
3064 else
3066 "%q+#D invalid; an anonymous struct can "
3068 }
3070 }
3073 {
3075 {
3079 else
3082 }
3084 {
3088 else
3091 }
3092 }
3097 /* Recurse into the anonymous aggregates to handle correctly
3098 access control (c++/24926):
3100 class A {
3101 union {
3102 union {
3103 int i;
3104 };
3105 };
3106 };
3108 int j=A().i; */
3112 }
3113 }
3115 /* Check for things that are invalid. There are probably plenty of other
3116 things we should check for also. */
3118 static void
3120 {
3122 {
3131 }
3132 }
3134 /* Add T to CLASSTYPE_DECL_LIST of current_class_type which
3135 will be used later during class template instantiation.
3136 When FRIEND_P is zero, T can be a static member data (VAR_DECL),
3137 a non-static member data (FIELD_DECL), a member function
3138 (FUNCTION_DECL), a nested type (RECORD_TYPE, ENUM_TYPE),
3139 a typedef (TYPE_DECL) or a member class template (TEMPLATE_DECL)
3140 When FRIEND_P is nonzero, T is either a friend class
3141 (RECORD_TYPE, TEMPLATE_DECL) or a friend function
3142 (FUNCTION_DECL, TEMPLATE_DECL). */
3144 void
3146 {
3147 /* Save some memory by not creating TREE_LIST if TYPE is not template. */
3152 }
3154 /* This function is called from declare_virt_assop_and_dtor via
3155 dfs_walk_all.
3157 DATA is a type that direcly or indirectly inherits the base
3158 represented by BINFO. If BINFO contains a virtual assignment [copy
3159 assignment or move assigment] operator or a virtual constructor,
3160 declare that function in DATA if it hasn't been already declared. */
3162 static tree
3164 {
3172 /* A base without a vtable needs no modification, and its bases
3173 are uninteresting. */
3177 /* If this is a primary base, then we have already looked at the
3178 virtual functions of its vtable. */
3182 {
3186 {
3191 }
3195 }
3198 }
3200 /* If the class type T has a direct or indirect base that contains a
3201 virtual assignment operator or a virtual destructor, declare that
3202 function in T if it hasn't been already declared. */
3204 static void
3206 {
3214 dfs_declare_virt_assop_and_dtor,
3216 }
3218 /* Declare the inheriting constructor for class T inherited from base
3219 constructor CTOR with the parameter array PARMS of size NPARMS. */
3221 static void
3223 {
3224 /* We don't declare an inheriting ctor that would be a default,
3225 copy or move ctor for derived or base. */
3230 {
3234 }
3242 {
3245 }
3246 }
3248 /* Declare all the inheriting constructors for class T inherited from base
3249 constructor CTOR. */
3251 static void
3253 {
3259 {
3263 }
3266 {
3270 }
3271 }
3273 /* Create default constructors, assignment operators, and so forth for
3274 the type indicated by T, if they are needed. CANT_HAVE_CONST_CTOR,
3275 and CANT_HAVE_CONST_ASSIGNMENT are nonzero if, for whatever reason,
3276 the class cannot have a default constructor, copy constructor
3277 taking a const reference argument, or an assignment operator taking
3278 a const reference, respectively. */
3280 static void
3284 {
3292 /* Destructor. */
3294 {
3295 /* In general, we create destructors lazily. */
3300 /* But if this is a Java class, any non-trivial destructor is
3301 invalid, even if compiler-generated. Therefore, if the
3302 destructor is non-trivial we create it now. */
3304 }
3306 /* [class.ctor]
3308 If there is no user-declared constructor for a class, a default
3309 constructor is implicitly declared. */
3311 {
3316 /* This might force the declaration. */
3318 }
3320 /* [class.ctor]
3322 If a class definition does not explicitly declare a copy
3323 constructor, one is declared implicitly. */
3325 {
3331 }
3333 /* If there is no assignment operator, one will be created if and
3334 when it is needed. For now, just record whether or not the type
3335 of the parameter to the assignment operator will be a const or
3336 non-const reference. */
3338 {
3344 }
3346 /* We can't be lazy about declaring functions that might override
3347 a virtual function from a base class. */
3351 {
3355 {
3356 /* declare, then remove the decl */
3365 }
3366 else
3368 }
3369 }
3371 /* Subroutine of insert_into_classtype_sorted_fields. Recursively
3372 count the number of fields in TYPE, including anonymous union
3373 members. */
3375 static int
3377 {
3378 tree x;
3381 {
3384 else
3386 }
3388 }
3390 /* Subroutine of insert_into_classtype_sorted_fields. Recursively add
3391 all the fields in the TREE_LIST FIELDS to the SORTED_FIELDS_TYPE
3392 elts, starting at offset IDX. */
3394 static int
3396 {
3397 tree x;
3399 {
3402 else
3404 }
3406 }
3408 /* Add all of the enum values of ENUMTYPE, to the FIELD_VEC elts,
3409 starting at offset IDX. */
3411 static int
3415 {
3416 tree values;
3420 }
3422 /* FIELD is a bit-field. We are finishing the processing for its
3423 enclosing type. Issue any appropriate messages and set appropriate
3424 flags. Returns false if an error has been diagnosed. */
3426 static bool
3428 {
3430 tree w;
3432 /* Extract the declared width of the bitfield, which has been
3433 temporarily stashed in DECL_INITIAL. */
3436 /* Remove the bit-field width indicator so that the rest of the
3437 compiler does not treat that value as an initializer. */
3440 /* Detect invalid bit-field type. */
3442 {
3445 }
3446 else
3447 {
3449 /* Avoid the non_lvalue wrapper added by fold for PLUS_EXPRs. */
3452 /* detect invalid field size. */
3458 {
3461 }
3463 {
3466 }
3468 {
3471 }
3483 }
3486 {
3490 }
3491 else
3492 {
3493 /* Non-bit-fields are aligned for their type. */
3497 }
3498 }
3500 /* FIELD is a non bit-field. We are finishing the processing for its
3501 enclosing type T. Issue any appropriate messages and set appropriate
3502 flags. */
3504 static void
3506 tree t,
3510 {
3513 /* In C++98 an anonymous union cannot contain any fields which would change
3514 the settings of CANT_HAVE_CONST_CTOR and friends. */
3516 ;
3517 /* And, we don't set TYPE_HAS_CONST_COPY_CTOR, etc., for anonymous
3518 structs. So, we recurse through their fields here. */
3520 {
3521 tree fields;
3527 }
3528 /* Check members with class type for constructors, destructors,
3529 etc. */
3531 {
3532 /* Never let anything with uninheritable virtuals
3533 make it through without complaint. */
3537 {
3542 field);
3547 field);
3549 {
3553 }
3554 }
3555 else
3556 {
3569 }
3578 }
3583 {
3584 /* `build_class_init_list' does not recognize
3585 non-FIELD_DECLs. */
3589 }
3590 }
3592 /* Check the data members (both static and non-static), class-scoped
3593 typedefs, etc., appearing in the declaration of T. Issue
3594 appropriate diagnostics. Sets ACCESS_DECLS to a list (in
3595 declaration order) of access declarations; each TREE_VALUE in this
3596 list is a USING_DECL.
3598 In addition, set the following flags:
3600 EMPTY_P
3601 The class is empty, i.e., contains no non-static data members.
3603 CANT_HAVE_CONST_CTOR_P
3604 This class cannot have an implicitly generated copy constructor
3605 taking a const reference.
3607 CANT_HAVE_CONST_ASN_REF
3608 This class cannot have an implicitly generated assignment
3609 operator taking a const reference.
3611 All of these flags should be initialized before calling this
3612 function.
3614 Returns a pointer to the end of the TYPE_FIELDs chain; additional
3615 fields can be added by adding to this chain. */
3617 static void
3621 {
3629 /* Assume there are no access declarations. */
3631 /* Assume this class has no pointer members. */
3633 /* Assume none of the members of this class have default
3634 initializations. */
3638 {
3646 {
3647 /* Save the access declarations for our caller. */
3650 }
3656 /* If we've gotten this far, it's a data member, possibly static,
3657 or an enumerator. */
3661 /* When this goes into scope, it will be a non-local reference. */
3666 {
3667 /* [class.union] (C++98)
3669 If a union contains a static data member, or a member of
3670 reference type, the program is ill-formed.
3672 In C++11 this limitation doesn't exist anymore. */
3674 {
3678 }
3680 {
3684 }
3685 }
3687 /* Perform error checking that did not get done in
3688 grokdeclarator. */
3690 {
3694 }
3696 {
3700 }
3708 /* Now it can only be a FIELD_DECL. */
3713 /* If at least one non-static data member is non-literal, the whole
3714 class becomes non-literal. Per Core/1453, volatile non-static
3715 data members and base classes are also not allowed.
3716 Note: if the type is incomplete we will complain later on. */
3721 /* A standard-layout class is a class that:
3722 ...
3723 has the same access control (Clause 11) for all non-static data members,
3724 ... */
3731 /* If this is of reference type, check if it needs an init. */
3733 {
3739 {
3740 /* ARM $12.6.2: [A member initializer list] (or, for an
3741 aggregate, initialization by a brace-enclosed list) is the
3742 only way to initialize nonstatic const and reference
3743 members. */
3746 }
3747 }
3752 {
3754 {
3755 warning
3758 x);
3760 }
3764 }
3767 /* We don't treat zero-width bitfields as making a class
3768 non-empty. */
3769 ;
3770 else
3771 {
3772 /* The class is non-empty. */
3774 /* The class is not even nearly empty. */
3776 /* If one of the data members contains an empty class,
3777 so does T. */
3781 }
3783 /* This is used by -Weffc++ (see below). Warn only for pointers
3784 to members which might hold dynamic memory. So do not warn
3785 for pointers to functions or pointers to members. */
3791 {
3796 }
3802 {
3804 {
3808 }
3810 {
3814 }
3815 }
3818 /* DR 148 now allows pointers to members (which are POD themselves),
3819 to be allowed in POD structs. */
3828 /* We set DECL_C_BIT_FIELD in grokbitfield.
3829 If the type and width are valid, we'll also set DECL_BIT_FIELD. */
3832 cant_have_const_ctor_p,
3833 no_const_asn_ref_p,
3836 /* Now that we've removed bit-field widths from DECL_INITIAL,
3837 anything left in DECL_INITIAL is an NSDMI that makes the class
3838 non-aggregate in C++11. */
3842 /* If any field is const, the structure type is pseudo-const. */
3844 {
3849 {
3850 /* ARM $12.6.2: [A member initializer list] (or, for an
3851 aggregate, initialization by a brace-enclosed list) is the
3852 only way to initialize nonstatic const and reference
3853 members. */
3856 }
3857 }
3858 /* A field that is pseudo-const makes the structure likewise. */
3860 {
3865 }
3867 /* Core issue 80: A nonstatic data member is required to have a
3868 different name from the class iff the class has a
3869 user-declared constructor. */
3873 }
3875 /* Effective C++ rule 11: if a class has dynamic memory held by pointers,
3876 it should also define a copy constructor and an assignment operator to
3877 implement the correct copy semantic (deep vs shallow, etc.). As it is
3878 not feasible to check whether the constructors do allocate dynamic memory
3879 and store it within members, we approximate the warning like this:
3881 -- Warn only if there are members which are pointers
3882 -- Warn only if there is a non-trivial constructor (otherwise,
3883 there cannot be memory allocated).
3884 -- Warn only if there is a non-trivial destructor. We assume that the
3885 user at least implemented the cleanup correctly, and a destructor
3886 is needed to free dynamic memory.
3888 This seems enough for practical purposes. */
3890 && has_pointers
3894 {
3898 {
3903 }
3907 }
3909 /* Non-static data member initializers make the default constructor
3910 non-trivial. */
3912 {
3915 }
3917 /* If any of the fields couldn't be packed, unset TYPE_PACKED. */
3921 /* Check anonymous struct/anonymous union fields. */
3924 /* We've built up the list of access declarations in reverse order.
3925 Fix that now. */
3927 }
3929 /* If TYPE is an empty class type, records its OFFSET in the table of
3930 OFFSETS. */
3932 static int
3934 {
3935 splay_tree_node n;
3940 /* Record the location of this empty object in OFFSETS. */
3948 type,
3952 }
3954 /* Returns nonzero if TYPE is an empty class type and there is
3955 already an entry in OFFSETS for the same TYPE as the same OFFSET. */
3957 static int
3959 {
3960 splay_tree_node n;
3961 tree t;
3966 /* Record the location of this empty object in OFFSETS. */
3976 }
3978 /* Walk through all the subobjects of TYPE (located at OFFSET). Call
3979 F for every subobject, passing it the type, offset, and table of
3980 OFFSETS. If VBASES_P is one, then virtual non-primary bases should
3981 be traversed.
3983 If MAX_OFFSET is non-NULL, then subobjects with an offset greater
3984 than MAX_OFFSET will not be walked.
3986 If F returns a nonzero value, the traversal ceases, and that value
3987 is returned. Otherwise, returns zero. */
3989 static int
3991 subobject_offset_fn f,
3992 tree offset,
3993 splay_tree offsets,
3994 tree max_offset,
3996 {
4000 /* If this OFFSET is bigger than the MAX_OFFSET, then we should
4001 stop. */
4009 {
4012 }
4015 {
4016 tree field;
4017 tree binfo;
4020 /* Avoid recursing into objects that are not interesting. */
4024 /* Record the location of TYPE. */
4029 /* Iterate through the direct base classes of TYPE. */
4033 {
4034 tree binfo_offset;
4039 tree orig_binfo;
4040 /* We cannot rely on BINFO_OFFSET being set for the base
4041 class yet, but the offsets for direct non-virtual
4042 bases can be calculated by going back to the TYPE. */
4045 offset,
4049 f,
4050 binfo_offset,
4051 offsets,
4052 max_offset,
4056 }
4059 {
4063 /* Iterate through the virtual base classes of TYPE. In G++
4064 3.2, we included virtual bases in the direct base class
4065 loop above, which results in incorrect results; the
4066 correct offsets for virtual bases are only known when
4067 working with the most derived type. */
4071 {
4073 f,
4075 offset,
4077 offsets,
4078 max_offset,
4082 }
4083 else
4084 {
4085 /* We still have to walk the primary base, if it is
4086 virtual. (If it is non-virtual, then it was walked
4087 above.) */
4093 {
4094 r = (walk_subobject_offsets
4099 }
4100 }
4101 }
4103 /* Iterate through the fields of TYPE. */
4108 {
4109 tree field_offset;
4114 f,
4116 offset,
4117 field_offset),
4118 offsets,
4119 max_offset,
4123 }
4124 }
4126 {
4129 tree index;
4131 /* Avoid recursing into objects that are not interesting. */
4136 /* Step through each of the elements in the array. */
4140 {
4142 f,
4143 offset,
4144 offsets,
4145 max_offset,
4151 /* If this new OFFSET is bigger than the MAX_OFFSET, then
4152 there's no point in iterating through the remaining
4153 elements of the array. */
4156 }
4157 }
4160 }
4162 /* Record all of the empty subobjects of TYPE (either a type or a
4163 binfo). If IS_DATA_MEMBER is true, then a non-static data member
4164 is being placed at OFFSET; otherwise, it is a base class that is
4165 being placed at OFFSET. */
4167 static void
4169 tree offset,
4170 splay_tree offsets,
4172 {
4173 tree max_offset;
4174 /* If recording subobjects for a non-static data member or a
4175 non-empty base class , we do not need to record offsets beyond
4176 the size of the biggest empty class. Additional data members
4177 will go at the end of the class. Additional base classes will go
4178 either at offset zero (if empty, in which case they cannot
4179 overlap with offsets past the size of the biggest empty class) or
4180 at the end of the class.
4182 However, if we are placing an empty base class, then we must record
4183 all offsets, as either the empty class is at offset zero (where
4184 other empty classes might later be placed) or at the end of the
4185 class (where other objects might then be placed, so other empty
4186 subobjects might later overlap). */
4190 else
4194 }
4196 /* Returns nonzero if any of the empty subobjects of TYPE (located at
4197 OFFSET) conflict with entries in OFFSETS. If VBASES_P is nonzero,
4198 virtual bases of TYPE are examined. */
4200 static int
4202 tree offset,
4203 splay_tree offsets,
4205 {
4206 splay_tree_node max_node;
4208 /* Get the node in OFFSETS that indicates the maximum offset where
4209 an empty subobject is located. */
4211 /* If there aren't any empty subobjects, then there's no point in
4212 performing this check. */
4218 vbases_p);
4219 }
4221 /* DECL is a FIELD_DECL corresponding either to a base subobject of a
4222 non-static data member of the type indicated by RLI. BINFO is the
4223 binfo corresponding to the base subobject, OFFSETS maps offsets to
4224 types already located at those offsets. This function determines
4225 the position of the DECL. */
4227 static void
4229 tree decl,
4230 tree binfo,
4231 splay_tree offsets)
4232 {
4235 tree type;
4238 {
4239 /* For the purposes of determining layout conflicts, we want to
4240 use the class type of BINFO; TREE_TYPE (DECL) will be the
4241 CLASSTYPE_AS_BASE version, which does not contain entries for
4242 zero-sized bases. */
4245 }
4246 else
4247 {
4250 }
4252 /* Try to place the field. It may take more than one try if we have
4253 a hard time placing the field without putting two objects of the
4254 same type at the same address. */
4256 {
4259 /* Place this field. */
4263 /* We have to check to see whether or not there is already
4264 something of the same type at the offset we're about to use.
4265 For example, consider:
4267 struct S {};
4268 struct T : public S { int i; };
4269 struct U : public S, public T {};
4271 Here, we put S at offset zero in U. Then, we can't put T at
4272 offset zero -- its S component would be at the same address
4273 as the S we already allocated. So, we have to skip ahead.
4274 Since all data members, including those whose type is an
4275 empty class, have nonzero size, any overlap can happen only
4276 with a direct or indirect base-class -- it can't happen with
4277 a data member. */
4278 /* In a union, overlap is permitted; all members are placed at
4279 offset zero. */
4284 {
4285 /* Strip off the size allocated to this field. That puts us
4286 at the first place we could have put the field with
4287 proper alignment. */
4290 /* Bump up by the alignment required for the type. */
4291 rli->bitpos
4297 }
4300 {
4301 /* Before ABI v9, we were giving nullptr_t alignment of 1; if
4302 the offset wasn't aligned like a pointer when we started to
4303 layout this field, that affects its position. */
4306 {
4309 "alignment of %qD increased in -fabi-version=9 "
4311 else
4314 }
4316 }
4317 else
4318 /* There was no conflict. We're done laying out this field. */
4320 }
4322 /* Now that we know where it will be placed, update its
4323 BINFO_OFFSET. */
4325 /* Indirect virtual bases may have a nonzero BINFO_OFFSET at
4326 this point because their BINFO_OFFSET is copied from another
4327 hierarchy. Therefore, we may not need to add the entire
4328 OFFSET. */
4334 }
4336 /* Returns true if TYPE is empty and OFFSET is nonzero. */
4338 static int
4340 tree offset,
4342 {
4344 }
4346 /* Layout the empty base BINFO. EOC indicates the byte currently just
4347 past the end of the class, and should be correctly aligned for a
4348 class of the type indicated by BINFO; OFFSETS gives the offsets of
4349 the empty bases allocated so far. T is the most derived
4350 type. Return nonzero iff we added it at the end. */
4352 static bool
4355 {
4356 tree alignment;
4360 /* This routine should only be used for empty classes. */
4365 propagate_binfo_offsets
4369 /* This is an empty base class. We first try to put it at offset
4370 zero. */
4373 offsets,
4375 {
4376 /* That didn't work. Now, we move forward from the next
4377 available spot in the class. */
4381 {
4384 offsets,
4386 /* We finally found a spot where there's no overlap. */
4389 /* There's overlap here, too. Bump along to the next spot. */
4391 }
4392 }
4395 {
4400 }
4403 }
4405 /* Layout the base given by BINFO in the class indicated by RLI.
4406 *BASE_ALIGN is a running maximum of the alignments of
4407 any base class. OFFSETS gives the location of empty base
4408 subobjects. T is the most derived type. Return nonzero if the new
4409 object cannot be nearly-empty. A new FIELD_DECL is inserted at
4410 *NEXT_FIELD, unless BINFO is for an empty base class.
4412 Returns the location at which the next field should be inserted. */
4417 {
4422 /* This error is now reported in xref_tag, thus giving better
4423 location information. */
4426 /* Place the base class. */
4428 {
4429 tree decl;
4431 /* The containing class is non-empty because it has a non-empty
4432 base class. */
4435 /* Create the FIELD_DECL. */
4442 {
4450 /* Try to place the field. It may take more than one try if we
4451 have a hard time placing the field without putting two
4452 objects of the same type at the same address. */
4454 /* Add the new FIELD_DECL to the list of fields for T. */
4458 }
4459 }
4460 else
4461 {
4462 tree eoc;
4465 /* On some platforms (ARM), even empty classes will not be
4466 byte-aligned. */
4471 /* A nearly-empty class "has no proper base class that is empty,
4472 not morally virtual, and at an offset other than zero." */
4474 {
4477 /* The check above (used in G++ 3.2) is insufficient because
4478 an empty class placed at offset zero might itself have an
4479 empty base at a nonzero offset. */
4481 empty_base_at_nonzero_offset_p,
4482 size_zero_node,
4487 }
4489 /* We do not create a FIELD_DECL for empty base classes because
4490 it might overlap some other field. We want to be able to
4491 create CONSTRUCTORs for the class by iterating over the
4492 FIELD_DECLs, and the back end does not handle overlapping
4493 FIELD_DECLs. */
4495 /* An empty virtual base causes a class to be non-empty
4496 -- but in that case we do not need to clear CLASSTYPE_EMPTY_P
4497 here because that was already done when the virtual table
4498 pointer was created. */
4499 }
4501 /* Record the offsets of BINFO and its base subobjects. */
4504 offsets,
4508 }
4510 /* Layout all of the non-virtual base classes. Record empty
4511 subobjects in OFFSETS. T is the most derived type. Return nonzero
4512 if the type cannot be nearly empty. The fields created
4513 corresponding to the base classes will be inserted at
4514 *NEXT_FIELD. */
4516 static void
4519 {
4520 /* Chain to hold all the new FIELD_DECLs which stand in for base class
4521 subobjects. */
4526 /* The primary base class is always allocated first. */
4531 /* Now allocate the rest of the bases. */
4533 {
4534 tree base_binfo;
4538 /* The primary base was already allocated above, so we don't
4539 need to allocate it again here. */
4543 /* Virtual bases are added at the end (a primary virtual base
4544 will have already been added). */
4550 }
4551 }
4553 /* Go through the TYPE_METHODS of T issuing any appropriate
4554 diagnostics, figuring out which methods override which other
4555 methods, and so forth. */
4557 static void
4559 {
4560 tree x;
4563 {
4567 /* The name of the field is the original field name
4568 Save this in auxiliary field for later overloading. */
4570 {
4574 }
4575 /* All user-provided destructors are non-trivial.
4576 Constructors and assignment ops are handled in
4577 grok_special_member_properties. */
4580 }
4581 }
4583 /* FN is a constructor or destructor. Clone the declaration to create
4584 a specialized in-charge or not-in-charge version, as indicated by
4585 NAME. */
4587 static tree
4589 {
4590 tree parms;
4591 tree clone;
4593 /* Copy the function. */
4595 /* Reset the function name. */
4597 /* Remember where this function came from. */
4599 /* Make it easy to find the CLONE given the FN. */
4603 /* If this is a template, do the rest on the DECL_TEMPLATE_RESULT. */
4605 {
4612 }
4616 /* There's no pending inline data for this function. */
4620 /* The base-class destructor is not virtual. */
4622 {
4626 }
4628 /* If there was an in-charge parameter, drop it from the function
4629 type. */
4631 {
4632 tree basetype;
4633 tree parmtypes;
4634 tree exceptions;
4639 /* Skip the `this' parameter. */
4641 /* Skip the in-charge parameter. */
4643 /* And the VTT parm, in a complete [cd]tor. */
4647 /* If this is subobject constructor or destructor, add the vtt
4648 parameter. */
4652 parmtypes);
4655 exceptions);
4659 }
4661 /* Copy the function parameters. */
4663 /* Remove the in-charge parameter. */
4665 {
4669 }
4670 /* And the VTT parm, in a complete [cd]tor. */
4672 {
4675 else
4676 {
4680 }
4681 }
4684 {
4687 }
4689 /* Create the RTL for this function. */
4697 }
4699 /* Implementation of DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P, do
4700 not invoke this function directly.
4702 For a non-thunk function, returns the address of the slot for storing
4703 the function it is a clone of. Otherwise returns NULL_TREE.
4705 If JUST_TESTING, looks through TEMPLATE_DECL and returns NULL if
4706 cloned_function is unset. This is to support the separate
4707 DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P modes; using the latter
4708 on a template makes sense, but not the former. */
4710 tree *
4712 {
4720 {
4721 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4724 else
4725 #endif
4727 }
4732 else
4734 }
4736 /* Produce declarations for all appropriate clones of FN. If
4737 UPDATE_METHOD_VEC_P is nonzero, the clones are added to the
4738 CLASTYPE_METHOD_VEC as well. */
4740 void
4742 {
4743 tree clone;
4745 /* Avoid inappropriate cloning. */
4751 {
4752 /* For each constructor, we need two variants: an in-charge version
4753 and a not-in-charge version. */
4760 }
4761 else
4762 {
4765 /* For each destructor, we need three variants: an in-charge
4766 version, a not-in-charge version, and an in-charge deleting
4767 version. We clone the deleting version first because that
4768 means it will go second on the TYPE_METHODS list -- and that
4769 corresponds to the correct layout order in the virtual
4770 function table.
4772 For a non-virtual destructor, we do not build a deleting
4773 destructor. */
4775 {
4779 }
4786 }
4788 /* Note that this is an abstract function that is never emitted. */
4790 }
4792 /* DECL is an in charge constructor, which is being defined. This will
4793 have had an in class declaration, from whence clones were
4794 declared. An out-of-class definition can specify additional default
4795 arguments. As it is the clones that are involved in overload
4796 resolution, we must propagate the information from the DECL to its
4797 clones. */
4799 void
4801 {
4802 tree clone;
4806 {
4813 /* Skip the 'this' parameter. */
4829 {
4834 {
4835 /* A default parameter has been added. Adjust the
4836 clone's parameters. */
4840 tree type;
4845 {
4848 clone_parms);
4850 }
4853 clone_parms);
4862 }
4863 }
4865 }
4866 }
4868 /* For each of the constructors and destructors in T, create an
4869 in-charge and not-in-charge variant. */
4871 static void
4873 {
4874 tree fns;
4876 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
4877 out now. */
4885 }
4887 /* Deduce noexcept for a destructor DTOR. */
4889 void
4891 {
4893 {
4896 }
4897 }
4899 /* For each destructor in T, deduce noexcept:
4901 12.4/3: A declaration of a destructor that does not have an
4902 exception-specification is implicitly considered to have the
4903 same exception-specification as an implicit declaration (15.4). */
4905 static void
4907 {
4908 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
4909 out now. */
4915 }
4917 /* Subroutine of set_one_vmethod_tm_attributes. Search base classes
4918 of TYPE for virtual functions which FNDECL overrides. Return a
4919 mask of the tm attributes found therein. */
4921 static int
4923 {
4925 tree base_binfo;
4929 {
4939 else
4941 }
4944 }
4946 /* Subroutine of set_method_tm_attributes. Handle the checks and
4947 inheritance for one virtual method FNDECL. */
4949 static void
4951 {
4952 tree tm_attr;
4957 /* If FNDECL doesn't actually override anything (i.e. T is the
4958 class that first declares FNDECL virtual), then we're done. */
4965 /* Intel STM Language Extension 3.0, Section 4.2 table 4:
4966 tm_pure must match exactly, otherwise no weakening of
4967 tm_safe > tm_callable > nothing. */
4968 /* ??? The tm_pure attribute didn't make the transition to the
4969 multivendor language spec. */
4971 {
4973 {
4976 }
4977 }
4978 /* If the overridden function is tm_pure, then FNDECL must be. */
4981 /* Look for base class combinations that cannot be satisfied. */
4983 {
4989 }
4990 /* If FNDECL did not declare an attribute, then inherit the most
4991 restrictive one. */
4993 {
4995 }
4996 /* Otherwise validate that we're not weaker than a function
4997 that is being overridden. */
4998 else
4999 {
5003 }
5006 err_override:
5010 }
5012 /* For each of the methods in T, propagate a class-level tm attribute. */
5014 static void
5016 {
5019 /* Don't bother collecting tm attributes if transactional memory
5020 support is not enabled. */
5024 /* Process virtual methods first, as they inherit directly from the
5025 base virtual function and also require validation of new attributes. */
5027 {
5028 tree vchain;
5031 {
5036 }
5037 }
5039 /* If the class doesn't have an attribute, nothing more to do. */
5044 /* Any method that does not yet have a tm attribute inherits
5045 the one from the class. */
5047 {
5050 }
5051 }
5053 /* Returns true iff class T has a user-defined constructor other than
5054 the default constructor. */
5056 bool
5058 {
5059 tree fns;
5065 {
5072 }
5075 }
5077 /* Returns the defaulted constructor if T has one. Otherwise, returns
5078 NULL_TREE. */
5080 tree
5082 {
5089 {
5093 {
5099 }
5100 }
5103 }
5105 /* Returns true iff FN is a user-provided function, i.e. user-declared
5106 and not defaulted at its first declaration; or explicit, private,
5107 protected, or non-const. */
5109 bool
5111 {
5114 else
5118 }
5120 /* Returns true iff class T has a user-provided constructor. */
5122 bool
5124 {
5125 tree fns;
5133 /* This can happen in error cases; avoid crashing. */
5142 }
5144 /* Returns true iff class T has a non-user-provided (i.e. implicitly
5145 declared or explicitly defaulted in the class body) default
5146 constructor. */
5148 bool
5150 {
5151 tree fns;
5159 {
5165 }
5168 }
5170 /* TYPE is being used as a virtual base, and has a non-trivial move
5171 assignment. Return true if this is due to there being a user-provided
5172 move assignment in TYPE or one of its subobjects; if there isn't, then
5173 multiple move assignment can't cause any harm. */
5175 bool
5177 {
5178 /* Does the type itself have a user-provided move assignment operator? */
5182 {
5186 }
5188 /* Do any of its bases? */
5190 tree base_binfo;
5195 /* Or non-static data members? */
5197 {
5202 }
5204 /* Seems not. */
5206 }
5208 /* If default-initialization leaves part of TYPE uninitialized, returns
5209 a DECL for the field or TYPE itself (DR 253). */
5211 tree
5213 {
5224 {
5228 }
5233 {
5237 }
5240 }
5242 /* Returns true iff for class T, a trivial synthesized default constructor
5243 would be constexpr. */
5245 bool
5247 {
5248 /* A defaulted trivial default constructor is constexpr
5249 if there is nothing to initialize. */
5252 }
5254 /* Returns true iff class T has a constexpr default constructor. */
5256 bool
5258 {
5259 tree fns;
5262 {
5263 /* The caller should have stripped an enclosing array. */
5266 }
5268 {
5271 /* Non-trivial, we need to check subobject constructors. */
5273 }
5276 }
5278 /* Returns true iff class TYPE has a virtual destructor. */
5280 bool
5282 {
5283 tree dtor;
5291 }
5293 /* Returns true iff class T has a move constructor. */
5295 bool
5297 {
5298 tree fns;
5301 {
5304 }
5314 }
5316 /* Returns true iff class T has a move assignment operator. */
5318 bool
5320 {
5321 tree fns;
5324 {
5327 }
5335 }
5337 /* Returns true iff class T has a move constructor that was explicitly
5338 declared in the class body. Note that this is different from
5339 "user-provided", which doesn't include functions that are defaulted in
5340 the class. */
5342 bool
5344 {
5345 tree fns;
5354 {
5358 }
5361 }
5363 /* Returns true iff class T has a move assignment operator that was
5364 explicitly declared in the class body. */
5366 bool
5368 {
5369 tree fns;
5376 {
5380 }
5383 }
5385 /* Nonzero if we need to build up a constructor call when initializing an
5386 object of this class, either because it has a user-declared constructor
5387 or because it doesn't have a default constructor (so we need to give an
5388 error if no initializer is provided). Use TYPE_NEEDS_CONSTRUCTING when
5389 what you care about is whether or not an object can be produced by a
5390 constructor (e.g. so we don't set TREE_READONLY on const variables of
5391 such type); use this function when what you care about is whether or not
5392 to try to call a constructor to create an object. The latter case is
5393 the former plus some cases of constructors that cannot be called. */
5395 bool
5397 {
5398 tree inner;
5408 /* A user-declared constructor might be private, and a constructor might
5409 be trivial but deleted. */
5412 {
5417 }
5419 }
5421 /* Like type_build_ctor_call, but for destructors. */
5423 bool
5425 {
5426 tree inner;
5435 /* A user-declared destructor might be private, and a destructor might
5436 be trivial but deleted. */
5439 {
5444 }
5446 }
5448 /* Remove all zero-width bit-fields from T. */
5450 static void
5452 {
5457 {
5460 /* We should not be confused by the fact that grokbitfield
5461 temporarily sets the width of the bit field into
5462 DECL_INITIAL (*fieldsp).
5463 check_bitfield_decl eventually sets DECL_SIZE (*fieldsp)
5464 to that width. */
5468 else
5470 }
5471 }
5473 /* Returns TRUE iff we need a cookie when dynamically allocating an
5474 array whose elements have the indicated class TYPE. */
5476 static bool
5478 {
5479 tree fns;
5484 /* If there's a non-trivial destructor, we need a cookie. In order
5485 to iterate through the array calling the destructor for each
5486 element, we'll have to know how many elements there are. */
5490 /* If the usual deallocation function is a two-argument whose second
5491 argument is of type `size_t', then we have to pass the size of
5492 the array to the deallocation function, so we will need to store
5493 a cookie. */
5497 /* If there are no `operator []' members, or the lookup is
5498 ambiguous, then we don't need a cookie. */
5501 /* Loop through all of the functions. */
5503 {
5504 tree fn;
5505 tree second_parm;
5507 /* Select the current function. */
5509 /* See if this function is a one-argument delete function. If
5510 it is, then it will be the usual deallocation function. */
5514 /* Do not consider this function if its second argument is an
5515 ellipsis. */
5518 /* Otherwise, if we have a two-argument function and the second
5519 argument is `size_t', it will be the usual deallocation
5520 function -- unless there is one-argument function, too. */
5524 }
5527 }
5529 /* Finish computing the `literal type' property of class type T.
5531 At this point, we have already processed base classes and
5532 non-static data members. We need to check whether the copy
5533 constructor is trivial, the destructor is trivial, and there
5534 is a trivial default constructor or at least one constexpr
5535 constructor other than the copy constructor. */
5537 static void
5539 {
5540 tree fn;
5556 {
5559 {
5563 }
5564 }
5565 }
5567 /* T is a non-literal type used in a context which requires a constant
5568 expression. Explain why it isn't literal. */
5570 void
5572 {
5582 /* Already explained. */
5591 {
5593 "default constructor, and has no constexpr constructor that "
5596 {
5597 /* Note that we can't simply call locate_ctor because when the
5598 constructor is deleted it just returns NULL_TREE. */
5599 tree fns;
5601 {
5608 {
5611 else
5614 }
5615 }
5616 }
5617 }
5618 else
5619 {
5623 {
5626 {
5631 }
5632 }
5634 {
5635 tree ftype;
5640 {
5645 }
5649 }
5650 }
5651 }
5653 /* Check the validity of the bases and members declared in T. Add any
5654 implicitly-generated functions (like copy-constructors and
5655 assignment operators). Compute various flag bits (like
5656 CLASSTYPE_NON_LAYOUT_POD_T) for T. This routine works purely at the C++
5657 level: i.e., independently of the ABI in use. */
5659 static void
5661 {
5662 /* Nonzero if the implicitly generated copy constructor should take
5663 a non-const reference argument. */
5665 /* Nonzero if the implicitly generated assignment operator
5666 should take a non-const reference argument. */
5668 tree access_decls;
5671 tree fn;
5673 /* By default, we use const reference arguments and generate default
5674 constructors. */
5678 /* Check all the base-classes. */
5682 /* Deduce noexcept on destructors. This needs to happen after we've set
5683 triviality flags appropriately for our bases. */
5687 /* Check all the method declarations. */
5690 /* Save the initial values of these flags which only indicate whether
5691 or not the class has user-provided functions. As we analyze the
5692 bases and members we can set these flags for other reasons. */
5696 /* Check all the data member declarations. We cannot call
5697 check_field_decls until we have called check_bases check_methods,
5698 as check_field_decls depends on TYPE_HAS_NONTRIVIAL_DESTRUCTOR
5699 being set appropriately. */
5704 /* A nearly-empty class has to be vptr-containing; a nearly empty
5705 class contains just a vptr. */
5709 /* Do some bookkeeping that will guide the generation of implicitly
5710 declared member functions. */
5713 /* We need to call a constructor for this class if it has a
5714 user-provided constructor, or if the default constructor is going
5715 to initialize the vptr. (This is not an if-and-only-if;
5716 TYPE_NEEDS_CONSTRUCTING is set elsewhere if bases or members
5717 themselves need constructing.) */
5720 /* [dcl.init.aggr]
5722 An aggregate is an array or a class with no user-provided
5723 constructors ... and no virtual functions.
5725 Again, other conditions for being an aggregate are checked
5726 elsewhere. */
5729 /* This is the C++98/03 definition of POD; it changed in C++0x, but we
5730 retain the old definition internally for ABI reasons. */
5739 /* If the only explicitly declared default constructor is user-provided,
5740 set TYPE_HAS_COMPLEX_DFLT. */
5746 /* Warn if a public base of a polymorphic type has an accessible
5747 non-virtual destructor. It is only now that we know the class is
5748 polymorphic. Although a polymorphic base will have a already
5749 been diagnosed during its definition, we warn on use too. */
5751 {
5754 tree base_binfo;
5758 {
5766 basetype);
5767 }
5768 }
5770 /* If the class has no user-declared constructor, but does have
5771 non-static const or reference data members that can never be
5772 initialized, issue a warning. */
5774 /* Classes with user-declared constructors are presumed to
5775 initialize these members. */
5777 /* Aggregates can be initialized with brace-enclosed
5778 initializers. */
5780 {
5781 tree field;
5784 {
5785 tree type;
5800 }
5801 }
5803 /* Synthesize any needed methods. */
5805 cant_have_const_ctor,
5806 no_const_asn_ref);
5808 /* Check defaulted declarations here so we have cant_have_const_ctor
5809 and don't need to worry about clones. */
5812 {
5815 {
5816 bool imp_const_p
5822 /* If the function is defaulted outside the class, we just
5823 give the synthesis error. */
5826 }
5828 }
5831 {
5832 /* "This class type is not an aggregate." */
5834 }
5836 /* Compute the 'literal type' property before we
5837 do anything with non-static member functions. */
5840 /* Create the in-charge and not-in-charge variants of constructors
5841 and destructors. */
5844 /* Process the using-declarations. */
5848 /* Build and sort the CLASSTYPE_METHOD_VEC. */
5851 /* Figure out whether or not we will need a cookie when dynamically
5852 allocating an array of this type. */
5855 }
5857 /* If T needs a pointer to its virtual function table, set TYPE_VFIELD
5858 accordingly. If a new vfield was created (because T doesn't have a
5859 primary base class), then the newly created field is returned. It
5860 is not added to the TYPE_FIELDS list; it is the caller's
5861 responsibility to do that. Accumulate declared virtual functions
5862 on VIRTUALS_P. */
5864 static tree
5866 {
5867 tree fn;
5869 /* Collect the virtual functions declared in T. */
5874 {
5883 }
5885 /* If we couldn't find an appropriate base class, create a new field
5886 here. Even if there weren't any new virtual functions, we might need a
5887 new virtual function table if we're supposed to include vptrs in
5888 all classes that need them. */
5890 {
5891 /* We build this decl with vtbl_ptr_type_node, which is a
5892 `vtable_entry_type*'. It might seem more precise to use
5893 `vtable_entry_type (*)[N]' where N is the number of virtual
5894 functions. However, that would require the vtable pointer in
5895 base classes to have a different type than the vtable pointer
5896 in derived classes. We could make that happen, but that
5897 still wouldn't solve all the problems. In particular, the
5898 type-based alias analysis code would decide that assignments
5899 to the base class vtable pointer can't alias assignments to
5900 the derived class vtable pointer, since they have different
5901 types. Thus, in a derived class destructor, where the base
5902 class constructor was inlined, we could generate bad code for
5903 setting up the vtable pointer.
5905 Therefore, we use one type for all vtable pointers. We still
5906 use a type-correct type; it's just doesn't indicate the array
5907 bounds. That's better than using `void*' or some such; it's
5908 cleaner, and it let's the alias analysis code know that these
5909 stores cannot alias stores to void*! */
5910 tree field;
5923 /* This class is non-empty. */
5927 }
5930 }
5932 /* Add OFFSET to all base types of BINFO which is a base in the
5933 hierarchy dominated by T.
5935 OFFSET, which is a type offset, is number of bytes. */
5937 static void
5939 {
5941 tree primary_binfo;
5942 tree base_binfo;
5944 /* Update BINFO's offset. */
5949 offset));
5951 /* Find the primary base class. */
5957 /* Scan all of the bases, pushing the BINFO_OFFSET adjust
5958 downwards. */
5960 {
5961 /* Don't do the primary base twice. */
5969 }
5970 }
5972 /* Set BINFO_OFFSET for all of the virtual bases for RLI->T. Update
5973 TYPE_ALIGN and TYPE_SIZE for T. OFFSETS gives the location of
5974 empty subobjects of T. */
5976 static void
5978 {
5979 tree vbase;
5986 /* Find the last field. The artificial fields created for virtual
5987 bases will go after the last extant field to date. */
5992 /* Go through the virtual bases, allocating space for each virtual
5993 base that is not already a primary base class. These are
5994 allocated in inheritance graph order. */
5996 {
6001 {
6002 /* This virtual base is not a primary base of any class in the
6003 hierarchy, so we have to add space for it. */
6006 }
6007 }
6008 }
6010 /* Returns the offset of the byte just past the end of the base class
6011 BINFO. */
6013 static tree
6015 {
6016 tree size;
6021 /* An empty class has zero CLASSTYPE_SIZE_UNIT, but we need to
6022 allocate some space for it. It cannot have virtual bases, so
6023 TYPE_SIZE_UNIT is fine. */
6025 else
6029 }
6031 /* Returns the offset of the byte just past the end of the base class
6032 with the highest offset in T. If INCLUDE_VIRTUALS_P is zero, then
6033 only non-virtual bases are included. */
6035 static tree
6037 {
6040 tree binfo;
6041 tree base_binfo;
6042 tree offset;
6047 {
6057 }
6062 {
6066 }
6069 }
6071 /* Warn about bases of T that are inaccessible because they are
6072 ambiguous. For example:
6074 struct S {};
6075 struct T : public S {};
6076 struct U : public S, public T {};
6078 Here, `(S*) new U' is not allowed because there are two `S'
6079 subobjects of U. */
6081 static void
6083 {
6086 tree basetype;
6087 tree binfo;
6088 tree base_binfo;
6090 /* If there are no repeated bases, nothing can be ambiguous. */
6094 /* Check direct bases. */
6097 {
6103 }
6105 /* Check for ambiguous virtual bases. */
6109 {
6115 }
6116 }
6118 /* Compare two INTEGER_CSTs K1 and K2. */
6120 static int
6122 {
6124 }
6126 /* Increase the size indicated in RLI to account for empty classes
6127 that are "off the end" of the class. */
6129 static void
6131 {
6132 tree eoc;
6133 tree rli_size;
6135 /* It might be the case that we grew the class to allocate a
6136 zero-sized base class. That won't be reflected in RLI, yet,
6137 because we are willing to overlay multiple bases at the same
6138 offset. However, now we need to make sure that RLI is big enough
6139 to reflect the entire class. */
6145 {
6146 /* The size should have been rounded to a whole byte. */
6149 rli->bitpos
6158 }
6159 }
6161 /* Calculate the TYPE_SIZE, TYPE_ALIGN, etc for T. Calculate
6162 BINFO_OFFSETs for all of the base-classes. Position the vtable
6163 pointer. Accumulate declared virtual functions on VIRTUALS_P. */
6165 static void
6167 {
6168 tree non_static_data_members;
6169 tree field;
6170 tree vptr;
6171 record_layout_info rli;
6172 /* Maps offsets (represented as INTEGER_CSTs) to a TREE_LIST of
6173 types that appear at that offset. */
6174 splay_tree empty_base_offsets;
6175 /* True if the last field laid out was a bit-field. */
6177 /* The location at which the next field should be inserted. */
6179 /* T, as a base class. */
6180 tree base_t;
6182 /* Keep track of the first non-static data member. */
6185 /* Start laying out the record. */
6188 /* Mark all the primary bases in the hierarchy. */
6191 /* Create a pointer to our virtual function table. */
6194 /* The vptr is always the first thing in the class. */
6196 {
6201 }
6202 else
6205 /* Build FIELD_DECLs for all of the non-virtual base-types. */
6210 /* Layout the non-static data members. */
6212 {
6213 tree type;
6214 tree padding;
6216 /* We still pass things that aren't non-static data members to
6217 the back end, in case it wants to do something with them. */
6219 {
6221 /* If the static data member has incomplete type, keep track
6222 of it so that it can be completed later. (The handling
6223 of pending statics in finish_record_layout is
6224 insufficient; consider:
6226 struct S1;
6227 struct S2 { static S1 s1; };
6229 At this point, finish_record_layout will be called, but
6230 S1 is still incomplete.) */
6232 {
6234 /* The visibility of static data members is determined
6235 at their point of declaration, not their point of
6236 definition. */
6238 }
6240 }
6248 /* If this field is a bit-field whose width is greater than its
6249 type, then there are some special rules for allocating
6250 it. */
6253 {
6255 tree integer_type;
6257 /* We must allocate the bits as if suitably aligned for the
6258 longest integer type that fits in this many bits. type
6259 of the field. Then, we are supposed to use the left over
6260 bits as additional padding. */
6269 /* ITK now indicates a type that is too large for the
6270 field. We have to back up by one to find the largest
6271 type that fits. */
6272 do
6273 {
6278 /* Figure out how much additional padding is required. */
6280 {
6282 /* In a union, the padding field must have the full width
6283 of the bit-field; all fields start at offset zero. */
6285 else
6288 }
6289 #ifdef PCC_BITFIELD_TYPE_MATTERS
6290 /* An unnamed bitfield does not normally affect the
6291 alignment of the containing class on a target where
6292 PCC_BITFIELD_TYPE_MATTERS. But, the C++ ABI does not
6293 make any exceptions for unnamed bitfields when the
6294 bitfields are longer than their types. Therefore, we
6295 temporarily give the field a name. */
6297 {
6300 }
6301 #endif
6306 empty_base_offsets);
6309 /* Now that layout has been performed, set the size of the
6310 field to the size of its declared type; the rest of the
6311 field is effectively invisible. */
6313 /* We must also reset the DECL_MODE of the field. */
6315 }
6316 else
6318 empty_base_offsets);
6320 /* Remember the location of any empty classes in FIELD. */
6323 empty_base_offsets,
6326 /* If a bit-field does not immediately follow another bit-field,
6327 and yet it starts in the middle of a byte, we have failed to
6328 comply with the ABI. */
6331 /* The TREE_NO_WARNING flag gets set by Objective-C when
6332 laying out an Objective-C class. The ObjC ABI differs
6333 from the C++ ABI, and so we do not want a warning
6334 here. */
6336 && !last_field_was_bitfield
6339 bitsize_unit_node)))
6343 /* The middle end uses the type of expressions to determine the
6344 possible range of expression values. In order to optimize
6345 "x.i > 7" to "false" for a 2-bit bitfield "i", the middle end
6346 must be made aware of the width of "i", via its type.
6348 Because C++ does not have integer types of arbitrary width,
6349 we must (for the purposes of the front end) convert from the
6350 type assigned here to the declared type of the bitfield
6351 whenever a bitfield expression is used as an rvalue.
6352 Similarly, when assigning a value to a bitfield, the value
6353 must be converted to the type given the bitfield here. */
6355 {
6360 {
6367 }
6368 }
6370 /* If we needed additional padding after this field, add it
6371 now. */
6373 {
6374 tree padding_field;
6377 FIELD_DECL,
6378 NULL_TREE,
6379 char_type_node);
6386 NULL_TREE,
6387 empty_base_offsets);
6388 }
6391 }
6394 {
6395 /* Make sure that we are on a byte boundary so that the size of
6396 the class without virtual bases will always be a round number
6397 of bytes. */
6400 }
6402 /* Delete all zero-width bit-fields from the list of fields. Now
6403 that the type is laid out they are no longer important. */
6406 /* Create the version of T used for virtual bases. We do not use
6407 make_class_type for this version; this is an artificial type. For
6408 a POD type, we just reuse T. */
6410 {
6413 /* Set the size and alignment for the new type. */
6414 tree eoc;
6416 /* If the ABI version is not at least two, and the last
6417 field was a bit-field, RLI may not be on a byte
6418 boundary. In particular, rli_size_unit_so_far might
6419 indicate the last complete byte, while rli_size_so_far
6420 indicates the total number of bits used. Therefore,
6421 rli_size_so_far, rather than rli_size_unit_so_far, is
6422 used to compute TYPE_SIZE_UNIT. */
6430 eoc);
6440 /* Copy the fields from T. */
6444 {
6446 FIELD_DECL,
6456 }
6458 /* Record the base version of the type. */
6461 }
6462 else
6465 /* Every empty class contains an empty class. */
6469 /* Set the TYPE_DECL for this type to contain the right
6470 value for DECL_OFFSET, so that we can use it as part
6471 of a COMPONENT_REF for multiple inheritance. */
6474 /* Now fix up any virtual base class types that we left lying
6475 around. We must get these done before we try to lay out the
6476 virtual function table. As a side-effect, this will remove the
6477 base subobject fields. */
6480 /* Make sure that empty classes are reflected in RLI at this
6481 point. */
6484 /* Make sure not to create any structures with zero size. */
6490 /* If this is a non-POD, declaring it packed makes a difference to how it
6491 can be used as a field; don't let finalize_record_size undo it. */
6495 /* Let the back end lay out the type. */
6504 /* Warn about bases that can't be talked about due to ambiguity. */
6507 /* Now that we're done with layout, give the base fields the real types. */
6512 /* Clean up. */
6519 }
6521 /* Determine the "key method" for the class type indicated by TYPE,
6522 and set CLASSTYPE_KEY_METHOD accordingly. */
6524 void
6526 {
6527 tree method;
6530 || processing_template_decl
6535 /* The key method is the first non-pure virtual function that is not
6536 inline at the point of class definition. On some targets the
6537 key function may not be inline; those targets should not call
6538 this function until the end of the translation unit. */
6545 {
6548 }
6551 }
6554 /* Allocate and return an instance of struct sorted_fields_type with
6555 N fields. */
6559 {
6566 }
6569 /* Perform processing required when the definition of T (a class type)
6570 is complete. */
6572 void
6574 {
6575 tree x;
6576 /* A TREE_LIST. The TREE_VALUE of each node is a FUNCTION_DECL. */
6580 {
6585 }
6587 /* If this type was previously laid out as a forward reference,
6588 make sure we lay it out again. */
6592 /* Make assumptions about the class; we'll reset the flags if
6593 necessary. */
6599 /* Do end-of-class semantic processing: checking the validity of the
6600 bases and members and add implicitly generated methods. */
6603 /* Find the key method. */
6605 {
6606 /* The Itanium C++ ABI permits the key method to be chosen when
6607 the class is defined -- even though the key method so
6608 selected may later turn out to be an inline function. On
6609 some systems (such as ARM Symbian OS) the key method cannot
6610 be determined until the end of the translation unit. On such
6611 systems, we leave CLASSTYPE_KEY_METHOD set to NULL, which
6612 will cause the class to be added to KEYED_CLASSES. Then, in
6613 finish_file we will determine the key method. */
6617 /* If a polymorphic class has no key method, we may emit the vtable
6618 in every translation unit where the class definition appears. If
6619 we're devirtualizing, we can look into the vtable even if we
6620 aren't emitting it. */
6623 }
6625 /* Layout the class itself. */
6628 /* We use the base type for trivial assignments, and hence it
6629 needs a mode. */
6634 /* If necessary, create the primary vtable for this class. */
6636 {
6637 /* We must enter these virtuals into the table. */
6641 /* Here we know enough to change the type of our virtual
6642 function table, but we will wait until later this function. */
6645 /* If we're warning about ABI tags, check the types of the new
6646 virtual functions. */
6650 }
6653 {
6655 tree fn;
6662 /* Add entries for virtual functions introduced by this class. */
6666 /* Set DECL_VINDEX for all functions declared in this class. */
6668 fn;
6670 vindex += (TARGET_VTABLE_USES_DESCRIPTORS
6672 {
6676 /* A thunk. We should never be calling this entry directly
6677 from this vtable -- we'd use the entry for the non
6678 thunk base function. */
6682 }
6683 }
6688 /* Complete the rtl for any static member objects of the type we're
6689 working on. */
6696 /* Done with FIELDS...now decide whether to sort these for
6697 faster lookups later.
6699 We use a small number because most searches fail (succeeding
6700 ultimately as the search bores through the inheritance
6701 hierarchy), and we want this failure to occur quickly. */
6705 /* Complain if one of the field types requires lower visibility. */
6708 /* Make the rtl for any new vtables we have created, and unmark
6709 the base types we marked. */
6712 /* Build the VTT for T. */
6715 /* This warning does not make sense for Java classes, since they
6716 cannot have destructors. */
6721 "%q#T has virtual functions and accessible"
6729 /* Class layout, assignment of virtual table slots, etc., is now
6730 complete. Give the back end a chance to tweak the visibility of
6731 the class or perform any other required target modifications. */
6741 /* Finish debugging output for this type. */
6745 {
6748 {
6751 }
6753 {
6756 else
6757 {
6760 }
6762 }
6764 {
6766 "the type of the first field has a different ABI from the "
6769 }
6770 }
6771 }
6773 /* Insert FIELDS into T for the sorted case if the FIELDS count is
6774 equal to THRESHOLD or greater than THRESHOLD. */
6776 static void
6778 {
6781 {
6786 }
6787 }
6789 /* Insert lately defined enum ENUMTYPE into T for the sorted case. */
6791 void
6793 {
6796 {
6798 int n_fields
6809 }
6810 }
6812 /* When T was built up, the member declarations were added in reverse
6813 order. Rearrange them to declaration order. */
6815 void
6817 {
6818 tree next;
6819 tree prev;
6820 tree x;
6822 /* The following lists are all in reverse order. Put them in
6823 declaration order now. */
6827 /* Actually, for the TYPE_FIELDS, only the non TYPE_DECLs are in
6828 reverse order, so we can't just use nreverse. */
6833 {
6837 }
6839 {
6843 }
6844 }
6846 tree
6848 {
6851 /* Now that we've got all the field declarations, reverse everything
6852 as necessary. */
6858 /* Nadger the current location so that diagnostics point to the start of
6859 the struct, not the end. */
6863 {
6864 tree x;
6870 /* We need to emit an error message if this type was used as a parameter
6871 and it is an abstract type, even if it is a template. We construct
6872 a simple CLASSTYPE_PURE_VIRTUALS list without taking bases into
6873 account and we call complete_vars with this type, which will check
6874 the PARM_DECLS. Note that while the type is being defined,
6875 CLASSTYPE_PURE_VIRTUALS contains the list of the inline friends
6876 (see CLASSTYPE_INLINE_FRIENDS) so we need to clear it. */
6882 /* We need to add the target functions to the CLASSTYPE_METHOD_VEC if
6883 an enclosing scope is a template class, so that this function be
6884 found by lookup_fnfields_1 when the using declaration is not
6885 instantiated yet. */
6888 {
6893 }
6895 /* Remember current #pragma pack value. */
6898 /* Fix up any variants we've already built. */
6900 {
6905 }
6906 }
6907 else
6911 {
6912 /* People keep complaining that the compiler crashes on an invalid
6913 definition of initializer_list, so I guess we should explicitly
6914 reject it. What the compiler internals care about is that it's a
6915 template and has a pointer field followed by an integer field. */
6918 {
6921 {
6925 }
6926 }
6929 "definition of std::initializer_list does not match "
6931 }
6939 else
6943 /* Lambdas are defined by the LAMBDA_EXPR. */
6948 }
6949 \f
6950 /* Hash table to avoid endless recursion when handling references. */
6953 /* Return the dynamic type of INSTANCE, if known.
6954 Used to determine whether the virtual function table is needed
6955 or not.
6957 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
6958 of our knowledge of its type. *NONNULL should be initialized
6959 before this function is called. */
6961 static tree
6963 {
6964 #define RECUR(T) fixed_type_or_null((T), nonnull, cdtorp)
6967 {
6971 else
6975 /* This is a call to a constructor, hence it's never zero. */
6977 {
6981 }
6985 /* This is a call to a constructor, hence it's never zero. */
6987 {
6991 }
7000 /* Propagate nonnull. */
7005 CASE_CONVERT:
7011 {
7012 /* Just because we see an ADDR_EXPR doesn't mean we're dealing
7013 with a real object -- given &p->f, p can still be null. */
7015 /* ??? Probably should check DECL_WEAK here. */
7018 }
7022 /* If this component is really a base class reference, then the field
7023 itself isn't definitive. */
7032 {
7036 }
7037 /* fall through... */
7042 {
7046 }
7048 {
7052 /* if we're in a ctor or dtor, we know our type. If
7053 current_class_ptr is set but we aren't in a function, we're in
7054 an NSDMI (and therefore a constructor). */
7059 {
7063 }
7064 }
7066 {
7067 /* We only need one hash table because it is always left empty. */
7069 fixed_type_or_null_ref_ht
7072 /* Reference variables should be references to objects. */
7076 /* Enter the INSTANCE in a table to prevent recursion; a
7077 variable's initializer may refer to the variable
7078 itself. */
7083 {
7084 tree type;
7093 }
7094 }
7099 }
7100 #undef RECUR
7101 }
7103 /* Return nonzero if the dynamic type of INSTANCE is known, and
7104 equivalent to the static type. We also handle the case where
7105 INSTANCE is really a pointer. Return negative if this is a
7106 ctor/dtor. There the dynamic type is known, but this might not be
7107 the most derived base of the original object, and hence virtual
7108 bases may not be laid out according to this type.
7110 Used to determine whether the virtual function table is needed
7111 or not.
7113 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
7114 of our knowledge of its type. *NONNULL should be initialized
7115 before this function is called. */
7117 int
7119 {
7122 tree fixed;
7124 /* processing_template_decl can be false in a template if we're in
7125 instantiate_non_dependent_expr, but we still want to suppress
7126 this check. */
7128 {
7129 /* In a template we only care about the type of the result. */
7133 }
7143 }
7145 \f
7146 void
7148 {
7151 current_class_stack
7159 }
7161 /* Restore the cached PREVIOUS_CLASS_LEVEL. */
7163 static void
7165 {
7166 tree type;
7168 /* We are re-entering the same class we just left, so we don't
7169 have to search the whole inheritance matrix to find all the
7170 decls to bind again. Instead, we install the cached
7171 class_shadowed list and walk through it binding names. */
7174 /* Restore IDENTIFIER_TYPE_VALUE. */
7176 type;
7179 }
7181 /* Set global variables CURRENT_CLASS_NAME and CURRENT_CLASS_TYPE as
7182 appropriate for TYPE.
7184 So that we may avoid calls to lookup_name, we cache the _TYPE
7185 nodes of local TYPE_DECLs in the TREE_TYPE field of the name.
7187 For multiple inheritance, we perform a two-pass depth-first search
7188 of the type lattice. */
7190 void
7192 {
7193 class_stack_node_t csn;
7197 /* Make sure there is enough room for the new entry on the stack. */
7199 {
7201 current_class_stack
7203 current_class_stack_size);
7204 }
7206 /* Insert a new entry on the class stack. */
7213 current_class_depth++;
7215 /* Now set up the new type. */
7221 /* By default, things in classes are private, while things in
7222 structures or unions are public. */
7224 ? access_private_node
7230 {
7231 /* Forcibly remove any old class remnants. */
7233 }
7239 else
7241 }
7243 /* When we exit a toplevel class scope, we save its binding level so
7244 that we can restore it quickly. Here, we've entered some other
7245 class, so we must invalidate our cache. */
7247 void
7249 {
7251 }
7253 /* Get out of the current class scope. If we were in a class scope
7254 previously, that is the one popped to. */
7256 void
7258 {
7261 current_class_depth--;
7267 }
7269 /* Mark the top of the class stack as hidden. */
7271 void
7273 {
7276 }
7278 /* Mark the top of the class stack as un-hidden. */
7280 void
7282 {
7285 }
7287 /* Returns 1 if the class type currently being defined is either T or
7288 a nested type of T. */
7290 bool
7292 {
7300 /* We start looking from 1 because entry 0 is from global scope,
7301 and has no type. */
7303 {
7304 tree c;
7307 else
7308 {
7312 }
7317 }
7319 }
7321 /* If either current_class_type or one of its enclosing classes are derived
7322 from T, return the appropriate type. Used to determine how we found
7323 something via unqualified lookup. */
7325 tree
7327 {
7330 /* The bases of a dependent type are unknown. */
7341 {
7346 }
7349 }
7351 /* Return the outermost enclosing class type that is still open, or
7352 NULL_TREE. */
7354 tree
7356 {
7363 {
7370 }
7372 }
7374 /* Returns the innermost class type which is not a lambda closure type. */
7376 tree
7378 {
7381 /* We start looking from 1 because entry 0 is from global scope,
7382 and has no type. */
7384 {
7385 tree c;
7388 else
7389 {
7393 }
7398 }
7400 }
7402 /* When entering a class scope, all enclosing class scopes' names with
7403 static meaning (static variables, static functions, types and
7404 enumerators) have to be visible. This recursive function calls
7405 pushclass for all enclosing class contexts until global or a local
7406 scope is reached. TYPE is the enclosed class. */
7408 void
7410 {
7411 /* A namespace might be passed in error cases, like A::B:C. */
7419 }
7421 /* Undoes a push_nested_class call. */
7423 void
7425 {
7431 }
7433 /* Returns the number of extern "LANG" blocks we are nested within. */
7435 int
7437 {
7439 }
7441 /* Set global variables CURRENT_LANG_NAME to appropriate value
7442 so that behavior of name-mangling machinery is correct. */
7444 void
7446 {
7450 {
7452 }
7454 {
7456 /* DECL_IGNORED_P is initially set for these types, to avoid clutter.
7457 (See record_builtin_java_type in decl.c.) However, that causes
7458 incorrect debug entries if these types are actually used.
7459 So we re-enable debug output after extern "Java". */
7468 }
7470 {
7472 }
7473 else
7475 }
7477 /* Get out of the current language scope. */
7479 void
7481 {
7483 }
7484 \f
7485 /* Type instantiation routines. */
7487 /* Given an OVERLOAD and a TARGET_TYPE, return the function that
7488 matches the TARGET_TYPE. If there is no satisfactory match, return
7489 error_mark_node, and issue an error & warning messages under
7490 control of FLAGS. Permit pointers to member function if FLAGS
7491 permits. If TEMPLATE_ONLY, the name of the overloaded function was
7492 a template-id, and EXPLICIT_TARGS are the explicitly provided
7493 template arguments.
7495 If OVERLOAD is for one or more member functions, then ACCESS_PATH
7496 is the base path used to reference those member functions. If
7497 the address is resolved to a member function, access checks will be
7498 performed and errors issued if appropriate. */
7500 static tree
7502 tree overload,
7503 tsubst_flags_t flags,
7505 tree explicit_targs,
7506 tree access_path)
7507 {
7508 /* Here's what the standard says:
7510 [over.over]
7512 If the name is a function template, template argument deduction
7513 is done, and if the argument deduction succeeds, the deduced
7514 arguments are used to generate a single template function, which
7515 is added to the set of overloaded functions considered.
7517 Non-member functions and static member functions match targets of
7518 type "pointer-to-function" or "reference-to-function." Nonstatic
7519 member functions match targets of type "pointer-to-member
7520 function;" the function type of the pointer to member is used to
7521 select the member function from the set of overloaded member
7522 functions. If a nonstatic member function is selected, the
7523 reference to the overloaded function name is required to have the
7524 form of a pointer to member as described in 5.3.1.
7526 If more than one function is selected, any template functions in
7527 the set are eliminated if the set also contains a non-template
7528 function, and any given template function is eliminated if the
7529 set contains a second template function that is more specialized
7530 than the first according to the partial ordering rules 14.5.5.2.
7531 After such eliminations, if any, there shall remain exactly one
7532 selected function. */
7535 /* We store the matches in a TREE_LIST rooted here. The functions
7536 are the TREE_PURPOSE, not the TREE_VALUE, in this list, for easy
7537 interoperability with most_specialized_instantiation. */
7539 tree fn;
7540 tree target_fn_type;
7542 /* By the time we get here, we should be seeing only real
7543 pointer-to-member types, not the internal POINTER_TYPE to
7544 METHOD_TYPE representation. */
7550 /* Check that the TARGET_TYPE is reasonable. */
7555 /* This is OK, too. */
7558 /* This is OK, too. This comes from a conversion to reference
7559 type. */
7561 else
7562 {
7568 }
7570 /* Non-member functions and static member functions match targets of type
7571 "pointer-to-function" or "reference-to-function." Nonstatic member
7572 functions match targets of type "pointer-to-member-function;" the
7573 function type of the pointer to member is used to select the member
7574 function from the set of overloaded member functions.
7576 So figure out the FUNCTION_TYPE that we want to match against. */
7579 /* If we can find a non-template function that matches, we can just
7580 use it. There's no point in generating template instantiations
7581 if we're just going to throw them out anyhow. But, of course, we
7582 can only do this when we don't *need* a template function. */
7584 {
7585 tree fns;
7588 {
7592 /* We're not looking for templates just yet. */
7597 /* We're looking for a non-static member, and this isn't
7598 one, or vice versa. */
7601 /* Ignore functions which haven't been explicitly
7602 declared. */
7606 /* See if there's a match. */
7609 }
7610 }
7612 /* Now, if we've already got a match (or matches), there's no need
7613 to proceed to the template functions. But, if we don't have a
7614 match we need to look at them, too. */
7616 {
7617 tree target_arg_types;
7618 tree target_ret_type;
7619 tree fns;
7622 tree arg;
7636 {
7638 tree instantiation;
7639 tree targs;
7642 /* We're only looking for templates. */
7647 /* We're not looking for a non-static member, and this is
7648 one, or vice versa. */
7653 /* If the template has a deduced return type, don't expose it to
7654 template argument deduction. */
7658 /* Try to do argument deduction. */
7665 /* Instantiation failed. */
7668 /* And now force instantiation to do return type deduction. */
7670 {
7676 }
7678 /* See if there's a match. */
7681 }
7683 /* Now, remove all but the most specialized of the matches. */
7685 {
7690 NULL_TREE,
7691 NULL_TREE);
7692 }
7693 }
7695 /* Now we should have exactly one function in MATCHES. */
7697 {
7698 /* There were *no* matches. */
7700 {
7703 target_type);
7706 }
7708 }
7710 {
7711 /* There were too many matches. First check if they're all
7712 the same function. */
7717 /* For multi-versioned functions, more than one match is just fine and
7718 decls_match will return false as they are different. */
7726 {
7728 {
7731 target_type);
7733 /* Since print_candidates expects the functions in the
7734 TREE_VALUE slot, we flip them here. */
7739 }
7742 }
7743 }
7745 /* Good, exactly one match. Now, convert it to the correct type. */
7750 {
7758 {
7761 }
7762 }
7764 /* If a pointer to a function that is multi-versioned is requested, the
7765 pointer to the dispatcher function is returned instead. This works
7766 well because indirectly calling the function will dispatch the right
7767 function version at run-time. */
7769 {
7773 /* Mark all the versions corresponding to the dispatcher as used. */
7776 }
7778 /* If we're doing overload resolution purely for the purpose of
7779 determining conversion sequences, we should not consider the
7780 function used. If this conversion sequence is selected, the
7781 function will be marked as used at this point. */
7783 {
7784 /* Make =delete work with SFINAE. */
7789 }
7791 /* We could not check access to member functions when this
7792 expression was originally created since we did not know at that
7793 time to which function the expression referred. */
7795 {
7798 }
7802 else
7803 {
7804 /* The target must be a REFERENCE_TYPE. Above, cp_build_unary_op
7805 will mark the function as addressed, but here we must do it
7806 explicitly. */
7810 }
7811 }
7813 /* This function will instantiate the type of the expression given in
7814 RHS to match the type of LHSTYPE. If errors exist, then return
7815 error_mark_node. FLAGS is a bit mask. If TF_ERROR is set, then
7816 we complain on errors. If we are not complaining, never modify rhs,
7817 as overload resolution wants to try many possible instantiations, in
7818 the hope that at least one will work.
7820 For non-recursive calls, LHSTYPE should be a function, pointer to
7821 function, or a pointer to member function. */
7823 tree
7825 {
7832 {
7836 }
7839 {
7846 /* Microsoft allows `A::f' to be resolved to a
7847 pointer-to-member. */
7848 ;
7849 else
7850 {
7855 }
7856 }
7859 {
7862 }
7864 /* If we are in a template, and have a NON_DEPENDENT_EXPR, we cannot
7865 deduce any type information. */
7867 {
7871 }
7873 /* There only a few kinds of expressions that may have a type
7874 dependent on overload resolution. */
7880 /* This should really only be used when attempting to distinguish
7881 what sort of a pointer to function we have. For now, any
7882 arithmetic operation which is not supported on pointers
7883 is rejected as an error. */
7886 {
7888 {
7894 /* Do not lose object's side effects. */
7898 }
7905 /* This can happen if we are forming a pointer-to-member for a
7906 member template. */
7909 /* Fall through. */
7912 {
7916 return
7920 }
7924 return
7928 access_path);
7931 {
7936 }
7943 }
7945 }
7946 \f
7947 /* Return the name of the virtual function pointer field
7948 (as an IDENTIFIER_NODE) for the given TYPE. Note that
7949 this may have to look back through base types to find the
7950 ultimate field name. (For single inheritance, these could
7951 all be the same name. Who knows for multiple inheritance). */
7953 static tree
7955 {
7962 {
7968 }
7976 }
7978 void
7980 {
7987 {
7992 }
7993 }
7995 /* Build a dummy reference to ourselves so Derived::Base (and A::A) works,
7996 according to [class]:
7997 The class-name is also inserted
7998 into the scope of the class itself. For purposes of access checking,
7999 the inserted class name is treated as if it were a public member name. */
8001 void
8003 {
8006 tree saved_cas;
8021 }
8023 /* Returns 1 if TYPE contains only padding bytes. */
8025 int
8027 {
8035 }
8037 /* Returns true if TYPE contains no actual data, just various
8038 possible combinations of empty classes and possibly a vptr. */
8040 bool
8042 {
8044 {
8045 tree field;
8046 tree binfo;
8047 tree base_binfo;
8050 /* CLASSTYPE_EMPTY_P isn't set properly until the class is actually laid
8051 out, but we'd like to be able to check this before then. */
8065 }
8069 }
8071 /* Note that NAME was looked up while the current class was being
8072 defined and that the result of that lookup was DECL. */
8074 void
8076 {
8077 splay_tree names_used;
8079 /* If we're not defining a class, there's nothing to do. */
8085 /* If there's already a binding for this NAME, then we don't have
8086 anything to worry about. */
8099 }
8101 /* Note that NAME was declared (as DECL) in the current class. Check
8102 to see that the declaration is valid. */
8104 void
8106 {
8107 splay_tree names_used;
8108 splay_tree_node n;
8110 /* Look to see if we ever used this name. */
8111 names_used
8115 /* The C language allows members to be declared with a type of the same
8116 name, and the C++ standard says this diagnostic is not required. So
8117 allow it in extern "C" blocks unless predantic is specified.
8118 Allow it in all cases if -ms-extensions is specified. */
8124 {
8125 /* [basic.scope.class]
8127 A name N used in a class S shall refer to the same declaration
8128 in its context and when re-evaluated in the completed scope of
8129 S. */
8133 }
8134 }
8136 /* Returns the VAR_DECL for the complete vtable associated with BINFO.
8137 Secondary vtables are merged with primary vtables; this function
8138 will return the VAR_DECL for the primary vtable. */
8140 tree
8142 {
8143 tree decl;
8147 {
8150 }
8154 }
8157 /* Returns the binfo for the primary base of BINFO. If the resulting
8158 BINFO is a virtual base, and it is inherited elsewhere in the
8159 hierarchy, then the returned binfo might not be the primary base of
8160 BINFO in the complete object. Check BINFO_PRIMARY_P or
8161 BINFO_LOST_PRIMARY_P to be sure. */
8163 static tree
8165 {
8166 tree primary_base;
8173 }
8175 /* If INDENTED_P is zero, indent to INDENT. Return nonzero. */
8177 static int
8179 {
8183 }
8185 /* Dump the offsets of all the bases rooted at BINFO to STREAM.
8186 INDENT should be zero when called from the top level; it is
8187 incremented recursively. IGO indicates the next expected BINFO in
8188 inheritance graph ordering. */
8190 static tree
8193 tree binfo,
8194 tree igo,
8196 {
8198 tree base_binfo;
8206 {
8209 }
8224 {
8228 TFF_PLAIN_IDENTIFIER),
8230 }
8232 {
8235 }
8240 {
8244 {
8248 TFF_PLAIN_IDENTIFIER));
8249 }
8251 {
8255 TFF_PLAIN_IDENTIFIER));
8256 }
8258 {
8262 TFF_PLAIN_IDENTIFIER));
8263 }
8265 {
8269 TFF_PLAIN_IDENTIFIER));
8270 }
8274 }
8280 }
8282 /* Dump the BINFO hierarchy for T. */
8284 static void
8286 {
8298 }
8300 /* Debug interface to hierarchy dumping. */
8302 void
8304 {
8306 }
8308 static void
8310 {
8315 {
8317 }
8318 }
8320 static void
8322 {
8323 tree value;
8325 HOST_WIDE_INT elt;
8333 TFF_PLAIN_IDENTIFIER));
8340 }
8342 static void
8344 {
8352 {
8359 {
8364 }
8368 }
8369 }
8371 static void
8373 {
8381 {
8386 }
8387 }
8389 /* Dump a function or thunk and its thunkees. */
8391 static void
8393 {
8396 tree thunks;
8404 {
8414 else
8420 }
8424 }
8426 /* Dump the thunks for FN. */
8428 void
8430 {
8432 }
8434 /* Virtual function table initialization. */
8436 /* Create all the necessary vtables for T and its base classes. */
8438 static void
8440 {
8441 tree vbase;
8445 /* We lay out the primary and secondary vtables in one contiguous
8446 vtable. The primary vtable is first, followed by the non-virtual
8447 secondary vtables in inheritance graph order. */
8451 /* Then come the virtual bases, also in inheritance graph order. */
8453 {
8457 }
8461 }
8463 /* Initialize the vtable for BINFO with the INITS. */
8465 static void
8467 {
8468 tree decl;
8474 }
8476 /* Build the VTT (virtual table table) for T.
8477 A class requires a VTT if it has virtual bases.
8479 This holds
8480 1 - primary virtual pointer for complete object T
8481 2 - secondary VTTs for each direct non-virtual base of T which requires a
8482 VTT
8483 3 - secondary virtual pointers for each direct or indirect base of T which
8484 has virtual bases or is reachable via a virtual path from T.
8485 4 - secondary VTTs for each direct or indirect virtual base of T.
8487 Secondary VTTs look like complete object VTTs without part 4. */
8489 static void
8491 {
8492 tree type;
8493 tree vtt;
8494 tree index;
8497 /* Build up the initializers for the VTT. */
8502 /* If we didn't need a VTT, we're done. */
8506 /* Figure out the type of the VTT. */
8510 /* Now, build the VTT object itself. */
8513 /* Add the VTT to the vtables list. */
8518 }
8520 /* When building a secondary VTT, BINFO_VTABLE is set to a TREE_LIST with
8521 PURPOSE the RTTI_BINFO, VALUE the real vtable pointer for this binfo,
8522 and CHAIN the vtable pointer for this binfo after construction is
8523 complete. VALUE can also be another BINFO, in which case we recurse. */
8525 static tree
8527 {
8528 tree vt;
8531 {
8537 else
8539 }
8542 }
8544 /* Data for secondary VTT initialization. */
8546 {
8547 /* Is this the primary VTT? */
8550 /* Current index into the VTT. */
8551 tree index;
8553 /* Vector of initializers built up. */
8556 /* The type being constructed by this secondary VTT. */
8557 tree type_being_constructed;
8560 /* Recursively build the VTT-initializer for BINFO (which is in the
8561 hierarchy dominated by T). INITS points to the end of the initializer
8562 list to date. INDEX is the VTT index where the next element will be
8563 replaced. Iff BINFO is the binfo for T, this is the top level VTT (i.e.
8564 not a subvtt for some base of T). When that is so, we emit the sub-VTTs
8565 for virtual bases of T. When it is not so, we build the constructor
8566 vtables for the BINFO-in-T variant. */
8568 static void
8571 {
8573 tree b;
8574 tree init;
8575 secondary_vptr_vtt_init_data data;
8578 /* We only need VTTs for subobjects with virtual bases. */
8582 /* We need to use a construction vtable if this is not the primary
8583 VTT. */
8585 {
8588 /* Record the offset in the VTT where this sub-VTT can be found. */
8590 }
8592 /* Add the address of the primary vtable for the complete object. */
8596 {
8599 }
8602 /* Recursively add the secondary VTTs for non-virtual bases. */
8607 /* Add secondary virtual pointers for all subobjects of BINFO with
8608 either virtual bases or reachable along a virtual path, except
8609 subobjects that are non-virtual primary bases. */
8619 /* data.inits might have grown as we added secondary virtual pointers.
8620 Make sure our caller knows about the new vector. */
8624 /* Add the secondary VTTs for virtual bases in inheritance graph
8625 order. */
8627 {
8632 }
8633 else
8634 /* Remove the ctor vtables we created. */
8636 }
8638 /* Called from build_vtt_inits via dfs_walk. BINFO is the binfo for the base
8639 in most derived. DATA is a SECONDARY_VPTR_VTT_INIT_DATA structure. */
8641 static tree
8643 {
8646 /* We don't care about bases that don't have vtables. */
8650 /* We're only interested in proper subobjects of the type being
8651 constructed. */
8655 /* We're only interested in bases with virtual bases or reachable
8656 via a virtual path from the type being constructed. */
8661 /* We're not interested in non-virtual primary bases. */
8665 /* Record the index where this secondary vptr can be found. */
8667 {
8672 {
8673 /* It's a primary virtual base, and this is not a
8674 construction vtable. Find the base this is primary of in
8675 the inheritance graph, and use that base's vtable
8676 now. */
8679 }
8680 }
8682 /* Add the initializer for the secondary vptr itself. */
8685 /* Advance the vtt index. */
8690 }
8692 /* Called from build_vtt_inits via dfs_walk. After building
8693 constructor vtables and generating the sub-vtt from them, we need
8694 to restore the BINFO_VTABLES that were scribbled on. DATA is the
8695 binfo of the base whose sub vtt was generated. */
8697 static tree
8699 {
8703 /* If this class has no vtable, none of its bases do. */
8707 /* This might be a primary base, so have no vtable in this
8708 hierarchy. */
8711 /* If we scribbled the construction vtable vptr into BINFO, clear it
8712 out now. */
8718 }
8720 /* Build the construction vtable group for BINFO which is in the
8721 hierarchy dominated by T. */
8723 static void
8725 {
8726 tree type;
8727 tree vtbl;
8728 tree id;
8729 tree vbase;
8732 /* See if we've already created this construction vtable group. */
8738 /* Build a version of VTBL (with the wrong type) for use in
8739 constructing the addresses of secondary vtables in the
8740 construction vtable group. */
8743 /* Don't export construction vtables from shared libraries. Even on
8744 targets that don't support hidden visibility, this tells
8745 can_refer_decl_in_current_unit_p not to assume that it's safe to
8746 access from a different compilation unit (bz 54314). */
8754 /* Add the vtables for each of our virtual bases using the vbase in T
8755 binfo. */
8757 vbase;
8759 {
8760 tree b;
8767 }
8769 /* Figure out the type of the construction vtable. */
8776 /* Initialize the construction vtable. */
8780 }
8782 /* Add the vtbl initializers for BINFO (and its bases other than
8783 non-virtual primaries) to the list of INITS. BINFO is in the
8784 hierarchy dominated by T. RTTI_BINFO is the binfo within T of
8785 the constructor the vtbl inits should be accumulated for. (If this
8786 is the complete object vtbl then RTTI_BINFO will be TYPE_BINFO (T).)
8787 ORIG_BINFO is the binfo for this object within BINFO_TYPE (RTTI_BINFO).
8788 BINFO is the active base equivalent of ORIG_BINFO in the inheritance
8789 graph of T. Both BINFO and ORIG_BINFO will have the same BINFO_TYPE,
8790 but are not necessarily the same in terms of layout. */
8792 static void
8794 tree orig_binfo,
8795 tree rtti_binfo,
8796 tree vtbl,
8797 tree t,
8799 {
8801 tree base_binfo;
8806 /* If it doesn't have a vptr, we don't do anything. */
8810 /* If we're building a construction vtable, we're not interested in
8811 subobjects that don't require construction vtables. */
8817 /* Build the initializers for the BINFO-in-T vtable. */
8820 /* Walk the BINFO and its bases. We walk in preorder so that as we
8821 initialize each vtable we can figure out at what offset the
8822 secondary vtable lies from the primary vtable. We can't use
8823 dfs_walk here because we need to iterate through bases of BINFO
8824 and RTTI_BINFO simultaneously. */
8826 {
8827 /* Skip virtual bases. */
8833 inits);
8834 }
8835 }
8837 /* Called from accumulate_vtbl_inits. Adds the initializers for the
8838 BINFO vtable to L. */
8840 static void
8842 tree orig_binfo,
8843 tree rtti_binfo,
8844 tree orig_vtbl,
8845 tree t,
8847 {
8854 {
8855 /* In the hierarchy of BINFO_TYPE (RTTI_BINFO), this is a
8856 primary virtual base. If it is not the same primary in
8857 the hierarchy of T, we'll need to generate a ctor vtable
8858 for it, to place at its location in T. If it is the same
8859 primary, we still need a VTT entry for the vtable, but it
8860 should point to the ctor vtable for the base it is a
8861 primary for within the sub-hierarchy of RTTI_BINFO.
8863 There are three possible cases:
8865 1) We are in the same place.
8866 2) We are a primary base within a lost primary virtual base of
8867 RTTI_BINFO.
8868 3) We are primary to something not a base of RTTI_BINFO. */
8870 tree b;
8873 /* First, look through the bases we are primary to for RTTI_BINFO
8874 or a virtual base. */
8877 {
8882 }
8883 /* If we run out of primary links, keep looking down our
8884 inheritance chain; we might be an indirect primary. */
8888 found:
8890 /* If we found RTTI_BINFO, this is case 1. If we found a virtual
8891 base B and it is a base of RTTI_BINFO, this is case 2. In
8892 either case, we share our vtable with LAST, i.e. the
8893 derived-most base within B of which we are a primary. */
8896 /* Just set our BINFO_VTABLE to point to LAST, as we may not have
8897 set LAST's BINFO_VTABLE yet. We'll extract the actual vptr in
8898 binfo_ctor_vtable after everything's been set up. */
8901 /* Otherwise, this is case 3 and we get our own. */
8902 }
8909 {
8910 tree index;
8913 /* Add the initializer for this vtable. */
8917 /* Figure out the position to which the VPTR should point. */
8923 }
8926 /* For a construction vtable, we can't overwrite BINFO_VTABLE.
8927 So, we make a TREE_LIST. Later, dfs_fixup_binfo_vtbls will
8928 straighten this out. */
8931 /* Throw away any unneeded intializers. */
8933 else
8934 /* For an ordinary vtable, set BINFO_VTABLE. */
8936 }
8940 /* Construct the initializer for BINFO's virtual function table. BINFO
8941 is part of the hierarchy dominated by T. If we're building a
8942 construction vtable, the ORIG_BINFO is the binfo we should use to
8943 find the actual function pointers to put in the vtable - but they
8944 can be overridden on the path to most-derived in the graph that
8945 ORIG_BINFO belongs. Otherwise,
8946 ORIG_BINFO should be the same as BINFO. The RTTI_BINFO is the
8947 BINFO that should be indicated by the RTTI information in the
8948 vtable; it will be a base class of T, rather than T itself, if we
8949 are building a construction vtable.
8951 The value returned is a TREE_LIST suitable for wrapping in a
8952 CONSTRUCTOR to use as the DECL_INITIAL for a vtable. If
8953 NON_FN_ENTRIES_P is not NULL, *NON_FN_ENTRIES_P is set to the
8954 number of non-function entries in the vtable.
8956 It might seem that this function should never be called with a
8957 BINFO for which BINFO_PRIMARY_P holds, the vtable for such a
8958 base is always subsumed by a derived class vtable. However, when
8959 we are building construction vtables, we do build vtables for
8960 primary bases; we need these while the primary base is being
8961 constructed. */
8963 static void
8965 tree orig_binfo,
8966 tree t,
8967 tree rtti_binfo,
8970 {
8971 tree v;
8972 vtbl_init_data vid;
8974 tree vbinfo;
8978 /* Initialize VID. */
8986 /* The first vbase or vcall offset is at index -3 in the vtable. */
8989 /* Add entries to the vtable for RTTI. */
8992 /* Create an array for keeping track of the functions we've
8993 processed. When we see multiple functions with the same
8994 signature, we share the vcall offsets. */
8996 /* Add the vcall and vbase offset entries. */
8999 /* Clear BINFO_VTABLE_PATH_MARKED; it's set by
9000 build_vbase_offset_vtbl_entries. */
9005 /* If the target requires padding between data entries, add that now. */
9007 {
9012 /* Move data entries into their new positions and add padding
9013 after the new positions. Iterate backwards so we don't
9014 overwrite entries that we would need to process later. */
9017 ix--)
9018 {
9026 {
9030 null_pointer_node);
9031 }
9032 }
9033 }
9038 /* The initializers for virtual functions were built up in reverse
9039 order. Straighten them out and add them to the running list in one
9040 step. */
9049 /* Go through all the ordinary virtual functions, building up
9050 initializers. */
9052 {
9053 tree delta;
9054 tree vcall_index;
9061 {
9065 {
9068 }
9070 }
9072 /* If the only definition of this function signature along our
9073 primary base chain is from a lost primary, this vtable slot will
9074 never be used, so just zero it out. This is important to avoid
9075 requiring extra thunks which cannot be generated with the function.
9077 We first check this in update_vtable_entry_for_fn, so we handle
9078 restored primary bases properly; we also need to do it here so we
9079 zero out unused slots in ctor vtables, rather than filling them
9080 with erroneous values (though harmless, apart from relocation
9081 costs). */
9086 {
9087 /* Pull the offset for `this', and the function to call, out of
9088 the list. */
9095 /* You can't call an abstract virtual function; it's abstract.
9096 So, we replace these functions with __pure_virtual. */
9098 {
9101 {
9103 abort_fndecl_addr
9107 }
9108 }
9109 /* Likewise for deleted virtuals. */
9111 {
9120 }
9121 else
9122 {
9124 {
9128 }
9129 /* Take the address of the function, considering it to be of an
9130 appropriate generic type. */
9134 /* Don't refer to a virtual destructor from a constructor
9135 vtable or a vtable for an abstract class, since destroying
9136 an object under construction is undefined behavior and we
9137 don't want it to be considered a candidate for speculative
9138 devirtualization. But do create the thunk for ABI
9139 compliance. */
9144 }
9145 }
9147 /* And add it to the chain of initializers. */
9149 {
9154 else
9156 {
9162 }
9163 }
9164 else
9166 }
9167 }
9169 /* Adds to vid->inits the initializers for the vbase and vcall
9170 offsets in BINFO, which is in the hierarchy dominated by T. */
9172 static void
9174 {
9175 tree b;
9177 /* If this is a derived class, we must first create entries
9178 corresponding to the primary base class. */
9183 /* Add the vbase entries for this base. */
9185 /* Add the vcall entries for this base. */
9187 }
9189 /* Returns the initializers for the vbase offset entries in the vtable
9190 for BINFO (which is part of the class hierarchy dominated by T), in
9191 reverse order. VBASE_OFFSET_INDEX gives the vtable index
9192 where the next vbase offset will go. */
9194 static void
9196 {
9197 tree vbase;
9198 tree t;
9199 tree non_primary_binfo;
9201 /* If there are no virtual baseclasses, then there is nothing to
9202 do. */
9208 /* We might be a primary base class. Go up the inheritance hierarchy
9209 until we find the most derived class of which we are a primary base:
9210 it is the offset of that which we need to use. */
9213 {
9214 tree b;
9216 /* If we have reached a virtual base, then it must be a primary
9217 base (possibly multi-level) of vid->binfo, or we wouldn't
9218 have called build_vcall_and_vbase_vtbl_entries for it. But it
9219 might be a lost primary, so just skip down to vid->binfo. */
9221 {
9224 }
9230 }
9232 /* Go through the virtual bases, adding the offsets. */
9234 vbase;
9236 {
9237 tree b;
9238 tree delta;
9243 /* Find the instance of this virtual base in the complete
9244 object. */
9247 /* If we've already got an offset for this virtual base, we
9248 don't need another one. */
9253 /* Figure out where we can find this vbase offset. */
9262 /* The vbase offset had better be the same. */
9265 /* The next vbase will come at a more negative offset. */
9269 /* The initializer is the delta from BINFO to this virtual base.
9270 The vbase offsets go in reverse inheritance-graph order, and
9271 we are walking in inheritance graph order so these end up in
9272 the right order. */
9279 }
9280 }
9282 /* Adds the initializers for the vcall offset entries in the vtable
9283 for BINFO (which is part of the class hierarchy dominated by VID->DERIVED)
9284 to VID->INITS. */
9286 static void
9288 {
9289 /* We only need these entries if this base is a virtual base. We
9290 compute the indices -- but do not add to the vtable -- when
9291 building the main vtable for a class. */
9294 /* If BINFO is RTTI_BINFO, then (since BINFO does not
9295 correspond to VID->DERIVED), we are building a primary
9296 construction virtual table. Since this is a primary
9297 virtual table, we do not need the vcall offsets for
9298 BINFO. */
9300 {
9301 /* We need a vcall offset for each of the virtual functions in this
9302 vtable. For example:
9304 class A { virtual void f (); };
9305 class B1 : virtual public A { virtual void f (); };
9306 class B2 : virtual public A { virtual void f (); };
9307 class C: public B1, public B2 { virtual void f (); };
9309 A C object has a primary base of B1, which has a primary base of A. A
9310 C also has a secondary base of B2, which no longer has a primary base
9311 of A. So the B2-in-C construction vtable needs a secondary vtable for
9312 A, which will adjust the A* to a B2* to call f. We have no way of
9313 knowing what (or even whether) this offset will be when we define B2,
9314 so we store this "vcall offset" in the A sub-vtable and look it up in
9315 a "virtual thunk" for B2::f.
9317 We need entries for all the functions in our primary vtable and
9318 in our non-virtual bases' secondary vtables. */
9320 /* If we are just computing the vcall indices -- but do not need
9321 the actual entries -- not that. */
9324 /* Now, walk through the non-virtual bases, adding vcall offsets. */
9326 }
9327 }
9329 /* Build vcall offsets, starting with those for BINFO. */
9331 static void
9333 {
9335 tree primary_binfo;
9336 tree base_binfo;
9338 /* Don't walk into virtual bases -- except, of course, for the
9339 virtual base for which we are building vcall offsets. Any
9340 primary virtual base will have already had its offsets generated
9341 through the recursion in build_vcall_and_vbase_vtbl_entries. */
9345 /* If BINFO has a primary base, process it first. */
9350 /* Add BINFO itself to the list. */
9353 /* Scan the non-primary bases of BINFO. */
9357 }
9359 /* Called from build_vcall_offset_vtbl_entries_r. */
9361 static void
9363 {
9364 /* Make entries for the rest of the virtuals. */
9365 tree orig_fn;
9367 /* The ABI requires that the methods be processed in declaration
9368 order. */
9370 orig_fn;
9374 }
9376 /* Add a vcall offset entry for ORIG_FN to the vtable. */
9378 static void
9380 {
9382 tree vcall_offset;
9383 tree derived_entry;
9385 /* If there is already an entry for a function with the same
9386 signature as FN, then we do not need a second vcall offset.
9387 Check the list of functions already present in the derived
9388 class vtable. */
9390 {
9392 /* We only use one vcall offset for virtual destructors,
9393 even though there are two virtual table entries. */
9397 }
9399 /* If we are building these vcall offsets as part of building
9400 the vtable for the most derived class, remember the vcall
9401 offset. */
9403 {
9406 }
9408 /* The next vcall offset will be found at a more negative
9409 offset. */
9413 /* Keep track of this function. */
9417 {
9418 tree base;
9419 tree fn;
9421 /* Find the overriding function. */
9425 else
9426 {
9429 /* The vbase we're working on is a primary base of
9430 vid->binfo. But it might be a lost primary, so its
9431 BINFO_OFFSET might be wrong, so we just use the
9432 BINFO_OFFSET from vid->binfo. */
9438 vcall_offset);
9439 }
9440 /* Add the initializer to the vtable. */
9442 }
9443 }
9445 /* Return vtbl initializers for the RTTI entries corresponding to the
9446 BINFO's vtable. The RTTI entries should indicate the object given
9447 by VID->rtti_binfo. */
9449 static void
9451 {
9452 tree b;
9453 tree t;
9454 tree offset;
9455 tree decl;
9456 tree init;
9460 /* To find the complete object, we will first convert to our most
9461 primary base, and then add the offset in the vtbl to that value. */
9465 {
9466 tree primary_base;
9472 }
9476 /* The second entry is the address of the typeinfo object. */
9479 else
9482 /* Convert the declaration to a type that can be stored in the
9483 vtable. */
9487 /* Add the offset-to-top entry. It comes earlier in the vtable than
9488 the typeinfo entry. Convert the offset to look like a
9489 function pointer, so that we can put it in the vtable. */
9492 }
9494 /* TRUE iff TYPE is uniquely derived from PARENT. Ignores
9495 accessibility. */
9497 bool
9499 {
9502 }
9504 /* TRUE iff TYPE is publicly & uniquely derived from PARENT. */
9506 bool
9508 {
9512 }
9514 /* CTX1 and CTX2 are declaration contexts. Return the innermost common
9515 class between them, if any. */
9517 tree
9519 {
9531 {
9534 }
9538 }