| blob | 38eb73f400445cb3e0bffa81083c8b5b3bdd271f |
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
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 {
511 tree binfo;
512 tree object_type;
515 {
518 }
519 else
524 NULL);
529 }
531 /* EXPR is an expression with unqualified class type. BASE is a base
532 binfo of that class type. Returns EXPR, converted to the BASE
533 type. This function assumes that EXPR is the most derived class;
534 therefore virtual bases can be found at their static offsets. */
536 tree
538 {
539 tree expr_type;
543 {
544 tree pointer_type;
548 /* We use fold_build2 and fold_convert below to simplify the trees
549 provided to the optimizers. It is not safe to call these functions
550 when processing a template because they do not handle C++-specific
551 trees. */
554 tf_warning_or_error);
561 }
564 }
566 \f
567 tree
569 {
575 /* First, convert to the requested type. */
580 /* Second, the requested type may not be the owner of its own vptr.
581 If not, convert to the base class that owns it. We cannot use
582 convert_to_base here, because VCONTEXT may appear more than once
583 in the inheritance hierarchy of TYPE, and thus direct conversion
584 between the types may be ambiguous. Following the path back up
585 one step at a time via primary bases avoids the problem. */
589 {
592 }
595 }
597 /* Given an object INSTANCE, return an expression which yields the
598 vtable element corresponding to INDEX. There are many special
599 cases for INSTANCE which we take care of here, mainly to avoid
600 creating extra tree nodes when we don't have to. */
602 static tree
604 {
605 tree aref;
608 /* Try to figure out what a reference refers to, and
609 access its virtual function table directly. */
617 {
622 }
631 }
633 tree
635 {
639 }
641 /* Given a stable object pointer INSTANCE_PTR, return an expression which
642 yields a function pointer corresponding to vtable element INDEX. */
644 tree
646 {
647 tree aref;
650 tf_warning_or_error),
651 idx);
653 /* When using function descriptors, the address of the
654 vtable entry is treated as a function pointer. */
658 tf_warning_or_error));
660 /* Remember this as a method reference, for later devirtualization. */
664 }
666 /* Return the name of the virtual function table (as an IDENTIFIER_NODE)
667 for the given TYPE. */
669 static tree
671 {
673 }
675 /* DECL is an entity associated with TYPE, like a virtual table or an
676 implicitly generated constructor. Determine whether or not DECL
677 should have external or internal linkage at the object file
678 level. This routine does not deal with COMDAT linkage and other
679 similar complexities; it simply sets TREE_PUBLIC if it possible for
680 entities in other translation units to contain copies of DECL, in
681 the abstract. */
683 void
685 {
686 /* If TYPE involves a local class in a function with internal
687 linkage, then DECL should have internal linkage too. Other local
688 classes have no linkage -- but if their containing functions
689 have external linkage, it makes sense for DECL to have external
690 linkage too. That will allow template definitions to be merged,
691 for example. */
693 {
696 }
697 else
699 }
701 /* Create a VAR_DECL for a primary or secondary vtable for CLASS_TYPE.
702 (For a secondary vtable for B-in-D, CLASS_TYPE should be D, not B.)
703 Use NAME for the name of the vtable, and VTABLE_TYPE for its type. */
705 static tree
707 {
708 tree decl;
711 /* vtable names are already mangled; give them their DECL_ASSEMBLER_NAME
712 now to avoid confusion in mangle_decl. */
721 /* At one time the vtable info was grabbed 2 words at a time. This
722 fails on sparc unless you have 8-byte alignment. (tiemann) */
726 /* The vtable has not been defined -- yet. */
730 /* Mark the VAR_DECL node representing the vtable itself as a
731 "gratuitous" one, thereby forcing dwarfout.c to ignore it. It
732 is rather important that such things be ignored because any
733 effort to actually generate DWARF for them will run into
734 trouble when/if we encounter code like:
736 #pragma interface
737 struct S { virtual void member (); };
739 because the artificial declaration of the vtable itself (as
740 manufactured by the g++ front end) will say that the vtable is
741 a static member of `S' but only *after* the debug output for
742 the definition of `S' has already been output. This causes
743 grief because the DWARF entry for the definition of the vtable
744 will try to refer back to an earlier *declaration* of the
745 vtable as a static member of `S' and there won't be one. We
746 might be able to arrange to have the "vtable static member"
747 attached to the member list for `S' before the debug info for
748 `S' get written (which would solve the problem) but that would
749 require more intrusive changes to the g++ front end. */
753 }
755 /* Get the VAR_DECL of the vtable for TYPE. TYPE need not be polymorphic,
756 or even complete. If this does not exist, create it. If COMPLETE is
757 nonzero, then complete the definition of it -- that will render it
758 impossible to actually build the vtable, but is useful to get at those
759 which are known to exist in the runtime. */
761 tree
763 {
764 tree decl;
773 {
776 }
779 }
781 /* Build the primary virtual function table for TYPE. If BINFO is
782 non-NULL, build the vtable starting with the initial approximation
783 that it is the same as the one which is the head of the association
784 list. Returns a nonzero value if a new vtable is actually
785 created. */
787 static int
789 {
790 tree decl;
791 tree virtuals;
796 {
798 /* We have already created a vtable for this base, so there's
799 no need to do it again. */
806 }
807 else
808 {
811 }
813 #ifdef GATHER_STATISTICS
816 #endif
818 /* Initialize the association list for this type, based
819 on our first approximation. */
824 }
826 /* Give BINFO a new virtual function table which is initialized
827 with a skeleton-copy of its original initialization. The only
828 entry that changes is the `delta' entry, so we can really
829 share a lot of structure.
831 FOR_TYPE is the most derived type which caused this table to
832 be needed.
834 Returns nonzero if we haven't met BINFO before.
836 The order in which vtables are built (by calling this function) for
837 an object must remain the same, otherwise a binary incompatibility
838 can result. */
840 static int
842 {
844 /* We already created a vtable for this base. There's no need to
845 do it again. */
848 /* Remember that we've created a vtable for this BINFO, so that we
849 don't try to do so again. */
852 /* Make fresh virtual list, so we can smash it later. */
855 /* Secondary vtables are laid out as part of the same structure as
856 the primary vtable. */
859 }
861 /* Create a new vtable for BINFO which is the hierarchy dominated by
862 T. Return nonzero if we actually created a new vtable. */
864 static int
866 {
868 /* In this case, it is *type*'s vtable we are modifying. We start
869 with the approximation that its vtable is that of the
870 immediate base class. */
872 else
873 /* This is our very own copy of `basetype' to play with. Later,
874 we will fill in all the virtual functions that override the
875 virtual functions in these base classes which are not defined
876 by the current type. */
878 }
880 /* Make *VIRTUALS, an entry on the BINFO_VIRTUALS list for BINFO
881 (which is in the hierarchy dominated by T) list FNDECL as its
882 BV_FN. DELTA is the required constant adjustment from the `this'
883 pointer where the vtable entry appears to the `this' required when
884 the function is actually called. */
886 static void
888 tree binfo,
889 tree fndecl,
890 tree delta,
892 {
893 tree v;
899 {
900 /* We need a new vtable for BINFO. */
902 {
903 /* If we really did make a new vtable, we also made a copy
904 of the BINFO_VIRTUALS list. Now, we have to find the
905 corresponding entry in that list. */
910 }
915 }
916 }
918 \f
919 /* Add method METHOD to class TYPE. If USING_DECL is non-null, it is
920 the USING_DECL naming METHOD. Returns true if the method could be
921 added to the method vec. */
923 bool
925 {
927 tree overload;
933 tree current_fns;
934 tree fns;
947 {
948 /* Make a new method vector. We start with 8 entries. We must
949 allocate at least two (for constructors and destructors), and
950 we're going to end up with an assignment operator at some
951 point as well. */
953 /* Create slots for constructors and destructors. */
957 }
959 /* Maintain TYPE_HAS_USER_CONSTRUCTOR, etc. */
962 /* Constructors and destructors go in special slots. */
966 {
970 {
976 type);
977 }
978 }
979 else
980 {
981 tree m;
984 /* See if we already have an entry with this name. */
988 {
991 {
996 }
1000 {
1003 }
1008 }
1009 }
1012 /* Check to see if we've already got this method. */
1014 {
1016 tree fn_type;
1017 tree method_type;
1018 tree parms1;
1019 tree parms2;
1024 /* [over.load] Member function declarations with the
1025 same name and the same parameter types cannot be
1026 overloaded if any of them is a static member
1027 function declaration.
1029 [namespace.udecl] When a using-declaration brings names
1030 from a base class into a derived class scope, member
1031 functions in the derived class override and/or hide member
1032 functions with the same name and parameter types in a base
1033 class (rather than conflicting). */
1039 /* Compare the quals on the 'this' parm. Don't compare
1040 the whole types, as used functions are treated as
1041 coming from the using class in overload resolution. */
1050 /* For templates, the return type and template parameters
1051 must be identical. */
1068 {
1070 {
1072 /* Defer to the local function. */
1076 else
1078 using_decl);
1079 }
1080 else
1081 {
1084 }
1086 /* We don't call duplicate_decls here to merge the
1087 declarations because that will confuse things if the
1088 methods have inline definitions. In particular, we
1089 will crash while processing the definitions. */
1091 }
1092 }
1094 /* A class should never have more than one destructor. */
1098 /* Add the new binding. */
1107 {
1110 /* We only expect to add few methods in the COMPLETE_P case, so
1111 just make room for one more method in that case. */
1114 else
1120 else
1122 }
1123 else
1124 /* Replace the current slot. */
1127 }
1129 /* Subroutines of finish_struct. */
1131 /* Change the access of FDECL to ACCESS in T. Return 1 if change was
1132 legit, otherwise return 0. */
1134 static int
1136 {
1137 tree elem;
1146 {
1148 {
1152 else
1155 }
1156 else
1157 {
1158 /* They're changing the access to the same thing they changed
1159 it to before. That's OK. */
1160 ;
1161 }
1162 }
1163 else
1164 {
1168 }
1170 }
1172 /* Process the USING_DECL, which is a member of T. */
1174 static void
1176 {
1179 tree access
1184 tree old_value;
1190 {
1196 else
1198 }
1206 ;
1208 {
1210 /* It's OK to use functions from a base when there are functions with
1212 else
1213 {
1218 }
1219 }
1221 {
1225 }
1227 /* Make type T see field decl FDECL with access ACCESS. */
1230 {
1233 }
1234 else
1236 }
1237 \f
1238 /* Run through the base classes of T, updating CANT_HAVE_CONST_CTOR_P,
1239 and NO_CONST_ASN_REF_P. Also set flag bits in T based on
1240 properties of the bases. */
1242 static void
1246 {
1249 tree base_binfo;
1250 tree binfo;
1262 {
1267 /* Effective C++ rule 14. We only need to check TYPE_POLYMORPHIC_P
1268 here because the case of virtual functions but non-virtual
1269 dtor is handled in finish_struct_1. */
1274 /* If the base class doesn't have copy constructors or
1275 assignment operators that take const references, then the
1276 derived class cannot have such a member automatically
1277 generated. */
1285 /* A virtual base does not effect nearly emptiness. */
1286 ;
1288 {
1290 /* And if there is more than one nearly empty base, then the
1291 derived class is not nearly empty either. */
1293 else
1294 /* Remember we've seen one. */
1296 }
1298 /* If the base class is not empty or nearly empty, then this
1299 class cannot be nearly empty. */
1302 /* A lot of properties from the bases also apply to the derived
1303 class. */
1315 /* A standard-layout class is a class that:
1316 ...
1317 * has no non-standard-layout base classes, */
1320 {
1321 tree basefield;
1322 /* ...has no base classes of the same type as the first non-static
1323 data member... */
1325 && (same_type_ignoring_top_level_qualifiers_p
1328 else
1329 /* ...either has no non-static data members in the most-derived
1330 class and at most one base class with non-static data
1331 members, or has no base classes with non-static data
1332 members */
1336 {
1339 else
1342 }
1343 }
1344 }
1345 }
1347 /* Determine all the primary bases within T. Sets BINFO_PRIMARY_BASE_P for
1348 those that are primaries. Sets BINFO_LOST_PRIMARY_P for those
1349 that have had a nearly-empty virtual primary base stolen by some
1350 other base in the hierarchy. Determines CLASSTYPE_PRIMARY_BASE for
1351 T. */
1353 static void
1355 {
1359 tree base_binfo;
1361 /* Determine the primary bases of our bases. */
1364 {
1367 /* See if we're the non-virtual primary of our inheritance
1368 chain. */
1370 {
1377 /* We are the primary binfo. */
1379 }
1380 /* Determine if we have a virtual primary base, and mark it so.
1381 */
1383 {
1387 /* Someone already claimed this base. */
1389 else
1390 {
1391 tree delta;
1396 /* A virtual binfo might have been copied from within
1397 another hierarchy. As we're about to use it as a
1398 primary base, make sure the offsets match. */
1406 }
1407 }
1408 }
1410 /* First look for a dynamic direct non-virtual base. */
1412 {
1416 {
1419 }
1420 }
1422 /* A "nearly-empty" virtual base class can be the primary base
1423 class, if no non-virtual polymorphic base can be found. Look for
1424 a nearly-empty virtual dynamic base that is not already a primary
1425 base of something in the hierarchy. If there is no such base,
1426 just pick the first nearly-empty virtual base. */
1432 {
1434 {
1435 /* Found one that is not primary. */
1438 }
1440 /* Remember the first candidate. */
1442 }
1444 found:
1445 /* If we've got a primary base, use it. */
1447 {
1452 /* We are stealing a primary base. */
1456 {
1457 tree delta;
1460 /* A virtual binfo might have been copied from within
1461 another hierarchy. As we're about to use it as a primary
1462 base, make sure the offsets match. */
1467 }
1474 }
1475 }
1477 /* Update the variant types of T. */
1479 void
1481 {
1482 tree variants;
1488 variants;
1490 {
1491 /* These fields are in the _TYPE part of the node, not in
1492 the TYPE_LANG_SPECIFIC component, so they are not shared. */
1502 /* Copy whatever these are holding today. */
1507 /* All variants of a class have the same attributes. */
1509 }
1510 }
1512 \f
1513 /* Set memoizing fields and bits of T (and its variants) for later
1514 use. */
1516 static void
1518 {
1519 /* Fix up variants (if any). */
1523 /* For a class w/o baseclasses, 'finish_struct' has set
1524 CLASSTYPE_PURE_VIRTUALS correctly (by definition).
1525 Similarly for a class whose base classes do not have vtables.
1526 When neither of these is true, we might have removed abstract
1527 virtuals (by providing a definition), added some (by declaring
1528 new ones), or redeclared ones from a base class. We need to
1529 recalculate what's really an abstract virtual at this point (by
1530 looking in the vtables). */
1533 /* If this type has a copy constructor or a destructor, force its
1534 mode to be BLKmode, and force its TREE_ADDRESSABLE bit to be
1535 nonzero. This will cause it to be passed by invisible reference
1536 and prevent it from being returned in a register. */
1538 {
1539 tree variants;
1542 {
1545 }
1546 }
1547 }
1549 /* Issue warnings about T having private constructors, but no friends,
1550 and so forth.
1552 HAS_NONPRIVATE_METHOD is nonzero if T has any non-private methods or
1553 static members. HAS_NONPRIVATE_STATIC_FN is nonzero if T has any
1554 non-private static member functions. */
1556 static void
1558 {
1561 tree fn;
1564 /* If the class has friends, those entities might create and
1565 access instances, so we should not warn. */
1568 /* We will have warned when the template was declared; there's
1569 no need to warn on every instantiation. */
1571 /* There's no reason to even consider warning about this
1572 class. */
1575 /* We only issue one warning, if more than one applies, because
1576 otherwise, on code like:
1578 class A {
1579 // Oops - forgot `public:'
1580 A();
1581 A(const A&);
1582 ~A();
1583 };
1585 we warn several times about essentially the same problem. */
1587 /* Check to see if all (non-constructor, non-destructor) member
1588 functions are private. (Since there are no friends or
1589 non-private statics, we can't ever call any of the private member
1590 functions.) */
1592 /* We're not interested in compiler-generated methods; they don't
1593 provide any way to call private members. */
1595 {
1597 {
1599 /* A non-private static member function is just like a
1600 friend; it can create and invoke private member
1601 functions, and be accessed without a class
1602 instance. */
1606 /* Keep searching for a static member function. */
1607 }
1610 }
1613 {
1614 /* There are no non-private methods, and there's at least one
1615 private member function that isn't a constructor or
1616 destructor. (If all the private members are
1617 constructors/destructors we want to use the code below that
1618 issues error messages specifically referring to
1619 constructors/destructors.) */
1625 {
1628 }
1630 {
1634 }
1635 }
1637 /* Even if some of the member functions are non-private, the class
1638 won't be useful for much if all the constructors or destructors
1639 are private: such an object can never be created or destroyed. */
1642 {
1645 t);
1647 }
1649 /* Warn about classes that have private constructors and no friends. */
1651 /* Implicitly generated constructors are always public. */
1654 {
1657 /* If a non-template class does not define a copy
1658 constructor, one is defined for it, enabling it to avoid
1659 this warning. For a template class, this does not
1660 happen, and so we would normally get a warning on:
1662 template <class T> class C { private: C(); };
1664 To avoid this asymmetry, we check TYPE_HAS_INIT_REF. All
1665 complete non-template or fully instantiated classes have this
1666 flag set. */
1669 else
1671 {
1673 /* Ideally, we wouldn't count copy constructors (or, in
1674 fact, any constructor that takes an argument of the
1675 class type as a parameter) because such things cannot
1676 be used to construct an instance of the class unless
1677 you already have one. But, for now at least, we're
1678 more generous. */
1680 {
1683 }
1684 }
1687 {
1690 t);
1692 }
1693 }
1694 }
1697 gt_pointer_operator new_value;
1701 /* Comparison function to compare two TYPE_METHOD_VEC entries by name. */
1703 static int
1705 {
1718 }
1720 /* This routine compares two fields like method_name_cmp but using the
1721 pointer operator in resort_field_decl_data. */
1723 static int
1725 {
1734 {
1741 }
1743 }
1745 /* Resort TYPE_METHOD_VEC because pointers have been reordered. */
1747 void
1750 gt_pointer_operator new_value,
1752 {
1756 tree fn;
1758 /* The type conversion ops have to live at the front of the vec, so we
1759 can't sort them. */
1767 {
1771 resort_method_name_cmp);
1772 }
1773 }
1775 /* Warn about duplicate methods in fn_fields.
1777 Sort methods that are not special (i.e., constructors, destructors,
1778 and type conversion operators) so that we can find them faster in
1779 search. */
1781 static void
1783 {
1784 tree fn_fields;
1794 /* Clear DECL_IN_AGGR_P for all functions. */
1799 /* Issue warnings about private constructors and such. If there are
1800 no methods, then some public defaults are generated. */
1803 /* The type conversion ops have to live at the front of the vec, so we
1804 can't sort them. */
1813 }
1815 /* Make BINFO's vtable have N entries, including RTTI entries,
1816 vbase and vcall offsets, etc. Set its type and call the back end
1817 to lay it out. */
1819 static void
1821 {
1822 tree atype;
1823 tree vtable;
1829 /* We may have to grow the vtable. */
1832 {
1836 }
1837 }
1839 /* True iff FNDECL and BASE_FNDECL (both non-static member functions)
1840 have the same signature. */
1842 int
1844 {
1845 /* One destructor overrides another if they are the same kind of
1846 destructor. */
1850 /* But a non-destructor never overrides a destructor, nor vice
1851 versa, nor do different kinds of destructors override
1852 one-another. For example, a complete object destructor does not
1853 override a deleting destructor. */
1862 {
1870 }
1872 }
1874 /* Returns TRUE if DERIVED is a binfo containing the binfo BASE as a
1875 subobject. */
1877 static bool
1879 {
1880 tree probe;
1883 {
1887 /* If we meet a virtual base, we can't follow the inheritance
1888 any more. See if the complete type of DERIVED contains
1889 such a virtual base. */
1892 }
1894 }
1897 /* The function for which we are trying to find a final overrider. */
1898 tree fn;
1899 /* The base class in which the function was declared. */
1900 tree declaring_base;
1901 /* The candidate overriders. */
1902 tree candidates;
1903 /* Path to most derived. */
1907 /* Add the overrider along the current path to FFOD->CANDIDATES.
1908 Returns true if an overrider was found; false otherwise. */
1910 static bool
1914 {
1915 tree method;
1917 /* If BINFO is not the most derived type, try a more derived class.
1918 A definition there will overrider a definition here. */
1920 {
1921 depth--;
1925 }
1929 {
1932 /* Remove any candidates overridden by this new function. */
1934 {
1935 /* If *CANDIDATE overrides METHOD, then METHOD
1936 cannot override anything else on the list. */
1939 /* If METHOD overrides *CANDIDATE, remove *CANDIDATE. */
1942 else
1944 }
1946 /* Add the new function. */
1949 }
1952 }
1954 /* Called from find_final_overrider via dfs_walk. */
1956 static tree
1958 {
1966 }
1968 static tree
1970 {
1975 }
1977 /* Returns a TREE_LIST whose TREE_PURPOSE is the final overrider for
1978 FN and whose TREE_VALUE is the binfo for the base where the
1979 overriding occurs. BINFO (in the hierarchy dominated by the binfo
1980 DERIVED) is the base object in which FN is declared. */
1982 static tree
1984 {
1985 find_final_overrider_data ffod;
1987 /* Getting this right is a little tricky. This is valid:
1989 struct S { virtual void f (); };
1990 struct T { virtual void f (); };
1991 struct U : public S, public T { };
1993 even though calling `f' in `U' is ambiguous. But,
1995 struct R { virtual void f(); };
1996 struct S : virtual public R { virtual void f (); };
1997 struct T : virtual public R { virtual void f (); };
1998 struct U : public S, public T { };
2000 is not -- there's no way to decide whether to put `S::f' or
2001 `T::f' in the vtable for `R'.
2003 The solution is to look at all paths to BINFO. If we find
2004 different overriders along any two, then there is a problem. */
2008 /* Determine the depth of the hierarchy. */
2019 /* If there was no winner, issue an error message. */
2024 }
2026 /* Return the index of the vcall offset for FN when TYPE is used as a
2027 virtual base. */
2029 static tree
2031 {
2033 tree_pair_p p;
2041 /* There should always be an appropriate index. */
2043 }
2045 /* Update an entry in the vtable for BINFO, which is in the hierarchy
2046 dominated by T. FN has been overridden in BINFO; VIRTUALS points to the
2047 corresponding position in the BINFO_VIRTUALS list. */
2049 static void
2052 {
2053 tree b;
2054 tree overrider;
2055 tree delta;
2056 tree virtual_base;
2057 tree first_defn;
2063 /* Find the nearest primary base (possibly binfo itself) which defines
2064 this function; this is the class the caller will convert to when
2065 calling FN through BINFO. */
2067 {
2072 /* The nearest definition is from a lost primary. */
2075 }
2078 /* Find the final overrider. */
2081 {
2084 }
2087 /* Check for adjusting covariant return types. */
2095 /* If the overrider is invalid, don't even try. */
2097 {
2098 /* If FN is a covariant thunk, we must figure out the adjustment
2099 to the final base FN was converting to. As OVERRIDER_TARGET might
2100 also be converting to the return type of FN, we have to
2101 combine the two conversions here. */
2108 {
2112 }
2113 else
2117 /* Find the equivalent binfo within the return type of the
2118 overriding function. We will want the vbase offset from
2119 there. */
2121 over_return);
2124 {
2125 /* There was no existing virtual thunk (which takes
2126 precedence). So find the binfo of the base function's
2127 return type within the overriding function's return type.
2128 We cannot call lookup base here, because we're inside a
2129 dfs_walk, and will therefore clobber the BINFO_MARKED
2130 flags. Fortunately we know the covariancy is valid (it
2131 has already been checked), so we can just iterate along
2132 the binfos, which have been chained in inheritance graph
2133 order. Of course it is lame that we have to repeat the
2134 search here anyway -- we should really be caching pieces
2135 of the vtable and avoiding this repeated work. */
2138 /* Find the base binfo within the overriding function's
2139 return type. We will always find a thunk_binfo, except
2140 when the covariancy is invalid (which we will have
2141 already diagnosed). */
2144 thunk_binfo;
2150 /* See if virtual inheritance is involved. */
2152 virtual_offset;
2159 {
2163 {
2164 /* We convert via virtual base. Adjust the fixed
2165 offset to be from there. */
2166 offset =
2170 }
2172 /* There was an existing fixed offset, this must be
2173 from the base just converted to, and the base the
2174 FN was thunking to. */
2176 else
2178 }
2179 }
2182 /* Replace the overriding function with a covariant thunk. We
2183 will emit the overriding function in its own slot as
2184 well. */
2187 }
2188 else
2192 /* Assume that we will produce a thunk that convert all the way to
2193 the final overrider, and not to an intermediate virtual base. */
2196 /* See if we can convert to an intermediate virtual base first, and then
2197 use the vcall offset located there to finish the conversion. */
2199 {
2200 /* If we find the final overrider, then we can stop
2201 walking. */
2206 /* If we find a virtual base, and we haven't yet found the
2207 overrider, then there is a virtual base between the
2208 declaring base (first_defn) and the final overrider. */
2210 {
2213 }
2214 }
2217 {
2218 /* The ABI specifies that a covariant thunk includes a mangling
2219 for a this pointer adjustment. This-adjusting thunks that
2220 override a function from a virtual base have a vcall
2221 adjustment. When the virtual base in question is a primary
2222 virtual base, we know the adjustments are zero, (and in the
2223 non-covariant case, we would not use the thunk).
2224 Unfortunately we didn't notice this could happen, when
2225 designing the ABI and so never mandated that such a covariant
2226 thunk should be emitted. Because we must use the ABI mandated
2227 name, we must continue searching from the binfo where we
2228 found the most recent definition of the function, towards the
2229 primary binfo which first introduced the function into the
2230 vtable. If that enters a virtual base, we must use a vcall
2231 this-adjusting thunk. Bleah! */
2240 /* Even if we find a virtual base, the correct delta is
2241 between the overrider and the binfo we're building a vtable
2242 for. */
2244 }
2246 /* Compute the constant adjustment to the `this' pointer. The
2247 `this' pointer, when this function is called, will point at BINFO
2248 (or one of its primary bases, which are at the same offset). */
2250 /* The `this' pointer needs to be adjusted from the declaration to
2251 the nearest virtual base. */
2256 /* If the nearest definition is in a lost primary, we don't need an
2257 entry in our vtable. Except possibly in a constructor vtable,
2258 if we happen to get our primary back. In that case, the offset
2259 will be zero, as it will be a primary base. */
2261 else
2262 /* The `this' pointer needs to be adjusted from pointing to
2263 BINFO to pointing at the base where the final overrider
2264 appears. */
2265 virtual_covariant:
2276 else
2278 }
2280 /* Called from modify_all_vtables via dfs_walk. */
2282 static tree
2284 {
2286 tree virtuals;
2287 tree old_virtuals;
2291 /* A base without a vtable needs no modification, and its bases
2292 are uninteresting. */
2297 /* Don't do the primary vtable, if it's new. */
2301 /* There's no need to modify the vtable for a non-virtual primary
2302 base; we're not going to use that vtable anyhow. We do still
2303 need to do this for virtual primary bases, as they could become
2304 non-primary in a construction vtable. */
2309 /* Now, go through each of the virtual functions in the virtual
2310 function table for BINFO. Find the final overrider, and update
2311 the BINFO_VIRTUALS list appropriately. */
2314 virtuals;
2318 binfo,
2323 }
2325 /* Update all of the primary and secondary vtables for T. Create new
2326 vtables as required, and initialize their RTTI information. Each
2327 of the functions in VIRTUALS is declared in T and may override a
2328 virtual function from a base class; find and modify the appropriate
2329 entries to point to the overriding functions. Returns a list, in
2330 declaration order, of the virtual functions that are declared in T,
2331 but do not appear in the primary base class vtable, and which
2332 should therefore be appended to the end of the vtable for T. */
2334 static tree
2336 {
2340 /* Update all of the vtables. */
2343 /* Add virtual functions not already in our primary vtable. These
2344 will be both those introduced by this class, and those overridden
2345 from secondary bases. It does not include virtuals merely
2346 inherited from secondary bases. */
2348 {
2353 {
2354 /* We don't need to adjust the `this' pointer when
2355 calling this function. */
2359 /* This is a function not already in our vtable. Keep it. */
2361 }
2362 else
2363 /* We've already got an entry for this function. Skip it. */
2365 }
2368 }
2370 /* Get the base virtual function declarations in T that have the
2371 indicated NAME. */
2373 static tree
2375 {
2376 tree methods;
2381 /* Find virtual functions in T with the indicated NAME. */
2385 methods;
2387 {
2393 }
2399 {
2402 base_fndecls);
2403 }
2406 }
2408 /* If this declaration supersedes the declaration of
2409 a method declared virtual in the base class, then
2410 mark this field as being virtual as well. */
2412 void
2414 {
2416 /* In [temp.mem] we have:
2418 A specialization of a member function template does not
2419 override a virtual function from a base class. */
2426 /* Set DECL_VINDEX to a value that is neither an INTEGER_CST nor
2427 the error_mark_node so that we know it is an overriding
2428 function. */
2432 {
2436 }
2437 }
2439 /* Warn about hidden virtual functions that are not overridden in t.
2440 We know that constructors and destructors don't apply. */
2442 static void
2444 {
2446 tree fns;
2449 /* We go through each separately named virtual function. */
2453 {
2454 tree fn;
2455 tree name;
2456 tree fndecl;
2457 tree base_fndecls;
2458 tree base_binfo;
2459 tree binfo;
2462 /* All functions in this slot in the CLASSTYPE_METHOD_VEC will
2463 have the same name. Figure out what name that is. */
2465 /* There are no possibly hidden functions yet. */
2467 /* Iterate through all of the base classes looking for possibly
2468 hidden functions. */
2471 {
2474 base_fndecls);
2475 }
2477 /* If there are no functions to hide, continue. */
2481 /* Remove any overridden functions. */
2483 {
2486 {
2490 /* If the method from the base class has the same
2491 signature as the method from the derived class, it
2492 has been overridden. */
2495 else
2497 }
2498 }
2500 /* Now give a warning for all base functions without overriders,
2501 as they are hidden. */
2503 {
2504 /* Here we know it is a hider, and no overrider exists. */
2508 }
2509 }
2510 }
2512 /* Check for things that are invalid. There are probably plenty of other
2513 things we should check for also. */
2515 static void
2517 {
2518 tree field;
2521 {
2529 {
2533 {
2534 /* We're generally only interested in entities the user
2535 declared, but we also find nested classes by noticing
2536 the TYPE_DECL that we create implicitly. You're
2537 allowed to put one anonymous union inside another,
2538 though, so we explicitly tolerate that. We use
2539 TYPE_ANONYMOUS_P rather than ANON_AGGR_TYPE_P so that
2540 we also allow unnamed types used for defining fields. */
2547 {
2551 else
2555 }
2558 {
2561 else
2563 }
2565 {
2568 else
2570 }
2574 }
2575 }
2576 }
2577 }
2579 /* Add T to CLASSTYPE_DECL_LIST of current_class_type which
2580 will be used later during class template instantiation.
2581 When FRIEND_P is zero, T can be a static member data (VAR_DECL),
2582 a non-static member data (FIELD_DECL), a member function
2583 (FUNCTION_DECL), a nested type (RECORD_TYPE, ENUM_TYPE),
2584 a typedef (TYPE_DECL) or a member class template (TEMPLATE_DECL)
2585 When FRIEND_P is nonzero, T is either a friend class
2586 (RECORD_TYPE, TEMPLATE_DECL) or a friend function
2587 (FUNCTION_DECL, TEMPLATE_DECL). */
2589 void
2591 {
2592 /* Save some memory by not creating TREE_LIST if TYPE is not template. */
2597 }
2599 /* Create default constructors, assignment operators, and so forth for
2600 the type indicated by T, if they are needed. CANT_HAVE_CONST_CTOR,
2601 and CANT_HAVE_CONST_ASSIGNMENT are nonzero if, for whatever reason,
2602 the class cannot have a default constructor, copy constructor
2603 taking a const reference argument, or an assignment operator taking
2604 a const reference, respectively. */
2606 static void
2610 {
2611 /* Destructor. */
2613 {
2614 /* In general, we create destructors lazily. */
2616 /* However, if the implicit destructor is non-trivial
2617 destructor, we sometimes have to create it at this point. */
2619 {
2623 /* If this a Java class, any non-trivial destructor is
2624 invalid, even if compiler-generated. Therefore, if the
2625 destructor is non-trivial we create it now. */
2627 else
2628 {
2629 tree binfo;
2630 tree base_binfo;
2633 /* If the implicit destructor will be virtual, then we must
2634 generate it now because (unfortunately) we do not
2635 generate virtual tables lazily. */
2638 {
2639 tree base_type;
2640 tree dtor;
2645 {
2648 }
2649 }
2650 }
2652 /* If we can't get away with being lazy, generate the destructor
2653 now. */
2656 }
2657 }
2659 /* [class.ctor]
2661 If there is no user-declared constructor for a class, a default
2662 constructor is implicitly declared. */
2664 {
2667 }
2669 /* [class.ctor]
2671 If a class definition does not explicitly declare a copy
2672 constructor, one is declared implicitly. */
2674 {
2678 }
2680 /* Currently only lambdas get a lazy move ctor, but N2987 adds them for
2681 other classes. */
2685 /* If there is no assignment operator, one will be created if and
2686 when it is needed. For now, just record whether or not the type
2687 of the parameter to the assignment operator will be a const or
2688 non-const reference. */
2690 {
2694 }
2695 }
2697 /* Subroutine of finish_struct_1. Recursively count the number of fields
2698 in TYPE, including anonymous union members. */
2700 static int
2702 {
2703 tree x;
2706 {
2709 else
2711 }
2713 }
2715 /* Subroutine of finish_struct_1. Recursively add all the fields in the
2716 TREE_LIST FIELDS to the SORTED_FIELDS_TYPE elts, starting at offset IDX. */
2718 static int
2720 {
2721 tree x;
2723 {
2726 else
2728 }
2730 }
2732 /* FIELD is a bit-field. We are finishing the processing for its
2733 enclosing type. Issue any appropriate messages and set appropriate
2734 flags. Returns false if an error has been diagnosed. */
2736 static bool
2738 {
2740 tree w;
2742 /* Extract the declared width of the bitfield, which has been
2743 temporarily stashed in DECL_INITIAL. */
2746 /* Remove the bit-field width indicator so that the rest of the
2747 compiler does not treat that value as an initializer. */
2750 /* Detect invalid bit-field type. */
2752 {
2755 }
2756 else
2757 {
2758 /* Avoid the non_lvalue wrapper added by fold for PLUS_EXPRs. */
2761 /* detect invalid field size. */
2765 {
2768 }
2770 {
2773 }
2775 {
2778 }
2785 tree_int_cst_min_precision
2789 tree_int_cst_min_precision
2793 }
2796 {
2800 }
2801 else
2802 {
2803 /* Non-bit-fields are aligned for their type. */
2807 }
2808 }
2810 /* FIELD is a non bit-field. We are finishing the processing for its
2811 enclosing type T. Issue any appropriate messages and set appropriate
2812 flags. */
2814 static void
2816 tree t,
2820 {
2823 /* An anonymous union cannot contain any fields which would change
2824 the settings of CANT_HAVE_CONST_CTOR and friends. */
2826 ;
2827 /* And, we don't set TYPE_HAS_CONST_INIT_REF, etc., for anonymous
2828 structs. So, we recurse through their fields here. */
2830 {
2831 tree fields;
2837 }
2838 /* Check members with class type for constructors, destructors,
2839 etc. */
2841 {
2842 /* Never let anything with uninheritable virtuals
2843 make it through without complaint. */
2847 {
2850 field);
2855 field);
2856 }
2857 else
2858 {
2865 }
2872 }
2874 {
2875 /* `build_class_init_list' does not recognize
2876 non-FIELD_DECLs. */
2880 }
2881 }
2883 /* Check the data members (both static and non-static), class-scoped
2884 typedefs, etc., appearing in the declaration of T. Issue
2885 appropriate diagnostics. Sets ACCESS_DECLS to a list (in
2886 declaration order) of access declarations; each TREE_VALUE in this
2887 list is a USING_DECL.
2889 In addition, set the following flags:
2891 EMPTY_P
2892 The class is empty, i.e., contains no non-static data members.
2894 CANT_HAVE_CONST_CTOR_P
2895 This class cannot have an implicitly generated copy constructor
2896 taking a const reference.
2898 CANT_HAVE_CONST_ASN_REF
2899 This class cannot have an implicitly generated assignment
2900 operator taking a const reference.
2902 All of these flags should be initialized before calling this
2903 function.
2905 Returns a pointer to the end of the TYPE_FIELDs chain; additional
2906 fields can be added by adding to this chain. */
2908 static void
2912 {
2920 /* Assume there are no access declarations. */
2922 /* Assume this class has no pointer members. */
2924 /* Assume none of the members of this class have default
2925 initializations. */
2929 {
2937 {
2938 /* Prune the access declaration from the list of fields. */
2941 /* Save the access declarations for our caller. */
2944 /* Since we've reset *FIELD there's no reason to skip to the
2945 next field. */
2948 }
2954 /* If we've gotten this far, it's a data member, possibly static,
2955 or an enumerator. */
2958 /* When this goes into scope, it will be a non-local reference. */
2962 {
2963 /* [class.union]
2965 If a union contains a static data member, or a member of
2966 reference type, the program is ill-formed. */
2968 {
2971 }
2973 {
2978 }
2979 }
2981 /* Perform error checking that did not get done in
2982 grokdeclarator. */
2984 {
2988 }
2990 {
2994 }
3002 /* Now it can only be a FIELD_DECL. */
3007 /* A standard-layout class is a class that:
3008 ...
3009 has the same access control (Clause 11) for all non-static data members,
3010 ... */
3017 /* If this is of reference type, check if it needs an init. */
3019 {
3025 /* ARM $12.6.2: [A member initializer list] (or, for an
3026 aggregate, initialization by a brace-enclosed list) is the
3027 only way to initialize nonstatic const and reference
3028 members. */
3030 }
3035 {
3037 {
3038 warning
3041 x);
3043 }
3047 }
3050 /* We don't treat zero-width bitfields as making a class
3051 non-empty. */
3052 ;
3053 else
3054 {
3055 /* The class is non-empty. */
3057 /* The class is not even nearly empty. */
3059 /* If one of the data members contains an empty class,
3060 so does T. */
3064 }
3066 /* This is used by -Weffc++ (see below). Warn only for pointers
3067 to members which might hold dynamic memory. So do not warn
3068 for pointers to functions or pointers to members. */
3075 {
3080 }
3086 /* DR 148 now allows pointers to members (which are POD themselves),
3087 to be allowed in POD structs. */
3096 /* If any field is const, the structure type is pseudo-const. */
3098 {
3103 /* ARM $12.6.2: [A member initializer list] (or, for an
3104 aggregate, initialization by a brace-enclosed list) is the
3105 only way to initialize nonstatic const and reference
3106 members. */
3108 }
3109 /* A field that is pseudo-const makes the structure likewise. */
3111 {
3116 }
3118 /* Core issue 80: A nonstatic data member is required to have a
3119 different name from the class iff the class has a
3120 user-declared constructor. */
3125 /* We set DECL_C_BIT_FIELD in grokbitfield.
3126 If the type and width are valid, we'll also set DECL_BIT_FIELD. */
3129 cant_have_const_ctor_p,
3130 no_const_asn_ref_p,
3132 }
3134 /* Effective C++ rule 11: if a class has dynamic memory held by pointers,
3135 it should also define a copy constructor and an assignment operator to
3136 implement the correct copy semantic (deep vs shallow, etc.). As it is
3137 not feasible to check whether the constructors do allocate dynamic memory
3138 and store it within members, we approximate the warning like this:
3140 -- Warn only if there are members which are pointers
3141 -- Warn only if there is a non-trivial constructor (otherwise,
3142 there cannot be memory allocated).
3143 -- Warn only if there is a non-trivial destructor. We assume that the
3144 user at least implemented the cleanup correctly, and a destructor
3145 is needed to free dynamic memory.
3147 This seems enough for practical purposes. */
3149 && has_pointers
3153 {
3157 {
3162 }
3166 }
3168 /* If any of the fields couldn't be packed, unset TYPE_PACKED. */
3172 /* Check anonymous struct/anonymous union fields. */
3175 /* We've built up the list of access declarations in reverse order.
3176 Fix that now. */
3178 }
3180 /* If TYPE is an empty class type, records its OFFSET in the table of
3181 OFFSETS. */
3183 static int
3185 {
3186 splay_tree_node n;
3191 /* Record the location of this empty object in OFFSETS. */
3199 type,
3203 }
3205 /* Returns nonzero if TYPE is an empty class type and there is
3206 already an entry in OFFSETS for the same TYPE as the same OFFSET. */
3208 static int
3210 {
3211 splay_tree_node n;
3212 tree t;
3217 /* Record the location of this empty object in OFFSETS. */
3227 }
3229 /* Walk through all the subobjects of TYPE (located at OFFSET). Call
3230 F for every subobject, passing it the type, offset, and table of
3231 OFFSETS. If VBASES_P is one, then virtual non-primary bases should
3232 be traversed.
3234 If MAX_OFFSET is non-NULL, then subobjects with an offset greater
3235 than MAX_OFFSET will not be walked.
3237 If F returns a nonzero value, the traversal ceases, and that value
3238 is returned. Otherwise, returns zero. */
3240 static int
3242 subobject_offset_fn f,
3243 tree offset,
3244 splay_tree offsets,
3245 tree max_offset,
3247 {
3251 /* If this OFFSET is bigger than the MAX_OFFSET, then we should
3252 stop. */
3260 {
3264 }
3267 {
3268 tree field;
3269 tree binfo;
3272 /* Avoid recursing into objects that are not interesting. */
3276 /* Record the location of TYPE. */
3281 /* Iterate through the direct base classes of TYPE. */
3285 {
3286 tree binfo_offset;
3299 offset,
3301 else
3302 {
3303 tree orig_binfo;
3304 /* We cannot rely on BINFO_OFFSET being set for the base
3305 class yet, but the offsets for direct non-virtual
3306 bases can be calculated by going back to the TYPE. */
3309 offset,
3311 }
3314 f,
3315 binfo_offset,
3316 offsets,
3317 max_offset,
3322 }
3325 {
3329 /* Iterate through the virtual base classes of TYPE. In G++
3330 3.2, we included virtual bases in the direct base class
3331 loop above, which results in incorrect results; the
3332 correct offsets for virtual bases are only known when
3333 working with the most derived type. */
3337 {
3339 f,
3341 offset,
3343 offsets,
3344 max_offset,
3348 }
3349 else
3350 {
3351 /* We still have to walk the primary base, if it is
3352 virtual. (If it is non-virtual, then it was walked
3353 above.) */
3359 {
3360 r = (walk_subobject_offsets
3365 }
3366 }
3367 }
3369 /* Iterate through the fields of TYPE. */
3372 {
3373 tree field_offset;
3377 else
3378 /* In G++ 3.2, DECL_FIELD_OFFSET was used. */
3382 f,
3384 offset,
3385 field_offset),
3386 offsets,
3387 max_offset,
3391 }
3392 }
3394 {
3397 tree index;
3399 /* Avoid recursing into objects that are not interesting. */
3404 /* Step through each of the elements in the array. */
3406 /* G++ 3.2 had an off-by-one error here. */
3411 {
3413 f,
3414 offset,
3415 offsets,
3416 max_offset,
3422 /* If this new OFFSET is bigger than the MAX_OFFSET, then
3423 there's no point in iterating through the remaining
3424 elements of the array. */
3427 }
3428 }
3431 }
3433 /* Record all of the empty subobjects of TYPE (either a type or a
3434 binfo). If IS_DATA_MEMBER is true, then a non-static data member
3435 is being placed at OFFSET; otherwise, it is a base class that is
3436 being placed at OFFSET. */
3438 static void
3440 tree offset,
3441 splay_tree offsets,
3443 {
3444 tree max_offset;
3445 /* If recording subobjects for a non-static data member or a
3446 non-empty base class , we do not need to record offsets beyond
3447 the size of the biggest empty class. Additional data members
3448 will go at the end of the class. Additional base classes will go
3449 either at offset zero (if empty, in which case they cannot
3450 overlap with offsets past the size of the biggest empty class) or
3451 at the end of the class.
3453 However, if we are placing an empty base class, then we must record
3454 all offsets, as either the empty class is at offset zero (where
3455 other empty classes might later be placed) or at the end of the
3456 class (where other objects might then be placed, so other empty
3457 subobjects might later overlap). */
3461 else
3465 }
3467 /* Returns nonzero if any of the empty subobjects of TYPE (located at
3468 OFFSET) conflict with entries in OFFSETS. If VBASES_P is nonzero,
3469 virtual bases of TYPE are examined. */
3471 static int
3473 tree offset,
3474 splay_tree offsets,
3476 {
3477 splay_tree_node max_node;
3479 /* Get the node in OFFSETS that indicates the maximum offset where
3480 an empty subobject is located. */
3482 /* If there aren't any empty subobjects, then there's no point in
3483 performing this check. */
3489 vbases_p);
3490 }
3492 /* DECL is a FIELD_DECL corresponding either to a base subobject of a
3493 non-static data member of the type indicated by RLI. BINFO is the
3494 binfo corresponding to the base subobject, OFFSETS maps offsets to
3495 types already located at those offsets. This function determines
3496 the position of the DECL. */
3498 static void
3500 tree decl,
3501 tree binfo,
3502 splay_tree offsets)
3503 {
3506 tree type;
3509 {
3510 /* For the purposes of determining layout conflicts, we want to
3511 use the class type of BINFO; TREE_TYPE (DECL) will be the
3512 CLASSTYPE_AS_BASE version, which does not contain entries for
3513 zero-sized bases. */
3516 }
3517 else
3518 {
3521 }
3523 /* Try to place the field. It may take more than one try if we have
3524 a hard time placing the field without putting two objects of the
3525 same type at the same address. */
3527 {
3530 /* Place this field. */
3534 /* We have to check to see whether or not there is already
3535 something of the same type at the offset we're about to use.
3536 For example, consider:
3538 struct S {};
3539 struct T : public S { int i; };
3540 struct U : public S, public T {};
3542 Here, we put S at offset zero in U. Then, we can't put T at
3543 offset zero -- its S component would be at the same address
3544 as the S we already allocated. So, we have to skip ahead.
3545 Since all data members, including those whose type is an
3546 empty class, have nonzero size, any overlap can happen only
3547 with a direct or indirect base-class -- it can't happen with
3548 a data member. */
3549 /* In a union, overlap is permitted; all members are placed at
3550 offset zero. */
3553 /* G++ 3.2 did not check for overlaps when placing a non-empty
3554 virtual base. */
3559 {
3560 /* Strip off the size allocated to this field. That puts us
3561 at the first place we could have put the field with
3562 proper alignment. */
3565 /* Bump up by the alignment required for the type. */
3566 rli->bitpos
3572 }
3573 else
3574 /* There was no conflict. We're done laying out this field. */
3576 }
3578 /* Now that we know where it will be placed, update its
3579 BINFO_OFFSET. */
3581 /* Indirect virtual bases may have a nonzero BINFO_OFFSET at
3582 this point because their BINFO_OFFSET is copied from another
3583 hierarchy. Therefore, we may not need to add the entire
3584 OFFSET. */
3590 }
3592 /* Returns true if TYPE is empty and OFFSET is nonzero. */
3594 static int
3596 tree offset,
3597 splay_tree offsets ATTRIBUTE_UNUSED)
3598 {
3600 }
3602 /* Layout the empty base BINFO. EOC indicates the byte currently just
3603 past the end of the class, and should be correctly aligned for a
3604 class of the type indicated by BINFO; OFFSETS gives the offsets of
3605 the empty bases allocated so far. T is the most derived
3606 type. Return nonzero iff we added it at the end. */
3608 static bool
3611 {
3612 tree alignment;
3616 /* This routine should only be used for empty classes. */
3621 {
3623 propagate_binfo_offsets
3626 else
3628 "offset of empty base %qT may not be ABI-compliant and may"
3631 }
3633 /* This is an empty base class. We first try to put it at offset
3634 zero. */
3637 offsets,
3639 {
3640 /* That didn't work. Now, we move forward from the next
3641 available spot in the class. */
3645 {
3648 offsets,
3650 /* We finally found a spot where there's no overlap. */
3653 /* There's overlap here, too. Bump along to the next spot. */
3655 }
3656 }
3659 {
3664 }
3667 }
3669 /* Layout the base given by BINFO in the class indicated by RLI.
3670 *BASE_ALIGN is a running maximum of the alignments of
3671 any base class. OFFSETS gives the location of empty base
3672 subobjects. T is the most derived type. Return nonzero if the new
3673 object cannot be nearly-empty. A new FIELD_DECL is inserted at
3674 *NEXT_FIELD, unless BINFO is for an empty base class.
3676 Returns the location at which the next field should be inserted. */
3681 {
3686 /* This error is now reported in xref_tag, thus giving better
3687 location information. */
3690 /* Place the base class. */
3692 {
3693 tree decl;
3695 /* The containing class is non-empty because it has a non-empty
3696 base class. */
3699 /* Create the FIELD_DECL. */
3706 {
3714 /* Try to place the field. It may take more than one try if we
3715 have a hard time placing the field without putting two
3716 objects of the same type at the same address. */
3718 /* Add the new FIELD_DECL to the list of fields for T. */
3722 }
3723 }
3724 else
3725 {
3726 tree eoc;
3729 /* On some platforms (ARM), even empty classes will not be
3730 byte-aligned. */
3735 /* A nearly-empty class "has no proper base class that is empty,
3736 not morally virtual, and at an offset other than zero." */
3738 {
3741 /* The check above (used in G++ 3.2) is insufficient because
3742 an empty class placed at offset zero might itself have an
3743 empty base at a nonzero offset. */
3745 empty_base_at_nonzero_offset_p,
3746 size_zero_node,
3750 {
3753 else
3755 "class %qT will be considered nearly empty in a "
3757 }
3758 }
3760 /* We do not create a FIELD_DECL for empty base classes because
3761 it might overlap some other field. We want to be able to
3762 create CONSTRUCTORs for the class by iterating over the
3763 FIELD_DECLs, and the back end does not handle overlapping
3764 FIELD_DECLs. */
3766 /* An empty virtual base causes a class to be non-empty
3767 -- but in that case we do not need to clear CLASSTYPE_EMPTY_P
3768 here because that was already done when the virtual table
3769 pointer was created. */
3770 }
3772 /* Record the offsets of BINFO and its base subobjects. */
3775 offsets,
3779 }
3781 /* Layout all of the non-virtual base classes. Record empty
3782 subobjects in OFFSETS. T is the most derived type. Return nonzero
3783 if the type cannot be nearly empty. The fields created
3784 corresponding to the base classes will be inserted at
3785 *NEXT_FIELD. */
3787 static void
3790 {
3791 /* Chain to hold all the new FIELD_DECLs which stand in for base class
3792 subobjects. */
3797 /* The primary base class is always allocated first. */
3802 /* Now allocate the rest of the bases. */
3804 {
3805 tree base_binfo;
3809 /* The primary base was already allocated above, so we don't
3810 need to allocate it again here. */
3814 /* Virtual bases are added at the end (a primary virtual base
3815 will have already been added). */
3821 }
3822 }
3824 /* Go through the TYPE_METHODS of T issuing any appropriate
3825 diagnostics, figuring out which methods override which other
3826 methods, and so forth. */
3828 static void
3830 {
3831 tree x;
3834 {
3838 /* The name of the field is the original field name
3839 Save this in auxiliary field for later overloading. */
3841 {
3845 }
3846 /* All user-provided destructors are non-trivial. */
3849 }
3850 }
3852 /* FN is a constructor or destructor. Clone the declaration to create
3853 a specialized in-charge or not-in-charge version, as indicated by
3854 NAME. */
3856 static tree
3858 {
3859 tree parms;
3860 tree clone;
3862 /* Copy the function. */
3864 /* Reset the function name. */
3867 /* Remember where this function came from. */
3869 /* Make it easy to find the CLONE given the FN. */
3873 /* If this is a template, do the rest on the DECL_TEMPLATE_RESULT. */
3875 {
3882 }
3885 /* There's no pending inline data for this function. */
3889 /* The base-class destructor is not virtual. */
3891 {
3895 }
3897 /* If there was an in-charge parameter, drop it from the function
3898 type. */
3900 {
3901 tree basetype;
3902 tree parmtypes;
3903 tree exceptions;
3908 /* Skip the `this' parameter. */
3910 /* Skip the in-charge parameter. */
3912 /* And the VTT parm, in a complete [cd]tor. */
3916 /* If this is subobject constructor or destructor, add the vtt
3917 parameter. */
3921 parmtypes);
3924 exceptions);
3928 }
3930 /* Copy the function parameters. */
3932 /* Remove the in-charge parameter. */
3934 {
3938 }
3939 /* And the VTT parm, in a complete [cd]tor. */
3941 {
3944 else
3945 {
3949 }
3950 }
3953 {
3956 }
3958 /* Create the RTL for this function. */
3966 }
3968 /* Implementation of DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P, do
3969 not invoke this function directly.
3971 For a non-thunk function, returns the address of the slot for storing
3972 the function it is a clone of. Otherwise returns NULL_TREE.
3974 If JUST_TESTING, looks through TEMPLATE_DECL and returns NULL if
3975 cloned_function is unset. This is to support the separate
3976 DECL_CLONED_FUNCTION and DECL_CLONED_FUNCTION_P modes; using the latter
3977 on a template makes sense, but not the former. */
3979 tree *
3981 {
3989 {
3990 #if defined ENABLE_TREE_CHECKING && (GCC_VERSION >= 2007)
3993 else
3994 #endif
3996 }
4001 else
4003 }
4005 /* Produce declarations for all appropriate clones of FN. If
4006 UPDATE_METHOD_VEC_P is nonzero, the clones are added to the
4007 CLASTYPE_METHOD_VEC as well. */
4009 void
4011 {
4012 tree clone;
4014 /* Avoid inappropriate cloning. */
4020 {
4021 /* For each constructor, we need two variants: an in-charge version
4022 and a not-in-charge version. */
4029 }
4030 else
4031 {
4034 /* For each destructor, we need three variants: an in-charge
4035 version, a not-in-charge version, and an in-charge deleting
4036 version. We clone the deleting version first because that
4037 means it will go second on the TYPE_METHODS list -- and that
4038 corresponds to the correct layout order in the virtual
4039 function table.
4041 For a non-virtual destructor, we do not build a deleting
4042 destructor. */
4044 {
4048 }
4055 }
4057 /* Note that this is an abstract function that is never emitted. */
4059 }
4061 /* DECL is an in charge constructor, which is being defined. This will
4062 have had an in class declaration, from whence clones were
4063 declared. An out-of-class definition can specify additional default
4064 arguments. As it is the clones that are involved in overload
4065 resolution, we must propagate the information from the DECL to its
4066 clones. */
4068 void
4070 {
4071 tree clone;
4075 {
4082 /* Skip the 'this' parameter. */
4098 {
4103 {
4104 /* A default parameter has been added. Adjust the
4105 clone's parameters. */
4109 tree type;
4114 {
4117 clone_parms);
4119 }
4122 clone_parms);
4131 }
4132 }
4134 }
4135 }
4137 /* For each of the constructors and destructors in T, create an
4138 in-charge and not-in-charge variant. */
4140 static void
4142 {
4143 tree fns;
4145 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
4146 out now. */
4154 }
4156 /* Returns true iff class T has a user-defined constructor other than
4157 the default constructor. */
4159 bool
4161 {
4162 tree fns;
4168 {
4175 }
4178 }
4180 /* Returns true iff FN is a user-provided function, i.e. user-declared
4181 and not defaulted at its first declaration; or explicit, private,
4182 protected, or non-const. */
4184 bool
4186 {
4189 else
4192 }
4194 /* Returns true iff class T has a user-provided constructor. */
4196 bool
4198 {
4199 tree fns;
4207 /* This can happen in error cases; avoid crashing. */
4216 }
4218 /* Returns true iff class T has a user-provided default constructor. */
4220 bool
4222 {
4229 {
4233 {
4239 }
4240 }
4243 }
4245 /* Remove all zero-width bit-fields from T. */
4247 static void
4249 {
4254 {
4259 else
4261 }
4262 }
4264 /* Returns TRUE iff we need a cookie when dynamically allocating an
4265 array whose elements have the indicated class TYPE. */
4267 static bool
4269 {
4270 tree fns;
4275 /* If there's a non-trivial destructor, we need a cookie. In order
4276 to iterate through the array calling the destructor for each
4277 element, we'll have to know how many elements there are. */
4281 /* If the usual deallocation function is a two-argument whose second
4282 argument is of type `size_t', then we have to pass the size of
4283 the array to the deallocation function, so we will need to store
4284 a cookie. */
4288 /* If there are no `operator []' members, or the lookup is
4289 ambiguous, then we don't need a cookie. */
4292 /* Loop through all of the functions. */
4294 {
4295 tree fn;
4296 tree second_parm;
4298 /* Select the current function. */
4300 /* See if this function is a one-argument delete function. If
4301 it is, then it will be the usual deallocation function. */
4305 /* Do not consider this function if its second argument is an
4306 ellipsis. */
4309 /* Otherwise, if we have a two-argument function and the second
4310 argument is `size_t', it will be the usual deallocation
4311 function -- unless there is one-argument function, too. */
4315 }
4318 }
4320 /* Check the validity of the bases and members declared in T. Add any
4321 implicitly-generated functions (like copy-constructors and
4322 assignment operators). Compute various flag bits (like
4323 CLASSTYPE_NON_LAYOUT_POD_T) for T. This routine works purely at the C++
4324 level: i.e., independently of the ABI in use. */
4326 static void
4328 {
4329 /* Nonzero if the implicitly generated copy constructor should take
4330 a non-const reference argument. */
4332 /* Nonzero if the implicitly generated assignment operator
4333 should take a non-const reference argument. */
4335 tree access_decls;
4338 tree fn;
4340 /* By default, we use const reference arguments and generate default
4341 constructors. */
4345 /* Check all the base-classes. */
4349 /* Check all the method declarations. */
4352 /* Save the initial values of these flags which only indicate whether
4353 or not the class has user-provided functions. As we analyze the
4354 bases and members we can set these flags for other reasons. */
4358 /* Check all the data member declarations. We cannot call
4359 check_field_decls until we have called check_bases check_methods,
4360 as check_field_decls depends on TYPE_HAS_NONTRIVIAL_DESTRUCTOR
4361 being set appropriately. */
4366 /* A nearly-empty class has to be vptr-containing; a nearly empty
4367 class contains just a vptr. */
4371 /* Do some bookkeeping that will guide the generation of implicitly
4372 declared member functions. */
4374 /* We need to call a constructor for this class if it has a
4375 user-provided constructor, or if the default constructor is going
4376 to initialize the vptr. (This is not an if-and-only-if;
4377 TYPE_NEEDS_CONSTRUCTING is set elsewhere if bases or members
4378 themselves need constructing.) */
4381 /* [dcl.init.aggr]
4383 An aggregate is an array or a class with no user-provided
4384 constructors ... and no virtual functions.
4386 Again, other conditions for being an aggregate are checked
4387 elsewhere. */
4390 /* This is the C++98/03 definition of POD; it changed in C++0x, but we
4391 retain the old definition internally for ABI reasons. */
4399 /* If the class has no user-declared constructor, but does have
4400 non-static const or reference data members that can never be
4401 initialized, issue a warning. */
4403 /* Classes with user-declared constructors are presumed to
4404 initialize these members. */
4406 /* Aggregates can be initialized with brace-enclosed
4407 initializers. */
4409 {
4410 tree field;
4413 {
4414 tree type;
4428 }
4429 }
4431 /* Synthesize any needed methods. */
4433 cant_have_const_ctor,
4434 no_const_asn_ref);
4436 /* Check defaulted declarations here so we have cant_have_const_ctor
4437 and don't need to worry about clones. */
4440 {
4443 {
4444 bool imp_const_p
4450 /* If the function is defaulted outside the class, we just
4451 give the synthesis error. */
4457 }
4459 }
4462 {
4463 /* "The closure type associated with a lambda-expression has a deleted
4464 default constructor and a deleted copy assignment operator." */
4471 /* "This class type is not an aggregate." */
4473 }
4475 /* Create the in-charge and not-in-charge variants of constructors
4476 and destructors. */
4479 /* Process the using-declarations. */
4483 /* Build and sort the CLASSTYPE_METHOD_VEC. */
4486 /* Figure out whether or not we will need a cookie when dynamically
4487 allocating an array of this type. */
4490 }
4492 /* If T needs a pointer to its virtual function table, set TYPE_VFIELD
4493 accordingly. If a new vfield was created (because T doesn't have a
4494 primary base class), then the newly created field is returned. It
4495 is not added to the TYPE_FIELDS list; it is the caller's
4496 responsibility to do that. Accumulate declared virtual functions
4497 on VIRTUALS_P. */
4499 static tree
4501 {
4502 tree fn;
4504 /* Collect the virtual functions declared in T. */
4508 {
4517 }
4519 /* If we couldn't find an appropriate base class, create a new field
4520 here. Even if there weren't any new virtual functions, we might need a
4521 new virtual function table if we're supposed to include vptrs in
4522 all classes that need them. */
4524 {
4525 /* We build this decl with vtbl_ptr_type_node, which is a
4526 `vtable_entry_type*'. It might seem more precise to use
4527 `vtable_entry_type (*)[N]' where N is the number of virtual
4528 functions. However, that would require the vtable pointer in
4529 base classes to have a different type than the vtable pointer
4530 in derived classes. We could make that happen, but that
4531 still wouldn't solve all the problems. In particular, the
4532 type-based alias analysis code would decide that assignments
4533 to the base class vtable pointer can't alias assignments to
4534 the derived class vtable pointer, since they have different
4535 types. Thus, in a derived class destructor, where the base
4536 class constructor was inlined, we could generate bad code for
4537 setting up the vtable pointer.
4539 Therefore, we use one type for all vtable pointers. We still
4540 use a type-correct type; it's just doesn't indicate the array
4541 bounds. That's better than using `void*' or some such; it's
4542 cleaner, and it let's the alias analysis code know that these
4543 stores cannot alias stores to void*! */
4544 tree field;
4555 /* This class is non-empty. */
4559 }
4562 }
4564 /* Add OFFSET to all base types of BINFO which is a base in the
4565 hierarchy dominated by T.
4567 OFFSET, which is a type offset, is number of bytes. */
4569 static void
4571 {
4573 tree primary_binfo;
4574 tree base_binfo;
4576 /* Update BINFO's offset. */
4581 offset));
4583 /* Find the primary base class. */
4589 /* Scan all of the bases, pushing the BINFO_OFFSET adjust
4590 downwards. */
4592 {
4593 /* Don't do the primary base twice. */
4601 }
4602 }
4604 /* Set BINFO_OFFSET for all of the virtual bases for RLI->T. Update
4605 TYPE_ALIGN and TYPE_SIZE for T. OFFSETS gives the location of
4606 empty subobjects of T. */
4608 static void
4610 {
4611 tree vbase;
4620 {
4621 /* In G++ 3.2, we incorrectly rounded the size before laying out
4622 the virtual bases. */
4624 #ifdef STRUCTURE_SIZE_BOUNDARY
4625 /* Packed structures don't need to have minimum size. */
4628 #endif
4632 }
4634 /* Find the last field. The artificial fields created for virtual
4635 bases will go after the last extant field to date. */
4640 /* Go through the virtual bases, allocating space for each virtual
4641 base that is not already a primary base class. These are
4642 allocated in inheritance graph order. */
4644 {
4649 {
4652 /* This virtual base is not a primary base of any class in the
4653 hierarchy, so we have to add space for it. */
4657 /* If the first virtual base might have been placed at a
4658 lower address, had we started from CLASSTYPE_SIZE, rather
4659 than TYPE_SIZE, issue a warning. There can be both false
4660 positives and false negatives from this warning in rare
4661 cases; to deal with all the possibilities would probably
4662 require performing both layout algorithms and comparing
4663 the results which is not particularly tractable. */
4665 && first_vbase
4666 && (tree_int_cst_lt
4671 bitsize_unit_node),
4674 "offset of virtual base %qT is not ABI-compliant and "
4676 basetype);
4679 }
4680 }
4681 }
4683 /* Returns the offset of the byte just past the end of the base class
4684 BINFO. */
4686 static tree
4688 {
4689 tree size;
4694 /* An empty class has zero CLASSTYPE_SIZE_UNIT, but we need to
4695 allocate some space for it. It cannot have virtual bases, so
4696 TYPE_SIZE_UNIT is fine. */
4698 else
4702 }
4704 /* Returns the offset of the byte just past the end of the base class
4705 with the highest offset in T. If INCLUDE_VIRTUALS_P is zero, then
4706 only non-virtual bases are included. */
4708 static tree
4710 {
4713 tree binfo;
4714 tree base_binfo;
4715 tree offset;
4720 {
4730 }
4732 /* G++ 3.2 did not check indirect virtual bases. */
4736 {
4740 }
4743 }
4745 /* Warn about bases of T that are inaccessible because they are
4746 ambiguous. For example:
4748 struct S {};
4749 struct T : public S {};
4750 struct U : public S, public T {};
4752 Here, `(S*) new U' is not allowed because there are two `S'
4753 subobjects of U. */
4755 static void
4757 {
4760 tree basetype;
4761 tree binfo;
4762 tree base_binfo;
4764 /* If there are no repeated bases, nothing can be ambiguous. */
4768 /* Check direct bases. */
4771 {
4777 }
4779 /* Check for ambiguous virtual bases. */
4783 {
4789 }
4790 }
4792 /* Compare two INTEGER_CSTs K1 and K2. */
4794 static int
4796 {
4798 }
4800 /* Increase the size indicated in RLI to account for empty classes
4801 that are "off the end" of the class. */
4803 static void
4805 {
4806 tree eoc;
4807 tree rli_size;
4809 /* It might be the case that we grew the class to allocate a
4810 zero-sized base class. That won't be reflected in RLI, yet,
4811 because we are willing to overlay multiple bases at the same
4812 offset. However, now we need to make sure that RLI is big enough
4813 to reflect the entire class. */
4819 {
4821 /* In version 1 of the ABI, the size of a class that ends with
4822 a bitfield was not rounded up to a whole multiple of a
4823 byte. Because rli_size_unit_so_far returns only the number
4824 of fully allocated bytes, any extra bits were not included
4825 in the size. */
4827 else
4828 /* The size should have been rounded to a whole byte. */
4831 rli->bitpos
4840 }
4841 }
4843 /* Calculate the TYPE_SIZE, TYPE_ALIGN, etc for T. Calculate
4844 BINFO_OFFSETs for all of the base-classes. Position the vtable
4845 pointer. Accumulate declared virtual functions on VIRTUALS_P. */
4847 static void
4849 {
4850 tree non_static_data_members;
4851 tree field;
4852 tree vptr;
4853 record_layout_info rli;
4854 /* Maps offsets (represented as INTEGER_CSTs) to a TREE_LIST of
4855 types that appear at that offset. */
4856 splay_tree empty_base_offsets;
4857 /* True if the last field layed out was a bit-field. */
4859 /* The location at which the next field should be inserted. */
4861 /* T, as a base class. */
4862 tree base_t;
4864 /* Keep track of the first non-static data member. */
4867 /* Start laying out the record. */
4870 /* Mark all the primary bases in the hierarchy. */
4873 /* Create a pointer to our virtual function table. */
4876 /* The vptr is always the first thing in the class. */
4878 {
4883 }
4884 else
4887 /* Build FIELD_DECLs for all of the non-virtual base-types. */
4892 /* Layout the non-static data members. */
4894 {
4895 tree type;
4896 tree padding;
4898 /* We still pass things that aren't non-static data members to
4899 the back end, in case it wants to do something with them. */
4901 {
4903 /* If the static data member has incomplete type, keep track
4904 of it so that it can be completed later. (The handling
4905 of pending statics in finish_record_layout is
4906 insufficient; consider:
4908 struct S1;
4909 struct S2 { static S1 s1; };
4911 At this point, finish_record_layout will be called, but
4912 S1 is still incomplete.) */
4914 {
4916 /* The visibility of static data members is determined
4917 at their point of declaration, not their point of
4918 definition. */
4920 }
4922 }
4930 /* If this field is a bit-field whose width is greater than its
4931 type, then there are some special rules for allocating
4932 it. */
4935 {
4937 tree integer_type;
4939 /* We must allocate the bits as if suitably aligned for the
4940 longest integer type that fits in this many bits. type
4941 of the field. Then, we are supposed to use the left over
4942 bits as additional padding. */
4948 /* ITK now indicates a type that is too large for the
4949 field. We have to back up by one to find the largest
4950 type that fits. */
4953 /* Figure out how much additional padding is required. GCC
4954 3.2 always created a padding field, even if it had zero
4955 width. */
4958 {
4960 /* In a union, the padding field must have the full width
4961 of the bit-field; all fields start at offset zero. */
4963 else
4964 {
4967 "ABI-compliant and may change in a future "
4969 t);
4972 }
4973 }
4974 #ifdef PCC_BITFIELD_TYPE_MATTERS
4975 /* An unnamed bitfield does not normally affect the
4976 alignment of the containing class on a target where
4977 PCC_BITFIELD_TYPE_MATTERS. But, the C++ ABI does not
4978 make any exceptions for unnamed bitfields when the
4979 bitfields are longer than their types. Therefore, we
4980 temporarily give the field a name. */
4982 {
4985 }
4986 #endif
4991 empty_base_offsets);
4994 /* Now that layout has been performed, set the size of the
4995 field to the size of its declared type; the rest of the
4996 field is effectively invisible. */
4998 /* We must also reset the DECL_MODE of the field. */
5003 /* Versions of G++ before G++ 3.4 did not reset the
5004 DECL_MODE. */
5006 "the offset of %qD may not be ABI-compliant and may "
5008 }
5009 else
5011 empty_base_offsets);
5013 /* Remember the location of any empty classes in FIELD. */
5017 empty_base_offsets,
5020 /* If a bit-field does not immediately follow another bit-field,
5021 and yet it starts in the middle of a byte, we have failed to
5022 comply with the ABI. */
5025 /* The TREE_NO_WARNING flag gets set by Objective-C when
5026 laying out an Objective-C class. The ObjC ABI differs
5027 from the C++ ABI, and so we do not want a warning
5028 here. */
5030 && !last_field_was_bitfield
5033 bitsize_unit_node)))
5037 /* G++ used to use DECL_FIELD_OFFSET as if it were the byte
5038 offset of the field. */
5044 "classes to be placed at different locations in a "
5047 /* The middle end uses the type of expressions to determine the
5048 possible range of expression values. In order to optimize
5049 "x.i > 7" to "false" for a 2-bit bitfield "i", the middle end
5050 must be made aware of the width of "i", via its type.
5052 Because C++ does not have integer types of arbitrary width,
5053 we must (for the purposes of the front end) convert from the
5054 type assigned here to the declared type of the bitfield
5055 whenever a bitfield expression is used as an rvalue.
5056 Similarly, when assigning a value to a bitfield, the value
5057 must be converted to the type given the bitfield here. */
5059 {
5064 {
5071 }
5072 }
5074 /* If we needed additional padding after this field, add it
5075 now. */
5077 {
5078 tree padding_field;
5081 FIELD_DECL,
5082 NULL_TREE,
5083 char_type_node);
5090 NULL_TREE,
5091 empty_base_offsets);
5092 }
5095 }
5098 {
5099 /* Make sure that we are on a byte boundary so that the size of
5100 the class without virtual bases will always be a round number
5101 of bytes. */
5104 }
5106 /* G++ 3.2 does not allow virtual bases to be overlaid with tail
5107 padding. */
5111 /* Delete all zero-width bit-fields from the list of fields. Now
5112 that the type is laid out they are no longer important. */
5115 /* Create the version of T used for virtual bases. We do not use
5116 make_class_type for this version; this is an artificial type. For
5117 a POD type, we just reuse T. */
5119 {
5122 /* Set the size and alignment for the new type. In G++ 3.2, all
5123 empty classes were considered to have size zero when used as
5124 base classes. */
5126 {
5131 "layout of classes derived from empty class %qT "
5133 t);
5134 }
5135 else
5136 {
5137 tree eoc;
5139 /* If the ABI version is not at least two, and the last
5140 field was a bit-field, RLI may not be on a byte
5141 boundary. In particular, rli_size_unit_so_far might
5142 indicate the last complete byte, while rli_size_so_far
5143 indicates the total number of bits used. Therefore,
5144 rli_size_so_far, rather than rli_size_unit_so_far, is
5145 used to compute TYPE_SIZE_UNIT. */
5153 eoc);
5160 }
5164 /* Copy the fields from T. */
5168 {
5170 FIELD_DECL,
5180 }
5182 /* Record the base version of the type. */
5185 }
5186 else
5189 /* Every empty class contains an empty class. */
5193 /* Set the TYPE_DECL for this type to contain the right
5194 value for DECL_OFFSET, so that we can use it as part
5195 of a COMPONENT_REF for multiple inheritance. */
5198 /* Now fix up any virtual base class types that we left lying
5199 around. We must get these done before we try to lay out the
5200 virtual function table. As a side-effect, this will remove the
5201 base subobject fields. */
5204 /* Make sure that empty classes are reflected in RLI at this
5205 point. */
5208 /* Make sure not to create any structures with zero size. */
5214 /* Let the back end lay out the type. */
5217 /* Warn about bases that can't be talked about due to ambiguity. */
5220 /* Now that we're done with layout, give the base fields the real types. */
5225 /* Clean up. */
5232 }
5234 /* Determine the "key method" for the class type indicated by TYPE,
5235 and set CLASSTYPE_KEY_METHOD accordingly. */
5237 void
5239 {
5240 tree method;
5243 || processing_template_decl
5248 /* The key method is the first non-pure virtual function that is not
5249 inline at the point of class definition. On some targets the
5250 key function may not be inline; those targets should not call
5251 this function until the end of the translation unit. */
5257 {
5260 }
5263 }
5265 /* Perform processing required when the definition of T (a class type)
5266 is complete. */
5268 void
5270 {
5271 tree x;
5272 /* A TREE_LIST. The TREE_VALUE of each node is a FUNCTION_DECL. */
5277 {
5282 }
5284 /* If this type was previously laid out as a forward reference,
5285 make sure we lay it out again. */
5289 /* Make assumptions about the class; we'll reset the flags if
5290 necessary. */
5295 /* Do end-of-class semantic processing: checking the validity of the
5296 bases and members and add implicitly generated methods. */
5299 /* Find the key method. */
5301 {
5302 /* The Itanium C++ ABI permits the key method to be chosen when
5303 the class is defined -- even though the key method so
5304 selected may later turn out to be an inline function. On
5305 some systems (such as ARM Symbian OS) the key method cannot
5306 be determined until the end of the translation unit. On such
5307 systems, we leave CLASSTYPE_KEY_METHOD set to NULL, which
5308 will cause the class to be added to KEYED_CLASSES. Then, in
5309 finish_file we will determine the key method. */
5313 /* If a polymorphic class has no key method, we may emit the vtable
5314 in every translation unit where the class definition appears. */
5317 }
5319 /* Layout the class itself. */
5322 /* We use the base type for trivial assignments, and hence it
5323 needs a mode. */
5328 /* If necessary, create the primary vtable for this class. */
5330 {
5331 /* We must enter these virtuals into the table. */
5335 /* Here we know enough to change the type of our virtual
5336 function table, but we will wait until later this function. */
5338 }
5341 {
5343 tree fn;
5350 /* Add entries for virtual functions introduced by this class. */
5354 /* Set DECL_VINDEX for all functions declared in this class. */
5356 fn;
5358 vindex += (TARGET_VTABLE_USES_DESCRIPTORS
5360 {
5364 /* A thunk. We should never be calling this entry directly
5365 from this vtable -- we'd use the entry for the non
5366 thunk base function. */
5370 }
5371 }
5375 /* Complete the rtl for any static member objects of the type we're
5376 working on. */
5383 /* Done with FIELDS...now decide whether to sort these for
5384 faster lookups later.
5386 We use a small number because most searches fail (succeeding
5387 ultimately as the search bores through the inheritance
5388 hierarchy), and we want this failure to occur quickly. */
5392 {
5399 field_decl_cmp);
5401 }
5403 /* Complain if one of the field types requires lower visibility. */
5406 /* Make the rtl for any new vtables we have created, and unmark
5407 the base types we marked. */
5410 /* Build the VTT for T. */
5413 /* This warning does not make sense for Java classes, since they
5414 cannot have destructors. */
5416 {
5417 tree dtor;
5421 if it were virtual, we would have created it by now. */
5422 !dtor
5431 "%q#T has virtual functions and accessible"
5433 }
5440 /* Class layout, assignment of virtual table slots, etc., is now
5441 complete. Give the back end a chance to tweak the visibility of
5442 the class or perform any other required target modifications. */
5449 /* Finish debugging output for this type. */
5451 }
5453 /* When T was built up, the member declarations were added in reverse
5454 order. Rearrange them to declaration order. */
5456 void
5458 {
5459 tree next;
5460 tree prev;
5461 tree x;
5463 /* The following lists are all in reverse order. Put them in
5464 declaration order now. */
5468 /* Actually, for the TYPE_FIELDS, only the non TYPE_DECLs are in
5469 reverse order, so we can't just use nreverse. */
5474 {
5478 }
5480 {
5484 }
5485 }
5487 tree
5489 {
5492 /* Now that we've got all the field declarations, reverse everything
5493 as necessary. */
5498 /* Nadger the current location so that diagnostics point to the start of
5499 the struct, not the end. */
5503 {
5504 tree x;
5510 /* We need to emit an error message if this type was used as a parameter
5511 and it is an abstract type, even if it is a template. We construct
5512 a simple CLASSTYPE_PURE_VIRTUALS list without taking bases into
5513 account and we call complete_vars with this type, which will check
5514 the PARM_DECLS. Note that while the type is being defined,
5515 CLASSTYPE_PURE_VIRTUALS contains the list of the inline friends
5516 (see CLASSTYPE_INLINE_FRIENDS) so we need to clear it. */
5523 /* Remember current #pragma pack value. */
5525 }
5526 else
5535 else
5542 }
5543 \f
5544 /* Return the dynamic type of INSTANCE, if known.
5545 Used to determine whether the virtual function table is needed
5546 or not.
5548 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
5549 of our knowledge of its type. *NONNULL should be initialized
5550 before this function is called. */
5552 static tree
5554 {
5555 #define RECUR(T) fixed_type_or_null((T), nonnull, cdtorp)
5558 {
5562 else
5566 /* This is a call to a constructor, hence it's never zero. */
5568 {
5572 }
5576 /* This is a call to a constructor, hence it's never zero. */
5578 {
5582 }
5591 /* Propagate nonnull. */
5596 CASE_CONVERT:
5602 {
5603 /* Just because we see an ADDR_EXPR doesn't mean we're dealing
5604 with a real object -- given &p->f, p can still be null. */
5606 /* ??? Probably should check DECL_WEAK here. */
5609 }
5613 /* If this component is really a base class reference, then the field
5614 itself isn't definitive. */
5623 {
5627 }
5628 /* fall through... */
5633 {
5637 }
5639 {
5643 /* if we're in a ctor or dtor, we know our type. */
5647 {
5651 }
5652 }
5654 {
5655 /* We only need one hash table because it is always left empty. */
5659 htab_hash_pointer,
5660 htab_eq_pointer,
5663 /* Reference variables should be references to objects. */
5667 /* Enter the INSTANCE in a table to prevent recursion; a
5668 variable's initializer may refer to the variable
5669 itself. */
5673 {
5674 tree type;
5683 }
5684 }
5689 }
5690 #undef RECUR
5691 }
5693 /* Return nonzero if the dynamic type of INSTANCE is known, and
5694 equivalent to the static type. We also handle the case where
5695 INSTANCE is really a pointer. Return negative if this is a
5696 ctor/dtor. There the dynamic type is known, but this might not be
5697 the most derived base of the original object, and hence virtual
5698 bases may not be layed out according to this type.
5700 Used to determine whether the virtual function table is needed
5701 or not.
5703 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
5704 of our knowledge of its type. *NONNULL should be initialized
5705 before this function is called. */
5707 int
5709 {
5720 }
5722 \f
5723 void
5725 {
5728 current_class_stack
5736 }
5738 /* Restore the cached PREVIOUS_CLASS_LEVEL. */
5740 static void
5742 {
5743 tree type;
5745 /* We are re-entering the same class we just left, so we don't
5746 have to search the whole inheritance matrix to find all the
5747 decls to bind again. Instead, we install the cached
5748 class_shadowed list and walk through it binding names. */
5751 /* Restore IDENTIFIER_TYPE_VALUE. */
5753 type;
5756 }
5758 /* Set global variables CURRENT_CLASS_NAME and CURRENT_CLASS_TYPE as
5759 appropriate for TYPE.
5761 So that we may avoid calls to lookup_name, we cache the _TYPE
5762 nodes of local TYPE_DECLs in the TREE_TYPE field of the name.
5764 For multiple inheritance, we perform a two-pass depth-first search
5765 of the type lattice. */
5767 void
5769 {
5770 class_stack_node_t csn;
5774 /* Make sure there is enough room for the new entry on the stack. */
5776 {
5778 current_class_stack
5780 current_class_stack_size);
5781 }
5783 /* Insert a new entry on the class stack. */
5790 current_class_depth++;
5792 /* Now set up the new type. */
5798 /* By default, things in classes are private, while things in
5799 structures or unions are public. */
5801 ? access_private_node
5807 {
5808 /* Forcibly remove any old class remnants. */
5810 }
5816 else
5818 }
5820 /* When we exit a toplevel class scope, we save its binding level so
5821 that we can restore it quickly. Here, we've entered some other
5822 class, so we must invalidate our cache. */
5824 void
5826 {
5828 }
5830 /* Get out of the current class scope. If we were in a class scope
5831 previously, that is the one popped to. */
5833 void
5835 {
5838 current_class_depth--;
5844 }
5846 /* Mark the top of the class stack as hidden. */
5848 void
5850 {
5853 }
5855 /* Mark the top of the class stack as un-hidden. */
5857 void
5859 {
5862 }
5864 /* Returns 1 if the class type currently being defined is either T or
5865 a nested type of T. */
5867 bool
5869 {
5877 /* We start looking from 1 because entry 0 is from global scope,
5878 and has no type. */
5880 {
5881 tree c;
5884 else
5885 {
5889 }
5894 }
5896 }
5898 /* If either current_class_type or one of its enclosing classes are derived
5899 from T, return the appropriate type. Used to determine how we found
5900 something via unqualified lookup. */
5902 tree
5904 {
5907 /* The bases of a dependent type are unknown. */
5918 {
5923 }
5926 }
5928 /* When entering a class scope, all enclosing class scopes' names with
5929 static meaning (static variables, static functions, types and
5930 enumerators) have to be visible. This recursive function calls
5931 pushclass for all enclosing class contexts until global or a local
5932 scope is reached. TYPE is the enclosed class. */
5934 void
5936 {
5937 /* A namespace might be passed in error cases, like A::B:C. */
5945 }
5947 /* Undoes a push_nested_class call. */
5949 void
5951 {
5957 }
5959 /* Returns the number of extern "LANG" blocks we are nested within. */
5961 int
5963 {
5965 }
5967 /* Set global variables CURRENT_LANG_NAME to appropriate value
5968 so that behavior of name-mangling machinery is correct. */
5970 void
5972 {
5976 {
5978 }
5980 {
5982 /* DECL_IGNORED_P is initially set for these types, to avoid clutter.
5983 (See record_builtin_java_type in decl.c.) However, that causes
5984 incorrect debug entries if these types are actually used.
5985 So we re-enable debug output after extern "Java". */
5994 }
5996 {
5998 }
5999 else
6001 }
6003 /* Get out of the current language scope. */
6005 void
6007 {
6009 }
6010 \f
6011 /* Type instantiation routines. */
6013 /* Given an OVERLOAD and a TARGET_TYPE, return the function that
6014 matches the TARGET_TYPE. If there is no satisfactory match, return
6015 error_mark_node, and issue an error & warning messages under
6016 control of FLAGS. Permit pointers to member function if FLAGS
6017 permits. If TEMPLATE_ONLY, the name of the overloaded function was
6018 a template-id, and EXPLICIT_TARGS are the explicitly provided
6019 template arguments.
6021 If OVERLOAD is for one or more member functions, then ACCESS_PATH
6022 is the base path used to reference those member functions. If
6023 TF_NO_ACCESS_CONTROL is not set in FLAGS, and the address is
6024 resolved to a member function, access checks will be performed and
6025 errors issued if appropriate. */
6027 static tree
6029 tree overload,
6030 tsubst_flags_t flags,
6032 tree explicit_targs,
6033 tree access_path)
6034 {
6035 /* Here's what the standard says:
6037 [over.over]
6039 If the name is a function template, template argument deduction
6040 is done, and if the argument deduction succeeds, the deduced
6041 arguments are used to generate a single template function, which
6042 is added to the set of overloaded functions considered.
6044 Non-member functions and static member functions match targets of
6045 type "pointer-to-function" or "reference-to-function." Nonstatic
6046 member functions match targets of type "pointer-to-member
6047 function;" the function type of the pointer to member is used to
6048 select the member function from the set of overloaded member
6049 functions. If a nonstatic member function is selected, the
6050 reference to the overloaded function name is required to have the
6051 form of a pointer to member as described in 5.3.1.
6053 If more than one function is selected, any template functions in
6054 the set are eliminated if the set also contains a non-template
6055 function, and any given template function is eliminated if the
6056 set contains a second template function that is more specialized
6057 than the first according to the partial ordering rules 14.5.5.2.
6058 After such eliminations, if any, there shall remain exactly one
6059 selected function. */
6063 /* We store the matches in a TREE_LIST rooted here. The functions
6064 are the TREE_PURPOSE, not the TREE_VALUE, in this list, for easy
6065 interoperability with most_specialized_instantiation. */
6067 tree fn;
6068 tree target_fn_type;
6070 /* By the time we get here, we should be seeing only real
6071 pointer-to-member types, not the internal POINTER_TYPE to
6072 METHOD_TYPE representation. */
6078 /* Check that the TARGET_TYPE is reasonable. */
6082 /* This is OK, too. */
6085 {
6086 /* This is OK, too. This comes from a conversion to reference
6087 type. */
6090 }
6091 else
6092 {
6098 }
6100 /* Non-member functions and static member functions match targets of type
6101 "pointer-to-function" or "reference-to-function." Nonstatic member
6102 functions match targets of type "pointer-to-member-function;" the
6103 function type of the pointer to member is used to select the member
6104 function from the set of overloaded member functions.
6106 So figure out the FUNCTION_TYPE that we want to match against. */
6109 /* If we can find a non-template function that matches, we can just
6110 use it. There's no point in generating template instantiations
6111 if we're just going to throw them out anyhow. But, of course, we
6112 can only do this when we don't *need* a template function. */
6114 {
6115 tree fns;
6118 {
6122 /* We're not looking for templates just yet. */
6127 /* We're looking for a non-static member, and this isn't
6128 one, or vice versa. */
6131 /* Ignore functions which haven't been explicitly
6132 declared. */
6136 /* See if there's a match. */
6139 }
6140 }
6142 /* Now, if we've already got a match (or matches), there's no need
6143 to proceed to the template functions. But, if we don't have a
6144 match we need to look at them, too. */
6146 {
6147 tree target_arg_types;
6148 tree target_ret_type;
6149 tree fns;
6152 tree arg;
6166 {
6168 tree instantiation;
6169 tree targs;
6172 /* We're only looking for templates. */
6177 /* We're not looking for a non-static member, and this is
6178 one, or vice versa. */
6181 /* Try to do argument deduction. */
6185 LOOKUP_NORMAL))
6186 /* Argument deduction failed. */
6189 /* Instantiate the template. */
6192 /* Instantiation failed. */
6195 /* See if there's a match. */
6198 }
6200 /* Now, remove all but the most specialized of the matches. */
6202 {
6207 NULL_TREE,
6208 NULL_TREE);
6209 }
6210 }
6212 /* Now we should have exactly one function in MATCHES. */
6214 {
6215 /* There were *no* matches. */
6217 {
6220 target_type);
6222 /* print_candidates expects a chain with the functions in
6223 TREE_VALUE slots, so we cons one up here (we're losing anyway,
6224 so why be clever?). */
6227 matches);
6230 }
6232 }
6234 {
6235 /* There were too many matches. First check if they're all
6236 the same function. */
6237 tree match;
6245 {
6247 {
6250 target_type);
6252 /* Since print_candidates expects the functions in the
6253 TREE_VALUE slot, we flip them here. */
6258 }
6261 }
6262 }
6264 /* Good, exactly one match. Now, convert it to the correct type. */
6269 {
6277 {
6280 }
6281 }
6283 /* If we're doing overload resolution purely for the purpose of
6284 determining conversion sequences, we should not consider the
6285 function used. If this conversion sequence is selected, the
6286 function will be marked as used at this point. */
6288 {
6289 /* Make =delete work with SFINAE. */
6294 }
6296 /* We could not check access to member functions when this
6297 expression was originally created since we did not know at that
6298 time to which function the expression referred. */
6301 {
6304 }
6308 else
6309 {
6310 /* The target must be a REFERENCE_TYPE. Above, cp_build_unary_op
6311 will mark the function as addressed, but here we must do it
6312 explicitly. */
6316 }
6317 }
6319 /* This function will instantiate the type of the expression given in
6320 RHS to match the type of LHSTYPE. If errors exist, then return
6321 error_mark_node. FLAGS is a bit mask. If TF_ERROR is set, then
6322 we complain on errors. If we are not complaining, never modify rhs,
6323 as overload resolution wants to try many possible instantiations, in
6324 the hope that at least one will work.
6326 For non-recursive calls, LHSTYPE should be a function, pointer to
6327 function, or a pointer to member function. */
6329 tree
6331 {
6338 {
6342 }
6345 {
6351 /* Microsoft allows `A::f' to be resolved to a
6352 pointer-to-member. */
6353 ;
6354 else
6355 {
6360 }
6361 }
6364 {
6367 }
6369 /* If we are in a template, and have a NON_DEPENDENT_EXPR, we cannot
6370 deduce any type information. */
6372 {
6376 }
6378 /* There only a few kinds of expressions that may have a type
6379 dependent on overload resolution. */
6385 /* This should really only be used when attempting to distinguish
6386 what sort of a pointer to function we have. For now, any
6387 arithmetic operation which is not supported on pointers
6388 is rejected as an error. */
6391 {
6393 {
6399 /* Do not lose object's side effects. */
6403 }
6410 /* This can happen if we are forming a pointer-to-member for a
6411 member template. */
6414 /* Fall through. */
6417 {
6421 return
6425 }
6429 return
6433 access_path);
6436 {
6441 }
6448 }
6450 }
6451 \f
6452 /* Return the name of the virtual function pointer field
6453 (as an IDENTIFIER_NODE) for the given TYPE. Note that
6454 this may have to look back through base types to find the
6455 ultimate field name. (For single inheritance, these could
6456 all be the same name. Who knows for multiple inheritance). */
6458 static tree
6460 {
6467 {
6473 }
6481 }
6483 void
6485 {
6486 #ifdef GATHER_STATISTICS
6490 {
6495 }
6496 #endif
6497 }
6499 /* Build a dummy reference to ourselves so Derived::Base (and A::A) works,
6500 according to [class]:
6501 The class-name is also inserted
6502 into the scope of the class itself. For purposes of access checking,
6503 the inserted class name is treated as if it were a public member name. */
6505 void
6507 {
6510 tree saved_cas;
6525 }
6527 /* Returns 1 if TYPE contains only padding bytes. */
6529 int
6531 {
6538 /* In G++ 3.2, whether or not a class was empty was determined by
6539 looking at its size. */
6542 else
6544 }
6546 /* Returns true if TYPE contains an empty class. */
6548 static bool
6550 {
6554 {
6555 tree field;
6556 tree binfo;
6557 tree base_binfo;
6569 }
6573 }
6575 /* Returns true if TYPE contains no actual data, just various
6576 possible combinations of empty classes. */
6578 bool
6580 {
6584 {
6585 tree field;
6586 tree binfo;
6587 tree base_binfo;
6600 }
6604 }
6606 /* Note that NAME was looked up while the current class was being
6607 defined and that the result of that lookup was DECL. */
6609 void
6611 {
6612 splay_tree names_used;
6614 /* If we're not defining a class, there's nothing to do. */
6620 /* If there's already a binding for this NAME, then we don't have
6621 anything to worry about. */
6634 }
6636 /* Note that NAME was declared (as DECL) in the current class. Check
6637 to see that the declaration is valid. */
6639 void
6641 {
6642 splay_tree names_used;
6643 splay_tree_node n;
6645 /* Look to see if we ever used this name. */
6646 names_used
6653 {
6654 /* [basic.scope.class]
6656 A name N used in a class S shall refer to the same declaration
6657 in its context and when re-evaluated in the completed scope of
6658 S. */
6662 }
6663 }
6665 /* Returns the VAR_DECL for the complete vtable associated with BINFO.
6666 Secondary vtables are merged with primary vtables; this function
6667 will return the VAR_DECL for the primary vtable. */
6669 tree
6671 {
6672 tree decl;
6676 {
6679 }
6683 }
6686 /* Returns the binfo for the primary base of BINFO. If the resulting
6687 BINFO is a virtual base, and it is inherited elsewhere in the
6688 hierarchy, then the returned binfo might not be the primary base of
6689 BINFO in the complete object. Check BINFO_PRIMARY_P or
6690 BINFO_LOST_PRIMARY_P to be sure. */
6692 static tree
6694 {
6695 tree primary_base;
6702 }
6704 /* If INDENTED_P is zero, indent to INDENT. Return nonzero. */
6706 static int
6708 {
6712 }
6714 /* Dump the offsets of all the bases rooted at BINFO to STREAM.
6715 INDENT should be zero when called from the top level; it is
6716 incremented recursively. IGO indicates the next expected BINFO in
6717 inheritance graph ordering. */
6719 static tree
6722 tree binfo,
6723 tree igo,
6725 {
6727 tree base_binfo;
6735 {
6738 }
6753 {
6757 TFF_PLAIN_IDENTIFIER),
6759 }
6761 {
6764 }
6769 {
6773 {
6777 TFF_PLAIN_IDENTIFIER));
6778 }
6780 {
6784 TFF_PLAIN_IDENTIFIER));
6785 }
6787 {
6791 TFF_PLAIN_IDENTIFIER));
6792 }
6794 {
6798 TFF_PLAIN_IDENTIFIER));
6799 }
6803 }
6809 }
6811 /* Dump the BINFO hierarchy for T. */
6813 static void
6815 {
6827 }
6829 /* Debug interface to hierarchy dumping. */
6831 void
6833 {
6835 }
6837 static void
6839 {
6844 {
6847 }
6848 }
6850 static void
6852 {
6853 tree value;
6855 HOST_WIDE_INT elt;
6863 TFF_PLAIN_IDENTIFIER));
6870 }
6872 static void
6874 {
6882 {
6889 {
6893 }
6897 }
6900 }
6902 static void
6904 {
6912 {
6917 }
6920 }
6922 /* Dump a function or thunk and its thunkees. */
6924 static void
6926 {
6929 tree thunks;
6937 {
6947 else
6953 }
6957 }
6959 /* Dump the thunks for FN. */
6961 void
6963 {
6965 }
6967 /* Virtual function table initialization. */
6969 /* Create all the necessary vtables for T and its base classes. */
6971 static void
6973 {
6974 tree list;
6975 tree vbase;
6977 /* We lay out the primary and secondary vtables in one contiguous
6978 vtable. The primary vtable is first, followed by the non-virtual
6979 secondary vtables in inheritance graph order. */
6984 /* Then come the virtual bases, also in inheritance graph order. */
6986 {
6990 }
6994 }
6996 /* Initialize the vtable for BINFO with the INITS. */
6998 static void
7000 {
7001 tree decl;
7007 }
7009 /* Build the VTT (virtual table table) for T.
7010 A class requires a VTT if it has virtual bases.
7012 This holds
7013 1 - primary virtual pointer for complete object T
7014 2 - secondary VTTs for each direct non-virtual base of T which requires a
7015 VTT
7016 3 - secondary virtual pointers for each direct or indirect base of T which
7017 has virtual bases or is reachable via a virtual path from T.
7018 4 - secondary VTTs for each direct or indirect virtual base of T.
7020 Secondary VTTs look like complete object VTTs without part 4. */
7022 static void
7024 {
7025 tree inits;
7026 tree type;
7027 tree vtt;
7028 tree index;
7030 /* Build up the initializers for the VTT. */
7035 /* If we didn't need a VTT, we're done. */
7039 /* Figure out the type of the VTT. */
7043 /* Now, build the VTT object itself. */
7046 /* Add the VTT to the vtables list. */
7051 }
7053 /* When building a secondary VTT, BINFO_VTABLE is set to a TREE_LIST with
7054 PURPOSE the RTTI_BINFO, VALUE the real vtable pointer for this binfo,
7055 and CHAIN the vtable pointer for this binfo after construction is
7056 complete. VALUE can also be another BINFO, in which case we recurse. */
7058 static tree
7060 {
7061 tree vt;
7064 {
7070 else
7072 }
7075 }
7077 /* Data for secondary VTT initialization. */
7079 {
7080 /* Is this the primary VTT? */
7083 /* Current index into the VTT. */
7084 tree index;
7086 /* TREE_LIST of initializers built up. */
7087 tree inits;
7089 /* The type being constructed by this secondary VTT. */
7090 tree type_being_constructed;
7093 /* Recursively build the VTT-initializer for BINFO (which is in the
7094 hierarchy dominated by T). INITS points to the end of the initializer
7095 list to date. INDEX is the VTT index where the next element will be
7096 replaced. Iff BINFO is the binfo for T, this is the top level VTT (i.e.
7097 not a subvtt for some base of T). When that is so, we emit the sub-VTTs
7098 for virtual bases of T. When it is not so, we build the constructor
7099 vtables for the BINFO-in-T variant. */
7103 {
7105 tree b;
7106 tree init;
7107 tree secondary_vptrs;
7108 secondary_vptr_vtt_init_data data;
7111 /* We only need VTTs for subobjects with virtual bases. */
7115 /* We need to use a construction vtable if this is not the primary
7116 VTT. */
7118 {
7121 /* Record the offset in the VTT where this sub-VTT can be found. */
7123 }
7125 /* Add the address of the primary vtable for the complete object. */
7130 {
7133 }
7136 /* Recursively add the secondary VTTs for non-virtual bases. */
7141 /* Add secondary virtual pointers for all subobjects of BINFO with
7142 either virtual bases or reachable along a virtual path, except
7143 subobjects that are non-virtual primary bases. */
7153 /* The secondary vptrs come back in reverse order. After we reverse
7154 them, and add the INITS, the last init will be the first element
7155 of the chain. */
7158 {
7162 }
7165 /* Add the secondary VTTs for virtual bases in inheritance graph
7166 order. */
7168 {
7173 }
7174 else
7175 /* Remove the ctor vtables we created. */
7179 }
7181 /* Called from build_vtt_inits via dfs_walk. BINFO is the binfo for the base
7182 in most derived. DATA is a SECONDARY_VPTR_VTT_INIT_DATA structure. */
7184 static tree
7186 {
7189 /* We don't care about bases that don't have vtables. */
7193 /* We're only interested in proper subobjects of the type being
7194 constructed. */
7198 /* We're only interested in bases with virtual bases or reachable
7199 via a virtual path from the type being constructed. */
7204 /* We're not interested in non-virtual primary bases. */
7208 /* Record the index where this secondary vptr can be found. */
7210 {
7215 {
7216 /* It's a primary virtual base, and this is not a
7217 construction vtable. Find the base this is primary of in
7218 the inheritance graph, and use that base's vtable
7219 now. */
7222 }
7223 }
7225 /* Add the initializer for the secondary vptr itself. */
7228 /* Advance the vtt index. */
7233 }
7235 /* Called from build_vtt_inits via dfs_walk. After building
7236 constructor vtables and generating the sub-vtt from them, we need
7237 to restore the BINFO_VTABLES that were scribbled on. DATA is the
7238 binfo of the base whose sub vtt was generated. */
7240 static tree
7242 {
7246 /* If this class has no vtable, none of its bases do. */
7250 /* This might be a primary base, so have no vtable in this
7251 hierarchy. */
7254 /* If we scribbled the construction vtable vptr into BINFO, clear it
7255 out now. */
7261 }
7263 /* Build the construction vtable group for BINFO which is in the
7264 hierarchy dominated by T. */
7266 static void
7268 {
7269 tree list;
7270 tree type;
7271 tree vtbl;
7272 tree inits;
7273 tree id;
7274 tree vbase;
7276 /* See if we've already created this construction vtable group. */
7282 /* Build a version of VTBL (with the wrong type) for use in
7283 constructing the addresses of secondary vtables in the
7284 construction vtable group. */
7291 /* Add the vtables for each of our virtual bases using the vbase in T
7292 binfo. */
7294 vbase;
7296 {
7297 tree b;
7304 }
7307 /* Figure out the type of the construction vtable. */
7315 /* Initialize the construction vtable. */
7319 }
7321 /* Add the vtbl initializers for BINFO (and its bases other than
7322 non-virtual primaries) to the list of INITS. BINFO is in the
7323 hierarchy dominated by T. RTTI_BINFO is the binfo within T of
7324 the constructor the vtbl inits should be accumulated for. (If this
7325 is the complete object vtbl then RTTI_BINFO will be TYPE_BINFO (T).)
7326 ORIG_BINFO is the binfo for this object within BINFO_TYPE (RTTI_BINFO).
7327 BINFO is the active base equivalent of ORIG_BINFO in the inheritance
7328 graph of T. Both BINFO and ORIG_BINFO will have the same BINFO_TYPE,
7329 but are not necessarily the same in terms of layout. */
7331 static void
7333 tree orig_binfo,
7334 tree rtti_binfo,
7335 tree t,
7336 tree inits)
7337 {
7339 tree base_binfo;
7344 /* If it doesn't have a vptr, we don't do anything. */
7348 /* If we're building a construction vtable, we're not interested in
7349 subobjects that don't require construction vtables. */
7355 /* Build the initializers for the BINFO-in-T vtable. */
7361 /* Walk the BINFO and its bases. We walk in preorder so that as we
7362 initialize each vtable we can figure out at what offset the
7363 secondary vtable lies from the primary vtable. We can't use
7364 dfs_walk here because we need to iterate through bases of BINFO
7365 and RTTI_BINFO simultaneously. */
7367 {
7368 /* Skip virtual bases. */
7374 inits);
7375 }
7376 }
7378 /* Called from accumulate_vtbl_inits. Returns the initializers for
7379 the BINFO vtable. */
7381 static tree
7383 tree orig_binfo,
7384 tree rtti_binfo,
7385 tree t,
7386 tree l)
7387 {
7394 {
7395 /* In the hierarchy of BINFO_TYPE (RTTI_BINFO), this is a
7396 primary virtual base. If it is not the same primary in
7397 the hierarchy of T, we'll need to generate a ctor vtable
7398 for it, to place at its location in T. If it is the same
7399 primary, we still need a VTT entry for the vtable, but it
7400 should point to the ctor vtable for the base it is a
7401 primary for within the sub-hierarchy of RTTI_BINFO.
7403 There are three possible cases:
7405 1) We are in the same place.
7406 2) We are a primary base within a lost primary virtual base of
7407 RTTI_BINFO.
7408 3) We are primary to something not a base of RTTI_BINFO. */
7410 tree b;
7413 /* First, look through the bases we are primary to for RTTI_BINFO
7414 or a virtual base. */
7417 {
7422 }
7423 /* If we run out of primary links, keep looking down our
7424 inheritance chain; we might be an indirect primary. */
7428 found:
7430 /* If we found RTTI_BINFO, this is case 1. If we found a virtual
7431 base B and it is a base of RTTI_BINFO, this is case 2. In
7432 either case, we share our vtable with LAST, i.e. the
7433 derived-most base within B of which we are a primary. */
7436 /* Just set our BINFO_VTABLE to point to LAST, as we may not have
7437 set LAST's BINFO_VTABLE yet. We'll extract the actual vptr in
7438 binfo_ctor_vtable after everything's been set up. */
7441 /* Otherwise, this is case 3 and we get our own. */
7442 }
7447 {
7448 tree index;
7451 /* Compute the initializer for this vtable. */
7455 /* Figure out the position to which the VPTR should point. */
7463 index);
7465 }
7468 /* For a construction vtable, we can't overwrite BINFO_VTABLE.
7469 So, we make a TREE_LIST. Later, dfs_fixup_binfo_vtbls will
7470 straighten this out. */
7474 else
7475 /* For an ordinary vtable, set BINFO_VTABLE. */
7479 }
7483 /* Construct the initializer for BINFO's virtual function table. BINFO
7484 is part of the hierarchy dominated by T. If we're building a
7485 construction vtable, the ORIG_BINFO is the binfo we should use to
7486 find the actual function pointers to put in the vtable - but they
7487 can be overridden on the path to most-derived in the graph that
7488 ORIG_BINFO belongs. Otherwise,
7489 ORIG_BINFO should be the same as BINFO. The RTTI_BINFO is the
7490 BINFO that should be indicated by the RTTI information in the
7491 vtable; it will be a base class of T, rather than T itself, if we
7492 are building a construction vtable.
7494 The value returned is a TREE_LIST suitable for wrapping in a
7495 CONSTRUCTOR to use as the DECL_INITIAL for a vtable. If
7496 NON_FN_ENTRIES_P is not NULL, *NON_FN_ENTRIES_P is set to the
7497 number of non-function entries in the vtable.
7499 It might seem that this function should never be called with a
7500 BINFO for which BINFO_PRIMARY_P holds, the vtable for such a
7501 base is always subsumed by a derived class vtable. However, when
7502 we are building construction vtables, we do build vtables for
7503 primary bases; we need these while the primary base is being
7504 constructed. */
7506 static tree
7508 tree orig_binfo,
7509 tree t,
7510 tree rtti_binfo,
7512 {
7514 tree vfun_inits;
7515 vtbl_init_data vid;
7517 tree vbinfo;
7520 /* Initialize VID. */
7529 /* The first vbase or vcall offset is at index -3 in the vtable. */
7532 /* Add entries to the vtable for RTTI. */
7535 /* Create an array for keeping track of the functions we've
7536 processed. When we see multiple functions with the same
7537 signature, we share the vcall offsets. */
7539 /* Add the vcall and vbase offset entries. */
7542 /* Clear BINFO_VTABLE_PATH_MARKED; it's set by
7543 build_vbase_offset_vtbl_entries. */
7548 /* If the target requires padding between data entries, add that now. */
7550 {
7554 {
7561 null_pointer_node),
7562 add);
7564 }
7565 }
7570 /* Go through all the ordinary virtual functions, building up
7571 initializers. */
7574 {
7575 tree delta;
7576 tree vcall_index;
7583 {
7587 {
7590 }
7592 }
7594 /* If the only definition of this function signature along our
7595 primary base chain is from a lost primary, this vtable slot will
7596 never be used, so just zero it out. This is important to avoid
7597 requiring extra thunks which cannot be generated with the function.
7599 We first check this in update_vtable_entry_for_fn, so we handle
7600 restored primary bases properly; we also need to do it here so we
7601 zero out unused slots in ctor vtables, rather than filling them
7602 with erroneous values (though harmless, apart from relocation
7603 costs). */
7605 {
7606 /* We found a defn before a lost primary; go ahead as normal. */
7610 /* The nearest definition is from a lost primary; clear the
7611 slot. */
7613 {
7616 }
7617 }
7620 {
7621 /* Pull the offset for `this', and the function to call, out of
7622 the list. */
7629 /* You can't call an abstract virtual function; it's abstract.
7630 So, we replace these functions with __pure_virtual. */
7632 {
7637 }
7638 else
7639 {
7641 {
7645 }
7646 /* Take the address of the function, considering it to be of an
7647 appropriate generic type. */
7649 }
7650 }
7652 /* And add it to the chain of initializers. */
7654 {
7659 else
7661 {
7668 }
7669 }
7670 else
7672 }
7674 /* The initializers for virtual functions were built up in reverse
7675 order; straighten them out now. */
7678 /* The negative offset initializers are also in reverse order. */
7681 /* Chain the two together. */
7683 }
7685 /* Adds to vid->inits the initializers for the vbase and vcall
7686 offsets in BINFO, which is in the hierarchy dominated by T. */
7688 static void
7690 {
7691 tree b;
7693 /* If this is a derived class, we must first create entries
7694 corresponding to the primary base class. */
7699 /* Add the vbase entries for this base. */
7701 /* Add the vcall entries for this base. */
7703 }
7705 /* Returns the initializers for the vbase offset entries in the vtable
7706 for BINFO (which is part of the class hierarchy dominated by T), in
7707 reverse order. VBASE_OFFSET_INDEX gives the vtable index
7708 where the next vbase offset will go. */
7710 static void
7712 {
7713 tree vbase;
7714 tree t;
7715 tree non_primary_binfo;
7717 /* If there are no virtual baseclasses, then there is nothing to
7718 do. */
7724 /* We might be a primary base class. Go up the inheritance hierarchy
7725 until we find the most derived class of which we are a primary base:
7726 it is the offset of that which we need to use. */
7729 {
7730 tree b;
7732 /* If we have reached a virtual base, then it must be a primary
7733 base (possibly multi-level) of vid->binfo, or we wouldn't
7734 have called build_vcall_and_vbase_vtbl_entries for it. But it
7735 might be a lost primary, so just skip down to vid->binfo. */
7737 {
7740 }
7746 }
7748 /* Go through the virtual bases, adding the offsets. */
7750 vbase;
7752 {
7753 tree b;
7754 tree delta;
7759 /* Find the instance of this virtual base in the complete
7760 object. */
7763 /* If we've already got an offset for this virtual base, we
7764 don't need another one. */
7769 /* Figure out where we can find this vbase offset. */
7778 /* The vbase offset had better be the same. */
7781 /* The next vbase will come at a more negative offset. */
7785 /* The initializer is the delta from BINFO to this virtual base.
7786 The vbase offsets go in reverse inheritance-graph order, and
7787 we are walking in inheritance graph order so these end up in
7788 the right order. */
7795 vtable_entry_type,
7796 delta));
7798 }
7799 }
7801 /* Adds the initializers for the vcall offset entries in the vtable
7802 for BINFO (which is part of the class hierarchy dominated by VID->DERIVED)
7803 to VID->INITS. */
7805 static void
7807 {
7808 /* We only need these entries if this base is a virtual base. We
7809 compute the indices -- but do not add to the vtable -- when
7810 building the main vtable for a class. */
7813 /* If BINFO is RTTI_BINFO, then (since BINFO does not
7814 correspond to VID->DERIVED), we are building a primary
7815 construction virtual table. Since this is a primary
7816 virtual table, we do not need the vcall offsets for
7817 BINFO. */
7819 {
7820 /* We need a vcall offset for each of the virtual functions in this
7821 vtable. For example:
7823 class A { virtual void f (); };
7824 class B1 : virtual public A { virtual void f (); };
7825 class B2 : virtual public A { virtual void f (); };
7826 class C: public B1, public B2 { virtual void f (); };
7828 A C object has a primary base of B1, which has a primary base of A. A
7829 C also has a secondary base of B2, which no longer has a primary base
7830 of A. So the B2-in-C construction vtable needs a secondary vtable for
7831 A, which will adjust the A* to a B2* to call f. We have no way of
7832 knowing what (or even whether) this offset will be when we define B2,
7833 so we store this "vcall offset" in the A sub-vtable and look it up in
7834 a "virtual thunk" for B2::f.
7836 We need entries for all the functions in our primary vtable and
7837 in our non-virtual bases' secondary vtables. */
7839 /* If we are just computing the vcall indices -- but do not need
7840 the actual entries -- not that. */
7843 /* Now, walk through the non-virtual bases, adding vcall offsets. */
7845 }
7846 }
7848 /* Build vcall offsets, starting with those for BINFO. */
7850 static void
7852 {
7854 tree primary_binfo;
7855 tree base_binfo;
7857 /* Don't walk into virtual bases -- except, of course, for the
7858 virtual base for which we are building vcall offsets. Any
7859 primary virtual base will have already had its offsets generated
7860 through the recursion in build_vcall_and_vbase_vtbl_entries. */
7864 /* If BINFO has a primary base, process it first. */
7869 /* Add BINFO itself to the list. */
7872 /* Scan the non-primary bases of BINFO. */
7876 }
7878 /* Called from build_vcall_offset_vtbl_entries_r. */
7880 static void
7882 {
7883 /* Make entries for the rest of the virtuals. */
7885 {
7886 tree orig_fn;
7888 /* The ABI requires that the methods be processed in declaration
7889 order. G++ 3.2 used the order in the vtable. */
7891 orig_fn;
7895 }
7896 else
7897 {
7898 tree derived_virtuals;
7899 tree base_virtuals;
7900 tree orig_virtuals;
7901 /* If BINFO is a primary base, the most derived class which has
7902 BINFO as a primary base; otherwise, just BINFO. */
7903 tree non_primary_binfo;
7905 /* We might be a primary base class. Go up the inheritance hierarchy
7906 until we find the most derived class of which we are a primary base:
7907 it is the BINFO_VIRTUALS there that we need to consider. */
7910 {
7911 tree b;
7913 /* If we have reached a virtual base, then it must be vid->vbase,
7914 because we ignore other virtual bases in
7915 add_vcall_offset_vtbl_entries_r. In turn, it must be a primary
7916 base (possibly multi-level) of vid->binfo, or we wouldn't
7917 have called build_vcall_and_vbase_vtbl_entries for it. But it
7918 might be a lost primary, so just skip down to vid->binfo. */
7920 {
7924 }
7930 }
7933 /* For a ctor vtable we need the equivalent binfo within the hierarchy
7934 where rtti_binfo is the most derived type. */
7935 non_primary_binfo
7941 base_virtuals;
7945 {
7946 tree orig_fn;
7948 /* Find the declaration that originally caused this function to
7949 be present in BINFO_TYPE (binfo). */
7952 /* When processing BINFO, we only want to generate vcall slots for
7953 function slots introduced in BINFO. So don't try to generate
7954 one if the function isn't even defined in BINFO. */
7959 }
7960 }
7961 }
7963 /* Add a vcall offset entry for ORIG_FN to the vtable. */
7965 static void
7967 {
7969 tree vcall_offset;
7970 tree derived_entry;
7972 /* If there is already an entry for a function with the same
7973 signature as FN, then we do not need a second vcall offset.
7974 Check the list of functions already present in the derived
7975 class vtable. */
7977 {
7979 /* We only use one vcall offset for virtual destructors,
7980 even though there are two virtual table entries. */
7984 }
7986 /* If we are building these vcall offsets as part of building
7987 the vtable for the most derived class, remember the vcall
7988 offset. */
7990 {
7993 NULL);
7996 }
7998 /* The next vcall offset will be found at a more negative
7999 offset. */
8003 /* Keep track of this function. */
8007 {
8008 tree base;
8009 tree fn;
8011 /* Find the overriding function. */
8015 integer_zero_node);
8016 else
8017 {
8020 /* The vbase we're working on is a primary base of
8021 vid->binfo. But it might be a lost primary, so its
8022 BINFO_OFFSET might be wrong, so we just use the
8023 BINFO_OFFSET from vid->binfo. */
8029 vcall_offset);
8030 }
8031 /* Add the initializer to the vtable. */
8034 }
8035 }
8037 /* Return vtbl initializers for the RTTI entries corresponding to the
8038 BINFO's vtable. The RTTI entries should indicate the object given
8039 by VID->rtti_binfo. */
8041 static void
8043 {
8044 tree b;
8045 tree t;
8046 tree basetype;
8047 tree offset;
8048 tree decl;
8049 tree init;
8054 /* To find the complete object, we will first convert to our most
8055 primary base, and then add the offset in the vtbl to that value. */
8059 {
8060 tree primary_base;
8066 }
8070 /* The second entry is the address of the typeinfo object. */
8073 else
8076 /* Convert the declaration to a type that can be stored in the
8077 vtable. */
8082 /* Add the offset-to-top entry. It comes earlier in the vtable than
8083 the typeinfo entry. Convert the offset to look like a
8084 function pointer, so that we can put it in the vtable. */
8088 }
8090 /* Fold a OBJ_TYPE_REF expression to the address of a function.
8091 KNOWN_TYPE carries the true type of OBJ_TYPE_REF_OBJECT(REF). */
8093 tree
8095 {
8099 tree fndecl;
8102 {
8103 i += (TARGET_VTABLE_USES_DESCRIPTORS
8106 }
8110 #ifdef ENABLE_CHECKING
8113 #endif
8118 }