head 1.1; branch 1.1.1; access; symbols netbsd-11-0-RC4:1.1.1.2 netbsd-11-0-RC3:1.1.1.2 netbsd-11-0-RC2:1.1.1.2 netbsd-11-0-RC1:1.1.1.2 perseant-exfatfs-base-20250801:1.1.1.2 netbsd-11:1.1.1.2.0.30 netbsd-11-base:1.1.1.2 netbsd-10-1-RELEASE:1.1.1.2 perseant-exfatfs-base-20240630:1.1.1.2 perseant-exfatfs:1.1.1.2.0.28 perseant-exfatfs-base:1.1.1.2 netbsd-8-3-RELEASE:1.1.1.2 netbsd-9-4-RELEASE:1.1.1.2 netbsd-10-0-RELEASE:1.1.1.2 netbsd-10-0-RC6:1.1.1.2 netbsd-10-0-RC5:1.1.1.2 netbsd-10-0-RC4:1.1.1.2 netbsd-10-0-RC3:1.1.1.2 netbsd-10-0-RC2:1.1.1.2 netbsd-10-0-RC1:1.1.1.2 netbsd-10:1.1.1.2.0.26 netbsd-10-base:1.1.1.2 netbsd-9-3-RELEASE:1.1.1.2 cjep_sun2x:1.1.1.2.0.24 cjep_sun2x-base:1.1.1.2 cjep_staticlib_x-base1:1.1.1.2 netbsd-9-2-RELEASE:1.1.1.2 cjep_staticlib_x:1.1.1.2.0.22 cjep_staticlib_x-base:1.1.1.2 netbsd-9-1-RELEASE:1.1.1.2 phil-wifi-20200421:1.1.1.2 phil-wifi-20200411:1.1.1.2 phil-wifi-20200406:1.1.1.2 netbsd-8-2-RELEASE:1.1.1.2 netbsd-9-0-RELEASE:1.1.1.2 netbsd-9-0-RC2:1.1.1.2 netbsd-9-0-RC1:1.1.1.2 netbsd-9:1.1.1.2.0.20 netbsd-9-base:1.1.1.2 netbsd-8-1-RELEASE:1.1.1.2 netbsd-8-1-RC1:1.1.1.2 pgoyette-compat-merge-20190127:1.1.1.2 pgoyette-compat-20190127:1.1.1.2 pgoyette-compat-20190118:1.1.1.2 pgoyette-compat-1226:1.1.1.2 pgoyette-compat-1126:1.1.1.2 pgoyette-compat-1020:1.1.1.2 pgoyette-compat-0930:1.1.1.2 pgoyette-compat-0906:1.1.1.2 netbsd-7-2-RELEASE:1.1.1.2 pgoyette-compat-0728:1.1.1.2 netbsd-8-0-RELEASE:1.1.1.2 pgoyette-compat-0625:1.1.1.2 netbsd-8-0-RC2:1.1.1.2 pgoyette-compat-0521:1.1.1.2 pgoyette-compat-0502:1.1.1.2 pgoyette-compat-0422:1.1.1.2 netbsd-8-0-RC1:1.1.1.2 pgoyette-compat-0415:1.1.1.2 pgoyette-compat-0407:1.1.1.2 pgoyette-compat-0330:1.1.1.2 pgoyette-compat-0322:1.1.1.2 pgoyette-compat-0315:1.1.1.2 netbsd-7-1-2-RELEASE:1.1.1.2 pgoyette-compat:1.1.1.2.0.18 pgoyette-compat-base:1.1.1.2 netbsd-7-1-1-RELEASE:1.1.1.2 perseant-stdc-iso10646:1.1.1.2.0.16 perseant-stdc-iso10646-base:1.1.1.2 netbsd-8:1.1.1.2.0.14 netbsd-8-base:1.1.1.2 prg-localcount2-base3:1.1.1.2 prg-localcount2-base2:1.1.1.2 prg-localcount2-base1:1.1.1.2 prg-localcount2:1.1.1.2.0.12 prg-localcount2-base:1.1.1.2 pgoyette-localcount-20170426:1.1.1.2 bouyer-socketcan-base1:1.1.1.2 pgoyette-localcount-20170320:1.1.1.2 netbsd-7-1:1.1.1.2.0.10 netbsd-7-1-RELEASE:1.1.1.2 netbsd-7-1-RC2:1.1.1.2 bouyer-socketcan:1.1.1.2.0.8 bouyer-socketcan-base:1.1.1.2 pgoyette-localcount-20170107:1.1.1.2 netbsd-7-1-RC1:1.1.1.2 pgoyette-localcount-20161104:1.1.1.2 netbsd-7-0-2-RELEASE:1.1.1.2 localcount-20160914:1.1.1.2 pgoyette-localcount-20160806:1.1.1.2 pgoyette-localcount-20160726:1.1.1.2 pgoyette-localcount:1.1.1.2.0.6 pgoyette-localcount-base:1.1.1.2 netbsd-7-0-1-RELEASE:1.1.1.2 netbsd-7-0:1.1.1.2.0.4 netbsd-7-0-RELEASE:1.1.1.2 netbsd-7-0-RC3:1.1.1.2 netbsd-7-0-RC2:1.1.1.2 netbsd-7-0-RC1:1.1.1.2 tls-maxphys-base:1.1.1.2 netbsd-7:1.1.1.2.0.2 netbsd-7-base:1.1.1.2 yamt-pagecache:1.1.1.1.0.4 yamt-pagecache-base9:1.1.1.1 tls-earlyentropy:1.1.1.1.0.2 tls-earlyentropy-base:1.1.1.2 riastradh-xf86-video-intel-2-7-1-pre-2-21-15:1.1.1.1 riastradh-drm2-base3:1.1.1.1 clang-196603:1.1.1.1 clang-195771:1.1.1.1 LLVM:1.1.1; locks; strict; comment @// @; 1.1 date 2013.11.28.14.14.53; author joerg; state Exp; branches 1.1.1.1; next ; commitid ow8OybrawrB1f3fx; 1.1.1.1 date 2013.11.28.14.14.53; author joerg; state Exp; branches 1.1.1.1.2.1 1.1.1.1.4.1; next 1.1.1.2; commitid ow8OybrawrB1f3fx; 1.1.1.2 date 2014.05.31.22.40.31; author joerg; state dead; branches; next ; commitid ISCoGzYsvMeI7KCx; 1.1.1.1.2.1 date 2014.08.10.07.08.07; author tls; state dead; branches; next ; commitid t01A1TLTYxkpGMLx; 1.1.1.1.4.1 date 2013.11.28.14.14.53; author yamt; state dead; branches; next 1.1.1.1.4.2; commitid WSrDtL5nYAUyiyBx; 1.1.1.1.4.2 date 2014.05.22.16.18.27; author yamt; state Exp; branches; next ; commitid WSrDtL5nYAUyiyBx; desc @@ 1.1 log @Initial revision @ text @//===--- MicrosoftVBTables.cpp - Virtual Base Table Emission --------------===// // // The LLVM Compiler Infrastructure // // This file is distributed under the University of Illinois Open Source // License. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// // // This class generates data about MSVC virtual base tables. // //===----------------------------------------------------------------------===// #include "MicrosoftVBTables.h" #include "CodeGenModule.h" #include "CGCXXABI.h" namespace clang { namespace CodeGen { /// Holds intermediate data about a path to a vbptr inside a base subobject. struct VBTablePath { VBTablePath(const VBTableInfo &VBInfo) : VBInfo(VBInfo), NextBase(VBInfo.VBPtrSubobject.getBase()) { } /// All the data needed to build a vbtable, minus the GlobalVariable whose /// name we haven't computed yet. VBTableInfo VBInfo; /// Next base to use for disambiguation. Can be null if we've already /// disambiguated this path once. const CXXRecordDecl *NextBase; /// Path is not really a full path like a CXXBasePath. It holds the subset of /// records that need to be mangled into the vbtable symbol name in order to get /// a unique name. llvm::SmallVector Path; }; VBTableBuilder::VBTableBuilder(CodeGenModule &CGM, const CXXRecordDecl *MostDerived) : CGM(CGM), MostDerived(MostDerived), DerivedLayout(CGM.getContext().getASTRecordLayout(MostDerived)) {} void VBTableBuilder::enumerateVBTables(VBTableVector &VBTables) { VBTablePathVector Paths; findUnambiguousPaths(MostDerived, BaseSubobject(MostDerived, CharUnits::Zero()), Paths); for (VBTablePathVector::iterator I = Paths.begin(), E = Paths.end(); I != E; ++I) { VBTablePath *P = *I; P->VBInfo.GV = getAddrOfVBTable(P->VBInfo.ReusingBase, P->Path); VBTables.push_back(P->VBInfo); } } void VBTableBuilder::findUnambiguousPaths(const CXXRecordDecl *ReusingBase, BaseSubobject CurSubobject, VBTablePathVector &Paths) { size_t PathsStart = Paths.size(); bool ReuseVBPtrFromBase = true; const CXXRecordDecl *CurBase = CurSubobject.getBase(); const ASTRecordLayout &Layout = CGM.getContext().getASTRecordLayout(CurBase); // If this base has a vbptr, then we've found a path. These are not full // paths, so we don't use CXXBasePath. if (Layout.hasOwnVBPtr()) { ReuseVBPtrFromBase = false; VBTablePath *Info = new VBTablePath( VBTableInfo(ReusingBase, CurSubobject, /*GV=*/0)); Paths.push_back(Info); } // Recurse onto any bases which themselves have virtual bases. for (CXXRecordDecl::base_class_const_iterator I = CurBase->bases_begin(), E = CurBase->bases_end(); I != E; ++I) { const CXXRecordDecl *Base = I->getType()->getAsCXXRecordDecl(); if (!Base->getNumVBases()) continue; // Bases without virtual bases have no vbptrs. CharUnits NextOffset; const CXXRecordDecl *NextReusingBase = Base; if (I->isVirtual()) { if (!VBasesSeen.insert(Base)) continue; // Don't visit virtual bases twice. NextOffset = DerivedLayout.getVBaseClassOffset(Base); } else { NextOffset = (CurSubobject.getBaseOffset() + Layout.getBaseClassOffset(Base)); // If CurBase didn't have a vbptr, then ReusingBase will reuse the vbptr // from the first non-virtual base with vbases for its vbptr. if (ReuseVBPtrFromBase) { NextReusingBase = ReusingBase; ReuseVBPtrFromBase = false; } } size_t NumPaths = Paths.size(); findUnambiguousPaths(NextReusingBase, BaseSubobject(Base, NextOffset), Paths); // Tag paths through this base with the base itself. We might use it to // disambiguate. for (size_t I = NumPaths, E = Paths.size(); I != E; ++I) Paths[I]->NextBase = Base; } bool AmbiguousPaths = rebucketPaths(Paths, PathsStart); if (AmbiguousPaths) rebucketPaths(Paths, PathsStart, /*SecondPass=*/true); #ifndef NDEBUG // Check that the paths are in fact unique. for (size_t I = PathsStart + 1, E = Paths.size(); I != E; ++I) { assert(Paths[I]->Path != Paths[I - 1]->Path && "vbtable paths are not unique"); } #endif } static bool pathCompare(VBTablePath *LHS, VBTablePath *RHS) { return LHS->Path < RHS->Path; } void VBTableBuilder::extendPath(VBTablePath *P, bool SecondPass) { assert(P->NextBase || SecondPass); if (P->NextBase) { P->Path.push_back(P->NextBase); P->NextBase = 0; // Prevent the path from being extended twice. } } bool VBTableBuilder::rebucketPaths(VBTablePathVector &Paths, size_t PathsStart, bool SecondPass) { // What we're essentially doing here is bucketing together ambiguous paths. // Any bucket with more than one path in it gets extended by NextBase, which // is usually the direct base of the inherited the vbptr. This code uses a // sorted vector to implement a multiset to form the buckets. Note that the // ordering is based on pointers, but it doesn't change our output order. The // current algorithm is designed to match MSVC 2012's names. // TODO: Implement MSVC 2010 or earlier names to avoid extra vbtable cruft. VBTablePathVector PathsSorted(&Paths[PathsStart], &Paths.back() + 1); std::sort(PathsSorted.begin(), PathsSorted.end(), pathCompare); bool AmbiguousPaths = false; for (size_t I = 0, E = PathsSorted.size(); I != E;) { // Scan forward to find the end of the bucket. size_t BucketStart = I; do { ++I; } while (I != E && PathsSorted[BucketStart]->Path == PathsSorted[I]->Path); // If this bucket has multiple paths, extend them all. if (I - BucketStart > 1) { AmbiguousPaths = true; for (size_t II = BucketStart; II != I; ++II) extendPath(PathsSorted[II], SecondPass); } } return AmbiguousPaths; } llvm::GlobalVariable * VBTableBuilder::getAddrOfVBTable(const CXXRecordDecl *ReusingBase, ArrayRef BasePath) { // Caching at this layer is redundant with the caching in EnumerateVBTables(). SmallString<256> OutName; llvm::raw_svector_ostream Out(OutName); MicrosoftMangleContext &Mangler = cast(CGM.getCXXABI().getMangleContext()); Mangler.mangleCXXVBTable(MostDerived, BasePath, Out); Out.flush(); StringRef Name = OutName.str(); llvm::ArrayType *VBTableType = llvm::ArrayType::get(CGM.IntTy, 1 + ReusingBase->getNumVBases()); assert(!CGM.getModule().getNamedGlobal(Name) && "vbtable with this name already exists: mangling bug?"); llvm::GlobalVariable *VBTable = CGM.CreateOrReplaceCXXRuntimeVariable(Name, VBTableType, llvm::GlobalValue::ExternalLinkage); VBTable->setUnnamedAddr(true); return VBTable; } void VBTableInfo::EmitVBTableDefinition( CodeGenModule &CGM, const CXXRecordDecl *RD, llvm::GlobalVariable::LinkageTypes Linkage) const { assert(RD->getNumVBases() && ReusingBase->getNumVBases() && "should only emit vbtables for classes with vbtables"); const ASTRecordLayout &BaseLayout = CGM.getContext().getASTRecordLayout(VBPtrSubobject.getBase()); const ASTRecordLayout &DerivedLayout = CGM.getContext().getASTRecordLayout(RD); SmallVector Offsets(1 + ReusingBase->getNumVBases(), 0); // The offset from ReusingBase's vbptr to itself always leads. CharUnits VBPtrOffset = BaseLayout.getVBPtrOffset(); Offsets[0] = llvm::ConstantInt::get(CGM.IntTy, -VBPtrOffset.getQuantity()); MicrosoftVTableContext &Context = CGM.getMicrosoftVTableContext(); for (CXXRecordDecl::base_class_const_iterator I = ReusingBase->vbases_begin(), E = ReusingBase->vbases_end(); I != E; ++I) { const CXXRecordDecl *VBase = I->getType()->getAsCXXRecordDecl(); CharUnits Offset = DerivedLayout.getVBaseClassOffset(VBase); assert(!Offset.isNegative()); // Make it relative to the subobject vbptr. Offset -= VBPtrSubobject.getBaseOffset() + VBPtrOffset; unsigned VBIndex = Context.getVBTableIndex(ReusingBase, VBase); assert(Offsets[VBIndex] == 0 && "The same vbindex seen twice?"); Offsets[VBIndex] = llvm::ConstantInt::get(CGM.IntTy, Offset.getQuantity()); } assert(Offsets.size() == cast(cast(GV->getType()) ->getElementType())->getNumElements()); llvm::ArrayType *VBTableType = llvm::ArrayType::get(CGM.IntTy, Offsets.size()); llvm::Constant *Init = llvm::ConstantArray::get(VBTableType, Offsets); GV->setInitializer(Init); // Set the correct linkage. GV->setLinkage(Linkage); // Set the right visibility. CGM.setTypeVisibility(GV, RD, CodeGenModule::TVK_ForVTable); } } // namespace CodeGen } // namespace clang @ 1.1.1.1 log @Import Clang 3.4rc1 r195771. @ text @@ 1.1.1.1.2.1 log @Rebase. @ text @@ 1.1.1.2 log @Mark files without clang-209886 tag as dead. @ text @@ 1.1.1.1.4.1 log @file MicrosoftVBTables.cpp was added on branch yamt-pagecache on 2014-05-22 16:18:27 +0000 @ text @d1 233 @ 1.1.1.1.4.2 log @sync with head. for a reference, the tree before this commit was tagged as yamt-pagecache-tag8. this commit was splitted into small chunks to avoid a limitation of cvs. ("Protocol error: too many arguments") @ text @a0 233 //===--- MicrosoftVBTables.cpp - Virtual Base Table Emission --------------===// // // The LLVM Compiler Infrastructure // // This file is distributed under the University of Illinois Open Source // License. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// // // This class generates data about MSVC virtual base tables. // //===----------------------------------------------------------------------===// #include "MicrosoftVBTables.h" #include "CodeGenModule.h" #include "CGCXXABI.h" namespace clang { namespace CodeGen { /// Holds intermediate data about a path to a vbptr inside a base subobject. struct VBTablePath { VBTablePath(const VBTableInfo &VBInfo) : VBInfo(VBInfo), NextBase(VBInfo.VBPtrSubobject.getBase()) { } /// All the data needed to build a vbtable, minus the GlobalVariable whose /// name we haven't computed yet. VBTableInfo VBInfo; /// Next base to use for disambiguation. Can be null if we've already /// disambiguated this path once. const CXXRecordDecl *NextBase; /// Path is not really a full path like a CXXBasePath. It holds the subset of /// records that need to be mangled into the vbtable symbol name in order to get /// a unique name. llvm::SmallVector Path; }; VBTableBuilder::VBTableBuilder(CodeGenModule &CGM, const CXXRecordDecl *MostDerived) : CGM(CGM), MostDerived(MostDerived), DerivedLayout(CGM.getContext().getASTRecordLayout(MostDerived)) {} void VBTableBuilder::enumerateVBTables(VBTableVector &VBTables) { VBTablePathVector Paths; findUnambiguousPaths(MostDerived, BaseSubobject(MostDerived, CharUnits::Zero()), Paths); for (VBTablePathVector::iterator I = Paths.begin(), E = Paths.end(); I != E; ++I) { VBTablePath *P = *I; P->VBInfo.GV = getAddrOfVBTable(P->VBInfo.ReusingBase, P->Path); VBTables.push_back(P->VBInfo); } } void VBTableBuilder::findUnambiguousPaths(const CXXRecordDecl *ReusingBase, BaseSubobject CurSubobject, VBTablePathVector &Paths) { size_t PathsStart = Paths.size(); bool ReuseVBPtrFromBase = true; const CXXRecordDecl *CurBase = CurSubobject.getBase(); const ASTRecordLayout &Layout = CGM.getContext().getASTRecordLayout(CurBase); // If this base has a vbptr, then we've found a path. These are not full // paths, so we don't use CXXBasePath. if (Layout.hasOwnVBPtr()) { ReuseVBPtrFromBase = false; VBTablePath *Info = new VBTablePath( VBTableInfo(ReusingBase, CurSubobject, /*GV=*/0)); Paths.push_back(Info); } // Recurse onto any bases which themselves have virtual bases. for (CXXRecordDecl::base_class_const_iterator I = CurBase->bases_begin(), E = CurBase->bases_end(); I != E; ++I) { const CXXRecordDecl *Base = I->getType()->getAsCXXRecordDecl(); if (!Base->getNumVBases()) continue; // Bases without virtual bases have no vbptrs. CharUnits NextOffset; const CXXRecordDecl *NextReusingBase = Base; if (I->isVirtual()) { if (!VBasesSeen.insert(Base)) continue; // Don't visit virtual bases twice. NextOffset = DerivedLayout.getVBaseClassOffset(Base); } else { NextOffset = (CurSubobject.getBaseOffset() + Layout.getBaseClassOffset(Base)); // If CurBase didn't have a vbptr, then ReusingBase will reuse the vbptr // from the first non-virtual base with vbases for its vbptr. if (ReuseVBPtrFromBase) { NextReusingBase = ReusingBase; ReuseVBPtrFromBase = false; } } size_t NumPaths = Paths.size(); findUnambiguousPaths(NextReusingBase, BaseSubobject(Base, NextOffset), Paths); // Tag paths through this base with the base itself. We might use it to // disambiguate. for (size_t I = NumPaths, E = Paths.size(); I != E; ++I) Paths[I]->NextBase = Base; } bool AmbiguousPaths = rebucketPaths(Paths, PathsStart); if (AmbiguousPaths) rebucketPaths(Paths, PathsStart, /*SecondPass=*/true); #ifndef NDEBUG // Check that the paths are in fact unique. for (size_t I = PathsStart + 1, E = Paths.size(); I != E; ++I) { assert(Paths[I]->Path != Paths[I - 1]->Path && "vbtable paths are not unique"); } #endif } static bool pathCompare(VBTablePath *LHS, VBTablePath *RHS) { return LHS->Path < RHS->Path; } void VBTableBuilder::extendPath(VBTablePath *P, bool SecondPass) { assert(P->NextBase || SecondPass); if (P->NextBase) { P->Path.push_back(P->NextBase); P->NextBase = 0; // Prevent the path from being extended twice. } } bool VBTableBuilder::rebucketPaths(VBTablePathVector &Paths, size_t PathsStart, bool SecondPass) { // What we're essentially doing here is bucketing together ambiguous paths. // Any bucket with more than one path in it gets extended by NextBase, which // is usually the direct base of the inherited the vbptr. This code uses a // sorted vector to implement a multiset to form the buckets. Note that the // ordering is based on pointers, but it doesn't change our output order. The // current algorithm is designed to match MSVC 2012's names. // TODO: Implement MSVC 2010 or earlier names to avoid extra vbtable cruft. VBTablePathVector PathsSorted(&Paths[PathsStart], &Paths.back() + 1); std::sort(PathsSorted.begin(), PathsSorted.end(), pathCompare); bool AmbiguousPaths = false; for (size_t I = 0, E = PathsSorted.size(); I != E;) { // Scan forward to find the end of the bucket. size_t BucketStart = I; do { ++I; } while (I != E && PathsSorted[BucketStart]->Path == PathsSorted[I]->Path); // If this bucket has multiple paths, extend them all. if (I - BucketStart > 1) { AmbiguousPaths = true; for (size_t II = BucketStart; II != I; ++II) extendPath(PathsSorted[II], SecondPass); } } return AmbiguousPaths; } llvm::GlobalVariable * VBTableBuilder::getAddrOfVBTable(const CXXRecordDecl *ReusingBase, ArrayRef BasePath) { // Caching at this layer is redundant with the caching in EnumerateVBTables(). SmallString<256> OutName; llvm::raw_svector_ostream Out(OutName); MicrosoftMangleContext &Mangler = cast(CGM.getCXXABI().getMangleContext()); Mangler.mangleCXXVBTable(MostDerived, BasePath, Out); Out.flush(); StringRef Name = OutName.str(); llvm::ArrayType *VBTableType = llvm::ArrayType::get(CGM.IntTy, 1 + ReusingBase->getNumVBases()); assert(!CGM.getModule().getNamedGlobal(Name) && "vbtable with this name already exists: mangling bug?"); llvm::GlobalVariable *VBTable = CGM.CreateOrReplaceCXXRuntimeVariable(Name, VBTableType, llvm::GlobalValue::ExternalLinkage); VBTable->setUnnamedAddr(true); return VBTable; } void VBTableInfo::EmitVBTableDefinition( CodeGenModule &CGM, const CXXRecordDecl *RD, llvm::GlobalVariable::LinkageTypes Linkage) const { assert(RD->getNumVBases() && ReusingBase->getNumVBases() && "should only emit vbtables for classes with vbtables"); const ASTRecordLayout &BaseLayout = CGM.getContext().getASTRecordLayout(VBPtrSubobject.getBase()); const ASTRecordLayout &DerivedLayout = CGM.getContext().getASTRecordLayout(RD); SmallVector Offsets(1 + ReusingBase->getNumVBases(), 0); // The offset from ReusingBase's vbptr to itself always leads. CharUnits VBPtrOffset = BaseLayout.getVBPtrOffset(); Offsets[0] = llvm::ConstantInt::get(CGM.IntTy, -VBPtrOffset.getQuantity()); MicrosoftVTableContext &Context = CGM.getMicrosoftVTableContext(); for (CXXRecordDecl::base_class_const_iterator I = ReusingBase->vbases_begin(), E = ReusingBase->vbases_end(); I != E; ++I) { const CXXRecordDecl *VBase = I->getType()->getAsCXXRecordDecl(); CharUnits Offset = DerivedLayout.getVBaseClassOffset(VBase); assert(!Offset.isNegative()); // Make it relative to the subobject vbptr. Offset -= VBPtrSubobject.getBaseOffset() + VBPtrOffset; unsigned VBIndex = Context.getVBTableIndex(ReusingBase, VBase); assert(Offsets[VBIndex] == 0 && "The same vbindex seen twice?"); Offsets[VBIndex] = llvm::ConstantInt::get(CGM.IntTy, Offset.getQuantity()); } assert(Offsets.size() == cast(cast(GV->getType()) ->getElementType())->getNumElements()); llvm::ArrayType *VBTableType = llvm::ArrayType::get(CGM.IntTy, Offsets.size()); llvm::Constant *Init = llvm::ConstantArray::get(VBTableType, Offsets); GV->setInitializer(Init); // Set the correct linkage. GV->setLinkage(Linkage); // Set the right visibility. CGM.setTypeVisibility(GV, RD, CodeGenModule::TVK_ForVTable); } } // namespace CodeGen } // namespace clang @