| blob | 07dfb1ce561e93e3a4fbd4300ba444848907058b |
1 /* Functions related to building classes and their related objects.
2 Copyright (C) 1987, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2007, 2008, 2009, 2010
4 Free Software Foundation, Inc.
5 Contributed by Michael Tiemann (tiemann@cygnus.com)
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 3, or (at your option)
12 any later version.
14 GCC is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING3. If not see
21 <http://www.gnu.org/licenses/>. */
24 /* High-level class interface. */
41 /* The number of nested classes being processed. If we are not in the
42 scope of any class, this is zero. */
46 /* In order to deal with nested classes, we keep a stack of classes.
47 The topmost entry is the innermost class, and is the entry at index
48 CURRENT_CLASS_DEPTH */
51 /* The name of the class. */
52 tree name;
54 /* The _TYPE node for the class. */
55 tree type;
57 /* The access specifier pending for new declarations in the scope of
58 this class. */
59 tree access;
61 /* If were defining TYPE, the names used in this class. */
62 splay_tree names_used;
64 /* Nonzero if this class is no longer open, because of a call to
65 push_to_top_level. */
70 {
71 /* The base for which we're building initializers. */
72 tree binfo;
73 /* The type of the most-derived type. */
74 tree derived;
75 /* The binfo for the dynamic type. This will be TYPE_BINFO (derived),
76 unless ctor_vtbl_p is true. */
77 tree rtti_binfo;
78 /* The negative-index vtable initializers built up so far. These
79 are in order from least negative index to most negative index. */
80 tree inits;
81 /* The last (i.e., most negative) entry in INITS. */
83 /* The binfo for the virtual base for which we're building
84 vcall offset initializers. */
85 tree vbase;
86 /* The functions in vbase for which we have already provided vcall
87 offsets. */
89 /* The vtable index of the next vcall or vbase offset. */
90 tree index;
91 /* Nonzero if we are building the initializer for the primary
92 vtable. */
94 /* Nonzero if we are building the initializer for a construction
95 vtable. */
97 /* True when adding vcall offset entries to the vtable. False when
98 merely computing the indices. */
102 /* The type of a function passed to walk_subobject_offsets. */
105 /* The stack itself. This is a dynamically resized array. The
106 number of elements allocated is CURRENT_CLASS_STACK_SIZE. */
110 /* The size of the largest empty class seen in this translation unit. */
113 /* An array of all local classes present in this translation unit, in
114 declaration order. */
183 tree);
202 splay_tree_key k2);
211 /* Variables shared between class.c and call.c. */
213 #ifdef GATHER_STATISTICS
221 #endif
223 /* Convert to or from a base subobject. EXPR is an expression of type
224 `A' or `A*', an expression of type `B' or `B*' is returned. To
225 convert A to a base B, CODE is PLUS_EXPR and BINFO is the binfo for
226 the B base instance within A. To convert base A to derived B, CODE
227 is MINUS_EXPR and BINFO is the binfo for the A instance within B.
228 In this latter case, A must not be a morally virtual base of B.
229 NONNULL is true if EXPR is known to be non-NULL (this is only
230 needed when EXPR is of pointer type). CV qualifiers are preserved
231 from EXPR. */
233 tree
235 tree expr,
236 tree binfo,
238 {
241 tree probe;
242 tree offset;
243 tree target_type;
245 tree ptr_target_type;
255 {
261 }
273 /* Nothing to do. */
277 {
281 }
284 /* This must happen before the call to save_expr. */
291 /* Do we need to look in the vtable for the real offset? */
294 /* Don't bother with the calculations inside sizeof; they'll ICE if the
295 source type is incomplete and the pointer value doesn't matter. */
297 {
302 }
304 /* Do we need to check for a null pointer? */
306 {
307 /* If we know the conversion will not actually change the value
308 of EXPR, then we can avoid testing the expression for NULL.
309 We have to avoid generating a COMPONENT_REF for a base class
310 field, because other parts of the compiler know that such
311 expressions are always non-NULL. */
313 {
314 tree class_type;
315 /* TARGET_TYPE has been extracted from BINFO, and, is
316 therefore always cv-unqualified. Extract the
317 cv-qualifiers from EXPR so that the expression returned
318 matches the input. */
320 target_type
324 }
326 }
328 /* Protect against multiple evaluation if necessary. */
332 /* Now that we've saved expr, build the real null test. */
334 {
338 }
340 /* If this is a simple base reference, express it as a COMPONENT_REF. */
342 /* We don't build base fields for empty bases, and they aren't very
343 interesting to the optimizers anyway. */
345 {
352 }
355 {
356 /* Going via virtual base V_BINFO. We need the static offset
357 from V_BINFO to BINFO, and the dynamic offset from D_BINFO to
358 V_BINFO. That offset is an entry in D_BINFO's vtable. */
359 tree v_offset;
362 {
363 /* In a base member initializer, we cannot rely on the
364 vtable being set up. We have to indirect via the
365 vtt_parm. */
366 tree t;
372 tf_warning_or_error);
373 }
374 else
376 tf_warning_or_error),
383 v_offset);
395 /* Negative fixed_type_p means this is a constructor or destructor;
396 virtual base layout is fixed in in-charge [cd]tors, but not in
397 base [cd]tors. */
401 v_offset,
404 else
406 }
408 target_type = cp_build_qualified_type
417 {
422 }
423 else
429 out:
433 integer_zero_node));
436 }
438 /* Subroutine of build_base_path; EXPR and BINFO are as in that function.
439 Perform a derived-to-base conversion by recursively building up a
440 sequence of COMPONENT_REFs to the appropriate base fields. */
442 static tree
444 {
447 tree field;
450 {
451 tree temp;
455 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x'
456 into `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only
457 an lvalue in the front end; only _DECLs and _REFs are lvalues
458 in the back end. */
464 }
466 /* Recurse. */
471 /* Is this the base field created by build_base_field? */
475 {
476 /* We don't use build_class_member_access_expr here, as that
477 has unnecessary checks, and more importantly results in
478 recursive calls to dfs_walk_once. */
486 /* Mark the expression const or volatile, as appropriate.
487 Even though we've dealt with the type above, we still have
488 to mark the expression itself. */
495 }
497 /* Didn't find the base field?!? */
499 }
501 /* Convert OBJECT to the base TYPE. OBJECT is an expression whose
502 type is a class type or a pointer to a class type. In the former
503 case, TYPE is also a class type; in the latter it is another
504 pointer type. If CHECK_ACCESS is true, an error message is emitted
505 if TYPE is inaccessible. If OBJECT has pointer type, the value is
506 assumed to be non-NULL. */
508 tree
510 tsubst_flags_t complain)
511 {
512 tree binfo;
513 tree object_type;
514 base_access access;
517 {
520 }
521 else
528 access,
529 NULL);
534 }
536 /* EXPR is an expression with unqualified class type. BASE is a base
537 binfo of that class type. Returns EXPR, converted to the BASE
538 type. This function assumes that EXPR is the most derived class;
539 therefore virtual bases can be found at their static offsets. */
541 tree
543 {
544 tree expr_type;
548 {
549 tree pointer_type;
553 /* We use fold_build2 and fold_convert below to simplify the trees
554 provided to the optimizers. It is not safe to call these functions
555 when processing a template because they do not handle C++-specific
556 trees. */
559 tf_warning_or_error);
566 }
569 }
571 \f
572 tree
574 {
580 /* First, convert to the requested type. */
585 /* Second, the requested type may not be the owner of its own vptr.
586 If not, convert to the base class that owns it. We cannot use
587 convert_to_base here, because VCONTEXT may appear more than once
588 in the inheritance hierarchy of TYPE, and thus direct conversion
589 between the types may be ambiguous. Following the path back up
590 one step at a time via primary bases avoids the problem. */
594 {
597 }
600 }
602 /* Given an object INSTANCE, return an expression which yields the
603 vtable element corresponding to INDEX. There are many special
604 cases for INSTANCE which we take care of here, mainly to avoid
605 creating extra tree nodes when we don't have to. */
607 static tree
609 {
610 tree aref;
613 /* Try to figure out what a reference refers to, and
614 access its virtual function table directly. */
622 {
627 }
636 }
638 tree
640 {
644 }
646 /* Given a stable object pointer INSTANCE_PTR, return an expression which
647 yields a function pointer corresponding to vtable element INDEX. */
649 tree
651 {
652 tree aref;
655 tf_warning_or_error),
656 idx);
658 /* When using function descriptors, the address of the
659 vtable entry is treated as a function pointer. */
663 tf_warning_or_error));
665 /* Remember this as a method reference, for later devirtualization. */
669 }
671 /* Return the name of the virtual function table (as an IDENTIFIER_NODE)
672 for the given TYPE. */
674 static tree
676 {
678 }
680 /* DECL is an entity associated with TYPE, like a virtual table or an
681 implicitly generated constructor. Determine whether or not DECL
682 should have external or internal linkage at the object file
683 level. This routine does not deal with COMDAT linkage and other
684 similar complexities; it simply sets TREE_PUBLIC if it possible for
685 entities in other translation units to contain copies of DECL, in
686 the abstract. */
688 void
690 {
691 /* If TYPE involves a local class in a function with internal
692 linkage, then DECL should have internal linkage too. Other local
693 classes have no linkage -- but if their containing functions
694 have external linkage, it makes sense for DECL to have external
695 linkage too. That will allow template definitions to be merged,
696 for example. */
698 {
701 }
702 else
704 }
706 /* Create a VAR_DECL for a primary or secondary vtable for CLASS_TYPE.
707 (For a secondary vtable for B-in-D, CLASS_TYPE should be D, not B.)
708 Use NAME for the name of the vtable, and VTABLE_TYPE for its type. */
710 static tree
712 {
713 tree decl;
716 /* vtable names are already mangled; give them their DECL_ASSEMBLER_NAME
717 now to avoid confusion in mangle_decl. */
726 /* At one time the vtable info was grabbed 2 words at a time. This
727 fails on sparc unless you have 8-byte alignment. (tiemann) */
731 /* The vtable has not been defined -- yet. */
735 /* Mark the VAR_DECL node representing the vtable itself as a
736 "gratuitous" one, thereby forcing dwarfout.c to ignore it. It
737 is rather important that such things be ignored because any
738 effort to actually generate DWARF for them will run into
739 trouble when/if we encounter code like:
741 #pragma interface
742 struct S { virtual void member (); };
744 because the artificial declaration of the vtable itself (as
745 manufactured by the g++ front end) will say that the vtable is
746 a static member of `S' but only *after* the debug output for
747 the definition of `S' has already been output. This causes
748 grief because the DWARF entry for the definition of the vtable
749 will try to refer back to an earlier *declaration* of the
750 vtable as a static member of `S' and there won't be one. We
751 might be able to arrange to have the "vtable static member"
752 attached to the member list for `S' before the debug info for
753 `S' get written (which would solve the problem) but that would
754 require more intrusive changes to the g++ front end. */
758 }
760 /* Get the VAR_DECL of the vtable for TYPE. TYPE need not be polymorphic,
761 or even complete. If this does not exist, create it. If COMPLETE is
762 nonzero, then complete the definition of it -- that will render it
763 impossible to actually build the vtable, but is useful to get at those
764 which are known to exist in the runtime. */
766 tree
768 {
769 tree decl;
778 {
781 }
784 }
786 /* Build the primary virtual function table for TYPE. If BINFO is
787 non-NULL, build the vtable starting with the initial approximation
788 that it is the same as the one which is the head of the association
789 list. Returns a nonzero value if a new vtable is actually
790 created. */
792 static int
794 {
795 tree decl;
796 tree virtuals;
801 {
803 /* We have already created a vtable for this base, so there's
804 no need to do it again. */
811 }
812 else
813 {
816 }
818 #ifdef GATHER_STATISTICS
821 #endif
823 /* Initialize the association list for this type, based
824 on our first approximation. */
829 }
831 /* Give BINFO a new virtual function table which is initialized
832 with a skeleton-copy of its original initialization. The only
833 entry that changes is the `delta' entry, so we can really
834 share a lot of structure.
836 FOR_TYPE is the most derived type which caused this table to
837 be needed.
839 Returns nonzero if we haven't met BINFO before.
841 The order in which vtables are built (by calling this function) for
842 an object must remain the same, otherwise a binary incompatibility
843 can result. */
845 static int
847 {
849 /* We already created a vtable for this base. There's no need to
850 do it again. */
853 /* Remember that we've created a vtable for this BINFO, so that we
854 don't try to do so again. */
857 /* Make fresh virtual list, so we can smash it later. */
860 /* Secondary vtables are laid out as part of the same structure as
861 the primary vtable. */
864 }
866 /* Create a new vtable for BINFO which is the hierarchy dominated by
867 T. Return nonzero if we actually created a new vtable. */
869 static int
871 {
873 /* In this case, it is *type*'s vtable we are modifying. We start
874 with the approximation that its vtable is that of the
875 immediate base class. */
877 else
878 /* This is our very own copy of `basetype' to play with. Later,
879 we will fill in all the virtual functions that override the
880 virtual functions in these base classes which are not defined
881 by the current type. */
883 }
885 /* Make *VIRTUALS, an entry on the BINFO_VIRTUALS list for BINFO
886 (which is in the hierarchy dominated by T) list FNDECL as its
887 BV_FN. DELTA is the required constant adjustment from the `this'
888 pointer where the vtable entry appears to the `this' required when
889 the function is actually called. */
891 static void
893 tree binfo,
894 tree fndecl,
895 tree delta,
897 {
898 tree v;
904 {
905 /* We need a new vtable for BINFO. */
907 {
908 /* If we really did make a new vtable, we also made a copy
909 of the BINFO_VIRTUALS list. Now, we have to find the
910 corresponding entry in that list. */
915 }
920 }
921 }
923 \f
924 /* Add method METHOD to class TYPE. If USING_DECL is non-null, it is
925 the USING_DECL naming METHOD. Returns true if the method could be
926 added to the method vec. */
928 bool
930 {
932 tree overload;
938 tree current_fns;
939 tree fns;
952 {
953 /* Make a new method vector. We start with 8 entries. We must
954 allocate at least two (for constructors and destructors), and
955 we're going to end up with an assignment operator at some
956 point as well. */
958 /* Create slots for constructors and destructors. */
962 }
964 /* Maintain TYPE_HAS_USER_CONSTRUCTOR, etc. */
967 /* Constructors and destructors go in special slots. */
971 {
975 {
981 type);
982 }
983 }
984 else
985 {
986 tree m;
989 /* See if we already have an entry with this name. */
993 {
996 {
1001 }
1005 {
1008 }
1013 }
1014 }
1017 /* Check to see if we've already got this method. */
1019 {
1021 tree fn_type;
1022 tree method_type;
1023 tree parms1;
1024 tree parms2;
1029 /* [over.load] Member function declarations with the
1030 same name and the same parameter types cannot be
1031 overloaded if any of them is a static member
1032 function declaration.
1034 [namespace.udecl] When a using-declaration brings names
1035 from a base class into a derived class scope, member
1036 functions in the derived class override and/or hide member
1037 functions with the same name and parameter types in a base
1038 class (rather than conflicting). */
1044 /* Compare the quals on the 'this' parm. Don't compare
1045 the whole types, as used functions are treated as
1046 coming from the using class in overload resolution. */
1055 /* For templates, the return type and template parameters
1056 must be identical. */
1073 {
1075 {
1077 /* Defer to the local function. */
1081 else
1083 using_decl);
1084 }
1085 else
1086 {
1089 }
1091 /* We don't call duplicate_decls here to merge the
1092 declarations because that will confuse things if the
1093 methods have inline definitions. In particular, we
1094 will crash while processing the definitions. */
1096 }
1097 }
1099 /* A class should never have more than one destructor. */
1103 /* Add the new binding. */
1112 {
1115 /* We only expect to add few methods in the COMPLETE_P case, so
1116 just make room for one more method in that case. */
1119 else
1125 else
1127 }
1128 else
1129 /* Replace the current slot. */
1132 }
1134 /* Subroutines of finish_struct. */
1136 /* Change the access of FDECL to ACCESS in T. Return 1 if change was
1137 legit, otherwise return 0. */
1139 static int
1141 {
1142 tree elem;
1151 {
1153 {
1157 else
1160 }
1161 else
1162 {
1163 /* They're changing the access to the same thing they changed
1164 it to before. That's OK. */
1165 ;
1166 }
1167 }
1168 else
1169 {
1173 }
1175 }
1177 /* Process the USING_DECL, which is a member of T. */
1179 static void
1181 {
1184 tree access
1189 tree old_value;
1195 {
1201 else
1203 }
1211 ;
1213 {
1215 /* It's OK to use functions from a base when there are functions with
1217 else
1218 {
1223 }
1224 }
1226 {
1230 }
1232 /* Make type T see field decl FDECL with access ACCESS. */
1235 {
1238 }
1239 else
1241 }
1242 \f
1243 /* Run through the base classes of T, updating CANT_HAVE_CONST_CTOR_P,
1244 and NO_CONST_ASN_REF_P. Also set flag bits in T based on
1245 properties of the bases. */
1247 static void
1251 {
1254 tree base_binfo;
1255 tree binfo;
1267 {
1272 /* Effective C++ rule 14. We only need to check TYPE_POLYMORPHIC_P
1273 here because the case of virtual functions but non-virtual
1274 dtor is handled in finish_struct_1. */
1279 /* If the base class doesn't have copy constructors or
1280 assignment operators that take const references, then the
1281 derived class cannot have such a member automatically
1282 generated. */
1290 /* A virtual base does not effect nearly emptiness. */
1291 ;
1293 {
1295 /* And if there is more than one nearly empty base, then the
1296 derived class is not nearly empty either. */
1298 else
1299 /* Remember we've seen one. */
1301 }
1303 /* If the base class is not empty or nearly empty, then this
1304 class cannot be nearly empty. */
1307 /* A lot of properties from the bases also apply to the derived
1308 class. */
1320 /* A standard-layout class is a class that:
1321 ...
1322 * has no non-standard-layout base classes, */
1325 {
1326 tree basefield;
1327 /* ...has no base classes of the same type as the first non-static
1328 data member... */
1330 && (same_type_ignoring_top_level_qualifiers_p
1333 else
1334 /* ...either has no non-static data members in the most-derived
1335 class and at most one base class with non-static data
1336 members, or has no base classes with non-static data
1337 members */
1341 {
1344 else
1347 }
1348 }
1349 }
1350 }
1352 /* Determine all the primary bases within T. Sets BINFO_PRIMARY_BASE_P for
1353 those that are primaries. Sets BINFO_LOST_PRIMARY_P for those
1354 that have had a nearly-empty virtual primary base stolen by some
1355 other base in the hierarchy. Determines CLASSTYPE_PRIMARY_BASE for
1356 T. */
1358 static void
1360 {
1364 tree base_binfo;
1366 /* Determine the primary bases of our bases. */
1369 {
1372 /* See if we're the non-virtual primary of our inheritance
1373 chain. */
1375 {
1382 /* We are the primary binfo. */
1384 }
1385 /* Determine if we have a virtual primary base, and mark it so.
1386 */
1388 {
1392 /* Someone already claimed this base. */
1394 else
1395 {
1396 tree delta;
1401 /* A virtual binfo might have been copied from within
1402 another hierarchy. As we're about to use it as a
1403 primary base, make sure the offsets match. */
1411 }
1412 }
1413 }
1415 /* First look for a dynamic direct non-virtual base. */
1417 {
1421 {
1424 }
1425 }
1427 /* A "nearly-empty" virtual base class can be the primary base
1428 class, if no non-virtual polymorphic base can be found. Look for
1429 a nearly-empty virtual dynamic base that is not already a primary
1430 base of something in the hierarchy. If there is no such base,
1431 just pick the first nearly-empty virtual base. */
1437 {
1439 {
1440 /* Found one that is not primary. */
1443 }
1445 /* Remember the first candidate. */
1447 }
1449 found:
1450 /* If we've got a primary base, use it. */
1452 {
1457 /* We are stealing a primary base. */
1461 {
1462 tree delta;
1465 /* A virtual binfo might have been copied from within
1466 another hierarchy. As we're about to use it as a primary
1467 base, make sure the offsets match. */
1472 }
1479 }
1480 }
1482 /* Update the variant types of T. */
1484 void
1486 {
1487 tree variants;
1493 variants;
1495 {
1496 /* These fields are in the _TYPE part of the node, not in
1497 the TYPE_LANG_SPECIFIC component, so they are not shared. */
1507 /* Copy whatever these are holding today. */
1512 /* All variants of a class have the same attributes. */
1514 }
1515 }
1517 \f
1518 /* Set memoizing fields and bits of T (and its variants) for later
1519 use. */
1521 static void
1523 {
1524 /* Fix up variants (if any). */
1528 /* For a class w/o baseclasses, 'finish_struct' has set
1529 CLASSTYPE_PURE_VIRTUALS correctly (by definition).
1530 Similarly for a class whose base classes do not have vtables.
1531 When neither of these is true, we might have removed abstract
1532 virtuals (by providing a definition), added some (by declaring
1533 new ones), or redeclared ones from a base class. We need to
1534 recalculate what's really an abstract virtual at this point (by
1535 looking in the vtables). */
1538 /* If this type has a copy constructor or a destructor, force its
1539 mode to be BLKmode, and force its TREE_ADDRESSABLE bit to be
1540 nonzero. This will cause it to be passed by invisible reference
1541 and prevent it from being returned in a register. */
1543 {
1544 tree variants;
1547 {
1550 }
1551 }
1552 }
1554 /* Issue warnings about T having private constructors, but no friends,
1555 and so forth.
1557 HAS_NONPRIVATE_METHOD is nonzero if T has any non-private methods or
1558 static members. HAS_NONPRIVATE_STATIC_FN is nonzero if T has any
1559 non-private static member functions. */
1561 static void
1563 {
1566 tree fn;
1569 /* If the class has friends, those entities might create and
1570 access instances, so we should not warn. */
1573 /* We will have warned when the template was declared; there's
1574 no need to warn on every instantiation. */
1576 /* There's no reason to even consider warning about this
1577 class. */
1580 /* We only issue one warning, if more than one applies, because
1581 otherwise, on code like:
1583 class A {
1584 // Oops - forgot `public:'
1585 A();
1586 A(const A&);
1587 ~A();
1588 };
1590 we warn several times about essentially the same problem. */
1592 /* Check to see if all (non-constructor, non-destructor) member
1593 functions are private. (Since there are no friends or
1594 non-private statics, we can't ever call any of the private member
1595 functions.) */
1597 /* We're not interested in compiler-generated methods; they don't
1598 provide any way to call private members. */
1600 {
1602 {
1604 /* A non-private static member function is just like a
1605 friend; it can create and invoke private member
1606 functions, and be accessed without a class
1607 instance. */
1611 /* Keep searching for a static member function. */
1612 }
1615 }
1618 {
1619 /* There are no non-private methods, and there's at least one
1620 private member function that isn't a constructor or
1621 destructor. (If all the private members are
1622 constructors/destructors we want to use the code below that
1623 issues error messages specifically referring to
1624 constructors/destructors.) */
1630 {
1633 }
1635 {
1639 }
1640 }
1642 /* Even if some of the member functions are non-private, the class
1643 won't be useful for much if all the constructors or destructors
1644 are private: such an object can never be created or destroyed. */
1647 {
1650 t);
1652 }
1654 /* Warn about classes that have private constructors and no friends. */
1656 /* Implicitly generated constructors are always public. */
1659 {
1662 /* If a non-template class does not define a copy
1663 constructor, one is defined for it, enabling it to avoid
1664 this warning. For a template class, this does not
1665 happen, and so we would normally get a warning on:
1667 template <class T> class C { private: C(); };
1669 To avoid this asymmetry, we check TYPE_HAS_INIT_REF. All
1670 complete non-template or fully instantiated classes have this
1671 flag set. */
1674 else
1676 {
1678 /* Ideally, we wouldn't count copy constructors (or, in
1679 fact, any constructor that takes an argument of the
1680 class type as a parameter) because such things cannot
1681 be used to construct an instance of the class unless
1682 you already have one. But, for now at least, we're
1683 more generous. */
1685 {
1688 }
1689 }
1692 {
1695 t);
1697 }
1698 }
1699 }
1702 gt_pointer_operator new_value;
1706 /* Comparison function to compare two TYPE_METHOD_VEC entries by name. */
1708 static int
1710 {
1723 }
1725 /* This routine compares two fields like method_name_cmp but using the
1726 pointer operator in resort_field_decl_data. */
1728 static int
1730 {
1739 {
1746 }
1748 }
1750 /* Resort TYPE_METHOD_VEC because pointers have been reordered. */
1752 void
1755 gt_pointer_operator new_value,
1757 {
1761 tree fn;
1763 /* The type conversion ops have to live at the front of the vec, so we
1764 can't sort them. */
1772 {
1776 resort_method_name_cmp);
1777 }
1778 }
1780 /* Warn about duplicate methods in fn_fields.
1782 Sort methods that are not special (i.e., constructors, destructors,
1783 and type conversion operators) so that we can find them faster in
1784 search. */
1786 static void
1788 {
1789 tree fn_fields;
1799 /* Clear DECL_IN_AGGR_P for all functions. */
1804 /* Issue warnings about private constructors and such. If there are
1805 no methods, then some public defaults are generated. */
1808 /* The type conversion ops have to live at the front of the vec, so we
1809 can't sort them. */
1818 }
1820 /* Make BINFO's vtable have N entries, including RTTI entries,
1821 vbase and vcall offsets, etc. Set its type and call the back end
1822 to lay it out. */
1824 static void
1826 {
1827 tree atype;
1828 tree vtable;
1834 /* We may have to grow the vtable. */
1837 {
1841 }
1842 }
1844 /* True iff FNDECL and BASE_FNDECL (both non-static member functions)
1845 have the same signature. */
1847 int
1849 {
1850 /* One destructor overrides another if they are the same kind of
1851 destructor. */
1855 /* But a non-destructor never overrides a destructor, nor vice
1856 versa, nor do different kinds of destructors override
1857 one-another. For example, a complete object destructor does not
1858 override a deleting destructor. */
1867 {
1875 }
1877 }
1879 /* Returns TRUE if DERIVED is a binfo containing the binfo BASE as a
1880 subobject. */
1882 static bool
1884 {
1885 tree probe;
1888 {
1892 /* If we meet a virtual base, we can't follow the inheritance
1893 any more. See if the complete type of DERIVED contains
1894 such a virtual base. */
1897 }
1899 }
1902 /* The function for which we are trying to find a final overrider. */
1903 tree fn;
1904 /* The base class in which the function was declared. */
1905 tree declaring_base;
1906 /* The candidate overriders. */
1907 tree candidates;
1908 /* Path to most derived. */
1912 /* Add the overrider along the current path to FFOD->CANDIDATES.
1913 Returns true if an overrider was found; false otherwise. */
1915 static bool
1919 {
1920 tree method;
1922 /* If BINFO is not the most derived type, try a more derived class.
1923 A definition there will overrider a definition here. */
1925 {
1926 depth--;
1930 }
1934 {
1937 /* Remove any candidates overridden by this new function. */
1939 {
1940 /* If *CANDIDATE overrides METHOD, then METHOD
1941 cannot override anything else on the list. */
1944 /* If METHOD overrides *CANDIDATE, remove *CANDIDATE. */
1947 else
1949 }
1951 /* Add the new function. */
1954 }
1957 }
1959 /* Called from find_final_overrider via dfs_walk. */
1961 static tree
1963 {
1971 }
1973 static tree
1975 {
1980 }
1982 /* Returns a TREE_LIST whose TREE_PURPOSE is the final overrider for
1983 FN and whose TREE_VALUE is the binfo for the base where the
1984 overriding occurs. BINFO (in the hierarchy dominated by the binfo
1985 DERIVED) is the base object in which FN is declared. */
1987 static tree
1989 {
1990 find_final_overrider_data ffod;
1992 /* Getting this right is a little tricky. This is valid:
1994 struct S { virtual void f (); };
1995 struct T { virtual void f (); };
1996 struct U : public S, public T { };
1998 even though calling `f' in `U' is ambiguous. But,
2000 struct R { virtual void f(); };
2001 struct S : virtual public R { virtual void f (); };
2002 struct T : virtual public R { virtual void f (); };
2003 struct U : public S, public T { };
2005 is not -- there's no way to decide whether to put `S::f' or
2006 `T::f' in the vtable for `R'.
2008 The solution is to look at all paths to BINFO. If we find
2009 different overriders along any two, then there is a problem. */
2013 /* Determine the depth of the hierarchy. */
2024 /* If there was no winner, issue an error message. */
2029 }
2031 /* Return the index of the vcall offset for FN when TYPE is used as a
2032 virtual base. */
2034 static tree
2036 {
2038 tree_pair_p p;
2046 /* There should always be an appropriate index. */
2048 }
2050 /* Update an entry in the vtable for BINFO, which is in the hierarchy
2051 dominated by T. FN has been overridden in BINFO; VIRTUALS points to the
2052 corresponding position in the BINFO_VIRTUALS list. */
2054 static void
2057 {
2058 tree b;
2059 tree overrider;
2060 tree delta;
2061 tree virtual_base;
2062 tree first_defn;
2068 /* Find the nearest primary base (possibly binfo itself) which defines
2069 this function; this is the class the caller will convert to when
2070 calling FN through BINFO. */
2072 {
2077 /* The nearest definition is from a lost primary. */
2080 }
2083 /* Find the final overrider. */
2086 {
2089 }
2092 /* Check for adjusting covariant return types. */
2100 /* If the overrider is invalid, don't even try. */
2102 {
2103 /* If FN is a covariant thunk, we must figure out the adjustment
2104 to the final base FN was converting to. As OVERRIDER_TARGET might
2105 also be converting to the return type of FN, we have to
2106 combine the two conversions here. */
2113 {
2117 }
2118 else
2122 /* Find the equivalent binfo within the return type of the
2123 overriding function. We will want the vbase offset from
2124 there. */
2126 over_return);
2129 {
2130 /* There was no existing virtual thunk (which takes
2131 precedence). So find the binfo of the base function's
2132 return type within the overriding function's return type.
2133 We cannot call lookup base here, because we're inside a
2134 dfs_walk, and will therefore clobber the BINFO_MARKED
2135 flags. Fortunately we know the covariancy is valid (it
2136 has already been checked), so we can just iterate along
2137 the binfos, which have been chained in inheritance graph
2138 order. Of course it is lame that we have to repeat the
2139 search here anyway -- we should really be caching pieces
2140 of the vtable and avoiding this repeated work. */
2143 /* Find the base binfo within the overriding function's
2144 return type. We will always find a thunk_binfo, except
2145 when the covariancy is invalid (which we will have
2146 already diagnosed). */
2149 thunk_binfo;
2155 /* See if virtual inheritance is involved. */
2157 virtual_offset;
2164 {
2168 {
2169 /* We convert via virtual base. Adjust the fixed
2170 offset to be from there. */
2171 offset =
2175 }
2177 /* There was an existing fixed offset, this must be
2178 from the base just converted to, and the base the
2179 FN was thunking to. */
2181 else
2183 }
2184 }
2187 /* Replace the overriding function with a covariant thunk. We
2188 will emit the overriding function in its own slot as
2189 well. */
2192 }
2193 else
2197 /* Assume that we will produce a thunk that convert all the way to
2198 the final overrider, and not to an intermediate virtual base. */
2201 /* See if we can convert to an intermediate virtual base first, and then
2202 use the vcall offset located there to finish the conversion. */
2204 {
2205 /* If we find the final overrider, then we can stop
2206 walking. */
2211 /* If we find a virtual base, and we haven't yet found the
2212 overrider, then there is a virtual base between the
2213 declaring base (first_defn) and the final overrider. */
2215 {
2218 }
2219 }
2222 {
2223 /* The ABI specifies that a covariant thunk includes a mangling
2224 for a this pointer adjustment. This-adjusting thunks that
2225 override a function from a virtual base have a vcall
2226 adjustment. When the virtual base in question is a primary
2227 virtual base, we know the adjustments are zero, (and in the
2228 non-covariant case, we would not use the thunk).
2229 Unfortunately we didn't notice this could happen, when
2230 designing the ABI and so never mandated that such a covariant
2231 thunk should be emitted. Because we must use the ABI mandated
2232 name, we must continue searching from the binfo where we
2233 found the most recent definition of the function, towards the
2234 primary binfo which first introduced the function into the
2235 vtable. If that enters a virtual base, we must use a vcall
2236 this-adjusting thunk. Bleah! */
2245 /* Even if we find a virtual base, the correct delta is
2246 between the overrider and the binfo we're building a vtable
2247 for. */
2249 }
2251 /* Compute the constant adjustment to the `this' pointer. The
2252 `this' pointer, when this function is called, will point at BINFO
2253 (or one of its primary bases, which are at the same offset). */
2255 /* The `this' pointer needs to be adjusted from the declaration to
2256 the nearest virtual base. */
2261 /* If the nearest definition is in a lost primary, we don't need an
2262 entry in our vtable. Except possibly in a constructor vtable,
2263 if we happen to get our primary back. In that case, the offset
2264 will be zero, as it will be a primary base. */
2266 else
2267 /* The `this' pointer needs to be adjusted from pointing to
2268 BINFO to pointing at the base where the final overrider
2269 appears. */
2270 virtual_covariant:
2281 else
2283 }
2285 /* Called from modify_all_vtables via dfs_walk. */
2287 static tree
2289 {
2291 tree virtuals;
2292 tree old_virtuals;
2296 /* A base without a vtable needs no modification, and its bases
2297 are uninteresting. */
2302 /* Don't do the primary vtable, if it's new. */
2306 /* There's no need to modify the vtable for a non-virtual primary
2307 base; we're not going to use that vtable anyhow. We do still
2308 need to do this for virtual primary bases, as they could become
2309 non-primary in a construction vtable. */
2314 /* Now, go through each of the virtual functions in the virtual
2315 function table for BINFO. Find the final overrider, and update
2316 the BINFO_VIRTUALS list appropriately. */
2319 virtuals;
2323 binfo,
2328 }
2330 /* Update all of the primary and secondary vtables for T. Create new
2331 vtables as required, and initialize their RTTI information. Each
2332 of the functions in VIRTUALS is declared in T and may override a
2333 virtual function from a base class; find and modify the appropriate
2334 entries to point to the overriding functions. Returns a list, in
2335 declaration order, of the virtual functions that are declared in T,
2336 but do not appear in the primary base class vtable, and which
2337 should therefore be appended to the end of the vtable for T. */
2339 static tree
2341 {
2345 /* Update all of the vtables. */
2348 /* Add virtual functions not already in our primary vtable. These
2349 will be both those introduced by this class, and those overridden
2350 from secondary bases. It does not include virtuals merely
2351 inherited from secondary bases. */
2353 {
2358 {
2359 /* We don't need to adjust the `this' pointer when
2360 calling this function. */
2364 /* This is a function not already in our vtable. Keep it. */
2366 }
2367 else
2368 /* We've already got an entry for this function. Skip it. */
2370 }
2373 }
2375 /* Get the base virtual function declarations in T that have the
2376 indicated NAME. */
2378 static tree
2380 {
2381 tree methods;
2386 /* Find virtual functions in T with the indicated NAME. */
2390 methods;
2392 {
2398 }
2404 {
2407 base_fndecls);
2408 }
2411 }
2413 /* If this declaration supersedes the declaration of
2414 a method declared virtual in the base class, then
2415 mark this field as being virtual as well. */
2417 void
2419 {
2421 /* In [temp.mem] we have:
2423 A specialization of a member function template does not
2424 override a virtual function from a base class. */
2431 /* Set DECL_VINDEX to a value that is neither an INTEGER_CST nor
2432 the error_mark_node so that we know it is an overriding
2433 function. */
2437 {
2441 }
2442 }
2444 /* Warn about hidden virtual functions that are not overridden in t.
2445 We know that constructors and destructors don't apply. */
2447 static void
2449 {
2451 tree fns;
2454 /* We go through each separately named virtual function. */
2458 {
2459 tree fn;
2460 tree name;
2461 tree fndecl;
2462 tree base_fndecls;
2463 tree base_binfo;
2464 tree binfo;
2467 /* All functions in this slot in the CLASSTYPE_METHOD_VEC will
2468 have the same name. Figure out what name that is. */
2470 /* There are no possibly hidden functions yet. */
2472 /* Iterate through all of the base classes looking for possibly
2473 hidden functions. */
2476 {
2479 base_fndecls);
2480 }
2482 /* If there are no functions to hide, continue. */
2486 /* Remove any overridden functions. */
2488 {
2491 {
2495 /* If the method from the base class has the same
2496 signature as the method from the derived class, it
2497 has been overridden. */
2500 else
2502 }
2503 }
2505 /* Now give a warning for all base functions without overriders,
2506 as they are hidden. */
2508 {
2509 /* Here we know it is a hider, and no overrider exists. */
2513 }
2514 }
2515 }
2517 /* Check for things that are invalid. There are probably plenty of other
2518 things we should check for also. */
2520 static void
2522 {
2523 tree field;
2526 {
2534 {
2538 {
2539 /* We're generally only interested in entities the user
2540 declared, but we also find nested classes by noticing
2541 the TYPE_DECL that we create implicitly. You're
2542 allowed to put one anonymous union inside another,
2543 though, so we explicitly tolerate that. We use
2544 TYPE_ANONYMOUS_P rather than ANON_AGGR_TYPE_P so that
2545 we also allow unnamed types used for defining fields. */
2552 {
2556 else
2560 }
2563 {
2566 else
2568 }
2570 {
2573 else
2575 }
2579 }
2580 }
2581 }
2582 }
2584 /* Add T to CLASSTYPE_DECL_LIST of current_class_type which
2585 will be used later during class template instantiation.
2586 When FRIEND_P is zero, T can be a static member data (VAR_DECL),
2587 a non-static member data (FIELD_DECL), a member function
2588 (FUNCTION_DECL), a nested type (RECORD_TYPE, ENUM_TYPE),
2589 a typedef (TYPE_DECL) or a member class template (TEMPLATE_DECL)
2590 When FRIEND_P is nonzero, T is either a friend class
2591 (RECORD_TYPE, TEMPLATE_DECL) or a friend function
2592 (FUNCTION_DECL, TEMPLATE_DECL). */
2594 void
2596 {
2597 /* Save some memory by not creating TREE_LIST if TYPE is not template. */
2602 }
2604 /* Create default constructors, assignment operators, and so forth for
2605 the type indicated by T, if they are needed. CANT_HAVE_CONST_CTOR,
2606 and CANT_HAVE_CONST_ASSIGNMENT are nonzero if, for whatever reason,
2607 the class cannot have a default constructor, copy constructor
2608 taking a const reference argument, or an assignment operator taking
2609 a const reference, respectively. */
2611 static void
2615 {
2616 /* Destructor. */
2618 {
2619 /* In general, we create destructors lazily. */
2621 /* However, if the implicit destructor is non-trivial
2622 destructor, we sometimes have to create it at this point. */
2624 {
2628 /* If this a Java class, any non-trivial destructor is
2629 invalid, even if compiler-generated. Therefore, if the
2630 destructor is non-trivial we create it now. */
2632 else
2633 {
2634 tree binfo;
2635 tree base_binfo;
2638 /* If the implicit destructor will be virtual, then we must
2639 generate it now because (unfortunately) we do not
2640 generate virtual tables lazily. */
2643 {
2644 tree base_type;
2645 tree dtor;
2650 {
2653 }
2654 }
2655 }
2657 /* If we can't get away with being lazy, generate the destructor
2658 now. */
2661 }
2662 }
2664 /* [class.ctor]
2666 If there is no user-declared constructor for a class, a default
2667 constructor is implicitly declared. */
2669 {
2672 }
2674 /* [class.ctor]
2676 If a class definition does not explicitly declare a copy
2677 constructor, one is declared implicitly. */
2679 {
2683 }
2685 /* Currently only lambdas get a lazy move ctor, but N2987 adds them for
2686 other classes. */
2690 /* If there is no assignment operator, one will be created if and
2691 when it is needed. For now, just record whether or not the type
2692 of the parameter to the assignment operator will be a const or
2693 non-const reference. */
2695 {
2699 }
2700 }
2702 /* Subroutine of finish_struct_1. Recursively count the number of fields
2703 in TYPE, including anonymous union members. */
2705 static int
2707 {
2708 tree x;
2711 {
2714 else
2716 }
2718 }
2720 /* Subroutine of finish_struct_1. Recursively add all the fields in the
2721 TREE_LIST FIELDS to the SORTED_FIELDS_TYPE elts, starting at offset IDX. */
2723 static int
2725 {
2726 tree x;
2728 {
2731 else
2733 }
2735 }
2737 /* FIELD is a bit-field. We are finishing the processing for its
2738 enclosing type. Issue any appropriate messages and set appropriate
2739 flags. Returns false if an error has been diagnosed. */
2741 static bool
2743 {
2745 tree w;
2747 /* Extract the declared width of the bitfield, which has been
2748 temporarily stashed in DECL_INITIAL. */
2751 /* Remove the bit-field width indicator so that the rest of the
2752 compiler does not treat that value as an initializer. */
2755 /* Detect invalid bit-field type. */
2757 {
2760 }
2761 else
2762 {
2763 /* Avoid the non_lvalue wrapper added by fold for PLUS_EXPRs. */
2766 /* detect invalid field size. */
2770 {
2773 }
2775 {
2778 }
2780 {
2783 }
2790 tree_int_cst_min_precision
2794 tree_int_cst_min_precision
2798 }
2801 {
2805 }
2806 else
2807 {
2808 /* Non-bit-fields are aligned for their type. */
2812 }
2813 }
2815 /* FIELD is a non bit-field. We are finishing the processing for its
2816 enclosing type T. Issue any appropriate messages and set appropriate
2817 flags. */
2819 static void
2821 tree t,
2825 {
2828 /* An anonymous union cannot contain any fields which would change
2829 the settings of CANT_HAVE_CONST_CTOR and friends. */
2831 ;
2832 /* And, we don't set TYPE_HAS_CONST_INIT_REF, etc., for anonymous
2833 structs. So, we recurse through their fields here. */
2835 {
2836 tree fields;
2842 }
2843 /* Check members with class type for constructors, destructors,
2844 etc. */
2846 {
2847 /* Never let anything with uninheritable virtuals
2848 make it through without complaint. */
2852 {
2855 field);
2860 field);
2861 }
2862 else
2863 {
2870 }
2877 }
2879 {
2880 /* `build_class_init_list' does not recognize
2881 non-FIELD_DECLs. */
2885 }
2886 }
2888 /* Check the data members (both static and non-static), class-scoped
2889 typedefs, etc., appearing in the declaration of T. Issue
2890 appropriate diagnostics. Sets ACCESS_DECLS to a list (in
2891 declaration order) of access declarations; each TREE_VALUE in this
2892 list is a USING_DECL.
2894 In addition, set the following flags:
2896 EMPTY_P
2897 The class is empty, i.e., contains no non-static data members.
2899 CANT_HAVE_CONST_CTOR_P
2900 This class cannot have an implicitly generated copy constructor
2901 taking a const reference.
2903 CANT_HAVE_CONST_ASN_REF
2904 This class cannot have an implicitly generated assignment
2905 operator taking a const reference.
2907 All of these flags should be initialized before calling this
2908 function.
2910 Returns a pointer to the end of the TYPE_FIELDs chain; additional
2911 fields can be added by adding to this chain. */
2913 static void
2917 {
2925 /* Assume there are no access declarations. */
2927 /* Assume this class has no pointer members. */
2929 /* Assume none of the members of this class have default
2930 initializations. */
2934 {
2942 {
2943 /* Prune the access declaration from the list of fields. */
2946 /* Save the access declarations for our caller. */
2949 /* Since we've reset *FIELD there's no reason to skip to the
2950 next field. */
2953 }
2959 /* If we've gotten this far, it's a data member, possibly static,
2960 or an enumerator. */
2963 /* When this goes into scope, it will be a non-local reference. */
2967 {
2968 /* [class.union]
2970 If a union contains a static data member, or a member of
2971 reference type, the program is ill-formed. */
2973 {
2976 }
2978 {
2983 }
2984 }
2986 /* Perform error checking that did not get done in
2987 grokdeclarator. */
2989 {
2993 }
2995 {
2999 }
3007 /* Now it can only be a FIELD_DECL. */
3012 /* A standard-layout class is a class that:
3013 ...
3014 has the same access control (Clause 11) for all non-static data members,
3015 ... */
3022 /* If this is of reference type, check if it needs an init. */
3024 {
3030 /* ARM $12.6.2: [A member initializer list] (or, for an
3031 aggregate, initialization by a brace-enclosed list) is the
3032 only way to initialize nonstatic const and reference
3033 members. */
3035 }
3040 {
3042 {
3043 warning
3046 x);
3048 }
3052 }
3055 /* We don't treat zero-width bitfields as making a class
3056 non-empty. */
3057 ;
3058 else
3059 {
3060 /* The class is non-empty. */
3062 /* The class is not even nearly empty. */
3064 /* If one of the data members contains an empty class,
3065 so does T. */
3069 }
3071 /* This is used by -Weffc++ (see below). Warn only for pointers
3072 to members which might hold dynamic memory. So do not warn
3073 for pointers to functions or pointers to members. */
3080 {
3085 }
3091 /* DR 148 now allows pointers to members (which are POD themselves),
3092 to be allowed in POD structs. */
3101 /* If any field is const, the structure type is pseudo-const. */
3103 {
3108 /* ARM $12.6.2: [A member initializer list] (or, for an
3109 aggregate, initialization by a brace-enclosed list) is the
3110 only way to initialize nonstatic const and reference
3111 members. */
3113 }
3114 /* A field that is pseudo-const makes the structure likewise. */
3116 {
3121 }
3123 /* Core issue 80: A nonstatic data member is required to have a
3124 different name from the class iff the class has a
3125 user-declared constructor. */
3130 /* We set DECL_C_BIT_FIELD in grokbitfield.
3131 If the type and width are valid, we'll also set DECL_BIT_FIELD. */
3134 cant_have_const_ctor_p,
3135 no_const_asn_ref_p,
3137 }
3139 /* Effective C++ rule 11: if a class has dynamic memory held by pointers,
3140 it should also define a copy constructor and an assignment operator to
3141 implement the correct copy semantic (deep vs shallow, etc.). As it is
3142 not feasible to check whether the constructors do allocate dynamic memory
3143 and store it within members, we approximate the warning like this:
3145 -- Warn only if there are members which are pointers
3146 -- Warn only if there is a non-trivial constructor (otherwise,
3147 there cannot be memory allocated).
3148 -- Warn only if there is a non-trivial destructor. We assume that the
3149 user at least implemented the cleanup correctly, and a destructor
3150 is needed to free dynamic memory.
3152 This seems enough for practical purposes. */
3154 && has_pointers
3158 {
3162 {
3167 }
3171 }
3173 /* If any of the fields couldn't be packed, unset TYPE_PACKED. */
3177 /* Check anonymous struct/anonymous union fields. */
3180 /* We've built up the list of access declarations in reverse order.
3181 Fix that now. */
3183 }
3185 /* If TYPE is an empty class type, records its OFFSET in the table of
3186 OFFSETS. */
3188 static int
3190 {
3191 splay_tree_node n;
3196 /* Record the location of this empty object in OFFSETS. */
3204 type,
3208 }
3210 /* Returns nonzero if TYPE is an empty class type and there is
3211 already an entry in OFFSETS for the same TYPE as the same OFFSET. */
3213 static int
3215 {
3216 splay_tree_node n;
3217 tree t;
3222 /* Record the location of this empty object in OFFSETS. */
3232 }
3234 /* Walk through all the subobjects of TYPE (located at OFFSET). Call
3235 F for every subobject, passing it the type, offset, and table of
3236 OFFSETS. If VBASES_P is one, then virtual non-primary bases should
3237 be traversed.
3239 If MAX_OFFSET is non-NULL, then subobjects with an offset greater
3240 than MAX_OFFSET will not be walked.
3242 If F returns a nonzero value, the traversal ceases, and that value
3243 is returned. Otherwise, returns zero. */
3245 static int
3247 subobject_offset_fn f,
3248 tree offset,
3249 splay_tree offsets,
3250 tree max_offset,
3252 {
3256 /* If this OFFSET is bigger than the MAX_OFFSET, then we should
3257 stop. */
3265 {
3269 }
3272 {
3273 tree field;
3274 tree binfo;
3277 /* Avoid recursing into objects that are not interesting. */
3281 /* Record the location of TYPE. */
3286 /* Iterate through the direct base classes of TYPE. */
3290 {
3291 tree binfo_offset;
3304 offset,
3306 else
3307 {
3308 tree orig_binfo;
3309 /* We cannot rely on BINFO_OFFSET being set for the base
3310 class yet, but the offsets for direct non-virtual
3311 bases can be calculated by going back to the TYPE. */
3314 offset,
3316 }
3319 f,
3320 binfo_offset,
3321 offsets,
3322 max_offset,
3327 }
3330 {
3334 /* Iterate through the virtual base classes of TYPE. In G++
3335 3.2, we included virtual bases in the direct base class
3336 loop above, which results in incorrect results; the
3337 correct offsets for virtual bases are only known when
3338 working with the most derived type. */
3342 {
3344 f,
3346 offset,
3348 offsets,
3349 max_offset,
3353 }
3354 else
3355 {
3356 /* We still have to walk the primary base, if it is
3357 virtual. (If it is non-virtual, then it was walked
3358 above.) */
3364 {
3365 r = (walk_subobject_offsets
3370 }
3371 }
3372 }
3374 /* Iterate through the fields of TYPE. */
3377 {
3378 tree field_offset;
3382 else
3383 /* In G++ 3.2, DECL_FIELD_OFFSET was used. */
3387 f,
3389 offset,
3390 field_offset),
3391 offsets,
3392 max_offset,
3396 }
3397 }
3399 {
3402 tree index;
3404 /* Avoid recursing into objects that are not interesting. */
3409 /* Step through each of the elements in the array. */
3411 /* G++ 3.2 had an off-by-one error here. */
3416 {
3418 f,
3419 offset,
3420 offsets,
3421 max_offset,
3427 /* If this new OFFSET is bigger than the MAX_OFFSET, then
3428 there's no point in iterating through the remaining
3429 elements of the array. */
3432 }
3433 }
3436 }
3438 /* Record all of the empty subobjects of TYPE (either a type or a
3439 binfo). If IS_DATA_MEMBER is true, then a non-static data member
3440 is being placed at OFFSET; otherwise, it is a base class that is
3441 being placed at OFFSET. */
3443 static void
3445 tree offset,
3446 splay_tree offsets,
3448 {
3449 tree max_offset;
3450 /* If recording subobjects for a non-static data member or a
3451 non-empty base class , we do not need to record offsets beyond
3452 the size of the biggest empty class. Additional data members
3453 will go at the end of the class. Additional base classes will go
3454 either at offset zero (if empty, in which case they cannot
3455 overlap with offsets past the size of the biggest empty class) or
3456 at the end of the class.
3458 However, if we are placing an empty base class, then we must record
3459 all offsets, as either the empty class is at offset zero (where
3460 other empty classes might later be placed) or at the end of the
3461 class (where other objects might then be placed, so other empty
3462 subobjects might later overlap). */
3466 else
3470 }
3472 /* Returns nonzero if any of the empty subobjects of TYPE (located at
3473 OFFSET) conflict with entries in OFFSETS. If VBASES_P is nonzero,
3474 virtual bases of TYPE are examined. */
3476 static int
3478 tree offset,
3479 splay_tree offsets,
3481 {
3482 splay_tree_node max_node;
3484 /* Get the node in OFFSETS that indicates the maximum offset where
3485 an empty subobject is located. */
3487 /* If there aren't any empty subobjects, then there's no point in
3488 performing this check. */
3494 vbases_p);
3495 }
3497 /* DECL is a FIELD_DECL corresponding either to a base subobject of a
3498 non-static data member of the type indicated by RLI. BINFO is the
3499 binfo corresponding to the base subobject, OFFSETS maps offsets to
3500 types already located at those offsets. This function determines
3501 the position of the DECL. */
3503 static void
3505 tree decl,
3506 tree binfo,
3507 splay_tree offsets)
3508 {
3511 tree type;
3514 {
3515 /* For the purposes of determining layout conflicts, we want to
3516 use the class type of BINFO; TREE_TYPE (DECL) will be the
3517 CLASSTYPE_AS_BASE version, which does not contain entries for
3518 zero-sized bases. */
3521 }
3522 else
3523 {
3526 }
3528 /* Try to place the field. It may take more than one try if we have
3529 a hard time placing the field without putting two objects of the
3530 same type at the same address. */
3532 {
3535 /* Place this field. */
3539 /* We have to check to see whether or not there is already
3540 something of the same type at the offset we're about to use.
3541 For example, consider:
3543 struct S {};
3544 struct T : public S { int i; };
3545 struct U : public S, public T {};
3547 Here, we put S at offset zero in U. Then, we can't put T at
3548 offset zero -- its S component would be at the same address
3549 as the S we already allocated. So, we have to skip ahead.
3550 Since all data members, including those whose type is an
3551 empty class, have nonzero size, any overlap can happen only
3552 with a direct or indirect base-class -- it can't happen with
3553 a data member. */
3554 /* In a union, overlap is permitted; all members are placed at
3555 offset zero. */
3558 /* G++ 3.2 did not check for overlaps when placing a non-empty
3559 virtual base. */
3564 {
3565 /* Strip off the size allocated to this field. That puts us
3566 at the first place we could have put the field with
3567 proper alignment. */
3570 /* Bump up by the alignment required for the type. */
3571 rli->bitpos
3577 }
3578 else
3579 /* There was no conflict. We're done laying out this field. */
3581 }
3583 /* Now that we know where it will be placed, update its
3584 BINFO_OFFSET. */
3586 /* Indirect virtual bases may have a nonzero BINFO_OFFSET at
3587 this point because their BINFO_OFFSET is copied from another
3588 hierarchy. Therefore, we may not need to add the entire
3589 OFFSET. */
3595 }
3597 /* Returns true if TYPE is empty and OFFSET is nonzero. */
3599 static int
3601 tree offset,
3602 splay_tree offsets ATTRIBUTE_UNUSED)
3603 {
3605 }
3607 /* Layout the empty base BINFO. EOC indicates the byte currently just
3608 past the end of the class, and should be correctly aligned for a
3609 class of the type indicated by BINFO; OFFSETS gives the offsets of
3610 the empty bases allocated so far. T is the most derived
3611 type. Return nonzero iff we added it at the end. */
3613 static bool
3616 {
3617 tree alignment;
3621 /* This routine should only be used for empty classes. */
3626 {
3628 propagate_binfo_offsets
3631 else
3633 "offset of empty base %qT may not be ABI-compliant and may"
3636 }
3638 /* This is an empty base class. We first try to put it at offset
3639 zero. */
3642 offsets,
3644 {
3645 /* That didn't work. Now, we move forward from the next
3646 available spot in the class. */
3650 {
3653 offsets,
3655 /* We finally found a spot where there's no overlap. */
3658 /* There's overlap here, too. Bump along to the next spot. */
3660 }
3661 }
3664 {
3669 }
3672 }
3674 /* Layout the base given by BINFO in the class indicated by RLI.
3675 *BASE_ALIGN is a running maximum of the alignments of
3676 any base class. OFFSETS gives the location of empty base
3677 subobjects. T is the most derived type. Return nonzero if the new
3678 object cannot be nearly-empty. A new FIELD_DECL is inserted at
3679 *NEXT_FIELD, unless BINFO is for an empty base class.
3681 Returns the location at which the next field should be inserted. */
3686 {
3691 /* This error is now reported in xref_tag, thus giving better
3692 location information. */
3695 /* Place the base class. */
3697 {
3698 tree decl;
3700 /* The containing class is non-empty because it has a non-empty
3701 base class. */
3704 /* Create the FIELD_DECL. */
3711 {
3719 /* Try to place the field. It may take more than one try if we
3720 have a hard time placing the field without putting two
3721 objects of the same type at the same address. */
3723 /* Add the new FIELD_DECL to the list of fields for T. */
3727 }
3728 }
3729 else
3730 {
3731 tree eoc;
3734 /* On some platforms (ARM), even empty classes will not be
3735 byte-aligned. */
3740 /* A nearly-empty class "has no proper base class that is empty,
3741 not morally virtual, and at an offset other than zero." */
3743 {
3746 /* The check above (used in G++ 3.2) is insufficient because
3747 an empty class placed at offset zero might itself have an
3748 empty base at a nonzero offset. */
3750 empty_base_at_nonzero_offset_p,
3751 size_zero_node,
3755 {
3758 else
3760 "class %qT will be considered nearly empty in a "
3762 }
3763 }
3765 /* We do not create a FIELD_DECL for empty base classes because
3766 it might overlap some other field. We want to be able to
3767 create CONSTRUCTORs for the class by iterating over the
3768 FIELD_DECLs, and the back end does not handle overlapping
3769 FIELD_DECLs. */
3771 /* An empty virtual base causes a class to be non-empty
3772 -- but in that case we do not need to clear CLASSTYPE_EMPTY_P
3773 here because that was already done when the virtual table
3774 pointer was created. */
3775 }
3777 /* Record the offsets of BINFO and its base subobjects. */
3780 offsets,
3784 }
3786 /* Layout all of the non-virtual base classes. Record empty
3787 subobjects in OFFSETS. T is the most derived type. Return nonzero
3788 if the type cannot be nearly empty. The fields created
3789 corresponding to the base classes will be inserted at
3790 *NEXT_FIELD. */
3792 static void
3795 {
3796 /* Chain to hold all the new FIELD_DECLs which stand in for base class
3797 subobjects. */
3802 /* The primary base class is always allocated first. */
3807 /* Now allocate the rest of the bases. */
3809 {
3810 tree base_binfo;
3814 /* The primary base was already allocated above, so we don't
3815 need to allocate it again here. */
3819 /* Virtual bases are added at the end (a primary virtual base
3820 will have already been added). */
3826 }
3827 }
3829 /* Go through the TYPE_METHODS of T issuing any appropriate
3830 diagnostics, figuring out which methods override which other
3831 methods, and so forth. */
3833 static void
3835 {
3836 tree x;
3839 {
3843 /* The name of the field is the original field name
3844 Save this in auxiliary field for later overloading. */
3846 {
3850 }
3851 /* All user-provided destructors are non-trivial. */
3854 }
3855 }
3857 /* FN is a constructor or destructor. Clone the declaration to create
3858 a specialized in-charge or not-in-charge version, as indicated by
3859 NAME. */
3861 static tree
3863 {
3864 tree parms;
3865 tree clone;
3867 /* Copy the function. */
3869 /* Reset the function name. */
3872 /* Remember where this function came from. */
3874 /* Make it easy to find the CLONE given the FN. */
3878 /* If this is a template, do the rest on the DECL_TEMPLATE_RESULT. */
3880 {
3887 }
3890 /* There's no pending inline data for this function. */
3894 /* The base-class destructor is not virtual. */
3896 {
3900 }
3902 /* If there was an in-charge parameter, drop it from the function
3903 type. */
3905 {
3906 tree basetype;
3907 tree parmtypes;
3908 tree exceptions;
3913 /* Skip the `this' parameter. */
3915 /* Skip the in-charge parameter. */
3917 /* And the VTT parm, in a complete [cd]tor. */
3921 /* If this is subobject constructor or destructor, add the vtt
3922 parameter. */
3926 parmtypes);
3929 exceptions);
3933 }
3935 /* Copy the function parameters. */
3937 /* Remove the in-charge parameter. */
3939 {
3943 }
3944 /* And the VTT parm, in a complete [cd]tor. */
3946 {
3949 else
3950 {
3954 }
3955 }
3958 {
3961 }
3963 /* Create the RTL for this function. */
3971 }
3973 /* Implementation of DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P, do
3974 not invoke this function directly.
3976 For a non-thunk function, returns the address of the slot for storing
3977 the function it is a clone of. Otherwise returns NULL_TREE.
3979 If JUST_TESTING, looks through TEMPLATE_DECL and returns NULL if
3980 cloned_function is unset. This is to support the separate
3981 DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P modes; using the latter
3982 on a template makes sense, but not the former. */
3984 tree *
3986 {
3994 {
3995 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3998 else
3999 #endif
4001 }
4006 else
4008 }
4010 /* Produce declarations for all appropriate clones of FN. If
4011 UPDATE_METHOD_VEC_P is nonzero, the clones are added to the
4012 CLASTYPE_METHOD_VEC as well. */
4014 void
4016 {
4017 tree clone;
4019 /* Avoid inappropriate cloning. */
4025 {
4026 /* For each constructor, we need two variants: an in-charge version
4027 and a not-in-charge version. */
4034 }
4035 else
4036 {
4039 /* For each destructor, we need three variants: an in-charge
4040 version, a not-in-charge version, and an in-charge deleting
4041 version. We clone the deleting version first because that
4042 means it will go second on the TYPE_METHODS list -- and that
4043 corresponds to the correct layout order in the virtual
4044 function table.
4046 For a non-virtual destructor, we do not build a deleting
4047 destructor. */
4049 {
4053 }
4060 }
4062 /* Note that this is an abstract function that is never emitted. */
4064 }
4066 /* DECL is an in charge constructor, which is being defined. This will
4067 have had an in class declaration, from whence clones were
4068 declared. An out-of-class definition can specify additional default
4069 arguments. As it is the clones that are involved in overload
4070 resolution, we must propagate the information from the DECL to its
4071 clones. */
4073 void
4075 {
4076 tree clone;
4080 {
4087 /* Skip the 'this' parameter. */
4103 {
4108 {
4109 /* A default parameter has been added. Adjust the
4110 clone's parameters. */
4114 tree type;
4119 {
4122 clone_parms);
4124 }
4127 clone_parms);
4136 }
4137 }
4139 }
4140 }
4142 /* For each of the constructors and destructors in T, create an
4143 in-charge and not-in-charge variant. */
4145 static void
4147 {
4148 tree fns;
4150 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
4151 out now. */
4159 }
4161 /* Returns true iff class T has a user-defined constructor other than
4162 the default constructor. */
4164 bool
4166 {
4167 tree fns;
4173 {
4180 }
4183 }
4185 /* Returns the defaulted constructor if T has one. Otherwise, returns
4186 NULL_TREE. */
4188 tree
4190 {
4197 {
4201 {
4207 }
4208 }
4211 }
4213 /* Returns true iff FN is a user-provided function, i.e. user-declared
4214 and not defaulted at its first declaration; or explicit, private,
4215 protected, or non-const. */
4217 bool
4219 {
4222 else
4225 }
4227 /* Returns true iff class T has a user-provided constructor. */
4229 bool
4231 {
4232 tree fns;
4240 /* This can happen in error cases; avoid crashing. */
4249 }
4251 /* Returns true iff class T has a user-provided default constructor. */
4253 bool
4255 {
4262 {
4266 {
4272 }
4273 }
4276 }
4278 /* Remove all zero-width bit-fields from T. */
4280 static void
4282 {
4287 {
4290 /* We should not be confused by the fact that grokbitfield
4291 temporarily sets the width of the bit field into
4292 DECL_INITIAL (*fieldsp).
4293 check_bitfield_decl eventually sets DECL_SIZE (*fieldsp)
4294 to that width. */
4297 else
4299 }
4300 }
4302 /* Returns TRUE iff we need a cookie when dynamically allocating an
4303 array whose elements have the indicated class TYPE. */
4305 static bool
4307 {
4308 tree fns;
4313 /* If there's a non-trivial destructor, we need a cookie. In order
4314 to iterate through the array calling the destructor for each
4315 element, we'll have to know how many elements there are. */
4319 /* If the usual deallocation function is a two-argument whose second
4320 argument is of type `size_t', then we have to pass the size of
4321 the array to the deallocation function, so we will need to store
4322 a cookie. */
4326 /* If there are no `operator []' members, or the lookup is
4327 ambiguous, then we don't need a cookie. */
4330 /* Loop through all of the functions. */
4332 {
4333 tree fn;
4334 tree second_parm;
4336 /* Select the current function. */
4338 /* See if this function is a one-argument delete function. If
4339 it is, then it will be the usual deallocation function. */
4343 /* Do not consider this function if its second argument is an
4344 ellipsis. */
4347 /* Otherwise, if we have a two-argument function and the second
4348 argument is `size_t', it will be the usual deallocation
4349 function -- unless there is one-argument function, too. */
4353 }
4356 }
4358 /* Check the validity of the bases and members declared in T. Add any
4359 implicitly-generated functions (like copy-constructors and
4360 assignment operators). Compute various flag bits (like
4361 CLASSTYPE_NON_LAYOUT_POD_T) for T. This routine works purely at the C++
4362 level: i.e., independently of the ABI in use. */
4364 static void
4366 {
4367 /* Nonzero if the implicitly generated copy constructor should take
4368 a non-const reference argument. */
4370 /* Nonzero if the implicitly generated assignment operator
4371 should take a non-const reference argument. */
4373 tree access_decls;
4376 tree fn;
4378 /* By default, we use const reference arguments and generate default
4379 constructors. */
4383 /* Check all the base-classes. */
4387 /* Check all the method declarations. */
4390 /* Save the initial values of these flags which only indicate whether
4391 or not the class has user-provided functions. As we analyze the
4392 bases and members we can set these flags for other reasons. */
4396 /* Check all the data member declarations. We cannot call
4397 check_field_decls until we have called check_bases check_methods,
4398 as check_field_decls depends on TYPE_HAS_NONTRIVIAL_DESTRUCTOR
4399 being set appropriately. */
4404 /* A nearly-empty class has to be vptr-containing; a nearly empty
4405 class contains just a vptr. */
4409 /* Do some bookkeeping that will guide the generation of implicitly
4410 declared member functions. */
4412 /* We need to call a constructor for this class if it has a
4413 user-provided constructor, or if the default constructor is going
4414 to initialize the vptr. (This is not an if-and-only-if;
4415 TYPE_NEEDS_CONSTRUCTING is set elsewhere if bases or members
4416 themselves need constructing.) */
4419 /* [dcl.init.aggr]
4421 An aggregate is an array or a class with no user-provided
4422 constructors ... and no virtual functions.
4424 Again, other conditions for being an aggregate are checked
4425 elsewhere. */
4428 /* This is the C++98/03 definition of POD; it changed in C++0x, but we
4429 retain the old definition internally for ABI reasons. */
4437 /* If the class has no user-declared constructor, but does have
4438 non-static const or reference data members that can never be
4439 initialized, issue a warning. */
4441 /* Classes with user-declared constructors are presumed to
4442 initialize these members. */
4444 /* Aggregates can be initialized with brace-enclosed
4445 initializers. */
4447 {
4448 tree field;
4451 {
4452 tree type;
4466 }
4467 }
4469 /* Synthesize any needed methods. */
4471 cant_have_const_ctor,
4472 no_const_asn_ref);
4474 /* Check defaulted declarations here so we have cant_have_const_ctor
4475 and don't need to worry about clones. */
4478 {
4481 {
4482 bool imp_const_p
4488 /* If the function is defaulted outside the class, we just
4489 give the synthesis error. */
4495 }
4497 }
4500 {
4501 /* "The closure type associated with a lambda-expression has a deleted
4502 default constructor and a deleted copy assignment operator." */
4509 /* "This class type is not an aggregate." */
4511 }
4513 /* Create the in-charge and not-in-charge variants of constructors
4514 and destructors. */
4517 /* Process the using-declarations. */
4521 /* Build and sort the CLASSTYPE_METHOD_VEC. */
4524 /* Figure out whether or not we will need a cookie when dynamically
4525 allocating an array of this type. */
4528 }
4530 /* If T needs a pointer to its virtual function table, set TYPE_VFIELD
4531 accordingly. If a new vfield was created (because T doesn't have a
4532 primary base class), then the newly created field is returned. It
4533 is not added to the TYPE_FIELDS list; it is the caller's
4534 responsibility to do that. Accumulate declared virtual functions
4535 on VIRTUALS_P. */
4537 static tree
4539 {
4540 tree fn;
4542 /* Collect the virtual functions declared in T. */
4546 {
4555 }
4557 /* If we couldn't find an appropriate base class, create a new field
4558 here. Even if there weren't any new virtual functions, we might need a
4559 new virtual function table if we're supposed to include vptrs in
4560 all classes that need them. */
4562 {
4563 /* We build this decl with vtbl_ptr_type_node, which is a
4564 `vtable_entry_type*'. It might seem more precise to use
4565 `vtable_entry_type (*)[N]' where N is the number of virtual
4566 functions. However, that would require the vtable pointer in
4567 base classes to have a different type than the vtable pointer
4568 in derived classes. We could make that happen, but that
4569 still wouldn't solve all the problems. In particular, the
4570 type-based alias analysis code would decide that assignments
4571 to the base class vtable pointer can't alias assignments to
4572 the derived class vtable pointer, since they have different
4573 types. Thus, in a derived class destructor, where the base
4574 class constructor was inlined, we could generate bad code for
4575 setting up the vtable pointer.
4577 Therefore, we use one type for all vtable pointers. We still
4578 use a type-correct type; it's just doesn't indicate the array
4579 bounds. That's better than using `void*' or some such; it's
4580 cleaner, and it let's the alias analysis code know that these
4581 stores cannot alias stores to void*! */
4582 tree field;
4595 /* This class is non-empty. */
4599 }
4602 }
4604 /* Add OFFSET to all base types of BINFO which is a base in the
4605 hierarchy dominated by T.
4607 OFFSET, which is a type offset, is number of bytes. */
4609 static void
4611 {
4613 tree primary_binfo;
4614 tree base_binfo;
4616 /* Update BINFO's offset. */
4621 offset));
4623 /* Find the primary base class. */
4629 /* Scan all of the bases, pushing the BINFO_OFFSET adjust
4630 downwards. */
4632 {
4633 /* Don't do the primary base twice. */
4641 }
4642 }
4644 /* Set BINFO_OFFSET for all of the virtual bases for RLI->T. Update
4645 TYPE_ALIGN and TYPE_SIZE for T. OFFSETS gives the location of
4646 empty subobjects of T. */
4648 static void
4650 {
4651 tree vbase;
4660 {
4661 /* In G++ 3.2, we incorrectly rounded the size before laying out
4662 the virtual bases. */
4664 #ifdef STRUCTURE_SIZE_BOUNDARY
4665 /* Packed structures don't need to have minimum size. */
4668 #endif
4672 }
4674 /* Find the last field. The artificial fields created for virtual
4675 bases will go after the last extant field to date. */
4680 /* Go through the virtual bases, allocating space for each virtual
4681 base that is not already a primary base class. These are
4682 allocated in inheritance graph order. */
4684 {
4689 {
4692 /* This virtual base is not a primary base of any class in the
4693 hierarchy, so we have to add space for it. */
4697 /* If the first virtual base might have been placed at a
4698 lower address, had we started from CLASSTYPE_SIZE, rather
4699 than TYPE_SIZE, issue a warning. There can be both false
4700 positives and false negatives from this warning in rare
4701 cases; to deal with all the possibilities would probably
4702 require performing both layout algorithms and comparing
4703 the results which is not particularly tractable. */
4705 && first_vbase
4706 && (tree_int_cst_lt
4711 bitsize_unit_node),
4714 "offset of virtual base %qT is not ABI-compliant and "
4716 basetype);
4719 }
4720 }
4721 }
4723 /* Returns the offset of the byte just past the end of the base class
4724 BINFO. */
4726 static tree
4728 {
4729 tree size;
4734 /* An empty class has zero CLASSTYPE_SIZE_UNIT, but we need to
4735 allocate some space for it. It cannot have virtual bases, so
4736 TYPE_SIZE_UNIT is fine. */
4738 else
4742 }
4744 /* Returns the offset of the byte just past the end of the base class
4745 with the highest offset in T. If INCLUDE_VIRTUALS_P is zero, then
4746 only non-virtual bases are included. */
4748 static tree
4750 {
4753 tree binfo;
4754 tree base_binfo;
4755 tree offset;
4760 {
4770 }
4772 /* G++ 3.2 did not check indirect virtual bases. */
4776 {
4780 }
4783 }
4785 /* Warn about bases of T that are inaccessible because they are
4786 ambiguous. For example:
4788 struct S {};
4789 struct T : public S {};
4790 struct U : public S, public T {};
4792 Here, `(S*) new U' is not allowed because there are two `S'
4793 subobjects of U. */
4795 static void
4797 {
4800 tree basetype;
4801 tree binfo;
4802 tree base_binfo;
4804 /* If there are no repeated bases, nothing can be ambiguous. */
4808 /* Check direct bases. */
4811 {
4817 }
4819 /* Check for ambiguous virtual bases. */
4823 {
4829 }
4830 }
4832 /* Compare two INTEGER_CSTs K1 and K2. */
4834 static int
4836 {
4838 }
4840 /* Increase the size indicated in RLI to account for empty classes
4841 that are "off the end" of the class. */
4843 static void
4845 {
4846 tree eoc;
4847 tree rli_size;
4849 /* It might be the case that we grew the class to allocate a
4850 zero-sized base class. That won't be reflected in RLI, yet,
4851 because we are willing to overlay multiple bases at the same
4852 offset. However, now we need to make sure that RLI is big enough
4853 to reflect the entire class. */
4859 {
4861 /* In version 1 of the ABI, the size of a class that ends with
4862 a bitfield was not rounded up to a whole multiple of a
4863 byte. Because rli_size_unit_so_far returns only the number
4864 of fully allocated bytes, any extra bits were not included
4865 in the size. */
4867 else
4868 /* The size should have been rounded to a whole byte. */
4871 rli->bitpos
4880 }
4881 }
4883 /* Calculate the TYPE_SIZE, TYPE_ALIGN, etc for T. Calculate
4884 BINFO_OFFSETs for all of the base-classes. Position the vtable
4885 pointer. Accumulate declared virtual functions on VIRTUALS_P. */
4887 static void
4889 {
4890 tree non_static_data_members;
4891 tree field;
4892 tree vptr;
4893 record_layout_info rli;
4894 /* Maps offsets (represented as INTEGER_CSTs) to a TREE_LIST of
4895 types that appear at that offset. */
4896 splay_tree empty_base_offsets;
4897 /* True if the last field layed out was a bit-field. */
4899 /* The location at which the next field should be inserted. */
4901 /* T, as a base class. */
4902 tree base_t;
4904 /* Keep track of the first non-static data member. */
4907 /* Start laying out the record. */
4910 /* Mark all the primary bases in the hierarchy. */
4913 /* Create a pointer to our virtual function table. */
4916 /* The vptr is always the first thing in the class. */
4918 {
4923 }
4924 else
4927 /* Build FIELD_DECLs for all of the non-virtual base-types. */
4932 /* Layout the non-static data members. */
4934 {
4935 tree type;
4936 tree padding;
4938 /* We still pass things that aren't non-static data members to
4939 the back end, in case it wants to do something with them. */
4941 {
4943 /* If the static data member has incomplete type, keep track
4944 of it so that it can be completed later. (The handling
4945 of pending statics in finish_record_layout is
4946 insufficient; consider:
4948 struct S1;
4949 struct S2 { static S1 s1; };
4951 At this point, finish_record_layout will be called, but
4952 S1 is still incomplete.) */
4954 {
4956 /* The visibility of static data members is determined
4957 at their point of declaration, not their point of
4958 definition. */
4960 }
4962 }
4970 /* If this field is a bit-field whose width is greater than its
4971 type, then there are some special rules for allocating
4972 it. */
4975 {
4977 tree integer_type;
4979 /* We must allocate the bits as if suitably aligned for the
4980 longest integer type that fits in this many bits. type
4981 of the field. Then, we are supposed to use the left over
4982 bits as additional padding. */
4988 /* ITK now indicates a type that is too large for the
4989 field. We have to back up by one to find the largest
4990 type that fits. */
4993 /* Figure out how much additional padding is required. GCC
4994 3.2 always created a padding field, even if it had zero
4995 width. */
4998 {
5000 /* In a union, the padding field must have the full width
5001 of the bit-field; all fields start at offset zero. */
5003 else
5004 {
5007 "ABI-compliant and may change in a future "
5009 t);
5012 }
5013 }
5014 #ifdef PCC_BITFIELD_TYPE_MATTERS
5015 /* An unnamed bitfield does not normally affect the
5016 alignment of the containing class on a target where
5017 PCC_BITFIELD_TYPE_MATTERS. But, the C++ ABI does not
5018 make any exceptions for unnamed bitfields when the
5019 bitfields are longer than their types. Therefore, we
5020 temporarily give the field a name. */
5022 {
5025 }
5026 #endif
5031 empty_base_offsets);
5034 /* Now that layout has been performed, set the size of the
5035 field to the size of its declared type; the rest of the
5036 field is effectively invisible. */
5038 /* We must also reset the DECL_MODE of the field. */
5043 /* Versions of G++ before G++ 3.4 did not reset the
5044 DECL_MODE. */
5046 "the offset of %qD may not be ABI-compliant and may "
5048 }
5049 else
5051 empty_base_offsets);
5053 /* Remember the location of any empty classes in FIELD. */
5057 empty_base_offsets,
5060 /* If a bit-field does not immediately follow another bit-field,
5061 and yet it starts in the middle of a byte, we have failed to
5062 comply with the ABI. */
5065 /* The TREE_NO_WARNING flag gets set by Objective-C when
5066 laying out an Objective-C class. The ObjC ABI differs
5067 from the C++ ABI, and so we do not want a warning
5068 here. */
5070 && !last_field_was_bitfield
5073 bitsize_unit_node)))
5077 /* G++ used to use DECL_FIELD_OFFSET as if it were the byte
5078 offset of the field. */
5085 "classes to be placed at different locations in a "
5088 /* The middle end uses the type of expressions to determine the
5089 possible range of expression values. In order to optimize
5090 "x.i > 7" to "false" for a 2-bit bitfield "i", the middle end
5091 must be made aware of the width of "i", via its type.
5093 Because C++ does not have integer types of arbitrary width,
5094 we must (for the purposes of the front end) convert from the
5095 type assigned here to the declared type of the bitfield
5096 whenever a bitfield expression is used as an rvalue.
5097 Similarly, when assigning a value to a bitfield, the value
5098 must be converted to the type given the bitfield here. */
5100 {
5105 {
5112 }
5113 }
5115 /* If we needed additional padding after this field, add it
5116 now. */
5118 {
5119 tree padding_field;
5122 FIELD_DECL,
5123 NULL_TREE,
5124 char_type_node);
5131 NULL_TREE,
5132 empty_base_offsets);
5133 }
5136 }
5139 {
5140 /* Make sure that we are on a byte boundary so that the size of
5141 the class without virtual bases will always be a round number
5142 of bytes. */
5145 }
5147 /* G++ 3.2 does not allow virtual bases to be overlaid with tail
5148 padding. */
5152 /* Delete all zero-width bit-fields from the list of fields. Now
5153 that the type is laid out they are no longer important. */
5156 /* Create the version of T used for virtual bases. We do not use
5157 make_class_type for this version; this is an artificial type. For
5158 a POD type, we just reuse T. */
5160 {
5163 /* Set the size and alignment for the new type. In G++ 3.2, all
5164 empty classes were considered to have size zero when used as
5165 base classes. */
5167 {
5172 "layout of classes derived from empty class %qT "
5174 t);
5175 }
5176 else
5177 {
5178 tree eoc;
5180 /* If the ABI version is not at least two, and the last
5181 field was a bit-field, RLI may not be on a byte
5182 boundary. In particular, rli_size_unit_so_far might
5183 indicate the last complete byte, while rli_size_so_far
5184 indicates the total number of bits used. Therefore,
5185 rli_size_so_far, rather than rli_size_unit_so_far, is
5186 used to compute TYPE_SIZE_UNIT. */
5194 eoc);
5201 }
5205 /* Copy the fields from T. */
5209 {
5211 FIELD_DECL,
5221 }
5223 /* Record the base version of the type. */
5226 }
5227 else
5230 /* Every empty class contains an empty class. */
5234 /* Set the TYPE_DECL for this type to contain the right
5235 value for DECL_OFFSET, so that we can use it as part
5236 of a COMPONENT_REF for multiple inheritance. */
5239 /* Now fix up any virtual base class types that we left lying
5240 around. We must get these done before we try to lay out the
5241 virtual function table. As a side-effect, this will remove the
5242 base subobject fields. */
5245 /* Make sure that empty classes are reflected in RLI at this
5246 point. */
5249 /* Make sure not to create any structures with zero size. */
5255 /* If this is a non-POD, declaring it packed makes a difference to how it
5256 can be used as a field; don't let finalize_record_size undo it. */
5260 /* Let the back end lay out the type. */
5263 /* Warn about bases that can't be talked about due to ambiguity. */
5266 /* Now that we're done with layout, give the base fields the real types. */
5271 /* Clean up. */
5278 }
5280 /* Determine the "key method" for the class type indicated by TYPE,
5281 and set CLASSTYPE_KEY_METHOD accordingly. */
5283 void
5285 {
5286 tree method;
5289 || processing_template_decl
5294 /* The key method is the first non-pure virtual function that is not
5295 inline at the point of class definition. On some targets the
5296 key function may not be inline; those targets should not call
5297 this function until the end of the translation unit. */
5303 {
5306 }
5309 }
5311 /* Perform processing required when the definition of T (a class type)
5312 is complete. */
5314 void
5316 {
5317 tree x;
5318 /* A TREE_LIST. The TREE_VALUE of each node is a FUNCTION_DECL. */
5323 {
5328 }
5330 /* If this type was previously laid out as a forward reference,
5331 make sure we lay it out again. */
5335 /* Make assumptions about the class; we'll reset the flags if
5336 necessary. */
5341 /* Do end-of-class semantic processing: checking the validity of the
5342 bases and members and add implicitly generated methods. */
5345 /* Find the key method. */
5347 {
5348 /* The Itanium C++ ABI permits the key method to be chosen when
5349 the class is defined -- even though the key method so
5350 selected may later turn out to be an inline function. On
5351 some systems (such as ARM Symbian OS) the key method cannot
5352 be determined until the end of the translation unit. On such
5353 systems, we leave CLASSTYPE_KEY_METHOD set to NULL, which
5354 will cause the class to be added to KEYED_CLASSES. Then, in
5355 finish_file we will determine the key method. */
5359 /* If a polymorphic class has no key method, we may emit the vtable
5360 in every translation unit where the class definition appears. */
5363 }
5365 /* Layout the class itself. */
5368 /* We use the base type for trivial assignments, and hence it
5369 needs a mode. */
5374 /* If necessary, create the primary vtable for this class. */
5376 {
5377 /* We must enter these virtuals into the table. */
5381 /* Here we know enough to change the type of our virtual
5382 function table, but we will wait until later this function. */
5384 }
5387 {
5389 tree fn;
5396 /* Add entries for virtual functions introduced by this class. */
5400 /* Set DECL_VINDEX for all functions declared in this class. */
5402 fn;
5404 vindex += (TARGET_VTABLE_USES_DESCRIPTORS
5406 {
5410 /* A thunk. We should never be calling this entry directly
5411 from this vtable -- we'd use the entry for the non
5412 thunk base function. */
5416 }
5417 }
5421 /* Complete the rtl for any static member objects of the type we're
5422 working on. */
5429 /* Done with FIELDS...now decide whether to sort these for
5430 faster lookups later.
5432 We use a small number because most searches fail (succeeding
5433 ultimately as the search bores through the inheritance
5434 hierarchy), and we want this failure to occur quickly. */
5438 {
5445 field_decl_cmp);
5447 }
5449 /* Complain if one of the field types requires lower visibility. */
5452 /* Make the rtl for any new vtables we have created, and unmark
5453 the base types we marked. */
5456 /* Build the VTT for T. */
5459 /* This warning does not make sense for Java classes, since they
5460 cannot have destructors. */
5462 {
5463 tree dtor;
5467 if it were virtual, we would have created it by now. */
5468 !dtor
5477 "%q#T has virtual functions and accessible"
5479 }
5486 /* Class layout, assignment of virtual table slots, etc., is now
5487 complete. Give the back end a chance to tweak the visibility of
5488 the class or perform any other required target modifications. */
5495 /* Finish debugging output for this type. */
5497 }
5499 /* When T was built up, the member declarations were added in reverse
5500 order. Rearrange them to declaration order. */
5502 void
5504 {
5505 tree next;
5506 tree prev;
5507 tree x;
5509 /* The following lists are all in reverse order. Put them in
5510 declaration order now. */
5514 /* Actually, for the TYPE_FIELDS, only the non TYPE_DECLs are in
5515 reverse order, so we can't just use nreverse. */
5520 {
5524 }
5526 {
5530 }
5531 }
5533 tree
5535 {
5538 /* Now that we've got all the field declarations, reverse everything
5539 as necessary. */
5544 /* Nadger the current location so that diagnostics point to the start of
5545 the struct, not the end. */
5549 {
5550 tree x;
5556 /* We need to emit an error message if this type was used as a parameter
5557 and it is an abstract type, even if it is a template. We construct
5558 a simple CLASSTYPE_PURE_VIRTUALS list without taking bases into
5559 account and we call complete_vars with this type, which will check
5560 the PARM_DECLS. Note that while the type is being defined,
5561 CLASSTYPE_PURE_VIRTUALS contains the list of the inline friends
5562 (see CLASSTYPE_INLINE_FRIENDS) so we need to clear it. */
5569 /* Remember current #pragma pack value. */
5571 }
5572 else
5581 else
5588 }
5589 \f
5590 /* Return the dynamic type of INSTANCE, if known.
5591 Used to determine whether the virtual function table is needed
5592 or not.
5594 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
5595 of our knowledge of its type. *NONNULL should be initialized
5596 before this function is called. */
5598 static tree
5600 {
5601 #define RECUR(T) fixed_type_or_null((T), nonnull, cdtorp)
5604 {
5608 else
5612 /* This is a call to a constructor, hence it's never zero. */
5614 {
5618 }
5622 /* This is a call to a constructor, hence it's never zero. */
5624 {
5628 }
5637 /* Propagate nonnull. */
5642 CASE_CONVERT:
5648 {
5649 /* Just because we see an ADDR_EXPR doesn't mean we're dealing
5650 with a real object -- given &p->f, p can still be null. */
5652 /* ??? Probably should check DECL_WEAK here. */
5655 }
5659 /* If this component is really a base class reference, then the field
5660 itself isn't definitive. */
5669 {
5673 }
5674 /* fall through... */
5679 {
5683 }
5685 {
5689 /* if we're in a ctor or dtor, we know our type. */
5693 {
5697 }
5698 }
5700 {
5701 /* We only need one hash table because it is always left empty. */
5705 htab_hash_pointer,
5706 htab_eq_pointer,
5709 /* Reference variables should be references to objects. */
5713 /* Enter the INSTANCE in a table to prevent recursion; a
5714 variable's initializer may refer to the variable
5715 itself. */
5719 {
5720 tree type;
5729 }
5730 }
5735 }
5736 #undef RECUR
5737 }
5739 /* Return nonzero if the dynamic type of INSTANCE is known, and
5740 equivalent to the static type. We also handle the case where
5741 INSTANCE is really a pointer. Return negative if this is a
5742 ctor/dtor. There the dynamic type is known, but this might not be
5743 the most derived base of the original object, and hence virtual
5744 bases may not be layed out according to this type.
5746 Used to determine whether the virtual function table is needed
5747 or not.
5749 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
5750 of our knowledge of its type. *NONNULL should be initialized
5751 before this function is called. */
5753 int
5755 {
5766 }
5768 \f
5769 void
5771 {
5774 current_class_stack
5782 }
5784 /* Restore the cached PREVIOUS_CLASS_LEVEL. */
5786 static void
5788 {
5789 tree type;
5791 /* We are re-entering the same class we just left, so we don't
5792 have to search the whole inheritance matrix to find all the
5793 decls to bind again. Instead, we install the cached
5794 class_shadowed list and walk through it binding names. */
5797 /* Restore IDENTIFIER_TYPE_VALUE. */
5799 type;
5802 }
5804 /* Set global variables CURRENT_CLASS_NAME and CURRENT_CLASS_TYPE as
5805 appropriate for TYPE.
5807 So that we may avoid calls to lookup_name, we cache the _TYPE
5808 nodes of local TYPE_DECLs in the TREE_TYPE field of the name.
5810 For multiple inheritance, we perform a two-pass depth-first search
5811 of the type lattice. */
5813 void
5815 {
5816 class_stack_node_t csn;
5820 /* Make sure there is enough room for the new entry on the stack. */
5822 {
5824 current_class_stack
5826 current_class_stack_size);
5827 }
5829 /* Insert a new entry on the class stack. */
5836 current_class_depth++;
5838 /* Now set up the new type. */
5844 /* By default, things in classes are private, while things in
5845 structures or unions are public. */
5847 ? access_private_node
5853 {
5854 /* Forcibly remove any old class remnants. */
5856 }
5862 else
5864 }
5866 /* When we exit a toplevel class scope, we save its binding level so
5867 that we can restore it quickly. Here, we've entered some other
5868 class, so we must invalidate our cache. */
5870 void
5872 {
5874 }
5876 /* Get out of the current class scope. If we were in a class scope
5877 previously, that is the one popped to. */
5879 void
5881 {
5884 current_class_depth--;
5890 }
5892 /* Mark the top of the class stack as hidden. */
5894 void
5896 {
5899 }
5901 /* Mark the top of the class stack as un-hidden. */
5903 void
5905 {
5908 }
5910 /* Returns 1 if the class type currently being defined is either T or
5911 a nested type of T. */
5913 bool
5915 {
5923 /* We start looking from 1 because entry 0 is from global scope,
5924 and has no type. */
5926 {
5927 tree c;
5930 else
5931 {
5935 }
5940 }
5942 }
5944 /* If either current_class_type or one of its enclosing classes are derived
5945 from T, return the appropriate type. Used to determine how we found
5946 something via unqualified lookup. */
5948 tree
5950 {
5953 /* The bases of a dependent type are unknown. */
5964 {
5969 }
5972 }
5974 /* When entering a class scope, all enclosing class scopes' names with
5975 static meaning (static variables, static functions, types and
5976 enumerators) have to be visible. This recursive function calls
5977 pushclass for all enclosing class contexts until global or a local
5978 scope is reached. TYPE is the enclosed class. */
5980 void
5982 {
5983 /* A namespace might be passed in error cases, like A::B:C. */
5991 }
5993 /* Undoes a push_nested_class call. */
5995 void
5997 {
6003 }
6005 /* Returns the number of extern "LANG" blocks we are nested within. */
6007 int
6009 {
6011 }
6013 /* Set global variables CURRENT_LANG_NAME to appropriate value
6014 so that behavior of name-mangling machinery is correct. */
6016 void
6018 {
6022 {
6024 }
6026 {
6028 /* DECL_IGNORED_P is initially set for these types, to avoid clutter.
6029 (See record_builtin_java_type in decl.c.) However, that causes
6030 incorrect debug entries if these types are actually used.
6031 So we re-enable debug output after extern "Java". */
6040 }
6042 {
6044 }
6045 else
6047 }
6049 /* Get out of the current language scope. */
6051 void
6053 {
6055 }
6056 \f
6057 /* Type instantiation routines. */
6059 /* Given an OVERLOAD and a TARGET_TYPE, return the function that
6060 matches the TARGET_TYPE. If there is no satisfactory match, return
6061 error_mark_node, and issue an error & warning messages under
6062 control of FLAGS. Permit pointers to member function if FLAGS
6063 permits. If TEMPLATE_ONLY, the name of the overloaded function was
6064 a template-id, and EXPLICIT_TARGS are the explicitly provided
6065 template arguments.
6067 If OVERLOAD is for one or more member functions, then ACCESS_PATH
6068 is the base path used to reference those member functions. If
6069 TF_NO_ACCESS_CONTROL is not set in FLAGS, and the address is
6070 resolved to a member function, access checks will be performed and
6071 errors issued if appropriate. */
6073 static tree
6075 tree overload,
6076 tsubst_flags_t flags,
6078 tree explicit_targs,
6079 tree access_path)
6080 {
6081 /* Here's what the standard says:
6083 [over.over]
6085 If the name is a function template, template argument deduction
6086 is done, and if the argument deduction succeeds, the deduced
6087 arguments are used to generate a single template function, which
6088 is added to the set of overloaded functions considered.
6090 Non-member functions and static member functions match targets of
6091 type "pointer-to-function" or "reference-to-function." Nonstatic
6092 member functions match targets of type "pointer-to-member
6093 function;" the function type of the pointer to member is used to
6094 select the member function from the set of overloaded member
6095 functions. If a nonstatic member function is selected, the
6096 reference to the overloaded function name is required to have the
6097 form of a pointer to member as described in 5.3.1.
6099 If more than one function is selected, any template functions in
6100 the set are eliminated if the set also contains a non-template
6101 function, and any given template function is eliminated if the
6102 set contains a second template function that is more specialized
6103 than the first according to the partial ordering rules 14.5.5.2.
6104 After such eliminations, if any, there shall remain exactly one
6105 selected function. */
6108 /* We store the matches in a TREE_LIST rooted here. The functions
6109 are the TREE_PURPOSE, not the TREE_VALUE, in this list, for easy
6110 interoperability with most_specialized_instantiation. */
6112 tree fn;
6113 tree target_fn_type;
6115 /* By the time we get here, we should be seeing only real
6116 pointer-to-member types, not the internal POINTER_TYPE to
6117 METHOD_TYPE representation. */
6123 /* Check that the TARGET_TYPE is reasonable. */
6127 /* This is OK, too. */
6130 /* This is OK, too. This comes from a conversion to reference
6131 type. */
6133 else
6134 {
6140 }
6142 /* Non-member functions and static member functions match targets of type
6143 "pointer-to-function" or "reference-to-function." Nonstatic member
6144 functions match targets of type "pointer-to-member-function;" the
6145 function type of the pointer to member is used to select the member
6146 function from the set of overloaded member functions.
6148 So figure out the FUNCTION_TYPE that we want to match against. */
6151 /* If we can find a non-template function that matches, we can just
6152 use it. There's no point in generating template instantiations
6153 if we're just going to throw them out anyhow. But, of course, we
6154 can only do this when we don't *need* a template function. */
6156 {
6157 tree fns;
6160 {
6164 /* We're not looking for templates just yet. */
6169 /* We're looking for a non-static member, and this isn't
6170 one, or vice versa. */
6173 /* Ignore functions which haven't been explicitly
6174 declared. */
6178 /* See if there's a match. */
6181 }
6182 }
6184 /* Now, if we've already got a match (or matches), there's no need
6185 to proceed to the template functions. But, if we don't have a
6186 match we need to look at them, too. */
6188 {
6189 tree target_arg_types;
6190 tree target_ret_type;
6191 tree fns;
6194 tree arg;
6208 {
6210 tree instantiation;
6211 tree targs;
6214 /* We're only looking for templates. */
6219 /* We're not looking for a non-static member, and this is
6220 one, or vice versa. */
6223 /* Try to do argument deduction. */
6227 LOOKUP_NORMAL))
6228 /* Argument deduction failed. */
6231 /* Instantiate the template. */
6234 /* Instantiation failed. */
6237 /* See if there's a match. */
6240 }
6242 /* Now, remove all but the most specialized of the matches. */
6244 {
6249 NULL_TREE,
6250 NULL_TREE);
6251 }
6252 }
6254 /* Now we should have exactly one function in MATCHES. */
6256 {
6257 /* There were *no* matches. */
6259 {
6262 target_type);
6264 /* print_candidates expects a chain with the functions in
6265 TREE_VALUE slots, so we cons one up here (we're losing anyway,
6266 so why be clever?). */
6269 matches);
6272 }
6274 }
6276 {
6277 /* There were too many matches. First check if they're all
6278 the same function. */
6279 tree match;
6287 {
6289 {
6292 target_type);
6294 /* Since print_candidates expects the functions in the
6295 TREE_VALUE slot, we flip them here. */
6300 }
6303 }
6304 }
6306 /* Good, exactly one match. Now, convert it to the correct type. */
6311 {
6319 {
6322 }
6323 }
6325 /* If we're doing overload resolution purely for the purpose of
6326 determining conversion sequences, we should not consider the
6327 function used. If this conversion sequence is selected, the
6328 function will be marked as used at this point. */
6330 {
6331 /* Make =delete work with SFINAE. */
6336 }
6338 /* We could not check access to member functions when this
6339 expression was originally created since we did not know at that
6340 time to which function the expression referred. */
6343 {
6346 }
6350 else
6351 {
6352 /* The target must be a REFERENCE_TYPE. Above, cp_build_unary_op
6353 will mark the function as addressed, but here we must do it
6354 explicitly. */
6358 }
6359 }
6361 /* This function will instantiate the type of the expression given in
6362 RHS to match the type of LHSTYPE. If errors exist, then return
6363 error_mark_node. FLAGS is a bit mask. If TF_ERROR is set, then
6364 we complain on errors. If we are not complaining, never modify rhs,
6365 as overload resolution wants to try many possible instantiations, in
6366 the hope that at least one will work.
6368 For non-recursive calls, LHSTYPE should be a function, pointer to
6369 function, or a pointer to member function. */
6371 tree
6373 {
6380 {
6384 }
6387 {
6393 /* Microsoft allows `A::f' to be resolved to a
6394 pointer-to-member. */
6395 ;
6396 else
6397 {
6402 }
6403 }
6406 {
6409 }
6411 /* If we are in a template, and have a NON_DEPENDENT_EXPR, we cannot
6412 deduce any type information. */
6414 {
6418 }
6420 /* There only a few kinds of expressions that may have a type
6421 dependent on overload resolution. */
6427 /* This should really only be used when attempting to distinguish
6428 what sort of a pointer to function we have. For now, any
6429 arithmetic operation which is not supported on pointers
6430 is rejected as an error. */
6433 {
6435 {
6441 /* Do not lose object's side effects. */
6445 }
6452 /* This can happen if we are forming a pointer-to-member for a
6453 member template. */
6456 /* Fall through. */
6459 {
6463 return
6467 }
6471 return
6475 access_path);
6478 {
6483 }
6490 }
6492 }
6493 \f
6494 /* Return the name of the virtual function pointer field
6495 (as an IDENTIFIER_NODE) for the given TYPE. Note that
6496 this may have to look back through base types to find the
6497 ultimate field name. (For single inheritance, these could
6498 all be the same name. Who knows for multiple inheritance). */
6500 static tree
6502 {
6509 {
6515 }
6523 }
6525 void
6527 {
6528 #ifdef GATHER_STATISTICS
6532 {
6537 }
6538 #endif
6539 }
6541 /* Build a dummy reference to ourselves so Derived::Base (and A::A) works,
6542 according to [class]:
6543 The class-name is also inserted
6544 into the scope of the class itself. For purposes of access checking,
6545 the inserted class name is treated as if it were a public member name. */
6547 void
6549 {
6552 tree saved_cas;
6567 }
6569 /* Returns 1 if TYPE contains only padding bytes. */
6571 int
6573 {
6580 /* In G++ 3.2, whether or not a class was empty was determined by
6581 looking at its size. */
6584 else
6586 }
6588 /* Returns true if TYPE contains an empty class. */
6590 static bool
6592 {
6596 {
6597 tree field;
6598 tree binfo;
6599 tree base_binfo;
6611 }
6615 }
6617 /* Returns true if TYPE contains no actual data, just various
6618 possible combinations of empty classes. */
6620 bool
6622 {
6626 {
6627 tree field;
6628 tree binfo;
6629 tree base_binfo;
6642 }
6646 }
6648 /* Note that NAME was looked up while the current class was being
6649 defined and that the result of that lookup was DECL. */
6651 void
6653 {
6654 splay_tree names_used;
6656 /* If we're not defining a class, there's nothing to do. */
6662 /* If there's already a binding for this NAME, then we don't have
6663 anything to worry about. */
6676 }
6678 /* Note that NAME was declared (as DECL) in the current class. Check
6679 to see that the declaration is valid. */
6681 void
6683 {
6684 splay_tree names_used;
6685 splay_tree_node n;
6687 /* Look to see if we ever used this name. */
6688 names_used
6695 {
6696 /* [basic.scope.class]
6698 A name N used in a class S shall refer to the same declaration
6699 in its context and when re-evaluated in the completed scope of
6700 S. */
6704 }
6705 }
6707 /* Returns the VAR_DECL for the complete vtable associated with BINFO.
6708 Secondary vtables are merged with primary vtables; this function
6709 will return the VAR_DECL for the primary vtable. */
6711 tree
6713 {
6714 tree decl;
6718 {
6721 }
6725 }
6728 /* Returns the binfo for the primary base of BINFO. If the resulting
6729 BINFO is a virtual base, and it is inherited elsewhere in the
6730 hierarchy, then the returned binfo might not be the primary base of
6731 BINFO in the complete object. Check BINFO_PRIMARY_P or
6732 BINFO_LOST_PRIMARY_P to be sure. */
6734 static tree
6736 {
6737 tree primary_base;
6744 }
6746 /* If INDENTED_P is zero, indent to INDENT. Return nonzero. */
6748 static int
6750 {
6754 }
6756 /* Dump the offsets of all the bases rooted at BINFO to STREAM.
6757 INDENT should be zero when called from the top level; it is
6758 incremented recursively. IGO indicates the next expected BINFO in
6759 inheritance graph ordering. */
6761 static tree
6764 tree binfo,
6765 tree igo,
6767 {
6769 tree base_binfo;
6777 {
6780 }
6795 {
6799 TFF_PLAIN_IDENTIFIER),
6801 }
6803 {
6806 }
6811 {
6815 {
6819 TFF_PLAIN_IDENTIFIER));
6820 }
6822 {
6826 TFF_PLAIN_IDENTIFIER));
6827 }
6829 {
6833 TFF_PLAIN_IDENTIFIER));
6834 }
6836 {
6840 TFF_PLAIN_IDENTIFIER));
6841 }
6845 }
6851 }
6853 /* Dump the BINFO hierarchy for T. */
6855 static void
6857 {
6869 }
6871 /* Debug interface to hierarchy dumping. */
6873 void
6875 {
6877 }
6879 static void
6881 {
6886 {
6889 }
6890 }
6892 static void
6894 {
6895 tree value;
6897 HOST_WIDE_INT elt;
6905 TFF_PLAIN_IDENTIFIER));
6912 }
6914 static void
6916 {
6924 {
6931 {
6935 }
6939 }
6942 }
6944 static void
6946 {
6954 {
6959 }
6962 }
6964 /* Dump a function or thunk and its thunkees. */
6966 static void
6968 {
6971 tree thunks;
6979 {
6989 else
6995 }
6999 }
7001 /* Dump the thunks for FN. */
7003 void
7005 {
7007 }
7009 /* Virtual function table initialization. */
7011 /* Create all the necessary vtables for T and its base classes. */
7013 static void
7015 {
7016 tree list;
7017 tree vbase;
7019 /* We lay out the primary and secondary vtables in one contiguous
7020 vtable. The primary vtable is first, followed by the non-virtual
7021 secondary vtables in inheritance graph order. */
7026 /* Then come the virtual bases, also in inheritance graph order. */
7028 {
7032 }
7036 }
7038 /* Initialize the vtable for BINFO with the INITS. */
7040 static void
7042 {
7043 tree decl;
7049 }
7051 /* Build the VTT (virtual table table) for T.
7052 A class requires a VTT if it has virtual bases.
7054 This holds
7055 1 - primary virtual pointer for complete object T
7056 2 - secondary VTTs for each direct non-virtual base of T which requires a
7057 VTT
7058 3 - secondary virtual pointers for each direct or indirect base of T which
7059 has virtual bases or is reachable via a virtual path from T.
7060 4 - secondary VTTs for each direct or indirect virtual base of T.
7062 Secondary VTTs look like complete object VTTs without part 4. */
7064 static void
7066 {
7067 tree inits;
7068 tree type;
7069 tree vtt;
7070 tree index;
7072 /* Build up the initializers for the VTT. */
7077 /* If we didn't need a VTT, we're done. */
7081 /* Figure out the type of the VTT. */
7085 /* Now, build the VTT object itself. */
7088 /* Add the VTT to the vtables list. */
7093 }
7095 /* When building a secondary VTT, BINFO_VTABLE is set to a TREE_LIST with
7096 PURPOSE the RTTI_BINFO, VALUE the real vtable pointer for this binfo,
7097 and CHAIN the vtable pointer for this binfo after construction is
7098 complete. VALUE can also be another BINFO, in which case we recurse. */
7100 static tree
7102 {
7103 tree vt;
7106 {
7112 else
7114 }
7117 }
7119 /* Data for secondary VTT initialization. */
7121 {
7122 /* Is this the primary VTT? */
7125 /* Current index into the VTT. */
7126 tree index;
7128 /* TREE_LIST of initializers built up. */
7129 tree inits;
7131 /* The type being constructed by this secondary VTT. */
7132 tree type_being_constructed;
7135 /* Recursively build the VTT-initializer for BINFO (which is in the
7136 hierarchy dominated by T). INITS points to the end of the initializer
7137 list to date. INDEX is the VTT index where the next element will be
7138 replaced. Iff BINFO is the binfo for T, this is the top level VTT (i.e.
7139 not a subvtt for some base of T). When that is so, we emit the sub-VTTs
7140 for virtual bases of T. When it is not so, we build the constructor
7141 vtables for the BINFO-in-T variant. */
7145 {
7147 tree b;
7148 tree init;
7149 tree secondary_vptrs;
7150 secondary_vptr_vtt_init_data data;
7153 /* We only need VTTs for subobjects with virtual bases. */
7157 /* We need to use a construction vtable if this is not the primary
7158 VTT. */
7160 {
7163 /* Record the offset in the VTT where this sub-VTT can be found. */
7165 }
7167 /* Add the address of the primary vtable for the complete object. */
7172 {
7175 }
7178 /* Recursively add the secondary VTTs for non-virtual bases. */
7183 /* Add secondary virtual pointers for all subobjects of BINFO with
7184 either virtual bases or reachable along a virtual path, except
7185 subobjects that are non-virtual primary bases. */
7195 /* The secondary vptrs come back in reverse order. After we reverse
7196 them, and add the INITS, the last init will be the first element
7197 of the chain. */
7200 {
7204 }
7207 /* Add the secondary VTTs for virtual bases in inheritance graph
7208 order. */
7210 {
7215 }
7216 else
7217 /* Remove the ctor vtables we created. */
7221 }
7223 /* Called from build_vtt_inits via dfs_walk. BINFO is the binfo for the base
7224 in most derived. DATA is a SECONDARY_VPTR_VTT_INIT_DATA structure. */
7226 static tree
7228 {
7231 /* We don't care about bases that don't have vtables. */
7235 /* We're only interested in proper subobjects of the type being
7236 constructed. */
7240 /* We're only interested in bases with virtual bases or reachable
7241 via a virtual path from the type being constructed. */
7246 /* We're not interested in non-virtual primary bases. */
7250 /* Record the index where this secondary vptr can be found. */
7252 {
7257 {
7258 /* It's a primary virtual base, and this is not a
7259 construction vtable. Find the base this is primary of in
7260 the inheritance graph, and use that base's vtable
7261 now. */
7264 }
7265 }
7267 /* Add the initializer for the secondary vptr itself. */
7270 /* Advance the vtt index. */
7275 }
7277 /* Called from build_vtt_inits via dfs_walk. After building
7278 constructor vtables and generating the sub-vtt from them, we need
7279 to restore the BINFO_VTABLES that were scribbled on. DATA is the
7280 binfo of the base whose sub vtt was generated. */
7282 static tree
7284 {
7288 /* If this class has no vtable, none of its bases do. */
7292 /* This might be a primary base, so have no vtable in this
7293 hierarchy. */
7296 /* If we scribbled the construction vtable vptr into BINFO, clear it
7297 out now. */
7303 }
7305 /* Build the construction vtable group for BINFO which is in the
7306 hierarchy dominated by T. */
7308 static void
7310 {
7311 tree list;
7312 tree type;
7313 tree vtbl;
7314 tree inits;
7315 tree id;
7316 tree vbase;
7318 /* See if we've already created this construction vtable group. */
7324 /* Build a version of VTBL (with the wrong type) for use in
7325 constructing the addresses of secondary vtables in the
7326 construction vtable group. */
7333 /* Add the vtables for each of our virtual bases using the vbase in T
7334 binfo. */
7336 vbase;
7338 {
7339 tree b;
7346 }
7349 /* Figure out the type of the construction vtable. */
7357 /* Initialize the construction vtable. */
7361 }
7363 /* Add the vtbl initializers for BINFO (and its bases other than
7364 non-virtual primaries) to the list of INITS. BINFO is in the
7365 hierarchy dominated by T. RTTI_BINFO is the binfo within T of
7366 the constructor the vtbl inits should be accumulated for. (If this
7367 is the complete object vtbl then RTTI_BINFO will be TYPE_BINFO (T).)
7368 ORIG_BINFO is the binfo for this object within BINFO_TYPE (RTTI_BINFO).
7369 BINFO is the active base equivalent of ORIG_BINFO in the inheritance
7370 graph of T. Both BINFO and ORIG_BINFO will have the same BINFO_TYPE,
7371 but are not necessarily the same in terms of layout. */
7373 static void
7375 tree orig_binfo,
7376 tree rtti_binfo,
7377 tree t,
7378 tree inits)
7379 {
7381 tree base_binfo;
7386 /* If it doesn't have a vptr, we don't do anything. */
7390 /* If we're building a construction vtable, we're not interested in
7391 subobjects that don't require construction vtables. */
7397 /* Build the initializers for the BINFO-in-T vtable. */
7403 /* Walk the BINFO and its bases. We walk in preorder so that as we
7404 initialize each vtable we can figure out at what offset the
7405 secondary vtable lies from the primary vtable. We can't use
7406 dfs_walk here because we need to iterate through bases of BINFO
7407 and RTTI_BINFO simultaneously. */
7409 {
7410 /* Skip virtual bases. */
7416 inits);
7417 }
7418 }
7420 /* Called from accumulate_vtbl_inits. Returns the initializers for
7421 the BINFO vtable. */
7423 static tree
7425 tree orig_binfo,
7426 tree rtti_binfo,
7427 tree t,
7428 tree l)
7429 {
7436 {
7437 /* In the hierarchy of BINFO_TYPE (RTTI_BINFO), this is a
7438 primary virtual base. If it is not the same primary in
7439 the hierarchy of T, we'll need to generate a ctor vtable
7440 for it, to place at its location in T. If it is the same
7441 primary, we still need a VTT entry for the vtable, but it
7442 should point to the ctor vtable for the base it is a
7443 primary for within the sub-hierarchy of RTTI_BINFO.
7445 There are three possible cases:
7447 1) We are in the same place.
7448 2) We are a primary base within a lost primary virtual base of
7449 RTTI_BINFO.
7450 3) We are primary to something not a base of RTTI_BINFO. */
7452 tree b;
7455 /* First, look through the bases we are primary to for RTTI_BINFO
7456 or a virtual base. */
7459 {
7464 }
7465 /* If we run out of primary links, keep looking down our
7466 inheritance chain; we might be an indirect primary. */
7470 found:
7472 /* If we found RTTI_BINFO, this is case 1. If we found a virtual
7473 base B and it is a base of RTTI_BINFO, this is case 2. In
7474 either case, we share our vtable with LAST, i.e. the
7475 derived-most base within B of which we are a primary. */
7478 /* Just set our BINFO_VTABLE to point to LAST, as we may not have
7479 set LAST's BINFO_VTABLE yet. We'll extract the actual vptr in
7480 binfo_ctor_vtable after everything's been set up. */
7483 /* Otherwise, this is case 3 and we get our own. */
7484 }
7489 {
7490 tree index;
7493 /* Compute the initializer for this vtable. */
7497 /* Figure out the position to which the VPTR should point. */
7505 index);
7507 }
7510 /* For a construction vtable, we can't overwrite BINFO_VTABLE.
7511 So, we make a TREE_LIST. Later, dfs_fixup_binfo_vtbls will
7512 straighten this out. */
7516 else
7517 /* For an ordinary vtable, set BINFO_VTABLE. */
7521 }
7525 /* Construct the initializer for BINFO's virtual function table. BINFO
7526 is part of the hierarchy dominated by T. If we're building a
7527 construction vtable, the ORIG_BINFO is the binfo we should use to
7528 find the actual function pointers to put in the vtable - but they
7529 can be overridden on the path to most-derived in the graph that
7530 ORIG_BINFO belongs. Otherwise,
7531 ORIG_BINFO should be the same as BINFO. The RTTI_BINFO is the
7532 BINFO that should be indicated by the RTTI information in the
7533 vtable; it will be a base class of T, rather than T itself, if we
7534 are building a construction vtable.
7536 The value returned is a TREE_LIST suitable for wrapping in a
7537 CONSTRUCTOR to use as the DECL_INITIAL for a vtable. If
7538 NON_FN_ENTRIES_P is not NULL, *NON_FN_ENTRIES_P is set to the
7539 number of non-function entries in the vtable.
7541 It might seem that this function should never be called with a
7542 BINFO for which BINFO_PRIMARY_P holds, the vtable for such a
7543 base is always subsumed by a derived class vtable. However, when
7544 we are building construction vtables, we do build vtables for
7545 primary bases; we need these while the primary base is being
7546 constructed. */
7548 static tree
7550 tree orig_binfo,
7551 tree t,
7552 tree rtti_binfo,
7554 {
7556 tree vfun_inits;
7557 vtbl_init_data vid;
7559 tree vbinfo;
7562 /* Initialize VID. */
7571 /* The first vbase or vcall offset is at index -3 in the vtable. */
7574 /* Add entries to the vtable for RTTI. */
7577 /* Create an array for keeping track of the functions we've
7578 processed. When we see multiple functions with the same
7579 signature, we share the vcall offsets. */
7581 /* Add the vcall and vbase offset entries. */
7584 /* Clear BINFO_VTABLE_PATH_MARKED; it's set by
7585 build_vbase_offset_vtbl_entries. */
7590 /* If the target requires padding between data entries, add that now. */
7592 {
7596 {
7603 null_pointer_node),
7604 add);
7606 }
7607 }
7612 /* Go through all the ordinary virtual functions, building up
7613 initializers. */
7616 {
7617 tree delta;
7618 tree vcall_index;
7625 {
7629 {
7632 }
7634 }
7636 /* If the only definition of this function signature along our
7637 primary base chain is from a lost primary, this vtable slot will
7638 never be used, so just zero it out. This is important to avoid
7639 requiring extra thunks which cannot be generated with the function.
7641 We first check this in update_vtable_entry_for_fn, so we handle
7642 restored primary bases properly; we also need to do it here so we
7643 zero out unused slots in ctor vtables, rather than filling them
7644 with erroneous values (though harmless, apart from relocation
7645 costs). */
7647 {
7648 /* We found a defn before a lost primary; go ahead as normal. */
7652 /* The nearest definition is from a lost primary; clear the
7653 slot. */
7655 {
7658 }
7659 }
7662 {
7663 /* Pull the offset for `this', and the function to call, out of
7664 the list. */
7671 /* You can't call an abstract virtual function; it's abstract.
7672 So, we replace these functions with __pure_virtual. */
7674 {
7679 }
7680 else
7681 {
7683 {
7687 }
7688 /* Take the address of the function, considering it to be of an
7689 appropriate generic type. */
7691 }
7692 }
7694 /* And add it to the chain of initializers. */
7696 {
7701 else
7703 {
7710 }
7711 }
7712 else
7714 }
7716 /* The initializers for virtual functions were built up in reverse
7717 order; straighten them out now. */
7720 /* The negative offset initializers are also in reverse order. */
7723 /* Chain the two together. */
7725 }
7727 /* Adds to vid->inits the initializers for the vbase and vcall
7728 offsets in BINFO, which is in the hierarchy dominated by T. */
7730 static void
7732 {
7733 tree b;
7735 /* If this is a derived class, we must first create entries
7736 corresponding to the primary base class. */
7741 /* Add the vbase entries for this base. */
7743 /* Add the vcall entries for this base. */
7745 }
7747 /* Returns the initializers for the vbase offset entries in the vtable
7748 for BINFO (which is part of the class hierarchy dominated by T), in
7749 reverse order. VBASE_OFFSET_INDEX gives the vtable index
7750 where the next vbase offset will go. */
7752 static void
7754 {
7755 tree vbase;
7756 tree t;
7757 tree non_primary_binfo;
7759 /* If there are no virtual baseclasses, then there is nothing to
7760 do. */
7766 /* We might be a primary base class. Go up the inheritance hierarchy
7767 until we find the most derived class of which we are a primary base:
7768 it is the offset of that which we need to use. */
7771 {
7772 tree b;
7774 /* If we have reached a virtual base, then it must be a primary
7775 base (possibly multi-level) of vid->binfo, or we wouldn't
7776 have called build_vcall_and_vbase_vtbl_entries for it. But it
7777 might be a lost primary, so just skip down to vid->binfo. */
7779 {
7782 }
7788 }
7790 /* Go through the virtual bases, adding the offsets. */
7792 vbase;
7794 {
7795 tree b;
7796 tree delta;
7801 /* Find the instance of this virtual base in the complete
7802 object. */
7805 /* If we've already got an offset for this virtual base, we
7806 don't need another one. */
7811 /* Figure out where we can find this vbase offset. */
7820 /* The vbase offset had better be the same. */
7823 /* The next vbase will come at a more negative offset. */
7827 /* The initializer is the delta from BINFO to this virtual base.
7828 The vbase offsets go in reverse inheritance-graph order, and
7829 we are walking in inheritance graph order so these end up in
7830 the right order. */
7837 vtable_entry_type,
7838 delta));
7840 }
7841 }
7843 /* Adds the initializers for the vcall offset entries in the vtable
7844 for BINFO (which is part of the class hierarchy dominated by VID->DERIVED)
7845 to VID->INITS. */
7847 static void
7849 {
7850 /* We only need these entries if this base is a virtual base. We
7851 compute the indices -- but do not add to the vtable -- when
7852 building the main vtable for a class. */
7855 /* If BINFO is RTTI_BINFO, then (since BINFO does not
7856 correspond to VID->DERIVED), we are building a primary
7857 construction virtual table. Since this is a primary
7858 virtual table, we do not need the vcall offsets for
7859 BINFO. */
7861 {
7862 /* We need a vcall offset for each of the virtual functions in this
7863 vtable. For example:
7865 class A { virtual void f (); };
7866 class B1 : virtual public A { virtual void f (); };
7867 class B2 : virtual public A { virtual void f (); };
7868 class C: public B1, public B2 { virtual void f (); };
7870 A C object has a primary base of B1, which has a primary base of A. A
7871 C also has a secondary base of B2, which no longer has a primary base
7872 of A. So the B2-in-C construction vtable needs a secondary vtable for
7873 A, which will adjust the A* to a B2* to call f. We have no way of
7874 knowing what (or even whether) this offset will be when we define B2,
7875 so we store this "vcall offset" in the A sub-vtable and look it up in
7876 a "virtual thunk" for B2::f.
7878 We need entries for all the functions in our primary vtable and
7879 in our non-virtual bases' secondary vtables. */
7881 /* If we are just computing the vcall indices -- but do not need
7882 the actual entries -- not that. */
7885 /* Now, walk through the non-virtual bases, adding vcall offsets. */
7887 }
7888 }
7890 /* Build vcall offsets, starting with those for BINFO. */
7892 static void
7894 {
7896 tree primary_binfo;
7897 tree base_binfo;
7899 /* Don't walk into virtual bases -- except, of course, for the
7900 virtual base for which we are building vcall offsets. Any
7901 primary virtual base will have already had its offsets generated
7902 through the recursion in build_vcall_and_vbase_vtbl_entries. */
7906 /* If BINFO has a primary base, process it first. */
7911 /* Add BINFO itself to the list. */
7914 /* Scan the non-primary bases of BINFO. */
7918 }
7920 /* Called from build_vcall_offset_vtbl_entries_r. */
7922 static void
7924 {
7925 /* Make entries for the rest of the virtuals. */
7927 {
7928 tree orig_fn;
7930 /* The ABI requires that the methods be processed in declaration
7931 order. G++ 3.2 used the order in the vtable. */
7933 orig_fn;
7937 }
7938 else
7939 {
7940 tree derived_virtuals;
7941 tree base_virtuals;
7942 tree orig_virtuals;
7943 /* If BINFO is a primary base, the most derived class which has
7944 BINFO as a primary base; otherwise, just BINFO. */
7945 tree non_primary_binfo;
7947 /* We might be a primary base class. Go up the inheritance hierarchy
7948 until we find the most derived class of which we are a primary base:
7949 it is the BINFO_VIRTUALS there that we need to consider. */
7952 {
7953 tree b;
7955 /* If we have reached a virtual base, then it must be vid->vbase,
7956 because we ignore other virtual bases in
7957 add_vcall_offset_vtbl_entries_r. In turn, it must be a primary
7958 base (possibly multi-level) of vid->binfo, or we wouldn't
7959 have called build_vcall_and_vbase_vtbl_entries for it. But it
7960 might be a lost primary, so just skip down to vid->binfo. */
7962 {
7966 }
7972 }
7975 /* For a ctor vtable we need the equivalent binfo within the hierarchy
7976 where rtti_binfo is the most derived type. */
7977 non_primary_binfo
7983 base_virtuals;
7987 {
7988 tree orig_fn;
7990 /* Find the declaration that originally caused this function to
7991 be present in BINFO_TYPE (binfo). */
7994 /* When processing BINFO, we only want to generate vcall slots for
7995 function slots introduced in BINFO. So don't try to generate
7996 one if the function isn't even defined in BINFO. */
8001 }
8002 }
8003 }
8005 /* Add a vcall offset entry for ORIG_FN to the vtable. */
8007 static void
8009 {
8011 tree vcall_offset;
8012 tree derived_entry;
8014 /* If there is already an entry for a function with the same
8015 signature as FN, then we do not need a second vcall offset.
8016 Check the list of functions already present in the derived
8017 class vtable. */
8019 {
8021 /* We only use one vcall offset for virtual destructors,
8022 even though there are two virtual table entries. */
8026 }
8028 /* If we are building these vcall offsets as part of building
8029 the vtable for the most derived class, remember the vcall
8030 offset. */
8032 {
8035 NULL);
8038 }
8040 /* The next vcall offset will be found at a more negative
8041 offset. */
8045 /* Keep track of this function. */
8049 {
8050 tree base;
8051 tree fn;
8053 /* Find the overriding function. */
8057 integer_zero_node);
8058 else
8059 {
8062 /* The vbase we're working on is a primary base of
8063 vid->binfo. But it might be a lost primary, so its
8064 BINFO_OFFSET might be wrong, so we just use the
8065 BINFO_OFFSET from vid->binfo. */
8071 vcall_offset);
8072 }
8073 /* Add the initializer to the vtable. */
8076 }
8077 }
8079 /* Return vtbl initializers for the RTTI entries corresponding to the
8080 BINFO's vtable. The RTTI entries should indicate the object given
8081 by VID->rtti_binfo. */
8083 static void
8085 {
8086 tree b;
8087 tree t;
8088 tree offset;
8089 tree decl;
8090 tree init;
8094 /* To find the complete object, we will first convert to our most
8095 primary base, and then add the offset in the vtbl to that value. */
8099 {
8100 tree primary_base;
8106 }
8110 /* The second entry is the address of the typeinfo object. */
8113 else
8116 /* Convert the declaration to a type that can be stored in the
8117 vtable. */
8122 /* Add the offset-to-top entry. It comes earlier in the vtable than
8123 the typeinfo entry. Convert the offset to look like a
8124 function pointer, so that we can put it in the vtable. */
8128 }
8130 /* Fold a OBJ_TYPE_REF expression to the address of a function.
8131 KNOWN_TYPE carries the true type of OBJ_TYPE_REF_OBJECT(REF). */
8133 tree
8135 {
8139 tree fndecl;
8142 {
8143 i += (TARGET_VTABLE_USES_DESCRIPTORS
8146 }
8150 #ifdef ENABLE_CHECKING
8153 #endif
8158 }