| blob | 64681ba44df824d442ba3411c36576bb4ad7d18b |
1 /* Functions related to building classes and their related objects.
2 Copyright (C) 1987-2013 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. */
40 /* The number of nested classes being processed. If we are not in the
41 scope of any class, this is zero. */
45 /* In order to deal with nested classes, we keep a stack of classes.
46 The topmost entry is the innermost class, and is the entry at index
47 CURRENT_CLASS_DEPTH */
50 /* The name of the class. */
51 tree name;
53 /* The _TYPE node for the class. */
54 tree type;
56 /* The access specifier pending for new declarations in the scope of
57 this class. */
58 tree access;
60 /* If were defining TYPE, the names used in this class. */
61 splay_tree names_used;
63 /* Nonzero if this class is no longer open, because of a call to
64 push_to_top_level. */
69 {
70 /* The base for which we're building initializers. */
71 tree binfo;
72 /* The type of the most-derived type. */
73 tree derived;
74 /* The binfo for the dynamic type. This will be TYPE_BINFO (derived),
75 unless ctor_vtbl_p is true. */
76 tree rtti_binfo;
77 /* The negative-index vtable initializers built up so far. These
78 are in order from least negative index to most negative index. */
80 /* The binfo for the virtual base for which we're building
81 vcall offset initializers. */
82 tree vbase;
83 /* The functions in vbase for which we have already provided vcall
84 offsets. */
86 /* The vtable index of the next vcall or vbase offset. */
87 tree index;
88 /* Nonzero if we are building the initializer for the primary
89 vtable. */
91 /* Nonzero if we are building the initializer for a construction
92 vtable. */
94 /* True when adding vcall offset entries to the vtable. False when
95 merely computing the indices. */
99 /* The type of a function passed to walk_subobject_offsets. */
102 /* The stack itself. This is a dynamically resized array. The
103 number of elements allocated is CURRENT_CLASS_STACK_SIZE. */
107 /* The size of the largest empty class seen in this translation unit. */
110 /* An array of all local classes present in this translation unit, in
111 declaration order. */
193 tree *);
203 splay_tree_key k2);
212 /* Variables shared between class.c and call.c. */
222 /* Convert to or from a base subobject. EXPR is an expression of type
223 `A' or `A*', an expression of type `B' or `B*' is returned. To
224 convert A to a base B, CODE is PLUS_EXPR and BINFO is the binfo for
225 the B base instance within A. To convert base A to derived B, CODE
226 is MINUS_EXPR and BINFO is the binfo for the A instance within B.
227 In this latter case, A must not be a morally virtual base of B.
228 NONNULL is true if EXPR is known to be non-NULL (this is only
229 needed when EXPR is of pointer type). CV qualifiers are preserved
230 from EXPR. */
232 tree
234 tree expr,
235 tree binfo,
237 tsubst_flags_t complain)
238 {
241 tree probe;
242 tree offset;
243 tree target_type;
245 tree ptr_target_type;
255 {
261 }
269 {
270 /* This can happen when adjust_result_of_qualified_name_lookup can't
271 find a unique base binfo in a call to a member function. We
272 couldn't give the diagnostic then since we might have been calling
273 a static member function, so we do it now. */
275 {
279 }
281 }
288 /* Nothing to do. */
292 {
294 {
296 {
299 "pointer to derived class %qT because the base is "
301 else
305 }
306 else
307 {
313 else
317 }
318 }
320 }
323 /* This must happen before the call to save_expr. */
325 else
331 /* TARGET_TYPE has been extracted from BINFO, and, is therefore always
332 cv-unqualified. Extract the cv-qualifiers from EXPR so that the
333 expression returned matches the input. */
334 target_type = cp_build_qualified_type
338 /* Do we need to look in the vtable for the real offset? */
341 /* Don't bother with the calculations inside sizeof; they'll ICE if the
342 source type is incomplete and the pointer value doesn't matter. In a
343 template (even in fold_non_dependent_expr), we don't have vtables set
344 up properly yet, and the value doesn't matter there either; we're just
345 interested in the result of overload resolution. */
348 {
353 }
355 /* If we're in an NSDMI, we don't have the full constructor context yet
356 that we need for converting to a virtual base, so just build a stub
357 CONVERT_EXPR and expand it later in bot_replace. */
360 {
366 }
368 /* Do we need to check for a null pointer? */
370 {
371 /* If we know the conversion will not actually change the value
372 of EXPR, then we can avoid testing the expression for NULL.
373 We have to avoid generating a COMPONENT_REF for a base class
374 field, because other parts of the compiler know that such
375 expressions are always non-NULL. */
379 }
381 /* Protect against multiple evaluation if necessary. */
385 /* Now that we've saved expr, build the real null test. */
387 {
391 }
393 /* If this is a simple base reference, express it as a COMPONENT_REF. */
395 /* We don't build base fields for empty bases, and they aren't very
396 interesting to the optimizers anyway. */
398 {
405 }
408 {
409 /* Going via virtual base V_BINFO. We need the static offset
410 from V_BINFO to BINFO, and the dynamic offset from D_BINFO to
411 V_BINFO. That offset is an entry in D_BINFO's vtable. */
412 tree v_offset;
415 {
416 /* In a base member initializer, we cannot rely on the
417 vtable being set up. We have to indirect via the
418 vtt_parm. */
419 tree t;
425 }
426 else
428 complain),
434 v_offset);
446 /* Negative fixed_type_p means this is a constructor or destructor;
447 virtual base layout is fixed in in-charge [cd]tors, but not in
448 base [cd]tors. */
452 v_offset,
455 else
457 }
465 {
470 }
471 else
477 out:
483 }
485 /* Subroutine of build_base_path; EXPR and BINFO are as in that function.
486 Perform a derived-to-base conversion by recursively building up a
487 sequence of COMPONENT_REFs to the appropriate base fields. */
489 static tree
491 {
494 tree field;
497 {
498 tree temp;
502 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x'
503 into `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only
504 an lvalue in the front end; only _DECLs and _REFs are lvalues
505 in the back end. */
511 }
513 /* Recurse. */
518 /* Is this the base field created by build_base_field? */
522 /* If we're looking for a field in the most-derived class,
523 also check the field offset; we can have two base fields
524 of the same type if one is an indirect virtual base and one
525 is a direct non-virtual base. */
529 {
530 /* We don't use build_class_member_access_expr here, as that
531 has unnecessary checks, and more importantly results in
532 recursive calls to dfs_walk_once. */
540 /* Mark the expression const or volatile, as appropriate.
541 Even though we've dealt with the type above, we still have
542 to mark the expression itself. */
549 }
551 /* Didn't find the base field?!? */
553 }
555 /* Convert OBJECT to the base TYPE. OBJECT is an expression whose
556 type is a class type or a pointer to a class type. In the former
557 case, TYPE is also a class type; in the latter it is another
558 pointer type. If CHECK_ACCESS is true, an error message is emitted
559 if TYPE is inaccessible. If OBJECT has pointer type, the value is
560 assumed to be non-NULL. */
562 tree
564 tsubst_flags_t complain)
565 {
566 tree binfo;
567 tree object_type;
570 {
573 }
574 else
583 }
585 /* EXPR is an expression with unqualified class type. BASE is a base
586 binfo of that class type. Returns EXPR, converted to the BASE
587 type. This function assumes that EXPR is the most derived class;
588 therefore virtual bases can be found at their static offsets. */
590 tree
592 {
593 tree expr_type;
597 {
598 /* If this is a non-empty base, use a COMPONENT_REF. */
602 /* We use fold_build2 and fold_convert below to simplify the trees
603 provided to the optimizers. It is not safe to call these functions
604 when processing a template because they do not handle C++-specific
605 trees. */
613 }
616 }
618 \f
619 tree
621 {
627 /* First, convert to the requested type. */
632 /* Second, the requested type may not be the owner of its own vptr.
633 If not, convert to the base class that owns it. We cannot use
634 convert_to_base here, because VCONTEXT may appear more than once
635 in the inheritance hierarchy of TYPE, and thus direct conversion
636 between the types may be ambiguous. Following the path back up
637 one step at a time via primary bases avoids the problem. */
641 {
644 }
647 }
649 /* Given an object INSTANCE, return an expression which yields the
650 vtable element corresponding to INDEX. There are many special
651 cases for INSTANCE which we take care of here, mainly to avoid
652 creating extra tree nodes when we don't have to. */
654 static tree
656 {
657 tree aref;
660 /* Try to figure out what a reference refers to, and
661 access its virtual function table directly. */
669 {
674 }
683 }
685 tree
687 {
691 }
693 /* Given a stable object pointer INSTANCE_PTR, return an expression which
694 yields a function pointer corresponding to vtable element INDEX. */
696 tree
698 {
699 tree aref;
702 tf_warning_or_error),
703 idx);
705 /* When using function descriptors, the address of the
706 vtable entry is treated as a function pointer. */
711 /* Remember this as a method reference, for later devirtualization. */
715 }
717 /* Return the name of the virtual function table (as an IDENTIFIER_NODE)
718 for the given TYPE. */
720 static tree
722 {
724 }
726 /* DECL is an entity associated with TYPE, like a virtual table or an
727 implicitly generated constructor. Determine whether or not DECL
728 should have external or internal linkage at the object file
729 level. This routine does not deal with COMDAT linkage and other
730 similar complexities; it simply sets TREE_PUBLIC if it possible for
731 entities in other translation units to contain copies of DECL, in
732 the abstract. */
734 void
736 {
739 }
741 /* Create a VAR_DECL for a primary or secondary vtable for CLASS_TYPE.
742 (For a secondary vtable for B-in-D, CLASS_TYPE should be D, not B.)
743 Use NAME for the name of the vtable, and VTABLE_TYPE for its type. */
745 static tree
747 {
748 tree decl;
751 /* vtable names are already mangled; give them their DECL_ASSEMBLER_NAME
752 now to avoid confusion in mangle_decl. */
761 /* At one time the vtable info was grabbed 2 words at a time. This
762 fails on sparc unless you have 8-byte alignment. (tiemann) */
766 /* The vtable has not been defined -- yet. */
770 /* Mark the VAR_DECL node representing the vtable itself as a
771 "gratuitous" one, thereby forcing dwarfout.c to ignore it. It
772 is rather important that such things be ignored because any
773 effort to actually generate DWARF for them will run into
774 trouble when/if we encounter code like:
776 #pragma interface
777 struct S { virtual void member (); };
779 because the artificial declaration of the vtable itself (as
780 manufactured by the g++ front end) will say that the vtable is
781 a static member of `S' but only *after* the debug output for
782 the definition of `S' has already been output. This causes
783 grief because the DWARF entry for the definition of the vtable
784 will try to refer back to an earlier *declaration* of the
785 vtable as a static member of `S' and there won't be one. We
786 might be able to arrange to have the "vtable static member"
787 attached to the member list for `S' before the debug info for
788 `S' get written (which would solve the problem) but that would
789 require more intrusive changes to the g++ front end. */
793 }
795 /* Get the VAR_DECL of the vtable for TYPE. TYPE need not be polymorphic,
796 or even complete. If this does not exist, create it. If COMPLETE is
797 nonzero, then complete the definition of it -- that will render it
798 impossible to actually build the vtable, but is useful to get at those
799 which are known to exist in the runtime. */
801 tree
803 {
804 tree decl;
813 {
816 }
819 }
821 /* Build the primary virtual function table for TYPE. If BINFO is
822 non-NULL, build the vtable starting with the initial approximation
823 that it is the same as the one which is the head of the association
824 list. Returns a nonzero value if a new vtable is actually
825 created. */
827 static int
829 {
830 tree decl;
831 tree virtuals;
836 {
838 /* We have already created a vtable for this base, so there's
839 no need to do it again. */
846 }
847 else
848 {
851 }
854 {
857 }
859 /* Initialize the association list for this type, based
860 on our first approximation. */
865 }
867 /* Give BINFO a new virtual function table which is initialized
868 with a skeleton-copy of its original initialization. The only
869 entry that changes is the `delta' entry, so we can really
870 share a lot of structure.
872 FOR_TYPE is the most derived type which caused this table to
873 be needed.
875 Returns nonzero if we haven't met BINFO before.
877 The order in which vtables are built (by calling this function) for
878 an object must remain the same, otherwise a binary incompatibility
879 can result. */
881 static int
883 {
885 /* We already created a vtable for this base. There's no need to
886 do it again. */
889 /* Remember that we've created a vtable for this BINFO, so that we
890 don't try to do so again. */
893 /* Make fresh virtual list, so we can smash it later. */
896 /* Secondary vtables are laid out as part of the same structure as
897 the primary vtable. */
900 }
902 /* Create a new vtable for BINFO which is the hierarchy dominated by
903 T. Return nonzero if we actually created a new vtable. */
905 static int
907 {
909 /* In this case, it is *type*'s vtable we are modifying. We start
910 with the approximation that its vtable is that of the
911 immediate base class. */
913 else
914 /* This is our very own copy of `basetype' to play with. Later,
915 we will fill in all the virtual functions that override the
916 virtual functions in these base classes which are not defined
917 by the current type. */
919 }
921 /* Make *VIRTUALS, an entry on the BINFO_VIRTUALS list for BINFO
922 (which is in the hierarchy dominated by T) list FNDECL as its
923 BV_FN. DELTA is the required constant adjustment from the `this'
924 pointer where the vtable entry appears to the `this' required when
925 the function is actually called. */
927 static void
929 tree binfo,
930 tree fndecl,
931 tree delta,
933 {
934 tree v;
940 {
941 /* We need a new vtable for BINFO. */
943 {
944 /* If we really did make a new vtable, we also made a copy
945 of the BINFO_VIRTUALS list. Now, we have to find the
946 corresponding entry in that list. */
951 }
956 }
957 }
959 \f
960 /* Add method METHOD to class TYPE. If USING_DECL is non-null, it is
961 the USING_DECL naming METHOD. Returns true if the method could be
962 added to the method vec. */
964 bool
966 {
968 tree overload;
974 tree current_fns;
975 tree fns;
988 {
989 /* Make a new method vector. We start with 8 entries. We must
990 allocate at least two (for constructors and destructors), and
991 we're going to end up with an assignment operator at some
992 point as well. */
994 /* Create slots for constructors and destructors. */
998 }
1000 /* Maintain TYPE_HAS_USER_CONSTRUCTOR, etc. */
1003 /* Constructors and destructors go in special slots. */
1007 {
1011 {
1017 type);
1018 }
1019 }
1020 else
1021 {
1022 tree m;
1025 /* See if we already have an entry with this name. */
1029 {
1032 {
1037 }
1041 {
1044 }
1049 }
1050 }
1053 /* Check to see if we've already got this method. */
1055 {
1057 tree fn_type;
1058 tree method_type;
1059 tree parms1;
1060 tree parms2;
1065 /* [over.load] Member function declarations with the
1066 same name and the same parameter types cannot be
1067 overloaded if any of them is a static member
1068 function declaration.
1070 [over.load] Member function declarations with the same name and
1071 the same parameter-type-list as well as member function template
1072 declarations with the same name, the same parameter-type-list, and
1073 the same template parameter lists cannot be overloaded if any of
1074 them, but not all, have a ref-qualifier.
1076 [namespace.udecl] When a using-declaration brings names
1077 from a base class into a derived class scope, member
1078 functions in the derived class override and/or hide member
1079 functions with the same name and parameter types in a base
1080 class (rather than conflicting). */
1086 /* Compare the quals on the 'this' parm. Don't compare
1087 the whole types, as used functions are treated as
1088 coming from the using class in overload resolution. */
1091 /* Either both or neither need to be ref-qualified for
1092 differing quals to allow overloading. */
1099 /* For templates, the return type and template parameters
1100 must be identical. */
1117 {
1118 /* For function versions, their parms and types match
1119 but they are not duplicates. Record function versions
1120 as and when they are found. extern "C" functions are
1121 not treated as versions. */
1127 {
1128 /* Mark functions as versions if necessary. Modify the mangled
1129 decl name if necessary. */
1131 {
1135 }
1137 {
1141 }
1144 }
1146 {
1148 {
1155 }
1156 /* Otherwise defer to the other function. */
1158 }
1160 {
1162 /* Defer to the local function. */
1164 }
1165 else
1166 {
1169 }
1171 /* We don't call duplicate_decls here to merge the
1172 declarations because that will confuse things if the
1173 methods have inline definitions. In particular, we
1174 will crash while processing the definitions. */
1176 }
1177 }
1179 /* A class should never have more than one destructor. */
1183 /* Add the new binding. */
1185 {
1188 }
1189 else
1198 {
1201 /* We only expect to add few methods in the COMPLETE_P case, so
1202 just make room for one more method in that case. */
1205 else
1211 else
1213 }
1214 else
1215 /* Replace the current slot. */
1218 }
1220 /* Subroutines of finish_struct. */
1222 /* Change the access of FDECL to ACCESS in T. Return 1 if change was
1223 legit, otherwise return 0. */
1225 static int
1227 {
1228 tree elem;
1237 {
1239 {
1243 else
1246 }
1247 else
1248 {
1249 /* They're changing the access to the same thing they changed
1250 it to before. That's OK. */
1251 ;
1252 }
1253 }
1254 else
1255 {
1257 tf_warning_or_error);
1260 }
1262 }
1264 /* Process the USING_DECL, which is a member of T. */
1266 static void
1268 {
1271 tree access
1276 tree old_value;
1281 tf_warning_or_error);
1283 {
1289 else
1291 }
1299 ;
1301 {
1303 /* It's OK to use functions from a base when there are functions with
1305 else
1306 {
1311 }
1312 }
1314 {
1318 }
1320 /* Make type T see field decl FDECL with access ACCESS. */
1323 {
1326 }
1327 else
1329 }
1330 \f
1331 /* walk_tree callback for check_abi_tags: if the type at *TP involves any
1332 types with abi tags, add the corresponding identifiers to the VEC in
1333 *DATA and set IDENTIFIER_MARKED. */
1335 struct abi_tag_data
1336 {
1337 tree t;
1338 tree subob;
1339 };
1341 static tree
1343 {
1348 {
1352 {
1356 {
1358 {
1363 }
1364 else
1365 {
1372 }
1373 }
1374 }
1375 }
1377 }
1379 /* Set IDENTIFIER_MARKED on all the ABI tags on T and its (transitively
1380 complete) template arguments. */
1382 static void
1384 {
1387 {
1390 {
1394 }
1395 }
1397 /* Also mark ABI tags from template arguments. */
1399 {
1402 {
1405 {
1409 }
1410 }
1411 }
1412 }
1414 /* Check that class T has all the abi tags that subobject SUBOB has, or
1415 warn if not. */
1417 static void
1419 {
1428 }
1430 /* Run through the base classes of T, updating CANT_HAVE_CONST_CTOR_P,
1431 and NO_CONST_ASN_REF_P. Also set flag bits in T based on
1432 properties of the bases. */
1434 static void
1438 {
1442 tree base_binfo;
1443 tree binfo;
1453 {
1462 /* If any base class is non-literal, so is the derived class. */
1466 /* Effective C++ rule 14. We only need to check TYPE_POLYMORPHIC_P
1467 here because the case of virtual functions but non-virtual
1468 dtor is handled in finish_struct_1. */
1473 /* If the base class doesn't have copy constructors or
1474 assignment operators that take const references, then the
1475 derived class cannot have such a member automatically
1476 generated. */
1485 /* A virtual base does not effect nearly emptiness. */
1486 ;
1488 {
1490 /* And if there is more than one nearly empty base, then the
1491 derived class is not nearly empty either. */
1493 else
1494 /* Remember we've seen one. */
1496 }
1498 /* If the base class is not empty or nearly empty, then this
1499 class cannot be nearly empty. */
1502 /* A lot of properties from the bases also apply to the derived
1503 class. */
1520 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT
1523 SET_CLASSTYPE_REF_FIELDS_NEED_INIT
1527 /* A standard-layout class is a class that:
1528 ...
1529 * has no non-standard-layout base classes, */
1532 {
1533 tree basefield;
1534 /* ...has no base classes of the same type as the first non-static
1535 data member... */
1537 && (same_type_ignoring_top_level_qualifiers_p
1540 else
1541 /* ...either has no non-static data members in the most-derived
1542 class and at most one base class with non-static data
1543 members, or has no base classes with non-static data
1544 members */
1548 {
1551 else
1554 }
1555 }
1557 /* Don't bother collecting tm attributes if transactional memory
1558 support is not enabled. */
1560 {
1564 }
1567 }
1569 /* If one of the base classes had TM attributes, and the current class
1570 doesn't define its own, then the current class inherits one. */
1572 {
1575 }
1576 }
1578 /* Determine all the primary bases within T. Sets BINFO_PRIMARY_BASE_P for
1579 those that are primaries. Sets BINFO_LOST_PRIMARY_P for those
1580 that have had a nearly-empty virtual primary base stolen by some
1581 other base in the hierarchy. Determines CLASSTYPE_PRIMARY_BASE for
1582 T. */
1584 static void
1586 {
1590 tree base_binfo;
1592 /* Determine the primary bases of our bases. */
1595 {
1598 /* See if we're the non-virtual primary of our inheritance
1599 chain. */
1601 {
1608 /* We are the primary binfo. */
1610 }
1611 /* Determine if we have a virtual primary base, and mark it so.
1612 */
1614 {
1618 /* Someone already claimed this base. */
1620 else
1621 {
1622 tree delta;
1627 /* A virtual binfo might have been copied from within
1628 another hierarchy. As we're about to use it as a
1629 primary base, make sure the offsets match. */
1637 }
1638 }
1639 }
1641 /* First look for a dynamic direct non-virtual base. */
1643 {
1647 {
1650 }
1651 }
1653 /* A "nearly-empty" virtual base class can be the primary base
1654 class, if no non-virtual polymorphic base can be found. Look for
1655 a nearly-empty virtual dynamic base that is not already a primary
1656 base of something in the hierarchy. If there is no such base,
1657 just pick the first nearly-empty virtual base. */
1663 {
1665 {
1666 /* Found one that is not primary. */
1669 }
1671 /* Remember the first candidate. */
1673 }
1675 found:
1676 /* If we've got a primary base, use it. */
1678 {
1683 /* We are stealing a primary base. */
1687 {
1688 tree delta;
1691 /* A virtual binfo might have been copied from within
1692 another hierarchy. As we're about to use it as a primary
1693 base, make sure the offsets match. */
1698 }
1705 }
1706 }
1708 /* Update the variant types of T. */
1710 void
1712 {
1713 tree variants;
1719 variants;
1721 {
1722 /* These fields are in the _TYPE part of the node, not in
1723 the TYPE_LANG_SPECIFIC component, so they are not shared. */
1733 /* Copy whatever these are holding today. */
1737 }
1738 }
1740 /* Early variant fixups: we apply attributes at the beginning of the class
1741 definition, and we need to fix up any variants that have already been
1742 made via elaborated-type-specifier so that check_qualified_type works. */
1744 void
1746 {
1747 tree variants;
1753 variants;
1755 {
1756 /* These are the two fields that check_qualified_type looks at and
1757 are affected by attributes. */
1760 }
1761 }
1762 \f
1763 /* Set memoizing fields and bits of T (and its variants) for later
1764 use. */
1766 static void
1768 {
1769 /* Fix up variants (if any). */
1773 /* For a class w/o baseclasses, 'finish_struct' has set
1774 CLASSTYPE_PURE_VIRTUALS correctly (by definition).
1775 Similarly for a class whose base classes do not have vtables.
1776 When neither of these is true, we might have removed abstract
1777 virtuals (by providing a definition), added some (by declaring
1778 new ones), or redeclared ones from a base class. We need to
1779 recalculate what's really an abstract virtual at this point (by
1780 looking in the vtables). */
1783 /* If this type has a copy constructor or a destructor, force its
1784 mode to be BLKmode, and force its TREE_ADDRESSABLE bit to be
1785 nonzero. This will cause it to be passed by invisible reference
1786 and prevent it from being returned in a register. */
1789 {
1790 tree variants;
1793 {
1796 }
1797 }
1798 }
1800 /* Issue warnings about T having private constructors, but no friends,
1801 and so forth.
1803 HAS_NONPRIVATE_METHOD is nonzero if T has any non-private methods or
1804 static members. HAS_NONPRIVATE_STATIC_FN is nonzero if T has any
1805 non-private static member functions. */
1807 static void
1809 {
1812 tree fn;
1815 /* If the class has friends, those entities might create and
1816 access instances, so we should not warn. */
1819 /* We will have warned when the template was declared; there's
1820 no need to warn on every instantiation. */
1822 /* There's no reason to even consider warning about this
1823 class. */
1826 /* We only issue one warning, if more than one applies, because
1827 otherwise, on code like:
1829 class A {
1830 // Oops - forgot `public:'
1831 A();
1832 A(const A&);
1833 ~A();
1834 };
1836 we warn several times about essentially the same problem. */
1838 /* Check to see if all (non-constructor, non-destructor) member
1839 functions are private. (Since there are no friends or
1840 non-private statics, we can't ever call any of the private member
1841 functions.) */
1843 /* We're not interested in compiler-generated methods; they don't
1844 provide any way to call private members. */
1846 {
1848 {
1850 /* A non-private static member function is just like a
1851 friend; it can create and invoke private member
1852 functions, and be accessed without a class
1853 instance. */
1857 /* Keep searching for a static member function. */
1858 }
1861 }
1864 {
1865 /* There are no non-private methods, and there's at least one
1866 private member function that isn't a constructor or
1867 destructor. (If all the private members are
1868 constructors/destructors we want to use the code below that
1869 issues error messages specifically referring to
1870 constructors/destructors.) */
1876 {
1879 }
1881 {
1885 }
1886 }
1888 /* Even if some of the member functions are non-private, the class
1889 won't be useful for much if all the constructors or destructors
1890 are private: such an object can never be created or destroyed. */
1893 {
1896 t);
1898 }
1900 /* Warn about classes that have private constructors and no friends. */
1902 /* Implicitly generated constructors are always public. */
1905 {
1908 /* If a non-template class does not define a copy
1909 constructor, one is defined for it, enabling it to avoid
1910 this warning. For a template class, this does not
1911 happen, and so we would normally get a warning on:
1913 template <class T> class C { private: C(); };
1915 To avoid this asymmetry, we check TYPE_HAS_COPY_CTOR. All
1916 complete non-template or fully instantiated classes have this
1917 flag set. */
1920 else
1922 {
1924 /* Ideally, we wouldn't count copy constructors (or, in
1925 fact, any constructor that takes an argument of the
1926 class type as a parameter) because such things cannot
1927 be used to construct an instance of the class unless
1928 you already have one. But, for now at least, we're
1929 more generous. */
1931 {
1934 }
1935 }
1938 {
1941 t);
1943 }
1944 }
1945 }
1948 gt_pointer_operator new_value;
1952 /* Comparison function to compare two TYPE_METHOD_VEC entries by name. */
1954 static int
1956 {
1969 }
1971 /* This routine compares two fields like method_name_cmp but using the
1972 pointer operator in resort_field_decl_data. */
1974 static int
1976 {
1985 {
1992 }
1994 }
1996 /* Resort TYPE_METHOD_VEC because pointers have been reordered. */
1998 void
2001 gt_pointer_operator new_value,
2003 {
2007 tree fn;
2009 /* The type conversion ops have to live at the front of the vec, so we
2010 can't sort them. */
2018 {
2022 resort_method_name_cmp);
2023 }
2024 }
2026 /* Warn about duplicate methods in fn_fields.
2028 Sort methods that are not special (i.e., constructors, destructors,
2029 and type conversion operators) so that we can find them faster in
2030 search. */
2032 static void
2034 {
2035 tree fn_fields;
2045 /* Clear DECL_IN_AGGR_P for all functions. */
2050 /* Issue warnings about private constructors and such. If there are
2051 no methods, then some public defaults are generated. */
2054 /* The type conversion ops have to live at the front of the vec, so we
2055 can't sort them. */
2064 }
2066 /* Make BINFO's vtable have N entries, including RTTI entries,
2067 vbase and vcall offsets, etc. Set its type and call the back end
2068 to lay it out. */
2070 static void
2072 {
2073 tree atype;
2074 tree vtable;
2079 /* We may have to grow the vtable. */
2082 {
2086 }
2087 }
2089 /* True iff FNDECL and BASE_FNDECL (both non-static member functions)
2090 have the same signature. */
2092 int
2094 {
2095 /* One destructor overrides another if they are the same kind of
2096 destructor. */
2100 /* But a non-destructor never overrides a destructor, nor vice
2101 versa, nor do different kinds of destructors override
2102 one-another. For example, a complete object destructor does not
2103 override a deleting destructor. */
2112 {
2120 }
2122 }
2124 /* Returns TRUE if DERIVED is a binfo containing the binfo BASE as a
2125 subobject. */
2127 static bool
2129 {
2130 tree probe;
2133 {
2137 /* If we meet a virtual base, we can't follow the inheritance
2138 any more. See if the complete type of DERIVED contains
2139 such a virtual base. */
2142 }
2144 }
2147 /* The function for which we are trying to find a final overrider. */
2148 tree fn;
2149 /* The base class in which the function was declared. */
2150 tree declaring_base;
2151 /* The candidate overriders. */
2152 tree candidates;
2153 /* Path to most derived. */
2157 /* Add the overrider along the current path to FFOD->CANDIDATES.
2158 Returns true if an overrider was found; false otherwise. */
2160 static bool
2164 {
2165 tree method;
2167 /* If BINFO is not the most derived type, try a more derived class.
2168 A definition there will overrider a definition here. */
2170 {
2171 depth--;
2175 }
2179 {
2182 /* Remove any candidates overridden by this new function. */
2184 {
2185 /* If *CANDIDATE overrides METHOD, then METHOD
2186 cannot override anything else on the list. */
2189 /* If METHOD overrides *CANDIDATE, remove *CANDIDATE. */
2192 else
2194 }
2196 /* Add the new function. */
2199 }
2202 }
2204 /* Called from find_final_overrider via dfs_walk. */
2206 static tree
2208 {
2216 }
2218 static tree
2220 {
2225 }
2227 /* Returns a TREE_LIST whose TREE_PURPOSE is the final overrider for
2228 FN and whose TREE_VALUE is the binfo for the base where the
2229 overriding occurs. BINFO (in the hierarchy dominated by the binfo
2230 DERIVED) is the base object in which FN is declared. */
2232 static tree
2234 {
2235 find_final_overrider_data ffod;
2237 /* Getting this right is a little tricky. This is valid:
2239 struct S { virtual void f (); };
2240 struct T { virtual void f (); };
2241 struct U : public S, public T { };
2243 even though calling `f' in `U' is ambiguous. But,
2245 struct R { virtual void f(); };
2246 struct S : virtual public R { virtual void f (); };
2247 struct T : virtual public R { virtual void f (); };
2248 struct U : public S, public T { };
2250 is not -- there's no way to decide whether to put `S::f' or
2251 `T::f' in the vtable for `R'.
2253 The solution is to look at all paths to BINFO. If we find
2254 different overriders along any two, then there is a problem. */
2258 /* Determine the depth of the hierarchy. */
2269 /* If there was no winner, issue an error message. */
2274 }
2276 /* Return the index of the vcall offset for FN when TYPE is used as a
2277 virtual base. */
2279 static tree
2281 {
2283 tree_pair_p p;
2291 /* There should always be an appropriate index. */
2293 }
2295 /* Update an entry in the vtable for BINFO, which is in the hierarchy
2296 dominated by T. FN is the old function; VIRTUALS points to the
2297 corresponding position in the new BINFO_VIRTUALS list. IX is the index
2298 of that entry in the list. */
2300 static void
2303 {
2304 tree b;
2305 tree overrider;
2306 tree delta;
2307 tree virtual_base;
2308 tree first_defn;
2314 /* Find the nearest primary base (possibly binfo itself) which defines
2315 this function; this is the class the caller will convert to when
2316 calling FN through BINFO. */
2318 {
2323 /* The nearest definition is from a lost primary. */
2326 }
2329 /* Find the final overrider. */
2332 {
2335 }
2338 /* Check for adjusting covariant return types. */
2346 /* If the overrider is invalid, don't even try. */
2348 {
2349 /* If FN is a covariant thunk, we must figure out the adjustment
2350 to the final base FN was converting to. As OVERRIDER_TARGET might
2351 also be converting to the return type of FN, we have to
2352 combine the two conversions here. */
2359 {
2363 }
2364 else
2368 /* Find the equivalent binfo within the return type of the
2369 overriding function. We will want the vbase offset from
2370 there. */
2372 over_return);
2375 {
2376 /* There was no existing virtual thunk (which takes
2377 precedence). So find the binfo of the base function's
2378 return type within the overriding function's return type.
2379 We cannot call lookup base here, because we're inside a
2380 dfs_walk, and will therefore clobber the BINFO_MARKED
2381 flags. Fortunately we know the covariancy is valid (it
2382 has already been checked), so we can just iterate along
2383 the binfos, which have been chained in inheritance graph
2384 order. Of course it is lame that we have to repeat the
2385 search here anyway -- we should really be caching pieces
2386 of the vtable and avoiding this repeated work. */
2389 /* Find the base binfo within the overriding function's
2390 return type. We will always find a thunk_binfo, except
2391 when the covariancy is invalid (which we will have
2392 already diagnosed). */
2395 thunk_binfo;
2401 /* See if virtual inheritance is involved. */
2403 virtual_offset;
2410 {
2414 {
2415 /* We convert via virtual base. Adjust the fixed
2416 offset to be from there. */
2417 offset =
2421 }
2423 /* There was an existing fixed offset, this must be
2424 from the base just converted to, and the base the
2425 FN was thunking to. */
2427 else
2429 }
2430 }
2433 /* Replace the overriding function with a covariant thunk. We
2434 will emit the overriding function in its own slot as
2435 well. */
2438 }
2439 else
2443 /* If we need a covariant thunk, then we may need to adjust first_defn.
2444 The ABI specifies that the thunks emitted with a function are
2445 determined by which bases the function overrides, so we need to be
2446 sure that we're using a thunk for some overridden base; even if we
2447 know that the necessary this adjustment is zero, there may not be an
2448 appropriate zero-this-adjusment thunk for us to use since thunks for
2449 overriding virtual bases always use the vcall offset.
2451 Furthermore, just choosing any base that overrides this function isn't
2452 quite right, as this slot won't be used for calls through a type that
2453 puts a covariant thunk here. Calling the function through such a type
2454 will use a different slot, and that slot is the one that determines
2455 the thunk emitted for that base.
2457 So, keep looking until we find the base that we're really overriding
2458 in this slot: the nearest primary base that doesn't use a covariant
2459 thunk in this slot. */
2461 {
2463 /* We already know that the overrider needs a covariant thunk. */
2466 {
2473 }
2475 }
2477 /* Assume that we will produce a thunk that convert all the way to
2478 the final overrider, and not to an intermediate virtual base. */
2481 /* See if we can convert to an intermediate virtual base first, and then
2482 use the vcall offset located there to finish the conversion. */
2484 {
2485 /* If we find the final overrider, then we can stop
2486 walking. */
2491 /* If we find a virtual base, and we haven't yet found the
2492 overrider, then there is a virtual base between the
2493 declaring base (first_defn) and the final overrider. */
2495 {
2498 }
2499 }
2501 /* Compute the constant adjustment to the `this' pointer. The
2502 `this' pointer, when this function is called, will point at BINFO
2503 (or one of its primary bases, which are at the same offset). */
2505 /* The `this' pointer needs to be adjusted from the declaration to
2506 the nearest virtual base. */
2511 /* If the nearest definition is in a lost primary, we don't need an
2512 entry in our vtable. Except possibly in a constructor vtable,
2513 if we happen to get our primary back. In that case, the offset
2514 will be zero, as it will be a primary base. */
2516 else
2517 /* The `this' pointer needs to be adjusted from pointing to
2518 BINFO to pointing at the base where the final overrider
2519 appears. */
2530 else
2534 }
2536 /* Called from modify_all_vtables via dfs_walk. */
2538 static tree
2540 {
2542 tree virtuals;
2543 tree old_virtuals;
2547 /* A base without a vtable needs no modification, and its bases
2548 are uninteresting. */
2553 /* Don't do the primary vtable, if it's new. */
2557 /* There's no need to modify the vtable for a non-virtual primary
2558 base; we're not going to use that vtable anyhow. We do still
2559 need to do this for virtual primary bases, as they could become
2560 non-primary in a construction vtable. */
2565 /* Now, go through each of the virtual functions in the virtual
2566 function table for BINFO. Find the final overrider, and update
2567 the BINFO_VIRTUALS list appropriately. */
2570 virtuals;
2574 binfo,
2579 }
2581 /* Update all of the primary and secondary vtables for T. Create new
2582 vtables as required, and initialize their RTTI information. Each
2583 of the functions in VIRTUALS is declared in T and may override a
2584 virtual function from a base class; find and modify the appropriate
2585 entries to point to the overriding functions. Returns a list, in
2586 declaration order, of the virtual functions that are declared in T,
2587 but do not appear in the primary base class vtable, and which
2588 should therefore be appended to the end of the vtable for T. */
2590 static tree
2592 {
2596 /* Mangle the vtable name before entering dfs_walk (c++/51884). */
2600 /* Update all of the vtables. */
2603 /* Add virtual functions not already in our primary vtable. These
2604 will be both those introduced by this class, and those overridden
2605 from secondary bases. It does not include virtuals merely
2606 inherited from secondary bases. */
2608 {
2613 {
2614 /* We don't need to adjust the `this' pointer when
2615 calling this function. */
2619 /* This is a function not already in our vtable. Keep it. */
2621 }
2622 else
2623 /* We've already got an entry for this function. Skip it. */
2625 }
2628 }
2630 /* Get the base virtual function declarations in T that have the
2631 indicated NAME. */
2633 static tree
2635 {
2636 tree methods;
2641 /* Find virtual functions in T with the indicated NAME. */
2645 methods;
2647 {
2653 }
2659 {
2662 base_fndecls);
2663 }
2666 }
2668 /* If this declaration supersedes the declaration of
2669 a method declared virtual in the base class, then
2670 mark this field as being virtual as well. */
2672 void
2674 {
2677 /* In [temp.mem] we have:
2679 A specialization of a member function template does not
2680 override a virtual function from a base class. */
2687 /* Set DECL_VINDEX to a value that is neither an INTEGER_CST nor
2688 the error_mark_node so that we know it is an overriding
2689 function. */
2690 {
2693 }
2696 {
2702 }
2707 }
2709 /* Warn about hidden virtual functions that are not overridden in t.
2710 We know that constructors and destructors don't apply. */
2712 static void
2714 {
2716 tree fns;
2719 /* We go through each separately named virtual function. */
2723 {
2724 tree fn;
2725 tree name;
2726 tree fndecl;
2727 tree base_fndecls;
2728 tree base_binfo;
2729 tree binfo;
2732 /* All functions in this slot in the CLASSTYPE_METHOD_VEC will
2733 have the same name. Figure out what name that is. */
2735 /* There are no possibly hidden functions yet. */
2737 /* Iterate through all of the base classes looking for possibly
2738 hidden functions. */
2741 {
2744 base_fndecls);
2745 }
2747 /* If there are no functions to hide, continue. */
2751 /* Remove any overridden functions. */
2753 {
2756 {
2760 /* If the method from the base class has the same
2761 signature as the method from the derived class, it
2762 has been overridden. */
2765 else
2767 }
2768 }
2770 /* Now give a warning for all base functions without overriders,
2771 as they are hidden. */
2773 {
2774 /* Here we know it is a hider, and no overrider exists. */
2778 }
2779 }
2780 }
2782 /* Recursive helper for finish_struct_anon. */
2784 static void
2786 {
2790 {
2791 /* We're generally only interested in entities the user
2792 declared, but we also find nested classes by noticing
2793 the TYPE_DECL that we create implicitly. You're
2794 allowed to put one anonymous union inside another,
2795 though, so we explicitly tolerate that. We use
2796 TYPE_ANONYMOUS_P rather than ANON_AGGR_TYPE_P so that
2797 we also allow unnamed types used for defining fields. */
2804 {
2806 {
2809 "%q+#D invalid; an anonymous union can "
2811 else
2813 "%q+#D invalid; an anonymous struct can "
2815 }
2817 }
2820 {
2822 {
2826 else
2829 }
2831 {
2835 else
2838 }
2839 }
2844 /* Recurse into the anonymous aggregates to handle correctly
2845 access control (c++/24926):
2847 class A {
2848 union {
2849 union {
2850 int i;
2851 };
2852 };
2853 };
2855 int j=A().i; */
2859 }
2860 }
2862 /* Check for things that are invalid. There are probably plenty of other
2863 things we should check for also. */
2865 static void
2867 {
2869 {
2878 }
2879 }
2881 /* Add T to CLASSTYPE_DECL_LIST of current_class_type which
2882 will be used later during class template instantiation.
2883 When FRIEND_P is zero, T can be a static member data (VAR_DECL),
2884 a non-static member data (FIELD_DECL), a member function
2885 (FUNCTION_DECL), a nested type (RECORD_TYPE, ENUM_TYPE),
2886 a typedef (TYPE_DECL) or a member class template (TEMPLATE_DECL)
2887 When FRIEND_P is nonzero, T is either a friend class
2888 (RECORD_TYPE, TEMPLATE_DECL) or a friend function
2889 (FUNCTION_DECL, TEMPLATE_DECL). */
2891 void
2893 {
2894 /* Save some memory by not creating TREE_LIST if TYPE is not template. */
2899 }
2901 /* This function is called from declare_virt_assop_and_dtor via
2902 dfs_walk_all.
2904 DATA is a type that direcly or indirectly inherits the base
2905 represented by BINFO. If BINFO contains a virtual assignment [copy
2906 assignment or move assigment] operator or a virtual constructor,
2907 declare that function in DATA if it hasn't been already declared. */
2909 static tree
2911 {
2919 /* A base without a vtable needs no modification, and its bases
2920 are uninteresting. */
2924 /* If this is a primary base, then we have already looked at the
2925 virtual functions of its vtable. */
2929 {
2933 {
2938 }
2942 }
2945 }
2947 /* If the class type T has a direct or indirect base that contains a
2948 virtual assignment operator or a virtual destructor, declare that
2949 function in T if it hasn't been already declared. */
2951 static void
2953 {
2961 dfs_declare_virt_assop_and_dtor,
2963 }
2965 /* Declare the inheriting constructor for class T inherited from base
2966 constructor CTOR with the parameter array PARMS of size NPARMS. */
2968 static void
2970 {
2971 /* We don't declare an inheriting ctor that would be a default,
2972 copy or move ctor for derived or base. */
2977 {
2981 }
2989 {
2992 }
2993 }
2995 /* Declare all the inheriting constructors for class T inherited from base
2996 constructor CTOR. */
2998 static void
3000 {
3006 {
3010 }
3013 {
3017 }
3018 }
3020 /* Create default constructors, assignment operators, and so forth for
3021 the type indicated by T, if they are needed. CANT_HAVE_CONST_CTOR,
3022 and CANT_HAVE_CONST_ASSIGNMENT are nonzero if, for whatever reason,
3023 the class cannot have a default constructor, copy constructor
3024 taking a const reference argument, or an assignment operator taking
3025 a const reference, respectively. */
3027 static void
3031 {
3039 /* Destructor. */
3041 {
3042 /* In general, we create destructors lazily. */
3047 /* But if this is a Java class, any non-trivial destructor is
3048 invalid, even if compiler-generated. Therefore, if the
3049 destructor is non-trivial we create it now. */
3051 }
3053 /* [class.ctor]
3055 If there is no user-declared constructor for a class, a default
3056 constructor is implicitly declared. */
3058 {
3063 /* This might force the declaration. */
3065 }
3067 /* [class.ctor]
3069 If a class definition does not explicitly declare a copy
3070 constructor, one is declared implicitly. */
3072 {
3078 }
3080 /* If there is no assignment operator, one will be created if and
3081 when it is needed. For now, just record whether or not the type
3082 of the parameter to the assignment operator will be a const or
3083 non-const reference. */
3085 {
3091 }
3093 /* We can't be lazy about declaring functions that might override
3094 a virtual function from a base class. */
3098 {
3102 {
3103 /* declare, then remove the decl */
3112 }
3113 else
3115 }
3116 }
3118 /* Subroutine of insert_into_classtype_sorted_fields. Recursively
3119 count the number of fields in TYPE, including anonymous union
3120 members. */
3122 static int
3124 {
3125 tree x;
3128 {
3131 else
3133 }
3135 }
3137 /* Subroutine of insert_into_classtype_sorted_fields. Recursively add
3138 all the fields in the TREE_LIST FIELDS to the SORTED_FIELDS_TYPE
3139 elts, starting at offset IDX. */
3141 static int
3143 {
3144 tree x;
3146 {
3149 else
3151 }
3153 }
3155 /* Add all of the enum values of ENUMTYPE, to the FIELD_VEC elts,
3156 starting at offset IDX. */
3158 static int
3162 {
3163 tree values;
3167 }
3169 /* FIELD is a bit-field. We are finishing the processing for its
3170 enclosing type. Issue any appropriate messages and set appropriate
3171 flags. Returns false if an error has been diagnosed. */
3173 static bool
3175 {
3177 tree w;
3179 /* Extract the declared width of the bitfield, which has been
3180 temporarily stashed in DECL_INITIAL. */
3183 /* Remove the bit-field width indicator so that the rest of the
3184 compiler does not treat that value as an initializer. */
3187 /* Detect invalid bit-field type. */
3189 {
3192 }
3193 else
3194 {
3196 /* Avoid the non_lvalue wrapper added by fold for PLUS_EXPRs. */
3199 /* detect invalid field size. */
3205 {
3208 }
3210 {
3213 }
3215 {
3218 }
3230 }
3233 {
3237 }
3238 else
3239 {
3240 /* Non-bit-fields are aligned for their type. */
3244 }
3245 }
3247 /* FIELD is a non bit-field. We are finishing the processing for its
3248 enclosing type T. Issue any appropriate messages and set appropriate
3249 flags. */
3251 static void
3253 tree t,
3257 {
3260 /* In C++98 an anonymous union cannot contain any fields which would change
3261 the settings of CANT_HAVE_CONST_CTOR and friends. */
3263 ;
3264 /* And, we don't set TYPE_HAS_CONST_COPY_CTOR, etc., for anonymous
3265 structs. So, we recurse through their fields here. */
3267 {
3268 tree fields;
3274 }
3275 /* Check members with class type for constructors, destructors,
3276 etc. */
3278 {
3279 /* Never let anything with uninheritable virtuals
3280 make it through without complaint. */
3284 {
3289 field);
3294 field);
3296 {
3300 }
3301 }
3302 else
3303 {
3316 }
3325 }
3330 {
3331 /* `build_class_init_list' does not recognize
3332 non-FIELD_DECLs. */
3336 }
3337 }
3339 /* Check the data members (both static and non-static), class-scoped
3340 typedefs, etc., appearing in the declaration of T. Issue
3341 appropriate diagnostics. Sets ACCESS_DECLS to a list (in
3342 declaration order) of access declarations; each TREE_VALUE in this
3343 list is a USING_DECL.
3345 In addition, set the following flags:
3347 EMPTY_P
3348 The class is empty, i.e., contains no non-static data members.
3350 CANT_HAVE_CONST_CTOR_P
3351 This class cannot have an implicitly generated copy constructor
3352 taking a const reference.
3354 CANT_HAVE_CONST_ASN_REF
3355 This class cannot have an implicitly generated assignment
3356 operator taking a const reference.
3358 All of these flags should be initialized before calling this
3359 function.
3361 Returns a pointer to the end of the TYPE_FIELDs chain; additional
3362 fields can be added by adding to this chain. */
3364 static void
3368 {
3376 /* Assume there are no access declarations. */
3378 /* Assume this class has no pointer members. */
3380 /* Assume none of the members of this class have default
3381 initializations. */
3385 {
3393 {
3394 /* Save the access declarations for our caller. */
3397 }
3403 /* If we've gotten this far, it's a data member, possibly static,
3404 or an enumerator. */
3408 /* When this goes into scope, it will be a non-local reference. */
3412 {
3413 /* [class.union]
3415 If a union contains a static data member, or a member of
3416 reference type, the program is ill-formed. */
3418 {
3421 }
3423 {
3428 }
3429 }
3431 /* Perform error checking that did not get done in
3432 grokdeclarator. */
3434 {
3438 }
3440 {
3444 }
3452 /* Now it can only be a FIELD_DECL. */
3457 /* If at least one non-static data member is non-literal, the whole
3458 class becomes non-literal. Note: if the type is incomplete we
3459 will complain later on. */
3463 /* A standard-layout class is a class that:
3464 ...
3465 has the same access control (Clause 11) for all non-static data members,
3466 ... */
3473 /* If this is of reference type, check if it needs an init. */
3475 {
3481 /* ARM $12.6.2: [A member initializer list] (or, for an
3482 aggregate, initialization by a brace-enclosed list) is the
3483 only way to initialize nonstatic const and reference
3484 members. */
3487 }
3492 {
3494 {
3495 warning
3498 x);
3500 }
3504 }
3507 /* We don't treat zero-width bitfields as making a class
3508 non-empty. */
3509 ;
3510 else
3511 {
3512 /* The class is non-empty. */
3514 /* The class is not even nearly empty. */
3516 /* If one of the data members contains an empty class,
3517 so does T. */
3521 }
3523 /* This is used by -Weffc++ (see below). Warn only for pointers
3524 to members which might hold dynamic memory. So do not warn
3525 for pointers to functions or pointers to members. */
3531 {
3536 }
3542 {
3544 {
3548 }
3550 {
3554 }
3555 }
3558 /* DR 148 now allows pointers to members (which are POD themselves),
3559 to be allowed in POD structs. */
3568 /* We set DECL_C_BIT_FIELD in grokbitfield.
3569 If the type and width are valid, we'll also set DECL_BIT_FIELD. */
3572 cant_have_const_ctor_p,
3573 no_const_asn_ref_p,
3576 /* Now that we've removed bit-field widths from DECL_INITIAL,
3577 anything left in DECL_INITIAL is an NSDMI that makes the class
3578 non-aggregate. */
3582 /* If any field is const, the structure type is pseudo-const. */
3584 {
3589 /* ARM $12.6.2: [A member initializer list] (or, for an
3590 aggregate, initialization by a brace-enclosed list) is the
3591 only way to initialize nonstatic const and reference
3592 members. */
3595 }
3596 /* A field that is pseudo-const makes the structure likewise. */
3598 {
3603 }
3605 /* Core issue 80: A nonstatic data member is required to have a
3606 different name from the class iff the class has a
3607 user-declared constructor. */
3611 }
3613 /* Effective C++ rule 11: if a class has dynamic memory held by pointers,
3614 it should also define a copy constructor and an assignment operator to
3615 implement the correct copy semantic (deep vs shallow, etc.). As it is
3616 not feasible to check whether the constructors do allocate dynamic memory
3617 and store it within members, we approximate the warning like this:
3619 -- Warn only if there are members which are pointers
3620 -- Warn only if there is a non-trivial constructor (otherwise,
3621 there cannot be memory allocated).
3622 -- Warn only if there is a non-trivial destructor. We assume that the
3623 user at least implemented the cleanup correctly, and a destructor
3624 is needed to free dynamic memory.
3626 This seems enough for practical purposes. */
3628 && has_pointers
3632 {
3636 {
3641 }
3645 }
3647 /* Non-static data member initializers make the default constructor
3648 non-trivial. */
3650 {
3653 }
3655 /* If any of the fields couldn't be packed, unset TYPE_PACKED. */
3659 /* Check anonymous struct/anonymous union fields. */
3662 /* We've built up the list of access declarations in reverse order.
3663 Fix that now. */
3665 }
3667 /* If TYPE is an empty class type, records its OFFSET in the table of
3668 OFFSETS. */
3670 static int
3672 {
3673 splay_tree_node n;
3678 /* Record the location of this empty object in OFFSETS. */
3686 type,
3690 }
3692 /* Returns nonzero if TYPE is an empty class type and there is
3693 already an entry in OFFSETS for the same TYPE as the same OFFSET. */
3695 static int
3697 {
3698 splay_tree_node n;
3699 tree t;
3704 /* Record the location of this empty object in OFFSETS. */
3714 }
3716 /* Walk through all the subobjects of TYPE (located at OFFSET). Call
3717 F for every subobject, passing it the type, offset, and table of
3718 OFFSETS. If VBASES_P is one, then virtual non-primary bases should
3719 be traversed.
3721 If MAX_OFFSET is non-NULL, then subobjects with an offset greater
3722 than MAX_OFFSET will not be walked.
3724 If F returns a nonzero value, the traversal ceases, and that value
3725 is returned. Otherwise, returns zero. */
3727 static int
3729 subobject_offset_fn f,
3730 tree offset,
3731 splay_tree offsets,
3732 tree max_offset,
3734 {
3738 /* If this OFFSET is bigger than the MAX_OFFSET, then we should
3739 stop. */
3747 {
3751 }
3754 {
3755 tree field;
3756 tree binfo;
3759 /* Avoid recursing into objects that are not interesting. */
3763 /* Record the location of TYPE. */
3768 /* Iterate through the direct base classes of TYPE. */
3772 {
3773 tree binfo_offset;
3786 offset,
3788 else
3789 {
3790 tree orig_binfo;
3791 /* We cannot rely on BINFO_OFFSET being set for the base
3792 class yet, but the offsets for direct non-virtual
3793 bases can be calculated by going back to the TYPE. */
3796 offset,
3798 }
3801 f,
3802 binfo_offset,
3803 offsets,
3804 max_offset,
3809 }
3812 {
3816 /* Iterate through the virtual base classes of TYPE. In G++
3817 3.2, we included virtual bases in the direct base class
3818 loop above, which results in incorrect results; the
3819 correct offsets for virtual bases are only known when
3820 working with the most derived type. */
3824 {
3826 f,
3828 offset,
3830 offsets,
3831 max_offset,
3835 }
3836 else
3837 {
3838 /* We still have to walk the primary base, if it is
3839 virtual. (If it is non-virtual, then it was walked
3840 above.) */
3846 {
3847 r = (walk_subobject_offsets
3852 }
3853 }
3854 }
3856 /* Iterate through the fields of TYPE. */
3861 {
3862 tree field_offset;
3866 else
3867 /* In G++ 3.2, DECL_FIELD_OFFSET was used. */
3871 f,
3873 offset,
3874 field_offset),
3875 offsets,
3876 max_offset,
3880 }
3881 }
3883 {
3886 tree index;
3888 /* Avoid recursing into objects that are not interesting. */
3893 /* Step through each of the elements in the array. */
3895 /* G++ 3.2 had an off-by-one error here. */
3900 {
3902 f,
3903 offset,
3904 offsets,
3905 max_offset,
3911 /* If this new OFFSET is bigger than the MAX_OFFSET, then
3912 there's no point in iterating through the remaining
3913 elements of the array. */
3916 }
3917 }
3920 }
3922 /* Record all of the empty subobjects of TYPE (either a type or a
3923 binfo). If IS_DATA_MEMBER is true, then a non-static data member
3924 is being placed at OFFSET; otherwise, it is a base class that is
3925 being placed at OFFSET. */
3927 static void
3929 tree offset,
3930 splay_tree offsets,
3932 {
3933 tree max_offset;
3934 /* If recording subobjects for a non-static data member or a
3935 non-empty base class , we do not need to record offsets beyond
3936 the size of the biggest empty class. Additional data members
3937 will go at the end of the class. Additional base classes will go
3938 either at offset zero (if empty, in which case they cannot
3939 overlap with offsets past the size of the biggest empty class) or
3940 at the end of the class.
3942 However, if we are placing an empty base class, then we must record
3943 all offsets, as either the empty class is at offset zero (where
3944 other empty classes might later be placed) or at the end of the
3945 class (where other objects might then be placed, so other empty
3946 subobjects might later overlap). */
3950 else
3954 }
3956 /* Returns nonzero if any of the empty subobjects of TYPE (located at
3957 OFFSET) conflict with entries in OFFSETS. If VBASES_P is nonzero,
3958 virtual bases of TYPE are examined. */
3960 static int
3962 tree offset,
3963 splay_tree offsets,
3965 {
3966 splay_tree_node max_node;
3968 /* Get the node in OFFSETS that indicates the maximum offset where
3969 an empty subobject is located. */
3971 /* If there aren't any empty subobjects, then there's no point in
3972 performing this check. */
3978 vbases_p);
3979 }
3981 /* DECL is a FIELD_DECL corresponding either to a base subobject of a
3982 non-static data member of the type indicated by RLI. BINFO is the
3983 binfo corresponding to the base subobject, OFFSETS maps offsets to
3984 types already located at those offsets. This function determines
3985 the position of the DECL. */
3987 static void
3989 tree decl,
3990 tree binfo,
3991 splay_tree offsets)
3992 {
3995 tree type;
3998 {
3999 /* For the purposes of determining layout conflicts, we want to
4000 use the class type of BINFO; TREE_TYPE (DECL) will be the
4001 CLASSTYPE_AS_BASE version, which does not contain entries for
4002 zero-sized bases. */
4005 }
4006 else
4007 {
4010 }
4012 /* Try to place the field. It may take more than one try if we have
4013 a hard time placing the field without putting two objects of the
4014 same type at the same address. */
4016 {
4019 /* Place this field. */
4023 /* We have to check to see whether or not there is already
4024 something of the same type at the offset we're about to use.
4025 For example, consider:
4027 struct S {};
4028 struct T : public S { int i; };
4029 struct U : public S, public T {};
4031 Here, we put S at offset zero in U. Then, we can't put T at
4032 offset zero -- its S component would be at the same address
4033 as the S we already allocated. So, we have to skip ahead.
4034 Since all data members, including those whose type is an
4035 empty class, have nonzero size, any overlap can happen only
4036 with a direct or indirect base-class -- it can't happen with
4037 a data member. */
4038 /* In a union, overlap is permitted; all members are placed at
4039 offset zero. */
4042 /* G++ 3.2 did not check for overlaps when placing a non-empty
4043 virtual base. */
4048 {
4049 /* Strip off the size allocated to this field. That puts us
4050 at the first place we could have put the field with
4051 proper alignment. */
4054 /* Bump up by the alignment required for the type. */
4055 rli->bitpos
4061 }
4062 else
4063 /* There was no conflict. We're done laying out this field. */
4065 }
4067 /* Now that we know where it will be placed, update its
4068 BINFO_OFFSET. */
4070 /* Indirect virtual bases may have a nonzero BINFO_OFFSET at
4071 this point because their BINFO_OFFSET is copied from another
4072 hierarchy. Therefore, we may not need to add the entire
4073 OFFSET. */
4079 }
4081 /* Returns true if TYPE is empty and OFFSET is nonzero. */
4083 static int
4085 tree offset,
4087 {
4089 }
4091 /* Layout the empty base BINFO. EOC indicates the byte currently just
4092 past the end of the class, and should be correctly aligned for a
4093 class of the type indicated by BINFO; OFFSETS gives the offsets of
4094 the empty bases allocated so far. T is the most derived
4095 type. Return nonzero iff we added it at the end. */
4097 static bool
4100 {
4101 tree alignment;
4105 /* This routine should only be used for empty classes. */
4110 {
4112 propagate_binfo_offsets
4115 else
4117 "offset of empty base %qT may not be ABI-compliant and may"
4120 }
4122 /* This is an empty base class. We first try to put it at offset
4123 zero. */
4126 offsets,
4128 {
4129 /* That didn't work. Now, we move forward from the next
4130 available spot in the class. */
4134 {
4137 offsets,
4139 /* We finally found a spot where there's no overlap. */
4142 /* There's overlap here, too. Bump along to the next spot. */
4144 }
4145 }
4148 {
4153 }
4156 }
4158 /* Layout the base given by BINFO in the class indicated by RLI.
4159 *BASE_ALIGN is a running maximum of the alignments of
4160 any base class. OFFSETS gives the location of empty base
4161 subobjects. T is the most derived type. Return nonzero if the new
4162 object cannot be nearly-empty. A new FIELD_DECL is inserted at
4163 *NEXT_FIELD, unless BINFO is for an empty base class.
4165 Returns the location at which the next field should be inserted. */
4170 {
4175 /* This error is now reported in xref_tag, thus giving better
4176 location information. */
4179 /* Place the base class. */
4181 {
4182 tree decl;
4184 /* The containing class is non-empty because it has a non-empty
4185 base class. */
4188 /* Create the FIELD_DECL. */
4195 {
4203 /* Try to place the field. It may take more than one try if we
4204 have a hard time placing the field without putting two
4205 objects of the same type at the same address. */
4207 /* Add the new FIELD_DECL to the list of fields for T. */
4211 }
4212 }
4213 else
4214 {
4215 tree eoc;
4218 /* On some platforms (ARM), even empty classes will not be
4219 byte-aligned. */
4224 /* A nearly-empty class "has no proper base class that is empty,
4225 not morally virtual, and at an offset other than zero." */
4227 {
4230 /* The check above (used in G++ 3.2) is insufficient because
4231 an empty class placed at offset zero might itself have an
4232 empty base at a nonzero offset. */
4234 empty_base_at_nonzero_offset_p,
4235 size_zero_node,
4239 {
4242 else
4244 "class %qT will be considered nearly empty in a "
4246 }
4247 }
4249 /* We do not create a FIELD_DECL for empty base classes because
4250 it might overlap some other field. We want to be able to
4251 create CONSTRUCTORs for the class by iterating over the
4252 FIELD_DECLs, and the back end does not handle overlapping
4253 FIELD_DECLs. */
4255 /* An empty virtual base causes a class to be non-empty
4256 -- but in that case we do not need to clear CLASSTYPE_EMPTY_P
4257 here because that was already done when the virtual table
4258 pointer was created. */
4259 }
4261 /* Record the offsets of BINFO and its base subobjects. */
4264 offsets,
4268 }
4270 /* Layout all of the non-virtual base classes. Record empty
4271 subobjects in OFFSETS. T is the most derived type. Return nonzero
4272 if the type cannot be nearly empty. The fields created
4273 corresponding to the base classes will be inserted at
4274 *NEXT_FIELD. */
4276 static void
4279 {
4280 /* Chain to hold all the new FIELD_DECLs which stand in for base class
4281 subobjects. */
4286 /* The primary base class is always allocated first. */
4291 /* Now allocate the rest of the bases. */
4293 {
4294 tree base_binfo;
4298 /* The primary base was already allocated above, so we don't
4299 need to allocate it again here. */
4303 /* Virtual bases are added at the end (a primary virtual base
4304 will have already been added). */
4310 }
4311 }
4313 /* Go through the TYPE_METHODS of T issuing any appropriate
4314 diagnostics, figuring out which methods override which other
4315 methods, and so forth. */
4317 static void
4319 {
4320 tree x;
4323 {
4327 /* The name of the field is the original field name
4328 Save this in auxiliary field for later overloading. */
4330 {
4334 }
4335 /* All user-provided destructors are non-trivial.
4336 Constructors and assignment ops are handled in
4337 grok_special_member_properties. */
4340 }
4341 }
4343 /* FN is a constructor or destructor. Clone the declaration to create
4344 a specialized in-charge or not-in-charge version, as indicated by
4345 NAME. */
4347 static tree
4349 {
4350 tree parms;
4351 tree clone;
4353 /* Copy the function. */
4355 /* Reset the function name. */
4358 /* Remember where this function came from. */
4360 /* Make it easy to find the CLONE given the FN. */
4364 /* If this is a template, do the rest on the DECL_TEMPLATE_RESULT. */
4366 {
4373 }
4376 /* There's no pending inline data for this function. */
4380 /* The base-class destructor is not virtual. */
4382 {
4386 }
4388 /* If there was an in-charge parameter, drop it from the function
4389 type. */
4391 {
4392 tree basetype;
4393 tree parmtypes;
4394 tree exceptions;
4399 /* Skip the `this' parameter. */
4401 /* Skip the in-charge parameter. */
4403 /* And the VTT parm, in a complete [cd]tor. */
4407 /* If this is subobject constructor or destructor, add the vtt
4408 parameter. */
4412 parmtypes);
4415 exceptions);
4419 }
4421 /* Copy the function parameters. */
4423 /* Remove the in-charge parameter. */
4425 {
4429 }
4430 /* And the VTT parm, in a complete [cd]tor. */
4432 {
4435 else
4436 {
4440 }
4441 }
4444 {
4447 }
4449 /* Create the RTL for this function. */
4457 }
4459 /* Implementation of DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P, do
4460 not invoke this function directly.
4462 For a non-thunk function, returns the address of the slot for storing
4463 the function it is a clone of. Otherwise returns NULL_TREE.
4465 If JUST_TESTING, looks through TEMPLATE_DECL and returns NULL if
4466 cloned_function is unset. This is to support the separate
4467 DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P modes; using the latter
4468 on a template makes sense, but not the former. */
4470 tree *
4472 {
4480 {
4481 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4484 else
4485 #endif
4487 }
4492 else
4494 }
4496 /* Produce declarations for all appropriate clones of FN. If
4497 UPDATE_METHOD_VEC_P is nonzero, the clones are added to the
4498 CLASTYPE_METHOD_VEC as well. */
4500 void
4502 {
4503 tree clone;
4505 /* Avoid inappropriate cloning. */
4511 {
4512 /* For each constructor, we need two variants: an in-charge version
4513 and a not-in-charge version. */
4520 }
4521 else
4522 {
4525 /* For each destructor, we need three variants: an in-charge
4526 version, a not-in-charge version, and an in-charge deleting
4527 version. We clone the deleting version first because that
4528 means it will go second on the TYPE_METHODS list -- and that
4529 corresponds to the correct layout order in the virtual
4530 function table.
4532 For a non-virtual destructor, we do not build a deleting
4533 destructor. */
4535 {
4539 }
4546 }
4548 /* Note that this is an abstract function that is never emitted. */
4550 }
4552 /* DECL is an in charge constructor, which is being defined. This will
4553 have had an in class declaration, from whence clones were
4554 declared. An out-of-class definition can specify additional default
4555 arguments. As it is the clones that are involved in overload
4556 resolution, we must propagate the information from the DECL to its
4557 clones. */
4559 void
4561 {
4562 tree clone;
4566 {
4573 /* Skip the 'this' parameter. */
4589 {
4594 {
4595 /* A default parameter has been added. Adjust the
4596 clone's parameters. */
4600 tree type;
4605 {
4608 clone_parms);
4610 }
4613 clone_parms);
4622 }
4623 }
4625 }
4626 }
4628 /* For each of the constructors and destructors in T, create an
4629 in-charge and not-in-charge variant. */
4631 static void
4633 {
4634 tree fns;
4636 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
4637 out now. */
4645 }
4647 /* Deduce noexcept for a destructor DTOR. */
4649 void
4651 {
4653 {
4660 }
4661 }
4663 /* For each destructor in T, deduce noexcept:
4665 12.4/3: A declaration of a destructor that does not have an
4666 exception-specification is implicitly considered to have the
4667 same exception-specification as an implicit declaration (15.4). */
4669 static void
4671 {
4672 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
4673 out now. */
4679 }
4681 /* Subroutine of set_one_vmethod_tm_attributes. Search base classes
4682 of TYPE for virtual functions which FNDECL overrides. Return a
4683 mask of the tm attributes found therein. */
4685 static int
4687 {
4689 tree base_binfo;
4693 {
4703 else
4705 }
4708 }
4710 /* Subroutine of set_method_tm_attributes. Handle the checks and
4711 inheritance for one virtual method FNDECL. */
4713 static void
4715 {
4716 tree tm_attr;
4721 /* If FNDECL doesn't actually override anything (i.e. T is the
4722 class that first declares FNDECL virtual), then we're done. */
4729 /* Intel STM Language Extension 3.0, Section 4.2 table 4:
4730 tm_pure must match exactly, otherwise no weakening of
4731 tm_safe > tm_callable > nothing. */
4732 /* ??? The tm_pure attribute didn't make the transition to the
4733 multivendor language spec. */
4735 {
4737 {
4740 }
4741 }
4742 /* If the overridden function is tm_pure, then FNDECL must be. */
4745 /* Look for base class combinations that cannot be satisfied. */
4747 {
4753 }
4754 /* If FNDECL did not declare an attribute, then inherit the most
4755 restrictive one. */
4757 {
4759 }
4760 /* Otherwise validate that we're not weaker than a function
4761 that is being overridden. */
4762 else
4763 {
4767 }
4770 err_override:
4774 }
4776 /* For each of the methods in T, propagate a class-level tm attribute. */
4778 static void
4780 {
4783 /* Don't bother collecting tm attributes if transactional memory
4784 support is not enabled. */
4788 /* Process virtual methods first, as they inherit directly from the
4789 base virtual function and also require validation of new attributes. */
4791 {
4792 tree vchain;
4795 {
4800 }
4801 }
4803 /* If the class doesn't have an attribute, nothing more to do. */
4808 /* Any method that does not yet have a tm attribute inherits
4809 the one from the class. */
4811 {
4814 }
4815 }
4817 /* Returns true iff class T has a user-defined constructor other than
4818 the default constructor. */
4820 bool
4822 {
4823 tree fns;
4829 {
4836 }
4839 }
4841 /* Returns the defaulted constructor if T has one. Otherwise, returns
4842 NULL_TREE. */
4844 tree
4846 {
4853 {
4857 {
4863 }
4864 }
4867 }
4869 /* Returns true iff FN is a user-provided function, i.e. user-declared
4870 and not defaulted at its first declaration; or explicit, private,
4871 protected, or non-const. */
4873 bool
4875 {
4878 else
4882 }
4884 /* Returns true iff class T has a user-provided constructor. */
4886 bool
4888 {
4889 tree fns;
4897 /* This can happen in error cases; avoid crashing. */
4906 }
4908 /* Returns true iff class T has a user-provided default constructor. */
4910 bool
4912 {
4913 tree fns;
4919 {
4925 }
4928 }
4930 /* TYPE is being used as a virtual base, and has a non-trivial move
4931 assignment. Return true if this is due to there being a user-provided
4932 move assignment in TYPE or one of its subobjects; if there isn't, then
4933 multiple move assignment can't cause any harm. */
4935 bool
4937 {
4938 /* Does the type itself have a user-provided move assignment operator? */
4942 {
4946 }
4948 /* Do any of its bases? */
4950 tree base_binfo;
4955 /* Or non-static data members? */
4957 {
4962 }
4964 /* Seems not. */
4966 }
4968 /* If default-initialization leaves part of TYPE uninitialized, returns
4969 a DECL for the field or TYPE itself (DR 253). */
4971 tree
4973 {
4984 {
4988 }
4993 {
4997 }
5000 }
5002 /* Returns true iff for class T, a trivial synthesized default constructor
5003 would be constexpr. */
5005 bool
5007 {
5008 /* A defaulted trivial default constructor is constexpr
5009 if there is nothing to initialize. */
5012 }
5014 /* Returns true iff class T has a constexpr default constructor. */
5016 bool
5018 {
5019 tree fns;
5022 {
5023 /* The caller should have stripped an enclosing array. */
5026 }
5028 {
5031 /* Non-trivial, we need to check subobject constructors. */
5033 }
5036 }
5038 /* Returns true iff class TYPE has a virtual destructor. */
5040 bool
5042 {
5043 tree dtor;
5051 }
5053 /* Returns true iff class T has a move constructor. */
5055 bool
5057 {
5058 tree fns;
5061 {
5064 }
5074 }
5076 /* Returns true iff class T has a move assignment operator. */
5078 bool
5080 {
5081 tree fns;
5084 {
5087 }
5095 }
5097 /* Returns true iff class T has a move constructor that was explicitly
5098 declared in the class body. Note that this is different from
5099 "user-provided", which doesn't include functions that are defaulted in
5100 the class. */
5102 bool
5104 {
5105 tree fns;
5114 {
5118 }
5121 }
5123 /* Returns true iff class T has a move assignment operator that was
5124 explicitly declared in the class body. */
5126 bool
5128 {
5129 tree fns;
5136 {
5140 }
5143 }
5145 /* Nonzero if we need to build up a constructor call when initializing an
5146 object of this class, either because it has a user-declared constructor
5147 or because it doesn't have a default constructor (so we need to give an
5148 error if no initializer is provided). Use TYPE_NEEDS_CONSTRUCTING when
5149 what you care about is whether or not an object can be produced by a
5150 constructor (e.g. so we don't set TREE_READONLY on const variables of
5151 such type); use this function when what you care about is whether or not
5152 to try to call a constructor to create an object. The latter case is
5153 the former plus some cases of constructors that cannot be called. */
5155 bool
5157 {
5158 tree inner;
5168 /* A user-declared constructor might be private, and a constructor might
5169 be trivial but deleted. */
5172 {
5177 }
5179 }
5181 /* Like type_build_ctor_call, but for destructors. */
5183 bool
5185 {
5186 tree inner;
5195 /* A user-declared destructor might be private, and a destructor might
5196 be trivial but deleted. */
5199 {
5204 }
5206 }
5208 /* Remove all zero-width bit-fields from T. */
5210 static void
5212 {
5217 {
5220 /* We should not be confused by the fact that grokbitfield
5221 temporarily sets the width of the bit field into
5222 DECL_INITIAL (*fieldsp).
5223 check_bitfield_decl eventually sets DECL_SIZE (*fieldsp)
5224 to that width. */
5227 else
5229 }
5230 }
5232 /* Returns TRUE iff we need a cookie when dynamically allocating an
5233 array whose elements have the indicated class TYPE. */
5235 static bool
5237 {
5238 tree fns;
5243 /* If there's a non-trivial destructor, we need a cookie. In order
5244 to iterate through the array calling the destructor for each
5245 element, we'll have to know how many elements there are. */
5249 /* If the usual deallocation function is a two-argument whose second
5250 argument is of type `size_t', then we have to pass the size of
5251 the array to the deallocation function, so we will need to store
5252 a cookie. */
5256 /* If there are no `operator []' members, or the lookup is
5257 ambiguous, then we don't need a cookie. */
5260 /* Loop through all of the functions. */
5262 {
5263 tree fn;
5264 tree second_parm;
5266 /* Select the current function. */
5268 /* See if this function is a one-argument delete function. If
5269 it is, then it will be the usual deallocation function. */
5273 /* Do not consider this function if its second argument is an
5274 ellipsis. */
5277 /* Otherwise, if we have a two-argument function and the second
5278 argument is `size_t', it will be the usual deallocation
5279 function -- unless there is one-argument function, too. */
5283 }
5286 }
5288 /* Finish computing the `literal type' property of class type T.
5290 At this point, we have already processed base classes and
5291 non-static data members. We need to check whether the copy
5292 constructor is trivial, the destructor is trivial, and there
5293 is a trivial default constructor or at least one constexpr
5294 constructor other than the copy constructor. */
5296 static void
5298 {
5299 tree fn;
5315 {
5318 {
5322 }
5323 }
5324 }
5326 /* T is a non-literal type used in a context which requires a constant
5327 expression. Explain why it isn't literal. */
5329 void
5331 {
5341 /* Already explained. */
5350 {
5352 "default constructor, and has no constexpr constructor that "
5356 {
5357 /* Note that we can't simply call locate_ctor because when the
5358 constructor is deleted it just returns NULL_TREE. */
5359 tree fns;
5361 {
5368 {
5371 else
5374 }
5375 }
5376 }
5377 }
5378 else
5379 {
5383 {
5386 {
5391 }
5392 }
5394 {
5395 tree ftype;
5400 {
5405 }
5406 }
5407 }
5408 }
5410 /* Check the validity of the bases and members declared in T. Add any
5411 implicitly-generated functions (like copy-constructors and
5412 assignment operators). Compute various flag bits (like
5413 CLASSTYPE_NON_LAYOUT_POD_T) for T. This routine works purely at the C++
5414 level: i.e., independently of the ABI in use. */
5416 static void
5418 {
5419 /* Nonzero if the implicitly generated copy constructor should take
5420 a non-const reference argument. */
5422 /* Nonzero if the implicitly generated assignment operator
5423 should take a non-const reference argument. */
5425 tree access_decls;
5428 tree fn;
5430 /* By default, we use const reference arguments and generate default
5431 constructors. */
5435 /* Check all the base-classes. */
5439 /* Deduce noexcept on destructors. This needs to happen after we've set
5440 triviality flags appropriately for our bases. */
5444 /* Check all the method declarations. */
5447 /* Save the initial values of these flags which only indicate whether
5448 or not the class has user-provided functions. As we analyze the
5449 bases and members we can set these flags for other reasons. */
5453 /* Check all the data member declarations. We cannot call
5454 check_field_decls until we have called check_bases check_methods,
5455 as check_field_decls depends on TYPE_HAS_NONTRIVIAL_DESTRUCTOR
5456 being set appropriately. */
5461 /* A nearly-empty class has to be vptr-containing; a nearly empty
5462 class contains just a vptr. */
5466 /* Do some bookkeeping that will guide the generation of implicitly
5467 declared member functions. */
5470 /* We need to call a constructor for this class if it has a
5471 user-provided constructor, or if the default constructor is going
5472 to initialize the vptr. (This is not an if-and-only-if;
5473 TYPE_NEEDS_CONSTRUCTING is set elsewhere if bases or members
5474 themselves need constructing.) */
5477 /* [dcl.init.aggr]
5479 An aggregate is an array or a class with no user-provided
5480 constructors ... and no virtual functions.
5482 Again, other conditions for being an aggregate are checked
5483 elsewhere. */
5486 /* This is the C++98/03 definition of POD; it changed in C++0x, but we
5487 retain the old definition internally for ABI reasons. */
5496 /* If the class has no user-declared constructor, but does have
5497 non-static const or reference data members that can never be
5498 initialized, issue a warning. */
5500 /* Classes with user-declared constructors are presumed to
5501 initialize these members. */
5503 /* Aggregates can be initialized with brace-enclosed
5504 initializers. */
5506 {
5507 tree field;
5510 {
5511 tree type;
5526 }
5527 }
5529 /* Synthesize any needed methods. */
5531 cant_have_const_ctor,
5532 no_const_asn_ref);
5534 /* Check defaulted declarations here so we have cant_have_const_ctor
5535 and don't need to worry about clones. */
5538 {
5541 {
5542 bool imp_const_p
5548 /* If the function is defaulted outside the class, we just
5549 give the synthesis error. */
5552 }
5554 }
5557 {
5558 /* "The closure type associated with a lambda-expression has a deleted
5559 default constructor and a deleted copy assignment operator." */
5565 /* "This class type is not an aggregate." */
5567 }
5569 /* Compute the 'literal type' property before we
5570 do anything with non-static member functions. */
5573 /* Create the in-charge and not-in-charge variants of constructors
5574 and destructors. */
5577 /* Process the using-declarations. */
5581 /* Build and sort the CLASSTYPE_METHOD_VEC. */
5584 /* Figure out whether or not we will need a cookie when dynamically
5585 allocating an array of this type. */
5588 }
5590 /* If T needs a pointer to its virtual function table, set TYPE_VFIELD
5591 accordingly. If a new vfield was created (because T doesn't have a
5592 primary base class), then the newly created field is returned. It
5593 is not added to the TYPE_FIELDS list; it is the caller's
5594 responsibility to do that. Accumulate declared virtual functions
5595 on VIRTUALS_P. */
5597 static tree
5599 {
5600 tree fn;
5602 /* Collect the virtual functions declared in T. */
5606 {
5615 }
5617 /* If we couldn't find an appropriate base class, create a new field
5618 here. Even if there weren't any new virtual functions, we might need a
5619 new virtual function table if we're supposed to include vptrs in
5620 all classes that need them. */
5622 {
5623 /* We build this decl with vtbl_ptr_type_node, which is a
5624 `vtable_entry_type*'. It might seem more precise to use
5625 `vtable_entry_type (*)[N]' where N is the number of virtual
5626 functions. However, that would require the vtable pointer in
5627 base classes to have a different type than the vtable pointer
5628 in derived classes. We could make that happen, but that
5629 still wouldn't solve all the problems. In particular, the
5630 type-based alias analysis code would decide that assignments
5631 to the base class vtable pointer can't alias assignments to
5632 the derived class vtable pointer, since they have different
5633 types. Thus, in a derived class destructor, where the base
5634 class constructor was inlined, we could generate bad code for
5635 setting up the vtable pointer.
5637 Therefore, we use one type for all vtable pointers. We still
5638 use a type-correct type; it's just doesn't indicate the array
5639 bounds. That's better than using `void*' or some such; it's
5640 cleaner, and it let's the alias analysis code know that these
5641 stores cannot alias stores to void*! */
5642 tree field;
5655 /* This class is non-empty. */
5659 }
5662 }
5664 /* Add OFFSET to all base types of BINFO which is a base in the
5665 hierarchy dominated by T.
5667 OFFSET, which is a type offset, is number of bytes. */
5669 static void
5671 {
5673 tree primary_binfo;
5674 tree base_binfo;
5676 /* Update BINFO's offset. */
5681 offset));
5683 /* Find the primary base class. */
5689 /* Scan all of the bases, pushing the BINFO_OFFSET adjust
5690 downwards. */
5692 {
5693 /* Don't do the primary base twice. */
5701 }
5702 }
5704 /* Set BINFO_OFFSET for all of the virtual bases for RLI->T. Update
5705 TYPE_ALIGN and TYPE_SIZE for T. OFFSETS gives the location of
5706 empty subobjects of T. */
5708 static void
5710 {
5711 tree vbase;
5720 {
5721 /* In G++ 3.2, we incorrectly rounded the size before laying out
5722 the virtual bases. */
5724 #ifdef STRUCTURE_SIZE_BOUNDARY
5725 /* Packed structures don't need to have minimum size. */
5728 #endif
5732 }
5734 /* Find the last field. The artificial fields created for virtual
5735 bases will go after the last extant field to date. */
5740 /* Go through the virtual bases, allocating space for each virtual
5741 base that is not already a primary base class. These are
5742 allocated in inheritance graph order. */
5744 {
5749 {
5752 /* This virtual base is not a primary base of any class in the
5753 hierarchy, so we have to add space for it. */
5757 /* If the first virtual base might have been placed at a
5758 lower address, had we started from CLASSTYPE_SIZE, rather
5759 than TYPE_SIZE, issue a warning. There can be both false
5760 positives and false negatives from this warning in rare
5761 cases; to deal with all the possibilities would probably
5762 require performing both layout algorithms and comparing
5763 the results which is not particularly tractable. */
5765 && first_vbase
5766 && (tree_int_cst_lt
5771 bitsize_unit_node),
5774 "offset of virtual base %qT is not ABI-compliant and "
5776 basetype);
5779 }
5780 }
5781 }
5783 /* Returns the offset of the byte just past the end of the base class
5784 BINFO. */
5786 static tree
5788 {
5789 tree size;
5794 /* An empty class has zero CLASSTYPE_SIZE_UNIT, but we need to
5795 allocate some space for it. It cannot have virtual bases, so
5796 TYPE_SIZE_UNIT is fine. */
5798 else
5802 }
5804 /* Returns the offset of the byte just past the end of the base class
5805 with the highest offset in T. If INCLUDE_VIRTUALS_P is zero, then
5806 only non-virtual bases are included. */
5808 static tree
5810 {
5813 tree binfo;
5814 tree base_binfo;
5815 tree offset;
5820 {
5830 }
5832 /* G++ 3.2 did not check indirect virtual bases. */
5836 {
5840 }
5843 }
5845 /* Warn about bases of T that are inaccessible because they are
5846 ambiguous. For example:
5848 struct S {};
5849 struct T : public S {};
5850 struct U : public S, public T {};
5852 Here, `(S*) new U' is not allowed because there are two `S'
5853 subobjects of U. */
5855 static void
5857 {
5860 tree basetype;
5861 tree binfo;
5862 tree base_binfo;
5864 /* If there are no repeated bases, nothing can be ambiguous. */
5868 /* Check direct bases. */
5871 {
5877 }
5879 /* Check for ambiguous virtual bases. */
5883 {
5889 }
5890 }
5892 /* Compare two INTEGER_CSTs K1 and K2. */
5894 static int
5896 {
5898 }
5900 /* Increase the size indicated in RLI to account for empty classes
5901 that are "off the end" of the class. */
5903 static void
5905 {
5906 tree eoc;
5907 tree rli_size;
5909 /* It might be the case that we grew the class to allocate a
5910 zero-sized base class. That won't be reflected in RLI, yet,
5911 because we are willing to overlay multiple bases at the same
5912 offset. However, now we need to make sure that RLI is big enough
5913 to reflect the entire class. */
5919 {
5921 /* In version 1 of the ABI, the size of a class that ends with
5922 a bitfield was not rounded up to a whole multiple of a
5923 byte. Because rli_size_unit_so_far returns only the number
5924 of fully allocated bytes, any extra bits were not included
5925 in the size. */
5927 else
5928 /* The size should have been rounded to a whole byte. */
5931 rli->bitpos
5940 }
5941 }
5943 /* Calculate the TYPE_SIZE, TYPE_ALIGN, etc for T. Calculate
5944 BINFO_OFFSETs for all of the base-classes. Position the vtable
5945 pointer. Accumulate declared virtual functions on VIRTUALS_P. */
5947 static void
5949 {
5950 tree non_static_data_members;
5951 tree field;
5952 tree vptr;
5953 record_layout_info rli;
5954 /* Maps offsets (represented as INTEGER_CSTs) to a TREE_LIST of
5955 types that appear at that offset. */
5956 splay_tree empty_base_offsets;
5957 /* True if the last field laid out was a bit-field. */
5959 /* The location at which the next field should be inserted. */
5961 /* T, as a base class. */
5962 tree base_t;
5964 /* Keep track of the first non-static data member. */
5967 /* Start laying out the record. */
5970 /* Mark all the primary bases in the hierarchy. */
5973 /* Create a pointer to our virtual function table. */
5976 /* The vptr is always the first thing in the class. */
5978 {
5983 }
5984 else
5987 /* Build FIELD_DECLs for all of the non-virtual base-types. */
5992 /* Layout the non-static data members. */
5994 {
5995 tree type;
5996 tree padding;
5998 /* We still pass things that aren't non-static data members to
5999 the back end, in case it wants to do something with them. */
6001 {
6003 /* If the static data member has incomplete type, keep track
6004 of it so that it can be completed later. (The handling
6005 of pending statics in finish_record_layout is
6006 insufficient; consider:
6008 struct S1;
6009 struct S2 { static S1 s1; };
6011 At this point, finish_record_layout will be called, but
6012 S1 is still incomplete.) */
6014 {
6016 /* The visibility of static data members is determined
6017 at their point of declaration, not their point of
6018 definition. */
6020 }
6022 }
6030 /* If this field is a bit-field whose width is greater than its
6031 type, then there are some special rules for allocating
6032 it. */
6035 {
6037 tree integer_type;
6039 /* We must allocate the bits as if suitably aligned for the
6040 longest integer type that fits in this many bits. type
6041 of the field. Then, we are supposed to use the left over
6042 bits as additional padding. */
6051 /* ITK now indicates a type that is too large for the
6052 field. We have to back up by one to find the largest
6053 type that fits. */
6054 do
6055 {
6060 /* Figure out how much additional padding is required. GCC
6061 3.2 always created a padding field, even if it had zero
6062 width. */
6065 {
6067 /* In a union, the padding field must have the full width
6068 of the bit-field; all fields start at offset zero. */
6070 else
6071 {
6074 "ABI-compliant and may change in a future "
6076 t);
6079 }
6080 }
6081 #ifdef PCC_BITFIELD_TYPE_MATTERS
6082 /* An unnamed bitfield does not normally affect the
6083 alignment of the containing class on a target where
6084 PCC_BITFIELD_TYPE_MATTERS. But, the C++ ABI does not
6085 make any exceptions for unnamed bitfields when the
6086 bitfields are longer than their types. Therefore, we
6087 temporarily give the field a name. */
6089 {
6092 }
6093 #endif
6098 empty_base_offsets);
6101 /* Now that layout has been performed, set the size of the
6102 field to the size of its declared type; the rest of the
6103 field is effectively invisible. */
6105 /* We must also reset the DECL_MODE of the field. */
6110 /* Versions of G++ before G++ 3.4 did not reset the
6111 DECL_MODE. */
6113 "the offset of %qD may not be ABI-compliant and may "
6115 }
6116 else
6118 empty_base_offsets);
6120 /* Remember the location of any empty classes in FIELD. */
6124 empty_base_offsets,
6127 /* If a bit-field does not immediately follow another bit-field,
6128 and yet it starts in the middle of a byte, we have failed to
6129 comply with the ABI. */
6132 /* The TREE_NO_WARNING flag gets set by Objective-C when
6133 laying out an Objective-C class. The ObjC ABI differs
6134 from the C++ ABI, and so we do not want a warning
6135 here. */
6137 && !last_field_was_bitfield
6140 bitsize_unit_node)))
6144 /* G++ used to use DECL_FIELD_OFFSET as if it were the byte
6145 offset of the field. */
6152 "classes to be placed at different locations in a "
6155 /* The middle end uses the type of expressions to determine the
6156 possible range of expression values. In order to optimize
6157 "x.i > 7" to "false" for a 2-bit bitfield "i", the middle end
6158 must be made aware of the width of "i", via its type.
6160 Because C++ does not have integer types of arbitrary width,
6161 we must (for the purposes of the front end) convert from the
6162 type assigned here to the declared type of the bitfield
6163 whenever a bitfield expression is used as an rvalue.
6164 Similarly, when assigning a value to a bitfield, the value
6165 must be converted to the type given the bitfield here. */
6167 {
6172 {
6179 }
6180 }
6182 /* If we needed additional padding after this field, add it
6183 now. */
6185 {
6186 tree padding_field;
6189 FIELD_DECL,
6190 NULL_TREE,
6191 char_type_node);
6198 NULL_TREE,
6199 empty_base_offsets);
6200 }
6203 }
6206 {
6207 /* Make sure that we are on a byte boundary so that the size of
6208 the class without virtual bases will always be a round number
6209 of bytes. */
6212 }
6214 /* G++ 3.2 does not allow virtual bases to be overlaid with tail
6215 padding. */
6219 /* Delete all zero-width bit-fields from the list of fields. Now
6220 that the type is laid out they are no longer important. */
6223 /* Create the version of T used for virtual bases. We do not use
6224 make_class_type for this version; this is an artificial type. For
6225 a POD type, we just reuse T. */
6227 {
6230 /* Set the size and alignment for the new type. In G++ 3.2, all
6231 empty classes were considered to have size zero when used as
6232 base classes. */
6234 {
6239 "layout of classes derived from empty class %qT "
6241 t);
6242 }
6243 else
6244 {
6245 tree eoc;
6247 /* If the ABI version is not at least two, and the last
6248 field was a bit-field, RLI may not be on a byte
6249 boundary. In particular, rli_size_unit_so_far might
6250 indicate the last complete byte, while rli_size_so_far
6251 indicates the total number of bits used. Therefore,
6252 rli_size_so_far, rather than rli_size_unit_so_far, is
6253 used to compute TYPE_SIZE_UNIT. */
6261 eoc);
6268 }
6272 /* Copy the fields from T. */
6276 {
6278 FIELD_DECL,
6288 }
6290 /* Record the base version of the type. */
6293 }
6294 else
6297 /* Every empty class contains an empty class. */
6301 /* Set the TYPE_DECL for this type to contain the right
6302 value for DECL_OFFSET, so that we can use it as part
6303 of a COMPONENT_REF for multiple inheritance. */
6306 /* Now fix up any virtual base class types that we left lying
6307 around. We must get these done before we try to lay out the
6308 virtual function table. As a side-effect, this will remove the
6309 base subobject fields. */
6312 /* Make sure that empty classes are reflected in RLI at this
6313 point. */
6316 /* Make sure not to create any structures with zero size. */
6322 /* If this is a non-POD, declaring it packed makes a difference to how it
6323 can be used as a field; don't let finalize_record_size undo it. */
6327 /* Let the back end lay out the type. */
6336 /* Warn about bases that can't be talked about due to ambiguity. */
6339 /* Now that we're done with layout, give the base fields the real types. */
6344 /* Clean up. */
6351 }
6353 /* Determine the "key method" for the class type indicated by TYPE,
6354 and set CLASSTYPE_KEY_METHOD accordingly. */
6356 void
6358 {
6359 tree method;
6362 || processing_template_decl
6367 /* The key method is the first non-pure virtual function that is not
6368 inline at the point of class definition. On some targets the
6369 key function may not be inline; those targets should not call
6370 this function until the end of the translation unit. */
6376 {
6379 }
6382 }
6385 /* Allocate and return an instance of struct sorted_fields_type with
6386 N fields. */
6390 {
6397 }
6400 /* Perform processing required when the definition of T (a class type)
6401 is complete. */
6403 void
6405 {
6406 tree x;
6407 /* A TREE_LIST. The TREE_VALUE of each node is a FUNCTION_DECL. */
6411 {
6416 }
6418 /* If this type was previously laid out as a forward reference,
6419 make sure we lay it out again. */
6423 /* Make assumptions about the class; we'll reset the flags if
6424 necessary. */
6430 /* Do end-of-class semantic processing: checking the validity of the
6431 bases and members and add implicitly generated methods. */
6434 /* Find the key method. */
6436 {
6437 /* The Itanium C++ ABI permits the key method to be chosen when
6438 the class is defined -- even though the key method so
6439 selected may later turn out to be an inline function. On
6440 some systems (such as ARM Symbian OS) the key method cannot
6441 be determined until the end of the translation unit. On such
6442 systems, we leave CLASSTYPE_KEY_METHOD set to NULL, which
6443 will cause the class to be added to KEYED_CLASSES. Then, in
6444 finish_file we will determine the key method. */
6448 /* If a polymorphic class has no key method, we may emit the vtable
6449 in every translation unit where the class definition appears. */
6452 }
6454 /* Layout the class itself. */
6457 /* We use the base type for trivial assignments, and hence it
6458 needs a mode. */
6463 /* If necessary, create the primary vtable for this class. */
6465 {
6466 /* We must enter these virtuals into the table. */
6470 /* Here we know enough to change the type of our virtual
6471 function table, but we will wait until later this function. */
6474 /* If we're warning about ABI tags, check the types of the new
6475 virtual functions. */
6479 }
6482 {
6484 tree fn;
6491 /* Add entries for virtual functions introduced by this class. */
6495 /* Set DECL_VINDEX for all functions declared in this class. */
6497 fn;
6499 vindex += (TARGET_VTABLE_USES_DESCRIPTORS
6501 {
6505 /* A thunk. We should never be calling this entry directly
6506 from this vtable -- we'd use the entry for the non
6507 thunk base function. */
6511 }
6512 }
6517 /* Complete the rtl for any static member objects of the type we're
6518 working on. */
6525 /* Done with FIELDS...now decide whether to sort these for
6526 faster lookups later.
6528 We use a small number because most searches fail (succeeding
6529 ultimately as the search bores through the inheritance
6530 hierarchy), and we want this failure to occur quickly. */
6534 /* Complain if one of the field types requires lower visibility. */
6537 /* Make the rtl for any new vtables we have created, and unmark
6538 the base types we marked. */
6541 /* Build the VTT for T. */
6544 /* This warning does not make sense for Java classes, since they
6545 cannot have destructors. */
6547 {
6548 tree dtor;
6552 if it were virtual, we would have created it by now. */
6553 !dtor
6562 "%q#T has virtual functions and accessible"
6564 }
6571 /* Class layout, assignment of virtual table slots, etc., is now
6572 complete. Give the back end a chance to tweak the visibility of
6573 the class or perform any other required target modifications. */
6583 /* Finish debugging output for this type. */
6587 {
6590 {
6593 }
6595 {
6598 else
6599 {
6602 }
6604 }
6606 {
6608 "the type of the first field has a different ABI from the "
6611 }
6612 }
6613 }
6615 /* Insert FIELDS into T for the sorted case if the FIELDS count is
6616 equal to THRESHOLD or greater than THRESHOLD. */
6618 static void
6620 {
6623 {
6628 }
6629 }
6631 /* Insert lately defined enum ENUMTYPE into T for the sorted case. */
6633 void
6635 {
6638 {
6640 int n_fields
6651 }
6652 }
6654 /* When T was built up, the member declarations were added in reverse
6655 order. Rearrange them to declaration order. */
6657 void
6659 {
6660 tree next;
6661 tree prev;
6662 tree x;
6664 /* The following lists are all in reverse order. Put them in
6665 declaration order now. */
6669 /* Actually, for the TYPE_FIELDS, only the non TYPE_DECLs are in
6670 reverse order, so we can't just use nreverse. */
6675 {
6679 }
6681 {
6685 }
6686 }
6688 tree
6690 {
6693 /* Now that we've got all the field declarations, reverse everything
6694 as necessary. */
6699 /* Nadger the current location so that diagnostics point to the start of
6700 the struct, not the end. */
6704 {
6705 tree x;
6711 /* We need to emit an error message if this type was used as a parameter
6712 and it is an abstract type, even if it is a template. We construct
6713 a simple CLASSTYPE_PURE_VIRTUALS list without taking bases into
6714 account and we call complete_vars with this type, which will check
6715 the PARM_DECLS. Note that while the type is being defined,
6716 CLASSTYPE_PURE_VIRTUALS contains the list of the inline friends
6717 (see CLASSTYPE_INLINE_FRIENDS) so we need to clear it. */
6723 /* We need to add the target functions to the CLASSTYPE_METHOD_VEC if
6724 an enclosing scope is a template class, so that this function be
6725 found by lookup_fnfields_1 when the using declaration is not
6726 instantiated yet. */
6729 {
6734 }
6736 /* Remember current #pragma pack value. */
6739 /* Fix up any variants we've already built. */
6741 {
6746 }
6747 }
6748 else
6757 else
6761 /* Lambdas are defined by the LAMBDA_EXPR. */
6766 }
6767 \f
6768 /* Hash table to avoid endless recursion when handling references. */
6771 /* Return the dynamic type of INSTANCE, if known.
6772 Used to determine whether the virtual function table is needed
6773 or not.
6775 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
6776 of our knowledge of its type. *NONNULL should be initialized
6777 before this function is called. */
6779 static tree
6781 {
6782 #define RECUR(T) fixed_type_or_null((T), nonnull, cdtorp)
6785 {
6789 else
6793 /* This is a call to a constructor, hence it's never zero. */
6795 {
6799 }
6803 /* This is a call to a constructor, hence it's never zero. */
6805 {
6809 }
6818 /* Propagate nonnull. */
6823 CASE_CONVERT:
6829 {
6830 /* Just because we see an ADDR_EXPR doesn't mean we're dealing
6831 with a real object -- given &p->f, p can still be null. */
6833 /* ??? Probably should check DECL_WEAK here. */
6836 }
6840 /* If this component is really a base class reference, then the field
6841 itself isn't definitive. */
6850 {
6854 }
6855 /* fall through... */
6860 {
6864 }
6866 {
6870 /* if we're in a ctor or dtor, we know our type. If
6871 current_class_ptr is set but we aren't in a function, we're in
6872 an NSDMI (and therefore a constructor). */
6877 {
6881 }
6882 }
6884 {
6885 /* We only need one hash table because it is always left empty. */
6889 /* Reference variables should be references to objects. */
6893 /* Enter the INSTANCE in a table to prevent recursion; a
6894 variable's initializer may refer to the variable
6895 itself. */
6900 {
6901 tree type;
6910 }
6911 }
6916 }
6917 #undef RECUR
6918 }
6920 /* Return nonzero if the dynamic type of INSTANCE is known, and
6921 equivalent to the static type. We also handle the case where
6922 INSTANCE is really a pointer. Return negative if this is a
6923 ctor/dtor. There the dynamic type is known, but this might not be
6924 the most derived base of the original object, and hence virtual
6925 bases may not be laid out according to this type.
6927 Used to determine whether the virtual function table is needed
6928 or not.
6930 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
6931 of our knowledge of its type. *NONNULL should be initialized
6932 before this function is called. */
6934 int
6936 {
6939 tree fixed;
6941 /* processing_template_decl can be false in a template if we're in
6942 fold_non_dependent_expr, but we still want to suppress this check. */
6944 {
6945 /* In a template we only care about the type of the result. */
6949 }
6959 }
6961 \f
6962 void
6964 {
6967 current_class_stack
6975 }
6977 /* Restore the cached PREVIOUS_CLASS_LEVEL. */
6979 static void
6981 {
6982 tree type;
6984 /* We are re-entering the same class we just left, so we don't
6985 have to search the whole inheritance matrix to find all the
6986 decls to bind again. Instead, we install the cached
6987 class_shadowed list and walk through it binding names. */
6990 /* Restore IDENTIFIER_TYPE_VALUE. */
6992 type;
6995 }
6997 /* Set global variables CURRENT_CLASS_NAME and CURRENT_CLASS_TYPE as
6998 appropriate for TYPE.
7000 So that we may avoid calls to lookup_name, we cache the _TYPE
7001 nodes of local TYPE_DECLs in the TREE_TYPE field of the name.
7003 For multiple inheritance, we perform a two-pass depth-first search
7004 of the type lattice. */
7006 void
7008 {
7009 class_stack_node_t csn;
7013 /* Make sure there is enough room for the new entry on the stack. */
7015 {
7017 current_class_stack
7019 current_class_stack_size);
7020 }
7022 /* Insert a new entry on the class stack. */
7029 current_class_depth++;
7031 /* Now set up the new type. */
7037 /* By default, things in classes are private, while things in
7038 structures or unions are public. */
7040 ? access_private_node
7046 {
7047 /* Forcibly remove any old class remnants. */
7049 }
7055 else
7057 }
7059 /* When we exit a toplevel class scope, we save its binding level so
7060 that we can restore it quickly. Here, we've entered some other
7061 class, so we must invalidate our cache. */
7063 void
7065 {
7067 }
7069 /* Get out of the current class scope. If we were in a class scope
7070 previously, that is the one popped to. */
7072 void
7074 {
7077 current_class_depth--;
7083 }
7085 /* Mark the top of the class stack as hidden. */
7087 void
7089 {
7092 }
7094 /* Mark the top of the class stack as un-hidden. */
7096 void
7098 {
7101 }
7103 /* Returns 1 if the class type currently being defined is either T or
7104 a nested type of T. */
7106 bool
7108 {
7116 /* We start looking from 1 because entry 0 is from global scope,
7117 and has no type. */
7119 {
7120 tree c;
7123 else
7124 {
7128 }
7133 }
7135 }
7137 /* If either current_class_type or one of its enclosing classes are derived
7138 from T, return the appropriate type. Used to determine how we found
7139 something via unqualified lookup. */
7141 tree
7143 {
7146 /* The bases of a dependent type are unknown. */
7157 {
7162 }
7165 }
7167 /* Returns the innermost class type which is not a lambda closure type. */
7169 tree
7171 {
7174 /* We start looking from 1 because entry 0 is from global scope,
7175 and has no type. */
7177 {
7178 tree c;
7181 else
7182 {
7186 }
7191 }
7193 }
7195 /* When entering a class scope, all enclosing class scopes' names with
7196 static meaning (static variables, static functions, types and
7197 enumerators) have to be visible. This recursive function calls
7198 pushclass for all enclosing class contexts until global or a local
7199 scope is reached. TYPE is the enclosed class. */
7201 void
7203 {
7204 /* A namespace might be passed in error cases, like A::B:C. */
7212 }
7214 /* Undoes a push_nested_class call. */
7216 void
7218 {
7224 }
7226 /* Returns the number of extern "LANG" blocks we are nested within. */
7228 int
7230 {
7232 }
7234 /* Set global variables CURRENT_LANG_NAME to appropriate value
7235 so that behavior of name-mangling machinery is correct. */
7237 void
7239 {
7243 {
7245 }
7247 {
7249 /* DECL_IGNORED_P is initially set for these types, to avoid clutter.
7250 (See record_builtin_java_type in decl.c.) However, that causes
7251 incorrect debug entries if these types are actually used.
7252 So we re-enable debug output after extern "Java". */
7261 }
7263 {
7265 }
7266 else
7268 }
7270 /* Get out of the current language scope. */
7272 void
7274 {
7276 }
7277 \f
7278 /* Type instantiation routines. */
7280 /* Given an OVERLOAD and a TARGET_TYPE, return the function that
7281 matches the TARGET_TYPE. If there is no satisfactory match, return
7282 error_mark_node, and issue an error & warning messages under
7283 control of FLAGS. Permit pointers to member function if FLAGS
7284 permits. If TEMPLATE_ONLY, the name of the overloaded function was
7285 a template-id, and EXPLICIT_TARGS are the explicitly provided
7286 template arguments.
7288 If OVERLOAD is for one or more member functions, then ACCESS_PATH
7289 is the base path used to reference those member functions. If
7290 the address is resolved to a member function, access checks will be
7291 performed and errors issued if appropriate. */
7293 static tree
7295 tree overload,
7296 tsubst_flags_t flags,
7298 tree explicit_targs,
7299 tree access_path)
7300 {
7301 /* Here's what the standard says:
7303 [over.over]
7305 If the name is a function template, template argument deduction
7306 is done, and if the argument deduction succeeds, the deduced
7307 arguments are used to generate a single template function, which
7308 is added to the set of overloaded functions considered.
7310 Non-member functions and static member functions match targets of
7311 type "pointer-to-function" or "reference-to-function." Nonstatic
7312 member functions match targets of type "pointer-to-member
7313 function;" the function type of the pointer to member is used to
7314 select the member function from the set of overloaded member
7315 functions. If a nonstatic member function is selected, the
7316 reference to the overloaded function name is required to have the
7317 form of a pointer to member as described in 5.3.1.
7319 If more than one function is selected, any template functions in
7320 the set are eliminated if the set also contains a non-template
7321 function, and any given template function is eliminated if the
7322 set contains a second template function that is more specialized
7323 than the first according to the partial ordering rules 14.5.5.2.
7324 After such eliminations, if any, there shall remain exactly one
7325 selected function. */
7328 /* We store the matches in a TREE_LIST rooted here. The functions
7329 are the TREE_PURPOSE, not the TREE_VALUE, in this list, for easy
7330 interoperability with most_specialized_instantiation. */
7332 tree fn;
7333 tree target_fn_type;
7335 /* By the time we get here, we should be seeing only real
7336 pointer-to-member types, not the internal POINTER_TYPE to
7337 METHOD_TYPE representation. */
7343 /* Check that the TARGET_TYPE is reasonable. */
7348 /* This is OK, too. */
7351 /* This is OK, too. This comes from a conversion to reference
7352 type. */
7354 else
7355 {
7361 }
7363 /* Non-member functions and static member functions match targets of type
7364 "pointer-to-function" or "reference-to-function." Nonstatic member
7365 functions match targets of type "pointer-to-member-function;" the
7366 function type of the pointer to member is used to select the member
7367 function from the set of overloaded member functions.
7369 So figure out the FUNCTION_TYPE that we want to match against. */
7372 /* If we can find a non-template function that matches, we can just
7373 use it. There's no point in generating template instantiations
7374 if we're just going to throw them out anyhow. But, of course, we
7375 can only do this when we don't *need* a template function. */
7377 {
7378 tree fns;
7381 {
7385 /* We're not looking for templates just yet. */
7390 /* We're looking for a non-static member, and this isn't
7391 one, or vice versa. */
7394 /* Ignore functions which haven't been explicitly
7395 declared. */
7399 /* See if there's a match. */
7402 }
7403 }
7405 /* Now, if we've already got a match (or matches), there's no need
7406 to proceed to the template functions. But, if we don't have a
7407 match we need to look at them, too. */
7409 {
7410 tree target_arg_types;
7411 tree target_ret_type;
7412 tree fns;
7415 tree arg;
7429 {
7431 tree instantiation;
7432 tree targs;
7435 /* We're only looking for templates. */
7440 /* We're not looking for a non-static member, and this is
7441 one, or vice versa. */
7446 /* If the template has a deduced return type, don't expose it to
7447 template argument deduction. */
7451 /* Try to do argument deduction. */
7458 /* Instantiation failed. */
7461 /* And now force instantiation to do return type deduction. */
7463 {
7469 }
7471 /* See if there's a match. */
7476 }
7478 /* Now, remove all but the most specialized of the matches. */
7480 {
7485 NULL_TREE,
7486 NULL_TREE);
7487 }
7488 }
7490 /* Now we should have exactly one function in MATCHES. */
7492 {
7493 /* There were *no* matches. */
7495 {
7498 target_type);
7501 }
7503 }
7505 {
7506 /* There were too many matches. First check if they're all
7507 the same function. */
7512 /* For multi-versioned functions, more than one match is just fine and
7513 decls_match will return false as they are different. */
7521 {
7523 {
7526 target_type);
7528 /* Since print_candidates expects the functions in the
7529 TREE_VALUE slot, we flip them here. */
7534 }
7537 }
7538 }
7540 /* Good, exactly one match. Now, convert it to the correct type. */
7545 {
7553 {
7556 }
7557 }
7559 /* If a pointer to a function that is multi-versioned is requested, the
7560 pointer to the dispatcher function is returned instead. This works
7561 well because indirectly calling the function will dispatch the right
7562 function version at run-time. */
7564 {
7568 /* Mark all the versions corresponding to the dispatcher as used. */
7571 }
7573 /* If we're doing overload resolution purely for the purpose of
7574 determining conversion sequences, we should not consider the
7575 function used. If this conversion sequence is selected, the
7576 function will be marked as used at this point. */
7578 {
7579 /* Make =delete work with SFINAE. */
7584 }
7586 /* We could not check access to member functions when this
7587 expression was originally created since we did not know at that
7588 time to which function the expression referred. */
7590 {
7593 }
7597 else
7598 {
7599 /* The target must be a REFERENCE_TYPE. Above, cp_build_unary_op
7600 will mark the function as addressed, but here we must do it
7601 explicitly. */
7605 }
7606 }
7608 /* This function will instantiate the type of the expression given in
7609 RHS to match the type of LHSTYPE. If errors exist, then return
7610 error_mark_node. FLAGS is a bit mask. If TF_ERROR is set, then
7611 we complain on errors. If we are not complaining, never modify rhs,
7612 as overload resolution wants to try many possible instantiations, in
7613 the hope that at least one will work.
7615 For non-recursive calls, LHSTYPE should be a function, pointer to
7616 function, or a pointer to member function. */
7618 tree
7620 {
7627 {
7631 }
7634 {
7641 /* Microsoft allows `A::f' to be resolved to a
7642 pointer-to-member. */
7643 ;
7644 else
7645 {
7650 }
7651 }
7654 {
7657 }
7659 /* If we are in a template, and have a NON_DEPENDENT_EXPR, we cannot
7660 deduce any type information. */
7662 {
7666 }
7668 /* There only a few kinds of expressions that may have a type
7669 dependent on overload resolution. */
7675 /* This should really only be used when attempting to distinguish
7676 what sort of a pointer to function we have. For now, any
7677 arithmetic operation which is not supported on pointers
7678 is rejected as an error. */
7681 {
7683 {
7689 /* Do not lose object's side effects. */
7693 }
7700 /* This can happen if we are forming a pointer-to-member for a
7701 member template. */
7704 /* Fall through. */
7707 {
7711 return
7715 }
7719 return
7723 access_path);
7726 {
7731 }
7738 }
7740 }
7741 \f
7742 /* Return the name of the virtual function pointer field
7743 (as an IDENTIFIER_NODE) for the given TYPE. Note that
7744 this may have to look back through base types to find the
7745 ultimate field name. (For single inheritance, these could
7746 all be the same name. Who knows for multiple inheritance). */
7748 static tree
7750 {
7757 {
7763 }
7771 }
7773 void
7775 {
7782 {
7787 }
7788 }
7790 /* Build a dummy reference to ourselves so Derived::Base (and A::A) works,
7791 according to [class]:
7792 The class-name is also inserted
7793 into the scope of the class itself. For purposes of access checking,
7794 the inserted class name is treated as if it were a public member name. */
7796 void
7798 {
7801 tree saved_cas;
7816 }
7818 /* Returns 1 if TYPE contains only padding bytes. */
7820 int
7822 {
7829 /* In G++ 3.2, whether or not a class was empty was determined by
7830 looking at its size. */
7833 else
7835 }
7837 /* Returns true if TYPE contains an empty class. */
7839 static bool
7841 {
7845 {
7846 tree field;
7847 tree binfo;
7848 tree base_binfo;
7860 }
7864 }
7866 /* Returns true if TYPE contains no actual data, just various
7867 possible combinations of empty classes and possibly a vptr. */
7869 bool
7871 {
7873 {
7874 tree field;
7875 tree binfo;
7876 tree base_binfo;
7879 /* CLASSTYPE_EMPTY_P isn't set properly until the class is actually laid
7880 out, but we'd like to be able to check this before then. */
7894 }
7898 }
7900 /* Note that NAME was looked up while the current class was being
7901 defined and that the result of that lookup was DECL. */
7903 void
7905 {
7906 splay_tree names_used;
7908 /* If we're not defining a class, there's nothing to do. */
7914 /* If there's already a binding for this NAME, then we don't have
7915 anything to worry about. */
7928 }
7930 /* Note that NAME was declared (as DECL) in the current class. Check
7931 to see that the declaration is valid. */
7933 void
7935 {
7936 splay_tree names_used;
7937 splay_tree_node n;
7939 /* Look to see if we ever used this name. */
7940 names_used
7944 /* The C language allows members to be declared with a type of the same
7945 name, and the C++ standard says this diagnostic is not required. So
7946 allow it in extern "C" blocks unless predantic is specified.
7947 Allow it in all cases if -ms-extensions is specified. */
7953 {
7954 /* [basic.scope.class]
7956 A name N used in a class S shall refer to the same declaration
7957 in its context and when re-evaluated in the completed scope of
7958 S. */
7962 }
7963 }
7965 /* Returns the VAR_DECL for the complete vtable associated with BINFO.
7966 Secondary vtables are merged with primary vtables; this function
7967 will return the VAR_DECL for the primary vtable. */
7969 tree
7971 {
7972 tree decl;
7976 {
7979 }
7983 }
7986 /* Returns the binfo for the primary base of BINFO. If the resulting
7987 BINFO is a virtual base, and it is inherited elsewhere in the
7988 hierarchy, then the returned binfo might not be the primary base of
7989 BINFO in the complete object. Check BINFO_PRIMARY_P or
7990 BINFO_LOST_PRIMARY_P to be sure. */
7992 static tree
7994 {
7995 tree primary_base;
8002 }
8004 /* If INDENTED_P is zero, indent to INDENT. Return nonzero. */
8006 static int
8008 {
8012 }
8014 /* Dump the offsets of all the bases rooted at BINFO to STREAM.
8015 INDENT should be zero when called from the top level; it is
8016 incremented recursively. IGO indicates the next expected BINFO in
8017 inheritance graph ordering. */
8019 static tree
8022 tree binfo,
8023 tree igo,
8025 {
8027 tree base_binfo;
8035 {
8038 }
8053 {
8057 TFF_PLAIN_IDENTIFIER),
8059 }
8061 {
8064 }
8069 {
8073 {
8077 TFF_PLAIN_IDENTIFIER));
8078 }
8080 {
8084 TFF_PLAIN_IDENTIFIER));
8085 }
8087 {
8091 TFF_PLAIN_IDENTIFIER));
8092 }
8094 {
8098 TFF_PLAIN_IDENTIFIER));
8099 }
8103 }
8109 }
8111 /* Dump the BINFO hierarchy for T. */
8113 static void
8115 {
8127 }
8129 /* Debug interface to hierarchy dumping. */
8131 void
8133 {
8135 }
8137 static void
8139 {
8144 {
8147 }
8148 }
8150 static void
8152 {
8153 tree value;
8155 HOST_WIDE_INT elt;
8163 TFF_PLAIN_IDENTIFIER));
8170 }
8172 static void
8174 {
8182 {
8189 {
8194 }
8198 }
8201 }
8203 static void
8205 {
8213 {
8218 }
8221 }
8223 /* Dump a function or thunk and its thunkees. */
8225 static void
8227 {
8230 tree thunks;
8238 {
8248 else
8254 }
8258 }
8260 /* Dump the thunks for FN. */
8262 void
8264 {
8266 }
8268 /* Virtual function table initialization. */
8270 /* Create all the necessary vtables for T and its base classes. */
8272 static void
8274 {
8275 tree vbase;
8279 /* We lay out the primary and secondary vtables in one contiguous
8280 vtable. The primary vtable is first, followed by the non-virtual
8281 secondary vtables in inheritance graph order. */
8285 /* Then come the virtual bases, also in inheritance graph order. */
8287 {
8291 }
8295 }
8297 /* Initialize the vtable for BINFO with the INITS. */
8299 static void
8301 {
8302 tree decl;
8308 }
8310 /* Build the VTT (virtual table table) for T.
8311 A class requires a VTT if it has virtual bases.
8313 This holds
8314 1 - primary virtual pointer for complete object T
8315 2 - secondary VTTs for each direct non-virtual base of T which requires a
8316 VTT
8317 3 - secondary virtual pointers for each direct or indirect base of T which
8318 has virtual bases or is reachable via a virtual path from T.
8319 4 - secondary VTTs for each direct or indirect virtual base of T.
8321 Secondary VTTs look like complete object VTTs without part 4. */
8323 static void
8325 {
8326 tree type;
8327 tree vtt;
8328 tree index;
8331 /* Build up the initializers for the VTT. */
8336 /* If we didn't need a VTT, we're done. */
8340 /* Figure out the type of the VTT. */
8344 /* Now, build the VTT object itself. */
8347 /* Add the VTT to the vtables list. */
8352 }
8354 /* When building a secondary VTT, BINFO_VTABLE is set to a TREE_LIST with
8355 PURPOSE the RTTI_BINFO, VALUE the real vtable pointer for this binfo,
8356 and CHAIN the vtable pointer for this binfo after construction is
8357 complete. VALUE can also be another BINFO, in which case we recurse. */
8359 static tree
8361 {
8362 tree vt;
8365 {
8371 else
8373 }
8376 }
8378 /* Data for secondary VTT initialization. */
8380 {
8381 /* Is this the primary VTT? */
8384 /* Current index into the VTT. */
8385 tree index;
8387 /* Vector of initializers built up. */
8390 /* The type being constructed by this secondary VTT. */
8391 tree type_being_constructed;
8394 /* Recursively build the VTT-initializer for BINFO (which is in the
8395 hierarchy dominated by T). INITS points to the end of the initializer
8396 list to date. INDEX is the VTT index where the next element will be
8397 replaced. Iff BINFO is the binfo for T, this is the top level VTT (i.e.
8398 not a subvtt for some base of T). When that is so, we emit the sub-VTTs
8399 for virtual bases of T. When it is not so, we build the constructor
8400 vtables for the BINFO-in-T variant. */
8402 static void
8405 {
8407 tree b;
8408 tree init;
8409 secondary_vptr_vtt_init_data data;
8412 /* We only need VTTs for subobjects with virtual bases. */
8416 /* We need to use a construction vtable if this is not the primary
8417 VTT. */
8419 {
8422 /* Record the offset in the VTT where this sub-VTT can be found. */
8424 }
8426 /* Add the address of the primary vtable for the complete object. */
8430 {
8433 }
8436 /* Recursively add the secondary VTTs for non-virtual bases. */
8441 /* Add secondary virtual pointers for all subobjects of BINFO with
8442 either virtual bases or reachable along a virtual path, except
8443 subobjects that are non-virtual primary bases. */
8453 /* data.inits might have grown as we added secondary virtual pointers.
8454 Make sure our caller knows about the new vector. */
8458 /* Add the secondary VTTs for virtual bases in inheritance graph
8459 order. */
8461 {
8466 }
8467 else
8468 /* Remove the ctor vtables we created. */
8470 }
8472 /* Called from build_vtt_inits via dfs_walk. BINFO is the binfo for the base
8473 in most derived. DATA is a SECONDARY_VPTR_VTT_INIT_DATA structure. */
8475 static tree
8477 {
8480 /* We don't care about bases that don't have vtables. */
8484 /* We're only interested in proper subobjects of the type being
8485 constructed. */
8489 /* We're only interested in bases with virtual bases or reachable
8490 via a virtual path from the type being constructed. */
8495 /* We're not interested in non-virtual primary bases. */
8499 /* Record the index where this secondary vptr can be found. */
8501 {
8506 {
8507 /* It's a primary virtual base, and this is not a
8508 construction vtable. Find the base this is primary of in
8509 the inheritance graph, and use that base's vtable
8510 now. */
8513 }
8514 }
8516 /* Add the initializer for the secondary vptr itself. */
8519 /* Advance the vtt index. */
8524 }
8526 /* Called from build_vtt_inits via dfs_walk. After building
8527 constructor vtables and generating the sub-vtt from them, we need
8528 to restore the BINFO_VTABLES that were scribbled on. DATA is the
8529 binfo of the base whose sub vtt was generated. */
8531 static tree
8533 {
8537 /* If this class has no vtable, none of its bases do. */
8541 /* This might be a primary base, so have no vtable in this
8542 hierarchy. */
8545 /* If we scribbled the construction vtable vptr into BINFO, clear it
8546 out now. */
8552 }
8554 /* Build the construction vtable group for BINFO which is in the
8555 hierarchy dominated by T. */
8557 static void
8559 {
8560 tree type;
8561 tree vtbl;
8562 tree id;
8563 tree vbase;
8566 /* See if we've already created this construction vtable group. */
8572 /* Build a version of VTBL (with the wrong type) for use in
8573 constructing the addresses of secondary vtables in the
8574 construction vtable group. */
8577 /* Don't export construction vtables from shared libraries. Even on
8578 targets that don't support hidden visibility, this tells
8579 can_refer_decl_in_current_unit_p not to assume that it's safe to
8580 access from a different compilation unit (bz 54314). */
8588 /* Add the vtables for each of our virtual bases using the vbase in T
8589 binfo. */
8591 vbase;
8593 {
8594 tree b;
8601 }
8603 /* Figure out the type of the construction vtable. */
8610 /* Initialize the construction vtable. */
8614 }
8616 /* Add the vtbl initializers for BINFO (and its bases other than
8617 non-virtual primaries) to the list of INITS. BINFO is in the
8618 hierarchy dominated by T. RTTI_BINFO is the binfo within T of
8619 the constructor the vtbl inits should be accumulated for. (If this
8620 is the complete object vtbl then RTTI_BINFO will be TYPE_BINFO (T).)
8621 ORIG_BINFO is the binfo for this object within BINFO_TYPE (RTTI_BINFO).
8622 BINFO is the active base equivalent of ORIG_BINFO in the inheritance
8623 graph of T. Both BINFO and ORIG_BINFO will have the same BINFO_TYPE,
8624 but are not necessarily the same in terms of layout. */
8626 static void
8628 tree orig_binfo,
8629 tree rtti_binfo,
8630 tree vtbl,
8631 tree t,
8633 {
8635 tree base_binfo;
8640 /* If it doesn't have a vptr, we don't do anything. */
8644 /* If we're building a construction vtable, we're not interested in
8645 subobjects that don't require construction vtables. */
8651 /* Build the initializers for the BINFO-in-T vtable. */
8654 /* Walk the BINFO and its bases. We walk in preorder so that as we
8655 initialize each vtable we can figure out at what offset the
8656 secondary vtable lies from the primary vtable. We can't use
8657 dfs_walk here because we need to iterate through bases of BINFO
8658 and RTTI_BINFO simultaneously. */
8660 {
8661 /* Skip virtual bases. */
8667 inits);
8668 }
8669 }
8671 /* Called from accumulate_vtbl_inits. Adds the initializers for the
8672 BINFO vtable to L. */
8674 static void
8676 tree orig_binfo,
8677 tree rtti_binfo,
8678 tree orig_vtbl,
8679 tree t,
8681 {
8688 {
8689 /* In the hierarchy of BINFO_TYPE (RTTI_BINFO), this is a
8690 primary virtual base. If it is not the same primary in
8691 the hierarchy of T, we'll need to generate a ctor vtable
8692 for it, to place at its location in T. If it is the same
8693 primary, we still need a VTT entry for the vtable, but it
8694 should point to the ctor vtable for the base it is a
8695 primary for within the sub-hierarchy of RTTI_BINFO.
8697 There are three possible cases:
8699 1) We are in the same place.
8700 2) We are a primary base within a lost primary virtual base of
8701 RTTI_BINFO.
8702 3) We are primary to something not a base of RTTI_BINFO. */
8704 tree b;
8707 /* First, look through the bases we are primary to for RTTI_BINFO
8708 or a virtual base. */
8711 {
8716 }
8717 /* If we run out of primary links, keep looking down our
8718 inheritance chain; we might be an indirect primary. */
8722 found:
8724 /* If we found RTTI_BINFO, this is case 1. If we found a virtual
8725 base B and it is a base of RTTI_BINFO, this is case 2. In
8726 either case, we share our vtable with LAST, i.e. the
8727 derived-most base within B of which we are a primary. */
8730 /* Just set our BINFO_VTABLE to point to LAST, as we may not have
8731 set LAST's BINFO_VTABLE yet. We'll extract the actual vptr in
8732 binfo_ctor_vtable after everything's been set up. */
8735 /* Otherwise, this is case 3 and we get our own. */
8736 }
8743 {
8744 tree index;
8747 /* Add the initializer for this vtable. */
8751 /* Figure out the position to which the VPTR should point. */
8757 }
8760 /* For a construction vtable, we can't overwrite BINFO_VTABLE.
8761 So, we make a TREE_LIST. Later, dfs_fixup_binfo_vtbls will
8762 straighten this out. */
8765 /* Throw away any unneeded intializers. */
8767 else
8768 /* For an ordinary vtable, set BINFO_VTABLE. */
8770 }
8774 /* Construct the initializer for BINFO's virtual function table. BINFO
8775 is part of the hierarchy dominated by T. If we're building a
8776 construction vtable, the ORIG_BINFO is the binfo we should use to
8777 find the actual function pointers to put in the vtable - but they
8778 can be overridden on the path to most-derived in the graph that
8779 ORIG_BINFO belongs. Otherwise,
8780 ORIG_BINFO should be the same as BINFO. The RTTI_BINFO is the
8781 BINFO that should be indicated by the RTTI information in the
8782 vtable; it will be a base class of T, rather than T itself, if we
8783 are building a construction vtable.
8785 The value returned is a TREE_LIST suitable for wrapping in a
8786 CONSTRUCTOR to use as the DECL_INITIAL for a vtable. If
8787 NON_FN_ENTRIES_P is not NULL, *NON_FN_ENTRIES_P is set to the
8788 number of non-function entries in the vtable.
8790 It might seem that this function should never be called with a
8791 BINFO for which BINFO_PRIMARY_P holds, the vtable for such a
8792 base is always subsumed by a derived class vtable. However, when
8793 we are building construction vtables, we do build vtables for
8794 primary bases; we need these while the primary base is being
8795 constructed. */
8797 static void
8799 tree orig_binfo,
8800 tree t,
8801 tree rtti_binfo,
8804 {
8805 tree v;
8806 vtbl_init_data vid;
8808 tree vbinfo;
8812 /* Initialize VID. */
8820 /* The first vbase or vcall offset is at index -3 in the vtable. */
8823 /* Add entries to the vtable for RTTI. */
8826 /* Create an array for keeping track of the functions we've
8827 processed. When we see multiple functions with the same
8828 signature, we share the vcall offsets. */
8830 /* Add the vcall and vbase offset entries. */
8833 /* Clear BINFO_VTABLE_PATH_MARKED; it's set by
8834 build_vbase_offset_vtbl_entries. */
8839 /* If the target requires padding between data entries, add that now. */
8841 {
8846 /* Move data entries into their new positions and add padding
8847 after the new positions. Iterate backwards so we don't
8848 overwrite entries that we would need to process later. */
8851 ix--)
8852 {
8860 {
8864 null_pointer_node);
8865 }
8866 }
8867 }
8872 /* The initializers for virtual functions were built up in reverse
8873 order. Straighten them out and add them to the running list in one
8874 step. */
8883 /* Go through all the ordinary virtual functions, building up
8884 initializers. */
8886 {
8887 tree delta;
8888 tree vcall_index;
8895 {
8899 {
8902 }
8904 }
8906 /* If the only definition of this function signature along our
8907 primary base chain is from a lost primary, this vtable slot will
8908 never be used, so just zero it out. This is important to avoid
8909 requiring extra thunks which cannot be generated with the function.
8911 We first check this in update_vtable_entry_for_fn, so we handle
8912 restored primary bases properly; we also need to do it here so we
8913 zero out unused slots in ctor vtables, rather than filling them
8914 with erroneous values (though harmless, apart from relocation
8915 costs). */
8920 {
8921 /* Pull the offset for `this', and the function to call, out of
8922 the list. */
8929 /* You can't call an abstract virtual function; it's abstract.
8930 So, we replace these functions with __pure_virtual. */
8932 {
8935 {
8937 abort_fndecl_addr
8941 }
8942 }
8943 /* Likewise for deleted virtuals. */
8945 {
8954 }
8955 else
8956 {
8958 {
8962 }
8963 /* Take the address of the function, considering it to be of an
8964 appropriate generic type. */
8968 }
8969 }
8971 /* And add it to the chain of initializers. */
8973 {
8978 else
8980 {
8986 }
8987 }
8988 else
8990 }
8991 }
8993 /* Adds to vid->inits the initializers for the vbase and vcall
8994 offsets in BINFO, which is in the hierarchy dominated by T. */
8996 static void
8998 {
8999 tree b;
9001 /* If this is a derived class, we must first create entries
9002 corresponding to the primary base class. */
9007 /* Add the vbase entries for this base. */
9009 /* Add the vcall entries for this base. */
9011 }
9013 /* Returns the initializers for the vbase offset entries in the vtable
9014 for BINFO (which is part of the class hierarchy dominated by T), in
9015 reverse order. VBASE_OFFSET_INDEX gives the vtable index
9016 where the next vbase offset will go. */
9018 static void
9020 {
9021 tree vbase;
9022 tree t;
9023 tree non_primary_binfo;
9025 /* If there are no virtual baseclasses, then there is nothing to
9026 do. */
9032 /* We might be a primary base class. Go up the inheritance hierarchy
9033 until we find the most derived class of which we are a primary base:
9034 it is the offset of that which we need to use. */
9037 {
9038 tree b;
9040 /* If we have reached a virtual base, then it must be a primary
9041 base (possibly multi-level) of vid->binfo, or we wouldn't
9042 have called build_vcall_and_vbase_vtbl_entries for it. But it
9043 might be a lost primary, so just skip down to vid->binfo. */
9045 {
9048 }
9054 }
9056 /* Go through the virtual bases, adding the offsets. */
9058 vbase;
9060 {
9061 tree b;
9062 tree delta;
9067 /* Find the instance of this virtual base in the complete
9068 object. */
9071 /* If we've already got an offset for this virtual base, we
9072 don't need another one. */
9077 /* Figure out where we can find this vbase offset. */
9086 /* The vbase offset had better be the same. */
9089 /* The next vbase will come at a more negative offset. */
9093 /* The initializer is the delta from BINFO to this virtual base.
9094 The vbase offsets go in reverse inheritance-graph order, and
9095 we are walking in inheritance graph order so these end up in
9096 the right order. */
9103 }
9104 }
9106 /* Adds the initializers for the vcall offset entries in the vtable
9107 for BINFO (which is part of the class hierarchy dominated by VID->DERIVED)
9108 to VID->INITS. */
9110 static void
9112 {
9113 /* We only need these entries if this base is a virtual base. We
9114 compute the indices -- but do not add to the vtable -- when
9115 building the main vtable for a class. */
9118 /* If BINFO is RTTI_BINFO, then (since BINFO does not
9119 correspond to VID->DERIVED), we are building a primary
9120 construction virtual table. Since this is a primary
9121 virtual table, we do not need the vcall offsets for
9122 BINFO. */
9124 {
9125 /* We need a vcall offset for each of the virtual functions in this
9126 vtable. For example:
9128 class A { virtual void f (); };
9129 class B1 : virtual public A { virtual void f (); };
9130 class B2 : virtual public A { virtual void f (); };
9131 class C: public B1, public B2 { virtual void f (); };
9133 A C object has a primary base of B1, which has a primary base of A. A
9134 C also has a secondary base of B2, which no longer has a primary base
9135 of A. So the B2-in-C construction vtable needs a secondary vtable for
9136 A, which will adjust the A* to a B2* to call f. We have no way of
9137 knowing what (or even whether) this offset will be when we define B2,
9138 so we store this "vcall offset" in the A sub-vtable and look it up in
9139 a "virtual thunk" for B2::f.
9141 We need entries for all the functions in our primary vtable and
9142 in our non-virtual bases' secondary vtables. */
9144 /* If we are just computing the vcall indices -- but do not need
9145 the actual entries -- not that. */
9148 /* Now, walk through the non-virtual bases, adding vcall offsets. */
9150 }
9151 }
9153 /* Build vcall offsets, starting with those for BINFO. */
9155 static void
9157 {
9159 tree primary_binfo;
9160 tree base_binfo;
9162 /* Don't walk into virtual bases -- except, of course, for the
9163 virtual base for which we are building vcall offsets. Any
9164 primary virtual base will have already had its offsets generated
9165 through the recursion in build_vcall_and_vbase_vtbl_entries. */
9169 /* If BINFO has a primary base, process it first. */
9174 /* Add BINFO itself to the list. */
9177 /* Scan the non-primary bases of BINFO. */
9181 }
9183 /* Called from build_vcall_offset_vtbl_entries_r. */
9185 static void
9187 {
9188 /* Make entries for the rest of the virtuals. */
9190 {
9191 tree orig_fn;
9193 /* The ABI requires that the methods be processed in declaration
9194 order. G++ 3.2 used the order in the vtable. */
9196 orig_fn;
9200 }
9201 else
9202 {
9203 tree derived_virtuals;
9204 tree base_virtuals;
9205 tree orig_virtuals;
9206 /* If BINFO is a primary base, the most derived class which has
9207 BINFO as a primary base; otherwise, just BINFO. */
9208 tree non_primary_binfo;
9210 /* We might be a primary base class. Go up the inheritance hierarchy
9211 until we find the most derived class of which we are a primary base:
9212 it is the BINFO_VIRTUALS there that we need to consider. */
9215 {
9216 tree b;
9218 /* If we have reached a virtual base, then it must be vid->vbase,
9219 because we ignore other virtual bases in
9220 add_vcall_offset_vtbl_entries_r. In turn, it must be a primary
9221 base (possibly multi-level) of vid->binfo, or we wouldn't
9222 have called build_vcall_and_vbase_vtbl_entries for it. But it
9223 might be a lost primary, so just skip down to vid->binfo. */
9225 {
9229 }
9235 }
9238 /* For a ctor vtable we need the equivalent binfo within the hierarchy
9239 where rtti_binfo is the most derived type. */
9240 non_primary_binfo
9246 base_virtuals;
9250 {
9251 tree orig_fn;
9253 /* Find the declaration that originally caused this function to
9254 be present in BINFO_TYPE (binfo). */
9257 /* When processing BINFO, we only want to generate vcall slots for
9258 function slots introduced in BINFO. So don't try to generate
9259 one if the function isn't even defined in BINFO. */
9264 }
9265 }
9266 }
9268 /* Add a vcall offset entry for ORIG_FN to the vtable. */
9270 static void
9272 {
9274 tree vcall_offset;
9275 tree derived_entry;
9277 /* If there is already an entry for a function with the same
9278 signature as FN, then we do not need a second vcall offset.
9279 Check the list of functions already present in the derived
9280 class vtable. */
9282 {
9284 /* We only use one vcall offset for virtual destructors,
9285 even though there are two virtual table entries. */
9289 }
9291 /* If we are building these vcall offsets as part of building
9292 the vtable for the most derived class, remember the vcall
9293 offset. */
9295 {
9298 }
9300 /* The next vcall offset will be found at a more negative
9301 offset. */
9305 /* Keep track of this function. */
9309 {
9310 tree base;
9311 tree fn;
9313 /* Find the overriding function. */
9317 else
9318 {
9321 /* The vbase we're working on is a primary base of
9322 vid->binfo. But it might be a lost primary, so its
9323 BINFO_OFFSET might be wrong, so we just use the
9324 BINFO_OFFSET from vid->binfo. */
9330 vcall_offset);
9331 }
9332 /* Add the initializer to the vtable. */
9334 }
9335 }
9337 /* Return vtbl initializers for the RTTI entries corresponding to the
9338 BINFO's vtable. The RTTI entries should indicate the object given
9339 by VID->rtti_binfo. */
9341 static void
9343 {
9344 tree b;
9345 tree t;
9346 tree offset;
9347 tree decl;
9348 tree init;
9352 /* To find the complete object, we will first convert to our most
9353 primary base, and then add the offset in the vtbl to that value. */
9357 {
9358 tree primary_base;
9364 }
9368 /* The second entry is the address of the typeinfo object. */
9371 else
9374 /* Convert the declaration to a type that can be stored in the
9375 vtable. */
9379 /* Add the offset-to-top entry. It comes earlier in the vtable than
9380 the typeinfo entry. Convert the offset to look like a
9381 function pointer, so that we can put it in the vtable. */
9384 }
9386 /* TRUE iff TYPE is uniquely derived from PARENT. Ignores
9387 accessibility. */
9389 bool
9391 {
9394 }
9396 /* TRUE iff TYPE is publicly & uniquely derived from PARENT. */
9398 bool
9400 {
9404 }
9406 /* CTX1 and CTX2 are declaration contexts. Return the innermost common
9407 class between them, if any. */
9409 tree
9411 {
9423 {
9426 }
9430 }