| blob | 2547b91e0d9ff944f7f55058ea7210c816d2206b |
1 /* Functions related to building classes and their related objects.
2 Copyright (C) 1987-2015 Free Software Foundation, Inc.
3 Contributed by Michael Tiemann (tiemann@cygnus.com)
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
10 any later version.
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
22 /* High-level class interface. */
47 /* The number of nested classes being processed. If we are not in the
48 scope of any class, this is zero. */
52 /* In order to deal with nested classes, we keep a stack of classes.
53 The topmost entry is the innermost class, and is the entry at index
54 CURRENT_CLASS_DEPTH */
57 /* The name of the class. */
58 tree name;
60 /* The _TYPE node for the class. */
61 tree type;
63 /* The access specifier pending for new declarations in the scope of
64 this class. */
65 tree access;
67 /* If were defining TYPE, the names used in this class. */
68 splay_tree names_used;
70 /* Nonzero if this class is no longer open, because of a call to
71 push_to_top_level. */
76 {
77 /* The base for which we're building initializers. */
78 tree binfo;
79 /* The type of the most-derived type. */
80 tree derived;
81 /* The binfo for the dynamic type. This will be TYPE_BINFO (derived),
82 unless ctor_vtbl_p is true. */
83 tree rtti_binfo;
84 /* The negative-index vtable initializers built up so far. These
85 are in order from least negative index to most negative index. */
87 /* The binfo for the virtual base for which we're building
88 vcall offset initializers. */
89 tree vbase;
90 /* The functions in vbase for which we have already provided vcall
91 offsets. */
93 /* The vtable index of the next vcall or vbase offset. */
94 tree index;
95 /* Nonzero if we are building the initializer for the primary
96 vtable. */
98 /* Nonzero if we are building the initializer for a construction
99 vtable. */
101 /* True when adding vcall offset entries to the vtable. False when
102 merely computing the indices. */
106 /* The type of a function passed to walk_subobject_offsets. */
109 /* The stack itself. This is a dynamically resized array. The
110 number of elements allocated is CURRENT_CLASS_STACK_SIZE. */
114 /* The size of the largest empty class seen in this translation unit. */
117 /* An array of all local classes present in this translation unit, in
118 declaration order. */
201 tree *);
211 splay_tree_key k2);
219 /* Variables shared between class.c and call.c. */
229 /* Convert to or from a base subobject. EXPR is an expression of type
230 `A' or `A*', an expression of type `B' or `B*' is returned. To
231 convert A to a base B, CODE is PLUS_EXPR and BINFO is the binfo for
232 the B base instance within A. To convert base A to derived B, CODE
233 is MINUS_EXPR and BINFO is the binfo for the A instance within B.
234 In this latter case, A must not be a morally virtual base of B.
235 NONNULL is true if EXPR is known to be non-NULL (this is only
236 needed when EXPR is of pointer type). CV qualifiers are preserved
237 from EXPR. */
239 tree
241 tree expr,
242 tree binfo,
244 tsubst_flags_t complain)
245 {
248 tree probe;
249 tree offset;
250 tree target_type;
252 tree ptr_target_type;
263 {
269 }
277 {
278 /* This can happen when adjust_result_of_qualified_name_lookup can't
279 find a unique base binfo in a call to a member function. We
280 couldn't give the diagnostic then since we might have been calling
281 a static member function, so we do it now. */
283 {
287 }
289 }
296 /* Nothing to do. */
300 {
302 {
304 {
307 "pointer to derived class %qT because the base is "
309 else
313 }
314 else
315 {
321 else
325 }
326 }
328 }
331 {
333 /* This must happen before the call to save_expr. */
335 }
336 else
342 /* TARGET_TYPE has been extracted from BINFO, and, is therefore always
343 cv-unqualified. Extract the cv-qualifiers from EXPR so that the
344 expression returned matches the input. */
345 target_type = cp_build_qualified_type
349 /* Do we need to look in the vtable for the real offset? */
352 /* Don't bother with the calculations inside sizeof; they'll ICE if the
353 source type is incomplete and the pointer value doesn't matter. In a
354 template (even in instantiate_non_dependent_expr), we don't have vtables
355 set up properly yet, and the value doesn't matter there either; we're
356 just interested in the result of overload resolution. */
359 {
362 }
364 /* If we're in an NSDMI, we don't have the full constructor context yet
365 that we need for converting to a virtual base, so just build a stub
366 CONVERT_EXPR and expand it later in bot_replace. */
369 {
373 }
375 /* Do we need to check for a null pointer? */
377 {
378 /* If we know the conversion will not actually change the value
379 of EXPR, then we can avoid testing the expression for NULL.
380 We have to avoid generating a COMPONENT_REF for a base class
381 field, because other parts of the compiler know that such
382 expressions are always non-NULL. */
386 }
388 /* Protect against multiple evaluation if necessary. */
392 /* Now that we've saved expr, build the real null test. */
394 {
398 }
400 /* If this is a simple base reference, express it as a COMPONENT_REF. */
402 /* We don't build base fields for empty bases, and they aren't very
403 interesting to the optimizers anyway. */
405 {
414 }
417 {
418 /* Going via virtual base V_BINFO. We need the static offset
419 from V_BINFO to BINFO, and the dynamic offset from D_BINFO to
420 V_BINFO. That offset is an entry in D_BINFO's vtable. */
421 tree v_offset;
424 {
425 /* In a base member initializer, we cannot rely on the
426 vtable being set up. We have to indirect via the
427 vtt_parm. */
428 tree t;
434 }
435 else
436 {
439 {
444 }
446 complain),
448 }
456 v_offset);
468 /* Negative fixed_type_p means this is a constructor or destructor;
469 virtual base layout is fixed in in-charge [cd]tors, but not in
470 base [cd]tors. */
474 v_offset,
477 else
479 }
487 {
492 }
493 else
496 indout:
498 {
502 }
504 out:
510 }
512 /* Subroutine of build_base_path; EXPR and BINFO are as in that function.
513 Perform a derived-to-base conversion by recursively building up a
514 sequence of COMPONENT_REFs to the appropriate base fields. */
516 static tree
518 {
521 tree field;
524 {
525 tree temp;
529 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x'
530 into `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only
531 an lvalue in the front end; only _DECLs and _REFs are lvalues
532 in the back end. */
538 }
540 /* Recurse. */
545 /* Is this the base field created by build_base_field? */
549 /* If we're looking for a field in the most-derived class,
550 also check the field offset; we can have two base fields
551 of the same type if one is an indirect virtual base and one
552 is a direct non-virtual base. */
556 {
557 /* We don't use build_class_member_access_expr here, as that
558 has unnecessary checks, and more importantly results in
559 recursive calls to dfs_walk_once. */
567 /* Mark the expression const or volatile, as appropriate.
568 Even though we've dealt with the type above, we still have
569 to mark the expression itself. */
576 }
578 /* Didn't find the base field?!? */
580 }
582 /* Convert OBJECT to the base TYPE. OBJECT is an expression whose
583 type is a class type or a pointer to a class type. In the former
584 case, TYPE is also a class type; in the latter it is another
585 pointer type. If CHECK_ACCESS is true, an error message is emitted
586 if TYPE is inaccessible. If OBJECT has pointer type, the value is
587 assumed to be non-NULL. */
589 tree
591 tsubst_flags_t complain)
592 {
593 tree binfo;
594 tree object_type;
597 {
600 }
601 else
610 }
612 /* EXPR is an expression with unqualified class type. BASE is a base
613 binfo of that class type. Returns EXPR, converted to the BASE
614 type. This function assumes that EXPR is the most derived class;
615 therefore virtual bases can be found at their static offsets. */
617 tree
619 {
620 tree expr_type;
624 {
625 /* If this is a non-empty base, use a COMPONENT_REF. */
629 /* We use fold_build2 and fold_convert below to simplify the trees
630 provided to the optimizers. It is not safe to call these functions
631 when processing a template because they do not handle C++-specific
632 trees. */
640 }
643 }
645 \f
646 tree
648 {
652 /* Can happen in case of duplicate base types (c++/59082). */
656 /* First, convert to the requested type. */
661 /* Second, the requested type may not be the owner of its own vptr.
662 If not, convert to the base class that owns it. We cannot use
663 convert_to_base here, because VCONTEXT may appear more than once
664 in the inheritance hierarchy of TYPE, and thus direct conversion
665 between the types may be ambiguous. Following the path back up
666 one step at a time via primary bases avoids the problem. */
670 {
673 }
676 }
678 /* Given an object INSTANCE, return an expression which yields the
679 vtable element corresponding to INDEX. There are many special
680 cases for INSTANCE which we take care of here, mainly to avoid
681 creating extra tree nodes when we don't have to. */
683 static tree
685 {
686 tree aref;
689 /* Try to figure out what a reference refers to, and
690 access its virtual function table directly. */
698 {
703 }
712 }
714 tree
716 {
720 }
722 /* Given a stable object pointer INSTANCE_PTR, return an expression which
723 yields a function pointer corresponding to vtable element INDEX. */
725 tree
727 {
728 tree aref;
731 tf_warning_or_error),
732 idx);
734 /* When using function descriptors, the address of the
735 vtable entry is treated as a function pointer. */
740 /* Remember this as a method reference, for later devirtualization. */
744 }
746 /* Return the name of the virtual function table (as an IDENTIFIER_NODE)
747 for the given TYPE. */
749 static tree
751 {
753 }
755 /* DECL is an entity associated with TYPE, like a virtual table or an
756 implicitly generated constructor. Determine whether or not DECL
757 should have external or internal linkage at the object file
758 level. This routine does not deal with COMDAT linkage and other
759 similar complexities; it simply sets TREE_PUBLIC if it possible for
760 entities in other translation units to contain copies of DECL, in
761 the abstract. */
763 void
765 {
768 }
770 /* Create a VAR_DECL for a primary or secondary vtable for CLASS_TYPE.
771 (For a secondary vtable for B-in-D, CLASS_TYPE should be D, not B.)
772 Use NAME for the name of the vtable, and VTABLE_TYPE for its type. */
774 static tree
776 {
777 tree decl;
780 /* vtable names are already mangled; give them their DECL_ASSEMBLER_NAME
781 now to avoid confusion in mangle_decl. */
792 /* The vtable has not been defined -- yet. */
796 /* Mark the VAR_DECL node representing the vtable itself as a
797 "gratuitous" one, thereby forcing dwarfout.c to ignore it. It
798 is rather important that such things be ignored because any
799 effort to actually generate DWARF for them will run into
800 trouble when/if we encounter code like:
802 #pragma interface
803 struct S { virtual void member (); };
805 because the artificial declaration of the vtable itself (as
806 manufactured by the g++ front end) will say that the vtable is
807 a static member of `S' but only *after* the debug output for
808 the definition of `S' has already been output. This causes
809 grief because the DWARF entry for the definition of the vtable
810 will try to refer back to an earlier *declaration* of the
811 vtable as a static member of `S' and there won't be one. We
812 might be able to arrange to have the "vtable static member"
813 attached to the member list for `S' before the debug info for
814 `S' get written (which would solve the problem) but that would
815 require more intrusive changes to the g++ front end. */
819 }
821 /* Get the VAR_DECL of the vtable for TYPE. TYPE need not be polymorphic,
822 or even complete. If this does not exist, create it. If COMPLETE is
823 nonzero, then complete the definition of it -- that will render it
824 impossible to actually build the vtable, but is useful to get at those
825 which are known to exist in the runtime. */
827 tree
829 {
830 tree decl;
839 {
842 }
845 }
847 /* Build the primary virtual function table for TYPE. If BINFO is
848 non-NULL, build the vtable starting with the initial approximation
849 that it is the same as the one which is the head of the association
850 list. Returns a nonzero value if a new vtable is actually
851 created. */
853 static int
855 {
856 tree decl;
857 tree virtuals;
862 {
864 /* We have already created a vtable for this base, so there's
865 no need to do it again. */
872 }
873 else
874 {
877 }
880 {
883 }
885 /* Initialize the association list for this type, based
886 on our first approximation. */
891 }
893 /* Give BINFO a new virtual function table which is initialized
894 with a skeleton-copy of its original initialization. The only
895 entry that changes is the `delta' entry, so we can really
896 share a lot of structure.
898 FOR_TYPE is the most derived type which caused this table to
899 be needed.
901 Returns nonzero if we haven't met BINFO before.
903 The order in which vtables are built (by calling this function) for
904 an object must remain the same, otherwise a binary incompatibility
905 can result. */
907 static int
909 {
911 /* We already created a vtable for this base. There's no need to
912 do it again. */
915 /* Remember that we've created a vtable for this BINFO, so that we
916 don't try to do so again. */
919 /* Make fresh virtual list, so we can smash it later. */
922 /* Secondary vtables are laid out as part of the same structure as
923 the primary vtable. */
926 }
928 /* Create a new vtable for BINFO which is the hierarchy dominated by
929 T. Return nonzero if we actually created a new vtable. */
931 static int
933 {
935 /* In this case, it is *type*'s vtable we are modifying. We start
936 with the approximation that its vtable is that of the
937 immediate base class. */
939 else
940 /* This is our very own copy of `basetype' to play with. Later,
941 we will fill in all the virtual functions that override the
942 virtual functions in these base classes which are not defined
943 by the current type. */
945 }
947 /* Make *VIRTUALS, an entry on the BINFO_VIRTUALS list for BINFO
948 (which is in the hierarchy dominated by T) list FNDECL as its
949 BV_FN. DELTA is the required constant adjustment from the `this'
950 pointer where the vtable entry appears to the `this' required when
951 the function is actually called. */
953 static void
955 tree binfo,
956 tree fndecl,
957 tree delta,
959 {
960 tree v;
966 {
967 /* We need a new vtable for BINFO. */
969 {
970 /* If we really did make a new vtable, we also made a copy
971 of the BINFO_VIRTUALS list. Now, we have to find the
972 corresponding entry in that list. */
977 }
982 }
983 }
985 \f
986 /* Add method METHOD to class TYPE. If USING_DECL is non-null, it is
987 the USING_DECL naming METHOD. Returns true if the method could be
988 added to the method vec. */
990 bool
992 {
994 tree overload;
1000 tree current_fns;
1001 tree fns;
1014 {
1015 /* Make a new method vector. We start with 8 entries. We must
1016 allocate at least two (for constructors and destructors), and
1017 we're going to end up with an assignment operator at some
1018 point as well. */
1020 /* Create slots for constructors and destructors. */
1024 }
1026 /* Maintain TYPE_HAS_USER_CONSTRUCTOR, etc. */
1029 /* Constructors and destructors go in special slots. */
1033 {
1037 {
1043 type);
1044 }
1045 }
1046 else
1047 {
1048 tree m;
1051 /* See if we already have an entry with this name. */
1055 {
1058 {
1063 }
1067 {
1070 }
1075 }
1076 }
1079 /* Check to see if we've already got this method. */
1081 {
1083 tree fn_type;
1084 tree method_type;
1085 tree parms1;
1086 tree parms2;
1091 /* [over.load] Member function declarations with the
1092 same name and the same parameter types cannot be
1093 overloaded if any of them is a static member
1094 function declaration.
1096 [over.load] Member function declarations with the same name and
1097 the same parameter-type-list as well as member function template
1098 declarations with the same name, the same parameter-type-list, and
1099 the same template parameter lists cannot be overloaded if any of
1100 them, but not all, have a ref-qualifier.
1102 [namespace.udecl] When a using-declaration brings names
1103 from a base class into a derived class scope, member
1104 functions in the derived class override and/or hide member
1105 functions with the same name and parameter types in a base
1106 class (rather than conflicting). */
1112 /* Compare the quals on the 'this' parm. Don't compare
1113 the whole types, as used functions are treated as
1114 coming from the using class in overload resolution. */
1117 /* Either both or neither need to be ref-qualified for
1118 differing quals to allow overloading. */
1125 /* For templates, the return type and template parameters
1126 must be identical. */
1143 {
1144 /* For function versions, their parms and types match
1145 but they are not duplicates. Record function versions
1146 as and when they are found. extern "C" functions are
1147 not treated as versions. */
1153 {
1154 /* Mark functions as versions if necessary. Modify the mangled
1155 decl name if necessary. */
1157 {
1161 }
1163 {
1167 }
1170 }
1172 {
1174 {
1181 }
1182 /* Otherwise defer to the other function. */
1184 }
1186 {
1188 /* Defer to the local function. */
1190 }
1191 else
1192 {
1195 }
1197 /* We don't call duplicate_decls here to merge the
1198 declarations because that will confuse things if the
1199 methods have inline definitions. In particular, we
1200 will crash while processing the definitions. */
1202 }
1203 }
1205 /* A class should never have more than one destructor. */
1209 /* Add the new binding. */
1211 {
1214 }
1215 else
1224 {
1227 /* We only expect to add few methods in the COMPLETE_P case, so
1228 just make room for one more method in that case. */
1231 else
1237 else
1239 }
1240 else
1241 /* Replace the current slot. */
1244 }
1246 /* Subroutines of finish_struct. */
1248 /* Change the access of FDECL to ACCESS in T. Return 1 if change was
1249 legit, otherwise return 0. */
1251 static int
1253 {
1254 tree elem;
1263 {
1265 {
1269 else
1272 }
1273 else
1274 {
1275 /* They're changing the access to the same thing they changed
1276 it to before. That's OK. */
1277 ;
1278 }
1279 }
1280 else
1281 {
1283 tf_warning_or_error);
1286 }
1288 }
1290 /* Process the USING_DECL, which is a member of T. */
1292 static void
1294 {
1297 tree access
1302 tree old_value;
1307 tf_warning_or_error);
1309 {
1315 else
1317 }
1325 ;
1327 {
1329 /* It's OK to use functions from a base when there are functions with
1331 else
1332 {
1337 }
1338 }
1340 {
1344 }
1346 /* Make type T see field decl FDECL with access ACCESS. */
1349 {
1352 }
1353 else
1355 }
1356 \f
1357 /* Data structure for find_abi_tags_r, below. */
1359 struct abi_tag_data
1360 {
1364 };
1366 /* Subroutine of find_abi_tags_r. Handle a single TAG found on the class TP
1367 in the context of P. TAG can be either an identifier (the DECL_NAME of
1368 a tag NAMESPACE_DECL) or a STRING_CST (a tag attribute). */
1370 static void
1372 {
1374 {
1376 {
1377 /* We're collecting tags from template arguments or from
1378 the type of a variable or function return type. */
1381 /* Don't inherit this tag multiple times. */
1385 {
1386 /* Tags inherited from type template arguments are only used
1387 to avoid warnings. */
1390 }
1391 /* For functions and variables we want to warn, too. */
1392 }
1394 /* Otherwise we're diagnosing missing tags. */
1396 {
1401 }
1403 {
1407 }
1409 {
1414 }
1415 else
1416 {
1420 {
1424 }
1425 }
1426 }
1427 }
1429 /* Find all the ABI tags in the attribute list ATTR and either call
1430 check_tag (if TP is non-null) or set IDENTIFIER_MARKED to val. */
1432 static void
1434 {
1441 {
1446 else
1448 }
1449 }
1451 /* Find all the ABI tags on T and its enclosing scopes and either call
1452 check_tag (if TP is non-null) or set IDENTIFIER_MARKED to val. */
1454 static void
1456 {
1458 {
1459 tree attr;
1461 {
1464 }
1465 else
1466 {
1469 }
1471 }
1472 }
1474 /* walk_tree callback for check_abi_tags: if the type at *TP involves any
1475 types with ABI tags, add the corresponding identifiers to the VEC in
1476 *DATA and set IDENTIFIER_MARKED. */
1478 static tree
1480 {
1484 /* walk_tree shouldn't be walking into any subtrees of a RECORD_TYPE
1485 anyway, but let's make sure of it. */
1493 }
1495 /* walk_tree callback for mark_abi_tags: if *TP is a class, set
1496 IDENTIFIER_MARKED on its ABI tags. */
1498 static tree
1500 {
1504 /* walk_tree shouldn't be walking into any subtrees of a RECORD_TYPE
1505 anyway, but let's make sure of it. */
1513 }
1515 /* Set IDENTIFIER_MARKED on all the ABI tags on T and its enclosing
1516 scopes. */
1518 static void
1520 {
1523 {
1526 {
1527 /* Template arguments are part of the signature. */
1530 {
1533 }
1534 }
1536 /* A function's parameter types are part of the signature, so
1537 we don't need to inherit any tags that are also in them. */
1542 }
1543 }
1545 /* Check that T has all the ABI tags that subobject SUBOB has, or
1546 warn if not. If T is a (variable or function) declaration, also
1547 add any missing tags. */
1549 static void
1551 {
1559 /* No need to worry about things local to this TU. */
1572 {
1576 else
1580 }
1583 }
1585 /* Check that DECL has all the ABI tags that are used in parts of its type
1586 that are not reflected in its mangled name. */
1588 void
1590 {
1596 }
1598 void
1600 {
1610 {
1613 {
1617 }
1618 }
1620 // If we found some tags on our template arguments, add them to our
1621 // abi_tag attribute.
1623 {
1627 else
1631 }
1634 }
1636 /* Return true, iff class T has a non-virtual destructor that is
1637 accessible from outside the class heirarchy (i.e. is public, or
1638 there's a suitable friend. */
1640 static bool
1642 {
1645 /* An implicitly declared destructor is always public. And,
1646 if it were virtual, we would have created it by now. */
1661 }
1663 /* Run through the base classes of T, updating CANT_HAVE_CONST_CTOR_P,
1664 and NO_CONST_ASN_REF_P. Also set flag bits in T based on
1665 properties of the bases. */
1667 static void
1671 {
1675 tree base_binfo;
1676 tree binfo;
1686 {
1695 /* If any base class is non-literal, so is the derived class. */
1699 /* If the base class doesn't have copy constructors or
1700 assignment operators that take const references, then the
1701 derived class cannot have such a member automatically
1702 generated. */
1711 /* A virtual base does not effect nearly emptiness. */
1712 ;
1714 {
1716 /* And if there is more than one nearly empty base, then the
1717 derived class is not nearly empty either. */
1719 else
1720 /* Remember we've seen one. */
1722 }
1724 /* If the base class is not empty or nearly empty, then this
1725 class cannot be nearly empty. */
1728 /* A lot of properties from the bases also apply to the derived
1729 class. */
1746 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT
1749 SET_CLASSTYPE_REF_FIELDS_NEED_INIT
1753 /* A standard-layout class is a class that:
1754 ...
1755 * has no non-standard-layout base classes, */
1758 {
1759 tree basefield;
1760 /* ...has no base classes of the same type as the first non-static
1761 data member... */
1763 && (same_type_ignoring_top_level_qualifiers_p
1766 else
1767 /* ...either has no non-static data members in the most-derived
1768 class and at most one base class with non-static data
1769 members, or has no base classes with non-static data
1770 members */
1774 {
1777 else
1780 }
1781 }
1783 /* Don't bother collecting tm attributes if transactional memory
1784 support is not enabled. */
1786 {
1790 }
1793 }
1795 /* If one of the base classes had TM attributes, and the current class
1796 doesn't define its own, then the current class inherits one. */
1798 {
1801 }
1802 }
1804 /* Determine all the primary bases within T. Sets BINFO_PRIMARY_BASE_P for
1805 those that are primaries. Sets BINFO_LOST_PRIMARY_P for those
1806 that have had a nearly-empty virtual primary base stolen by some
1807 other base in the hierarchy. Determines CLASSTYPE_PRIMARY_BASE for
1808 T. */
1810 static void
1812 {
1816 tree base_binfo;
1818 /* Determine the primary bases of our bases. */
1821 {
1824 /* See if we're the non-virtual primary of our inheritance
1825 chain. */
1827 {
1834 /* We are the primary binfo. */
1836 }
1837 /* Determine if we have a virtual primary base, and mark it so.
1838 */
1840 {
1844 /* Someone already claimed this base. */
1846 else
1847 {
1848 tree delta;
1853 /* A virtual binfo might have been copied from within
1854 another hierarchy. As we're about to use it as a
1855 primary base, make sure the offsets match. */
1863 }
1864 }
1865 }
1867 /* First look for a dynamic direct non-virtual base. */
1869 {
1873 {
1876 }
1877 }
1879 /* A "nearly-empty" virtual base class can be the primary base
1880 class, if no non-virtual polymorphic base can be found. Look for
1881 a nearly-empty virtual dynamic base that is not already a primary
1882 base of something in the hierarchy. If there is no such base,
1883 just pick the first nearly-empty virtual base. */
1889 {
1891 {
1892 /* Found one that is not primary. */
1895 }
1897 /* Remember the first candidate. */
1899 }
1901 found:
1902 /* If we've got a primary base, use it. */
1904 {
1909 /* We are stealing a primary base. */
1913 {
1914 tree delta;
1917 /* A virtual binfo might have been copied from within
1918 another hierarchy. As we're about to use it as a primary
1919 base, make sure the offsets match. */
1924 }
1931 }
1932 }
1934 /* Update the variant types of T. */
1936 void
1938 {
1939 tree variants;
1945 variants;
1947 {
1948 /* These fields are in the _TYPE part of the node, not in
1949 the TYPE_LANG_SPECIFIC component, so they are not shared. */
1959 /* Copy whatever these are holding today. */
1962 }
1963 }
1965 /* Early variant fixups: we apply attributes at the beginning of the class
1966 definition, and we need to fix up any variants that have already been
1967 made via elaborated-type-specifier so that check_qualified_type works. */
1969 void
1971 {
1972 tree variants;
1982 variants;
1984 {
1985 /* These are the two fields that check_qualified_type looks at and
1986 are affected by attributes. */
1991 else
1994 }
1995 }
1996 \f
1997 /* Set memoizing fields and bits of T (and its variants) for later
1998 use. */
2000 static void
2002 {
2003 /* Fix up variants (if any). */
2007 /* For a class w/o baseclasses, 'finish_struct' has set
2008 CLASSTYPE_PURE_VIRTUALS correctly (by definition).
2009 Similarly for a class whose base classes do not have vtables.
2010 When neither of these is true, we might have removed abstract
2011 virtuals (by providing a definition), added some (by declaring
2012 new ones), or redeclared ones from a base class. We need to
2013 recalculate what's really an abstract virtual at this point (by
2014 looking in the vtables). */
2017 /* If this type has a copy constructor or a destructor, force its
2018 mode to be BLKmode, and force its TREE_ADDRESSABLE bit to be
2019 nonzero. This will cause it to be passed by invisible reference
2020 and prevent it from being returned in a register. */
2023 {
2024 tree variants;
2027 {
2030 }
2031 }
2032 }
2034 /* Issue warnings about T having private constructors, but no friends,
2035 and so forth.
2037 HAS_NONPRIVATE_METHOD is nonzero if T has any non-private methods or
2038 static members. HAS_NONPRIVATE_STATIC_FN is nonzero if T has any
2039 non-private static member functions. */
2041 static void
2043 {
2046 tree fn;
2049 /* If the class has friends, those entities might create and
2050 access instances, so we should not warn. */
2053 /* We will have warned when the template was declared; there's
2054 no need to warn on every instantiation. */
2056 /* There's no reason to even consider warning about this
2057 class. */
2060 /* We only issue one warning, if more than one applies, because
2061 otherwise, on code like:
2063 class A {
2064 // Oops - forgot `public:'
2065 A();
2066 A(const A&);
2067 ~A();
2068 };
2070 we warn several times about essentially the same problem. */
2072 /* Check to see if all (non-constructor, non-destructor) member
2073 functions are private. (Since there are no friends or
2074 non-private statics, we can't ever call any of the private member
2075 functions.) */
2077 /* We're not interested in compiler-generated methods; they don't
2078 provide any way to call private members. */
2080 {
2082 {
2084 /* A non-private static member function is just like a
2085 friend; it can create and invoke private member
2086 functions, and be accessed without a class
2087 instance. */
2091 /* Keep searching for a static member function. */
2092 }
2095 }
2098 {
2099 /* There are no non-private methods, and there's at least one
2100 private member function that isn't a constructor or
2101 destructor. (If all the private members are
2102 constructors/destructors we want to use the code below that
2103 issues error messages specifically referring to
2104 constructors/destructors.) */
2110 {
2113 }
2115 {
2119 }
2120 }
2122 /* Even if some of the member functions are non-private, the class
2123 won't be useful for much if all the constructors or destructors
2124 are private: such an object can never be created or destroyed. */
2127 {
2130 t);
2132 }
2134 /* Warn about classes that have private constructors and no friends. */
2136 /* Implicitly generated constructors are always public. */
2139 {
2142 /* If a non-template class does not define a copy
2143 constructor, one is defined for it, enabling it to avoid
2144 this warning. For a template class, this does not
2145 happen, and so we would normally get a warning on:
2147 template <class T> class C { private: C(); };
2149 To avoid this asymmetry, we check TYPE_HAS_COPY_CTOR. All
2150 complete non-template or fully instantiated classes have this
2151 flag set. */
2154 else
2156 {
2158 /* Ideally, we wouldn't count copy constructors (or, in
2159 fact, any constructor that takes an argument of the
2160 class type as a parameter) because such things cannot
2161 be used to construct an instance of the class unless
2162 you already have one. But, for now at least, we're
2163 more generous. */
2165 {
2168 }
2169 }
2172 {
2175 t);
2177 }
2178 }
2179 }
2182 gt_pointer_operator new_value;
2186 /* Comparison function to compare two TYPE_METHOD_VEC entries by name. */
2188 static int
2190 {
2203 }
2205 /* This routine compares two fields like method_name_cmp but using the
2206 pointer operator in resort_field_decl_data. */
2208 static int
2210 {
2219 {
2226 }
2228 }
2230 /* Resort TYPE_METHOD_VEC because pointers have been reordered. */
2232 void
2235 gt_pointer_operator new_value,
2237 {
2241 tree fn;
2243 /* The type conversion ops have to live at the front of the vec, so we
2244 can't sort them. */
2252 {
2256 resort_method_name_cmp);
2257 }
2258 }
2260 /* Warn about duplicate methods in fn_fields.
2262 Sort methods that are not special (i.e., constructors, destructors,
2263 and type conversion operators) so that we can find them faster in
2264 search. */
2266 static void
2268 {
2269 tree fn_fields;
2279 /* Clear DECL_IN_AGGR_P for all functions. */
2284 /* Issue warnings about private constructors and such. If there are
2285 no methods, then some public defaults are generated. */
2288 /* The type conversion ops have to live at the front of the vec, so we
2289 can't sort them. */
2298 }
2300 /* Make BINFO's vtable have N entries, including RTTI entries,
2301 vbase and vcall offsets, etc. Set its type and call the back end
2302 to lay it out. */
2304 static void
2306 {
2307 tree atype;
2308 tree vtable;
2313 /* We may have to grow the vtable. */
2316 {
2320 }
2321 }
2323 /* True iff FNDECL and BASE_FNDECL (both non-static member functions)
2324 have the same signature. */
2326 int
2328 {
2329 /* One destructor overrides another if they are the same kind of
2330 destructor. */
2334 /* But a non-destructor never overrides a destructor, nor vice
2335 versa, nor do different kinds of destructors override
2336 one-another. For example, a complete object destructor does not
2337 override a deleting destructor. */
2346 {
2354 }
2356 }
2358 /* Returns TRUE if DERIVED is a binfo containing the binfo BASE as a
2359 subobject. */
2361 static bool
2363 {
2364 tree probe;
2367 {
2371 /* If we meet a virtual base, we can't follow the inheritance
2372 any more. See if the complete type of DERIVED contains
2373 such a virtual base. */
2376 }
2378 }
2381 /* The function for which we are trying to find a final overrider. */
2382 tree fn;
2383 /* The base class in which the function was declared. */
2384 tree declaring_base;
2385 /* The candidate overriders. */
2386 tree candidates;
2387 /* Path to most derived. */
2391 /* Add the overrider along the current path to FFOD->CANDIDATES.
2392 Returns true if an overrider was found; false otherwise. */
2394 static bool
2398 {
2399 tree method;
2401 /* If BINFO is not the most derived type, try a more derived class.
2402 A definition there will overrider a definition here. */
2404 {
2405 depth--;
2409 }
2413 {
2416 /* Remove any candidates overridden by this new function. */
2418 {
2419 /* If *CANDIDATE overrides METHOD, then METHOD
2420 cannot override anything else on the list. */
2423 /* If METHOD overrides *CANDIDATE, remove *CANDIDATE. */
2426 else
2428 }
2430 /* Add the new function. */
2433 }
2436 }
2438 /* Called from find_final_overrider via dfs_walk. */
2440 static tree
2442 {
2450 }
2452 static tree
2454 {
2459 }
2461 /* Returns a TREE_LIST whose TREE_PURPOSE is the final overrider for
2462 FN and whose TREE_VALUE is the binfo for the base where the
2463 overriding occurs. BINFO (in the hierarchy dominated by the binfo
2464 DERIVED) is the base object in which FN is declared. */
2466 static tree
2468 {
2469 find_final_overrider_data ffod;
2471 /* Getting this right is a little tricky. This is valid:
2473 struct S { virtual void f (); };
2474 struct T { virtual void f (); };
2475 struct U : public S, public T { };
2477 even though calling `f' in `U' is ambiguous. But,
2479 struct R { virtual void f(); };
2480 struct S : virtual public R { virtual void f (); };
2481 struct T : virtual public R { virtual void f (); };
2482 struct U : public S, public T { };
2484 is not -- there's no way to decide whether to put `S::f' or
2485 `T::f' in the vtable for `R'.
2487 The solution is to look at all paths to BINFO. If we find
2488 different overriders along any two, then there is a problem. */
2492 /* Determine the depth of the hierarchy. */
2503 /* If there was no winner, issue an error message. */
2508 }
2510 /* Return the index of the vcall offset for FN when TYPE is used as a
2511 virtual base. */
2513 static tree
2515 {
2517 tree_pair_p p;
2525 /* There should always be an appropriate index. */
2527 }
2529 /* Update an entry in the vtable for BINFO, which is in the hierarchy
2530 dominated by T. FN is the old function; VIRTUALS points to the
2531 corresponding position in the new BINFO_VIRTUALS list. IX is the index
2532 of that entry in the list. */
2534 static void
2537 {
2538 tree b;
2539 tree overrider;
2540 tree delta;
2541 tree virtual_base;
2542 tree first_defn;
2548 /* Find the nearest primary base (possibly binfo itself) which defines
2549 this function; this is the class the caller will convert to when
2550 calling FN through BINFO. */
2552 {
2557 /* The nearest definition is from a lost primary. */
2560 }
2563 /* Find the final overrider. */
2566 {
2569 }
2572 /* Check for adjusting covariant return types. */
2580 /* If the overrider is invalid, don't even try. */
2582 {
2583 /* If FN is a covariant thunk, we must figure out the adjustment
2584 to the final base FN was converting to. As OVERRIDER_TARGET might
2585 also be converting to the return type of FN, we have to
2586 combine the two conversions here. */
2593 {
2597 }
2598 else
2602 /* Find the equivalent binfo within the return type of the
2603 overriding function. We will want the vbase offset from
2604 there. */
2606 over_return);
2609 {
2610 /* There was no existing virtual thunk (which takes
2611 precedence). So find the binfo of the base function's
2612 return type within the overriding function's return type.
2613 We cannot call lookup base here, because we're inside a
2614 dfs_walk, and will therefore clobber the BINFO_MARKED
2615 flags. Fortunately we know the covariancy is valid (it
2616 has already been checked), so we can just iterate along
2617 the binfos, which have been chained in inheritance graph
2618 order. Of course it is lame that we have to repeat the
2619 search here anyway -- we should really be caching pieces
2620 of the vtable and avoiding this repeated work. */
2623 /* Find the base binfo within the overriding function's
2624 return type. We will always find a thunk_binfo, except
2625 when the covariancy is invalid (which we will have
2626 already diagnosed). */
2629 thunk_binfo;
2635 /* See if virtual inheritance is involved. */
2637 virtual_offset;
2644 {
2648 {
2649 /* We convert via virtual base. Adjust the fixed
2650 offset to be from there. */
2651 offset =
2655 }
2657 /* There was an existing fixed offset, this must be
2658 from the base just converted to, and the base the
2659 FN was thunking to. */
2661 else
2663 }
2664 }
2667 /* Replace the overriding function with a covariant thunk. We
2668 will emit the overriding function in its own slot as
2669 well. */
2672 }
2673 else
2677 /* If we need a covariant thunk, then we may need to adjust first_defn.
2678 The ABI specifies that the thunks emitted with a function are
2679 determined by which bases the function overrides, so we need to be
2680 sure that we're using a thunk for some overridden base; even if we
2681 know that the necessary this adjustment is zero, there may not be an
2682 appropriate zero-this-adjusment thunk for us to use since thunks for
2683 overriding virtual bases always use the vcall offset.
2685 Furthermore, just choosing any base that overrides this function isn't
2686 quite right, as this slot won't be used for calls through a type that
2687 puts a covariant thunk here. Calling the function through such a type
2688 will use a different slot, and that slot is the one that determines
2689 the thunk emitted for that base.
2691 So, keep looking until we find the base that we're really overriding
2692 in this slot: the nearest primary base that doesn't use a covariant
2693 thunk in this slot. */
2695 {
2697 /* We already know that the overrider needs a covariant thunk. */
2700 {
2707 }
2709 }
2711 /* Assume that we will produce a thunk that convert all the way to
2712 the final overrider, and not to an intermediate virtual base. */
2715 /* See if we can convert to an intermediate virtual base first, and then
2716 use the vcall offset located there to finish the conversion. */
2718 {
2719 /* If we find the final overrider, then we can stop
2720 walking. */
2725 /* If we find a virtual base, and we haven't yet found the
2726 overrider, then there is a virtual base between the
2727 declaring base (first_defn) and the final overrider. */
2729 {
2732 }
2733 }
2735 /* Compute the constant adjustment to the `this' pointer. The
2736 `this' pointer, when this function is called, will point at BINFO
2737 (or one of its primary bases, which are at the same offset). */
2739 /* The `this' pointer needs to be adjusted from the declaration to
2740 the nearest virtual base. */
2745 /* If the nearest definition is in a lost primary, we don't need an
2746 entry in our vtable. Except possibly in a constructor vtable,
2747 if we happen to get our primary back. In that case, the offset
2748 will be zero, as it will be a primary base. */
2750 else
2751 /* The `this' pointer needs to be adjusted from pointing to
2752 BINFO to pointing at the base where the final overrider
2753 appears. */
2764 else
2768 }
2770 /* Called from modify_all_vtables via dfs_walk. */
2772 static tree
2774 {
2776 tree virtuals;
2777 tree old_virtuals;
2781 /* A base without a vtable needs no modification, and its bases
2782 are uninteresting. */
2787 /* Don't do the primary vtable, if it's new. */
2791 /* There's no need to modify the vtable for a non-virtual primary
2792 base; we're not going to use that vtable anyhow. We do still
2793 need to do this for virtual primary bases, as they could become
2794 non-primary in a construction vtable. */
2799 /* Now, go through each of the virtual functions in the virtual
2800 function table for BINFO. Find the final overrider, and update
2801 the BINFO_VIRTUALS list appropriately. */
2804 virtuals;
2808 binfo,
2813 }
2815 /* Update all of the primary and secondary vtables for T. Create new
2816 vtables as required, and initialize their RTTI information. Each
2817 of the functions in VIRTUALS is declared in T and may override a
2818 virtual function from a base class; find and modify the appropriate
2819 entries to point to the overriding functions. Returns a list, in
2820 declaration order, of the virtual functions that are declared in T,
2821 but do not appear in the primary base class vtable, and which
2822 should therefore be appended to the end of the vtable for T. */
2824 static tree
2826 {
2830 /* Mangle the vtable name before entering dfs_walk (c++/51884). */
2834 /* Update all of the vtables. */
2837 /* Add virtual functions not already in our primary vtable. These
2838 will be both those introduced by this class, and those overridden
2839 from secondary bases. It does not include virtuals merely
2840 inherited from secondary bases. */
2842 {
2847 {
2848 /* We don't need to adjust the `this' pointer when
2849 calling this function. */
2853 /* This is a function not already in our vtable. Keep it. */
2855 }
2856 else
2857 /* We've already got an entry for this function. Skip it. */
2859 }
2862 }
2864 /* Get the base virtual function declarations in T that have the
2865 indicated NAME. */
2867 static void
2869 {
2870 tree methods;
2874 /* Find virtual functions in T with the indicated NAME. */
2879 methods;
2881 {
2886 {
2889 }
2890 }
2896 {
2899 }
2900 }
2902 /* If this declaration supersedes the declaration of
2903 a method declared virtual in the base class, then
2904 mark this field as being virtual as well. */
2906 void
2908 {
2911 /* In [temp.mem] we have:
2913 A specialization of a member function template does not
2914 override a virtual function from a base class. */
2921 /* Set DECL_VINDEX to a value that is neither an INTEGER_CST nor
2922 the error_mark_node so that we know it is an overriding
2923 function. */
2924 {
2931 }
2934 {
2940 }
2945 }
2947 /* Warn about hidden virtual functions that are not overridden in t.
2948 We know that constructors and destructors don't apply. */
2950 static void
2952 {
2954 tree fns;
2957 /* We go through each separately named virtual function. */
2961 {
2962 tree fn;
2963 tree name;
2964 tree fndecl;
2965 tree base_binfo;
2966 tree binfo;
2969 /* All functions in this slot in the CLASSTYPE_METHOD_VEC will
2970 have the same name. Figure out what name that is. */
2972 /* There are no possibly hidden functions yet. */
2974 /* Iterate through all of the base classes looking for possibly
2975 hidden functions. */
2978 {
2981 }
2983 /* If there are no functions to hide, continue. */
2987 /* Remove any overridden functions. */
2989 {
2993 {
2994 /* If the method from the base class has the same
2995 signature as the method from the derived class, it
2996 has been overridden. */
3001 }
3002 }
3004 /* Now give a warning for all base functions without overriders,
3005 as they are hidden. */
3007 tree base_fndecl;
3010 {
3011 /* Here we know it is a hider, and no overrider exists. */
3014 }
3015 }
3016 }
3018 /* Recursive helper for finish_struct_anon. */
3020 static void
3022 {
3026 {
3027 /* We're generally only interested in entities the user
3028 declared, but we also find nested classes by noticing
3029 the TYPE_DECL that we create implicitly. You're
3030 allowed to put one anonymous union inside another,
3031 though, so we explicitly tolerate that. We use
3032 TYPE_ANONYMOUS_P rather than ANON_AGGR_TYPE_P so that
3033 we also allow unnamed types used for defining fields. */
3040 {
3041 /* We already complained about static data members in
3042 finish_static_data_member_decl. */
3044 {
3047 "%q+#D invalid; an anonymous union can "
3049 else
3051 "%q+#D invalid; an anonymous struct can "
3053 }
3055 }
3058 {
3060 {
3064 else
3067 }
3069 {
3073 else
3076 }
3077 }
3082 /* Recurse into the anonymous aggregates to handle correctly
3083 access control (c++/24926):
3085 class A {
3086 union {
3087 union {
3088 int i;
3089 };
3090 };
3091 };
3093 int j=A().i; */
3097 }
3098 }
3100 /* Check for things that are invalid. There are probably plenty of other
3101 things we should check for also. */
3103 static void
3105 {
3107 {
3116 }
3117 }
3119 /* Add T to CLASSTYPE_DECL_LIST of current_class_type which
3120 will be used later during class template instantiation.
3121 When FRIEND_P is zero, T can be a static member data (VAR_DECL),
3122 a non-static member data (FIELD_DECL), a member function
3123 (FUNCTION_DECL), a nested type (RECORD_TYPE, ENUM_TYPE),
3124 a typedef (TYPE_DECL) or a member class template (TEMPLATE_DECL)
3125 When FRIEND_P is nonzero, T is either a friend class
3126 (RECORD_TYPE, TEMPLATE_DECL) or a friend function
3127 (FUNCTION_DECL, TEMPLATE_DECL). */
3129 void
3131 {
3132 /* Save some memory by not creating TREE_LIST if TYPE is not template. */
3137 }
3139 /* This function is called from declare_virt_assop_and_dtor via
3140 dfs_walk_all.
3142 DATA is a type that direcly or indirectly inherits the base
3143 represented by BINFO. If BINFO contains a virtual assignment [copy
3144 assignment or move assigment] operator or a virtual constructor,
3145 declare that function in DATA if it hasn't been already declared. */
3147 static tree
3149 {
3157 /* A base without a vtable needs no modification, and its bases
3158 are uninteresting. */
3162 /* If this is a primary base, then we have already looked at the
3163 virtual functions of its vtable. */
3167 {
3171 {
3176 }
3180 }
3183 }
3185 /* If the class type T has a direct or indirect base that contains a
3186 virtual assignment operator or a virtual destructor, declare that
3187 function in T if it hasn't been already declared. */
3189 static void
3191 {
3199 dfs_declare_virt_assop_and_dtor,
3201 }
3203 /* Declare the inheriting constructor for class T inherited from base
3204 constructor CTOR with the parameter array PARMS of size NPARMS. */
3206 static void
3208 {
3209 /* We don't declare an inheriting ctor that would be a default,
3210 copy or move ctor for derived or base. */
3215 {
3219 }
3228 {
3231 }
3232 }
3234 /* Declare all the inheriting constructors for class T inherited from base
3235 constructor CTOR. */
3237 static void
3239 {
3245 {
3249 }
3252 {
3256 }
3257 }
3259 /* Create default constructors, assignment operators, and so forth for
3260 the type indicated by T, if they are needed. CANT_HAVE_CONST_CTOR,
3261 and CANT_HAVE_CONST_ASSIGNMENT are nonzero if, for whatever reason,
3262 the class cannot have a default constructor, copy constructor
3263 taking a const reference argument, or an assignment operator taking
3264 a const reference, respectively. */
3266 static void
3270 {
3278 /* Destructor. */
3280 {
3281 /* In general, we create destructors lazily. */
3286 /* But if this is a Java class, any non-trivial destructor is
3287 invalid, even if compiler-generated. Therefore, if the
3288 destructor is non-trivial we create it now. */
3290 }
3292 /* [class.ctor]
3294 If there is no user-declared constructor for a class, a default
3295 constructor is implicitly declared. */
3297 {
3302 /* This might force the declaration. */
3304 }
3306 /* [class.ctor]
3308 If a class definition does not explicitly declare a copy
3309 constructor, one is declared implicitly. */
3311 {
3317 }
3319 /* If there is no assignment operator, one will be created if and
3320 when it is needed. For now, just record whether or not the type
3321 of the parameter to the assignment operator will be a const or
3322 non-const reference. */
3324 {
3330 }
3332 /* We can't be lazy about declaring functions that might override
3333 a virtual function from a base class. */
3337 {
3341 {
3342 /* declare, then remove the decl */
3351 }
3352 else
3354 }
3355 }
3357 /* Subroutine of insert_into_classtype_sorted_fields. Recursively
3358 count the number of fields in TYPE, including anonymous union
3359 members. */
3361 static int
3363 {
3364 tree x;
3367 {
3370 else
3372 }
3374 }
3376 /* Subroutine of insert_into_classtype_sorted_fields. Recursively add
3377 all the fields in the TREE_LIST FIELDS to the SORTED_FIELDS_TYPE
3378 elts, starting at offset IDX. */
3380 static int
3382 {
3383 tree x;
3385 {
3388 else
3390 }
3392 }
3394 /* Add all of the enum values of ENUMTYPE, to the FIELD_VEC elts,
3395 starting at offset IDX. */
3397 static int
3401 {
3402 tree values;
3406 }
3408 /* FIELD is a bit-field. We are finishing the processing for its
3409 enclosing type. Issue any appropriate messages and set appropriate
3410 flags. Returns false if an error has been diagnosed. */
3412 static bool
3414 {
3416 tree w;
3418 /* Extract the declared width of the bitfield, which has been
3419 temporarily stashed in DECL_INITIAL. */
3422 /* Remove the bit-field width indicator so that the rest of the
3423 compiler does not treat that value as an initializer. */
3426 /* Detect invalid bit-field type. */
3428 {
3431 }
3432 else
3433 {
3435 /* Avoid the non_lvalue wrapper added by fold for PLUS_EXPRs. */
3438 /* detect invalid field size. */
3444 {
3447 }
3449 {
3452 }
3454 {
3457 }
3469 }
3472 {
3476 }
3477 else
3478 {
3479 /* Non-bit-fields are aligned for their type. */
3483 }
3484 }
3486 /* FIELD is a non bit-field. We are finishing the processing for its
3487 enclosing type T. Issue any appropriate messages and set appropriate
3488 flags. */
3490 static void
3492 tree t,
3496 {
3499 /* In C++98 an anonymous union cannot contain any fields which would change
3500 the settings of CANT_HAVE_CONST_CTOR and friends. */
3502 ;
3503 /* And, we don't set TYPE_HAS_CONST_COPY_CTOR, etc., for anonymous
3504 structs. So, we recurse through their fields here. */
3506 {
3507 tree fields;
3513 }
3514 /* Check members with class type for constructors, destructors,
3515 etc. */
3517 {
3518 /* Never let anything with uninheritable virtuals
3519 make it through without complaint. */
3523 {
3528 field);
3533 field);
3535 {
3539 }
3540 }
3541 else
3542 {
3555 }
3564 }
3569 {
3570 /* `build_class_init_list' does not recognize
3571 non-FIELD_DECLs. */
3575 }
3576 }
3578 /* Check the data members (both static and non-static), class-scoped
3579 typedefs, etc., appearing in the declaration of T. Issue
3580 appropriate diagnostics. Sets ACCESS_DECLS to a list (in
3581 declaration order) of access declarations; each TREE_VALUE in this
3582 list is a USING_DECL.
3584 In addition, set the following flags:
3586 EMPTY_P
3587 The class is empty, i.e., contains no non-static data members.
3589 CANT_HAVE_CONST_CTOR_P
3590 This class cannot have an implicitly generated copy constructor
3591 taking a const reference.
3593 CANT_HAVE_CONST_ASN_REF
3594 This class cannot have an implicitly generated assignment
3595 operator taking a const reference.
3597 All of these flags should be initialized before calling this
3598 function.
3600 Returns a pointer to the end of the TYPE_FIELDs chain; additional
3601 fields can be added by adding to this chain. */
3603 static void
3607 {
3615 /* Assume there are no access declarations. */
3617 /* Assume this class has no pointer members. */
3619 /* Assume none of the members of this class have default
3620 initializations. */
3624 {
3632 {
3633 /* Save the access declarations for our caller. */
3636 }
3642 /* If we've gotten this far, it's a data member, possibly static,
3643 or an enumerator. */
3647 /* When this goes into scope, it will be a non-local reference. */
3652 {
3653 /* [class.union] (C++98)
3655 If a union contains a static data member, or a member of
3656 reference type, the program is ill-formed.
3658 In C++11 this limitation doesn't exist anymore. */
3660 {
3664 }
3666 {
3670 }
3671 }
3673 /* Perform error checking that did not get done in
3674 grokdeclarator. */
3676 {
3680 }
3682 {
3686 }
3694 /* Now it can only be a FIELD_DECL. */
3699 /* If at least one non-static data member is non-literal, the whole
3700 class becomes non-literal. Per Core/1453, volatile non-static
3701 data members and base classes are also not allowed.
3702 Note: if the type is incomplete we will complain later on. */
3707 /* A standard-layout class is a class that:
3708 ...
3709 has the same access control (Clause 11) for all non-static data members,
3710 ... */
3717 /* If this is of reference type, check if it needs an init. */
3719 {
3725 {
3726 /* ARM $12.6.2: [A member initializer list] (or, for an
3727 aggregate, initialization by a brace-enclosed list) is the
3728 only way to initialize nonstatic const and reference
3729 members. */
3732 }
3733 }
3738 {
3740 {
3741 warning
3744 x);
3746 }
3750 }
3753 /* We don't treat zero-width bitfields as making a class
3754 non-empty. */
3755 ;
3756 else
3757 {
3758 /* The class is non-empty. */
3760 /* The class is not even nearly empty. */
3762 /* If one of the data members contains an empty class,
3763 so does T. */
3767 }
3769 /* This is used by -Weffc++ (see below). Warn only for pointers
3770 to members which might hold dynamic memory. So do not warn
3771 for pointers to functions or pointers to members. */
3777 {
3782 }
3788 {
3790 {
3794 }
3796 {
3800 }
3801 }
3804 /* DR 148 now allows pointers to members (which are POD themselves),
3805 to be allowed in POD structs. */
3814 /* We set DECL_C_BIT_FIELD in grokbitfield.
3815 If the type and width are valid, we'll also set DECL_BIT_FIELD. */
3818 cant_have_const_ctor_p,
3819 no_const_asn_ref_p,
3822 /* Now that we've removed bit-field widths from DECL_INITIAL,
3823 anything left in DECL_INITIAL is an NSDMI that makes the class
3824 non-aggregate in C++11. */
3828 /* If any field is const, the structure type is pseudo-const. */
3830 {
3835 {
3836 /* ARM $12.6.2: [A member initializer list] (or, for an
3837 aggregate, initialization by a brace-enclosed list) is the
3838 only way to initialize nonstatic const and reference
3839 members. */
3842 }
3843 }
3844 /* A field that is pseudo-const makes the structure likewise. */
3846 {
3851 }
3853 /* Core issue 80: A nonstatic data member is required to have a
3854 different name from the class iff the class has a
3855 user-declared constructor. */
3859 }
3861 /* Effective C++ rule 11: if a class has dynamic memory held by pointers,
3862 it should also define a copy constructor and an assignment operator to
3863 implement the correct copy semantic (deep vs shallow, etc.). As it is
3864 not feasible to check whether the constructors do allocate dynamic memory
3865 and store it within members, we approximate the warning like this:
3867 -- Warn only if there are members which are pointers
3868 -- Warn only if there is a non-trivial constructor (otherwise,
3869 there cannot be memory allocated).
3870 -- Warn only if there is a non-trivial destructor. We assume that the
3871 user at least implemented the cleanup correctly, and a destructor
3872 is needed to free dynamic memory.
3874 This seems enough for practical purposes. */
3876 && has_pointers
3880 {
3884 {
3889 }
3893 }
3895 /* Non-static data member initializers make the default constructor
3896 non-trivial. */
3898 {
3901 }
3903 /* If any of the fields couldn't be packed, unset TYPE_PACKED. */
3907 /* Check anonymous struct/anonymous union fields. */
3910 /* We've built up the list of access declarations in reverse order.
3911 Fix that now. */
3913 }
3915 /* If TYPE is an empty class type, records its OFFSET in the table of
3916 OFFSETS. */
3918 static int
3920 {
3921 splay_tree_node n;
3926 /* Record the location of this empty object in OFFSETS. */
3934 type,
3938 }
3940 /* Returns nonzero if TYPE is an empty class type and there is
3941 already an entry in OFFSETS for the same TYPE as the same OFFSET. */
3943 static int
3945 {
3946 splay_tree_node n;
3947 tree t;
3952 /* Record the location of this empty object in OFFSETS. */
3962 }
3964 /* Walk through all the subobjects of TYPE (located at OFFSET). Call
3965 F for every subobject, passing it the type, offset, and table of
3966 OFFSETS. If VBASES_P is one, then virtual non-primary bases should
3967 be traversed.
3969 If MAX_OFFSET is non-NULL, then subobjects with an offset greater
3970 than MAX_OFFSET will not be walked.
3972 If F returns a nonzero value, the traversal ceases, and that value
3973 is returned. Otherwise, returns zero. */
3975 static int
3977 subobject_offset_fn f,
3978 tree offset,
3979 splay_tree offsets,
3980 tree max_offset,
3982 {
3986 /* If this OFFSET is bigger than the MAX_OFFSET, then we should
3987 stop. */
3995 {
3998 }
4001 {
4002 tree field;
4003 tree binfo;
4006 /* Avoid recursing into objects that are not interesting. */
4010 /* Record the location of TYPE. */
4015 /* Iterate through the direct base classes of TYPE. */
4019 {
4020 tree binfo_offset;
4025 tree orig_binfo;
4026 /* We cannot rely on BINFO_OFFSET being set for the base
4027 class yet, but the offsets for direct non-virtual
4028 bases can be calculated by going back to the TYPE. */
4031 offset,
4035 f,
4036 binfo_offset,
4037 offsets,
4038 max_offset,
4042 }
4045 {
4049 /* Iterate through the virtual base classes of TYPE. In G++
4050 3.2, we included virtual bases in the direct base class
4051 loop above, which results in incorrect results; the
4052 correct offsets for virtual bases are only known when
4053 working with the most derived type. */
4057 {
4059 f,
4061 offset,
4063 offsets,
4064 max_offset,
4068 }
4069 else
4070 {
4071 /* We still have to walk the primary base, if it is
4072 virtual. (If it is non-virtual, then it was walked
4073 above.) */
4079 {
4080 r = (walk_subobject_offsets
4085 }
4086 }
4087 }
4089 /* Iterate through the fields of TYPE. */
4094 {
4095 tree field_offset;
4100 f,
4102 offset,
4103 field_offset),
4104 offsets,
4105 max_offset,
4109 }
4110 }
4112 {
4115 tree index;
4117 /* Avoid recursing into objects that are not interesting. */
4122 /* Step through each of the elements in the array. */
4126 {
4128 f,
4129 offset,
4130 offsets,
4131 max_offset,
4137 /* If this new OFFSET is bigger than the MAX_OFFSET, then
4138 there's no point in iterating through the remaining
4139 elements of the array. */
4142 }
4143 }
4146 }
4148 /* Record all of the empty subobjects of TYPE (either a type or a
4149 binfo). If IS_DATA_MEMBER is true, then a non-static data member
4150 is being placed at OFFSET; otherwise, it is a base class that is
4151 being placed at OFFSET. */
4153 static void
4155 tree offset,
4156 splay_tree offsets,
4158 {
4159 tree max_offset;
4160 /* If recording subobjects for a non-static data member or a
4161 non-empty base class , we do not need to record offsets beyond
4162 the size of the biggest empty class. Additional data members
4163 will go at the end of the class. Additional base classes will go
4164 either at offset zero (if empty, in which case they cannot
4165 overlap with offsets past the size of the biggest empty class) or
4166 at the end of the class.
4168 However, if we are placing an empty base class, then we must record
4169 all offsets, as either the empty class is at offset zero (where
4170 other empty classes might later be placed) or at the end of the
4171 class (where other objects might then be placed, so other empty
4172 subobjects might later overlap). */
4176 else
4180 }
4182 /* Returns nonzero if any of the empty subobjects of TYPE (located at
4183 OFFSET) conflict with entries in OFFSETS. If VBASES_P is nonzero,
4184 virtual bases of TYPE are examined. */
4186 static int
4188 tree offset,
4189 splay_tree offsets,
4191 {
4192 splay_tree_node max_node;
4194 /* Get the node in OFFSETS that indicates the maximum offset where
4195 an empty subobject is located. */
4197 /* If there aren't any empty subobjects, then there's no point in
4198 performing this check. */
4204 vbases_p);
4205 }
4207 /* DECL is a FIELD_DECL corresponding either to a base subobject of a
4208 non-static data member of the type indicated by RLI. BINFO is the
4209 binfo corresponding to the base subobject, OFFSETS maps offsets to
4210 types already located at those offsets. This function determines
4211 the position of the DECL. */
4213 static void
4215 tree decl,
4216 tree binfo,
4217 splay_tree offsets)
4218 {
4221 tree type;
4224 {
4225 /* For the purposes of determining layout conflicts, we want to
4226 use the class type of BINFO; TREE_TYPE (DECL) will be the
4227 CLASSTYPE_AS_BASE version, which does not contain entries for
4228 zero-sized bases. */
4231 }
4232 else
4233 {
4236 }
4238 /* Try to place the field. It may take more than one try if we have
4239 a hard time placing the field without putting two objects of the
4240 same type at the same address. */
4242 {
4245 /* Place this field. */
4249 /* We have to check to see whether or not there is already
4250 something of the same type at the offset we're about to use.
4251 For example, consider:
4253 struct S {};
4254 struct T : public S { int i; };
4255 struct U : public S, public T {};
4257 Here, we put S at offset zero in U. Then, we can't put T at
4258 offset zero -- its S component would be at the same address
4259 as the S we already allocated. So, we have to skip ahead.
4260 Since all data members, including those whose type is an
4261 empty class, have nonzero size, any overlap can happen only
4262 with a direct or indirect base-class -- it can't happen with
4263 a data member. */
4264 /* In a union, overlap is permitted; all members are placed at
4265 offset zero. */
4270 {
4271 /* Strip off the size allocated to this field. That puts us
4272 at the first place we could have put the field with
4273 proper alignment. */
4276 /* Bump up by the alignment required for the type. */
4277 rli->bitpos
4283 }
4284 else
4285 /* There was no conflict. We're done laying out this field. */
4287 }
4289 /* Now that we know where it will be placed, update its
4290 BINFO_OFFSET. */
4292 /* Indirect virtual bases may have a nonzero BINFO_OFFSET at
4293 this point because their BINFO_OFFSET is copied from another
4294 hierarchy. Therefore, we may not need to add the entire
4295 OFFSET. */
4301 }
4303 /* Returns true if TYPE is empty and OFFSET is nonzero. */
4305 static int
4307 tree offset,
4309 {
4311 }
4313 /* Layout the empty base BINFO. EOC indicates the byte currently just
4314 past the end of the class, and should be correctly aligned for a
4315 class of the type indicated by BINFO; OFFSETS gives the offsets of
4316 the empty bases allocated so far. T is the most derived
4317 type. Return nonzero iff we added it at the end. */
4319 static bool
4322 {
4323 tree alignment;
4327 /* This routine should only be used for empty classes. */
4332 propagate_binfo_offsets
4336 /* This is an empty base class. We first try to put it at offset
4337 zero. */
4340 offsets,
4342 {
4343 /* That didn't work. Now, we move forward from the next
4344 available spot in the class. */
4348 {
4351 offsets,
4353 /* We finally found a spot where there's no overlap. */
4356 /* There's overlap here, too. Bump along to the next spot. */
4358 }
4359 }
4362 {
4367 }
4370 }
4372 /* Layout the base given by BINFO in the class indicated by RLI.
4373 *BASE_ALIGN is a running maximum of the alignments of
4374 any base class. OFFSETS gives the location of empty base
4375 subobjects. T is the most derived type. Return nonzero if the new
4376 object cannot be nearly-empty. A new FIELD_DECL is inserted at
4377 *NEXT_FIELD, unless BINFO is for an empty base class.
4379 Returns the location at which the next field should be inserted. */
4384 {
4389 /* This error is now reported in xref_tag, thus giving better
4390 location information. */
4393 /* Place the base class. */
4395 {
4396 tree decl;
4398 /* The containing class is non-empty because it has a non-empty
4399 base class. */
4402 /* Create the FIELD_DECL. */
4409 {
4417 /* Try to place the field. It may take more than one try if we
4418 have a hard time placing the field without putting two
4419 objects of the same type at the same address. */
4421 /* Add the new FIELD_DECL to the list of fields for T. */
4425 }
4426 }
4427 else
4428 {
4429 tree eoc;
4432 /* On some platforms (ARM), even empty classes will not be
4433 byte-aligned. */
4438 /* A nearly-empty class "has no proper base class that is empty,
4439 not morally virtual, and at an offset other than zero." */
4441 {
4444 /* The check above (used in G++ 3.2) is insufficient because
4445 an empty class placed at offset zero might itself have an
4446 empty base at a nonzero offset. */
4448 empty_base_at_nonzero_offset_p,
4449 size_zero_node,
4454 }
4456 /* We do not create a FIELD_DECL for empty base classes because
4457 it might overlap some other field. We want to be able to
4458 create CONSTRUCTORs for the class by iterating over the
4459 FIELD_DECLs, and the back end does not handle overlapping
4460 FIELD_DECLs. */
4462 /* An empty virtual base causes a class to be non-empty
4463 -- but in that case we do not need to clear CLASSTYPE_EMPTY_P
4464 here because that was already done when the virtual table
4465 pointer was created. */
4466 }
4468 /* Record the offsets of BINFO and its base subobjects. */
4471 offsets,
4475 }
4477 /* Layout all of the non-virtual base classes. Record empty
4478 subobjects in OFFSETS. T is the most derived type. Return nonzero
4479 if the type cannot be nearly empty. The fields created
4480 corresponding to the base classes will be inserted at
4481 *NEXT_FIELD. */
4483 static void
4486 {
4487 /* Chain to hold all the new FIELD_DECLs which stand in for base class
4488 subobjects. */
4493 /* The primary base class is always allocated first. */
4498 /* Now allocate the rest of the bases. */
4500 {
4501 tree base_binfo;
4505 /* The primary base was already allocated above, so we don't
4506 need to allocate it again here. */
4510 /* Virtual bases are added at the end (a primary virtual base
4511 will have already been added). */
4517 }
4518 }
4520 /* Go through the TYPE_METHODS of T issuing any appropriate
4521 diagnostics, figuring out which methods override which other
4522 methods, and so forth. */
4524 static void
4526 {
4527 tree x;
4530 {
4534 /* The name of the field is the original field name
4535 Save this in auxiliary field for later overloading. */
4537 {
4541 }
4542 /* All user-provided destructors are non-trivial.
4543 Constructors and assignment ops are handled in
4544 grok_special_member_properties. */
4547 }
4548 }
4550 /* FN is a constructor or destructor. Clone the declaration to create
4551 a specialized in-charge or not-in-charge version, as indicated by
4552 NAME. */
4554 static tree
4556 {
4557 tree parms;
4558 tree clone;
4560 /* Copy the function. */
4562 /* Reset the function name. */
4564 /* Remember where this function came from. */
4566 /* Make it easy to find the CLONE given the FN. */
4570 /* If this is a template, do the rest on the DECL_TEMPLATE_RESULT. */
4572 {
4579 }
4583 /* There's no pending inline data for this function. */
4587 /* The base-class destructor is not virtual. */
4589 {
4593 }
4595 /* If there was an in-charge parameter, drop it from the function
4596 type. */
4598 {
4599 tree basetype;
4600 tree parmtypes;
4601 tree exceptions;
4606 /* Skip the `this' parameter. */
4608 /* Skip the in-charge parameter. */
4610 /* And the VTT parm, in a complete [cd]tor. */
4614 /* If this is subobject constructor or destructor, add the vtt
4615 parameter. */
4619 parmtypes);
4622 exceptions);
4626 }
4628 /* Copy the function parameters. */
4630 /* Remove the in-charge parameter. */
4632 {
4636 }
4637 /* And the VTT parm, in a complete [cd]tor. */
4639 {
4642 else
4643 {
4647 }
4648 }
4651 {
4654 }
4656 /* Create the RTL for this function. */
4664 }
4666 /* Implementation of DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P, do
4667 not invoke this function directly.
4669 For a non-thunk function, returns the address of the slot for storing
4670 the function it is a clone of. Otherwise returns NULL_TREE.
4672 If JUST_TESTING, looks through TEMPLATE_DECL and returns NULL if
4673 cloned_function is unset. This is to support the separate
4674 DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P modes; using the latter
4675 on a template makes sense, but not the former. */
4677 tree *
4679 {
4687 {
4688 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4691 else
4692 #endif
4694 }
4699 else
4701 }
4703 /* Produce declarations for all appropriate clones of FN. If
4704 UPDATE_METHOD_VEC_P is nonzero, the clones are added to the
4705 CLASTYPE_METHOD_VEC as well. */
4707 void
4709 {
4710 tree clone;
4712 /* Avoid inappropriate cloning. */
4718 {
4719 /* For each constructor, we need two variants: an in-charge version
4720 and a not-in-charge version. */
4727 }
4728 else
4729 {
4732 /* For each destructor, we need three variants: an in-charge
4733 version, a not-in-charge version, and an in-charge deleting
4734 version. We clone the deleting version first because that
4735 means it will go second on the TYPE_METHODS list -- and that
4736 corresponds to the correct layout order in the virtual
4737 function table.
4739 For a non-virtual destructor, we do not build a deleting
4740 destructor. */
4742 {
4746 }
4753 }
4755 /* Note that this is an abstract function that is never emitted. */
4757 }
4759 /* DECL is an in charge constructor, which is being defined. This will
4760 have had an in class declaration, from whence clones were
4761 declared. An out-of-class definition can specify additional default
4762 arguments. As it is the clones that are involved in overload
4763 resolution, we must propagate the information from the DECL to its
4764 clones. */
4766 void
4768 {
4769 tree clone;
4773 {
4780 /* Skip the 'this' parameter. */
4796 {
4801 {
4802 /* A default parameter has been added. Adjust the
4803 clone's parameters. */
4807 tree type;
4812 {
4815 clone_parms);
4817 }
4820 clone_parms);
4829 }
4830 }
4832 }
4833 }
4835 /* For each of the constructors and destructors in T, create an
4836 in-charge and not-in-charge variant. */
4838 static void
4840 {
4841 tree fns;
4843 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
4844 out now. */
4852 }
4854 /* Deduce noexcept for a destructor DTOR. */
4856 void
4858 {
4860 {
4863 }
4864 }
4866 /* For each destructor in T, deduce noexcept:
4868 12.4/3: A declaration of a destructor that does not have an
4869 exception-specification is implicitly considered to have the
4870 same exception-specification as an implicit declaration (15.4). */
4872 static void
4874 {
4875 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
4876 out now. */
4882 }
4884 /* Subroutine of set_one_vmethod_tm_attributes. Search base classes
4885 of TYPE for virtual functions which FNDECL overrides. Return a
4886 mask of the tm attributes found therein. */
4888 static int
4890 {
4892 tree base_binfo;
4896 {
4906 else
4908 }
4911 }
4913 /* Subroutine of set_method_tm_attributes. Handle the checks and
4914 inheritance for one virtual method FNDECL. */
4916 static void
4918 {
4919 tree tm_attr;
4924 /* If FNDECL doesn't actually override anything (i.e. T is the
4925 class that first declares FNDECL virtual), then we're done. */
4932 /* Intel STM Language Extension 3.0, Section 4.2 table 4:
4933 tm_pure must match exactly, otherwise no weakening of
4934 tm_safe > tm_callable > nothing. */
4935 /* ??? The tm_pure attribute didn't make the transition to the
4936 multivendor language spec. */
4938 {
4940 {
4943 }
4944 }
4945 /* If the overridden function is tm_pure, then FNDECL must be. */
4948 /* Look for base class combinations that cannot be satisfied. */
4950 {
4956 }
4957 /* If FNDECL did not declare an attribute, then inherit the most
4958 restrictive one. */
4960 {
4962 }
4963 /* Otherwise validate that we're not weaker than a function
4964 that is being overridden. */
4965 else
4966 {
4970 }
4973 err_override:
4977 }
4979 /* For each of the methods in T, propagate a class-level tm attribute. */
4981 static void
4983 {
4986 /* Don't bother collecting tm attributes if transactional memory
4987 support is not enabled. */
4991 /* Process virtual methods first, as they inherit directly from the
4992 base virtual function and also require validation of new attributes. */
4994 {
4995 tree vchain;
4998 {
5003 }
5004 }
5006 /* If the class doesn't have an attribute, nothing more to do. */
5011 /* Any method that does not yet have a tm attribute inherits
5012 the one from the class. */
5014 {
5017 }
5018 }
5020 /* Returns true iff class T has a user-defined constructor other than
5021 the default constructor. */
5023 bool
5025 {
5026 tree fns;
5032 {
5039 }
5042 }
5044 /* Returns the defaulted constructor if T has one. Otherwise, returns
5045 NULL_TREE. */
5047 tree
5049 {
5056 {
5060 {
5066 }
5067 }
5070 }
5072 /* Returns true iff FN is a user-provided function, i.e. user-declared
5073 and not defaulted at its first declaration; or explicit, private,
5074 protected, or non-const. */
5076 bool
5078 {
5081 else
5085 }
5087 /* Returns true iff class T has a user-provided constructor. */
5089 bool
5091 {
5092 tree fns;
5100 /* This can happen in error cases; avoid crashing. */
5109 }
5111 /* Returns true iff class T has a non-user-provided (i.e. implicitly
5112 declared or explicitly defaulted in the class body) default
5113 constructor. */
5115 bool
5117 {
5118 tree fns;
5126 {
5132 }
5135 }
5137 /* TYPE is being used as a virtual base, and has a non-trivial move
5138 assignment. Return true if this is due to there being a user-provided
5139 move assignment in TYPE or one of its subobjects; if there isn't, then
5140 multiple move assignment can't cause any harm. */
5142 bool
5144 {
5145 /* Does the type itself have a user-provided move assignment operator? */
5149 {
5153 }
5155 /* Do any of its bases? */
5157 tree base_binfo;
5162 /* Or non-static data members? */
5164 {
5169 }
5171 /* Seems not. */
5173 }
5175 /* If default-initialization leaves part of TYPE uninitialized, returns
5176 a DECL for the field or TYPE itself (DR 253). */
5178 tree
5180 {
5191 {
5195 }
5200 {
5204 }
5207 }
5209 /* Returns true iff for class T, a trivial synthesized default constructor
5210 would be constexpr. */
5212 bool
5214 {
5215 /* A defaulted trivial default constructor is constexpr
5216 if there is nothing to initialize. */
5219 }
5221 /* Returns true iff class T has a constexpr default constructor. */
5223 bool
5225 {
5226 tree fns;
5229 {
5230 /* The caller should have stripped an enclosing array. */
5233 }
5235 {
5238 /* Non-trivial, we need to check subobject constructors. */
5240 }
5243 }
5245 /* Returns true iff class TYPE has a virtual destructor. */
5247 bool
5249 {
5250 tree dtor;
5258 }
5260 /* Returns true iff class T has a move constructor. */
5262 bool
5264 {
5265 tree fns;
5268 {
5271 }
5281 }
5283 /* Returns true iff class T has a move assignment operator. */
5285 bool
5287 {
5288 tree fns;
5291 {
5294 }
5302 }
5304 /* Returns true iff class T has a move constructor that was explicitly
5305 declared in the class body. Note that this is different from
5306 "user-provided", which doesn't include functions that are defaulted in
5307 the class. */
5309 bool
5311 {
5312 tree fns;
5321 {
5325 }
5328 }
5330 /* Returns true iff class T has a move assignment operator that was
5331 explicitly declared in the class body. */
5333 bool
5335 {
5336 tree fns;
5343 {
5347 }
5350 }
5352 /* Nonzero if we need to build up a constructor call when initializing an
5353 object of this class, either because it has a user-declared constructor
5354 or because it doesn't have a default constructor (so we need to give an
5355 error if no initializer is provided). Use TYPE_NEEDS_CONSTRUCTING when
5356 what you care about is whether or not an object can be produced by a
5357 constructor (e.g. so we don't set TREE_READONLY on const variables of
5358 such type); use this function when what you care about is whether or not
5359 to try to call a constructor to create an object. The latter case is
5360 the former plus some cases of constructors that cannot be called. */
5362 bool
5364 {
5365 tree inner;
5375 /* A user-declared constructor might be private, and a constructor might
5376 be trivial but deleted. */
5379 {
5384 }
5386 }
5388 /* Like type_build_ctor_call, but for destructors. */
5390 bool
5392 {
5393 tree inner;
5402 /* A user-declared destructor might be private, and a destructor might
5403 be trivial but deleted. */
5406 {
5411 }
5413 }
5415 /* Remove all zero-width bit-fields from T. */
5417 static void
5419 {
5424 {
5427 /* We should not be confused by the fact that grokbitfield
5428 temporarily sets the width of the bit field into
5429 DECL_INITIAL (*fieldsp).
5430 check_bitfield_decl eventually sets DECL_SIZE (*fieldsp)
5431 to that width. */
5435 else
5437 }
5438 }
5440 /* Returns TRUE iff we need a cookie when dynamically allocating an
5441 array whose elements have the indicated class TYPE. */
5443 static bool
5445 {
5446 tree fns;
5451 /* If there's a non-trivial destructor, we need a cookie. In order
5452 to iterate through the array calling the destructor for each
5453 element, we'll have to know how many elements there are. */
5457 /* If the usual deallocation function is a two-argument whose second
5458 argument is of type `size_t', then we have to pass the size of
5459 the array to the deallocation function, so we will need to store
5460 a cookie. */
5464 /* If there are no `operator []' members, or the lookup is
5465 ambiguous, then we don't need a cookie. */
5468 /* Loop through all of the functions. */
5470 {
5471 tree fn;
5472 tree second_parm;
5474 /* Select the current function. */
5476 /* See if this function is a one-argument delete function. If
5477 it is, then it will be the usual deallocation function. */
5481 /* Do not consider this function if its second argument is an
5482 ellipsis. */
5485 /* Otherwise, if we have a two-argument function and the second
5486 argument is `size_t', it will be the usual deallocation
5487 function -- unless there is one-argument function, too. */
5491 }
5494 }
5496 /* Finish computing the `literal type' property of class type T.
5498 At this point, we have already processed base classes and
5499 non-static data members. We need to check whether the copy
5500 constructor is trivial, the destructor is trivial, and there
5501 is a trivial default constructor or at least one constexpr
5502 constructor other than the copy constructor. */
5504 static void
5506 {
5507 tree fn;
5523 {
5526 {
5530 }
5531 }
5532 }
5534 /* T is a non-literal type used in a context which requires a constant
5535 expression. Explain why it isn't literal. */
5537 void
5539 {
5549 /* Already explained. */
5558 {
5560 "default constructor, and has no constexpr constructor that "
5563 {
5564 /* Note that we can't simply call locate_ctor because when the
5565 constructor is deleted it just returns NULL_TREE. */
5566 tree fns;
5568 {
5575 {
5578 else
5581 }
5582 }
5583 }
5584 }
5585 else
5586 {
5590 {
5593 {
5598 }
5599 }
5601 {
5602 tree ftype;
5607 {
5612 }
5616 }
5617 }
5618 }
5620 /* Check the validity of the bases and members declared in T. Add any
5621 implicitly-generated functions (like copy-constructors and
5622 assignment operators). Compute various flag bits (like
5623 CLASSTYPE_NON_LAYOUT_POD_T) for T. This routine works purely at the C++
5624 level: i.e., independently of the ABI in use. */
5626 static void
5628 {
5629 /* Nonzero if the implicitly generated copy constructor should take
5630 a non-const reference argument. */
5632 /* Nonzero if the implicitly generated assignment operator
5633 should take a non-const reference argument. */
5635 tree access_decls;
5638 tree fn;
5640 /* By default, we use const reference arguments and generate default
5641 constructors. */
5645 /* Check all the base-classes. */
5649 /* Deduce noexcept on destructors. This needs to happen after we've set
5650 triviality flags appropriately for our bases. */
5654 /* Check all the method declarations. */
5657 /* Save the initial values of these flags which only indicate whether
5658 or not the class has user-provided functions. As we analyze the
5659 bases and members we can set these flags for other reasons. */
5663 /* Check all the data member declarations. We cannot call
5664 check_field_decls until we have called check_bases check_methods,
5665 as check_field_decls depends on TYPE_HAS_NONTRIVIAL_DESTRUCTOR
5666 being set appropriately. */
5671 /* A nearly-empty class has to be vptr-containing; a nearly empty
5672 class contains just a vptr. */
5676 /* Do some bookkeeping that will guide the generation of implicitly
5677 declared member functions. */
5680 /* We need to call a constructor for this class if it has a
5681 user-provided constructor, or if the default constructor is going
5682 to initialize the vptr. (This is not an if-and-only-if;
5683 TYPE_NEEDS_CONSTRUCTING is set elsewhere if bases or members
5684 themselves need constructing.) */
5687 /* [dcl.init.aggr]
5689 An aggregate is an array or a class with no user-provided
5690 constructors ... and no virtual functions.
5692 Again, other conditions for being an aggregate are checked
5693 elsewhere. */
5696 /* This is the C++98/03 definition of POD; it changed in C++0x, but we
5697 retain the old definition internally for ABI reasons. */
5706 /* If the only explicitly declared default constructor is user-provided,
5707 set TYPE_HAS_COMPLEX_DFLT. */
5713 /* Warn if a public base of a polymorphic type has an accessible
5714 non-virtual destructor. It is only now that we know the class is
5715 polymorphic. Although a polymorphic base will have a already
5716 been diagnosed during its definition, we warn on use too. */
5718 {
5721 tree base_binfo;
5725 {
5733 basetype);
5734 }
5735 }
5737 /* If the class has no user-declared constructor, but does have
5738 non-static const or reference data members that can never be
5739 initialized, issue a warning. */
5741 /* Classes with user-declared constructors are presumed to
5742 initialize these members. */
5744 /* Aggregates can be initialized with brace-enclosed
5745 initializers. */
5747 {
5748 tree field;
5751 {
5752 tree type;
5767 }
5768 }
5770 /* Synthesize any needed methods. */
5772 cant_have_const_ctor,
5773 no_const_asn_ref);
5775 /* Check defaulted declarations here so we have cant_have_const_ctor
5776 and don't need to worry about clones. */
5779 {
5782 {
5783 bool imp_const_p
5789 /* If the function is defaulted outside the class, we just
5790 give the synthesis error. */
5793 }
5795 }
5798 {
5799 /* "This class type is not an aggregate." */
5801 }
5803 /* Compute the 'literal type' property before we
5804 do anything with non-static member functions. */
5807 /* Create the in-charge and not-in-charge variants of constructors
5808 and destructors. */
5811 /* Process the using-declarations. */
5815 /* Build and sort the CLASSTYPE_METHOD_VEC. */
5818 /* Figure out whether or not we will need a cookie when dynamically
5819 allocating an array of this type. */
5822 }
5824 /* If T needs a pointer to its virtual function table, set TYPE_VFIELD
5825 accordingly. If a new vfield was created (because T doesn't have a
5826 primary base class), then the newly created field is returned. It
5827 is not added to the TYPE_FIELDS list; it is the caller's
5828 responsibility to do that. Accumulate declared virtual functions
5829 on VIRTUALS_P. */
5831 static tree
5833 {
5834 tree fn;
5836 /* Collect the virtual functions declared in T. */
5841 {
5850 }
5852 /* If we couldn't find an appropriate base class, create a new field
5853 here. Even if there weren't any new virtual functions, we might need a
5854 new virtual function table if we're supposed to include vptrs in
5855 all classes that need them. */
5857 {
5858 /* We build this decl with vtbl_ptr_type_node, which is a
5859 `vtable_entry_type*'. It might seem more precise to use
5860 `vtable_entry_type (*)[N]' where N is the number of virtual
5861 functions. However, that would require the vtable pointer in
5862 base classes to have a different type than the vtable pointer
5863 in derived classes. We could make that happen, but that
5864 still wouldn't solve all the problems. In particular, the
5865 type-based alias analysis code would decide that assignments
5866 to the base class vtable pointer can't alias assignments to
5867 the derived class vtable pointer, since they have different
5868 types. Thus, in a derived class destructor, where the base
5869 class constructor was inlined, we could generate bad code for
5870 setting up the vtable pointer.
5872 Therefore, we use one type for all vtable pointers. We still
5873 use a type-correct type; it's just doesn't indicate the array
5874 bounds. That's better than using `void*' or some such; it's
5875 cleaner, and it let's the alias analysis code know that these
5876 stores cannot alias stores to void*! */
5877 tree field;
5890 /* This class is non-empty. */
5894 }
5897 }
5899 /* Add OFFSET to all base types of BINFO which is a base in the
5900 hierarchy dominated by T.
5902 OFFSET, which is a type offset, is number of bytes. */
5904 static void
5906 {
5908 tree primary_binfo;
5909 tree base_binfo;
5911 /* Update BINFO's offset. */
5916 offset));
5918 /* Find the primary base class. */
5924 /* Scan all of the bases, pushing the BINFO_OFFSET adjust
5925 downwards. */
5927 {
5928 /* Don't do the primary base twice. */
5936 }
5937 }
5939 /* Set BINFO_OFFSET for all of the virtual bases for RLI->T. Update
5940 TYPE_ALIGN and TYPE_SIZE for T. OFFSETS gives the location of
5941 empty subobjects of T. */
5943 static void
5945 {
5946 tree vbase;
5953 /* Find the last field. The artificial fields created for virtual
5954 bases will go after the last extant field to date. */
5959 /* Go through the virtual bases, allocating space for each virtual
5960 base that is not already a primary base class. These are
5961 allocated in inheritance graph order. */
5963 {
5968 {
5969 /* This virtual base is not a primary base of any class in the
5970 hierarchy, so we have to add space for it. */
5973 }
5974 }
5975 }
5977 /* Returns the offset of the byte just past the end of the base class
5978 BINFO. */
5980 static tree
5982 {
5983 tree size;
5988 /* An empty class has zero CLASSTYPE_SIZE_UNIT, but we need to
5989 allocate some space for it. It cannot have virtual bases, so
5990 TYPE_SIZE_UNIT is fine. */
5992 else
5996 }
5998 /* Returns the offset of the byte just past the end of the base class
5999 with the highest offset in T. If INCLUDE_VIRTUALS_P is zero, then
6000 only non-virtual bases are included. */
6002 static tree
6004 {
6007 tree binfo;
6008 tree base_binfo;
6009 tree offset;
6014 {
6024 }
6029 {
6033 }
6036 }
6038 /* Warn about bases of T that are inaccessible because they are
6039 ambiguous. For example:
6041 struct S {};
6042 struct T : public S {};
6043 struct U : public S, public T {};
6045 Here, `(S*) new U' is not allowed because there are two `S'
6046 subobjects of U. */
6048 static void
6050 {
6053 tree basetype;
6054 tree binfo;
6055 tree base_binfo;
6057 /* If there are no repeated bases, nothing can be ambiguous. */
6061 /* Check direct bases. */
6064 {
6070 }
6072 /* Check for ambiguous virtual bases. */
6076 {
6082 }
6083 }
6085 /* Compare two INTEGER_CSTs K1 and K2. */
6087 static int
6089 {
6091 }
6093 /* Increase the size indicated in RLI to account for empty classes
6094 that are "off the end" of the class. */
6096 static void
6098 {
6099 tree eoc;
6100 tree rli_size;
6102 /* It might be the case that we grew the class to allocate a
6103 zero-sized base class. That won't be reflected in RLI, yet,
6104 because we are willing to overlay multiple bases at the same
6105 offset. However, now we need to make sure that RLI is big enough
6106 to reflect the entire class. */
6112 {
6113 /* The size should have been rounded to a whole byte. */
6116 rli->bitpos
6125 }
6126 }
6128 /* Calculate the TYPE_SIZE, TYPE_ALIGN, etc for T. Calculate
6129 BINFO_OFFSETs for all of the base-classes. Position the vtable
6130 pointer. Accumulate declared virtual functions on VIRTUALS_P. */
6132 static void
6134 {
6135 tree non_static_data_members;
6136 tree field;
6137 tree vptr;
6138 record_layout_info rli;
6139 /* Maps offsets (represented as INTEGER_CSTs) to a TREE_LIST of
6140 types that appear at that offset. */
6141 splay_tree empty_base_offsets;
6142 /* True if the last field laid out was a bit-field. */
6144 /* The location at which the next field should be inserted. */
6146 /* T, as a base class. */
6147 tree base_t;
6149 /* Keep track of the first non-static data member. */
6152 /* Start laying out the record. */
6155 /* Mark all the primary bases in the hierarchy. */
6158 /* Create a pointer to our virtual function table. */
6161 /* The vptr is always the first thing in the class. */
6163 {
6168 }
6169 else
6172 /* Build FIELD_DECLs for all of the non-virtual base-types. */
6177 /* Layout the non-static data members. */
6179 {
6180 tree type;
6181 tree padding;
6183 /* We still pass things that aren't non-static data members to
6184 the back end, in case it wants to do something with them. */
6186 {
6188 /* If the static data member has incomplete type, keep track
6189 of it so that it can be completed later. (The handling
6190 of pending statics in finish_record_layout is
6191 insufficient; consider:
6193 struct S1;
6194 struct S2 { static S1 s1; };
6196 At this point, finish_record_layout will be called, but
6197 S1 is still incomplete.) */
6199 {
6201 /* The visibility of static data members is determined
6202 at their point of declaration, not their point of
6203 definition. */
6205 }
6207 }
6215 /* If this field is a bit-field whose width is greater than its
6216 type, then there are some special rules for allocating
6217 it. */
6220 {
6222 tree integer_type;
6224 /* We must allocate the bits as if suitably aligned for the
6225 longest integer type that fits in this many bits. type
6226 of the field. Then, we are supposed to use the left over
6227 bits as additional padding. */
6236 /* ITK now indicates a type that is too large for the
6237 field. We have to back up by one to find the largest
6238 type that fits. */
6239 do
6240 {
6245 /* Figure out how much additional padding is required. */
6247 {
6249 /* In a union, the padding field must have the full width
6250 of the bit-field; all fields start at offset zero. */
6252 else
6255 }
6257 /* An unnamed bitfield does not normally affect the
6258 alignment of the containing class on a target where
6259 PCC_BITFIELD_TYPE_MATTERS. But, the C++ ABI does not
6260 make any exceptions for unnamed bitfields when the
6261 bitfields are longer than their types. Therefore, we
6262 temporarily give the field a name. */
6264 {
6267 }
6273 empty_base_offsets);
6276 /* Now that layout has been performed, set the size of the
6277 field to the size of its declared type; the rest of the
6278 field is effectively invisible. */
6280 /* We must also reset the DECL_MODE of the field. */
6282 }
6283 else
6285 empty_base_offsets);
6287 /* Remember the location of any empty classes in FIELD. */
6290 empty_base_offsets,
6293 /* If a bit-field does not immediately follow another bit-field,
6294 and yet it starts in the middle of a byte, we have failed to
6295 comply with the ABI. */
6298 /* The TREE_NO_WARNING flag gets set by Objective-C when
6299 laying out an Objective-C class. The ObjC ABI differs
6300 from the C++ ABI, and so we do not want a warning
6301 here. */
6303 && !last_field_was_bitfield
6306 bitsize_unit_node)))
6310 /* The middle end uses the type of expressions to determine the
6311 possible range of expression values. In order to optimize
6312 "x.i > 7" to "false" for a 2-bit bitfield "i", the middle end
6313 must be made aware of the width of "i", via its type.
6315 Because C++ does not have integer types of arbitrary width,
6316 we must (for the purposes of the front end) convert from the
6317 type assigned here to the declared type of the bitfield
6318 whenever a bitfield expression is used as an rvalue.
6319 Similarly, when assigning a value to a bitfield, the value
6320 must be converted to the type given the bitfield here. */
6322 {
6327 {
6334 }
6335 }
6337 /* If we needed additional padding after this field, add it
6338 now. */
6340 {
6341 tree padding_field;
6344 FIELD_DECL,
6345 NULL_TREE,
6346 char_type_node);
6353 NULL_TREE,
6354 empty_base_offsets);
6355 }
6358 }
6361 {
6362 /* Make sure that we are on a byte boundary so that the size of
6363 the class without virtual bases will always be a round number
6364 of bytes. */
6367 }
6369 /* Delete all zero-width bit-fields from the list of fields. Now
6370 that the type is laid out they are no longer important. */
6373 /* Create the version of T used for virtual bases. We do not use
6374 make_class_type for this version; this is an artificial type. For
6375 a POD type, we just reuse T. */
6377 {
6380 /* Set the size and alignment for the new type. */
6381 tree eoc;
6383 /* If the ABI version is not at least two, and the last
6384 field was a bit-field, RLI may not be on a byte
6385 boundary. In particular, rli_size_unit_so_far might
6386 indicate the last complete byte, while rli_size_so_far
6387 indicates the total number of bits used. Therefore,
6388 rli_size_so_far, rather than rli_size_unit_so_far, is
6389 used to compute TYPE_SIZE_UNIT. */
6397 eoc);
6407 /* Copy the fields from T. */
6411 {
6413 FIELD_DECL,
6423 }
6425 /* Record the base version of the type. */
6428 }
6429 else
6432 /* Every empty class contains an empty class. */
6436 /* Set the TYPE_DECL for this type to contain the right
6437 value for DECL_OFFSET, so that we can use it as part
6438 of a COMPONENT_REF for multiple inheritance. */
6441 /* Now fix up any virtual base class types that we left lying
6442 around. We must get these done before we try to lay out the
6443 virtual function table. As a side-effect, this will remove the
6444 base subobject fields. */
6447 /* Make sure that empty classes are reflected in RLI at this
6448 point. */
6451 /* Make sure not to create any structures with zero size. */
6457 /* If this is a non-POD, declaring it packed makes a difference to how it
6458 can be used as a field; don't let finalize_record_size undo it. */
6462 /* Let the back end lay out the type. */
6471 /* Warn about bases that can't be talked about due to ambiguity. */
6474 /* Now that we're done with layout, give the base fields the real types. */
6479 /* Clean up. */
6486 }
6488 /* Determine the "key method" for the class type indicated by TYPE,
6489 and set CLASSTYPE_KEY_METHOD accordingly. */
6491 void
6493 {
6494 tree method;
6497 || processing_template_decl
6502 /* The key method is the first non-pure virtual function that is not
6503 inline at the point of class definition. On some targets the
6504 key function may not be inline; those targets should not call
6505 this function until the end of the translation unit. */
6512 {
6515 }
6518 }
6521 /* Allocate and return an instance of struct sorted_fields_type with
6522 N fields. */
6526 {
6533 }
6536 /* Perform processing required when the definition of T (a class type)
6537 is complete. */
6539 void
6541 {
6542 tree x;
6543 /* A TREE_LIST. The TREE_VALUE of each node is a FUNCTION_DECL. */
6547 {
6552 }
6554 /* If this type was previously laid out as a forward reference,
6555 make sure we lay it out again. */
6559 /* Make assumptions about the class; we'll reset the flags if
6560 necessary. */
6566 /* Do end-of-class semantic processing: checking the validity of the
6567 bases and members and add implicitly generated methods. */
6570 /* Find the key method. */
6572 {
6573 /* The Itanium C++ ABI permits the key method to be chosen when
6574 the class is defined -- even though the key method so
6575 selected may later turn out to be an inline function. On
6576 some systems (such as ARM Symbian OS) the key method cannot
6577 be determined until the end of the translation unit. On such
6578 systems, we leave CLASSTYPE_KEY_METHOD set to NULL, which
6579 will cause the class to be added to KEYED_CLASSES. Then, in
6580 finish_file we will determine the key method. */
6584 /* If a polymorphic class has no key method, we may emit the vtable
6585 in every translation unit where the class definition appears. If
6586 we're devirtualizing, we can look into the vtable even if we
6587 aren't emitting it. */
6590 }
6592 /* Layout the class itself. */
6595 /* We use the base type for trivial assignments, and hence it
6596 needs a mode. */
6601 /* If necessary, create the primary vtable for this class. */
6603 {
6604 /* We must enter these virtuals into the table. */
6608 /* Here we know enough to change the type of our virtual
6609 function table, but we will wait until later this function. */
6612 /* If we're warning about ABI tags, check the types of the new
6613 virtual functions. */
6617 }
6620 {
6622 tree fn;
6629 /* Add entries for virtual functions introduced by this class. */
6633 /* Set DECL_VINDEX for all functions declared in this class. */
6635 fn;
6637 vindex += (TARGET_VTABLE_USES_DESCRIPTORS
6639 {
6643 /* A thunk. We should never be calling this entry directly
6644 from this vtable -- we'd use the entry for the non
6645 thunk base function. */
6649 }
6650 }
6655 /* Complete the rtl for any static member objects of the type we're
6656 working on. */
6663 /* Done with FIELDS...now decide whether to sort these for
6664 faster lookups later.
6666 We use a small number because most searches fail (succeeding
6667 ultimately as the search bores through the inheritance
6668 hierarchy), and we want this failure to occur quickly. */
6672 /* Complain if one of the field types requires lower visibility. */
6675 /* Make the rtl for any new vtables we have created, and unmark
6676 the base types we marked. */
6679 /* Build the VTT for T. */
6682 /* This warning does not make sense for Java classes, since they
6683 cannot have destructors. */
6688 "%q#T has virtual functions and accessible"
6696 /* Class layout, assignment of virtual table slots, etc., is now
6697 complete. Give the back end a chance to tweak the visibility of
6698 the class or perform any other required target modifications. */
6708 /* Finish debugging output for this type. */
6712 {
6715 {
6718 }
6720 {
6723 else
6724 {
6727 }
6729 }
6731 {
6733 "the type of the first field has a different ABI from the "
6736 }
6737 }
6738 }
6740 /* Insert FIELDS into T for the sorted case if the FIELDS count is
6741 equal to THRESHOLD or greater than THRESHOLD. */
6743 static void
6745 {
6748 {
6753 }
6754 }
6756 /* Insert lately defined enum ENUMTYPE into T for the sorted case. */
6758 void
6760 {
6763 {
6765 int n_fields
6776 }
6777 }
6779 /* When T was built up, the member declarations were added in reverse
6780 order. Rearrange them to declaration order. */
6782 void
6784 {
6785 tree next;
6786 tree prev;
6787 tree x;
6789 /* The following lists are all in reverse order. Put them in
6790 declaration order now. */
6794 /* Actually, for the TYPE_FIELDS, only the non TYPE_DECLs are in
6795 reverse order, so we can't just use nreverse. */
6800 {
6804 }
6806 {
6810 }
6811 }
6813 tree
6815 {
6818 /* Now that we've got all the field declarations, reverse everything
6819 as necessary. */
6825 /* Nadger the current location so that diagnostics point to the start of
6826 the struct, not the end. */
6830 {
6831 tree x;
6837 /* We need to emit an error message if this type was used as a parameter
6838 and it is an abstract type, even if it is a template. We construct
6839 a simple CLASSTYPE_PURE_VIRTUALS list without taking bases into
6840 account and we call complete_vars with this type, which will check
6841 the PARM_DECLS. Note that while the type is being defined,
6842 CLASSTYPE_PURE_VIRTUALS contains the list of the inline friends
6843 (see CLASSTYPE_INLINE_FRIENDS) so we need to clear it. */
6849 /* We need to add the target functions to the CLASSTYPE_METHOD_VEC if
6850 an enclosing scope is a template class, so that this function be
6851 found by lookup_fnfields_1 when the using declaration is not
6852 instantiated yet. */
6855 {
6860 }
6862 /* Remember current #pragma pack value. */
6865 /* Fix up any variants we've already built. */
6867 {
6872 }
6873 }
6874 else
6878 {
6879 /* People keep complaining that the compiler crashes on an invalid
6880 definition of initializer_list, so I guess we should explicitly
6881 reject it. What the compiler internals care about is that it's a
6882 template and has a pointer field followed by an integer field. */
6885 {
6888 {
6892 }
6893 }
6896 "definition of std::initializer_list does not match "
6898 }
6906 else
6910 /* Lambdas are defined by the LAMBDA_EXPR. */
6915 }
6916 \f
6917 /* Hash table to avoid endless recursion when handling references. */
6920 /* Return the dynamic type of INSTANCE, if known.
6921 Used to determine whether the virtual function table is needed
6922 or not.
6924 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
6925 of our knowledge of its type. *NONNULL should be initialized
6926 before this function is called. */
6928 static tree
6930 {
6931 #define RECUR(T) fixed_type_or_null((T), nonnull, cdtorp)
6934 {
6938 else
6942 /* This is a call to a constructor, hence it's never zero. */
6944 {
6948 }
6952 /* This is a call to a constructor, hence it's never zero. */
6954 {
6958 }
6967 /* Propagate nonnull. */
6972 CASE_CONVERT:
6978 {
6979 /* Just because we see an ADDR_EXPR doesn't mean we're dealing
6980 with a real object -- given &p->f, p can still be null. */
6982 /* ??? Probably should check DECL_WEAK here. */
6985 }
6989 /* If this component is really a base class reference, then the field
6990 itself isn't definitive. */
6999 {
7003 }
7004 /* fall through... */
7009 {
7013 }
7015 {
7019 /* if we're in a ctor or dtor, we know our type. If
7020 current_class_ptr is set but we aren't in a function, we're in
7021 an NSDMI (and therefore a constructor). */
7026 {
7030 }
7031 }
7033 {
7034 /* We only need one hash table because it is always left empty. */
7036 fixed_type_or_null_ref_ht
7039 /* Reference variables should be references to objects. */
7043 /* Enter the INSTANCE in a table to prevent recursion; a
7044 variable's initializer may refer to the variable
7045 itself. */
7050 {
7051 tree type;
7060 }
7061 }
7066 }
7067 #undef RECUR
7068 }
7070 /* Return nonzero if the dynamic type of INSTANCE is known, and
7071 equivalent to the static type. We also handle the case where
7072 INSTANCE is really a pointer. Return negative if this is a
7073 ctor/dtor. There the dynamic type is known, but this might not be
7074 the most derived base of the original object, and hence virtual
7075 bases may not be laid out according to this type.
7077 Used to determine whether the virtual function table is needed
7078 or not.
7080 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
7081 of our knowledge of its type. *NONNULL should be initialized
7082 before this function is called. */
7084 int
7086 {
7089 tree fixed;
7091 /* processing_template_decl can be false in a template if we're in
7092 instantiate_non_dependent_expr, but we still want to suppress
7093 this check. */
7095 {
7096 /* In a template we only care about the type of the result. */
7100 }
7110 }
7112 \f
7113 void
7115 {
7118 current_class_stack
7126 }
7128 /* Restore the cached PREVIOUS_CLASS_LEVEL. */
7130 static void
7132 {
7133 tree type;
7135 /* We are re-entering the same class we just left, so we don't
7136 have to search the whole inheritance matrix to find all the
7137 decls to bind again. Instead, we install the cached
7138 class_shadowed list and walk through it binding names. */
7141 /* Restore IDENTIFIER_TYPE_VALUE. */
7143 type;
7146 }
7148 /* Set global variables CURRENT_CLASS_NAME and CURRENT_CLASS_TYPE as
7149 appropriate for TYPE.
7151 So that we may avoid calls to lookup_name, we cache the _TYPE
7152 nodes of local TYPE_DECLs in the TREE_TYPE field of the name.
7154 For multiple inheritance, we perform a two-pass depth-first search
7155 of the type lattice. */
7157 void
7159 {
7160 class_stack_node_t csn;
7164 /* Make sure there is enough room for the new entry on the stack. */
7166 {
7168 current_class_stack
7170 current_class_stack_size);
7171 }
7173 /* Insert a new entry on the class stack. */
7180 current_class_depth++;
7182 /* Now set up the new type. */
7188 /* By default, things in classes are private, while things in
7189 structures or unions are public. */
7191 ? access_private_node
7197 {
7198 /* Forcibly remove any old class remnants. */
7200 }
7206 else
7208 }
7210 /* When we exit a toplevel class scope, we save its binding level so
7211 that we can restore it quickly. Here, we've entered some other
7212 class, so we must invalidate our cache. */
7214 void
7216 {
7218 }
7220 /* Get out of the current class scope. If we were in a class scope
7221 previously, that is the one popped to. */
7223 void
7225 {
7228 current_class_depth--;
7234 }
7236 /* Mark the top of the class stack as hidden. */
7238 void
7240 {
7243 }
7245 /* Mark the top of the class stack as un-hidden. */
7247 void
7249 {
7252 }
7254 /* Returns 1 if the class type currently being defined is either T or
7255 a nested type of T. */
7257 bool
7259 {
7267 /* We start looking from 1 because entry 0 is from global scope,
7268 and has no type. */
7270 {
7271 tree c;
7274 else
7275 {
7279 }
7284 }
7286 }
7288 /* If either current_class_type or one of its enclosing classes are derived
7289 from T, return the appropriate type. Used to determine how we found
7290 something via unqualified lookup. */
7292 tree
7294 {
7297 /* The bases of a dependent type are unknown. */
7308 {
7313 }
7316 }
7318 /* Return the outermost enclosing class type that is still open, or
7319 NULL_TREE. */
7321 tree
7323 {
7330 {
7337 }
7339 }
7341 /* Returns the innermost class type which is not a lambda closure type. */
7343 tree
7345 {
7348 /* We start looking from 1 because entry 0 is from global scope,
7349 and has no type. */
7351 {
7352 tree c;
7355 else
7356 {
7360 }
7365 }
7367 }
7369 /* When entering a class scope, all enclosing class scopes' names with
7370 static meaning (static variables, static functions, types and
7371 enumerators) have to be visible. This recursive function calls
7372 pushclass for all enclosing class contexts until global or a local
7373 scope is reached. TYPE is the enclosed class. */
7375 void
7377 {
7378 /* A namespace might be passed in error cases, like A::B:C. */
7386 }
7388 /* Undoes a push_nested_class call. */
7390 void
7392 {
7398 }
7400 /* Returns the number of extern "LANG" blocks we are nested within. */
7402 int
7404 {
7406 }
7408 /* Set global variables CURRENT_LANG_NAME to appropriate value
7409 so that behavior of name-mangling machinery is correct. */
7411 void
7413 {
7417 {
7419 }
7421 {
7423 /* DECL_IGNORED_P is initially set for these types, to avoid clutter.
7424 (See record_builtin_java_type in decl.c.) However, that causes
7425 incorrect debug entries if these types are actually used.
7426 So we re-enable debug output after extern "Java". */
7435 }
7437 {
7439 }
7440 else
7442 }
7444 /* Get out of the current language scope. */
7446 void
7448 {
7450 }
7451 \f
7452 /* Type instantiation routines. */
7454 /* Given an OVERLOAD and a TARGET_TYPE, return the function that
7455 matches the TARGET_TYPE. If there is no satisfactory match, return
7456 error_mark_node, and issue an error & warning messages under
7457 control of FLAGS. Permit pointers to member function if FLAGS
7458 permits. If TEMPLATE_ONLY, the name of the overloaded function was
7459 a template-id, and EXPLICIT_TARGS are the explicitly provided
7460 template arguments.
7462 If OVERLOAD is for one or more member functions, then ACCESS_PATH
7463 is the base path used to reference those member functions. If
7464 the address is resolved to a member function, access checks will be
7465 performed and errors issued if appropriate. */
7467 static tree
7469 tree overload,
7470 tsubst_flags_t complain,
7472 tree explicit_targs,
7473 tree access_path)
7474 {
7475 /* Here's what the standard says:
7477 [over.over]
7479 If the name is a function template, template argument deduction
7480 is done, and if the argument deduction succeeds, the deduced
7481 arguments are used to generate a single template function, which
7482 is added to the set of overloaded functions considered.
7484 Non-member functions and static member functions match targets of
7485 type "pointer-to-function" or "reference-to-function." Nonstatic
7486 member functions match targets of type "pointer-to-member
7487 function;" the function type of the pointer to member is used to
7488 select the member function from the set of overloaded member
7489 functions. If a nonstatic member function is selected, the
7490 reference to the overloaded function name is required to have the
7491 form of a pointer to member as described in 5.3.1.
7493 If more than one function is selected, any template functions in
7494 the set are eliminated if the set also contains a non-template
7495 function, and any given template function is eliminated if the
7496 set contains a second template function that is more specialized
7497 than the first according to the partial ordering rules 14.5.5.2.
7498 After such eliminations, if any, there shall remain exactly one
7499 selected function. */
7502 /* We store the matches in a TREE_LIST rooted here. The functions
7503 are the TREE_PURPOSE, not the TREE_VALUE, in this list, for easy
7504 interoperability with most_specialized_instantiation. */
7506 tree fn;
7507 tree target_fn_type;
7509 /* By the time we get here, we should be seeing only real
7510 pointer-to-member types, not the internal POINTER_TYPE to
7511 METHOD_TYPE representation. */
7517 /* Check that the TARGET_TYPE is reasonable. */
7522 /* This is OK, too. */
7525 /* This is OK, too. This comes from a conversion to reference
7526 type. */
7528 else
7529 {
7535 }
7537 /* Non-member functions and static member functions match targets of type
7538 "pointer-to-function" or "reference-to-function." Nonstatic member
7539 functions match targets of type "pointer-to-member-function;" the
7540 function type of the pointer to member is used to select the member
7541 function from the set of overloaded member functions.
7543 So figure out the FUNCTION_TYPE that we want to match against. */
7546 /* If we can find a non-template function that matches, we can just
7547 use it. There's no point in generating template instantiations
7548 if we're just going to throw them out anyhow. But, of course, we
7549 can only do this when we don't *need* a template function. */
7551 {
7552 tree fns;
7555 {
7559 /* We're not looking for templates just yet. */
7564 /* We're looking for a non-static member, and this isn't
7565 one, or vice versa. */
7568 /* Ignore functions which haven't been explicitly
7569 declared. */
7573 /* See if there's a match. */
7576 }
7577 }
7579 /* Now, if we've already got a match (or matches), there's no need
7580 to proceed to the template functions. But, if we don't have a
7581 match we need to look at them, too. */
7583 {
7584 tree target_arg_types;
7585 tree target_ret_type;
7586 tree fns;
7589 tree arg;
7603 {
7605 tree instantiation;
7606 tree targs;
7609 /* We're only looking for templates. */
7614 /* We're not looking for a non-static member, and this is
7615 one, or vice versa. */
7620 /* If the template has a deduced return type, don't expose it to
7621 template argument deduction. */
7625 /* Try to do argument deduction. */
7632 /* Instantiation failed. */
7635 /* And now force instantiation to do return type deduction. */
7637 {
7643 }
7645 /* See if there's a match. */
7648 }
7650 /* Now, remove all but the most specialized of the matches. */
7652 {
7657 NULL_TREE,
7658 NULL_TREE);
7659 }
7660 }
7662 /* Now we should have exactly one function in MATCHES. */
7664 {
7665 /* There were *no* matches. */
7667 {
7670 target_type);
7673 }
7675 }
7677 {
7678 /* There were too many matches. First check if they're all
7679 the same function. */
7684 /* For multi-versioned functions, more than one match is just fine and
7685 decls_match will return false as they are different. */
7693 {
7695 {
7698 target_type);
7700 /* Since print_candidates expects the functions in the
7701 TREE_VALUE slot, we flip them here. */
7706 }
7709 }
7710 }
7712 /* Good, exactly one match. Now, convert it to the correct type. */
7717 {
7725 {
7728 }
7729 }
7731 /* If a pointer to a function that is multi-versioned is requested, the
7732 pointer to the dispatcher function is returned instead. This works
7733 well because indirectly calling the function will dispatch the right
7734 function version at run-time. */
7736 {
7740 /* Mark all the versions corresponding to the dispatcher as used. */
7743 }
7745 /* If we're doing overload resolution purely for the purpose of
7746 determining conversion sequences, we should not consider the
7747 function used. If this conversion sequence is selected, the
7748 function will be marked as used at this point. */
7750 {
7751 /* Make =delete work with SFINAE. */
7756 }
7758 /* We could not check access to member functions when this
7759 expression was originally created since we did not know at that
7760 time to which function the expression referred. */
7762 {
7765 }
7769 else
7770 {
7771 /* The target must be a REFERENCE_TYPE. Above, cp_build_unary_op
7772 will mark the function as addressed, but here we must do it
7773 explicitly. */
7777 }
7778 }
7780 /* This function will instantiate the type of the expression given in
7781 RHS to match the type of LHSTYPE. If errors exist, then return
7782 error_mark_node. COMPLAIN is a bit mask. If TF_ERROR is set, then
7783 we complain on errors. If we are not complaining, never modify rhs,
7784 as overload resolution wants to try many possible instantiations, in
7785 the hope that at least one will work.
7787 For non-recursive calls, LHSTYPE should be a function, pointer to
7788 function, or a pointer to member function. */
7790 tree
7792 {
7799 {
7803 }
7806 {
7813 /* Microsoft allows `A::f' to be resolved to a
7814 pointer-to-member. */
7815 ;
7816 else
7817 {
7822 }
7823 }
7826 {
7829 }
7831 /* If we are in a template, and have a NON_DEPENDENT_EXPR, we cannot
7832 deduce any type information. */
7834 {
7838 }
7840 /* There only a few kinds of expressions that may have a type
7841 dependent on overload resolution. */
7847 /* This should really only be used when attempting to distinguish
7848 what sort of a pointer to function we have. For now, any
7849 arithmetic operation which is not supported on pointers
7850 is rejected as an error. */
7853 {
7855 {
7861 /* Do not lose object's side effects. */
7865 }
7872 /* This can happen if we are forming a pointer-to-member for a
7873 member template. */
7876 /* Fall through. */
7879 {
7883 return
7887 }
7891 return
7895 access_path);
7898 {
7903 }
7910 }
7912 }
7913 \f
7914 /* Return the name of the virtual function pointer field
7915 (as an IDENTIFIER_NODE) for the given TYPE. Note that
7916 this may have to look back through base types to find the
7917 ultimate field name. (For single inheritance, these could
7918 all be the same name. Who knows for multiple inheritance). */
7920 static tree
7922 {
7929 {
7935 }
7943 }
7945 void
7947 {
7954 {
7959 }
7960 }
7962 /* Build a dummy reference to ourselves so Derived::Base (and A::A) works,
7963 according to [class]:
7964 The class-name is also inserted
7965 into the scope of the class itself. For purposes of access checking,
7966 the inserted class name is treated as if it were a public member name. */
7968 void
7970 {
7973 tree saved_cas;
7988 }
7990 /* Returns 1 if TYPE contains only padding bytes. */
7992 int
7994 {
8002 }
8004 /* Returns true if TYPE contains no actual data, just various
8005 possible combinations of empty classes and possibly a vptr. */
8007 bool
8009 {
8011 {
8012 tree field;
8013 tree binfo;
8014 tree base_binfo;
8017 /* CLASSTYPE_EMPTY_P isn't set properly until the class is actually laid
8018 out, but we'd like to be able to check this before then. */
8032 }
8036 }
8038 /* Note that NAME was looked up while the current class was being
8039 defined and that the result of that lookup was DECL. */
8041 void
8043 {
8044 splay_tree names_used;
8046 /* If we're not defining a class, there's nothing to do. */
8052 /* If there's already a binding for this NAME, then we don't have
8053 anything to worry about. */
8066 }
8068 /* Note that NAME was declared (as DECL) in the current class. Check
8069 to see that the declaration is valid. */
8071 void
8073 {
8074 splay_tree names_used;
8075 splay_tree_node n;
8077 /* Look to see if we ever used this name. */
8078 names_used
8082 /* The C language allows members to be declared with a type of the same
8083 name, and the C++ standard says this diagnostic is not required. So
8084 allow it in extern "C" blocks unless predantic is specified.
8085 Allow it in all cases if -ms-extensions is specified. */
8091 {
8092 /* [basic.scope.class]
8094 A name N used in a class S shall refer to the same declaration
8095 in its context and when re-evaluated in the completed scope of
8096 S. */
8100 }
8101 }
8103 /* Returns the VAR_DECL for the complete vtable associated with BINFO.
8104 Secondary vtables are merged with primary vtables; this function
8105 will return the VAR_DECL for the primary vtable. */
8107 tree
8109 {
8110 tree decl;
8114 {
8117 }
8121 }
8124 /* Returns the binfo for the primary base of BINFO. If the resulting
8125 BINFO is a virtual base, and it is inherited elsewhere in the
8126 hierarchy, then the returned binfo might not be the primary base of
8127 BINFO in the complete object. Check BINFO_PRIMARY_P or
8128 BINFO_LOST_PRIMARY_P to be sure. */
8130 static tree
8132 {
8133 tree primary_base;
8140 }
8142 /* If INDENTED_P is zero, indent to INDENT. Return nonzero. */
8144 static int
8146 {
8150 }
8152 /* Dump the offsets of all the bases rooted at BINFO to STREAM.
8153 INDENT should be zero when called from the top level; it is
8154 incremented recursively. IGO indicates the next expected BINFO in
8155 inheritance graph ordering. */
8157 static tree
8160 tree binfo,
8161 tree igo,
8163 {
8165 tree base_binfo;
8173 {
8176 }
8191 {
8195 TFF_PLAIN_IDENTIFIER),
8197 }
8199 {
8202 }
8207 {
8211 {
8215 TFF_PLAIN_IDENTIFIER));
8216 }
8218 {
8222 TFF_PLAIN_IDENTIFIER));
8223 }
8225 {
8229 TFF_PLAIN_IDENTIFIER));
8230 }
8232 {
8236 TFF_PLAIN_IDENTIFIER));
8237 }
8241 }
8247 }
8249 /* Dump the BINFO hierarchy for T. */
8251 static void
8253 {
8265 }
8267 /* Debug interface to hierarchy dumping. */
8269 void
8271 {
8273 }
8275 static void
8277 {
8282 {
8284 }
8285 }
8287 static void
8289 {
8290 tree value;
8292 HOST_WIDE_INT elt;
8300 TFF_PLAIN_IDENTIFIER));
8307 }
8309 static void
8311 {
8319 {
8326 {
8331 }
8335 }
8336 }
8338 static void
8340 {
8348 {
8353 }
8354 }
8356 /* Dump a function or thunk and its thunkees. */
8358 static void
8360 {
8363 tree thunks;
8371 {
8381 else
8387 }
8391 }
8393 /* Dump the thunks for FN. */
8395 void
8397 {
8399 }
8401 /* Virtual function table initialization. */
8403 /* Create all the necessary vtables for T and its base classes. */
8405 static void
8407 {
8408 tree vbase;
8412 /* We lay out the primary and secondary vtables in one contiguous
8413 vtable. The primary vtable is first, followed by the non-virtual
8414 secondary vtables in inheritance graph order. */
8418 /* Then come the virtual bases, also in inheritance graph order. */
8420 {
8424 }
8428 }
8430 /* Initialize the vtable for BINFO with the INITS. */
8432 static void
8434 {
8435 tree decl;
8441 }
8443 /* Build the VTT (virtual table table) for T.
8444 A class requires a VTT if it has virtual bases.
8446 This holds
8447 1 - primary virtual pointer for complete object T
8448 2 - secondary VTTs for each direct non-virtual base of T which requires a
8449 VTT
8450 3 - secondary virtual pointers for each direct or indirect base of T which
8451 has virtual bases or is reachable via a virtual path from T.
8452 4 - secondary VTTs for each direct or indirect virtual base of T.
8454 Secondary VTTs look like complete object VTTs without part 4. */
8456 static void
8458 {
8459 tree type;
8460 tree vtt;
8461 tree index;
8464 /* Build up the initializers for the VTT. */
8469 /* If we didn't need a VTT, we're done. */
8473 /* Figure out the type of the VTT. */
8477 /* Now, build the VTT object itself. */
8480 /* Add the VTT to the vtables list. */
8485 }
8487 /* When building a secondary VTT, BINFO_VTABLE is set to a TREE_LIST with
8488 PURPOSE the RTTI_BINFO, VALUE the real vtable pointer for this binfo,
8489 and CHAIN the vtable pointer for this binfo after construction is
8490 complete. VALUE can also be another BINFO, in which case we recurse. */
8492 static tree
8494 {
8495 tree vt;
8498 {
8504 else
8506 }
8509 }
8511 /* Data for secondary VTT initialization. */
8513 {
8514 /* Is this the primary VTT? */
8517 /* Current index into the VTT. */
8518 tree index;
8520 /* Vector of initializers built up. */
8523 /* The type being constructed by this secondary VTT. */
8524 tree type_being_constructed;
8527 /* Recursively build the VTT-initializer for BINFO (which is in the
8528 hierarchy dominated by T). INITS points to the end of the initializer
8529 list to date. INDEX is the VTT index where the next element will be
8530 replaced. Iff BINFO is the binfo for T, this is the top level VTT (i.e.
8531 not a subvtt for some base of T). When that is so, we emit the sub-VTTs
8532 for virtual bases of T. When it is not so, we build the constructor
8533 vtables for the BINFO-in-T variant. */
8535 static void
8538 {
8540 tree b;
8541 tree init;
8542 secondary_vptr_vtt_init_data data;
8545 /* We only need VTTs for subobjects with virtual bases. */
8549 /* We need to use a construction vtable if this is not the primary
8550 VTT. */
8552 {
8555 /* Record the offset in the VTT where this sub-VTT can be found. */
8557 }
8559 /* Add the address of the primary vtable for the complete object. */
8563 {
8566 }
8569 /* Recursively add the secondary VTTs for non-virtual bases. */
8574 /* Add secondary virtual pointers for all subobjects of BINFO with
8575 either virtual bases or reachable along a virtual path, except
8576 subobjects that are non-virtual primary bases. */
8586 /* data.inits might have grown as we added secondary virtual pointers.
8587 Make sure our caller knows about the new vector. */
8591 /* Add the secondary VTTs for virtual bases in inheritance graph
8592 order. */
8594 {
8599 }
8600 else
8601 /* Remove the ctor vtables we created. */
8603 }
8605 /* Called from build_vtt_inits via dfs_walk. BINFO is the binfo for the base
8606 in most derived. DATA is a SECONDARY_VPTR_VTT_INIT_DATA structure. */
8608 static tree
8610 {
8613 /* We don't care about bases that don't have vtables. */
8617 /* We're only interested in proper subobjects of the type being
8618 constructed. */
8622 /* We're only interested in bases with virtual bases or reachable
8623 via a virtual path from the type being constructed. */
8628 /* We're not interested in non-virtual primary bases. */
8632 /* Record the index where this secondary vptr can be found. */
8634 {
8639 {
8640 /* It's a primary virtual base, and this is not a
8641 construction vtable. Find the base this is primary of in
8642 the inheritance graph, and use that base's vtable
8643 now. */
8646 }
8647 }
8649 /* Add the initializer for the secondary vptr itself. */
8652 /* Advance the vtt index. */
8657 }
8659 /* Called from build_vtt_inits via dfs_walk. After building
8660 constructor vtables and generating the sub-vtt from them, we need
8661 to restore the BINFO_VTABLES that were scribbled on. DATA is the
8662 binfo of the base whose sub vtt was generated. */
8664 static tree
8666 {
8670 /* If this class has no vtable, none of its bases do. */
8674 /* This might be a primary base, so have no vtable in this
8675 hierarchy. */
8678 /* If we scribbled the construction vtable vptr into BINFO, clear it
8679 out now. */
8685 }
8687 /* Build the construction vtable group for BINFO which is in the
8688 hierarchy dominated by T. */
8690 static void
8692 {
8693 tree type;
8694 tree vtbl;
8695 tree id;
8696 tree vbase;
8699 /* See if we've already created this construction vtable group. */
8705 /* Build a version of VTBL (with the wrong type) for use in
8706 constructing the addresses of secondary vtables in the
8707 construction vtable group. */
8710 /* Don't export construction vtables from shared libraries. Even on
8711 targets that don't support hidden visibility, this tells
8712 can_refer_decl_in_current_unit_p not to assume that it's safe to
8713 access from a different compilation unit (bz 54314). */
8721 /* Add the vtables for each of our virtual bases using the vbase in T
8722 binfo. */
8724 vbase;
8726 {
8727 tree b;
8734 }
8736 /* Figure out the type of the construction vtable. */
8743 /* Initialize the construction vtable. */
8747 }
8749 /* Add the vtbl initializers for BINFO (and its bases other than
8750 non-virtual primaries) to the list of INITS. BINFO is in the
8751 hierarchy dominated by T. RTTI_BINFO is the binfo within T of
8752 the constructor the vtbl inits should be accumulated for. (If this
8753 is the complete object vtbl then RTTI_BINFO will be TYPE_BINFO (T).)
8754 ORIG_BINFO is the binfo for this object within BINFO_TYPE (RTTI_BINFO).
8755 BINFO is the active base equivalent of ORIG_BINFO in the inheritance
8756 graph of T. Both BINFO and ORIG_BINFO will have the same BINFO_TYPE,
8757 but are not necessarily the same in terms of layout. */
8759 static void
8761 tree orig_binfo,
8762 tree rtti_binfo,
8763 tree vtbl,
8764 tree t,
8766 {
8768 tree base_binfo;
8773 /* If it doesn't have a vptr, we don't do anything. */
8777 /* If we're building a construction vtable, we're not interested in
8778 subobjects that don't require construction vtables. */
8784 /* Build the initializers for the BINFO-in-T vtable. */
8787 /* Walk the BINFO and its bases. We walk in preorder so that as we
8788 initialize each vtable we can figure out at what offset the
8789 secondary vtable lies from the primary vtable. We can't use
8790 dfs_walk here because we need to iterate through bases of BINFO
8791 and RTTI_BINFO simultaneously. */
8793 {
8794 /* Skip virtual bases. */
8800 inits);
8801 }
8802 }
8804 /* Called from accumulate_vtbl_inits. Adds the initializers for the
8805 BINFO vtable to L. */
8807 static void
8809 tree orig_binfo,
8810 tree rtti_binfo,
8811 tree orig_vtbl,
8812 tree t,
8814 {
8821 {
8822 /* In the hierarchy of BINFO_TYPE (RTTI_BINFO), this is a
8823 primary virtual base. If it is not the same primary in
8824 the hierarchy of T, we'll need to generate a ctor vtable
8825 for it, to place at its location in T. If it is the same
8826 primary, we still need a VTT entry for the vtable, but it
8827 should point to the ctor vtable for the base it is a
8828 primary for within the sub-hierarchy of RTTI_BINFO.
8830 There are three possible cases:
8832 1) We are in the same place.
8833 2) We are a primary base within a lost primary virtual base of
8834 RTTI_BINFO.
8835 3) We are primary to something not a base of RTTI_BINFO. */
8837 tree b;
8840 /* First, look through the bases we are primary to for RTTI_BINFO
8841 or a virtual base. */
8844 {
8849 }
8850 /* If we run out of primary links, keep looking down our
8851 inheritance chain; we might be an indirect primary. */
8855 found:
8857 /* If we found RTTI_BINFO, this is case 1. If we found a virtual
8858 base B and it is a base of RTTI_BINFO, this is case 2. In
8859 either case, we share our vtable with LAST, i.e. the
8860 derived-most base within B of which we are a primary. */
8863 /* Just set our BINFO_VTABLE to point to LAST, as we may not have
8864 set LAST's BINFO_VTABLE yet. We'll extract the actual vptr in
8865 binfo_ctor_vtable after everything's been set up. */
8868 /* Otherwise, this is case 3 and we get our own. */
8869 }
8876 {
8877 tree index;
8880 /* Add the initializer for this vtable. */
8884 /* Figure out the position to which the VPTR should point. */
8890 }
8893 /* For a construction vtable, we can't overwrite BINFO_VTABLE.
8894 So, we make a TREE_LIST. Later, dfs_fixup_binfo_vtbls will
8895 straighten this out. */
8898 /* Throw away any unneeded intializers. */
8900 else
8901 /* For an ordinary vtable, set BINFO_VTABLE. */
8903 }
8907 /* Construct the initializer for BINFO's virtual function table. BINFO
8908 is part of the hierarchy dominated by T. If we're building a
8909 construction vtable, the ORIG_BINFO is the binfo we should use to
8910 find the actual function pointers to put in the vtable - but they
8911 can be overridden on the path to most-derived in the graph that
8912 ORIG_BINFO belongs. Otherwise,
8913 ORIG_BINFO should be the same as BINFO. The RTTI_BINFO is the
8914 BINFO that should be indicated by the RTTI information in the
8915 vtable; it will be a base class of T, rather than T itself, if we
8916 are building a construction vtable.
8918 The value returned is a TREE_LIST suitable for wrapping in a
8919 CONSTRUCTOR to use as the DECL_INITIAL for a vtable. If
8920 NON_FN_ENTRIES_P is not NULL, *NON_FN_ENTRIES_P is set to the
8921 number of non-function entries in the vtable.
8923 It might seem that this function should never be called with a
8924 BINFO for which BINFO_PRIMARY_P holds, the vtable for such a
8925 base is always subsumed by a derived class vtable. However, when
8926 we are building construction vtables, we do build vtables for
8927 primary bases; we need these while the primary base is being
8928 constructed. */
8930 static void
8932 tree orig_binfo,
8933 tree t,
8934 tree rtti_binfo,
8937 {
8938 tree v;
8939 vtbl_init_data vid;
8941 tree vbinfo;
8945 /* Initialize VID. */
8953 /* The first vbase or vcall offset is at index -3 in the vtable. */
8956 /* Add entries to the vtable for RTTI. */
8959 /* Create an array for keeping track of the functions we've
8960 processed. When we see multiple functions with the same
8961 signature, we share the vcall offsets. */
8963 /* Add the vcall and vbase offset entries. */
8966 /* Clear BINFO_VTABLE_PATH_MARKED; it's set by
8967 build_vbase_offset_vtbl_entries. */
8972 /* If the target requires padding between data entries, add that now. */
8974 {
8979 /* Move data entries into their new positions and add padding
8980 after the new positions. Iterate backwards so we don't
8981 overwrite entries that we would need to process later. */
8984 ix--)
8985 {
8993 {
8997 null_pointer_node);
8998 }
8999 }
9000 }
9005 /* The initializers for virtual functions were built up in reverse
9006 order. Straighten them out and add them to the running list in one
9007 step. */
9016 /* Go through all the ordinary virtual functions, building up
9017 initializers. */
9019 {
9020 tree delta;
9021 tree vcall_index;
9028 {
9032 {
9035 }
9037 }
9039 /* If the only definition of this function signature along our
9040 primary base chain is from a lost primary, this vtable slot will
9041 never be used, so just zero it out. This is important to avoid
9042 requiring extra thunks which cannot be generated with the function.
9044 We first check this in update_vtable_entry_for_fn, so we handle
9045 restored primary bases properly; we also need to do it here so we
9046 zero out unused slots in ctor vtables, rather than filling them
9047 with erroneous values (though harmless, apart from relocation
9048 costs). */
9053 {
9054 /* Pull the offset for `this', and the function to call, out of
9055 the list. */
9062 /* You can't call an abstract virtual function; it's abstract.
9063 So, we replace these functions with __pure_virtual. */
9065 {
9068 {
9070 abort_fndecl_addr
9074 }
9075 }
9076 /* Likewise for deleted virtuals. */
9078 {
9087 }
9088 else
9089 {
9091 {
9095 }
9096 /* Take the address of the function, considering it to be of an
9097 appropriate generic type. */
9101 /* Don't refer to a virtual destructor from a constructor
9102 vtable or a vtable for an abstract class, since destroying
9103 an object under construction is undefined behavior and we
9104 don't want it to be considered a candidate for speculative
9105 devirtualization. But do create the thunk for ABI
9106 compliance. */
9111 }
9112 }
9114 /* And add it to the chain of initializers. */
9116 {
9121 else
9123 {
9129 }
9130 }
9131 else
9133 }
9134 }
9136 /* Adds to vid->inits the initializers for the vbase and vcall
9137 offsets in BINFO, which is in the hierarchy dominated by T. */
9139 static void
9141 {
9142 tree b;
9144 /* If this is a derived class, we must first create entries
9145 corresponding to the primary base class. */
9150 /* Add the vbase entries for this base. */
9152 /* Add the vcall entries for this base. */
9154 }
9156 /* Returns the initializers for the vbase offset entries in the vtable
9157 for BINFO (which is part of the class hierarchy dominated by T), in
9158 reverse order. VBASE_OFFSET_INDEX gives the vtable index
9159 where the next vbase offset will go. */
9161 static void
9163 {
9164 tree vbase;
9165 tree t;
9166 tree non_primary_binfo;
9168 /* If there are no virtual baseclasses, then there is nothing to
9169 do. */
9175 /* We might be a primary base class. Go up the inheritance hierarchy
9176 until we find the most derived class of which we are a primary base:
9177 it is the offset of that which we need to use. */
9180 {
9181 tree b;
9183 /* If we have reached a virtual base, then it must be a primary
9184 base (possibly multi-level) of vid->binfo, or we wouldn't
9185 have called build_vcall_and_vbase_vtbl_entries for it. But it
9186 might be a lost primary, so just skip down to vid->binfo. */
9188 {
9191 }
9197 }
9199 /* Go through the virtual bases, adding the offsets. */
9201 vbase;
9203 {
9204 tree b;
9205 tree delta;
9210 /* Find the instance of this virtual base in the complete
9211 object. */
9214 /* If we've already got an offset for this virtual base, we
9215 don't need another one. */
9220 /* Figure out where we can find this vbase offset. */
9229 /* The vbase offset had better be the same. */
9232 /* The next vbase will come at a more negative offset. */
9236 /* The initializer is the delta from BINFO to this virtual base.
9237 The vbase offsets go in reverse inheritance-graph order, and
9238 we are walking in inheritance graph order so these end up in
9239 the right order. */
9246 }
9247 }
9249 /* Adds the initializers for the vcall offset entries in the vtable
9250 for BINFO (which is part of the class hierarchy dominated by VID->DERIVED)
9251 to VID->INITS. */
9253 static void
9255 {
9256 /* We only need these entries if this base is a virtual base. We
9257 compute the indices -- but do not add to the vtable -- when
9258 building the main vtable for a class. */
9261 /* If BINFO is RTTI_BINFO, then (since BINFO does not
9262 correspond to VID->DERIVED), we are building a primary
9263 construction virtual table. Since this is a primary
9264 virtual table, we do not need the vcall offsets for
9265 BINFO. */
9267 {
9268 /* We need a vcall offset for each of the virtual functions in this
9269 vtable. For example:
9271 class A { virtual void f (); };
9272 class B1 : virtual public A { virtual void f (); };
9273 class B2 : virtual public A { virtual void f (); };
9274 class C: public B1, public B2 { virtual void f (); };
9276 A C object has a primary base of B1, which has a primary base of A. A
9277 C also has a secondary base of B2, which no longer has a primary base
9278 of A. So the B2-in-C construction vtable needs a secondary vtable for
9279 A, which will adjust the A* to a B2* to call f. We have no way of
9280 knowing what (or even whether) this offset will be when we define B2,
9281 so we store this "vcall offset" in the A sub-vtable and look it up in
9282 a "virtual thunk" for B2::f.
9284 We need entries for all the functions in our primary vtable and
9285 in our non-virtual bases' secondary vtables. */
9287 /* If we are just computing the vcall indices -- but do not need
9288 the actual entries -- not that. */
9291 /* Now, walk through the non-virtual bases, adding vcall offsets. */
9293 }
9294 }
9296 /* Build vcall offsets, starting with those for BINFO. */
9298 static void
9300 {
9302 tree primary_binfo;
9303 tree base_binfo;
9305 /* Don't walk into virtual bases -- except, of course, for the
9306 virtual base for which we are building vcall offsets. Any
9307 primary virtual base will have already had its offsets generated
9308 through the recursion in build_vcall_and_vbase_vtbl_entries. */
9312 /* If BINFO has a primary base, process it first. */
9317 /* Add BINFO itself to the list. */
9320 /* Scan the non-primary bases of BINFO. */
9324 }
9326 /* Called from build_vcall_offset_vtbl_entries_r. */
9328 static void
9330 {
9331 /* Make entries for the rest of the virtuals. */
9332 tree orig_fn;
9334 /* The ABI requires that the methods be processed in declaration
9335 order. */
9337 orig_fn;
9341 }
9343 /* Add a vcall offset entry for ORIG_FN to the vtable. */
9345 static void
9347 {
9349 tree vcall_offset;
9350 tree derived_entry;
9352 /* If there is already an entry for a function with the same
9353 signature as FN, then we do not need a second vcall offset.
9354 Check the list of functions already present in the derived
9355 class vtable. */
9357 {
9359 /* We only use one vcall offset for virtual destructors,
9360 even though there are two virtual table entries. */
9364 }
9366 /* If we are building these vcall offsets as part of building
9367 the vtable for the most derived class, remember the vcall
9368 offset. */
9370 {
9373 }
9375 /* The next vcall offset will be found at a more negative
9376 offset. */
9380 /* Keep track of this function. */
9384 {
9385 tree base;
9386 tree fn;
9388 /* Find the overriding function. */
9392 else
9393 {
9396 /* The vbase we're working on is a primary base of
9397 vid->binfo. But it might be a lost primary, so its
9398 BINFO_OFFSET might be wrong, so we just use the
9399 BINFO_OFFSET from vid->binfo. */
9405 vcall_offset);
9406 }
9407 /* Add the initializer to the vtable. */
9409 }
9410 }
9412 /* Return vtbl initializers for the RTTI entries corresponding to the
9413 BINFO's vtable. The RTTI entries should indicate the object given
9414 by VID->rtti_binfo. */
9416 static void
9418 {
9419 tree b;
9420 tree t;
9421 tree offset;
9422 tree decl;
9423 tree init;
9427 /* To find the complete object, we will first convert to our most
9428 primary base, and then add the offset in the vtbl to that value. */
9432 {
9433 tree primary_base;
9439 }
9443 /* The second entry is the address of the typeinfo object. */
9446 else
9449 /* Convert the declaration to a type that can be stored in the
9450 vtable. */
9454 /* Add the offset-to-top entry. It comes earlier in the vtable than
9455 the typeinfo entry. Convert the offset to look like a
9456 function pointer, so that we can put it in the vtable. */
9459 }
9461 /* TRUE iff TYPE is uniquely derived from PARENT. Ignores
9462 accessibility. */
9464 bool
9466 {
9469 }
9471 /* TRUE iff TYPE is publicly & uniquely derived from PARENT. */
9473 bool
9475 {
9479 }
9481 /* CTX1 and CTX2 are declaration contexts. Return the innermost common
9482 class between them, if any. */
9484 tree
9486 {
9498 {
9501 }
9505 }