| blob | d99ebcdc7dfd8993070e51857bd9178488ac904a |
1 /* Functions related to building classes and their related objects.
2 Copyright (C) 1987-2017 Free Software Foundation, Inc.
3 Contributed by Michael Tiemann (tiemann@cygnus.com)
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
10 any later version.
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
22 /* High-level class interface. */
40 /* The number of nested classes being processed. If we are not in the
41 scope of any class, this is zero. */
45 /* In order to deal with nested classes, we keep a stack of classes.
46 The topmost entry is the innermost class, and is the entry at index
47 CURRENT_CLASS_DEPTH */
50 /* The name of the class. */
51 tree name;
53 /* The _TYPE node for the class. */
54 tree type;
56 /* The access specifier pending for new declarations in the scope of
57 this class. */
58 tree access;
60 /* If were defining TYPE, the names used in this class. */
61 splay_tree names_used;
63 /* Nonzero if this class is no longer open, because of a call to
64 push_to_top_level. */
68 struct vtbl_init_data
69 {
70 /* The base for which we're building initializers. */
71 tree binfo;
72 /* The type of the most-derived type. */
73 tree derived;
74 /* The binfo for the dynamic type. This will be TYPE_BINFO (derived),
75 unless ctor_vtbl_p is true. */
76 tree rtti_binfo;
77 /* The negative-index vtable initializers built up so far. These
78 are in order from least negative index to most negative index. */
80 /* The binfo for the virtual base for which we're building
81 vcall offset initializers. */
82 tree vbase;
83 /* The functions in vbase for which we have already provided vcall
84 offsets. */
86 /* The vtable index of the next vcall or vbase offset. */
87 tree index;
88 /* Nonzero if we are building the initializer for the primary
89 vtable. */
91 /* Nonzero if we are building the initializer for a construction
92 vtable. */
94 /* True when adding vcall offset entries to the vtable. False when
95 merely computing the indices. */
97 };
99 /* The type of a function passed to walk_subobject_offsets. */
102 /* The stack itself. This is a dynamically resized array. The
103 number of elements allocated is CURRENT_CLASS_STACK_SIZE. */
107 /* The size of the largest empty class seen in this translation unit. */
110 /* An array of all local classes present in this translation unit, in
111 declaration order. */
150 /* Used by find_flexarrays and related functions. */
201 tree *);
211 splay_tree_key k2);
220 /* Variables shared between class.c and call.c. */
230 /* Return a COND_EXPR that executes TRUE_STMT if this execution of the
231 'structor is in charge of 'structing virtual bases, or FALSE_STMT
232 otherwise. */
234 tree
236 {
246 }
248 /* Convert to or from a base subobject. EXPR is an expression of type
249 `A' or `A*', an expression of type `B' or `B*' is returned. To
250 convert A to a base B, CODE is PLUS_EXPR and BINFO is the binfo for
251 the B base instance within A. To convert base A to derived B, CODE
252 is MINUS_EXPR and BINFO is the binfo for the A instance within B.
253 In this latter case, A must not be a morally virtual base of B.
254 NONNULL is true if EXPR is known to be non-NULL (this is only
255 needed when EXPR is of pointer type). CV qualifiers are preserved
256 from EXPR. */
258 tree
260 tree expr,
261 tree binfo,
263 tsubst_flags_t complain)
264 {
267 tree probe;
268 tree offset;
269 tree target_type;
271 tree ptr_target_type;
282 {
288 }
296 {
297 /* This can happen when adjust_result_of_qualified_name_lookup can't
298 find a unique base binfo in a call to a member function. We
299 couldn't give the diagnostic then since we might have been calling
300 a static member function, so we do it now. In other cases, eg.
301 during error recovery (c++/71979), we may not have a base at all. */
303 {
307 }
309 }
316 /* Nothing to do. */
320 {
322 {
324 {
327 "pointer to derived class %qT because the base is "
329 else
333 }
334 else
335 {
341 else
345 }
346 }
348 }
351 {
353 /* This must happen before the call to save_expr. */
355 }
356 else
362 /* TARGET_TYPE has been extracted from BINFO, and, is therefore always
363 cv-unqualified. Extract the cv-qualifiers from EXPR so that the
364 expression returned matches the input. */
365 target_type = cp_build_qualified_type
369 /* Do we need to look in the vtable for the real offset? */
372 /* Don't bother with the calculations inside sizeof; they'll ICE if the
373 source type is incomplete and the pointer value doesn't matter. In a
374 template (even in instantiate_non_dependent_expr), we don't have vtables
375 set up properly yet, and the value doesn't matter there either; we're
376 just interested in the result of overload resolution. */
379 {
382 }
384 /* If we're in an NSDMI, we don't have the full constructor context yet
385 that we need for converting to a virtual base, so just build a stub
386 CONVERT_EXPR and expand it later in bot_replace. */
389 {
393 }
395 /* Do we need to check for a null pointer? */
397 {
398 /* If we know the conversion will not actually change the value
399 of EXPR, then we can avoid testing the expression for NULL.
400 We have to avoid generating a COMPONENT_REF for a base class
401 field, because other parts of the compiler know that such
402 expressions are always non-NULL. */
406 }
408 /* Protect against multiple evaluation if necessary. */
412 /* Now that we've saved expr, build the real null test. */
414 {
418 /* This is a compiler generated comparison, don't emit
419 e.g. -Wnonnull-compare warning for it. */
421 }
423 /* If this is a simple base reference, express it as a COMPONENT_REF. */
425 /* We don't build base fields for empty bases, and they aren't very
426 interesting to the optimizers anyway. */
428 {
437 }
440 {
441 /* Going via virtual base V_BINFO. We need the static offset
442 from V_BINFO to BINFO, and the dynamic offset from D_BINFO to
443 V_BINFO. That offset is an entry in D_BINFO's vtable. */
444 tree v_offset;
447 {
448 /* In a base member initializer, we cannot rely on the
449 vtable being set up. We have to indirect via the
450 vtt_parm. */
451 tree t;
457 }
458 else
459 {
462 {
467 }
469 complain),
471 }
479 v_offset);
491 /* Negative fixed_type_p means this is a constructor or destructor;
492 virtual base layout is fixed in in-charge [cd]tors, but not in
493 base [cd]tors. */
494 offset = build_if_in_charge
496 v_offset);
497 else
499 }
507 {
512 }
513 else
516 indout:
518 {
522 }
524 out:
530 }
532 /* Subroutine of build_base_path; EXPR and BINFO are as in that function.
533 Perform a derived-to-base conversion by recursively building up a
534 sequence of COMPONENT_REFs to the appropriate base fields. */
536 static tree
538 {
541 tree field;
544 {
545 tree temp;
549 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x'
550 into `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only
551 an lvalue in the front end; only _DECLs and _REFs are lvalues
552 in the back end. */
558 }
560 /* Recurse. */
565 /* Is this the base field created by build_base_field? */
569 /* If we're looking for a field in the most-derived class,
570 also check the field offset; we can have two base fields
571 of the same type if one is an indirect virtual base and one
572 is a direct non-virtual base. */
576 {
577 /* We don't use build_class_member_access_expr here, as that
578 has unnecessary checks, and more importantly results in
579 recursive calls to dfs_walk_once. */
585 /* Mark the expression const or volatile, as appropriate.
586 Even though we've dealt with the type above, we still have
587 to mark the expression itself. */
594 }
596 /* Didn't find the base field?!? */
598 }
600 /* Convert OBJECT to the base TYPE. OBJECT is an expression whose
601 type is a class type or a pointer to a class type. In the former
602 case, TYPE is also a class type; in the latter it is another
603 pointer type. If CHECK_ACCESS is true, an error message is emitted
604 if TYPE is inaccessible. If OBJECT has pointer type, the value is
605 assumed to be non-NULL. */
607 tree
609 tsubst_flags_t complain)
610 {
611 tree binfo;
612 tree object_type;
615 {
618 }
619 else
628 }
630 /* EXPR is an expression with unqualified class type. BASE is a base
631 binfo of that class type. Returns EXPR, converted to the BASE
632 type. This function assumes that EXPR is the most derived class;
633 therefore virtual bases can be found at their static offsets. */
635 tree
637 {
638 tree expr_type;
642 {
643 /* If this is a non-empty base, use a COMPONENT_REF. */
647 /* We use fold_build2 and fold_convert below to simplify the trees
648 provided to the optimizers. It is not safe to call these functions
649 when processing a template because they do not handle C++-specific
650 trees. */
658 }
661 }
663 \f
664 tree
666 {
670 /* Can happen in case of duplicate base types (c++/59082). */
674 /* First, convert to the requested type. */
679 /* Second, the requested type may not be the owner of its own vptr.
680 If not, convert to the base class that owns it. We cannot use
681 convert_to_base here, because VCONTEXT may appear more than once
682 in the inheritance hierarchy of TYPE, and thus direct conversion
683 between the types may be ambiguous. Following the path back up
684 one step at a time via primary bases avoids the problem. */
688 {
691 }
694 }
696 /* Given an object INSTANCE, return an expression which yields the
697 vtable element corresponding to INDEX. There are many special
698 cases for INSTANCE which we take care of here, mainly to avoid
699 creating extra tree nodes when we don't have to. */
701 static tree
703 {
704 tree aref;
707 /* Try to figure out what a reference refers to, and
708 access its virtual function table directly. */
716 {
721 }
730 }
732 tree
734 {
738 }
740 /* Given a stable object pointer INSTANCE_PTR, return an expression which
741 yields a function pointer corresponding to vtable element INDEX. */
743 tree
745 {
746 tree aref;
749 tf_warning_or_error),
750 idx);
752 /* When using function descriptors, the address of the
753 vtable entry is treated as a function pointer. */
758 /* Remember this as a method reference, for later devirtualization. */
762 }
764 /* Return the name of the virtual function table (as an IDENTIFIER_NODE)
765 for the given TYPE. */
767 static tree
769 {
771 }
773 /* DECL is an entity associated with TYPE, like a virtual table or an
774 implicitly generated constructor. Determine whether or not DECL
775 should have external or internal linkage at the object file
776 level. This routine does not deal with COMDAT linkage and other
777 similar complexities; it simply sets TREE_PUBLIC if it possible for
778 entities in other translation units to contain copies of DECL, in
779 the abstract. */
781 void
783 {
786 }
788 /* Create a VAR_DECL for a primary or secondary vtable for CLASS_TYPE.
789 (For a secondary vtable for B-in-D, CLASS_TYPE should be D, not B.)
790 Use NAME for the name of the vtable, and VTABLE_TYPE for its type. */
792 static tree
794 {
795 tree decl;
798 /* vtable names are already mangled; give them their DECL_ASSEMBLER_NAME
799 now to avoid confusion in mangle_decl. */
810 /* The vtable has not been defined -- yet. */
814 /* Mark the VAR_DECL node representing the vtable itself as a
815 "gratuitous" one, thereby forcing dwarfout.c to ignore it. It
816 is rather important that such things be ignored because any
817 effort to actually generate DWARF for them will run into
818 trouble when/if we encounter code like:
820 #pragma interface
821 struct S { virtual void member (); };
823 because the artificial declaration of the vtable itself (as
824 manufactured by the g++ front end) will say that the vtable is
825 a static member of `S' but only *after* the debug output for
826 the definition of `S' has already been output. This causes
827 grief because the DWARF entry for the definition of the vtable
828 will try to refer back to an earlier *declaration* of the
829 vtable as a static member of `S' and there won't be one. We
830 might be able to arrange to have the "vtable static member"
831 attached to the member list for `S' before the debug info for
832 `S' get written (which would solve the problem) but that would
833 require more intrusive changes to the g++ front end. */
837 }
839 /* Get the VAR_DECL of the vtable for TYPE. TYPE need not be polymorphic,
840 or even complete. If this does not exist, create it. If COMPLETE is
841 nonzero, then complete the definition of it -- that will render it
842 impossible to actually build the vtable, but is useful to get at those
843 which are known to exist in the runtime. */
845 tree
847 {
848 tree decl;
857 {
860 }
863 }
865 /* Build the primary virtual function table for TYPE. If BINFO is
866 non-NULL, build the vtable starting with the initial approximation
867 that it is the same as the one which is the head of the association
868 list. Returns a nonzero value if a new vtable is actually
869 created. */
871 static int
873 {
874 tree decl;
875 tree virtuals;
880 {
882 /* We have already created a vtable for this base, so there's
883 no need to do it again. */
890 }
891 else
892 {
895 }
898 {
901 }
903 /* Initialize the association list for this type, based
904 on our first approximation. */
909 }
911 /* Give BINFO a new virtual function table which is initialized
912 with a skeleton-copy of its original initialization. The only
913 entry that changes is the `delta' entry, so we can really
914 share a lot of structure.
916 FOR_TYPE is the most derived type which caused this table to
917 be needed.
919 Returns nonzero if we haven't met BINFO before.
921 The order in which vtables are built (by calling this function) for
922 an object must remain the same, otherwise a binary incompatibility
923 can result. */
925 static int
927 {
929 /* We already created a vtable for this base. There's no need to
930 do it again. */
933 /* Remember that we've created a vtable for this BINFO, so that we
934 don't try to do so again. */
937 /* Make fresh virtual list, so we can smash it later. */
940 /* Secondary vtables are laid out as part of the same structure as
941 the primary vtable. */
944 }
946 /* Create a new vtable for BINFO which is the hierarchy dominated by
947 T. Return nonzero if we actually created a new vtable. */
949 static int
951 {
953 /* In this case, it is *type*'s vtable we are modifying. We start
954 with the approximation that its vtable is that of the
955 immediate base class. */
957 else
958 /* This is our very own copy of `basetype' to play with. Later,
959 we will fill in all the virtual functions that override the
960 virtual functions in these base classes which are not defined
961 by the current type. */
963 }
965 /* Make *VIRTUALS, an entry on the BINFO_VIRTUALS list for BINFO
966 (which is in the hierarchy dominated by T) list FNDECL as its
967 BV_FN. DELTA is the required constant adjustment from the `this'
968 pointer where the vtable entry appears to the `this' required when
969 the function is actually called. */
971 static void
973 tree binfo,
974 tree fndecl,
975 tree delta,
977 {
978 tree v;
984 {
985 /* We need a new vtable for BINFO. */
987 {
988 /* If we really did make a new vtable, we also made a copy
989 of the BINFO_VIRTUALS list. Now, we have to find the
990 corresponding entry in that list. */
995 }
1000 }
1001 }
1003 \f
1004 /* Add method METHOD to class TYPE. If USING_DECL is non-null, it is
1005 the USING_DECL naming METHOD. Returns true if the method could be
1006 added to the method vec. */
1008 bool
1010 {
1012 tree overload;
1018 tree current_fns;
1031 {
1032 /* Make a new method vector. We start with 8 entries. We must
1033 allocate at least two (for constructors and destructors), and
1034 we're going to end up with an assignment operator at some
1035 point as well. */
1037 /* Create slots for constructors and destructors. */
1041 }
1043 /* Maintain TYPE_HAS_USER_CONSTRUCTOR, etc. */
1046 /* Constructors and destructors go in special slots. */
1051 else
1052 {
1053 tree m;
1056 /* See if we already have an entry with this name. */
1060 {
1063 {
1068 }
1072 {
1075 }
1080 }
1081 }
1084 /* Check to see if we've already got this method. */
1086 {
1089 tree fn_type;
1090 tree method_type;
1091 tree parms1;
1092 tree parms2;
1097 /* Two using-declarations can coexist, we'll complain about ambiguity in
1098 overload resolution. */
1100 /* Except handle inherited constructors specially. */
1104 /* [over.load] Member function declarations with the
1105 same name and the same parameter types cannot be
1106 overloaded if any of them is a static member
1107 function declaration.
1109 [over.load] Member function declarations with the same name and
1110 the same parameter-type-list as well as member function template
1111 declarations with the same name, the same parameter-type-list, and
1112 the same template parameter lists cannot be overloaded if any of
1113 them, but not all, have a ref-qualifier.
1115 [namespace.udecl] When a using-declaration brings names
1116 from a base class into a derived class scope, member
1117 functions in the derived class override and/or hide member
1118 functions with the same name and parameter types in a base
1119 class (rather than conflicting). */
1125 /* Compare the quals on the 'this' parm. Don't compare
1126 the whole types, as used functions are treated as
1127 coming from the using class in overload resolution. */
1130 /* Either both or neither need to be ref-qualified for
1131 differing quals to allow overloading. */
1138 /* For templates, the return type and template parameters
1139 must be identical. */
1157 {
1158 /* For function versions, their parms and types match
1159 but they are not duplicates. Record function versions
1160 as and when they are found. extern "C" functions are
1161 not treated as versions. */
1167 {
1168 /* Mark functions as versions if necessary. Modify the mangled
1169 decl name if necessary. */
1171 {
1175 }
1177 {
1181 }
1184 }
1186 {
1188 {
1192 {
1194 {
1195 /* Inheriting the same constructor along different
1196 paths, combine them. */
1197 SET_DECL_INHERITED_CTOR
1200 /* And discard the new one. */
1202 }
1203 else
1204 /* Inherited ctors can coexist until overload
1205 resolution. */
1207 }
1212 basef);
1213 }
1214 /* Otherwise defer to the other function. */
1216 }
1218 {
1220 /* Defer to the local function. */
1222 }
1225 {
1226 /* Hide the inherited constructor. */
1229 }
1230 else
1231 {
1234 }
1236 /* We don't call duplicate_decls here to merge the
1237 declarations because that will confuse things if the
1238 methods have inline definitions. In particular, we
1239 will crash while processing the definitions. */
1241 }
1243 cont:
1246 else
1248 }
1250 /* A class should never have more than one destructor. */
1254 /* Add the new binding. */
1256 {
1259 }
1260 else
1269 {
1272 /* We only expect to add few methods in the COMPLETE_P case, so
1273 just make room for one more method in that case. */
1276 else
1282 else
1284 }
1285 else
1286 /* Replace the current slot. */
1289 }
1291 /* Subroutines of finish_struct. */
1293 /* Change the access of FDECL to ACCESS in T. Return 1 if change was
1294 legit, otherwise return 0. */
1296 static int
1298 {
1299 tree elem;
1308 {
1310 {
1314 else
1317 }
1318 else
1319 {
1320 /* They're changing the access to the same thing they changed
1321 it to before. That's OK. */
1322 ;
1323 }
1324 }
1325 else
1326 {
1328 tf_warning_or_error);
1331 }
1333 }
1335 /* Return the access node for DECL's access in its enclosing class. */
1337 tree
1339 {
1343 }
1345 /* Process the USING_DECL, which is a member of T. */
1347 static void
1349 {
1354 tree old_value;
1359 tf_warning_or_error);
1361 {
1367 else
1369 }
1377 ;
1379 {
1381 /* It's OK to use functions from a base when there are functions with
1383 else
1384 {
1389 }
1390 }
1392 {
1396 }
1398 /* Make type T see field decl FDECL with access ACCESS. */
1401 {
1404 }
1405 else
1407 }
1408 \f
1409 /* Data structure for find_abi_tags_r, below. */
1411 struct abi_tag_data
1412 {
1416 };
1418 /* Subroutine of find_abi_tags_r. Handle a single TAG found on the class TP
1419 in the context of P. TAG can be either an identifier (the DECL_NAME of
1420 a tag NAMESPACE_DECL) or a STRING_CST (a tag attribute). */
1422 static void
1424 {
1426 {
1428 {
1429 /* We're collecting tags from template arguments or from
1430 the type of a variable or function return type. */
1433 /* Don't inherit this tag multiple times. */
1437 {
1438 /* Tags inherited from type template arguments are only used
1439 to avoid warnings. */
1442 }
1443 /* For functions and variables we want to warn, too. */
1444 }
1446 /* Otherwise we're diagnosing missing tags. */
1448 {
1453 }
1455 {
1459 }
1461 {
1466 }
1467 else
1468 {
1472 {
1476 }
1477 }
1478 }
1479 }
1481 /* Find all the ABI tags in the attribute list ATTR and either call
1482 check_tag (if TP is non-null) or set IDENTIFIER_MARKED to val. */
1484 static void
1486 {
1493 {
1498 else
1500 }
1501 }
1503 /* Find all the ABI tags on T and its enclosing scopes and either call
1504 check_tag (if TP is non-null) or set IDENTIFIER_MARKED to val. */
1506 static void
1508 {
1510 {
1511 tree attr;
1513 {
1516 }
1517 else
1518 {
1521 }
1523 }
1524 }
1526 /* walk_tree callback for check_abi_tags: if the type at *TP involves any
1527 types with ABI tags, add the corresponding identifiers to the VEC in
1528 *DATA and set IDENTIFIER_MARKED. */
1530 static tree
1532 {
1536 /* walk_tree shouldn't be walking into any subtrees of a RECORD_TYPE
1537 anyway, but let's make sure of it. */
1545 }
1547 /* walk_tree callback for mark_abi_tags: if *TP is a class, set
1548 IDENTIFIER_MARKED on its ABI tags. */
1550 static tree
1552 {
1556 /* walk_tree shouldn't be walking into any subtrees of a RECORD_TYPE
1557 anyway, but let's make sure of it. */
1565 }
1567 /* Set IDENTIFIER_MARKED on all the ABI tags on T and its enclosing
1568 scopes. */
1570 static void
1572 {
1575 {
1578 {
1579 /* Template arguments are part of the signature. */
1582 {
1585 }
1586 }
1588 /* A function's parameter types are part of the signature, so
1589 we don't need to inherit any tags that are also in them. */
1594 }
1595 }
1597 /* Check that T has all the ABI tags that subobject SUBOB has, or
1598 warn if not. If T is a (variable or function) declaration, also
1599 return any missing tags, and add them to T if JUST_CHECKING is false. */
1601 static tree
1603 {
1611 /* No need to worry about things local to this TU. */
1627 {
1630 }
1631 else
1632 {
1636 else
1640 }
1645 }
1647 /* Check that DECL has all the ABI tags that are used in parts of its type
1648 that are not reflected in its mangled name. */
1650 void
1652 {
1659 }
1661 /* Return any ABI tags that are used in parts of the type of DECL
1662 that are not reflected in its mangled name. This function is only
1663 used in backward-compatible mangling for ABI <11. */
1665 tree
1667 {
1671 /* Don't check DECL_CONV_FN_P here like we do in check_abi_tags, so
1672 that we can use this function for setting need_abi_warning
1673 regardless of the current flag_abi_version. */
1676 else
1678 }
1680 void
1682 {
1692 {
1695 {
1699 }
1700 }
1702 // If we found some tags on our template arguments, add them to our
1703 // abi_tag attribute.
1705 {
1709 else
1713 }
1716 }
1718 /* Return true, iff class T has a non-virtual destructor that is
1719 accessible from outside the class heirarchy (i.e. is public, or
1720 there's a suitable friend. */
1722 static bool
1724 {
1727 /* An implicitly declared destructor is always public. And,
1728 if it were virtual, we would have created it by now. */
1743 }
1745 /* Run through the base classes of T, updating CANT_HAVE_CONST_CTOR_P,
1746 and NO_CONST_ASN_REF_P. Also set flag bits in T based on
1747 properties of the bases. */
1749 static void
1753 {
1757 tree base_binfo;
1758 tree binfo;
1768 {
1777 /* If any base class is non-literal, so is the derived class. */
1781 /* If the base class doesn't have copy constructors or
1782 assignment operators that take const references, then the
1783 derived class cannot have such a member automatically
1784 generated. */
1793 /* A virtual base does not effect nearly emptiness. */
1794 ;
1796 {
1798 /* And if there is more than one nearly empty base, then the
1799 derived class is not nearly empty either. */
1801 else
1802 /* Remember we've seen one. */
1804 }
1806 /* If the base class is not empty or nearly empty, then this
1807 class cannot be nearly empty. */
1810 /* A lot of properties from the bases also apply to the derived
1811 class. */
1828 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT
1831 SET_CLASSTYPE_REF_FIELDS_NEED_INIT
1837 /* A standard-layout class is a class that:
1838 ...
1839 * has no non-standard-layout base classes, */
1842 {
1843 tree basefield;
1844 /* ...has no base classes of the same type as the first non-static
1845 data member... */
1847 && (same_type_ignoring_top_level_qualifiers_p
1850 else
1851 /* ...either has no non-static data members in the most-derived
1852 class and at most one base class with non-static data
1853 members, or has no base classes with non-static data
1854 members */
1858 {
1861 else
1864 }
1865 }
1867 /* Don't bother collecting tm attributes if transactional memory
1868 support is not enabled. */
1870 {
1874 }
1877 }
1879 /* If one of the base classes had TM attributes, and the current class
1880 doesn't define its own, then the current class inherits one. */
1882 {
1885 }
1886 }
1888 /* Determine all the primary bases within T. Sets BINFO_PRIMARY_BASE_P for
1889 those that are primaries. Sets BINFO_LOST_PRIMARY_P for those
1890 that have had a nearly-empty virtual primary base stolen by some
1891 other base in the hierarchy. Determines CLASSTYPE_PRIMARY_BASE for
1892 T. */
1894 static void
1896 {
1900 tree base_binfo;
1902 /* Determine the primary bases of our bases. */
1905 {
1908 /* See if we're the non-virtual primary of our inheritance
1909 chain. */
1911 {
1918 /* We are the primary binfo. */
1920 }
1921 /* Determine if we have a virtual primary base, and mark it so.
1922 */
1924 {
1928 /* Someone already claimed this base. */
1930 else
1931 {
1932 tree delta;
1937 /* A virtual binfo might have been copied from within
1938 another hierarchy. As we're about to use it as a
1939 primary base, make sure the offsets match. */
1947 }
1948 }
1949 }
1951 /* First look for a dynamic direct non-virtual base. */
1953 {
1957 {
1960 }
1961 }
1963 /* A "nearly-empty" virtual base class can be the primary base
1964 class, if no non-virtual polymorphic base can be found. Look for
1965 a nearly-empty virtual dynamic base that is not already a primary
1966 base of something in the hierarchy. If there is no such base,
1967 just pick the first nearly-empty virtual base. */
1973 {
1975 {
1976 /* Found one that is not primary. */
1979 }
1981 /* Remember the first candidate. */
1983 }
1985 found:
1986 /* If we've got a primary base, use it. */
1988 {
1993 /* We are stealing a primary base. */
1997 {
1998 tree delta;
2001 /* A virtual binfo might have been copied from within
2002 another hierarchy. As we're about to use it as a primary
2003 base, make sure the offsets match. */
2008 }
2015 }
2016 }
2018 /* Update the variant types of T. */
2020 void
2022 {
2023 tree variants;
2029 variants;
2031 {
2032 /* These fields are in the _TYPE part of the node, not in
2033 the TYPE_LANG_SPECIFIC component, so they are not shared. */
2043 /* Copy whatever these are holding today. */
2046 }
2047 }
2049 /* KLASS is a class that we're applying may_alias to after the body is
2050 parsed. Fixup any POINTER_TO and REFERENCE_TO types. The
2051 canonical type(s) will be implicitly updated. */
2053 static void
2055 {
2056 tree t;
2062 }
2064 /* Early variant fixups: we apply attributes at the beginning of the class
2065 definition, and we need to fix up any variants that have already been
2066 made via elaborated-type-specifier so that check_qualified_type works. */
2068 void
2070 {
2071 tree variants;
2085 variants;
2087 {
2088 /* These are the two fields that check_qualified_type looks at and
2089 are affected by attributes. */
2094 else
2099 }
2100 }
2101 \f
2102 /* Set memoizing fields and bits of T (and its variants) for later
2103 use. */
2105 static void
2107 {
2108 /* Fix up variants (if any). */
2112 /* For a class w/o baseclasses, 'finish_struct' has set
2113 CLASSTYPE_PURE_VIRTUALS correctly (by definition).
2114 Similarly for a class whose base classes do not have vtables.
2115 When neither of these is true, we might have removed abstract
2116 virtuals (by providing a definition), added some (by declaring
2117 new ones), or redeclared ones from a base class. We need to
2118 recalculate what's really an abstract virtual at this point (by
2119 looking in the vtables). */
2122 /* If this type has a copy constructor or a destructor, force its
2123 mode to be BLKmode, and force its TREE_ADDRESSABLE bit to be
2124 nonzero. This will cause it to be passed by invisible reference
2125 and prevent it from being returned in a register. */
2128 {
2129 tree variants;
2132 {
2135 }
2136 }
2137 }
2139 /* Issue warnings about T having private constructors, but no friends,
2140 and so forth.
2142 HAS_NONPRIVATE_METHOD is nonzero if T has any non-private methods or
2143 static members. HAS_NONPRIVATE_STATIC_FN is nonzero if T has any
2144 non-private static member functions. */
2146 static void
2148 {
2151 tree fn;
2154 /* If the class has friends, those entities might create and
2155 access instances, so we should not warn. */
2158 /* We will have warned when the template was declared; there's
2159 no need to warn on every instantiation. */
2161 /* There's no reason to even consider warning about this
2162 class. */
2165 /* We only issue one warning, if more than one applies, because
2166 otherwise, on code like:
2168 class A {
2169 // Oops - forgot `public:'
2170 A();
2171 A(const A&);
2172 ~A();
2173 };
2175 we warn several times about essentially the same problem. */
2177 /* Check to see if all (non-constructor, non-destructor) member
2178 functions are private. (Since there are no friends or
2179 non-private statics, we can't ever call any of the private member
2180 functions.) */
2182 /* We're not interested in compiler-generated methods; they don't
2183 provide any way to call private members. */
2185 {
2187 {
2189 /* A non-private static member function is just like a
2190 friend; it can create and invoke private member
2191 functions, and be accessed without a class
2192 instance. */
2196 /* Keep searching for a static member function. */
2197 }
2200 }
2203 {
2204 /* There are no non-private methods, and there's at least one
2205 private member function that isn't a constructor or
2206 destructor. (If all the private members are
2207 constructors/destructors we want to use the code below that
2208 issues error messages specifically referring to
2209 constructors/destructors.) */
2215 {
2218 }
2220 {
2224 }
2225 }
2227 /* Even if some of the member functions are non-private, the class
2228 won't be useful for much if all the constructors or destructors
2229 are private: such an object can never be created or destroyed. */
2232 {
2235 t);
2237 }
2239 /* Warn about classes that have private constructors and no friends. */
2241 /* Implicitly generated constructors are always public. */
2244 {
2247 /* If a non-template class does not define a copy
2248 constructor, one is defined for it, enabling it to avoid
2249 this warning. For a template class, this does not
2250 happen, and so we would normally get a warning on:
2252 template <class T> class C { private: C(); };
2254 To avoid this asymmetry, we check TYPE_HAS_COPY_CTOR. All
2255 complete non-template or fully instantiated classes have this
2256 flag set. */
2259 else
2261 {
2263 /* Ideally, we wouldn't count copy constructors (or, in
2264 fact, any constructor that takes an argument of the
2265 class type as a parameter) because such things cannot
2266 be used to construct an instance of the class unless
2267 you already have one. But, for now at least, we're
2268 more generous. */
2270 {
2273 }
2274 }
2277 {
2280 t);
2282 }
2283 }
2284 }
2287 gt_pointer_operator new_value;
2291 /* Comparison function to compare two TYPE_METHOD_VEC entries by name. */
2293 static int
2295 {
2308 }
2310 /* This routine compares two fields like method_name_cmp but using the
2311 pointer operator in resort_field_decl_data. */
2313 static int
2315 {
2324 {
2331 }
2333 }
2335 /* Resort TYPE_METHOD_VEC because pointers have been reordered. */
2337 void
2340 gt_pointer_operator new_value,
2342 {
2346 tree fn;
2348 /* The type conversion ops have to live at the front of the vec, so we
2349 can't sort them. */
2357 {
2361 resort_method_name_cmp);
2362 }
2363 }
2365 /* Warn about duplicate methods in fn_fields.
2367 Sort methods that are not special (i.e., constructors, destructors,
2368 and type conversion operators) so that we can find them faster in
2369 search. */
2371 static void
2373 {
2374 tree fn_fields;
2384 /* Clear DECL_IN_AGGR_P for all functions. */
2389 /* Issue warnings about private constructors and such. If there are
2390 no methods, then some public defaults are generated. */
2393 /* The type conversion ops have to live at the front of the vec, so we
2394 can't sort them. */
2403 }
2405 /* Make BINFO's vtable have N entries, including RTTI entries,
2406 vbase and vcall offsets, etc. Set its type and call the back end
2407 to lay it out. */
2409 static void
2411 {
2412 tree atype;
2413 tree vtable;
2418 /* We may have to grow the vtable. */
2421 {
2425 }
2426 }
2428 /* True iff FNDECL and BASE_FNDECL (both non-static member functions)
2429 have the same signature. */
2431 int
2433 {
2434 /* One destructor overrides another if they are the same kind of
2435 destructor. */
2439 /* But a non-destructor never overrides a destructor, nor vice
2440 versa, nor do different kinds of destructors override
2441 one-another. For example, a complete object destructor does not
2442 override a deleting destructor. */
2451 {
2459 }
2461 }
2463 /* Returns TRUE if DERIVED is a binfo containing the binfo BASE as a
2464 subobject. */
2466 static bool
2468 {
2469 tree probe;
2472 {
2476 /* If we meet a virtual base, we can't follow the inheritance
2477 any more. See if the complete type of DERIVED contains
2478 such a virtual base. */
2481 }
2483 }
2486 /* The function for which we are trying to find a final overrider. */
2487 tree fn;
2488 /* The base class in which the function was declared. */
2489 tree declaring_base;
2490 /* The candidate overriders. */
2491 tree candidates;
2492 /* Path to most derived. */
2494 };
2496 /* Add the overrider along the current path to FFOD->CANDIDATES.
2497 Returns true if an overrider was found; false otherwise. */
2499 static bool
2503 {
2504 tree method;
2506 /* If BINFO is not the most derived type, try a more derived class.
2507 A definition there will overrider a definition here. */
2509 {
2510 depth--;
2514 }
2518 {
2521 /* Remove any candidates overridden by this new function. */
2523 {
2524 /* If *CANDIDATE overrides METHOD, then METHOD
2525 cannot override anything else on the list. */
2528 /* If METHOD overrides *CANDIDATE, remove *CANDIDATE. */
2531 else
2533 }
2535 /* Add the new function. */
2538 }
2541 }
2543 /* Called from find_final_overrider via dfs_walk. */
2545 static tree
2547 {
2555 }
2557 static tree
2559 {
2564 }
2566 /* Returns a TREE_LIST whose TREE_PURPOSE is the final overrider for
2567 FN and whose TREE_VALUE is the binfo for the base where the
2568 overriding occurs. BINFO (in the hierarchy dominated by the binfo
2569 DERIVED) is the base object in which FN is declared. */
2571 static tree
2573 {
2574 find_final_overrider_data ffod;
2576 /* Getting this right is a little tricky. This is valid:
2578 struct S { virtual void f (); };
2579 struct T { virtual void f (); };
2580 struct U : public S, public T { };
2582 even though calling `f' in `U' is ambiguous. But,
2584 struct R { virtual void f(); };
2585 struct S : virtual public R { virtual void f (); };
2586 struct T : virtual public R { virtual void f (); };
2587 struct U : public S, public T { };
2589 is not -- there's no way to decide whether to put `S::f' or
2590 `T::f' in the vtable for `R'.
2592 The solution is to look at all paths to BINFO. If we find
2593 different overriders along any two, then there is a problem. */
2597 /* Determine the depth of the hierarchy. */
2608 /* If there was no winner, issue an error message. */
2613 }
2615 /* Return the index of the vcall offset for FN when TYPE is used as a
2616 virtual base. */
2618 static tree
2620 {
2622 tree_pair_p p;
2630 /* There should always be an appropriate index. */
2632 }
2634 /* Update an entry in the vtable for BINFO, which is in the hierarchy
2635 dominated by T. FN is the old function; VIRTUALS points to the
2636 corresponding position in the new BINFO_VIRTUALS list. IX is the index
2637 of that entry in the list. */
2639 static void
2642 {
2643 tree b;
2644 tree overrider;
2645 tree delta;
2646 tree virtual_base;
2647 tree first_defn;
2653 /* Find the nearest primary base (possibly binfo itself) which defines
2654 this function; this is the class the caller will convert to when
2655 calling FN through BINFO. */
2657 {
2662 /* The nearest definition is from a lost primary. */
2665 }
2668 /* Find the final overrider. */
2671 {
2674 }
2677 /* Check for adjusting covariant return types. */
2685 /* If the overrider is invalid, don't even try. */
2687 {
2688 /* If FN is a covariant thunk, we must figure out the adjustment
2689 to the final base FN was converting to. As OVERRIDER_TARGET might
2690 also be converting to the return type of FN, we have to
2691 combine the two conversions here. */
2698 {
2702 }
2703 else
2707 /* Find the equivalent binfo within the return type of the
2708 overriding function. We will want the vbase offset from
2709 there. */
2711 over_return);
2714 {
2715 /* There was no existing virtual thunk (which takes
2716 precedence). So find the binfo of the base function's
2717 return type within the overriding function's return type.
2718 Fortunately we know the covariancy is valid (it
2719 has already been checked), so we can just iterate along
2720 the binfos, which have been chained in inheritance graph
2721 order. Of course it is lame that we have to repeat the
2722 search here anyway -- we should really be caching pieces
2723 of the vtable and avoiding this repeated work. */
2726 /* Find the base binfo within the overriding function's
2727 return type. We will always find a thunk_binfo, except
2728 when the covariancy is invalid (which we will have
2729 already diagnosed). */
2732 thunk_binfo;
2738 /* See if virtual inheritance is involved. */
2740 virtual_offset;
2747 {
2751 {
2752 /* We convert via virtual base. Adjust the fixed
2753 offset to be from there. */
2754 offset =
2758 }
2760 /* There was an existing fixed offset, this must be
2761 from the base just converted to, and the base the
2762 FN was thunking to. */
2764 else
2766 }
2767 }
2770 /* Replace the overriding function with a covariant thunk. We
2771 will emit the overriding function in its own slot as
2772 well. */
2775 }
2776 else
2780 /* If we need a covariant thunk, then we may need to adjust first_defn.
2781 The ABI specifies that the thunks emitted with a function are
2782 determined by which bases the function overrides, so we need to be
2783 sure that we're using a thunk for some overridden base; even if we
2784 know that the necessary this adjustment is zero, there may not be an
2785 appropriate zero-this-adjusment thunk for us to use since thunks for
2786 overriding virtual bases always use the vcall offset.
2788 Furthermore, just choosing any base that overrides this function isn't
2789 quite right, as this slot won't be used for calls through a type that
2790 puts a covariant thunk here. Calling the function through such a type
2791 will use a different slot, and that slot is the one that determines
2792 the thunk emitted for that base.
2794 So, keep looking until we find the base that we're really overriding
2795 in this slot: the nearest primary base that doesn't use a covariant
2796 thunk in this slot. */
2798 {
2800 /* We already know that the overrider needs a covariant thunk. */
2803 {
2810 }
2812 }
2814 /* Assume that we will produce a thunk that convert all the way to
2815 the final overrider, and not to an intermediate virtual base. */
2818 /* See if we can convert to an intermediate virtual base first, and then
2819 use the vcall offset located there to finish the conversion. */
2821 {
2822 /* If we find the final overrider, then we can stop
2823 walking. */
2828 /* If we find a virtual base, and we haven't yet found the
2829 overrider, then there is a virtual base between the
2830 declaring base (first_defn) and the final overrider. */
2832 {
2835 }
2836 }
2838 /* Compute the constant adjustment to the `this' pointer. The
2839 `this' pointer, when this function is called, will point at BINFO
2840 (or one of its primary bases, which are at the same offset). */
2842 /* The `this' pointer needs to be adjusted from the declaration to
2843 the nearest virtual base. */
2848 /* If the nearest definition is in a lost primary, we don't need an
2849 entry in our vtable. Except possibly in a constructor vtable,
2850 if we happen to get our primary back. In that case, the offset
2851 will be zero, as it will be a primary base. */
2853 else
2854 /* The `this' pointer needs to be adjusted from pointing to
2855 BINFO to pointing at the base where the final overrider
2856 appears. */
2867 else
2871 }
2873 /* Called from modify_all_vtables via dfs_walk. */
2875 static tree
2877 {
2879 tree virtuals;
2880 tree old_virtuals;
2884 /* A base without a vtable needs no modification, and its bases
2885 are uninteresting. */
2890 /* Don't do the primary vtable, if it's new. */
2894 /* There's no need to modify the vtable for a non-virtual primary
2895 base; we're not going to use that vtable anyhow. We do still
2896 need to do this for virtual primary bases, as they could become
2897 non-primary in a construction vtable. */
2902 /* Now, go through each of the virtual functions in the virtual
2903 function table for BINFO. Find the final overrider, and update
2904 the BINFO_VIRTUALS list appropriately. */
2907 virtuals;
2911 binfo,
2916 }
2918 /* Update all of the primary and secondary vtables for T. Create new
2919 vtables as required, and initialize their RTTI information. Each
2920 of the functions in VIRTUALS is declared in T and may override a
2921 virtual function from a base class; find and modify the appropriate
2922 entries to point to the overriding functions. Returns a list, in
2923 declaration order, of the virtual functions that are declared in T,
2924 but do not appear in the primary base class vtable, and which
2925 should therefore be appended to the end of the vtable for T. */
2927 static tree
2929 {
2933 /* Mangle the vtable name before entering dfs_walk (c++/51884). */
2937 /* Update all of the vtables. */
2940 /* Add virtual functions not already in our primary vtable. These
2941 will be both those introduced by this class, and those overridden
2942 from secondary bases. It does not include virtuals merely
2943 inherited from secondary bases. */
2945 {
2950 {
2951 /* We don't need to adjust the `this' pointer when
2952 calling this function. */
2956 /* This is a function not already in our vtable. Keep it. */
2958 }
2959 else
2960 /* We've already got an entry for this function. Skip it. */
2962 }
2965 }
2967 /* Get the base virtual function declarations in T that have the
2968 indicated NAME. */
2970 static void
2972 {
2973 tree methods;
2977 /* Find virtual functions in T with the indicated NAME. */
2982 methods;
2984 {
2989 {
2992 }
2993 }
2999 {
3002 }
3003 }
3005 /* If this declaration supersedes the declaration of
3006 a method declared virtual in the base class, then
3007 mark this field as being virtual as well. */
3009 void
3011 {
3014 /* In [temp.mem] we have:
3016 A specialization of a member function template does not
3017 override a virtual function from a base class. */
3024 /* Set DECL_VINDEX to a value that is neither an INTEGER_CST nor
3025 the error_mark_node so that we know it is an overriding
3026 function. */
3027 {
3034 }
3037 {
3043 }
3048 }
3050 /* Warn about hidden virtual functions that are not overridden in t.
3051 We know that constructors and destructors don't apply. */
3053 static void
3055 {
3057 tree fns;
3060 /* We go through each separately named virtual function. */
3064 {
3065 tree fn;
3066 tree name;
3067 tree fndecl;
3068 tree base_binfo;
3069 tree binfo;
3072 /* All functions in this slot in the CLASSTYPE_METHOD_VEC will
3073 have the same name. Figure out what name that is. */
3075 /* There are no possibly hidden functions yet. */
3077 /* Iterate through all of the base classes looking for possibly
3078 hidden functions. */
3081 {
3084 }
3086 /* If there are no functions to hide, continue. */
3090 /* Remove any overridden functions. */
3092 {
3096 {
3097 /* If the method from the base class has the same
3098 signature as the method from the derived class, it
3099 has been overridden. */
3104 }
3105 }
3107 /* Now give a warning for all base functions without overriders,
3108 as they are hidden. */
3110 tree base_fndecl;
3113 {
3114 /* Here we know it is a hider, and no overrider exists. */
3116 OPT_Woverloaded_virtual,
3120 }
3121 }
3122 }
3124 /* Recursive helper for finish_struct_anon. */
3126 static void
3128 {
3132 {
3133 /* We're generally only interested in entities the user
3134 declared, but we also find nested classes by noticing
3135 the TYPE_DECL that we create implicitly. You're
3136 allowed to put one anonymous union inside another,
3137 though, so we explicitly tolerate that. We use
3138 TYPE_UNNAMED_P rather than ANON_AGGR_TYPE_P so that
3139 we also allow unnamed types used for defining fields. */
3146 {
3147 /* We already complained about static data members in
3148 finish_static_data_member_decl. */
3150 {
3153 "%q#D invalid; an anonymous union can "
3155 else
3157 "%q#D invalid; an anonymous struct can "
3159 }
3161 }
3164 {
3166 {
3170 else
3173 }
3175 {
3179 else
3182 }
3183 }
3188 /* Recurse into the anonymous aggregates to handle correctly
3189 access control (c++/24926):
3191 class A {
3192 union {
3193 union {
3194 int i;
3195 };
3196 };
3197 };
3199 int j=A().i; */
3203 }
3204 }
3206 /* Check for things that are invalid. There are probably plenty of other
3207 things we should check for also. */
3209 static void
3211 {
3213 {
3222 }
3223 }
3225 /* Add T to CLASSTYPE_DECL_LIST of current_class_type which
3226 will be used later during class template instantiation.
3227 When FRIEND_P is zero, T can be a static member data (VAR_DECL),
3228 a non-static member data (FIELD_DECL), a member function
3229 (FUNCTION_DECL), a nested type (RECORD_TYPE, ENUM_TYPE),
3230 a typedef (TYPE_DECL) or a member class template (TEMPLATE_DECL)
3231 When FRIEND_P is nonzero, T is either a friend class
3232 (RECORD_TYPE, TEMPLATE_DECL) or a friend function
3233 (FUNCTION_DECL, TEMPLATE_DECL). */
3235 void
3237 {
3238 /* Save some memory by not creating TREE_LIST if TYPE is not template. */
3243 }
3245 /* This function is called from declare_virt_assop_and_dtor via
3246 dfs_walk_all.
3248 DATA is a type that direcly or indirectly inherits the base
3249 represented by BINFO. If BINFO contains a virtual assignment [copy
3250 assignment or move assigment] operator or a virtual constructor,
3251 declare that function in DATA if it hasn't been already declared. */
3253 static tree
3255 {
3263 /* A base without a vtable needs no modification, and its bases
3264 are uninteresting. */
3268 /* If this is a primary base, then we have already looked at the
3269 virtual functions of its vtable. */
3273 {
3277 {
3282 }
3286 }
3289 }
3291 /* If the class type T has a direct or indirect base that contains a
3292 virtual assignment operator or a virtual destructor, declare that
3293 function in T if it hasn't been already declared. */
3295 static void
3297 {
3305 dfs_declare_virt_assop_and_dtor,
3307 }
3309 /* Declare the inheriting constructor for class T inherited from base
3310 constructor CTOR with the parameter array PARMS of size NPARMS. */
3312 static void
3314 {
3315 /* We don't declare an inheriting ctor that would be a default,
3316 copy or move ctor for derived or base. */
3321 {
3325 }
3334 {
3337 }
3338 }
3340 /* Declare all the inheriting constructors for class T inherited from base
3341 constructor CTOR. */
3343 static void
3345 {
3349 {
3355 }
3360 {
3364 }
3367 {
3371 }
3372 }
3374 /* Create default constructors, assignment operators, and so forth for
3375 the type indicated by T, if they are needed. CANT_HAVE_CONST_CTOR,
3376 and CANT_HAVE_CONST_ASSIGNMENT are nonzero if, for whatever reason,
3377 the class cannot have a default constructor, copy constructor
3378 taking a const reference argument, or an assignment operator taking
3379 a const reference, respectively. */
3381 static void
3385 {
3393 /* Destructor. */
3395 /* In general, we create destructors lazily. */
3398 /* [class.ctor]
3400 If there is no user-declared constructor for a class, a default
3401 constructor is implicitly declared. */
3403 {
3408 /* Don't force the declaration to get a hard answer; if the
3409 definition would have made the class non-literal, it will still be
3410 non-literal because of the base or member in question, and that
3411 gives a better diagnostic. */
3413 }
3415 /* [class.ctor]
3417 If a class definition does not explicitly declare a copy
3418 constructor, one is declared implicitly. */
3420 {
3426 }
3428 /* If there is no assignment operator, one will be created if and
3429 when it is needed. For now, just record whether or not the type
3430 of the parameter to the assignment operator will be a const or
3431 non-const reference. */
3433 {
3439 }
3441 /* We can't be lazy about declaring functions that might override
3442 a virtual function from a base class. */
3446 {
3450 {
3451 /* declare, then remove the decl */
3460 }
3461 else
3463 }
3464 }
3466 /* Subroutine of insert_into_classtype_sorted_fields. Recursively
3467 count the number of fields in TYPE, including anonymous union
3468 members. */
3470 static int
3472 {
3473 tree x;
3476 {
3479 else
3481 }
3483 }
3485 /* Subroutine of insert_into_classtype_sorted_fields. Recursively add
3486 all the fields in the TREE_LIST FIELDS to the SORTED_FIELDS_TYPE
3487 elts, starting at offset IDX. */
3489 static int
3491 {
3492 tree x;
3494 {
3497 else
3499 }
3501 }
3503 /* Add all of the enum values of ENUMTYPE, to the FIELD_VEC elts,
3504 starting at offset IDX. */
3506 static int
3510 {
3511 tree values;
3515 }
3517 /* FIELD is a bit-field. We are finishing the processing for its
3518 enclosing type. Issue any appropriate messages and set appropriate
3519 flags. Returns false if an error has been diagnosed. */
3521 static bool
3523 {
3525 tree w;
3527 /* Extract the declared width of the bitfield, which has been
3528 temporarily stashed in DECL_INITIAL. */
3531 /* Remove the bit-field width indicator so that the rest of the
3532 compiler does not treat that value as an initializer. */
3535 /* Detect invalid bit-field type. */
3537 {
3540 }
3541 else
3542 {
3544 /* Avoid the non_lvalue wrapper added by fold for PLUS_EXPRs. */
3547 /* detect invalid field size. */
3553 {
3556 }
3558 {
3561 }
3563 {
3566 }
3581 }
3584 {
3588 }
3589 else
3590 {
3591 /* Non-bit-fields are aligned for their type. */
3595 }
3596 }
3598 /* FIELD is a non bit-field. We are finishing the processing for its
3599 enclosing type T. Issue any appropriate messages and set appropriate
3600 flags. */
3602 static bool
3604 tree t,
3607 {
3611 /* In C++98 an anonymous union cannot contain any fields which would change
3612 the settings of CANT_HAVE_CONST_CTOR and friends. */
3614 ;
3615 /* And, we don't set TYPE_HAS_CONST_COPY_CTOR, etc., for anonymous
3616 structs. So, we recurse through their fields here. */
3618 {
3623 cant_have_const_ctor,
3624 no_const_asn_ref);
3625 }
3626 /* Check members with class type for constructors, destructors,
3627 etc. */
3629 {
3630 /* Never let anything with uninheritable virtuals
3631 make it through without complaint. */
3635 {
3640 field);
3645 field);
3647 {
3651 }
3652 }
3653 else
3654 {
3667 }
3676 }
3681 /* `build_class_init_list' does not recognize
3682 non-FIELD_DECLs. */
3686 }
3688 /* Check the data members (both static and non-static), class-scoped
3689 typedefs, etc., appearing in the declaration of T. Issue
3690 appropriate diagnostics. Sets ACCESS_DECLS to a list (in
3691 declaration order) of access declarations; each TREE_VALUE in this
3692 list is a USING_DECL.
3694 In addition, set the following flags:
3696 EMPTY_P
3697 The class is empty, i.e., contains no non-static data members.
3699 CANT_HAVE_CONST_CTOR_P
3700 This class cannot have an implicitly generated copy constructor
3701 taking a const reference.
3703 CANT_HAVE_CONST_ASN_REF
3704 This class cannot have an implicitly generated assignment
3705 operator taking a const reference.
3707 All of these flags should be initialized before calling this
3708 function.
3710 Returns a pointer to the end of the TYPE_FIELDs chain; additional
3711 fields can be added by adding to this chain. */
3713 static void
3717 {
3725 /* Assume there are no access declarations. */
3727 /* Assume this class has no pointer members. */
3729 /* Assume none of the members of this class have default
3730 initializations. */
3734 {
3742 {
3743 /* Save the access declarations for our caller. */
3746 }
3752 /* If we've gotten this far, it's a data member, possibly static,
3753 or an enumerator. */
3757 /* When this goes into scope, it will be a non-local reference. */
3761 {
3762 /* [class.union] (C++98)
3764 If a union contains a static data member, or a member of
3765 reference type, the program is ill-formed.
3767 In C++11 [class.union] says:
3768 If a union contains a non-static data member of reference type
3769 the program is ill-formed. */
3771 {
3775 }
3778 {
3782 }
3783 }
3785 /* Perform error checking that did not get done in
3786 grokdeclarator. */
3788 {
3792 }
3794 {
3798 }
3806 /* Now it can only be a FIELD_DECL. */
3811 /* If at least one non-static data member is non-literal, the whole
3812 class becomes non-literal. Per Core/1453, volatile non-static
3813 data members and base classes are also not allowed.
3814 Note: if the type is incomplete we will complain later on. */
3819 /* A standard-layout class is a class that:
3820 ...
3821 has the same access control (Clause 11) for all non-static data members,
3822 ... */
3829 /* If this is of reference type, check if it needs an init. */
3831 {
3837 {
3838 /* ARM $12.6.2: [A member initializer list] (or, for an
3839 aggregate, initialization by a brace-enclosed list) is the
3840 only way to initialize nonstatic const and reference
3841 members. */
3844 }
3845 }
3850 {
3852 {
3853 warning_at
3856 x);
3858 }
3862 }
3865 /* We don't treat zero-width bitfields as making a class
3866 non-empty. */
3867 ;
3868 else
3869 {
3870 /* The class is non-empty. */
3872 /* The class is not even nearly empty. */
3874 /* If one of the data members contains an empty class,
3875 so does T. */
3879 }
3881 /* This is used by -Weffc++ (see below). Warn only for pointers
3882 to members which might hold dynamic memory. So do not warn
3883 for pointers to functions or pointers to members. */
3889 {
3894 }
3900 {
3902 {
3906 }
3908 {
3912 }
3913 }
3916 /* DR 148 now allows pointers to members (which are POD themselves),
3917 to be allowed in POD structs. */
3926 /* We set DECL_C_BIT_FIELD in grokbitfield.
3927 If the type and width are valid, we'll also set DECL_BIT_FIELD. */
3930 cant_have_const_ctor_p,
3931 no_const_asn_ref_p))
3932 {
3937 }
3939 /* Now that we've removed bit-field widths from DECL_INITIAL,
3940 anything left in DECL_INITIAL is an NSDMI that makes the class
3941 non-aggregate in C++11. */
3945 /* If any field is const, the structure type is pseudo-const. */
3947 {
3952 {
3953 /* ARM $12.6.2: [A member initializer list] (or, for an
3954 aggregate, initialization by a brace-enclosed list) is the
3955 only way to initialize nonstatic const and reference
3956 members. */
3959 }
3960 }
3961 /* A field that is pseudo-const makes the structure likewise. */
3963 {
3968 }
3970 /* Core issue 80: A nonstatic data member is required to have a
3971 different name from the class iff the class has a
3972 user-declared constructor. */
3977 }
3979 /* Effective C++ rule 11: if a class has dynamic memory held by pointers,
3980 it should also define a copy constructor and an assignment operator to
3981 implement the correct copy semantic (deep vs shallow, etc.). As it is
3982 not feasible to check whether the constructors do allocate dynamic memory
3983 and store it within members, we approximate the warning like this:
3985 -- Warn only if there are members which are pointers
3986 -- Warn only if there is a non-trivial constructor (otherwise,
3987 there cannot be memory allocated).
3988 -- Warn only if there is a non-trivial destructor. We assume that the
3989 user at least implemented the cleanup correctly, and a destructor
3990 is needed to free dynamic memory.
3992 This seems enough for practical purposes. */
3994 && has_pointers
3998 {
4002 {
4007 }
4011 }
4013 /* Non-static data member initializers make the default constructor
4014 non-trivial. */
4016 {
4019 }
4021 /* If any of the fields couldn't be packed, unset TYPE_PACKED. */
4025 /* Check anonymous struct/anonymous union fields. */
4028 /* We've built up the list of access declarations in reverse order.
4029 Fix that now. */
4031 }
4033 /* If TYPE is an empty class type, records its OFFSET in the table of
4034 OFFSETS. */
4036 static int
4038 {
4039 splay_tree_node n;
4044 /* Record the location of this empty object in OFFSETS. */
4052 type,
4056 }
4058 /* Returns nonzero if TYPE is an empty class type and there is
4059 already an entry in OFFSETS for the same TYPE as the same OFFSET. */
4061 static int
4063 {
4064 splay_tree_node n;
4065 tree t;
4070 /* Record the location of this empty object in OFFSETS. */
4080 }
4082 /* Walk through all the subobjects of TYPE (located at OFFSET). Call
4083 F for every subobject, passing it the type, offset, and table of
4084 OFFSETS. If VBASES_P is one, then virtual non-primary bases should
4085 be traversed.
4087 If MAX_OFFSET is non-NULL, then subobjects with an offset greater
4088 than MAX_OFFSET will not be walked.
4090 If F returns a nonzero value, the traversal ceases, and that value
4091 is returned. Otherwise, returns zero. */
4093 static int
4095 subobject_offset_fn f,
4096 tree offset,
4097 splay_tree offsets,
4098 tree max_offset,
4100 {
4104 /* If this OFFSET is bigger than the MAX_OFFSET, then we should
4105 stop. */
4113 {
4116 }
4119 {
4120 tree field;
4121 tree binfo;
4124 /* Avoid recursing into objects that are not interesting. */
4128 /* Record the location of TYPE. */
4133 /* Iterate through the direct base classes of TYPE. */
4137 {
4138 tree binfo_offset;
4143 tree orig_binfo;
4144 /* We cannot rely on BINFO_OFFSET being set for the base
4145 class yet, but the offsets for direct non-virtual
4146 bases can be calculated by going back to the TYPE. */
4149 offset,
4153 f,
4154 binfo_offset,
4155 offsets,
4156 max_offset,
4160 }
4163 {
4167 /* Iterate through the virtual base classes of TYPE. In G++
4168 3.2, we included virtual bases in the direct base class
4169 loop above, which results in incorrect results; the
4170 correct offsets for virtual bases are only known when
4171 working with the most derived type. */
4175 {
4177 f,
4179 offset,
4181 offsets,
4182 max_offset,
4186 }
4187 else
4188 {
4189 /* We still have to walk the primary base, if it is
4190 virtual. (If it is non-virtual, then it was walked
4191 above.) */
4197 {
4198 r = (walk_subobject_offsets
4203 }
4204 }
4205 }
4207 /* Iterate through the fields of TYPE. */
4212 {
4213 tree field_offset;
4218 f,
4220 offset,
4221 field_offset),
4222 offsets,
4223 max_offset,
4227 }
4228 }
4230 {
4233 tree index;
4235 /* Avoid recursing into objects that are not interesting. */
4238 || !domain
4242 /* Step through each of the elements in the array. */
4246 {
4248 f,
4249 offset,
4250 offsets,
4251 max_offset,
4257 /* If this new OFFSET is bigger than the MAX_OFFSET, then
4258 there's no point in iterating through the remaining
4259 elements of the array. */
4262 }
4263 }
4266 }
4268 /* Record all of the empty subobjects of TYPE (either a type or a
4269 binfo). If IS_DATA_MEMBER is true, then a non-static data member
4270 is being placed at OFFSET; otherwise, it is a base class that is
4271 being placed at OFFSET. */
4273 static void
4275 tree offset,
4276 splay_tree offsets,
4278 {
4279 tree max_offset;
4280 /* If recording subobjects for a non-static data member or a
4281 non-empty base class , we do not need to record offsets beyond
4282 the size of the biggest empty class. Additional data members
4283 will go at the end of the class. Additional base classes will go
4284 either at offset zero (if empty, in which case they cannot
4285 overlap with offsets past the size of the biggest empty class) or
4286 at the end of the class.
4288 However, if we are placing an empty base class, then we must record
4289 all offsets, as either the empty class is at offset zero (where
4290 other empty classes might later be placed) or at the end of the
4291 class (where other objects might then be placed, so other empty
4292 subobjects might later overlap). */
4296 else
4300 }
4302 /* Returns nonzero if any of the empty subobjects of TYPE (located at
4303 OFFSET) conflict with entries in OFFSETS. If VBASES_P is nonzero,
4304 virtual bases of TYPE are examined. */
4306 static int
4308 tree offset,
4309 splay_tree offsets,
4311 {
4312 splay_tree_node max_node;
4314 /* Get the node in OFFSETS that indicates the maximum offset where
4315 an empty subobject is located. */
4317 /* If there aren't any empty subobjects, then there's no point in
4318 performing this check. */
4324 vbases_p);
4325 }
4327 /* DECL is a FIELD_DECL corresponding either to a base subobject of a
4328 non-static data member of the type indicated by RLI. BINFO is the
4329 binfo corresponding to the base subobject, OFFSETS maps offsets to
4330 types already located at those offsets. This function determines
4331 the position of the DECL. */
4333 static void
4335 tree decl,
4336 tree binfo,
4337 splay_tree offsets)
4338 {
4341 tree type;
4344 {
4345 /* For the purposes of determining layout conflicts, we want to
4346 use the class type of BINFO; TREE_TYPE (DECL) will be the
4347 CLASSTYPE_AS_BASE version, which does not contain entries for
4348 zero-sized bases. */
4351 }
4352 else
4353 {
4356 }
4358 /* Try to place the field. It may take more than one try if we have
4359 a hard time placing the field without putting two objects of the
4360 same type at the same address. */
4362 {
4365 /* Place this field. */
4369 /* We have to check to see whether or not there is already
4370 something of the same type at the offset we're about to use.
4371 For example, consider:
4373 struct S {};
4374 struct T : public S { int i; };
4375 struct U : public S, public T {};
4377 Here, we put S at offset zero in U. Then, we can't put T at
4378 offset zero -- its S component would be at the same address
4379 as the S we already allocated. So, we have to skip ahead.
4380 Since all data members, including those whose type is an
4381 empty class, have nonzero size, any overlap can happen only
4382 with a direct or indirect base-class -- it can't happen with
4383 a data member. */
4384 /* In a union, overlap is permitted; all members are placed at
4385 offset zero. */
4390 {
4391 /* Strip off the size allocated to this field. That puts us
4392 at the first place we could have put the field with
4393 proper alignment. */
4396 /* Bump up by the alignment required for the type. */
4397 rli->bitpos
4403 }
4406 {
4407 /* Before ABI v9, we were giving nullptr_t alignment of 1; if
4408 the offset wasn't aligned like a pointer when we started to
4409 layout this field, that affects its position. */
4412 {
4415 "alignment of %qD increased in -fabi-version=9 "
4417 else
4420 }
4422 }
4423 else
4424 /* There was no conflict. We're done laying out this field. */
4426 }
4428 /* Now that we know where it will be placed, update its
4429 BINFO_OFFSET. */
4431 /* Indirect virtual bases may have a nonzero BINFO_OFFSET at
4432 this point because their BINFO_OFFSET is copied from another
4433 hierarchy. Therefore, we may not need to add the entire
4434 OFFSET. */
4440 }
4442 /* Returns true if TYPE is empty and OFFSET is nonzero. */
4444 static int
4446 tree offset,
4448 {
4450 }
4452 /* Layout the empty base BINFO. EOC indicates the byte currently just
4453 past the end of the class, and should be correctly aligned for a
4454 class of the type indicated by BINFO; OFFSETS gives the offsets of
4455 the empty bases allocated so far. T is the most derived
4456 type. Return nonzero iff we added it at the end. */
4458 static bool
4461 {
4462 tree alignment;
4466 /* This routine should only be used for empty classes. */
4471 propagate_binfo_offsets
4475 /* This is an empty base class. We first try to put it at offset
4476 zero. */
4479 offsets,
4481 {
4482 /* That didn't work. Now, we move forward from the next
4483 available spot in the class. */
4487 {
4490 offsets,
4492 /* We finally found a spot where there's no overlap. */
4495 /* There's overlap here, too. Bump along to the next spot. */
4497 }
4498 }
4501 {
4506 }
4509 }
4511 /* Build the FIELD_DECL for BASETYPE as a base of T, add it to the chain of
4512 fields at NEXT_FIELD, and return it. */
4514 static tree
4516 {
4517 /* Create the FIELD_DECL. */
4531 /* Add the new FIELD_DECL to the list of fields for T. */
4537 }
4539 /* Layout the base given by BINFO in the class indicated by RLI.
4540 *BASE_ALIGN is a running maximum of the alignments of
4541 any base class. OFFSETS gives the location of empty base
4542 subobjects. T is the most derived type. Return nonzero if the new
4543 object cannot be nearly-empty. A new FIELD_DECL is inserted at
4544 *NEXT_FIELD, unless BINFO is for an empty base class.
4546 Returns the location at which the next field should be inserted. */
4551 {
4556 /* This error is now reported in xref_tag, thus giving better
4557 location information. */
4560 /* Place the base class. */
4562 {
4563 tree decl;
4565 /* The containing class is non-empty because it has a non-empty
4566 base class. */
4569 /* Create the FIELD_DECL. */
4572 /* Try to place the field. It may take more than one try if we
4573 have a hard time placing the field without putting two
4574 objects of the same type at the same address. */
4576 }
4577 else
4578 {
4579 tree eoc;
4582 /* On some platforms (ARM), even empty classes will not be
4583 byte-aligned. */
4588 /* A nearly-empty class "has no proper base class that is empty,
4589 not morally virtual, and at an offset other than zero." */
4591 {
4594 /* The check above (used in G++ 3.2) is insufficient because
4595 an empty class placed at offset zero might itself have an
4596 empty base at a nonzero offset. */
4598 empty_base_at_nonzero_offset_p,
4599 size_zero_node,
4604 }
4606 /* We used to not create a FIELD_DECL for empty base classes because of
4607 back end issues with overlapping FIELD_DECLs, but that doesn't seem to
4608 be a problem anymore. We need them to handle initialization of C++17
4609 aggregate bases. */
4611 {
4616 }
4618 /* An empty virtual base causes a class to be non-empty
4619 -- but in that case we do not need to clear CLASSTYPE_EMPTY_P
4620 here because that was already done when the virtual table
4621 pointer was created. */
4622 }
4624 /* Record the offsets of BINFO and its base subobjects. */
4627 offsets,
4631 }
4633 /* Layout all of the non-virtual base classes. Record empty
4634 subobjects in OFFSETS. T is the most derived type. Return nonzero
4635 if the type cannot be nearly empty. The fields created
4636 corresponding to the base classes will be inserted at
4637 *NEXT_FIELD. */
4639 static void
4642 {
4643 /* Chain to hold all the new FIELD_DECLs which stand in for base class
4644 subobjects. */
4649 /* The primary base class is always allocated first. */
4654 /* Now allocate the rest of the bases. */
4656 {
4657 tree base_binfo;
4661 /* The primary base was already allocated above, so we don't
4662 need to allocate it again here. */
4666 /* Virtual bases are added at the end (a primary virtual base
4667 will have already been added). */
4673 }
4674 }
4676 /* Go through the TYPE_METHODS of T issuing any appropriate
4677 diagnostics, figuring out which methods override which other
4678 methods, and so forth. */
4680 static void
4682 {
4683 tree x;
4686 {
4690 /* The name of the field is the original field name
4691 Save this in auxiliary field for later overloading. */
4693 {
4697 }
4698 /* All user-provided destructors are non-trivial.
4699 Constructors and assignment ops are handled in
4700 grok_special_member_properties. */
4706 "%<transaction_safe_dynamic%> may only be specified for "
4708 }
4709 }
4711 /* FN is a constructor or destructor. Clone the declaration to create
4712 a specialized in-charge or not-in-charge version, as indicated by
4713 NAME. */
4715 static tree
4717 {
4718 tree parms;
4719 tree clone;
4721 /* Copy the function. */
4723 /* Reset the function name. */
4725 /* Remember where this function came from. */
4727 /* Make it easy to find the CLONE given the FN. */
4731 /* If this is a template, do the rest on the DECL_TEMPLATE_RESULT. */
4733 {
4740 }
4741 else
4742 {
4743 // Clone constraints.
4747 }
4752 /* There's no pending inline data for this function. */
4756 /* The base-class destructor is not virtual. */
4758 {
4762 }
4764 /* If there was an in-charge parameter, drop it from the function
4765 type. */
4767 {
4768 tree basetype;
4769 tree parmtypes;
4770 tree exceptions;
4775 /* Skip the `this' parameter. */
4777 /* Skip the in-charge parameter. */
4779 /* And the VTT parm, in a complete [cd]tor. */
4783 /* If this is subobject constructor or destructor, add the vtt
4784 parameter. */
4788 parmtypes);
4791 exceptions);
4795 }
4797 /* Copy the function parameters. */
4799 /* Remove the in-charge parameter. */
4801 {
4805 }
4806 /* And the VTT parm, in a complete [cd]tor. */
4808 {
4811 else
4812 {
4816 }
4817 }
4819 /* A base constructor inheriting from a virtual base doesn't get the
4820 arguments. */
4825 {
4828 }
4830 /* Create the RTL for this function. */
4835 }
4837 /* Implementation of DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P, do
4838 not invoke this function directly.
4840 For a non-thunk function, returns the address of the slot for storing
4841 the function it is a clone of. Otherwise returns NULL_TREE.
4843 If JUST_TESTING, looks through TEMPLATE_DECL and returns NULL if
4844 cloned_function is unset. This is to support the separate
4845 DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P modes; using the latter
4846 on a template makes sense, but not the former. */
4848 tree *
4850 {
4858 {
4859 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4862 else
4863 #endif
4865 }
4870 else
4872 }
4874 /* Produce declarations for all appropriate clones of FN. If
4875 UPDATE_METHOD_VEC_P is nonzero, the clones are added to the
4876 CLASTYPE_METHOD_VEC as well. */
4878 void
4880 {
4881 tree clone;
4883 /* Avoid inappropriate cloning. */
4889 {
4890 /* For each constructor, we need two variants: an in-charge version
4891 and a not-in-charge version. */
4898 }
4899 else
4900 {
4903 /* For each destructor, we need three variants: an in-charge
4904 version, a not-in-charge version, and an in-charge deleting
4905 version. We clone the deleting version first because that
4906 means it will go second on the TYPE_METHODS list -- and that
4907 corresponds to the correct layout order in the virtual
4908 function table.
4910 For a non-virtual destructor, we do not build a deleting
4911 destructor. */
4913 {
4917 }
4924 }
4926 /* Note that this is an abstract function that is never emitted. */
4928 }
4930 /* DECL is an in charge constructor, which is being defined. This will
4931 have had an in class declaration, from whence clones were
4932 declared. An out-of-class definition can specify additional default
4933 arguments. As it is the clones that are involved in overload
4934 resolution, we must propagate the information from the DECL to its
4935 clones. */
4937 void
4939 {
4940 tree clone;
4944 {
4951 /* Skip the 'this' parameter. */
4967 {
4972 {
4973 /* A default parameter has been added. Adjust the
4974 clone's parameters. */
4978 tree type;
4983 {
4986 clone_parms);
4988 }
4991 clone_parms);
5000 }
5001 }
5003 }
5004 }
5006 /* For each of the constructors and destructors in T, create an
5007 in-charge and not-in-charge variant. */
5009 static void
5011 {
5012 tree fns;
5014 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
5015 out now. */
5023 }
5025 /* Deduce noexcept for a destructor DTOR. */
5027 void
5029 {
5031 {
5034 }
5035 }
5037 /* For each destructor in T, deduce noexcept:
5039 12.4/3: A declaration of a destructor that does not have an
5040 exception-specification is implicitly considered to have the
5041 same exception-specification as an implicit declaration (15.4). */
5043 static void
5045 {
5046 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
5047 out now. */
5053 }
5055 /* Subroutine of set_one_vmethod_tm_attributes. Search base classes
5056 of TYPE for virtual functions which FNDECL overrides. Return a
5057 mask of the tm attributes found therein. */
5059 static int
5061 {
5063 tree base_binfo;
5067 {
5075 {
5079 else
5082 }
5083 else
5085 }
5088 }
5090 /* Subroutine of set_method_tm_attributes. Handle the checks and
5091 inheritance for one virtual method FNDECL. */
5093 static void
5095 {
5096 tree tm_attr;
5101 /* If FNDECL doesn't actually override anything (i.e. T is the
5102 class that first declares FNDECL virtual), then we're done. */
5109 /* Intel STM Language Extension 3.0, Section 4.2 table 4:
5110 tm_pure must match exactly, otherwise no weakening of
5111 tm_safe > tm_callable > nothing. */
5112 /* ??? The tm_pure attribute didn't make the transition to the
5113 multivendor language spec. */
5115 {
5117 {
5120 }
5121 }
5122 /* If the overridden function is tm_pure, then FNDECL must be. */
5125 /* Look for base class combinations that cannot be satisfied. */
5127 {
5133 }
5134 /* If FNDECL did not declare an attribute, then inherit the most
5135 restrictive one. */
5137 {
5139 }
5140 /* Otherwise validate that we're not weaker than a function
5141 that is being overridden. */
5142 else
5143 {
5147 }
5150 err_override:
5154 }
5156 /* For each of the methods in T, propagate a class-level tm attribute. */
5158 static void
5160 {
5163 /* Don't bother collecting tm attributes if transactional memory
5164 support is not enabled. */
5168 /* Process virtual methods first, as they inherit directly from the
5169 base virtual function and also require validation of new attributes. */
5171 {
5172 tree vchain;
5175 {
5180 }
5181 }
5183 /* If the class doesn't have an attribute, nothing more to do. */
5188 /* Any method that does not yet have a tm attribute inherits
5189 the one from the class. */
5191 {
5194 }
5195 }
5197 /* Returns true if FN is a default constructor. */
5199 bool
5201 {
5204 }
5206 /* Returns true iff class T has a user-defined constructor that can be called
5207 with more than zero arguments. */
5209 bool
5211 {
5212 tree fns;
5218 {
5225 }
5228 }
5230 /* Returns the defaulted constructor if T has one. Otherwise, returns
5231 NULL_TREE. */
5233 tree
5235 {
5240 {
5246 }
5249 }
5251 /* Returns true iff FN is a user-provided function, i.e. user-declared
5252 and not defaulted at its first declaration. */
5254 bool
5256 {
5259 else
5263 }
5265 /* Returns true iff class T has a user-provided constructor. */
5267 bool
5269 {
5270 tree fns;
5278 /* This can happen in error cases; avoid crashing. */
5287 }
5289 /* Returns true iff class T has a user-provided or explicit constructor. */
5291 bool
5293 {
5294 tree fns;
5302 /* This can happen in error cases; avoid crashing. */
5307 {
5311 }
5314 }
5316 /* Returns true iff class T has a non-user-provided (i.e. implicitly
5317 declared or explicitly defaulted in the class body) default
5318 constructor. */
5320 bool
5322 {
5323 tree fns;
5331 {
5337 }
5340 }
5342 /* TYPE is being used as a virtual base, and has a non-trivial move
5343 assignment. Return true if this is due to there being a user-provided
5344 move assignment in TYPE or one of its subobjects; if there isn't, then
5345 multiple move assignment can't cause any harm. */
5347 bool
5349 {
5350 /* Does the type itself have a user-provided move assignment operator? */
5354 {
5358 }
5360 /* Do any of its bases? */
5362 tree base_binfo;
5367 /* Or non-static data members? */
5369 {
5374 }
5376 /* Seems not. */
5378 }
5380 /* If default-initialization leaves part of TYPE uninitialized, returns
5381 a DECL for the field or TYPE itself (DR 253). */
5383 tree
5385 {
5396 {
5400 }
5405 {
5409 }
5412 }
5414 /* Returns true iff for class T, a trivial synthesized default constructor
5415 would be constexpr. */
5417 bool
5419 {
5420 /* A defaulted trivial default constructor is constexpr
5421 if there is nothing to initialize. */
5424 }
5426 /* Returns true iff class T has a constexpr default constructor. */
5428 bool
5430 {
5431 tree fns;
5434 {
5435 /* The caller should have stripped an enclosing array. */
5438 }
5440 {
5443 /* Non-trivial, we need to check subobject constructors. */
5445 }
5448 }
5450 /* Returns true iff class T has a constexpr default constructor or has an
5451 implicitly declared default constructor that we can't tell if it's constexpr
5452 without forcing a lazy declaration (which might cause undesired
5453 instantiations). */
5455 bool
5457 {
5460 /* Assume it's constexpr. */
5463 }
5465 /* Returns true iff class TYPE has a virtual destructor. */
5467 bool
5469 {
5470 tree dtor;
5478 }
5480 /* Returns true iff class T has a move constructor. */
5482 bool
5484 {
5485 tree fns;
5488 {
5491 }
5501 }
5503 /* Returns true iff class T has a move assignment operator. */
5505 bool
5507 {
5508 tree fns;
5511 {
5514 }
5522 }
5524 /* Returns true iff class T has a move constructor that was explicitly
5525 declared in the class body. Note that this is different from
5526 "user-provided", which doesn't include functions that are defaulted in
5527 the class. */
5529 bool
5531 {
5532 tree fns;
5541 {
5545 }
5548 }
5550 /* Returns true iff class T has a move assignment operator that was
5551 explicitly declared in the class body. */
5553 bool
5555 {
5556 tree fns;
5563 {
5567 }
5570 }
5572 /* Nonzero if we need to build up a constructor call when initializing an
5573 object of this class, either because it has a user-declared constructor
5574 or because it doesn't have a default constructor (so we need to give an
5575 error if no initializer is provided). Use TYPE_NEEDS_CONSTRUCTING when
5576 what you care about is whether or not an object can be produced by a
5577 constructor (e.g. so we don't set TREE_READONLY on const variables of
5578 such type); use this function when what you care about is whether or not
5579 to try to call a constructor to create an object. The latter case is
5580 the former plus some cases of constructors that cannot be called. */
5582 bool
5584 {
5585 tree inner;
5595 /* A user-declared constructor might be private, and a constructor might
5596 be trivial but deleted. */
5599 {
5604 }
5606 }
5608 /* Like type_build_ctor_call, but for destructors. */
5610 bool
5612 {
5613 tree inner;
5622 /* A user-declared destructor might be private, and a destructor might
5623 be trivial but deleted. */
5626 {
5631 }
5633 }
5635 /* Remove all zero-width bit-fields from T. */
5637 static void
5639 {
5644 {
5647 /* We should not be confused by the fact that grokbitfield
5648 temporarily sets the width of the bit field into
5649 DECL_INITIAL (*fieldsp).
5650 check_bitfield_decl eventually sets DECL_SIZE (*fieldsp)
5651 to that width. */
5655 else
5657 }
5658 }
5660 /* Returns TRUE iff we need a cookie when dynamically allocating an
5661 array whose elements have the indicated class TYPE. */
5663 static bool
5665 {
5666 tree fns;
5671 /* If there's a non-trivial destructor, we need a cookie. In order
5672 to iterate through the array calling the destructor for each
5673 element, we'll have to know how many elements there are. */
5677 /* If the usual deallocation function is a two-argument whose second
5678 argument is of type `size_t', then we have to pass the size of
5679 the array to the deallocation function, so we will need to store
5680 a cookie. */
5684 /* If there are no `operator []' members, or the lookup is
5685 ambiguous, then we don't need a cookie. */
5688 /* Loop through all of the functions. */
5690 {
5691 tree fn;
5692 tree second_parm;
5694 /* Select the current function. */
5696 /* See if this function is a one-argument delete function. If
5697 it is, then it will be the usual deallocation function. */
5701 /* Do not consider this function if its second argument is an
5702 ellipsis. */
5705 /* Otherwise, if we have a two-argument function and the second
5706 argument is `size_t', it will be the usual deallocation
5707 function -- unless there is one-argument function, too. */
5711 }
5714 }
5716 /* Finish computing the `literal type' property of class type T.
5718 At this point, we have already processed base classes and
5719 non-static data members. We need to check whether the copy
5720 constructor is trivial, the destructor is trivial, and there
5721 is a trivial default constructor or at least one constexpr
5722 constructor other than the copy constructor. */
5724 static void
5726 {
5727 tree fn;
5743 {
5746 {
5750 }
5751 }
5752 }
5754 /* T is a non-literal type used in a context which requires a constant
5755 expression. Explain why it isn't literal. */
5757 void
5759 {
5769 /* Already explained. */
5778 {
5780 "default constructor, and has no constexpr constructor that "
5783 {
5784 /* Note that we can't simply call locate_ctor because when the
5785 constructor is deleted it just returns NULL_TREE. */
5786 tree fns;
5788 {
5795 {
5798 else
5801 }
5802 }
5803 }
5804 }
5805 else
5806 {
5810 {
5813 {
5818 }
5819 }
5821 {
5822 tree ftype;
5827 {
5830 field);
5833 }
5837 }
5838 }
5839 }
5841 /* Check the validity of the bases and members declared in T. Add any
5842 implicitly-generated functions (like copy-constructors and
5843 assignment operators). Compute various flag bits (like
5844 CLASSTYPE_NON_LAYOUT_POD_T) for T. This routine works purely at the C++
5845 level: i.e., independently of the ABI in use. */
5847 static void
5849 {
5850 /* Nonzero if the implicitly generated copy constructor should take
5851 a non-const reference argument. */
5853 /* Nonzero if the implicitly generated assignment operator
5854 should take a non-const reference argument. */
5856 tree access_decls;
5859 tree fn;
5861 /* By default, we use const reference arguments and generate default
5862 constructors. */
5866 /* Check all the base-classes and set FMEM members to point to arrays
5867 of potential interest. */
5870 /* Deduce noexcept on destructors. This needs to happen after we've set
5871 triviality flags appropriately for our bases. */
5875 /* Check all the method declarations. */
5878 /* Save the initial values of these flags which only indicate whether
5879 or not the class has user-provided functions. As we analyze the
5880 bases and members we can set these flags for other reasons. */
5884 /* Check all the data member declarations. We cannot call
5885 check_field_decls until we have called check_bases check_methods,
5886 as check_field_decls depends on TYPE_HAS_NONTRIVIAL_DESTRUCTOR
5887 being set appropriately. */
5892 /* A nearly-empty class has to be vptr-containing; a nearly empty
5893 class contains just a vptr. */
5897 /* Do some bookkeeping that will guide the generation of implicitly
5898 declared member functions. */
5901 /* We need to call a constructor for this class if it has a
5902 user-provided constructor, or if the default constructor is going
5903 to initialize the vptr. (This is not an if-and-only-if;
5904 TYPE_NEEDS_CONSTRUCTING is set elsewhere if bases or members
5905 themselves need constructing.) */
5908 /* [dcl.init.aggr]
5910 An aggregate is an array or a class with no user-provided
5911 constructors ... and no virtual functions.
5913 Again, other conditions for being an aggregate are checked
5914 elsewhere. */
5918 /* This is the C++98/03 definition of POD; it changed in C++0x, but we
5919 retain the old definition internally for ABI reasons. */
5928 /* If the only explicitly declared default constructor is user-provided,
5929 set TYPE_HAS_COMPLEX_DFLT. */
5935 /* Warn if a public base of a polymorphic type has an accessible
5936 non-virtual destructor. It is only now that we know the class is
5937 polymorphic. Although a polymorphic base will have a already
5938 been diagnosed during its definition, we warn on use too. */
5940 {
5943 tree base_binfo;
5947 {
5955 basetype);
5956 }
5957 }
5959 /* If the class has no user-declared constructor, but does have
5960 non-static const or reference data members that can never be
5961 initialized, issue a warning. */
5963 /* Classes with user-declared constructors are presumed to
5964 initialize these members. */
5966 /* Aggregates can be initialized with brace-enclosed
5967 initializers. */
5969 {
5970 tree field;
5973 {
5974 tree type;
5991 }
5992 }
5994 /* Synthesize any needed methods. */
5996 cant_have_const_ctor,
5997 no_const_asn_ref);
5999 /* Check defaulted declarations here so we have cant_have_const_ctor
6000 and don't need to worry about clones. */
6003 {
6006 {
6007 bool imp_const_p
6013 /* If the function is defaulted outside the class, we just
6014 give the synthesis error. */
6017 }
6019 }
6022 {
6023 /* "This class type is not an aggregate." */
6025 }
6027 /* Compute the 'literal type' property before we
6028 do anything with non-static member functions. */
6031 /* Create the in-charge and not-in-charge variants of constructors
6032 and destructors. */
6035 /* Process the using-declarations. */
6039 /* Build and sort the CLASSTYPE_METHOD_VEC. */
6042 /* Figure out whether or not we will need a cookie when dynamically
6043 allocating an array of this type. */
6046 }
6048 /* If T needs a pointer to its virtual function table, set TYPE_VFIELD
6049 accordingly. If a new vfield was created (because T doesn't have a
6050 primary base class), then the newly created field is returned. It
6051 is not added to the TYPE_FIELDS list; it is the caller's
6052 responsibility to do that. Accumulate declared virtual functions
6053 on VIRTUALS_P. */
6055 static tree
6057 {
6058 tree fn;
6060 /* Collect the virtual functions declared in T. */
6065 {
6074 }
6076 /* If we couldn't find an appropriate base class, create a new field
6077 here. Even if there weren't any new virtual functions, we might need a
6078 new virtual function table if we're supposed to include vptrs in
6079 all classes that need them. */
6081 {
6082 /* We build this decl with vtbl_ptr_type_node, which is a
6083 `vtable_entry_type*'. It might seem more precise to use
6084 `vtable_entry_type (*)[N]' where N is the number of virtual
6085 functions. However, that would require the vtable pointer in
6086 base classes to have a different type than the vtable pointer
6087 in derived classes. We could make that happen, but that
6088 still wouldn't solve all the problems. In particular, the
6089 type-based alias analysis code would decide that assignments
6090 to the base class vtable pointer can't alias assignments to
6091 the derived class vtable pointer, since they have different
6092 types. Thus, in a derived class destructor, where the base
6093 class constructor was inlined, we could generate bad code for
6094 setting up the vtable pointer.
6096 Therefore, we use one type for all vtable pointers. We still
6097 use a type-correct type; it's just doesn't indicate the array
6098 bounds. That's better than using `void*' or some such; it's
6099 cleaner, and it let's the alias analysis code know that these
6100 stores cannot alias stores to void*! */
6101 tree field;
6114 /* This class is non-empty. */
6118 }
6121 }
6123 /* Add OFFSET to all base types of BINFO which is a base in the
6124 hierarchy dominated by T.
6126 OFFSET, which is a type offset, is number of bytes. */
6128 static void
6130 {
6132 tree primary_binfo;
6133 tree base_binfo;
6135 /* Update BINFO's offset. */
6140 offset));
6142 /* Find the primary base class. */
6148 /* Scan all of the bases, pushing the BINFO_OFFSET adjust
6149 downwards. */
6151 {
6152 /* Don't do the primary base twice. */
6160 }
6161 }
6163 /* Set BINFO_OFFSET for all of the virtual bases for RLI->T. Update
6164 TYPE_ALIGN and TYPE_SIZE for T. OFFSETS gives the location of
6165 empty subobjects of T. */
6167 static void
6169 {
6170 tree vbase;
6177 /* Find the last field. The artificial fields created for virtual
6178 bases will go after the last extant field to date. */
6183 /* Go through the virtual bases, allocating space for each virtual
6184 base that is not already a primary base class. These are
6185 allocated in inheritance graph order. */
6187 {
6192 {
6193 /* This virtual base is not a primary base of any class in the
6194 hierarchy, so we have to add space for it. */
6197 }
6198 }
6199 }
6201 /* Returns the offset of the byte just past the end of the base class
6202 BINFO. */
6204 static tree
6206 {
6207 tree size;
6212 /* An empty class has zero CLASSTYPE_SIZE_UNIT, but we need to
6213 allocate some space for it. It cannot have virtual bases, so
6214 TYPE_SIZE_UNIT is fine. */
6216 else
6220 }
6222 /* Returns the offset of the byte just past the end of the base class
6223 with the highest offset in T. If INCLUDE_VIRTUALS_P is zero, then
6224 only non-virtual bases are included. */
6226 static tree
6228 {
6231 tree binfo;
6232 tree base_binfo;
6233 tree offset;
6238 {
6248 }
6253 {
6257 }
6260 }
6262 /* Warn about bases of T that are inaccessible because they are
6263 ambiguous. For example:
6265 struct S {};
6266 struct T : public S {};
6267 struct U : public S, public T {};
6269 Here, `(S*) new U' is not allowed because there are two `S'
6270 subobjects of U. */
6272 static void
6274 {
6277 tree basetype;
6278 tree binfo;
6279 tree base_binfo;
6281 /* If there are no repeated bases, nothing can be ambiguous. */
6285 /* Check direct bases. */
6288 {
6294 }
6296 /* Check for ambiguous virtual bases. */
6300 {
6306 }
6307 }
6309 /* Compare two INTEGER_CSTs K1 and K2. */
6311 static int
6313 {
6315 }
6317 /* Increase the size indicated in RLI to account for empty classes
6318 that are "off the end" of the class. */
6320 static void
6322 {
6323 tree eoc;
6324 tree rli_size;
6326 /* It might be the case that we grew the class to allocate a
6327 zero-sized base class. That won't be reflected in RLI, yet,
6328 because we are willing to overlay multiple bases at the same
6329 offset. However, now we need to make sure that RLI is big enough
6330 to reflect the entire class. */
6336 {
6337 /* The size should have been rounded to a whole byte. */
6340 rli->bitpos
6349 }
6350 }
6352 /* Calculate the TYPE_SIZE, TYPE_ALIGN, etc for T. Calculate
6353 BINFO_OFFSETs for all of the base-classes. Position the vtable
6354 pointer. Accumulate declared virtual functions on VIRTUALS_P. */
6356 static void
6358 {
6359 tree non_static_data_members;
6360 tree field;
6361 tree vptr;
6362 record_layout_info rli;
6363 /* Maps offsets (represented as INTEGER_CSTs) to a TREE_LIST of
6364 types that appear at that offset. */
6365 splay_tree empty_base_offsets;
6366 /* True if the last field laid out was a bit-field. */
6368 /* The location at which the next field should be inserted. */
6370 /* T, as a base class. */
6371 tree base_t;
6373 /* Keep track of the first non-static data member. */
6376 /* Start laying out the record. */
6379 /* Mark all the primary bases in the hierarchy. */
6382 /* Create a pointer to our virtual function table. */
6385 /* The vptr is always the first thing in the class. */
6387 {
6392 }
6393 else
6396 /* Build FIELD_DECLs for all of the non-virtual base-types. */
6401 /* Layout the non-static data members. */
6403 {
6404 tree type;
6405 tree padding;
6407 /* We still pass things that aren't non-static data members to
6408 the back end, in case it wants to do something with them. */
6410 {
6412 /* If the static data member has incomplete type, keep track
6413 of it so that it can be completed later. (The handling
6414 of pending statics in finish_record_layout is
6415 insufficient; consider:
6417 struct S1;
6418 struct S2 { static S1 s1; };
6420 At this point, finish_record_layout will be called, but
6421 S1 is still incomplete.) */
6423 {
6425 /* The visibility of static data members is determined
6426 at their point of declaration, not their point of
6427 definition. */
6429 }
6431 }
6439 /* If this field is a bit-field whose width is greater than its
6440 type, then there are some special rules for allocating
6441 it. */
6444 {
6446 tree integer_type;
6448 /* We must allocate the bits as if suitably aligned for the
6449 longest integer type that fits in this many bits. type
6450 of the field. Then, we are supposed to use the left over
6451 bits as additional padding. */
6460 /* ITK now indicates a type that is too large for the
6461 field. We have to back up by one to find the largest
6462 type that fits. */
6463 do
6464 {
6469 /* Figure out how much additional padding is required. */
6471 {
6473 /* In a union, the padding field must have the full width
6474 of the bit-field; all fields start at offset zero. */
6476 else
6479 }
6481 /* An unnamed bitfield does not normally affect the
6482 alignment of the containing class on a target where
6483 PCC_BITFIELD_TYPE_MATTERS. But, the C++ ABI does not
6484 make any exceptions for unnamed bitfields when the
6485 bitfields are longer than their types. Therefore, we
6486 temporarily give the field a name. */
6488 {
6491 }
6497 empty_base_offsets);
6500 /* Now that layout has been performed, set the size of the
6501 field to the size of its declared type; the rest of the
6502 field is effectively invisible. */
6504 /* We must also reset the DECL_MODE of the field. */
6506 }
6507 else
6509 empty_base_offsets);
6511 /* Remember the location of any empty classes in FIELD. */
6514 empty_base_offsets,
6517 /* If a bit-field does not immediately follow another bit-field,
6518 and yet it starts in the middle of a byte, we have failed to
6519 comply with the ABI. */
6522 /* The TREE_NO_WARNING flag gets set by Objective-C when
6523 laying out an Objective-C class. The ObjC ABI differs
6524 from the C++ ABI, and so we do not want a warning
6525 here. */
6527 && !last_field_was_bitfield
6530 bitsize_unit_node)))
6532 "offset of %qD is not ABI-compliant and may "
6535 /* The middle end uses the type of expressions to determine the
6536 possible range of expression values. In order to optimize
6537 "x.i > 7" to "false" for a 2-bit bitfield "i", the middle end
6538 must be made aware of the width of "i", via its type.
6540 Because C++ does not have integer types of arbitrary width,
6541 we must (for the purposes of the front end) convert from the
6542 type assigned here to the declared type of the bitfield
6543 whenever a bitfield expression is used as an rvalue.
6544 Similarly, when assigning a value to a bitfield, the value
6545 must be converted to the type given the bitfield here. */
6547 {
6552 {
6559 }
6560 }
6562 /* If we needed additional padding after this field, add it
6563 now. */
6565 {
6566 tree padding_field;
6569 FIELD_DECL,
6570 NULL_TREE,
6571 char_type_node);
6578 NULL_TREE,
6579 empty_base_offsets);
6580 }
6583 }
6586 {
6587 /* Make sure that we are on a byte boundary so that the size of
6588 the class without virtual bases will always be a round number
6589 of bytes. */
6592 }
6594 /* Delete all zero-width bit-fields from the list of fields. Now
6595 that the type is laid out they are no longer important. */
6598 /* Create the version of T used for virtual bases. We do not use
6599 make_class_type for this version; this is an artificial type. For
6600 a POD type, we just reuse T. */
6602 {
6605 /* Set the size and alignment for the new type. */
6606 tree eoc;
6608 /* If the ABI version is not at least two, and the last
6609 field was a bit-field, RLI may not be on a byte
6610 boundary. In particular, rli_size_unit_so_far might
6611 indicate the last complete byte, while rli_size_so_far
6612 indicates the total number of bits used. Therefore,
6613 rli_size_so_far, rather than rli_size_unit_so_far, is
6614 used to compute TYPE_SIZE_UNIT. */
6622 eoc);
6632 /* Copy the fields from T. */
6636 {
6640 }
6643 /* Record the base version of the type. */
6646 }
6647 else
6650 /* Every empty class contains an empty class. */
6654 /* Set the TYPE_DECL for this type to contain the right
6655 value for DECL_OFFSET, so that we can use it as part
6656 of a COMPONENT_REF for multiple inheritance. */
6659 /* Now fix up any virtual base class types that we left lying
6660 around. We must get these done before we try to lay out the
6661 virtual function table. As a side-effect, this will remove the
6662 base subobject fields. */
6665 /* Make sure that empty classes are reflected in RLI at this
6666 point. */
6669 /* Make sure not to create any structures with zero size. */
6675 /* If this is a non-POD, declaring it packed makes a difference to how it
6676 can be used as a field; don't let finalize_record_size undo it. */
6680 /* Let the back end lay out the type. */
6689 /* Warn about bases that can't be talked about due to ambiguity. */
6692 /* Now that we're done with layout, give the base fields the real types. */
6697 /* Clean up. */
6704 }
6706 /* Determine the "key method" for the class type indicated by TYPE,
6707 and set CLASSTYPE_KEY_METHOD accordingly. */
6709 void
6711 {
6712 tree method;
6719 /* The key method is the first non-pure virtual function that is not
6720 inline at the point of class definition. On some targets the
6721 key function may not be inline; those targets should not call
6722 this function until the end of the translation unit. */
6729 {
6732 }
6735 }
6738 /* Allocate and return an instance of struct sorted_fields_type with
6739 N fields. */
6743 {
6750 }
6752 /* Helper of find_flexarrays. Return true when FLD refers to a non-static
6753 class data member of non-zero size, otherwise false. */
6757 {
6765 {
6769 }
6772 }
6774 /* Used by find_flexarrays and related functions. */
6776 struct flexmems_t
6777 {
6778 /* The first flexible array member or non-zero array member found
6779 in the order of layout. */
6780 tree array;
6781 /* First non-static non-empty data member in the class or its bases. */
6782 tree first;
6783 /* The first non-static non-empty data member following either
6784 the flexible array member, if found, or the zero-length array member
6785 otherwise. AFTER[1] refers to the first such data member of a union
6786 of which the struct containing the flexible array member or zero-length
6787 array is a member, or NULL when no such union exists. This element is
6788 only used during searching, not for diagnosing problems. AFTER[0]
6789 refers to the first such data member that is not a member of such
6790 a union. */
6793 /* Refers to a struct (not union) in which the struct of which the flexible
6794 array is member is defined. Used to diagnose strictly (according to C)
6795 invalid uses of the latter structs. */
6796 tree enclosing;
6797 };
6799 /* Find either the first flexible array member or the first zero-length
6800 array, in that order of preference, among members of class T (but not
6801 its base classes), and set members of FMEM accordingly.
6802 BASE_P is true if T is a base class of another class.
6803 PUN is set to the outermost union in which the flexible array member
6804 (or zero-length array) is defined if one such union exists, otherwise
6805 to NULL.
6806 Similarly, PSTR is set to a data member of the outermost struct of
6807 which the flexible array is a member if one such struct exists,
6808 otherwise to NULL. */
6810 static void
6814 {
6815 /* Set the "pointer" to the outermost enclosing union if not set
6816 yet and maintain it for the remainder of the recursion. */
6821 {
6825 /* Is FLD a typedef for an anonymous struct? */
6827 /* FIXME: Note that typedefs (as well as arrays) need to be fully
6828 handled elsewhere so that errors like the following are detected
6829 as well:
6830 typedef struct { int i, a[], j; } S; // bug c++/72753
6831 S s [2]; // bug c++/68489
6832 */
6837 {
6838 /* Check the nested unnamed type referenced via a typedef
6839 independently of FMEM (since it's not a data member of
6840 the enclosing class). */
6843 }
6845 /* Skip anything that's GCC-generated or not a (non-static) data
6846 member. */
6850 /* Type of the member. */
6855 /* Determine the type of the array element or object referenced
6856 by the member so that it can be checked for flexible array
6857 members if it hasn't been yet. */
6865 {
6867 {
6868 /* Once the member after the flexible array has been found
6869 we're done. */
6872 }
6875 {
6876 /* Descend into the non-static member struct or union and try
6877 to find a flexible array member or zero-length array among
6878 its members. This is only necessary for anonymous types
6879 and types in whose context the current type T has not been
6880 defined (the latter must not be checked again because they
6881 are already in the process of being checked by one of the
6882 recursive calls). */
6887 /* If this member isn't anonymous and a prior non-flexible array
6888 member has been seen in one of the enclosing structs, clear
6889 the FIRST member since it doesn't contribute to the flexible
6890 array struct's members. */
6901 {
6902 /* Restore the FIRST member reset above if no flexible
6903 array member has been found in this member's struct. */
6905 }
6907 /* If the member struct contains the first flexible array
6908 member, or if this member is a base class, continue to
6909 the next member and avoid setting the FMEM->NEXT pointer
6910 to point to it. */
6913 }
6914 }
6917 {
6918 /* Remember the first non-static data member. */
6922 /* Remember the first non-static data member after the flexible
6923 array member, if one has been found, or the zero-length array
6924 if it has been found. */
6927 }
6929 /* Skip non-arrays. */
6933 /* Determine the upper bound of the array if it has one. */
6935 {
6937 {
6938 /* Make a record of the zero-length array if either one
6939 such field or a flexible array member has been seen to
6940 handle the pathological and unlikely case of multiple
6941 such members. */
6944 }
6946 {
6947 /* Remember the first zero-length array unless a flexible array
6948 member has already been seen. */
6951 }
6952 }
6953 else
6954 {
6955 /* Flexible array members have no upper bound. */
6957 {
6958 /* Replace the zero-length array if it's been stored and
6959 reset the after pointer. */
6961 {
6965 }
6966 }
6967 else
6968 {
6971 }
6972 }
6973 }
6974 }
6976 /* Diagnose a strictly (by the C standard) invalid use of a struct with
6977 a flexible array member (or the zero-length array extension). */
6979 static void
6981 {
6993 }
6995 /* Issue diagnostics for invalid flexible array members or zero-length
6996 arrays that are not the last elements of the containing class or its
6997 base classes or that are its sole members. */
6999 static void
7001 {
7006 {
7009 }
7011 /* Has a diagnostic been issued? */
7017 {
7024 {
7028 {
7031 }
7032 }
7033 }
7034 else
7035 {
7042 {
7048 /* In the unlikely event that the member following the flexible
7049 array member is declared in a different class, or the member
7050 overlaps another member of a common union, point to it.
7051 Otherwise it should be obvious. */
7055 {
7060 }
7061 }
7062 }
7066 }
7069 /* Recursively check to make sure that any flexible array or zero-length
7070 array members of class T or its bases are valid (i.e., not the sole
7071 non-static data member of T and, if one exists, that it is the last
7072 non-static data member of T and its base classes. FMEM is expected
7073 to be initially null and is used internally by recursive calls to
7074 the function. Issue the appropriate diagnostics for the array member
7075 that fails the checks. */
7077 static void
7080 {
7081 /* Initialize the result of a search for flexible array and zero-length
7082 array members. Avoid doing any work if the most interesting FMEM data
7083 have already been populated. */
7092 /* Recursively check the primary base class first. */
7094 {
7097 }
7099 /* Recursively check the base classes. */
7102 {
7105 /* The primary base class was already checked above. */
7109 /* Virtual base classes are at the end. */
7113 /* Check the base class. */
7115 }
7118 {
7119 /* Check virtual base classes only once per derived class.
7120 I.e., this check is not performed recursively for base
7121 classes. */
7123 tree base_binfo;
7127 {
7128 /* Check the virtual base class. */
7132 }
7133 }
7135 /* Is the type unnamed (and therefore a member of it potentially
7136 an anonymous struct or union)? */
7139 /* Search the members of the current (possibly derived) class, skipping
7140 unnamed structs and unions since those could be anonymous. */
7145 {
7146 /* Issue diagnostics for invalid flexible and zero-length array
7147 members found in base classes or among the members of the current
7148 class. Ignore anonymous structs and unions whose members are
7149 considered to be members of the enclosing class and thus will
7150 be diagnosed when checking it. */
7152 }
7153 }
7155 /* Perform processing required when the definition of T (a class type)
7156 is complete. Diagnose invalid definitions of flexible array members
7157 and zero-size arrays. */
7159 void
7161 {
7162 tree x;
7163 /* A TREE_LIST. The TREE_VALUE of each node is a FUNCTION_DECL. */
7167 {
7172 }
7174 /* If this type was previously laid out as a forward reference,
7175 make sure we lay it out again. */
7179 /* Make assumptions about the class; we'll reset the flags if
7180 necessary. */
7186 /* Do end-of-class semantic processing: checking the validity of the
7187 bases and members and add implicitly generated methods. */
7190 /* Find the key method. */
7192 {
7193 /* The Itanium C++ ABI permits the key method to be chosen when
7194 the class is defined -- even though the key method so
7195 selected may later turn out to be an inline function. On
7196 some systems (such as ARM Symbian OS) the key method cannot
7197 be determined until the end of the translation unit. On such
7198 systems, we leave CLASSTYPE_KEY_METHOD set to NULL, which
7199 will cause the class to be added to KEYED_CLASSES. Then, in
7200 finish_file we will determine the key method. */
7204 /* If a polymorphic class has no key method, we may emit the vtable
7205 in every translation unit where the class definition appears. If
7206 we're devirtualizing, we can look into the vtable even if we
7207 aren't emitting it. */
7210 }
7212 /* Layout the class itself. */
7215 /* We use the base type for trivial assignments, and hence it
7216 needs a mode. */
7219 /* With the layout complete, check for flexible array members and
7220 zero-length arrays that might overlap other members in the final
7221 layout. */
7226 /* If necessary, create the primary vtable for this class. */
7228 {
7229 /* We must enter these virtuals into the table. */
7233 /* Here we know enough to change the type of our virtual
7234 function table, but we will wait until later this function. */
7237 /* If we're warning about ABI tags, check the types of the new
7238 virtual functions. */
7242 }
7245 {
7247 tree fn;
7254 /* Add entries for virtual functions introduced by this class. */
7258 /* Set DECL_VINDEX for all functions declared in this class. */
7260 fn;
7262 vindex += (TARGET_VTABLE_USES_DESCRIPTORS
7264 {
7268 /* A thunk. We should never be calling this entry directly
7269 from this vtable -- we'd use the entry for the non
7270 thunk base function. */
7274 }
7275 }
7282 /* Complete the rtl for any static member objects of the type we're
7283 working on. */
7290 /* Done with FIELDS...now decide whether to sort these for
7291 faster lookups later.
7293 We use a small number because most searches fail (succeeding
7294 ultimately as the search bores through the inheritance
7295 hierarchy), and we want this failure to occur quickly. */
7299 /* Complain if one of the field types requires lower visibility. */
7302 /* Make the rtl for any new vtables we have created, and unmark
7303 the base types we marked. */
7306 /* Build the VTT for T. */
7313 "%q#T has virtual functions and accessible"
7321 /* Class layout, assignment of virtual table slots, etc., is now
7322 complete. Give the back end a chance to tweak the visibility of
7323 the class or perform any other required target modifications. */
7333 /* Finish debugging output for this type. */
7337 {
7340 {
7343 }
7345 {
7348 else
7349 {
7352 }
7354 }
7356 {
7358 "the type of the first field has a different ABI from the "
7361 }
7362 }
7363 }
7365 /* Insert FIELDS into T for the sorted case if the FIELDS count is
7366 equal to THRESHOLD or greater than THRESHOLD. */
7368 static void
7370 {
7373 {
7378 }
7379 }
7381 /* Insert lately defined enum ENUMTYPE into T for the sorted case. */
7383 void
7385 {
7388 {
7390 int n_fields
7401 }
7402 }
7404 /* When T was built up, the member declarations were added in reverse
7405 order. Rearrange them to declaration order. */
7407 void
7409 {
7410 tree next;
7411 tree prev;
7412 tree x;
7414 /* The following lists are all in reverse order. Put them in
7415 declaration order now. */
7419 /* Actually, for the TYPE_FIELDS, only the non TYPE_DECLs are in
7420 reverse order, so we can't just use nreverse. */
7425 {
7429 }
7431 {
7435 }
7436 }
7438 tree
7440 {
7443 /* Now that we've got all the field declarations, reverse everything
7444 as necessary. */
7450 /* Nadger the current location so that diagnostics point to the start of
7451 the struct, not the end. */
7455 {
7456 tree x;
7462 /* We need to emit an error message if this type was used as a parameter
7463 and it is an abstract type, even if it is a template. We construct
7464 a simple CLASSTYPE_PURE_VIRTUALS list without taking bases into
7465 account and we call complete_vars with this type, which will check
7466 the PARM_DECLS. Note that while the type is being defined,
7467 CLASSTYPE_PURE_VIRTUALS contains the list of the inline friends
7468 (see CLASSTYPE_INLINE_FRIENDS) so we need to clear it. */
7474 /* We need to add the target functions to the CLASSTYPE_METHOD_VEC if
7475 an enclosing scope is a template class, so that this function be
7476 found by lookup_fnfields_1 when the using declaration is not
7477 instantiated yet. */
7480 {
7485 }
7487 /* Remember current #pragma pack value. */
7490 /* Fix up any variants we've already built. */
7492 {
7497 }
7498 }
7499 else
7503 {
7504 /* People keep complaining that the compiler crashes on an invalid
7505 definition of initializer_list, so I guess we should explicitly
7506 reject it. What the compiler internals care about is that it's a
7507 template and has a pointer field followed by an integer field. */
7510 {
7513 {
7517 }
7518 }
7521 "definition of std::initializer_list does not match "
7523 }
7531 else
7535 /* Lambdas are defined by the LAMBDA_EXPR. */
7540 }
7541 \f
7542 /* Hash table to avoid endless recursion when handling references. */
7545 /* Return the dynamic type of INSTANCE, if known.
7546 Used to determine whether the virtual function table is needed
7547 or not.
7549 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
7550 of our knowledge of its type. *NONNULL should be initialized
7551 before this function is called. */
7553 static tree
7555 {
7556 #define RECUR(T) fixed_type_or_null((T), nonnull, cdtorp)
7559 {
7563 else
7567 /* This is a call to a constructor, hence it's never zero. */
7569 {
7573 }
7577 /* This is a call to a constructor, hence it's never zero. */
7579 {
7583 }
7592 /* Propagate nonnull. */
7597 CASE_CONVERT:
7603 {
7604 /* Just because we see an ADDR_EXPR doesn't mean we're dealing
7605 with a real object -- given &p->f, p can still be null. */
7607 /* ??? Probably should check DECL_WEAK here. */
7610 }
7614 /* If this component is really a base class reference, then the field
7615 itself isn't definitive. */
7624 {
7628 }
7629 /* fall through. */
7634 {
7638 }
7640 {
7644 /* if we're in a ctor or dtor, we know our type. If
7645 current_class_ptr is set but we aren't in a function, we're in
7646 an NSDMI (and therefore a constructor). */
7651 {
7655 }
7656 }
7658 {
7659 /* We only need one hash table because it is always left empty. */
7661 fixed_type_or_null_ref_ht
7664 /* Reference variables should be references to objects. */
7668 /* Enter the INSTANCE in a table to prevent recursion; a
7669 variable's initializer may refer to the variable
7670 itself. */
7675 {
7676 tree type;
7685 }
7686 }
7691 }
7692 #undef RECUR
7693 }
7695 /* Return nonzero if the dynamic type of INSTANCE is known, and
7696 equivalent to the static type. We also handle the case where
7697 INSTANCE is really a pointer. Return negative if this is a
7698 ctor/dtor. There the dynamic type is known, but this might not be
7699 the most derived base of the original object, and hence virtual
7700 bases may not be laid out according to this type.
7702 Used to determine whether the virtual function table is needed
7703 or not.
7705 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
7706 of our knowledge of its type. *NONNULL should be initialized
7707 before this function is called. */
7709 int
7711 {
7714 tree fixed;
7716 /* processing_template_decl can be false in a template if we're in
7717 instantiate_non_dependent_expr, but we still want to suppress
7718 this check. */
7720 {
7721 /* In a template we only care about the type of the result. */
7725 }
7735 }
7737 \f
7738 void
7740 {
7743 current_class_stack
7751 }
7753 /* Restore the cached PREVIOUS_CLASS_LEVEL. */
7755 static void
7757 {
7758 tree type;
7760 /* We are re-entering the same class we just left, so we don't
7761 have to search the whole inheritance matrix to find all the
7762 decls to bind again. Instead, we install the cached
7763 class_shadowed list and walk through it binding names. */
7766 /* Restore IDENTIFIER_TYPE_VALUE. */
7768 type;
7771 }
7773 /* Set global variables CURRENT_CLASS_NAME and CURRENT_CLASS_TYPE as
7774 appropriate for TYPE.
7776 So that we may avoid calls to lookup_name, we cache the _TYPE
7777 nodes of local TYPE_DECLs in the TREE_TYPE field of the name.
7779 For multiple inheritance, we perform a two-pass depth-first search
7780 of the type lattice. */
7782 void
7784 {
7785 class_stack_node_t csn;
7789 /* Make sure there is enough room for the new entry on the stack. */
7791 {
7793 current_class_stack
7795 current_class_stack_size);
7796 }
7798 /* Insert a new entry on the class stack. */
7805 current_class_depth++;
7807 /* Now set up the new type. */
7813 /* By default, things in classes are private, while things in
7814 structures or unions are public. */
7816 ? access_private_node
7822 {
7823 /* Forcibly remove any old class remnants. */
7825 }
7831 else
7833 }
7835 /* When we exit a toplevel class scope, we save its binding level so
7836 that we can restore it quickly. Here, we've entered some other
7837 class, so we must invalidate our cache. */
7839 void
7841 {
7843 }
7845 /* Get out of the current class scope. If we were in a class scope
7846 previously, that is the one popped to. */
7848 void
7850 {
7853 current_class_depth--;
7859 }
7861 /* Mark the top of the class stack as hidden. */
7863 void
7865 {
7868 }
7870 /* Mark the top of the class stack as un-hidden. */
7872 void
7874 {
7877 }
7879 /* Returns 1 if the class type currently being defined is either T or
7880 a nested type of T. Returns the type from the current_class_stack,
7881 which might be equivalent to but not equal to T in case of
7882 constrained partial specializations. */
7884 tree
7886 {
7894 /* We start looking from 1 because entry 0 is from global scope,
7895 and has no type. */
7897 {
7898 tree c;
7901 else
7902 {
7906 }
7911 }
7913 }
7915 /* If either current_class_type or one of its enclosing classes are derived
7916 from T, return the appropriate type. Used to determine how we found
7917 something via unqualified lookup. */
7919 tree
7921 {
7924 /* The bases of a dependent type are unknown. */
7935 {
7940 }
7943 }
7945 /* Return the outermost enclosing class type that is still open, or
7946 NULL_TREE. */
7948 tree
7950 {
7957 {
7964 }
7966 }
7968 /* Returns the innermost class type which is not a lambda closure type. */
7970 tree
7972 {
7975 /* We start looking from 1 because entry 0 is from global scope,
7976 and has no type. */
7978 {
7979 tree c;
7982 else
7983 {
7987 }
7992 }
7994 }
7996 /* When entering a class scope, all enclosing class scopes' names with
7997 static meaning (static variables, static functions, types and
7998 enumerators) have to be visible. This recursive function calls
7999 pushclass for all enclosing class contexts until global or a local
8000 scope is reached. TYPE is the enclosed class. */
8002 void
8004 {
8005 /* A namespace might be passed in error cases, like A::B:C. */
8013 }
8015 /* Undoes a push_nested_class call. */
8017 void
8019 {
8025 }
8027 /* Returns the number of extern "LANG" blocks we are nested within. */
8029 int
8031 {
8033 }
8035 /* Set global variables CURRENT_LANG_NAME to appropriate value
8036 so that behavior of name-mangling machinery is correct. */
8038 void
8040 {
8047 else
8049 }
8051 /* Get out of the current language scope. */
8053 void
8055 {
8057 }
8058 \f
8059 /* Type instantiation routines. */
8061 /* Given an OVERLOAD and a TARGET_TYPE, return the function that
8062 matches the TARGET_TYPE. If there is no satisfactory match, return
8063 error_mark_node, and issue an error & warning messages under
8064 control of FLAGS. Permit pointers to member function if FLAGS
8065 permits. If TEMPLATE_ONLY, the name of the overloaded function was
8066 a template-id, and EXPLICIT_TARGS are the explicitly provided
8067 template arguments.
8069 If OVERLOAD is for one or more member functions, then ACCESS_PATH
8070 is the base path used to reference those member functions. If
8071 the address is resolved to a member function, access checks will be
8072 performed and errors issued if appropriate. */
8074 static tree
8076 tree overload,
8077 tsubst_flags_t complain,
8079 tree explicit_targs,
8080 tree access_path)
8081 {
8082 /* Here's what the standard says:
8084 [over.over]
8086 If the name is a function template, template argument deduction
8087 is done, and if the argument deduction succeeds, the deduced
8088 arguments are used to generate a single template function, which
8089 is added to the set of overloaded functions considered.
8091 Non-member functions and static member functions match targets of
8092 type "pointer-to-function" or "reference-to-function." Nonstatic
8093 member functions match targets of type "pointer-to-member
8094 function;" the function type of the pointer to member is used to
8095 select the member function from the set of overloaded member
8096 functions. If a nonstatic member function is selected, the
8097 reference to the overloaded function name is required to have the
8098 form of a pointer to member as described in 5.3.1.
8100 If more than one function is selected, any template functions in
8101 the set are eliminated if the set also contains a non-template
8102 function, and any given template function is eliminated if the
8103 set contains a second template function that is more specialized
8104 than the first according to the partial ordering rules 14.5.5.2.
8105 After such eliminations, if any, there shall remain exactly one
8106 selected function. */
8109 /* We store the matches in a TREE_LIST rooted here. The functions
8110 are the TREE_PURPOSE, not the TREE_VALUE, in this list, for easy
8111 interoperability with most_specialized_instantiation. */
8113 tree fn;
8114 tree target_fn_type;
8116 /* By the time we get here, we should be seeing only real
8117 pointer-to-member types, not the internal POINTER_TYPE to
8118 METHOD_TYPE representation. */
8124 /* Check that the TARGET_TYPE is reasonable. */
8129 /* This is OK, too. */
8132 /* This is OK, too. This comes from a conversion to reference
8133 type. */
8135 else
8136 {
8142 }
8144 /* Non-member functions and static member functions match targets of type
8145 "pointer-to-function" or "reference-to-function." Nonstatic member
8146 functions match targets of type "pointer-to-member-function;" the
8147 function type of the pointer to member is used to select the member
8148 function from the set of overloaded member functions.
8150 So figure out the FUNCTION_TYPE that we want to match against. */
8153 /* If we can find a non-template function that matches, we can just
8154 use it. There's no point in generating template instantiations
8155 if we're just going to throw them out anyhow. But, of course, we
8156 can only do this when we don't *need* a template function. */
8158 {
8159 tree fns;
8162 {
8166 /* We're not looking for templates just yet. */
8171 /* We're looking for a non-static member, and this isn't
8172 one, or vice versa. */
8175 /* Ignore functions which haven't been explicitly
8176 declared. */
8180 /* In C++17 we need the noexcept-qualifier to compare types. */
8184 /* See if there's a match. */
8189 }
8190 }
8192 /* Now, if we've already got a match (or matches), there's no need
8193 to proceed to the template functions. But, if we don't have a
8194 match we need to look at them, too. */
8196 {
8197 tree target_arg_types;
8198 tree target_ret_type;
8199 tree fns;
8202 tree arg;
8216 {
8218 tree instantiation;
8219 tree targs;
8222 /* We're only looking for templates. */
8227 /* We're not looking for a non-static member, and this is
8228 one, or vice versa. */
8233 /* If the template has a deduced return type, don't expose it to
8234 template argument deduction. */
8238 /* Try to do argument deduction. */
8245 /* Instantiation failed. */
8248 /* Constraints must be satisfied. This is done before
8249 return type deduction since that instantiates the
8250 function. */
8254 /* And now force instantiation to do return type deduction. */
8256 {
8262 }
8264 /* In C++17 we need the noexcept-qualifier to compare types. */
8268 /* See if there's a match. */
8273 }
8275 /* Now, remove all but the most specialized of the matches. */
8277 {
8282 NULL_TREE,
8283 NULL_TREE);
8284 }
8285 }
8287 /* Now we should have exactly one function in MATCHES. */
8289 {
8290 /* There were *no* matches. */
8292 {
8295 target_type);
8298 }
8300 }
8302 {
8303 /* There were too many matches. First check if they're all
8304 the same function. */
8309 /* For multi-versioned functions, more than one match is just fine and
8310 decls_match will return false as they are different. */
8318 {
8320 {
8323 target_type);
8325 /* Since print_candidates expects the functions in the
8326 TREE_VALUE slot, we flip them here. */
8331 }
8334 }
8335 }
8337 /* Good, exactly one match. Now, convert it to the correct type. */
8342 {
8350 {
8353 }
8354 }
8356 /* If a pointer to a function that is multi-versioned is requested, the
8357 pointer to the dispatcher function is returned instead. This works
8358 well because indirectly calling the function will dispatch the right
8359 function version at run-time. */
8361 {
8365 /* Mark all the versions corresponding to the dispatcher as used. */
8368 }
8370 /* If we're doing overload resolution purely for the purpose of
8371 determining conversion sequences, we should not consider the
8372 function used. If this conversion sequence is selected, the
8373 function will be marked as used at this point. */
8375 {
8376 /* Make =delete work with SFINAE. */
8381 }
8383 /* We could not check access to member functions when this
8384 expression was originally created since we did not know at that
8385 time to which function the expression referred. */
8387 {
8390 }
8394 else
8395 {
8396 /* The target must be a REFERENCE_TYPE. Above, cp_build_unary_op
8397 will mark the function as addressed, but here we must do it
8398 explicitly. */
8402 }
8403 }
8405 /* This function will instantiate the type of the expression given in
8406 RHS to match the type of LHSTYPE. If errors exist, then return
8407 error_mark_node. COMPLAIN is a bit mask. If TF_ERROR is set, then
8408 we complain on errors. If we are not complaining, never modify rhs,
8409 as overload resolution wants to try many possible instantiations, in
8410 the hope that at least one will work.
8412 For non-recursive calls, LHSTYPE should be a function, pointer to
8413 function, or a pointer to member function. */
8415 tree
8417 {
8424 {
8428 }
8431 {
8440 /* Microsoft allows `A::f' to be resolved to a
8441 pointer-to-member. */
8442 ;
8443 else
8444 {
8449 }
8450 }
8453 {
8456 }
8458 /* If we are in a template, and have a NON_DEPENDENT_EXPR, we cannot
8459 deduce any type information. */
8461 {
8465 }
8467 /* If we instantiate a template, and it is a A ?: C expression
8468 with omitted B, look through the SAVE_EXPR. */
8472 /* There are only a few kinds of expressions that may have a type
8473 dependent on overload resolution. */
8479 /* This should really only be used when attempting to distinguish
8480 what sort of a pointer to function we have. For now, any
8481 arithmetic operation which is not supported on pointers
8482 is rejected as an error. */
8485 {
8487 {
8493 /* Do not lose object's side effects. */
8497 }
8504 /* This can happen if we are forming a pointer-to-member for a
8505 member template. */
8508 /* Fall through. */
8511 {
8515 return
8519 }
8523 return
8527 access_path);
8530 {
8535 }
8542 }
8544 }
8545 \f
8546 /* Return the name of the virtual function pointer field
8547 (as an IDENTIFIER_NODE) for the given TYPE. Note that
8548 this may have to look back through base types to find the
8549 ultimate field name. (For single inheritance, these could
8550 all be the same name. Who knows for multiple inheritance). */
8552 static tree
8554 {
8561 {
8567 }
8575 }
8577 void
8579 {
8586 {
8591 }
8592 }
8594 /* Build a dummy reference to ourselves so Derived::Base (and A::A) works,
8595 according to [class]:
8596 The class-name is also inserted
8597 into the scope of the class itself. For purposes of access checking,
8598 the inserted class name is treated as if it were a public member name. */
8600 void
8602 {
8605 tree saved_cas;
8620 }
8622 /* Returns 1 if TYPE contains only padding bytes. */
8624 int
8626 {
8634 }
8636 /* Returns true if TYPE contains no actual data, just various
8637 possible combinations of empty classes and possibly a vptr. */
8639 bool
8641 {
8643 {
8644 tree field;
8645 tree binfo;
8646 tree base_binfo;
8649 /* CLASSTYPE_EMPTY_P isn't set properly until the class is actually laid
8650 out, but we'd like to be able to check this before then. */
8661 /* An unnamed bit-field is not a data member. */
8666 }
8671 }
8673 /* Note that NAME was looked up while the current class was being
8674 defined and that the result of that lookup was DECL. */
8676 void
8678 {
8679 splay_tree names_used;
8681 /* If we're not defining a class, there's nothing to do. */
8687 /* If there's already a binding for this NAME, then we don't have
8688 anything to worry about. */
8701 }
8703 /* Note that NAME was declared (as DECL) in the current class. Check
8704 to see that the declaration is valid. */
8706 void
8708 {
8709 splay_tree names_used;
8710 splay_tree_node n;
8712 /* Look to see if we ever used this name. */
8713 names_used
8717 /* The C language allows members to be declared with a type of the same
8718 name, and the C++ standard says this diagnostic is not required. So
8719 allow it in extern "C" blocks unless predantic is specified.
8720 Allow it in all cases if -ms-extensions is specified. */
8726 {
8727 /* [basic.scope.class]
8729 A name N used in a class S shall refer to the same declaration
8730 in its context and when re-evaluated in the completed scope of
8731 S. */
8736 }
8737 }
8739 /* Returns the VAR_DECL for the complete vtable associated with BINFO.
8740 Secondary vtables are merged with primary vtables; this function
8741 will return the VAR_DECL for the primary vtable. */
8743 tree
8745 {
8746 tree decl;
8750 {
8753 }
8757 }
8760 /* Returns the binfo for the primary base of BINFO. If the resulting
8761 BINFO is a virtual base, and it is inherited elsewhere in the
8762 hierarchy, then the returned binfo might not be the primary base of
8763 BINFO in the complete object. Check BINFO_PRIMARY_P or
8764 BINFO_LOST_PRIMARY_P to be sure. */
8766 static tree
8768 {
8769 tree primary_base;
8776 }
8778 /* As above, but iterate until we reach the binfo that actually provides the
8779 vptr for BINFO. */
8781 static tree
8783 {
8787 {
8792 }
8794 }
8796 /* Returns true if BINFO gets its vptr from a virtual base of the most derived
8797 type. Note that the virtual inheritance might be above or below BINFO in
8798 the hierarchy. */
8800 bool
8802 {
8806 /* Don't limit binfo_via_virtual, we want to return true when BINFO itself is
8807 a morally virtual base. */
8810 }
8812 /* If INDENTED_P is zero, indent to INDENT. Return nonzero. */
8814 static int
8816 {
8820 }
8822 /* Dump the offsets of all the bases rooted at BINFO to STREAM.
8823 INDENT should be zero when called from the top level; it is
8824 incremented recursively. IGO indicates the next expected BINFO in
8825 inheritance graph ordering. */
8827 static tree
8830 tree binfo,
8831 tree igo,
8833 {
8835 tree base_binfo;
8843 {
8846 }
8861 {
8865 TFF_PLAIN_IDENTIFIER),
8867 }
8869 {
8872 }
8877 {
8881 {
8885 TFF_PLAIN_IDENTIFIER));
8886 }
8888 {
8892 TFF_PLAIN_IDENTIFIER));
8893 }
8895 {
8899 TFF_PLAIN_IDENTIFIER));
8900 }
8902 {
8906 TFF_PLAIN_IDENTIFIER));
8907 }
8911 }
8917 }
8919 /* Dump the BINFO hierarchy for T. */
8921 static void
8923 {
8935 }
8937 /* Debug interface to hierarchy dumping. */
8939 void
8941 {
8943 }
8945 static void
8947 {
8952 {
8954 }
8955 }
8957 static void
8959 {
8960 tree value;
8962 HOST_WIDE_INT elt;
8970 TFF_PLAIN_IDENTIFIER));
8977 }
8979 static void
8981 {
8989 {
8996 {
9001 }
9005 }
9006 }
9008 static void
9010 {
9018 {
9023 }
9024 }
9026 /* Dump a function or thunk and its thunkees. */
9028 static void
9030 {
9033 tree thunks;
9041 {
9051 else
9057 }
9061 }
9063 /* Dump the thunks for FN. */
9065 void
9067 {
9069 }
9071 /* Virtual function table initialization. */
9073 /* Create all the necessary vtables for T and its base classes. */
9075 static void
9077 {
9078 tree vbase;
9082 /* We lay out the primary and secondary vtables in one contiguous
9083 vtable. The primary vtable is first, followed by the non-virtual
9084 secondary vtables in inheritance graph order. */
9088 /* Then come the virtual bases, also in inheritance graph order. */
9090 {
9094 }
9098 }
9100 /* Initialize the vtable for BINFO with the INITS. */
9102 static void
9104 {
9105 tree decl;
9111 }
9113 /* Build the VTT (virtual table table) for T.
9114 A class requires a VTT if it has virtual bases.
9116 This holds
9117 1 - primary virtual pointer for complete object T
9118 2 - secondary VTTs for each direct non-virtual base of T which requires a
9119 VTT
9120 3 - secondary virtual pointers for each direct or indirect base of T which
9121 has virtual bases or is reachable via a virtual path from T.
9122 4 - secondary VTTs for each direct or indirect virtual base of T.
9124 Secondary VTTs look like complete object VTTs without part 4. */
9126 static void
9128 {
9129 tree type;
9130 tree vtt;
9131 tree index;
9134 /* Build up the initializers for the VTT. */
9139 /* If we didn't need a VTT, we're done. */
9143 /* Figure out the type of the VTT. */
9147 /* Now, build the VTT object itself. */
9150 /* Add the VTT to the vtables list. */
9155 }
9157 /* When building a secondary VTT, BINFO_VTABLE is set to a TREE_LIST with
9158 PURPOSE the RTTI_BINFO, VALUE the real vtable pointer for this binfo,
9159 and CHAIN the vtable pointer for this binfo after construction is
9160 complete. VALUE can also be another BINFO, in which case we recurse. */
9162 static tree
9164 {
9165 tree vt;
9168 {
9174 else
9176 }
9179 }
9181 /* Data for secondary VTT initialization. */
9182 struct secondary_vptr_vtt_init_data
9183 {
9184 /* Is this the primary VTT? */
9187 /* Current index into the VTT. */
9188 tree index;
9190 /* Vector of initializers built up. */
9193 /* The type being constructed by this secondary VTT. */
9194 tree type_being_constructed;
9195 };
9197 /* Recursively build the VTT-initializer for BINFO (which is in the
9198 hierarchy dominated by T). INITS points to the end of the initializer
9199 list to date. INDEX is the VTT index where the next element will be
9200 replaced. Iff BINFO is the binfo for T, this is the top level VTT (i.e.
9201 not a subvtt for some base of T). When that is so, we emit the sub-VTTs
9202 for virtual bases of T. When it is not so, we build the constructor
9203 vtables for the BINFO-in-T variant. */
9205 static void
9208 {
9210 tree b;
9211 tree init;
9212 secondary_vptr_vtt_init_data data;
9215 /* We only need VTTs for subobjects with virtual bases. */
9219 /* We need to use a construction vtable if this is not the primary
9220 VTT. */
9222 {
9225 /* Record the offset in the VTT where this sub-VTT can be found. */
9227 }
9229 /* Add the address of the primary vtable for the complete object. */
9233 {
9236 }
9239 /* Recursively add the secondary VTTs for non-virtual bases. */
9244 /* Add secondary virtual pointers for all subobjects of BINFO with
9245 either virtual bases or reachable along a virtual path, except
9246 subobjects that are non-virtual primary bases. */
9256 /* data.inits might have grown as we added secondary virtual pointers.
9257 Make sure our caller knows about the new vector. */
9261 /* Add the secondary VTTs for virtual bases in inheritance graph
9262 order. */
9264 {
9269 }
9270 else
9271 /* Remove the ctor vtables we created. */
9273 }
9275 /* Called from build_vtt_inits via dfs_walk. BINFO is the binfo for the base
9276 in most derived. DATA is a SECONDARY_VPTR_VTT_INIT_DATA structure. */
9278 static tree
9280 {
9283 /* We don't care about bases that don't have vtables. */
9287 /* We're only interested in proper subobjects of the type being
9288 constructed. */
9292 /* We're only interested in bases with virtual bases or reachable
9293 via a virtual path from the type being constructed. */
9298 /* We're not interested in non-virtual primary bases. */
9302 /* Record the index where this secondary vptr can be found. */
9304 {
9309 {
9310 /* It's a primary virtual base, and this is not a
9311 construction vtable. Find the base this is primary of in
9312 the inheritance graph, and use that base's vtable
9313 now. */
9316 }
9317 }
9319 /* Add the initializer for the secondary vptr itself. */
9322 /* Advance the vtt index. */
9327 }
9329 /* Called from build_vtt_inits via dfs_walk. After building
9330 constructor vtables and generating the sub-vtt from them, we need
9331 to restore the BINFO_VTABLES that were scribbled on. DATA is the
9332 binfo of the base whose sub vtt was generated. */
9334 static tree
9336 {
9340 /* If this class has no vtable, none of its bases do. */
9344 /* This might be a primary base, so have no vtable in this
9345 hierarchy. */
9348 /* If we scribbled the construction vtable vptr into BINFO, clear it
9349 out now. */
9355 }
9357 /* Build the construction vtable group for BINFO which is in the
9358 hierarchy dominated by T. */
9360 static void
9362 {
9363 tree type;
9364 tree vtbl;
9365 tree id;
9366 tree vbase;
9369 /* See if we've already created this construction vtable group. */
9375 /* Build a version of VTBL (with the wrong type) for use in
9376 constructing the addresses of secondary vtables in the
9377 construction vtable group. */
9380 /* Don't export construction vtables from shared libraries. Even on
9381 targets that don't support hidden visibility, this tells
9382 can_refer_decl_in_current_unit_p not to assume that it's safe to
9383 access from a different compilation unit (bz 54314). */
9391 /* Add the vtables for each of our virtual bases using the vbase in T
9392 binfo. */
9394 vbase;
9396 {
9397 tree b;
9404 }
9406 /* Figure out the type of the construction vtable. */
9413 /* Initialize the construction vtable. */
9417 }
9419 /* Add the vtbl initializers for BINFO (and its bases other than
9420 non-virtual primaries) to the list of INITS. BINFO is in the
9421 hierarchy dominated by T. RTTI_BINFO is the binfo within T of
9422 the constructor the vtbl inits should be accumulated for. (If this
9423 is the complete object vtbl then RTTI_BINFO will be TYPE_BINFO (T).)
9424 ORIG_BINFO is the binfo for this object within BINFO_TYPE (RTTI_BINFO).
9425 BINFO is the active base equivalent of ORIG_BINFO in the inheritance
9426 graph of T. Both BINFO and ORIG_BINFO will have the same BINFO_TYPE,
9427 but are not necessarily the same in terms of layout. */
9429 static void
9431 tree orig_binfo,
9432 tree rtti_binfo,
9433 tree vtbl,
9434 tree t,
9436 {
9438 tree base_binfo;
9443 /* If it doesn't have a vptr, we don't do anything. */
9447 /* If we're building a construction vtable, we're not interested in
9448 subobjects that don't require construction vtables. */
9454 /* Build the initializers for the BINFO-in-T vtable. */
9457 /* Walk the BINFO and its bases. We walk in preorder so that as we
9458 initialize each vtable we can figure out at what offset the
9459 secondary vtable lies from the primary vtable. We can't use
9460 dfs_walk here because we need to iterate through bases of BINFO
9461 and RTTI_BINFO simultaneously. */
9463 {
9464 /* Skip virtual bases. */
9470 inits);
9471 }
9472 }
9474 /* Called from accumulate_vtbl_inits. Adds the initializers for the
9475 BINFO vtable to L. */
9477 static void
9479 tree orig_binfo,
9480 tree rtti_binfo,
9481 tree orig_vtbl,
9482 tree t,
9484 {
9491 {
9492 /* In the hierarchy of BINFO_TYPE (RTTI_BINFO), this is a
9493 primary virtual base. If it is not the same primary in
9494 the hierarchy of T, we'll need to generate a ctor vtable
9495 for it, to place at its location in T. If it is the same
9496 primary, we still need a VTT entry for the vtable, but it
9497 should point to the ctor vtable for the base it is a
9498 primary for within the sub-hierarchy of RTTI_BINFO.
9500 There are three possible cases:
9502 1) We are in the same place.
9503 2) We are a primary base within a lost primary virtual base of
9504 RTTI_BINFO.
9505 3) We are primary to something not a base of RTTI_BINFO. */
9507 tree b;
9510 /* First, look through the bases we are primary to for RTTI_BINFO
9511 or a virtual base. */
9514 {
9519 }
9520 /* If we run out of primary links, keep looking down our
9521 inheritance chain; we might be an indirect primary. */
9525 found:
9527 /* If we found RTTI_BINFO, this is case 1. If we found a virtual
9528 base B and it is a base of RTTI_BINFO, this is case 2. In
9529 either case, we share our vtable with LAST, i.e. the
9530 derived-most base within B of which we are a primary. */
9533 /* Just set our BINFO_VTABLE to point to LAST, as we may not have
9534 set LAST's BINFO_VTABLE yet. We'll extract the actual vptr in
9535 binfo_ctor_vtable after everything's been set up. */
9538 /* Otherwise, this is case 3 and we get our own. */
9539 }
9546 {
9547 tree index;
9550 /* Add the initializer for this vtable. */
9554 /* Figure out the position to which the VPTR should point. */
9560 }
9563 /* For a construction vtable, we can't overwrite BINFO_VTABLE.
9564 So, we make a TREE_LIST. Later, dfs_fixup_binfo_vtbls will
9565 straighten this out. */
9568 /* Throw away any unneeded intializers. */
9570 else
9571 /* For an ordinary vtable, set BINFO_VTABLE. */
9573 }
9577 /* Construct the initializer for BINFO's virtual function table. BINFO
9578 is part of the hierarchy dominated by T. If we're building a
9579 construction vtable, the ORIG_BINFO is the binfo we should use to
9580 find the actual function pointers to put in the vtable - but they
9581 can be overridden on the path to most-derived in the graph that
9582 ORIG_BINFO belongs. Otherwise,
9583 ORIG_BINFO should be the same as BINFO. The RTTI_BINFO is the
9584 BINFO that should be indicated by the RTTI information in the
9585 vtable; it will be a base class of T, rather than T itself, if we
9586 are building a construction vtable.
9588 The value returned is a TREE_LIST suitable for wrapping in a
9589 CONSTRUCTOR to use as the DECL_INITIAL for a vtable. If
9590 NON_FN_ENTRIES_P is not NULL, *NON_FN_ENTRIES_P is set to the
9591 number of non-function entries in the vtable.
9593 It might seem that this function should never be called with a
9594 BINFO for which BINFO_PRIMARY_P holds, the vtable for such a
9595 base is always subsumed by a derived class vtable. However, when
9596 we are building construction vtables, we do build vtables for
9597 primary bases; we need these while the primary base is being
9598 constructed. */
9600 static void
9602 tree orig_binfo,
9603 tree t,
9604 tree rtti_binfo,
9607 {
9608 tree v;
9609 vtbl_init_data vid;
9611 tree vbinfo;
9615 /* Initialize VID. */
9623 /* The first vbase or vcall offset is at index -3 in the vtable. */
9626 /* Add entries to the vtable for RTTI. */
9629 /* Create an array for keeping track of the functions we've
9630 processed. When we see multiple functions with the same
9631 signature, we share the vcall offsets. */
9633 /* Add the vcall and vbase offset entries. */
9636 /* Clear BINFO_VTABLE_PATH_MARKED; it's set by
9637 build_vbase_offset_vtbl_entries. */
9642 /* If the target requires padding between data entries, add that now. */
9644 {
9649 /* Move data entries into their new positions and add padding
9650 after the new positions. Iterate backwards so we don't
9651 overwrite entries that we would need to process later. */
9654 ix--)
9655 {
9663 {
9667 null_pointer_node);
9668 }
9669 }
9670 }
9675 /* The initializers for virtual functions were built up in reverse
9676 order. Straighten them out and add them to the running list in one
9677 step. */
9686 /* Go through all the ordinary virtual functions, building up
9687 initializers. */
9689 {
9690 tree delta;
9691 tree vcall_index;
9698 {
9702 {
9705 }
9707 }
9709 /* If the only definition of this function signature along our
9710 primary base chain is from a lost primary, this vtable slot will
9711 never be used, so just zero it out. This is important to avoid
9712 requiring extra thunks which cannot be generated with the function.
9714 We first check this in update_vtable_entry_for_fn, so we handle
9715 restored primary bases properly; we also need to do it here so we
9716 zero out unused slots in ctor vtables, rather than filling them
9717 with erroneous values (though harmless, apart from relocation
9718 costs). */
9723 {
9724 /* Pull the offset for `this', and the function to call, out of
9725 the list. */
9732 /* You can't call an abstract virtual function; it's abstract.
9733 So, we replace these functions with __pure_virtual. */
9735 {
9738 {
9740 abort_fndecl_addr
9744 }
9745 }
9746 /* Likewise for deleted virtuals. */
9748 {
9757 }
9758 else
9759 {
9761 {
9765 }
9766 /* Take the address of the function, considering it to be of an
9767 appropriate generic type. */
9771 /* Don't refer to a virtual destructor from a constructor
9772 vtable or a vtable for an abstract class, since destroying
9773 an object under construction is undefined behavior and we
9774 don't want it to be considered a candidate for speculative
9775 devirtualization. But do create the thunk for ABI
9776 compliance. */
9781 }
9782 }
9784 /* And add it to the chain of initializers. */
9786 {
9791 else
9793 {
9799 }
9800 }
9801 else
9803 }
9804 }
9806 /* Adds to vid->inits the initializers for the vbase and vcall
9807 offsets in BINFO, which is in the hierarchy dominated by T. */
9809 static void
9811 {
9812 tree b;
9814 /* If this is a derived class, we must first create entries
9815 corresponding to the primary base class. */
9820 /* Add the vbase entries for this base. */
9822 /* Add the vcall entries for this base. */
9824 }
9826 /* Returns the initializers for the vbase offset entries in the vtable
9827 for BINFO (which is part of the class hierarchy dominated by T), in
9828 reverse order. VBASE_OFFSET_INDEX gives the vtable index
9829 where the next vbase offset will go. */
9831 static void
9833 {
9834 tree vbase;
9835 tree t;
9836 tree non_primary_binfo;
9838 /* If there are no virtual baseclasses, then there is nothing to
9839 do. */
9845 /* We might be a primary base class. Go up the inheritance hierarchy
9846 until we find the most derived class of which we are a primary base:
9847 it is the offset of that which we need to use. */
9850 {
9851 tree b;
9853 /* If we have reached a virtual base, then it must be a primary
9854 base (possibly multi-level) of vid->binfo, or we wouldn't
9855 have called build_vcall_and_vbase_vtbl_entries for it. But it
9856 might be a lost primary, so just skip down to vid->binfo. */
9858 {
9861 }
9867 }
9869 /* Go through the virtual bases, adding the offsets. */
9871 vbase;
9873 {
9874 tree b;
9875 tree delta;
9880 /* Find the instance of this virtual base in the complete
9881 object. */
9884 /* If we've already got an offset for this virtual base, we
9885 don't need another one. */
9890 /* Figure out where we can find this vbase offset. */
9899 /* The vbase offset had better be the same. */
9902 /* The next vbase will come at a more negative offset. */
9906 /* The initializer is the delta from BINFO to this virtual base.
9907 The vbase offsets go in reverse inheritance-graph order, and
9908 we are walking in inheritance graph order so these end up in
9909 the right order. */
9916 }
9917 }
9919 /* Adds the initializers for the vcall offset entries in the vtable
9920 for BINFO (which is part of the class hierarchy dominated by VID->DERIVED)
9921 to VID->INITS. */
9923 static void
9925 {
9926 /* We only need these entries if this base is a virtual base. We
9927 compute the indices -- but do not add to the vtable -- when
9928 building the main vtable for a class. */
9931 /* If BINFO is RTTI_BINFO, then (since BINFO does not
9932 correspond to VID->DERIVED), we are building a primary
9933 construction virtual table. Since this is a primary
9934 virtual table, we do not need the vcall offsets for
9935 BINFO. */
9937 {
9938 /* We need a vcall offset for each of the virtual functions in this
9939 vtable. For example:
9941 class A { virtual void f (); };
9942 class B1 : virtual public A { virtual void f (); };
9943 class B2 : virtual public A { virtual void f (); };
9944 class C: public B1, public B2 { virtual void f (); };
9946 A C object has a primary base of B1, which has a primary base of A. A
9947 C also has a secondary base of B2, which no longer has a primary base
9948 of A. So the B2-in-C construction vtable needs a secondary vtable for
9949 A, which will adjust the A* to a B2* to call f. We have no way of
9950 knowing what (or even whether) this offset will be when we define B2,
9951 so we store this "vcall offset" in the A sub-vtable and look it up in
9952 a "virtual thunk" for B2::f.
9954 We need entries for all the functions in our primary vtable and
9955 in our non-virtual bases' secondary vtables. */
9957 /* If we are just computing the vcall indices -- but do not need
9958 the actual entries -- not that. */
9961 /* Now, walk through the non-virtual bases, adding vcall offsets. */
9963 }
9964 }
9966 /* Build vcall offsets, starting with those for BINFO. */
9968 static void
9970 {
9972 tree primary_binfo;
9973 tree base_binfo;
9975 /* Don't walk into virtual bases -- except, of course, for the
9976 virtual base for which we are building vcall offsets. Any
9977 primary virtual base will have already had its offsets generated
9978 through the recursion in build_vcall_and_vbase_vtbl_entries. */
9982 /* If BINFO has a primary base, process it first. */
9987 /* Add BINFO itself to the list. */
9990 /* Scan the non-primary bases of BINFO. */
9994 }
9996 /* Called from build_vcall_offset_vtbl_entries_r. */
9998 static void
10000 {
10001 /* Make entries for the rest of the virtuals. */
10002 tree orig_fn;
10004 /* The ABI requires that the methods be processed in declaration
10005 order. */
10007 orig_fn;
10011 }
10013 /* Add a vcall offset entry for ORIG_FN to the vtable. */
10015 static void
10017 {
10019 tree vcall_offset;
10020 tree derived_entry;
10022 /* If there is already an entry for a function with the same
10023 signature as FN, then we do not need a second vcall offset.
10024 Check the list of functions already present in the derived
10025 class vtable. */
10027 {
10029 /* We only use one vcall offset for virtual destructors,
10030 even though there are two virtual table entries. */
10034 }
10036 /* If we are building these vcall offsets as part of building
10037 the vtable for the most derived class, remember the vcall
10038 offset. */
10040 {
10043 }
10045 /* The next vcall offset will be found at a more negative
10046 offset. */
10050 /* Keep track of this function. */
10054 {
10055 tree base;
10056 tree fn;
10058 /* Find the overriding function. */
10062 else
10063 {
10066 /* The vbase we're working on is a primary base of
10067 vid->binfo. But it might be a lost primary, so its
10068 BINFO_OFFSET might be wrong, so we just use the
10069 BINFO_OFFSET from vid->binfo. */
10075 vcall_offset);
10076 }
10077 /* Add the initializer to the vtable. */
10079 }
10080 }
10082 /* Return vtbl initializers for the RTTI entries corresponding to the
10083 BINFO's vtable. The RTTI entries should indicate the object given
10084 by VID->rtti_binfo. */
10086 static void
10088 {
10089 tree b;
10090 tree t;
10091 tree offset;
10092 tree decl;
10093 tree init;
10097 /* To find the complete object, we will first convert to our most
10098 primary base, and then add the offset in the vtbl to that value. */
10103 /* The second entry is the address of the typeinfo object. */
10106 else
10109 /* Convert the declaration to a type that can be stored in the
10110 vtable. */
10114 /* Add the offset-to-top entry. It comes earlier in the vtable than
10115 the typeinfo entry. Convert the offset to look like a
10116 function pointer, so that we can put it in the vtable. */
10119 }
10121 /* TRUE iff TYPE is uniquely derived from PARENT. Ignores
10122 accessibility. */
10124 bool
10126 {
10129 }
10131 /* TRUE iff TYPE is publicly & uniquely derived from PARENT. */
10133 bool
10135 {
10139 }
10141 /* CTX1 and CTX2 are declaration contexts. Return the innermost common
10142 class between them, if any. */
10144 tree
10146 {
10158 {
10161 }
10165 }