blob: bfab96a1ddb9536280e2e456837c7925c6598e54 [file] [log] [blame]
Peter Collingbourne1398a322016-12-16 00:26:30 +00001//===- ThinLTOBitcodeWriter.cpp - Bitcode writing pass for ThinLTO --------===//
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//===----------------------------------------------------------------------===//
Peter Collingbourne1398a322016-12-16 00:26:30 +00009
Tim Shen6b4114182017-06-01 01:02:12 +000010#include "llvm/Transforms/IPO/ThinLTOBitcodeWriter.h"
Peter Collingbourne002c2d52017-02-14 03:42:38 +000011#include "llvm/Analysis/BasicAliasAnalysis.h"
Peter Collingbourne1398a322016-12-16 00:26:30 +000012#include "llvm/Analysis/ModuleSummaryAnalysis.h"
Teresa Johnson94624ac2017-05-10 18:52:16 +000013#include "llvm/Analysis/ProfileSummaryInfo.h"
Peter Collingbourne1398a322016-12-16 00:26:30 +000014#include "llvm/Analysis/TypeMetadataUtils.h"
15#include "llvm/Bitcode/BitcodeWriter.h"
16#include "llvm/IR/Constants.h"
Peter Collingbourne28ffd322017-02-08 20:44:00 +000017#include "llvm/IR/DebugInfo.h"
Peter Collingbourne1398a322016-12-16 00:26:30 +000018#include "llvm/IR/Intrinsics.h"
19#include "llvm/IR/Module.h"
20#include "llvm/IR/PassManager.h"
Vlad Tsyrklevich230b2562018-04-20 01:36:48 +000021#include "llvm/Object/ModuleSymbolTable.h"
Peter Collingbourne1398a322016-12-16 00:26:30 +000022#include "llvm/Pass.h"
23#include "llvm/Support/ScopedPrinter.h"
Teresa Johnson0c6a4ff2017-03-23 19:47:39 +000024#include "llvm/Support/raw_ostream.h"
25#include "llvm/Transforms/IPO.h"
Peter Collingbourne002c2d52017-02-14 03:42:38 +000026#include "llvm/Transforms/IPO/FunctionAttrs.h"
George Rimard3704f62018-02-08 07:23:24 +000027#include "llvm/Transforms/IPO/FunctionImport.h"
Peter Collingbourne1398a322016-12-16 00:26:30 +000028#include "llvm/Transforms/Utils/Cloning.h"
Evgeniy Stepanov964f4662017-04-27 20:27:27 +000029#include "llvm/Transforms/Utils/ModuleUtils.h"
Peter Collingbourne1398a322016-12-16 00:26:30 +000030using namespace llvm;
31
32namespace {
33
Peter Collingbourne1398a322016-12-16 00:26:30 +000034// Promote each local-linkage entity defined by ExportM and used by ImportM by
35// changing visibility and appending the given ModuleId.
Evgeniy Stepanov4d4ee932017-06-16 00:18:29 +000036void promoteInternals(Module &ExportM, Module &ImportM, StringRef ModuleId,
37 SetVector<GlobalValue *> &PromoteExtra) {
Bob Haarman4075ccc2017-04-12 01:43:07 +000038 DenseMap<const Comdat *, Comdat *> RenamedComdats;
Peter Collingbourne6b193962017-03-30 23:43:08 +000039 for (auto &ExportGV : ExportM.global_values()) {
Peter Collingbourne1398a322016-12-16 00:26:30 +000040 if (!ExportGV.hasLocalLinkage())
Peter Collingbourne6b193962017-03-30 23:43:08 +000041 continue;
Peter Collingbourne1398a322016-12-16 00:26:30 +000042
Bob Haarman4075ccc2017-04-12 01:43:07 +000043 auto Name = ExportGV.getName();
Peter Collingbourne1f034222017-11-30 23:05:52 +000044 GlobalValue *ImportGV = nullptr;
45 if (!PromoteExtra.count(&ExportGV)) {
46 ImportGV = ImportM.getNamedValue(Name);
47 if (!ImportGV)
48 continue;
49 ImportGV->removeDeadConstantUsers();
50 if (ImportGV->use_empty()) {
51 ImportGV->eraseFromParent();
52 continue;
53 }
54 }
Peter Collingbourne1398a322016-12-16 00:26:30 +000055
Bob Haarman4075ccc2017-04-12 01:43:07 +000056 std::string NewName = (Name + ModuleId).str();
57
58 if (const auto *C = ExportGV.getComdat())
59 if (C->getName() == Name)
60 RenamedComdats.try_emplace(C, ExportM.getOrInsertComdat(NewName));
Peter Collingbourne1398a322016-12-16 00:26:30 +000061
62 ExportGV.setName(NewName);
63 ExportGV.setLinkage(GlobalValue::ExternalLinkage);
64 ExportGV.setVisibility(GlobalValue::HiddenVisibility);
65
Evgeniy Stepanov4d4ee932017-06-16 00:18:29 +000066 if (ImportGV) {
67 ImportGV->setName(NewName);
68 ImportGV->setVisibility(GlobalValue::HiddenVisibility);
69 }
Peter Collingbourne6b193962017-03-30 23:43:08 +000070 }
Bob Haarman4075ccc2017-04-12 01:43:07 +000071
72 if (!RenamedComdats.empty())
73 for (auto &GO : ExportM.global_objects())
74 if (auto *C = GO.getComdat()) {
75 auto Replacement = RenamedComdats.find(C);
76 if (Replacement != RenamedComdats.end())
77 GO.setComdat(Replacement->second);
78 }
Peter Collingbourne1398a322016-12-16 00:26:30 +000079}
80
81// Promote all internal (i.e. distinct) type ids used by the module by replacing
82// them with external type ids formed using the module id.
83//
84// Note that this needs to be done before we clone the module because each clone
85// will receive its own set of distinct metadata nodes.
86void promoteTypeIds(Module &M, StringRef ModuleId) {
87 DenseMap<Metadata *, Metadata *> LocalToGlobal;
88 auto ExternalizeTypeId = [&](CallInst *CI, unsigned ArgNo) {
89 Metadata *MD =
90 cast<MetadataAsValue>(CI->getArgOperand(ArgNo))->getMetadata();
91
92 if (isa<MDNode>(MD) && cast<MDNode>(MD)->isDistinct()) {
93 Metadata *&GlobalMD = LocalToGlobal[MD];
94 if (!GlobalMD) {
Benjamin Kramer3a13ed62017-12-28 16:58:54 +000095 std::string NewName = (Twine(LocalToGlobal.size()) + ModuleId).str();
Peter Collingbourne1398a322016-12-16 00:26:30 +000096 GlobalMD = MDString::get(M.getContext(), NewName);
97 }
98
99 CI->setArgOperand(ArgNo,
100 MetadataAsValue::get(M.getContext(), GlobalMD));
101 }
102 };
103
104 if (Function *TypeTestFunc =
105 M.getFunction(Intrinsic::getName(Intrinsic::type_test))) {
106 for (const Use &U : TypeTestFunc->uses()) {
107 auto CI = cast<CallInst>(U.getUser());
108 ExternalizeTypeId(CI, 1);
109 }
110 }
111
112 if (Function *TypeCheckedLoadFunc =
113 M.getFunction(Intrinsic::getName(Intrinsic::type_checked_load))) {
114 for (const Use &U : TypeCheckedLoadFunc->uses()) {
115 auto CI = cast<CallInst>(U.getUser());
116 ExternalizeTypeId(CI, 2);
117 }
118 }
119
120 for (GlobalObject &GO : M.global_objects()) {
121 SmallVector<MDNode *, 1> MDs;
122 GO.getMetadata(LLVMContext::MD_type, MDs);
123
124 GO.eraseMetadata(LLVMContext::MD_type);
125 for (auto MD : MDs) {
126 auto I = LocalToGlobal.find(MD->getOperand(1));
127 if (I == LocalToGlobal.end()) {
128 GO.addMetadata(LLVMContext::MD_type, *MD);
129 continue;
130 }
131 GO.addMetadata(
132 LLVMContext::MD_type,
Benjamin Kramer0deb9a92018-05-31 13:29:58 +0000133 *MDNode::get(M.getContext(), {MD->getOperand(0), I->second}));
Peter Collingbourne1398a322016-12-16 00:26:30 +0000134 }
135 }
136}
137
138// Drop unused globals, and drop type information from function declarations.
139// FIXME: If we made functions typeless then there would be no need to do this.
140void simplifyExternals(Module &M) {
141 FunctionType *EmptyFT =
142 FunctionType::get(Type::getVoidTy(M.getContext()), false);
143
144 for (auto I = M.begin(), E = M.end(); I != E;) {
145 Function &F = *I++;
146 if (F.isDeclaration() && F.use_empty()) {
147 F.eraseFromParent();
148 continue;
149 }
150
Peter Collingbourne93fdaca2017-07-19 17:54:29 +0000151 if (!F.isDeclaration() || F.getFunctionType() == EmptyFT ||
152 // Changing the type of an intrinsic may invalidate the IR.
153 F.getName().startswith("llvm."))
Peter Collingbourne1398a322016-12-16 00:26:30 +0000154 continue;
155
156 Function *NewF =
157 Function::Create(EmptyFT, GlobalValue::ExternalLinkage, "", &M);
158 NewF->setVisibility(F.getVisibility());
159 NewF->takeName(&F);
160 F.replaceAllUsesWith(ConstantExpr::getBitCast(NewF, F.getType()));
161 F.eraseFromParent();
162 }
163
164 for (auto I = M.global_begin(), E = M.global_end(); I != E;) {
165 GlobalVariable &GV = *I++;
166 if (GV.isDeclaration() && GV.use_empty()) {
167 GV.eraseFromParent();
168 continue;
169 }
170 }
171}
172
George Rimard3704f62018-02-08 07:23:24 +0000173static void
174filterModule(Module *M,
175 function_ref<bool(const GlobalValue *)> ShouldKeepDefinition) {
176 std::vector<GlobalValue *> V;
177 for (GlobalValue &GV : M->global_values())
178 if (!ShouldKeepDefinition(&GV))
179 V.push_back(&GV);
George Rimar54565242018-02-07 08:46:36 +0000180
George Rimard3704f62018-02-08 07:23:24 +0000181 for (GlobalValue *GV : V)
182 if (!convertToDeclaration(*GV))
183 GV->eraseFromParent();
Peter Collingbourne1398a322016-12-16 00:26:30 +0000184}
185
Peter Collingbourne002c2d52017-02-14 03:42:38 +0000186void forEachVirtualFunction(Constant *C, function_ref<void(Function *)> Fn) {
187 if (auto *F = dyn_cast<Function>(C))
188 return Fn(F);
Peter Collingbourne3baa72a2017-03-02 23:10:17 +0000189 if (isa<GlobalValue>(C))
190 return;
Peter Collingbourne002c2d52017-02-14 03:42:38 +0000191 for (Value *Op : C->operands())
192 forEachVirtualFunction(cast<Constant>(Op), Fn);
193}
194
Peter Collingbourne1398a322016-12-16 00:26:30 +0000195// If it's possible to split M into regular and thin LTO parts, do so and write
196// a multi-module bitcode file with the two parts to OS. Otherwise, write only a
197// regular LTO bitcode file to OS.
Peter Collingbourne002c2d52017-02-14 03:42:38 +0000198void splitAndWriteThinLTOBitcode(
Teresa Johnson0c6a4ff2017-03-23 19:47:39 +0000199 raw_ostream &OS, raw_ostream *ThinLinkOS,
200 function_ref<AAResults &(Function &)> AARGetter, Module &M) {
Evgeniy Stepanov964f4662017-04-27 20:27:27 +0000201 std::string ModuleId = getUniqueModuleId(&M);
Peter Collingbourne1398a322016-12-16 00:26:30 +0000202 if (ModuleId.empty()) {
Vlad Tsyrklevich6867ab72018-06-01 15:20:47 +0000203 // We couldn't generate a module ID for this module, write it out as a
204 // regular LTO module with an index for summary-based dead stripping.
205 ProfileSummaryInfo PSI(M);
206 M.addModuleFlag(Module::Error, "ThinLTO", uint32_t(0));
207 ModuleSummaryIndex Index = buildModuleSummaryIndex(M, nullptr, &PSI);
208 WriteBitcodeToFile(M, OS, /*ShouldPreserveUseListOrder=*/false, &Index);
209
Teresa Johnson0c6a4ff2017-03-23 19:47:39 +0000210 if (ThinLinkOS)
211 // We don't have a ThinLTO part, but still write the module to the
212 // ThinLinkOS if requested so that the expected output file is produced.
Vlad Tsyrklevich6867ab72018-06-01 15:20:47 +0000213 WriteBitcodeToFile(M, *ThinLinkOS, /*ShouldPreserveUseListOrder=*/false,
214 &Index);
215
Peter Collingbourne1398a322016-12-16 00:26:30 +0000216 return;
217 }
218
219 promoteTypeIds(M, ModuleId);
220
Peter Collingbourne002c2d52017-02-14 03:42:38 +0000221 // Returns whether a global has attached type metadata. Such globals may
222 // participate in CFI or whole-program devirtualization, so they need to
223 // appear in the merged module instead of the thin LTO module.
Benjamin Kramer0deb9a92018-05-31 13:29:58 +0000224 auto HasTypeMetadata = [](const GlobalObject *GO) {
225 return GO->hasMetadata(LLVMContext::MD_type);
Peter Collingbourne1398a322016-12-16 00:26:30 +0000226 };
227
Peter Collingbourne002c2d52017-02-14 03:42:38 +0000228 // Collect the set of virtual functions that are eligible for virtual constant
229 // propagation. Each eligible function must not access memory, must return
230 // an integer of width <=64 bits, must take at least one argument, must not
231 // use its first argument (assumed to be "this") and all arguments other than
232 // the first one must be of <=64 bit integer type.
233 //
234 // Note that we test whether this copy of the function is readnone, rather
235 // than testing function attributes, which must hold for any copy of the
236 // function, even a less optimized version substituted at link time. This is
237 // sound because the virtual constant propagation optimizations effectively
238 // inline all implementations of the virtual function into each call site,
239 // rather than using function attributes to perform local optimization.
George Burgess IVaa09a822018-08-27 22:10:59 +0000240 DenseSet<const Function *> EligibleVirtualFns;
Bob Haarman4075ccc2017-04-12 01:43:07 +0000241 // If any member of a comdat lives in MergedM, put all members of that
242 // comdat in MergedM to keep the comdat together.
243 DenseSet<const Comdat *> MergedMComdats;
Peter Collingbourne002c2d52017-02-14 03:42:38 +0000244 for (GlobalVariable &GV : M.globals())
Bob Haarman4075ccc2017-04-12 01:43:07 +0000245 if (HasTypeMetadata(&GV)) {
246 if (const auto *C = GV.getComdat())
247 MergedMComdats.insert(C);
Peter Collingbourne002c2d52017-02-14 03:42:38 +0000248 forEachVirtualFunction(GV.getInitializer(), [&](Function *F) {
249 auto *RT = dyn_cast<IntegerType>(F->getReturnType());
250 if (!RT || RT->getBitWidth() > 64 || F->arg_empty() ||
251 !F->arg_begin()->use_empty())
252 return;
253 for (auto &Arg : make_range(std::next(F->arg_begin()), F->arg_end())) {
254 auto *ArgT = dyn_cast<IntegerType>(Arg.getType());
255 if (!ArgT || ArgT->getBitWidth() > 64)
256 return;
257 }
Chandler Carruth01f0c8a2017-07-11 05:39:20 +0000258 if (!F->isDeclaration() &&
259 computeFunctionBodyMemoryAccess(*F, AARGetter(*F)) == MAK_ReadNone)
Peter Collingbourne002c2d52017-02-14 03:42:38 +0000260 EligibleVirtualFns.insert(F);
261 });
Bob Haarman4075ccc2017-04-12 01:43:07 +0000262 }
Peter Collingbourne002c2d52017-02-14 03:42:38 +0000263
Peter Collingbourne1398a322016-12-16 00:26:30 +0000264 ValueToValueMapTy VMap;
Peter Collingbourne002c2d52017-02-14 03:42:38 +0000265 std::unique_ptr<Module> MergedM(
Rafael Espindola71867532018-02-14 19:50:40 +0000266 CloneModule(M, VMap, [&](const GlobalValue *GV) -> bool {
Bob Haarman4075ccc2017-04-12 01:43:07 +0000267 if (const auto *C = GV->getComdat())
268 if (MergedMComdats.count(C))
269 return true;
Peter Collingbourne002c2d52017-02-14 03:42:38 +0000270 if (auto *F = dyn_cast<Function>(GV))
271 return EligibleVirtualFns.count(F);
272 if (auto *GVar = dyn_cast_or_null<GlobalVariable>(GV->getBaseObject()))
273 return HasTypeMetadata(GVar);
274 return false;
275 }));
Peter Collingbourne28ffd322017-02-08 20:44:00 +0000276 StripDebugInfo(*MergedM);
Peter Collingbourne29c6f482018-02-06 03:29:18 +0000277 MergedM->setModuleInlineAsm("");
Peter Collingbourne1398a322016-12-16 00:26:30 +0000278
Peter Collingbourne002c2d52017-02-14 03:42:38 +0000279 for (Function &F : *MergedM)
280 if (!F.isDeclaration()) {
281 // Reset the linkage of all functions eligible for virtual constant
282 // propagation. The canonical definitions live in the thin LTO module so
283 // that they can be imported.
284 F.setLinkage(GlobalValue::AvailableExternallyLinkage);
285 F.setComdat(nullptr);
286 }
287
Evgeniy Stepanov4d4ee932017-06-16 00:18:29 +0000288 SetVector<GlobalValue *> CfiFunctions;
289 for (auto &F : M)
290 if ((!F.hasLocalLinkage() || F.hasAddressTaken()) && HasTypeMetadata(&F))
291 CfiFunctions.insert(&F);
292
Bob Haarman4075ccc2017-04-12 01:43:07 +0000293 // Remove all globals with type metadata, globals with comdats that live in
294 // MergedM, and aliases pointing to such globals from the thin LTO module.
Peter Collingbourne002c2d52017-02-14 03:42:38 +0000295 filterModule(&M, [&](const GlobalValue *GV) {
296 if (auto *GVar = dyn_cast_or_null<GlobalVariable>(GV->getBaseObject()))
Bob Haarman4075ccc2017-04-12 01:43:07 +0000297 if (HasTypeMetadata(GVar))
298 return false;
299 if (const auto *C = GV->getComdat())
300 if (MergedMComdats.count(C))
301 return false;
Peter Collingbourne002c2d52017-02-14 03:42:38 +0000302 return true;
303 });
Peter Collingbourne1398a322016-12-16 00:26:30 +0000304
Evgeniy Stepanov4d4ee932017-06-16 00:18:29 +0000305 promoteInternals(*MergedM, M, ModuleId, CfiFunctions);
306 promoteInternals(M, *MergedM, ModuleId, CfiFunctions);
307
Vlad Tsyrklevich230b2562018-04-20 01:36:48 +0000308 auto &Ctx = MergedM->getContext();
Evgeniy Stepanov4d4ee932017-06-16 00:18:29 +0000309 SmallVector<MDNode *, 8> CfiFunctionMDs;
310 for (auto V : CfiFunctions) {
311 Function &F = *cast<Function>(V);
312 SmallVector<MDNode *, 2> Types;
313 F.getMetadata(LLVMContext::MD_type, Types);
314
Evgeniy Stepanov4d4ee932017-06-16 00:18:29 +0000315 SmallVector<Metadata *, 4> Elts;
316 Elts.push_back(MDString::get(Ctx, F.getName()));
317 CfiFunctionLinkage Linkage;
318 if (!F.isDeclarationForLinker())
319 Linkage = CFL_Definition;
320 else if (F.isWeakForLinker())
321 Linkage = CFL_WeakDeclaration;
322 else
323 Linkage = CFL_Declaration;
324 Elts.push_back(ConstantAsMetadata::get(
325 llvm::ConstantInt::get(Type::getInt8Ty(Ctx), Linkage)));
326 for (auto Type : Types)
327 Elts.push_back(Type);
328 CfiFunctionMDs.push_back(MDTuple::get(Ctx, Elts));
329 }
330
331 if(!CfiFunctionMDs.empty()) {
332 NamedMDNode *NMD = MergedM->getOrInsertNamedMetadata("cfi.functions");
333 for (auto MD : CfiFunctionMDs)
334 NMD->addOperand(MD);
335 }
Peter Collingbourne1398a322016-12-16 00:26:30 +0000336
Vlad Tsyrklevichcdec22e2018-01-10 00:00:51 +0000337 SmallVector<MDNode *, 8> FunctionAliases;
338 for (auto &A : M.aliases()) {
339 if (!isa<Function>(A.getAliasee()))
340 continue;
341
342 auto *F = cast<Function>(A.getAliasee());
Vlad Tsyrklevichcdec22e2018-01-10 00:00:51 +0000343
Benjamin Kramer0deb9a92018-05-31 13:29:58 +0000344 Metadata *Elts[] = {
345 MDString::get(Ctx, A.getName()),
346 MDString::get(Ctx, F->getName()),
347 ConstantAsMetadata::get(
348 ConstantInt::get(Type::getInt8Ty(Ctx), A.getVisibility())),
349 ConstantAsMetadata::get(
350 ConstantInt::get(Type::getInt8Ty(Ctx), A.isWeakForLinker())),
351 };
Vlad Tsyrklevichcdec22e2018-01-10 00:00:51 +0000352
353 FunctionAliases.push_back(MDTuple::get(Ctx, Elts));
354 }
355
356 if (!FunctionAliases.empty()) {
357 NamedMDNode *NMD = MergedM->getOrInsertNamedMetadata("aliases");
358 for (auto MD : FunctionAliases)
359 NMD->addOperand(MD);
360 }
361
Vlad Tsyrklevich230b2562018-04-20 01:36:48 +0000362 SmallVector<MDNode *, 8> Symvers;
363 ModuleSymbolTable::CollectAsmSymvers(M, [&](StringRef Name, StringRef Alias) {
364 Function *F = M.getFunction(Name);
365 if (!F || F->use_empty())
366 return;
367
Benjamin Kramer0deb9a92018-05-31 13:29:58 +0000368 Symvers.push_back(MDTuple::get(
369 Ctx, {MDString::get(Ctx, Name), MDString::get(Ctx, Alias)}));
Vlad Tsyrklevich230b2562018-04-20 01:36:48 +0000370 });
371
372 if (!Symvers.empty()) {
373 NamedMDNode *NMD = MergedM->getOrInsertNamedMetadata("symvers");
374 for (auto MD : Symvers)
375 NMD->addOperand(MD);
376 }
377
Peter Collingbourne1398a322016-12-16 00:26:30 +0000378 simplifyExternals(*MergedM);
379
Peter Collingbourne1398a322016-12-16 00:26:30 +0000380 // FIXME: Try to re-use BSI and PFI from the original module here.
Teresa Johnson94624ac2017-05-10 18:52:16 +0000381 ProfileSummaryInfo PSI(M);
382 ModuleSummaryIndex Index = buildModuleSummaryIndex(M, nullptr, &PSI);
Teresa Johnson0c6a4ff2017-03-23 19:47:39 +0000383
Peter Collingbournee357fbd2017-06-08 23:01:49 +0000384 // Mark the merged module as requiring full LTO. We still want an index for
385 // it though, so that it can participate in summary-based dead stripping.
386 MergedM->addModuleFlag(Module::Error, "ThinLTO", uint32_t(0));
387 ModuleSummaryIndex MergedMIndex =
388 buildModuleSummaryIndex(*MergedM, nullptr, &PSI);
389
Teresa Johnson0c6a4ff2017-03-23 19:47:39 +0000390 SmallVector<char, 0> Buffer;
391
392 BitcodeWriter W(Buffer);
393 // Save the module hash produced for the full bitcode, which will
394 // be used in the backends, and use that in the minimized bitcode
395 // produced for the full link.
396 ModuleHash ModHash = {{0}};
Rafael Espindola6a86e252018-02-14 19:11:32 +0000397 W.writeModule(M, /*ShouldPreserveUseListOrder=*/false, &Index,
Teresa Johnson0c6a4ff2017-03-23 19:47:39 +0000398 /*GenerateHash=*/true, &ModHash);
Rafael Espindola6a86e252018-02-14 19:11:32 +0000399 W.writeModule(*MergedM, /*ShouldPreserveUseListOrder=*/false, &MergedMIndex);
Peter Collingbourne92648c22017-06-27 23:50:11 +0000400 W.writeSymtab();
Peter Collingbournea0f371a2017-04-17 17:51:36 +0000401 W.writeStrtab();
Peter Collingbourne1398a322016-12-16 00:26:30 +0000402 OS << Buffer;
Teresa Johnson0c6a4ff2017-03-23 19:47:39 +0000403
Haojie Wang1dec57d2017-07-21 17:25:20 +0000404 // If a minimized bitcode module was requested for the thin link, only
405 // the information that is needed by thin link will be written in the
406 // given OS (the merged module will be written as usual).
Teresa Johnson0c6a4ff2017-03-23 19:47:39 +0000407 if (ThinLinkOS) {
408 Buffer.clear();
409 BitcodeWriter W2(Buffer);
410 StripDebugInfo(M);
Rafael Espindola6a86e252018-02-14 19:11:32 +0000411 W2.writeThinLinkBitcode(M, Index, ModHash);
412 W2.writeModule(*MergedM, /*ShouldPreserveUseListOrder=*/false,
Peter Collingbournee357fbd2017-06-08 23:01:49 +0000413 &MergedMIndex);
Peter Collingbourne92648c22017-06-27 23:50:11 +0000414 W2.writeSymtab();
Peter Collingbournea0f371a2017-04-17 17:51:36 +0000415 W2.writeStrtab();
Teresa Johnson0c6a4ff2017-03-23 19:47:39 +0000416 *ThinLinkOS << Buffer;
417 }
Peter Collingbourne1398a322016-12-16 00:26:30 +0000418}
419
420// Returns whether this module needs to be split because it uses type metadata.
421bool requiresSplit(Module &M) {
Peter Collingbourne1398a322016-12-16 00:26:30 +0000422 for (auto &GO : M.global_objects()) {
Benjamin Kramer0deb9a92018-05-31 13:29:58 +0000423 if (GO.hasMetadata(LLVMContext::MD_type))
Peter Collingbourne1398a322016-12-16 00:26:30 +0000424 return true;
425 }
426
427 return false;
428}
429
Teresa Johnson0c6a4ff2017-03-23 19:47:39 +0000430void writeThinLTOBitcode(raw_ostream &OS, raw_ostream *ThinLinkOS,
Peter Collingbourne002c2d52017-02-14 03:42:38 +0000431 function_ref<AAResults &(Function &)> AARGetter,
432 Module &M, const ModuleSummaryIndex *Index) {
Peter Collingbourne1398a322016-12-16 00:26:30 +0000433 // See if this module has any type metadata. If so, we need to split it.
434 if (requiresSplit(M))
Teresa Johnson0c6a4ff2017-03-23 19:47:39 +0000435 return splitAndWriteThinLTOBitcode(OS, ThinLinkOS, AARGetter, M);
Peter Collingbourne1398a322016-12-16 00:26:30 +0000436
437 // Otherwise we can just write it out as a regular module.
Teresa Johnson0c6a4ff2017-03-23 19:47:39 +0000438
439 // Save the module hash produced for the full bitcode, which will
440 // be used in the backends, and use that in the minimized bitcode
441 // produced for the full link.
442 ModuleHash ModHash = {{0}};
Rafael Espindola6a86e252018-02-14 19:11:32 +0000443 WriteBitcodeToFile(M, OS, /*ShouldPreserveUseListOrder=*/false, Index,
Teresa Johnson0c6a4ff2017-03-23 19:47:39 +0000444 /*GenerateHash=*/true, &ModHash);
Haojie Wang1dec57d2017-07-21 17:25:20 +0000445 // If a minimized bitcode module was requested for the thin link, only
446 // the information that is needed by thin link will be written in the
447 // given OS.
448 if (ThinLinkOS && Index)
Rafael Espindola6a86e252018-02-14 19:11:32 +0000449 WriteThinLinkBitcodeToFile(M, *ThinLinkOS, *Index, ModHash);
Peter Collingbourne1398a322016-12-16 00:26:30 +0000450}
451
452class WriteThinLTOBitcode : public ModulePass {
453 raw_ostream &OS; // raw_ostream to print on
Teresa Johnson0c6a4ff2017-03-23 19:47:39 +0000454 // The output stream on which to emit a minimized module for use
455 // just in the thin link, if requested.
456 raw_ostream *ThinLinkOS;
Peter Collingbourne1398a322016-12-16 00:26:30 +0000457
458public:
459 static char ID; // Pass identification, replacement for typeid
Teresa Johnson0c6a4ff2017-03-23 19:47:39 +0000460 WriteThinLTOBitcode() : ModulePass(ID), OS(dbgs()), ThinLinkOS(nullptr) {
Peter Collingbourne1398a322016-12-16 00:26:30 +0000461 initializeWriteThinLTOBitcodePass(*PassRegistry::getPassRegistry());
462 }
463
Teresa Johnson0c6a4ff2017-03-23 19:47:39 +0000464 explicit WriteThinLTOBitcode(raw_ostream &o, raw_ostream *ThinLinkOS)
465 : ModulePass(ID), OS(o), ThinLinkOS(ThinLinkOS) {
Peter Collingbourne1398a322016-12-16 00:26:30 +0000466 initializeWriteThinLTOBitcodePass(*PassRegistry::getPassRegistry());
467 }
468
469 StringRef getPassName() const override { return "ThinLTO Bitcode Writer"; }
470
471 bool runOnModule(Module &M) override {
472 const ModuleSummaryIndex *Index =
473 &(getAnalysis<ModuleSummaryIndexWrapperPass>().getIndex());
Teresa Johnson0c6a4ff2017-03-23 19:47:39 +0000474 writeThinLTOBitcode(OS, ThinLinkOS, LegacyAARGetter(*this), M, Index);
Peter Collingbourne1398a322016-12-16 00:26:30 +0000475 return true;
476 }
477 void getAnalysisUsage(AnalysisUsage &AU) const override {
478 AU.setPreservesAll();
Peter Collingbourne002c2d52017-02-14 03:42:38 +0000479 AU.addRequired<AssumptionCacheTracker>();
Peter Collingbourne1398a322016-12-16 00:26:30 +0000480 AU.addRequired<ModuleSummaryIndexWrapperPass>();
Peter Collingbourne002c2d52017-02-14 03:42:38 +0000481 AU.addRequired<TargetLibraryInfoWrapperPass>();
Peter Collingbourne1398a322016-12-16 00:26:30 +0000482 }
483};
484} // anonymous namespace
485
486char WriteThinLTOBitcode::ID = 0;
487INITIALIZE_PASS_BEGIN(WriteThinLTOBitcode, "write-thinlto-bitcode",
488 "Write ThinLTO Bitcode", false, true)
Peter Collingbourne002c2d52017-02-14 03:42:38 +0000489INITIALIZE_PASS_DEPENDENCY(AssumptionCacheTracker)
Peter Collingbourne1398a322016-12-16 00:26:30 +0000490INITIALIZE_PASS_DEPENDENCY(ModuleSummaryIndexWrapperPass)
Peter Collingbourne002c2d52017-02-14 03:42:38 +0000491INITIALIZE_PASS_DEPENDENCY(TargetLibraryInfoWrapperPass)
Peter Collingbourne1398a322016-12-16 00:26:30 +0000492INITIALIZE_PASS_END(WriteThinLTOBitcode, "write-thinlto-bitcode",
493 "Write ThinLTO Bitcode", false, true)
494
Teresa Johnson0c6a4ff2017-03-23 19:47:39 +0000495ModulePass *llvm::createWriteThinLTOBitcodePass(raw_ostream &Str,
496 raw_ostream *ThinLinkOS) {
497 return new WriteThinLTOBitcode(Str, ThinLinkOS);
Peter Collingbourne1398a322016-12-16 00:26:30 +0000498}
Tim Shen6b4114182017-06-01 01:02:12 +0000499
500PreservedAnalyses
501llvm::ThinLTOBitcodeWriterPass::run(Module &M, ModuleAnalysisManager &AM) {
502 FunctionAnalysisManager &FAM =
503 AM.getResult<FunctionAnalysisManagerModuleProxy>(M).getManager();
504 writeThinLTOBitcode(OS, ThinLinkOS,
505 [&FAM](Function &F) -> AAResults & {
506 return FAM.getResult<AAManager>(F);
507 },
508 M, &AM.getResult<ModuleSummaryIndexAnalysis>(M));
509 return PreservedAnalyses::all();
510}