| blob | 4300c5cacf39025a4e090c0c974eeda3bb51eb37 |
1 /* Functions related to building classes and their related objects.
2 Copyright (C) 1987-2018 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 /* Return a COND_EXPR that executes TRUE_STMT if this execution of the
219 'structor is in charge of 'structing virtual bases, or FALSE_STMT
220 otherwise. */
222 tree
224 {
234 }
236 /* Convert to or from a base subobject. EXPR is an expression of type
237 `A' or `A*', an expression of type `B' or `B*' is returned. To
238 convert A to a base B, CODE is PLUS_EXPR and BINFO is the binfo for
239 the B base instance within A. To convert base A to derived B, CODE
240 is MINUS_EXPR and BINFO is the binfo for the A instance within B.
241 In this latter case, A must not be a morally virtual base of B.
242 NONNULL is true if EXPR is known to be non-NULL (this is only
243 needed when EXPR is of pointer type). CV qualifiers are preserved
244 from EXPR. */
246 tree
248 tree expr,
249 tree binfo,
251 tsubst_flags_t complain)
252 {
255 tree probe;
256 tree offset;
257 tree target_type;
259 tree ptr_target_type;
270 {
276 }
284 {
285 /* This can happen when adjust_result_of_qualified_name_lookup can't
286 find a unique base binfo in a call to a member function. We
287 couldn't give the diagnostic then since we might have been calling
288 a static member function, so we do it now. In other cases, eg.
289 during error recovery (c++/71979), we may not have a base at all. */
291 {
295 }
297 }
304 /* Nothing to do. */
308 {
310 {
312 {
315 "pointer to derived class %qT because the base is "
317 else
321 }
322 else
323 {
329 else
333 }
334 }
336 }
339 {
341 /* This must happen before the call to save_expr. */
343 }
344 else
350 /* TARGET_TYPE has been extracted from BINFO, and, is therefore always
351 cv-unqualified. Extract the cv-qualifiers from EXPR so that the
352 expression returned matches the input. */
353 target_type = cp_build_qualified_type
357 /* Do we need to look in the vtable for the real offset? */
360 /* Don't bother with the calculations inside sizeof; they'll ICE if the
361 source type is incomplete and the pointer value doesn't matter. In a
362 template (even in instantiate_non_dependent_expr), we don't have vtables
363 set up properly yet, and the value doesn't matter there either; we're
364 just interested in the result of overload resolution. */
366 || processing_template_decl
368 {
371 }
374 {
380 }
382 /* If we're in an NSDMI, we don't have the full constructor context yet
383 that we need for converting to a virtual base, so just build a stub
384 CONVERT_EXPR and expand it later in bot_replace. */
387 {
391 }
393 /* Do we need to check for a null pointer? */
395 {
396 /* If we know the conversion will not actually change the value
397 of EXPR, then we can avoid testing the expression for NULL.
398 We have to avoid generating a COMPONENT_REF for a base class
399 field, because other parts of the compiler know that such
400 expressions are always non-NULL. */
404 }
406 /* Protect against multiple evaluation if necessary. */
410 /* Now that we've saved expr, build the real null test. */
412 {
416 /* This is a compiler generated comparison, don't emit
417 e.g. -Wnonnull-compare warning for it. */
419 }
421 /* If this is a simple base reference, express it as a COMPONENT_REF. */
423 /* We don't build base fields for empty bases, and they aren't very
424 interesting to the optimizers anyway. */
426 {
435 }
438 {
439 /* Going via virtual base V_BINFO. We need the static offset
440 from V_BINFO to BINFO, and the dynamic offset from D_BINFO to
441 V_BINFO. That offset is an entry in D_BINFO's vtable. */
442 tree v_offset;
445 {
446 /* In a base member initializer, we cannot rely on the
447 vtable being set up. We have to indirect via the
448 vtt_parm. */
449 tree t;
455 }
456 else
457 {
461 {
466 }
469 }
477 v_offset);
489 /* Negative fixed_type_p means this is a constructor or destructor;
490 virtual base layout is fixed in in-charge [cd]tors, but not in
491 base [cd]tors. */
492 offset = build_if_in_charge
494 v_offset);
495 else
497 }
505 {
510 }
511 else
514 indout:
516 {
520 }
522 out:
528 }
530 /* Subroutine of build_base_path; EXPR and BINFO are as in that function.
531 Perform a derived-to-base conversion by recursively building up a
532 sequence of COMPONENT_REFs to the appropriate base fields. */
534 static tree
536 {
539 tree field;
542 {
543 tree temp;
547 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x'
548 into `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only
549 an lvalue in the front end; only _DECLs and _REFs are lvalues
550 in the back end. */
556 }
558 /* Recurse. */
563 /* Is this the base field created by build_base_field? */
567 /* If we're looking for a field in the most-derived class,
568 also check the field offset; we can have two base fields
569 of the same type if one is an indirect virtual base and one
570 is a direct non-virtual base. */
574 {
575 /* We don't use build_class_member_access_expr here, as that
576 has unnecessary checks, and more importantly results in
577 recursive calls to dfs_walk_once. */
583 /* Mark the expression const or volatile, as appropriate.
584 Even though we've dealt with the type above, we still have
585 to mark the expression itself. */
592 }
594 /* Didn't find the base field?!? */
596 }
598 /* Convert OBJECT to the base TYPE. OBJECT is an expression whose
599 type is a class type or a pointer to a class type. In the former
600 case, TYPE is also a class type; in the latter it is another
601 pointer type. If CHECK_ACCESS is true, an error message is emitted
602 if TYPE is inaccessible. If OBJECT has pointer type, the value is
603 assumed to be non-NULL. */
605 tree
607 tsubst_flags_t complain)
608 {
609 tree binfo;
610 tree object_type;
613 {
616 }
617 else
626 }
628 /* EXPR is an expression with unqualified class type. BASE is a base
629 binfo of that class type. Returns EXPR, converted to the BASE
630 type. This function assumes that EXPR is the most derived class;
631 therefore virtual bases can be found at their static offsets. */
633 tree
635 {
636 tree expr_type;
640 {
641 /* If this is a non-empty base, use a COMPONENT_REF. */
645 /* We use fold_build2 and fold_convert below to simplify the trees
646 provided to the optimizers. It is not safe to call these functions
647 when processing a template because they do not handle C++-specific
648 trees. */
656 }
659 }
661 \f
662 tree
664 {
668 /* Can happen in case of duplicate base types (c++/59082). */
672 /* First, convert to the requested type. */
677 /* Second, the requested type may not be the owner of its own vptr.
678 If not, convert to the base class that owns it. We cannot use
679 convert_to_base here, because VCONTEXT may appear more than once
680 in the inheritance hierarchy of TYPE, and thus direct conversion
681 between the types may be ambiguous. Following the path back up
682 one step at a time via primary bases avoids the problem. */
686 {
689 }
692 }
694 /* Given an object INSTANCE, return an expression which yields the
695 vtable element corresponding to INDEX. There are many special
696 cases for INSTANCE which we take care of here, mainly to avoid
697 creating extra tree nodes when we don't have to. */
699 static tree
701 {
702 tree aref;
705 /* Try to figure out what a reference refers to, and
706 access its virtual function table directly. */
714 {
719 }
728 }
730 tree
732 {
736 }
738 /* Given a stable object pointer INSTANCE_PTR, return an expression which
739 yields a function pointer corresponding to vtable element INDEX. */
741 tree
743 {
744 tree aref;
747 idx);
749 /* When using function descriptors, the address of the
750 vtable entry is treated as a function pointer. */
755 /* Remember this as a method reference, for later devirtualization. */
759 }
761 /* Return the name of the virtual function table (as an IDENTIFIER_NODE)
762 for the given TYPE. */
764 static tree
766 {
768 }
770 /* DECL is an entity associated with TYPE, like a virtual table or an
771 implicitly generated constructor. Determine whether or not DECL
772 should have external or internal linkage at the object file
773 level. This routine does not deal with COMDAT linkage and other
774 similar complexities; it simply sets TREE_PUBLIC if it possible for
775 entities in other translation units to contain copies of DECL, in
776 the abstract. */
778 void
780 {
783 }
785 /* Create a VAR_DECL for a primary or secondary vtable for CLASS_TYPE.
786 (For a secondary vtable for B-in-D, CLASS_TYPE should be D, not B.)
787 Use NAME for the name of the vtable, and VTABLE_TYPE for its type. */
789 static tree
791 {
792 tree decl;
795 /* vtable names are already mangled; give them their DECL_ASSEMBLER_NAME
796 now to avoid confusion in mangle_decl. */
807 /* The vtable has not been defined -- yet. */
811 /* Mark the VAR_DECL node representing the vtable itself as a
812 "gratuitous" one, thereby forcing dwarfout.c to ignore it. It
813 is rather important that such things be ignored because any
814 effort to actually generate DWARF for them will run into
815 trouble when/if we encounter code like:
817 #pragma interface
818 struct S { virtual void member (); };
820 because the artificial declaration of the vtable itself (as
821 manufactured by the g++ front end) will say that the vtable is
822 a static member of `S' but only *after* the debug output for
823 the definition of `S' has already been output. This causes
824 grief because the DWARF entry for the definition of the vtable
825 will try to refer back to an earlier *declaration* of the
826 vtable as a static member of `S' and there won't be one. We
827 might be able to arrange to have the "vtable static member"
828 attached to the member list for `S' before the debug info for
829 `S' get written (which would solve the problem) but that would
830 require more intrusive changes to the g++ front end. */
834 }
836 /* Get the VAR_DECL of the vtable for TYPE. TYPE need not be polymorphic,
837 or even complete. If this does not exist, create it. If COMPLETE is
838 nonzero, then complete the definition of it -- that will render it
839 impossible to actually build the vtable, but is useful to get at those
840 which are known to exist in the runtime. */
842 tree
844 {
845 tree decl;
854 {
857 }
860 }
862 /* Build the primary virtual function table for TYPE. If BINFO is
863 non-NULL, build the vtable starting with the initial approximation
864 that it is the same as the one which is the head of the association
865 list. Returns a nonzero value if a new vtable is actually
866 created. */
868 static int
870 {
871 tree decl;
872 tree virtuals;
877 {
879 /* We have already created a vtable for this base, so there's
880 no need to do it again. */
887 }
888 else
889 {
892 }
894 /* Initialize the association list for this type, based
895 on our first approximation. */
900 }
902 /* Give BINFO a new virtual function table which is initialized
903 with a skeleton-copy of its original initialization. The only
904 entry that changes is the `delta' entry, so we can really
905 share a lot of structure.
907 FOR_TYPE is the most derived type which caused this table to
908 be needed.
910 Returns nonzero if we haven't met BINFO before.
912 The order in which vtables are built (by calling this function) for
913 an object must remain the same, otherwise a binary incompatibility
914 can result. */
916 static int
918 {
920 /* We already created a vtable for this base. There's no need to
921 do it again. */
924 /* Remember that we've created a vtable for this BINFO, so that we
925 don't try to do so again. */
928 /* Make fresh virtual list, so we can smash it later. */
931 /* Secondary vtables are laid out as part of the same structure as
932 the primary vtable. */
935 }
937 /* Create a new vtable for BINFO which is the hierarchy dominated by
938 T. Return nonzero if we actually created a new vtable. */
940 static int
942 {
944 /* In this case, it is *type*'s vtable we are modifying. We start
945 with the approximation that its vtable is that of the
946 immediate base class. */
948 else
949 /* This is our very own copy of `basetype' to play with. Later,
950 we will fill in all the virtual functions that override the
951 virtual functions in these base classes which are not defined
952 by the current type. */
954 }
956 /* Make *VIRTUALS, an entry on the BINFO_VIRTUALS list for BINFO
957 (which is in the hierarchy dominated by T) list FNDECL as its
958 BV_FN. DELTA is the required constant adjustment from the `this'
959 pointer where the vtable entry appears to the `this' required when
960 the function is actually called. */
962 static void
964 tree binfo,
965 tree fndecl,
966 tree delta,
968 {
969 tree v;
975 {
976 /* We need a new vtable for BINFO. */
978 {
979 /* If we really did make a new vtable, we also made a copy
980 of the BINFO_VIRTUALS list. Now, we have to find the
981 corresponding entry in that list. */
986 }
991 }
992 }
994 \f
995 /* Add method METHOD to class TYPE. If VIA_USING indicates whether
996 METHOD is being injected via a using_decl. Returns true if the
997 method could be added to the method vec. */
999 bool
1001 {
1010 /* Check to see if we've already got this method. */
1012 {
1014 tree fn_type;
1015 tree method_type;
1016 tree parms1;
1017 tree parms2;
1022 /* Two using-declarations can coexist, we'll complain about ambiguity in
1023 overload resolution. */
1025 /* Except handle inherited constructors specially. */
1029 /* [over.load] Member function declarations with the
1030 same name and the same parameter types cannot be
1031 overloaded if any of them is a static member
1032 function declaration.
1034 [over.load] Member function declarations with the same name and
1035 the same parameter-type-list as well as member function template
1036 declarations with the same name, the same parameter-type-list, and
1037 the same template parameter lists cannot be overloaded if any of
1038 them, but not all, have a ref-qualifier.
1040 [namespace.udecl] When a using-declaration brings names
1041 from a base class into a derived class scope, member
1042 functions in the derived class override and/or hide member
1043 functions with the same name and parameter types in a base
1044 class (rather than conflicting). */
1050 /* Compare the quals on the 'this' parm. Don't compare
1051 the whole types, as used functions are treated as
1052 coming from the using class in overload resolution. */
1055 /* Either both or neither need to be ref-qualified for
1056 differing quals to allow overloading. */
1063 /* For templates, the return type and template parameters
1064 must be identical. */
1077 /* Bring back parameters omitted from an inherited ctor. */
1088 {
1089 /* If these are versions of the same function, process and
1090 move on. */
1096 {
1098 {
1102 {
1104 {
1105 /* Inheriting the same constructor along different
1106 paths, combine them. */
1107 SET_DECL_INHERITED_CTOR
1110 /* And discard the new one. */
1112 }
1113 else
1114 /* Inherited ctors can coexist until overload
1115 resolution. */
1117 }
1123 basef);
1124 }
1125 /* Otherwise defer to the other function. */
1127 }
1130 /* Defer to the local function. */
1134 {
1135 /* Remove the inherited constructor. */
1138 }
1139 else
1140 {
1146 }
1147 }
1148 }
1150 /* A class should never have more than one destructor. */
1162 /* Maintain TYPE_HAS_USER_CONSTRUCTOR, etc. */
1168 }
1170 /* Subroutines of finish_struct. */
1172 /* Change the access of FDECL to ACCESS in T. Return 1 if change was
1173 legit, otherwise return 0. */
1175 static int
1177 {
1178 tree elem;
1186 {
1188 {
1192 else
1195 }
1196 else
1197 {
1198 /* They're changing the access to the same thing they changed
1199 it to before. That's OK. */
1200 ;
1201 }
1202 }
1203 else
1204 {
1206 tf_warning_or_error);
1209 }
1211 }
1213 /* Return the access node for DECL's access in its enclosing class. */
1215 tree
1217 {
1221 }
1223 /* Process the USING_DECL, which is a member of T. */
1225 static void
1227 {
1232 tree old_value;
1237 tf_warning_or_error);
1239 {
1244 else
1246 }
1254 ;
1256 {
1258 /* It's OK to use functions from a base when there are functions with
1260 else
1261 {
1268 }
1269 }
1271 {
1278 }
1280 /* Make type T see field decl FDECL with access ACCESS. */
1283 {
1286 }
1287 else
1289 }
1290 \f
1291 /* Data structure for find_abi_tags_r, below. */
1293 struct abi_tag_data
1294 {
1298 };
1300 /* Subroutine of find_abi_tags_r. Handle a single TAG found on the class TP
1301 in the context of P. TAG can be either an identifier (the DECL_NAME of
1302 a tag NAMESPACE_DECL) or a STRING_CST (a tag attribute). */
1304 static void
1306 {
1308 {
1310 {
1311 /* We're collecting tags from template arguments or from
1312 the type of a variable or function return type. */
1315 /* Don't inherit this tag multiple times. */
1319 {
1320 /* Tags inherited from type template arguments are only used
1321 to avoid warnings. */
1324 }
1325 /* For functions and variables we want to warn, too. */
1326 }
1328 /* Otherwise we're diagnosing missing tags. */
1330 {
1335 }
1337 {
1341 }
1343 {
1348 }
1349 else
1350 {
1354 {
1358 }
1359 }
1360 }
1361 }
1363 /* Find all the ABI tags in the attribute list ATTR and either call
1364 check_tag (if TP is non-null) or set IDENTIFIER_MARKED to val. */
1366 static void
1368 {
1375 {
1380 else
1382 }
1383 }
1385 /* Find all the ABI tags on T and its enclosing scopes and either call
1386 check_tag (if TP is non-null) or set IDENTIFIER_MARKED to val. */
1388 static void
1390 {
1392 {
1393 tree attr;
1395 {
1398 }
1399 else
1400 {
1403 }
1405 }
1406 }
1408 /* walk_tree callback for check_abi_tags: if the type at *TP involves any
1409 types with ABI tags, add the corresponding identifiers to the VEC in
1410 *DATA and set IDENTIFIER_MARKED. */
1412 static tree
1414 {
1418 /* walk_tree shouldn't be walking into any subtrees of a RECORD_TYPE
1419 anyway, but let's make sure of it. */
1427 }
1429 /* walk_tree callback for mark_abi_tags: if *TP is a class, set
1430 IDENTIFIER_MARKED on its ABI tags. */
1432 static tree
1434 {
1438 /* walk_tree shouldn't be walking into any subtrees of a RECORD_TYPE
1439 anyway, but let's make sure of it. */
1447 }
1449 /* Set IDENTIFIER_MARKED on all the ABI tags on T and its enclosing
1450 scopes. */
1452 static void
1454 {
1457 {
1460 {
1461 /* Template arguments are part of the signature. */
1464 {
1467 }
1468 }
1470 /* A function's parameter types are part of the signature, so
1471 we don't need to inherit any tags that are also in them. */
1476 }
1477 }
1479 /* Check that T has all the ABI tags that subobject SUBOB has, or
1480 warn if not. If T is a (variable or function) declaration, also
1481 return any missing tags, and add them to T if JUST_CHECKING is false. */
1483 static tree
1485 {
1493 /* No need to worry about things local to this TU. */
1509 {
1512 }
1513 else
1514 {
1518 else
1522 }
1527 }
1529 /* Check that DECL has all the ABI tags that are used in parts of its type
1530 that are not reflected in its mangled name. */
1532 void
1534 {
1541 }
1543 /* Return any ABI tags that are used in parts of the type of DECL
1544 that are not reflected in its mangled name. This function is only
1545 used in backward-compatible mangling for ABI <11. */
1547 tree
1549 {
1553 /* Don't check DECL_CONV_FN_P here like we do in check_abi_tags, so
1554 that we can use this function for setting need_abi_warning
1555 regardless of the current flag_abi_version. */
1558 else
1560 }
1562 void
1564 {
1574 {
1577 {
1581 }
1582 }
1584 // If we found some tags on our template arguments, add them to our
1585 // abi_tag attribute.
1587 {
1591 else
1595 }
1598 }
1600 /* Return true, iff class T has a non-virtual destructor that is
1601 accessible from outside the class heirarchy (i.e. is public, or
1602 there's a suitable friend. */
1604 static bool
1606 {
1609 /* An implicitly declared destructor is always public. And,
1610 if it were virtual, we would have created it by now. */
1625 }
1627 /* Run through the base classes of T, updating CANT_HAVE_CONST_CTOR_P,
1628 and NO_CONST_ASN_REF_P. Also set flag bits in T based on
1629 properties of the bases. */
1631 static void
1635 {
1639 tree base_binfo;
1640 tree binfo;
1650 {
1659 /* If any base class is non-literal, so is the derived class. */
1663 /* If the base class doesn't have copy constructors or
1664 assignment operators that take const references, then the
1665 derived class cannot have such a member automatically
1666 generated. */
1675 /* A virtual base does not effect nearly emptiness. */
1676 ;
1678 {
1680 /* And if there is more than one nearly empty base, then the
1681 derived class is not nearly empty either. */
1683 else
1684 /* Remember we've seen one. */
1686 }
1688 /* If the base class is not empty or nearly empty, then this
1689 class cannot be nearly empty. */
1692 /* A lot of properties from the bases also apply to the derived
1693 class. */
1710 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT
1713 SET_CLASSTYPE_REF_FIELDS_NEED_INIT
1719 /* A standard-layout class is a class that:
1720 ...
1721 * has no non-standard-layout base classes, */
1724 {
1725 tree basefield;
1726 /* ...has no base classes of the same type as the first non-static
1727 data member... */
1729 && (same_type_ignoring_top_level_qualifiers_p
1732 else
1733 /* ...either has no non-static data members in the most-derived
1734 class and at most one base class with non-static data
1735 members, or has no base classes with non-static data
1736 members */
1742 {
1745 else
1748 }
1749 }
1751 /* Don't bother collecting tm attributes if transactional memory
1752 support is not enabled. */
1754 {
1758 }
1761 }
1763 /* If one of the base classes had TM attributes, and the current class
1764 doesn't define its own, then the current class inherits one. */
1766 {
1769 }
1770 }
1772 /* Determine all the primary bases within T. Sets BINFO_PRIMARY_BASE_P for
1773 those that are primaries. Sets BINFO_LOST_PRIMARY_P for those
1774 that have had a nearly-empty virtual primary base stolen by some
1775 other base in the hierarchy. Determines CLASSTYPE_PRIMARY_BASE for
1776 T. */
1778 static void
1780 {
1784 tree base_binfo;
1786 /* Determine the primary bases of our bases. */
1789 {
1792 /* See if we're the non-virtual primary of our inheritance
1793 chain. */
1795 {
1802 /* We are the primary binfo. */
1804 }
1805 /* Determine if we have a virtual primary base, and mark it so.
1806 */
1808 {
1812 /* Someone already claimed this base. */
1814 else
1815 {
1816 tree delta;
1821 /* A virtual binfo might have been copied from within
1822 another hierarchy. As we're about to use it as a
1823 primary base, make sure the offsets match. */
1831 }
1832 }
1833 }
1835 /* First look for a dynamic direct non-virtual base. */
1837 {
1841 {
1844 }
1845 }
1847 /* A "nearly-empty" virtual base class can be the primary base
1848 class, if no non-virtual polymorphic base can be found. Look for
1849 a nearly-empty virtual dynamic base that is not already a primary
1850 base of something in the hierarchy. If there is no such base,
1851 just pick the first nearly-empty virtual base. */
1857 {
1859 {
1860 /* Found one that is not primary. */
1863 }
1865 /* Remember the first candidate. */
1867 }
1869 found:
1870 /* If we've got a primary base, use it. */
1872 {
1877 /* We are stealing a primary base. */
1881 {
1882 tree delta;
1885 /* A virtual binfo might have been copied from within
1886 another hierarchy. As we're about to use it as a primary
1887 base, make sure the offsets match. */
1892 }
1899 }
1900 }
1902 /* Update the variant types of T. */
1904 void
1906 {
1907 tree variants;
1913 variants;
1915 {
1916 /* These fields are in the _TYPE part of the node, not in
1917 the TYPE_LANG_SPECIFIC component, so they are not shared. */
1927 /* Copy whatever these are holding today. */
1930 }
1931 }
1933 /* KLASS is a class that we're applying may_alias to after the body is
1934 parsed. Fixup any POINTER_TO and REFERENCE_TO types. The
1935 canonical type(s) will be implicitly updated. */
1937 static void
1939 {
1948 }
1950 /* Early variant fixups: we apply attributes at the beginning of the class
1951 definition, and we need to fix up any variants that have already been
1952 made via elaborated-type-specifier so that check_qualified_type works. */
1954 void
1956 {
1957 tree variants;
1971 variants;
1973 {
1974 /* These are the two fields that check_qualified_type looks at and
1975 are affected by attributes. */
1980 else
1985 }
1986 }
1987 \f
1988 /* Set memoizing fields and bits of T (and its variants) for later
1989 use. */
1991 static void
1993 {
1994 /* Fix up variants (if any). */
1998 /* For a class w/o baseclasses, 'finish_struct' has set
1999 CLASSTYPE_PURE_VIRTUALS correctly (by definition).
2000 Similarly for a class whose base classes do not have vtables.
2001 When neither of these is true, we might have removed abstract
2002 virtuals (by providing a definition), added some (by declaring
2003 new ones), or redeclared ones from a base class. We need to
2004 recalculate what's really an abstract virtual at this point (by
2005 looking in the vtables). */
2008 /* If this type has a copy constructor or a destructor, force its
2009 mode to be BLKmode, and force its TREE_ADDRESSABLE bit to be
2010 nonzero. This will cause it to be passed by invisible reference
2011 and prevent it from being returned in a register. */
2014 {
2015 tree variants;
2018 {
2021 }
2022 }
2023 }
2025 /* Issue warnings about T having private constructors, but no friends,
2026 and so forth.
2028 HAS_NONPRIVATE_METHOD is nonzero if T has any non-private methods or
2029 static members. HAS_NONPRIVATE_STATIC_FN is nonzero if T has any
2030 non-private static member functions. */
2032 static void
2034 {
2040 /* If the class has friends, those entities might create and
2041 access instances, so we should not warn. */
2044 /* We will have warned when the template was declared; there's
2045 no need to warn on every instantiation. */
2047 /* There's no reason to even consider warning about this
2048 class. */
2051 /* We only issue one warning, if more than one applies, because
2052 otherwise, on code like:
2054 class A {
2055 // Oops - forgot `public:'
2056 A();
2057 A(const A&);
2058 ~A();
2059 };
2061 we warn several times about essentially the same problem. */
2063 /* Check to see if all (non-constructor, non-destructor) member
2064 functions are private. (Since there are no friends or
2065 non-private statics, we can't ever call any of the private member
2066 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 {
2136 /* If a non-template class does not define a copy
2137 constructor, one is defined for it, enabling it to avoid
2138 this warning. For a template class, this does not
2139 happen, and so we would normally get a warning on:
2141 template <class T> class C { private: C(); };
2143 To avoid this asymmetry, we check TYPE_HAS_COPY_CTOR. All
2144 complete non-template or fully instantiated classes have this
2145 flag set. */
2148 else
2154 /* Ideally, we wouldn't count any constructor that takes
2155 an argument of the class type as a parameter, because
2156 such things cannot be used to construct an instance of
2157 the class unless you already have one. */
2159 else
2163 {
2166 t);
2172 }
2173 }
2174 }
2176 /* Make BINFO's vtable have N entries, including RTTI entries,
2177 vbase and vcall offsets, etc. Set its type and call the back end
2178 to lay it out. */
2180 static void
2182 {
2183 tree atype;
2184 tree vtable;
2189 /* We may have to grow the vtable. */
2192 {
2196 }
2197 }
2199 /* True iff FNDECL and BASE_FNDECL (both non-static member functions)
2200 have the same signature. */
2202 int
2204 {
2205 /* One destructor overrides another if they are the same kind of
2206 destructor. */
2210 /* But a non-destructor never overrides a destructor, nor vice
2211 versa, nor do different kinds of destructors override
2212 one-another. For example, a complete object destructor does not
2213 override a deleting destructor. */
2222 {
2230 }
2232 }
2234 /* Returns TRUE if DERIVED is a binfo containing the binfo BASE as a
2235 subobject. */
2237 static bool
2239 {
2240 tree probe;
2243 {
2247 /* If we meet a virtual base, we can't follow the inheritance
2248 any more. See if the complete type of DERIVED contains
2249 such a virtual base. */
2252 }
2254 }
2257 /* The function for which we are trying to find a final overrider. */
2258 tree fn;
2259 /* The base class in which the function was declared. */
2260 tree declaring_base;
2261 /* The candidate overriders. */
2262 tree candidates;
2263 /* Path to most derived. */
2265 };
2267 /* Add the overrider along the current path to FFOD->CANDIDATES.
2268 Returns true if an overrider was found; false otherwise. */
2270 static bool
2274 {
2275 tree method;
2277 /* If BINFO is not the most derived type, try a more derived class.
2278 A definition there will overrider a definition here. */
2280 {
2281 depth--;
2285 }
2289 {
2292 /* Remove any candidates overridden by this new function. */
2294 {
2295 /* If *CANDIDATE overrides METHOD, then METHOD
2296 cannot override anything else on the list. */
2299 /* If METHOD overrides *CANDIDATE, remove *CANDIDATE. */
2302 else
2304 }
2306 /* Add the new function. */
2309 }
2312 }
2314 /* Called from find_final_overrider via dfs_walk. */
2316 static tree
2318 {
2326 }
2328 static tree
2330 {
2335 }
2337 /* Returns a TREE_LIST whose TREE_PURPOSE is the final overrider for
2338 FN and whose TREE_VALUE is the binfo for the base where the
2339 overriding occurs. BINFO (in the hierarchy dominated by the binfo
2340 DERIVED) is the base object in which FN is declared. */
2342 static tree
2344 {
2345 find_final_overrider_data ffod;
2347 /* Getting this right is a little tricky. This is valid:
2349 struct S { virtual void f (); };
2350 struct T { virtual void f (); };
2351 struct U : public S, public T { };
2353 even though calling `f' in `U' is ambiguous. But,
2355 struct R { virtual void f(); };
2356 struct S : virtual public R { virtual void f (); };
2357 struct T : virtual public R { virtual void f (); };
2358 struct U : public S, public T { };
2360 is not -- there's no way to decide whether to put `S::f' or
2361 `T::f' in the vtable for `R'.
2363 The solution is to look at all paths to BINFO. If we find
2364 different overriders along any two, then there is a problem. */
2368 /* Determine the depth of the hierarchy. */
2379 /* If there was no winner, issue an error message. */
2384 }
2386 /* Return the index of the vcall offset for FN when TYPE is used as a
2387 virtual base. */
2389 static tree
2391 {
2393 tree_pair_p p;
2401 /* There should always be an appropriate index. */
2403 }
2405 /* Update an entry in the vtable for BINFO, which is in the hierarchy
2406 dominated by T. FN is the old function; VIRTUALS points to the
2407 corresponding position in the new BINFO_VIRTUALS list. IX is the index
2408 of that entry in the list. */
2410 static void
2413 {
2414 tree b;
2415 tree overrider;
2416 tree delta;
2417 tree virtual_base;
2418 tree first_defn;
2424 /* Find the nearest primary base (possibly binfo itself) which defines
2425 this function; this is the class the caller will convert to when
2426 calling FN through BINFO. */
2428 {
2433 /* The nearest definition is from a lost primary. */
2436 }
2439 /* Find the final overrider. */
2442 {
2445 }
2448 /* Check for adjusting covariant return types. */
2456 /* If the overrider is invalid, don't even try. */
2458 {
2459 /* If FN is a covariant thunk, we must figure out the adjustment
2460 to the final base FN was converting to. As OVERRIDER_TARGET might
2461 also be converting to the return type of FN, we have to
2462 combine the two conversions here. */
2469 {
2473 }
2474 else
2478 /* Find the equivalent binfo within the return type of the
2479 overriding function. We will want the vbase offset from
2480 there. */
2482 over_return);
2485 {
2486 /* There was no existing virtual thunk (which takes
2487 precedence). So find the binfo of the base function's
2488 return type within the overriding function's return type.
2489 Fortunately we know the covariancy is valid (it
2490 has already been checked), so we can just iterate along
2491 the binfos, which have been chained in inheritance graph
2492 order. Of course it is lame that we have to repeat the
2493 search here anyway -- we should really be caching pieces
2494 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). */
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 {
2887 {
2888 /* We're generally only interested in entities the user
2889 declared, but we also find nested classes by noticing
2890 the TYPE_DECL that we create implicitly. You're
2891 allowed to put one anonymous union inside another,
2892 though, so we explicitly tolerate that. We use
2893 TYPE_UNNAMED_P rather than ANON_AGGR_TYPE_P so that
2894 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. */
2910 "only have public non-static data members"
2913 {
2916 {
2920 }
2921 }
2922 }
2927 /* Recurse into the anonymous aggregates to correctly handle
2928 access control (c++/24926):
2930 class A {
2931 union {
2932 union {
2933 int i;
2934 };
2935 };
2936 };
2938 int j=A().i; */
2942 }
2943 }
2945 /* Check for things that are invalid. There are probably plenty of other
2946 things we should check for also. */
2948 static void
2950 {
2952 {
2961 }
2962 }
2964 /* Add T to CLASSTYPE_DECL_LIST of current_class_type which
2965 will be used later during class template instantiation.
2966 When FRIEND_P is zero, T can be a static member data (VAR_DECL),
2967 a non-static member data (FIELD_DECL), a member function
2968 (FUNCTION_DECL), a nested type (RECORD_TYPE, ENUM_TYPE),
2969 a typedef (TYPE_DECL) or a member class template (TEMPLATE_DECL)
2970 When FRIEND_P is nonzero, T is either a friend class
2971 (RECORD_TYPE, TEMPLATE_DECL) or a friend function
2972 (FUNCTION_DECL, TEMPLATE_DECL). */
2974 void
2976 {
2977 /* Save some memory by not creating TREE_LIST if TYPE is not template. */
2982 }
2984 /* This function is called from declare_virt_assop_and_dtor via
2985 dfs_walk_all.
2987 DATA is a type that direcly or indirectly inherits the base
2988 represented by BINFO. If BINFO contains a virtual assignment [copy
2989 assignment or move assigment] operator or a virtual constructor,
2990 declare that function in DATA if it hasn't been already declared. */
2992 static tree
2994 {
3002 /* A base without a vtable needs no modification, and its bases
3003 are uninteresting. */
3007 /* If this is a primary base, then we have already looked at the
3008 virtual functions of its vtable. */
3012 {
3016 {
3021 }
3025 }
3028 }
3030 /* If the class type T has a direct or indirect base that contains a
3031 virtual assignment operator or a virtual destructor, declare that
3032 function in T if it hasn't been already declared. */
3034 static void
3036 {
3044 dfs_declare_virt_assop_and_dtor,
3046 }
3048 /* Declare the inheriting constructor for class T inherited from base
3049 constructor CTOR with the parameter array PARMS of size NPARMS. */
3051 static void
3053 {
3056 /* We don't declare an inheriting ctor that would be a default,
3057 copy or move ctor for derived or base. */
3062 {
3066 }
3075 {
3078 }
3079 }
3081 /* Declare all the inheriting constructors for class T inherited from base
3082 constructor CTOR. */
3084 static void
3086 {
3090 {
3096 }
3101 {
3105 }
3108 {
3112 }
3113 }
3115 /* Create default constructors, assignment operators, and so forth for
3116 the type indicated by T, if they are needed. CANT_HAVE_CONST_CTOR,
3117 and CANT_HAVE_CONST_ASSIGNMENT are nonzero if, for whatever reason,
3118 the class cannot have a default constructor, copy constructor
3119 taking a const reference argument, or an assignment operator taking
3120 a const reference, respectively. */
3122 static void
3126 {
3127 /* Destructor. */
3129 /* In general, we create destructors lazily. */
3138 /* [class.ctor]
3140 If there is no user-declared constructor for a class, a default
3141 constructor is implicitly declared. */
3143 {
3148 /* Don't force the declaration to get a hard answer; if the
3149 definition would have made the class non-literal, it will still be
3150 non-literal because of the base or member in question, and that
3151 gives a better diagnostic. */
3153 }
3155 /* [class.ctor]
3157 If a class definition does not explicitly declare a copy
3158 constructor, one is declared implicitly. */
3160 {
3166 }
3168 /* If there is no assignment operator, one will be created if and
3169 when it is needed. For now, just record whether or not the type
3170 of the parameter to the assignment operator will be a const or
3171 non-const reference. */
3173 {
3179 }
3181 /* We can't be lazy about declaring functions that might override
3182 a virtual function from a base class. */
3186 {
3190 {
3191 /* declare, then remove the decl */
3199 }
3200 else
3202 }
3203 }
3205 /* FIELD is a bit-field. We are finishing the processing for its
3206 enclosing type. Issue any appropriate messages and set appropriate
3207 flags. Returns false if an error has been diagnosed. */
3209 static bool
3211 {
3213 tree w;
3215 /* Extract the declared width of the bitfield, which has been
3216 temporarily stashed in DECL_BIT_FIELD_REPRESENTATIVE by grokbitfield. */
3219 /* Remove the bit-field width indicator so that the rest of the
3220 compiler does not treat that value as a qualifier. */
3223 /* Detect invalid bit-field type. */
3225 {
3228 }
3229 else
3230 {
3232 /* Avoid the non_lvalue wrapper added by fold for PLUS_EXPRs. */
3235 /* detect invalid field size. */
3241 {
3244 }
3246 {
3249 }
3251 {
3254 }
3264 {
3270 }
3271 }
3274 {
3278 }
3279 else
3280 {
3281 /* Non-bit-fields are aligned for their type. */
3285 }
3286 }
3288 /* FIELD is a non bit-field. We are finishing the processing for its
3289 enclosing type T. Issue any appropriate messages and set appropriate
3290 flags. */
3292 static bool
3294 tree t,
3297 {
3301 /* In C++98 an anonymous union cannot contain any fields which would change
3302 the settings of CANT_HAVE_CONST_CTOR and friends. */
3304 ;
3305 /* And, we don't set TYPE_HAS_CONST_COPY_CTOR, etc., for anonymous
3306 structs. So, we recurse through their fields here. */
3308 {
3313 cant_have_const_ctor,
3314 no_const_asn_ref);
3315 }
3316 /* Check members with class type for constructors, destructors,
3317 etc. */
3319 {
3320 /* Never let anything with uninheritable virtuals
3321 make it through without complaint. */
3325 {
3330 field);
3335 field);
3337 {
3341 }
3342 }
3343 else
3344 {
3357 }
3366 }
3371 /* `build_class_init_list' does not recognize
3372 non-FIELD_DECLs. */
3376 }
3378 /* Check the data members (both static and non-static), class-scoped
3379 typedefs, etc., appearing in the declaration of T. Issue
3380 appropriate diagnostics. Sets ACCESS_DECLS to a list (in
3381 declaration order) of access declarations; each TREE_VALUE in this
3382 list is a USING_DECL.
3384 In addition, set the following flags:
3386 EMPTY_P
3387 The class is empty, i.e., contains no non-static data members.
3389 CANT_HAVE_CONST_CTOR_P
3390 This class cannot have an implicitly generated copy constructor
3391 taking a const reference.
3393 CANT_HAVE_CONST_ASN_REF
3394 This class cannot have an implicitly generated assignment
3395 operator taking a const reference.
3397 All of these flags should be initialized before calling this
3398 function.
3400 Returns a pointer to the end of the TYPE_FIELDs chain; additional
3401 fields can be added by adding to this chain. */
3403 static void
3407 {
3415 /* Assume there are no access declarations. */
3417 /* Assume this class has no pointer members. */
3419 /* Assume none of the members of this class have default
3420 initializations. */
3424 {
3432 {
3433 /* Save the access declarations for our caller. */
3436 }
3443 /* FIXME: We should fold in the checking from check_methods. */
3446 /* If we've gotten this far, it's a data member, possibly static,
3447 or an enumerator. */
3451 /* When this goes into scope, it will be a non-local reference. */
3455 {
3456 /* [class.union] (C++98)
3458 If a union contains a static data member, or a member of
3459 reference type, the program is ill-formed.
3461 In C++11 [class.union] says:
3462 If a union contains a non-static data member of reference type
3463 the program is ill-formed. */
3465 {
3469 }
3472 {
3476 }
3477 }
3479 /* Perform error checking that did not get done in
3480 grokdeclarator. */
3482 {
3486 }
3488 {
3492 }
3500 /* Now it can only be a FIELD_DECL. */
3505 /* If at least one non-static data member is non-literal, the whole
3506 class becomes non-literal. Per Core/1453, volatile non-static
3507 data members and base classes are also not allowed.
3508 Note: if the type is incomplete we will complain later on. */
3513 /* A standard-layout class is a class that:
3514 ...
3515 has the same access control (Clause 11) for all non-static data members,
3516 ... */
3523 /* If this is of reference type, check if it needs an init. */
3525 {
3531 {
3532 /* ARM $12.6.2: [A member initializer list] (or, for an
3533 aggregate, initialization by a brace-enclosed list) is the
3534 only way to initialize nonstatic const and reference
3535 members. */
3538 }
3539 }
3544 {
3546 {
3547 warning_at
3550 x);
3552 }
3556 }
3560 /* We don't treat zero-width bitfields as making a class
3561 non-empty. */
3562 ;
3563 else
3564 {
3565 /* The class is non-empty. */
3567 /* The class is not even nearly empty. */
3569 /* If one of the data members contains an empty class,
3570 so does T. */
3574 }
3576 /* This is used by -Weffc++ (see below). Warn only for pointers
3577 to members which might hold dynamic memory. So do not warn
3578 for pointers to functions or pointers to members. */
3584 {
3589 }
3595 {
3597 {
3601 }
3603 {
3607 }
3608 }
3611 /* DR 148 now allows pointers to members (which are POD themselves),
3612 to be allowed in POD structs. */
3621 /* We set DECL_C_BIT_FIELD in grokbitfield.
3622 If the type and width are valid, we'll also set DECL_BIT_FIELD. */
3627 {
3632 }
3634 /* Now that we've removed bit-field widths from DECL_INITIAL,
3635 anything left in DECL_INITIAL is an NSDMI that makes the class
3636 non-aggregate in C++11. */
3640 /* If any field is const, the structure type is pseudo-const. */
3642 {
3647 {
3648 /* ARM $12.6.2: [A member initializer list] (or, for an
3649 aggregate, initialization by a brace-enclosed list) is the
3650 only way to initialize nonstatic const and reference
3651 members. */
3654 }
3655 }
3656 /* A field that is pseudo-const makes the structure likewise. */
3658 {
3663 }
3665 /* Core issue 80: A nonstatic data member is required to have a
3666 different name from the class iff the class has a
3667 user-declared constructor. */
3672 }
3674 /* Effective C++ rule 11: if a class has dynamic memory held by pointers,
3675 it should also define a copy constructor and an assignment operator to
3676 implement the correct copy semantic (deep vs shallow, etc.). As it is
3677 not feasible to check whether the constructors do allocate dynamic memory
3678 and store it within members, we approximate the warning like this:
3680 -- Warn only if there are members which are pointers
3681 -- Warn only if there is a non-trivial constructor (otherwise,
3682 there cannot be memory allocated).
3683 -- Warn only if there is a non-trivial destructor. We assume that the
3684 user at least implemented the cleanup correctly, and a destructor
3685 is needed to free dynamic memory.
3687 This seems enough for practical purposes. */
3689 && has_pointers
3693 {
3697 {
3702 }
3706 }
3708 /* Non-static data member initializers make the default constructor
3709 non-trivial. */
3711 {
3714 }
3716 /* If any of the fields couldn't be packed, unset TYPE_PACKED. */
3720 /* Check anonymous struct/anonymous union fields. */
3723 /* We've built up the list of access declarations in reverse order.
3724 Fix that now. */
3726 }
3728 /* If TYPE is an empty class type, records its OFFSET in the table of
3729 OFFSETS. */
3731 static int
3733 {
3734 splay_tree_node n;
3739 /* Record the location of this empty object in OFFSETS. */
3747 type,
3751 }
3753 /* Returns nonzero if TYPE is an empty class type and there is
3754 already an entry in OFFSETS for the same TYPE as the same OFFSET. */
3756 static int
3758 {
3759 splay_tree_node n;
3760 tree t;
3765 /* Record the location of this empty object in OFFSETS. */
3775 }
3777 /* Walk through all the subobjects of TYPE (located at OFFSET). Call
3778 F for every subobject, passing it the type, offset, and table of
3779 OFFSETS. If VBASES_P is one, then virtual non-primary bases should
3780 be traversed.
3782 If MAX_OFFSET is non-NULL, then subobjects with an offset greater
3783 than MAX_OFFSET will not be walked.
3785 If F returns a nonzero value, the traversal ceases, and that value
3786 is returned. Otherwise, returns zero. */
3788 static int
3790 subobject_offset_fn f,
3791 tree offset,
3792 splay_tree offsets,
3793 tree max_offset,
3795 {
3799 /* If this OFFSET is bigger than the MAX_OFFSET, then we should
3800 stop. */
3808 {
3811 }
3814 {
3815 tree field;
3816 tree binfo;
3819 /* Avoid recursing into objects that are not interesting. */
3823 /* Record the location of TYPE. */
3828 /* Iterate through the direct base classes of TYPE. */
3832 {
3833 tree binfo_offset;
3838 tree orig_binfo;
3839 /* We cannot rely on BINFO_OFFSET being set for the base
3840 class yet, but the offsets for direct non-virtual
3841 bases can be calculated by going back to the TYPE. */
3844 offset,
3848 f,
3849 binfo_offset,
3850 offsets,
3851 max_offset,
3855 }
3858 {
3862 /* Iterate through the virtual base classes of TYPE. In G++
3863 3.2, we included virtual bases in the direct base class
3864 loop above, which results in incorrect results; the
3865 correct offsets for virtual bases are only known when
3866 working with the most derived type. */
3870 {
3872 f,
3874 offset,
3876 offsets,
3877 max_offset,
3881 }
3882 else
3883 {
3884 /* We still have to walk the primary base, if it is
3885 virtual. (If it is non-virtual, then it was walked
3886 above.) */
3892 {
3893 r = (walk_subobject_offsets
3898 }
3899 }
3900 }
3902 /* Iterate through the fields of TYPE. */
3907 {
3908 tree field_offset;
3913 f,
3915 offset,
3916 field_offset),
3917 offsets,
3918 max_offset,
3922 }
3923 }
3925 {
3928 tree index;
3930 /* Avoid recursing into objects that are not interesting. */
3933 || !domain
3937 /* Step through each of the elements in the array. */
3941 {
3943 f,
3944 offset,
3945 offsets,
3946 max_offset,
3952 /* If this new OFFSET is bigger than the MAX_OFFSET, then
3953 there's no point in iterating through the remaining
3954 elements of the array. */
3957 }
3958 }
3961 }
3963 /* Record all of the empty subobjects of TYPE (either a type or a
3964 binfo). If IS_DATA_MEMBER is true, then a non-static data member
3965 is being placed at OFFSET; otherwise, it is a base class that is
3966 being placed at OFFSET. */
3968 static void
3970 tree offset,
3971 splay_tree offsets,
3973 {
3974 tree max_offset;
3975 /* If recording subobjects for a non-static data member or a
3976 non-empty base class , we do not need to record offsets beyond
3977 the size of the biggest empty class. Additional data members
3978 will go at the end of the class. Additional base classes will go
3979 either at offset zero (if empty, in which case they cannot
3980 overlap with offsets past the size of the biggest empty class) or
3981 at the end of the class.
3983 However, if we are placing an empty base class, then we must record
3984 all offsets, as either the empty class is at offset zero (where
3985 other empty classes might later be placed) or at the end of the
3986 class (where other objects might then be placed, so other empty
3987 subobjects might later overlap). */
3991 else
3995 }
3997 /* Returns nonzero if any of the empty subobjects of TYPE (located at
3998 OFFSET) conflict with entries in OFFSETS. If VBASES_P is nonzero,
3999 virtual bases of TYPE are examined. */
4001 static int
4003 tree offset,
4004 splay_tree offsets,
4006 {
4007 splay_tree_node max_node;
4009 /* Get the node in OFFSETS that indicates the maximum offset where
4010 an empty subobject is located. */
4012 /* If there aren't any empty subobjects, then there's no point in
4013 performing this check. */
4019 vbases_p);
4020 }
4022 /* DECL is a FIELD_DECL corresponding either to a base subobject of a
4023 non-static data member of the type indicated by RLI. BINFO is the
4024 binfo corresponding to the base subobject, OFFSETS maps offsets to
4025 types already located at those offsets. This function determines
4026 the position of the DECL. */
4028 static void
4030 tree decl,
4031 tree binfo,
4032 splay_tree offsets)
4033 {
4036 tree type;
4039 {
4040 /* For the purposes of determining layout conflicts, we want to
4041 use the class type of BINFO; TREE_TYPE (DECL) will be the
4042 CLASSTYPE_AS_BASE version, which does not contain entries for
4043 zero-sized bases. */
4046 }
4047 else
4048 {
4051 }
4053 /* Try to place the field. It may take more than one try if we have
4054 a hard time placing the field without putting two objects of the
4055 same type at the same address. */
4057 {
4060 /* Place this field. */
4064 /* We have to check to see whether or not there is already
4065 something of the same type at the offset we're about to use.
4066 For example, consider:
4068 struct S {};
4069 struct T : public S { int i; };
4070 struct U : public S, public T {};
4072 Here, we put S at offset zero in U. Then, we can't put T at
4073 offset zero -- its S component would be at the same address
4074 as the S we already allocated. So, we have to skip ahead.
4075 Since all data members, including those whose type is an
4076 empty class, have nonzero size, any overlap can happen only
4077 with a direct or indirect base-class -- it can't happen with
4078 a data member. */
4079 /* In a union, overlap is permitted; all members are placed at
4080 offset zero. */
4085 {
4086 /* Strip off the size allocated to this field. That puts us
4087 at the first place we could have put the field with
4088 proper alignment. */
4091 /* Bump up by the alignment required for the type. */
4092 rli->bitpos
4098 }
4101 {
4102 /* Before ABI v9, we were giving nullptr_t alignment of 1; if
4103 the offset wasn't aligned like a pointer when we started to
4104 layout this field, that affects its position. */
4107 {
4110 "alignment of %qD increased in -fabi-version=9 "
4112 else
4115 }
4117 }
4118 else
4119 /* There was no conflict. We're done laying out this field. */
4121 }
4123 /* Now that we know where it will be placed, update its
4124 BINFO_OFFSET. */
4126 /* Indirect virtual bases may have a nonzero BINFO_OFFSET at
4127 this point because their BINFO_OFFSET is copied from another
4128 hierarchy. Therefore, we may not need to add the entire
4129 OFFSET. */
4135 }
4137 /* Returns true if TYPE is empty and OFFSET is nonzero. */
4139 static int
4141 tree offset,
4143 {
4145 }
4147 /* Layout the empty base BINFO. EOC indicates the byte currently just
4148 past the end of the class, and should be correctly aligned for a
4149 class of the type indicated by BINFO; OFFSETS gives the offsets of
4150 the empty bases allocated so far. T is the most derived
4151 type. Return nonzero iff we added it at the end. */
4153 static bool
4156 {
4157 tree alignment;
4161 /* This routine should only be used for empty classes. */
4166 propagate_binfo_offsets
4170 /* This is an empty base class. We first try to put it at offset
4171 zero. */
4174 offsets,
4176 {
4177 /* That didn't work. Now, we move forward from the next
4178 available spot in the class. */
4182 {
4185 offsets,
4187 /* We finally found a spot where there's no overlap. */
4190 /* There's overlap here, too. Bump along to the next spot. */
4192 }
4193 }
4196 {
4201 }
4204 }
4206 /* Build the FIELD_DECL for BASETYPE as a base of T, add it to the chain of
4207 fields at NEXT_FIELD, and return it. */
4209 static tree
4211 {
4212 /* Create the FIELD_DECL. */
4220 /* CLASSTYPE_SIZE is one byte, but the field needs to have size zero. */
4222 else
4223 {
4226 }
4232 /* Add the new FIELD_DECL to the list of fields for T. */
4238 }
4240 /* Layout the base given by BINFO in the class indicated by RLI.
4241 *BASE_ALIGN is a running maximum of the alignments of
4242 any base class. OFFSETS gives the location of empty base
4243 subobjects. T is the most derived type. Return nonzero if the new
4244 object cannot be nearly-empty. A new FIELD_DECL is inserted at
4245 *NEXT_FIELD, unless BINFO is for an empty base class.
4247 Returns the location at which the next field should be inserted. */
4252 {
4257 /* This error is now reported in xref_tag, thus giving better
4258 location information. */
4261 /* Place the base class. */
4263 {
4264 tree decl;
4266 /* The containing class is non-empty because it has a non-empty
4267 base class. */
4270 /* Create the FIELD_DECL. */
4273 /* Try to place the field. It may take more than one try if we
4274 have a hard time placing the field without putting two
4275 objects of the same type at the same address. */
4277 }
4278 else
4279 {
4280 tree eoc;
4283 /* On some platforms (ARM), even empty classes will not be
4284 byte-aligned. */
4289 /* A nearly-empty class "has no proper base class that is empty,
4290 not morally virtual, and at an offset other than zero." */
4292 {
4295 /* The check above (used in G++ 3.2) is insufficient because
4296 an empty class placed at offset zero might itself have an
4297 empty base at a nonzero offset. */
4299 empty_base_at_nonzero_offset_p,
4300 size_zero_node,
4305 }
4307 /* We used to not create a FIELD_DECL for empty base classes because of
4308 back end issues with overlapping FIELD_DECLs, but that doesn't seem to
4309 be a problem anymore. We need them to handle initialization of C++17
4310 aggregate bases. */
4312 {
4317 }
4319 /* An empty virtual base causes a class to be non-empty
4320 -- but in that case we do not need to clear CLASSTYPE_EMPTY_P
4321 here because that was already done when the virtual table
4322 pointer was created. */
4323 }
4325 /* Record the offsets of BINFO and its base subobjects. */
4328 offsets,
4332 }
4334 /* Layout all of the non-virtual base classes. Record empty
4335 subobjects in OFFSETS. T is the most derived type. Return nonzero
4336 if the type cannot be nearly empty. The fields created
4337 corresponding to the base classes will be inserted at
4338 *NEXT_FIELD. */
4340 static void
4343 {
4344 /* Chain to hold all the new FIELD_DECLs which stand in for base class
4345 subobjects. */
4350 /* The primary base class is always allocated first. */
4355 /* Now allocate the rest of the bases. */
4357 {
4358 tree base_binfo;
4362 /* The primary base was already allocated above, so we don't
4363 need to allocate it again here. */
4367 /* Virtual bases are added at the end (a primary virtual base
4368 will have already been added). */
4374 }
4375 }
4377 /* Go through the TYPE_FIELDS of T issuing any appropriate
4378 diagnostics, figuring out which methods override which other
4379 methods, and so forth. */
4381 static void
4383 {
4386 {
4392 /* The name of the field is the original field name
4393 Save this in auxiliary field for later overloading. */
4395 {
4399 }
4401 /* All user-provided destructors are non-trivial.
4402 Constructors and assignment ops are handled in
4403 grok_special_member_properties. */
4410 "%<transaction_safe_dynamic%> may only be specified for "
4412 }
4413 }
4415 /* FN is a constructor or destructor. Clone the declaration to create
4416 a specialized in-charge or not-in-charge version, as indicated by
4417 NAME. */
4419 static tree
4421 {
4422 tree parms;
4423 tree clone;
4425 /* Copy the function. */
4427 /* Reset the function name. */
4429 /* Remember where this function came from. */
4431 /* Make it easy to find the CLONE given the FN. */
4435 /* If this is a template, do the rest on the DECL_TEMPLATE_RESULT. */
4437 {
4444 }
4445 else
4446 {
4447 // Clone constraints.
4451 }
4456 /* There's no pending inline data for this function. */
4460 /* The base-class destructor is not virtual. */
4462 {
4466 }
4472 /* If there was an in-charge parameter, drop it from the function
4473 type. */
4475 {
4478 /* Skip the `this' parameter. */
4480 /* Skip the in-charge parameter. */
4482 /* And the VTT parm, in a complete [cd]tor. */
4487 {
4488 /* If we're omitting inherited parms, that just leaves the VTT. */
4491 }
4495 parmtypes);
4501 }
4503 /* Copy the function parameters. */
4505 /* Remove the in-charge parameter. */
4507 {
4511 }
4512 /* And the VTT parm, in a complete [cd]tor. */
4514 {
4517 else
4518 {
4522 }
4523 }
4525 /* A base constructor inheriting from a virtual base doesn't get the
4526 arguments. */
4531 {
4534 }
4536 /* Create the RTL for this function. */
4541 }
4543 /* Implementation of DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P, do
4544 not invoke this function directly.
4546 For a non-thunk function, returns the address of the slot for storing
4547 the function it is a clone of. Otherwise returns NULL_TREE.
4549 If JUST_TESTING, looks through TEMPLATE_DECL and returns NULL if
4550 cloned_function is unset. This is to support the separate
4551 DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P modes; using the latter
4552 on a template makes sense, but not the former. */
4554 tree *
4556 {
4564 {
4565 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4568 else
4569 #endif
4571 }
4576 else
4578 }
4580 /* Produce declarations for all appropriate clones of FN. If
4581 UPDATE_METHODS is true, the clones are added to the
4582 CLASSTYPE_MEMBER_VEC. */
4584 void
4586 {
4587 tree clone;
4589 /* Avoid inappropriate cloning. */
4595 {
4596 /* For each constructor, we need two variants: an in-charge version
4597 and a not-in-charge version. */
4604 }
4605 else
4606 {
4609 /* For each destructor, we need three variants: an in-charge
4610 version, a not-in-charge version, and an in-charge deleting
4611 version. We clone the deleting version first because that
4612 means it will go second on the TYPE_FIELDS list -- and that
4613 corresponds to the correct layout order in the virtual
4614 function table.
4616 For a non-virtual destructor, we do not build a deleting
4617 destructor. */
4619 {
4623 }
4630 }
4632 /* Note that this is an abstract function that is never emitted. */
4634 }
4636 /* DECL is an in charge constructor, which is being defined. This will
4637 have had an in class declaration, from whence clones were
4638 declared. An out-of-class definition can specify additional default
4639 arguments. As it is the clones that are involved in overload
4640 resolution, we must propagate the information from the DECL to its
4641 clones. */
4643 void
4645 {
4646 tree clone;
4650 {
4657 /* Skip the 'this' parameter. */
4673 {
4675 {
4679 }
4685 {
4686 /* A default parameter has been added. Adjust the
4687 clone's parameters. */
4691 {
4694 clone_parms);
4696 }
4699 tree type
4702 clone_parms);
4710 }
4711 }
4713 }
4714 }
4716 /* For each of the constructors and destructors in T, create an
4717 in-charge and not-in-charge variant. */
4719 static void
4721 {
4722 /* While constructors can be via a using declaration, at this point
4723 we no longer need to know that. */
4729 }
4731 /* Deduce noexcept for a destructor DTOR. */
4733 void
4735 {
4738 noexcept_deferred_spec);
4739 }
4741 /* Subroutine of set_one_vmethod_tm_attributes. Search base classes
4742 of TYPE for virtual functions which FNDECL overrides. Return a
4743 mask of the tm attributes found therein. */
4745 static int
4747 {
4749 tree base_binfo;
4753 {
4761 {
4765 else
4768 }
4769 else
4771 }
4774 }
4776 /* Subroutine of set_method_tm_attributes. Handle the checks and
4777 inheritance for one virtual method FNDECL. */
4779 static void
4781 {
4782 tree tm_attr;
4787 /* If FNDECL doesn't actually override anything (i.e. T is the
4788 class that first declares FNDECL virtual), then we're done. */
4795 /* Intel STM Language Extension 3.0, Section 4.2 table 4:
4796 tm_pure must match exactly, otherwise no weakening of
4797 tm_safe > tm_callable > nothing. */
4798 /* ??? The tm_pure attribute didn't make the transition to the
4799 multivendor language spec. */
4801 {
4803 {
4806 }
4807 }
4808 /* If the overridden function is tm_pure, then FNDECL must be. */
4811 /* Look for base class combinations that cannot be satisfied. */
4813 {
4819 }
4820 /* If FNDECL did not declare an attribute, then inherit the most
4821 restrictive one. */
4823 {
4825 }
4826 /* Otherwise validate that we're not weaker than a function
4827 that is being overridden. */
4828 else
4829 {
4833 }
4836 err_override:
4840 }
4842 /* For each of the methods in T, propagate a class-level tm attribute. */
4844 static void
4846 {
4849 /* Don't bother collecting tm attributes if transactional memory
4850 support is not enabled. */
4854 /* Process virtual methods first, as they inherit directly from the
4855 base virtual function and also require validation of new attributes. */
4857 {
4858 tree vchain;
4861 {
4866 }
4867 }
4869 /* If the class doesn't have an attribute, nothing more to do. */
4874 /* Any method that does not yet have a tm attribute inherits
4875 the one from the class. */
4880 }
4882 /* Returns true if FN is a default constructor. */
4884 bool
4886 {
4889 }
4891 /* Returns true iff class T has a user-provided constructor that can be called
4892 with more than zero arguments. */
4894 bool
4896 {
4901 {
4908 }
4911 }
4913 /* Returns the defaulted constructor if T has one. Otherwise, returns
4914 NULL_TREE. */
4916 tree
4918 {
4923 {
4929 }
4932 }
4934 /* Returns true iff FN is a user-provided function, i.e. user-declared
4935 and not defaulted at its first declaration. */
4937 bool
4939 {
4942 else
4946 }
4948 /* Returns true iff class T has a user-provided constructor. */
4950 bool
4952 {
4964 }
4966 /* Returns true iff class T has a user-provided or explicit constructor. */
4968 bool
4970 {
4978 {
4982 }
4985 }
4987 /* Returns true iff class T has a non-user-provided (i.e. implicitly
4988 declared or explicitly defaulted in the class body) default
4989 constructor. */
4991 bool
4993 {
5000 {
5006 }
5009 }
5011 /* TYPE is being used as a virtual base, and has a non-trivial move
5012 assignment. Return true if this is due to there being a user-provided
5013 move assignment in TYPE or one of its subobjects; if there isn't, then
5014 multiple move assignment can't cause any harm. */
5016 bool
5018 {
5019 /* Does the type itself have a user-provided move assignment operator? */
5027 /* Do any of its bases? */
5029 tree base_binfo;
5034 /* Or non-static data members? */
5036 {
5041 }
5043 /* Seems not. */
5045 }
5047 /* If default-initialization leaves part of TYPE uninitialized, returns
5048 a DECL for the field or TYPE itself (DR 253). */
5050 tree
5052 {
5063 {
5067 }
5072 {
5076 }
5079 }
5081 /* Returns true iff for class T, a trivial synthesized default constructor
5082 would be constexpr. */
5084 bool
5086 {
5087 /* A defaulted trivial default constructor is constexpr
5088 if there is nothing to initialize. */
5091 }
5093 /* Returns true iff class T has a constexpr default constructor. */
5095 bool
5097 {
5098 tree fns;
5101 {
5102 /* The caller should have stripped an enclosing array. */
5105 }
5107 {
5110 /* Non-trivial, we need to check subobject constructors. */
5112 }
5115 }
5117 /* Returns true iff class T has a constexpr default constructor or has an
5118 implicitly declared default constructor that we can't tell if it's constexpr
5119 without forcing a lazy declaration (which might cause undesired
5120 instantiations). */
5122 bool
5124 {
5127 /* Assume it's constexpr. */
5130 }
5132 /* Returns true iff class TYPE has a virtual destructor. */
5134 bool
5136 {
5137 tree dtor;
5145 }
5147 /* Returns true iff T, a class, has a move-assignment or
5148 move-constructor. Does not lazily declare either.
5149 If USER_P is false, any move function will do. If it is true, the
5150 move function must be user-declared.
5152 Note that user-declared here is different from "user-provided",
5153 which doesn't include functions that are defaulted in the
5154 class. */
5156 bool
5158 {
5176 }
5178 /* True iff T has a move constructor that is not deleted. */
5180 bool
5182 {
5189 }
5191 /* If T, a class, has a user-provided copy constructor, copy assignment
5192 operator, or destructor, returns that function. Otherwise, null. */
5194 tree
5196 {
5199 {
5203 }
5209 {
5213 }
5216 {
5220 }
5223 }
5225 /* Nonzero if we need to build up a constructor call when initializing an
5226 object of this class, either because it has a user-declared constructor
5227 or because it doesn't have a default constructor (so we need to give an
5228 error if no initializer is provided). Use TYPE_NEEDS_CONSTRUCTING when
5229 what you care about is whether or not an object can be produced by a
5230 constructor (e.g. so we don't set TREE_READONLY on const variables of
5231 such type); use this function when what you care about is whether or not
5232 to try to call a constructor to create an object. The latter case is
5233 the former plus some cases of constructors that cannot be called. */
5235 bool
5237 {
5238 tree inner;
5248 /* A user-declared constructor might be private, and a constructor might
5249 be trivial but deleted. */
5252 {
5258 }
5260 }
5262 /* Like type_build_ctor_call, but for destructors. */
5264 bool
5266 {
5267 tree inner;
5276 /* A user-declared destructor might be private, and a destructor might
5277 be trivial but deleted. */
5280 {
5286 }
5288 }
5290 /* Remove all zero-width bit-fields from T. */
5292 static void
5294 {
5299 {
5302 /* We should not be confused by the fact that grokbitfield
5303 temporarily sets the width of the bit field into
5304 DECL_BIT_FIELD_REPRESENTATIVE (*fieldsp).
5305 check_bitfield_decl eventually sets DECL_SIZE (*fieldsp)
5306 to that width. */
5310 else
5312 }
5313 }
5315 /* Returns TRUE iff we need a cookie when dynamically allocating an
5316 array whose elements have the indicated class TYPE. */
5318 static bool
5320 {
5321 tree fns;
5326 /* If there's a non-trivial destructor, we need a cookie. In order
5327 to iterate through the array calling the destructor for each
5328 element, we'll have to know how many elements there are. */
5332 /* If the usual deallocation function is a two-argument whose second
5333 argument is of type `size_t', then we have to pass the size of
5334 the array to the deallocation function, so we will need to store
5335 a cookie. */
5339 /* If there are no `operator []' members, or the lookup is
5340 ambiguous, then we don't need a cookie. */
5343 /* Loop through all of the functions. */
5345 {
5348 /* See if this function is a one-argument delete function. If
5349 it is, then it will be the usual deallocation function. */
5353 /* Do not consider this function if its second argument is an
5354 ellipsis. */
5357 /* Otherwise, if we have a two-argument function and the second
5358 argument is `size_t', it will be the usual deallocation
5359 function -- unless there is one-argument function, too. */
5363 }
5366 }
5368 /* Finish computing the `literal type' property of class type T.
5370 At this point, we have already processed base classes and
5371 non-static data members. We need to check whether the copy
5372 constructor is trivial, the destructor is trivial, and there
5373 is a trivial default constructor or at least one constexpr
5374 constructor other than the copy constructor. */
5376 static void
5378 {
5379 tree fn;
5391 /* C++14 DR 1684 removed this restriction. */
5399 {
5403 "enclosing class of %<constexpr%> non-static member "
5406 }
5407 }
5409 /* T is a non-literal type used in a context which requires a constant
5410 expression. Explain why it isn't literal. */
5412 void
5414 {
5424 /* Already explained. */
5430 " %qT is a closure type, which is only literal in "
5438 {
5440 " %q+T is not an aggregate, does not have a trivial "
5441 "default constructor, and has no %<constexpr%> constructor that "
5444 /* Note that we can't simply call locate_ctor because when the
5445 constructor is deleted it just returns NULL_TREE. */
5447 {
5454 {
5457 else
5460 }
5461 }
5462 }
5463 else
5464 {
5468 {
5471 {
5477 }
5478 }
5480 {
5481 tree ftype;
5486 {
5489 field);
5492 }
5496 }
5497 }
5498 }
5500 /* Check the validity of the bases and members declared in T. Add any
5501 implicitly-generated functions (like copy-constructors and
5502 assignment operators). Compute various flag bits (like
5503 CLASSTYPE_NON_LAYOUT_POD_T) for T. This routine works purely at the C++
5504 level: i.e., independently of the ABI in use. */
5506 static void
5508 {
5509 /* Nonzero if the implicitly generated copy constructor should take
5510 a non-const reference argument. */
5512 /* Nonzero if the implicitly generated assignment operator
5513 should take a non-const reference argument. */
5515 tree access_decls;
5518 tree fn;
5520 /* By default, we use const reference arguments and generate default
5521 constructors. */
5525 /* Check all the base-classes and set FMEM members to point to arrays
5526 of potential interest. */
5529 /* Deduce noexcept on destructor. This needs to happen after we've set
5530 triviality flags appropriately for our bases. */
5535 /* Check all the method declarations. */
5538 /* Save the initial values of these flags which only indicate whether
5539 or not the class has user-provided functions. As we analyze the
5540 bases and members we can set these flags for other reasons. */
5544 /* Check all the data member declarations. We cannot call
5545 check_field_decls until we have called check_bases check_methods,
5546 as check_field_decls depends on TYPE_HAS_NONTRIVIAL_DESTRUCTOR
5547 being set appropriately. */
5552 /* A nearly-empty class has to be vptr-containing; a nearly empty
5553 class contains just a vptr. */
5557 /* Do some bookkeeping that will guide the generation of implicitly
5558 declared member functions. */
5561 /* We need to call a constructor for this class if it has a
5562 user-provided constructor, or if the default constructor is going
5563 to initialize the vptr. (This is not an if-and-only-if;
5564 TYPE_NEEDS_CONSTRUCTING is set elsewhere if bases or members
5565 themselves need constructing.) */
5568 /* [dcl.init.aggr]
5570 An aggregate is an array or a class with no user-provided
5571 constructors ... and no virtual functions.
5573 Again, other conditions for being an aggregate are checked
5574 elsewhere. */
5578 /* This is the C++98/03 definition of POD; it changed in C++0x, but we
5579 retain the old definition internally for ABI reasons. */
5588 /* If the only explicitly declared default constructor is user-provided,
5589 set TYPE_HAS_COMPLEX_DFLT. */
5595 /* Warn if a public base of a polymorphic type has an accessible
5596 non-virtual destructor. It is only now that we know the class is
5597 polymorphic. Although a polymorphic base will have a already
5598 been diagnosed during its definition, we warn on use too. */
5600 {
5603 tree base_binfo;
5607 {
5615 basetype);
5616 }
5617 }
5619 /* If the class has no user-declared constructor, but does have
5620 non-static const or reference data members that can never be
5621 initialized, issue a warning. */
5623 /* Classes with user-declared constructors are presumed to
5624 initialize these members. */
5626 /* Aggregates can be initialized with brace-enclosed
5627 initializers. */
5629 {
5630 tree field;
5633 {
5634 tree type;
5651 }
5652 }
5654 /* Synthesize any needed methods. */
5656 cant_have_const_ctor,
5657 no_const_asn_ref);
5659 /* Check defaulted declarations here so we have cant_have_const_ctor
5660 and don't need to worry about clones. */
5665 {
5668 {
5669 bool imp_const_p
5675 /* If the function is defaulted outside the class, we just
5676 give the synthesis error. Core Issue #1331 says this is
5677 no longer ill-formed, it is defined as deleted instead. */
5679 }
5681 }
5684 {
5685 /* "This class type is not an aggregate." */
5687 }
5689 /* Compute the 'literal type' property before we
5690 do anything with non-static member functions. */
5693 /* Create the in-charge and not-in-charge variants of constructors
5694 and destructors. */
5697 /* Process the using-declarations. */
5701 /* Figure out whether or not we will need a cookie when dynamically
5702 allocating an array of this type. */
5705 }
5707 /* If T needs a pointer to its virtual function table, set TYPE_VFIELD
5708 accordingly. If a new vfield was created (because T doesn't have a
5709 primary base class), then the newly created field is returned. It
5710 is not added to the TYPE_FIELDS list; it is the caller's
5711 responsibility to do that. Accumulate declared virtual functions
5712 on VIRTUALS_P. */
5714 static tree
5716 {
5717 tree fn;
5719 /* Collect the virtual functions declared in T. */
5724 {
5733 }
5735 /* If we couldn't find an appropriate base class, create a new field
5736 here. Even if there weren't any new virtual functions, we might need a
5737 new virtual function table if we're supposed to include vptrs in
5738 all classes that need them. */
5740 {
5741 /* We build this decl with vtbl_ptr_type_node, which is a
5742 `vtable_entry_type*'. It might seem more precise to use
5743 `vtable_entry_type (*)[N]' where N is the number of virtual
5744 functions. However, that would require the vtable pointer in
5745 base classes to have a different type than the vtable pointer
5746 in derived classes. We could make that happen, but that
5747 still wouldn't solve all the problems. In particular, the
5748 type-based alias analysis code would decide that assignments
5749 to the base class vtable pointer can't alias assignments to
5750 the derived class vtable pointer, since they have different
5751 types. Thus, in a derived class destructor, where the base
5752 class constructor was inlined, we could generate bad code for
5753 setting up the vtable pointer.
5755 Therefore, we use one type for all vtable pointers. We still
5756 use a type-correct type; it's just doesn't indicate the array
5757 bounds. That's better than using `void*' or some such; it's
5758 cleaner, and it let's the alias analysis code know that these
5759 stores cannot alias stores to void*! */
5760 tree field;
5773 /* This class is non-empty. */
5777 }
5780 }
5782 /* Add OFFSET to all base types of BINFO which is a base in the
5783 hierarchy dominated by T.
5785 OFFSET, which is a type offset, is number of bytes. */
5787 static void
5789 {
5791 tree primary_binfo;
5792 tree base_binfo;
5794 /* Update BINFO's offset. */
5799 offset));
5801 /* Find the primary base class. */
5807 /* Scan all of the bases, pushing the BINFO_OFFSET adjust
5808 downwards. */
5810 {
5811 /* Don't do the primary base twice. */
5819 }
5820 }
5822 /* Set BINFO_OFFSET for all of the virtual bases for RLI->T. Update
5823 TYPE_ALIGN and TYPE_SIZE for T. OFFSETS gives the location of
5824 empty subobjects of T. */
5826 static void
5828 {
5829 tree vbase;
5836 /* Find the last field. The artificial fields created for virtual
5837 bases will go after the last extant field to date. */
5842 /* Go through the virtual bases, allocating space for each virtual
5843 base that is not already a primary base class. These are
5844 allocated in inheritance graph order. */
5846 {
5851 {
5852 /* This virtual base is not a primary base of any class in the
5853 hierarchy, so we have to add space for it. */
5856 }
5857 }
5858 }
5860 /* Returns the offset of the byte just past the end of the base class
5861 BINFO. */
5863 static tree
5865 {
5866 tree size;
5871 /* An empty class has zero CLASSTYPE_SIZE_UNIT, but we need to
5872 allocate some space for it. It cannot have virtual bases, so
5873 TYPE_SIZE_UNIT is fine. */
5875 else
5879 }
5881 /* Returns the offset of the byte just past the end of the base class
5882 with the highest offset in T. If INCLUDE_VIRTUALS_P is zero, then
5883 only non-virtual bases are included. */
5885 static tree
5887 {
5890 tree binfo;
5891 tree base_binfo;
5892 tree offset;
5897 {
5907 }
5912 {
5916 }
5919 }
5921 /* Warn about bases of T that are inaccessible because they are
5922 ambiguous. For example:
5924 struct S {};
5925 struct T : public S {};
5926 struct U : public S, public T {};
5928 Here, `(S*) new U' is not allowed because there are two `S'
5929 subobjects of U. */
5931 static void
5933 {
5936 tree basetype;
5937 tree binfo;
5938 tree base_binfo;
5940 /* If there are no repeated bases, nothing can be ambiguous. */
5944 /* Check direct bases. */
5947 {
5953 }
5955 /* Check for ambiguous virtual bases. */
5959 {
5965 }
5966 }
5968 /* Compare two INTEGER_CSTs K1 and K2. */
5970 static int
5972 {
5974 }
5976 /* Increase the size indicated in RLI to account for empty classes
5977 that are "off the end" of the class. */
5979 static void
5981 {
5982 tree eoc;
5983 tree rli_size;
5985 /* It might be the case that we grew the class to allocate a
5986 zero-sized base class. That won't be reflected in RLI, yet,
5987 because we are willing to overlay multiple bases at the same
5988 offset. However, now we need to make sure that RLI is big enough
5989 to reflect the entire class. */
5994 {
5995 /* The size should have been rounded to a whole byte. */
5998 rli->bitpos
6007 }
6008 }
6010 /* Calculate the TYPE_SIZE, TYPE_ALIGN, etc for T. Calculate
6011 BINFO_OFFSETs for all of the base-classes. Position the vtable
6012 pointer. Accumulate declared virtual functions on VIRTUALS_P. */
6014 static void
6016 {
6017 tree non_static_data_members;
6018 tree field;
6019 tree vptr;
6020 record_layout_info rli;
6021 /* Maps offsets (represented as INTEGER_CSTs) to a TREE_LIST of
6022 types that appear at that offset. */
6023 splay_tree empty_base_offsets;
6024 /* True if the last field laid out was a bit-field. */
6026 /* The location at which the next field should be inserted. */
6029 /* Keep track of the first non-static data member. */
6032 /* Start laying out the record. */
6035 /* Mark all the primary bases in the hierarchy. */
6038 /* Create a pointer to our virtual function table. */
6041 /* The vptr is always the first thing in the class. */
6043 {
6048 }
6049 else
6052 /* Build FIELD_DECLs for all of the non-virtual base-types. */
6057 /* Layout the non-static data members. */
6059 {
6060 tree type;
6061 tree padding;
6063 /* We still pass things that aren't non-static data members to
6064 the back end, in case it wants to do something with them. */
6066 {
6068 /* If the static data member has incomplete type, keep track
6069 of it so that it can be completed later. (The handling
6070 of pending statics in finish_record_layout is
6071 insufficient; consider:
6073 struct S1;
6074 struct S2 { static S1 s1; };
6076 At this point, finish_record_layout will be called, but
6077 S1 is still incomplete.) */
6079 {
6081 /* The visibility of static data members is determined
6082 at their point of declaration, not their point of
6083 definition. */
6085 }
6087 }
6095 /* If this field is a bit-field whose width is greater than its
6096 type, then there are some special rules for allocating
6097 it. */
6100 {
6102 /* We must allocate the bits as if suitably aligned for the
6103 longest integer type that fits in this many bits. Then,
6104 we are supposed to use the left over bits as additional
6105 padding. */
6107 /* Do not pick a type bigger than MAX_FIXED_MODE_SIZE. */
6115 {
6117 /* Too big, so our current guess is what we want. */
6119 /* Not bigger than limit, ok */
6121 }
6123 /* Figure out how much additional padding is required. */
6125 /* In a union, the padding field must have the full width
6126 of the bit-field; all fields start at offset zero. */
6128 else
6135 /* An unnamed bitfield does not normally affect the
6136 alignment of the containing class on a target where
6137 PCC_BITFIELD_TYPE_MATTERS. But, the C++ ABI does not
6138 make any exceptions for unnamed bitfields when the
6139 bitfields are longer than their types. Therefore, we
6140 temporarily give the field a name. */
6142 {
6145 }
6151 empty_base_offsets);
6154 /* Now that layout has been performed, set the size of the
6155 field to the size of its declared type; the rest of the
6156 field is effectively invisible. */
6158 /* We must also reset the DECL_MODE of the field. */
6160 }
6161 else
6163 empty_base_offsets);
6165 /* Remember the location of any empty classes in FIELD. */
6168 empty_base_offsets,
6171 /* If a bit-field does not immediately follow another bit-field,
6172 and yet it starts in the middle of a byte, we have failed to
6173 comply with the ABI. */
6176 /* The TREE_NO_WARNING flag gets set by Objective-C when
6177 laying out an Objective-C class. The ObjC ABI differs
6178 from the C++ ABI, and so we do not want a warning
6179 here. */
6181 && !last_field_was_bitfield
6184 bitsize_unit_node)))
6186 "offset of %qD is not ABI-compliant and may "
6189 /* The middle end uses the type of expressions to determine the
6190 possible range of expression values. In order to optimize
6191 "x.i > 7" to "false" for a 2-bit bitfield "i", the middle end
6192 must be made aware of the width of "i", via its type.
6194 Because C++ does not have integer types of arbitrary width,
6195 we must (for the purposes of the front end) convert from the
6196 type assigned here to the declared type of the bitfield
6197 whenever a bitfield expression is used as an rvalue.
6198 Similarly, when assigning a value to a bitfield, the value
6199 must be converted to the type given the bitfield here. */
6201 {
6206 {
6213 }
6214 }
6216 /* If we needed additional padding after this field, add it
6217 now. */
6219 {
6220 tree padding_field;
6223 FIELD_DECL,
6224 NULL_TREE,
6225 char_type_node);
6233 NULL_TREE,
6234 empty_base_offsets);
6235 }
6238 }
6241 {
6242 /* Make sure that we are on a byte boundary so that the size of
6243 the class without virtual bases will always be a round number
6244 of bytes. */
6247 }
6249 /* Delete all zero-width bit-fields from the list of fields. Now
6250 that the type is laid out they are no longer important. */
6254 {
6255 /* T needs a different layout as a base (eliding virtual bases
6256 or whatever). Create that version. */
6259 /* If the ABI version is not at least two, and the last
6260 field was a bit-field, RLI may not be on a byte
6261 boundary. In particular, rli_size_unit_so_far might
6262 indicate the last complete byte, while rli_size_so_far
6263 indicates the total number of bits used. Therefore,
6264 rli_size_so_far, rather than rli_size_unit_so_far, is
6265 used to compute TYPE_SIZE_UNIT. */
6273 eoc);
6283 /* Copy the non-static data members of T. This will include its
6284 direct non-virtual bases & vtable. */
6288 {
6292 }
6295 /* We use the base type for trivial assignments, and hence it
6296 needs a mode. */
6301 /* Record the base version of the type. */
6303 }
6304 else
6307 /* Every empty class contains an empty class. */
6311 /* Set the TYPE_DECL for this type to contain the right
6312 value for DECL_OFFSET, so that we can use it as part
6313 of a COMPONENT_REF for multiple inheritance. */
6316 /* Now fix up any virtual base class types that we left lying
6317 around. We must get these done before we try to lay out the
6318 virtual function table. As a side-effect, this will remove the
6319 base subobject fields. */
6322 /* Make sure that empty classes are reflected in RLI at this
6323 point. */
6326 /* Make sure not to create any structures with zero size. */
6332 /* If this is a non-POD, declaring it packed makes a difference to how it
6333 can be used as a field; don't let finalize_record_size undo it. */
6337 /* Let the back end lay out the type. */
6346 /* Warn about bases that can't be talked about due to ambiguity. */
6349 /* Now that we're done with layout, give the base fields the real types. */
6354 /* Clean up. */
6361 }
6363 /* Determine the "key method" for the class type indicated by TYPE,
6364 and set CLASSTYPE_KEY_METHOD accordingly. */
6366 void
6368 {
6369 tree method;
6376 /* The key method is the first non-pure virtual function that is not
6377 inline at the point of class definition. On some targets the
6378 key function may not be inline; those targets should not call
6379 this function until the end of the translation unit. */
6385 {
6388 }
6391 }
6393 /* Helper of find_flexarrays. Return true when FLD refers to a non-static
6394 class data member of non-zero size, otherwise false. */
6398 {
6406 {
6410 }
6413 }
6415 /* Used by find_flexarrays and related functions. */
6417 struct flexmems_t
6418 {
6419 /* The first flexible array member or non-zero array member found
6420 in the order of layout. */
6421 tree array;
6422 /* First non-static non-empty data member in the class or its bases. */
6423 tree first;
6424 /* The first non-static non-empty data member following either
6425 the flexible array member, if found, or the zero-length array member
6426 otherwise. AFTER[1] refers to the first such data member of a union
6427 of which the struct containing the flexible array member or zero-length
6428 array is a member, or NULL when no such union exists. This element is
6429 only used during searching, not for diagnosing problems. AFTER[0]
6430 refers to the first such data member that is not a member of such
6431 a union. */
6434 /* Refers to a struct (not union) in which the struct of which the flexible
6435 array is member is defined. Used to diagnose strictly (according to C)
6436 invalid uses of the latter structs. */
6437 tree enclosing;
6438 };
6440 /* Find either the first flexible array member or the first zero-length
6441 array, in that order of preference, among members of class T (but not
6442 its base classes), and set members of FMEM accordingly.
6443 BASE_P is true if T is a base class of another class.
6444 PUN is set to the outermost union in which the flexible array member
6445 (or zero-length array) is defined if one such union exists, otherwise
6446 to NULL.
6447 Similarly, PSTR is set to a data member of the outermost struct of
6448 which the flexible array is a member if one such struct exists,
6449 otherwise to NULL. */
6451 static void
6455 {
6456 /* Set the "pointer" to the outermost enclosing union if not set
6457 yet and maintain it for the remainder of the recursion. */
6462 {
6466 /* Is FLD a typedef for an anonymous struct? */
6468 /* FIXME: Note that typedefs (as well as arrays) need to be fully
6469 handled elsewhere so that errors like the following are detected
6470 as well:
6471 typedef struct { int i, a[], j; } S; // bug c++/72753
6472 S s [2]; // bug c++/68489
6473 */
6478 {
6479 /* Check the nested unnamed type referenced via a typedef
6480 independently of FMEM (since it's not a data member of
6481 the enclosing class). */
6484 }
6486 /* Skip anything that's GCC-generated or not a (non-static) data
6487 member. */
6491 /* Type of the member. */
6496 /* Determine the type of the array element or object referenced
6497 by the member so that it can be checked for flexible array
6498 members if it hasn't been yet. */
6505 {
6507 {
6508 /* Once the member after the flexible array has been found
6509 we're done. */
6512 }
6515 {
6516 /* Descend into the non-static member struct or union and try
6517 to find a flexible array member or zero-length array among
6518 its members. This is only necessary for anonymous types
6519 and types in whose context the current type T has not been
6520 defined (the latter must not be checked again because they
6521 are already in the process of being checked by one of the
6522 recursive calls). */
6527 /* If this member isn't anonymous and a prior non-flexible array
6528 member has been seen in one of the enclosing structs, clear
6529 the FIRST member since it doesn't contribute to the flexible
6530 array struct's members. */
6541 {
6542 /* Restore the FIRST member reset above if no flexible
6543 array member has been found in this member's struct. */
6545 }
6547 /* If the member struct contains the first flexible array
6548 member, or if this member is a base class, continue to
6549 the next member and avoid setting the FMEM->NEXT pointer
6550 to point to it. */
6553 }
6554 }
6557 {
6558 /* Remember the first non-static data member. */
6562 /* Remember the first non-static data member after the flexible
6563 array member, if one has been found, or the zero-length array
6564 if it has been found. */
6567 }
6569 /* Skip non-arrays. */
6573 /* Determine the upper bound of the array if it has one. */
6575 {
6577 {
6578 /* Make a record of the zero-length array if either one
6579 such field or a flexible array member has been seen to
6580 handle the pathological and unlikely case of multiple
6581 such members. */
6584 }
6586 {
6587 /* Remember the first zero-length array unless a flexible array
6588 member has already been seen. */
6591 }
6592 }
6593 else
6594 {
6595 /* Flexible array members have no upper bound. */
6597 {
6599 {
6600 /* Replace the zero-length array if it's been stored and
6601 reset the after pointer. */
6605 }
6607 /* Make a record of another flexible array member. */
6609 }
6610 else
6611 {
6614 }
6615 }
6616 }
6617 }
6619 /* Diagnose a strictly (by the C standard) invalid use of a struct with
6620 a flexible array member (or the zero-length array extension). */
6622 static void
6624 {
6636 }
6638 /* Issue diagnostics for invalid flexible array members or zero-length
6639 arrays that are not the last elements of the containing class or its
6640 base classes or that are its sole members. */
6642 static void
6644 {
6649 {
6652 }
6654 /* Has a diagnostic been issued? */
6660 {
6667 {
6671 {
6674 }
6675 }
6676 }
6677 else
6678 {
6685 {
6691 /* In the unlikely event that the member following the flexible
6692 array member is declared in a different class, or the member
6693 overlaps another member of a common union, point to it.
6694 Otherwise it should be obvious. */
6698 {
6703 }
6704 }
6705 }
6709 }
6712 /* Recursively check to make sure that any flexible array or zero-length
6713 array members of class T or its bases are valid (i.e., not the sole
6714 non-static data member of T and, if one exists, that it is the last
6715 non-static data member of T and its base classes. FMEM is expected
6716 to be initially null and is used internally by recursive calls to
6717 the function. Issue the appropriate diagnostics for the array member
6718 that fails the checks. */
6720 static void
6723 {
6724 /* Initialize the result of a search for flexible array and zero-length
6725 array members. Avoid doing any work if the most interesting FMEM data
6726 have already been populated. */
6735 /* Recursively check the primary base class first. */
6737 {
6740 }
6742 /* Recursively check the base classes. */
6745 {
6748 /* The primary base class was already checked above. */
6752 /* Virtual base classes are at the end. */
6756 /* Check the base class. */
6758 }
6761 {
6762 /* Check virtual base classes only once per derived class.
6763 I.e., this check is not performed recursively for base
6764 classes. */
6766 tree base_binfo;
6770 {
6771 /* Check the virtual base class. */
6775 }
6776 }
6778 /* Is the type unnamed (and therefore a member of it potentially
6779 an anonymous struct or union)? */
6782 /* Search the members of the current (possibly derived) class, skipping
6783 unnamed structs and unions since those could be anonymous. */
6788 {
6789 /* Issue diagnostics for invalid flexible and zero-length array
6790 members found in base classes or among the members of the current
6791 class. Ignore anonymous structs and unions whose members are
6792 considered to be members of the enclosing class and thus will
6793 be diagnosed when checking it. */
6795 }
6796 }
6798 /* Perform processing required when the definition of T (a class type)
6799 is complete. Diagnose invalid definitions of flexible array members
6800 and zero-size arrays. */
6802 void
6804 {
6805 tree x;
6806 /* A TREE_LIST. The TREE_VALUE of each node is a FUNCTION_DECL. */
6810 {
6815 }
6817 /* If this type was previously laid out as a forward reference,
6818 make sure we lay it out again. */
6822 /* Make assumptions about the class; we'll reset the flags if
6823 necessary. */
6829 /* Do end-of-class semantic processing: checking the validity of the
6830 bases and members and add implicitly generated methods. */
6833 /* Find the key method. */
6835 {
6836 /* The Itanium C++ ABI permits the key method to be chosen when
6837 the class is defined -- even though the key method so
6838 selected may later turn out to be an inline function. On
6839 some systems (such as ARM Symbian OS) the key method cannot
6840 be determined until the end of the translation unit. On such
6841 systems, we leave CLASSTYPE_KEY_METHOD set to NULL, which
6842 will cause the class to be added to KEYED_CLASSES. Then, in
6843 finish_file we will determine the key method. */
6847 /* If a polymorphic class has no key method, we may emit the vtable
6848 in every translation unit where the class definition appears. If
6849 we're devirtualizing, we can look into the vtable even if we
6850 aren't emitting it. */
6853 }
6855 /* Layout the class itself. */
6857 /* COMPLETE_TYPE_P is now true. */
6861 /* With the layout complete, check for flexible array members and
6862 zero-length arrays that might overlap other members in the final
6863 layout. */
6868 /* If necessary, create the primary vtable for this class. */
6870 {
6871 /* We must enter these virtuals into the table. */
6875 /* Here we know enough to change the type of our virtual
6876 function table, but we will wait until later this function. */
6879 /* If we're warning about ABI tags, check the types of the new
6880 virtual functions. */
6884 }
6887 {
6889 tree fn;
6896 /* Add entries for virtual functions introduced by this class. */
6900 /* Set DECL_VINDEX for all functions declared in this class. */
6902 fn;
6904 vindex += (TARGET_VTABLE_USES_DESCRIPTORS
6906 {
6910 /* A thunk. We should never be calling this entry directly
6911 from this vtable -- we'd use the entry for the non
6912 thunk base function. */
6916 }
6917 }
6925 /* Clear DECL_IN_AGGR_P for all member functions. Complete the rtl
6926 for any static member objects of the type we're working on. */
6935 /* Complain if one of the field types requires lower visibility. */
6938 /* Make the rtl for any new vtables we have created, and unmark
6939 the base types we marked. */
6942 /* Build the VTT for T. */
6949 "%q#T has virtual functions and accessible"
6957 /* Class layout, assignment of virtual table slots, etc., is now
6958 complete. Give the back end a chance to tweak the visibility of
6959 the class or perform any other required target modifications. */
6969 /* Finish debugging output for this type. */
6973 {
6976 {
6979 }
6981 {
6984 else
6985 {
6988 }
6990 }
6992 {
6994 "the type of the first field has a different ABI from the "
6997 }
6998 }
6999 }
7001 /* When T was built up, the member declarations were added in reverse
7002 order. Rearrange them to declaration order. */
7004 void
7006 {
7007 tree next;
7008 tree prev;
7009 tree x;
7011 /* The following lists are all in reverse order. Put them in
7012 declaration order now. */
7015 /* For the TYPE_FIELDS, only the non TYPE_DECLs are in reverse
7016 order, so we can't just use nreverse. Due to stat_hack
7017 chicanery in finish_member_declaration. */
7022 {
7026 }
7029 {
7032 }
7033 }
7035 tree
7037 {
7040 /* Now that we've got all the field declarations, reverse everything
7041 as necessary. */
7047 /* Nadger the current location so that diagnostics point to the start of
7048 the struct, not the end. */
7052 {
7053 tree x;
7055 /* We need to add the target functions of USING_DECLS, so that
7056 they can be found when the using declaration is not
7057 instantiated yet. */
7060 {
7065 }
7071 /* COMPLETE_TYPE_P is now true. */
7075 /* We need to emit an error message if this type was used as a parameter
7076 and it is an abstract type, even if it is a template. We construct
7077 a simple CLASSTYPE_PURE_VIRTUALS list without taking bases into
7078 account and we call complete_vars with this type, which will check
7079 the PARM_DECLS. Note that while the type is being defined,
7080 CLASSTYPE_PURE_VIRTUALS contains the list of the inline friends
7081 (see CLASSTYPE_INLINE_FRIENDS) so we need to clear it. */
7088 /* Remember current #pragma pack value. */
7091 /* Fix up any variants we've already built. */
7093 {
7097 }
7098 }
7099 else
7101 /* COMPLETE_TYPE_P is now true. */
7106 {
7107 /* People keep complaining that the compiler crashes on an invalid
7108 definition of initializer_list, so I guess we should explicitly
7109 reject it. What the compiler internals care about is that it's a
7110 template and has a pointer field followed by size_type field. */
7113 {
7116 {
7120 }
7121 }
7125 }
7133 else
7137 /* Lambdas are defined by the LAMBDA_EXPR. */
7142 }
7143 \f
7144 /* Hash table to avoid endless recursion when handling references. */
7147 /* Return the dynamic type of INSTANCE, if known.
7148 Used to determine whether the virtual function table is needed
7149 or not.
7151 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
7152 of our knowledge of its type. *NONNULL should be initialized
7153 before this function is called. */
7155 static tree
7157 {
7158 #define RECUR(T) fixed_type_or_null((T), nonnull, cdtorp)
7161 {
7165 else
7169 /* This is a call to a constructor, hence it's never zero. */
7172 {
7176 }
7180 /* This is a call to a constructor, hence it's never zero. */
7182 {
7186 }
7195 /* Propagate nonnull. */
7200 CASE_CONVERT:
7206 {
7207 /* Just because we see an ADDR_EXPR doesn't mean we're dealing
7208 with a real object -- given &p->f, p can still be null. */
7210 /* ??? Probably should check DECL_WEAK here. */
7213 }
7217 /* If this component is really a base class reference, then the field
7218 itself isn't definitive. */
7227 {
7231 }
7232 /* fall through. */
7237 {
7241 }
7243 {
7247 /* if we're in a ctor or dtor, we know our type. If
7248 current_class_ptr is set but we aren't in a function, we're in
7249 an NSDMI (and therefore a constructor). */
7254 {
7258 }
7259 }
7261 {
7262 /* We only need one hash table because it is always left empty. */
7264 fixed_type_or_null_ref_ht
7267 /* Reference variables should be references to objects. */
7271 /* Enter the INSTANCE in a table to prevent recursion; a
7272 variable's initializer may refer to the variable
7273 itself. */
7278 {
7279 tree type;
7288 }
7289 }
7294 }
7295 #undef RECUR
7296 }
7298 /* Return nonzero if the dynamic type of INSTANCE is known, and
7299 equivalent to the static type. We also handle the case where
7300 INSTANCE is really a pointer. Return negative if this is a
7301 ctor/dtor. There the dynamic type is known, but this might not be
7302 the most derived base of the original object, and hence virtual
7303 bases may not be laid out according to this type.
7305 Used to determine whether the virtual function table is needed
7306 or not.
7308 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
7309 of our knowledge of its type. *NONNULL should be initialized
7310 before this function is called. */
7312 int
7314 {
7317 tree fixed;
7319 /* processing_template_decl can be false in a template if we're in
7320 instantiate_non_dependent_expr, but we still want to suppress
7321 this check. */
7323 {
7324 /* In a template we only care about the type of the result. */
7328 }
7338 }
7340 \f
7341 void
7343 {
7346 current_class_stack
7354 }
7356 /* Restore the cached PREVIOUS_CLASS_LEVEL. */
7358 static void
7360 {
7361 tree type;
7363 /* We are re-entering the same class we just left, so we don't
7364 have to search the whole inheritance matrix to find all the
7365 decls to bind again. Instead, we install the cached
7366 class_shadowed list and walk through it binding names. */
7369 /* Restore IDENTIFIER_TYPE_VALUE. */
7371 type;
7374 }
7376 /* Set global variables CURRENT_CLASS_NAME and CURRENT_CLASS_TYPE as
7377 appropriate for TYPE.
7379 So that we may avoid calls to lookup_name, we cache the _TYPE
7380 nodes of local TYPE_DECLs in the TREE_TYPE field of the name.
7382 For multiple inheritance, we perform a two-pass depth-first search
7383 of the type lattice. */
7385 void
7387 {
7388 class_stack_node_t csn;
7392 /* Make sure there is enough room for the new entry on the stack. */
7394 {
7396 current_class_stack
7398 current_class_stack_size);
7399 }
7401 /* Insert a new entry on the class stack. */
7408 current_class_depth++;
7410 /* Now set up the new type. */
7416 /* By default, things in classes are private, while things in
7417 structures or unions are public. */
7419 ? access_private_node
7425 {
7426 /* Forcibly remove any old class remnants. */
7428 }
7434 else
7436 }
7438 /* When we exit a toplevel class scope, we save its binding level so
7439 that we can restore it quickly. Here, we've entered some other
7440 class, so we must invalidate our cache. */
7442 void
7444 {
7446 }
7448 /* Get out of the current class scope. If we were in a class scope
7449 previously, that is the one popped to. */
7451 void
7453 {
7456 current_class_depth--;
7462 }
7464 /* Mark the top of the class stack as hidden. */
7466 void
7468 {
7471 }
7473 /* Mark the top of the class stack as un-hidden. */
7475 void
7477 {
7480 }
7482 /* If the class type currently being defined is either T or
7483 a nested type of T, returns the type from the current_class_stack,
7484 which might be equivalent to but not equal to T in case of
7485 constrained partial specializations. */
7487 tree
7489 {
7497 /* We start looking from 1 because entry 0 is from global scope,
7498 and has no type. */
7500 {
7501 tree c;
7504 else
7505 {
7509 }
7514 }
7516 }
7518 /* If either current_class_type or one of its enclosing classes are derived
7519 from T, return the appropriate type. Used to determine how we found
7520 something via unqualified lookup. */
7522 tree
7524 {
7527 /* The bases of a dependent type are unknown. */
7538 {
7543 }
7546 }
7548 /* Return the outermost enclosing class type that is still open, or
7549 NULL_TREE. */
7551 tree
7553 {
7560 {
7567 }
7569 }
7571 /* Returns the innermost class type which is not a lambda closure type. */
7573 tree
7575 {
7580 }
7582 /* When entering a class scope, all enclosing class scopes' names with
7583 static meaning (static variables, static functions, types and
7584 enumerators) have to be visible. This recursive function calls
7585 pushclass for all enclosing class contexts until global or a local
7586 scope is reached. TYPE is the enclosed class. */
7588 void
7590 {
7591 /* A namespace might be passed in error cases, like A::B:C. */
7599 }
7601 /* Undoes a push_nested_class call. */
7603 void
7605 {
7611 }
7613 /* Returns the number of extern "LANG" blocks we are nested within. */
7615 int
7617 {
7619 }
7621 /* Set global variables CURRENT_LANG_NAME to appropriate value
7622 so that behavior of name-mangling machinery is correct. */
7624 void
7626 {
7633 else
7635 }
7637 /* Get out of the current language scope. */
7639 void
7641 {
7643 }
7644 \f
7645 /* Type instantiation routines. */
7647 /* Given an OVERLOAD and a TARGET_TYPE, return the function that
7648 matches the TARGET_TYPE. If there is no satisfactory match, return
7649 error_mark_node, and issue an error & warning messages under
7650 control of FLAGS. Permit pointers to member function if FLAGS
7651 permits. If TEMPLATE_ONLY, the name of the overloaded function was
7652 a template-id, and EXPLICIT_TARGS are the explicitly provided
7653 template arguments.
7655 If OVERLOAD is for one or more member functions, then ACCESS_PATH
7656 is the base path used to reference those member functions. If
7657 the address is resolved to a member function, access checks will be
7658 performed and errors issued if appropriate. */
7660 static tree
7662 tree overload,
7663 tsubst_flags_t complain,
7665 tree explicit_targs,
7666 tree access_path)
7667 {
7668 /* Here's what the standard says:
7670 [over.over]
7672 If the name is a function template, template argument deduction
7673 is done, and if the argument deduction succeeds, the deduced
7674 arguments are used to generate a single template function, which
7675 is added to the set of overloaded functions considered.
7677 Non-member functions and static member functions match targets of
7678 type "pointer-to-function" or "reference-to-function." Nonstatic
7679 member functions match targets of type "pointer-to-member
7680 function;" the function type of the pointer to member is used to
7681 select the member function from the set of overloaded member
7682 functions. If a nonstatic member function is selected, the
7683 reference to the overloaded function name is required to have the
7684 form of a pointer to member as described in 5.3.1.
7686 If more than one function is selected, any template functions in
7687 the set are eliminated if the set also contains a non-template
7688 function, and any given template function is eliminated if the
7689 set contains a second template function that is more specialized
7690 than the first according to the partial ordering rules 14.5.5.2.
7691 After such eliminations, if any, there shall remain exactly one
7692 selected function. */
7695 /* We store the matches in a TREE_LIST rooted here. The functions
7696 are the TREE_PURPOSE, not the TREE_VALUE, in this list, for easy
7697 interoperability with most_specialized_instantiation. */
7699 tree fn;
7700 tree target_fn_type;
7702 /* By the time we get here, we should be seeing only real
7703 pointer-to-member types, not the internal POINTER_TYPE to
7704 METHOD_TYPE representation. */
7710 /* Check that the TARGET_TYPE is reasonable. */
7715 /* This is OK, too. */
7718 /* This is OK, too. This comes from a conversion to reference
7719 type. */
7721 else
7722 {
7728 }
7730 /* Non-member functions and static member functions match targets of type
7731 "pointer-to-function" or "reference-to-function." Nonstatic member
7732 functions match targets of type "pointer-to-member-function;" the
7733 function type of the pointer to member is used to select the member
7734 function from the set of overloaded member functions.
7736 So figure out the FUNCTION_TYPE that we want to match against. */
7739 /* If we can find a non-template function that matches, we can just
7740 use it. There's no point in generating template instantiations
7741 if we're just going to throw them out anyhow. But, of course, we
7742 can only do this when we don't *need* a template function. */
7745 {
7749 /* We're not looking for templates just yet. */
7753 /* We're looking for a non-static member, and this isn't
7754 one, or vice versa. */
7757 /* In C++17 we need the noexcept-qualifier to compare types. */
7762 /* See if there's a match. */
7767 }
7769 /* Now, if we've already got a match (or matches), there's no need
7770 to proceed to the template functions. But, if we don't have a
7771 match we need to look at them, too. */
7773 {
7774 tree target_arg_types;
7775 tree target_ret_type;
7778 tree arg;
7792 {
7794 tree instantiation;
7795 tree targs;
7798 /* We're only looking for templates. */
7803 /* We're not looking for a non-static member, and this is
7804 one, or vice versa. */
7809 /* If the template has a deduced return type, don't expose it to
7810 template argument deduction. */
7814 /* Try to do argument deduction. */
7821 /* Instantiation failed. */
7824 /* Constraints must be satisfied. This is done before
7825 return type deduction since that instantiates the
7826 function. */
7830 /* And now force instantiation to do return type deduction. */
7832 {
7838 }
7840 /* In C++17 we need the noexcept-qualifier to compare types. */
7844 /* See if there's a match. */
7849 }
7851 /* Now, remove all but the most specialized of the matches. */
7853 {
7858 NULL_TREE,
7859 NULL_TREE);
7860 }
7861 }
7863 /* Now we should have exactly one function in MATCHES. */
7865 {
7866 /* There were *no* matches. */
7868 {
7873 }
7875 }
7877 {
7878 /* There were too many matches. First check if they're all
7879 the same function. */
7884 /* For multi-versioned functions, more than one match is just fine and
7885 decls_match will return false as they are different. */
7893 {
7895 {
7899 /* Since print_candidates expects the functions in the
7900 TREE_VALUE slot, we flip them here. */
7905 }
7908 }
7909 }
7911 /* Good, exactly one match. Now, convert it to the correct type. */
7916 {
7924 {
7928 }
7929 }
7931 /* If a pointer to a function that is multi-versioned is requested, the
7932 pointer to the dispatcher function is returned instead. This works
7933 well because indirectly calling the function will dispatch the right
7934 function version at run-time. */
7936 {
7940 /* Mark all the versions corresponding to the dispatcher as used. */
7943 }
7945 /* If we're doing overload resolution purely for the purpose of
7946 determining conversion sequences, we should not consider the
7947 function used. If this conversion sequence is selected, the
7948 function will be marked as used at this point. */
7950 {
7951 /* Make =delete work with SFINAE. */
7956 }
7958 /* We could not check access to member functions when this
7959 expression was originally created since we did not know at that
7960 time to which function the expression referred. */
7962 {
7965 }
7969 else
7970 {
7971 /* The target must be a REFERENCE_TYPE. Above, cp_build_unary_op
7972 will mark the function as addressed, but here we must do it
7973 explicitly. */
7977 }
7978 }
7980 /* This function will instantiate the type of the expression given in
7981 RHS to match the type of LHSTYPE. If errors exist, then return
7982 error_mark_node. COMPLAIN is a bit mask. If TF_ERROR is set, then
7983 we complain on errors. If we are not complaining, never modify rhs,
7984 as overload resolution wants to try many possible instantiations, in
7985 the hope that at least one will work.
7987 For non-recursive calls, LHSTYPE should be a function, pointer to
7988 function, or a pointer to member function. */
7990 tree
7992 {
7999 {
8003 }
8006 {
8015 /* Microsoft allows `A::f' to be resolved to a
8016 pointer-to-member. */
8017 ;
8018 else
8019 {
8024 }
8025 }
8027 /* If we instantiate a template, and it is a A ?: C expression
8028 with omitted B, look through the SAVE_EXPR. */
8033 {
8036 }
8038 /* If we are in a template, and have a NON_DEPENDENT_EXPR, we cannot
8039 deduce any type information. */
8041 {
8045 }
8047 /* There are only a few kinds of expressions that may have a type
8048 dependent on overload resolution. */
8054 /* This should really only be used when attempting to distinguish
8055 what sort of a pointer to function we have. For now, any
8056 arithmetic operation which is not supported on pointers
8057 is rejected as an error. */
8060 {
8062 {
8068 /* Do not lose object's side effects. */
8072 }
8079 /* This can happen if we are forming a pointer-to-member for a
8080 member template. */
8083 /* Fall through. */
8086 {
8090 return
8094 }
8098 return
8102 access_path);
8105 {
8110 }
8117 }
8119 }
8120 \f
8121 /* Return the name of the virtual function pointer field
8122 (as an IDENTIFIER_NODE) for the given TYPE. Note that
8123 this may have to look back through base types to find the
8124 ultimate field name. (For single inheritance, these could
8125 all be the same name. Who knows for multiple inheritance). */
8127 static tree
8129 {
8135 {
8141 }
8149 }
8151 /* Build a dummy reference to ourselves so Derived::Base (and A::A) works,
8152 according to [class]:
8153 The class-name is also inserted
8154 into the scope of the class itself. For purposes of access checking,
8155 the inserted class name is treated as if it were a public member name. */
8157 void
8159 {
8176 }
8178 /* Returns 1 if TYPE contains only padding bytes. */
8180 int
8182 {
8190 }
8192 /* Returns true if TYPE contains no actual data, just various
8193 possible combinations of empty classes and possibly a vptr. */
8195 bool
8197 {
8199 {
8200 tree field;
8201 tree binfo;
8202 tree base_binfo;
8205 /* CLASSTYPE_EMPTY_P isn't set properly until the class is actually laid
8206 out, but we'd like to be able to check this before then. */
8217 /* An unnamed bit-field is not a data member. */
8222 }
8227 }
8229 /* Note that NAME was looked up while the current class was being
8230 defined and that the result of that lookup was DECL. */
8232 void
8234 {
8235 splay_tree names_used;
8237 /* If we're not defining a class, there's nothing to do. */
8243 /* If there's already a binding for this NAME, then we don't have
8244 anything to worry about. */
8257 }
8259 /* Note that NAME was declared (as DECL) in the current class. Check
8260 to see that the declaration is valid. */
8262 void
8264 {
8265 splay_tree names_used;
8266 splay_tree_node n;
8268 /* Look to see if we ever used this name. */
8269 names_used
8273 /* The C language allows members to be declared with a type of the same
8274 name, and the C++ standard says this diagnostic is not required. So
8275 allow it in extern "C" blocks unless predantic is specified.
8276 Allow it in all cases if -ms-extensions is specified. */
8282 {
8283 /* [basic.scope.class]
8285 A name N used in a class S shall refer to the same declaration
8286 in its context and when re-evaluated in the completed scope of
8287 S. */
8294 }
8295 }
8297 /* Returns the VAR_DECL for the complete vtable associated with BINFO.
8298 Secondary vtables are merged with primary vtables; this function
8299 will return the VAR_DECL for the primary vtable. */
8301 tree
8303 {
8304 tree decl;
8308 {
8311 }
8315 }
8318 /* Returns the binfo for the primary base of BINFO. If the resulting
8319 BINFO is a virtual base, and it is inherited elsewhere in the
8320 hierarchy, then the returned binfo might not be the primary base of
8321 BINFO in the complete object. Check BINFO_PRIMARY_P or
8322 BINFO_LOST_PRIMARY_P to be sure. */
8324 static tree
8326 {
8327 tree primary_base;
8334 }
8336 /* As above, but iterate until we reach the binfo that actually provides the
8337 vptr for BINFO. */
8339 static tree
8341 {
8345 {
8350 }
8352 }
8354 /* Returns true if BINFO gets its vptr from a virtual base of the most derived
8355 type. Note that the virtual inheritance might be above or below BINFO in
8356 the hierarchy. */
8358 bool
8360 {
8364 /* Don't limit binfo_via_virtual, we want to return true when BINFO itself is
8365 a morally virtual base. */
8368 }
8370 /* If INDENTED_P is zero, indent to INDENT. Return nonzero. */
8372 static int
8374 {
8378 }
8380 /* Dump the offsets of all the bases rooted at BINFO to STREAM.
8381 INDENT should be zero when called from the top level; it is
8382 incremented recursively. IGO indicates the next expected BINFO in
8383 inheritance graph ordering. */
8385 static tree
8387 dump_flags_t flags,
8388 tree binfo,
8389 tree igo,
8391 {
8393 tree base_binfo;
8401 {
8404 }
8419 {
8423 TFF_PLAIN_IDENTIFIER),
8425 }
8427 {
8430 }
8435 {
8439 {
8443 TFF_PLAIN_IDENTIFIER));
8444 }
8446 {
8450 TFF_PLAIN_IDENTIFIER));
8451 }
8453 {
8457 TFF_PLAIN_IDENTIFIER));
8458 }
8460 {
8464 TFF_PLAIN_IDENTIFIER));
8465 }
8469 }
8475 }
8477 /* Dump the BINFO hierarchy for T. */
8479 static void
8481 {
8493 }
8495 /* Debug interface to hierarchy dumping. */
8497 void
8499 {
8501 }
8503 static void
8505 {
8506 dump_flags_t flags;
8508 {
8511 }
8512 }
8514 static void
8516 {
8517 tree value;
8519 HOST_WIDE_INT elt;
8527 TFF_PLAIN_IDENTIFIER));
8534 }
8536 static void
8538 {
8539 dump_flags_t flags;
8546 {
8553 {
8558 }
8562 }
8565 }
8567 static void
8569 {
8570 dump_flags_t flags;
8577 {
8582 }
8585 }
8587 /* Dump a function or thunk and its thunkees. */
8589 static void
8591 {
8594 tree thunks;
8602 {
8612 else
8618 }
8622 }
8624 /* Dump the thunks for FN. */
8626 void
8628 {
8630 }
8632 /* Virtual function table initialization. */
8634 /* Create all the necessary vtables for T and its base classes. */
8636 static void
8638 {
8639 tree vbase;
8643 /* We lay out the primary and secondary vtables in one contiguous
8644 vtable. The primary vtable is first, followed by the non-virtual
8645 secondary vtables in inheritance graph order. */
8649 /* Then come the virtual bases, also in inheritance graph order. */
8651 {
8655 }
8659 }
8661 /* Initialize the vtable for BINFO with the INITS. */
8663 static void
8665 {
8666 tree decl;
8672 }
8674 /* Build the VTT (virtual table table) for T.
8675 A class requires a VTT if it has virtual bases.
8677 This holds
8678 1 - primary virtual pointer for complete object T
8679 2 - secondary VTTs for each direct non-virtual base of T which requires a
8680 VTT
8681 3 - secondary virtual pointers for each direct or indirect base of T which
8682 has virtual bases or is reachable via a virtual path from T.
8683 4 - secondary VTTs for each direct or indirect virtual base of T.
8685 Secondary VTTs look like complete object VTTs without part 4. */
8687 static void
8689 {
8690 tree type;
8691 tree vtt;
8692 tree index;
8695 /* Build up the initializers for the VTT. */
8700 /* If we didn't need a VTT, we're done. */
8704 /* Figure out the type of the VTT. */
8708 /* Now, build the VTT object itself. */
8711 /* Add the VTT to the vtables list. */
8716 }
8718 /* When building a secondary VTT, BINFO_VTABLE is set to a TREE_LIST with
8719 PURPOSE the RTTI_BINFO, VALUE the real vtable pointer for this binfo,
8720 and CHAIN the vtable pointer for this binfo after construction is
8721 complete. VALUE can also be another BINFO, in which case we recurse. */
8723 static tree
8725 {
8726 tree vt;
8729 {
8735 else
8737 }
8740 }
8742 /* Data for secondary VTT initialization. */
8743 struct secondary_vptr_vtt_init_data
8744 {
8745 /* Is this the primary VTT? */
8748 /* Current index into the VTT. */
8749 tree index;
8751 /* Vector of initializers built up. */
8754 /* The type being constructed by this secondary VTT. */
8755 tree type_being_constructed;
8756 };
8758 /* Recursively build the VTT-initializer for BINFO (which is in the
8759 hierarchy dominated by T). INITS points to the end of the initializer
8760 list to date. INDEX is the VTT index where the next element will be
8761 replaced. Iff BINFO is the binfo for T, this is the top level VTT (i.e.
8762 not a subvtt for some base of T). When that is so, we emit the sub-VTTs
8763 for virtual bases of T. When it is not so, we build the constructor
8764 vtables for the BINFO-in-T variant. */
8766 static void
8769 {
8771 tree b;
8772 tree init;
8773 secondary_vptr_vtt_init_data data;
8776 /* We only need VTTs for subobjects with virtual bases. */
8780 /* We need to use a construction vtable if this is not the primary
8781 VTT. */
8783 {
8786 /* Record the offset in the VTT where this sub-VTT can be found. */
8788 }
8790 /* Add the address of the primary vtable for the complete object. */
8794 {
8797 }
8800 /* Recursively add the secondary VTTs for non-virtual bases. */
8805 /* Add secondary virtual pointers for all subobjects of BINFO with
8806 either virtual bases or reachable along a virtual path, except
8807 subobjects that are non-virtual primary bases. */
8817 /* data.inits might have grown as we added secondary virtual pointers.
8818 Make sure our caller knows about the new vector. */
8822 /* Add the secondary VTTs for virtual bases in inheritance graph
8823 order. */
8825 {
8830 }
8831 else
8832 /* Remove the ctor vtables we created. */
8834 }
8836 /* Called from build_vtt_inits via dfs_walk. BINFO is the binfo for the base
8837 in most derived. DATA is a SECONDARY_VPTR_VTT_INIT_DATA structure. */
8839 static tree
8841 {
8844 /* We don't care about bases that don't have vtables. */
8848 /* We're only interested in proper subobjects of the type being
8849 constructed. */
8853 /* We're only interested in bases with virtual bases or reachable
8854 via a virtual path from the type being constructed. */
8859 /* We're not interested in non-virtual primary bases. */
8863 /* Record the index where this secondary vptr can be found. */
8865 {
8870 {
8871 /* It's a primary virtual base, and this is not a
8872 construction vtable. Find the base this is primary of in
8873 the inheritance graph, and use that base's vtable
8874 now. */
8877 }
8878 }
8880 /* Add the initializer for the secondary vptr itself. */
8883 /* Advance the vtt index. */
8888 }
8890 /* Called from build_vtt_inits via dfs_walk. After building
8891 constructor vtables and generating the sub-vtt from them, we need
8892 to restore the BINFO_VTABLES that were scribbled on. DATA is the
8893 binfo of the base whose sub vtt was generated. */
8895 static tree
8897 {
8901 /* If this class has no vtable, none of its bases do. */
8905 /* This might be a primary base, so have no vtable in this
8906 hierarchy. */
8909 /* If we scribbled the construction vtable vptr into BINFO, clear it
8910 out now. */
8916 }
8918 /* Build the construction vtable group for BINFO which is in the
8919 hierarchy dominated by T. */
8921 static void
8923 {
8924 tree type;
8925 tree vtbl;
8926 tree id;
8927 tree vbase;
8930 /* See if we've already created this construction vtable group. */
8936 /* Build a version of VTBL (with the wrong type) for use in
8937 constructing the addresses of secondary vtables in the
8938 construction vtable group. */
8941 /* Don't export construction vtables from shared libraries. Even on
8942 targets that don't support hidden visibility, this tells
8943 can_refer_decl_in_current_unit_p not to assume that it's safe to
8944 access from a different compilation unit (bz 54314). */
8952 /* Add the vtables for each of our virtual bases using the vbase in T
8953 binfo. */
8955 vbase;
8957 {
8958 tree b;
8965 }
8967 /* Figure out the type of the construction vtable. */
8974 /* Initialize the construction vtable. */
8978 }
8980 /* Add the vtbl initializers for BINFO (and its bases other than
8981 non-virtual primaries) to the list of INITS. BINFO is in the
8982 hierarchy dominated by T. RTTI_BINFO is the binfo within T of
8983 the constructor the vtbl inits should be accumulated for. (If this
8984 is the complete object vtbl then RTTI_BINFO will be TYPE_BINFO (T).)
8985 ORIG_BINFO is the binfo for this object within BINFO_TYPE (RTTI_BINFO).
8986 BINFO is the active base equivalent of ORIG_BINFO in the inheritance
8987 graph of T. Both BINFO and ORIG_BINFO will have the same BINFO_TYPE,
8988 but are not necessarily the same in terms of layout. */
8990 static void
8992 tree orig_binfo,
8993 tree rtti_binfo,
8994 tree vtbl,
8995 tree t,
8997 {
8999 tree base_binfo;
9004 /* If it doesn't have a vptr, we don't do anything. */
9008 /* If we're building a construction vtable, we're not interested in
9009 subobjects that don't require construction vtables. */
9015 /* Build the initializers for the BINFO-in-T vtable. */
9018 /* Walk the BINFO and its bases. We walk in preorder so that as we
9019 initialize each vtable we can figure out at what offset the
9020 secondary vtable lies from the primary vtable. We can't use
9021 dfs_walk here because we need to iterate through bases of BINFO
9022 and RTTI_BINFO simultaneously. */
9024 {
9025 /* Skip virtual bases. */
9031 inits);
9032 }
9033 }
9035 /* Called from accumulate_vtbl_inits. Adds the initializers for the
9036 BINFO vtable to L. */
9038 static void
9040 tree orig_binfo,
9041 tree rtti_binfo,
9042 tree orig_vtbl,
9043 tree t,
9045 {
9052 {
9053 /* In the hierarchy of BINFO_TYPE (RTTI_BINFO), this is a
9054 primary virtual base. If it is not the same primary in
9055 the hierarchy of T, we'll need to generate a ctor vtable
9056 for it, to place at its location in T. If it is the same
9057 primary, we still need a VTT entry for the vtable, but it
9058 should point to the ctor vtable for the base it is a
9059 primary for within the sub-hierarchy of RTTI_BINFO.
9061 There are three possible cases:
9063 1) We are in the same place.
9064 2) We are a primary base within a lost primary virtual base of
9065 RTTI_BINFO.
9066 3) We are primary to something not a base of RTTI_BINFO. */
9068 tree b;
9071 /* First, look through the bases we are primary to for RTTI_BINFO
9072 or a virtual base. */
9075 {
9080 }
9081 /* If we run out of primary links, keep looking down our
9082 inheritance chain; we might be an indirect primary. */
9086 found:
9088 /* If we found RTTI_BINFO, this is case 1. If we found a virtual
9089 base B and it is a base of RTTI_BINFO, this is case 2. In
9090 either case, we share our vtable with LAST, i.e. the
9091 derived-most base within B of which we are a primary. */
9094 /* Just set our BINFO_VTABLE to point to LAST, as we may not have
9095 set LAST's BINFO_VTABLE yet. We'll extract the actual vptr in
9096 binfo_ctor_vtable after everything's been set up. */
9099 /* Otherwise, this is case 3 and we get our own. */
9100 }
9107 {
9108 tree index;
9111 /* Add the initializer for this vtable. */
9115 /* Figure out the position to which the VPTR should point. */
9121 }
9124 /* For a construction vtable, we can't overwrite BINFO_VTABLE.
9125 So, we make a TREE_LIST. Later, dfs_fixup_binfo_vtbls will
9126 straighten this out. */
9129 /* Throw away any unneeded intializers. */
9131 else
9132 /* For an ordinary vtable, set BINFO_VTABLE. */
9134 }
9139 /* Construct the initializer for BINFO's virtual function table. BINFO
9140 is part of the hierarchy dominated by T. If we're building a
9141 construction vtable, the ORIG_BINFO is the binfo we should use to
9142 find the actual function pointers to put in the vtable - but they
9143 can be overridden on the path to most-derived in the graph that
9144 ORIG_BINFO belongs. Otherwise,
9145 ORIG_BINFO should be the same as BINFO. The RTTI_BINFO is the
9146 BINFO that should be indicated by the RTTI information in the
9147 vtable; it will be a base class of T, rather than T itself, if we
9148 are building a construction vtable.
9150 The value returned is a TREE_LIST suitable for wrapping in a
9151 CONSTRUCTOR to use as the DECL_INITIAL for a vtable. If
9152 NON_FN_ENTRIES_P is not NULL, *NON_FN_ENTRIES_P is set to the
9153 number of non-function entries in the vtable.
9155 It might seem that this function should never be called with a
9156 BINFO for which BINFO_PRIMARY_P holds, the vtable for such a
9157 base is always subsumed by a derived class vtable. However, when
9158 we are building construction vtables, we do build vtables for
9159 primary bases; we need these while the primary base is being
9160 constructed. */
9162 static void
9164 tree orig_binfo,
9165 tree t,
9166 tree rtti_binfo,
9169 {
9170 tree v;
9171 vtbl_init_data vid;
9173 tree vbinfo;
9177 /* Initialize VID. */
9185 /* The first vbase or vcall offset is at index -3 in the vtable. */
9188 /* Add entries to the vtable for RTTI. */
9191 /* Create an array for keeping track of the functions we've
9192 processed. When we see multiple functions with the same
9193 signature, we share the vcall offsets. */
9195 /* Add the vcall and vbase offset entries. */
9198 /* Clear BINFO_VTABLE_PATH_MARKED; it's set by
9199 build_vbase_offset_vtbl_entries. */
9204 /* If the target requires padding between data entries, add that now. */
9206 {
9211 /* Move data entries into their new positions and add padding
9212 after the new positions. Iterate backwards so we don't
9213 overwrite entries that we would need to process later. */
9216 ix--)
9217 {
9225 {
9229 null_pointer_node);
9230 }
9231 }
9232 }
9237 /* The initializers for virtual functions were built up in reverse
9238 order. Straighten them out and add them to the running list in one
9239 step. */
9248 /* Go through all the ordinary virtual functions, building up
9249 initializers. */
9251 {
9252 tree delta;
9253 tree vcall_index;
9260 {
9264 {
9267 }
9269 }
9271 /* If the only definition of this function signature along our
9272 primary base chain is from a lost primary, this vtable slot will
9273 never be used, so just zero it out. This is important to avoid
9274 requiring extra thunks which cannot be generated with the function.
9276 We first check this in update_vtable_entry_for_fn, so we handle
9277 restored primary bases properly; we also need to do it here so we
9278 zero out unused slots in ctor vtables, rather than filling them
9279 with erroneous values (though harmless, apart from relocation
9280 costs). */
9285 {
9286 /* Pull the offset for `this', and the function to call, out of
9287 the list. */
9294 /* You can't call an abstract virtual function; it's abstract.
9295 So, we replace these functions with __pure_virtual. */
9297 {
9300 {
9302 abort_fndecl_addr
9306 }
9307 }
9308 /* Likewise for deleted virtuals. */
9310 {
9312 {
9316 dvirt_fn = push_library_fn
9320 }
9325 }
9326 else
9327 {
9329 {
9334 }
9335 /* Take the address of the function, considering it to be of an
9336 appropriate generic type. */
9340 /* Don't refer to a virtual destructor from a constructor
9341 vtable or a vtable for an abstract class, since destroying
9342 an object under construction is undefined behavior and we
9343 don't want it to be considered a candidate for speculative
9344 devirtualization. But do create the thunk for ABI
9345 compliance. */
9350 }
9351 }
9353 /* And add it to the chain of initializers. */
9355 {
9360 else
9362 {
9368 }
9369 }
9370 else
9372 }
9373 }
9375 /* Adds to vid->inits the initializers for the vbase and vcall
9376 offsets in BINFO, which is in the hierarchy dominated by T. */
9378 static void
9380 {
9381 tree b;
9383 /* If this is a derived class, we must first create entries
9384 corresponding to the primary base class. */
9389 /* Add the vbase entries for this base. */
9391 /* Add the vcall entries for this base. */
9393 }
9395 /* Returns the initializers for the vbase offset entries in the vtable
9396 for BINFO (which is part of the class hierarchy dominated by T), in
9397 reverse order. VBASE_OFFSET_INDEX gives the vtable index
9398 where the next vbase offset will go. */
9400 static void
9402 {
9403 tree vbase;
9404 tree t;
9405 tree non_primary_binfo;
9407 /* If there are no virtual baseclasses, then there is nothing to
9408 do. */
9414 /* We might be a primary base class. Go up the inheritance hierarchy
9415 until we find the most derived class of which we are a primary base:
9416 it is the offset of that which we need to use. */
9419 {
9420 tree b;
9422 /* If we have reached a virtual base, then it must be a primary
9423 base (possibly multi-level) of vid->binfo, or we wouldn't
9424 have called build_vcall_and_vbase_vtbl_entries for it. But it
9425 might be a lost primary, so just skip down to vid->binfo. */
9427 {
9430 }
9436 }
9438 /* Go through the virtual bases, adding the offsets. */
9440 vbase;
9442 {
9443 tree b;
9444 tree delta;
9449 /* Find the instance of this virtual base in the complete
9450 object. */
9453 /* If we've already got an offset for this virtual base, we
9454 don't need another one. */
9459 /* Figure out where we can find this vbase offset. */
9468 /* The vbase offset had better be the same. */
9471 /* The next vbase will come at a more negative offset. */
9475 /* The initializer is the delta from BINFO to this virtual base.
9476 The vbase offsets go in reverse inheritance-graph order, and
9477 we are walking in inheritance graph order so these end up in
9478 the right order. */
9485 }
9486 }
9488 /* Adds the initializers for the vcall offset entries in the vtable
9489 for BINFO (which is part of the class hierarchy dominated by VID->DERIVED)
9490 to VID->INITS. */
9492 static void
9494 {
9495 /* We only need these entries if this base is a virtual base. We
9496 compute the indices -- but do not add to the vtable -- when
9497 building the main vtable for a class. */
9500 /* If BINFO is RTTI_BINFO, then (since BINFO does not
9501 correspond to VID->DERIVED), we are building a primary
9502 construction virtual table. Since this is a primary
9503 virtual table, we do not need the vcall offsets for
9504 BINFO. */
9506 {
9507 /* We need a vcall offset for each of the virtual functions in this
9508 vtable. For example:
9510 class A { virtual void f (); };
9511 class B1 : virtual public A { virtual void f (); };
9512 class B2 : virtual public A { virtual void f (); };
9513 class C: public B1, public B2 { virtual void f (); };
9515 A C object has a primary base of B1, which has a primary base of A. A
9516 C also has a secondary base of B2, which no longer has a primary base
9517 of A. So the B2-in-C construction vtable needs a secondary vtable for
9518 A, which will adjust the A* to a B2* to call f. We have no way of
9519 knowing what (or even whether) this offset will be when we define B2,
9520 so we store this "vcall offset" in the A sub-vtable and look it up in
9521 a "virtual thunk" for B2::f.
9523 We need entries for all the functions in our primary vtable and
9524 in our non-virtual bases' secondary vtables. */
9526 /* If we are just computing the vcall indices -- but do not need
9527 the actual entries -- not that. */
9530 /* Now, walk through the non-virtual bases, adding vcall offsets. */
9532 }
9533 }
9535 /* Build vcall offsets, starting with those for BINFO. */
9537 static void
9539 {
9541 tree primary_binfo;
9542 tree base_binfo;
9544 /* Don't walk into virtual bases -- except, of course, for the
9545 virtual base for which we are building vcall offsets. Any
9546 primary virtual base will have already had its offsets generated
9547 through the recursion in build_vcall_and_vbase_vtbl_entries. */
9551 /* If BINFO has a primary base, process it first. */
9556 /* Add BINFO itself to the list. */
9559 /* Scan the non-primary bases of BINFO. */
9563 }
9565 /* Called from build_vcall_offset_vtbl_entries_r. */
9567 static void
9569 {
9570 /* Make entries for the rest of the virtuals. */
9571 tree orig_fn;
9573 /* The ABI requires that the methods be processed in declaration
9574 order. */
9576 orig_fn;
9580 }
9582 /* Add a vcall offset entry for ORIG_FN to the vtable. */
9584 static void
9586 {
9588 tree vcall_offset;
9589 tree derived_entry;
9591 /* If there is already an entry for a function with the same
9592 signature as FN, then we do not need a second vcall offset.
9593 Check the list of functions already present in the derived
9594 class vtable. */
9596 {
9598 /* We only use one vcall offset for virtual destructors,
9599 even though there are two virtual table entries. */
9603 }
9605 /* If we are building these vcall offsets as part of building
9606 the vtable for the most derived class, remember the vcall
9607 offset. */
9609 {
9612 }
9614 /* The next vcall offset will be found at a more negative
9615 offset. */
9619 /* Keep track of this function. */
9623 {
9624 tree base;
9625 tree fn;
9627 /* Find the overriding function. */
9631 else
9632 {
9635 /* The vbase we're working on is a primary base of
9636 vid->binfo. But it might be a lost primary, so its
9637 BINFO_OFFSET might be wrong, so we just use the
9638 BINFO_OFFSET from vid->binfo. */
9644 vcall_offset);
9645 }
9646 /* Add the initializer to the vtable. */
9648 }
9649 }
9651 /* Return vtbl initializers for the RTTI entries corresponding to the
9652 BINFO's vtable. The RTTI entries should indicate the object given
9653 by VID->rtti_binfo. */
9655 static void
9657 {
9658 tree b;
9659 tree t;
9660 tree offset;
9661 tree decl;
9662 tree init;
9666 /* To find the complete object, we will first convert to our most
9667 primary base, and then add the offset in the vtbl to that value. */
9672 /* The second entry is the address of the typeinfo object. */
9675 else
9678 /* Convert the declaration to a type that can be stored in the
9679 vtable. */
9683 /* Add the offset-to-top entry. It comes earlier in the vtable than
9684 the typeinfo entry. Convert the offset to look like a
9685 function pointer, so that we can put it in the vtable. */
9688 }
9690 /* TRUE iff TYPE is uniquely derived from PARENT. Ignores
9691 accessibility. */
9693 bool
9695 {
9698 }
9700 /* TRUE iff TYPE is publicly & uniquely derived from PARENT. */
9702 bool
9704 {
9708 }
9710 /* CTX1 and CTX2 are declaration contexts. Return the innermost common
9711 class between them, if any. */
9713 tree
9715 {
9727 {
9730 }
9734 }