blob: 8d494fe9cde28f14fa1e5ae9a8497978a21996b5 [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"
21#include "llvm/Pass.h"
Teresa Johnson0c6a4ff2017-03-23 19:47:39 +000022#include "llvm/Support/FileSystem.h"
Peter Collingbourne1398a322016-12-16 00:26:30 +000023#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"
Peter Collingbourne1398a322016-12-16 00:26:30 +000027#include "llvm/Transforms/Utils/Cloning.h"
Evgeniy Stepanov964f4662017-04-27 20:27:27 +000028#include "llvm/Transforms/Utils/ModuleUtils.h"
Peter Collingbourne1398a322016-12-16 00:26:30 +000029using namespace llvm;
30
31namespace {
32
Peter Collingbourne1398a322016-12-16 00:26:30 +000033// Promote each local-linkage entity defined by ExportM and used by ImportM by
34// changing visibility and appending the given ModuleId.
Evgeniy Stepanov4d4ee932017-06-16 00:18:29 +000035void promoteInternals(Module &ExportM, Module &ImportM, StringRef ModuleId,
36 SetVector<GlobalValue *> &PromoteExtra) {
Bob Haarman4075ccc2017-04-12 01:43:07 +000037 DenseMap<const Comdat *, Comdat *> RenamedComdats;
Peter Collingbourne6b193962017-03-30 23:43:08 +000038 for (auto &ExportGV : ExportM.global_values()) {
Peter Collingbourne1398a322016-12-16 00:26:30 +000039 if (!ExportGV.hasLocalLinkage())
Peter Collingbourne6b193962017-03-30 23:43:08 +000040 continue;
Peter Collingbourne1398a322016-12-16 00:26:30 +000041
Bob Haarman4075ccc2017-04-12 01:43:07 +000042 auto Name = ExportGV.getName();
43 GlobalValue *ImportGV = ImportM.getNamedValue(Name);
Evgeniy Stepanov4d4ee932017-06-16 00:18:29 +000044 if ((!ImportGV || ImportGV->use_empty()) && !PromoteExtra.count(&ExportGV))
Peter Collingbourne6b193962017-03-30 23:43:08 +000045 continue;
Peter Collingbourne1398a322016-12-16 00:26:30 +000046
Bob Haarman4075ccc2017-04-12 01:43:07 +000047 std::string NewName = (Name + ModuleId).str();
48
49 if (const auto *C = ExportGV.getComdat())
50 if (C->getName() == Name)
51 RenamedComdats.try_emplace(C, ExportM.getOrInsertComdat(NewName));
Peter Collingbourne1398a322016-12-16 00:26:30 +000052
53 ExportGV.setName(NewName);
54 ExportGV.setLinkage(GlobalValue::ExternalLinkage);
55 ExportGV.setVisibility(GlobalValue::HiddenVisibility);
56
Evgeniy Stepanov4d4ee932017-06-16 00:18:29 +000057 if (ImportGV) {
58 ImportGV->setName(NewName);
59 ImportGV->setVisibility(GlobalValue::HiddenVisibility);
60 }
Peter Collingbourne6b193962017-03-30 23:43:08 +000061 }
Bob Haarman4075ccc2017-04-12 01:43:07 +000062
63 if (!RenamedComdats.empty())
64 for (auto &GO : ExportM.global_objects())
65 if (auto *C = GO.getComdat()) {
66 auto Replacement = RenamedComdats.find(C);
67 if (Replacement != RenamedComdats.end())
68 GO.setComdat(Replacement->second);
69 }
Peter Collingbourne1398a322016-12-16 00:26:30 +000070}
71
72// Promote all internal (i.e. distinct) type ids used by the module by replacing
73// them with external type ids formed using the module id.
74//
75// Note that this needs to be done before we clone the module because each clone
76// will receive its own set of distinct metadata nodes.
77void promoteTypeIds(Module &M, StringRef ModuleId) {
78 DenseMap<Metadata *, Metadata *> LocalToGlobal;
79 auto ExternalizeTypeId = [&](CallInst *CI, unsigned ArgNo) {
80 Metadata *MD =
81 cast<MetadataAsValue>(CI->getArgOperand(ArgNo))->getMetadata();
82
83 if (isa<MDNode>(MD) && cast<MDNode>(MD)->isDistinct()) {
84 Metadata *&GlobalMD = LocalToGlobal[MD];
85 if (!GlobalMD) {
86 std::string NewName =
87 (to_string(LocalToGlobal.size()) + ModuleId).str();
88 GlobalMD = MDString::get(M.getContext(), NewName);
89 }
90
91 CI->setArgOperand(ArgNo,
92 MetadataAsValue::get(M.getContext(), GlobalMD));
93 }
94 };
95
96 if (Function *TypeTestFunc =
97 M.getFunction(Intrinsic::getName(Intrinsic::type_test))) {
98 for (const Use &U : TypeTestFunc->uses()) {
99 auto CI = cast<CallInst>(U.getUser());
100 ExternalizeTypeId(CI, 1);
101 }
102 }
103
104 if (Function *TypeCheckedLoadFunc =
105 M.getFunction(Intrinsic::getName(Intrinsic::type_checked_load))) {
106 for (const Use &U : TypeCheckedLoadFunc->uses()) {
107 auto CI = cast<CallInst>(U.getUser());
108 ExternalizeTypeId(CI, 2);
109 }
110 }
111
112 for (GlobalObject &GO : M.global_objects()) {
113 SmallVector<MDNode *, 1> MDs;
114 GO.getMetadata(LLVMContext::MD_type, MDs);
115
116 GO.eraseMetadata(LLVMContext::MD_type);
117 for (auto MD : MDs) {
118 auto I = LocalToGlobal.find(MD->getOperand(1));
119 if (I == LocalToGlobal.end()) {
120 GO.addMetadata(LLVMContext::MD_type, *MD);
121 continue;
122 }
123 GO.addMetadata(
124 LLVMContext::MD_type,
125 *MDNode::get(M.getContext(),
126 ArrayRef<Metadata *>{MD->getOperand(0), I->second}));
127 }
128 }
129}
130
131// Drop unused globals, and drop type information from function declarations.
132// FIXME: If we made functions typeless then there would be no need to do this.
133void simplifyExternals(Module &M) {
134 FunctionType *EmptyFT =
135 FunctionType::get(Type::getVoidTy(M.getContext()), false);
136
137 for (auto I = M.begin(), E = M.end(); I != E;) {
138 Function &F = *I++;
139 if (F.isDeclaration() && F.use_empty()) {
140 F.eraseFromParent();
141 continue;
142 }
143
144 if (!F.isDeclaration() || F.getFunctionType() == EmptyFT)
145 continue;
146
147 Function *NewF =
148 Function::Create(EmptyFT, GlobalValue::ExternalLinkage, "", &M);
149 NewF->setVisibility(F.getVisibility());
150 NewF->takeName(&F);
151 F.replaceAllUsesWith(ConstantExpr::getBitCast(NewF, F.getType()));
152 F.eraseFromParent();
153 }
154
155 for (auto I = M.global_begin(), E = M.global_end(); I != E;) {
156 GlobalVariable &GV = *I++;
157 if (GV.isDeclaration() && GV.use_empty()) {
158 GV.eraseFromParent();
159 continue;
160 }
161 }
162}
163
164void filterModule(
Benjamin Kramer061f4a52017-01-13 14:39:03 +0000165 Module *M, function_ref<bool(const GlobalValue *)> ShouldKeepDefinition) {
Bob Haarman6de81342017-04-05 00:42:07 +0000166 for (Module::alias_iterator I = M->alias_begin(), E = M->alias_end();
167 I != E;) {
168 GlobalAlias *GA = &*I++;
169 if (ShouldKeepDefinition(GA))
170 continue;
171
172 GlobalObject *GO;
173 if (GA->getValueType()->isFunctionTy())
174 GO = Function::Create(cast<FunctionType>(GA->getValueType()),
175 GlobalValue::ExternalLinkage, "", M);
176 else
177 GO = new GlobalVariable(
178 *M, GA->getValueType(), false, GlobalValue::ExternalLinkage,
Serge Gueltonf4dc59b2017-05-11 08:53:00 +0000179 nullptr, "", nullptr,
Bob Haarman6de81342017-04-05 00:42:07 +0000180 GA->getThreadLocalMode(), GA->getType()->getAddressSpace());
181 GO->takeName(GA);
182 GA->replaceAllUsesWith(GO);
183 GA->eraseFromParent();
184 }
185
Peter Collingbourne1398a322016-12-16 00:26:30 +0000186 for (Function &F : *M) {
187 if (ShouldKeepDefinition(&F))
188 continue;
189
190 F.deleteBody();
Peter Collingbourne20a00932017-01-18 20:03:02 +0000191 F.setComdat(nullptr);
Peter Collingbourne1398a322016-12-16 00:26:30 +0000192 F.clearMetadata();
193 }
194
195 for (GlobalVariable &GV : M->globals()) {
196 if (ShouldKeepDefinition(&GV))
197 continue;
198
199 GV.setInitializer(nullptr);
200 GV.setLinkage(GlobalValue::ExternalLinkage);
Peter Collingbourne20a00932017-01-18 20:03:02 +0000201 GV.setComdat(nullptr);
Peter Collingbourne1398a322016-12-16 00:26:30 +0000202 GV.clearMetadata();
203 }
Peter Collingbourne1398a322016-12-16 00:26:30 +0000204}
205
Peter Collingbourne002c2d52017-02-14 03:42:38 +0000206void forEachVirtualFunction(Constant *C, function_ref<void(Function *)> Fn) {
207 if (auto *F = dyn_cast<Function>(C))
208 return Fn(F);
Peter Collingbourne3baa72a2017-03-02 23:10:17 +0000209 if (isa<GlobalValue>(C))
210 return;
Peter Collingbourne002c2d52017-02-14 03:42:38 +0000211 for (Value *Op : C->operands())
212 forEachVirtualFunction(cast<Constant>(Op), Fn);
213}
214
Peter Collingbourne1398a322016-12-16 00:26:30 +0000215// If it's possible to split M into regular and thin LTO parts, do so and write
216// a multi-module bitcode file with the two parts to OS. Otherwise, write only a
217// regular LTO bitcode file to OS.
Peter Collingbourne002c2d52017-02-14 03:42:38 +0000218void splitAndWriteThinLTOBitcode(
Teresa Johnson0c6a4ff2017-03-23 19:47:39 +0000219 raw_ostream &OS, raw_ostream *ThinLinkOS,
220 function_ref<AAResults &(Function &)> AARGetter, Module &M) {
Evgeniy Stepanov964f4662017-04-27 20:27:27 +0000221 std::string ModuleId = getUniqueModuleId(&M);
Peter Collingbourne1398a322016-12-16 00:26:30 +0000222 if (ModuleId.empty()) {
223 // We couldn't generate a module ID for this module, just write it out as a
224 // regular LTO module.
225 WriteBitcodeToFile(&M, OS);
Teresa Johnson0c6a4ff2017-03-23 19:47:39 +0000226 if (ThinLinkOS)
227 // We don't have a ThinLTO part, but still write the module to the
228 // ThinLinkOS if requested so that the expected output file is produced.
229 WriteBitcodeToFile(&M, *ThinLinkOS);
Peter Collingbourne1398a322016-12-16 00:26:30 +0000230 return;
231 }
232
233 promoteTypeIds(M, ModuleId);
234
Peter Collingbourne002c2d52017-02-14 03:42:38 +0000235 // Returns whether a global has attached type metadata. Such globals may
236 // participate in CFI or whole-program devirtualization, so they need to
237 // appear in the merged module instead of the thin LTO module.
238 auto HasTypeMetadata = [&](const GlobalObject *GO) {
Peter Collingbourne1398a322016-12-16 00:26:30 +0000239 SmallVector<MDNode *, 1> MDs;
Peter Collingbourne002c2d52017-02-14 03:42:38 +0000240 GO->getMetadata(LLVMContext::MD_type, MDs);
Peter Collingbourne1398a322016-12-16 00:26:30 +0000241 return !MDs.empty();
242 };
243
Peter Collingbourne002c2d52017-02-14 03:42:38 +0000244 // Collect the set of virtual functions that are eligible for virtual constant
245 // propagation. Each eligible function must not access memory, must return
246 // an integer of width <=64 bits, must take at least one argument, must not
247 // use its first argument (assumed to be "this") and all arguments other than
248 // the first one must be of <=64 bit integer type.
249 //
250 // Note that we test whether this copy of the function is readnone, rather
251 // than testing function attributes, which must hold for any copy of the
252 // function, even a less optimized version substituted at link time. This is
253 // sound because the virtual constant propagation optimizations effectively
254 // inline all implementations of the virtual function into each call site,
255 // rather than using function attributes to perform local optimization.
256 std::set<const Function *> EligibleVirtualFns;
Bob Haarman4075ccc2017-04-12 01:43:07 +0000257 // If any member of a comdat lives in MergedM, put all members of that
258 // comdat in MergedM to keep the comdat together.
259 DenseSet<const Comdat *> MergedMComdats;
Peter Collingbourne002c2d52017-02-14 03:42:38 +0000260 for (GlobalVariable &GV : M.globals())
Bob Haarman4075ccc2017-04-12 01:43:07 +0000261 if (HasTypeMetadata(&GV)) {
262 if (const auto *C = GV.getComdat())
263 MergedMComdats.insert(C);
Peter Collingbourne002c2d52017-02-14 03:42:38 +0000264 forEachVirtualFunction(GV.getInitializer(), [&](Function *F) {
265 auto *RT = dyn_cast<IntegerType>(F->getReturnType());
266 if (!RT || RT->getBitWidth() > 64 || F->arg_empty() ||
267 !F->arg_begin()->use_empty())
268 return;
269 for (auto &Arg : make_range(std::next(F->arg_begin()), F->arg_end())) {
270 auto *ArgT = dyn_cast<IntegerType>(Arg.getType());
271 if (!ArgT || ArgT->getBitWidth() > 64)
272 return;
273 }
274 if (computeFunctionBodyMemoryAccess(*F, AARGetter(*F)) == MAK_ReadNone)
275 EligibleVirtualFns.insert(F);
276 });
Bob Haarman4075ccc2017-04-12 01:43:07 +0000277 }
Peter Collingbourne002c2d52017-02-14 03:42:38 +0000278
Peter Collingbourne1398a322016-12-16 00:26:30 +0000279 ValueToValueMapTy VMap;
Peter Collingbourne002c2d52017-02-14 03:42:38 +0000280 std::unique_ptr<Module> MergedM(
281 CloneModule(&M, VMap, [&](const GlobalValue *GV) -> bool {
Bob Haarman4075ccc2017-04-12 01:43:07 +0000282 if (const auto *C = GV->getComdat())
283 if (MergedMComdats.count(C))
284 return true;
Peter Collingbourne002c2d52017-02-14 03:42:38 +0000285 if (auto *F = dyn_cast<Function>(GV))
286 return EligibleVirtualFns.count(F);
287 if (auto *GVar = dyn_cast_or_null<GlobalVariable>(GV->getBaseObject()))
288 return HasTypeMetadata(GVar);
289 return false;
290 }));
Peter Collingbourne28ffd322017-02-08 20:44:00 +0000291 StripDebugInfo(*MergedM);
Peter Collingbourne1398a322016-12-16 00:26:30 +0000292
Peter Collingbourne002c2d52017-02-14 03:42:38 +0000293 for (Function &F : *MergedM)
294 if (!F.isDeclaration()) {
295 // Reset the linkage of all functions eligible for virtual constant
296 // propagation. The canonical definitions live in the thin LTO module so
297 // that they can be imported.
298 F.setLinkage(GlobalValue::AvailableExternallyLinkage);
299 F.setComdat(nullptr);
300 }
301
Evgeniy Stepanov4d4ee932017-06-16 00:18:29 +0000302 SetVector<GlobalValue *> CfiFunctions;
303 for (auto &F : M)
304 if ((!F.hasLocalLinkage() || F.hasAddressTaken()) && HasTypeMetadata(&F))
305 CfiFunctions.insert(&F);
306
Bob Haarman4075ccc2017-04-12 01:43:07 +0000307 // Remove all globals with type metadata, globals with comdats that live in
308 // MergedM, and aliases pointing to such globals from the thin LTO module.
Peter Collingbourne002c2d52017-02-14 03:42:38 +0000309 filterModule(&M, [&](const GlobalValue *GV) {
310 if (auto *GVar = dyn_cast_or_null<GlobalVariable>(GV->getBaseObject()))
Bob Haarman4075ccc2017-04-12 01:43:07 +0000311 if (HasTypeMetadata(GVar))
312 return false;
313 if (const auto *C = GV->getComdat())
314 if (MergedMComdats.count(C))
315 return false;
Peter Collingbourne002c2d52017-02-14 03:42:38 +0000316 return true;
317 });
Peter Collingbourne1398a322016-12-16 00:26:30 +0000318
Evgeniy Stepanov4d4ee932017-06-16 00:18:29 +0000319 promoteInternals(*MergedM, M, ModuleId, CfiFunctions);
320 promoteInternals(M, *MergedM, ModuleId, CfiFunctions);
321
322 SmallVector<MDNode *, 8> CfiFunctionMDs;
323 for (auto V : CfiFunctions) {
324 Function &F = *cast<Function>(V);
325 SmallVector<MDNode *, 2> Types;
326 F.getMetadata(LLVMContext::MD_type, Types);
327
328 auto &Ctx = MergedM->getContext();
329 SmallVector<Metadata *, 4> Elts;
330 Elts.push_back(MDString::get(Ctx, F.getName()));
331 CfiFunctionLinkage Linkage;
332 if (!F.isDeclarationForLinker())
333 Linkage = CFL_Definition;
334 else if (F.isWeakForLinker())
335 Linkage = CFL_WeakDeclaration;
336 else
337 Linkage = CFL_Declaration;
338 Elts.push_back(ConstantAsMetadata::get(
339 llvm::ConstantInt::get(Type::getInt8Ty(Ctx), Linkage)));
340 for (auto Type : Types)
341 Elts.push_back(Type);
342 CfiFunctionMDs.push_back(MDTuple::get(Ctx, Elts));
343 }
344
345 if(!CfiFunctionMDs.empty()) {
346 NamedMDNode *NMD = MergedM->getOrInsertNamedMetadata("cfi.functions");
347 for (auto MD : CfiFunctionMDs)
348 NMD->addOperand(MD);
349 }
Peter Collingbourne1398a322016-12-16 00:26:30 +0000350
351 simplifyExternals(*MergedM);
352
Peter Collingbourne1398a322016-12-16 00:26:30 +0000353 // FIXME: Try to re-use BSI and PFI from the original module here.
Teresa Johnson94624ac2017-05-10 18:52:16 +0000354 ProfileSummaryInfo PSI(M);
355 ModuleSummaryIndex Index = buildModuleSummaryIndex(M, nullptr, &PSI);
Teresa Johnson0c6a4ff2017-03-23 19:47:39 +0000356
Peter Collingbournee357fbd2017-06-08 23:01:49 +0000357 // Mark the merged module as requiring full LTO. We still want an index for
358 // it though, so that it can participate in summary-based dead stripping.
359 MergedM->addModuleFlag(Module::Error, "ThinLTO", uint32_t(0));
360 ModuleSummaryIndex MergedMIndex =
361 buildModuleSummaryIndex(*MergedM, nullptr, &PSI);
362
Teresa Johnson0c6a4ff2017-03-23 19:47:39 +0000363 SmallVector<char, 0> Buffer;
364
365 BitcodeWriter W(Buffer);
366 // Save the module hash produced for the full bitcode, which will
367 // be used in the backends, and use that in the minimized bitcode
368 // produced for the full link.
369 ModuleHash ModHash = {{0}};
Peter Collingbourne1398a322016-12-16 00:26:30 +0000370 W.writeModule(&M, /*ShouldPreserveUseListOrder=*/false, &Index,
Teresa Johnson0c6a4ff2017-03-23 19:47:39 +0000371 /*GenerateHash=*/true, &ModHash);
Peter Collingbournee357fbd2017-06-08 23:01:49 +0000372 W.writeModule(MergedM.get(), /*ShouldPreserveUseListOrder=*/false,
373 &MergedMIndex);
Peter Collingbourne92648c22017-06-27 23:50:11 +0000374 W.writeSymtab();
Peter Collingbournea0f371a2017-04-17 17:51:36 +0000375 W.writeStrtab();
Peter Collingbourne1398a322016-12-16 00:26:30 +0000376 OS << Buffer;
Teresa Johnson0c6a4ff2017-03-23 19:47:39 +0000377
378 // If a minimized bitcode module was requested for the thin link,
379 // strip the debug info (the merged module was already stripped above)
380 // and write it to the given OS.
381 if (ThinLinkOS) {
382 Buffer.clear();
383 BitcodeWriter W2(Buffer);
384 StripDebugInfo(M);
385 W2.writeModule(&M, /*ShouldPreserveUseListOrder=*/false, &Index,
386 /*GenerateHash=*/false, &ModHash);
Peter Collingbournee357fbd2017-06-08 23:01:49 +0000387 W2.writeModule(MergedM.get(), /*ShouldPreserveUseListOrder=*/false,
388 &MergedMIndex);
Peter Collingbourne92648c22017-06-27 23:50:11 +0000389 W2.writeSymtab();
Peter Collingbournea0f371a2017-04-17 17:51:36 +0000390 W2.writeStrtab();
Teresa Johnson0c6a4ff2017-03-23 19:47:39 +0000391 *ThinLinkOS << Buffer;
392 }
Peter Collingbourne1398a322016-12-16 00:26:30 +0000393}
394
395// Returns whether this module needs to be split because it uses type metadata.
396bool requiresSplit(Module &M) {
397 SmallVector<MDNode *, 1> MDs;
398 for (auto &GO : M.global_objects()) {
399 GO.getMetadata(LLVMContext::MD_type, MDs);
400 if (!MDs.empty())
401 return true;
402 }
403
404 return false;
405}
406
Teresa Johnson0c6a4ff2017-03-23 19:47:39 +0000407void writeThinLTOBitcode(raw_ostream &OS, raw_ostream *ThinLinkOS,
Peter Collingbourne002c2d52017-02-14 03:42:38 +0000408 function_ref<AAResults &(Function &)> AARGetter,
409 Module &M, const ModuleSummaryIndex *Index) {
Peter Collingbourne1398a322016-12-16 00:26:30 +0000410 // See if this module has any type metadata. If so, we need to split it.
411 if (requiresSplit(M))
Teresa Johnson0c6a4ff2017-03-23 19:47:39 +0000412 return splitAndWriteThinLTOBitcode(OS, ThinLinkOS, AARGetter, M);
Peter Collingbourne1398a322016-12-16 00:26:30 +0000413
414 // Otherwise we can just write it out as a regular module.
Teresa Johnson0c6a4ff2017-03-23 19:47:39 +0000415
416 // Save the module hash produced for the full bitcode, which will
417 // be used in the backends, and use that in the minimized bitcode
418 // produced for the full link.
419 ModuleHash ModHash = {{0}};
Peter Collingbourne1398a322016-12-16 00:26:30 +0000420 WriteBitcodeToFile(&M, OS, /*ShouldPreserveUseListOrder=*/false, Index,
Teresa Johnson0c6a4ff2017-03-23 19:47:39 +0000421 /*GenerateHash=*/true, &ModHash);
422 // If a minimized bitcode module was requested for the thin link,
423 // strip the debug info and write it to the given OS.
424 if (ThinLinkOS) {
425 StripDebugInfo(M);
426 WriteBitcodeToFile(&M, *ThinLinkOS, /*ShouldPreserveUseListOrder=*/false,
427 Index,
428 /*GenerateHash=*/false, &ModHash);
429 }
Peter Collingbourne1398a322016-12-16 00:26:30 +0000430}
431
432class WriteThinLTOBitcode : public ModulePass {
433 raw_ostream &OS; // raw_ostream to print on
Teresa Johnson0c6a4ff2017-03-23 19:47:39 +0000434 // The output stream on which to emit a minimized module for use
435 // just in the thin link, if requested.
436 raw_ostream *ThinLinkOS;
Peter Collingbourne1398a322016-12-16 00:26:30 +0000437
438public:
439 static char ID; // Pass identification, replacement for typeid
Teresa Johnson0c6a4ff2017-03-23 19:47:39 +0000440 WriteThinLTOBitcode() : ModulePass(ID), OS(dbgs()), ThinLinkOS(nullptr) {
Peter Collingbourne1398a322016-12-16 00:26:30 +0000441 initializeWriteThinLTOBitcodePass(*PassRegistry::getPassRegistry());
442 }
443
Teresa Johnson0c6a4ff2017-03-23 19:47:39 +0000444 explicit WriteThinLTOBitcode(raw_ostream &o, raw_ostream *ThinLinkOS)
445 : ModulePass(ID), OS(o), ThinLinkOS(ThinLinkOS) {
Peter Collingbourne1398a322016-12-16 00:26:30 +0000446 initializeWriteThinLTOBitcodePass(*PassRegistry::getPassRegistry());
447 }
448
449 StringRef getPassName() const override { return "ThinLTO Bitcode Writer"; }
450
451 bool runOnModule(Module &M) override {
452 const ModuleSummaryIndex *Index =
453 &(getAnalysis<ModuleSummaryIndexWrapperPass>().getIndex());
Teresa Johnson0c6a4ff2017-03-23 19:47:39 +0000454 writeThinLTOBitcode(OS, ThinLinkOS, LegacyAARGetter(*this), M, Index);
Peter Collingbourne1398a322016-12-16 00:26:30 +0000455 return true;
456 }
457 void getAnalysisUsage(AnalysisUsage &AU) const override {
458 AU.setPreservesAll();
Peter Collingbourne002c2d52017-02-14 03:42:38 +0000459 AU.addRequired<AssumptionCacheTracker>();
Peter Collingbourne1398a322016-12-16 00:26:30 +0000460 AU.addRequired<ModuleSummaryIndexWrapperPass>();
Peter Collingbourne002c2d52017-02-14 03:42:38 +0000461 AU.addRequired<TargetLibraryInfoWrapperPass>();
Peter Collingbourne1398a322016-12-16 00:26:30 +0000462 }
463};
464} // anonymous namespace
465
466char WriteThinLTOBitcode::ID = 0;
467INITIALIZE_PASS_BEGIN(WriteThinLTOBitcode, "write-thinlto-bitcode",
468 "Write ThinLTO Bitcode", false, true)
Peter Collingbourne002c2d52017-02-14 03:42:38 +0000469INITIALIZE_PASS_DEPENDENCY(AssumptionCacheTracker)
Peter Collingbourne1398a322016-12-16 00:26:30 +0000470INITIALIZE_PASS_DEPENDENCY(ModuleSummaryIndexWrapperPass)
Peter Collingbourne002c2d52017-02-14 03:42:38 +0000471INITIALIZE_PASS_DEPENDENCY(TargetLibraryInfoWrapperPass)
Peter Collingbourne1398a322016-12-16 00:26:30 +0000472INITIALIZE_PASS_END(WriteThinLTOBitcode, "write-thinlto-bitcode",
473 "Write ThinLTO Bitcode", false, true)
474
Teresa Johnson0c6a4ff2017-03-23 19:47:39 +0000475ModulePass *llvm::createWriteThinLTOBitcodePass(raw_ostream &Str,
476 raw_ostream *ThinLinkOS) {
477 return new WriteThinLTOBitcode(Str, ThinLinkOS);
Peter Collingbourne1398a322016-12-16 00:26:30 +0000478}
Tim Shen6b4114182017-06-01 01:02:12 +0000479
480PreservedAnalyses
481llvm::ThinLTOBitcodeWriterPass::run(Module &M, ModuleAnalysisManager &AM) {
482 FunctionAnalysisManager &FAM =
483 AM.getResult<FunctionAnalysisManagerModuleProxy>(M).getManager();
484 writeThinLTOBitcode(OS, ThinLinkOS,
485 [&FAM](Function &F) -> AAResults & {
486 return FAM.getResult<AAManager>(F);
487 },
488 M, &AM.getResult<ModuleSummaryIndexAnalysis>(M));
489 return PreservedAnalyses::all();
490}