Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 1 | //===--- CGVtable.cpp - Emit LLVM Code for C++ vtables --------------------===// |
| 2 | // |
| 3 | // The LLVM Compiler Infrastructure |
| 4 | // |
| 5 | // This file is distributed under the University of Illinois Open Source |
| 6 | // License. See LICENSE.TXT for details. |
| 7 | // |
| 8 | //===----------------------------------------------------------------------===// |
| 9 | // |
| 10 | // This contains code dealing with C++ code generation of virtual tables. |
| 11 | // |
| 12 | //===----------------------------------------------------------------------===// |
| 13 | |
| 14 | #include "CodeGenModule.h" |
| 15 | #include "CodeGenFunction.h" |
| 16 | |
| 17 | #include "clang/AST/RecordLayout.h" |
| 18 | |
| 19 | using namespace clang; |
| 20 | using namespace CodeGen; |
| 21 | |
| 22 | class VtableBuilder { |
| 23 | public: |
| 24 | /// Index_t - Vtable index type. |
| 25 | typedef uint64_t Index_t; |
| 26 | private: |
| 27 | std::vector<llvm::Constant *> &methods; |
| 28 | std::vector<llvm::Constant *> submethods; |
| 29 | llvm::Type *Ptr8Ty; |
| 30 | /// Class - The most derived class that this vtable is being built for. |
| 31 | const CXXRecordDecl *Class; |
| 32 | /// BLayout - Layout for the most derived class that this vtable is being |
| 33 | /// built for. |
| 34 | const ASTRecordLayout &BLayout; |
| 35 | llvm::SmallSet<const CXXRecordDecl *, 32> IndirectPrimary; |
| 36 | llvm::SmallSet<const CXXRecordDecl *, 32> SeenVBase; |
| 37 | llvm::Constant *rtti; |
| 38 | llvm::LLVMContext &VMContext; |
| 39 | CodeGenModule &CGM; // Per-module state. |
| 40 | /// Index - Maps a method decl into a vtable index. Useful for virtual |
| 41 | /// dispatch codegen. |
| 42 | llvm::DenseMap<const CXXMethodDecl *, Index_t> Index; |
| 43 | llvm::DenseMap<const CXXMethodDecl *, Index_t> VCall; |
| 44 | llvm::DenseMap<const CXXMethodDecl *, Index_t> VCallOffset; |
| 45 | llvm::DenseMap<const CXXRecordDecl *, Index_t> VBIndex; |
Mike Stump | bb9ff05 | 2009-10-27 23:46:47 +0000 | [diff] [blame] | 46 | |
| 47 | typedef llvm::DenseMap<const CXXMethodDecl *, int> Pures_t; |
| 48 | Pures_t Pures; |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 49 | typedef std::pair<Index_t, Index_t> CallOffset; |
| 50 | typedef llvm::DenseMap<const CXXMethodDecl *, CallOffset> Thunks_t; |
| 51 | Thunks_t Thunks; |
| 52 | typedef llvm::DenseMap<const CXXMethodDecl *, |
Mike Stump | 87876a0 | 2009-10-13 10:55:21 +0000 | [diff] [blame] | 53 | std::pair<std::pair<CallOffset, CallOffset>, |
| 54 | CanQualType> > CovariantThunks_t; |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 55 | CovariantThunks_t CovariantThunks; |
| 56 | std::vector<Index_t> VCalls; |
| 57 | typedef CXXRecordDecl::method_iterator method_iter; |
| 58 | // FIXME: Linkage should follow vtable |
| 59 | const bool Extern; |
| 60 | const uint32_t LLVMPointerWidth; |
| 61 | Index_t extra; |
Mike Stump | 37dbe96 | 2009-10-15 02:04:03 +0000 | [diff] [blame] | 62 | int CurrentVBaseOffset; |
| 63 | typedef std::vector<std::pair<const CXXRecordDecl *, int64_t> > Path_t; |
Mike Stump | bb9ff05 | 2009-10-27 23:46:47 +0000 | [diff] [blame] | 64 | llvm::Constant *cxa_pure; |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 65 | public: |
| 66 | VtableBuilder(std::vector<llvm::Constant *> &meth, |
| 67 | const CXXRecordDecl *c, |
| 68 | CodeGenModule &cgm) |
| 69 | : methods(meth), Class(c), BLayout(cgm.getContext().getASTRecordLayout(c)), |
| 70 | rtti(cgm.GenerateRtti(c)), VMContext(cgm.getModule().getContext()), |
| 71 | CGM(cgm), Extern(true), |
Mike Stump | 37dbe96 | 2009-10-15 02:04:03 +0000 | [diff] [blame] | 72 | LLVMPointerWidth(cgm.getContext().Target.getPointerWidth(0)), |
| 73 | CurrentVBaseOffset(0) { |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 74 | Ptr8Ty = llvm::PointerType::get(llvm::Type::getInt8Ty(VMContext), 0); |
Mike Stump | 375faa8 | 2009-10-28 00:35:46 +0000 | [diff] [blame] | 75 | |
| 76 | // Calculate pointer for ___cxa_pure_virtual. |
| 77 | const llvm::FunctionType *FTy; |
| 78 | std::vector<const llvm::Type*> ArgTys; |
| 79 | const llvm::Type *ResultType = llvm::Type::getVoidTy(VMContext); |
| 80 | FTy = llvm::FunctionType::get(ResultType, ArgTys, false); |
| 81 | cxa_pure = wrap(CGM.CreateRuntimeFunction(FTy, "__cxa_pure_virtual")); |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 82 | } |
| 83 | |
| 84 | llvm::DenseMap<const CXXMethodDecl *, Index_t> &getIndex() { return Index; } |
| 85 | llvm::DenseMap<const CXXRecordDecl *, Index_t> &getVBIndex() |
| 86 | { return VBIndex; } |
| 87 | |
| 88 | llvm::Constant *wrap(Index_t i) { |
| 89 | llvm::Constant *m; |
| 90 | m = llvm::ConstantInt::get(llvm::Type::getInt64Ty(VMContext), i); |
| 91 | return llvm::ConstantExpr::getIntToPtr(m, Ptr8Ty); |
| 92 | } |
| 93 | |
| 94 | llvm::Constant *wrap(llvm::Constant *m) { |
| 95 | return llvm::ConstantExpr::getBitCast(m, Ptr8Ty); |
| 96 | } |
| 97 | |
Mike Stump | 75ce573 | 2009-10-31 20:06:59 +0000 | [diff] [blame] | 98 | #define D1(x) |
| 99 | //#define D1(X) do { if (getenv("DEBUG")) { X; } } while (0) |
| 100 | |
| 101 | void GenerateVBaseOffsets(const CXXRecordDecl *RD, uint64_t Offset, |
Mike Stump | 2843121 | 2009-10-13 22:54:56 +0000 | [diff] [blame] | 102 | bool updateVBIndex, Index_t current_vbindex) { |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 103 | for (CXXRecordDecl::base_class_const_iterator i = RD->bases_begin(), |
| 104 | e = RD->bases_end(); i != e; ++i) { |
| 105 | const CXXRecordDecl *Base = |
| 106 | cast<CXXRecordDecl>(i->getType()->getAs<RecordType>()->getDecl()); |
Mike Stump | 2843121 | 2009-10-13 22:54:56 +0000 | [diff] [blame] | 107 | Index_t next_vbindex = current_vbindex; |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 108 | if (i->isVirtual() && !SeenVBase.count(Base)) { |
| 109 | SeenVBase.insert(Base); |
Mike Stump | 2843121 | 2009-10-13 22:54:56 +0000 | [diff] [blame] | 110 | if (updateVBIndex) { |
Mike Stump | 75ce573 | 2009-10-31 20:06:59 +0000 | [diff] [blame] | 111 | next_vbindex = (ssize_t)(-(VCalls.size()*LLVMPointerWidth/8) |
Mike Stump | 2843121 | 2009-10-13 22:54:56 +0000 | [diff] [blame] | 112 | - 3*LLVMPointerWidth/8); |
| 113 | VBIndex[Base] = next_vbindex; |
| 114 | } |
Mike Stump | 75ce573 | 2009-10-31 20:06:59 +0000 | [diff] [blame] | 115 | int64_t BaseOffset = -(Offset/8) + BLayout.getVBaseClassOffset(Base)/8; |
| 116 | VCalls.push_back((0?700:0) + BaseOffset); |
| 117 | D1(printf(" vbase for %s at %d delta %d most derived %s\n", |
| 118 | Base->getNameAsCString(), |
| 119 | (int)-VCalls.size()-3, (int)BaseOffset, |
| 120 | Class->getNameAsCString())); |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 121 | } |
Mike Stump | 2843121 | 2009-10-13 22:54:56 +0000 | [diff] [blame] | 122 | // We also record offsets for non-virtual bases to closest enclosing |
| 123 | // virtual base. We do this so that we don't have to search |
| 124 | // for the nearst virtual base class when generating thunks. |
| 125 | if (updateVBIndex && VBIndex.count(Base) == 0) |
| 126 | VBIndex[Base] = next_vbindex; |
Mike Stump | 75ce573 | 2009-10-31 20:06:59 +0000 | [diff] [blame] | 127 | GenerateVBaseOffsets(Base, Offset, updateVBIndex, next_vbindex); |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 128 | } |
| 129 | } |
| 130 | |
| 131 | void StartNewTable() { |
| 132 | SeenVBase.clear(); |
| 133 | } |
| 134 | |
| 135 | Index_t VBlookup(CXXRecordDecl *D, CXXRecordDecl *B); |
| 136 | |
Mike Stump | 8bccbfd | 2009-10-15 09:30:16 +0000 | [diff] [blame] | 137 | Index_t getNVOffset_1(const CXXRecordDecl *D, const CXXRecordDecl *B, |
| 138 | Index_t Offset = 0) { |
| 139 | |
| 140 | if (B == D) |
| 141 | return Offset; |
| 142 | |
| 143 | const ASTRecordLayout &Layout = CGM.getContext().getASTRecordLayout(D); |
| 144 | for (CXXRecordDecl::base_class_const_iterator i = D->bases_begin(), |
| 145 | e = D->bases_end(); i != e; ++i) { |
| 146 | const CXXRecordDecl *Base = |
| 147 | cast<CXXRecordDecl>(i->getType()->getAs<RecordType>()->getDecl()); |
| 148 | int64_t BaseOffset = 0; |
| 149 | if (!i->isVirtual()) |
| 150 | BaseOffset = Offset + Layout.getBaseClassOffset(Base); |
| 151 | int64_t o = getNVOffset_1(Base, B, BaseOffset); |
| 152 | if (o >= 0) |
| 153 | return o; |
| 154 | } |
| 155 | |
| 156 | return -1; |
| 157 | } |
| 158 | |
| 159 | /// getNVOffset - Returns the non-virtual offset for the given (B) base of the |
| 160 | /// derived class D. |
| 161 | Index_t getNVOffset(QualType qB, QualType qD) { |
Mike Stump | 4627132 | 2009-11-03 19:03:17 +0000 | [diff] [blame] | 162 | qD = qD->getPointeeType(); |
| 163 | qB = qB->getPointeeType(); |
Mike Stump | 8bccbfd | 2009-10-15 09:30:16 +0000 | [diff] [blame] | 164 | CXXRecordDecl *D = cast<CXXRecordDecl>(qD->getAs<RecordType>()->getDecl()); |
| 165 | CXXRecordDecl *B = cast<CXXRecordDecl>(qB->getAs<RecordType>()->getDecl()); |
| 166 | int64_t o = getNVOffset_1(D, B); |
| 167 | if (o >= 0) |
| 168 | return o; |
| 169 | |
| 170 | assert(false && "FIXME: non-virtual base not found"); |
| 171 | return 0; |
| 172 | } |
| 173 | |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 174 | /// getVbaseOffset - Returns the index into the vtable for the virtual base |
| 175 | /// offset for the given (B) virtual base of the derived class D. |
| 176 | Index_t getVbaseOffset(QualType qB, QualType qD) { |
Mike Stump | 4627132 | 2009-11-03 19:03:17 +0000 | [diff] [blame] | 177 | qD = qD->getPointeeType(); |
| 178 | qB = qB->getPointeeType(); |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 179 | CXXRecordDecl *D = cast<CXXRecordDecl>(qD->getAs<RecordType>()->getDecl()); |
| 180 | CXXRecordDecl *B = cast<CXXRecordDecl>(qB->getAs<RecordType>()->getDecl()); |
| 181 | if (D != Class) |
| 182 | return VBlookup(D, B); |
| 183 | llvm::DenseMap<const CXXRecordDecl *, Index_t>::iterator i; |
| 184 | i = VBIndex.find(B); |
| 185 | if (i != VBIndex.end()) |
| 186 | return i->second; |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 187 | |
Mike Stump | 2843121 | 2009-10-13 22:54:56 +0000 | [diff] [blame] | 188 | assert(false && "FIXME: Base not found"); |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 189 | return 0; |
| 190 | } |
| 191 | |
| 192 | bool OverrideMethod(const CXXMethodDecl *MD, llvm::Constant *m, |
Mike Stump | 8bccbfd | 2009-10-15 09:30:16 +0000 | [diff] [blame] | 193 | bool MorallyVirtual, Index_t OverrideOffset, |
| 194 | Index_t Offset) { |
Mike Stump | 375faa8 | 2009-10-28 00:35:46 +0000 | [diff] [blame] | 195 | const bool isPure = MD->isPure(); |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 196 | typedef CXXMethodDecl::method_iterator meth_iter; |
Mike Stump | 8bccbfd | 2009-10-15 09:30:16 +0000 | [diff] [blame] | 197 | // FIXME: Should OverrideOffset's be Offset? |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 198 | |
| 199 | // FIXME: Don't like the nested loops. For very large inheritance |
| 200 | // heirarchies we could have a table on the side with the final overridder |
| 201 | // and just replace each instance of an overridden method once. Would be |
| 202 | // nice to measure the cost/benefit on real code. |
| 203 | |
| 204 | for (meth_iter mi = MD->begin_overridden_methods(), |
| 205 | e = MD->end_overridden_methods(); |
| 206 | mi != e; ++mi) { |
| 207 | const CXXMethodDecl *OMD = *mi; |
| 208 | llvm::Constant *om; |
| 209 | om = CGM.GetAddrOfFunction(OMD, Ptr8Ty); |
| 210 | om = llvm::ConstantExpr::getBitCast(om, Ptr8Ty); |
| 211 | |
| 212 | for (Index_t i = 0, e = submethods.size(); |
| 213 | i != e; ++i) { |
| 214 | // FIXME: begin_overridden_methods might be too lax, covariance */ |
| 215 | if (submethods[i] != om) |
| 216 | continue; |
| 217 | QualType nc_oret = OMD->getType()->getAs<FunctionType>()->getResultType(); |
| 218 | CanQualType oret = CGM.getContext().getCanonicalType(nc_oret); |
| 219 | QualType nc_ret = MD->getType()->getAs<FunctionType>()->getResultType(); |
| 220 | CanQualType ret = CGM.getContext().getCanonicalType(nc_ret); |
| 221 | CallOffset ReturnOffset = std::make_pair(0, 0); |
| 222 | if (oret != ret) { |
| 223 | // FIXME: calculate offsets for covariance |
Mike Stump | 87876a0 | 2009-10-13 10:55:21 +0000 | [diff] [blame] | 224 | if (CovariantThunks.count(OMD)) { |
| 225 | oret = CovariantThunks[OMD].second; |
| 226 | CovariantThunks.erase(OMD); |
| 227 | } |
Mike Stump | 8bccbfd | 2009-10-15 09:30:16 +0000 | [diff] [blame] | 228 | // FIXME: Double check oret |
| 229 | Index_t nv = getNVOffset(oret, ret)/8; |
Mike Stump | 87876a0 | 2009-10-13 10:55:21 +0000 | [diff] [blame] | 230 | ReturnOffset = std::make_pair(nv, getVbaseOffset(oret, ret)); |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 231 | } |
| 232 | Index[MD] = i; |
| 233 | submethods[i] = m; |
Mike Stump | 375faa8 | 2009-10-28 00:35:46 +0000 | [diff] [blame] | 234 | if (isPure) |
| 235 | Pures[MD] = 1; |
| 236 | Pures.erase(OMD); |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 237 | Thunks.erase(OMD); |
| 238 | if (MorallyVirtual) { |
| 239 | Index_t &idx = VCall[OMD]; |
| 240 | if (idx == 0) { |
Mike Stump | 8bccbfd | 2009-10-15 09:30:16 +0000 | [diff] [blame] | 241 | VCallOffset[MD] = OverrideOffset/8; |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 242 | idx = VCalls.size()+1; |
| 243 | VCalls.push_back(0); |
Mike Stump | 75ce573 | 2009-10-31 20:06:59 +0000 | [diff] [blame] | 244 | D1(printf(" vcall for %s at %d with delta %d most derived %s\n", |
Mike Stump | 72431bd | 2009-11-06 02:38:24 +0000 | [diff] [blame] | 245 | MD->getNameAsCString(), (int)-idx-3, (int)VCalls[idx-1], |
Mike Stump | 75ce573 | 2009-10-31 20:06:59 +0000 | [diff] [blame] | 246 | Class->getNameAsCString())); |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 247 | } else { |
| 248 | VCallOffset[MD] = VCallOffset[OMD]; |
Mike Stump | 8bccbfd | 2009-10-15 09:30:16 +0000 | [diff] [blame] | 249 | VCalls[idx-1] = -VCallOffset[OMD] + OverrideOffset/8; |
Mike Stump | 75ce573 | 2009-10-31 20:06:59 +0000 | [diff] [blame] | 250 | D1(printf(" vcall patch for %s at %d with delta %d most derived %s\n", |
Mike Stump | 72431bd | 2009-11-06 02:38:24 +0000 | [diff] [blame] | 251 | MD->getNameAsCString(), (int)-idx-3, (int)VCalls[idx-1], |
Mike Stump | 75ce573 | 2009-10-31 20:06:59 +0000 | [diff] [blame] | 252 | Class->getNameAsCString())); |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 253 | } |
| 254 | VCall[MD] = idx; |
| 255 | CallOffset ThisOffset; |
Mike Stump | 8bccbfd | 2009-10-15 09:30:16 +0000 | [diff] [blame] | 256 | ThisOffset = std::make_pair(CurrentVBaseOffset/8 - Offset/8, |
Mike Stump | 37dbe96 | 2009-10-15 02:04:03 +0000 | [diff] [blame] | 257 | -((idx+extra+2)*LLVMPointerWidth/8)); |
| 258 | // FIXME: Do we always have to build a covariant thunk to save oret, |
| 259 | // which is the containing virtual base class? |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 260 | if (ReturnOffset.first || ReturnOffset.second) |
Mike Stump | 87876a0 | 2009-10-13 10:55:21 +0000 | [diff] [blame] | 261 | CovariantThunks[MD] = std::make_pair(std::make_pair(ThisOffset, |
| 262 | ReturnOffset), |
| 263 | oret); |
Mike Stump | 375faa8 | 2009-10-28 00:35:46 +0000 | [diff] [blame] | 264 | else if (!isPure) |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 265 | Thunks[MD] = ThisOffset; |
| 266 | return true; |
| 267 | } |
Mike Stump | 2843121 | 2009-10-13 22:54:56 +0000 | [diff] [blame] | 268 | |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 269 | // FIXME: finish off |
Mike Stump | 8bccbfd | 2009-10-15 09:30:16 +0000 | [diff] [blame] | 270 | int64_t O = VCallOffset[OMD] - OverrideOffset/8; |
| 271 | // int64_t O = CurrentVBaseOffset/8 - OverrideOffset/8; |
Mike Stump | 72431bd | 2009-11-06 02:38:24 +0000 | [diff] [blame] | 272 | |
| 273 | if (VCall.count(OMD)) { |
| 274 | VCallOffset[MD] = VCallOffset[OMD]; |
| 275 | Index_t idx = VCall[OMD]; |
| 276 | VCalls[idx-1] = -VCallOffset[OMD] + OverrideOffset/8; |
| 277 | D1(printf(" vcall patch for %s at %d with delta %d most derived %s\n", |
| 278 | MD->getNameAsCString(), (int)-idx-3, (int)VCalls[idx-1], |
| 279 | Class->getNameAsCString())); |
| 280 | VCall[MD] = idx; |
| 281 | } |
Mike Stump | 2843121 | 2009-10-13 22:54:56 +0000 | [diff] [blame] | 282 | if (O || ReturnOffset.first || ReturnOffset.second) { |
| 283 | CallOffset ThisOffset = std::make_pair(O, 0); |
| 284 | |
| 285 | if (ReturnOffset.first || ReturnOffset.second) |
| 286 | CovariantThunks[MD] = std::make_pair(std::make_pair(ThisOffset, |
| 287 | ReturnOffset), |
| 288 | oret); |
Mike Stump | 375faa8 | 2009-10-28 00:35:46 +0000 | [diff] [blame] | 289 | else if (!isPure) |
Mike Stump | 2843121 | 2009-10-13 22:54:56 +0000 | [diff] [blame] | 290 | Thunks[MD] = ThisOffset; |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 291 | } |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 292 | return true; |
| 293 | } |
| 294 | } |
| 295 | |
| 296 | return false; |
| 297 | } |
| 298 | |
| 299 | void InstallThunks() { |
| 300 | for (Thunks_t::iterator i = Thunks.begin(), e = Thunks.end(); |
| 301 | i != e; ++i) { |
| 302 | const CXXMethodDecl *MD = i->first; |
Mike Stump | 375faa8 | 2009-10-28 00:35:46 +0000 | [diff] [blame] | 303 | assert(!MD->isPure() && "Trying to thunk a pure"); |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 304 | Index_t idx = Index[MD]; |
| 305 | Index_t nv_O = i->second.first; |
| 306 | Index_t v_O = i->second.second; |
| 307 | submethods[idx] = CGM.BuildThunk(MD, Extern, nv_O, v_O); |
| 308 | } |
| 309 | Thunks.clear(); |
| 310 | for (CovariantThunks_t::iterator i = CovariantThunks.begin(), |
| 311 | e = CovariantThunks.end(); |
| 312 | i != e; ++i) { |
| 313 | const CXXMethodDecl *MD = i->first; |
Mike Stump | 375faa8 | 2009-10-28 00:35:46 +0000 | [diff] [blame] | 314 | if (MD->isPure()) |
| 315 | continue; |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 316 | Index_t idx = Index[MD]; |
Mike Stump | 87876a0 | 2009-10-13 10:55:21 +0000 | [diff] [blame] | 317 | Index_t nv_t = i->second.first.first.first; |
| 318 | Index_t v_t = i->second.first.first.second; |
| 319 | Index_t nv_r = i->second.first.second.first; |
| 320 | Index_t v_r = i->second.first.second.second; |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 321 | submethods[idx] = CGM.BuildCovariantThunk(MD, Extern, nv_t, v_t, nv_r, |
| 322 | v_r); |
| 323 | } |
| 324 | CovariantThunks.clear(); |
Mike Stump | bb9ff05 | 2009-10-27 23:46:47 +0000 | [diff] [blame] | 325 | for (Pures_t::iterator i = Pures.begin(), e = Pures.end(); |
| 326 | i != e; ++i) { |
| 327 | const CXXMethodDecl *MD = i->first; |
| 328 | Index_t idx = Index[MD]; |
| 329 | submethods[idx] = cxa_pure; |
| 330 | } |
| 331 | Pures.clear(); |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 332 | } |
| 333 | |
Mike Stump | 18e8b47 | 2009-10-27 23:36:26 +0000 | [diff] [blame] | 334 | llvm::Constant *WrapAddrOf(const CXXMethodDecl *MD) { |
| 335 | if (const CXXDestructorDecl *Dtor = dyn_cast<CXXDestructorDecl>(MD)) |
| 336 | return wrap(CGM.GetAddrOfCXXDestructor(Dtor, Dtor_Complete)); |
| 337 | |
| 338 | const FunctionProtoType *FPT = MD->getType()->getAs<FunctionProtoType>(); |
| 339 | const llvm::Type *Ty = |
| 340 | CGM.getTypes().GetFunctionType(CGM.getTypes().getFunctionInfo(MD), |
| 341 | FPT->isVariadic()); |
| 342 | |
| 343 | return wrap(CGM.GetAddrOfFunction(MD, Ty)); |
| 344 | } |
| 345 | |
Mike Stump | 8bccbfd | 2009-10-15 09:30:16 +0000 | [diff] [blame] | 346 | void OverrideMethods(Path_t *Path, bool MorallyVirtual, int64_t Offset) { |
Mike Stump | 37dbe96 | 2009-10-15 02:04:03 +0000 | [diff] [blame] | 347 | for (Path_t::reverse_iterator i = Path->rbegin(), |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 348 | e = Path->rend(); i != e; ++i) { |
| 349 | const CXXRecordDecl *RD = i->first; |
Mike Stump | 8bccbfd | 2009-10-15 09:30:16 +0000 | [diff] [blame] | 350 | int64_t OverrideOffset = i->second; |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 351 | for (method_iter mi = RD->method_begin(), me = RD->method_end(); mi != me; |
| 352 | ++mi) { |
| 353 | if (!mi->isVirtual()) |
| 354 | continue; |
| 355 | |
| 356 | const CXXMethodDecl *MD = *mi; |
Mike Stump | 18e8b47 | 2009-10-27 23:36:26 +0000 | [diff] [blame] | 357 | llvm::Constant *m = WrapAddrOf(MD); |
Mike Stump | 8bccbfd | 2009-10-15 09:30:16 +0000 | [diff] [blame] | 358 | OverrideMethod(MD, m, MorallyVirtual, OverrideOffset, Offset); |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 359 | } |
| 360 | } |
| 361 | } |
| 362 | |
Mike Stump | 75ce573 | 2009-10-31 20:06:59 +0000 | [diff] [blame] | 363 | void AddMethod(const CXXMethodDecl *MD, bool MorallyVirtual, Index_t Offset, |
| 364 | bool ForVirtualBase) { |
Mike Stump | 18e8b47 | 2009-10-27 23:36:26 +0000 | [diff] [blame] | 365 | llvm::Constant *m = WrapAddrOf(MD); |
| 366 | |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 367 | // If we can find a previously allocated slot for this, reuse it. |
Mike Stump | 8bccbfd | 2009-10-15 09:30:16 +0000 | [diff] [blame] | 368 | if (OverrideMethod(MD, m, MorallyVirtual, Offset, Offset)) |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 369 | return; |
| 370 | |
| 371 | // else allocate a new slot. |
| 372 | Index[MD] = submethods.size(); |
| 373 | submethods.push_back(m); |
Mike Stump | 75ce573 | 2009-10-31 20:06:59 +0000 | [diff] [blame] | 374 | D1(printf(" vfn for %s at %d\n", MD->getNameAsCString(), (int)Index[MD])); |
Mike Stump | 375faa8 | 2009-10-28 00:35:46 +0000 | [diff] [blame] | 375 | if (MD->isPure()) |
| 376 | Pures[MD] = 1; |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 377 | if (MorallyVirtual) { |
| 378 | VCallOffset[MD] = Offset/8; |
| 379 | Index_t &idx = VCall[MD]; |
| 380 | // Allocate the first one, after that, we reuse the previous one. |
| 381 | if (idx == 0) { |
| 382 | idx = VCalls.size()+1; |
| 383 | VCalls.push_back(0); |
Mike Stump | 75ce573 | 2009-10-31 20:06:59 +0000 | [diff] [blame] | 384 | D1(printf(" vcall for %s at %d with delta %d\n", |
Mike Stump | 72431bd | 2009-11-06 02:38:24 +0000 | [diff] [blame] | 385 | MD->getNameAsCString(), (int)-VCalls.size()-3, 0)); |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 386 | } |
| 387 | } |
| 388 | } |
| 389 | |
| 390 | void AddMethods(const CXXRecordDecl *RD, bool MorallyVirtual, |
Mike Stump | 75ce573 | 2009-10-31 20:06:59 +0000 | [diff] [blame] | 391 | Index_t Offset, bool RDisVirtualBase) { |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 392 | for (method_iter mi = RD->method_begin(), me = RD->method_end(); mi != me; |
| 393 | ++mi) |
| 394 | if (mi->isVirtual()) |
Mike Stump | 75ce573 | 2009-10-31 20:06:59 +0000 | [diff] [blame] | 395 | AddMethod(*mi, MorallyVirtual, Offset, RDisVirtualBase); |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 396 | } |
| 397 | |
| 398 | void NonVirtualBases(const CXXRecordDecl *RD, const ASTRecordLayout &Layout, |
| 399 | const CXXRecordDecl *PrimaryBase, |
| 400 | bool PrimaryBaseWasVirtual, bool MorallyVirtual, |
Mike Stump | 37dbe96 | 2009-10-15 02:04:03 +0000 | [diff] [blame] | 401 | int64_t Offset, Path_t *Path) { |
| 402 | Path->push_back(std::make_pair(RD, Offset)); |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 403 | for (CXXRecordDecl::base_class_const_iterator i = RD->bases_begin(), |
| 404 | e = RD->bases_end(); i != e; ++i) { |
| 405 | if (i->isVirtual()) |
| 406 | continue; |
| 407 | const CXXRecordDecl *Base = |
| 408 | cast<CXXRecordDecl>(i->getType()->getAs<RecordType>()->getDecl()); |
| 409 | if (Base != PrimaryBase || PrimaryBaseWasVirtual) { |
| 410 | uint64_t o = Offset + Layout.getBaseClassOffset(Base); |
| 411 | StartNewTable(); |
Mike Stump | 37dbe96 | 2009-10-15 02:04:03 +0000 | [diff] [blame] | 412 | CurrentVBaseOffset = Offset; |
| 413 | GenerateVtableForBase(Base, MorallyVirtual, o, false, Path); |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 414 | } |
| 415 | } |
Mike Stump | 37dbe96 | 2009-10-15 02:04:03 +0000 | [diff] [blame] | 416 | Path->pop_back(); |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 417 | } |
| 418 | |
Mike Stump | b21c4ee | 2009-10-14 18:14:51 +0000 | [diff] [blame] | 419 | // #define D(X) do { X; } while (0) |
| 420 | #define D(X) |
| 421 | |
| 422 | void insertVCalls(int InsertionPoint) { |
| 423 | llvm::Constant *e = 0; |
Mike Stump | 75ce573 | 2009-10-31 20:06:59 +0000 | [diff] [blame] | 424 | D1(printf("============= combining vbase/vcall\n")); |
Mike Stump | b21c4ee | 2009-10-14 18:14:51 +0000 | [diff] [blame] | 425 | D(VCalls.insert(VCalls.begin(), 673)); |
| 426 | D(VCalls.push_back(672)); |
Mike Stump | 8bccbfd | 2009-10-15 09:30:16 +0000 | [diff] [blame] | 427 | methods.insert(methods.begin() + InsertionPoint, VCalls.size(), e); |
Mike Stump | b21c4ee | 2009-10-14 18:14:51 +0000 | [diff] [blame] | 428 | // The vcalls come first... |
| 429 | for (std::vector<Index_t>::reverse_iterator i = VCalls.rbegin(), |
| 430 | e = VCalls.rend(); |
| 431 | i != e; ++i) |
| 432 | methods[InsertionPoint++] = wrap((0?600:0) + *i); |
| 433 | VCalls.clear(); |
| 434 | } |
| 435 | |
Mike Stump | 75ce573 | 2009-10-31 20:06:59 +0000 | [diff] [blame] | 436 | Index_t end(const CXXRecordDecl *RD, const ASTRecordLayout &Layout, |
| 437 | const CXXRecordDecl *PrimaryBase, bool PrimaryBaseWasVirtual, |
| 438 | bool MorallyVirtual, int64_t Offset, bool ForVirtualBase, |
| 439 | Path_t *Path) { |
Mike Stump | 37dbe96 | 2009-10-15 02:04:03 +0000 | [diff] [blame] | 440 | bool alloc = false; |
| 441 | if (Path == 0) { |
| 442 | alloc = true; |
| 443 | Path = new Path_t; |
| 444 | } |
| 445 | |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 446 | StartNewTable(); |
| 447 | extra = 0; |
Mike Stump | b21c4ee | 2009-10-14 18:14:51 +0000 | [diff] [blame] | 448 | bool DeferVCalls = MorallyVirtual || ForVirtualBase; |
| 449 | int VCallInsertionPoint = methods.size(); |
| 450 | if (!DeferVCalls) { |
| 451 | insertVCalls(VCallInsertionPoint); |
Mike Stump | 8bccbfd | 2009-10-15 09:30:16 +0000 | [diff] [blame] | 452 | } else |
| 453 | // FIXME: just for extra, or for all uses of VCalls.size post this? |
| 454 | extra = -VCalls.size(); |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 455 | |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 456 | methods.push_back(wrap(-(Offset/8))); |
| 457 | methods.push_back(rtti); |
| 458 | Index_t AddressPoint = methods.size(); |
| 459 | |
| 460 | InstallThunks(); |
Mike Stump | 75ce573 | 2009-10-31 20:06:59 +0000 | [diff] [blame] | 461 | D1(printf("============= combining methods\n")); |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 462 | methods.insert(methods.end(), submethods.begin(), submethods.end()); |
| 463 | submethods.clear(); |
| 464 | |
| 465 | // and then the non-virtual bases. |
| 466 | NonVirtualBases(RD, Layout, PrimaryBase, PrimaryBaseWasVirtual, |
Mike Stump | 37dbe96 | 2009-10-15 02:04:03 +0000 | [diff] [blame] | 467 | MorallyVirtual, Offset, Path); |
Mike Stump | b21c4ee | 2009-10-14 18:14:51 +0000 | [diff] [blame] | 468 | |
| 469 | if (ForVirtualBase) { |
Mike Stump | b21c4ee | 2009-10-14 18:14:51 +0000 | [diff] [blame] | 470 | insertVCalls(VCallInsertionPoint); |
| 471 | AddressPoint += VCalls.size(); |
Mike Stump | b21c4ee | 2009-10-14 18:14:51 +0000 | [diff] [blame] | 472 | } |
| 473 | |
Mike Stump | 37dbe96 | 2009-10-15 02:04:03 +0000 | [diff] [blame] | 474 | if (alloc) { |
| 475 | delete Path; |
| 476 | } |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 477 | return AddressPoint; |
| 478 | } |
| 479 | |
Mike Stump | 75ce573 | 2009-10-31 20:06:59 +0000 | [diff] [blame] | 480 | void Primaries(const CXXRecordDecl *RD, bool MorallyVirtual, int64_t Offset, |
| 481 | bool updateVBIndex, Index_t current_vbindex, |
| 482 | bool RDisVirtualBase) { |
| 483 | if (!RD->isDynamicClass()) |
| 484 | return; |
| 485 | |
| 486 | const ASTRecordLayout &Layout = CGM.getContext().getASTRecordLayout(RD); |
| 487 | const CXXRecordDecl *PrimaryBase = Layout.getPrimaryBase(); |
| 488 | const bool PrimaryBaseWasVirtual = Layout.getPrimaryBaseWasVirtual(); |
| 489 | |
| 490 | // vtables are composed from the chain of primaries. |
| 491 | if (PrimaryBase) { |
| 492 | D1(printf(" doing primaries for %s most derived %s\n", |
| 493 | RD->getNameAsCString(), Class->getNameAsCString())); |
| 494 | |
| 495 | if (!PrimaryBaseWasVirtual) |
| 496 | Primaries(PrimaryBase, PrimaryBaseWasVirtual|MorallyVirtual, Offset, |
| 497 | updateVBIndex, current_vbindex, PrimaryBaseWasVirtual); |
| 498 | } |
| 499 | |
| 500 | D1(printf(" doing vcall entries for %s most derived %s\n", |
| 501 | RD->getNameAsCString(), Class->getNameAsCString())); |
| 502 | |
| 503 | // And add the virtuals for the class to the primary vtable. |
| 504 | AddMethods(RD, MorallyVirtual, Offset, RDisVirtualBase); |
| 505 | } |
| 506 | |
| 507 | void VBPrimaries(const CXXRecordDecl *RD, bool MorallyVirtual, int64_t Offset, |
| 508 | bool updateVBIndex, Index_t current_vbindex, |
| 509 | bool RDisVirtualBase, bool bottom=false) { |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 510 | if (!RD->isDynamicClass()) |
| 511 | return; |
| 512 | |
| 513 | const ASTRecordLayout &Layout = CGM.getContext().getASTRecordLayout(RD); |
| 514 | const CXXRecordDecl *PrimaryBase = Layout.getPrimaryBase(); |
| 515 | const bool PrimaryBaseWasVirtual = Layout.getPrimaryBaseWasVirtual(); |
| 516 | |
| 517 | // vtables are composed from the chain of primaries. |
| 518 | if (PrimaryBase) { |
| 519 | if (PrimaryBaseWasVirtual) |
| 520 | IndirectPrimary.insert(PrimaryBase); |
Mike Stump | 75ce573 | 2009-10-31 20:06:59 +0000 | [diff] [blame] | 521 | |
| 522 | D1(printf(" doing primaries for %s most derived %s\n", |
| 523 | RD->getNameAsCString(), Class->getNameAsCString())); |
| 524 | |
| 525 | VBPrimaries(PrimaryBase, PrimaryBaseWasVirtual|MorallyVirtual, Offset, |
| 526 | updateVBIndex, current_vbindex, PrimaryBaseWasVirtual); |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 527 | } |
| 528 | |
Mike Stump | 75ce573 | 2009-10-31 20:06:59 +0000 | [diff] [blame] | 529 | D1(printf(" doing vbase entries for %s most derived %s\n", |
| 530 | RD->getNameAsCString(), Class->getNameAsCString())); |
| 531 | GenerateVBaseOffsets(RD, Offset, updateVBIndex, current_vbindex); |
| 532 | |
| 533 | if (RDisVirtualBase || bottom) { |
| 534 | Primaries(RD, MorallyVirtual, Offset, updateVBIndex, current_vbindex, |
| 535 | RDisVirtualBase); |
| 536 | } |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 537 | } |
| 538 | |
| 539 | int64_t GenerateVtableForBase(const CXXRecordDecl *RD, |
| 540 | bool MorallyVirtual = false, int64_t Offset = 0, |
| 541 | bool ForVirtualBase = false, |
Mike Stump | 37dbe96 | 2009-10-15 02:04:03 +0000 | [diff] [blame] | 542 | Path_t *Path = 0) { |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 543 | if (!RD->isDynamicClass()) |
| 544 | return 0; |
| 545 | |
| 546 | const ASTRecordLayout &Layout = CGM.getContext().getASTRecordLayout(RD); |
| 547 | const CXXRecordDecl *PrimaryBase = Layout.getPrimaryBase(); |
| 548 | const bool PrimaryBaseWasVirtual = Layout.getPrimaryBaseWasVirtual(); |
| 549 | |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 550 | extra = 0; |
Mike Stump | 75ce573 | 2009-10-31 20:06:59 +0000 | [diff] [blame] | 551 | D1(printf("building entries for base %s most derived %s\n", |
| 552 | RD->getNameAsCString(), Class->getNameAsCString())); |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 553 | |
Mike Stump | 75ce573 | 2009-10-31 20:06:59 +0000 | [diff] [blame] | 554 | if (ForVirtualBase) |
| 555 | extra = VCalls.size(); |
| 556 | |
| 557 | VBPrimaries(RD, MorallyVirtual, Offset, !ForVirtualBase, 0, ForVirtualBase, |
| 558 | true); |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 559 | |
| 560 | if (Path) |
Mike Stump | 8bccbfd | 2009-10-15 09:30:16 +0000 | [diff] [blame] | 561 | OverrideMethods(Path, MorallyVirtual, Offset); |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 562 | |
Mike Stump | 75ce573 | 2009-10-31 20:06:59 +0000 | [diff] [blame] | 563 | return end(RD, Layout, PrimaryBase, PrimaryBaseWasVirtual, MorallyVirtual, |
| 564 | Offset, ForVirtualBase, Path); |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 565 | } |
| 566 | |
| 567 | void GenerateVtableForVBases(const CXXRecordDecl *RD, |
| 568 | int64_t Offset = 0, |
Mike Stump | 37dbe96 | 2009-10-15 02:04:03 +0000 | [diff] [blame] | 569 | Path_t *Path = 0) { |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 570 | bool alloc = false; |
| 571 | if (Path == 0) { |
| 572 | alloc = true; |
Mike Stump | 37dbe96 | 2009-10-15 02:04:03 +0000 | [diff] [blame] | 573 | Path = new Path_t; |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 574 | } |
| 575 | // FIXME: We also need to override using all paths to a virtual base, |
| 576 | // right now, we just process the first path |
| 577 | Path->push_back(std::make_pair(RD, Offset)); |
| 578 | for (CXXRecordDecl::base_class_const_iterator i = RD->bases_begin(), |
| 579 | e = RD->bases_end(); i != e; ++i) { |
| 580 | const CXXRecordDecl *Base = |
| 581 | cast<CXXRecordDecl>(i->getType()->getAs<RecordType>()->getDecl()); |
| 582 | if (i->isVirtual() && !IndirectPrimary.count(Base)) { |
| 583 | // Mark it so we don't output it twice. |
| 584 | IndirectPrimary.insert(Base); |
| 585 | StartNewTable(); |
Mike Stump | b21c4ee | 2009-10-14 18:14:51 +0000 | [diff] [blame] | 586 | VCall.clear(); |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 587 | int64_t BaseOffset = BLayout.getVBaseClassOffset(Base); |
Mike Stump | 37dbe96 | 2009-10-15 02:04:03 +0000 | [diff] [blame] | 588 | CurrentVBaseOffset = BaseOffset; |
Mike Stump | 75ce573 | 2009-10-31 20:06:59 +0000 | [diff] [blame] | 589 | D1(printf("vtable %s virtual base %s\n", |
| 590 | Class->getNameAsCString(), Base->getNameAsCString())); |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 591 | GenerateVtableForBase(Base, true, BaseOffset, true, Path); |
| 592 | } |
| 593 | int64_t BaseOffset = Offset; |
| 594 | if (i->isVirtual()) |
| 595 | BaseOffset = BLayout.getVBaseClassOffset(Base); |
Mike Stump | 37dbe96 | 2009-10-15 02:04:03 +0000 | [diff] [blame] | 596 | if (Base->getNumVBases()) { |
| 597 | CurrentVBaseOffset = BaseOffset; |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 598 | GenerateVtableForVBases(Base, BaseOffset, Path); |
Mike Stump | 37dbe96 | 2009-10-15 02:04:03 +0000 | [diff] [blame] | 599 | } |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 600 | } |
| 601 | Path->pop_back(); |
| 602 | if (alloc) |
| 603 | delete Path; |
| 604 | } |
| 605 | }; |
| 606 | |
| 607 | |
| 608 | VtableBuilder::Index_t VtableBuilder::VBlookup(CXXRecordDecl *D, |
| 609 | CXXRecordDecl *B) { |
| 610 | return CGM.getVtableInfo().getVirtualBaseOffsetIndex(D, B); |
| 611 | } |
| 612 | |
| 613 | int64_t CGVtableInfo::getMethodVtableIndex(const CXXMethodDecl *MD) { |
| 614 | MD = MD->getCanonicalDecl(); |
| 615 | |
| 616 | MethodVtableIndicesTy::iterator I = MethodVtableIndices.find(MD); |
| 617 | if (I != MethodVtableIndices.end()) |
| 618 | return I->second; |
| 619 | |
| 620 | const CXXRecordDecl *RD = MD->getParent(); |
| 621 | |
| 622 | std::vector<llvm::Constant *> methods; |
| 623 | // FIXME: This seems expensive. Can we do a partial job to get |
| 624 | // just this data. |
| 625 | VtableBuilder b(methods, RD, CGM); |
Mike Stump | 75ce573 | 2009-10-31 20:06:59 +0000 | [diff] [blame] | 626 | D1(printf("vtable %s\n", RD->getNameAsCString())); |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 627 | b.GenerateVtableForBase(RD); |
| 628 | b.GenerateVtableForVBases(RD); |
| 629 | |
| 630 | MethodVtableIndices.insert(b.getIndex().begin(), |
| 631 | b.getIndex().end()); |
| 632 | |
| 633 | I = MethodVtableIndices.find(MD); |
| 634 | assert(I != MethodVtableIndices.end() && "Did not find index!"); |
| 635 | return I->second; |
| 636 | } |
| 637 | |
| 638 | int64_t CGVtableInfo::getVirtualBaseOffsetIndex(const CXXRecordDecl *RD, |
| 639 | const CXXRecordDecl *VBase) { |
| 640 | ClassPairTy ClassPair(RD, VBase); |
| 641 | |
| 642 | VirtualBaseClassIndiciesTy::iterator I = |
| 643 | VirtualBaseClassIndicies.find(ClassPair); |
| 644 | if (I != VirtualBaseClassIndicies.end()) |
| 645 | return I->second; |
| 646 | |
| 647 | std::vector<llvm::Constant *> methods; |
| 648 | // FIXME: This seems expensive. Can we do a partial job to get |
| 649 | // just this data. |
| 650 | VtableBuilder b(methods, RD, CGM); |
Mike Stump | 75ce573 | 2009-10-31 20:06:59 +0000 | [diff] [blame] | 651 | D1(printf("vtable %s\n", RD->getNameAsCString())); |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 652 | b.GenerateVtableForBase(RD); |
| 653 | b.GenerateVtableForVBases(RD); |
| 654 | |
| 655 | for (llvm::DenseMap<const CXXRecordDecl *, uint64_t>::iterator I = |
| 656 | b.getVBIndex().begin(), E = b.getVBIndex().end(); I != E; ++I) { |
| 657 | // Insert all types. |
| 658 | ClassPairTy ClassPair(RD, I->first); |
| 659 | |
| 660 | VirtualBaseClassIndicies.insert(std::make_pair(ClassPair, I->second)); |
| 661 | } |
| 662 | |
| 663 | I = VirtualBaseClassIndicies.find(ClassPair); |
| 664 | assert(I != VirtualBaseClassIndicies.end() && "Did not find index!"); |
| 665 | |
| 666 | return I->second; |
| 667 | } |
| 668 | |
| 669 | llvm::Value *CodeGenFunction::GenerateVtable(const CXXRecordDecl *RD) { |
| 670 | llvm::SmallString<256> OutName; |
| 671 | llvm::raw_svector_ostream Out(OutName); |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 672 | mangleCXXVtable(CGM.getMangleContext(), RD, Out); |
Benjamin Kramer | bb0a07b | 2009-10-11 22:57:54 +0000 | [diff] [blame] | 673 | |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 674 | llvm::GlobalVariable::LinkageTypes linktype; |
Chandler Carruth | 6e0df53 | 2009-10-26 17:14:14 +0000 | [diff] [blame] | 675 | linktype = llvm::GlobalValue::LinkOnceODRLinkage; |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 676 | std::vector<llvm::Constant *> methods; |
| 677 | llvm::Type *Ptr8Ty=llvm::PointerType::get(llvm::Type::getInt8Ty(VMContext),0); |
| 678 | int64_t AddressPoint; |
| 679 | |
| 680 | VtableBuilder b(methods, RD, CGM); |
| 681 | |
Mike Stump | 75ce573 | 2009-10-31 20:06:59 +0000 | [diff] [blame] | 682 | D1(printf("vtable %s\n", RD->getNameAsCString())); |
Anders Carlsson | 2bb27f5 | 2009-10-11 22:13:54 +0000 | [diff] [blame] | 683 | // First comes the vtables for all the non-virtual bases... |
| 684 | AddressPoint = b.GenerateVtableForBase(RD); |
| 685 | |
| 686 | // then the vtables for all the virtual bases. |
| 687 | b.GenerateVtableForVBases(RD); |
| 688 | |
| 689 | llvm::Constant *C; |
| 690 | llvm::ArrayType *type = llvm::ArrayType::get(Ptr8Ty, methods.size()); |
| 691 | C = llvm::ConstantArray::get(type, methods); |
| 692 | llvm::Value *vtable = new llvm::GlobalVariable(CGM.getModule(), type, true, |
| 693 | linktype, C, Out.str()); |
| 694 | vtable = Builder.CreateBitCast(vtable, Ptr8Ty); |
| 695 | vtable = Builder.CreateGEP(vtable, |
| 696 | llvm::ConstantInt::get(llvm::Type::getInt64Ty(VMContext), |
| 697 | AddressPoint*LLVMPointerWidth/8)); |
| 698 | return vtable; |
| 699 | } |