| blob | cd63c21567a8c7f37442971229e504f545793fa1 |
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. */
41 /* Id for dumping the class hierarchy. */
44 /* The number of nested classes being processed. If we are not in the
45 scope of any class, this is zero. */
49 /* In order to deal with nested classes, we keep a stack of classes.
50 The topmost entry is the innermost class, and is the entry at index
51 CURRENT_CLASS_DEPTH */
54 /* The name of the class. */
55 tree name;
57 /* The _TYPE node for the class. */
58 tree type;
60 /* The access specifier pending for new declarations in the scope of
61 this class. */
62 tree access;
64 /* If were defining TYPE, the names used in this class. */
65 splay_tree names_used;
67 /* Nonzero if this class is no longer open, because of a call to
68 push_to_top_level. */
72 struct vtbl_init_data
73 {
74 /* The base for which we're building initializers. */
75 tree binfo;
76 /* The type of the most-derived type. */
77 tree derived;
78 /* The binfo for the dynamic type. This will be TYPE_BINFO (derived),
79 unless ctor_vtbl_p is true. */
80 tree rtti_binfo;
81 /* The negative-index vtable initializers built up so far. These
82 are in order from least negative index to most negative index. */
84 /* The binfo for the virtual base for which we're building
85 vcall offset initializers. */
86 tree vbase;
87 /* The functions in vbase for which we have already provided vcall
88 offsets. */
90 /* The vtable index of the next vcall or vbase offset. */
91 tree index;
92 /* Nonzero if we are building the initializer for the primary
93 vtable. */
95 /* Nonzero if we are building the initializer for a construction
96 vtable. */
98 /* True when adding vcall offset entries to the vtable. False when
99 merely computing the indices. */
101 };
103 /* The type of a function passed to walk_subobject_offsets. */
106 /* The stack itself. This is a dynamically resized array. The
107 number of elements allocated is CURRENT_CLASS_STACK_SIZE. */
111 /* The size of the largest empty class seen in this translation unit. */
114 /* An array of all local classes present in this translation unit, in
115 declaration order. */
148 /* Used by find_flexarrays and related functions. */
199 tree *);
209 splay_tree_key k2);
218 /* Variables shared between class.c and call.c. */
228 /* Return a COND_EXPR that executes TRUE_STMT if this execution of the
229 'structor is in charge of 'structing virtual bases, or FALSE_STMT
230 otherwise. */
232 tree
234 {
244 }
246 /* Convert to or from a base subobject. EXPR is an expression of type
247 `A' or `A*', an expression of type `B' or `B*' is returned. To
248 convert A to a base B, CODE is PLUS_EXPR and BINFO is the binfo for
249 the B base instance within A. To convert base A to derived B, CODE
250 is MINUS_EXPR and BINFO is the binfo for the A instance within B.
251 In this latter case, A must not be a morally virtual base of B.
252 NONNULL is true if EXPR is known to be non-NULL (this is only
253 needed when EXPR is of pointer type). CV qualifiers are preserved
254 from EXPR. */
256 tree
258 tree expr,
259 tree binfo,
261 tsubst_flags_t complain)
262 {
265 tree probe;
266 tree offset;
267 tree target_type;
269 tree ptr_target_type;
280 {
286 }
294 {
295 /* This can happen when adjust_result_of_qualified_name_lookup can't
296 find a unique base binfo in a call to a member function. We
297 couldn't give the diagnostic then since we might have been calling
298 a static member function, so we do it now. In other cases, eg.
299 during error recovery (c++/71979), we may not have a base at all. */
301 {
305 }
307 }
314 /* Nothing to do. */
318 {
320 {
322 {
325 "pointer to derived class %qT because the base is "
327 else
331 }
332 else
333 {
339 else
343 }
344 }
346 }
349 {
351 /* This must happen before the call to save_expr. */
353 }
354 else
360 /* TARGET_TYPE has been extracted from BINFO, and, is therefore always
361 cv-unqualified. Extract the cv-qualifiers from EXPR so that the
362 expression returned matches the input. */
363 target_type = cp_build_qualified_type
367 /* Do we need to look in the vtable for the real offset? */
370 /* Don't bother with the calculations inside sizeof; they'll ICE if the
371 source type is incomplete and the pointer value doesn't matter. In a
372 template (even in instantiate_non_dependent_expr), we don't have vtables
373 set up properly yet, and the value doesn't matter there either; we're
374 just interested in the result of overload resolution. */
376 || processing_template_decl
378 {
381 }
383 /* If we're in an NSDMI, we don't have the full constructor context yet
384 that we need for converting to a virtual base, so just build a stub
385 CONVERT_EXPR and expand it later in bot_replace. */
388 {
392 }
394 /* Do we need to check for a null pointer? */
396 {
397 /* If we know the conversion will not actually change the value
398 of EXPR, then we can avoid testing the expression for NULL.
399 We have to avoid generating a COMPONENT_REF for a base class
400 field, because other parts of the compiler know that such
401 expressions are always non-NULL. */
405 }
407 /* Protect against multiple evaluation if necessary. */
411 /* Now that we've saved expr, build the real null test. */
413 {
417 /* This is a compiler generated comparison, don't emit
418 e.g. -Wnonnull-compare warning for it. */
420 }
422 /* If this is a simple base reference, express it as a COMPONENT_REF. */
424 /* We don't build base fields for empty bases, and they aren't very
425 interesting to the optimizers anyway. */
427 {
436 }
439 {
440 /* Going via virtual base V_BINFO. We need the static offset
441 from V_BINFO to BINFO, and the dynamic offset from D_BINFO to
442 V_BINFO. That offset is an entry in D_BINFO's vtable. */
443 tree v_offset;
446 {
447 /* In a base member initializer, we cannot rely on the
448 vtable being set up. We have to indirect via the
449 vtt_parm. */
450 tree t;
456 }
457 else
458 {
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 VIA_USING indicates whether
1005 METHOD is being injected via a using_decl. Returns true if the
1006 method could be added to the method vec. */
1008 bool
1010 {
1014 /* Maintain TYPE_HAS_USER_CONSTRUCTOR, etc. */
1022 /* Check to see if we've already got this method. */
1024 {
1026 tree fn_type;
1027 tree method_type;
1028 tree parms1;
1029 tree parms2;
1034 /* Two using-declarations can coexist, we'll complain about ambiguity in
1035 overload resolution. */
1037 /* Except handle inherited constructors specially. */
1041 /* [over.load] Member function declarations with the
1042 same name and the same parameter types cannot be
1043 overloaded if any of them is a static member
1044 function declaration.
1046 [over.load] Member function declarations with the same name and
1047 the same parameter-type-list as well as member function template
1048 declarations with the same name, the same parameter-type-list, and
1049 the same template parameter lists cannot be overloaded if any of
1050 them, but not all, have a ref-qualifier.
1052 [namespace.udecl] When a using-declaration brings names
1053 from a base class into a derived class scope, member
1054 functions in the derived class override and/or hide member
1055 functions with the same name and parameter types in a base
1056 class (rather than conflicting). */
1062 /* Compare the quals on the 'this' parm. Don't compare
1063 the whole types, as used functions are treated as
1064 coming from the using class in overload resolution. */
1067 /* Either both or neither need to be ref-qualified for
1068 differing quals to allow overloading. */
1075 /* For templates, the return type and template parameters
1076 must be identical. */
1089 /* Bring back parameters omitted from an inherited ctor. */
1100 {
1101 /* If these are versions of the same function, process and
1102 move on. */
1108 {
1110 {
1114 {
1116 {
1117 /* Inheriting the same constructor along different
1118 paths, combine them. */
1119 SET_DECL_INHERITED_CTOR
1122 /* And discard the new one. */
1124 }
1125 else
1126 /* Inherited ctors can coexist until overload
1127 resolution. */
1129 }
1135 basef);
1136 }
1137 /* Otherwise defer to the other function. */
1139 }
1142 /* Defer to the local function. */
1146 {
1147 /* Remove the inherited constructor. */
1150 }
1151 else
1152 {
1158 }
1159 }
1160 }
1162 /* A class should never have more than one destructor. */
1173 }
1175 /* Subroutines of finish_struct. */
1177 /* Change the access of FDECL to ACCESS in T. Return 1 if change was
1178 legit, otherwise return 0. */
1180 static int
1182 {
1183 tree elem;
1191 {
1193 {
1197 else
1200 }
1201 else
1202 {
1203 /* They're changing the access to the same thing they changed
1204 it to before. That's OK. */
1205 ;
1206 }
1207 }
1208 else
1209 {
1211 tf_warning_or_error);
1214 }
1216 }
1218 /* Return the access node for DECL's access in its enclosing class. */
1220 tree
1222 {
1226 }
1228 /* Process the USING_DECL, which is a member of T. */
1230 static void
1232 {
1237 tree old_value;
1242 tf_warning_or_error);
1244 {
1249 else
1251 }
1259 ;
1261 {
1263 /* It's OK to use functions from a base when there are functions with
1265 else
1266 {
1273 }
1274 }
1276 {
1283 }
1285 /* Make type T see field decl FDECL with access ACCESS. */
1288 {
1291 }
1292 else
1294 }
1295 \f
1296 /* Data structure for find_abi_tags_r, below. */
1298 struct abi_tag_data
1299 {
1303 };
1305 /* Subroutine of find_abi_tags_r. Handle a single TAG found on the class TP
1306 in the context of P. TAG can be either an identifier (the DECL_NAME of
1307 a tag NAMESPACE_DECL) or a STRING_CST (a tag attribute). */
1309 static void
1311 {
1313 {
1315 {
1316 /* We're collecting tags from template arguments or from
1317 the type of a variable or function return type. */
1320 /* Don't inherit this tag multiple times. */
1324 {
1325 /* Tags inherited from type template arguments are only used
1326 to avoid warnings. */
1329 }
1330 /* For functions and variables we want to warn, too. */
1331 }
1333 /* Otherwise we're diagnosing missing tags. */
1335 {
1340 }
1342 {
1346 }
1348 {
1353 }
1354 else
1355 {
1359 {
1363 }
1364 }
1365 }
1366 }
1368 /* Find all the ABI tags in the attribute list ATTR and either call
1369 check_tag (if TP is non-null) or set IDENTIFIER_MARKED to val. */
1371 static void
1373 {
1380 {
1385 else
1387 }
1388 }
1390 /* Find all the ABI tags on T and its enclosing scopes and either call
1391 check_tag (if TP is non-null) or set IDENTIFIER_MARKED to val. */
1393 static void
1395 {
1397 {
1398 tree attr;
1400 {
1403 }
1404 else
1405 {
1408 }
1410 }
1411 }
1413 /* walk_tree callback for check_abi_tags: if the type at *TP involves any
1414 types with ABI tags, add the corresponding identifiers to the VEC in
1415 *DATA and set IDENTIFIER_MARKED. */
1417 static tree
1419 {
1423 /* walk_tree shouldn't be walking into any subtrees of a RECORD_TYPE
1424 anyway, but let's make sure of it. */
1432 }
1434 /* walk_tree callback for mark_abi_tags: if *TP is a class, set
1435 IDENTIFIER_MARKED on its ABI tags. */
1437 static tree
1439 {
1443 /* walk_tree shouldn't be walking into any subtrees of a RECORD_TYPE
1444 anyway, but let's make sure of it. */
1452 }
1454 /* Set IDENTIFIER_MARKED on all the ABI tags on T and its enclosing
1455 scopes. */
1457 static void
1459 {
1462 {
1465 {
1466 /* Template arguments are part of the signature. */
1469 {
1472 }
1473 }
1475 /* A function's parameter types are part of the signature, so
1476 we don't need to inherit any tags that are also in them. */
1481 }
1482 }
1484 /* Check that T has all the ABI tags that subobject SUBOB has, or
1485 warn if not. If T is a (variable or function) declaration, also
1486 return any missing tags, and add them to T if JUST_CHECKING is false. */
1488 static tree
1490 {
1498 /* No need to worry about things local to this TU. */
1514 {
1517 }
1518 else
1519 {
1523 else
1527 }
1532 }
1534 /* Check that DECL has all the ABI tags that are used in parts of its type
1535 that are not reflected in its mangled name. */
1537 void
1539 {
1546 }
1548 /* Return any ABI tags that are used in parts of the type of DECL
1549 that are not reflected in its mangled name. This function is only
1550 used in backward-compatible mangling for ABI <11. */
1552 tree
1554 {
1558 /* Don't check DECL_CONV_FN_P here like we do in check_abi_tags, so
1559 that we can use this function for setting need_abi_warning
1560 regardless of the current flag_abi_version. */
1563 else
1565 }
1567 void
1569 {
1579 {
1582 {
1586 }
1587 }
1589 // If we found some tags on our template arguments, add them to our
1590 // abi_tag attribute.
1592 {
1596 else
1600 }
1603 }
1605 /* Return true, iff class T has a non-virtual destructor that is
1606 accessible from outside the class heirarchy (i.e. is public, or
1607 there's a suitable friend. */
1609 static bool
1611 {
1614 /* An implicitly declared destructor is always public. And,
1615 if it were virtual, we would have created it by now. */
1630 }
1632 /* Run through the base classes of T, updating CANT_HAVE_CONST_CTOR_P,
1633 and NO_CONST_ASN_REF_P. Also set flag bits in T based on
1634 properties of the bases. */
1636 static void
1640 {
1644 tree base_binfo;
1645 tree binfo;
1655 {
1664 /* If any base class is non-literal, so is the derived class. */
1668 /* If the base class doesn't have copy constructors or
1669 assignment operators that take const references, then the
1670 derived class cannot have such a member automatically
1671 generated. */
1680 /* A virtual base does not effect nearly emptiness. */
1681 ;
1683 {
1685 /* And if there is more than one nearly empty base, then the
1686 derived class is not nearly empty either. */
1688 else
1689 /* Remember we've seen one. */
1691 }
1693 /* If the base class is not empty or nearly empty, then this
1694 class cannot be nearly empty. */
1697 /* A lot of properties from the bases also apply to the derived
1698 class. */
1715 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT
1718 SET_CLASSTYPE_REF_FIELDS_NEED_INIT
1724 /* A standard-layout class is a class that:
1725 ...
1726 * has no non-standard-layout base classes, */
1729 {
1730 tree basefield;
1731 /* ...has no base classes of the same type as the first non-static
1732 data member... */
1734 && (same_type_ignoring_top_level_qualifiers_p
1737 else
1738 /* ...either has no non-static data members in the most-derived
1739 class and at most one base class with non-static data
1740 members, or has no base classes with non-static data
1741 members */
1747 {
1750 else
1753 }
1754 }
1756 /* Don't bother collecting tm attributes if transactional memory
1757 support is not enabled. */
1759 {
1763 }
1766 }
1768 /* If one of the base classes had TM attributes, and the current class
1769 doesn't define its own, then the current class inherits one. */
1771 {
1774 }
1775 }
1777 /* Determine all the primary bases within T. Sets BINFO_PRIMARY_BASE_P for
1778 those that are primaries. Sets BINFO_LOST_PRIMARY_P for those
1779 that have had a nearly-empty virtual primary base stolen by some
1780 other base in the hierarchy. Determines CLASSTYPE_PRIMARY_BASE for
1781 T. */
1783 static void
1785 {
1789 tree base_binfo;
1791 /* Determine the primary bases of our bases. */
1794 {
1797 /* See if we're the non-virtual primary of our inheritance
1798 chain. */
1800 {
1807 /* We are the primary binfo. */
1809 }
1810 /* Determine if we have a virtual primary base, and mark it so.
1811 */
1813 {
1817 /* Someone already claimed this base. */
1819 else
1820 {
1821 tree delta;
1826 /* A virtual binfo might have been copied from within
1827 another hierarchy. As we're about to use it as a
1828 primary base, make sure the offsets match. */
1836 }
1837 }
1838 }
1840 /* First look for a dynamic direct non-virtual base. */
1842 {
1846 {
1849 }
1850 }
1852 /* A "nearly-empty" virtual base class can be the primary base
1853 class, if no non-virtual polymorphic base can be found. Look for
1854 a nearly-empty virtual dynamic base that is not already a primary
1855 base of something in the hierarchy. If there is no such base,
1856 just pick the first nearly-empty virtual base. */
1862 {
1864 {
1865 /* Found one that is not primary. */
1868 }
1870 /* Remember the first candidate. */
1872 }
1874 found:
1875 /* If we've got a primary base, use it. */
1877 {
1882 /* We are stealing a primary base. */
1886 {
1887 tree delta;
1890 /* A virtual binfo might have been copied from within
1891 another hierarchy. As we're about to use it as a primary
1892 base, make sure the offsets match. */
1897 }
1904 }
1905 }
1907 /* Update the variant types of T. */
1909 void
1911 {
1912 tree variants;
1918 variants;
1920 {
1921 /* These fields are in the _TYPE part of the node, not in
1922 the TYPE_LANG_SPECIFIC component, so they are not shared. */
1932 /* Copy whatever these are holding today. */
1935 }
1936 }
1938 /* KLASS is a class that we're applying may_alias to after the body is
1939 parsed. Fixup any POINTER_TO and REFERENCE_TO types. The
1940 canonical type(s) will be implicitly updated. */
1942 static void
1944 {
1953 }
1955 /* Early variant fixups: we apply attributes at the beginning of the class
1956 definition, and we need to fix up any variants that have already been
1957 made via elaborated-type-specifier so that check_qualified_type works. */
1959 void
1961 {
1962 tree variants;
1976 variants;
1978 {
1979 /* These are the two fields that check_qualified_type looks at and
1980 are affected by attributes. */
1985 else
1990 }
1991 }
1992 \f
1993 /* Set memoizing fields and bits of T (and its variants) for later
1994 use. */
1996 static void
1998 {
1999 /* Fix up variants (if any). */
2003 /* For a class w/o baseclasses, 'finish_struct' has set
2004 CLASSTYPE_PURE_VIRTUALS correctly (by definition).
2005 Similarly for a class whose base classes do not have vtables.
2006 When neither of these is true, we might have removed abstract
2007 virtuals (by providing a definition), added some (by declaring
2008 new ones), or redeclared ones from a base class. We need to
2009 recalculate what's really an abstract virtual at this point (by
2010 looking in the vtables). */
2013 /* If this type has a copy constructor or a destructor, force its
2014 mode to be BLKmode, and force its TREE_ADDRESSABLE bit to be
2015 nonzero. This will cause it to be passed by invisible reference
2016 and prevent it from being returned in a register. */
2019 {
2020 tree variants;
2023 {
2026 }
2027 }
2028 }
2030 /* Issue warnings about T having private constructors, but no friends,
2031 and so forth.
2033 HAS_NONPRIVATE_METHOD is nonzero if T has any non-private methods or
2034 static members. HAS_NONPRIVATE_STATIC_FN is nonzero if T has any
2035 non-private static member functions. */
2037 static void
2039 {
2044 /* If the class has friends, those entities might create and
2045 access instances, so we should not warn. */
2048 /* We will have warned when the template was declared; there's
2049 no need to warn on every instantiation. */
2051 /* There's no reason to even consider warning about this
2052 class. */
2055 /* We only issue one warning, if more than one applies, because
2056 otherwise, on code like:
2058 class A {
2059 // Oops - forgot `public:'
2060 A();
2061 A(const A&);
2062 ~A();
2063 };
2065 we warn several times about essentially the same problem. */
2067 /* Check to see if all (non-constructor, non-destructor) member
2068 functions are private. (Since there are no friends or
2069 non-private statics, we can't ever call any of the private member
2070 functions.) */
2075 /* We're not interested in compiler-generated methods; they don't
2078 {
2080 /* A non-private static member function is just like a
2081 friend; it can create and invoke private member
2082 functions, and be accessed without a class
2083 instance. */
2087 /* Keep searching for a static member function. */
2088 }
2093 {
2094 /* There are no non-private methods, and there's at least one
2095 private member function that isn't a constructor or
2096 destructor. (If all the private members are
2097 constructors/destructors we want to use the code below that
2098 issues error messages specifically referring to
2099 constructors/destructors.) */
2105 {
2108 }
2110 {
2114 }
2115 }
2117 /* Even if some of the member functions are non-private, the class
2118 won't be useful for much if all the constructors or destructors
2119 are private: such an object can never be created or destroyed. */
2122 {
2125 t);
2127 }
2129 /* Warn about classes that have private constructors and no friends. */
2131 /* Implicitly generated constructors are always public. */
2133 {
2137 /* If a non-template class does not define a copy
2138 constructor, one is defined for it, enabling it to avoid
2139 this warning. For a template class, this does not
2140 happen, and so we would normally get a warning on:
2142 template <class T> class C { private: C(); };
2144 To avoid this asymmetry, we check TYPE_HAS_COPY_CTOR. All
2145 complete non-template or fully instantiated classes have this
2146 flag set. */
2149 else
2155 /* Ideally, we wouldn't count any constructor that takes
2156 an argument of the class type as a parameter, because
2157 such things cannot be used to construct an instance of
2158 the class unless you already have one. */
2160 else
2164 {
2167 t);
2173 }
2174 }
2175 }
2177 /* Make BINFO's vtable have N entries, including RTTI entries,
2178 vbase and vcall offsets, etc. Set its type and call the back end
2179 to lay it out. */
2181 static void
2183 {
2184 tree atype;
2185 tree vtable;
2190 /* We may have to grow the vtable. */
2193 {
2197 }
2198 }
2200 /* True iff FNDECL and BASE_FNDECL (both non-static member functions)
2201 have the same signature. */
2203 int
2205 {
2206 /* One destructor overrides another if they are the same kind of
2207 destructor. */
2211 /* But a non-destructor never overrides a destructor, nor vice
2212 versa, nor do different kinds of destructors override
2213 one-another. For example, a complete object destructor does not
2214 override a deleting destructor. */
2223 {
2231 }
2233 }
2235 /* Returns TRUE if DERIVED is a binfo containing the binfo BASE as a
2236 subobject. */
2238 static bool
2240 {
2241 tree probe;
2244 {
2248 /* If we meet a virtual base, we can't follow the inheritance
2249 any more. See if the complete type of DERIVED contains
2250 such a virtual base. */
2253 }
2255 }
2258 /* The function for which we are trying to find a final overrider. */
2259 tree fn;
2260 /* The base class in which the function was declared. */
2261 tree declaring_base;
2262 /* The candidate overriders. */
2263 tree candidates;
2264 /* Path to most derived. */
2266 };
2268 /* Add the overrider along the current path to FFOD->CANDIDATES.
2269 Returns true if an overrider was found; false otherwise. */
2271 static bool
2275 {
2276 tree method;
2278 /* If BINFO is not the most derived type, try a more derived class.
2279 A definition there will overrider a definition here. */
2281 {
2282 depth--;
2286 }
2290 {
2293 /* Remove any candidates overridden by this new function. */
2295 {
2296 /* If *CANDIDATE overrides METHOD, then METHOD
2297 cannot override anything else on the list. */
2300 /* If METHOD overrides *CANDIDATE, remove *CANDIDATE. */
2303 else
2305 }
2307 /* Add the new function. */
2310 }
2313 }
2315 /* Called from find_final_overrider via dfs_walk. */
2317 static tree
2319 {
2327 }
2329 static tree
2331 {
2336 }
2338 /* Returns a TREE_LIST whose TREE_PURPOSE is the final overrider for
2339 FN and whose TREE_VALUE is the binfo for the base where the
2340 overriding occurs. BINFO (in the hierarchy dominated by the binfo
2341 DERIVED) is the base object in which FN is declared. */
2343 static tree
2345 {
2346 find_final_overrider_data ffod;
2348 /* Getting this right is a little tricky. This is valid:
2350 struct S { virtual void f (); };
2351 struct T { virtual void f (); };
2352 struct U : public S, public T { };
2354 even though calling `f' in `U' is ambiguous. But,
2356 struct R { virtual void f(); };
2357 struct S : virtual public R { virtual void f (); };
2358 struct T : virtual public R { virtual void f (); };
2359 struct U : public S, public T { };
2361 is not -- there's no way to decide whether to put `S::f' or
2362 `T::f' in the vtable for `R'.
2364 The solution is to look at all paths to BINFO. If we find
2365 different overriders along any two, then there is a problem. */
2369 /* Determine the depth of the hierarchy. */
2380 /* If there was no winner, issue an error message. */
2385 }
2387 /* Return the index of the vcall offset for FN when TYPE is used as a
2388 virtual base. */
2390 static tree
2392 {
2394 tree_pair_p p;
2402 /* There should always be an appropriate index. */
2404 }
2406 /* Update an entry in the vtable for BINFO, which is in the hierarchy
2407 dominated by T. FN is the old function; VIRTUALS points to the
2408 corresponding position in the new BINFO_VIRTUALS list. IX is the index
2409 of that entry in the list. */
2411 static void
2414 {
2415 tree b;
2416 tree overrider;
2417 tree delta;
2418 tree virtual_base;
2419 tree first_defn;
2425 /* Find the nearest primary base (possibly binfo itself) which defines
2426 this function; this is the class the caller will convert to when
2427 calling FN through BINFO. */
2429 {
2434 /* The nearest definition is from a lost primary. */
2437 }
2440 /* Find the final overrider. */
2443 {
2446 }
2449 /* Check for adjusting covariant return types. */
2457 /* If the overrider is invalid, don't even try. */
2459 {
2460 /* If FN is a covariant thunk, we must figure out the adjustment
2461 to the final base FN was converting to. As OVERRIDER_TARGET might
2462 also be converting to the return type of FN, we have to
2463 combine the two conversions here. */
2470 {
2474 }
2475 else
2479 /* Find the equivalent binfo within the return type of the
2480 overriding function. We will want the vbase offset from
2481 there. */
2483 over_return);
2486 {
2487 /* There was no existing virtual thunk (which takes
2488 precedence). So find the binfo of the base function's
2489 return type within the overriding function's return type.
2490 Fortunately we know the covariancy is valid (it
2491 has already been checked), so we can just iterate along
2492 the binfos, which have been chained in inheritance graph
2493 order. Of course it is lame that we have to repeat the
2494 search here anyway -- we should really be caching pieces
2495 of the vtable and avoiding this repeated work. */
2498 /* Find the base binfo within the overriding function's
2499 return type. We will always find a thunk_binfo, except
2500 when the covariancy is invalid (which we will have
2501 already diagnosed). */
2504 thunk_binfo;
2510 /* See if virtual inheritance is involved. */
2512 virtual_offset;
2519 {
2523 {
2524 /* We convert via virtual base. Adjust the fixed
2525 offset to be from there. */
2526 offset =
2530 }
2532 /* There was an existing fixed offset, this must be
2533 from the base just converted to, and the base the
2534 FN was thunking to. */
2536 else
2538 }
2539 }
2542 /* Replace the overriding function with a covariant thunk. We
2543 will emit the overriding function in its own slot as
2544 well. */
2547 }
2548 else
2552 /* If we need a covariant thunk, then we may need to adjust first_defn.
2553 The ABI specifies that the thunks emitted with a function are
2554 determined by which bases the function overrides, so we need to be
2555 sure that we're using a thunk for some overridden base; even if we
2556 know that the necessary this adjustment is zero, there may not be an
2557 appropriate zero-this-adjustment thunk for us to use since thunks for
2558 overriding virtual bases always use the vcall offset.
2560 Furthermore, just choosing any base that overrides this function isn't
2561 quite right, as this slot won't be used for calls through a type that
2562 puts a covariant thunk here. Calling the function through such a type
2563 will use a different slot, and that slot is the one that determines
2564 the thunk emitted for that base.
2566 So, keep looking until we find the base that we're really overriding
2567 in this slot: the nearest primary base that doesn't use a covariant
2568 thunk in this slot. */
2570 {
2572 /* We already know that the overrider needs a covariant thunk. */
2575 {
2582 }
2584 }
2586 /* Assume that we will produce a thunk that convert all the way to
2587 the final overrider, and not to an intermediate virtual base. */
2590 /* See if we can convert to an intermediate virtual base first, and then
2591 use the vcall offset located there to finish the conversion. */
2593 {
2594 /* If we find the final overrider, then we can stop
2595 walking. */
2600 /* If we find a virtual base, and we haven't yet found the
2601 overrider, then there is a virtual base between the
2602 declaring base (first_defn) and the final overrider. */
2604 {
2607 }
2608 }
2610 /* Compute the constant adjustment to the `this' pointer. The
2611 `this' pointer, when this function is called, will point at BINFO
2612 (or one of its primary bases, which are at the same offset). */
2614 /* The `this' pointer needs to be adjusted from the declaration to
2615 the nearest virtual base. */
2620 /* If the nearest definition is in a lost primary, we don't need an
2621 entry in our vtable. Except possibly in a constructor vtable,
2622 if we happen to get our primary back. In that case, the offset
2623 will be zero, as it will be a primary base. */
2625 else
2626 /* The `this' pointer needs to be adjusted from pointing to
2627 BINFO to pointing at the base where the final overrider
2628 appears. */
2639 else
2643 }
2645 /* Called from modify_all_vtables via dfs_walk. */
2647 static tree
2649 {
2651 tree virtuals;
2652 tree old_virtuals;
2656 /* A base without a vtable needs no modification, and its bases
2657 are uninteresting. */
2662 /* Don't do the primary vtable, if it's new. */
2666 /* There's no need to modify the vtable for a non-virtual primary
2667 base; we're not going to use that vtable anyhow. We do still
2668 need to do this for virtual primary bases, as they could become
2669 non-primary in a construction vtable. */
2674 /* Now, go through each of the virtual functions in the virtual
2675 function table for BINFO. Find the final overrider, and update
2676 the BINFO_VIRTUALS list appropriately. */
2679 virtuals;
2683 binfo,
2688 }
2690 /* Update all of the primary and secondary vtables for T. Create new
2691 vtables as required, and initialize their RTTI information. Each
2692 of the functions in VIRTUALS is declared in T and may override a
2693 virtual function from a base class; find and modify the appropriate
2694 entries to point to the overriding functions. Returns a list, in
2695 declaration order, of the virtual functions that are declared in T,
2696 but do not appear in the primary base class vtable, and which
2697 should therefore be appended to the end of the vtable for T. */
2699 static tree
2701 {
2705 /* Mangle the vtable name before entering dfs_walk (c++/51884). */
2709 /* Update all of the vtables. */
2712 /* Add virtual functions not already in our primary vtable. These
2713 will be both those introduced by this class, and those overridden
2714 from secondary bases. It does not include virtuals merely
2715 inherited from secondary bases. */
2717 {
2722 {
2723 /* We don't need to adjust the `this' pointer when
2724 calling this function. */
2728 /* This is a function not already in our vtable. Keep it. */
2730 }
2731 else
2732 /* We've already got an entry for this function. Skip it. */
2734 }
2737 }
2739 /* Get the base virtual function declarations in T that have the
2740 indicated NAME. */
2742 static void
2744 {
2747 /* Find virtual functions in T with the indicated NAME. */
2749 {
2753 {
2756 }
2757 }
2764 {
2767 }
2768 }
2770 /* If this declaration supersedes the declaration of
2771 a method declared virtual in the base class, then
2772 mark this field as being virtual as well. */
2774 void
2776 {
2779 /* In [temp.mem] we have:
2781 A specialization of a member function template does not
2782 override a virtual function from a base class. */
2789 /* Set DECL_VINDEX to a value that is neither an INTEGER_CST nor
2790 the error_mark_node so that we know it is an overriding
2791 function. */
2792 {
2799 }
2802 {
2808 }
2813 }
2815 /* Warn about hidden virtual functions that are not overridden in t.
2816 We know that constructors and destructors don't apply. */
2818 static void
2820 {
2823 {
2831 tree base_binfo;
2832 tree binfo;
2835 /* Iterate through all of the base classes looking for possibly
2836 hidden functions. */
2839 {
2842 }
2844 /* If there are no functions to hide, continue. */
2848 /* Remove any overridden functions. */
2850 {
2854 {
2855 /* If the method from the base class has the same
2856 signature as the method from the derived class, it
2857 has been overridden. */
2862 }
2863 }
2865 /* Now give a warning for all base functions without overriders,
2866 as they are hidden. */
2867 tree base_fndecl;
2870 {
2871 /* Here we know it is a hider, and no overrider exists. */
2873 OPT_Woverloaded_virtual,
2877 }
2878 }
2879 }
2881 /* Recursive helper for finish_struct_anon. */
2883 static void
2885 {
2889 {
2890 /* We're generally only interested in entities the user
2891 declared, but we also find nested classes by noticing
2892 the TYPE_DECL that we create implicitly. You're
2893 allowed to put one anonymous union inside another,
2894 though, so we explicitly tolerate that. We use
2895 TYPE_UNNAMED_P rather than ANON_AGGR_TYPE_P so that
2896 we also allow unnamed types used for defining fields. */
2903 {
2904 /* We already complained about static data members in
2905 finish_static_data_member_decl. */
2907 {
2910 "%q#D invalid; an anonymous union can "
2912 else
2914 "%q#D invalid; an anonymous struct can "
2916 }
2918 }
2921 {
2923 {
2927 else
2930 }
2932 {
2936 else
2939 }
2940 }
2945 /* Recurse into the anonymous aggregates to handle correctly
2946 access control (c++/24926):
2948 class A {
2949 union {
2950 union {
2951 int i;
2952 };
2953 };
2954 };
2956 int j=A().i; */
2960 }
2961 }
2963 /* Check for things that are invalid. There are probably plenty of other
2964 things we should check for also. */
2966 static void
2968 {
2970 {
2979 }
2980 }
2982 /* Add T to CLASSTYPE_DECL_LIST of current_class_type which
2983 will be used later during class template instantiation.
2984 When FRIEND_P is zero, T can be a static member data (VAR_DECL),
2985 a non-static member data (FIELD_DECL), a member function
2986 (FUNCTION_DECL), a nested type (RECORD_TYPE, ENUM_TYPE),
2987 a typedef (TYPE_DECL) or a member class template (TEMPLATE_DECL)
2988 When FRIEND_P is nonzero, T is either a friend class
2989 (RECORD_TYPE, TEMPLATE_DECL) or a friend function
2990 (FUNCTION_DECL, TEMPLATE_DECL). */
2992 void
2994 {
2995 /* Save some memory by not creating TREE_LIST if TYPE is not template. */
3000 }
3002 /* This function is called from declare_virt_assop_and_dtor via
3003 dfs_walk_all.
3005 DATA is a type that direcly or indirectly inherits the base
3006 represented by BINFO. If BINFO contains a virtual assignment [copy
3007 assignment or move assigment] operator or a virtual constructor,
3008 declare that function in DATA if it hasn't been already declared. */
3010 static tree
3012 {
3020 /* A base without a vtable needs no modification, and its bases
3021 are uninteresting. */
3025 /* If this is a primary base, then we have already looked at the
3026 virtual functions of its vtable. */
3030 {
3034 {
3039 }
3043 }
3046 }
3048 /* If the class type T has a direct or indirect base that contains a
3049 virtual assignment operator or a virtual destructor, declare that
3050 function in T if it hasn't been already declared. */
3052 static void
3054 {
3062 dfs_declare_virt_assop_and_dtor,
3064 }
3066 /* Declare the inheriting constructor for class T inherited from base
3067 constructor CTOR with the parameter array PARMS of size NPARMS. */
3069 static void
3071 {
3074 /* We don't declare an inheriting ctor that would be a default,
3075 copy or move ctor for derived or base. */
3080 {
3084 }
3093 {
3096 }
3097 }
3099 /* Declare all the inheriting constructors for class T inherited from base
3100 constructor CTOR. */
3102 static void
3104 {
3108 {
3114 }
3119 {
3123 }
3126 {
3130 }
3131 }
3133 /* Create default constructors, assignment operators, and so forth for
3134 the type indicated by T, if they are needed. CANT_HAVE_CONST_CTOR,
3135 and CANT_HAVE_CONST_ASSIGNMENT are nonzero if, for whatever reason,
3136 the class cannot have a default constructor, copy constructor
3137 taking a const reference argument, or an assignment operator taking
3138 a const reference, respectively. */
3140 static void
3144 {
3145 /* Destructor. */
3147 /* In general, we create destructors lazily. */
3156 /* [class.ctor]
3158 If there is no user-declared constructor for a class, a default
3159 constructor is implicitly declared. */
3161 {
3166 /* Don't force the declaration to get a hard answer; if the
3167 definition would have made the class non-literal, it will still be
3168 non-literal because of the base or member in question, and that
3169 gives a better diagnostic. */
3171 }
3173 /* [class.ctor]
3175 If a class definition does not explicitly declare a copy
3176 constructor, one is declared implicitly. */
3178 {
3184 }
3186 /* If there is no assignment operator, one will be created if and
3187 when it is needed. For now, just record whether or not the type
3188 of the parameter to the assignment operator will be a const or
3189 non-const reference. */
3191 {
3197 }
3199 /* We can't be lazy about declaring functions that might override
3200 a virtual function from a base class. */
3204 {
3208 {
3209 /* declare, then remove the decl */
3217 }
3218 else
3220 }
3221 }
3223 /* FIELD is a bit-field. We are finishing the processing for its
3224 enclosing type. Issue any appropriate messages and set appropriate
3225 flags. Returns false if an error has been diagnosed. */
3227 static bool
3229 {
3231 tree w;
3233 /* Extract the declared width of the bitfield, which has been
3234 temporarily stashed in DECL_INITIAL. */
3237 /* Remove the bit-field width indicator so that the rest of the
3238 compiler does not treat that value as an initializer. */
3241 /* Detect invalid bit-field type. */
3243 {
3246 }
3247 else
3248 {
3250 /* Avoid the non_lvalue wrapper added by fold for PLUS_EXPRs. */
3253 /* detect invalid field size. */
3259 {
3262 }
3264 {
3267 }
3269 {
3272 }
3287 }
3290 {
3294 }
3295 else
3296 {
3297 /* Non-bit-fields are aligned for their type. */
3301 }
3302 }
3304 /* FIELD is a non bit-field. We are finishing the processing for its
3305 enclosing type T. Issue any appropriate messages and set appropriate
3306 flags. */
3308 static bool
3310 tree t,
3313 {
3317 /* In C++98 an anonymous union cannot contain any fields which would change
3318 the settings of CANT_HAVE_CONST_CTOR and friends. */
3320 ;
3321 /* And, we don't set TYPE_HAS_CONST_COPY_CTOR, etc., for anonymous
3322 structs. So, we recurse through their fields here. */
3324 {
3329 cant_have_const_ctor,
3330 no_const_asn_ref);
3331 }
3332 /* Check members with class type for constructors, destructors,
3333 etc. */
3335 {
3336 /* Never let anything with uninheritable virtuals
3337 make it through without complaint. */
3341 {
3346 field);
3351 field);
3353 {
3357 }
3358 }
3359 else
3360 {
3373 }
3382 }
3387 /* `build_class_init_list' does not recognize
3388 non-FIELD_DECLs. */
3392 }
3394 /* Check the data members (both static and non-static), class-scoped
3395 typedefs, etc., appearing in the declaration of T. Issue
3396 appropriate diagnostics. Sets ACCESS_DECLS to a list (in
3397 declaration order) of access declarations; each TREE_VALUE in this
3398 list is a USING_DECL.
3400 In addition, set the following flags:
3402 EMPTY_P
3403 The class is empty, i.e., contains no non-static data members.
3405 CANT_HAVE_CONST_CTOR_P
3406 This class cannot have an implicitly generated copy constructor
3407 taking a const reference.
3409 CANT_HAVE_CONST_ASN_REF
3410 This class cannot have an implicitly generated assignment
3411 operator taking a const reference.
3413 All of these flags should be initialized before calling this
3414 function.
3416 Returns a pointer to the end of the TYPE_FIELDs chain; additional
3417 fields can be added by adding to this chain. */
3419 static void
3423 {
3431 /* Assume there are no access declarations. */
3433 /* Assume this class has no pointer members. */
3435 /* Assume none of the members of this class have default
3436 initializations. */
3440 {
3448 {
3449 /* Save the access declarations for our caller. */
3452 }
3459 /* FIXME: We should fold in the checking from check_methods. */
3462 /* If we've gotten this far, it's a data member, possibly static,
3463 or an enumerator. */
3467 /* When this goes into scope, it will be a non-local reference. */
3471 {
3472 /* [class.union] (C++98)
3474 If a union contains a static data member, or a member of
3475 reference type, the program is ill-formed.
3477 In C++11 [class.union] says:
3478 If a union contains a non-static data member of reference type
3479 the program is ill-formed. */
3481 {
3485 }
3488 {
3492 }
3493 }
3495 /* Perform error checking that did not get done in
3496 grokdeclarator. */
3498 {
3502 }
3504 {
3508 }
3516 /* Now it can only be a FIELD_DECL. */
3521 /* If at least one non-static data member is non-literal, the whole
3522 class becomes non-literal. Per Core/1453, volatile non-static
3523 data members and base classes are also not allowed.
3524 Note: if the type is incomplete we will complain later on. */
3529 /* A standard-layout class is a class that:
3530 ...
3531 has the same access control (Clause 11) for all non-static data members,
3532 ... */
3539 /* If this is of reference type, check if it needs an init. */
3541 {
3547 {
3548 /* ARM $12.6.2: [A member initializer list] (or, for an
3549 aggregate, initialization by a brace-enclosed list) is the
3550 only way to initialize nonstatic const and reference
3551 members. */
3554 }
3555 }
3560 {
3562 {
3563 warning_at
3566 x);
3568 }
3572 }
3575 /* We don't treat zero-width bitfields as making a class
3576 non-empty. */
3577 ;
3578 else
3579 {
3580 /* The class is non-empty. */
3582 /* The class is not even nearly empty. */
3584 /* If one of the data members contains an empty class,
3585 so does T. */
3589 }
3591 /* This is used by -Weffc++ (see below). Warn only for pointers
3592 to members which might hold dynamic memory. So do not warn
3593 for pointers to functions or pointers to members. */
3599 {
3604 }
3610 {
3612 {
3616 }
3618 {
3622 }
3623 }
3626 /* DR 148 now allows pointers to members (which are POD themselves),
3627 to be allowed in POD structs. */
3636 /* We set DECL_C_BIT_FIELD in grokbitfield.
3637 If the type and width are valid, we'll also set DECL_BIT_FIELD. */
3640 cant_have_const_ctor_p,
3641 no_const_asn_ref_p))
3642 {
3647 }
3649 /* Now that we've removed bit-field widths from DECL_INITIAL,
3650 anything left in DECL_INITIAL is an NSDMI that makes the class
3651 non-aggregate in C++11. */
3655 /* If any field is const, the structure type is pseudo-const. */
3657 {
3662 {
3663 /* ARM $12.6.2: [A member initializer list] (or, for an
3664 aggregate, initialization by a brace-enclosed list) is the
3665 only way to initialize nonstatic const and reference
3666 members. */
3669 }
3670 }
3671 /* A field that is pseudo-const makes the structure likewise. */
3673 {
3678 }
3680 /* Core issue 80: A nonstatic data member is required to have a
3681 different name from the class iff the class has a
3682 user-declared constructor. */
3687 }
3689 /* Effective C++ rule 11: if a class has dynamic memory held by pointers,
3690 it should also define a copy constructor and an assignment operator to
3691 implement the correct copy semantic (deep vs shallow, etc.). As it is
3692 not feasible to check whether the constructors do allocate dynamic memory
3693 and store it within members, we approximate the warning like this:
3695 -- Warn only if there are members which are pointers
3696 -- Warn only if there is a non-trivial constructor (otherwise,
3697 there cannot be memory allocated).
3698 -- Warn only if there is a non-trivial destructor. We assume that the
3699 user at least implemented the cleanup correctly, and a destructor
3700 is needed to free dynamic memory.
3702 This seems enough for practical purposes. */
3704 && has_pointers
3708 {
3712 {
3717 }
3721 }
3723 /* Non-static data member initializers make the default constructor
3724 non-trivial. */
3726 {
3729 }
3731 /* If any of the fields couldn't be packed, unset TYPE_PACKED. */
3735 /* Check anonymous struct/anonymous union fields. */
3738 /* We've built up the list of access declarations in reverse order.
3739 Fix that now. */
3741 }
3743 /* If TYPE is an empty class type, records its OFFSET in the table of
3744 OFFSETS. */
3746 static int
3748 {
3749 splay_tree_node n;
3754 /* Record the location of this empty object in OFFSETS. */
3762 type,
3766 }
3768 /* Returns nonzero if TYPE is an empty class type and there is
3769 already an entry in OFFSETS for the same TYPE as the same OFFSET. */
3771 static int
3773 {
3774 splay_tree_node n;
3775 tree t;
3780 /* Record the location of this empty object in OFFSETS. */
3790 }
3792 /* Walk through all the subobjects of TYPE (located at OFFSET). Call
3793 F for every subobject, passing it the type, offset, and table of
3794 OFFSETS. If VBASES_P is one, then virtual non-primary bases should
3795 be traversed.
3797 If MAX_OFFSET is non-NULL, then subobjects with an offset greater
3798 than MAX_OFFSET will not be walked.
3800 If F returns a nonzero value, the traversal ceases, and that value
3801 is returned. Otherwise, returns zero. */
3803 static int
3805 subobject_offset_fn f,
3806 tree offset,
3807 splay_tree offsets,
3808 tree max_offset,
3810 {
3814 /* If this OFFSET is bigger than the MAX_OFFSET, then we should
3815 stop. */
3823 {
3826 }
3829 {
3830 tree field;
3831 tree binfo;
3834 /* Avoid recursing into objects that are not interesting. */
3838 /* Record the location of TYPE. */
3843 /* Iterate through the direct base classes of TYPE. */
3847 {
3848 tree binfo_offset;
3853 tree orig_binfo;
3854 /* We cannot rely on BINFO_OFFSET being set for the base
3855 class yet, but the offsets for direct non-virtual
3856 bases can be calculated by going back to the TYPE. */
3859 offset,
3863 f,
3864 binfo_offset,
3865 offsets,
3866 max_offset,
3870 }
3873 {
3877 /* Iterate through the virtual base classes of TYPE. In G++
3878 3.2, we included virtual bases in the direct base class
3879 loop above, which results in incorrect results; the
3880 correct offsets for virtual bases are only known when
3881 working with the most derived type. */
3885 {
3887 f,
3889 offset,
3891 offsets,
3892 max_offset,
3896 }
3897 else
3898 {
3899 /* We still have to walk the primary base, if it is
3900 virtual. (If it is non-virtual, then it was walked
3901 above.) */
3907 {
3908 r = (walk_subobject_offsets
3913 }
3914 }
3915 }
3917 /* Iterate through the fields of TYPE. */
3922 {
3923 tree field_offset;
3928 f,
3930 offset,
3931 field_offset),
3932 offsets,
3933 max_offset,
3937 }
3938 }
3940 {
3943 tree index;
3945 /* Avoid recursing into objects that are not interesting. */
3948 || !domain
3952 /* Step through each of the elements in the array. */
3956 {
3958 f,
3959 offset,
3960 offsets,
3961 max_offset,
3967 /* If this new OFFSET is bigger than the MAX_OFFSET, then
3968 there's no point in iterating through the remaining
3969 elements of the array. */
3972 }
3973 }
3976 }
3978 /* Record all of the empty subobjects of TYPE (either a type or a
3979 binfo). If IS_DATA_MEMBER is true, then a non-static data member
3980 is being placed at OFFSET; otherwise, it is a base class that is
3981 being placed at OFFSET. */
3983 static void
3985 tree offset,
3986 splay_tree offsets,
3988 {
3989 tree max_offset;
3990 /* If recording subobjects for a non-static data member or a
3991 non-empty base class , we do not need to record offsets beyond
3992 the size of the biggest empty class. Additional data members
3993 will go at the end of the class. Additional base classes will go
3994 either at offset zero (if empty, in which case they cannot
3995 overlap with offsets past the size of the biggest empty class) or
3996 at the end of the class.
3998 However, if we are placing an empty base class, then we must record
3999 all offsets, as either the empty class is at offset zero (where
4000 other empty classes might later be placed) or at the end of the
4001 class (where other objects might then be placed, so other empty
4002 subobjects might later overlap). */
4006 else
4010 }
4012 /* Returns nonzero if any of the empty subobjects of TYPE (located at
4013 OFFSET) conflict with entries in OFFSETS. If VBASES_P is nonzero,
4014 virtual bases of TYPE are examined. */
4016 static int
4018 tree offset,
4019 splay_tree offsets,
4021 {
4022 splay_tree_node max_node;
4024 /* Get the node in OFFSETS that indicates the maximum offset where
4025 an empty subobject is located. */
4027 /* If there aren't any empty subobjects, then there's no point in
4028 performing this check. */
4034 vbases_p);
4035 }
4037 /* DECL is a FIELD_DECL corresponding either to a base subobject of a
4038 non-static data member of the type indicated by RLI. BINFO is the
4039 binfo corresponding to the base subobject, OFFSETS maps offsets to
4040 types already located at those offsets. This function determines
4041 the position of the DECL. */
4043 static void
4045 tree decl,
4046 tree binfo,
4047 splay_tree offsets)
4048 {
4051 tree type;
4054 {
4055 /* For the purposes of determining layout conflicts, we want to
4056 use the class type of BINFO; TREE_TYPE (DECL) will be the
4057 CLASSTYPE_AS_BASE version, which does not contain entries for
4058 zero-sized bases. */
4061 }
4062 else
4063 {
4066 }
4068 /* Try to place the field. It may take more than one try if we have
4069 a hard time placing the field without putting two objects of the
4070 same type at the same address. */
4072 {
4075 /* Place this field. */
4079 /* We have to check to see whether or not there is already
4080 something of the same type at the offset we're about to use.
4081 For example, consider:
4083 struct S {};
4084 struct T : public S { int i; };
4085 struct U : public S, public T {};
4087 Here, we put S at offset zero in U. Then, we can't put T at
4088 offset zero -- its S component would be at the same address
4089 as the S we already allocated. So, we have to skip ahead.
4090 Since all data members, including those whose type is an
4091 empty class, have nonzero size, any overlap can happen only
4092 with a direct or indirect base-class -- it can't happen with
4093 a data member. */
4094 /* In a union, overlap is permitted; all members are placed at
4095 offset zero. */
4100 {
4101 /* Strip off the size allocated to this field. That puts us
4102 at the first place we could have put the field with
4103 proper alignment. */
4106 /* Bump up by the alignment required for the type. */
4107 rli->bitpos
4113 }
4116 {
4117 /* Before ABI v9, we were giving nullptr_t alignment of 1; if
4118 the offset wasn't aligned like a pointer when we started to
4119 layout this field, that affects its position. */
4122 {
4125 "alignment of %qD increased in -fabi-version=9 "
4127 else
4130 }
4132 }
4133 else
4134 /* There was no conflict. We're done laying out this field. */
4136 }
4138 /* Now that we know where it will be placed, update its
4139 BINFO_OFFSET. */
4141 /* Indirect virtual bases may have a nonzero BINFO_OFFSET at
4142 this point because their BINFO_OFFSET is copied from another
4143 hierarchy. Therefore, we may not need to add the entire
4144 OFFSET. */
4150 }
4152 /* Returns true if TYPE is empty and OFFSET is nonzero. */
4154 static int
4156 tree offset,
4158 {
4160 }
4162 /* Layout the empty base BINFO. EOC indicates the byte currently just
4163 past the end of the class, and should be correctly aligned for a
4164 class of the type indicated by BINFO; OFFSETS gives the offsets of
4165 the empty bases allocated so far. T is the most derived
4166 type. Return nonzero iff we added it at the end. */
4168 static bool
4171 {
4172 tree alignment;
4176 /* This routine should only be used for empty classes. */
4181 propagate_binfo_offsets
4185 /* This is an empty base class. We first try to put it at offset
4186 zero. */
4189 offsets,
4191 {
4192 /* That didn't work. Now, we move forward from the next
4193 available spot in the class. */
4197 {
4200 offsets,
4202 /* We finally found a spot where there's no overlap. */
4205 /* There's overlap here, too. Bump along to the next spot. */
4207 }
4208 }
4211 {
4216 }
4219 }
4221 /* Build the FIELD_DECL for BASETYPE as a base of T, add it to the chain of
4222 fields at NEXT_FIELD, and return it. */
4224 static tree
4226 {
4227 /* Create the FIELD_DECL. */
4241 /* Add the new FIELD_DECL to the list of fields for T. */
4247 }
4249 /* Layout the base given by BINFO in the class indicated by RLI.
4250 *BASE_ALIGN is a running maximum of the alignments of
4251 any base class. OFFSETS gives the location of empty base
4252 subobjects. T is the most derived type. Return nonzero if the new
4253 object cannot be nearly-empty. A new FIELD_DECL is inserted at
4254 *NEXT_FIELD, unless BINFO is for an empty base class.
4256 Returns the location at which the next field should be inserted. */
4261 {
4266 /* This error is now reported in xref_tag, thus giving better
4267 location information. */
4270 /* Place the base class. */
4272 {
4273 tree decl;
4275 /* The containing class is non-empty because it has a non-empty
4276 base class. */
4279 /* Create the FIELD_DECL. */
4282 /* Try to place the field. It may take more than one try if we
4283 have a hard time placing the field without putting two
4284 objects of the same type at the same address. */
4286 }
4287 else
4288 {
4289 tree eoc;
4292 /* On some platforms (ARM), even empty classes will not be
4293 byte-aligned. */
4298 /* A nearly-empty class "has no proper base class that is empty,
4299 not morally virtual, and at an offset other than zero." */
4301 {
4304 /* The check above (used in G++ 3.2) is insufficient because
4305 an empty class placed at offset zero might itself have an
4306 empty base at a nonzero offset. */
4308 empty_base_at_nonzero_offset_p,
4309 size_zero_node,
4314 }
4316 /* We used to not create a FIELD_DECL for empty base classes because of
4317 back end issues with overlapping FIELD_DECLs, but that doesn't seem to
4318 be a problem anymore. We need them to handle initialization of C++17
4319 aggregate bases. */
4321 {
4326 }
4328 /* An empty virtual base causes a class to be non-empty
4329 -- but in that case we do not need to clear CLASSTYPE_EMPTY_P
4330 here because that was already done when the virtual table
4331 pointer was created. */
4332 }
4334 /* Record the offsets of BINFO and its base subobjects. */
4337 offsets,
4341 }
4343 /* Layout all of the non-virtual base classes. Record empty
4344 subobjects in OFFSETS. T is the most derived type. Return nonzero
4345 if the type cannot be nearly empty. The fields created
4346 corresponding to the base classes will be inserted at
4347 *NEXT_FIELD. */
4349 static void
4352 {
4353 /* Chain to hold all the new FIELD_DECLs which stand in for base class
4354 subobjects. */
4359 /* The primary base class is always allocated first. */
4364 /* Now allocate the rest of the bases. */
4366 {
4367 tree base_binfo;
4371 /* The primary base was already allocated above, so we don't
4372 need to allocate it again here. */
4376 /* Virtual bases are added at the end (a primary virtual base
4377 will have already been added). */
4383 }
4384 }
4386 /* Go through the TYPE_FIELDS of T issuing any appropriate
4387 diagnostics, figuring out which methods override which other
4388 methods, and so forth. */
4390 static void
4392 {
4395 {
4401 /* The name of the field is the original field name
4402 Save this in auxiliary field for later overloading. */
4404 {
4408 }
4410 /* All user-provided destructors are non-trivial.
4411 Constructors and assignment ops are handled in
4412 grok_special_member_properties. */
4419 "%<transaction_safe_dynamic%> may only be specified for "
4421 }
4422 }
4424 /* FN is a constructor or destructor. Clone the declaration to create
4425 a specialized in-charge or not-in-charge version, as indicated by
4426 NAME. */
4428 static tree
4430 {
4431 tree parms;
4432 tree clone;
4434 /* Copy the function. */
4436 /* Reset the function name. */
4438 /* Remember where this function came from. */
4440 /* Make it easy to find the CLONE given the FN. */
4444 /* If this is a template, do the rest on the DECL_TEMPLATE_RESULT. */
4446 {
4453 }
4454 else
4455 {
4456 // Clone constraints.
4460 }
4465 /* There's no pending inline data for this function. */
4469 /* The base-class destructor is not virtual. */
4471 {
4475 }
4481 /* If there was an in-charge parameter, drop it from the function
4482 type. */
4484 {
4485 tree basetype;
4486 tree parmtypes;
4487 tree exceptions;
4492 /* Skip the `this' parameter. */
4494 /* Skip the in-charge parameter. */
4496 /* And the VTT parm, in a complete [cd]tor. */
4501 {
4502 /* If we're omitting inherited parms, that just leaves the VTT. */
4505 }
4509 parmtypes);
4512 exceptions);
4516 }
4518 /* Copy the function parameters. */
4520 /* Remove the in-charge parameter. */
4522 {
4526 }
4527 /* And the VTT parm, in a complete [cd]tor. */
4529 {
4532 else
4533 {
4537 }
4538 }
4540 /* A base constructor inheriting from a virtual base doesn't get the
4541 arguments. */
4546 {
4549 }
4551 /* Create the RTL for this function. */
4556 }
4558 /* Implementation of DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P, do
4559 not invoke this function directly.
4561 For a non-thunk function, returns the address of the slot for storing
4562 the function it is a clone of. Otherwise returns NULL_TREE.
4564 If JUST_TESTING, looks through TEMPLATE_DECL and returns NULL if
4565 cloned_function is unset. This is to support the separate
4566 DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P modes; using the latter
4567 on a template makes sense, but not the former. */
4569 tree *
4571 {
4579 {
4580 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4583 else
4584 #endif
4586 }
4591 else
4593 }
4595 /* Produce declarations for all appropriate clones of FN. If
4596 UPDATE_METHODS is true, the clones are added to the
4597 CLASSTYPE_MEMBER_VEC. */
4599 void
4601 {
4602 tree clone;
4604 /* Avoid inappropriate cloning. */
4610 {
4611 /* For each constructor, we need two variants: an in-charge version
4612 and a not-in-charge version. */
4619 }
4620 else
4621 {
4624 /* For each destructor, we need three variants: an in-charge
4625 version, a not-in-charge version, and an in-charge deleting
4626 version. We clone the deleting version first because that
4627 means it will go second on the TYPE_FIELDS list -- and that
4628 corresponds to the correct layout order in the virtual
4629 function table.
4631 For a non-virtual destructor, we do not build a deleting
4632 destructor. */
4634 {
4638 }
4645 }
4647 /* Note that this is an abstract function that is never emitted. */
4649 }
4651 /* DECL is an in charge constructor, which is being defined. This will
4652 have had an in class declaration, from whence clones were
4653 declared. An out-of-class definition can specify additional default
4654 arguments. As it is the clones that are involved in overload
4655 resolution, we must propagate the information from the DECL to its
4656 clones. */
4658 void
4660 {
4661 tree clone;
4665 {
4672 /* Skip the 'this' parameter. */
4688 {
4690 {
4694 }
4700 {
4701 /* A default parameter has been added. Adjust the
4702 clone's parameters. */
4706 tree type;
4711 {
4714 clone_parms);
4716 }
4719 clone_parms);
4728 }
4729 }
4731 }
4732 }
4734 /* For each of the constructors and destructors in T, create an
4735 in-charge and not-in-charge variant. */
4737 static void
4739 {
4740 /* While constructors can be via a using declaration, at this point
4741 we no longer need to know that. */
4747 }
4749 /* Deduce noexcept for a destructor DTOR. */
4751 void
4753 {
4756 noexcept_deferred_spec);
4757 }
4759 /* Subroutine of set_one_vmethod_tm_attributes. Search base classes
4760 of TYPE for virtual functions which FNDECL overrides. Return a
4761 mask of the tm attributes found therein. */
4763 static int
4765 {
4767 tree base_binfo;
4771 {
4779 {
4783 else
4786 }
4787 else
4789 }
4792 }
4794 /* Subroutine of set_method_tm_attributes. Handle the checks and
4795 inheritance for one virtual method FNDECL. */
4797 static void
4799 {
4800 tree tm_attr;
4805 /* If FNDECL doesn't actually override anything (i.e. T is the
4806 class that first declares FNDECL virtual), then we're done. */
4813 /* Intel STM Language Extension 3.0, Section 4.2 table 4:
4814 tm_pure must match exactly, otherwise no weakening of
4815 tm_safe > tm_callable > nothing. */
4816 /* ??? The tm_pure attribute didn't make the transition to the
4817 multivendor language spec. */
4819 {
4821 {
4824 }
4825 }
4826 /* If the overridden function is tm_pure, then FNDECL must be. */
4829 /* Look for base class combinations that cannot be satisfied. */
4831 {
4837 }
4838 /* If FNDECL did not declare an attribute, then inherit the most
4839 restrictive one. */
4841 {
4843 }
4844 /* Otherwise validate that we're not weaker than a function
4845 that is being overridden. */
4846 else
4847 {
4851 }
4854 err_override:
4858 }
4860 /* For each of the methods in T, propagate a class-level tm attribute. */
4862 static void
4864 {
4867 /* Don't bother collecting tm attributes if transactional memory
4868 support is not enabled. */
4872 /* Process virtual methods first, as they inherit directly from the
4873 base virtual function and also require validation of new attributes. */
4875 {
4876 tree vchain;
4879 {
4884 }
4885 }
4887 /* If the class doesn't have an attribute, nothing more to do. */
4892 /* Any method that does not yet have a tm attribute inherits
4893 the one from the class. */
4898 }
4900 /* Returns true if FN is a default constructor. */
4902 bool
4904 {
4907 }
4909 /* Returns true iff class T has a user-defined constructor that can be called
4910 with more than zero arguments. */
4912 bool
4914 {
4919 {
4926 }
4929 }
4931 /* Returns the defaulted constructor if T has one. Otherwise, returns
4932 NULL_TREE. */
4934 tree
4936 {
4941 {
4947 }
4950 }
4952 /* Returns true iff FN is a user-provided function, i.e. user-declared
4953 and not defaulted at its first declaration. */
4955 bool
4957 {
4960 else
4964 }
4966 /* Returns true iff class T has a user-provided constructor. */
4968 bool
4970 {
4982 }
4984 /* Returns true iff class T has a user-provided or explicit constructor. */
4986 bool
4988 {
4996 {
5000 }
5003 }
5005 /* Returns true iff class T has a non-user-provided (i.e. implicitly
5006 declared or explicitly defaulted in the class body) default
5007 constructor. */
5009 bool
5011 {
5018 {
5024 }
5027 }
5029 /* TYPE is being used as a virtual base, and has a non-trivial move
5030 assignment. Return true if this is due to there being a user-provided
5031 move assignment in TYPE or one of its subobjects; if there isn't, then
5032 multiple move assignment can't cause any harm. */
5034 bool
5036 {
5037 /* Does the type itself have a user-provided move assignment operator? */
5045 /* Do any of its bases? */
5047 tree base_binfo;
5052 /* Or non-static data members? */
5054 {
5059 }
5061 /* Seems not. */
5063 }
5065 /* If default-initialization leaves part of TYPE uninitialized, returns
5066 a DECL for the field or TYPE itself (DR 253). */
5068 tree
5070 {
5081 {
5085 }
5090 {
5094 }
5097 }
5099 /* Returns true iff for class T, a trivial synthesized default constructor
5100 would be constexpr. */
5102 bool
5104 {
5105 /* A defaulted trivial default constructor is constexpr
5106 if there is nothing to initialize. */
5109 }
5111 /* Returns true iff class T has a constexpr default constructor. */
5113 bool
5115 {
5116 tree fns;
5119 {
5120 /* The caller should have stripped an enclosing array. */
5123 }
5125 {
5128 /* Non-trivial, we need to check subobject constructors. */
5130 }
5133 }
5135 /* Returns true iff class T has a constexpr default constructor or has an
5136 implicitly declared default constructor that we can't tell if it's constexpr
5137 without forcing a lazy declaration (which might cause undesired
5138 instantiations). */
5140 bool
5142 {
5145 /* Assume it's constexpr. */
5148 }
5150 /* Returns true iff class TYPE has a virtual destructor. */
5152 bool
5154 {
5155 tree dtor;
5163 }
5165 /* Returns true iff T, a class, has a move-assignment or
5166 move-constructor. Does not lazily declare either.
5167 If USER_P is false, any move function will do. If it is true, the
5168 move function must be user-declared.
5170 Note that user-declared here is different from "user-provided",
5171 which doesn't include functions that are defaulted in the
5172 class. */
5174 bool
5176 {
5194 }
5196 /* Nonzero if we need to build up a constructor call when initializing an
5197 object of this class, either because it has a user-declared constructor
5198 or because it doesn't have a default constructor (so we need to give an
5199 error if no initializer is provided). Use TYPE_NEEDS_CONSTRUCTING when
5200 what you care about is whether or not an object can be produced by a
5201 constructor (e.g. so we don't set TREE_READONLY on const variables of
5202 such type); use this function when what you care about is whether or not
5203 to try to call a constructor to create an object. The latter case is
5204 the former plus some cases of constructors that cannot be called. */
5206 bool
5208 {
5209 tree inner;
5219 /* A user-declared constructor might be private, and a constructor might
5220 be trivial but deleted. */
5223 {
5228 }
5230 }
5232 /* Like type_build_ctor_call, but for destructors. */
5234 bool
5236 {
5237 tree inner;
5246 /* A user-declared destructor might be private, and a destructor might
5247 be trivial but deleted. */
5250 {
5255 }
5257 }
5259 /* Remove all zero-width bit-fields from T. */
5261 static void
5263 {
5268 {
5271 /* We should not be confused by the fact that grokbitfield
5272 temporarily sets the width of the bit field into
5273 DECL_INITIAL (*fieldsp).
5274 check_bitfield_decl eventually sets DECL_SIZE (*fieldsp)
5275 to that width. */
5279 else
5281 }
5282 }
5284 /* Returns TRUE iff we need a cookie when dynamically allocating an
5285 array whose elements have the indicated class TYPE. */
5287 static bool
5289 {
5290 tree fns;
5295 /* If there's a non-trivial destructor, we need a cookie. In order
5296 to iterate through the array calling the destructor for each
5297 element, we'll have to know how many elements there are. */
5301 /* If the usual deallocation function is a two-argument whose second
5302 argument is of type `size_t', then we have to pass the size of
5303 the array to the deallocation function, so we will need to store
5304 a cookie. */
5308 /* If there are no `operator []' members, or the lookup is
5309 ambiguous, then we don't need a cookie. */
5312 /* Loop through all of the functions. */
5314 {
5317 /* See if this function is a one-argument delete function. If
5318 it is, then it will be the usual deallocation function. */
5322 /* Do not consider this function if its second argument is an
5323 ellipsis. */
5326 /* Otherwise, if we have a two-argument function and the second
5327 argument is `size_t', it will be the usual deallocation
5328 function -- unless there is one-argument function, too. */
5332 }
5335 }
5337 /* Finish computing the `literal type' property of class type T.
5339 At this point, we have already processed base classes and
5340 non-static data members. We need to check whether the copy
5341 constructor is trivial, the destructor is trivial, and there
5342 is a trivial default constructor or at least one constexpr
5343 constructor other than the copy constructor. */
5345 static void
5347 {
5348 tree fn;
5360 /* C++14 DR 1684 removed this restriction. */
5368 {
5372 "enclosing class of constexpr non-static member "
5375 }
5376 }
5378 /* T is a non-literal type used in a context which requires a constant
5379 expression. Explain why it isn't literal. */
5381 void
5383 {
5393 /* Already explained. */
5406 {
5408 "default constructor, and has no constexpr constructor that "
5411 /* Note that we can't simply call locate_ctor because when the
5412 constructor is deleted it just returns NULL_TREE. */
5414 {
5421 {
5424 else
5427 }
5428 }
5429 }
5430 else
5431 {
5435 {
5438 {
5443 }
5444 }
5446 {
5447 tree ftype;
5452 {
5455 field);
5458 }
5462 }
5463 }
5464 }
5466 /* Check the validity of the bases and members declared in T. Add any
5467 implicitly-generated functions (like copy-constructors and
5468 assignment operators). Compute various flag bits (like
5469 CLASSTYPE_NON_LAYOUT_POD_T) for T. This routine works purely at the C++
5470 level: i.e., independently of the ABI in use. */
5472 static void
5474 {
5475 /* Nonzero if the implicitly generated copy constructor should take
5476 a non-const reference argument. */
5478 /* Nonzero if the implicitly generated assignment operator
5479 should take a non-const reference argument. */
5481 tree access_decls;
5484 tree fn;
5486 /* By default, we use const reference arguments and generate default
5487 constructors. */
5491 /* Check all the base-classes and set FMEM members to point to arrays
5492 of potential interest. */
5495 /* Deduce noexcept on destructor. This needs to happen after we've set
5496 triviality flags appropriately for our bases. */
5501 /* Check all the method declarations. */
5504 /* Save the initial values of these flags which only indicate whether
5505 or not the class has user-provided functions. As we analyze the
5506 bases and members we can set these flags for other reasons. */
5510 /* Check all the data member declarations. We cannot call
5511 check_field_decls until we have called check_bases check_methods,
5512 as check_field_decls depends on TYPE_HAS_NONTRIVIAL_DESTRUCTOR
5513 being set appropriately. */
5518 /* A nearly-empty class has to be vptr-containing; a nearly empty
5519 class contains just a vptr. */
5523 /* Do some bookkeeping that will guide the generation of implicitly
5524 declared member functions. */
5527 /* We need to call a constructor for this class if it has a
5528 user-provided constructor, or if the default constructor is going
5529 to initialize the vptr. (This is not an if-and-only-if;
5530 TYPE_NEEDS_CONSTRUCTING is set elsewhere if bases or members
5531 themselves need constructing.) */
5534 /* [dcl.init.aggr]
5536 An aggregate is an array or a class with no user-provided
5537 constructors ... and no virtual functions.
5539 Again, other conditions for being an aggregate are checked
5540 elsewhere. */
5544 /* This is the C++98/03 definition of POD; it changed in C++0x, but we
5545 retain the old definition internally for ABI reasons. */
5554 /* If the only explicitly declared default constructor is user-provided,
5555 set TYPE_HAS_COMPLEX_DFLT. */
5561 /* Warn if a public base of a polymorphic type has an accessible
5562 non-virtual destructor. It is only now that we know the class is
5563 polymorphic. Although a polymorphic base will have a already
5564 been diagnosed during its definition, we warn on use too. */
5566 {
5569 tree base_binfo;
5573 {
5581 basetype);
5582 }
5583 }
5585 /* If the class has no user-declared constructor, but does have
5586 non-static const or reference data members that can never be
5587 initialized, issue a warning. */
5589 /* Classes with user-declared constructors are presumed to
5590 initialize these members. */
5592 /* Aggregates can be initialized with brace-enclosed
5593 initializers. */
5595 {
5596 tree field;
5599 {
5600 tree type;
5617 }
5618 }
5620 /* Synthesize any needed methods. */
5622 cant_have_const_ctor,
5623 no_const_asn_ref);
5625 /* Check defaulted declarations here so we have cant_have_const_ctor
5626 and don't need to worry about clones. */
5631 {
5634 {
5635 bool imp_const_p
5641 /* If the function is defaulted outside the class, we just
5642 give the synthesis error. */
5645 }
5647 }
5650 {
5651 /* "This class type is not an aggregate." */
5653 }
5655 /* Compute the 'literal type' property before we
5656 do anything with non-static member functions. */
5659 /* Create the in-charge and not-in-charge variants of constructors
5660 and destructors. */
5663 /* Process the using-declarations. */
5667 /* Figure out whether or not we will need a cookie when dynamically
5668 allocating an array of this type. */
5671 }
5673 /* If T needs a pointer to its virtual function table, set TYPE_VFIELD
5674 accordingly. If a new vfield was created (because T doesn't have a
5675 primary base class), then the newly created field is returned. It
5676 is not added to the TYPE_FIELDS list; it is the caller's
5677 responsibility to do that. Accumulate declared virtual functions
5678 on VIRTUALS_P. */
5680 static tree
5682 {
5683 tree fn;
5685 /* Collect the virtual functions declared in T. */
5690 {
5699 }
5701 /* If we couldn't find an appropriate base class, create a new field
5702 here. Even if there weren't any new virtual functions, we might need a
5703 new virtual function table if we're supposed to include vptrs in
5704 all classes that need them. */
5706 {
5707 /* We build this decl with vtbl_ptr_type_node, which is a
5708 `vtable_entry_type*'. It might seem more precise to use
5709 `vtable_entry_type (*)[N]' where N is the number of virtual
5710 functions. However, that would require the vtable pointer in
5711 base classes to have a different type than the vtable pointer
5712 in derived classes. We could make that happen, but that
5713 still wouldn't solve all the problems. In particular, the
5714 type-based alias analysis code would decide that assignments
5715 to the base class vtable pointer can't alias assignments to
5716 the derived class vtable pointer, since they have different
5717 types. Thus, in a derived class destructor, where the base
5718 class constructor was inlined, we could generate bad code for
5719 setting up the vtable pointer.
5721 Therefore, we use one type for all vtable pointers. We still
5722 use a type-correct type; it's just doesn't indicate the array
5723 bounds. That's better than using `void*' or some such; it's
5724 cleaner, and it let's the alias analysis code know that these
5725 stores cannot alias stores to void*! */
5726 tree field;
5739 /* This class is non-empty. */
5743 }
5746 }
5748 /* Add OFFSET to all base types of BINFO which is a base in the
5749 hierarchy dominated by T.
5751 OFFSET, which is a type offset, is number of bytes. */
5753 static void
5755 {
5757 tree primary_binfo;
5758 tree base_binfo;
5760 /* Update BINFO's offset. */
5765 offset));
5767 /* Find the primary base class. */
5773 /* Scan all of the bases, pushing the BINFO_OFFSET adjust
5774 downwards. */
5776 {
5777 /* Don't do the primary base twice. */
5785 }
5786 }
5788 /* Set BINFO_OFFSET for all of the virtual bases for RLI->T. Update
5789 TYPE_ALIGN and TYPE_SIZE for T. OFFSETS gives the location of
5790 empty subobjects of T. */
5792 static void
5794 {
5795 tree vbase;
5802 /* Find the last field. The artificial fields created for virtual
5803 bases will go after the last extant field to date. */
5808 /* Go through the virtual bases, allocating space for each virtual
5809 base that is not already a primary base class. These are
5810 allocated in inheritance graph order. */
5812 {
5817 {
5818 /* This virtual base is not a primary base of any class in the
5819 hierarchy, so we have to add space for it. */
5822 }
5823 }
5824 }
5826 /* Returns the offset of the byte just past the end of the base class
5827 BINFO. */
5829 static tree
5831 {
5832 tree size;
5837 /* An empty class has zero CLASSTYPE_SIZE_UNIT, but we need to
5838 allocate some space for it. It cannot have virtual bases, so
5839 TYPE_SIZE_UNIT is fine. */
5841 else
5845 }
5847 /* Returns the offset of the byte just past the end of the base class
5848 with the highest offset in T. If INCLUDE_VIRTUALS_P is zero, then
5849 only non-virtual bases are included. */
5851 static tree
5853 {
5856 tree binfo;
5857 tree base_binfo;
5858 tree offset;
5863 {
5873 }
5878 {
5882 }
5885 }
5887 /* Warn about bases of T that are inaccessible because they are
5888 ambiguous. For example:
5890 struct S {};
5891 struct T : public S {};
5892 struct U : public S, public T {};
5894 Here, `(S*) new U' is not allowed because there are two `S'
5895 subobjects of U. */
5897 static void
5899 {
5902 tree basetype;
5903 tree binfo;
5904 tree base_binfo;
5906 /* If there are no repeated bases, nothing can be ambiguous. */
5910 /* Check direct bases. */
5913 {
5919 }
5921 /* Check for ambiguous virtual bases. */
5925 {
5931 }
5932 }
5934 /* Compare two INTEGER_CSTs K1 and K2. */
5936 static int
5938 {
5940 }
5942 /* Increase the size indicated in RLI to account for empty classes
5943 that are "off the end" of the class. */
5945 static void
5947 {
5948 tree eoc;
5949 tree rli_size;
5951 /* It might be the case that we grew the class to allocate a
5952 zero-sized base class. That won't be reflected in RLI, yet,
5953 because we are willing to overlay multiple bases at the same
5954 offset. However, now we need to make sure that RLI is big enough
5955 to reflect the entire class. */
5960 {
5961 /* The size should have been rounded to a whole byte. */
5964 rli->bitpos
5973 }
5974 }
5976 /* Calculate the TYPE_SIZE, TYPE_ALIGN, etc for T. Calculate
5977 BINFO_OFFSETs for all of the base-classes. Position the vtable
5978 pointer. Accumulate declared virtual functions on VIRTUALS_P. */
5980 static void
5982 {
5983 tree non_static_data_members;
5984 tree field;
5985 tree vptr;
5986 record_layout_info rli;
5987 /* Maps offsets (represented as INTEGER_CSTs) to a TREE_LIST of
5988 types that appear at that offset. */
5989 splay_tree empty_base_offsets;
5990 /* True if the last field laid out was a bit-field. */
5992 /* The location at which the next field should be inserted. */
5994 /* T, as a base class. */
5995 tree base_t;
5997 /* Keep track of the first non-static data member. */
6000 /* Start laying out the record. */
6003 /* Mark all the primary bases in the hierarchy. */
6006 /* Create a pointer to our virtual function table. */
6009 /* The vptr is always the first thing in the class. */
6011 {
6016 }
6017 else
6020 /* Build FIELD_DECLs for all of the non-virtual base-types. */
6025 /* Layout the non-static data members. */
6027 {
6028 tree type;
6029 tree padding;
6031 /* We still pass things that aren't non-static data members to
6032 the back end, in case it wants to do something with them. */
6034 {
6036 /* If the static data member has incomplete type, keep track
6037 of it so that it can be completed later. (The handling
6038 of pending statics in finish_record_layout is
6039 insufficient; consider:
6041 struct S1;
6042 struct S2 { static S1 s1; };
6044 At this point, finish_record_layout will be called, but
6045 S1 is still incomplete.) */
6047 {
6049 /* The visibility of static data members is determined
6050 at their point of declaration, not their point of
6051 definition. */
6053 }
6055 }
6063 /* If this field is a bit-field whose width is greater than its
6064 type, then there are some special rules for allocating
6065 it. */
6068 {
6070 /* We must allocate the bits as if suitably aligned for the
6071 longest integer type that fits in this many bits. Then,
6072 we are supposed to use the left over bits as additional
6073 padding. */
6075 /* Do not pick a type bigger than MAX_FIXED_MODE_SIZE. */
6083 {
6085 /* Too big, so our current guess is what we want. */
6087 /* Not bigger than limit, ok */
6089 }
6091 /* Figure out how much additional padding is required. */
6093 /* In a union, the padding field must have the full width
6094 of the bit-field; all fields start at offset zero. */
6096 else
6103 /* An unnamed bitfield does not normally affect the
6104 alignment of the containing class on a target where
6105 PCC_BITFIELD_TYPE_MATTERS. But, the C++ ABI does not
6106 make any exceptions for unnamed bitfields when the
6107 bitfields are longer than their types. Therefore, we
6108 temporarily give the field a name. */
6110 {
6113 }
6119 empty_base_offsets);
6122 /* Now that layout has been performed, set the size of the
6123 field to the size of its declared type; the rest of the
6124 field is effectively invisible. */
6126 /* We must also reset the DECL_MODE of the field. */
6128 }
6129 else
6131 empty_base_offsets);
6133 /* Remember the location of any empty classes in FIELD. */
6136 empty_base_offsets,
6139 /* If a bit-field does not immediately follow another bit-field,
6140 and yet it starts in the middle of a byte, we have failed to
6141 comply with the ABI. */
6144 /* The TREE_NO_WARNING flag gets set by Objective-C when
6145 laying out an Objective-C class. The ObjC ABI differs
6146 from the C++ ABI, and so we do not want a warning
6147 here. */
6149 && !last_field_was_bitfield
6152 bitsize_unit_node)))
6154 "offset of %qD is not ABI-compliant and may "
6157 /* The middle end uses the type of expressions to determine the
6158 possible range of expression values. In order to optimize
6159 "x.i > 7" to "false" for a 2-bit bitfield "i", the middle end
6160 must be made aware of the width of "i", via its type.
6162 Because C++ does not have integer types of arbitrary width,
6163 we must (for the purposes of the front end) convert from the
6164 type assigned here to the declared type of the bitfield
6165 whenever a bitfield expression is used as an rvalue.
6166 Similarly, when assigning a value to a bitfield, the value
6167 must be converted to the type given the bitfield here. */
6169 {
6174 {
6181 }
6182 }
6184 /* If we needed additional padding after this field, add it
6185 now. */
6187 {
6188 tree padding_field;
6191 FIELD_DECL,
6192 NULL_TREE,
6193 char_type_node);
6200 NULL_TREE,
6201 empty_base_offsets);
6202 }
6205 }
6208 {
6209 /* Make sure that we are on a byte boundary so that the size of
6210 the class without virtual bases will always be a round number
6211 of bytes. */
6214 }
6216 /* Delete all zero-width bit-fields from the list of fields. Now
6217 that the type is laid out they are no longer important. */
6220 /* Create the version of T used for virtual bases. We do not use
6221 make_class_type for this version; this is an artificial type. For
6222 a POD type, we just reuse T. */
6224 {
6227 /* Set the size and alignment for the new type. */
6228 tree eoc;
6230 /* If the ABI version is not at least two, and the last
6231 field was a bit-field, RLI may not be on a byte
6232 boundary. In particular, rli_size_unit_so_far might
6233 indicate the last complete byte, while rli_size_so_far
6234 indicates the total number of bits used. Therefore,
6235 rli_size_so_far, rather than rli_size_unit_so_far, is
6236 used to compute TYPE_SIZE_UNIT. */
6244 eoc);
6254 /* Copy the fields from T. */
6258 {
6262 }
6265 /* Record the base version of the type. */
6268 }
6269 else
6272 /* Every empty class contains an empty class. */
6276 /* Set the TYPE_DECL for this type to contain the right
6277 value for DECL_OFFSET, so that we can use it as part
6278 of a COMPONENT_REF for multiple inheritance. */
6281 /* Now fix up any virtual base class types that we left lying
6282 around. We must get these done before we try to lay out the
6283 virtual function table. As a side-effect, this will remove the
6284 base subobject fields. */
6287 /* Make sure that empty classes are reflected in RLI at this
6288 point. */
6291 /* Make sure not to create any structures with zero size. */
6297 /* If this is a non-POD, declaring it packed makes a difference to how it
6298 can be used as a field; don't let finalize_record_size undo it. */
6302 /* Let the back end lay out the type. */
6311 /* Warn about bases that can't be talked about due to ambiguity. */
6314 /* Now that we're done with layout, give the base fields the real types. */
6319 /* Clean up. */
6326 }
6328 /* Determine the "key method" for the class type indicated by TYPE,
6329 and set CLASSTYPE_KEY_METHOD accordingly. */
6331 void
6333 {
6334 tree method;
6341 /* The key method is the first non-pure virtual function that is not
6342 inline at the point of class definition. On some targets the
6343 key function may not be inline; those targets should not call
6344 this function until the end of the translation unit. */
6350 {
6353 }
6356 }
6358 /* Helper of find_flexarrays. Return true when FLD refers to a non-static
6359 class data member of non-zero size, otherwise false. */
6363 {
6371 {
6375 }
6378 }
6380 /* Used by find_flexarrays and related functions. */
6382 struct flexmems_t
6383 {
6384 /* The first flexible array member or non-zero array member found
6385 in the order of layout. */
6386 tree array;
6387 /* First non-static non-empty data member in the class or its bases. */
6388 tree first;
6389 /* The first non-static non-empty data member following either
6390 the flexible array member, if found, or the zero-length array member
6391 otherwise. AFTER[1] refers to the first such data member of a union
6392 of which the struct containing the flexible array member or zero-length
6393 array is a member, or NULL when no such union exists. This element is
6394 only used during searching, not for diagnosing problems. AFTER[0]
6395 refers to the first such data member that is not a member of such
6396 a union. */
6399 /* Refers to a struct (not union) in which the struct of which the flexible
6400 array is member is defined. Used to diagnose strictly (according to C)
6401 invalid uses of the latter structs. */
6402 tree enclosing;
6403 };
6405 /* Find either the first flexible array member or the first zero-length
6406 array, in that order of preference, among members of class T (but not
6407 its base classes), and set members of FMEM accordingly.
6408 BASE_P is true if T is a base class of another class.
6409 PUN is set to the outermost union in which the flexible array member
6410 (or zero-length array) is defined if one such union exists, otherwise
6411 to NULL.
6412 Similarly, PSTR is set to a data member of the outermost struct of
6413 which the flexible array is a member if one such struct exists,
6414 otherwise to NULL. */
6416 static void
6420 {
6421 /* Set the "pointer" to the outermost enclosing union if not set
6422 yet and maintain it for the remainder of the recursion. */
6427 {
6431 /* Is FLD a typedef for an anonymous struct? */
6433 /* FIXME: Note that typedefs (as well as arrays) need to be fully
6434 handled elsewhere so that errors like the following are detected
6435 as well:
6436 typedef struct { int i, a[], j; } S; // bug c++/72753
6437 S s [2]; // bug c++/68489
6438 */
6443 {
6444 /* Check the nested unnamed type referenced via a typedef
6445 independently of FMEM (since it's not a data member of
6446 the enclosing class). */
6449 }
6451 /* Skip anything that's GCC-generated or not a (non-static) data
6452 member. */
6456 /* Type of the member. */
6461 /* Determine the type of the array element or object referenced
6462 by the member so that it can be checked for flexible array
6463 members if it hasn't been yet. */
6471 {
6473 {
6474 /* Once the member after the flexible array has been found
6475 we're done. */
6478 }
6481 {
6482 /* Descend into the non-static member struct or union and try
6483 to find a flexible array member or zero-length array among
6484 its members. This is only necessary for anonymous types
6485 and types in whose context the current type T has not been
6486 defined (the latter must not be checked again because they
6487 are already in the process of being checked by one of the
6488 recursive calls). */
6493 /* If this member isn't anonymous and a prior non-flexible array
6494 member has been seen in one of the enclosing structs, clear
6495 the FIRST member since it doesn't contribute to the flexible
6496 array struct's members. */
6507 {
6508 /* Restore the FIRST member reset above if no flexible
6509 array member has been found in this member's struct. */
6511 }
6513 /* If the member struct contains the first flexible array
6514 member, or if this member is a base class, continue to
6515 the next member and avoid setting the FMEM->NEXT pointer
6516 to point to it. */
6519 }
6520 }
6523 {
6524 /* Remember the first non-static data member. */
6528 /* Remember the first non-static data member after the flexible
6529 array member, if one has been found, or the zero-length array
6530 if it has been found. */
6533 }
6535 /* Skip non-arrays. */
6539 /* Determine the upper bound of the array if it has one. */
6541 {
6543 {
6544 /* Make a record of the zero-length array if either one
6545 such field or a flexible array member has been seen to
6546 handle the pathological and unlikely case of multiple
6547 such members. */
6550 }
6552 {
6553 /* Remember the first zero-length array unless a flexible array
6554 member has already been seen. */
6557 }
6558 }
6559 else
6560 {
6561 /* Flexible array members have no upper bound. */
6563 {
6564 /* Replace the zero-length array if it's been stored and
6565 reset the after pointer. */
6567 {
6571 }
6572 }
6573 else
6574 {
6577 }
6578 }
6579 }
6580 }
6582 /* Diagnose a strictly (by the C standard) invalid use of a struct with
6583 a flexible array member (or the zero-length array extension). */
6585 static void
6587 {
6599 }
6601 /* Issue diagnostics for invalid flexible array members or zero-length
6602 arrays that are not the last elements of the containing class or its
6603 base classes or that are its sole members. */
6605 static void
6607 {
6612 {
6615 }
6617 /* Has a diagnostic been issued? */
6623 {
6630 {
6634 {
6637 }
6638 }
6639 }
6640 else
6641 {
6648 {
6654 /* In the unlikely event that the member following the flexible
6655 array member is declared in a different class, or the member
6656 overlaps another member of a common union, point to it.
6657 Otherwise it should be obvious. */
6661 {
6666 }
6667 }
6668 }
6672 }
6675 /* Recursively check to make sure that any flexible array or zero-length
6676 array members of class T or its bases are valid (i.e., not the sole
6677 non-static data member of T and, if one exists, that it is the last
6678 non-static data member of T and its base classes. FMEM is expected
6679 to be initially null and is used internally by recursive calls to
6680 the function. Issue the appropriate diagnostics for the array member
6681 that fails the checks. */
6683 static void
6686 {
6687 /* Initialize the result of a search for flexible array and zero-length
6688 array members. Avoid doing any work if the most interesting FMEM data
6689 have already been populated. */
6698 /* Recursively check the primary base class first. */
6700 {
6703 }
6705 /* Recursively check the base classes. */
6708 {
6711 /* The primary base class was already checked above. */
6715 /* Virtual base classes are at the end. */
6719 /* Check the base class. */
6721 }
6724 {
6725 /* Check virtual base classes only once per derived class.
6726 I.e., this check is not performed recursively for base
6727 classes. */
6729 tree base_binfo;
6733 {
6734 /* Check the virtual base class. */
6738 }
6739 }
6741 /* Is the type unnamed (and therefore a member of it potentially
6742 an anonymous struct or union)? */
6745 /* Search the members of the current (possibly derived) class, skipping
6746 unnamed structs and unions since those could be anonymous. */
6751 {
6752 /* Issue diagnostics for invalid flexible and zero-length array
6753 members found in base classes or among the members of the current
6754 class. Ignore anonymous structs and unions whose members are
6755 considered to be members of the enclosing class and thus will
6756 be diagnosed when checking it. */
6758 }
6759 }
6761 /* Perform processing required when the definition of T (a class type)
6762 is complete. Diagnose invalid definitions of flexible array members
6763 and zero-size arrays. */
6765 void
6767 {
6768 tree x;
6769 /* A TREE_LIST. The TREE_VALUE of each node is a FUNCTION_DECL. */
6773 {
6778 }
6780 /* If this type was previously laid out as a forward reference,
6781 make sure we lay it out again. */
6785 /* Make assumptions about the class; we'll reset the flags if
6786 necessary. */
6792 /* Do end-of-class semantic processing: checking the validity of the
6793 bases and members and add implicitly generated methods. */
6796 /* Find the key method. */
6798 {
6799 /* The Itanium C++ ABI permits the key method to be chosen when
6800 the class is defined -- even though the key method so
6801 selected may later turn out to be an inline function. On
6802 some systems (such as ARM Symbian OS) the key method cannot
6803 be determined until the end of the translation unit. On such
6804 systems, we leave CLASSTYPE_KEY_METHOD set to NULL, which
6805 will cause the class to be added to KEYED_CLASSES. Then, in
6806 finish_file we will determine the key method. */
6810 /* If a polymorphic class has no key method, we may emit the vtable
6811 in every translation unit where the class definition appears. If
6812 we're devirtualizing, we can look into the vtable even if we
6813 aren't emitting it. */
6816 }
6818 /* Layout the class itself. */
6820 /* COMPLETE_TYPE_P is now true. */
6825 /* We use the base type for trivial assignments, and hence it
6826 needs a mode. */
6829 /* With the layout complete, check for flexible array members and
6830 zero-length arrays that might overlap other members in the final
6831 layout. */
6836 /* If necessary, create the primary vtable for this class. */
6838 {
6839 /* We must enter these virtuals into the table. */
6843 /* Here we know enough to change the type of our virtual
6844 function table, but we will wait until later this function. */
6847 /* If we're warning about ABI tags, check the types of the new
6848 virtual functions. */
6852 }
6855 {
6857 tree fn;
6864 /* Add entries for virtual functions introduced by this class. */
6868 /* Set DECL_VINDEX for all functions declared in this class. */
6870 fn;
6872 vindex += (TARGET_VTABLE_USES_DESCRIPTORS
6874 {
6878 /* A thunk. We should never be calling this entry directly
6879 from this vtable -- we'd use the entry for the non
6880 thunk base function. */
6884 }
6885 }
6893 /* Clear DECL_IN_AGGR_P for all member functions. Complete the rtl
6894 for any static member objects of the type we're working on. */
6903 /* Complain if one of the field types requires lower visibility. */
6906 /* Make the rtl for any new vtables we have created, and unmark
6907 the base types we marked. */
6910 /* Build the VTT for T. */
6917 "%q#T has virtual functions and accessible"
6925 /* Class layout, assignment of virtual table slots, etc., is now
6926 complete. Give the back end a chance to tweak the visibility of
6927 the class or perform any other required target modifications. */
6937 /* Finish debugging output for this type. */
6941 {
6944 {
6947 }
6949 {
6952 else
6953 {
6956 }
6958 }
6960 {
6962 "the type of the first field has a different ABI from the "
6965 }
6966 }
6967 }
6969 /* When T was built up, the member declarations were added in reverse
6970 order. Rearrange them to declaration order. */
6972 void
6974 {
6975 tree next;
6976 tree prev;
6977 tree x;
6979 /* The following lists are all in reverse order. Put them in
6980 declaration order now. */
6983 /* For the TYPE_FIELDS, only the non TYPE_DECLs are in reverse
6984 order, so we can't just use nreverse. Due to stat_hack
6985 chicanery in finish_member_declaration. */
6990 {
6994 }
6997 {
7000 }
7001 }
7003 tree
7005 {
7008 /* Now that we've got all the field declarations, reverse everything
7009 as necessary. */
7015 /* Nadger the current location so that diagnostics point to the start of
7016 the struct, not the end. */
7020 {
7021 tree x;
7023 /* We need to add the target functions of USING_DECLS, so that
7024 they can be found when the using declaration is not
7025 instantiated yet. */
7028 {
7033 }
7039 /* COMPLETE_TYPE_P is now true. */
7043 /* We need to emit an error message if this type was used as a parameter
7044 and it is an abstract type, even if it is a template. We construct
7045 a simple CLASSTYPE_PURE_VIRTUALS list without taking bases into
7046 account and we call complete_vars with this type, which will check
7047 the PARM_DECLS. Note that while the type is being defined,
7048 CLASSTYPE_PURE_VIRTUALS contains the list of the inline friends
7049 (see CLASSTYPE_INLINE_FRIENDS) so we need to clear it. */
7056 /* Remember current #pragma pack value. */
7059 /* Fix up any variants we've already built. */
7061 {
7065 }
7066 }
7067 else
7069 /* COMPLETE_TYPE_P is now true. */
7074 {
7075 /* People keep complaining that the compiler crashes on an invalid
7076 definition of initializer_list, so I guess we should explicitly
7077 reject it. What the compiler internals care about is that it's a
7078 template and has a pointer field followed by an integer field. */
7081 {
7084 {
7088 }
7089 }
7092 "definition of std::initializer_list does not match "
7094 }
7102 else
7106 /* Lambdas are defined by the LAMBDA_EXPR. */
7111 }
7112 \f
7113 /* Hash table to avoid endless recursion when handling references. */
7116 /* Return the dynamic type of INSTANCE, if known.
7117 Used to determine whether the virtual function table is needed
7118 or not.
7120 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
7121 of our knowledge of its type. *NONNULL should be initialized
7122 before this function is called. */
7124 static tree
7126 {
7127 #define RECUR(T) fixed_type_or_null((T), nonnull, cdtorp)
7130 {
7134 else
7138 /* This is a call to a constructor, hence it's never zero. */
7140 {
7144 }
7148 /* This is a call to a constructor, hence it's never zero. */
7150 {
7154 }
7163 /* Propagate nonnull. */
7168 CASE_CONVERT:
7174 {
7175 /* Just because we see an ADDR_EXPR doesn't mean we're dealing
7176 with a real object -- given &p->f, p can still be null. */
7178 /* ??? Probably should check DECL_WEAK here. */
7181 }
7185 /* If this component is really a base class reference, then the field
7186 itself isn't definitive. */
7195 {
7199 }
7200 /* fall through. */
7205 {
7209 }
7211 {
7215 /* if we're in a ctor or dtor, we know our type. If
7216 current_class_ptr is set but we aren't in a function, we're in
7217 an NSDMI (and therefore a constructor). */
7222 {
7226 }
7227 }
7229 {
7230 /* We only need one hash table because it is always left empty. */
7232 fixed_type_or_null_ref_ht
7235 /* Reference variables should be references to objects. */
7239 /* Enter the INSTANCE in a table to prevent recursion; a
7240 variable's initializer may refer to the variable
7241 itself. */
7246 {
7247 tree type;
7256 }
7257 }
7262 }
7263 #undef RECUR
7264 }
7266 /* Return nonzero if the dynamic type of INSTANCE is known, and
7267 equivalent to the static type. We also handle the case where
7268 INSTANCE is really a pointer. Return negative if this is a
7269 ctor/dtor. There the dynamic type is known, but this might not be
7270 the most derived base of the original object, and hence virtual
7271 bases may not be laid out according to this type.
7273 Used to determine whether the virtual function table is needed
7274 or not.
7276 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
7277 of our knowledge of its type. *NONNULL should be initialized
7278 before this function is called. */
7280 int
7282 {
7285 tree fixed;
7287 /* processing_template_decl can be false in a template if we're in
7288 instantiate_non_dependent_expr, but we still want to suppress
7289 this check. */
7291 {
7292 /* In a template we only care about the type of the result. */
7296 }
7306 }
7308 \f
7309 void
7311 {
7314 current_class_stack
7322 }
7324 /* Restore the cached PREVIOUS_CLASS_LEVEL. */
7326 static void
7328 {
7329 tree type;
7331 /* We are re-entering the same class we just left, so we don't
7332 have to search the whole inheritance matrix to find all the
7333 decls to bind again. Instead, we install the cached
7334 class_shadowed list and walk through it binding names. */
7337 /* Restore IDENTIFIER_TYPE_VALUE. */
7339 type;
7342 }
7344 /* Set global variables CURRENT_CLASS_NAME and CURRENT_CLASS_TYPE as
7345 appropriate for TYPE.
7347 So that we may avoid calls to lookup_name, we cache the _TYPE
7348 nodes of local TYPE_DECLs in the TREE_TYPE field of the name.
7350 For multiple inheritance, we perform a two-pass depth-first search
7351 of the type lattice. */
7353 void
7355 {
7356 class_stack_node_t csn;
7360 /* Make sure there is enough room for the new entry on the stack. */
7362 {
7364 current_class_stack
7366 current_class_stack_size);
7367 }
7369 /* Insert a new entry on the class stack. */
7376 current_class_depth++;
7378 /* Now set up the new type. */
7384 /* By default, things in classes are private, while things in
7385 structures or unions are public. */
7387 ? access_private_node
7393 {
7394 /* Forcibly remove any old class remnants. */
7396 }
7402 else
7404 }
7406 /* When we exit a toplevel class scope, we save its binding level so
7407 that we can restore it quickly. Here, we've entered some other
7408 class, so we must invalidate our cache. */
7410 void
7412 {
7414 }
7416 /* Get out of the current class scope. If we were in a class scope
7417 previously, that is the one popped to. */
7419 void
7421 {
7424 current_class_depth--;
7430 }
7432 /* Mark the top of the class stack as hidden. */
7434 void
7436 {
7439 }
7441 /* Mark the top of the class stack as un-hidden. */
7443 void
7445 {
7448 }
7450 /* Returns 1 if the class type currently being defined is either T or
7451 a nested type of T. Returns the type from the current_class_stack,
7452 which might be equivalent to but not equal to T in case of
7453 constrained partial specializations. */
7455 tree
7457 {
7465 /* We start looking from 1 because entry 0 is from global scope,
7466 and has no type. */
7468 {
7469 tree c;
7472 else
7473 {
7477 }
7482 }
7484 }
7486 /* If either current_class_type or one of its enclosing classes are derived
7487 from T, return the appropriate type. Used to determine how we found
7488 something via unqualified lookup. */
7490 tree
7492 {
7495 /* The bases of a dependent type are unknown. */
7506 {
7511 }
7514 }
7516 /* Return the outermost enclosing class type that is still open, or
7517 NULL_TREE. */
7519 tree
7521 {
7528 {
7535 }
7537 }
7539 /* Returns the innermost class type which is not a lambda closure type. */
7541 tree
7543 {
7548 }
7550 /* When entering a class scope, all enclosing class scopes' names with
7551 static meaning (static variables, static functions, types and
7552 enumerators) have to be visible. This recursive function calls
7553 pushclass for all enclosing class contexts until global or a local
7554 scope is reached. TYPE is the enclosed class. */
7556 void
7558 {
7559 /* A namespace might be passed in error cases, like A::B:C. */
7567 }
7569 /* Undoes a push_nested_class call. */
7571 void
7573 {
7579 }
7581 /* Returns the number of extern "LANG" blocks we are nested within. */
7583 int
7585 {
7587 }
7589 /* Set global variables CURRENT_LANG_NAME to appropriate value
7590 so that behavior of name-mangling machinery is correct. */
7592 void
7594 {
7601 else
7603 }
7605 /* Get out of the current language scope. */
7607 void
7609 {
7611 }
7612 \f
7613 /* Type instantiation routines. */
7615 /* Given an OVERLOAD and a TARGET_TYPE, return the function that
7616 matches the TARGET_TYPE. If there is no satisfactory match, return
7617 error_mark_node, and issue an error & warning messages under
7618 control of FLAGS. Permit pointers to member function if FLAGS
7619 permits. If TEMPLATE_ONLY, the name of the overloaded function was
7620 a template-id, and EXPLICIT_TARGS are the explicitly provided
7621 template arguments.
7623 If OVERLOAD is for one or more member functions, then ACCESS_PATH
7624 is the base path used to reference those member functions. If
7625 the address is resolved to a member function, access checks will be
7626 performed and errors issued if appropriate. */
7628 static tree
7630 tree overload,
7631 tsubst_flags_t complain,
7633 tree explicit_targs,
7634 tree access_path)
7635 {
7636 /* Here's what the standard says:
7638 [over.over]
7640 If the name is a function template, template argument deduction
7641 is done, and if the argument deduction succeeds, the deduced
7642 arguments are used to generate a single template function, which
7643 is added to the set of overloaded functions considered.
7645 Non-member functions and static member functions match targets of
7646 type "pointer-to-function" or "reference-to-function." Nonstatic
7647 member functions match targets of type "pointer-to-member
7648 function;" the function type of the pointer to member is used to
7649 select the member function from the set of overloaded member
7650 functions. If a nonstatic member function is selected, the
7651 reference to the overloaded function name is required to have the
7652 form of a pointer to member as described in 5.3.1.
7654 If more than one function is selected, any template functions in
7655 the set are eliminated if the set also contains a non-template
7656 function, and any given template function is eliminated if the
7657 set contains a second template function that is more specialized
7658 than the first according to the partial ordering rules 14.5.5.2.
7659 After such eliminations, if any, there shall remain exactly one
7660 selected function. */
7663 /* We store the matches in a TREE_LIST rooted here. The functions
7664 are the TREE_PURPOSE, not the TREE_VALUE, in this list, for easy
7665 interoperability with most_specialized_instantiation. */
7667 tree fn;
7668 tree target_fn_type;
7670 /* By the time we get here, we should be seeing only real
7671 pointer-to-member types, not the internal POINTER_TYPE to
7672 METHOD_TYPE representation. */
7678 /* Check that the TARGET_TYPE is reasonable. */
7683 /* This is OK, too. */
7686 /* This is OK, too. This comes from a conversion to reference
7687 type. */
7689 else
7690 {
7696 }
7698 /* Non-member functions and static member functions match targets of type
7699 "pointer-to-function" or "reference-to-function." Nonstatic member
7700 functions match targets of type "pointer-to-member-function;" the
7701 function type of the pointer to member is used to select the member
7702 function from the set of overloaded member functions.
7704 So figure out the FUNCTION_TYPE that we want to match against. */
7707 /* If we can find a non-template function that matches, we can just
7708 use it. There's no point in generating template instantiations
7709 if we're just going to throw them out anyhow. But, of course, we
7710 can only do this when we don't *need* a template function. */
7713 {
7717 /* We're not looking for templates just yet. */
7721 /* We're looking for a non-static member, and this isn't
7722 one, or vice versa. */
7725 /* In C++17 we need the noexcept-qualifier to compare types. */
7730 /* See if there's a match. */
7735 }
7737 /* Now, if we've already got a match (or matches), there's no need
7738 to proceed to the template functions. But, if we don't have a
7739 match we need to look at them, too. */
7741 {
7742 tree target_arg_types;
7743 tree target_ret_type;
7746 tree arg;
7760 {
7762 tree instantiation;
7763 tree targs;
7766 /* We're only looking for templates. */
7771 /* We're not looking for a non-static member, and this is
7772 one, or vice versa. */
7777 /* If the template has a deduced return type, don't expose it to
7778 template argument deduction. */
7782 /* Try to do argument deduction. */
7789 /* Instantiation failed. */
7792 /* Constraints must be satisfied. This is done before
7793 return type deduction since that instantiates the
7794 function. */
7798 /* And now force instantiation to do return type deduction. */
7800 {
7806 }
7808 /* In C++17 we need the noexcept-qualifier to compare types. */
7812 /* See if there's a match. */
7817 }
7819 /* Now, remove all but the most specialized of the matches. */
7821 {
7826 NULL_TREE,
7827 NULL_TREE);
7828 }
7829 }
7831 /* Now we should have exactly one function in MATCHES. */
7833 {
7834 /* There were *no* matches. */
7836 {
7841 }
7843 }
7845 {
7846 /* There were too many matches. First check if they're all
7847 the same function. */
7852 /* For multi-versioned functions, more than one match is just fine and
7853 decls_match will return false as they are different. */
7861 {
7863 {
7867 /* Since print_candidates expects the functions in the
7868 TREE_VALUE slot, we flip them here. */
7873 }
7876 }
7877 }
7879 /* Good, exactly one match. Now, convert it to the correct type. */
7884 {
7892 {
7895 }
7896 }
7898 /* If a pointer to a function that is multi-versioned is requested, the
7899 pointer to the dispatcher function is returned instead. This works
7900 well because indirectly calling the function will dispatch the right
7901 function version at run-time. */
7903 {
7907 /* Mark all the versions corresponding to the dispatcher as used. */
7910 }
7912 /* If we're doing overload resolution purely for the purpose of
7913 determining conversion sequences, we should not consider the
7914 function used. If this conversion sequence is selected, the
7915 function will be marked as used at this point. */
7917 {
7918 /* Make =delete work with SFINAE. */
7923 }
7925 /* We could not check access to member functions when this
7926 expression was originally created since we did not know at that
7927 time to which function the expression referred. */
7929 {
7932 }
7936 else
7937 {
7938 /* The target must be a REFERENCE_TYPE. Above, cp_build_unary_op
7939 will mark the function as addressed, but here we must do it
7940 explicitly. */
7944 }
7945 }
7947 /* This function will instantiate the type of the expression given in
7948 RHS to match the type of LHSTYPE. If errors exist, then return
7949 error_mark_node. COMPLAIN is a bit mask. If TF_ERROR is set, then
7950 we complain on errors. If we are not complaining, never modify rhs,
7951 as overload resolution wants to try many possible instantiations, in
7952 the hope that at least one will work.
7954 For non-recursive calls, LHSTYPE should be a function, pointer to
7955 function, or a pointer to member function. */
7957 tree
7959 {
7966 {
7970 }
7973 {
7982 /* Microsoft allows `A::f' to be resolved to a
7983 pointer-to-member. */
7984 ;
7985 else
7986 {
7991 }
7992 }
7995 {
7998 }
8000 /* If we are in a template, and have a NON_DEPENDENT_EXPR, we cannot
8001 deduce any type information. */
8003 {
8007 }
8009 /* If we instantiate a template, and it is a A ?: C expression
8010 with omitted B, look through the SAVE_EXPR. */
8014 /* There are only a few kinds of expressions that may have a type
8015 dependent on overload resolution. */
8021 /* This should really only be used when attempting to distinguish
8022 what sort of a pointer to function we have. For now, any
8023 arithmetic operation which is not supported on pointers
8024 is rejected as an error. */
8027 {
8029 {
8035 /* Do not lose object's side effects. */
8039 }
8046 /* This can happen if we are forming a pointer-to-member for a
8047 member template. */
8050 /* Fall through. */
8053 {
8057 return
8061 }
8065 return
8069 access_path);
8072 {
8077 }
8084 }
8086 }
8087 \f
8088 /* Return the name of the virtual function pointer field
8089 (as an IDENTIFIER_NODE) for the given TYPE. Note that
8090 this may have to look back through base types to find the
8091 ultimate field name. (For single inheritance, these could
8092 all be the same name. Who knows for multiple inheritance). */
8094 static tree
8096 {
8102 {
8108 }
8116 }
8118 void
8120 {
8127 {
8132 }
8133 }
8135 /* Build a dummy reference to ourselves so Derived::Base (and A::A) works,
8136 according to [class]:
8137 The class-name is also inserted
8138 into the scope of the class itself. For purposes of access checking,
8139 the inserted class name is treated as if it were a public member name. */
8141 void
8143 {
8160 }
8162 /* Returns 1 if TYPE contains only padding bytes. */
8164 int
8166 {
8174 }
8176 /* Returns true if TYPE contains no actual data, just various
8177 possible combinations of empty classes and possibly a vptr. */
8179 bool
8181 {
8183 {
8184 tree field;
8185 tree binfo;
8186 tree base_binfo;
8189 /* CLASSTYPE_EMPTY_P isn't set properly until the class is actually laid
8190 out, but we'd like to be able to check this before then. */
8201 /* An unnamed bit-field is not a data member. */
8206 }
8211 }
8213 /* Note that NAME was looked up while the current class was being
8214 defined and that the result of that lookup was DECL. */
8216 void
8218 {
8219 splay_tree names_used;
8221 /* If we're not defining a class, there's nothing to do. */
8227 /* If there's already a binding for this NAME, then we don't have
8228 anything to worry about. */
8241 }
8243 /* Note that NAME was declared (as DECL) in the current class. Check
8244 to see that the declaration is valid. */
8246 void
8248 {
8249 splay_tree names_used;
8250 splay_tree_node n;
8252 /* Look to see if we ever used this name. */
8253 names_used
8257 /* The C language allows members to be declared with a type of the same
8258 name, and the C++ standard says this diagnostic is not required. So
8259 allow it in extern "C" blocks unless predantic is specified.
8260 Allow it in all cases if -ms-extensions is specified. */
8266 {
8267 /* [basic.scope.class]
8269 A name N used in a class S shall refer to the same declaration
8270 in its context and when re-evaluated in the completed scope of
8271 S. */
8276 }
8277 }
8279 /* Returns the VAR_DECL for the complete vtable associated with BINFO.
8280 Secondary vtables are merged with primary vtables; this function
8281 will return the VAR_DECL for the primary vtable. */
8283 tree
8285 {
8286 tree decl;
8290 {
8293 }
8297 }
8300 /* Returns the binfo for the primary base of BINFO. If the resulting
8301 BINFO is a virtual base, and it is inherited elsewhere in the
8302 hierarchy, then the returned binfo might not be the primary base of
8303 BINFO in the complete object. Check BINFO_PRIMARY_P or
8304 BINFO_LOST_PRIMARY_P to be sure. */
8306 static tree
8308 {
8309 tree primary_base;
8316 }
8318 /* As above, but iterate until we reach the binfo that actually provides the
8319 vptr for BINFO. */
8321 static tree
8323 {
8327 {
8332 }
8334 }
8336 /* Returns true if BINFO gets its vptr from a virtual base of the most derived
8337 type. Note that the virtual inheritance might be above or below BINFO in
8338 the hierarchy. */
8340 bool
8342 {
8346 /* Don't limit binfo_via_virtual, we want to return true when BINFO itself is
8347 a morally virtual base. */
8350 }
8352 /* If INDENTED_P is zero, indent to INDENT. Return nonzero. */
8354 static int
8356 {
8360 }
8362 /* Dump the offsets of all the bases rooted at BINFO to STREAM.
8363 INDENT should be zero when called from the top level; it is
8364 incremented recursively. IGO indicates the next expected BINFO in
8365 inheritance graph ordering. */
8367 static tree
8369 dump_flags_t flags,
8370 tree binfo,
8371 tree igo,
8373 {
8375 tree base_binfo;
8383 {
8386 }
8401 {
8405 TFF_PLAIN_IDENTIFIER),
8407 }
8409 {
8412 }
8417 {
8421 {
8425 TFF_PLAIN_IDENTIFIER));
8426 }
8428 {
8432 TFF_PLAIN_IDENTIFIER));
8433 }
8435 {
8439 TFF_PLAIN_IDENTIFIER));
8440 }
8442 {
8446 TFF_PLAIN_IDENTIFIER));
8447 }
8451 }
8457 }
8459 /* Dump the BINFO hierarchy for T. */
8461 static void
8463 {
8475 }
8477 /* Debug interface to hierarchy dumping. */
8479 void
8481 {
8483 }
8485 static void
8487 {
8488 dump_flags_t flags;
8490 {
8493 }
8494 }
8496 static void
8498 {
8499 tree value;
8501 HOST_WIDE_INT elt;
8509 TFF_PLAIN_IDENTIFIER));
8516 }
8518 static void
8520 {
8521 dump_flags_t flags;
8528 {
8535 {
8540 }
8544 }
8547 }
8549 static void
8551 {
8552 dump_flags_t flags;
8559 {
8564 }
8567 }
8569 /* Dump a function or thunk and its thunkees. */
8571 static void
8573 {
8576 tree thunks;
8584 {
8594 else
8600 }
8604 }
8606 /* Dump the thunks for FN. */
8608 void
8610 {
8612 }
8614 /* Virtual function table initialization. */
8616 /* Create all the necessary vtables for T and its base classes. */
8618 static void
8620 {
8621 tree vbase;
8625 /* We lay out the primary and secondary vtables in one contiguous
8626 vtable. The primary vtable is first, followed by the non-virtual
8627 secondary vtables in inheritance graph order. */
8631 /* Then come the virtual bases, also in inheritance graph order. */
8633 {
8637 }
8641 }
8643 /* Initialize the vtable for BINFO with the INITS. */
8645 static void
8647 {
8648 tree decl;
8654 }
8656 /* Build the VTT (virtual table table) for T.
8657 A class requires a VTT if it has virtual bases.
8659 This holds
8660 1 - primary virtual pointer for complete object T
8661 2 - secondary VTTs for each direct non-virtual base of T which requires a
8662 VTT
8663 3 - secondary virtual pointers for each direct or indirect base of T which
8664 has virtual bases or is reachable via a virtual path from T.
8665 4 - secondary VTTs for each direct or indirect virtual base of T.
8667 Secondary VTTs look like complete object VTTs without part 4. */
8669 static void
8671 {
8672 tree type;
8673 tree vtt;
8674 tree index;
8677 /* Build up the initializers for the VTT. */
8682 /* If we didn't need a VTT, we're done. */
8686 /* Figure out the type of the VTT. */
8690 /* Now, build the VTT object itself. */
8693 /* Add the VTT to the vtables list. */
8698 }
8700 /* When building a secondary VTT, BINFO_VTABLE is set to a TREE_LIST with
8701 PURPOSE the RTTI_BINFO, VALUE the real vtable pointer for this binfo,
8702 and CHAIN the vtable pointer for this binfo after construction is
8703 complete. VALUE can also be another BINFO, in which case we recurse. */
8705 static tree
8707 {
8708 tree vt;
8711 {
8717 else
8719 }
8722 }
8724 /* Data for secondary VTT initialization. */
8725 struct secondary_vptr_vtt_init_data
8726 {
8727 /* Is this the primary VTT? */
8730 /* Current index into the VTT. */
8731 tree index;
8733 /* Vector of initializers built up. */
8736 /* The type being constructed by this secondary VTT. */
8737 tree type_being_constructed;
8738 };
8740 /* Recursively build the VTT-initializer for BINFO (which is in the
8741 hierarchy dominated by T). INITS points to the end of the initializer
8742 list to date. INDEX is the VTT index where the next element will be
8743 replaced. Iff BINFO is the binfo for T, this is the top level VTT (i.e.
8744 not a subvtt for some base of T). When that is so, we emit the sub-VTTs
8745 for virtual bases of T. When it is not so, we build the constructor
8746 vtables for the BINFO-in-T variant. */
8748 static void
8751 {
8753 tree b;
8754 tree init;
8755 secondary_vptr_vtt_init_data data;
8758 /* We only need VTTs for subobjects with virtual bases. */
8762 /* We need to use a construction vtable if this is not the primary
8763 VTT. */
8765 {
8768 /* Record the offset in the VTT where this sub-VTT can be found. */
8770 }
8772 /* Add the address of the primary vtable for the complete object. */
8776 {
8779 }
8782 /* Recursively add the secondary VTTs for non-virtual bases. */
8787 /* Add secondary virtual pointers for all subobjects of BINFO with
8788 either virtual bases or reachable along a virtual path, except
8789 subobjects that are non-virtual primary bases. */
8799 /* data.inits might have grown as we added secondary virtual pointers.
8800 Make sure our caller knows about the new vector. */
8804 /* Add the secondary VTTs for virtual bases in inheritance graph
8805 order. */
8807 {
8812 }
8813 else
8814 /* Remove the ctor vtables we created. */
8816 }
8818 /* Called from build_vtt_inits via dfs_walk. BINFO is the binfo for the base
8819 in most derived. DATA is a SECONDARY_VPTR_VTT_INIT_DATA structure. */
8821 static tree
8823 {
8826 /* We don't care about bases that don't have vtables. */
8830 /* We're only interested in proper subobjects of the type being
8831 constructed. */
8835 /* We're only interested in bases with virtual bases or reachable
8836 via a virtual path from the type being constructed. */
8841 /* We're not interested in non-virtual primary bases. */
8845 /* Record the index where this secondary vptr can be found. */
8847 {
8852 {
8853 /* It's a primary virtual base, and this is not a
8854 construction vtable. Find the base this is primary of in
8855 the inheritance graph, and use that base's vtable
8856 now. */
8859 }
8860 }
8862 /* Add the initializer for the secondary vptr itself. */
8865 /* Advance the vtt index. */
8870 }
8872 /* Called from build_vtt_inits via dfs_walk. After building
8873 constructor vtables and generating the sub-vtt from them, we need
8874 to restore the BINFO_VTABLES that were scribbled on. DATA is the
8875 binfo of the base whose sub vtt was generated. */
8877 static tree
8879 {
8883 /* If this class has no vtable, none of its bases do. */
8887 /* This might be a primary base, so have no vtable in this
8888 hierarchy. */
8891 /* If we scribbled the construction vtable vptr into BINFO, clear it
8892 out now. */
8898 }
8900 /* Build the construction vtable group for BINFO which is in the
8901 hierarchy dominated by T. */
8903 static void
8905 {
8906 tree type;
8907 tree vtbl;
8908 tree id;
8909 tree vbase;
8912 /* See if we've already created this construction vtable group. */
8918 /* Build a version of VTBL (with the wrong type) for use in
8919 constructing the addresses of secondary vtables in the
8920 construction vtable group. */
8923 /* Don't export construction vtables from shared libraries. Even on
8924 targets that don't support hidden visibility, this tells
8925 can_refer_decl_in_current_unit_p not to assume that it's safe to
8926 access from a different compilation unit (bz 54314). */
8934 /* Add the vtables for each of our virtual bases using the vbase in T
8935 binfo. */
8937 vbase;
8939 {
8940 tree b;
8947 }
8949 /* Figure out the type of the construction vtable. */
8956 /* Initialize the construction vtable. */
8960 }
8962 /* Add the vtbl initializers for BINFO (and its bases other than
8963 non-virtual primaries) to the list of INITS. BINFO is in the
8964 hierarchy dominated by T. RTTI_BINFO is the binfo within T of
8965 the constructor the vtbl inits should be accumulated for. (If this
8966 is the complete object vtbl then RTTI_BINFO will be TYPE_BINFO (T).)
8967 ORIG_BINFO is the binfo for this object within BINFO_TYPE (RTTI_BINFO).
8968 BINFO is the active base equivalent of ORIG_BINFO in the inheritance
8969 graph of T. Both BINFO and ORIG_BINFO will have the same BINFO_TYPE,
8970 but are not necessarily the same in terms of layout. */
8972 static void
8974 tree orig_binfo,
8975 tree rtti_binfo,
8976 tree vtbl,
8977 tree t,
8979 {
8981 tree base_binfo;
8986 /* If it doesn't have a vptr, we don't do anything. */
8990 /* If we're building a construction vtable, we're not interested in
8991 subobjects that don't require construction vtables. */
8997 /* Build the initializers for the BINFO-in-T vtable. */
9000 /* Walk the BINFO and its bases. We walk in preorder so that as we
9001 initialize each vtable we can figure out at what offset the
9002 secondary vtable lies from the primary vtable. We can't use
9003 dfs_walk here because we need to iterate through bases of BINFO
9004 and RTTI_BINFO simultaneously. */
9006 {
9007 /* Skip virtual bases. */
9013 inits);
9014 }
9015 }
9017 /* Called from accumulate_vtbl_inits. Adds the initializers for the
9018 BINFO vtable to L. */
9020 static void
9022 tree orig_binfo,
9023 tree rtti_binfo,
9024 tree orig_vtbl,
9025 tree t,
9027 {
9034 {
9035 /* In the hierarchy of BINFO_TYPE (RTTI_BINFO), this is a
9036 primary virtual base. If it is not the same primary in
9037 the hierarchy of T, we'll need to generate a ctor vtable
9038 for it, to place at its location in T. If it is the same
9039 primary, we still need a VTT entry for the vtable, but it
9040 should point to the ctor vtable for the base it is a
9041 primary for within the sub-hierarchy of RTTI_BINFO.
9043 There are three possible cases:
9045 1) We are in the same place.
9046 2) We are a primary base within a lost primary virtual base of
9047 RTTI_BINFO.
9048 3) We are primary to something not a base of RTTI_BINFO. */
9050 tree b;
9053 /* First, look through the bases we are primary to for RTTI_BINFO
9054 or a virtual base. */
9057 {
9062 }
9063 /* If we run out of primary links, keep looking down our
9064 inheritance chain; we might be an indirect primary. */
9068 found:
9070 /* If we found RTTI_BINFO, this is case 1. If we found a virtual
9071 base B and it is a base of RTTI_BINFO, this is case 2. In
9072 either case, we share our vtable with LAST, i.e. the
9073 derived-most base within B of which we are a primary. */
9076 /* Just set our BINFO_VTABLE to point to LAST, as we may not have
9077 set LAST's BINFO_VTABLE yet. We'll extract the actual vptr in
9078 binfo_ctor_vtable after everything's been set up. */
9081 /* Otherwise, this is case 3 and we get our own. */
9082 }
9089 {
9090 tree index;
9093 /* Add the initializer for this vtable. */
9097 /* Figure out the position to which the VPTR should point. */
9103 }
9106 /* For a construction vtable, we can't overwrite BINFO_VTABLE.
9107 So, we make a TREE_LIST. Later, dfs_fixup_binfo_vtbls will
9108 straighten this out. */
9111 /* Throw away any unneeded intializers. */
9113 else
9114 /* For an ordinary vtable, set BINFO_VTABLE. */
9116 }
9121 /* Construct the initializer for BINFO's virtual function table. BINFO
9122 is part of the hierarchy dominated by T. If we're building a
9123 construction vtable, the ORIG_BINFO is the binfo we should use to
9124 find the actual function pointers to put in the vtable - but they
9125 can be overridden on the path to most-derived in the graph that
9126 ORIG_BINFO belongs. Otherwise,
9127 ORIG_BINFO should be the same as BINFO. The RTTI_BINFO is the
9128 BINFO that should be indicated by the RTTI information in the
9129 vtable; it will be a base class of T, rather than T itself, if we
9130 are building a construction vtable.
9132 The value returned is a TREE_LIST suitable for wrapping in a
9133 CONSTRUCTOR to use as the DECL_INITIAL for a vtable. If
9134 NON_FN_ENTRIES_P is not NULL, *NON_FN_ENTRIES_P is set to the
9135 number of non-function entries in the vtable.
9137 It might seem that this function should never be called with a
9138 BINFO for which BINFO_PRIMARY_P holds, the vtable for such a
9139 base is always subsumed by a derived class vtable. However, when
9140 we are building construction vtables, we do build vtables for
9141 primary bases; we need these while the primary base is being
9142 constructed. */
9144 static void
9146 tree orig_binfo,
9147 tree t,
9148 tree rtti_binfo,
9151 {
9152 tree v;
9153 vtbl_init_data vid;
9155 tree vbinfo;
9159 /* Initialize VID. */
9167 /* The first vbase or vcall offset is at index -3 in the vtable. */
9170 /* Add entries to the vtable for RTTI. */
9173 /* Create an array for keeping track of the functions we've
9174 processed. When we see multiple functions with the same
9175 signature, we share the vcall offsets. */
9177 /* Add the vcall and vbase offset entries. */
9180 /* Clear BINFO_VTABLE_PATH_MARKED; it's set by
9181 build_vbase_offset_vtbl_entries. */
9186 /* If the target requires padding between data entries, add that now. */
9188 {
9193 /* Move data entries into their new positions and add padding
9194 after the new positions. Iterate backwards so we don't
9195 overwrite entries that we would need to process later. */
9198 ix--)
9199 {
9207 {
9211 null_pointer_node);
9212 }
9213 }
9214 }
9219 /* The initializers for virtual functions were built up in reverse
9220 order. Straighten them out and add them to the running list in one
9221 step. */
9230 /* Go through all the ordinary virtual functions, building up
9231 initializers. */
9233 {
9234 tree delta;
9235 tree vcall_index;
9242 {
9246 {
9249 }
9251 }
9253 /* If the only definition of this function signature along our
9254 primary base chain is from a lost primary, this vtable slot will
9255 never be used, so just zero it out. This is important to avoid
9256 requiring extra thunks which cannot be generated with the function.
9258 We first check this in update_vtable_entry_for_fn, so we handle
9259 restored primary bases properly; we also need to do it here so we
9260 zero out unused slots in ctor vtables, rather than filling them
9261 with erroneous values (though harmless, apart from relocation
9262 costs). */
9267 {
9268 /* Pull the offset for `this', and the function to call, out of
9269 the list. */
9276 /* You can't call an abstract virtual function; it's abstract.
9277 So, we replace these functions with __pure_virtual. */
9279 {
9282 {
9284 abort_fndecl_addr
9288 }
9289 }
9290 /* Likewise for deleted virtuals. */
9292 {
9294 {
9298 dvirt_fn = push_library_fn
9302 }
9307 }
9308 else
9309 {
9311 {
9316 }
9317 /* Take the address of the function, considering it to be of an
9318 appropriate generic type. */
9322 /* Don't refer to a virtual destructor from a constructor
9323 vtable or a vtable for an abstract class, since destroying
9324 an object under construction is undefined behavior and we
9325 don't want it to be considered a candidate for speculative
9326 devirtualization. But do create the thunk for ABI
9327 compliance. */
9332 }
9333 }
9335 /* And add it to the chain of initializers. */
9337 {
9342 else
9344 {
9350 }
9351 }
9352 else
9354 }
9355 }
9357 /* Adds to vid->inits the initializers for the vbase and vcall
9358 offsets in BINFO, which is in the hierarchy dominated by T. */
9360 static void
9362 {
9363 tree b;
9365 /* If this is a derived class, we must first create entries
9366 corresponding to the primary base class. */
9371 /* Add the vbase entries for this base. */
9373 /* Add the vcall entries for this base. */
9375 }
9377 /* Returns the initializers for the vbase offset entries in the vtable
9378 for BINFO (which is part of the class hierarchy dominated by T), in
9379 reverse order. VBASE_OFFSET_INDEX gives the vtable index
9380 where the next vbase offset will go. */
9382 static void
9384 {
9385 tree vbase;
9386 tree t;
9387 tree non_primary_binfo;
9389 /* If there are no virtual baseclasses, then there is nothing to
9390 do. */
9396 /* We might be a primary base class. Go up the inheritance hierarchy
9397 until we find the most derived class of which we are a primary base:
9398 it is the offset of that which we need to use. */
9401 {
9402 tree b;
9404 /* If we have reached a virtual base, then it must be a primary
9405 base (possibly multi-level) of vid->binfo, or we wouldn't
9406 have called build_vcall_and_vbase_vtbl_entries for it. But it
9407 might be a lost primary, so just skip down to vid->binfo. */
9409 {
9412 }
9418 }
9420 /* Go through the virtual bases, adding the offsets. */
9422 vbase;
9424 {
9425 tree b;
9426 tree delta;
9431 /* Find the instance of this virtual base in the complete
9432 object. */
9435 /* If we've already got an offset for this virtual base, we
9436 don't need another one. */
9441 /* Figure out where we can find this vbase offset. */
9450 /* The vbase offset had better be the same. */
9453 /* The next vbase will come at a more negative offset. */
9457 /* The initializer is the delta from BINFO to this virtual base.
9458 The vbase offsets go in reverse inheritance-graph order, and
9459 we are walking in inheritance graph order so these end up in
9460 the right order. */
9467 }
9468 }
9470 /* Adds the initializers for the vcall offset entries in the vtable
9471 for BINFO (which is part of the class hierarchy dominated by VID->DERIVED)
9472 to VID->INITS. */
9474 static void
9476 {
9477 /* We only need these entries if this base is a virtual base. We
9478 compute the indices -- but do not add to the vtable -- when
9479 building the main vtable for a class. */
9482 /* If BINFO is RTTI_BINFO, then (since BINFO does not
9483 correspond to VID->DERIVED), we are building a primary
9484 construction virtual table. Since this is a primary
9485 virtual table, we do not need the vcall offsets for
9486 BINFO. */
9488 {
9489 /* We need a vcall offset for each of the virtual functions in this
9490 vtable. For example:
9492 class A { virtual void f (); };
9493 class B1 : virtual public A { virtual void f (); };
9494 class B2 : virtual public A { virtual void f (); };
9495 class C: public B1, public B2 { virtual void f (); };
9497 A C object has a primary base of B1, which has a primary base of A. A
9498 C also has a secondary base of B2, which no longer has a primary base
9499 of A. So the B2-in-C construction vtable needs a secondary vtable for
9500 A, which will adjust the A* to a B2* to call f. We have no way of
9501 knowing what (or even whether) this offset will be when we define B2,
9502 so we store this "vcall offset" in the A sub-vtable and look it up in
9503 a "virtual thunk" for B2::f.
9505 We need entries for all the functions in our primary vtable and
9506 in our non-virtual bases' secondary vtables. */
9508 /* If we are just computing the vcall indices -- but do not need
9509 the actual entries -- not that. */
9512 /* Now, walk through the non-virtual bases, adding vcall offsets. */
9514 }
9515 }
9517 /* Build vcall offsets, starting with those for BINFO. */
9519 static void
9521 {
9523 tree primary_binfo;
9524 tree base_binfo;
9526 /* Don't walk into virtual bases -- except, of course, for the
9527 virtual base for which we are building vcall offsets. Any
9528 primary virtual base will have already had its offsets generated
9529 through the recursion in build_vcall_and_vbase_vtbl_entries. */
9533 /* If BINFO has a primary base, process it first. */
9538 /* Add BINFO itself to the list. */
9541 /* Scan the non-primary bases of BINFO. */
9545 }
9547 /* Called from build_vcall_offset_vtbl_entries_r. */
9549 static void
9551 {
9552 /* Make entries for the rest of the virtuals. */
9553 tree orig_fn;
9555 /* The ABI requires that the methods be processed in declaration
9556 order. */
9558 orig_fn;
9562 }
9564 /* Add a vcall offset entry for ORIG_FN to the vtable. */
9566 static void
9568 {
9570 tree vcall_offset;
9571 tree derived_entry;
9573 /* If there is already an entry for a function with the same
9574 signature as FN, then we do not need a second vcall offset.
9575 Check the list of functions already present in the derived
9576 class vtable. */
9578 {
9580 /* We only use one vcall offset for virtual destructors,
9581 even though there are two virtual table entries. */
9585 }
9587 /* If we are building these vcall offsets as part of building
9588 the vtable for the most derived class, remember the vcall
9589 offset. */
9591 {
9594 }
9596 /* The next vcall offset will be found at a more negative
9597 offset. */
9601 /* Keep track of this function. */
9605 {
9606 tree base;
9607 tree fn;
9609 /* Find the overriding function. */
9613 else
9614 {
9617 /* The vbase we're working on is a primary base of
9618 vid->binfo. But it might be a lost primary, so its
9619 BINFO_OFFSET might be wrong, so we just use the
9620 BINFO_OFFSET from vid->binfo. */
9626 vcall_offset);
9627 }
9628 /* Add the initializer to the vtable. */
9630 }
9631 }
9633 /* Return vtbl initializers for the RTTI entries corresponding to the
9634 BINFO's vtable. The RTTI entries should indicate the object given
9635 by VID->rtti_binfo. */
9637 static void
9639 {
9640 tree b;
9641 tree t;
9642 tree offset;
9643 tree decl;
9644 tree init;
9648 /* To find the complete object, we will first convert to our most
9649 primary base, and then add the offset in the vtbl to that value. */
9654 /* The second entry is the address of the typeinfo object. */
9657 else
9660 /* Convert the declaration to a type that can be stored in the
9661 vtable. */
9665 /* Add the offset-to-top entry. It comes earlier in the vtable than
9666 the typeinfo entry. Convert the offset to look like a
9667 function pointer, so that we can put it in the vtable. */
9670 }
9672 /* TRUE iff TYPE is uniquely derived from PARENT. Ignores
9673 accessibility. */
9675 bool
9677 {
9680 }
9682 /* TRUE iff TYPE is publicly & uniquely derived from PARENT. */
9684 bool
9686 {
9690 }
9692 /* CTX1 and CTX2 are declaration contexts. Return the innermost common
9693 class between them, if any. */
9695 tree
9697 {
9709 {
9712 }
9716 }