2009-10-12 06:13:54 +08:00
|
|
|
//===--- CGVtable.cpp - Emit LLVM Code for C++ vtables --------------------===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This contains code dealing with C++ code generation of virtual tables.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#include "CodeGenModule.h"
|
|
|
|
#include "CodeGenFunction.h"
|
2009-11-28 04:47:55 +08:00
|
|
|
#include "clang/AST/CXXInheritance.h"
|
2009-10-12 06:13:54 +08:00
|
|
|
#include "clang/AST/RecordLayout.h"
|
2009-11-27 03:32:45 +08:00
|
|
|
#include "llvm/ADT/DenseSet.h"
|
2009-11-13 13:46:16 +08:00
|
|
|
#include <cstdio>
|
2009-10-12 06:13:54 +08:00
|
|
|
|
|
|
|
using namespace clang;
|
|
|
|
using namespace CodeGen;
|
|
|
|
|
2009-11-28 06:21:51 +08:00
|
|
|
namespace {
|
2009-11-29 03:45:26 +08:00
|
|
|
class VtableBuilder {
|
2009-10-12 06:13:54 +08:00
|
|
|
public:
|
|
|
|
/// Index_t - Vtable index type.
|
|
|
|
typedef uint64_t Index_t;
|
2009-12-08 07:56:34 +08:00
|
|
|
typedef std::vector<std::pair<GlobalDecl,
|
|
|
|
std::pair<GlobalDecl, ThunkAdjustment> > >
|
|
|
|
SavedAdjustmentsVectorTy;
|
2009-10-12 06:13:54 +08:00
|
|
|
private:
|
2009-12-05 00:19:30 +08:00
|
|
|
|
2009-12-06 09:09:21 +08:00
|
|
|
// VtableComponents - The components of the vtable being built.
|
|
|
|
typedef llvm::SmallVector<llvm::Constant *, 64> VtableComponentsVectorTy;
|
|
|
|
VtableComponentsVectorTy VtableComponents;
|
|
|
|
|
2009-12-05 09:05:03 +08:00
|
|
|
const bool BuildVtable;
|
|
|
|
|
2009-10-12 06:13:54 +08:00
|
|
|
llvm::Type *Ptr8Ty;
|
2009-12-05 02:36:22 +08:00
|
|
|
|
|
|
|
/// MostDerivedClass - The most derived class that this vtable is being
|
|
|
|
/// built for.
|
|
|
|
const CXXRecordDecl *MostDerivedClass;
|
|
|
|
|
2009-11-13 09:54:23 +08:00
|
|
|
/// LayoutClass - The most derived class used for virtual base layout
|
|
|
|
/// information.
|
|
|
|
const CXXRecordDecl *LayoutClass;
|
2009-11-13 10:13:54 +08:00
|
|
|
/// LayoutOffset - The offset for Class in LayoutClass.
|
|
|
|
uint64_t LayoutOffset;
|
2009-10-12 06:13:54 +08:00
|
|
|
/// BLayout - Layout for the most derived class that this vtable is being
|
|
|
|
/// built for.
|
|
|
|
const ASTRecordLayout &BLayout;
|
|
|
|
llvm::SmallSet<const CXXRecordDecl *, 32> IndirectPrimary;
|
|
|
|
llvm::SmallSet<const CXXRecordDecl *, 32> SeenVBase;
|
|
|
|
llvm::Constant *rtti;
|
|
|
|
llvm::LLVMContext &VMContext;
|
|
|
|
CodeGenModule &CGM; // Per-module state.
|
2009-12-04 11:46:21 +08:00
|
|
|
|
2010-01-26 08:05:04 +08:00
|
|
|
llvm::DenseMap<const CXXMethodDecl *, Index_t> VCall;
|
2009-11-14 01:08:56 +08:00
|
|
|
llvm::DenseMap<GlobalDecl, Index_t> VCallOffset;
|
2010-01-26 11:42:22 +08:00
|
|
|
llvm::DenseMap<GlobalDecl, Index_t> VCallOffsetForVCall;
|
2009-11-07 07:27:42 +08:00
|
|
|
// This is the offset to the nearest virtual base
|
2010-01-26 08:05:04 +08:00
|
|
|
llvm::DenseMap<const CXXMethodDecl *, Index_t> NonVirtualOffset;
|
2009-10-12 06:13:54 +08:00
|
|
|
llvm::DenseMap<const CXXRecordDecl *, Index_t> VBIndex;
|
2009-10-28 07:46:47 +08:00
|
|
|
|
2009-11-27 03:54:33 +08:00
|
|
|
/// PureVirtualFunction - Points to __cxa_pure_virtual.
|
|
|
|
llvm::Constant *PureVirtualFn;
|
|
|
|
|
2009-12-04 10:01:07 +08:00
|
|
|
/// VtableMethods - A data structure for keeping track of methods in a vtable.
|
|
|
|
/// Can add methods, override methods and iterate in vtable order.
|
|
|
|
class VtableMethods {
|
|
|
|
// MethodToIndexMap - Maps from a global decl to the index it has in the
|
|
|
|
// Methods vector.
|
|
|
|
llvm::DenseMap<GlobalDecl, uint64_t> MethodToIndexMap;
|
|
|
|
|
|
|
|
/// Methods - The methods, in vtable order.
|
|
|
|
typedef llvm::SmallVector<GlobalDecl, 16> MethodsVectorTy;
|
|
|
|
MethodsVectorTy Methods;
|
2009-12-07 06:01:30 +08:00
|
|
|
MethodsVectorTy OrigMethods;
|
2009-12-04 10:01:07 +08:00
|
|
|
|
|
|
|
public:
|
|
|
|
/// AddMethod - Add a method to the vtable methods.
|
|
|
|
void AddMethod(GlobalDecl GD) {
|
|
|
|
assert(!MethodToIndexMap.count(GD) &&
|
|
|
|
"Method has already been added!");
|
|
|
|
|
|
|
|
MethodToIndexMap[GD] = Methods.size();
|
|
|
|
Methods.push_back(GD);
|
2009-12-07 06:01:30 +08:00
|
|
|
OrigMethods.push_back(GD);
|
2009-12-04 10:01:07 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/// OverrideMethod - Replace a method with another.
|
|
|
|
void OverrideMethod(GlobalDecl OverriddenGD, GlobalDecl GD) {
|
|
|
|
llvm::DenseMap<GlobalDecl, uint64_t>::iterator i
|
|
|
|
= MethodToIndexMap.find(OverriddenGD);
|
|
|
|
assert(i != MethodToIndexMap.end() && "Did not find entry!");
|
|
|
|
|
|
|
|
// Get the index of the old decl.
|
|
|
|
uint64_t Index = i->second;
|
|
|
|
|
|
|
|
// Replace the old decl with the new decl.
|
|
|
|
Methods[Index] = GD;
|
|
|
|
|
|
|
|
// And add the new.
|
|
|
|
MethodToIndexMap[GD] = Index;
|
|
|
|
}
|
|
|
|
|
2009-12-04 23:49:02 +08:00
|
|
|
/// getIndex - Gives the index of a passed in GlobalDecl. Returns false if
|
|
|
|
/// the index couldn't be found.
|
2009-12-05 06:45:27 +08:00
|
|
|
bool getIndex(GlobalDecl GD, uint64_t &Index) const {
|
2009-12-04 23:49:02 +08:00
|
|
|
llvm::DenseMap<GlobalDecl, uint64_t>::const_iterator i
|
|
|
|
= MethodToIndexMap.find(GD);
|
|
|
|
|
|
|
|
if (i == MethodToIndexMap.end())
|
|
|
|
return false;
|
2009-12-04 11:41:37 +08:00
|
|
|
|
2009-12-04 23:49:02 +08:00
|
|
|
Index = i->second;
|
|
|
|
return true;
|
2009-12-04 11:41:37 +08:00
|
|
|
}
|
|
|
|
|
2009-12-07 06:01:30 +08:00
|
|
|
GlobalDecl getOrigMethod(uint64_t Index) const {
|
|
|
|
return OrigMethods[Index];
|
|
|
|
}
|
|
|
|
|
2009-12-04 10:01:07 +08:00
|
|
|
MethodsVectorTy::size_type size() const {
|
|
|
|
return Methods.size();
|
|
|
|
}
|
|
|
|
|
|
|
|
void clear() {
|
|
|
|
MethodToIndexMap.clear();
|
|
|
|
Methods.clear();
|
2009-12-07 06:01:30 +08:00
|
|
|
OrigMethods.clear();
|
2009-12-04 10:01:07 +08:00
|
|
|
}
|
|
|
|
|
2009-12-04 11:41:37 +08:00
|
|
|
GlobalDecl operator[](uint64_t Index) const {
|
2009-12-04 10:01:07 +08:00
|
|
|
return Methods[Index];
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
/// Methods - The vtable methods we're currently building.
|
|
|
|
VtableMethods Methods;
|
|
|
|
|
2009-12-04 10:26:15 +08:00
|
|
|
/// ThisAdjustments - For a given index in the vtable, contains the 'this'
|
|
|
|
/// pointer adjustment needed for a method.
|
|
|
|
typedef llvm::DenseMap<uint64_t, ThunkAdjustment> ThisAdjustmentsMapTy;
|
|
|
|
ThisAdjustmentsMapTy ThisAdjustments;
|
2009-11-27 03:32:45 +08:00
|
|
|
|
2009-12-08 07:56:34 +08:00
|
|
|
SavedAdjustmentsVectorTy SavedAdjustments;
|
2009-12-07 06:01:30 +08:00
|
|
|
|
2009-12-04 10:22:02 +08:00
|
|
|
/// BaseReturnTypes - Contains the base return types of methods who have been
|
|
|
|
/// overridden with methods whose return types require adjustment. Used for
|
|
|
|
/// generating covariant thunk information.
|
|
|
|
typedef llvm::DenseMap<uint64_t, CanQualType> BaseReturnTypesMapTy;
|
|
|
|
BaseReturnTypesMapTy BaseReturnTypes;
|
2009-11-26 11:25:13 +08:00
|
|
|
|
2009-10-12 06:13:54 +08:00
|
|
|
std::vector<Index_t> VCalls;
|
2009-11-13 04:47:57 +08:00
|
|
|
|
|
|
|
typedef std::pair<const CXXRecordDecl *, uint64_t> CtorVtable_t;
|
2009-11-20 04:52:19 +08:00
|
|
|
// subAddressPoints - Used to hold the AddressPoints (offsets) into the built
|
|
|
|
// vtable for use in computing the initializers for the VTT.
|
|
|
|
llvm::DenseMap<CtorVtable_t, int64_t> &subAddressPoints;
|
2009-11-13 04:47:57 +08:00
|
|
|
|
2010-01-14 10:29:07 +08:00
|
|
|
/// AddressPoints - Address points for this vtable.
|
|
|
|
CGVtableInfo::AddressPointsMapTy& AddressPoints;
|
|
|
|
|
2009-10-12 06:13:54 +08:00
|
|
|
typedef CXXRecordDecl::method_iterator method_iter;
|
|
|
|
const uint32_t LLVMPointerWidth;
|
|
|
|
Index_t extra;
|
2009-10-15 10:04:03 +08:00
|
|
|
typedef std::vector<std::pair<const CXXRecordDecl *, int64_t> > Path_t;
|
2009-11-20 04:52:19 +08:00
|
|
|
static llvm::DenseMap<CtorVtable_t, int64_t>&
|
|
|
|
AllocAddressPoint(CodeGenModule &cgm, const CXXRecordDecl *l,
|
|
|
|
const CXXRecordDecl *c) {
|
2010-01-03 02:02:32 +08:00
|
|
|
CGVtableInfo::AddrMap_t *&oref = cgm.getVtableInfo().AddressPoints[l];
|
2009-11-20 04:52:19 +08:00
|
|
|
if (oref == 0)
|
2010-01-03 02:02:32 +08:00
|
|
|
oref = new CGVtableInfo::AddrMap_t;
|
2009-11-20 04:52:19 +08:00
|
|
|
|
|
|
|
llvm::DenseMap<CtorVtable_t, int64_t> *&ref = (*oref)[c];
|
|
|
|
if (ref == 0)
|
|
|
|
ref = new llvm::DenseMap<CtorVtable_t, int64_t>;
|
|
|
|
return *ref;
|
|
|
|
}
|
2009-11-27 03:54:33 +08:00
|
|
|
|
2010-01-26 08:05:04 +08:00
|
|
|
#if 0
|
|
|
|
bool TemplateParameterListsAreEqual(TemplateParameterList *New,
|
|
|
|
TemplateParameterList *Old,
|
|
|
|
TemplateParameterListEqualKind Kind) {
|
|
|
|
assert(0 && "template in vtable");
|
|
|
|
if (Old->size() != New->size()) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (TemplateParameterList::iterator OldParm = Old->begin(),
|
|
|
|
OldParmEnd = Old->end(), NewParm = New->begin();
|
|
|
|
OldParm != OldParmEnd; ++OldParm, ++NewParm) {
|
|
|
|
if ((*OldParm)->getKind() != (*NewParm)->getKind()) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (isa<TemplateTypeParmDecl>(*OldParm)) {
|
|
|
|
// Okay; all template type parameters are equivalent (since we
|
|
|
|
// know we're at the same index).
|
|
|
|
} else if (NonTypeTemplateParmDecl *OldNTTP
|
|
|
|
= dyn_cast<NonTypeTemplateParmDecl>(*OldParm)) {
|
|
|
|
// The types of non-type template parameters must agree.
|
|
|
|
NonTypeTemplateParmDecl *NewNTTP
|
|
|
|
= cast<NonTypeTemplateParmDecl>(*NewParm);
|
|
|
|
|
|
|
|
// If we are matching a template template argument to a template
|
|
|
|
// template parameter and one of the non-type template parameter types
|
|
|
|
// is dependent, then we must wait until template instantiation time
|
|
|
|
// to actually compare the arguments.
|
|
|
|
if (Kind == TPL_TemplateTemplateArgumentMatch &&
|
|
|
|
(OldNTTP->getType()->isDependentType() ||
|
|
|
|
NewNTTP->getType()->isDependentType()))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
if (Context.getCanonicalType(OldNTTP->getType()) !=
|
|
|
|
Context.getCanonicalType(NewNTTP->getType())) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
// The template parameter lists of template template
|
|
|
|
// parameters must agree.
|
|
|
|
assert(isa<TemplateTemplateParmDecl>(*OldParm) &&
|
|
|
|
"Only template template parameters handled here");
|
|
|
|
TemplateTemplateParmDecl *OldTTP
|
|
|
|
= cast<TemplateTemplateParmDecl>(*OldParm);
|
|
|
|
TemplateTemplateParmDecl *NewTTP
|
|
|
|
= cast<TemplateTemplateParmDecl>(*NewParm);
|
|
|
|
if (!TemplateParameterListsAreEqual(NewTTP->getTemplateParameters(),
|
|
|
|
OldTTP->getTemplateParameters(),
|
|
|
|
(Kind == TPL_TemplateMatch? TPL_TemplateTemplateParmMatch : Kind)))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
bool DclIsSame(const FunctionDecl *New, const FunctionDecl *Old) {
|
|
|
|
FunctionTemplateDecl *OldTemplate = Old->getDescribedFunctionTemplate();
|
|
|
|
FunctionTemplateDecl *NewTemplate = New->getDescribedFunctionTemplate();
|
|
|
|
|
|
|
|
// C++ [temp.fct]p2:
|
|
|
|
// A function template can be overloaded with other function templates
|
|
|
|
// and with normal (non-template) functions.
|
|
|
|
if ((OldTemplate == 0) != (NewTemplate == 0))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
// Is the function New an overload of the function Old?
|
|
|
|
QualType OldQType = CGM.getContext().getCanonicalType(Old->getType());
|
|
|
|
QualType NewQType = CGM.getContext().getCanonicalType(New->getType());
|
|
|
|
|
|
|
|
// Compare the signatures (C++ 1.3.10) of the two functions to
|
|
|
|
// determine whether they are overloads. If we find any mismatch
|
|
|
|
// in the signature, they are overloads.
|
|
|
|
|
|
|
|
// If either of these functions is a K&R-style function (no
|
|
|
|
// prototype), then we consider them to have matching signatures.
|
|
|
|
if (isa<FunctionNoProtoType>(OldQType.getTypePtr()) ||
|
|
|
|
isa<FunctionNoProtoType>(NewQType.getTypePtr()))
|
|
|
|
return true;
|
|
|
|
|
|
|
|
FunctionProtoType* OldType = cast<FunctionProtoType>(OldQType);
|
|
|
|
FunctionProtoType* NewType = cast<FunctionProtoType>(NewQType);
|
|
|
|
|
|
|
|
// The signature of a function includes the types of its
|
|
|
|
// parameters (C++ 1.3.10), which includes the presence or absence
|
|
|
|
// of the ellipsis; see C++ DR 357).
|
|
|
|
if (OldQType != NewQType &&
|
|
|
|
(OldType->getNumArgs() != NewType->getNumArgs() ||
|
|
|
|
OldType->isVariadic() != NewType->isVariadic() ||
|
|
|
|
!std::equal(OldType->arg_type_begin(), OldType->arg_type_end(),
|
|
|
|
NewType->arg_type_begin())))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
#if 0
|
|
|
|
// C++ [temp.over.link]p4:
|
|
|
|
// The signature of a function template consists of its function
|
|
|
|
// signature, its return type and its template parameter list. The names
|
|
|
|
// of the template parameters are significant only for establishing the
|
|
|
|
// relationship between the template parameters and the rest of the
|
|
|
|
// signature.
|
|
|
|
//
|
|
|
|
// We check the return type and template parameter lists for function
|
|
|
|
// templates first; the remaining checks follow.
|
|
|
|
if (NewTemplate &&
|
|
|
|
(!TemplateParameterListsAreEqual(NewTemplate->getTemplateParameters(),
|
|
|
|
OldTemplate->getTemplateParameters(),
|
|
|
|
TPL_TemplateMatch) ||
|
|
|
|
OldType->getResultType() != NewType->getResultType()))
|
|
|
|
return false;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
// If the function is a class member, its signature includes the
|
|
|
|
// cv-qualifiers (if any) on the function itself.
|
|
|
|
//
|
|
|
|
// As part of this, also check whether one of the member functions
|
|
|
|
// is static, in which case they are not overloads (C++
|
|
|
|
// 13.1p2). While not part of the definition of the signature,
|
|
|
|
// this check is important to determine whether these functions
|
|
|
|
// can be overloaded.
|
|
|
|
const CXXMethodDecl* OldMethod = dyn_cast<CXXMethodDecl>(Old);
|
|
|
|
const CXXMethodDecl* NewMethod = dyn_cast<CXXMethodDecl>(New);
|
|
|
|
if (OldMethod && NewMethod &&
|
|
|
|
!OldMethod->isStatic() && !NewMethod->isStatic() &&
|
|
|
|
OldMethod->getTypeQualifiers() != NewMethod->getTypeQualifiers())
|
|
|
|
return false;
|
|
|
|
|
|
|
|
// The signatures match; this is not an overload.
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
typedef llvm::DenseMap<const CXXMethodDecl *, const CXXMethodDecl*>
|
|
|
|
ForwardUnique_t;
|
|
|
|
ForwardUnique_t ForwardUnique;
|
|
|
|
llvm::DenseMap<const CXXMethodDecl*, const CXXMethodDecl*> UniqueOverrider;
|
|
|
|
|
|
|
|
void BuildUniqueOverrider(const CXXMethodDecl *U, const CXXMethodDecl *MD) {
|
|
|
|
const CXXMethodDecl *PrevU = UniqueOverrider[MD];
|
|
|
|
assert(U && "no unique overrider");
|
|
|
|
if (PrevU == U)
|
|
|
|
return;
|
|
|
|
if (PrevU != U && PrevU != 0) {
|
|
|
|
// If already set, note the two sets as the same
|
|
|
|
if (0)
|
|
|
|
printf("%s::%s same as %s::%s\n",
|
|
|
|
PrevU->getParent()->getNameAsCString(),
|
|
|
|
PrevU->getNameAsCString(),
|
|
|
|
U->getParent()->getNameAsCString(),
|
|
|
|
U->getNameAsCString());
|
|
|
|
ForwardUnique[PrevU] = U;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Not set, set it now
|
|
|
|
if (0)
|
|
|
|
printf("marking %s::%s %p override as %s::%s\n",
|
|
|
|
MD->getParent()->getNameAsCString(),
|
|
|
|
MD->getNameAsCString(),
|
|
|
|
(void*)MD,
|
|
|
|
U->getParent()->getNameAsCString(),
|
|
|
|
U->getNameAsCString());
|
|
|
|
UniqueOverrider[MD] = U;
|
|
|
|
|
|
|
|
for (CXXMethodDecl::method_iterator mi = MD->begin_overridden_methods(),
|
|
|
|
me = MD->end_overridden_methods(); mi != me; ++mi) {
|
|
|
|
BuildUniqueOverrider(U, *mi);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void BuildUniqueOverriders(const CXXRecordDecl *RD) {
|
|
|
|
if (0) printf("walking %s\n", RD->getNameAsCString());
|
|
|
|
for (CXXRecordDecl::method_iterator i = RD->method_begin(),
|
|
|
|
e = RD->method_end(); i != e; ++i) {
|
|
|
|
const CXXMethodDecl *MD = *i;
|
|
|
|
if (!MD->isVirtual())
|
|
|
|
continue;
|
|
|
|
|
|
|
|
if (UniqueOverrider[MD] == 0) {
|
|
|
|
// Only set this, if it hasn't been set yet.
|
|
|
|
BuildUniqueOverrider(MD, MD);
|
|
|
|
if (0)
|
|
|
|
printf("top set is %s::%s %p\n",
|
|
|
|
MD->getParent()->getNameAsCString(),
|
|
|
|
MD->getNameAsCString(),
|
|
|
|
(void*)MD);
|
|
|
|
ForwardUnique[MD] = MD;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
for (CXXRecordDecl::base_class_const_iterator i = RD->bases_begin(),
|
|
|
|
e = RD->bases_end(); i != e; ++i) {
|
|
|
|
const CXXRecordDecl *Base =
|
|
|
|
cast<CXXRecordDecl>(i->getType()->getAs<RecordType>()->getDecl());
|
|
|
|
BuildUniqueOverriders(Base);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static int DclCmp(const void *p1, const void *p2) {
|
|
|
|
const CXXMethodDecl *MD1 = (const CXXMethodDecl *)p1;
|
|
|
|
const CXXMethodDecl *MD2 = (const CXXMethodDecl *)p2;
|
|
|
|
return (MD1->getIdentifier() - MD2->getIdentifier());
|
|
|
|
}
|
|
|
|
|
|
|
|
void MergeForwarding() {
|
|
|
|
typedef llvm::SmallVector<const CXXMethodDecl *, 100> A_t;
|
|
|
|
A_t A;
|
|
|
|
for (ForwardUnique_t::iterator I = ForwardUnique.begin(),
|
|
|
|
E = ForwardUnique.end(); I != E; ++I) {
|
|
|
|
if (I->first == I->second)
|
|
|
|
// Only add the roots of all trees
|
|
|
|
A.push_back(I->first);
|
|
|
|
}
|
|
|
|
llvm::array_pod_sort(A.begin(), A.end(), DclCmp);
|
|
|
|
for (A_t::iterator I = A.begin(),
|
|
|
|
E = A.end(); I != E; ++I) {
|
|
|
|
A_t::iterator J = I;
|
|
|
|
while (++J != E && DclCmp(*I, *J) == 0)
|
|
|
|
if (DclIsSame(*I, *J)) {
|
|
|
|
printf("connecting %s\n", (*I)->getNameAsCString());
|
|
|
|
ForwardUnique[*J] = *I;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
const CXXMethodDecl *getUnique(const CXXMethodDecl *MD) {
|
|
|
|
const CXXMethodDecl *U = UniqueOverrider[MD];
|
|
|
|
assert(U && "unique overrider not found");
|
|
|
|
while (ForwardUnique.count(U)) {
|
|
|
|
const CXXMethodDecl *NU = ForwardUnique[U];
|
|
|
|
if (NU == U) break;
|
|
|
|
U = NU;
|
|
|
|
}
|
|
|
|
return U;
|
|
|
|
}
|
|
|
|
const CXXMethodDecl *getUnique(GlobalDecl GD) {
|
|
|
|
return getUnique(cast<CXXMethodDecl>(GD.getDecl()));
|
|
|
|
}
|
|
|
|
|
2009-11-27 03:54:33 +08:00
|
|
|
/// getPureVirtualFn - Return the __cxa_pure_virtual function.
|
|
|
|
llvm::Constant* getPureVirtualFn() {
|
|
|
|
if (!PureVirtualFn) {
|
|
|
|
const llvm::FunctionType *Ty =
|
|
|
|
llvm::FunctionType::get(llvm::Type::getVoidTy(VMContext),
|
|
|
|
/*isVarArg=*/false);
|
|
|
|
PureVirtualFn = wrap(CGM.CreateRuntimeFunction(Ty, "__cxa_pure_virtual"));
|
|
|
|
}
|
|
|
|
|
|
|
|
return PureVirtualFn;
|
|
|
|
}
|
|
|
|
|
2009-10-12 06:13:54 +08:00
|
|
|
public:
|
2009-12-05 02:36:22 +08:00
|
|
|
VtableBuilder(const CXXRecordDecl *MostDerivedClass,
|
2009-12-05 09:05:03 +08:00
|
|
|
const CXXRecordDecl *l, uint64_t lo, CodeGenModule &cgm,
|
2010-01-14 10:29:07 +08:00
|
|
|
bool build, CGVtableInfo::AddressPointsMapTy& AddressPoints)
|
2009-12-05 09:05:03 +08:00
|
|
|
: BuildVtable(build), MostDerivedClass(MostDerivedClass), LayoutClass(l),
|
|
|
|
LayoutOffset(lo), BLayout(cgm.getContext().getASTRecordLayout(l)),
|
|
|
|
rtti(0), VMContext(cgm.getModule().getContext()),CGM(cgm),
|
|
|
|
PureVirtualFn(0),
|
2009-12-05 02:36:22 +08:00
|
|
|
subAddressPoints(AllocAddressPoint(cgm, l, MostDerivedClass)),
|
2010-01-14 10:29:07 +08:00
|
|
|
AddressPoints(AddressPoints),
|
|
|
|
LLVMPointerWidth(cgm.getContext().Target.getPointerWidth(0))
|
|
|
|
{
|
2009-10-12 06:13:54 +08:00
|
|
|
Ptr8Ty = llvm::PointerType::get(llvm::Type::getInt8Ty(VMContext), 0);
|
2009-12-17 15:09:17 +08:00
|
|
|
if (BuildVtable) {
|
|
|
|
QualType ClassType = CGM.getContext().getTagDeclType(MostDerivedClass);
|
|
|
|
rtti = CGM.GetAddrOfRTTIDescriptor(ClassType);
|
|
|
|
}
|
2010-01-26 08:05:04 +08:00
|
|
|
BuildUniqueOverriders(MostDerivedClass);
|
|
|
|
MergeForwarding();
|
2009-10-12 06:13:54 +08:00
|
|
|
}
|
|
|
|
|
2009-12-06 09:09:21 +08:00
|
|
|
// getVtableComponents - Returns a reference to the vtable components.
|
|
|
|
const VtableComponentsVectorTy &getVtableComponents() const {
|
|
|
|
return VtableComponents;
|
2009-12-05 00:19:30 +08:00
|
|
|
}
|
|
|
|
|
2010-01-02 09:01:18 +08:00
|
|
|
llvm::DenseMap<const CXXRecordDecl *, uint64_t> &getVBIndex()
|
2009-10-12 06:13:54 +08:00
|
|
|
{ return VBIndex; }
|
|
|
|
|
2009-12-08 07:56:34 +08:00
|
|
|
SavedAdjustmentsVectorTy &getSavedAdjustments()
|
|
|
|
{ return SavedAdjustments; }
|
2009-12-07 06:01:30 +08:00
|
|
|
|
2009-10-12 06:13:54 +08:00
|
|
|
llvm::Constant *wrap(Index_t i) {
|
|
|
|
llvm::Constant *m;
|
|
|
|
m = llvm::ConstantInt::get(llvm::Type::getInt64Ty(VMContext), i);
|
|
|
|
return llvm::ConstantExpr::getIntToPtr(m, Ptr8Ty);
|
|
|
|
}
|
|
|
|
|
|
|
|
llvm::Constant *wrap(llvm::Constant *m) {
|
|
|
|
return llvm::ConstantExpr::getBitCast(m, Ptr8Ty);
|
|
|
|
}
|
|
|
|
|
2010-01-22 10:51:26 +08:00
|
|
|
//#define D1(x)
|
|
|
|
#define D1(X) do { if (getenv("DEBUG")) { X; } } while (0)
|
2009-11-01 04:06:59 +08:00
|
|
|
|
|
|
|
void GenerateVBaseOffsets(const CXXRecordDecl *RD, uint64_t Offset,
|
2009-10-14 06:54:56 +08:00
|
|
|
bool updateVBIndex, Index_t current_vbindex) {
|
2009-10-12 06:13:54 +08:00
|
|
|
for (CXXRecordDecl::base_class_const_iterator i = RD->bases_begin(),
|
|
|
|
e = RD->bases_end(); i != e; ++i) {
|
|
|
|
const CXXRecordDecl *Base =
|
|
|
|
cast<CXXRecordDecl>(i->getType()->getAs<RecordType>()->getDecl());
|
2009-10-14 06:54:56 +08:00
|
|
|
Index_t next_vbindex = current_vbindex;
|
2009-10-12 06:13:54 +08:00
|
|
|
if (i->isVirtual() && !SeenVBase.count(Base)) {
|
|
|
|
SeenVBase.insert(Base);
|
2009-10-14 06:54:56 +08:00
|
|
|
if (updateVBIndex) {
|
2009-11-01 04:06:59 +08:00
|
|
|
next_vbindex = (ssize_t)(-(VCalls.size()*LLVMPointerWidth/8)
|
2009-10-14 06:54:56 +08:00
|
|
|
- 3*LLVMPointerWidth/8);
|
|
|
|
VBIndex[Base] = next_vbindex;
|
|
|
|
}
|
2009-11-01 04:06:59 +08:00
|
|
|
int64_t BaseOffset = -(Offset/8) + BLayout.getVBaseClassOffset(Base)/8;
|
|
|
|
VCalls.push_back((0?700:0) + BaseOffset);
|
|
|
|
D1(printf(" vbase for %s at %d delta %d most derived %s\n",
|
|
|
|
Base->getNameAsCString(),
|
|
|
|
(int)-VCalls.size()-3, (int)BaseOffset,
|
2010-01-22 10:51:26 +08:00
|
|
|
MostDerivedClass->getNameAsCString()));
|
2009-10-12 06:13:54 +08:00
|
|
|
}
|
2009-10-14 06:54:56 +08:00
|
|
|
// We also record offsets for non-virtual bases to closest enclosing
|
|
|
|
// virtual base. We do this so that we don't have to search
|
|
|
|
// for the nearst virtual base class when generating thunks.
|
|
|
|
if (updateVBIndex && VBIndex.count(Base) == 0)
|
|
|
|
VBIndex[Base] = next_vbindex;
|
2009-11-01 04:06:59 +08:00
|
|
|
GenerateVBaseOffsets(Base, Offset, updateVBIndex, next_vbindex);
|
2009-10-12 06:13:54 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void StartNewTable() {
|
|
|
|
SeenVBase.clear();
|
|
|
|
}
|
|
|
|
|
2009-10-15 17:30:16 +08:00
|
|
|
Index_t getNVOffset_1(const CXXRecordDecl *D, const CXXRecordDecl *B,
|
|
|
|
Index_t Offset = 0) {
|
|
|
|
|
|
|
|
if (B == D)
|
|
|
|
return Offset;
|
|
|
|
|
|
|
|
const ASTRecordLayout &Layout = CGM.getContext().getASTRecordLayout(D);
|
|
|
|
for (CXXRecordDecl::base_class_const_iterator i = D->bases_begin(),
|
|
|
|
e = D->bases_end(); i != e; ++i) {
|
|
|
|
const CXXRecordDecl *Base =
|
|
|
|
cast<CXXRecordDecl>(i->getType()->getAs<RecordType>()->getDecl());
|
|
|
|
int64_t BaseOffset = 0;
|
|
|
|
if (!i->isVirtual())
|
|
|
|
BaseOffset = Offset + Layout.getBaseClassOffset(Base);
|
|
|
|
int64_t o = getNVOffset_1(Base, B, BaseOffset);
|
|
|
|
if (o >= 0)
|
|
|
|
return o;
|
|
|
|
}
|
|
|
|
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// getNVOffset - Returns the non-virtual offset for the given (B) base of the
|
|
|
|
/// derived class D.
|
|
|
|
Index_t getNVOffset(QualType qB, QualType qD) {
|
2009-11-04 03:03:17 +08:00
|
|
|
qD = qD->getPointeeType();
|
|
|
|
qB = qB->getPointeeType();
|
2009-10-15 17:30:16 +08:00
|
|
|
CXXRecordDecl *D = cast<CXXRecordDecl>(qD->getAs<RecordType>()->getDecl());
|
|
|
|
CXXRecordDecl *B = cast<CXXRecordDecl>(qB->getAs<RecordType>()->getDecl());
|
|
|
|
int64_t o = getNVOffset_1(D, B);
|
|
|
|
if (o >= 0)
|
|
|
|
return o;
|
|
|
|
|
|
|
|
assert(false && "FIXME: non-virtual base not found");
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2009-10-12 06:13:54 +08:00
|
|
|
/// getVbaseOffset - Returns the index into the vtable for the virtual base
|
|
|
|
/// offset for the given (B) virtual base of the derived class D.
|
|
|
|
Index_t getVbaseOffset(QualType qB, QualType qD) {
|
2009-11-04 03:03:17 +08:00
|
|
|
qD = qD->getPointeeType();
|
|
|
|
qB = qB->getPointeeType();
|
2009-10-12 06:13:54 +08:00
|
|
|
CXXRecordDecl *D = cast<CXXRecordDecl>(qD->getAs<RecordType>()->getDecl());
|
|
|
|
CXXRecordDecl *B = cast<CXXRecordDecl>(qB->getAs<RecordType>()->getDecl());
|
2009-12-05 02:36:22 +08:00
|
|
|
if (D != MostDerivedClass)
|
2009-11-30 09:19:33 +08:00
|
|
|
return CGM.getVtableInfo().getVirtualBaseOffsetIndex(D, B);
|
2009-10-12 06:13:54 +08:00
|
|
|
llvm::DenseMap<const CXXRecordDecl *, Index_t>::iterator i;
|
|
|
|
i = VBIndex.find(B);
|
|
|
|
if (i != VBIndex.end())
|
|
|
|
return i->second;
|
|
|
|
|
2009-10-14 06:54:56 +08:00
|
|
|
assert(false && "FIXME: Base not found");
|
2009-10-12 06:13:54 +08:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2009-12-04 16:40:51 +08:00
|
|
|
bool OverrideMethod(GlobalDecl GD, bool MorallyVirtual,
|
|
|
|
Index_t OverrideOffset, Index_t Offset,
|
|
|
|
int64_t CurrentVBaseOffset);
|
2009-10-12 06:13:54 +08:00
|
|
|
|
2009-12-04 10:39:04 +08:00
|
|
|
/// AppendMethods - Append the current methods to the vtable.
|
2009-12-04 10:56:03 +08:00
|
|
|
void AppendMethodsToVtable();
|
2009-12-04 10:39:04 +08:00
|
|
|
|
2009-11-14 01:08:56 +08:00
|
|
|
llvm::Constant *WrapAddrOf(GlobalDecl GD) {
|
|
|
|
const CXXMethodDecl *MD = cast<CXXMethodDecl>(GD.getDecl());
|
|
|
|
|
2009-11-24 13:08:52 +08:00
|
|
|
const llvm::Type *Ty = CGM.getTypes().GetFunctionTypeForVtable(MD);
|
2009-10-28 07:36:26 +08:00
|
|
|
|
2009-12-04 00:55:20 +08:00
|
|
|
return wrap(CGM.GetAddrOfFunction(GD, Ty));
|
2009-10-28 07:36:26 +08:00
|
|
|
}
|
|
|
|
|
2009-11-07 07:27:42 +08:00
|
|
|
void OverrideMethods(Path_t *Path, bool MorallyVirtual, int64_t Offset,
|
|
|
|
int64_t CurrentVBaseOffset) {
|
2009-10-15 10:04:03 +08:00
|
|
|
for (Path_t::reverse_iterator i = Path->rbegin(),
|
2009-10-12 06:13:54 +08:00
|
|
|
e = Path->rend(); i != e; ++i) {
|
|
|
|
const CXXRecordDecl *RD = i->first;
|
2009-10-15 17:30:16 +08:00
|
|
|
int64_t OverrideOffset = i->second;
|
2009-10-12 06:13:54 +08:00
|
|
|
for (method_iter mi = RD->method_begin(), me = RD->method_end(); mi != me;
|
|
|
|
++mi) {
|
2009-11-14 01:08:56 +08:00
|
|
|
const CXXMethodDecl *MD = *mi;
|
|
|
|
|
|
|
|
if (!MD->isVirtual())
|
2009-10-12 06:13:54 +08:00
|
|
|
continue;
|
|
|
|
|
2009-11-14 01:08:56 +08:00
|
|
|
if (const CXXDestructorDecl *DD = dyn_cast<CXXDestructorDecl>(MD)) {
|
|
|
|
// Override both the complete and the deleting destructor.
|
|
|
|
GlobalDecl CompDtor(DD, Dtor_Complete);
|
2009-12-04 16:40:51 +08:00
|
|
|
OverrideMethod(CompDtor, MorallyVirtual, OverrideOffset, Offset,
|
|
|
|
CurrentVBaseOffset);
|
|
|
|
|
2009-11-14 01:08:56 +08:00
|
|
|
GlobalDecl DeletingDtor(DD, Dtor_Deleting);
|
2009-12-04 16:40:51 +08:00
|
|
|
OverrideMethod(DeletingDtor, MorallyVirtual, OverrideOffset, Offset,
|
|
|
|
CurrentVBaseOffset);
|
2009-11-14 01:08:56 +08:00
|
|
|
} else {
|
2009-12-04 16:40:51 +08:00
|
|
|
OverrideMethod(MD, MorallyVirtual, OverrideOffset, Offset,
|
|
|
|
CurrentVBaseOffset);
|
2009-11-14 01:08:56 +08:00
|
|
|
}
|
2009-10-12 06:13:54 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-11-14 01:08:56 +08:00
|
|
|
void AddMethod(const GlobalDecl GD, bool MorallyVirtual, Index_t Offset,
|
2009-11-30 09:19:33 +08:00
|
|
|
int64_t CurrentVBaseOffset) {
|
2009-10-12 06:13:54 +08:00
|
|
|
// If we can find a previously allocated slot for this, reuse it.
|
2009-12-04 16:40:51 +08:00
|
|
|
if (OverrideMethod(GD, MorallyVirtual, Offset, Offset,
|
2009-11-07 07:27:42 +08:00
|
|
|
CurrentVBaseOffset))
|
2009-10-12 06:13:54 +08:00
|
|
|
return;
|
|
|
|
|
2010-01-23 02:48:47 +08:00
|
|
|
D1(printf(" vfn for %s at %d\n",
|
|
|
|
dyn_cast<CXXMethodDecl>(GD.getDecl())->getNameAsCString(),
|
|
|
|
(int)Methods.size()));
|
|
|
|
|
2009-12-04 10:08:24 +08:00
|
|
|
// We didn't find an entry in the vtable that we could use, add a new
|
|
|
|
// entry.
|
|
|
|
Methods.AddMethod(GD);
|
|
|
|
|
2009-12-08 07:56:34 +08:00
|
|
|
VCallOffset[GD] = Offset/8;
|
2009-10-12 06:13:54 +08:00
|
|
|
if (MorallyVirtual) {
|
2010-01-26 08:05:04 +08:00
|
|
|
const CXXMethodDecl *UMD = getUnique(GD);
|
|
|
|
assert(UMD && "final overrider not found");
|
|
|
|
|
|
|
|
Index_t &idx = VCall[UMD];
|
2009-10-12 06:13:54 +08:00
|
|
|
// Allocate the first one, after that, we reuse the previous one.
|
|
|
|
if (idx == 0) {
|
2010-01-26 11:42:22 +08:00
|
|
|
VCallOffsetForVCall[UMD] = Offset/8;
|
2010-01-26 08:05:04 +08:00
|
|
|
NonVirtualOffset[UMD] = -CurrentVBaseOffset/8 + Offset/8;
|
2009-10-12 06:13:54 +08:00
|
|
|
idx = VCalls.size()+1;
|
2010-01-26 08:05:04 +08:00
|
|
|
VCalls.push_back(Offset/8 - CurrentVBaseOffset/8);
|
2009-11-01 04:06:59 +08:00
|
|
|
D1(printf(" vcall for %s at %d with delta %d\n",
|
2010-01-22 10:51:26 +08:00
|
|
|
dyn_cast<CXXMethodDecl>(GD.getDecl())->getNameAsCString(),
|
2010-01-26 08:05:04 +08:00
|
|
|
(int)-VCalls.size()-3, (int)VCalls[idx-1]));
|
2009-10-12 06:13:54 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void AddMethods(const CXXRecordDecl *RD, bool MorallyVirtual,
|
2009-11-30 09:19:33 +08:00
|
|
|
Index_t Offset, int64_t CurrentVBaseOffset) {
|
2009-10-12 06:13:54 +08:00
|
|
|
for (method_iter mi = RD->method_begin(), me = RD->method_end(); mi != me;
|
2009-11-14 01:08:56 +08:00
|
|
|
++mi) {
|
|
|
|
const CXXMethodDecl *MD = *mi;
|
|
|
|
if (!MD->isVirtual())
|
|
|
|
continue;
|
|
|
|
|
|
|
|
if (const CXXDestructorDecl *DD = dyn_cast<CXXDestructorDecl>(MD)) {
|
|
|
|
// For destructors, add both the complete and the deleting destructor
|
|
|
|
// to the vtable.
|
|
|
|
AddMethod(GlobalDecl(DD, Dtor_Complete), MorallyVirtual, Offset,
|
2009-11-30 09:19:33 +08:00
|
|
|
CurrentVBaseOffset);
|
2009-11-14 01:08:56 +08:00
|
|
|
AddMethod(GlobalDecl(DD, Dtor_Deleting), MorallyVirtual, Offset,
|
2009-11-07 07:27:42 +08:00
|
|
|
CurrentVBaseOffset);
|
2009-11-30 09:19:33 +08:00
|
|
|
} else
|
|
|
|
AddMethod(MD, MorallyVirtual, Offset, CurrentVBaseOffset);
|
2009-11-14 01:08:56 +08:00
|
|
|
}
|
2009-10-12 06:13:54 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
void NonVirtualBases(const CXXRecordDecl *RD, const ASTRecordLayout &Layout,
|
|
|
|
const CXXRecordDecl *PrimaryBase,
|
|
|
|
bool PrimaryBaseWasVirtual, bool MorallyVirtual,
|
2009-11-07 07:27:42 +08:00
|
|
|
int64_t Offset, int64_t CurrentVBaseOffset,
|
|
|
|
Path_t *Path) {
|
2009-10-15 10:04:03 +08:00
|
|
|
Path->push_back(std::make_pair(RD, Offset));
|
2009-10-12 06:13:54 +08:00
|
|
|
for (CXXRecordDecl::base_class_const_iterator i = RD->bases_begin(),
|
|
|
|
e = RD->bases_end(); i != e; ++i) {
|
|
|
|
if (i->isVirtual())
|
|
|
|
continue;
|
|
|
|
const CXXRecordDecl *Base =
|
|
|
|
cast<CXXRecordDecl>(i->getType()->getAs<RecordType>()->getDecl());
|
2010-01-22 14:45:05 +08:00
|
|
|
uint64_t o = Offset + Layout.getBaseClassOffset(Base);
|
|
|
|
StartNewTable();
|
|
|
|
GenerateVtableForBase(Base, o, MorallyVirtual, false,
|
|
|
|
true, Base == PrimaryBase && !PrimaryBaseWasVirtual,
|
|
|
|
CurrentVBaseOffset, Path);
|
2009-10-12 06:13:54 +08:00
|
|
|
}
|
2009-10-15 10:04:03 +08:00
|
|
|
Path->pop_back();
|
2009-10-12 06:13:54 +08:00
|
|
|
}
|
|
|
|
|
2009-10-15 02:14:51 +08:00
|
|
|
// #define D(X) do { X; } while (0)
|
|
|
|
#define D(X)
|
|
|
|
|
|
|
|
void insertVCalls(int InsertionPoint) {
|
2009-11-01 04:06:59 +08:00
|
|
|
D1(printf("============= combining vbase/vcall\n"));
|
2009-10-15 02:14:51 +08:00
|
|
|
D(VCalls.insert(VCalls.begin(), 673));
|
|
|
|
D(VCalls.push_back(672));
|
2009-12-05 09:05:03 +08:00
|
|
|
|
2009-12-06 09:09:21 +08:00
|
|
|
VtableComponents.insert(VtableComponents.begin() + InsertionPoint,
|
|
|
|
VCalls.size(), 0);
|
2009-12-05 09:05:03 +08:00
|
|
|
if (BuildVtable) {
|
|
|
|
// The vcalls come first...
|
|
|
|
for (std::vector<Index_t>::reverse_iterator i = VCalls.rbegin(),
|
|
|
|
e = VCalls.rend();
|
|
|
|
i != e; ++i)
|
2009-12-06 09:09:21 +08:00
|
|
|
VtableComponents[InsertionPoint++] = wrap((0?600:0) + *i);
|
2009-12-05 09:05:03 +08:00
|
|
|
}
|
2009-10-15 02:14:51 +08:00
|
|
|
VCalls.clear();
|
2009-11-10 10:30:51 +08:00
|
|
|
VCall.clear();
|
2009-10-15 02:14:51 +08:00
|
|
|
}
|
|
|
|
|
2009-11-14 07:13:20 +08:00
|
|
|
void AddAddressPoints(const CXXRecordDecl *RD, uint64_t Offset,
|
|
|
|
Index_t AddressPoint) {
|
|
|
|
D1(printf("XXX address point for %s in %s layout %s at offset %d is %d\n",
|
2010-01-22 10:51:26 +08:00
|
|
|
RD->getNameAsCString(), MostDerivedClass->getNameAsCString(),
|
2009-11-14 07:13:20 +08:00
|
|
|
LayoutClass->getNameAsCString(), (int)Offset, (int)AddressPoint));
|
2009-11-20 04:52:19 +08:00
|
|
|
subAddressPoints[std::make_pair(RD, Offset)] = AddressPoint;
|
2010-01-14 10:29:07 +08:00
|
|
|
AddressPoints[BaseSubobject(RD, Offset)] = AddressPoint;
|
2009-11-14 07:13:20 +08:00
|
|
|
|
|
|
|
// Now also add the address point for all our primary bases.
|
|
|
|
while (1) {
|
|
|
|
const ASTRecordLayout &Layout = CGM.getContext().getASTRecordLayout(RD);
|
|
|
|
RD = Layout.getPrimaryBase();
|
|
|
|
const bool PrimaryBaseWasVirtual = Layout.getPrimaryBaseWasVirtual();
|
|
|
|
// FIXME: Double check this.
|
|
|
|
if (RD == 0)
|
|
|
|
break;
|
|
|
|
if (PrimaryBaseWasVirtual &&
|
|
|
|
BLayout.getVBaseClassOffset(RD) != Offset)
|
|
|
|
break;
|
|
|
|
D1(printf("XXX address point for %s in %s layout %s at offset %d is %d\n",
|
2010-01-22 10:51:26 +08:00
|
|
|
RD->getNameAsCString(), MostDerivedClass->getNameAsCString(),
|
2009-11-14 07:13:20 +08:00
|
|
|
LayoutClass->getNameAsCString(), (int)Offset, (int)AddressPoint));
|
2009-11-20 04:52:19 +08:00
|
|
|
subAddressPoints[std::make_pair(RD, Offset)] = AddressPoint;
|
2010-01-14 10:29:07 +08:00
|
|
|
AddressPoints[BaseSubobject(RD, Offset)] = AddressPoint;
|
2009-11-14 07:13:20 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-12-24 15:29:41 +08:00
|
|
|
void FinishGenerateVtable(const CXXRecordDecl *RD,
|
|
|
|
const ASTRecordLayout &Layout,
|
|
|
|
const CXXRecordDecl *PrimaryBase,
|
2010-01-22 14:45:05 +08:00
|
|
|
bool ForNPNVBases, bool WasPrimaryBase,
|
2009-12-24 15:29:41 +08:00
|
|
|
bool PrimaryBaseWasVirtual,
|
|
|
|
bool MorallyVirtual, int64_t Offset,
|
|
|
|
bool ForVirtualBase, int64_t CurrentVBaseOffset,
|
|
|
|
Path_t *Path) {
|
2009-10-15 10:04:03 +08:00
|
|
|
bool alloc = false;
|
|
|
|
if (Path == 0) {
|
|
|
|
alloc = true;
|
|
|
|
Path = new Path_t;
|
|
|
|
}
|
|
|
|
|
2009-10-12 06:13:54 +08:00
|
|
|
StartNewTable();
|
|
|
|
extra = 0;
|
2010-01-22 14:45:05 +08:00
|
|
|
Index_t AddressPoint = 0;
|
|
|
|
int VCallInsertionPoint = 0;
|
|
|
|
if (!ForNPNVBases || !WasPrimaryBase) {
|
|
|
|
bool DeferVCalls = MorallyVirtual || ForVirtualBase;
|
|
|
|
VCallInsertionPoint = VtableComponents.size();
|
|
|
|
if (!DeferVCalls) {
|
|
|
|
insertVCalls(VCallInsertionPoint);
|
|
|
|
} else
|
|
|
|
// FIXME: just for extra, or for all uses of VCalls.size post this?
|
|
|
|
extra = -VCalls.size();
|
2009-10-12 06:13:54 +08:00
|
|
|
|
2010-01-22 14:45:05 +08:00
|
|
|
// Add the offset to top.
|
|
|
|
VtableComponents.push_back(BuildVtable ? wrap(-((Offset-LayoutOffset)/8)) : 0);
|
2009-12-05 00:19:30 +08:00
|
|
|
|
2010-01-22 14:45:05 +08:00
|
|
|
// Add the RTTI information.
|
|
|
|
VtableComponents.push_back(rtti);
|
2009-12-05 00:19:30 +08:00
|
|
|
|
2010-01-22 14:45:05 +08:00
|
|
|
AddressPoint = VtableComponents.size();
|
2009-10-12 06:13:54 +08:00
|
|
|
|
2010-01-22 14:45:05 +08:00
|
|
|
AppendMethodsToVtable();
|
|
|
|
}
|
2009-10-12 06:13:54 +08:00
|
|
|
|
|
|
|
// and then the non-virtual bases.
|
|
|
|
NonVirtualBases(RD, Layout, PrimaryBase, PrimaryBaseWasVirtual,
|
2009-11-07 07:27:42 +08:00
|
|
|
MorallyVirtual, Offset, CurrentVBaseOffset, Path);
|
2009-10-15 02:14:51 +08:00
|
|
|
|
|
|
|
if (ForVirtualBase) {
|
2009-11-13 04:47:57 +08:00
|
|
|
// FIXME: We're adding to VCalls in callers, we need to do the overrides
|
|
|
|
// in the inner part, so that we know the complete set of vcalls during
|
|
|
|
// the build and don't have to insert into methods. Saving out the
|
|
|
|
// AddressPoint here, would need to be fixed, if we didn't do that. Also
|
|
|
|
// retroactively adding vcalls for overrides later wind up in the wrong
|
|
|
|
// place, the vcall slot has to be alloted during the walk of the base
|
|
|
|
// when the function is first introduces.
|
2009-10-15 02:14:51 +08:00
|
|
|
AddressPoint += VCalls.size();
|
2009-11-13 04:47:57 +08:00
|
|
|
insertVCalls(VCallInsertionPoint);
|
2009-10-15 02:14:51 +08:00
|
|
|
}
|
|
|
|
|
2010-01-22 14:45:05 +08:00
|
|
|
if (!ForNPNVBases || !WasPrimaryBase)
|
|
|
|
AddAddressPoints(RD, Offset, AddressPoint);
|
2009-11-13 04:47:57 +08:00
|
|
|
|
2009-10-15 10:04:03 +08:00
|
|
|
if (alloc) {
|
|
|
|
delete Path;
|
|
|
|
}
|
2009-10-12 06:13:54 +08:00
|
|
|
}
|
|
|
|
|
2009-11-01 04:06:59 +08:00
|
|
|
void Primaries(const CXXRecordDecl *RD, bool MorallyVirtual, int64_t Offset,
|
|
|
|
bool updateVBIndex, Index_t current_vbindex,
|
2009-11-30 09:19:33 +08:00
|
|
|
int64_t CurrentVBaseOffset) {
|
2009-11-01 04:06:59 +08:00
|
|
|
if (!RD->isDynamicClass())
|
|
|
|
return;
|
|
|
|
|
|
|
|
const ASTRecordLayout &Layout = CGM.getContext().getASTRecordLayout(RD);
|
|
|
|
const CXXRecordDecl *PrimaryBase = Layout.getPrimaryBase();
|
|
|
|
const bool PrimaryBaseWasVirtual = Layout.getPrimaryBaseWasVirtual();
|
|
|
|
|
|
|
|
// vtables are composed from the chain of primaries.
|
2009-12-04 16:52:11 +08:00
|
|
|
if (PrimaryBase && !PrimaryBaseWasVirtual) {
|
2009-11-01 04:06:59 +08:00
|
|
|
D1(printf(" doing primaries for %s most derived %s\n",
|
2010-01-22 10:51:26 +08:00
|
|
|
RD->getNameAsCString(), MostDerivedClass->getNameAsCString()));
|
2009-12-04 16:52:11 +08:00
|
|
|
Primaries(PrimaryBase, PrimaryBaseWasVirtual|MorallyVirtual, Offset,
|
|
|
|
updateVBIndex, current_vbindex, CurrentVBaseOffset);
|
2009-11-01 04:06:59 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
D1(printf(" doing vcall entries for %s most derived %s\n",
|
2010-01-22 10:51:26 +08:00
|
|
|
RD->getNameAsCString(), MostDerivedClass->getNameAsCString()));
|
2009-11-01 04:06:59 +08:00
|
|
|
|
|
|
|
// And add the virtuals for the class to the primary vtable.
|
2009-11-30 09:19:33 +08:00
|
|
|
AddMethods(RD, MorallyVirtual, Offset, CurrentVBaseOffset);
|
2009-11-01 04:06:59 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
void VBPrimaries(const CXXRecordDecl *RD, bool MorallyVirtual, int64_t Offset,
|
|
|
|
bool updateVBIndex, Index_t current_vbindex,
|
2009-11-07 07:27:42 +08:00
|
|
|
bool RDisVirtualBase, int64_t CurrentVBaseOffset,
|
2009-11-30 09:19:33 +08:00
|
|
|
bool bottom) {
|
2009-10-12 06:13:54 +08:00
|
|
|
if (!RD->isDynamicClass())
|
|
|
|
return;
|
|
|
|
|
|
|
|
const ASTRecordLayout &Layout = CGM.getContext().getASTRecordLayout(RD);
|
|
|
|
const CXXRecordDecl *PrimaryBase = Layout.getPrimaryBase();
|
|
|
|
const bool PrimaryBaseWasVirtual = Layout.getPrimaryBaseWasVirtual();
|
|
|
|
|
|
|
|
// vtables are composed from the chain of primaries.
|
|
|
|
if (PrimaryBase) {
|
2009-11-07 07:27:42 +08:00
|
|
|
int BaseCurrentVBaseOffset = CurrentVBaseOffset;
|
|
|
|
if (PrimaryBaseWasVirtual) {
|
2009-10-12 06:13:54 +08:00
|
|
|
IndirectPrimary.insert(PrimaryBase);
|
2009-11-07 07:27:42 +08:00
|
|
|
BaseCurrentVBaseOffset = BLayout.getVBaseClassOffset(PrimaryBase);
|
|
|
|
}
|
2009-11-01 04:06:59 +08:00
|
|
|
|
|
|
|
D1(printf(" doing primaries for %s most derived %s\n",
|
2010-01-22 10:51:26 +08:00
|
|
|
RD->getNameAsCString(), MostDerivedClass->getNameAsCString()));
|
2009-11-01 04:06:59 +08:00
|
|
|
|
|
|
|
VBPrimaries(PrimaryBase, PrimaryBaseWasVirtual|MorallyVirtual, Offset,
|
2009-11-07 07:27:42 +08:00
|
|
|
updateVBIndex, current_vbindex, PrimaryBaseWasVirtual,
|
2009-11-30 09:19:33 +08:00
|
|
|
BaseCurrentVBaseOffset, false);
|
2009-10-12 06:13:54 +08:00
|
|
|
}
|
|
|
|
|
2009-11-01 04:06:59 +08:00
|
|
|
D1(printf(" doing vbase entries for %s most derived %s\n",
|
2010-01-22 10:51:26 +08:00
|
|
|
RD->getNameAsCString(), MostDerivedClass->getNameAsCString()));
|
2009-11-01 04:06:59 +08:00
|
|
|
GenerateVBaseOffsets(RD, Offset, updateVBIndex, current_vbindex);
|
|
|
|
|
|
|
|
if (RDisVirtualBase || bottom) {
|
|
|
|
Primaries(RD, MorallyVirtual, Offset, updateVBIndex, current_vbindex,
|
2009-11-30 09:19:33 +08:00
|
|
|
CurrentVBaseOffset);
|
2009-11-01 04:06:59 +08:00
|
|
|
}
|
2009-10-12 06:13:54 +08:00
|
|
|
}
|
|
|
|
|
2009-12-24 15:29:41 +08:00
|
|
|
void GenerateVtableForBase(const CXXRecordDecl *RD, int64_t Offset = 0,
|
|
|
|
bool MorallyVirtual = false,
|
|
|
|
bool ForVirtualBase = false,
|
2010-01-22 14:45:05 +08:00
|
|
|
bool ForNPNVBases = false,
|
|
|
|
bool WasPrimaryBase = true,
|
2009-12-24 15:29:41 +08:00
|
|
|
int CurrentVBaseOffset = 0,
|
|
|
|
Path_t *Path = 0) {
|
2009-10-12 06:13:54 +08:00
|
|
|
if (!RD->isDynamicClass())
|
2009-12-24 15:29:41 +08:00
|
|
|
return;
|
2009-10-12 06:13:54 +08:00
|
|
|
|
2009-11-13 10:35:38 +08:00
|
|
|
// Construction vtable don't need parts that have no virtual bases and
|
|
|
|
// aren't morally virtual.
|
2009-12-05 02:36:22 +08:00
|
|
|
if ((LayoutClass != MostDerivedClass) &&
|
|
|
|
RD->getNumVBases() == 0 && !MorallyVirtual)
|
2009-12-24 15:29:41 +08:00
|
|
|
return;
|
2009-11-13 10:35:38 +08:00
|
|
|
|
2009-10-12 06:13:54 +08:00
|
|
|
const ASTRecordLayout &Layout = CGM.getContext().getASTRecordLayout(RD);
|
|
|
|
const CXXRecordDecl *PrimaryBase = Layout.getPrimaryBase();
|
|
|
|
const bool PrimaryBaseWasVirtual = Layout.getPrimaryBaseWasVirtual();
|
|
|
|
|
|
|
|
extra = 0;
|
2009-11-01 04:06:59 +08:00
|
|
|
D1(printf("building entries for base %s most derived %s\n",
|
2010-01-22 10:51:26 +08:00
|
|
|
RD->getNameAsCString(), MostDerivedClass->getNameAsCString()));
|
2009-11-01 04:06:59 +08:00
|
|
|
|
2009-10-12 06:13:54 +08:00
|
|
|
if (ForVirtualBase)
|
2009-11-01 04:06:59 +08:00
|
|
|
extra = VCalls.size();
|
2009-10-12 06:13:54 +08:00
|
|
|
|
2010-01-22 14:45:05 +08:00
|
|
|
if (!ForNPNVBases || !WasPrimaryBase) {
|
|
|
|
VBPrimaries(RD, MorallyVirtual, Offset, !ForVirtualBase, 0,
|
|
|
|
ForVirtualBase, CurrentVBaseOffset, true);
|
2009-10-12 06:13:54 +08:00
|
|
|
|
2010-01-22 14:45:05 +08:00
|
|
|
if (Path)
|
|
|
|
OverrideMethods(Path, MorallyVirtual, Offset, CurrentVBaseOffset);
|
|
|
|
}
|
2009-10-12 06:13:54 +08:00
|
|
|
|
2010-01-22 14:45:05 +08:00
|
|
|
FinishGenerateVtable(RD, Layout, PrimaryBase, ForNPNVBases, WasPrimaryBase,
|
|
|
|
PrimaryBaseWasVirtual, MorallyVirtual, Offset,
|
|
|
|
ForVirtualBase, CurrentVBaseOffset, Path);
|
2009-10-12 06:13:54 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
void GenerateVtableForVBases(const CXXRecordDecl *RD,
|
|
|
|
int64_t Offset = 0,
|
2009-10-15 10:04:03 +08:00
|
|
|
Path_t *Path = 0) {
|
2009-10-12 06:13:54 +08:00
|
|
|
bool alloc = false;
|
|
|
|
if (Path == 0) {
|
|
|
|
alloc = true;
|
2009-10-15 10:04:03 +08:00
|
|
|
Path = new Path_t;
|
2009-10-12 06:13:54 +08:00
|
|
|
}
|
|
|
|
// FIXME: We also need to override using all paths to a virtual base,
|
|
|
|
// right now, we just process the first path
|
|
|
|
Path->push_back(std::make_pair(RD, Offset));
|
|
|
|
for (CXXRecordDecl::base_class_const_iterator i = RD->bases_begin(),
|
|
|
|
e = RD->bases_end(); i != e; ++i) {
|
|
|
|
const CXXRecordDecl *Base =
|
|
|
|
cast<CXXRecordDecl>(i->getType()->getAs<RecordType>()->getDecl());
|
|
|
|
if (i->isVirtual() && !IndirectPrimary.count(Base)) {
|
|
|
|
// Mark it so we don't output it twice.
|
|
|
|
IndirectPrimary.insert(Base);
|
|
|
|
StartNewTable();
|
2009-10-15 02:14:51 +08:00
|
|
|
VCall.clear();
|
2009-10-12 06:13:54 +08:00
|
|
|
int64_t BaseOffset = BLayout.getVBaseClassOffset(Base);
|
2009-11-07 07:27:42 +08:00
|
|
|
int64_t CurrentVBaseOffset = BaseOffset;
|
2009-11-01 04:06:59 +08:00
|
|
|
D1(printf("vtable %s virtual base %s\n",
|
2010-01-22 10:51:26 +08:00
|
|
|
MostDerivedClass->getNameAsCString(), Base->getNameAsCString()));
|
2010-01-22 14:45:05 +08:00
|
|
|
GenerateVtableForBase(Base, BaseOffset, true, true, false,
|
|
|
|
true, CurrentVBaseOffset, Path);
|
2009-10-12 06:13:54 +08:00
|
|
|
}
|
2009-11-13 04:47:57 +08:00
|
|
|
int64_t BaseOffset;
|
2009-10-12 06:13:54 +08:00
|
|
|
if (i->isVirtual())
|
|
|
|
BaseOffset = BLayout.getVBaseClassOffset(Base);
|
2009-11-13 04:47:57 +08:00
|
|
|
else {
|
|
|
|
const ASTRecordLayout &Layout = CGM.getContext().getASTRecordLayout(RD);
|
|
|
|
BaseOffset = Offset + Layout.getBaseClassOffset(Base);
|
|
|
|
}
|
|
|
|
|
2009-10-15 10:04:03 +08:00
|
|
|
if (Base->getNumVBases()) {
|
2009-10-12 06:13:54 +08:00
|
|
|
GenerateVtableForVBases(Base, BaseOffset, Path);
|
2009-10-15 10:04:03 +08:00
|
|
|
}
|
2009-10-12 06:13:54 +08:00
|
|
|
}
|
|
|
|
Path->pop_back();
|
|
|
|
if (alloc)
|
|
|
|
delete Path;
|
|
|
|
}
|
|
|
|
};
|
2009-12-03 09:54:02 +08:00
|
|
|
} // end anonymous namespace
|
|
|
|
|
2009-12-03 10:32:59 +08:00
|
|
|
/// TypeConversionRequiresAdjustment - Returns whether conversion from a
|
|
|
|
/// derived type to a base type requires adjustment.
|
|
|
|
static bool
|
|
|
|
TypeConversionRequiresAdjustment(ASTContext &Ctx,
|
|
|
|
const CXXRecordDecl *DerivedDecl,
|
|
|
|
const CXXRecordDecl *BaseDecl) {
|
|
|
|
CXXBasePaths Paths(/*FindAmbiguities=*/false,
|
|
|
|
/*RecordPaths=*/true, /*DetectVirtual=*/true);
|
|
|
|
if (!const_cast<CXXRecordDecl *>(DerivedDecl)->
|
|
|
|
isDerivedFrom(const_cast<CXXRecordDecl *>(BaseDecl), Paths)) {
|
|
|
|
assert(false && "Class must be derived from the passed in base class!");
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
// If we found a virtual base we always want to require adjustment.
|
|
|
|
if (Paths.getDetectedVirtual())
|
|
|
|
return true;
|
|
|
|
|
|
|
|
const CXXBasePath &Path = Paths.front();
|
|
|
|
|
|
|
|
for (size_t Start = 0, End = Path.size(); Start != End; ++Start) {
|
|
|
|
const CXXBasePathElement &Element = Path[Start];
|
|
|
|
|
|
|
|
// Check the base class offset.
|
|
|
|
const ASTRecordLayout &Layout = Ctx.getASTRecordLayout(Element.Class);
|
|
|
|
|
|
|
|
const RecordType *BaseType = Element.Base->getType()->getAs<RecordType>();
|
|
|
|
const CXXRecordDecl *Base = cast<CXXRecordDecl>(BaseType->getDecl());
|
|
|
|
|
|
|
|
if (Layout.getBaseClassOffset(Base) != 0) {
|
|
|
|
// This requires an adjustment.
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
static bool
|
|
|
|
TypeConversionRequiresAdjustment(ASTContext &Ctx,
|
|
|
|
QualType DerivedType, QualType BaseType) {
|
|
|
|
// Canonicalize the types.
|
|
|
|
QualType CanDerivedType = Ctx.getCanonicalType(DerivedType);
|
|
|
|
QualType CanBaseType = Ctx.getCanonicalType(BaseType);
|
|
|
|
|
|
|
|
assert(CanDerivedType->getTypeClass() == CanBaseType->getTypeClass() &&
|
|
|
|
"Types must have same type class!");
|
|
|
|
|
|
|
|
if (CanDerivedType == CanBaseType) {
|
|
|
|
// No adjustment needed.
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (const ReferenceType *RT = dyn_cast<ReferenceType>(CanDerivedType)) {
|
|
|
|
CanDerivedType = RT->getPointeeType();
|
|
|
|
CanBaseType = cast<ReferenceType>(CanBaseType)->getPointeeType();
|
|
|
|
} else if (const PointerType *PT = dyn_cast<PointerType>(CanDerivedType)) {
|
|
|
|
CanDerivedType = PT->getPointeeType();
|
|
|
|
CanBaseType = cast<PointerType>(CanBaseType)->getPointeeType();
|
|
|
|
} else {
|
|
|
|
assert(false && "Unexpected return type!");
|
|
|
|
}
|
|
|
|
|
|
|
|
if (CanDerivedType == CanBaseType) {
|
|
|
|
// No adjustment needed.
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
const CXXRecordDecl *DerivedDecl =
|
2009-12-31 07:47:56 +08:00
|
|
|
cast<CXXRecordDecl>(cast<RecordType>(CanDerivedType)->getDecl());
|
2009-12-03 10:32:59 +08:00
|
|
|
|
|
|
|
const CXXRecordDecl *BaseDecl =
|
2009-12-31 07:47:56 +08:00
|
|
|
cast<CXXRecordDecl>(cast<RecordType>(CanBaseType)->getDecl());
|
2009-12-03 10:32:59 +08:00
|
|
|
|
|
|
|
return TypeConversionRequiresAdjustment(Ctx, DerivedDecl, BaseDecl);
|
|
|
|
}
|
|
|
|
|
2009-12-04 16:40:51 +08:00
|
|
|
bool VtableBuilder::OverrideMethod(GlobalDecl GD, bool MorallyVirtual,
|
|
|
|
Index_t OverrideOffset, Index_t Offset,
|
|
|
|
int64_t CurrentVBaseOffset) {
|
2009-12-03 09:54:02 +08:00
|
|
|
const CXXMethodDecl *MD = cast<CXXMethodDecl>(GD.getDecl());
|
|
|
|
|
|
|
|
const bool isPure = MD->isPure();
|
2009-12-06 01:04:47 +08:00
|
|
|
|
2009-12-03 09:54:02 +08:00
|
|
|
// FIXME: Should OverrideOffset's be Offset?
|
|
|
|
|
2009-12-06 01:04:47 +08:00
|
|
|
for (CXXMethodDecl::method_iterator mi = MD->begin_overridden_methods(),
|
|
|
|
e = MD->end_overridden_methods(); mi != e; ++mi) {
|
2009-12-03 09:54:02 +08:00
|
|
|
GlobalDecl OGD;
|
|
|
|
|
2009-12-04 13:51:56 +08:00
|
|
|
const CXXMethodDecl *OMD = *mi;
|
2009-12-03 09:54:02 +08:00
|
|
|
if (const CXXDestructorDecl *DD = dyn_cast<CXXDestructorDecl>(OMD))
|
|
|
|
OGD = GlobalDecl(DD, GD.getDtorType());
|
|
|
|
else
|
|
|
|
OGD = OMD;
|
|
|
|
|
2009-12-07 06:01:30 +08:00
|
|
|
// Check whether this is the method being overridden in this section of
|
|
|
|
// the vtable.
|
2009-12-04 23:49:02 +08:00
|
|
|
uint64_t Index;
|
|
|
|
if (!Methods.getIndex(OGD, Index))
|
2009-12-04 16:34:14 +08:00
|
|
|
continue;
|
2009-12-04 11:41:37 +08:00
|
|
|
|
2009-12-07 06:01:30 +08:00
|
|
|
// Get the original method, which we should be computing thunks, etc,
|
|
|
|
// against.
|
|
|
|
OGD = Methods.getOrigMethod(Index);
|
|
|
|
OMD = cast<CXXMethodDecl>(OGD.getDecl());
|
|
|
|
|
2009-12-04 16:34:14 +08:00
|
|
|
QualType ReturnType =
|
|
|
|
MD->getType()->getAs<FunctionType>()->getResultType();
|
|
|
|
QualType OverriddenReturnType =
|
|
|
|
OMD->getType()->getAs<FunctionType>()->getResultType();
|
|
|
|
|
|
|
|
// Check if we need a return type adjustment.
|
|
|
|
if (TypeConversionRequiresAdjustment(CGM.getContext(), ReturnType,
|
|
|
|
OverriddenReturnType)) {
|
|
|
|
CanQualType &BaseReturnType = BaseReturnTypes[Index];
|
|
|
|
|
|
|
|
// Insert the base return type.
|
|
|
|
if (BaseReturnType.isNull())
|
|
|
|
BaseReturnType =
|
|
|
|
CGM.getContext().getCanonicalType(OverriddenReturnType);
|
|
|
|
}
|
2009-12-03 10:32:59 +08:00
|
|
|
|
2009-12-04 16:34:14 +08:00
|
|
|
Methods.OverrideMethod(OGD, GD);
|
2009-12-03 09:54:02 +08:00
|
|
|
|
2010-01-26 08:05:04 +08:00
|
|
|
const CXXMethodDecl *UMD = getUnique(GD);
|
|
|
|
assert(UMD && "unique overrider not found");
|
|
|
|
assert(UMD == getUnique(OGD) && "unique overrider not unique");
|
|
|
|
|
2009-12-04 16:34:14 +08:00
|
|
|
ThisAdjustments.erase(Index);
|
2010-01-26 08:05:04 +08:00
|
|
|
if (MorallyVirtual || VCall.count(UMD)) {
|
|
|
|
Index_t &idx = VCall[UMD];
|
2009-12-04 16:34:14 +08:00
|
|
|
if (idx == 0) {
|
2010-01-26 08:05:04 +08:00
|
|
|
NonVirtualOffset[UMD] = CurrentVBaseOffset/8 - OverrideOffset/8;
|
2009-12-04 16:34:14 +08:00
|
|
|
VCallOffset[GD] = OverrideOffset/8;
|
2010-01-26 11:42:22 +08:00
|
|
|
VCallOffsetForVCall[UMD] = OverrideOffset/8;
|
2009-12-04 16:34:14 +08:00
|
|
|
idx = VCalls.size()+1;
|
2010-01-26 11:42:22 +08:00
|
|
|
VCalls.push_back(OverrideOffset/8 - CurrentVBaseOffset/8);
|
2009-12-04 16:34:14 +08:00
|
|
|
D1(printf(" vcall for %s at %d with delta %d most derived %s\n",
|
|
|
|
MD->getNameAsString().c_str(), (int)-idx-3,
|
2010-01-22 10:51:26 +08:00
|
|
|
(int)VCalls[idx-1], MostDerivedClass->getNameAsCString()));
|
2009-12-04 16:34:14 +08:00
|
|
|
} else {
|
|
|
|
VCallOffset[GD] = VCallOffset[OGD];
|
2010-01-26 11:42:22 +08:00
|
|
|
VCalls[idx-1] = -VCallOffsetForVCall[UMD] + OverrideOffset/8;
|
2009-12-04 16:34:14 +08:00
|
|
|
D1(printf(" vcall patch for %s at %d with delta %d most derived %s\n",
|
|
|
|
MD->getNameAsString().c_str(), (int)-idx-3,
|
2010-01-22 10:51:26 +08:00
|
|
|
(int)VCalls[idx-1], MostDerivedClass->getNameAsCString()));
|
2009-12-03 09:54:02 +08:00
|
|
|
}
|
2010-01-26 08:05:04 +08:00
|
|
|
int64_t NonVirtualAdjustment = NonVirtualOffset[UMD];
|
2009-12-04 16:34:14 +08:00
|
|
|
int64_t VirtualAdjustment =
|
|
|
|
-((idx + extra + 2) * LLVMPointerWidth / 8);
|
|
|
|
|
|
|
|
// Optimize out virtual adjustments of 0.
|
|
|
|
if (VCalls[idx-1] == 0)
|
|
|
|
VirtualAdjustment = 0;
|
|
|
|
|
|
|
|
ThunkAdjustment ThisAdjustment(NonVirtualAdjustment,
|
|
|
|
VirtualAdjustment);
|
2009-12-03 09:54:02 +08:00
|
|
|
|
2009-12-07 06:01:30 +08:00
|
|
|
if (!isPure && !ThisAdjustment.isEmpty()) {
|
2009-12-04 16:34:14 +08:00
|
|
|
ThisAdjustments[Index] = ThisAdjustment;
|
2009-12-08 07:56:34 +08:00
|
|
|
SavedAdjustments.push_back(
|
|
|
|
std::make_pair(GD, std::make_pair(OGD, ThisAdjustment)));
|
2009-12-07 06:01:30 +08:00
|
|
|
}
|
2009-12-03 09:54:02 +08:00
|
|
|
return true;
|
|
|
|
}
|
2009-12-04 16:34:14 +08:00
|
|
|
|
2009-12-08 07:56:34 +08:00
|
|
|
int64_t NonVirtualAdjustment = -VCallOffset[OGD] + OverrideOffset/8;
|
2009-12-04 16:34:14 +08:00
|
|
|
|
|
|
|
if (NonVirtualAdjustment) {
|
|
|
|
ThunkAdjustment ThisAdjustment(NonVirtualAdjustment, 0);
|
|
|
|
|
2009-12-07 06:33:51 +08:00
|
|
|
if (!isPure) {
|
2009-12-04 16:34:14 +08:00
|
|
|
ThisAdjustments[Index] = ThisAdjustment;
|
2009-12-08 07:56:34 +08:00
|
|
|
SavedAdjustments.push_back(
|
|
|
|
std::make_pair(GD, std::make_pair(OGD, ThisAdjustment)));
|
2009-12-07 06:33:51 +08:00
|
|
|
}
|
2009-12-04 16:34:14 +08:00
|
|
|
}
|
|
|
|
return true;
|
2009-12-03 09:54:02 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
2009-11-28 06:21:51 +08:00
|
|
|
}
|
|
|
|
|
2009-12-04 10:56:03 +08:00
|
|
|
void VtableBuilder::AppendMethodsToVtable() {
|
2009-12-05 09:05:03 +08:00
|
|
|
if (!BuildVtable) {
|
2009-12-06 09:09:21 +08:00
|
|
|
VtableComponents.insert(VtableComponents.end(), Methods.size(),
|
|
|
|
(llvm::Constant *)0);
|
2009-12-05 09:05:03 +08:00
|
|
|
ThisAdjustments.clear();
|
|
|
|
BaseReturnTypes.clear();
|
|
|
|
Methods.clear();
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2009-12-05 00:19:30 +08:00
|
|
|
// Reserve room in the vtable for our new methods.
|
2009-12-06 09:09:21 +08:00
|
|
|
VtableComponents.reserve(VtableComponents.size() + Methods.size());
|
2009-12-04 11:07:26 +08:00
|
|
|
|
2009-12-04 10:43:50 +08:00
|
|
|
for (unsigned i = 0, e = Methods.size(); i != e; ++i) {
|
|
|
|
GlobalDecl GD = Methods[i];
|
2009-12-04 10:52:22 +08:00
|
|
|
const CXXMethodDecl *MD = cast<CXXMethodDecl>(GD.getDecl());
|
|
|
|
|
|
|
|
// Get the 'this' pointer adjustment.
|
2009-12-04 10:43:50 +08:00
|
|
|
ThunkAdjustment ThisAdjustment = ThisAdjustments.lookup(i);
|
2009-12-04 10:52:22 +08:00
|
|
|
|
|
|
|
// Construct the return type adjustment.
|
|
|
|
ThunkAdjustment ReturnAdjustment;
|
|
|
|
|
|
|
|
QualType BaseReturnType = BaseReturnTypes.lookup(i);
|
|
|
|
if (!BaseReturnType.isNull() && !MD->isPure()) {
|
|
|
|
QualType DerivedType =
|
|
|
|
MD->getType()->getAs<FunctionType>()->getResultType();
|
|
|
|
|
|
|
|
int64_t NonVirtualAdjustment =
|
|
|
|
getNVOffset(BaseReturnType, DerivedType) / 8;
|
|
|
|
|
|
|
|
int64_t VirtualAdjustment =
|
|
|
|
getVbaseOffset(BaseReturnType, DerivedType);
|
|
|
|
|
|
|
|
ReturnAdjustment = ThunkAdjustment(NonVirtualAdjustment,
|
|
|
|
VirtualAdjustment);
|
|
|
|
}
|
|
|
|
|
2009-12-04 11:06:03 +08:00
|
|
|
llvm::Constant *Method = 0;
|
2009-12-04 10:52:22 +08:00
|
|
|
if (!ReturnAdjustment.isEmpty()) {
|
|
|
|
// Build a covariant thunk.
|
|
|
|
CovariantThunkAdjustment Adjustment(ThisAdjustment, ReturnAdjustment);
|
2009-12-07 06:01:30 +08:00
|
|
|
Method = wrap(CGM.GetAddrOfCovariantThunk(GD, Adjustment));
|
2009-12-04 10:52:22 +08:00
|
|
|
} else if (!ThisAdjustment.isEmpty()) {
|
|
|
|
// Build a "regular" thunk.
|
2009-12-07 06:01:30 +08:00
|
|
|
Method = wrap(CGM.GetAddrOfThunk(GD, ThisAdjustment));
|
2009-12-04 10:56:03 +08:00
|
|
|
} else if (MD->isPure()) {
|
|
|
|
// We have a pure virtual method.
|
2009-12-04 11:06:03 +08:00
|
|
|
Method = getPureVirtualFn();
|
|
|
|
} else {
|
|
|
|
// We have a good old regular method.
|
|
|
|
Method = WrapAddrOf(GD);
|
2009-12-04 10:52:22 +08:00
|
|
|
}
|
2009-12-04 11:06:03 +08:00
|
|
|
|
|
|
|
// Add the method to the vtable.
|
2009-12-06 09:09:21 +08:00
|
|
|
VtableComponents.push_back(Method);
|
2009-12-04 10:43:50 +08:00
|
|
|
}
|
|
|
|
|
2009-12-04 11:06:03 +08:00
|
|
|
|
2009-12-04 10:43:50 +08:00
|
|
|
ThisAdjustments.clear();
|
2009-12-04 10:52:22 +08:00
|
|
|
BaseReturnTypes.clear();
|
2009-12-04 10:43:50 +08:00
|
|
|
|
2009-12-04 10:39:04 +08:00
|
|
|
Methods.clear();
|
|
|
|
}
|
|
|
|
|
2009-11-28 04:47:55 +08:00
|
|
|
void CGVtableInfo::ComputeMethodVtableIndices(const CXXRecordDecl *RD) {
|
|
|
|
|
|
|
|
// Itanium C++ ABI 2.5.2:
|
|
|
|
// The order of the virtual function pointers in a virtual table is the
|
|
|
|
// order of declaration of the corresponding member functions in the class.
|
|
|
|
//
|
|
|
|
// There is an entry for any virtual function declared in a class,
|
|
|
|
// whether it is a new function or overrides a base class function,
|
|
|
|
// unless it overrides a function from the primary base, and conversion
|
|
|
|
// between their return types does not require an adjustment.
|
|
|
|
|
|
|
|
int64_t CurrentIndex = 0;
|
|
|
|
|
|
|
|
const ASTRecordLayout &Layout = CGM.getContext().getASTRecordLayout(RD);
|
|
|
|
const CXXRecordDecl *PrimaryBase = Layout.getPrimaryBase();
|
|
|
|
|
|
|
|
if (PrimaryBase) {
|
2009-12-01 03:43:26 +08:00
|
|
|
assert(PrimaryBase->isDefinition() &&
|
|
|
|
"Should have the definition decl of the primary base!");
|
2009-11-28 04:47:55 +08:00
|
|
|
|
|
|
|
// Since the record decl shares its vtable pointer with the primary base
|
|
|
|
// we need to start counting at the end of the primary base's vtable.
|
|
|
|
CurrentIndex = getNumVirtualFunctionPointers(PrimaryBase);
|
|
|
|
}
|
2009-12-15 11:31:17 +08:00
|
|
|
|
|
|
|
// Collect all the primary bases, so we can check whether methods override
|
|
|
|
// a method from the base.
|
|
|
|
llvm::SmallPtrSet<const CXXRecordDecl *, 5> PrimaryBases;
|
|
|
|
for (ASTRecordLayout::primary_base_info_iterator
|
|
|
|
I = Layout.primary_base_begin(), E = Layout.primary_base_end();
|
|
|
|
I != E; ++I)
|
|
|
|
PrimaryBases.insert((*I).getBase());
|
|
|
|
|
2009-11-28 04:47:55 +08:00
|
|
|
const CXXDestructorDecl *ImplicitVirtualDtor = 0;
|
|
|
|
|
|
|
|
for (CXXRecordDecl::method_iterator i = RD->method_begin(),
|
|
|
|
e = RD->method_end(); i != e; ++i) {
|
|
|
|
const CXXMethodDecl *MD = *i;
|
|
|
|
|
|
|
|
// We only want virtual methods.
|
|
|
|
if (!MD->isVirtual())
|
|
|
|
continue;
|
|
|
|
|
|
|
|
bool ShouldAddEntryForMethod = true;
|
|
|
|
|
|
|
|
// Check if this method overrides a method in the primary base.
|
|
|
|
for (CXXMethodDecl::method_iterator i = MD->begin_overridden_methods(),
|
|
|
|
e = MD->end_overridden_methods(); i != e; ++i) {
|
2009-12-04 13:51:56 +08:00
|
|
|
const CXXMethodDecl *OverriddenMD = *i;
|
2009-11-28 04:47:55 +08:00
|
|
|
const CXXRecordDecl *OverriddenRD = OverriddenMD->getParent();
|
|
|
|
assert(OverriddenMD->isCanonicalDecl() &&
|
|
|
|
"Should have the canonical decl of the overridden RD!");
|
|
|
|
|
2009-12-15 11:31:17 +08:00
|
|
|
if (PrimaryBases.count(OverriddenRD)) {
|
2009-11-28 04:47:55 +08:00
|
|
|
// Check if converting from the return type of the method to the
|
|
|
|
// return type of the overridden method requires conversion.
|
|
|
|
QualType ReturnType =
|
|
|
|
MD->getType()->getAs<FunctionType>()->getResultType();
|
|
|
|
QualType OverriddenReturnType =
|
|
|
|
OverriddenMD->getType()->getAs<FunctionType>()->getResultType();
|
|
|
|
|
|
|
|
if (!TypeConversionRequiresAdjustment(CGM.getContext(),
|
|
|
|
ReturnType, OverriddenReturnType)) {
|
|
|
|
// This index is shared between the index in the vtable of the primary
|
|
|
|
// base class.
|
|
|
|
if (const CXXDestructorDecl *DD = dyn_cast<CXXDestructorDecl>(MD)) {
|
|
|
|
const CXXDestructorDecl *OverriddenDD =
|
|
|
|
cast<CXXDestructorDecl>(OverriddenMD);
|
|
|
|
|
|
|
|
// Add both the complete and deleting entries.
|
|
|
|
MethodVtableIndices[GlobalDecl(DD, Dtor_Complete)] =
|
|
|
|
getMethodVtableIndex(GlobalDecl(OverriddenDD, Dtor_Complete));
|
|
|
|
MethodVtableIndices[GlobalDecl(DD, Dtor_Deleting)] =
|
|
|
|
getMethodVtableIndex(GlobalDecl(OverriddenDD, Dtor_Deleting));
|
|
|
|
} else {
|
|
|
|
MethodVtableIndices[MD] = getMethodVtableIndex(OverriddenMD);
|
|
|
|
}
|
|
|
|
|
|
|
|
// We don't need to add an entry for this method.
|
|
|
|
ShouldAddEntryForMethod = false;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!ShouldAddEntryForMethod)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
if (const CXXDestructorDecl *DD = dyn_cast<CXXDestructorDecl>(MD)) {
|
|
|
|
if (MD->isImplicit()) {
|
|
|
|
assert(!ImplicitVirtualDtor &&
|
|
|
|
"Did already see an implicit virtual dtor!");
|
|
|
|
ImplicitVirtualDtor = DD;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Add the complete dtor.
|
|
|
|
MethodVtableIndices[GlobalDecl(DD, Dtor_Complete)] = CurrentIndex++;
|
|
|
|
|
|
|
|
// Add the deleting dtor.
|
|
|
|
MethodVtableIndices[GlobalDecl(DD, Dtor_Deleting)] = CurrentIndex++;
|
|
|
|
} else {
|
|
|
|
// Add the entry.
|
|
|
|
MethodVtableIndices[MD] = CurrentIndex++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (ImplicitVirtualDtor) {
|
|
|
|
// Itanium C++ ABI 2.5.2:
|
|
|
|
// If a class has an implicitly-defined virtual destructor,
|
|
|
|
// its entries come after the declared virtual function pointers.
|
|
|
|
|
|
|
|
// Add the complete dtor.
|
|
|
|
MethodVtableIndices[GlobalDecl(ImplicitVirtualDtor, Dtor_Complete)] =
|
|
|
|
CurrentIndex++;
|
|
|
|
|
|
|
|
// Add the deleting dtor.
|
|
|
|
MethodVtableIndices[GlobalDecl(ImplicitVirtualDtor, Dtor_Deleting)] =
|
|
|
|
CurrentIndex++;
|
|
|
|
}
|
|
|
|
|
|
|
|
NumVirtualFunctionPointers[RD] = CurrentIndex;
|
|
|
|
}
|
|
|
|
|
|
|
|
uint64_t CGVtableInfo::getNumVirtualFunctionPointers(const CXXRecordDecl *RD) {
|
|
|
|
llvm::DenseMap<const CXXRecordDecl *, uint64_t>::iterator I =
|
|
|
|
NumVirtualFunctionPointers.find(RD);
|
|
|
|
if (I != NumVirtualFunctionPointers.end())
|
|
|
|
return I->second;
|
|
|
|
|
|
|
|
ComputeMethodVtableIndices(RD);
|
|
|
|
|
|
|
|
I = NumVirtualFunctionPointers.find(RD);
|
|
|
|
assert(I != NumVirtualFunctionPointers.end() && "Did not find entry!");
|
|
|
|
return I->second;
|
|
|
|
}
|
|
|
|
|
|
|
|
uint64_t CGVtableInfo::getMethodVtableIndex(GlobalDecl GD) {
|
2009-11-14 01:08:56 +08:00
|
|
|
MethodVtableIndicesTy::iterator I = MethodVtableIndices.find(GD);
|
2009-10-12 06:13:54 +08:00
|
|
|
if (I != MethodVtableIndices.end())
|
|
|
|
return I->second;
|
|
|
|
|
2009-11-14 01:08:56 +08:00
|
|
|
const CXXRecordDecl *RD = cast<CXXMethodDecl>(GD.getDecl())->getParent();
|
2009-11-28 04:47:55 +08:00
|
|
|
|
|
|
|
ComputeMethodVtableIndices(RD);
|
|
|
|
|
2009-11-14 01:08:56 +08:00
|
|
|
I = MethodVtableIndices.find(GD);
|
2009-10-12 06:13:54 +08:00
|
|
|
assert(I != MethodVtableIndices.end() && "Did not find index!");
|
|
|
|
return I->second;
|
|
|
|
}
|
|
|
|
|
2009-12-08 07:56:34 +08:00
|
|
|
CGVtableInfo::AdjustmentVectorTy*
|
|
|
|
CGVtableInfo::getAdjustments(GlobalDecl GD) {
|
|
|
|
SavedAdjustmentsTy::iterator I = SavedAdjustments.find(GD);
|
|
|
|
if (I != SavedAdjustments.end())
|
|
|
|
return &I->second;
|
2009-12-07 06:01:30 +08:00
|
|
|
|
|
|
|
const CXXRecordDecl *RD = cast<CXXRecordDecl>(GD.getDecl()->getDeclContext());
|
2009-12-08 07:56:34 +08:00
|
|
|
if (!SavedAdjustmentRecords.insert(RD).second)
|
|
|
|
return 0;
|
2009-12-07 06:01:30 +08:00
|
|
|
|
2010-01-14 10:29:07 +08:00
|
|
|
AddressPointsMapTy AddressPoints;
|
|
|
|
VtableBuilder b(RD, RD, 0, CGM, false, AddressPoints);
|
2009-12-07 06:01:30 +08:00
|
|
|
D1(printf("vtable %s\n", RD->getNameAsCString()));
|
|
|
|
b.GenerateVtableForBase(RD);
|
|
|
|
b.GenerateVtableForVBases(RD);
|
|
|
|
|
2009-12-08 07:56:34 +08:00
|
|
|
for (VtableBuilder::SavedAdjustmentsVectorTy::iterator
|
|
|
|
i = b.getSavedAdjustments().begin(),
|
|
|
|
e = b.getSavedAdjustments().end(); i != e; i++)
|
|
|
|
SavedAdjustments[i->first].push_back(i->second);
|
|
|
|
|
|
|
|
I = SavedAdjustments.find(GD);
|
|
|
|
if (I != SavedAdjustments.end())
|
|
|
|
return &I->second;
|
2009-12-07 06:01:30 +08:00
|
|
|
|
2009-12-08 07:56:34 +08:00
|
|
|
return 0;
|
2009-12-07 06:01:30 +08:00
|
|
|
}
|
|
|
|
|
2009-10-12 06:13:54 +08:00
|
|
|
int64_t CGVtableInfo::getVirtualBaseOffsetIndex(const CXXRecordDecl *RD,
|
|
|
|
const CXXRecordDecl *VBase) {
|
|
|
|
ClassPairTy ClassPair(RD, VBase);
|
|
|
|
|
|
|
|
VirtualBaseClassIndiciesTy::iterator I =
|
|
|
|
VirtualBaseClassIndicies.find(ClassPair);
|
|
|
|
if (I != VirtualBaseClassIndicies.end())
|
|
|
|
return I->second;
|
|
|
|
|
|
|
|
// FIXME: This seems expensive. Can we do a partial job to get
|
|
|
|
// just this data.
|
2010-01-14 10:29:07 +08:00
|
|
|
AddressPointsMapTy AddressPoints;
|
|
|
|
VtableBuilder b(RD, RD, 0, CGM, false, AddressPoints);
|
2009-11-01 04:06:59 +08:00
|
|
|
D1(printf("vtable %s\n", RD->getNameAsCString()));
|
2009-10-12 06:13:54 +08:00
|
|
|
b.GenerateVtableForBase(RD);
|
|
|
|
b.GenerateVtableForVBases(RD);
|
|
|
|
|
|
|
|
for (llvm::DenseMap<const CXXRecordDecl *, uint64_t>::iterator I =
|
|
|
|
b.getVBIndex().begin(), E = b.getVBIndex().end(); I != E; ++I) {
|
|
|
|
// Insert all types.
|
|
|
|
ClassPairTy ClassPair(RD, I->first);
|
|
|
|
|
|
|
|
VirtualBaseClassIndicies.insert(std::make_pair(ClassPair, I->second));
|
|
|
|
}
|
|
|
|
|
|
|
|
I = VirtualBaseClassIndicies.find(ClassPair);
|
|
|
|
assert(I != VirtualBaseClassIndicies.end() && "Did not find index!");
|
|
|
|
|
|
|
|
return I->second;
|
|
|
|
}
|
|
|
|
|
2009-12-06 05:03:56 +08:00
|
|
|
uint64_t CGVtableInfo::getVtableAddressPoint(const CXXRecordDecl *RD) {
|
|
|
|
uint64_t AddressPoint =
|
2010-01-03 02:02:32 +08:00
|
|
|
(*(*(CGM.getVtableInfo().AddressPoints[RD]))[RD])[std::make_pair(RD, 0)];
|
2009-12-06 05:03:56 +08:00
|
|
|
|
|
|
|
return AddressPoint;
|
|
|
|
}
|
|
|
|
|
2009-12-06 08:01:05 +08:00
|
|
|
llvm::GlobalVariable *
|
2009-12-06 08:23:49 +08:00
|
|
|
CGVtableInfo::GenerateVtable(llvm::GlobalVariable::LinkageTypes Linkage,
|
2009-12-06 08:53:22 +08:00
|
|
|
bool GenerateDefinition,
|
2009-12-06 08:23:49 +08:00
|
|
|
const CXXRecordDecl *LayoutClass,
|
2010-01-14 10:29:07 +08:00
|
|
|
const CXXRecordDecl *RD, uint64_t Offset,
|
|
|
|
AddressPointsMapTy& AddressPoints) {
|
2009-10-12 06:13:54 +08:00
|
|
|
llvm::SmallString<256> OutName;
|
2009-11-13 04:47:57 +08:00
|
|
|
if (LayoutClass != RD)
|
2009-12-06 08:01:05 +08:00
|
|
|
CGM.getMangleContext().mangleCXXCtorVtable(LayoutClass, Offset / 8,
|
|
|
|
RD, OutName);
|
2009-11-12 04:26:26 +08:00
|
|
|
else
|
2009-12-06 08:01:05 +08:00
|
|
|
CGM.getMangleContext().mangleCXXVtable(RD, OutName);
|
2009-11-21 17:06:22 +08:00
|
|
|
llvm::StringRef Name = OutName.str();
|
2009-10-12 06:57:54 +08:00
|
|
|
|
2009-12-06 08:01:05 +08:00
|
|
|
llvm::GlobalVariable *GV = CGM.getModule().getGlobalVariable(Name);
|
2010-01-03 02:02:32 +08:00
|
|
|
if (GV == 0 || CGM.getVtableInfo().AddressPoints[LayoutClass] == 0 ||
|
|
|
|
GV->isDeclaration()) {
|
2010-01-14 10:29:07 +08:00
|
|
|
VtableBuilder b(RD, LayoutClass, Offset, CGM, GenerateDefinition,
|
|
|
|
AddressPoints);
|
2009-12-05 09:05:03 +08:00
|
|
|
|
|
|
|
D1(printf("vtable %s\n", RD->getNameAsCString()));
|
|
|
|
// First comes the vtables for all the non-virtual bases...
|
2009-12-24 15:29:41 +08:00
|
|
|
b.GenerateVtableForBase(RD, Offset);
|
2009-12-05 09:05:03 +08:00
|
|
|
|
|
|
|
// then the vtables for all the virtual bases.
|
|
|
|
b.GenerateVtableForVBases(RD, Offset);
|
|
|
|
|
2009-12-06 06:19:10 +08:00
|
|
|
llvm::Constant *Init = 0;
|
2009-12-06 08:01:05 +08:00
|
|
|
const llvm::Type *Int8PtrTy = llvm::Type::getInt8PtrTy(CGM.getLLVMContext());
|
2009-12-06 06:19:10 +08:00
|
|
|
llvm::ArrayType *ArrayType =
|
2009-12-06 09:09:21 +08:00
|
|
|
llvm::ArrayType::get(Int8PtrTy, b.getVtableComponents().size());
|
2009-12-06 05:09:05 +08:00
|
|
|
|
2009-12-06 08:53:22 +08:00
|
|
|
if (GenerateDefinition)
|
2009-12-06 09:09:21 +08:00
|
|
|
Init = llvm::ConstantArray::get(ArrayType, &b.getVtableComponents()[0],
|
|
|
|
b.getVtableComponents().size());
|
2009-12-06 08:53:22 +08:00
|
|
|
|
2009-11-19 12:04:36 +08:00
|
|
|
llvm::GlobalVariable *OGV = GV;
|
2009-12-06 08:53:22 +08:00
|
|
|
|
|
|
|
GV = new llvm::GlobalVariable(CGM.getModule(), ArrayType,
|
|
|
|
/*isConstant=*/true, Linkage, Init, Name);
|
2009-12-06 09:09:21 +08:00
|
|
|
CGM.setGlobalVisibility(GV, RD);
|
|
|
|
|
2009-11-19 12:04:36 +08:00
|
|
|
if (OGV) {
|
|
|
|
GV->takeName(OGV);
|
2009-12-06 06:19:10 +08:00
|
|
|
llvm::Constant *NewPtr =
|
|
|
|
llvm::ConstantExpr::getBitCast(GV, OGV->getType());
|
2009-11-19 12:04:36 +08:00
|
|
|
OGV->replaceAllUsesWith(NewPtr);
|
|
|
|
OGV->eraseFromParent();
|
|
|
|
}
|
|
|
|
}
|
2009-12-06 05:28:12 +08:00
|
|
|
|
|
|
|
return GV;
|
2009-10-12 06:13:54 +08:00
|
|
|
}
|
2009-11-10 10:30:51 +08:00
|
|
|
|
2009-12-06 08:53:22 +08:00
|
|
|
void CGVtableInfo::GenerateClassData(llvm::GlobalVariable::LinkageTypes Linkage,
|
|
|
|
const CXXRecordDecl *RD) {
|
2009-12-07 15:59:52 +08:00
|
|
|
llvm::GlobalVariable *&Vtable = Vtables[RD];
|
|
|
|
if (Vtable) {
|
|
|
|
assert(Vtable->getInitializer() && "Vtable doesn't have a definition!");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2010-01-14 10:29:07 +08:00
|
|
|
AddressPointsMapTy AddressPoints;
|
|
|
|
Vtable = GenerateVtable(Linkage, /*GenerateDefinition=*/true, RD, RD, 0,
|
|
|
|
AddressPoints);
|
2010-01-02 09:01:18 +08:00
|
|
|
GenerateVTT(Linkage, /*GenerateDefinition=*/true, RD);
|
2009-11-19 09:08:19 +08:00
|
|
|
}
|
|
|
|
|
2009-12-06 08:01:05 +08:00
|
|
|
llvm::GlobalVariable *CGVtableInfo::getVtable(const CXXRecordDecl *RD) {
|
2009-12-06 08:53:22 +08:00
|
|
|
llvm::GlobalVariable *Vtable = Vtables.lookup(RD);
|
2009-12-06 08:01:05 +08:00
|
|
|
|
2010-01-14 10:29:07 +08:00
|
|
|
if (!Vtable) {
|
|
|
|
AddressPointsMapTy AddressPoints;
|
2009-12-06 08:53:22 +08:00
|
|
|
Vtable = GenerateVtable(llvm::GlobalValue::ExternalLinkage,
|
2010-01-14 10:29:07 +08:00
|
|
|
/*GenerateDefinition=*/false, RD, RD, 0,
|
|
|
|
AddressPoints);
|
|
|
|
}
|
2009-11-19 12:04:36 +08:00
|
|
|
|
2009-12-06 06:42:54 +08:00
|
|
|
return Vtable;
|
2009-11-10 15:44:33 +08:00
|
|
|
}
|
2009-11-12 04:26:26 +08:00
|
|
|
|
2009-12-01 07:41:22 +08:00
|
|
|
void CGVtableInfo::MaybeEmitVtable(GlobalDecl GD) {
|
|
|
|
const CXXMethodDecl *MD = cast<CXXMethodDecl>(GD.getDecl());
|
|
|
|
const CXXRecordDecl *RD = MD->getParent();
|
|
|
|
|
2009-12-06 06:42:54 +08:00
|
|
|
// If the class doesn't have a vtable we don't need to emit one.
|
|
|
|
if (!RD->isDynamicClass())
|
|
|
|
return;
|
|
|
|
|
2009-12-01 07:41:22 +08:00
|
|
|
// Get the key function.
|
2009-12-07 12:35:11 +08:00
|
|
|
const CXXMethodDecl *KeyFunction = CGM.getContext().getKeyFunction(RD);
|
2009-12-01 07:41:22 +08:00
|
|
|
|
2009-12-06 06:42:54 +08:00
|
|
|
if (KeyFunction) {
|
|
|
|
// We don't have the right key function.
|
|
|
|
if (KeyFunction->getCanonicalDecl() != MD->getCanonicalDecl())
|
|
|
|
return;
|
2009-12-01 07:41:22 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// Emit the data.
|
2010-01-07 04:27:16 +08:00
|
|
|
GenerateClassData(CGM.getVtableLinkage(RD), RD);
|
2009-12-07 06:01:30 +08:00
|
|
|
|
|
|
|
for (CXXRecordDecl::method_iterator i = RD->method_begin(),
|
|
|
|
e = RD->method_end(); i != e; ++i) {
|
2009-12-08 07:56:34 +08:00
|
|
|
if ((*i)->isVirtual() && ((*i)->hasInlineBody() || (*i)->isImplicit())) {
|
2009-12-07 06:01:30 +08:00
|
|
|
if (const CXXDestructorDecl *DD = dyn_cast<CXXDestructorDecl>(*i)) {
|
|
|
|
CGM.BuildThunksForVirtual(GlobalDecl(DD, Dtor_Complete));
|
|
|
|
CGM.BuildThunksForVirtual(GlobalDecl(DD, Dtor_Deleting));
|
|
|
|
} else {
|
|
|
|
CGM.BuildThunksForVirtual(GlobalDecl(*i));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2009-12-01 07:41:22 +08:00
|
|
|
}
|
|
|
|
|