| blob | 31123aa1ffd40c1aaf8647440bf069a4f4544d10 |
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
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. */
185 tree);
204 splay_tree_key k2);
213 /* Variables shared between class.c and call.c. */
215 #ifdef GATHER_STATISTICS
223 #endif
225 /* Convert to or from a base subobject. EXPR is an expression of type
226 `A' or `A*', an expression of type `B' or `B*' is returned. To
227 convert A to a base B, CODE is PLUS_EXPR and BINFO is the binfo for
228 the B base instance within A. To convert base A to derived B, CODE
229 is MINUS_EXPR and BINFO is the binfo for the A instance within B.
230 In this latter case, A must not be a morally virtual base of B.
231 NONNULL is true if EXPR is known to be non-NULL (this is only
232 needed when EXPR is of pointer type). CV qualifiers are preserved
233 from EXPR. */
235 tree
237 tree expr,
238 tree binfo,
240 {
243 tree probe;
244 tree offset;
245 tree target_type;
247 tree ptr_target_type;
257 {
263 }
275 /* Nothing to do. */
279 {
283 }
286 /* This must happen before the call to save_expr. */
293 /* Do we need to look in the vtable for the real offset? */
296 /* Don't bother with the calculations inside sizeof; they'll ICE if the
297 source type is incomplete and the pointer value doesn't matter. */
299 {
304 }
306 /* Do we need to check for a null pointer? */
308 {
309 /* If we know the conversion will not actually change the value
310 of EXPR, then we can avoid testing the expression for NULL.
311 We have to avoid generating a COMPONENT_REF for a base class
312 field, because other parts of the compiler know that such
313 expressions are always non-NULL. */
315 {
316 tree class_type;
317 /* TARGET_TYPE has been extracted from BINFO, and, is
318 therefore always cv-unqualified. Extract the
319 cv-qualifiers from EXPR so that the expression returned
320 matches the input. */
322 target_type
326 }
328 }
330 /* Protect against multiple evaluation if necessary. */
334 /* Now that we've saved expr, build the real null test. */
336 {
340 }
342 /* If this is a simple base reference, express it as a COMPONENT_REF. */
344 /* We don't build base fields for empty bases, and they aren't very
345 interesting to the optimizers anyway. */
347 {
354 }
357 {
358 /* Going via virtual base V_BINFO. We need the static offset
359 from V_BINFO to BINFO, and the dynamic offset from D_BINFO to
360 V_BINFO. That offset is an entry in D_BINFO's vtable. */
361 tree v_offset;
364 {
365 /* In a base member initializer, we cannot rely on the
366 vtable being set up. We have to indirect via the
367 vtt_parm. */
368 tree t;
374 tf_warning_or_error);
375 }
376 else
378 tf_warning_or_error),
385 v_offset);
397 /* Negative fixed_type_p means this is a constructor or destructor;
398 virtual base layout is fixed in in-charge [cd]tors, but not in
399 base [cd]tors. */
403 v_offset,
406 else
408 }
410 target_type = cp_build_qualified_type
419 {
424 }
425 else
431 out:
435 integer_zero_node));
438 }
440 /* Subroutine of build_base_path; EXPR and BINFO are as in that function.
441 Perform a derived-to-base conversion by recursively building up a
442 sequence of COMPONENT_REFs to the appropriate base fields. */
444 static tree
446 {
449 tree field;
452 {
453 tree temp;
457 /* Transform `(a, b).x' into `(*(a, &b)).x', `(a ? b : c).x'
458 into `(*(a ? &b : &c)).x', and so on. A COND_EXPR is only
459 an lvalue in the front end; only _DECLs and _REFs are lvalues
460 in the back end. */
466 }
468 /* Recurse. */
473 /* Is this the base field created by build_base_field? */
477 {
478 /* We don't use build_class_member_access_expr here, as that
479 has unnecessary checks, and more importantly results in
480 recursive calls to dfs_walk_once. */
488 /* Mark the expression const or volatile, as appropriate.
489 Even though we've dealt with the type above, we still have
490 to mark the expression itself. */
497 }
499 /* Didn't find the base field?!? */
501 }
503 /* Convert OBJECT to the base TYPE. OBJECT is an expression whose
504 type is a class type or a pointer to a class type. In the former
505 case, TYPE is also a class type; in the latter it is another
506 pointer type. If CHECK_ACCESS is true, an error message is emitted
507 if TYPE is inaccessible. If OBJECT has pointer type, the value is
508 assumed to be non-NULL. */
510 tree
512 {
513 tree binfo;
514 tree object_type;
517 {
520 }
521 else
526 NULL);
531 }
533 /* EXPR is an expression with unqualified class type. BASE is a base
534 binfo of that class type. Returns EXPR, converted to the BASE
535 type. This function assumes that EXPR is the most derived class;
536 therefore virtual bases can be found at their static offsets. */
538 tree
540 {
541 tree expr_type;
545 {
546 tree pointer_type;
550 /* We use fold_build2 and fold_convert below to simplify the trees
551 provided to the optimizers. It is not safe to call these functions
552 when processing a template because they do not handle C++-specific
553 trees. */
556 tf_warning_or_error);
562 }
565 }
567 \f
568 tree
570 {
576 /* First, convert to the requested type. */
581 /* Second, the requested type may not be the owner of its own vptr.
582 If not, convert to the base class that owns it. We cannot use
583 convert_to_base here, because VCONTEXT may appear more than once
584 in the inheritance hierarchy of TYPE, and thus direct conversion
585 between the types may be ambiguous. Following the path back up
586 one step at a time via primary bases avoids the problem. */
590 {
593 }
596 }
598 /* Given an object INSTANCE, return an expression which yields the
599 vtable element corresponding to INDEX. There are many special
600 cases for INSTANCE which we take care of here, mainly to avoid
601 creating extra tree nodes when we don't have to. */
603 static tree
605 {
606 tree aref;
609 /* Try to figure out what a reference refers to, and
610 access its virtual function table directly. */
618 {
623 }
634 }
636 tree
638 {
642 }
644 /* Given a stable object pointer INSTANCE_PTR, return an expression which
645 yields a function pointer corresponding to vtable element INDEX. */
647 tree
649 {
650 tree aref;
653 tf_warning_or_error),
654 idx);
656 /* When using function descriptors, the address of the
657 vtable entry is treated as a function pointer. */
661 tf_warning_or_error));
663 /* Remember this as a method reference, for later devirtualization. */
667 }
669 /* Return the name of the virtual function table (as an IDENTIFIER_NODE)
670 for the given TYPE. */
672 static tree
674 {
676 }
678 /* DECL is an entity associated with TYPE, like a virtual table or an
679 implicitly generated constructor. Determine whether or not DECL
680 should have external or internal linkage at the object file
681 level. This routine does not deal with COMDAT linkage and other
682 similar complexities; it simply sets TREE_PUBLIC if it possible for
683 entities in other translation units to contain copies of DECL, in
684 the abstract. */
686 void
688 {
689 /* If TYPE involves a local class in a function with internal
690 linkage, then DECL should have internal linkage too. Other local
691 classes have no linkage -- but if their containing functions
692 have external linkage, it makes sense for DECL to have external
693 linkage too. That will allow template definitions to be merged,
694 for example. */
696 {
699 }
700 else
702 }
704 /* Create a VAR_DECL for a primary or secondary vtable for CLASS_TYPE.
705 (For a secondary vtable for B-in-D, CLASS_TYPE should be D, not B.)
706 Use NAME for the name of the vtable, and VTABLE_TYPE for its type. */
708 static tree
710 {
711 tree decl;
714 /* vtable names are already mangled; give them their DECL_ASSEMBLER_NAME
715 now to avoid confusion in mangle_decl. */
724 /* At one time the vtable info was grabbed 2 words at a time. This
725 fails on sparc unless you have 8-byte alignment. (tiemann) */
729 /* The vtable has not been defined -- yet. */
733 /* Mark the VAR_DECL node representing the vtable itself as a
734 "gratuitous" one, thereby forcing dwarfout.c to ignore it. It
735 is rather important that such things be ignored because any
736 effort to actually generate DWARF for them will run into
737 trouble when/if we encounter code like:
739 #pragma interface
740 struct S { virtual void member (); };
742 because the artificial declaration of the vtable itself (as
743 manufactured by the g++ front end) will say that the vtable is
744 a static member of `S' but only *after* the debug output for
745 the definition of `S' has already been output. This causes
746 grief because the DWARF entry for the definition of the vtable
747 will try to refer back to an earlier *declaration* of the
748 vtable as a static member of `S' and there won't be one. We
749 might be able to arrange to have the "vtable static member"
750 attached to the member list for `S' before the debug info for
751 `S' get written (which would solve the problem) but that would
752 require more intrusive changes to the g++ front end. */
756 }
758 /* Get the VAR_DECL of the vtable for TYPE. TYPE need not be polymorphic,
759 or even complete. If this does not exist, create it. If COMPLETE is
760 nonzero, then complete the definition of it -- that will render it
761 impossible to actually build the vtable, but is useful to get at those
762 which are known to exist in the runtime. */
764 tree
766 {
767 tree decl;
776 {
779 }
782 }
784 /* Build the primary virtual function table for TYPE. If BINFO is
785 non-NULL, build the vtable starting with the initial approximation
786 that it is the same as the one which is the head of the association
787 list. Returns a nonzero value if a new vtable is actually
788 created. */
790 static int
792 {
793 tree decl;
794 tree virtuals;
799 {
801 /* We have already created a vtable for this base, so there's
802 no need to do it again. */
809 }
810 else
811 {
814 }
816 #ifdef GATHER_STATISTICS
819 #endif
821 /* Initialize the association list for this type, based
822 on our first approximation. */
827 }
829 /* Give BINFO a new virtual function table which is initialized
830 with a skeleton-copy of its original initialization. The only
831 entry that changes is the `delta' entry, so we can really
832 share a lot of structure.
834 FOR_TYPE is the most derived type which caused this table to
835 be needed.
837 Returns nonzero if we haven't met BINFO before.
839 The order in which vtables are built (by calling this function) for
840 an object must remain the same, otherwise a binary incompatibility
841 can result. */
843 static int
845 {
847 /* We already created a vtable for this base. There's no need to
848 do it again. */
851 /* Remember that we've created a vtable for this BINFO, so that we
852 don't try to do so again. */
855 /* Make fresh virtual list, so we can smash it later. */
858 /* Secondary vtables are laid out as part of the same structure as
859 the primary vtable. */
862 }
864 /* Create a new vtable for BINFO which is the hierarchy dominated by
865 T. Return nonzero if we actually created a new vtable. */
867 static int
869 {
871 /* In this case, it is *type*'s vtable we are modifying. We start
872 with the approximation that its vtable is that of the
873 immediate base class. */
875 else
876 /* This is our very own copy of `basetype' to play with. Later,
877 we will fill in all the virtual functions that override the
878 virtual functions in these base classes which are not defined
879 by the current type. */
881 }
883 /* Make *VIRTUALS, an entry on the BINFO_VIRTUALS list for BINFO
884 (which is in the hierarchy dominated by T) list FNDECL as its
885 BV_FN. DELTA is the required constant adjustment from the `this'
886 pointer where the vtable entry appears to the `this' required when
887 the function is actually called. */
889 static void
891 tree binfo,
892 tree fndecl,
893 tree delta,
895 {
896 tree v;
902 {
903 /* We need a new vtable for BINFO. */
905 {
906 /* If we really did make a new vtable, we also made a copy
907 of the BINFO_VIRTUALS list. Now, we have to find the
908 corresponding entry in that list. */
913 }
918 }
919 }
921 \f
922 /* Add method METHOD to class TYPE. If USING_DECL is non-null, it is
923 the USING_DECL naming METHOD. Returns true if the method could be
924 added to the method vec. */
926 bool
928 {
930 tree overload;
936 tree current_fns;
937 tree fns;
950 {
951 /* Make a new method vector. We start with 8 entries. We must
952 allocate at least two (for constructors and destructors), and
953 we're going to end up with an assignment operator at some
954 point as well. */
956 /* Create slots for constructors and destructors. */
960 }
962 /* Maintain TYPE_HAS_USER_CONSTRUCTOR, etc. */
965 /* Constructors and destructors go in special slots. */
969 {
973 {
979 type);
980 }
981 }
982 else
983 {
984 tree m;
987 /* See if we already have an entry with this name. */
991 {
994 {
999 }
1003 {
1006 }
1011 }
1012 }
1015 /* Check to see if we've already got this method. */
1017 {
1019 tree fn_type;
1020 tree method_type;
1021 tree parms1;
1022 tree parms2;
1027 /* [over.load] Member function declarations with the
1028 same name and the same parameter types cannot be
1029 overloaded if any of them is a static member
1030 function declaration.
1032 [namespace.udecl] When a using-declaration brings names
1033 from a base class into a derived class scope, member
1034 functions in the derived class override and/or hide member
1035 functions with the same name and parameter types in a base
1036 class (rather than conflicting). */
1042 /* Compare the quals on the 'this' parm. Don't compare
1043 the whole types, as used functions are treated as
1044 coming from the using class in overload resolution. */
1053 /* For templates, the return type and template parameters
1054 must be identical. */
1071 {
1073 {
1075 /* Defer to the local function. */
1079 else
1081 using_decl);
1082 }
1083 else
1084 {
1087 }
1089 /* We don't call duplicate_decls here to merge the
1090 declarations because that will confuse things if the
1091 methods have inline definitions. In particular, we
1092 will crash while processing the definitions. */
1094 }
1095 }
1097 /* A class should never have more than one destructor. */
1101 /* Add the new binding. */
1110 {
1113 /* We only expect to add few methods in the COMPLETE_P case, so
1114 just make room for one more method in that case. */
1117 else
1123 else
1125 }
1126 else
1127 /* Replace the current slot. */
1130 }
1132 /* Subroutines of finish_struct. */
1134 /* Change the access of FDECL to ACCESS in T. Return 1 if change was
1135 legit, otherwise return 0. */
1137 static int
1139 {
1140 tree elem;
1149 {
1151 {
1155 else
1158 }
1159 else
1160 {
1161 /* They're changing the access to the same thing they changed
1162 it to before. That's OK. */
1163 ;
1164 }
1165 }
1166 else
1167 {
1171 }
1173 }
1175 /* Process the USING_DECL, which is a member of T. */
1177 static void
1179 {
1182 tree access
1187 tree old_value;
1193 {
1199 else
1201 }
1209 ;
1211 {
1213 /* It's OK to use functions from a base when there are functions with
1215 else
1216 {
1221 }
1222 }
1224 {
1228 }
1230 /* Make type T see field decl FDECL with access ACCESS. */
1233 {
1236 }
1237 else
1239 }
1240 \f
1241 /* Run through the base classes of T, updating CANT_HAVE_CONST_CTOR_P,
1242 and NO_CONST_ASN_REF_P. Also set flag bits in T based on
1243 properties of the bases. */
1245 static void
1249 {
1252 tree base_binfo;
1253 tree binfo;
1259 {
1264 /* Effective C++ rule 14. We only need to check TYPE_POLYMORPHIC_P
1265 here because the case of virtual functions but non-virtual
1266 dtor is handled in finish_struct_1. */
1271 /* If the base class doesn't have copy constructors or
1272 assignment operators that take const references, then the
1273 derived class cannot have such a member automatically
1274 generated. */
1282 /* A virtual base does not effect nearly emptiness. */
1283 ;
1285 {
1287 /* And if there is more than one nearly empty base, then the
1288 derived class is not nearly empty either. */
1290 else
1291 /* Remember we've seen one. */
1293 }
1295 /* If the base class is not empty or nearly empty, then this
1296 class cannot be nearly empty. */
1299 /* A lot of properties from the bases also apply to the derived
1300 class. */
1311 }
1312 }
1314 /* Determine all the primary bases within T. Sets BINFO_PRIMARY_BASE_P for
1315 those that are primaries. Sets BINFO_LOST_PRIMARY_P for those
1316 that have had a nearly-empty virtual primary base stolen by some
1317 other base in the hierarchy. Determines CLASSTYPE_PRIMARY_BASE for
1318 T. */
1320 static void
1322 {
1326 tree base_binfo;
1328 /* Determine the primary bases of our bases. */
1331 {
1334 /* See if we're the non-virtual primary of our inheritance
1335 chain. */
1337 {
1344 /* We are the primary binfo. */
1346 }
1347 /* Determine if we have a virtual primary base, and mark it so.
1348 */
1350 {
1354 /* Someone already claimed this base. */
1356 else
1357 {
1358 tree delta;
1363 /* A virtual binfo might have been copied from within
1364 another hierarchy. As we're about to use it as a
1365 primary base, make sure the offsets match. */
1372 }
1373 }
1374 }
1376 /* First look for a dynamic direct non-virtual base. */
1378 {
1382 {
1385 }
1386 }
1388 /* A "nearly-empty" virtual base class can be the primary base
1389 class, if no non-virtual polymorphic base can be found. Look for
1390 a nearly-empty virtual dynamic base that is not already a primary
1391 base of something in the hierarchy. If there is no such base,
1392 just pick the first nearly-empty virtual base. */
1398 {
1400 {
1401 /* Found one that is not primary. */
1404 }
1406 /* Remember the first candidate. */
1408 }
1410 found:
1411 /* If we've got a primary base, use it. */
1413 {
1418 /* We are stealing a primary base. */
1422 {
1423 tree delta;
1426 /* A virtual binfo might have been copied from within
1427 another hierarchy. As we're about to use it as a primary
1428 base, make sure the offsets match. */
1433 }
1440 }
1441 }
1442 \f
1443 /* Set memoizing fields and bits of T (and its variants) for later
1444 use. */
1446 static void
1448 {
1449 tree variants;
1451 /* Fix up variants (if any). */
1453 variants;
1455 {
1456 /* These fields are in the _TYPE part of the node, not in
1457 the TYPE_LANG_SPECIFIC component, so they are not shared. */
1467 /* Copy whatever these are holding today. */
1472 /* All variants of a class have the same attributes. */
1474 }
1477 /* For a class w/o baseclasses, 'finish_struct' has set
1478 CLASSTYPE_PURE_VIRTUALS correctly (by definition).
1479 Similarly for a class whose base classes do not have vtables.
1480 When neither of these is true, we might have removed abstract
1481 virtuals (by providing a definition), added some (by declaring
1482 new ones), or redeclared ones from a base class. We need to
1483 recalculate what's really an abstract virtual at this point (by
1484 looking in the vtables). */
1487 /* If this type has a copy constructor or a destructor, force its
1488 mode to be BLKmode, and force its TREE_ADDRESSABLE bit to be
1489 nonzero. This will cause it to be passed by invisible reference
1490 and prevent it from being returned in a register. */
1492 {
1493 tree variants;
1496 {
1499 }
1500 }
1501 }
1503 /* Issue warnings about T having private constructors, but no friends,
1504 and so forth.
1506 HAS_NONPRIVATE_METHOD is nonzero if T has any non-private methods or
1507 static members. HAS_NONPRIVATE_STATIC_FN is nonzero if T has any
1508 non-private static member functions. */
1510 static void
1512 {
1515 tree fn;
1518 /* If the class has friends, those entities might create and
1519 access instances, so we should not warn. */
1522 /* We will have warned when the template was declared; there's
1523 no need to warn on every instantiation. */
1525 /* There's no reason to even consider warning about this
1526 class. */
1529 /* We only issue one warning, if more than one applies, because
1530 otherwise, on code like:
1532 class A {
1533 // Oops - forgot `public:'
1534 A();
1535 A(const A&);
1536 ~A();
1537 };
1539 we warn several times about essentially the same problem. */
1541 /* Check to see if all (non-constructor, non-destructor) member
1542 functions are private. (Since there are no friends or
1543 non-private statics, we can't ever call any of the private member
1544 functions.) */
1546 /* We're not interested in compiler-generated methods; they don't
1547 provide any way to call private members. */
1549 {
1551 {
1553 /* A non-private static member function is just like a
1554 friend; it can create and invoke private member
1555 functions, and be accessed without a class
1556 instance. */
1560 /* Keep searching for a static member function. */
1561 }
1564 }
1567 {
1568 /* There are no non-private methods, and there's at least one
1569 private member function that isn't a constructor or
1570 destructor. (If all the private members are
1571 constructors/destructors we want to use the code below that
1572 issues error messages specifically referring to
1573 constructors/destructors.) */
1579 {
1582 }
1584 {
1588 }
1589 }
1591 /* Even if some of the member functions are non-private, the class
1592 won't be useful for much if all the constructors or destructors
1593 are private: such an object can never be created or destroyed. */
1596 {
1599 t);
1601 }
1603 /* Warn about classes that have private constructors and no friends. */
1605 /* Implicitly generated constructors are always public. */
1608 {
1611 /* If a non-template class does not define a copy
1612 constructor, one is defined for it, enabling it to avoid
1613 this warning. For a template class, this does not
1614 happen, and so we would normally get a warning on:
1616 template <class T> class C { private: C(); };
1618 To avoid this asymmetry, we check TYPE_HAS_INIT_REF. All
1619 complete non-template or fully instantiated classes have this
1620 flag set. */
1623 else
1625 {
1627 /* Ideally, we wouldn't count copy constructors (or, in
1628 fact, any constructor that takes an argument of the
1629 class type as a parameter) because such things cannot
1630 be used to construct an instance of the class unless
1631 you already have one. But, for now at least, we're
1632 more generous. */
1634 {
1637 }
1638 }
1641 {
1644 t);
1646 }
1647 }
1648 }
1651 gt_pointer_operator new_value;
1655 /* Comparison function to compare two TYPE_METHOD_VEC entries by name. */
1657 static int
1659 {
1672 }
1674 /* This routine compares two fields like method_name_cmp but using the
1675 pointer operator in resort_field_decl_data. */
1677 static int
1679 {
1688 {
1695 }
1697 }
1699 /* Resort TYPE_METHOD_VEC because pointers have been reordered. */
1701 void
1704 gt_pointer_operator new_value,
1706 {
1710 tree fn;
1712 /* The type conversion ops have to live at the front of the vec, so we
1713 can't sort them. */
1721 {
1725 resort_method_name_cmp);
1726 }
1727 }
1729 /* Warn about duplicate methods in fn_fields.
1731 Sort methods that are not special (i.e., constructors, destructors,
1732 and type conversion operators) so that we can find them faster in
1733 search. */
1735 static void
1737 {
1738 tree fn_fields;
1748 /* Clear DECL_IN_AGGR_P for all functions. */
1753 /* Issue warnings about private constructors and such. If there are
1754 no methods, then some public defaults are generated. */
1757 /* The type conversion ops have to live at the front of the vec, so we
1758 can't sort them. */
1767 }
1769 /* Make BINFO's vtable have N entries, including RTTI entries,
1770 vbase and vcall offsets, etc. Set its type and call the back end
1771 to lay it out. */
1773 static void
1775 {
1776 tree atype;
1777 tree vtable;
1783 /* We may have to grow the vtable. */
1786 {
1790 }
1791 }
1793 /* True iff FNDECL and BASE_FNDECL (both non-static member functions)
1794 have the same signature. */
1796 int
1798 {
1799 /* One destructor overrides another if they are the same kind of
1800 destructor. */
1804 /* But a non-destructor never overrides a destructor, nor vice
1805 versa, nor do different kinds of destructors override
1806 one-another. For example, a complete object destructor does not
1807 override a deleting destructor. */
1816 {
1824 }
1826 }
1828 /* Returns TRUE if DERIVED is a binfo containing the binfo BASE as a
1829 subobject. */
1831 static bool
1833 {
1834 tree probe;
1837 {
1841 /* If we meet a virtual base, we can't follow the inheritance
1842 any more. See if the complete type of DERIVED contains
1843 such a virtual base. */
1846 }
1848 }
1851 /* The function for which we are trying to find a final overrider. */
1852 tree fn;
1853 /* The base class in which the function was declared. */
1854 tree declaring_base;
1855 /* The candidate overriders. */
1856 tree candidates;
1857 /* Path to most derived. */
1861 /* Add the overrider along the current path to FFOD->CANDIDATES.
1862 Returns true if an overrider was found; false otherwise. */
1864 static bool
1868 {
1869 tree method;
1871 /* If BINFO is not the most derived type, try a more derived class.
1872 A definition there will overrider a definition here. */
1874 {
1875 depth--;
1879 }
1883 {
1886 /* Remove any candidates overridden by this new function. */
1888 {
1889 /* If *CANDIDATE overrides METHOD, then METHOD
1890 cannot override anything else on the list. */
1893 /* If METHOD overrides *CANDIDATE, remove *CANDIDATE. */
1896 else
1898 }
1900 /* Add the new function. */
1903 }
1906 }
1908 /* Called from find_final_overrider via dfs_walk. */
1910 static tree
1912 {
1920 }
1922 static tree
1924 {
1929 }
1931 /* Returns a TREE_LIST whose TREE_PURPOSE is the final overrider for
1932 FN and whose TREE_VALUE is the binfo for the base where the
1933 overriding occurs. BINFO (in the hierarchy dominated by the binfo
1934 DERIVED) is the base object in which FN is declared. */
1936 static tree
1938 {
1939 find_final_overrider_data ffod;
1941 /* Getting this right is a little tricky. This is valid:
1943 struct S { virtual void f (); };
1944 struct T { virtual void f (); };
1945 struct U : public S, public T { };
1947 even though calling `f' in `U' is ambiguous. But,
1949 struct R { virtual void f(); };
1950 struct S : virtual public R { virtual void f (); };
1951 struct T : virtual public R { virtual void f (); };
1952 struct U : public S, public T { };
1954 is not -- there's no way to decide whether to put `S::f' or
1955 `T::f' in the vtable for `R'.
1957 The solution is to look at all paths to BINFO. If we find
1958 different overriders along any two, then there is a problem. */
1962 /* Determine the depth of the hierarchy. */
1973 /* If there was no winner, issue an error message. */
1978 }
1980 /* Return the index of the vcall offset for FN when TYPE is used as a
1981 virtual base. */
1983 static tree
1985 {
1987 tree_pair_p p;
1995 /* There should always be an appropriate index. */
1997 }
1999 /* Update an entry in the vtable for BINFO, which is in the hierarchy
2000 dominated by T. FN has been overridden in BINFO; VIRTUALS points to the
2001 corresponding position in the BINFO_VIRTUALS list. */
2003 static void
2006 {
2007 tree b;
2008 tree overrider;
2009 tree delta;
2010 tree virtual_base;
2011 tree first_defn;
2017 /* Find the nearest primary base (possibly binfo itself) which defines
2018 this function; this is the class the caller will convert to when
2019 calling FN through BINFO. */
2021 {
2026 /* The nearest definition is from a lost primary. */
2029 }
2032 /* Find the final overrider. */
2035 {
2038 }
2041 /* Check for adjusting covariant return types. */
2049 /* If the overrider is invalid, don't even try. */
2051 {
2052 /* If FN is a covariant thunk, we must figure out the adjustment
2053 to the final base FN was converting to. As OVERRIDER_TARGET might
2054 also be converting to the return type of FN, we have to
2055 combine the two conversions here. */
2062 {
2066 }
2067 else
2071 /* Find the equivalent binfo within the return type of the
2072 overriding function. We will want the vbase offset from
2073 there. */
2075 over_return);
2078 {
2079 /* There was no existing virtual thunk (which takes
2080 precedence). So find the binfo of the base function's
2081 return type within the overriding function's return type.
2082 We cannot call lookup base here, because we're inside a
2083 dfs_walk, and will therefore clobber the BINFO_MARKED
2084 flags. Fortunately we know the covariancy is valid (it
2085 has already been checked), so we can just iterate along
2086 the binfos, which have been chained in inheritance graph
2087 order. Of course it is lame that we have to repeat the
2088 search here anyway -- we should really be caching pieces
2089 of the vtable and avoiding this repeated work. */
2092 /* Find the base binfo within the overriding function's
2093 return type. We will always find a thunk_binfo, except
2094 when the covariancy is invalid (which we will have
2095 already diagnosed). */
2098 thunk_binfo;
2104 /* See if virtual inheritance is involved. */
2106 virtual_offset;
2113 {
2117 {
2118 /* We convert via virtual base. Adjust the fixed
2119 offset to be from there. */
2120 offset = size_diffop
2123 }
2125 /* There was an existing fixed offset, this must be
2126 from the base just converted to, and the base the
2127 FN was thunking to. */
2129 else
2131 }
2132 }
2135 /* Replace the overriding function with a covariant thunk. We
2136 will emit the overriding function in its own slot as
2137 well. */
2140 }
2141 else
2145 /* Assume that we will produce a thunk that convert all the way to
2146 the final overrider, and not to an intermediate virtual base. */
2149 /* See if we can convert to an intermediate virtual base first, and then
2150 use the vcall offset located there to finish the conversion. */
2152 {
2153 /* If we find the final overrider, then we can stop
2154 walking. */
2159 /* If we find a virtual base, and we haven't yet found the
2160 overrider, then there is a virtual base between the
2161 declaring base (first_defn) and the final overrider. */
2163 {
2166 }
2167 }
2170 {
2171 /* The ABI specifies that a covariant thunk includes a mangling
2172 for a this pointer adjustment. This-adjusting thunks that
2173 override a function from a virtual base have a vcall
2174 adjustment. When the virtual base in question is a primary
2175 virtual base, we know the adjustments are zero, (and in the
2176 non-covariant case, we would not use the thunk).
2177 Unfortunately we didn't notice this could happen, when
2178 designing the ABI and so never mandated that such a covariant
2179 thunk should be emitted. Because we must use the ABI mandated
2180 name, we must continue searching from the binfo where we
2181 found the most recent definition of the function, towards the
2182 primary binfo which first introduced the function into the
2183 vtable. If that enters a virtual base, we must use a vcall
2184 this-adjusting thunk. Bleah! */
2193 /* Even if we find a virtual base, the correct delta is
2194 between the overrider and the binfo we're building a vtable
2195 for. */
2197 }
2199 /* Compute the constant adjustment to the `this' pointer. The
2200 `this' pointer, when this function is called, will point at BINFO
2201 (or one of its primary bases, which are at the same offset). */
2203 /* The `this' pointer needs to be adjusted from the declaration to
2204 the nearest virtual base. */
2208 /* If the nearest definition is in a lost primary, we don't need an
2209 entry in our vtable. Except possibly in a constructor vtable,
2210 if we happen to get our primary back. In that case, the offset
2211 will be zero, as it will be a primary base. */
2213 else
2214 /* The `this' pointer needs to be adjusted from pointing to
2215 BINFO to pointing at the base where the final overrider
2216 appears. */
2217 virtual_covariant:
2227 else
2229 }
2231 /* Called from modify_all_vtables via dfs_walk. */
2233 static tree
2235 {
2237 tree virtuals;
2238 tree old_virtuals;
2242 /* A base without a vtable needs no modification, and its bases
2243 are uninteresting. */
2248 /* Don't do the primary vtable, if it's new. */
2252 /* There's no need to modify the vtable for a non-virtual primary
2253 base; we're not going to use that vtable anyhow. We do still
2254 need to do this for virtual primary bases, as they could become
2255 non-primary in a construction vtable. */
2260 /* Now, go through each of the virtual functions in the virtual
2261 function table for BINFO. Find the final overrider, and update
2262 the BINFO_VIRTUALS list appropriately. */
2265 virtuals;
2269 binfo,
2274 }
2276 /* Update all of the primary and secondary vtables for T. Create new
2277 vtables as required, and initialize their RTTI information. Each
2278 of the functions in VIRTUALS is declared in T and may override a
2279 virtual function from a base class; find and modify the appropriate
2280 entries to point to the overriding functions. Returns a list, in
2281 declaration order, of the virtual functions that are declared in T,
2282 but do not appear in the primary base class vtable, and which
2283 should therefore be appended to the end of the vtable for T. */
2285 static tree
2287 {
2291 /* Update all of the vtables. */
2294 /* Add virtual functions not already in our primary vtable. These
2295 will be both those introduced by this class, and those overridden
2296 from secondary bases. It does not include virtuals merely
2297 inherited from secondary bases. */
2299 {
2304 {
2305 /* We don't need to adjust the `this' pointer when
2306 calling this function. */
2310 /* This is a function not already in our vtable. Keep it. */
2312 }
2313 else
2314 /* We've already got an entry for this function. Skip it. */
2316 }
2319 }
2321 /* Get the base virtual function declarations in T that have the
2322 indicated NAME. */
2324 static tree
2326 {
2327 tree methods;
2332 /* Find virtual functions in T with the indicated NAME. */
2336 methods;
2338 {
2344 }
2350 {
2353 base_fndecls);
2354 }
2357 }
2359 /* If this declaration supersedes the declaration of
2360 a method declared virtual in the base class, then
2361 mark this field as being virtual as well. */
2363 void
2365 {
2367 /* In [temp.mem] we have:
2369 A specialization of a member function template does not
2370 override a virtual function from a base class. */
2377 /* Set DECL_VINDEX to a value that is neither an INTEGER_CST nor
2378 the error_mark_node so that we know it is an overriding
2379 function. */
2383 {
2387 }
2388 }
2390 /* Warn about hidden virtual functions that are not overridden in t.
2391 We know that constructors and destructors don't apply. */
2393 static void
2395 {
2397 tree fns;
2400 /* We go through each separately named virtual function. */
2404 {
2405 tree fn;
2406 tree name;
2407 tree fndecl;
2408 tree base_fndecls;
2409 tree base_binfo;
2410 tree binfo;
2413 /* All functions in this slot in the CLASSTYPE_METHOD_VEC will
2414 have the same name. Figure out what name that is. */
2416 /* There are no possibly hidden functions yet. */
2418 /* Iterate through all of the base classes looking for possibly
2419 hidden functions. */
2422 {
2425 base_fndecls);
2426 }
2428 /* If there are no functions to hide, continue. */
2432 /* Remove any overridden functions. */
2434 {
2437 {
2441 /* If the method from the base class has the same
2442 signature as the method from the derived class, it
2443 has been overridden. */
2446 else
2448 }
2449 }
2451 /* Now give a warning for all base functions without overriders,
2452 as they are hidden. */
2454 {
2455 /* Here we know it is a hider, and no overrider exists. */
2459 }
2460 }
2461 }
2463 /* Check for things that are invalid. There are probably plenty of other
2464 things we should check for also. */
2466 static void
2468 {
2469 tree field;
2472 {
2480 {
2484 {
2485 /* We're generally only interested in entities the user
2486 declared, but we also find nested classes by noticing
2487 the TYPE_DECL that we create implicitly. You're
2488 allowed to put one anonymous union inside another,
2489 though, so we explicitly tolerate that. We use
2490 TYPE_ANONYMOUS_P rather than ANON_AGGR_TYPE_P so that
2491 we also allow unnamed types used for defining fields. */
2498 {
2502 else
2506 }
2509 {
2512 else
2514 }
2516 {
2519 else
2521 }
2525 }
2526 }
2527 }
2528 }
2530 /* Add T to CLASSTYPE_DECL_LIST of current_class_type which
2531 will be used later during class template instantiation.
2532 When FRIEND_P is zero, T can be a static member data (VAR_DECL),
2533 a non-static member data (FIELD_DECL), a member function
2534 (FUNCTION_DECL), a nested type (RECORD_TYPE, ENUM_TYPE),
2535 a typedef (TYPE_DECL) or a member class template (TEMPLATE_DECL)
2536 When FRIEND_P is nonzero, T is either a friend class
2537 (RECORD_TYPE, TEMPLATE_DECL) or a friend function
2538 (FUNCTION_DECL, TEMPLATE_DECL). */
2540 void
2542 {
2543 /* Save some memory by not creating TREE_LIST if TYPE is not template. */
2548 }
2550 /* Create default constructors, assignment operators, and so forth for
2551 the type indicated by T, if they are needed. CANT_HAVE_CONST_CTOR,
2552 and CANT_HAVE_CONST_ASSIGNMENT are nonzero if, for whatever reason,
2553 the class cannot have a default constructor, copy constructor
2554 taking a const reference argument, or an assignment operator taking
2555 a const reference, respectively. */
2557 static void
2561 {
2562 /* Destructor. */
2564 {
2565 /* In general, we create destructors lazily. */
2567 /* However, if the implicit destructor is non-trivial
2568 destructor, we sometimes have to create it at this point. */
2570 {
2574 /* If this a Java class, any non-trivial destructor is
2575 invalid, even if compiler-generated. Therefore, if the
2576 destructor is non-trivial we create it now. */
2578 else
2579 {
2580 tree binfo;
2581 tree base_binfo;
2584 /* If the implicit destructor will be virtual, then we must
2585 generate it now because (unfortunately) we do not
2586 generate virtual tables lazily. */
2589 {
2590 tree base_type;
2591 tree dtor;
2596 {
2599 }
2600 }
2601 }
2603 /* If we can't get away with being lazy, generate the destructor
2604 now. */
2607 }
2608 }
2610 /* [class.ctor]
2612 If there is no user-declared constructor for a class, a default
2613 constructor is implicitly declared. */
2615 {
2618 }
2620 /* [class.ctor]
2622 If a class definition does not explicitly declare a copy
2623 constructor, one is declared implicitly. */
2625 {
2629 }
2631 /* If there is no assignment operator, one will be created if and
2632 when it is needed. For now, just record whether or not the type
2633 of the parameter to the assignment operator will be a const or
2634 non-const reference. */
2636 {
2640 }
2641 }
2643 /* Subroutine of finish_struct_1. Recursively count the number of fields
2644 in TYPE, including anonymous union members. */
2646 static int
2648 {
2649 tree x;
2652 {
2655 else
2657 }
2659 }
2661 /* Subroutine of finish_struct_1. Recursively add all the fields in the
2662 TREE_LIST FIELDS to the SORTED_FIELDS_TYPE elts, starting at offset IDX. */
2664 static int
2666 {
2667 tree x;
2669 {
2672 else
2674 }
2676 }
2678 /* FIELD is a bit-field. We are finishing the processing for its
2679 enclosing type. Issue any appropriate messages and set appropriate
2680 flags. Returns false if an error has been diagnosed. */
2682 static bool
2684 {
2686 tree w;
2688 /* Extract the declared width of the bitfield, which has been
2689 temporarily stashed in DECL_INITIAL. */
2692 /* Remove the bit-field width indicator so that the rest of the
2693 compiler does not treat that value as an initializer. */
2696 /* Detect invalid bit-field type. */
2698 {
2701 }
2702 else
2703 {
2704 /* Avoid the non_lvalue wrapper added by fold for PLUS_EXPRs. */
2707 /* detect invalid field size. */
2711 {
2714 }
2716 {
2719 }
2721 {
2724 }
2731 tree_int_cst_min_precision
2735 tree_int_cst_min_precision
2739 }
2742 {
2746 }
2747 else
2748 {
2749 /* Non-bit-fields are aligned for their type. */
2753 }
2754 }
2756 /* FIELD is a non bit-field. We are finishing the processing for its
2757 enclosing type T. Issue any appropriate messages and set appropriate
2758 flags. */
2760 static void
2762 tree t,
2766 {
2769 /* An anonymous union cannot contain any fields which would change
2770 the settings of CANT_HAVE_CONST_CTOR and friends. */
2772 ;
2773 /* And, we don't set TYPE_HAS_CONST_INIT_REF, etc., for anonymous
2774 structs. So, we recurse through their fields here. */
2776 {
2777 tree fields;
2783 }
2784 /* Check members with class type for constructors, destructors,
2785 etc. */
2787 {
2788 /* Never let anything with uninheritable virtuals
2789 make it through without complaint. */
2793 {
2796 field);
2801 field);
2802 }
2803 else
2804 {
2811 }
2818 }
2820 {
2821 /* `build_class_init_list' does not recognize
2822 non-FIELD_DECLs. */
2826 }
2827 }
2829 /* Check the data members (both static and non-static), class-scoped
2830 typedefs, etc., appearing in the declaration of T. Issue
2831 appropriate diagnostics. Sets ACCESS_DECLS to a list (in
2832 declaration order) of access declarations; each TREE_VALUE in this
2833 list is a USING_DECL.
2835 In addition, set the following flags:
2837 EMPTY_P
2838 The class is empty, i.e., contains no non-static data members.
2840 CANT_HAVE_CONST_CTOR_P
2841 This class cannot have an implicitly generated copy constructor
2842 taking a const reference.
2844 CANT_HAVE_CONST_ASN_REF
2845 This class cannot have an implicitly generated assignment
2846 operator taking a const reference.
2848 All of these flags should be initialized before calling this
2849 function.
2851 Returns a pointer to the end of the TYPE_FIELDs chain; additional
2852 fields can be added by adding to this chain. */
2854 static void
2858 {
2865 /* Assume there are no access declarations. */
2867 /* Assume this class has no pointer members. */
2869 /* Assume none of the members of this class have default
2870 initializations. */
2874 {
2881 {
2882 /* Prune the access declaration from the list of fields. */
2885 /* Save the access declarations for our caller. */
2888 /* Since we've reset *FIELD there's no reason to skip to the
2889 next field. */
2892 }
2898 /* If we've gotten this far, it's a data member, possibly static,
2899 or an enumerator. */
2902 /* When this goes into scope, it will be a non-local reference. */
2906 {
2907 /* [class.union]
2909 If a union contains a static data member, or a member of
2910 reference type, the program is ill-formed. */
2912 {
2915 }
2917 {
2922 }
2923 }
2925 /* Perform error checking that did not get done in
2926 grokdeclarator. */
2928 {
2932 }
2934 {
2938 }
2946 /* Now it can only be a FIELD_DECL. */
2951 /* If this is of reference type, check if it needs an init. */
2953 {
2958 /* ARM $12.6.2: [A member initializer list] (or, for an
2959 aggregate, initialization by a brace-enclosed list) is the
2960 only way to initialize nonstatic const and reference
2961 members. */
2963 }
2968 {
2970 {
2971 warning
2974 x);
2976 }
2979 }
2982 /* We don't treat zero-width bitfields as making a class
2983 non-empty. */
2984 ;
2985 else
2986 {
2987 /* The class is non-empty. */
2989 /* The class is not even nearly empty. */
2991 /* If one of the data members contains an empty class,
2992 so does T. */
2996 }
2998 /* This is used by -Weffc++ (see below). Warn only for pointers
2999 to members which might hold dynamic memory. So do not warn
3000 for pointers to functions or pointers to members. */
3007 {
3012 }
3018 /* DR 148 now allows pointers to members (which are POD themselves),
3019 to be allowed in POD structs. */
3025 /* If any field is const, the structure type is pseudo-const. */
3027 {
3032 /* ARM $12.6.2: [A member initializer list] (or, for an
3033 aggregate, initialization by a brace-enclosed list) is the
3034 only way to initialize nonstatic const and reference
3035 members. */
3037 }
3038 /* A field that is pseudo-const makes the structure likewise. */
3040 {
3045 }
3047 /* Core issue 80: A nonstatic data member is required to have a
3048 different name from the class iff the class has a
3049 user-declared constructor. */
3054 /* We set DECL_C_BIT_FIELD in grokbitfield.
3055 If the type and width are valid, we'll also set DECL_BIT_FIELD. */
3058 cant_have_const_ctor_p,
3059 no_const_asn_ref_p,
3061 }
3063 /* Effective C++ rule 11: if a class has dynamic memory held by pointers,
3064 it should also define a copy constructor and an assignment operator to
3065 implement the correct copy semantic (deep vs shallow, etc.). As it is
3066 not feasible to check whether the constructors do allocate dynamic memory
3067 and store it within members, we approximate the warning like this:
3069 -- Warn only if there are members which are pointers
3070 -- Warn only if there is a non-trivial constructor (otherwise,
3071 there cannot be memory allocated).
3072 -- Warn only if there is a non-trivial destructor. We assume that the
3073 user at least implemented the cleanup correctly, and a destructor
3074 is needed to free dynamic memory.
3076 This seems enough for practical purposes. */
3078 && has_pointers
3082 {
3086 {
3091 }
3095 }
3097 /* If any of the fields couldn't be packed, unset TYPE_PACKED. */
3101 /* Check anonymous struct/anonymous union fields. */
3104 /* We've built up the list of access declarations in reverse order.
3105 Fix that now. */
3107 }
3109 /* If TYPE is an empty class type, records its OFFSET in the table of
3110 OFFSETS. */
3112 static int
3114 {
3115 splay_tree_node n;
3120 /* Record the location of this empty object in OFFSETS. */
3128 type,
3132 }
3134 /* Returns nonzero if TYPE is an empty class type and there is
3135 already an entry in OFFSETS for the same TYPE as the same OFFSET. */
3137 static int
3139 {
3140 splay_tree_node n;
3141 tree t;
3146 /* Record the location of this empty object in OFFSETS. */
3156 }
3158 /* Walk through all the subobjects of TYPE (located at OFFSET). Call
3159 F for every subobject, passing it the type, offset, and table of
3160 OFFSETS. If VBASES_P is one, then virtual non-primary bases should
3161 be traversed.
3163 If MAX_OFFSET is non-NULL, then subobjects with an offset greater
3164 than MAX_OFFSET will not be walked.
3166 If F returns a nonzero value, the traversal ceases, and that value
3167 is returned. Otherwise, returns zero. */
3169 static int
3171 subobject_offset_fn f,
3172 tree offset,
3173 splay_tree offsets,
3174 tree max_offset,
3176 {
3180 /* If this OFFSET is bigger than the MAX_OFFSET, then we should
3181 stop. */
3189 {
3193 }
3196 {
3197 tree field;
3198 tree binfo;
3201 /* Avoid recursing into objects that are not interesting. */
3205 /* Record the location of TYPE. */
3210 /* Iterate through the direct base classes of TYPE. */
3214 {
3215 tree binfo_offset;
3228 offset,
3230 else
3231 {
3232 tree orig_binfo;
3233 /* We cannot rely on BINFO_OFFSET being set for the base
3234 class yet, but the offsets for direct non-virtual
3235 bases can be calculated by going back to the TYPE. */
3238 offset,
3240 }
3243 f,
3244 binfo_offset,
3245 offsets,
3246 max_offset,
3251 }
3254 {
3258 /* Iterate through the virtual base classes of TYPE. In G++
3259 3.2, we included virtual bases in the direct base class
3260 loop above, which results in incorrect results; the
3261 correct offsets for virtual bases are only known when
3262 working with the most derived type. */
3266 {
3268 f,
3270 offset,
3272 offsets,
3273 max_offset,
3277 }
3278 else
3279 {
3280 /* We still have to walk the primary base, if it is
3281 virtual. (If it is non-virtual, then it was walked
3282 above.) */
3288 {
3289 r = (walk_subobject_offsets
3294 }
3295 }
3296 }
3298 /* Iterate through the fields of TYPE. */
3301 {
3302 tree field_offset;
3306 else
3307 /* In G++ 3.2, DECL_FIELD_OFFSET was used. */
3311 f,
3313 offset,
3314 field_offset),
3315 offsets,
3316 max_offset,
3320 }
3321 }
3323 {
3326 tree index;
3328 /* Avoid recursing into objects that are not interesting. */
3333 /* Step through each of the elements in the array. */
3335 /* G++ 3.2 had an off-by-one error here. */
3340 {
3342 f,
3343 offset,
3344 offsets,
3345 max_offset,
3351 /* If this new OFFSET is bigger than the MAX_OFFSET, then
3352 there's no point in iterating through the remaining
3353 elements of the array. */
3356 }
3357 }
3360 }
3362 /* Record all of the empty subobjects of TYPE (either a type or a
3363 binfo). If IS_DATA_MEMBER is true, then a non-static data member
3364 is being placed at OFFSET; otherwise, it is a base class that is
3365 being placed at OFFSET. */
3367 static void
3369 tree offset,
3370 splay_tree offsets,
3372 {
3373 tree max_offset;
3374 /* If recording subobjects for a non-static data member or a
3375 non-empty base class , we do not need to record offsets beyond
3376 the size of the biggest empty class. Additional data members
3377 will go at the end of the class. Additional base classes will go
3378 either at offset zero (if empty, in which case they cannot
3379 overlap with offsets past the size of the biggest empty class) or
3380 at the end of the class.
3382 However, if we are placing an empty base class, then we must record
3383 all offsets, as either the empty class is at offset zero (where
3384 other empty classes might later be placed) or at the end of the
3385 class (where other objects might then be placed, so other empty
3386 subobjects might later overlap). */
3390 else
3394 }
3396 /* Returns nonzero if any of the empty subobjects of TYPE (located at
3397 OFFSET) conflict with entries in OFFSETS. If VBASES_P is nonzero,
3398 virtual bases of TYPE are examined. */
3400 static int
3402 tree offset,
3403 splay_tree offsets,
3405 {
3406 splay_tree_node max_node;
3408 /* Get the node in OFFSETS that indicates the maximum offset where
3409 an empty subobject is located. */
3411 /* If there aren't any empty subobjects, then there's no point in
3412 performing this check. */
3418 vbases_p);
3419 }
3421 /* DECL is a FIELD_DECL corresponding either to a base subobject of a
3422 non-static data member of the type indicated by RLI. BINFO is the
3423 binfo corresponding to the base subobject, OFFSETS maps offsets to
3424 types already located at those offsets. This function determines
3425 the position of the DECL. */
3427 static void
3429 tree decl,
3430 tree binfo,
3431 splay_tree offsets)
3432 {
3435 tree type;
3438 {
3439 /* For the purposes of determining layout conflicts, we want to
3440 use the class type of BINFO; TREE_TYPE (DECL) will be the
3441 CLASSTYPE_AS_BASE version, which does not contain entries for
3442 zero-sized bases. */
3445 }
3446 else
3447 {
3450 }
3452 /* Try to place the field. It may take more than one try if we have
3453 a hard time placing the field without putting two objects of the
3454 same type at the same address. */
3456 {
3459 /* Place this field. */
3463 /* We have to check to see whether or not there is already
3464 something of the same type at the offset we're about to use.
3465 For example, consider:
3467 struct S {};
3468 struct T : public S { int i; };
3469 struct U : public S, public T {};
3471 Here, we put S at offset zero in U. Then, we can't put T at
3472 offset zero -- its S component would be at the same address
3473 as the S we already allocated. So, we have to skip ahead.
3474 Since all data members, including those whose type is an
3475 empty class, have nonzero size, any overlap can happen only
3476 with a direct or indirect base-class -- it can't happen with
3477 a data member. */
3478 /* In a union, overlap is permitted; all members are placed at
3479 offset zero. */
3482 /* G++ 3.2 did not check for overlaps when placing a non-empty
3483 virtual base. */
3488 {
3489 /* Strip off the size allocated to this field. That puts us
3490 at the first place we could have put the field with
3491 proper alignment. */
3494 /* Bump up by the alignment required for the type. */
3495 rli->bitpos
3501 }
3502 else
3503 /* There was no conflict. We're done laying out this field. */
3505 }
3507 /* Now that we know where it will be placed, update its
3508 BINFO_OFFSET. */
3510 /* Indirect virtual bases may have a nonzero BINFO_OFFSET at
3511 this point because their BINFO_OFFSET is copied from another
3512 hierarchy. Therefore, we may not need to add the entire
3513 OFFSET. */
3518 }
3520 /* Returns true if TYPE is empty and OFFSET is nonzero. */
3522 static int
3524 tree offset,
3525 splay_tree offsets ATTRIBUTE_UNUSED)
3526 {
3528 }
3530 /* Layout the empty base BINFO. EOC indicates the byte currently just
3531 past the end of the class, and should be correctly aligned for a
3532 class of the type indicated by BINFO; OFFSETS gives the offsets of
3533 the empty bases allocated so far. T is the most derived
3534 type. Return nonzero iff we added it at the end. */
3536 static bool
3539 {
3540 tree alignment;
3544 /* This routine should only be used for empty classes. */
3549 {
3551 propagate_binfo_offsets
3553 else
3555 "offset of empty base %qT may not be ABI-compliant and may"
3558 }
3560 /* This is an empty base class. We first try to put it at offset
3561 zero. */
3564 offsets,
3566 {
3567 /* That didn't work. Now, we move forward from the next
3568 available spot in the class. */
3572 {
3575 offsets,
3577 /* We finally found a spot where there's no overlap. */
3580 /* There's overlap here, too. Bump along to the next spot. */
3582 }
3583 }
3586 {
3591 }
3594 }
3596 /* Layout the base given by BINFO in the class indicated by RLI.
3597 *BASE_ALIGN is a running maximum of the alignments of
3598 any base class. OFFSETS gives the location of empty base
3599 subobjects. T is the most derived type. Return nonzero if the new
3600 object cannot be nearly-empty. A new FIELD_DECL is inserted at
3601 *NEXT_FIELD, unless BINFO is for an empty base class.
3603 Returns the location at which the next field should be inserted. */
3608 {
3613 /* This error is now reported in xref_tag, thus giving better
3614 location information. */
3617 /* Place the base class. */
3619 {
3620 tree decl;
3622 /* The containing class is non-empty because it has a non-empty
3623 base class. */
3626 /* Create the FIELD_DECL. */
3632 {
3640 /* Try to place the field. It may take more than one try if we
3641 have a hard time placing the field without putting two
3642 objects of the same type at the same address. */
3644 /* Add the new FIELD_DECL to the list of fields for T. */
3648 }
3649 }
3650 else
3651 {
3652 tree eoc;
3655 /* On some platforms (ARM), even empty classes will not be
3656 byte-aligned. */
3660 /* A nearly-empty class "has no proper base class that is empty,
3661 not morally virtual, and at an offset other than zero." */
3663 {
3666 /* The check above (used in G++ 3.2) is insufficient because
3667 an empty class placed at offset zero might itself have an
3668 empty base at a nonzero offset. */
3670 empty_base_at_nonzero_offset_p,
3671 size_zero_node,
3675 {
3678 else
3680 "class %qT will be considered nearly empty in a "
3682 }
3683 }
3685 /* We do not create a FIELD_DECL for empty base classes because
3686 it might overlap some other field. We want to be able to
3687 create CONSTRUCTORs for the class by iterating over the
3688 FIELD_DECLs, and the back end does not handle overlapping
3689 FIELD_DECLs. */
3691 /* An empty virtual base causes a class to be non-empty
3692 -- but in that case we do not need to clear CLASSTYPE_EMPTY_P
3693 here because that was already done when the virtual table
3694 pointer was created. */
3695 }
3697 /* Record the offsets of BINFO and its base subobjects. */
3700 offsets,
3704 }
3706 /* Layout all of the non-virtual base classes. Record empty
3707 subobjects in OFFSETS. T is the most derived type. Return nonzero
3708 if the type cannot be nearly empty. The fields created
3709 corresponding to the base classes will be inserted at
3710 *NEXT_FIELD. */
3712 static void
3715 {
3716 /* Chain to hold all the new FIELD_DECLs which stand in for base class
3717 subobjects. */
3722 /* The primary base class is always allocated first. */
3727 /* Now allocate the rest of the bases. */
3729 {
3730 tree base_binfo;
3734 /* The primary base was already allocated above, so we don't
3735 need to allocate it again here. */
3739 /* Virtual bases are added at the end (a primary virtual base
3740 will have already been added). */
3746 }
3747 }
3749 /* Go through the TYPE_METHODS of T issuing any appropriate
3750 diagnostics, figuring out which methods override which other
3751 methods, and so forth. */
3753 static void
3755 {
3756 tree x;
3759 {
3763 /* The name of the field is the original field name
3764 Save this in auxiliary field for later overloading. */
3766 {
3770 }
3771 /* All user-provided destructors are non-trivial. */
3774 }
3775 }
3777 /* FN is a constructor or destructor. Clone the declaration to create
3778 a specialized in-charge or not-in-charge version, as indicated by
3779 NAME. */
3781 static tree
3783 {
3784 tree parms;
3785 tree clone;
3787 /* Copy the function. */
3789 /* Remember where this function came from. */
3792 /* Reset the function name. */
3795 /* There's no pending inline data for this function. */
3798 /* And it hasn't yet been deferred. */
3801 /* The base-class destructor is not virtual. */
3803 {
3807 }
3809 /* If there was an in-charge parameter, drop it from the function
3810 type. */
3812 {
3813 tree basetype;
3814 tree parmtypes;
3815 tree exceptions;
3820 /* Skip the `this' parameter. */
3822 /* Skip the in-charge parameter. */
3824 /* And the VTT parm, in a complete [cd]tor. */
3828 /* If this is subobject constructor or destructor, add the vtt
3829 parameter. */
3833 parmtypes);
3836 exceptions);
3840 }
3842 /* Copy the function parameters. But, DECL_ARGUMENTS on a TEMPLATE_DECL
3843 aren't function parameters; those are the template parameters. */
3845 {
3847 /* Remove the in-charge parameter. */
3849 {
3853 }
3854 /* And the VTT parm, in a complete [cd]tor. */
3856 {
3859 else
3860 {
3864 }
3865 }
3868 {
3871 }
3872 }
3874 /* Create the RTL for this function. */
3878 /* Make it easy to find the CLONE given the FN. */
3882 /* If this is a template, handle the DECL_TEMPLATE_RESULT as well. */
3884 {
3885 tree result;
3892 }
3897 }
3899 /* Produce declarations for all appropriate clones of FN. If
3900 UPDATE_METHOD_VEC_P is nonzero, the clones are added to the
3901 CLASTYPE_METHOD_VEC as well. */
3903 void
3905 {
3906 tree clone;
3908 /* Avoid inappropriate cloning. */
3914 {
3915 /* For each constructor, we need two variants: an in-charge version
3916 and a not-in-charge version. */
3923 }
3924 else
3925 {
3928 /* For each destructor, we need three variants: an in-charge
3929 version, a not-in-charge version, and an in-charge deleting
3930 version. We clone the deleting version first because that
3931 means it will go second on the TYPE_METHODS list -- and that
3932 corresponds to the correct layout order in the virtual
3933 function table.
3935 For a non-virtual destructor, we do not build a deleting
3936 destructor. */
3938 {
3942 }
3949 }
3951 /* Note that this is an abstract function that is never emitted. */
3953 }
3955 /* DECL is an in charge constructor, which is being defined. This will
3956 have had an in class declaration, from whence clones were
3957 declared. An out-of-class definition can specify additional default
3958 arguments. As it is the clones that are involved in overload
3959 resolution, we must propagate the information from the DECL to its
3960 clones. */
3962 void
3964 {
3965 tree clone;
3969 {
3976 /* Skip the 'this' parameter. */
3992 {
3997 {
3998 /* A default parameter has been added. Adjust the
3999 clone's parameters. */
4002 tree type;
4007 {
4010 clone_parms);
4012 }
4015 clone_parms);
4022 }
4023 }
4025 }
4026 }
4028 /* For each of the constructors and destructors in T, create an
4029 in-charge and not-in-charge variant. */
4031 static void
4033 {
4034 tree fns;
4036 /* If for some reason we don't have a CLASSTYPE_METHOD_VEC, we bail
4037 out now. */
4045 }
4047 /* Returns true iff class T has a user-defined constructor other than
4048 the default constructor. */
4050 bool
4052 {
4053 tree fns;
4059 {
4066 }
4069 }
4071 /* Returns true iff FN is a user-provided function, i.e. user-declared
4072 and not defaulted at its first declaration. */
4074 static bool
4076 {
4079 else
4083 }
4085 /* Returns true iff class T has a user-provided constructor. */
4087 bool
4089 {
4090 tree fns;
4095 /* This can happen in error cases; avoid crashing. */
4104 }
4106 /* Returns true iff class T has a user-provided default constructor. */
4108 bool
4110 {
4117 {
4121 {
4127 }
4128 }
4131 }
4133 /* Returns true if FN can be explicitly defaulted. */
4135 bool
4137 {
4139 {
4145 else
4147 }
4152 else
4154 }
4156 /* Remove all zero-width bit-fields from T. */
4158 static void
4160 {
4165 {
4170 else
4172 }
4173 }
4175 /* Returns TRUE iff we need a cookie when dynamically allocating an
4176 array whose elements have the indicated class TYPE. */
4178 static bool
4180 {
4181 tree fns;
4186 /* If there's a non-trivial destructor, we need a cookie. In order
4187 to iterate through the array calling the destructor for each
4188 element, we'll have to know how many elements there are. */
4192 /* If the usual deallocation function is a two-argument whose second
4193 argument is of type `size_t', then we have to pass the size of
4194 the array to the deallocation function, so we will need to store
4195 a cookie. */
4199 /* If there are no `operator []' members, or the lookup is
4200 ambiguous, then we don't need a cookie. */
4203 /* Loop through all of the functions. */
4205 {
4206 tree fn;
4207 tree second_parm;
4209 /* Select the current function. */
4211 /* See if this function is a one-argument delete function. If
4212 it is, then it will be the usual deallocation function. */
4216 /* Do not consider this function if its second argument is an
4217 ellipsis. */
4220 /* Otherwise, if we have a two-argument function and the second
4221 argument is `size_t', it will be the usual deallocation
4222 function -- unless there is one-argument function, too. */
4226 }
4229 }
4231 /* Check the validity of the bases and members declared in T. Add any
4232 implicitly-generated functions (like copy-constructors and
4233 assignment operators). Compute various flag bits (like
4234 CLASSTYPE_NON_POD_T) for T. This routine works purely at the C++
4235 level: i.e., independently of the ABI in use. */
4237 static void
4239 {
4240 /* Nonzero if the implicitly generated copy constructor should take
4241 a non-const reference argument. */
4243 /* Nonzero if the implicitly generated assignment operator
4244 should take a non-const reference argument. */
4246 tree access_decls;
4250 /* By default, we use const reference arguments and generate default
4251 constructors. */
4255 /* Check all the base-classes. */
4259 /* Check all the method declarations. */
4262 /* Save the initial values of these flags which only indicate whether
4263 or not the class has user-provided functions. As we analyze the
4264 bases and members we can set these flags for other reasons. */
4268 /* Check all the data member declarations. We cannot call
4269 check_field_decls until we have called check_bases check_methods,
4270 as check_field_decls depends on TYPE_HAS_NONTRIVIAL_DESTRUCTOR
4271 being set appropriately. */
4276 /* A nearly-empty class has to be vptr-containing; a nearly empty
4277 class contains just a vptr. */
4281 /* Do some bookkeeping that will guide the generation of implicitly
4282 declared member functions. */
4284 /* We need to call a constructor for this class if it has a
4285 user-provided constructor, or if the default constructor is going
4286 to initialize the vptr. (This is not an if-and-only-if;
4287 TYPE_NEEDS_CONSTRUCTING is set elsewhere if bases or members
4288 themselves need constructing.) */
4291 /* [dcl.init.aggr]
4293 An aggregate is an array or a class with no user-provided
4294 constructors ... and no virtual functions.
4296 Again, other conditions for being an aggregate are checked
4297 elsewhere. */
4307 /* If the class has no user-declared constructor, but does have
4308 non-static const or reference data members that can never be
4309 initialized, issue a warning. */
4311 /* Classes with user-declared constructors are presumed to
4312 initialize these members. */
4314 /* Aggregates can be initialized with brace-enclosed
4315 initializers. */
4317 {
4318 tree field;
4321 {
4322 tree type;
4336 }
4337 }
4339 /* Synthesize any needed methods. */
4341 cant_have_const_ctor,
4342 no_const_asn_ref);
4344 /* Create the in-charge and not-in-charge variants of constructors
4345 and destructors. */
4348 /* Process the using-declarations. */
4352 /* Build and sort the CLASSTYPE_METHOD_VEC. */
4355 /* Figure out whether or not we will need a cookie when dynamically
4356 allocating an array of this type. */
4359 }
4361 /* If T needs a pointer to its virtual function table, set TYPE_VFIELD
4362 accordingly. If a new vfield was created (because T doesn't have a
4363 primary base class), then the newly created field is returned. It
4364 is not added to the TYPE_FIELDS list; it is the caller's
4365 responsibility to do that. Accumulate declared virtual functions
4366 on VIRTUALS_P. */
4368 static tree
4370 {
4371 tree fn;
4373 /* Collect the virtual functions declared in T. */
4377 {
4386 }
4388 /* If we couldn't find an appropriate base class, create a new field
4389 here. Even if there weren't any new virtual functions, we might need a
4390 new virtual function table if we're supposed to include vptrs in
4391 all classes that need them. */
4393 {
4394 /* We build this decl with vtbl_ptr_type_node, which is a
4395 `vtable_entry_type*'. It might seem more precise to use
4396 `vtable_entry_type (*)[N]' where N is the number of virtual
4397 functions. However, that would require the vtable pointer in
4398 base classes to have a different type than the vtable pointer
4399 in derived classes. We could make that happen, but that
4400 still wouldn't solve all the problems. In particular, the
4401 type-based alias analysis code would decide that assignments
4402 to the base class vtable pointer can't alias assignments to
4403 the derived class vtable pointer, since they have different
4404 types. Thus, in a derived class destructor, where the base
4405 class constructor was inlined, we could generate bad code for
4406 setting up the vtable pointer.
4408 Therefore, we use one type for all vtable pointers. We still
4409 use a type-correct type; it's just doesn't indicate the array
4410 bounds. That's better than using `void*' or some such; it's
4411 cleaner, and it let's the alias analysis code know that these
4412 stores cannot alias stores to void*! */
4413 tree field;
4423 /* This class is non-empty. */
4427 }
4430 }
4432 /* Fixup the inline function given by INFO now that the class is
4433 complete. */
4435 static void
4437 {
4439 {
4442 {
4445 }
4446 }
4447 }
4449 /* Fixup the inline methods and friends in TYPE now that TYPE is
4450 complete. */
4452 static void
4454 {
4460 {
4465 else
4467 }
4469 /* Do inline member functions. */
4473 /* Do friends. */
4478 }
4480 /* Add OFFSET to all base types of BINFO which is a base in the
4481 hierarchy dominated by T.
4483 OFFSET, which is a type offset, is number of bytes. */
4485 static void
4487 {
4489 tree primary_binfo;
4490 tree base_binfo;
4492 /* Update BINFO's offset. */
4497 offset));
4499 /* Find the primary base class. */
4505 /* Scan all of the bases, pushing the BINFO_OFFSET adjust
4506 downwards. */
4508 {
4509 /* Don't do the primary base twice. */
4517 }
4518 }
4520 /* Set BINFO_OFFSET for all of the virtual bases for RLI->T. Update
4521 TYPE_ALIGN and TYPE_SIZE for T. OFFSETS gives the location of
4522 empty subobjects of T. */
4524 static void
4526 {
4527 tree vbase;
4536 {
4537 /* In G++ 3.2, we incorrectly rounded the size before laying out
4538 the virtual bases. */
4540 #ifdef STRUCTURE_SIZE_BOUNDARY
4541 /* Packed structures don't need to have minimum size. */
4544 #endif
4548 }
4550 /* Find the last field. The artificial fields created for virtual
4551 bases will go after the last extant field to date. */
4556 /* Go through the virtual bases, allocating space for each virtual
4557 base that is not already a primary base class. These are
4558 allocated in inheritance graph order. */
4560 {
4565 {
4568 /* This virtual base is not a primary base of any class in the
4569 hierarchy, so we have to add space for it. */
4573 /* If the first virtual base might have been placed at a
4574 lower address, had we started from CLASSTYPE_SIZE, rather
4575 than TYPE_SIZE, issue a warning. There can be both false
4576 positives and false negatives from this warning in rare
4577 cases; to deal with all the possibilities would probably
4578 require performing both layout algorithms and comparing
4579 the results which is not particularly tractable. */
4581 && first_vbase
4582 && (tree_int_cst_lt
4586 bitsize_unit_node),
4589 "offset of virtual base %qT is not ABI-compliant and "
4591 basetype);
4594 }
4595 }
4596 }
4598 /* Returns the offset of the byte just past the end of the base class
4599 BINFO. */
4601 static tree
4603 {
4604 tree size;
4609 /* An empty class has zero CLASSTYPE_SIZE_UNIT, but we need to
4610 allocate some space for it. It cannot have virtual bases, so
4611 TYPE_SIZE_UNIT is fine. */
4613 else
4617 }
4619 /* Returns the offset of the byte just past the end of the base class
4620 with the highest offset in T. If INCLUDE_VIRTUALS_P is zero, then
4621 only non-virtual bases are included. */
4623 static tree
4625 {
4628 tree binfo;
4629 tree base_binfo;
4630 tree offset;
4635 {
4645 }
4647 /* G++ 3.2 did not check indirect virtual bases. */
4651 {
4655 }
4658 }
4660 /* Warn about bases of T that are inaccessible because they are
4661 ambiguous. For example:
4663 struct S {};
4664 struct T : public S {};
4665 struct U : public S, public T {};
4667 Here, `(S*) new U' is not allowed because there are two `S'
4668 subobjects of U. */
4670 static void
4672 {
4675 tree basetype;
4676 tree binfo;
4677 tree base_binfo;
4679 /* If there are no repeated bases, nothing can be ambiguous. */
4683 /* Check direct bases. */
4686 {
4692 }
4694 /* Check for ambiguous virtual bases. */
4698 {
4704 }
4705 }
4707 /* Compare two INTEGER_CSTs K1 and K2. */
4709 static int
4711 {
4713 }
4715 /* Increase the size indicated in RLI to account for empty classes
4716 that are "off the end" of the class. */
4718 static void
4720 {
4721 tree eoc;
4722 tree rli_size;
4724 /* It might be the case that we grew the class to allocate a
4725 zero-sized base class. That won't be reflected in RLI, yet,
4726 because we are willing to overlay multiple bases at the same
4727 offset. However, now we need to make sure that RLI is big enough
4728 to reflect the entire class. */
4734 {
4736 /* In version 1 of the ABI, the size of a class that ends with
4737 a bitfield was not rounded up to a whole multiple of a
4738 byte. Because rli_size_unit_so_far returns only the number
4739 of fully allocated bytes, any extra bits were not included
4740 in the size. */
4742 else
4743 /* The size should have been rounded to a whole byte. */
4746 rli->bitpos
4755 }
4756 }
4758 /* Calculate the TYPE_SIZE, TYPE_ALIGN, etc for T. Calculate
4759 BINFO_OFFSETs for all of the base-classes. Position the vtable
4760 pointer. Accumulate declared virtual functions on VIRTUALS_P. */
4762 static void
4764 {
4765 tree non_static_data_members;
4766 tree field;
4767 tree vptr;
4768 record_layout_info rli;
4769 /* Maps offsets (represented as INTEGER_CSTs) to a TREE_LIST of
4770 types that appear at that offset. */
4771 splay_tree empty_base_offsets;
4772 /* True if the last field layed out was a bit-field. */
4774 /* The location at which the next field should be inserted. */
4776 /* T, as a base class. */
4777 tree base_t;
4779 /* Keep track of the first non-static data member. */
4782 /* Start laying out the record. */
4785 /* Mark all the primary bases in the hierarchy. */
4788 /* Create a pointer to our virtual function table. */
4791 /* The vptr is always the first thing in the class. */
4793 {
4798 }
4799 else
4802 /* Build FIELD_DECLs for all of the non-virtual base-types. */
4807 /* Layout the non-static data members. */
4809 {
4810 tree type;
4811 tree padding;
4813 /* We still pass things that aren't non-static data members to
4814 the back end, in case it wants to do something with them. */
4816 {
4818 /* If the static data member has incomplete type, keep track
4819 of it so that it can be completed later. (The handling
4820 of pending statics in finish_record_layout is
4821 insufficient; consider:
4823 struct S1;
4824 struct S2 { static S1 s1; };
4826 At this point, finish_record_layout will be called, but
4827 S1 is still incomplete.) */
4829 {
4831 /* The visibility of static data members is determined
4832 at their point of declaration, not their point of
4833 definition. */
4835 }
4837 }
4845 /* If this field is a bit-field whose width is greater than its
4846 type, then there are some special rules for allocating
4847 it. */
4850 {
4851 integer_type_kind itk;
4852 tree integer_type;
4854 /* We must allocate the bits as if suitably aligned for the
4855 longest integer type that fits in this many bits. type
4856 of the field. Then, we are supposed to use the left over
4857 bits as additional padding. */
4863 /* ITK now indicates a type that is too large for the
4864 field. We have to back up by one to find the largest
4865 type that fits. */
4868 /* Figure out how much additional padding is required. GCC
4869 3.2 always created a padding field, even if it had zero
4870 width. */
4873 {
4875 /* In a union, the padding field must have the full width
4876 of the bit-field; all fields start at offset zero. */
4878 else
4879 {
4882 "ABI-compliant and may change in a future "
4884 t);
4887 }
4888 }
4889 #ifdef PCC_BITFIELD_TYPE_MATTERS
4890 /* An unnamed bitfield does not normally affect the
4891 alignment of the containing class on a target where
4892 PCC_BITFIELD_TYPE_MATTERS. But, the C++ ABI does not
4893 make any exceptions for unnamed bitfields when the
4894 bitfields are longer than their types. Therefore, we
4895 temporarily give the field a name. */
4897 {
4900 }
4901 #endif
4906 empty_base_offsets);
4909 /* Now that layout has been performed, set the size of the
4910 field to the size of its declared type; the rest of the
4911 field is effectively invisible. */
4913 /* We must also reset the DECL_MODE of the field. */
4918 /* Versions of G++ before G++ 3.4 did not reset the
4919 DECL_MODE. */
4921 "the offset of %qD may not be ABI-compliant and may "
4923 }
4924 else
4926 empty_base_offsets);
4928 /* Remember the location of any empty classes in FIELD. */
4932 empty_base_offsets,
4935 /* If a bit-field does not immediately follow another bit-field,
4936 and yet it starts in the middle of a byte, we have failed to
4937 comply with the ABI. */
4940 /* The TREE_NO_WARNING flag gets set by Objective-C when
4941 laying out an Objective-C class. The ObjC ABI differs
4942 from the C++ ABI, and so we do not want a warning
4943 here. */
4945 && !last_field_was_bitfield
4948 bitsize_unit_node)))
4952 /* G++ used to use DECL_FIELD_OFFSET as if it were the byte
4953 offset of the field. */
4959 "classes to be placed at different locations in a "
4962 /* The middle end uses the type of expressions to determine the
4963 possible range of expression values. In order to optimize
4964 "x.i > 7" to "false" for a 2-bit bitfield "i", the middle end
4965 must be made aware of the width of "i", via its type.
4967 Because C++ does not have integer types of arbitrary width,
4968 we must (for the purposes of the front end) convert from the
4969 type assigned here to the declared type of the bitfield
4970 whenever a bitfield expression is used as an rvalue.
4971 Similarly, when assigning a value to a bitfield, the value
4972 must be converted to the type given the bitfield here. */
4974 {
4979 {
4986 }
4987 }
4989 /* If we needed additional padding after this field, add it
4990 now. */
4992 {
4993 tree padding_field;
4996 NULL_TREE,
4997 char_type_node);
5004 NULL_TREE,
5005 empty_base_offsets);
5006 }
5009 }
5012 {
5013 /* Make sure that we are on a byte boundary so that the size of
5014 the class without virtual bases will always be a round number
5015 of bytes. */
5018 }
5020 /* G++ 3.2 does not allow virtual bases to be overlaid with tail
5021 padding. */
5025 /* Delete all zero-width bit-fields from the list of fields. Now
5026 that the type is laid out they are no longer important. */
5029 /* Create the version of T used for virtual bases. We do not use
5030 make_class_type for this version; this is an artificial type. For
5031 a POD type, we just reuse T. */
5033 {
5036 /* Set the size and alignment for the new type. In G++ 3.2, all
5037 empty classes were considered to have size zero when used as
5038 base classes. */
5040 {
5045 "layout of classes derived from empty class %qT "
5047 t);
5048 }
5049 else
5050 {
5051 tree eoc;
5053 /* If the ABI version is not at least two, and the last
5054 field was a bit-field, RLI may not be on a byte
5055 boundary. In particular, rli_size_unit_so_far might
5056 indicate the last complete byte, while rli_size_so_far
5057 indicates the total number of bits used. Therefore,
5058 rli_size_so_far, rather than rli_size_unit_so_far, is
5059 used to compute TYPE_SIZE_UNIT. */
5067 eoc);
5074 }
5078 /* Copy the fields from T. */
5082 {
5093 }
5095 /* Record the base version of the type. */
5098 }
5099 else
5102 /* Every empty class contains an empty class. */
5106 /* Set the TYPE_DECL for this type to contain the right
5107 value for DECL_OFFSET, so that we can use it as part
5108 of a COMPONENT_REF for multiple inheritance. */
5111 /* Now fix up any virtual base class types that we left lying
5112 around. We must get these done before we try to lay out the
5113 virtual function table. As a side-effect, this will remove the
5114 base subobject fields. */
5117 /* Make sure that empty classes are reflected in RLI at this
5118 point. */
5121 /* Make sure not to create any structures with zero size. */
5126 /* Let the back end lay out the type. */
5129 /* Warn about bases that can't be talked about due to ambiguity. */
5132 /* Now that we're done with layout, give the base fields the real types. */
5137 /* Clean up. */
5144 }
5146 /* Determine the "key method" for the class type indicated by TYPE,
5147 and set CLASSTYPE_KEY_METHOD accordingly. */
5149 void
5151 {
5152 tree method;
5155 || processing_template_decl
5160 /* The key method is the first non-pure virtual function that is not
5161 inline at the point of class definition. On some targets the
5162 key function may not be inline; those targets should not call
5163 this function until the end of the translation unit. */
5169 {
5172 }
5175 }
5177 /* Perform processing required when the definition of T (a class type)
5178 is complete. */
5180 void
5182 {
5183 tree x;
5184 /* A TREE_LIST. The TREE_VALUE of each node is a FUNCTION_DECL. */
5189 {
5194 }
5196 /* If this type was previously laid out as a forward reference,
5197 make sure we lay it out again. */
5203 /* Make assumptions about the class; we'll reset the flags if
5204 necessary. */
5209 /* Do end-of-class semantic processing: checking the validity of the
5210 bases and members and add implicitly generated methods. */
5213 /* Find the key method. */
5215 {
5216 /* The Itanium C++ ABI permits the key method to be chosen when
5217 the class is defined -- even though the key method so
5218 selected may later turn out to be an inline function. On
5219 some systems (such as ARM Symbian OS) the key method cannot
5220 be determined until the end of the translation unit. On such
5221 systems, we leave CLASSTYPE_KEY_METHOD set to NULL, which
5222 will cause the class to be added to KEYED_CLASSES. Then, in
5223 finish_file we will determine the key method. */
5227 /* If a polymorphic class has no key method, we may emit the vtable
5228 in every translation unit where the class definition appears. */
5231 }
5233 /* Layout the class itself. */
5236 /* We use the base type for trivial assignments, and hence it
5237 needs a mode. */
5242 /* If necessary, create the primary vtable for this class. */
5244 {
5245 /* We must enter these virtuals into the table. */
5249 /* Here we know enough to change the type of our virtual
5250 function table, but we will wait until later this function. */
5252 }
5255 {
5257 tree fn;
5264 /* Add entries for virtual functions introduced by this class. */
5268 /* Set DECL_VINDEX for all functions declared in this class. */
5270 fn;
5272 vindex += (TARGET_VTABLE_USES_DESCRIPTORS
5274 {
5278 /* A thunk. We should never be calling this entry directly
5279 from this vtable -- we'd use the entry for the non
5280 thunk base function. */
5284 }
5285 }
5289 /* Complete the rtl for any static member objects of the type we're
5290 working on. */
5297 /* Done with FIELDS...now decide whether to sort these for
5298 faster lookups later.
5300 We use a small number because most searches fail (succeeding
5301 ultimately as the search bores through the inheritance
5302 hierarchy), and we want this failure to occur quickly. */
5306 {
5313 field_decl_cmp);
5317 }
5319 /* Complain if one of the field types requires lower visibility. */
5322 /* Make the rtl for any new vtables we have created, and unmark
5323 the base types we marked. */
5326 /* Build the VTT for T. */
5329 /* This warning does not make sense for Java classes, since they
5330 cannot have destructors. */
5332 {
5333 tree dtor;
5337 if it were virtual, we would have created it by now. */
5338 !dtor
5347 "%q#T has virtual functions and accessible"
5349 }
5356 /* Class layout, assignment of virtual table slots, etc., is now
5357 complete. Give the back end a chance to tweak the visibility of
5358 the class or perform any other required target modifications. */
5365 /* Finish debugging output for this type. */
5367 }
5369 /* When T was built up, the member declarations were added in reverse
5370 order. Rearrange them to declaration order. */
5372 void
5374 {
5375 tree next;
5376 tree prev;
5377 tree x;
5379 /* The following lists are all in reverse order. Put them in
5380 declaration order now. */
5384 /* Actually, for the TYPE_FIELDS, only the non TYPE_DECLs are in
5385 reverse order, so we can't just use nreverse. */
5390 {
5394 }
5396 {
5400 }
5401 }
5403 tree
5405 {
5408 /* Now that we've got all the field declarations, reverse everything
5409 as necessary. */
5414 /* Nadger the current location so that diagnostics point to the start of
5415 the struct, not the end. */
5419 {
5420 tree x;
5426 /* We need to emit an error message if this type was used as a parameter
5427 and it is an abstract type, even if it is a template. We construct
5428 a simple CLASSTYPE_PURE_VIRTUALS list without taking bases into
5429 account and we call complete_vars with this type, which will check
5430 the PARM_DECLS. Note that while the type is being defined,
5431 CLASSTYPE_PURE_VIRTUALS contains the list of the inline friends
5432 (see CLASSTYPE_INLINE_FRIENDS) so we need to clear it. */
5438 }
5439 else
5448 else
5455 }
5456 \f
5457 /* Return the dynamic type of INSTANCE, if known.
5458 Used to determine whether the virtual function table is needed
5459 or not.
5461 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
5462 of our knowledge of its type. *NONNULL should be initialized
5463 before this function is called. */
5465 static tree
5467 {
5468 #define RECUR(T) fixed_type_or_null((T), nonnull, cdtorp)
5471 {
5475 else
5479 /* This is a call to a constructor, hence it's never zero. */
5481 {
5485 }
5489 /* This is a call to a constructor, hence it's never zero. */
5491 {
5495 }
5504 /* Propagate nonnull. */
5509 CASE_CONVERT:
5515 {
5516 /* Just because we see an ADDR_EXPR doesn't mean we're dealing
5517 with a real object -- given &p->f, p can still be null. */
5519 /* ??? Probably should check DECL_WEAK here. */
5522 }
5526 /* If this component is really a base class reference, then the field
5527 itself isn't definitive. */
5536 {
5540 }
5541 /* fall through... */
5546 {
5550 }
5552 {
5556 /* if we're in a ctor or dtor, we know our type. */
5560 {
5564 }
5565 }
5567 {
5568 /* We only need one hash table because it is always left empty. */
5572 htab_hash_pointer,
5573 htab_eq_pointer,
5576 /* Reference variables should be references to objects. */
5580 /* Enter the INSTANCE in a table to prevent recursion; a
5581 variable's initializer may refer to the variable
5582 itself. */
5586 {
5587 tree type;
5596 }
5597 }
5602 }
5603 #undef RECUR
5604 }
5606 /* Return nonzero if the dynamic type of INSTANCE is known, and
5607 equivalent to the static type. We also handle the case where
5608 INSTANCE is really a pointer. Return negative if this is a
5609 ctor/dtor. There the dynamic type is known, but this might not be
5610 the most derived base of the original object, and hence virtual
5611 bases may not be layed out according to this type.
5613 Used to determine whether the virtual function table is needed
5614 or not.
5616 *NONNULL is set iff INSTANCE can be known to be nonnull, regardless
5617 of our knowledge of its type. *NONNULL should be initialized
5618 before this function is called. */
5620 int
5622 {
5633 }
5635 \f
5636 void
5638 {
5641 current_class_stack
5649 }
5651 /* Restore the cached PREVIOUS_CLASS_LEVEL. */
5653 static void
5655 {
5656 tree type;
5658 /* We are re-entering the same class we just left, so we don't
5659 have to search the whole inheritance matrix to find all the
5660 decls to bind again. Instead, we install the cached
5661 class_shadowed list and walk through it binding names. */
5664 /* Restore IDENTIFIER_TYPE_VALUE. */
5666 type;
5669 }
5671 /* Set global variables CURRENT_CLASS_NAME and CURRENT_CLASS_TYPE as
5672 appropriate for TYPE.
5674 So that we may avoid calls to lookup_name, we cache the _TYPE
5675 nodes of local TYPE_DECLs in the TREE_TYPE field of the name.
5677 For multiple inheritance, we perform a two-pass depth-first search
5678 of the type lattice. */
5680 void
5682 {
5683 class_stack_node_t csn;
5687 /* Make sure there is enough room for the new entry on the stack. */
5689 {
5691 current_class_stack
5693 current_class_stack_size);
5694 }
5696 /* Insert a new entry on the class stack. */
5703 current_class_depth++;
5705 /* Now set up the new type. */
5711 /* By default, things in classes are private, while things in
5712 structures or unions are public. */
5714 ? access_private_node
5720 {
5721 /* Forcibly remove any old class remnants. */
5723 }
5729 else
5731 }
5733 /* When we exit a toplevel class scope, we save its binding level so
5734 that we can restore it quickly. Here, we've entered some other
5735 class, so we must invalidate our cache. */
5737 void
5739 {
5741 }
5743 /* Get out of the current class scope. If we were in a class scope
5744 previously, that is the one popped to. */
5746 void
5748 {
5751 current_class_depth--;
5757 }
5759 /* Mark the top of the class stack as hidden. */
5761 void
5763 {
5766 }
5768 /* Mark the top of the class stack as un-hidden. */
5770 void
5772 {
5775 }
5777 /* Returns 1 if the class type currently being defined is either T or
5778 a nested type of T. */
5780 bool
5782 {
5785 /* We start looking from 1 because entry 0 is from global scope,
5786 and has no type. */
5788 {
5789 tree c;
5792 else
5793 {
5797 }
5802 }
5804 }
5806 /* If either current_class_type or one of its enclosing classes are derived
5807 from T, return the appropriate type. Used to determine how we found
5808 something via unqualified lookup. */
5810 tree
5812 {
5815 /* The bases of a dependent type are unknown. */
5826 {
5831 }
5834 }
5836 /* When entering a class scope, all enclosing class scopes' names with
5837 static meaning (static variables, static functions, types and
5838 enumerators) have to be visible. This recursive function calls
5839 pushclass for all enclosing class contexts until global or a local
5840 scope is reached. TYPE is the enclosed class. */
5842 void
5844 {
5845 /* A namespace might be passed in error cases, like A::B:C. */
5853 }
5855 /* Undoes a push_nested_class call. */
5857 void
5859 {
5865 }
5867 /* Returns the number of extern "LANG" blocks we are nested within. */
5869 int
5871 {
5873 }
5875 /* Set global variables CURRENT_LANG_NAME to appropriate value
5876 so that behavior of name-mangling machinery is correct. */
5878 void
5880 {
5884 {
5886 }
5888 {
5890 /* DECL_IGNORED_P is initially set for these types, to avoid clutter.
5891 (See record_builtin_java_type in decl.c.) However, that causes
5892 incorrect debug entries if these types are actually used.
5893 So we re-enable debug output after extern "Java". */
5902 }
5904 {
5906 }
5907 else
5909 }
5911 /* Get out of the current language scope. */
5913 void
5915 {
5917 }
5918 \f
5919 /* Type instantiation routines. */
5921 /* Given an OVERLOAD and a TARGET_TYPE, return the function that
5922 matches the TARGET_TYPE. If there is no satisfactory match, return
5923 error_mark_node, and issue an error & warning messages under
5924 control of FLAGS. Permit pointers to member function if FLAGS
5925 permits. If TEMPLATE_ONLY, the name of the overloaded function was
5926 a template-id, and EXPLICIT_TARGS are the explicitly provided
5927 template arguments. If OVERLOAD is for one or more member
5928 functions, then ACCESS_PATH is the base path used to reference
5929 those member functions. */
5931 static tree
5933 tree overload,
5934 tsubst_flags_t flags,
5936 tree explicit_targs,
5937 tree access_path)
5938 {
5939 /* Here's what the standard says:
5941 [over.over]
5943 If the name is a function template, template argument deduction
5944 is done, and if the argument deduction succeeds, the deduced
5945 arguments are used to generate a single template function, which
5946 is added to the set of overloaded functions considered.
5948 Non-member functions and static member functions match targets of
5949 type "pointer-to-function" or "reference-to-function." Nonstatic
5950 member functions match targets of type "pointer-to-member
5951 function;" the function type of the pointer to member is used to
5952 select the member function from the set of overloaded member
5953 functions. If a nonstatic member function is selected, the
5954 reference to the overloaded function name is required to have the
5955 form of a pointer to member as described in 5.3.1.
5957 If more than one function is selected, any template functions in
5958 the set are eliminated if the set also contains a non-template
5959 function, and any given template function is eliminated if the
5960 set contains a second template function that is more specialized
5961 than the first according to the partial ordering rules 14.5.5.2.
5962 After such eliminations, if any, there shall remain exactly one
5963 selected function. */
5967 /* We store the matches in a TREE_LIST rooted here. The functions
5968 are the TREE_PURPOSE, not the TREE_VALUE, in this list, for easy
5969 interoperability with most_specialized_instantiation. */
5971 tree fn;
5973 /* By the time we get here, we should be seeing only real
5974 pointer-to-member types, not the internal POINTER_TYPE to
5975 METHOD_TYPE representation. */
5981 /* Check that the TARGET_TYPE is reasonable. */
5985 /* This is OK, too. */
5988 {
5989 /* This is OK, too. This comes from a conversion to reference
5990 type. */
5993 }
5994 else
5995 {
6001 }
6003 /* If we can find a non-template function that matches, we can just
6004 use it. There's no point in generating template instantiations
6005 if we're just going to throw them out anyhow. But, of course, we
6006 can only do this when we don't *need* a template function. */
6008 {
6009 tree fns;
6012 {
6014 tree fntype;
6017 /* We're not looking for templates just yet. */
6022 /* We're looking for a non-static member, and this isn't
6023 one, or vice versa. */
6026 /* Ignore functions which haven't been explicitly
6027 declared. */
6031 /* See if there's a match. */
6040 }
6041 }
6043 /* Now, if we've already got a match (or matches), there's no need
6044 to proceed to the template functions. But, if we don't have a
6045 match we need to look at them, too. */
6047 {
6048 tree target_fn_type;
6049 tree target_arg_types;
6050 tree target_ret_type;
6051 tree fns;
6054 target_fn_type
6056 else
6061 /* Never do unification on the 'this' parameter. */
6066 {
6068 tree instantiation;
6069 tree instantiation_type;
6070 tree targs;
6073 /* We're only looking for templates. */
6078 /* We're not looking for a non-static member, and this is
6079 one, or vice versa. */
6082 /* Try to do argument deduction. */
6087 /* Argument deduction failed. */
6090 /* Instantiate the template. */
6093 /* Instantiation failed. */
6096 /* See if there's a match. */
6099 instantiation_type =
6104 LOOKUP_NORMAL))
6106 }
6108 /* Now, remove all but the most specialized of the matches. */
6110 {
6115 NULL_TREE,
6116 NULL_TREE);
6117 }
6118 }
6120 /* Now we should have exactly one function in MATCHES. */
6122 {
6123 /* There were *no* matches. */
6125 {
6128 target_type);
6130 /* print_candidates expects a chain with the functions in
6131 TREE_VALUE slots, so we cons one up here (we're losing anyway,
6132 so why be clever?). */
6135 matches);
6138 }
6140 }
6142 {
6143 /* There were too many matches. */
6146 {
6147 tree match;
6151 target_type);
6153 /* Since print_candidates expects the functions in the
6154 TREE_VALUE slot, we flip them here. */
6159 }
6162 }
6164 /* Good, exactly one match. Now, convert it to the correct type. */
6169 {
6177 {
6180 }
6181 }
6183 /* If we're doing overload resolution purely for the purpose of
6184 determining conversion sequences, we should not consider the
6185 function used. If this conversion sequence is selected, the
6186 function will be marked as used at this point. */
6188 {
6189 /* Make =delete work with SFINAE. */
6194 /* We could not check access when this expression was originally
6195 created since we did not know at that time to which function
6196 the expression referred. */
6198 {
6201 }
6202 }
6206 else
6207 {
6208 /* The target must be a REFERENCE_TYPE. Above, cp_build_unary_op
6209 will mark the function as addressed, but here we must do it
6210 explicitly. */
6214 }
6215 }
6217 /* This function will instantiate the type of the expression given in
6218 RHS to match the type of LHSTYPE. If errors exist, then return
6219 error_mark_node. FLAGS is a bit mask. If TF_ERROR is set, then
6220 we complain on errors. If we are not complaining, never modify rhs,
6221 as overload resolution wants to try many possible instantiations, in
6222 the hope that at least one will work.
6224 For non-recursive calls, LHSTYPE should be a function, pointer to
6225 function, or a pointer to member function. */
6227 tree
6229 {
6236 {
6240 }
6243 {
6249 /* Microsoft allows `A::f' to be resolved to a
6250 pointer-to-member. */
6251 ;
6252 else
6253 {
6258 }
6259 }
6262 {
6265 }
6267 /* If we are in a template, and have a NON_DEPENDENT_EXPR, we cannot
6268 deduce any type information. */
6270 {
6274 }
6276 /* There only a few kinds of expressions that may have a type
6277 dependent on overload resolution. */
6283 /* We don't overwrite rhs if it is an overloaded function.
6284 Copying it would destroy the tree link. */
6288 /* This should really only be used when attempting to distinguish
6289 what sort of a pointer to function we have. For now, any
6290 arithmetic operation which is not supported on pointers
6291 is rejected as an error. */
6294 {
6296 {
6302 /* Do not lose object's side effects. */
6306 }
6313 /* This can happen if we are forming a pointer-to-member for a
6314 member template. */
6317 /* Fall through. */
6320 {
6324 return
6328 }
6332 return
6336 access_path);
6352 {
6357 }
6364 }
6366 }
6367 \f
6368 /* Return the name of the virtual function pointer field
6369 (as an IDENTIFIER_NODE) for the given TYPE. Note that
6370 this may have to look back through base types to find the
6371 ultimate field name. (For single inheritance, these could
6372 all be the same name. Who knows for multiple inheritance). */
6374 static tree
6376 {
6383 {
6389 }
6397 }
6399 void
6401 {
6402 #ifdef GATHER_STATISTICS
6406 {
6411 }
6412 #endif
6413 }
6415 /* Build a dummy reference to ourselves so Derived::Base (and A::A) works,
6416 according to [class]:
6417 The class-name is also inserted
6418 into the scope of the class itself. For purposes of access checking,
6419 the inserted class name is treated as if it were a public member name. */
6421 void
6423 {
6426 tree saved_cas;
6440 }
6442 /* Returns 1 if TYPE contains only padding bytes. */
6444 int
6446 {
6453 /* In G++ 3.2, whether or not a class was empty was determined by
6454 looking at its size. */
6457 else
6459 }
6461 /* Returns true if TYPE contains an empty class. */
6463 static bool
6465 {
6469 {
6470 tree field;
6471 tree binfo;
6472 tree base_binfo;
6484 }
6488 }
6490 /* Note that NAME was looked up while the current class was being
6491 defined and that the result of that lookup was DECL. */
6493 void
6495 {
6496 splay_tree names_used;
6498 /* If we're not defining a class, there's nothing to do. */
6503 /* If there's already a binding for this NAME, then we don't have
6504 anything to worry about. */
6517 }
6519 /* Note that NAME was declared (as DECL) in the current class. Check
6520 to see that the declaration is valid. */
6522 void
6524 {
6525 splay_tree names_used;
6526 splay_tree_node n;
6528 /* Look to see if we ever used this name. */
6529 names_used
6536 {
6537 /* [basic.scope.class]
6539 A name N used in a class S shall refer to the same declaration
6540 in its context and when re-evaluated in the completed scope of
6541 S. */
6545 }
6546 }
6548 /* Returns the VAR_DECL for the complete vtable associated with BINFO.
6549 Secondary vtables are merged with primary vtables; this function
6550 will return the VAR_DECL for the primary vtable. */
6552 tree
6554 {
6555 tree decl;
6559 {
6562 }
6566 }
6569 /* Returns the binfo for the primary base of BINFO. If the resulting
6570 BINFO is a virtual base, and it is inherited elsewhere in the
6571 hierarchy, then the returned binfo might not be the primary base of
6572 BINFO in the complete object. Check BINFO_PRIMARY_P or
6573 BINFO_LOST_PRIMARY_P to be sure. */
6575 static tree
6577 {
6578 tree primary_base;
6585 }
6587 /* If INDENTED_P is zero, indent to INDENT. Return nonzero. */
6589 static int
6591 {
6595 }
6597 /* Dump the offsets of all the bases rooted at BINFO to STREAM.
6598 INDENT should be zero when called from the top level; it is
6599 incremented recursively. IGO indicates the next expected BINFO in
6600 inheritance graph ordering. */
6602 static tree
6605 tree binfo,
6606 tree igo,
6608 {
6610 tree base_binfo;
6618 {
6621 }
6636 {
6640 TFF_PLAIN_IDENTIFIER),
6642 }
6644 {
6647 }
6652 {
6656 {
6660 TFF_PLAIN_IDENTIFIER));
6661 }
6663 {
6667 TFF_PLAIN_IDENTIFIER));
6668 }
6670 {
6674 TFF_PLAIN_IDENTIFIER));
6675 }
6677 {
6681 TFF_PLAIN_IDENTIFIER));
6682 }
6686 }
6692 }
6694 /* Dump the BINFO hierarchy for T. */
6696 static void
6698 {
6710 }
6712 /* Debug interface to hierarchy dumping. */
6714 void
6716 {
6718 }
6720 static void
6722 {
6727 {
6730 }
6731 }
6733 static void
6735 {
6736 tree value;
6738 HOST_WIDE_INT elt;
6746 TFF_PLAIN_IDENTIFIER));
6753 }
6755 static void
6757 {
6765 {
6772 {
6776 }
6780 }
6783 }
6785 static void
6787 {
6795 {
6800 }
6803 }
6805 /* Dump a function or thunk and its thunkees. */
6807 static void
6809 {
6812 tree thunks;
6820 {
6830 else
6836 }
6840 }
6842 /* Dump the thunks for FN. */
6844 void
6846 {
6848 }
6850 /* Virtual function table initialization. */
6852 /* Create all the necessary vtables for T and its base classes. */
6854 static void
6856 {
6857 tree list;
6858 tree vbase;
6860 /* We lay out the primary and secondary vtables in one contiguous
6861 vtable. The primary vtable is first, followed by the non-virtual
6862 secondary vtables in inheritance graph order. */
6867 /* Then come the virtual bases, also in inheritance graph order. */
6869 {
6873 }
6877 }
6879 /* Initialize the vtable for BINFO with the INITS. */
6881 static void
6883 {
6884 tree decl;
6890 }
6892 /* Build the VTT (virtual table table) for T.
6893 A class requires a VTT if it has virtual bases.
6895 This holds
6896 1 - primary virtual pointer for complete object T
6897 2 - secondary VTTs for each direct non-virtual base of T which requires a
6898 VTT
6899 3 - secondary virtual pointers for each direct or indirect base of T which
6900 has virtual bases or is reachable via a virtual path from T.
6901 4 - secondary VTTs for each direct or indirect virtual base of T.
6903 Secondary VTTs look like complete object VTTs without part 4. */
6905 static void
6907 {
6908 tree inits;
6909 tree type;
6910 tree vtt;
6911 tree index;
6913 /* Build up the initializers for the VTT. */
6918 /* If we didn't need a VTT, we're done. */
6922 /* Figure out the type of the VTT. */
6926 /* Now, build the VTT object itself. */
6929 /* Add the VTT to the vtables list. */
6934 }
6936 /* When building a secondary VTT, BINFO_VTABLE is set to a TREE_LIST with
6937 PURPOSE the RTTI_BINFO, VALUE the real vtable pointer for this binfo,
6938 and CHAIN the vtable pointer for this binfo after construction is
6939 complete. VALUE can also be another BINFO, in which case we recurse. */
6941 static tree
6943 {
6944 tree vt;
6947 {
6953 else
6955 }
6958 }
6960 /* Data for secondary VTT initialization. */
6962 {
6963 /* Is this the primary VTT? */
6966 /* Current index into the VTT. */
6967 tree index;
6969 /* TREE_LIST of initializers built up. */
6970 tree inits;
6972 /* The type being constructed by this secondary VTT. */
6973 tree type_being_constructed;
6976 /* Recursively build the VTT-initializer for BINFO (which is in the
6977 hierarchy dominated by T). INITS points to the end of the initializer
6978 list to date. INDEX is the VTT index where the next element will be
6979 replaced. Iff BINFO is the binfo for T, this is the top level VTT (i.e.
6980 not a subvtt for some base of T). When that is so, we emit the sub-VTTs
6981 for virtual bases of T. When it is not so, we build the constructor
6982 vtables for the BINFO-in-T variant. */
6986 {
6988 tree b;
6989 tree init;
6990 tree secondary_vptrs;
6991 secondary_vptr_vtt_init_data data;
6994 /* We only need VTTs for subobjects with virtual bases. */
6998 /* We need to use a construction vtable if this is not the primary
6999 VTT. */
7001 {
7004 /* Record the offset in the VTT where this sub-VTT can be found. */
7006 }
7008 /* Add the address of the primary vtable for the complete object. */
7013 {
7016 }
7019 /* Recursively add the secondary VTTs for non-virtual bases. */
7024 /* Add secondary virtual pointers for all subobjects of BINFO with
7025 either virtual bases or reachable along a virtual path, except
7026 subobjects that are non-virtual primary bases. */
7036 /* The secondary vptrs come back in reverse order. After we reverse
7037 them, and add the INITS, the last init will be the first element
7038 of the chain. */
7041 {
7045 }
7048 /* Add the secondary VTTs for virtual bases in inheritance graph
7049 order. */
7051 {
7056 }
7057 else
7058 /* Remove the ctor vtables we created. */
7062 }
7064 /* Called from build_vtt_inits via dfs_walk. BINFO is the binfo for the base
7065 in most derived. DATA is a SECONDARY_VPTR_VTT_INIT_DATA structure. */
7067 static tree
7069 {
7072 /* We don't care about bases that don't have vtables. */
7076 /* We're only interested in proper subobjects of the type being
7077 constructed. */
7081 /* We're only interested in bases with virtual bases or reachable
7082 via a virtual path from the type being constructed. */
7087 /* We're not interested in non-virtual primary bases. */
7091 /* Record the index where this secondary vptr can be found. */
7093 {
7098 {
7099 /* It's a primary virtual base, and this is not a
7100 construction vtable. Find the base this is primary of in
7101 the inheritance graph, and use that base's vtable
7102 now. */
7105 }
7106 }
7108 /* Add the initializer for the secondary vptr itself. */
7111 /* Advance the vtt index. */
7116 }
7118 /* Called from build_vtt_inits via dfs_walk. After building
7119 constructor vtables and generating the sub-vtt from them, we need
7120 to restore the BINFO_VTABLES that were scribbled on. DATA is the
7121 binfo of the base whose sub vtt was generated. */
7123 static tree
7125 {
7129 /* If this class has no vtable, none of its bases do. */
7133 /* This might be a primary base, so have no vtable in this
7134 hierarchy. */
7137 /* If we scribbled the construction vtable vptr into BINFO, clear it
7138 out now. */
7144 }
7146 /* Build the construction vtable group for BINFO which is in the
7147 hierarchy dominated by T. */
7149 static void
7151 {
7152 tree list;
7153 tree type;
7154 tree vtbl;
7155 tree inits;
7156 tree id;
7157 tree vbase;
7159 /* See if we've already created this construction vtable group. */
7165 /* Build a version of VTBL (with the wrong type) for use in
7166 constructing the addresses of secondary vtables in the
7167 construction vtable group. */
7174 /* Add the vtables for each of our virtual bases using the vbase in T
7175 binfo. */
7177 vbase;
7179 {
7180 tree b;
7187 }
7190 /* Figure out the type of the construction vtable. */
7198 /* Initialize the construction vtable. */
7202 }
7204 /* Add the vtbl initializers for BINFO (and its bases other than
7205 non-virtual primaries) to the list of INITS. BINFO is in the
7206 hierarchy dominated by T. RTTI_BINFO is the binfo within T of
7207 the constructor the vtbl inits should be accumulated for. (If this
7208 is the complete object vtbl then RTTI_BINFO will be TYPE_BINFO (T).)
7209 ORIG_BINFO is the binfo for this object within BINFO_TYPE (RTTI_BINFO).
7210 BINFO is the active base equivalent of ORIG_BINFO in the inheritance
7211 graph of T. Both BINFO and ORIG_BINFO will have the same BINFO_TYPE,
7212 but are not necessarily the same in terms of layout. */
7214 static void
7216 tree orig_binfo,
7217 tree rtti_binfo,
7218 tree t,
7219 tree inits)
7220 {
7222 tree base_binfo;
7227 /* If it doesn't have a vptr, we don't do anything. */
7231 /* If we're building a construction vtable, we're not interested in
7232 subobjects that don't require construction vtables. */
7238 /* Build the initializers for the BINFO-in-T vtable. */
7244 /* Walk the BINFO and its bases. We walk in preorder so that as we
7245 initialize each vtable we can figure out at what offset the
7246 secondary vtable lies from the primary vtable. We can't use
7247 dfs_walk here because we need to iterate through bases of BINFO
7248 and RTTI_BINFO simultaneously. */
7250 {
7251 /* Skip virtual bases. */
7257 inits);
7258 }
7259 }
7261 /* Called from accumulate_vtbl_inits. Returns the initializers for
7262 the BINFO vtable. */
7264 static tree
7266 tree orig_binfo,
7267 tree rtti_binfo,
7268 tree t,
7269 tree l)
7270 {
7277 {
7278 /* In the hierarchy of BINFO_TYPE (RTTI_BINFO), this is a
7279 primary virtual base. If it is not the same primary in
7280 the hierarchy of T, we'll need to generate a ctor vtable
7281 for it, to place at its location in T. If it is the same
7282 primary, we still need a VTT entry for the vtable, but it
7283 should point to the ctor vtable for the base it is a
7284 primary for within the sub-hierarchy of RTTI_BINFO.
7286 There are three possible cases:
7288 1) We are in the same place.
7289 2) We are a primary base within a lost primary virtual base of
7290 RTTI_BINFO.
7291 3) We are primary to something not a base of RTTI_BINFO. */
7293 tree b;
7296 /* First, look through the bases we are primary to for RTTI_BINFO
7297 or a virtual base. */
7300 {
7305 }
7306 /* If we run out of primary links, keep looking down our
7307 inheritance chain; we might be an indirect primary. */
7311 found:
7313 /* If we found RTTI_BINFO, this is case 1. If we found a virtual
7314 base B and it is a base of RTTI_BINFO, this is case 2. In
7315 either case, we share our vtable with LAST, i.e. the
7316 derived-most base within B of which we are a primary. */
7319 /* Just set our BINFO_VTABLE to point to LAST, as we may not have
7320 set LAST's BINFO_VTABLE yet. We'll extract the actual vptr in
7321 binfo_ctor_vtable after everything's been set up. */
7324 /* Otherwise, this is case 3 and we get our own. */
7325 }
7330 {
7331 tree index;
7334 /* Compute the initializer for this vtable. */
7338 /* Figure out the position to which the VPTR should point. */
7346 index);
7348 }
7351 /* For a construction vtable, we can't overwrite BINFO_VTABLE.
7352 So, we make a TREE_LIST. Later, dfs_fixup_binfo_vtbls will
7353 straighten this out. */
7357 else
7358 /* For an ordinary vtable, set BINFO_VTABLE. */
7362 }
7366 /* Construct the initializer for BINFO's virtual function table. BINFO
7367 is part of the hierarchy dominated by T. If we're building a
7368 construction vtable, the ORIG_BINFO is the binfo we should use to
7369 find the actual function pointers to put in the vtable - but they
7370 can be overridden on the path to most-derived in the graph that
7371 ORIG_BINFO belongs. Otherwise,
7372 ORIG_BINFO should be the same as BINFO. The RTTI_BINFO is the
7373 BINFO that should be indicated by the RTTI information in the
7374 vtable; it will be a base class of T, rather than T itself, if we
7375 are building a construction vtable.
7377 The value returned is a TREE_LIST suitable for wrapping in a
7378 CONSTRUCTOR to use as the DECL_INITIAL for a vtable. If
7379 NON_FN_ENTRIES_P is not NULL, *NON_FN_ENTRIES_P is set to the
7380 number of non-function entries in the vtable.
7382 It might seem that this function should never be called with a
7383 BINFO for which BINFO_PRIMARY_P holds, the vtable for such a
7384 base is always subsumed by a derived class vtable. However, when
7385 we are building construction vtables, we do build vtables for
7386 primary bases; we need these while the primary base is being
7387 constructed. */
7389 static tree
7391 tree orig_binfo,
7392 tree t,
7393 tree rtti_binfo,
7395 {
7397 tree vfun_inits;
7398 vtbl_init_data vid;
7400 tree vbinfo;
7403 /* Initialize VID. */
7412 /* The first vbase or vcall offset is at index -3 in the vtable. */
7415 /* Add entries to the vtable for RTTI. */
7418 /* Create an array for keeping track of the functions we've
7419 processed. When we see multiple functions with the same
7420 signature, we share the vcall offsets. */
7422 /* Add the vcall and vbase offset entries. */
7425 /* Clear BINFO_VTABLE_PATH_MARKED; it's set by
7426 build_vbase_offset_vtbl_entries. */
7431 /* If the target requires padding between data entries, add that now. */
7433 {
7437 {
7444 null_pointer_node),
7445 add);
7447 }
7448 }
7453 /* Go through all the ordinary virtual functions, building up
7454 initializers. */
7457 {
7458 tree delta;
7459 tree vcall_index;
7466 {
7470 {
7473 }
7475 }
7477 /* If the only definition of this function signature along our
7478 primary base chain is from a lost primary, this vtable slot will
7479 never be used, so just zero it out. This is important to avoid
7480 requiring extra thunks which cannot be generated with the function.
7482 We first check this in update_vtable_entry_for_fn, so we handle
7483 restored primary bases properly; we also need to do it here so we
7484 zero out unused slots in ctor vtables, rather than filling them
7485 with erroneous values (though harmless, apart from relocation
7486 costs). */
7488 {
7489 /* We found a defn before a lost primary; go ahead as normal. */
7493 /* The nearest definition is from a lost primary; clear the
7494 slot. */
7496 {
7499 }
7500 }
7503 {
7504 /* Pull the offset for `this', and the function to call, out of
7505 the list. */
7512 /* You can't call an abstract virtual function; it's abstract.
7513 So, we replace these functions with __pure_virtual. */
7515 {
7520 }
7521 else
7522 {
7524 {
7528 }
7529 /* Take the address of the function, considering it to be of an
7530 appropriate generic type. */
7532 }
7533 }
7535 /* And add it to the chain of initializers. */
7537 {
7542 else
7544 {
7551 }
7552 }
7553 else
7555 }
7557 /* The initializers for virtual functions were built up in reverse
7558 order; straighten them out now. */
7561 /* The negative offset initializers are also in reverse order. */
7564 /* Chain the two together. */
7566 }
7568 /* Adds to vid->inits the initializers for the vbase and vcall
7569 offsets in BINFO, which is in the hierarchy dominated by T. */
7571 static void
7573 {
7574 tree b;
7576 /* If this is a derived class, we must first create entries
7577 corresponding to the primary base class. */
7582 /* Add the vbase entries for this base. */
7584 /* Add the vcall entries for this base. */
7586 }
7588 /* Returns the initializers for the vbase offset entries in the vtable
7589 for BINFO (which is part of the class hierarchy dominated by T), in
7590 reverse order. VBASE_OFFSET_INDEX gives the vtable index
7591 where the next vbase offset will go. */
7593 static void
7595 {
7596 tree vbase;
7597 tree t;
7598 tree non_primary_binfo;
7600 /* If there are no virtual baseclasses, then there is nothing to
7601 do. */
7607 /* We might be a primary base class. Go up the inheritance hierarchy
7608 until we find the most derived class of which we are a primary base:
7609 it is the offset of that which we need to use. */
7612 {
7613 tree b;
7615 /* If we have reached a virtual base, then it must be a primary
7616 base (possibly multi-level) of vid->binfo, or we wouldn't
7617 have called build_vcall_and_vbase_vtbl_entries for it. But it
7618 might be a lost primary, so just skip down to vid->binfo. */
7620 {
7623 }
7629 }
7631 /* Go through the virtual bases, adding the offsets. */
7633 vbase;
7635 {
7636 tree b;
7637 tree delta;
7642 /* Find the instance of this virtual base in the complete
7643 object. */
7646 /* If we've already got an offset for this virtual base, we
7647 don't need another one. */
7652 /* Figure out where we can find this vbase offset. */
7661 /* The vbase offset had better be the same. */
7664 /* The next vbase will come at a more negative offset. */
7668 /* The initializer is the delta from BINFO to this virtual base.
7669 The vbase offsets go in reverse inheritance-graph order, and
7670 we are walking in inheritance graph order so these end up in
7671 the right order. */
7677 vtable_entry_type,
7678 delta));
7680 }
7681 }
7683 /* Adds the initializers for the vcall offset entries in the vtable
7684 for BINFO (which is part of the class hierarchy dominated by VID->DERIVED)
7685 to VID->INITS. */
7687 static void
7689 {
7690 /* We only need these entries if this base is a virtual base. We
7691 compute the indices -- but do not add to the vtable -- when
7692 building the main vtable for a class. */
7695 /* If BINFO is RTTI_BINFO, then (since BINFO does not
7696 correspond to VID->DERIVED), we are building a primary
7697 construction virtual table. Since this is a primary
7698 virtual table, we do not need the vcall offsets for
7699 BINFO. */
7701 {
7702 /* We need a vcall offset for each of the virtual functions in this
7703 vtable. For example:
7705 class A { virtual void f (); };
7706 class B1 : virtual public A { virtual void f (); };
7707 class B2 : virtual public A { virtual void f (); };
7708 class C: public B1, public B2 { virtual void f (); };
7710 A C object has a primary base of B1, which has a primary base of A. A
7711 C also has a secondary base of B2, which no longer has a primary base
7712 of A. So the B2-in-C construction vtable needs a secondary vtable for
7713 A, which will adjust the A* to a B2* to call f. We have no way of
7714 knowing what (or even whether) this offset will be when we define B2,
7715 so we store this "vcall offset" in the A sub-vtable and look it up in
7716 a "virtual thunk" for B2::f.
7718 We need entries for all the functions in our primary vtable and
7719 in our non-virtual bases' secondary vtables. */
7721 /* If we are just computing the vcall indices -- but do not need
7722 the actual entries -- not that. */
7725 /* Now, walk through the non-virtual bases, adding vcall offsets. */
7727 }
7728 }
7730 /* Build vcall offsets, starting with those for BINFO. */
7732 static void
7734 {
7736 tree primary_binfo;
7737 tree base_binfo;
7739 /* Don't walk into virtual bases -- except, of course, for the
7740 virtual base for which we are building vcall offsets. Any
7741 primary virtual base will have already had its offsets generated
7742 through the recursion in build_vcall_and_vbase_vtbl_entries. */
7746 /* If BINFO has a primary base, process it first. */
7751 /* Add BINFO itself to the list. */
7754 /* Scan the non-primary bases of BINFO. */
7758 }
7760 /* Called from build_vcall_offset_vtbl_entries_r. */
7762 static void
7764 {
7765 /* Make entries for the rest of the virtuals. */
7767 {
7768 tree orig_fn;
7770 /* The ABI requires that the methods be processed in declaration
7771 order. G++ 3.2 used the order in the vtable. */
7773 orig_fn;
7777 }
7778 else
7779 {
7780 tree derived_virtuals;
7781 tree base_virtuals;
7782 tree orig_virtuals;
7783 /* If BINFO is a primary base, the most derived class which has
7784 BINFO as a primary base; otherwise, just BINFO. */
7785 tree non_primary_binfo;
7787 /* We might be a primary base class. Go up the inheritance hierarchy
7788 until we find the most derived class of which we are a primary base:
7789 it is the BINFO_VIRTUALS there that we need to consider. */
7792 {
7793 tree b;
7795 /* If we have reached a virtual base, then it must be vid->vbase,
7796 because we ignore other virtual bases in
7797 add_vcall_offset_vtbl_entries_r. In turn, it must be a primary
7798 base (possibly multi-level) of vid->binfo, or we wouldn't
7799 have called build_vcall_and_vbase_vtbl_entries for it. But it
7800 might be a lost primary, so just skip down to vid->binfo. */
7802 {
7806 }
7812 }
7815 /* For a ctor vtable we need the equivalent binfo within the hierarchy
7816 where rtti_binfo is the most derived type. */
7817 non_primary_binfo
7823 base_virtuals;
7827 {
7828 tree orig_fn;
7830 /* Find the declaration that originally caused this function to
7831 be present in BINFO_TYPE (binfo). */
7834 /* When processing BINFO, we only want to generate vcall slots for
7835 function slots introduced in BINFO. So don't try to generate
7836 one if the function isn't even defined in BINFO. */
7841 }
7842 }
7843 }
7845 /* Add a vcall offset entry for ORIG_FN to the vtable. */
7847 static void
7849 {
7851 tree vcall_offset;
7852 tree derived_entry;
7854 /* If there is already an entry for a function with the same
7855 signature as FN, then we do not need a second vcall offset.
7856 Check the list of functions already present in the derived
7857 class vtable. */
7859 {
7861 /* We only use one vcall offset for virtual destructors,
7862 even though there are two virtual table entries. */
7866 }
7868 /* If we are building these vcall offsets as part of building
7869 the vtable for the most derived class, remember the vcall
7870 offset. */
7872 {
7875 NULL);
7878 }
7880 /* The next vcall offset will be found at a more negative
7881 offset. */
7885 /* Keep track of this function. */
7889 {
7890 tree base;
7891 tree fn;
7893 /* Find the overriding function. */
7897 integer_zero_node);
7898 else
7899 {
7902 /* The vbase we're working on is a primary base of
7903 vid->binfo. But it might be a lost primary, so its
7904 BINFO_OFFSET might be wrong, so we just use the
7905 BINFO_OFFSET from vid->binfo. */
7909 vcall_offset);
7910 }
7911 /* Add the initializer to the vtable. */
7914 }
7915 }
7917 /* Return vtbl initializers for the RTTI entries corresponding to the
7918 BINFO's vtable. The RTTI entries should indicate the object given
7919 by VID->rtti_binfo. */
7921 static void
7923 {
7924 tree b;
7925 tree t;
7926 tree basetype;
7927 tree offset;
7928 tree decl;
7929 tree init;
7934 /* To find the complete object, we will first convert to our most
7935 primary base, and then add the offset in the vtbl to that value. */
7939 {
7940 tree primary_base;
7946 }
7949 /* The second entry is the address of the typeinfo object. */
7952 else
7955 /* Convert the declaration to a type that can be stored in the
7956 vtable. */
7961 /* Add the offset-to-top entry. It comes earlier in the vtable than
7962 the typeinfo entry. Convert the offset to look like a
7963 function pointer, so that we can put it in the vtable. */
7967 }
7969 /* Fold a OBJ_TYPE_REF expression to the address of a function.
7970 KNOWN_TYPE carries the true type of OBJ_TYPE_REF_OBJECT(REF). */
7972 tree
7974 {
7978 tree fndecl;
7981 {
7982 i += (TARGET_VTABLE_USES_DESCRIPTORS
7985 }
7989 #ifdef ENABLE_CHECKING
7992 #endif
7997 }