| blob | 0427d1224f74d2d3448a6c4f066bb5dbe70ab801 |
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 }
373 /* If we're in an NSDMI, we don't have the full constructor context yet
374 that we need for converting to a virtual base, so just build a stub
375 CONVERT_EXPR and expand it later in bot_replace. */
378 {
382 }
384 /* Do we need to check for a null pointer? */
386 {
387 /* If we know the conversion will not actually change the value
388 of EXPR, then we can avoid testing the expression for NULL.
389 We have to avoid generating a COMPONENT_REF for a base class
390 field, because other parts of the compiler know that such
391 expressions are always non-NULL. */
395 }
397 /* Protect against multiple evaluation if necessary. */
401 /* Now that we've saved expr, build the real null test. */
403 {
407 /* This is a compiler generated comparison, don't emit
408 e.g. -Wnonnull-compare warning for it. */
410 }
412 /* If this is a simple base reference, express it as a COMPONENT_REF. */
414 /* We don't build base fields for empty bases, and they aren't very
415 interesting to the optimizers anyway. */
417 {
426 }
429 {
430 /* Going via virtual base V_BINFO. We need the static offset
431 from V_BINFO to BINFO, and the dynamic offset from D_BINFO to
432 V_BINFO. That offset is an entry in D_BINFO's vtable. */
433 tree v_offset;
436 {
437 /* In a base member initializer, we cannot rely on the
438 vtable being set up. We have to indirect via the
439 vtt_parm. */
440 tree t;
446 }
447 else
448 {
452 {
457 }
460 }
468 v_offset);
480 /* Negative fixed_type_p means this is a constructor or destructor;
481 virtual base layout is fixed in in-charge [cd]tors, but not in
482 base [cd]tors. */
483 offset = build_if_in_charge
485 v_offset);
486 else
488 }
496 {
501 }
502 else
505 indout:
507 {
511 }
513 out:
519 }
521 /* Subroutine of build_base_path; EXPR and BINFO are as in that function.
522 Perform a derived-to-base conversion by recursively building up a
523 sequence of COMPONENT_REFs to the appropriate base fields. */
525 static tree
527 {
530 tree field;
533 {
534 tree temp;
538 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x'
539 into `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only
540 an lvalue in the front end; only _DECLs and _REFs are lvalues
541 in the back end. */
547 }
549 /* Recurse. */
554 /* Is this the base field created by build_base_field? */
558 /* If we're looking for a field in the most-derived class,
559 also check the field offset; we can have two base fields
560 of the same type if one is an indirect virtual base and one
561 is a direct non-virtual base. */
565 {
566 /* We don't use build_class_member_access_expr here, as that
567 has unnecessary checks, and more importantly results in
568 recursive calls to dfs_walk_once. */
574 /* Mark the expression const or volatile, as appropriate.
575 Even though we've dealt with the type above, we still have
576 to mark the expression itself. */
583 }
585 /* Didn't find the base field?!? */
587 }
589 /* Convert OBJECT to the base TYPE. OBJECT is an expression whose
590 type is a class type or a pointer to a class type. In the former
591 case, TYPE is also a class type; in the latter it is another
592 pointer type. If CHECK_ACCESS is true, an error message is emitted
593 if TYPE is inaccessible. If OBJECT has pointer type, the value is
594 assumed to be non-NULL. */
596 tree
598 tsubst_flags_t complain)
599 {
600 tree binfo;
601 tree object_type;
604 {
607 }
608 else
617 }
619 /* EXPR is an expression with unqualified class type. BASE is a base
620 binfo of that class type. Returns EXPR, converted to the BASE
621 type. This function assumes that EXPR is the most derived class;
622 therefore virtual bases can be found at their static offsets. */
624 tree
626 {
627 tree expr_type;
631 {
632 /* If this is a non-empty base, use a COMPONENT_REF. */
636 /* We use fold_build2 and fold_convert below to simplify the trees
637 provided to the optimizers. It is not safe to call these functions
638 when processing a template because they do not handle C++-specific
639 trees. */
647 }
650 }
652 \f
653 tree
655 {
659 /* Can happen in case of duplicate base types (c++/59082). */
663 /* First, convert to the requested type. */
668 /* Second, the requested type may not be the owner of its own vptr.
669 If not, convert to the base class that owns it. We cannot use
670 convert_to_base here, because VCONTEXT may appear more than once
671 in the inheritance hierarchy of TYPE, and thus direct conversion
672 between the types may be ambiguous. Following the path back up
673 one step at a time via primary bases avoids the problem. */
677 {
680 }
683 }
685 /* Given an object INSTANCE, return an expression which yields the
686 vtable element corresponding to INDEX. There are many special
687 cases for INSTANCE which we take care of here, mainly to avoid
688 creating extra tree nodes when we don't have to. */
690 static tree
692 {
693 tree aref;
696 /* Try to figure out what a reference refers to, and
697 access its virtual function table directly. */
705 {
710 }
719 }
721 tree
723 {
727 }
729 /* Given a stable object pointer INSTANCE_PTR, return an expression which
730 yields a function pointer corresponding to vtable element INDEX. */
732 tree
734 {
735 tree aref;
738 idx);
740 /* When using function descriptors, the address of the
741 vtable entry is treated as a function pointer. */
746 /* Remember this as a method reference, for later devirtualization. */
750 }
752 /* Return the name of the virtual function table (as an IDENTIFIER_NODE)
753 for the given TYPE. */
755 static tree
757 {
759 }
761 /* DECL is an entity associated with TYPE, like a virtual table or an
762 implicitly generated constructor. Determine whether or not DECL
763 should have external or internal linkage at the object file
764 level. This routine does not deal with COMDAT linkage and other
765 similar complexities; it simply sets TREE_PUBLIC if it possible for
766 entities in other translation units to contain copies of DECL, in
767 the abstract. */
769 void
771 {
774 }
776 /* Create a VAR_DECL for a primary or secondary vtable for CLASS_TYPE.
777 (For a secondary vtable for B-in-D, CLASS_TYPE should be D, not B.)
778 Use NAME for the name of the vtable, and VTABLE_TYPE for its type. */
780 static tree
782 {
783 tree decl;
786 /* vtable names are already mangled; give them their DECL_ASSEMBLER_NAME
787 now to avoid confusion in mangle_decl. */
798 /* The vtable has not been defined -- yet. */
802 /* Mark the VAR_DECL node representing the vtable itself as a
803 "gratuitous" one, thereby forcing dwarfout.c to ignore it. It
804 is rather important that such things be ignored because any
805 effort to actually generate DWARF for them will run into
806 trouble when/if we encounter code like:
808 #pragma interface
809 struct S { virtual void member (); };
811 because the artificial declaration of the vtable itself (as
812 manufactured by the g++ front end) will say that the vtable is
813 a static member of `S' but only *after* the debug output for
814 the definition of `S' has already been output. This causes
815 grief because the DWARF entry for the definition of the vtable
816 will try to refer back to an earlier *declaration* of the
817 vtable as a static member of `S' and there won't be one. We
818 might be able to arrange to have the "vtable static member"
819 attached to the member list for `S' before the debug info for
820 `S' get written (which would solve the problem) but that would
821 require more intrusive changes to the g++ front end. */
825 }
827 /* Get the VAR_DECL of the vtable for TYPE. TYPE need not be polymorphic,
828 or even complete. If this does not exist, create it. If COMPLETE is
829 nonzero, then complete the definition of it -- that will render it
830 impossible to actually build the vtable, but is useful to get at those
831 which are known to exist in the runtime. */
833 tree
835 {
836 tree decl;
845 {
848 }
851 }
853 /* Build the primary virtual function table for TYPE. If BINFO is
854 non-NULL, build the vtable starting with the initial approximation
855 that it is the same as the one which is the head of the association
856 list. Returns a nonzero value if a new vtable is actually
857 created. */
859 static int
861 {
862 tree decl;
863 tree virtuals;
868 {
870 /* We have already created a vtable for this base, so there's
871 no need to do it again. */
878 }
879 else
880 {
883 }
885 /* Initialize the association list for this type, based
886 on our first approximation. */
891 }
893 /* Give BINFO a new virtual function table which is initialized
894 with a skeleton-copy of its original initialization. The only
895 entry that changes is the `delta' entry, so we can really
896 share a lot of structure.
898 FOR_TYPE is the most derived type which caused this table to
899 be needed.
901 Returns nonzero if we haven't met BINFO before.
903 The order in which vtables are built (by calling this function) for
904 an object must remain the same, otherwise a binary incompatibility
905 can result. */
907 static int
909 {
911 /* We already created a vtable for this base. There's no need to
912 do it again. */
915 /* Remember that we've created a vtable for this BINFO, so that we
916 don't try to do so again. */
919 /* Make fresh virtual list, so we can smash it later. */
922 /* Secondary vtables are laid out as part of the same structure as
923 the primary vtable. */
926 }
928 /* Create a new vtable for BINFO which is the hierarchy dominated by
929 T. Return nonzero if we actually created a new vtable. */
931 static int
933 {
935 /* In this case, it is *type*'s vtable we are modifying. We start
936 with the approximation that its vtable is that of the
937 immediate base class. */
939 else
940 /* This is our very own copy of `basetype' to play with. Later,
941 we will fill in all the virtual functions that override the
942 virtual functions in these base classes which are not defined
943 by the current type. */
945 }
947 /* Make *VIRTUALS, an entry on the BINFO_VIRTUALS list for BINFO
948 (which is in the hierarchy dominated by T) list FNDECL as its
949 BV_FN. DELTA is the required constant adjustment from the `this'
950 pointer where the vtable entry appears to the `this' required when
951 the function is actually called. */
953 static void
955 tree binfo,
956 tree fndecl,
957 tree delta,
959 {
960 tree v;
966 {
967 /* We need a new vtable for BINFO. */
969 {
970 /* If we really did make a new vtable, we also made a copy
971 of the BINFO_VIRTUALS list. Now, we have to find the
972 corresponding entry in that list. */
977 }
982 }
983 }
985 \f
986 /* Add method METHOD to class TYPE. If VIA_USING indicates whether
987 METHOD is being injected via a using_decl. Returns true if the
988 method could be added to the method vec. */
990 bool
992 {
1001 /* Check to see if we've already got this method. */
1003 {
1005 tree fn_type;
1006 tree method_type;
1007 tree parms1;
1008 tree parms2;
1013 /* Two using-declarations can coexist, we'll complain about ambiguity in
1014 overload resolution. */
1016 /* Except handle inherited constructors specially. */
1020 /* [over.load] Member function declarations with the
1021 same name and the same parameter types cannot be
1022 overloaded if any of them is a static member
1023 function declaration.
1025 [over.load] Member function declarations with the same name and
1026 the same parameter-type-list as well as member function template
1027 declarations with the same name, the same parameter-type-list, and
1028 the same template parameter lists cannot be overloaded if any of
1029 them, but not all, have a ref-qualifier.
1031 [namespace.udecl] When a using-declaration brings names
1032 from a base class into a derived class scope, member
1033 functions in the derived class override and/or hide member
1034 functions with the same name and parameter types in a base
1035 class (rather than conflicting). */
1041 /* Compare the quals on the 'this' parm. Don't compare
1042 the whole types, as used functions are treated as
1043 coming from the using class in overload resolution. */
1046 /* Either both or neither need to be ref-qualified for
1047 differing quals to allow overloading. */
1054 /* For templates, the return type and template parameters
1055 must be identical. */
1068 /* Bring back parameters omitted from an inherited ctor. */
1079 {
1080 /* If these are versions of the same function, process and
1081 move on. */
1087 {
1089 {
1093 {
1095 {
1096 /* Inheriting the same constructor along different
1097 paths, combine them. */
1098 SET_DECL_INHERITED_CTOR
1101 /* And discard the new one. */
1103 }
1104 else
1105 /* Inherited ctors can coexist until overload
1106 resolution. */
1108 }
1114 basef);
1115 }
1116 /* Otherwise defer to the other function. */
1118 }
1121 /* Defer to the local function. */
1125 {
1126 /* Remove the inherited constructor. */
1129 }
1130 else
1131 {
1137 }
1138 }
1139 }
1141 /* A class should never have more than one destructor. */
1153 /* Maintain TYPE_HAS_USER_CONSTRUCTOR, etc. */
1159 }
1161 /* Subroutines of finish_struct. */
1163 /* Change the access of FDECL to ACCESS in T. Return 1 if change was
1164 legit, otherwise return 0. */
1166 static int
1168 {
1169 tree elem;
1177 {
1179 {
1183 else
1186 }
1187 else
1188 {
1189 /* They're changing the access to the same thing they changed
1190 it to before. That's OK. */
1191 ;
1192 }
1193 }
1194 else
1195 {
1197 tf_warning_or_error);
1200 }
1202 }
1204 /* Return the access node for DECL's access in its enclosing class. */
1206 tree
1208 {
1212 }
1214 /* Process the USING_DECL, which is a member of T. */
1216 static void
1218 {
1223 tree old_value;
1228 tf_warning_or_error);
1230 {
1235 else
1237 }
1245 ;
1247 {
1249 /* It's OK to use functions from a base when there are functions with
1251 else
1252 {
1259 }
1260 }
1262 {
1269 }
1271 /* Make type T see field decl FDECL with access ACCESS. */
1274 {
1277 }
1278 else
1280 }
1281 \f
1282 /* Data structure for find_abi_tags_r, below. */
1284 struct abi_tag_data
1285 {
1289 };
1291 /* Subroutine of find_abi_tags_r. Handle a single TAG found on the class TP
1292 in the context of P. TAG can be either an identifier (the DECL_NAME of
1293 a tag NAMESPACE_DECL) or a STRING_CST (a tag attribute). */
1295 static void
1297 {
1299 {
1301 {
1302 /* We're collecting tags from template arguments or from
1303 the type of a variable or function return type. */
1306 /* Don't inherit this tag multiple times. */
1310 {
1311 /* Tags inherited from type template arguments are only used
1312 to avoid warnings. */
1315 }
1316 /* For functions and variables we want to warn, too. */
1317 }
1319 /* Otherwise we're diagnosing missing tags. */
1321 {
1326 }
1328 {
1332 }
1334 {
1339 }
1340 else
1341 {
1345 {
1349 }
1350 }
1351 }
1352 }
1354 /* Find all the ABI tags in the attribute list ATTR and either call
1355 check_tag (if TP is non-null) or set IDENTIFIER_MARKED to val. */
1357 static void
1359 {
1366 {
1371 else
1373 }
1374 }
1376 /* Find all the ABI tags on T and its enclosing scopes and either call
1377 check_tag (if TP is non-null) or set IDENTIFIER_MARKED to val. */
1379 static void
1381 {
1383 {
1384 tree attr;
1386 {
1389 }
1390 else
1391 {
1394 }
1396 }
1397 }
1399 /* walk_tree callback for check_abi_tags: if the type at *TP involves any
1400 types with ABI tags, add the corresponding identifiers to the VEC in
1401 *DATA and set IDENTIFIER_MARKED. */
1403 static tree
1405 {
1409 /* walk_tree shouldn't be walking into any subtrees of a RECORD_TYPE
1410 anyway, but let's make sure of it. */
1418 }
1420 /* walk_tree callback for mark_abi_tags: if *TP is a class, set
1421 IDENTIFIER_MARKED on its ABI tags. */
1423 static tree
1425 {
1429 /* walk_tree shouldn't be walking into any subtrees of a RECORD_TYPE
1430 anyway, but let's make sure of it. */
1438 }
1440 /* Set IDENTIFIER_MARKED on all the ABI tags on T and its enclosing
1441 scopes. */
1443 static void
1445 {
1448 {
1451 {
1452 /* Template arguments are part of the signature. */
1455 {
1458 }
1459 }
1461 /* A function's parameter types are part of the signature, so
1462 we don't need to inherit any tags that are also in them. */
1467 }
1468 }
1470 /* Check that T has all the ABI tags that subobject SUBOB has, or
1471 warn if not. If T is a (variable or function) declaration, also
1472 return any missing tags, and add them to T if JUST_CHECKING is false. */
1474 static tree
1476 {
1484 /* No need to worry about things local to this TU. */
1500 {
1503 }
1504 else
1505 {
1509 else
1513 }
1518 }
1520 /* Check that DECL has all the ABI tags that are used in parts of its type
1521 that are not reflected in its mangled name. */
1523 void
1525 {
1532 }
1534 /* Return any ABI tags that are used in parts of the type of DECL
1535 that are not reflected in its mangled name. This function is only
1536 used in backward-compatible mangling for ABI <11. */
1538 tree
1540 {
1544 /* Don't check DECL_CONV_FN_P here like we do in check_abi_tags, so
1545 that we can use this function for setting need_abi_warning
1546 regardless of the current flag_abi_version. */
1549 else
1551 }
1553 void
1555 {
1565 {
1568 {
1572 }
1573 }
1575 // If we found some tags on our template arguments, add them to our
1576 // abi_tag attribute.
1578 {
1582 else
1586 }
1589 }
1591 /* Return true, iff class T has a non-virtual destructor that is
1592 accessible from outside the class heirarchy (i.e. is public, or
1593 there's a suitable friend. */
1595 static bool
1597 {
1600 /* An implicitly declared destructor is always public. And,
1601 if it were virtual, we would have created it by now. */
1616 }
1618 /* Run through the base classes of T, updating CANT_HAVE_CONST_CTOR_P,
1619 and NO_CONST_ASN_REF_P. Also set flag bits in T based on
1620 properties of the bases. */
1622 static void
1626 {
1630 tree base_binfo;
1631 tree binfo;
1641 {
1650 /* If any base class is non-literal, so is the derived class. */
1654 /* If the base class doesn't have copy constructors or
1655 assignment operators that take const references, then the
1656 derived class cannot have such a member automatically
1657 generated. */
1666 /* A virtual base does not effect nearly emptiness. */
1667 ;
1669 {
1671 /* And if there is more than one nearly empty base, then the
1672 derived class is not nearly empty either. */
1674 else
1675 /* Remember we've seen one. */
1677 }
1679 /* If the base class is not empty or nearly empty, then this
1680 class cannot be nearly empty. */
1683 /* A lot of properties from the bases also apply to the derived
1684 class. */
1701 SET_CLASSTYPE_READONLY_FIELDS_NEED_INIT
1704 SET_CLASSTYPE_REF_FIELDS_NEED_INIT
1710 /* A standard-layout class is a class that:
1711 ...
1712 * has no non-standard-layout base classes, */
1715 {
1716 tree basefield;
1717 /* ...has no base classes of the same type as the first non-static
1718 data member... */
1720 && (same_type_ignoring_top_level_qualifiers_p
1723 else
1724 /* ...either has no non-static data members in the most-derived
1725 class and at most one base class with non-static data
1726 members, or has no base classes with non-static data
1727 members */
1733 {
1736 else
1739 }
1740 }
1742 /* Don't bother collecting tm attributes if transactional memory
1743 support is not enabled. */
1745 {
1749 }
1752 }
1754 /* If one of the base classes had TM attributes, and the current class
1755 doesn't define its own, then the current class inherits one. */
1757 {
1760 }
1761 }
1763 /* Determine all the primary bases within T. Sets BINFO_PRIMARY_BASE_P for
1764 those that are primaries. Sets BINFO_LOST_PRIMARY_P for those
1765 that have had a nearly-empty virtual primary base stolen by some
1766 other base in the hierarchy. Determines CLASSTYPE_PRIMARY_BASE for
1767 T. */
1769 static void
1771 {
1775 tree base_binfo;
1777 /* Determine the primary bases of our bases. */
1780 {
1783 /* See if we're the non-virtual primary of our inheritance
1784 chain. */
1786 {
1793 /* We are the primary binfo. */
1795 }
1796 /* Determine if we have a virtual primary base, and mark it so.
1797 */
1799 {
1803 /* Someone already claimed this base. */
1805 else
1806 {
1807 tree delta;
1812 /* A virtual binfo might have been copied from within
1813 another hierarchy. As we're about to use it as a
1814 primary base, make sure the offsets match. */
1822 }
1823 }
1824 }
1826 /* First look for a dynamic direct non-virtual base. */
1828 {
1832 {
1835 }
1836 }
1838 /* A "nearly-empty" virtual base class can be the primary base
1839 class, if no non-virtual polymorphic base can be found. Look for
1840 a nearly-empty virtual dynamic base that is not already a primary
1841 base of something in the hierarchy. If there is no such base,
1842 just pick the first nearly-empty virtual base. */
1848 {
1850 {
1851 /* Found one that is not primary. */
1854 }
1856 /* Remember the first candidate. */
1858 }
1860 found:
1861 /* If we've got a primary base, use it. */
1863 {
1868 /* We are stealing a primary base. */
1872 {
1873 tree delta;
1876 /* A virtual binfo might have been copied from within
1877 another hierarchy. As we're about to use it as a primary
1878 base, make sure the offsets match. */
1883 }
1890 }
1891 }
1893 /* Update the variant types of T. */
1895 void
1897 {
1898 tree variants;
1904 variants;
1906 {
1907 /* These fields are in the _TYPE part of the node, not in
1908 the TYPE_LANG_SPECIFIC component, so they are not shared. */
1918 /* Copy whatever these are holding today. */
1921 }
1922 }
1924 /* KLASS is a class that we're applying may_alias to after the body is
1925 parsed. Fixup any POINTER_TO and REFERENCE_TO types. The
1926 canonical type(s) will be implicitly updated. */
1928 static void
1930 {
1939 }
1941 /* Early variant fixups: we apply attributes at the beginning of the class
1942 definition, and we need to fix up any variants that have already been
1943 made via elaborated-type-specifier so that check_qualified_type works. */
1945 void
1947 {
1948 tree variants;
1962 variants;
1964 {
1965 /* These are the two fields that check_qualified_type looks at and
1966 are affected by attributes. */
1971 else
1976 }
1977 }
1978 \f
1979 /* Set memoizing fields and bits of T (and its variants) for later
1980 use. */
1982 static void
1984 {
1985 /* Fix up variants (if any). */
1989 /* For a class w/o baseclasses, 'finish_struct' has set
1990 CLASSTYPE_PURE_VIRTUALS correctly (by definition).
1991 Similarly for a class whose base classes do not have vtables.
1992 When neither of these is true, we might have removed abstract
1993 virtuals (by providing a definition), added some (by declaring
1994 new ones), or redeclared ones from a base class. We need to
1995 recalculate what's really an abstract virtual at this point (by
1996 looking in the vtables). */
1999 /* If this type has a copy constructor or a destructor, force its
2000 mode to be BLKmode, and force its TREE_ADDRESSABLE bit to be
2001 nonzero. This will cause it to be passed by invisible reference
2002 and prevent it from being returned in a register. */
2005 {
2006 tree variants;
2009 {
2012 }
2013 }
2014 }
2016 /* Issue warnings about T having private constructors, but no friends,
2017 and so forth.
2019 HAS_NONPRIVATE_METHOD is nonzero if T has any non-private methods or
2020 static members. HAS_NONPRIVATE_STATIC_FN is nonzero if T has any
2021 non-private static member functions. */
2023 static void
2025 {
2030 /* If the class has friends, those entities might create and
2031 access instances, so we should not warn. */
2034 /* We will have warned when the template was declared; there's
2035 no need to warn on every instantiation. */
2037 /* There's no reason to even consider warning about this
2038 class. */
2041 /* We only issue one warning, if more than one applies, because
2042 otherwise, on code like:
2044 class A {
2045 // Oops - forgot `public:'
2046 A();
2047 A(const A&);
2048 ~A();
2049 };
2051 we warn several times about essentially the same problem. */
2053 /* Check to see if all (non-constructor, non-destructor) member
2054 functions are private. (Since there are no friends or
2055 non-private statics, we can't ever call any of the private member
2056 functions.) */
2061 /* We're not interested in compiler-generated methods; they don't
2064 {
2066 /* A non-private static member function is just like a
2067 friend; it can create and invoke private member
2068 functions, and be accessed without a class
2069 instance. */
2073 /* Keep searching for a static member function. */
2074 }
2079 {
2080 /* There are no non-private methods, and there's at least one
2081 private member function that isn't a constructor or
2082 destructor. (If all the private members are
2083 constructors/destructors we want to use the code below that
2084 issues error messages specifically referring to
2085 constructors/destructors.) */
2091 {
2094 }
2096 {
2100 }
2101 }
2103 /* Even if some of the member functions are non-private, the class
2104 won't be useful for much if all the constructors or destructors
2105 are private: such an object can never be created or destroyed. */
2108 {
2111 t);
2113 }
2115 /* Warn about classes that have private constructors and no friends. */
2117 /* Implicitly generated constructors are always public. */
2119 {
2123 /* If a non-template class does not define a copy
2124 constructor, one is defined for it, enabling it to avoid
2125 this warning. For a template class, this does not
2126 happen, and so we would normally get a warning on:
2128 template <class T> class C { private: C(); };
2130 To avoid this asymmetry, we check TYPE_HAS_COPY_CTOR. All
2131 complete non-template or fully instantiated classes have this
2132 flag set. */
2135 else
2141 /* Ideally, we wouldn't count any constructor that takes
2142 an argument of the class type as a parameter, because
2143 such things cannot be used to construct an instance of
2144 the class unless you already have one. */
2146 else
2150 {
2153 t);
2159 }
2160 }
2161 }
2163 /* Make BINFO's vtable have N entries, including RTTI entries,
2164 vbase and vcall offsets, etc. Set its type and call the back end
2165 to lay it out. */
2167 static void
2169 {
2170 tree atype;
2171 tree vtable;
2176 /* We may have to grow the vtable. */
2179 {
2183 }
2184 }
2186 /* True iff FNDECL and BASE_FNDECL (both non-static member functions)
2187 have the same signature. */
2189 int
2191 {
2192 /* One destructor overrides another if they are the same kind of
2193 destructor. */
2197 /* But a non-destructor never overrides a destructor, nor vice
2198 versa, nor do different kinds of destructors override
2199 one-another. For example, a complete object destructor does not
2200 override a deleting destructor. */
2209 {
2217 }
2219 }
2221 /* Returns TRUE if DERIVED is a binfo containing the binfo BASE as a
2222 subobject. */
2224 static bool
2226 {
2227 tree probe;
2230 {
2234 /* If we meet a virtual base, we can't follow the inheritance
2235 any more. See if the complete type of DERIVED contains
2236 such a virtual base. */
2239 }
2241 }
2244 /* The function for which we are trying to find a final overrider. */
2245 tree fn;
2246 /* The base class in which the function was declared. */
2247 tree declaring_base;
2248 /* The candidate overriders. */
2249 tree candidates;
2250 /* Path to most derived. */
2252 };
2254 /* Add the overrider along the current path to FFOD->CANDIDATES.
2255 Returns true if an overrider was found; false otherwise. */
2257 static bool
2261 {
2262 tree method;
2264 /* If BINFO is not the most derived type, try a more derived class.
2265 A definition there will overrider a definition here. */
2267 {
2268 depth--;
2272 }
2276 {
2279 /* Remove any candidates overridden by this new function. */
2281 {
2282 /* If *CANDIDATE overrides METHOD, then METHOD
2283 cannot override anything else on the list. */
2286 /* If METHOD overrides *CANDIDATE, remove *CANDIDATE. */
2289 else
2291 }
2293 /* Add the new function. */
2296 }
2299 }
2301 /* Called from find_final_overrider via dfs_walk. */
2303 static tree
2305 {
2313 }
2315 static tree
2317 {
2322 }
2324 /* Returns a TREE_LIST whose TREE_PURPOSE is the final overrider for
2325 FN and whose TREE_VALUE is the binfo for the base where the
2326 overriding occurs. BINFO (in the hierarchy dominated by the binfo
2327 DERIVED) is the base object in which FN is declared. */
2329 static tree
2331 {
2332 find_final_overrider_data ffod;
2334 /* Getting this right is a little tricky. This is valid:
2336 struct S { virtual void f (); };
2337 struct T { virtual void f (); };
2338 struct U : public S, public T { };
2340 even though calling `f' in `U' is ambiguous. But,
2342 struct R { virtual void f(); };
2343 struct S : virtual public R { virtual void f (); };
2344 struct T : virtual public R { virtual void f (); };
2345 struct U : public S, public T { };
2347 is not -- there's no way to decide whether to put `S::f' or
2348 `T::f' in the vtable for `R'.
2350 The solution is to look at all paths to BINFO. If we find
2351 different overriders along any two, then there is a problem. */
2355 /* Determine the depth of the hierarchy. */
2366 /* If there was no winner, issue an error message. */
2371 }
2373 /* Return the index of the vcall offset for FN when TYPE is used as a
2374 virtual base. */
2376 static tree
2378 {
2380 tree_pair_p p;
2388 /* There should always be an appropriate index. */
2390 }
2392 /* Update an entry in the vtable for BINFO, which is in the hierarchy
2393 dominated by T. FN is the old function; VIRTUALS points to the
2394 corresponding position in the new BINFO_VIRTUALS list. IX is the index
2395 of that entry in the list. */
2397 static void
2400 {
2401 tree b;
2402 tree overrider;
2403 tree delta;
2404 tree virtual_base;
2405 tree first_defn;
2411 /* Find the nearest primary base (possibly binfo itself) which defines
2412 this function; this is the class the caller will convert to when
2413 calling FN through BINFO. */
2415 {
2420 /* The nearest definition is from a lost primary. */
2423 }
2426 /* Find the final overrider. */
2429 {
2432 }
2435 /* Check for adjusting covariant return types. */
2443 /* If the overrider is invalid, don't even try. */
2445 {
2446 /* If FN is a covariant thunk, we must figure out the adjustment
2447 to the final base FN was converting to. As OVERRIDER_TARGET might
2448 also be converting to the return type of FN, we have to
2449 combine the two conversions here. */
2456 {
2460 }
2461 else
2465 /* Find the equivalent binfo within the return type of the
2466 overriding function. We will want the vbase offset from
2467 there. */
2469 over_return);
2472 {
2473 /* There was no existing virtual thunk (which takes
2474 precedence). So find the binfo of the base function's
2475 return type within the overriding function's return type.
2476 Fortunately we know the covariancy is valid (it
2477 has already been checked), so we can just iterate along
2478 the binfos, which have been chained in inheritance graph
2479 order. Of course it is lame that we have to repeat the
2480 search here anyway -- we should really be caching pieces
2481 of the vtable and avoiding this repeated work. */
2485 /* Find the base binfo within the overriding function's
2486 return type. We will always find a thunk_binfo, except
2487 when the covariancy is invalid (which we will have
2488 already diagnosed). */
2497 /* See if virtual inheritance is involved. */
2499 virtual_offset;
2506 {
2510 {
2511 /* We convert via virtual base. Adjust the fixed
2512 offset to be from there. */
2513 offset =
2517 }
2519 /* There was an existing fixed offset, this must be
2520 from the base just converted to, and the base the
2521 FN was thunking to. */
2523 else
2525 }
2526 }
2529 /* Replace the overriding function with a covariant thunk. We
2530 will emit the overriding function in its own slot as
2531 well. */
2534 }
2535 else
2539 /* If we need a covariant thunk, then we may need to adjust first_defn.
2540 The ABI specifies that the thunks emitted with a function are
2541 determined by which bases the function overrides, so we need to be
2542 sure that we're using a thunk for some overridden base; even if we
2543 know that the necessary this adjustment is zero, there may not be an
2544 appropriate zero-this-adjustment thunk for us to use since thunks for
2545 overriding virtual bases always use the vcall offset.
2547 Furthermore, just choosing any base that overrides this function isn't
2548 quite right, as this slot won't be used for calls through a type that
2549 puts a covariant thunk here. Calling the function through such a type
2550 will use a different slot, and that slot is the one that determines
2551 the thunk emitted for that base.
2553 So, keep looking until we find the base that we're really overriding
2554 in this slot: the nearest primary base that doesn't use a covariant
2555 thunk in this slot. */
2557 {
2559 /* We already know that the overrider needs a covariant thunk. */
2562 {
2569 }
2571 }
2573 /* Assume that we will produce a thunk that convert all the way to
2574 the final overrider, and not to an intermediate virtual base. */
2577 /* See if we can convert to an intermediate virtual base first, and then
2578 use the vcall offset located there to finish the conversion. */
2580 {
2581 /* If we find the final overrider, then we can stop
2582 walking. */
2587 /* If we find a virtual base, and we haven't yet found the
2588 overrider, then there is a virtual base between the
2589 declaring base (first_defn) and the final overrider. */
2591 {
2594 }
2595 }
2597 /* Compute the constant adjustment to the `this' pointer. The
2598 `this' pointer, when this function is called, will point at BINFO
2599 (or one of its primary bases, which are at the same offset). */
2601 /* The `this' pointer needs to be adjusted from the declaration to
2602 the nearest virtual base. */
2607 /* If the nearest definition is in a lost primary, we don't need an
2608 entry in our vtable. Except possibly in a constructor vtable,
2609 if we happen to get our primary back. In that case, the offset
2610 will be zero, as it will be a primary base. */
2612 else
2613 /* The `this' pointer needs to be adjusted from pointing to
2614 BINFO to pointing at the base where the final overrider
2615 appears. */
2626 else
2630 }
2632 /* Called from modify_all_vtables via dfs_walk. */
2634 static tree
2636 {
2638 tree virtuals;
2639 tree old_virtuals;
2643 /* A base without a vtable needs no modification, and its bases
2644 are uninteresting. */
2649 /* Don't do the primary vtable, if it's new. */
2653 /* There's no need to modify the vtable for a non-virtual primary
2654 base; we're not going to use that vtable anyhow. We do still
2655 need to do this for virtual primary bases, as they could become
2656 non-primary in a construction vtable. */
2661 /* Now, go through each of the virtual functions in the virtual
2662 function table for BINFO. Find the final overrider, and update
2663 the BINFO_VIRTUALS list appropriately. */
2666 virtuals;
2670 binfo,
2675 }
2677 /* Update all of the primary and secondary vtables for T. Create new
2678 vtables as required, and initialize their RTTI information. Each
2679 of the functions in VIRTUALS is declared in T and may override a
2680 virtual function from a base class; find and modify the appropriate
2681 entries to point to the overriding functions. Returns a list, in
2682 declaration order, of the virtual functions that are declared in T,
2683 but do not appear in the primary base class vtable, and which
2684 should therefore be appended to the end of the vtable for T. */
2686 static tree
2688 {
2692 /* Mangle the vtable name before entering dfs_walk (c++/51884). */
2696 /* Update all of the vtables. */
2699 /* Add virtual functions not already in our primary vtable. These
2700 will be both those introduced by this class, and those overridden
2701 from secondary bases. It does not include virtuals merely
2702 inherited from secondary bases. */
2704 {
2709 {
2710 /* We don't need to adjust the `this' pointer when
2711 calling this function. */
2715 /* This is a function not already in our vtable. Keep it. */
2717 }
2718 else
2719 /* We've already got an entry for this function. Skip it. */
2721 }
2724 }
2726 /* Get the base virtual function declarations in T that have the
2727 indicated NAME. */
2729 static void
2731 {
2734 /* Find virtual functions in T with the indicated NAME. */
2736 {
2740 {
2743 }
2744 }
2751 {
2754 }
2755 }
2757 /* If this declaration supersedes the declaration of
2758 a method declared virtual in the base class, then
2759 mark this field as being virtual as well. */
2761 void
2763 {
2766 /* In [temp.mem] we have:
2768 A specialization of a member function template does not
2769 override a virtual function from a base class. */
2776 /* Set DECL_VINDEX to a value that is neither an INTEGER_CST nor
2777 the error_mark_node so that we know it is an overriding
2778 function. */
2779 {
2786 }
2789 {
2795 }
2800 }
2802 /* Warn about hidden virtual functions that are not overridden in t.
2803 We know that constructors and destructors don't apply. */
2805 static void
2807 {
2810 {
2818 tree base_binfo;
2819 tree binfo;
2822 /* Iterate through all of the base classes looking for possibly
2823 hidden functions. */
2826 {
2829 }
2831 /* If there are no functions to hide, continue. */
2835 /* Remove any overridden functions. */
2837 {
2841 {
2842 /* If the method from the base class has the same
2843 signature as the method from the derived class, it
2844 has been overridden. */
2849 }
2850 }
2852 /* Now give a warning for all base functions without overriders,
2853 as they are hidden. */
2854 tree base_fndecl;
2857 {
2858 /* Here we know it is a hider, and no overrider exists. */
2860 OPT_Woverloaded_virtual,
2864 }
2865 }
2866 }
2868 /* Recursive helper for finish_struct_anon. */
2870 static void
2872 {
2874 {
2875 /* We're generally only interested in entities the user
2876 declared, but we also find nested classes by noticing
2877 the TYPE_DECL that we create implicitly. You're
2878 allowed to put one anonymous union inside another,
2879 though, so we explicitly tolerate that. We use
2880 TYPE_UNNAMED_P rather than ANON_AGGR_TYPE_P so that
2881 we also allow unnamed types used for defining fields. */
2890 {
2891 /* We already complained about static data members in
2892 finish_static_data_member_decl. */
2897 "only have public non-static data members"
2900 {
2903 {
2907 }
2908 }
2909 }
2914 /* Recurse into the anonymous aggregates to correctly handle
2915 access control (c++/24926):
2917 class A {
2918 union {
2919 union {
2920 int i;
2921 };
2922 };
2923 };
2925 int j=A().i; */
2929 }
2930 }
2932 /* Check for things that are invalid. There are probably plenty of other
2933 things we should check for also. */
2935 static void
2937 {
2939 {
2948 }
2949 }
2951 /* Add T to CLASSTYPE_DECL_LIST of current_class_type which
2952 will be used later during class template instantiation.
2953 When FRIEND_P is zero, T can be a static member data (VAR_DECL),
2954 a non-static member data (FIELD_DECL), a member function
2955 (FUNCTION_DECL), a nested type (RECORD_TYPE, ENUM_TYPE),
2956 a typedef (TYPE_DECL) or a member class template (TEMPLATE_DECL)
2957 When FRIEND_P is nonzero, T is either a friend class
2958 (RECORD_TYPE, TEMPLATE_DECL) or a friend function
2959 (FUNCTION_DECL, TEMPLATE_DECL). */
2961 void
2963 {
2964 /* Save some memory by not creating TREE_LIST if TYPE is not template. */
2969 }
2971 /* This function is called from declare_virt_assop_and_dtor via
2972 dfs_walk_all.
2974 DATA is a type that direcly or indirectly inherits the base
2975 represented by BINFO. If BINFO contains a virtual assignment [copy
2976 assignment or move assigment] operator or a virtual constructor,
2977 declare that function in DATA if it hasn't been already declared. */
2979 static tree
2981 {
2989 /* A base without a vtable needs no modification, and its bases
2990 are uninteresting. */
2994 /* If this is a primary base, then we have already looked at the
2995 virtual functions of its vtable. */
2999 {
3003 {
3008 }
3012 }
3015 }
3017 /* If the class type T has a direct or indirect base that contains a
3018 virtual assignment operator or a virtual destructor, declare that
3019 function in T if it hasn't been already declared. */
3021 static void
3023 {
3031 dfs_declare_virt_assop_and_dtor,
3033 }
3035 /* Declare the inheriting constructor for class T inherited from base
3036 constructor CTOR with the parameter array PARMS of size NPARMS. */
3038 static void
3040 {
3043 /* We don't declare an inheriting ctor that would be a default,
3044 copy or move ctor for derived or base. */
3049 {
3053 }
3062 {
3065 }
3066 }
3068 /* Declare all the inheriting constructors for class T inherited from base
3069 constructor CTOR. */
3071 static void
3073 {
3077 {
3083 }
3088 {
3092 }
3095 {
3099 }
3100 }
3102 /* Create default constructors, assignment operators, and so forth for
3103 the type indicated by T, if they are needed. CANT_HAVE_CONST_CTOR,
3104 and CANT_HAVE_CONST_ASSIGNMENT are nonzero if, for whatever reason,
3105 the class cannot have a default constructor, copy constructor
3106 taking a const reference argument, or an assignment operator taking
3107 a const reference, respectively. */
3109 static void
3113 {
3114 /* Destructor. */
3116 /* In general, we create destructors lazily. */
3125 /* [class.ctor]
3127 If there is no user-declared constructor for a class, a default
3128 constructor is implicitly declared. */
3130 {
3135 /* Don't force the declaration to get a hard answer; if the
3136 definition would have made the class non-literal, it will still be
3137 non-literal because of the base or member in question, and that
3138 gives a better diagnostic. */
3140 }
3142 /* [class.ctor]
3144 If a class definition does not explicitly declare a copy
3145 constructor, one is declared implicitly. */
3147 {
3153 }
3155 /* If there is no assignment operator, one will be created if and
3156 when it is needed. For now, just record whether or not the type
3157 of the parameter to the assignment operator will be a const or
3158 non-const reference. */
3160 {
3166 }
3168 /* We can't be lazy about declaring functions that might override
3169 a virtual function from a base class. */
3173 {
3177 {
3178 /* declare, then remove the decl */
3186 }
3187 else
3189 }
3190 }
3192 /* FIELD is a bit-field. We are finishing the processing for its
3193 enclosing type. Issue any appropriate messages and set appropriate
3194 flags. Returns false if an error has been diagnosed. */
3196 static bool
3198 {
3200 tree w;
3202 /* Extract the declared width of the bitfield, which has been
3203 temporarily stashed in DECL_BIT_FIELD_REPRESENTATIVE by grokbitfield. */
3206 /* Remove the bit-field width indicator so that the rest of the
3207 compiler does not treat that value as a qualifier. */
3210 /* Detect invalid bit-field type. */
3212 {
3215 }
3216 else
3217 {
3219 /* Avoid the non_lvalue wrapper added by fold for PLUS_EXPRs. */
3222 /* detect invalid field size. */
3228 {
3231 }
3233 {
3236 }
3238 {
3241 }
3251 {
3257 }
3258 }
3261 {
3265 }
3266 else
3267 {
3268 /* Non-bit-fields are aligned for their type. */
3272 }
3273 }
3275 /* FIELD is a non bit-field. We are finishing the processing for its
3276 enclosing type T. Issue any appropriate messages and set appropriate
3277 flags. */
3279 static bool
3281 tree t,
3284 {
3288 /* In C++98 an anonymous union cannot contain any fields which would change
3289 the settings of CANT_HAVE_CONST_CTOR and friends. */
3291 ;
3292 /* And, we don't set TYPE_HAS_CONST_COPY_CTOR, etc., for anonymous
3293 structs. So, we recurse through their fields here. */
3295 {
3300 cant_have_const_ctor,
3301 no_const_asn_ref);
3302 }
3303 /* Check members with class type for constructors, destructors,
3304 etc. */
3306 {
3307 /* Never let anything with uninheritable virtuals
3308 make it through without complaint. */
3312 {
3317 field);
3322 field);
3324 {
3328 }
3329 }
3330 else
3331 {
3344 }
3353 }
3358 /* `build_class_init_list' does not recognize
3359 non-FIELD_DECLs. */
3363 }
3365 /* Check the data members (both static and non-static), class-scoped
3366 typedefs, etc., appearing in the declaration of T. Issue
3367 appropriate diagnostics. Sets ACCESS_DECLS to a list (in
3368 declaration order) of access declarations; each TREE_VALUE in this
3369 list is a USING_DECL.
3371 In addition, set the following flags:
3373 EMPTY_P
3374 The class is empty, i.e., contains no non-static data members.
3376 CANT_HAVE_CONST_CTOR_P
3377 This class cannot have an implicitly generated copy constructor
3378 taking a const reference.
3380 CANT_HAVE_CONST_ASN_REF
3381 This class cannot have an implicitly generated assignment
3382 operator taking a const reference.
3384 All of these flags should be initialized before calling this
3385 function.
3387 Returns a pointer to the end of the TYPE_FIELDs chain; additional
3388 fields can be added by adding to this chain. */
3390 static void
3394 {
3402 /* Assume there are no access declarations. */
3404 /* Assume this class has no pointer members. */
3406 /* Assume none of the members of this class have default
3407 initializations. */
3411 {
3419 {
3420 /* Save the access declarations for our caller. */
3423 }
3430 /* FIXME: We should fold in the checking from check_methods. */
3433 /* If we've gotten this far, it's a data member, possibly static,
3434 or an enumerator. */
3438 /* When this goes into scope, it will be a non-local reference. */
3442 {
3443 /* [class.union] (C++98)
3445 If a union contains a static data member, or a member of
3446 reference type, the program is ill-formed.
3448 In C++11 [class.union] says:
3449 If a union contains a non-static data member of reference type
3450 the program is ill-formed. */
3452 {
3456 }
3459 {
3463 }
3464 }
3466 /* Perform error checking that did not get done in
3467 grokdeclarator. */
3469 {
3473 }
3475 {
3479 }
3487 /* Now it can only be a FIELD_DECL. */
3492 /* If at least one non-static data member is non-literal, the whole
3493 class becomes non-literal. Per Core/1453, volatile non-static
3494 data members and base classes are also not allowed.
3495 Note: if the type is incomplete we will complain later on. */
3500 /* A standard-layout class is a class that:
3501 ...
3502 has the same access control (Clause 11) for all non-static data members,
3503 ... */
3510 /* If this is of reference type, check if it needs an init. */
3512 {
3518 {
3519 /* ARM $12.6.2: [A member initializer list] (or, for an
3520 aggregate, initialization by a brace-enclosed list) is the
3521 only way to initialize nonstatic const and reference
3522 members. */
3525 }
3526 }
3531 {
3533 {
3534 warning_at
3537 x);
3539 }
3543 }
3547 /* We don't treat zero-width bitfields as making a class
3548 non-empty. */
3549 ;
3550 else
3551 {
3552 /* The class is non-empty. */
3554 /* The class is not even nearly empty. */
3556 /* If one of the data members contains an empty class,
3557 so does T. */
3561 }
3563 /* This is used by -Weffc++ (see below). Warn only for pointers
3564 to members which might hold dynamic memory. So do not warn
3565 for pointers to functions or pointers to members. */
3571 {
3576 }
3582 {
3584 {
3588 }
3590 {
3594 }
3595 }
3598 /* DR 148 now allows pointers to members (which are POD themselves),
3599 to be allowed in POD structs. */
3608 /* We set DECL_C_BIT_FIELD in grokbitfield.
3609 If the type and width are valid, we'll also set DECL_BIT_FIELD. */
3614 {
3619 }
3621 /* Now that we've removed bit-field widths from DECL_INITIAL,
3622 anything left in DECL_INITIAL is an NSDMI that makes the class
3623 non-aggregate in C++11. */
3627 /* If any field is const, the structure type is pseudo-const. */
3629 {
3634 {
3635 /* ARM $12.6.2: [A member initializer list] (or, for an
3636 aggregate, initialization by a brace-enclosed list) is the
3637 only way to initialize nonstatic const and reference
3638 members. */
3641 }
3642 }
3643 /* A field that is pseudo-const makes the structure likewise. */
3645 {
3650 }
3652 /* Core issue 80: A nonstatic data member is required to have a
3653 different name from the class iff the class has a
3654 user-declared constructor. */
3659 }
3661 /* Effective C++ rule 11: if a class has dynamic memory held by pointers,
3662 it should also define a copy constructor and an assignment operator to
3663 implement the correct copy semantic (deep vs shallow, etc.). As it is
3664 not feasible to check whether the constructors do allocate dynamic memory
3665 and store it within members, we approximate the warning like this:
3667 -- Warn only if there are members which are pointers
3668 -- Warn only if there is a non-trivial constructor (otherwise,
3669 there cannot be memory allocated).
3670 -- Warn only if there is a non-trivial destructor. We assume that the
3671 user at least implemented the cleanup correctly, and a destructor
3672 is needed to free dynamic memory.
3674 This seems enough for practical purposes. */
3676 && has_pointers
3680 {
3684 {
3689 }
3693 }
3695 /* Non-static data member initializers make the default constructor
3696 non-trivial. */
3698 {
3701 }
3703 /* If any of the fields couldn't be packed, unset TYPE_PACKED. */
3707 /* Check anonymous struct/anonymous union fields. */
3710 /* We've built up the list of access declarations in reverse order.
3711 Fix that now. */
3713 }
3715 /* If TYPE is an empty class type, records its OFFSET in the table of
3716 OFFSETS. */
3718 static int
3720 {
3721 splay_tree_node n;
3726 /* Record the location of this empty object in OFFSETS. */
3734 type,
3738 }
3740 /* Returns nonzero if TYPE is an empty class type and there is
3741 already an entry in OFFSETS for the same TYPE as the same OFFSET. */
3743 static int
3745 {
3746 splay_tree_node n;
3747 tree t;
3752 /* Record the location of this empty object in OFFSETS. */
3762 }
3764 /* Walk through all the subobjects of TYPE (located at OFFSET). Call
3765 F for every subobject, passing it the type, offset, and table of
3766 OFFSETS. If VBASES_P is one, then virtual non-primary bases should
3767 be traversed.
3769 If MAX_OFFSET is non-NULL, then subobjects with an offset greater
3770 than MAX_OFFSET will not be walked.
3772 If F returns a nonzero value, the traversal ceases, and that value
3773 is returned. Otherwise, returns zero. */
3775 static int
3777 subobject_offset_fn f,
3778 tree offset,
3779 splay_tree offsets,
3780 tree max_offset,
3782 {
3786 /* If this OFFSET is bigger than the MAX_OFFSET, then we should
3787 stop. */
3795 {
3798 }
3801 {
3802 tree field;
3803 tree binfo;
3806 /* Avoid recursing into objects that are not interesting. */
3810 /* Record the location of TYPE. */
3815 /* Iterate through the direct base classes of TYPE. */
3819 {
3820 tree binfo_offset;
3825 tree orig_binfo;
3826 /* We cannot rely on BINFO_OFFSET being set for the base
3827 class yet, but the offsets for direct non-virtual
3828 bases can be calculated by going back to the TYPE. */
3831 offset,
3835 f,
3836 binfo_offset,
3837 offsets,
3838 max_offset,
3842 }
3845 {
3849 /* Iterate through the virtual base classes of TYPE. In G++
3850 3.2, we included virtual bases in the direct base class
3851 loop above, which results in incorrect results; the
3852 correct offsets for virtual bases are only known when
3853 working with the most derived type. */
3857 {
3859 f,
3861 offset,
3863 offsets,
3864 max_offset,
3868 }
3869 else
3870 {
3871 /* We still have to walk the primary base, if it is
3872 virtual. (If it is non-virtual, then it was walked
3873 above.) */
3879 {
3880 r = (walk_subobject_offsets
3885 }
3886 }
3887 }
3889 /* Iterate through the fields of TYPE. */
3894 {
3895 tree field_offset;
3900 f,
3902 offset,
3903 field_offset),
3904 offsets,
3905 max_offset,
3909 }
3910 }
3912 {
3915 tree index;
3917 /* Avoid recursing into objects that are not interesting. */
3920 || !domain
3924 /* Step through each of the elements in the array. */
3928 {
3930 f,
3931 offset,
3932 offsets,
3933 max_offset,
3939 /* If this new OFFSET is bigger than the MAX_OFFSET, then
3940 there's no point in iterating through the remaining
3941 elements of the array. */
3944 }
3945 }
3948 }
3950 /* Record all of the empty subobjects of TYPE (either a type or a
3951 binfo). If IS_DATA_MEMBER is true, then a non-static data member
3952 is being placed at OFFSET; otherwise, it is a base class that is
3953 being placed at OFFSET. */
3955 static void
3957 tree offset,
3958 splay_tree offsets,
3960 {
3961 tree max_offset;
3962 /* If recording subobjects for a non-static data member or a
3963 non-empty base class , we do not need to record offsets beyond
3964 the size of the biggest empty class. Additional data members
3965 will go at the end of the class. Additional base classes will go
3966 either at offset zero (if empty, in which case they cannot
3967 overlap with offsets past the size of the biggest empty class) or
3968 at the end of the class.
3970 However, if we are placing an empty base class, then we must record
3971 all offsets, as either the empty class is at offset zero (where
3972 other empty classes might later be placed) or at the end of the
3973 class (where other objects might then be placed, so other empty
3974 subobjects might later overlap). */
3978 else
3982 }
3984 /* Returns nonzero if any of the empty subobjects of TYPE (located at
3985 OFFSET) conflict with entries in OFFSETS. If VBASES_P is nonzero,
3986 virtual bases of TYPE are examined. */
3988 static int
3990 tree offset,
3991 splay_tree offsets,
3993 {
3994 splay_tree_node max_node;
3996 /* Get the node in OFFSETS that indicates the maximum offset where
3997 an empty subobject is located. */
3999 /* If there aren't any empty subobjects, then there's no point in
4000 performing this check. */
4006 vbases_p);
4007 }
4009 /* DECL is a FIELD_DECL corresponding either to a base subobject of a
4010 non-static data member of the type indicated by RLI. BINFO is the
4011 binfo corresponding to the base subobject, OFFSETS maps offsets to
4012 types already located at those offsets. This function determines
4013 the position of the DECL. */
4015 static void
4017 tree decl,
4018 tree binfo,
4019 splay_tree offsets)
4020 {
4023 tree type;
4026 {
4027 /* For the purposes of determining layout conflicts, we want to
4028 use the class type of BINFO; TREE_TYPE (DECL) will be the
4029 CLASSTYPE_AS_BASE version, which does not contain entries for
4030 zero-sized bases. */
4033 }
4034 else
4035 {
4038 }
4040 /* Try to place the field. It may take more than one try if we have
4041 a hard time placing the field without putting two objects of the
4042 same type at the same address. */
4044 {
4047 /* Place this field. */
4051 /* We have to check to see whether or not there is already
4052 something of the same type at the offset we're about to use.
4053 For example, consider:
4055 struct S {};
4056 struct T : public S { int i; };
4057 struct U : public S, public T {};
4059 Here, we put S at offset zero in U. Then, we can't put T at
4060 offset zero -- its S component would be at the same address
4061 as the S we already allocated. So, we have to skip ahead.
4062 Since all data members, including those whose type is an
4063 empty class, have nonzero size, any overlap can happen only
4064 with a direct or indirect base-class -- it can't happen with
4065 a data member. */
4066 /* In a union, overlap is permitted; all members are placed at
4067 offset zero. */
4072 {
4073 /* Strip off the size allocated to this field. That puts us
4074 at the first place we could have put the field with
4075 proper alignment. */
4078 /* Bump up by the alignment required for the type. */
4079 rli->bitpos
4085 }
4088 {
4089 /* Before ABI v9, we were giving nullptr_t alignment of 1; if
4090 the offset wasn't aligned like a pointer when we started to
4091 layout this field, that affects its position. */
4094 {
4097 "alignment of %qD increased in -fabi-version=9 "
4099 else
4102 }
4104 }
4105 else
4106 /* There was no conflict. We're done laying out this field. */
4108 }
4110 /* Now that we know where it will be placed, update its
4111 BINFO_OFFSET. */
4113 /* Indirect virtual bases may have a nonzero BINFO_OFFSET at
4114 this point because their BINFO_OFFSET is copied from another
4115 hierarchy. Therefore, we may not need to add the entire
4116 OFFSET. */
4122 }
4124 /* Returns true if TYPE is empty and OFFSET is nonzero. */
4126 static int
4128 tree offset,
4130 {
4132 }
4134 /* Layout the empty base BINFO. EOC indicates the byte currently just
4135 past the end of the class, and should be correctly aligned for a
4136 class of the type indicated by BINFO; OFFSETS gives the offsets of
4137 the empty bases allocated so far. T is the most derived
4138 type. Return nonzero iff we added it at the end. */
4140 static bool
4143 {
4144 tree alignment;
4148 /* This routine should only be used for empty classes. */
4153 propagate_binfo_offsets
4157 /* This is an empty base class. We first try to put it at offset
4158 zero. */
4161 offsets,
4163 {
4164 /* That didn't work. Now, we move forward from the next
4165 available spot in the class. */
4169 {
4172 offsets,
4174 /* We finally found a spot where there's no overlap. */
4177 /* There's overlap here, too. Bump along to the next spot. */
4179 }
4180 }
4183 {
4188 }
4191 }
4193 /* Build the FIELD_DECL for BASETYPE as a base of T, add it to the chain of
4194 fields at NEXT_FIELD, and return it. */
4196 static tree
4198 {
4199 /* Create the FIELD_DECL. */
4207 /* CLASSTYPE_SIZE is one byte, but the field needs to have size zero. */
4209 else
4210 {
4213 }
4219 /* Add the new FIELD_DECL to the list of fields for T. */
4225 }
4227 /* Layout the base given by BINFO in the class indicated by RLI.
4228 *BASE_ALIGN is a running maximum of the alignments of
4229 any base class. OFFSETS gives the location of empty base
4230 subobjects. T is the most derived type. Return nonzero if the new
4231 object cannot be nearly-empty. A new FIELD_DECL is inserted at
4232 *NEXT_FIELD, unless BINFO is for an empty base class.
4234 Returns the location at which the next field should be inserted. */
4239 {
4244 /* This error is now reported in xref_tag, thus giving better
4245 location information. */
4248 /* Place the base class. */
4250 {
4251 tree decl;
4253 /* The containing class is non-empty because it has a non-empty
4254 base class. */
4257 /* Create the FIELD_DECL. */
4260 /* Try to place the field. It may take more than one try if we
4261 have a hard time placing the field without putting two
4262 objects of the same type at the same address. */
4264 }
4265 else
4266 {
4267 tree eoc;
4270 /* On some platforms (ARM), even empty classes will not be
4271 byte-aligned. */
4276 /* A nearly-empty class "has no proper base class that is empty,
4277 not morally virtual, and at an offset other than zero." */
4279 {
4282 /* The check above (used in G++ 3.2) is insufficient because
4283 an empty class placed at offset zero might itself have an
4284 empty base at a nonzero offset. */
4286 empty_base_at_nonzero_offset_p,
4287 size_zero_node,
4292 }
4294 /* We used to not create a FIELD_DECL for empty base classes because of
4295 back end issues with overlapping FIELD_DECLs, but that doesn't seem to
4296 be a problem anymore. We need them to handle initialization of C++17
4297 aggregate bases. */
4299 {
4304 }
4306 /* An empty virtual base causes a class to be non-empty
4307 -- but in that case we do not need to clear CLASSTYPE_EMPTY_P
4308 here because that was already done when the virtual table
4309 pointer was created. */
4310 }
4312 /* Record the offsets of BINFO and its base subobjects. */
4315 offsets,
4319 }
4321 /* Layout all of the non-virtual base classes. Record empty
4322 subobjects in OFFSETS. T is the most derived type. Return nonzero
4323 if the type cannot be nearly empty. The fields created
4324 corresponding to the base classes will be inserted at
4325 *NEXT_FIELD. */
4327 static void
4330 {
4331 /* Chain to hold all the new FIELD_DECLs which stand in for base class
4332 subobjects. */
4337 /* The primary base class is always allocated first. */
4342 /* Now allocate the rest of the bases. */
4344 {
4345 tree base_binfo;
4349 /* The primary base was already allocated above, so we don't
4350 need to allocate it again here. */
4354 /* Virtual bases are added at the end (a primary virtual base
4355 will have already been added). */
4361 }
4362 }
4364 /* Go through the TYPE_FIELDS of T issuing any appropriate
4365 diagnostics, figuring out which methods override which other
4366 methods, and so forth. */
4368 static void
4370 {
4373 {
4379 /* The name of the field is the original field name
4380 Save this in auxiliary field for later overloading. */
4382 {
4386 }
4388 /* All user-provided destructors are non-trivial.
4389 Constructors and assignment ops are handled in
4390 grok_special_member_properties. */
4397 "%<transaction_safe_dynamic%> may only be specified for "
4399 }
4400 }
4402 /* FN is a constructor or destructor. Clone the declaration to create
4403 a specialized in-charge or not-in-charge version, as indicated by
4404 NAME. */
4406 static tree
4408 {
4409 tree parms;
4410 tree clone;
4412 /* Copy the function. */
4414 /* Reset the function name. */
4416 /* Remember where this function came from. */
4418 /* Make it easy to find the CLONE given the FN. */
4422 /* If this is a template, do the rest on the DECL_TEMPLATE_RESULT. */
4424 {
4431 }
4432 else
4433 {
4434 // Clone constraints.
4438 }
4443 /* There's no pending inline data for this function. */
4447 /* The base-class destructor is not virtual. */
4449 {
4453 }
4459 /* If there was an in-charge parameter, drop it from the function
4460 type. */
4462 {
4463 tree basetype;
4464 tree parmtypes;
4465 tree exceptions;
4470 /* Skip the `this' parameter. */
4472 /* Skip the in-charge parameter. */
4474 /* And the VTT parm, in a complete [cd]tor. */
4479 {
4480 /* If we're omitting inherited parms, that just leaves the VTT. */
4483 }
4487 parmtypes);
4490 exceptions);
4494 }
4496 /* Copy the function parameters. */
4498 /* Remove the in-charge parameter. */
4500 {
4504 }
4505 /* And the VTT parm, in a complete [cd]tor. */
4507 {
4510 else
4511 {
4515 }
4516 }
4518 /* A base constructor inheriting from a virtual base doesn't get the
4519 arguments. */
4524 {
4527 }
4529 /* Create the RTL for this function. */
4534 }
4536 /* Implementation of DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P, do
4537 not invoke this function directly.
4539 For a non-thunk function, returns the address of the slot for storing
4540 the function it is a clone of. Otherwise returns NULL_TREE.
4542 If JUST_TESTING, looks through TEMPLATE_DECL and returns NULL if
4543 cloned_function is unset. This is to support the separate
4544 DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P modes; using the latter
4545 on a template makes sense, but not the former. */
4547 tree *
4549 {
4557 {
4558 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
4561 else
4562 #endif
4564 }
4569 else
4571 }
4573 /* Produce declarations for all appropriate clones of FN. If
4574 UPDATE_METHODS is true, the clones are added to the
4575 CLASSTYPE_MEMBER_VEC. */
4577 void
4579 {
4580 tree clone;
4582 /* Avoid inappropriate cloning. */
4588 {
4589 /* For each constructor, we need two variants: an in-charge version
4590 and a not-in-charge version. */
4597 }
4598 else
4599 {
4602 /* For each destructor, we need three variants: an in-charge
4603 version, a not-in-charge version, and an in-charge deleting
4604 version. We clone the deleting version first because that
4605 means it will go second on the TYPE_FIELDS list -- and that
4606 corresponds to the correct layout order in the virtual
4607 function table.
4609 For a non-virtual destructor, we do not build a deleting
4610 destructor. */
4612 {
4616 }
4623 }
4625 /* Note that this is an abstract function that is never emitted. */
4627 }
4629 /* DECL is an in charge constructor, which is being defined. This will
4630 have had an in class declaration, from whence clones were
4631 declared. An out-of-class definition can specify additional default
4632 arguments. As it is the clones that are involved in overload
4633 resolution, we must propagate the information from the DECL to its
4634 clones. */
4636 void
4638 {
4639 tree clone;
4643 {
4650 /* Skip the 'this' parameter. */
4666 {
4668 {
4672 }
4678 {
4679 /* A default parameter has been added. Adjust the
4680 clone's parameters. */
4684 tree type;
4689 {
4692 clone_parms);
4694 }
4697 clone_parms);
4706 }
4707 }
4709 }
4710 }
4712 /* For each of the constructors and destructors in T, create an
4713 in-charge and not-in-charge variant. */
4715 static void
4717 {
4718 /* While constructors can be via a using declaration, at this point
4719 we no longer need to know that. */
4725 }
4727 /* Deduce noexcept for a destructor DTOR. */
4729 void
4731 {
4734 noexcept_deferred_spec);
4735 }
4737 /* Subroutine of set_one_vmethod_tm_attributes. Search base classes
4738 of TYPE for virtual functions which FNDECL overrides. Return a
4739 mask of the tm attributes found therein. */
4741 static int
4743 {
4745 tree base_binfo;
4749 {
4757 {
4761 else
4764 }
4765 else
4767 }
4770 }
4772 /* Subroutine of set_method_tm_attributes. Handle the checks and
4773 inheritance for one virtual method FNDECL. */
4775 static void
4777 {
4778 tree tm_attr;
4783 /* If FNDECL doesn't actually override anything (i.e. T is the
4784 class that first declares FNDECL virtual), then we're done. */
4791 /* Intel STM Language Extension 3.0, Section 4.2 table 4:
4792 tm_pure must match exactly, otherwise no weakening of
4793 tm_safe > tm_callable > nothing. */
4794 /* ??? The tm_pure attribute didn't make the transition to the
4795 multivendor language spec. */
4797 {
4799 {
4802 }
4803 }
4804 /* If the overridden function is tm_pure, then FNDECL must be. */
4807 /* Look for base class combinations that cannot be satisfied. */
4809 {
4815 }
4816 /* If FNDECL did not declare an attribute, then inherit the most
4817 restrictive one. */
4819 {
4821 }
4822 /* Otherwise validate that we're not weaker than a function
4823 that is being overridden. */
4824 else
4825 {
4829 }
4832 err_override:
4836 }
4838 /* For each of the methods in T, propagate a class-level tm attribute. */
4840 static void
4842 {
4845 /* Don't bother collecting tm attributes if transactional memory
4846 support is not enabled. */
4850 /* Process virtual methods first, as they inherit directly from the
4851 base virtual function and also require validation of new attributes. */
4853 {
4854 tree vchain;
4857 {
4862 }
4863 }
4865 /* If the class doesn't have an attribute, nothing more to do. */
4870 /* Any method that does not yet have a tm attribute inherits
4871 the one from the class. */
4876 }
4878 /* Returns true if FN is a default constructor. */
4880 bool
4882 {
4885 }
4887 /* Returns true iff class T has a user-defined constructor that can be called
4888 with more than zero arguments. */
4890 bool
4892 {
4897 {
4904 }
4907 }
4909 /* Returns the defaulted constructor if T has one. Otherwise, returns
4910 NULL_TREE. */
4912 tree
4914 {
4919 {
4925 }
4928 }
4930 /* Returns true iff FN is a user-provided function, i.e. user-declared
4931 and not defaulted at its first declaration. */
4933 bool
4935 {
4938 else
4942 }
4944 /* Returns true iff class T has a user-provided constructor. */
4946 bool
4948 {
4960 }
4962 /* Returns true iff class T has a user-provided or explicit constructor. */
4964 bool
4966 {
4974 {
4978 }
4981 }
4983 /* Returns true iff class T has a non-user-provided (i.e. implicitly
4984 declared or explicitly defaulted in the class body) default
4985 constructor. */
4987 bool
4989 {
4996 {
5002 }
5005 }
5007 /* TYPE is being used as a virtual base, and has a non-trivial move
5008 assignment. Return true if this is due to there being a user-provided
5009 move assignment in TYPE or one of its subobjects; if there isn't, then
5010 multiple move assignment can't cause any harm. */
5012 bool
5014 {
5015 /* Does the type itself have a user-provided move assignment operator? */
5023 /* Do any of its bases? */
5025 tree base_binfo;
5030 /* Or non-static data members? */
5032 {
5037 }
5039 /* Seems not. */
5041 }
5043 /* If default-initialization leaves part of TYPE uninitialized, returns
5044 a DECL for the field or TYPE itself (DR 253). */
5046 tree
5048 {
5059 {
5063 }
5068 {
5072 }
5075 }
5077 /* Returns true iff for class T, a trivial synthesized default constructor
5078 would be constexpr. */
5080 bool
5082 {
5083 /* A defaulted trivial default constructor is constexpr
5084 if there is nothing to initialize. */
5087 }
5089 /* Returns true iff class T has a constexpr default constructor. */
5091 bool
5093 {
5094 tree fns;
5097 {
5098 /* The caller should have stripped an enclosing array. */
5101 }
5103 {
5106 /* Non-trivial, we need to check subobject constructors. */
5108 }
5111 }
5113 /* Returns true iff class T has a constexpr default constructor or has an
5114 implicitly declared default constructor that we can't tell if it's constexpr
5115 without forcing a lazy declaration (which might cause undesired
5116 instantiations). */
5118 bool
5120 {
5123 /* Assume it's constexpr. */
5126 }
5128 /* Returns true iff class TYPE has a virtual destructor. */
5130 bool
5132 {
5133 tree dtor;
5141 }
5143 /* Returns true iff T, a class, has a move-assignment or
5144 move-constructor. Does not lazily declare either.
5145 If USER_P is false, any move function will do. If it is true, the
5146 move function must be user-declared.
5148 Note that user-declared here is different from "user-provided",
5149 which doesn't include functions that are defaulted in the
5150 class. */
5152 bool
5154 {
5172 }
5174 /* Nonzero if we need to build up a constructor call when initializing an
5175 object of this class, either because it has a user-declared constructor
5176 or because it doesn't have a default constructor (so we need to give an
5177 error if no initializer is provided). Use TYPE_NEEDS_CONSTRUCTING when
5178 what you care about is whether or not an object can be produced by a
5179 constructor (e.g. so we don't set TREE_READONLY on const variables of
5180 such type); use this function when what you care about is whether or not
5181 to try to call a constructor to create an object. The latter case is
5182 the former plus some cases of constructors that cannot be called. */
5184 bool
5186 {
5187 tree inner;
5197 /* A user-declared constructor might be private, and a constructor might
5198 be trivial but deleted. */
5201 {
5206 }
5208 }
5210 /* Like type_build_ctor_call, but for destructors. */
5212 bool
5214 {
5215 tree inner;
5224 /* A user-declared destructor might be private, and a destructor might
5225 be trivial but deleted. */
5228 {
5233 }
5235 }
5237 /* Remove all zero-width bit-fields from T. */
5239 static void
5241 {
5246 {
5249 /* We should not be confused by the fact that grokbitfield
5250 temporarily sets the width of the bit field into
5251 DECL_BIT_FIELD_REPRESENTATIVE (*fieldsp).
5252 check_bitfield_decl eventually sets DECL_SIZE (*fieldsp)
5253 to that width. */
5257 else
5259 }
5260 }
5262 /* Returns TRUE iff we need a cookie when dynamically allocating an
5263 array whose elements have the indicated class TYPE. */
5265 static bool
5267 {
5268 tree fns;
5273 /* If there's a non-trivial destructor, we need a cookie. In order
5274 to iterate through the array calling the destructor for each
5275 element, we'll have to know how many elements there are. */
5279 /* If the usual deallocation function is a two-argument whose second
5280 argument is of type `size_t', then we have to pass the size of
5281 the array to the deallocation function, so we will need to store
5282 a cookie. */
5286 /* If there are no `operator []' members, or the lookup is
5287 ambiguous, then we don't need a cookie. */
5290 /* Loop through all of the functions. */
5292 {
5295 /* See if this function is a one-argument delete function. If
5296 it is, then it will be the usual deallocation function. */
5300 /* Do not consider this function if its second argument is an
5301 ellipsis. */
5304 /* Otherwise, if we have a two-argument function and the second
5305 argument is `size_t', it will be the usual deallocation
5306 function -- unless there is one-argument function, too. */
5310 }
5313 }
5315 /* Finish computing the `literal type' property of class type T.
5317 At this point, we have already processed base classes and
5318 non-static data members. We need to check whether the copy
5319 constructor is trivial, the destructor is trivial, and there
5320 is a trivial default constructor or at least one constexpr
5321 constructor other than the copy constructor. */
5323 static void
5325 {
5326 tree fn;
5338 /* C++14 DR 1684 removed this restriction. */
5346 {
5350 "enclosing class of %<constexpr%> non-static member "
5353 }
5354 }
5356 /* T is a non-literal type used in a context which requires a constant
5357 expression. Explain why it isn't literal. */
5359 void
5361 {
5371 /* Already explained. */
5377 " %qT is a closure type, which is only literal in "
5385 {
5387 " %q+T is not an aggregate, does not have a trivial "
5388 "default constructor, and has no %<constexpr%> constructor that "
5391 /* Note that we can't simply call locate_ctor because when the
5392 constructor is deleted it just returns NULL_TREE. */
5394 {
5401 {
5404 else
5407 }
5408 }
5409 }
5410 else
5411 {
5415 {
5418 {
5424 }
5425 }
5427 {
5428 tree ftype;
5433 {
5436 field);
5439 }
5443 }
5444 }
5445 }
5447 /* Check the validity of the bases and members declared in T. Add any
5448 implicitly-generated functions (like copy-constructors and
5449 assignment operators). Compute various flag bits (like
5450 CLASSTYPE_NON_LAYOUT_POD_T) for T. This routine works purely at the C++
5451 level: i.e., independently of the ABI in use. */
5453 static void
5455 {
5456 /* Nonzero if the implicitly generated copy constructor should take
5457 a non-const reference argument. */
5459 /* Nonzero if the implicitly generated assignment operator
5460 should take a non-const reference argument. */
5462 tree access_decls;
5465 tree fn;
5467 /* By default, we use const reference arguments and generate default
5468 constructors. */
5472 /* Check all the base-classes and set FMEM members to point to arrays
5473 of potential interest. */
5476 /* Deduce noexcept on destructor. This needs to happen after we've set
5477 triviality flags appropriately for our bases. */
5482 /* Check all the method declarations. */
5485 /* Save the initial values of these flags which only indicate whether
5486 or not the class has user-provided functions. As we analyze the
5487 bases and members we can set these flags for other reasons. */
5491 /* Check all the data member declarations. We cannot call
5492 check_field_decls until we have called check_bases check_methods,
5493 as check_field_decls depends on TYPE_HAS_NONTRIVIAL_DESTRUCTOR
5494 being set appropriately. */
5499 /* A nearly-empty class has to be vptr-containing; a nearly empty
5500 class contains just a vptr. */
5504 /* Do some bookkeeping that will guide the generation of implicitly
5505 declared member functions. */
5508 /* We need to call a constructor for this class if it has a
5509 user-provided constructor, or if the default constructor is going
5510 to initialize the vptr. (This is not an if-and-only-if;
5511 TYPE_NEEDS_CONSTRUCTING is set elsewhere if bases or members
5512 themselves need constructing.) */
5515 /* [dcl.init.aggr]
5517 An aggregate is an array or a class with no user-provided
5518 constructors ... and no virtual functions.
5520 Again, other conditions for being an aggregate are checked
5521 elsewhere. */
5525 /* This is the C++98/03 definition of POD; it changed in C++0x, but we
5526 retain the old definition internally for ABI reasons. */
5535 /* If the only explicitly declared default constructor is user-provided,
5536 set TYPE_HAS_COMPLEX_DFLT. */
5542 /* Warn if a public base of a polymorphic type has an accessible
5543 non-virtual destructor. It is only now that we know the class is
5544 polymorphic. Although a polymorphic base will have a already
5545 been diagnosed during its definition, we warn on use too. */
5547 {
5550 tree base_binfo;
5554 {
5562 basetype);
5563 }
5564 }
5566 /* If the class has no user-declared constructor, but does have
5567 non-static const or reference data members that can never be
5568 initialized, issue a warning. */
5570 /* Classes with user-declared constructors are presumed to
5571 initialize these members. */
5573 /* Aggregates can be initialized with brace-enclosed
5574 initializers. */
5576 {
5577 tree field;
5580 {
5581 tree type;
5598 }
5599 }
5601 /* Synthesize any needed methods. */
5603 cant_have_const_ctor,
5604 no_const_asn_ref);
5606 /* Check defaulted declarations here so we have cant_have_const_ctor
5607 and don't need to worry about clones. */
5612 {
5615 {
5616 bool imp_const_p
5622 /* If the function is defaulted outside the class, we just
5623 give the synthesis error. */
5626 }
5628 }
5631 {
5632 /* "This class type is not an aggregate." */
5634 }
5636 /* Compute the 'literal type' property before we
5637 do anything with non-static member functions. */
5640 /* Create the in-charge and not-in-charge variants of constructors
5641 and destructors. */
5644 /* Process the using-declarations. */
5648 /* Figure out whether or not we will need a cookie when dynamically
5649 allocating an array of this type. */
5652 }
5654 /* If T needs a pointer to its virtual function table, set TYPE_VFIELD
5655 accordingly. If a new vfield was created (because T doesn't have a
5656 primary base class), then the newly created field is returned. It
5657 is not added to the TYPE_FIELDS list; it is the caller's
5658 responsibility to do that. Accumulate declared virtual functions
5659 on VIRTUALS_P. */
5661 static tree
5663 {
5664 tree fn;
5666 /* Collect the virtual functions declared in T. */
5671 {
5680 }
5682 /* If we couldn't find an appropriate base class, create a new field
5683 here. Even if there weren't any new virtual functions, we might need a
5684 new virtual function table if we're supposed to include vptrs in
5685 all classes that need them. */
5687 {
5688 /* We build this decl with vtbl_ptr_type_node, which is a
5689 `vtable_entry_type*'. It might seem more precise to use
5690 `vtable_entry_type (*)[N]' where N is the number of virtual
5691 functions. However, that would require the vtable pointer in
5692 base classes to have a different type than the vtable pointer
5693 in derived classes. We could make that happen, but that
5694 still wouldn't solve all the problems. In particular, the
5695 type-based alias analysis code would decide that assignments
5696 to the base class vtable pointer can't alias assignments to
5697 the derived class vtable pointer, since they have different
5698 types. Thus, in a derived class destructor, where the base
5699 class constructor was inlined, we could generate bad code for
5700 setting up the vtable pointer.
5702 Therefore, we use one type for all vtable pointers. We still
5703 use a type-correct type; it's just doesn't indicate the array
5704 bounds. That's better than using `void*' or some such; it's
5705 cleaner, and it let's the alias analysis code know that these
5706 stores cannot alias stores to void*! */
5707 tree field;
5720 /* This class is non-empty. */
5724 }
5727 }
5729 /* Add OFFSET to all base types of BINFO which is a base in the
5730 hierarchy dominated by T.
5732 OFFSET, which is a type offset, is number of bytes. */
5734 static void
5736 {
5738 tree primary_binfo;
5739 tree base_binfo;
5741 /* Update BINFO's offset. */
5746 offset));
5748 /* Find the primary base class. */
5754 /* Scan all of the bases, pushing the BINFO_OFFSET adjust
5755 downwards. */
5757 {
5758 /* Don't do the primary base twice. */
5766 }
5767 }
5769 /* Set BINFO_OFFSET for all of the virtual bases for RLI->T. Update
5770 TYPE_ALIGN and TYPE_SIZE for T. OFFSETS gives the location of
5771 empty subobjects of T. */
5773 static void
5775 {
5776 tree vbase;
5783 /* Find the last field. The artificial fields created for virtual
5784 bases will go after the last extant field to date. */
5789 /* Go through the virtual bases, allocating space for each virtual
5790 base that is not already a primary base class. These are
5791 allocated in inheritance graph order. */
5793 {
5798 {
5799 /* This virtual base is not a primary base of any class in the
5800 hierarchy, so we have to add space for it. */
5803 }
5804 }
5805 }
5807 /* Returns the offset of the byte just past the end of the base class
5808 BINFO. */
5810 static tree
5812 {
5813 tree size;
5818 /* An empty class has zero CLASSTYPE_SIZE_UNIT, but we need to
5819 allocate some space for it. It cannot have virtual bases, so
5820 TYPE_SIZE_UNIT is fine. */
5822 else
5826 }
5828 /* Returns the offset of the byte just past the end of the base class
5829 with the highest offset in T. If INCLUDE_VIRTUALS_P is zero, then
5830 only non-virtual bases are included. */
5832 static tree
5834 {
5837 tree binfo;
5838 tree base_binfo;
5839 tree offset;
5844 {
5854 }
5859 {
5863 }
5866 }
5868 /* Warn about bases of T that are inaccessible because they are
5869 ambiguous. For example:
5871 struct S {};
5872 struct T : public S {};
5873 struct U : public S, public T {};
5875 Here, `(S*) new U' is not allowed because there are two `S'
5876 subobjects of U. */
5878 static void
5880 {
5883 tree basetype;
5884 tree binfo;
5885 tree base_binfo;
5887 /* If there are no repeated bases, nothing can be ambiguous. */
5891 /* Check direct bases. */
5894 {
5900 }
5902 /* Check for ambiguous virtual bases. */
5906 {
5912 }
5913 }
5915 /* Compare two INTEGER_CSTs K1 and K2. */
5917 static int
5919 {
5921 }
5923 /* Increase the size indicated in RLI to account for empty classes
5924 that are "off the end" of the class. */
5926 static void
5928 {
5929 tree eoc;
5930 tree rli_size;
5932 /* It might be the case that we grew the class to allocate a
5933 zero-sized base class. That won't be reflected in RLI, yet,
5934 because we are willing to overlay multiple bases at the same
5935 offset. However, now we need to make sure that RLI is big enough
5936 to reflect the entire class. */
5941 {
5942 /* The size should have been rounded to a whole byte. */
5945 rli->bitpos
5954 }
5955 }
5957 /* Calculate the TYPE_SIZE, TYPE_ALIGN, etc for T. Calculate
5958 BINFO_OFFSETs for all of the base-classes. Position the vtable
5959 pointer. Accumulate declared virtual functions on VIRTUALS_P. */
5961 static void
5963 {
5964 tree non_static_data_members;
5965 tree field;
5966 tree vptr;
5967 record_layout_info rli;
5968 /* Maps offsets (represented as INTEGER_CSTs) to a TREE_LIST of
5969 types that appear at that offset. */
5970 splay_tree empty_base_offsets;
5971 /* True if the last field laid out was a bit-field. */
5973 /* The location at which the next field should be inserted. */
5976 /* Keep track of the first non-static data member. */
5979 /* Start laying out the record. */
5982 /* Mark all the primary bases in the hierarchy. */
5985 /* Create a pointer to our virtual function table. */
5988 /* The vptr is always the first thing in the class. */
5990 {
5995 }
5996 else
5999 /* Build FIELD_DECLs for all of the non-virtual base-types. */
6004 /* Layout the non-static data members. */
6006 {
6007 tree type;
6008 tree padding;
6010 /* We still pass things that aren't non-static data members to
6011 the back end, in case it wants to do something with them. */
6013 {
6015 /* If the static data member has incomplete type, keep track
6016 of it so that it can be completed later. (The handling
6017 of pending statics in finish_record_layout is
6018 insufficient; consider:
6020 struct S1;
6021 struct S2 { static S1 s1; };
6023 At this point, finish_record_layout will be called, but
6024 S1 is still incomplete.) */
6026 {
6028 /* The visibility of static data members is determined
6029 at their point of declaration, not their point of
6030 definition. */
6032 }
6034 }
6042 /* If this field is a bit-field whose width is greater than its
6043 type, then there are some special rules for allocating
6044 it. */
6047 {
6049 /* We must allocate the bits as if suitably aligned for the
6050 longest integer type that fits in this many bits. Then,
6051 we are supposed to use the left over bits as additional
6052 padding. */
6054 /* Do not pick a type bigger than MAX_FIXED_MODE_SIZE. */
6062 {
6064 /* Too big, so our current guess is what we want. */
6066 /* Not bigger than limit, ok */
6068 }
6070 /* Figure out how much additional padding is required. */
6072 /* In a union, the padding field must have the full width
6073 of the bit-field; all fields start at offset zero. */
6075 else
6082 /* An unnamed bitfield does not normally affect the
6083 alignment of the containing class on a target where
6084 PCC_BITFIELD_TYPE_MATTERS. But, the C++ ABI does not
6085 make any exceptions for unnamed bitfields when the
6086 bitfields are longer than their types. Therefore, we
6087 temporarily give the field a name. */
6089 {
6092 }
6098 empty_base_offsets);
6101 /* Now that layout has been performed, set the size of the
6102 field to the size of its declared type; the rest of the
6103 field is effectively invisible. */
6105 /* We must also reset the DECL_MODE of the field. */
6107 }
6108 else
6110 empty_base_offsets);
6112 /* Remember the location of any empty classes in FIELD. */
6115 empty_base_offsets,
6118 /* If a bit-field does not immediately follow another bit-field,
6119 and yet it starts in the middle of a byte, we have failed to
6120 comply with the ABI. */
6123 /* The TREE_NO_WARNING flag gets set by Objective-C when
6124 laying out an Objective-C class. The ObjC ABI differs
6125 from the C++ ABI, and so we do not want a warning
6126 here. */
6128 && !last_field_was_bitfield
6131 bitsize_unit_node)))
6133 "offset of %qD is not ABI-compliant and may "
6136 /* The middle end uses the type of expressions to determine the
6137 possible range of expression values. In order to optimize
6138 "x.i > 7" to "false" for a 2-bit bitfield "i", the middle end
6139 must be made aware of the width of "i", via its type.
6141 Because C++ does not have integer types of arbitrary width,
6142 we must (for the purposes of the front end) convert from the
6143 type assigned here to the declared type of the bitfield
6144 whenever a bitfield expression is used as an rvalue.
6145 Similarly, when assigning a value to a bitfield, the value
6146 must be converted to the type given the bitfield here. */
6148 {
6153 {
6160 }
6161 }
6163 /* If we needed additional padding after this field, add it
6164 now. */
6166 {
6167 tree padding_field;
6170 FIELD_DECL,
6171 NULL_TREE,
6172 char_type_node);
6180 NULL_TREE,
6181 empty_base_offsets);
6182 }
6185 }
6188 {
6189 /* Make sure that we are on a byte boundary so that the size of
6190 the class without virtual bases will always be a round number
6191 of bytes. */
6194 }
6196 /* Delete all zero-width bit-fields from the list of fields. Now
6197 that the type is laid out they are no longer important. */
6201 {
6202 /* T needs a different layout as a base (eliding virtual bases
6203 or whatever). Create that version. */
6206 /* If the ABI version is not at least two, and the last
6207 field was a bit-field, RLI may not be on a byte
6208 boundary. In particular, rli_size_unit_so_far might
6209 indicate the last complete byte, while rli_size_so_far
6210 indicates the total number of bits used. Therefore,
6211 rli_size_so_far, rather than rli_size_unit_so_far, is
6212 used to compute TYPE_SIZE_UNIT. */
6220 eoc);
6230 /* Copy the non-static data members of T. This will include its
6231 direct non-virtual bases & vtable. */
6235 {
6239 }
6242 /* We use the base type for trivial assignments, and hence it
6243 needs a mode. */
6248 /* Record the base version of the type. */
6250 }
6251 else
6254 /* Every empty class contains an empty class. */
6258 /* Set the TYPE_DECL for this type to contain the right
6259 value for DECL_OFFSET, so that we can use it as part
6260 of a COMPONENT_REF for multiple inheritance. */
6263 /* Now fix up any virtual base class types that we left lying
6264 around. We must get these done before we try to lay out the
6265 virtual function table. As a side-effect, this will remove the
6266 base subobject fields. */
6269 /* Make sure that empty classes are reflected in RLI at this
6270 point. */
6273 /* Make sure not to create any structures with zero size. */
6279 /* If this is a non-POD, declaring it packed makes a difference to how it
6280 can be used as a field; don't let finalize_record_size undo it. */
6284 /* Let the back end lay out the type. */
6293 /* Warn about bases that can't be talked about due to ambiguity. */
6296 /* Now that we're done with layout, give the base fields the real types. */
6301 /* Clean up. */
6308 }
6310 /* Determine the "key method" for the class type indicated by TYPE,
6311 and set CLASSTYPE_KEY_METHOD accordingly. */
6313 void
6315 {
6316 tree method;
6323 /* The key method is the first non-pure virtual function that is not
6324 inline at the point of class definition. On some targets the
6325 key function may not be inline; those targets should not call
6326 this function until the end of the translation unit. */
6332 {
6335 }
6338 }
6340 /* Helper of find_flexarrays. Return true when FLD refers to a non-static
6341 class data member of non-zero size, otherwise false. */
6345 {
6353 {
6357 }
6360 }
6362 /* Used by find_flexarrays and related functions. */
6364 struct flexmems_t
6365 {
6366 /* The first flexible array member or non-zero array member found
6367 in the order of layout. */
6368 tree array;
6369 /* First non-static non-empty data member in the class or its bases. */
6370 tree first;
6371 /* The first non-static non-empty data member following either
6372 the flexible array member, if found, or the zero-length array member
6373 otherwise. AFTER[1] refers to the first such data member of a union
6374 of which the struct containing the flexible array member or zero-length
6375 array is a member, or NULL when no such union exists. This element is
6376 only used during searching, not for diagnosing problems. AFTER[0]
6377 refers to the first such data member that is not a member of such
6378 a union. */
6381 /* Refers to a struct (not union) in which the struct of which the flexible
6382 array is member is defined. Used to diagnose strictly (according to C)
6383 invalid uses of the latter structs. */
6384 tree enclosing;
6385 };
6387 /* Find either the first flexible array member or the first zero-length
6388 array, in that order of preference, among members of class T (but not
6389 its base classes), and set members of FMEM accordingly.
6390 BASE_P is true if T is a base class of another class.
6391 PUN is set to the outermost union in which the flexible array member
6392 (or zero-length array) is defined if one such union exists, otherwise
6393 to NULL.
6394 Similarly, PSTR is set to a data member of the outermost struct of
6395 which the flexible array is a member if one such struct exists,
6396 otherwise to NULL. */
6398 static void
6402 {
6403 /* Set the "pointer" to the outermost enclosing union if not set
6404 yet and maintain it for the remainder of the recursion. */
6409 {
6413 /* Is FLD a typedef for an anonymous struct? */
6415 /* FIXME: Note that typedefs (as well as arrays) need to be fully
6416 handled elsewhere so that errors like the following are detected
6417 as well:
6418 typedef struct { int i, a[], j; } S; // bug c++/72753
6419 S s [2]; // bug c++/68489
6420 */
6425 {
6426 /* Check the nested unnamed type referenced via a typedef
6427 independently of FMEM (since it's not a data member of
6428 the enclosing class). */
6431 }
6433 /* Skip anything that's GCC-generated or not a (non-static) data
6434 member. */
6438 /* Type of the member. */
6443 /* Determine the type of the array element or object referenced
6444 by the member so that it can be checked for flexible array
6445 members if it hasn't been yet. */
6453 {
6455 {
6456 /* Once the member after the flexible array has been found
6457 we're done. */
6460 }
6463 {
6464 /* Descend into the non-static member struct or union and try
6465 to find a flexible array member or zero-length array among
6466 its members. This is only necessary for anonymous types
6467 and types in whose context the current type T has not been
6468 defined (the latter must not be checked again because they
6469 are already in the process of being checked by one of the
6470 recursive calls). */
6475 /* If this member isn't anonymous and a prior non-flexible array
6476 member has been seen in one of the enclosing structs, clear
6477 the FIRST member since it doesn't contribute to the flexible
6478 array struct's members. */
6489 {
6490 /* Restore the FIRST member reset above if no flexible
6491 array member has been found in this member's struct. */
6493 }
6495 /* If the member struct contains the first flexible array
6496 member, or if this member is a base class, continue to
6497 the next member and avoid setting the FMEM->NEXT pointer
6498 to point to it. */
6501 }
6502 }
6505 {
6506 /* Remember the first non-static data member. */
6510 /* Remember the first non-static data member after the flexible
6511 array member, if one has been found, or the zero-length array
6512 if it has been found. */
6515 }
6517 /* Skip non-arrays. */
6521 /* Determine the upper bound of the array if it has one. */
6523 {
6525 {
6526 /* Make a record of the zero-length array if either one
6527 such field or a flexible array member has been seen to
6528 handle the pathological and unlikely case of multiple
6529 such members. */
6532 }
6534 {
6535 /* Remember the first zero-length array unless a flexible array
6536 member has already been seen. */
6539 }
6540 }
6541 else
6542 {
6543 /* Flexible array members have no upper bound. */
6545 {
6547 {
6548 /* Replace the zero-length array if it's been stored and
6549 reset the after pointer. */
6553 }
6555 /* Make a record of another flexible array member. */
6557 }
6558 else
6559 {
6562 }
6563 }
6564 }
6565 }
6567 /* Diagnose a strictly (by the C standard) invalid use of a struct with
6568 a flexible array member (or the zero-length array extension). */
6570 static void
6572 {
6584 }
6586 /* Issue diagnostics for invalid flexible array members or zero-length
6587 arrays that are not the last elements of the containing class or its
6588 base classes or that are its sole members. */
6590 static void
6592 {
6597 {
6600 }
6602 /* Has a diagnostic been issued? */
6608 {
6615 {
6619 {
6622 }
6623 }
6624 }
6625 else
6626 {
6633 {
6639 /* In the unlikely event that the member following the flexible
6640 array member is declared in a different class, or the member
6641 overlaps another member of a common union, point to it.
6642 Otherwise it should be obvious. */
6646 {
6651 }
6652 }
6653 }
6657 }
6660 /* Recursively check to make sure that any flexible array or zero-length
6661 array members of class T or its bases are valid (i.e., not the sole
6662 non-static data member of T and, if one exists, that it is the last
6663 non-static data member of T and its base classes. FMEM is expected
6664 to be initially null and is used internally by recursive calls to
6665 the function. Issue the appropriate diagnostics for the array member
6666 that fails the checks. */
6668 static void
6671 {
6672 /* Initialize the result of a search for flexible array and zero-length
6673 array members. Avoid doing any work if the most interesting FMEM data
6674 have already been populated. */
6683 /* Recursively check the primary base class first. */
6685 {
6688 }
6690 /* Recursively check the base classes. */
6693 {
6696 /* The primary base class was already checked above. */
6700 /* Virtual base classes are at the end. */
6704 /* Check the base class. */
6706 }
6709 {
6710 /* Check virtual base classes only once per derived class.
6711 I.e., this check is not performed recursively for base
6712 classes. */
6714 tree base_binfo;
6718 {
6719 /* Check the virtual base class. */
6723 }
6724 }
6726 /* Is the type unnamed (and therefore a member of it potentially
6727 an anonymous struct or union)? */
6730 /* Search the members of the current (possibly derived) class, skipping
6731 unnamed structs and unions since those could be anonymous. */
6736 {
6737 /* Issue diagnostics for invalid flexible and zero-length array
6738 members found in base classes or among the members of the current
6739 class. Ignore anonymous structs and unions whose members are
6740 considered to be members of the enclosing class and thus will
6741 be diagnosed when checking it. */
6743 }
6744 }
6746 /* Perform processing required when the definition of T (a class type)
6747 is complete. Diagnose invalid definitions of flexible array members
6748 and zero-size arrays. */
6750 void
6752 {
6753 tree x;
6754 /* A TREE_LIST. The TREE_VALUE of each node is a FUNCTION_DECL. */
6758 {
6763 }
6765 /* If this type was previously laid out as a forward reference,
6766 make sure we lay it out again. */
6770 /* Make assumptions about the class; we'll reset the flags if
6771 necessary. */
6777 /* Do end-of-class semantic processing: checking the validity of the
6778 bases and members and add implicitly generated methods. */
6781 /* Find the key method. */
6783 {
6784 /* The Itanium C++ ABI permits the key method to be chosen when
6785 the class is defined -- even though the key method so
6786 selected may later turn out to be an inline function. On
6787 some systems (such as ARM Symbian OS) the key method cannot
6788 be determined until the end of the translation unit. On such
6789 systems, we leave CLASSTYPE_KEY_METHOD set to NULL, which
6790 will cause the class to be added to KEYED_CLASSES. Then, in
6791 finish_file we will determine the key method. */
6795 /* If a polymorphic class has no key method, we may emit the vtable
6796 in every translation unit where the class definition appears. If
6797 we're devirtualizing, we can look into the vtable even if we
6798 aren't emitting it. */
6801 }
6803 /* Layout the class itself. */
6805 /* COMPLETE_TYPE_P is now true. */
6809 /* With the layout complete, check for flexible array members and
6810 zero-length arrays that might overlap other members in the final
6811 layout. */
6816 /* If necessary, create the primary vtable for this class. */
6818 {
6819 /* We must enter these virtuals into the table. */
6823 /* Here we know enough to change the type of our virtual
6824 function table, but we will wait until later this function. */
6827 /* If we're warning about ABI tags, check the types of the new
6828 virtual functions. */
6832 }
6835 {
6837 tree fn;
6844 /* Add entries for virtual functions introduced by this class. */
6848 /* Set DECL_VINDEX for all functions declared in this class. */
6850 fn;
6852 vindex += (TARGET_VTABLE_USES_DESCRIPTORS
6854 {
6858 /* A thunk. We should never be calling this entry directly
6859 from this vtable -- we'd use the entry for the non
6860 thunk base function. */
6864 }
6865 }
6873 /* Clear DECL_IN_AGGR_P for all member functions. Complete the rtl
6874 for any static member objects of the type we're working on. */
6883 /* Complain if one of the field types requires lower visibility. */
6886 /* Make the rtl for any new vtables we have created, and unmark
6887 the base types we marked. */
6890 /* Build the VTT for T. */
6897 "%q#T has virtual functions and accessible"
6905 /* Class layout, assignment of virtual table slots, etc., is now
6906 complete. Give the back end a chance to tweak the visibility of
6907 the class or perform any other required target modifications. */
6917 /* Finish debugging output for this type. */
6921 {
6924 {
6927 }
6929 {
6932 else
6933 {
6936 }
6938 }
6940 {
6942 "the type of the first field has a different ABI from the "
6945 }
6946 }
6947 }
6949 /* When T was built up, the member declarations were added in reverse
6950 order. Rearrange them to declaration order. */
6952 void
6954 {
6955 tree next;
6956 tree prev;
6957 tree x;
6959 /* The following lists are all in reverse order. Put them in
6960 declaration order now. */
6963 /* For the TYPE_FIELDS, only the non TYPE_DECLs are in reverse
6964 order, so we can't just use nreverse. Due to stat_hack
6965 chicanery in finish_member_declaration. */
6970 {
6974 }
6977 {
6980 }
6981 }
6983 tree
6985 {
6988 /* Now that we've got all the field declarations, reverse everything
6989 as necessary. */
6995 /* Nadger the current location so that diagnostics point to the start of
6996 the struct, not the end. */
7000 {
7001 tree x;
7003 /* We need to add the target functions of USING_DECLS, so that
7004 they can be found when the using declaration is not
7005 instantiated yet. */
7008 {
7013 }
7019 /* COMPLETE_TYPE_P is now true. */
7023 /* We need to emit an error message if this type was used as a parameter
7024 and it is an abstract type, even if it is a template. We construct
7025 a simple CLASSTYPE_PURE_VIRTUALS list without taking bases into
7026 account and we call complete_vars with this type, which will check
7027 the PARM_DECLS. Note that while the type is being defined,
7028 CLASSTYPE_PURE_VIRTUALS contains the list of the inline friends
7029 (see CLASSTYPE_INLINE_FRIENDS) so we need to clear it. */
7036 /* Remember current #pragma pack value. */
7039 /* Fix up any variants we've already built. */
7041 {
7045 }
7046 }
7047 else
7049 /* COMPLETE_TYPE_P is now true. */
7054 {
7055 /* People keep complaining that the compiler crashes on an invalid
7056 definition of initializer_list, so I guess we should explicitly
7057 reject it. What the compiler internals care about is that it's a
7058 template and has a pointer field followed by size_type field. */
7061 {
7064 {
7068 }
7069 }
7073 }
7081 else
7085 /* Lambdas are defined by the LAMBDA_EXPR. */
7090 }
7091 \f
7092 /* Hash table to avoid endless recursion when handling references. */
7095 /* Return the dynamic type of INSTANCE, if known.
7096 Used to determine whether the virtual function table is needed
7097 or not.
7099 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
7100 of our knowledge of its type. *NONNULL should be initialized
7101 before this function is called. */
7103 static tree
7105 {
7106 #define RECUR(T) fixed_type_or_null((T), nonnull, cdtorp)
7109 {
7113 else
7117 /* This is a call to a constructor, hence it's never zero. */
7120 {
7124 }
7128 /* This is a call to a constructor, hence it's never zero. */
7130 {
7134 }
7143 /* Propagate nonnull. */
7148 CASE_CONVERT:
7154 {
7155 /* Just because we see an ADDR_EXPR doesn't mean we're dealing
7156 with a real object -- given &p->f, p can still be null. */
7158 /* ??? Probably should check DECL_WEAK here. */
7161 }
7165 /* If this component is really a base class reference, then the field
7166 itself isn't definitive. */
7175 {
7179 }
7180 /* fall through. */
7185 {
7189 }
7191 {
7195 /* if we're in a ctor or dtor, we know our type. If
7196 current_class_ptr is set but we aren't in a function, we're in
7197 an NSDMI (and therefore a constructor). */
7202 {
7206 }
7207 }
7209 {
7210 /* We only need one hash table because it is always left empty. */
7212 fixed_type_or_null_ref_ht
7215 /* Reference variables should be references to objects. */
7219 /* Enter the INSTANCE in a table to prevent recursion; a
7220 variable's initializer may refer to the variable
7221 itself. */
7226 {
7227 tree type;
7236 }
7237 }
7242 }
7243 #undef RECUR
7244 }
7246 /* Return nonzero if the dynamic type of INSTANCE is known, and
7247 equivalent to the static type. We also handle the case where
7248 INSTANCE is really a pointer. Return negative if this is a
7249 ctor/dtor. There the dynamic type is known, but this might not be
7250 the most derived base of the original object, and hence virtual
7251 bases may not be laid out according to this type.
7253 Used to determine whether the virtual function table is needed
7254 or not.
7256 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
7257 of our knowledge of its type. *NONNULL should be initialized
7258 before this function is called. */
7260 int
7262 {
7265 tree fixed;
7267 /* processing_template_decl can be false in a template if we're in
7268 instantiate_non_dependent_expr, but we still want to suppress
7269 this check. */
7271 {
7272 /* In a template we only care about the type of the result. */
7276 }
7286 }
7288 \f
7289 void
7291 {
7294 current_class_stack
7302 }
7304 /* Restore the cached PREVIOUS_CLASS_LEVEL. */
7306 static void
7308 {
7309 tree type;
7311 /* We are re-entering the same class we just left, so we don't
7312 have to search the whole inheritance matrix to find all the
7313 decls to bind again. Instead, we install the cached
7314 class_shadowed list and walk through it binding names. */
7317 /* Restore IDENTIFIER_TYPE_VALUE. */
7319 type;
7322 }
7324 /* Set global variables CURRENT_CLASS_NAME and CURRENT_CLASS_TYPE as
7325 appropriate for TYPE.
7327 So that we may avoid calls to lookup_name, we cache the _TYPE
7328 nodes of local TYPE_DECLs in the TREE_TYPE field of the name.
7330 For multiple inheritance, we perform a two-pass depth-first search
7331 of the type lattice. */
7333 void
7335 {
7336 class_stack_node_t csn;
7340 /* Make sure there is enough room for the new entry on the stack. */
7342 {
7344 current_class_stack
7346 current_class_stack_size);
7347 }
7349 /* Insert a new entry on the class stack. */
7356 current_class_depth++;
7358 /* Now set up the new type. */
7364 /* By default, things in classes are private, while things in
7365 structures or unions are public. */
7367 ? access_private_node
7373 {
7374 /* Forcibly remove any old class remnants. */
7376 }
7382 else
7384 }
7386 /* When we exit a toplevel class scope, we save its binding level so
7387 that we can restore it quickly. Here, we've entered some other
7388 class, so we must invalidate our cache. */
7390 void
7392 {
7394 }
7396 /* Get out of the current class scope. If we were in a class scope
7397 previously, that is the one popped to. */
7399 void
7401 {
7404 current_class_depth--;
7410 }
7412 /* Mark the top of the class stack as hidden. */
7414 void
7416 {
7419 }
7421 /* Mark the top of the class stack as un-hidden. */
7423 void
7425 {
7428 }
7430 /* Returns 1 if the class type currently being defined is either T or
7431 a nested type of T. Returns the type from the current_class_stack,
7432 which might be equivalent to but not equal to T in case of
7433 constrained partial specializations. */
7435 tree
7437 {
7445 /* We start looking from 1 because entry 0 is from global scope,
7446 and has no type. */
7448 {
7449 tree c;
7452 else
7453 {
7457 }
7462 }
7464 }
7466 /* If either current_class_type or one of its enclosing classes are derived
7467 from T, return the appropriate type. Used to determine how we found
7468 something via unqualified lookup. */
7470 tree
7472 {
7475 /* The bases of a dependent type are unknown. */
7486 {
7491 }
7494 }
7496 /* Return the outermost enclosing class type that is still open, or
7497 NULL_TREE. */
7499 tree
7501 {
7508 {
7515 }
7517 }
7519 /* Returns the innermost class type which is not a lambda closure type. */
7521 tree
7523 {
7528 }
7530 /* When entering a class scope, all enclosing class scopes' names with
7531 static meaning (static variables, static functions, types and
7532 enumerators) have to be visible. This recursive function calls
7533 pushclass for all enclosing class contexts until global or a local
7534 scope is reached. TYPE is the enclosed class. */
7536 void
7538 {
7539 /* A namespace might be passed in error cases, like A::B:C. */
7547 }
7549 /* Undoes a push_nested_class call. */
7551 void
7553 {
7559 }
7561 /* Returns the number of extern "LANG" blocks we are nested within. */
7563 int
7565 {
7567 }
7569 /* Set global variables CURRENT_LANG_NAME to appropriate value
7570 so that behavior of name-mangling machinery is correct. */
7572 void
7574 {
7581 else
7583 }
7585 /* Get out of the current language scope. */
7587 void
7589 {
7591 }
7592 \f
7593 /* Type instantiation routines. */
7595 /* Given an OVERLOAD and a TARGET_TYPE, return the function that
7596 matches the TARGET_TYPE. If there is no satisfactory match, return
7597 error_mark_node, and issue an error & warning messages under
7598 control of FLAGS. Permit pointers to member function if FLAGS
7599 permits. If TEMPLATE_ONLY, the name of the overloaded function was
7600 a template-id, and EXPLICIT_TARGS are the explicitly provided
7601 template arguments.
7603 If OVERLOAD is for one or more member functions, then ACCESS_PATH
7604 is the base path used to reference those member functions. If
7605 the address is resolved to a member function, access checks will be
7606 performed and errors issued if appropriate. */
7608 static tree
7610 tree overload,
7611 tsubst_flags_t complain,
7613 tree explicit_targs,
7614 tree access_path)
7615 {
7616 /* Here's what the standard says:
7618 [over.over]
7620 If the name is a function template, template argument deduction
7621 is done, and if the argument deduction succeeds, the deduced
7622 arguments are used to generate a single template function, which
7623 is added to the set of overloaded functions considered.
7625 Non-member functions and static member functions match targets of
7626 type "pointer-to-function" or "reference-to-function." Nonstatic
7627 member functions match targets of type "pointer-to-member
7628 function;" the function type of the pointer to member is used to
7629 select the member function from the set of overloaded member
7630 functions. If a nonstatic member function is selected, the
7631 reference to the overloaded function name is required to have the
7632 form of a pointer to member as described in 5.3.1.
7634 If more than one function is selected, any template functions in
7635 the set are eliminated if the set also contains a non-template
7636 function, and any given template function is eliminated if the
7637 set contains a second template function that is more specialized
7638 than the first according to the partial ordering rules 14.5.5.2.
7639 After such eliminations, if any, there shall remain exactly one
7640 selected function. */
7643 /* We store the matches in a TREE_LIST rooted here. The functions
7644 are the TREE_PURPOSE, not the TREE_VALUE, in this list, for easy
7645 interoperability with most_specialized_instantiation. */
7647 tree fn;
7648 tree target_fn_type;
7650 /* By the time we get here, we should be seeing only real
7651 pointer-to-member types, not the internal POINTER_TYPE to
7652 METHOD_TYPE representation. */
7658 /* Check that the TARGET_TYPE is reasonable. */
7663 /* This is OK, too. */
7666 /* This is OK, too. This comes from a conversion to reference
7667 type. */
7669 else
7670 {
7676 }
7678 /* Non-member functions and static member functions match targets of type
7679 "pointer-to-function" or "reference-to-function." Nonstatic member
7680 functions match targets of type "pointer-to-member-function;" the
7681 function type of the pointer to member is used to select the member
7682 function from the set of overloaded member functions.
7684 So figure out the FUNCTION_TYPE that we want to match against. */
7687 /* If we can find a non-template function that matches, we can just
7688 use it. There's no point in generating template instantiations
7689 if we're just going to throw them out anyhow. But, of course, we
7690 can only do this when we don't *need* a template function. */
7693 {
7697 /* We're not looking for templates just yet. */
7701 /* We're looking for a non-static member, and this isn't
7702 one, or vice versa. */
7705 /* In C++17 we need the noexcept-qualifier to compare types. */
7710 /* See if there's a match. */
7715 }
7717 /* Now, if we've already got a match (or matches), there's no need
7718 to proceed to the template functions. But, if we don't have a
7719 match we need to look at them, too. */
7721 {
7722 tree target_arg_types;
7723 tree target_ret_type;
7726 tree arg;
7740 {
7742 tree instantiation;
7743 tree targs;
7746 /* We're only looking for templates. */
7751 /* We're not looking for a non-static member, and this is
7752 one, or vice versa. */
7757 /* If the template has a deduced return type, don't expose it to
7758 template argument deduction. */
7762 /* Try to do argument deduction. */
7769 /* Instantiation failed. */
7772 /* Constraints must be satisfied. This is done before
7773 return type deduction since that instantiates the
7774 function. */
7778 /* And now force instantiation to do return type deduction. */
7780 {
7786 }
7788 /* In C++17 we need the noexcept-qualifier to compare types. */
7792 /* See if there's a match. */
7797 }
7799 /* Now, remove all but the most specialized of the matches. */
7801 {
7806 NULL_TREE,
7807 NULL_TREE);
7808 }
7809 }
7811 /* Now we should have exactly one function in MATCHES. */
7813 {
7814 /* There were *no* matches. */
7816 {
7821 }
7823 }
7825 {
7826 /* There were too many matches. First check if they're all
7827 the same function. */
7832 /* For multi-versioned functions, more than one match is just fine and
7833 decls_match will return false as they are different. */
7841 {
7843 {
7847 /* Since print_candidates expects the functions in the
7848 TREE_VALUE slot, we flip them here. */
7853 }
7856 }
7857 }
7859 /* Good, exactly one match. Now, convert it to the correct type. */
7864 {
7872 {
7875 }
7876 }
7878 /* If a pointer to a function that is multi-versioned is requested, the
7879 pointer to the dispatcher function is returned instead. This works
7880 well because indirectly calling the function will dispatch the right
7881 function version at run-time. */
7883 {
7887 /* Mark all the versions corresponding to the dispatcher as used. */
7890 }
7892 /* If we're doing overload resolution purely for the purpose of
7893 determining conversion sequences, we should not consider the
7894 function used. If this conversion sequence is selected, the
7895 function will be marked as used at this point. */
7897 {
7898 /* Make =delete work with SFINAE. */
7903 }
7905 /* We could not check access to member functions when this
7906 expression was originally created since we did not know at that
7907 time to which function the expression referred. */
7909 {
7912 }
7916 else
7917 {
7918 /* The target must be a REFERENCE_TYPE. Above, cp_build_unary_op
7919 will mark the function as addressed, but here we must do it
7920 explicitly. */
7924 }
7925 }
7927 /* This function will instantiate the type of the expression given in
7928 RHS to match the type of LHSTYPE. If errors exist, then return
7929 error_mark_node. COMPLAIN is a bit mask. If TF_ERROR is set, then
7930 we complain on errors. If we are not complaining, never modify rhs,
7931 as overload resolution wants to try many possible instantiations, in
7932 the hope that at least one will work.
7934 For non-recursive calls, LHSTYPE should be a function, pointer to
7935 function, or a pointer to member function. */
7937 tree
7939 {
7946 {
7950 }
7953 {
7962 /* Microsoft allows `A::f' to be resolved to a
7963 pointer-to-member. */
7964 ;
7965 else
7966 {
7971 }
7972 }
7974 /* If we instantiate a template, and it is a A ?: C expression
7975 with omitted B, look through the SAVE_EXPR. */
7980 {
7983 }
7985 /* If we are in a template, and have a NON_DEPENDENT_EXPR, we cannot
7986 deduce any type information. */
7988 {
7992 }
7994 /* There are only a few kinds of expressions that may have a type
7995 dependent on overload resolution. */
8001 /* This should really only be used when attempting to distinguish
8002 what sort of a pointer to function we have. For now, any
8003 arithmetic operation which is not supported on pointers
8004 is rejected as an error. */
8007 {
8009 {
8015 /* Do not lose object's side effects. */
8019 }
8026 /* This can happen if we are forming a pointer-to-member for a
8027 member template. */
8030 /* Fall through. */
8033 {
8037 return
8041 }
8045 return
8049 access_path);
8052 {
8057 }
8064 }
8066 }
8067 \f
8068 /* Return the name of the virtual function pointer field
8069 (as an IDENTIFIER_NODE) for the given TYPE. Note that
8070 this may have to look back through base types to find the
8071 ultimate field name. (For single inheritance, these could
8072 all be the same name. Who knows for multiple inheritance). */
8074 static tree
8076 {
8082 {
8088 }
8096 }
8098 /* Build a dummy reference to ourselves so Derived::Base (and A::A) works,
8099 according to [class]:
8100 The class-name is also inserted
8101 into the scope of the class itself. For purposes of access checking,
8102 the inserted class name is treated as if it were a public member name. */
8104 void
8106 {
8123 }
8125 /* Returns 1 if TYPE contains only padding bytes. */
8127 int
8129 {
8137 }
8139 /* Returns true if TYPE contains no actual data, just various
8140 possible combinations of empty classes and possibly a vptr. */
8142 bool
8144 {
8146 {
8147 tree field;
8148 tree binfo;
8149 tree base_binfo;
8152 /* CLASSTYPE_EMPTY_P isn't set properly until the class is actually laid
8153 out, but we'd like to be able to check this before then. */
8164 /* An unnamed bit-field is not a data member. */
8169 }
8174 }
8176 /* Note that NAME was looked up while the current class was being
8177 defined and that the result of that lookup was DECL. */
8179 void
8181 {
8182 splay_tree names_used;
8184 /* If we're not defining a class, there's nothing to do. */
8190 /* If there's already a binding for this NAME, then we don't have
8191 anything to worry about. */
8204 }
8206 /* Note that NAME was declared (as DECL) in the current class. Check
8207 to see that the declaration is valid. */
8209 void
8211 {
8212 splay_tree names_used;
8213 splay_tree_node n;
8215 /* Look to see if we ever used this name. */
8216 names_used
8220 /* The C language allows members to be declared with a type of the same
8221 name, and the C++ standard says this diagnostic is not required. So
8222 allow it in extern "C" blocks unless predantic is specified.
8223 Allow it in all cases if -ms-extensions is specified. */
8229 {
8230 /* [basic.scope.class]
8232 A name N used in a class S shall refer to the same declaration
8233 in its context and when re-evaluated in the completed scope of
8234 S. */
8239 }
8240 }
8242 /* Returns the VAR_DECL for the complete vtable associated with BINFO.
8243 Secondary vtables are merged with primary vtables; this function
8244 will return the VAR_DECL for the primary vtable. */
8246 tree
8248 {
8249 tree decl;
8253 {
8256 }
8260 }
8263 /* Returns the binfo for the primary base of BINFO. If the resulting
8264 BINFO is a virtual base, and it is inherited elsewhere in the
8265 hierarchy, then the returned binfo might not be the primary base of
8266 BINFO in the complete object. Check BINFO_PRIMARY_P or
8267 BINFO_LOST_PRIMARY_P to be sure. */
8269 static tree
8271 {
8272 tree primary_base;
8279 }
8281 /* As above, but iterate until we reach the binfo that actually provides the
8282 vptr for BINFO. */
8284 static tree
8286 {
8290 {
8295 }
8297 }
8299 /* Returns true if BINFO gets its vptr from a virtual base of the most derived
8300 type. Note that the virtual inheritance might be above or below BINFO in
8301 the hierarchy. */
8303 bool
8305 {
8309 /* Don't limit binfo_via_virtual, we want to return true when BINFO itself is
8310 a morally virtual base. */
8313 }
8315 /* If INDENTED_P is zero, indent to INDENT. Return nonzero. */
8317 static int
8319 {
8323 }
8325 /* Dump the offsets of all the bases rooted at BINFO to STREAM.
8326 INDENT should be zero when called from the top level; it is
8327 incremented recursively. IGO indicates the next expected BINFO in
8328 inheritance graph ordering. */
8330 static tree
8332 dump_flags_t flags,
8333 tree binfo,
8334 tree igo,
8336 {
8338 tree base_binfo;
8346 {
8349 }
8364 {
8368 TFF_PLAIN_IDENTIFIER),
8370 }
8372 {
8375 }
8380 {
8384 {
8388 TFF_PLAIN_IDENTIFIER));
8389 }
8391 {
8395 TFF_PLAIN_IDENTIFIER));
8396 }
8398 {
8402 TFF_PLAIN_IDENTIFIER));
8403 }
8405 {
8409 TFF_PLAIN_IDENTIFIER));
8410 }
8414 }
8420 }
8422 /* Dump the BINFO hierarchy for T. */
8424 static void
8426 {
8438 }
8440 /* Debug interface to hierarchy dumping. */
8442 void
8444 {
8446 }
8448 static void
8450 {
8451 dump_flags_t flags;
8453 {
8456 }
8457 }
8459 static void
8461 {
8462 tree value;
8464 HOST_WIDE_INT elt;
8472 TFF_PLAIN_IDENTIFIER));
8479 }
8481 static void
8483 {
8484 dump_flags_t flags;
8491 {
8498 {
8503 }
8507 }
8510 }
8512 static void
8514 {
8515 dump_flags_t flags;
8522 {
8527 }
8530 }
8532 /* Dump a function or thunk and its thunkees. */
8534 static void
8536 {
8539 tree thunks;
8547 {
8557 else
8563 }
8567 }
8569 /* Dump the thunks for FN. */
8571 void
8573 {
8575 }
8577 /* Virtual function table initialization. */
8579 /* Create all the necessary vtables for T and its base classes. */
8581 static void
8583 {
8584 tree vbase;
8588 /* We lay out the primary and secondary vtables in one contiguous
8589 vtable. The primary vtable is first, followed by the non-virtual
8590 secondary vtables in inheritance graph order. */
8594 /* Then come the virtual bases, also in inheritance graph order. */
8596 {
8600 }
8604 }
8606 /* Initialize the vtable for BINFO with the INITS. */
8608 static void
8610 {
8611 tree decl;
8617 }
8619 /* Build the VTT (virtual table table) for T.
8620 A class requires a VTT if it has virtual bases.
8622 This holds
8623 1 - primary virtual pointer for complete object T
8624 2 - secondary VTTs for each direct non-virtual base of T which requires a
8625 VTT
8626 3 - secondary virtual pointers for each direct or indirect base of T which
8627 has virtual bases or is reachable via a virtual path from T.
8628 4 - secondary VTTs for each direct or indirect virtual base of T.
8630 Secondary VTTs look like complete object VTTs without part 4. */
8632 static void
8634 {
8635 tree type;
8636 tree vtt;
8637 tree index;
8640 /* Build up the initializers for the VTT. */
8645 /* If we didn't need a VTT, we're done. */
8649 /* Figure out the type of the VTT. */
8653 /* Now, build the VTT object itself. */
8656 /* Add the VTT to the vtables list. */
8661 }
8663 /* When building a secondary VTT, BINFO_VTABLE is set to a TREE_LIST with
8664 PURPOSE the RTTI_BINFO, VALUE the real vtable pointer for this binfo,
8665 and CHAIN the vtable pointer for this binfo after construction is
8666 complete. VALUE can also be another BINFO, in which case we recurse. */
8668 static tree
8670 {
8671 tree vt;
8674 {
8680 else
8682 }
8685 }
8687 /* Data for secondary VTT initialization. */
8688 struct secondary_vptr_vtt_init_data
8689 {
8690 /* Is this the primary VTT? */
8693 /* Current index into the VTT. */
8694 tree index;
8696 /* Vector of initializers built up. */
8699 /* The type being constructed by this secondary VTT. */
8700 tree type_being_constructed;
8701 };
8703 /* Recursively build the VTT-initializer for BINFO (which is in the
8704 hierarchy dominated by T). INITS points to the end of the initializer
8705 list to date. INDEX is the VTT index where the next element will be
8706 replaced. Iff BINFO is the binfo for T, this is the top level VTT (i.e.
8707 not a subvtt for some base of T). When that is so, we emit the sub-VTTs
8708 for virtual bases of T. When it is not so, we build the constructor
8709 vtables for the BINFO-in-T variant. */
8711 static void
8714 {
8716 tree b;
8717 tree init;
8718 secondary_vptr_vtt_init_data data;
8721 /* We only need VTTs for subobjects with virtual bases. */
8725 /* We need to use a construction vtable if this is not the primary
8726 VTT. */
8728 {
8731 /* Record the offset in the VTT where this sub-VTT can be found. */
8733 }
8735 /* Add the address of the primary vtable for the complete object. */
8739 {
8742 }
8745 /* Recursively add the secondary VTTs for non-virtual bases. */
8750 /* Add secondary virtual pointers for all subobjects of BINFO with
8751 either virtual bases or reachable along a virtual path, except
8752 subobjects that are non-virtual primary bases. */
8762 /* data.inits might have grown as we added secondary virtual pointers.
8763 Make sure our caller knows about the new vector. */
8767 /* Add the secondary VTTs for virtual bases in inheritance graph
8768 order. */
8770 {
8775 }
8776 else
8777 /* Remove the ctor vtables we created. */
8779 }
8781 /* Called from build_vtt_inits via dfs_walk. BINFO is the binfo for the base
8782 in most derived. DATA is a SECONDARY_VPTR_VTT_INIT_DATA structure. */
8784 static tree
8786 {
8789 /* We don't care about bases that don't have vtables. */
8793 /* We're only interested in proper subobjects of the type being
8794 constructed. */
8798 /* We're only interested in bases with virtual bases or reachable
8799 via a virtual path from the type being constructed. */
8804 /* We're not interested in non-virtual primary bases. */
8808 /* Record the index where this secondary vptr can be found. */
8810 {
8815 {
8816 /* It's a primary virtual base, and this is not a
8817 construction vtable. Find the base this is primary of in
8818 the inheritance graph, and use that base's vtable
8819 now. */
8822 }
8823 }
8825 /* Add the initializer for the secondary vptr itself. */
8828 /* Advance the vtt index. */
8833 }
8835 /* Called from build_vtt_inits via dfs_walk. After building
8836 constructor vtables and generating the sub-vtt from them, we need
8837 to restore the BINFO_VTABLES that were scribbled on. DATA is the
8838 binfo of the base whose sub vtt was generated. */
8840 static tree
8842 {
8846 /* If this class has no vtable, none of its bases do. */
8850 /* This might be a primary base, so have no vtable in this
8851 hierarchy. */
8854 /* If we scribbled the construction vtable vptr into BINFO, clear it
8855 out now. */
8861 }
8863 /* Build the construction vtable group for BINFO which is in the
8864 hierarchy dominated by T. */
8866 static void
8868 {
8869 tree type;
8870 tree vtbl;
8871 tree id;
8872 tree vbase;
8875 /* See if we've already created this construction vtable group. */
8881 /* Build a version of VTBL (with the wrong type) for use in
8882 constructing the addresses of secondary vtables in the
8883 construction vtable group. */
8886 /* Don't export construction vtables from shared libraries. Even on
8887 targets that don't support hidden visibility, this tells
8888 can_refer_decl_in_current_unit_p not to assume that it's safe to
8889 access from a different compilation unit (bz 54314). */
8897 /* Add the vtables for each of our virtual bases using the vbase in T
8898 binfo. */
8900 vbase;
8902 {
8903 tree b;
8910 }
8912 /* Figure out the type of the construction vtable. */
8919 /* Initialize the construction vtable. */
8923 }
8925 /* Add the vtbl initializers for BINFO (and its bases other than
8926 non-virtual primaries) to the list of INITS. BINFO is in the
8927 hierarchy dominated by T. RTTI_BINFO is the binfo within T of
8928 the constructor the vtbl inits should be accumulated for. (If this
8929 is the complete object vtbl then RTTI_BINFO will be TYPE_BINFO (T).)
8930 ORIG_BINFO is the binfo for this object within BINFO_TYPE (RTTI_BINFO).
8931 BINFO is the active base equivalent of ORIG_BINFO in the inheritance
8932 graph of T. Both BINFO and ORIG_BINFO will have the same BINFO_TYPE,
8933 but are not necessarily the same in terms of layout. */
8935 static void
8937 tree orig_binfo,
8938 tree rtti_binfo,
8939 tree vtbl,
8940 tree t,
8942 {
8944 tree base_binfo;
8949 /* If it doesn't have a vptr, we don't do anything. */
8953 /* If we're building a construction vtable, we're not interested in
8954 subobjects that don't require construction vtables. */
8960 /* Build the initializers for the BINFO-in-T vtable. */
8963 /* Walk the BINFO and its bases. We walk in preorder so that as we
8964 initialize each vtable we can figure out at what offset the
8965 secondary vtable lies from the primary vtable. We can't use
8966 dfs_walk here because we need to iterate through bases of BINFO
8967 and RTTI_BINFO simultaneously. */
8969 {
8970 /* Skip virtual bases. */
8976 inits);
8977 }
8978 }
8980 /* Called from accumulate_vtbl_inits. Adds the initializers for the
8981 BINFO vtable to L. */
8983 static void
8985 tree orig_binfo,
8986 tree rtti_binfo,
8987 tree orig_vtbl,
8988 tree t,
8990 {
8997 {
8998 /* In the hierarchy of BINFO_TYPE (RTTI_BINFO), this is a
8999 primary virtual base. If it is not the same primary in
9000 the hierarchy of T, we'll need to generate a ctor vtable
9001 for it, to place at its location in T. If it is the same
9002 primary, we still need a VTT entry for the vtable, but it
9003 should point to the ctor vtable for the base it is a
9004 primary for within the sub-hierarchy of RTTI_BINFO.
9006 There are three possible cases:
9008 1) We are in the same place.
9009 2) We are a primary base within a lost primary virtual base of
9010 RTTI_BINFO.
9011 3) We are primary to something not a base of RTTI_BINFO. */
9013 tree b;
9016 /* First, look through the bases we are primary to for RTTI_BINFO
9017 or a virtual base. */
9020 {
9025 }
9026 /* If we run out of primary links, keep looking down our
9027 inheritance chain; we might be an indirect primary. */
9031 found:
9033 /* If we found RTTI_BINFO, this is case 1. If we found a virtual
9034 base B and it is a base of RTTI_BINFO, this is case 2. In
9035 either case, we share our vtable with LAST, i.e. the
9036 derived-most base within B of which we are a primary. */
9039 /* Just set our BINFO_VTABLE to point to LAST, as we may not have
9040 set LAST's BINFO_VTABLE yet. We'll extract the actual vptr in
9041 binfo_ctor_vtable after everything's been set up. */
9044 /* Otherwise, this is case 3 and we get our own. */
9045 }
9052 {
9053 tree index;
9056 /* Add the initializer for this vtable. */
9060 /* Figure out the position to which the VPTR should point. */
9066 }
9069 /* For a construction vtable, we can't overwrite BINFO_VTABLE.
9070 So, we make a TREE_LIST. Later, dfs_fixup_binfo_vtbls will
9071 straighten this out. */
9074 /* Throw away any unneeded intializers. */
9076 else
9077 /* For an ordinary vtable, set BINFO_VTABLE. */
9079 }
9084 /* Construct the initializer for BINFO's virtual function table. BINFO
9085 is part of the hierarchy dominated by T. If we're building a
9086 construction vtable, the ORIG_BINFO is the binfo we should use to
9087 find the actual function pointers to put in the vtable - but they
9088 can be overridden on the path to most-derived in the graph that
9089 ORIG_BINFO belongs. Otherwise,
9090 ORIG_BINFO should be the same as BINFO. The RTTI_BINFO is the
9091 BINFO that should be indicated by the RTTI information in the
9092 vtable; it will be a base class of T, rather than T itself, if we
9093 are building a construction vtable.
9095 The value returned is a TREE_LIST suitable for wrapping in a
9096 CONSTRUCTOR to use as the DECL_INITIAL for a vtable. If
9097 NON_FN_ENTRIES_P is not NULL, *NON_FN_ENTRIES_P is set to the
9098 number of non-function entries in the vtable.
9100 It might seem that this function should never be called with a
9101 BINFO for which BINFO_PRIMARY_P holds, the vtable for such a
9102 base is always subsumed by a derived class vtable. However, when
9103 we are building construction vtables, we do build vtables for
9104 primary bases; we need these while the primary base is being
9105 constructed. */
9107 static void
9109 tree orig_binfo,
9110 tree t,
9111 tree rtti_binfo,
9114 {
9115 tree v;
9116 vtbl_init_data vid;
9118 tree vbinfo;
9122 /* Initialize VID. */
9130 /* The first vbase or vcall offset is at index -3 in the vtable. */
9133 /* Add entries to the vtable for RTTI. */
9136 /* Create an array for keeping track of the functions we've
9137 processed. When we see multiple functions with the same
9138 signature, we share the vcall offsets. */
9140 /* Add the vcall and vbase offset entries. */
9143 /* Clear BINFO_VTABLE_PATH_MARKED; it's set by
9144 build_vbase_offset_vtbl_entries. */
9149 /* If the target requires padding between data entries, add that now. */
9151 {
9156 /* Move data entries into their new positions and add padding
9157 after the new positions. Iterate backwards so we don't
9158 overwrite entries that we would need to process later. */
9161 ix--)
9162 {
9170 {
9174 null_pointer_node);
9175 }
9176 }
9177 }
9182 /* The initializers for virtual functions were built up in reverse
9183 order. Straighten them out and add them to the running list in one
9184 step. */
9193 /* Go through all the ordinary virtual functions, building up
9194 initializers. */
9196 {
9197 tree delta;
9198 tree vcall_index;
9205 {
9209 {
9212 }
9214 }
9216 /* If the only definition of this function signature along our
9217 primary base chain is from a lost primary, this vtable slot will
9218 never be used, so just zero it out. This is important to avoid
9219 requiring extra thunks which cannot be generated with the function.
9221 We first check this in update_vtable_entry_for_fn, so we handle
9222 restored primary bases properly; we also need to do it here so we
9223 zero out unused slots in ctor vtables, rather than filling them
9224 with erroneous values (though harmless, apart from relocation
9225 costs). */
9230 {
9231 /* Pull the offset for `this', and the function to call, out of
9232 the list. */
9239 /* You can't call an abstract virtual function; it's abstract.
9240 So, we replace these functions with __pure_virtual. */
9242 {
9245 {
9247 abort_fndecl_addr
9251 }
9252 }
9253 /* Likewise for deleted virtuals. */
9255 {
9257 {
9261 dvirt_fn = push_library_fn
9265 }
9270 }
9271 else
9272 {
9274 {
9279 }
9280 /* Take the address of the function, considering it to be of an
9281 appropriate generic type. */
9285 /* Don't refer to a virtual destructor from a constructor
9286 vtable or a vtable for an abstract class, since destroying
9287 an object under construction is undefined behavior and we
9288 don't want it to be considered a candidate for speculative
9289 devirtualization. But do create the thunk for ABI
9290 compliance. */
9295 }
9296 }
9298 /* And add it to the chain of initializers. */
9300 {
9305 else
9307 {
9313 }
9314 }
9315 else
9317 }
9318 }
9320 /* Adds to vid->inits the initializers for the vbase and vcall
9321 offsets in BINFO, which is in the hierarchy dominated by T. */
9323 static void
9325 {
9326 tree b;
9328 /* If this is a derived class, we must first create entries
9329 corresponding to the primary base class. */
9334 /* Add the vbase entries for this base. */
9336 /* Add the vcall entries for this base. */
9338 }
9340 /* Returns the initializers for the vbase offset entries in the vtable
9341 for BINFO (which is part of the class hierarchy dominated by T), in
9342 reverse order. VBASE_OFFSET_INDEX gives the vtable index
9343 where the next vbase offset will go. */
9345 static void
9347 {
9348 tree vbase;
9349 tree t;
9350 tree non_primary_binfo;
9352 /* If there are no virtual baseclasses, then there is nothing to
9353 do. */
9359 /* We might be a primary base class. Go up the inheritance hierarchy
9360 until we find the most derived class of which we are a primary base:
9361 it is the offset of that which we need to use. */
9364 {
9365 tree b;
9367 /* If we have reached a virtual base, then it must be a primary
9368 base (possibly multi-level) of vid->binfo, or we wouldn't
9369 have called build_vcall_and_vbase_vtbl_entries for it. But it
9370 might be a lost primary, so just skip down to vid->binfo. */
9372 {
9375 }
9381 }
9383 /* Go through the virtual bases, adding the offsets. */
9385 vbase;
9387 {
9388 tree b;
9389 tree delta;
9394 /* Find the instance of this virtual base in the complete
9395 object. */
9398 /* If we've already got an offset for this virtual base, we
9399 don't need another one. */
9404 /* Figure out where we can find this vbase offset. */
9413 /* The vbase offset had better be the same. */
9416 /* The next vbase will come at a more negative offset. */
9420 /* The initializer is the delta from BINFO to this virtual base.
9421 The vbase offsets go in reverse inheritance-graph order, and
9422 we are walking in inheritance graph order so these end up in
9423 the right order. */
9430 }
9431 }
9433 /* Adds the initializers for the vcall offset entries in the vtable
9434 for BINFO (which is part of the class hierarchy dominated by VID->DERIVED)
9435 to VID->INITS. */
9437 static void
9439 {
9440 /* We only need these entries if this base is a virtual base. We
9441 compute the indices -- but do not add to the vtable -- when
9442 building the main vtable for a class. */
9445 /* If BINFO is RTTI_BINFO, then (since BINFO does not
9446 correspond to VID->DERIVED), we are building a primary
9447 construction virtual table. Since this is a primary
9448 virtual table, we do not need the vcall offsets for
9449 BINFO. */
9451 {
9452 /* We need a vcall offset for each of the virtual functions in this
9453 vtable. For example:
9455 class A { virtual void f (); };
9456 class B1 : virtual public A { virtual void f (); };
9457 class B2 : virtual public A { virtual void f (); };
9458 class C: public B1, public B2 { virtual void f (); };
9460 A C object has a primary base of B1, which has a primary base of A. A
9461 C also has a secondary base of B2, which no longer has a primary base
9462 of A. So the B2-in-C construction vtable needs a secondary vtable for
9463 A, which will adjust the A* to a B2* to call f. We have no way of
9464 knowing what (or even whether) this offset will be when we define B2,
9465 so we store this "vcall offset" in the A sub-vtable and look it up in
9466 a "virtual thunk" for B2::f.
9468 We need entries for all the functions in our primary vtable and
9469 in our non-virtual bases' secondary vtables. */
9471 /* If we are just computing the vcall indices -- but do not need
9472 the actual entries -- not that. */
9475 /* Now, walk through the non-virtual bases, adding vcall offsets. */
9477 }
9478 }
9480 /* Build vcall offsets, starting with those for BINFO. */
9482 static void
9484 {
9486 tree primary_binfo;
9487 tree base_binfo;
9489 /* Don't walk into virtual bases -- except, of course, for the
9490 virtual base for which we are building vcall offsets. Any
9491 primary virtual base will have already had its offsets generated
9492 through the recursion in build_vcall_and_vbase_vtbl_entries. */
9496 /* If BINFO has a primary base, process it first. */
9501 /* Add BINFO itself to the list. */
9504 /* Scan the non-primary bases of BINFO. */
9508 }
9510 /* Called from build_vcall_offset_vtbl_entries_r. */
9512 static void
9514 {
9515 /* Make entries for the rest of the virtuals. */
9516 tree orig_fn;
9518 /* The ABI requires that the methods be processed in declaration
9519 order. */
9521 orig_fn;
9525 }
9527 /* Add a vcall offset entry for ORIG_FN to the vtable. */
9529 static void
9531 {
9533 tree vcall_offset;
9534 tree derived_entry;
9536 /* If there is already an entry for a function with the same
9537 signature as FN, then we do not need a second vcall offset.
9538 Check the list of functions already present in the derived
9539 class vtable. */
9541 {
9543 /* We only use one vcall offset for virtual destructors,
9544 even though there are two virtual table entries. */
9548 }
9550 /* If we are building these vcall offsets as part of building
9551 the vtable for the most derived class, remember the vcall
9552 offset. */
9554 {
9557 }
9559 /* The next vcall offset will be found at a more negative
9560 offset. */
9564 /* Keep track of this function. */
9568 {
9569 tree base;
9570 tree fn;
9572 /* Find the overriding function. */
9576 else
9577 {
9580 /* The vbase we're working on is a primary base of
9581 vid->binfo. But it might be a lost primary, so its
9582 BINFO_OFFSET might be wrong, so we just use the
9583 BINFO_OFFSET from vid->binfo. */
9589 vcall_offset);
9590 }
9591 /* Add the initializer to the vtable. */
9593 }
9594 }
9596 /* Return vtbl initializers for the RTTI entries corresponding to the
9597 BINFO's vtable. The RTTI entries should indicate the object given
9598 by VID->rtti_binfo. */
9600 static void
9602 {
9603 tree b;
9604 tree t;
9605 tree offset;
9606 tree decl;
9607 tree init;
9611 /* To find the complete object, we will first convert to our most
9612 primary base, and then add the offset in the vtbl to that value. */
9617 /* The second entry is the address of the typeinfo object. */
9620 else
9623 /* Convert the declaration to a type that can be stored in the
9624 vtable. */
9628 /* Add the offset-to-top entry. It comes earlier in the vtable than
9629 the typeinfo entry. Convert the offset to look like a
9630 function pointer, so that we can put it in the vtable. */
9633 }
9635 /* TRUE iff TYPE is uniquely derived from PARENT. Ignores
9636 accessibility. */
9638 bool
9640 {
9643 }
9645 /* TRUE iff TYPE is publicly & uniquely derived from PARENT. */
9647 bool
9649 {
9653 }
9655 /* CTX1 and CTX2 are declaration contexts. Return the innermost common
9656 class between them, if any. */
9658 tree
9660 {
9672 {
9675 }
9679 }