blob: a48d21e5366a2ed5aabc33b6400ca6ef0719b3f9 [file] [log] [blame]
Peter Collingbournedf49d1b2016-02-09 22:50:34 +00001//===- WholeProgramDevirt.cpp - Whole program virtual call optimization ---===//
2//
Chandler Carruth2946cd72019-01-19 08:50:56 +00003// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
Peter Collingbournedf49d1b2016-02-09 22:50:34 +00006//
7//===----------------------------------------------------------------------===//
8//
9// This pass implements whole program optimization of virtual calls in cases
Peter Collingbourne7efd7502016-06-24 21:21:32 +000010// where we know (via !type metadata) that the list of callees is fixed. This
Peter Collingbournedf49d1b2016-02-09 22:50:34 +000011// includes the following:
12// - Single implementation devirtualization: if a virtual call has a single
13// possible callee, replace all calls with a direct call to that callee.
14// - Virtual constant propagation: if the virtual function's return type is an
15// integer <=64 bits and all possible callees are readnone, for each class and
16// each list of constant arguments: evaluate the function, store the return
17// value alongside the virtual table, and rewrite each virtual call as a load
18// from the virtual table.
19// - Uniform return value optimization: if the conditions for virtual constant
20// propagation hold and each function returns the same constant value, replace
21// each virtual call with that constant.
22// - Unique return value optimization for i1 return values: if the conditions
23// for virtual constant propagation hold and a single vtable's function
24// returns 0, or a single vtable's function returns 1, replace each virtual
25// call with a comparison of the vptr against that vtable's address.
26//
Peter Collingbourneb406baa2017-03-04 01:23:30 +000027// This pass is intended to be used during the regular and thin LTO pipelines.
28// During regular LTO, the pass determines the best optimization for each
29// virtual call and applies the resolutions directly to virtual calls that are
30// eligible for virtual call optimization (i.e. calls that use either of the
31// llvm.assume(llvm.type.test) or llvm.type.checked.load intrinsics). During
32// ThinLTO, the pass operates in two phases:
33// - Export phase: this is run during the thin link over a single merged module
34// that contains all vtables with !type metadata that participate in the link.
35// The pass computes a resolution for each virtual call and stores it in the
36// type identifier summary.
37// - Import phase: this is run during the thin backends over the individual
38// modules. The pass applies the resolutions previously computed during the
39// import phase to each eligible virtual call.
40//
Peter Collingbournedf49d1b2016-02-09 22:50:34 +000041//===----------------------------------------------------------------------===//
42
43#include "llvm/Transforms/IPO/WholeProgramDevirt.h"
Mehdi Aminib550cb12016-04-18 09:17:29 +000044#include "llvm/ADT/ArrayRef.h"
Eugene Zelenkocdc71612016-08-11 17:20:18 +000045#include "llvm/ADT/DenseMap.h"
46#include "llvm/ADT/DenseMapInfo.h"
Peter Collingbournedf49d1b2016-02-09 22:50:34 +000047#include "llvm/ADT/DenseSet.h"
48#include "llvm/ADT/MapVector.h"
Eugene Zelenkocdc71612016-08-11 17:20:18 +000049#include "llvm/ADT/SmallVector.h"
Chandler Carruth6bda14b2017-06-06 11:49:48 +000050#include "llvm/ADT/iterator_range.h"
Peter Collingbourne37317f12017-02-17 18:17:04 +000051#include "llvm/Analysis/AliasAnalysis.h"
52#include "llvm/Analysis/BasicAliasAnalysis.h"
Adam Nemet0965da22017-10-09 23:19:02 +000053#include "llvm/Analysis/OptimizationRemarkEmitter.h"
Peter Collingbourne7efd7502016-06-24 21:21:32 +000054#include "llvm/Analysis/TypeMetadataUtils.h"
Peter Collingbournedf49d1b2016-02-09 22:50:34 +000055#include "llvm/IR/CallSite.h"
56#include "llvm/IR/Constants.h"
57#include "llvm/IR/DataLayout.h"
Eugene Zelenkocdc71612016-08-11 17:20:18 +000058#include "llvm/IR/DebugLoc.h"
59#include "llvm/IR/DerivedTypes.h"
Teresa Johnsonf24136f2018-09-27 14:55:32 +000060#include "llvm/IR/Dominators.h"
Eugene Zelenkocdc71612016-08-11 17:20:18 +000061#include "llvm/IR/Function.h"
62#include "llvm/IR/GlobalAlias.h"
63#include "llvm/IR/GlobalVariable.h"
Peter Collingbournedf49d1b2016-02-09 22:50:34 +000064#include "llvm/IR/IRBuilder.h"
Eugene Zelenkocdc71612016-08-11 17:20:18 +000065#include "llvm/IR/InstrTypes.h"
66#include "llvm/IR/Instruction.h"
Peter Collingbournedf49d1b2016-02-09 22:50:34 +000067#include "llvm/IR/Instructions.h"
68#include "llvm/IR/Intrinsics.h"
Eugene Zelenkocdc71612016-08-11 17:20:18 +000069#include "llvm/IR/LLVMContext.h"
70#include "llvm/IR/Metadata.h"
Peter Collingbournedf49d1b2016-02-09 22:50:34 +000071#include "llvm/IR/Module.h"
Peter Collingbourne2b33f652017-02-13 19:26:18 +000072#include "llvm/IR/ModuleSummaryIndexYAML.h"
Peter Collingbournedf49d1b2016-02-09 22:50:34 +000073#include "llvm/Pass.h"
Eugene Zelenkocdc71612016-08-11 17:20:18 +000074#include "llvm/PassRegistry.h"
75#include "llvm/PassSupport.h"
76#include "llvm/Support/Casting.h"
Peter Collingbourne2b33f652017-02-13 19:26:18 +000077#include "llvm/Support/Error.h"
78#include "llvm/Support/FileSystem.h"
Eugene Zelenkocdc71612016-08-11 17:20:18 +000079#include "llvm/Support/MathExtras.h"
Mehdi Aminib550cb12016-04-18 09:17:29 +000080#include "llvm/Transforms/IPO.h"
Peter Collingbourne37317f12017-02-17 18:17:04 +000081#include "llvm/Transforms/IPO/FunctionAttrs.h"
Peter Collingbournedf49d1b2016-02-09 22:50:34 +000082#include "llvm/Transforms/Utils/Evaluator.h"
Eugene Zelenkocdc71612016-08-11 17:20:18 +000083#include <algorithm>
84#include <cstddef>
85#include <map>
Peter Collingbournedf49d1b2016-02-09 22:50:34 +000086#include <set>
Eugene Zelenkocdc71612016-08-11 17:20:18 +000087#include <string>
Peter Collingbournedf49d1b2016-02-09 22:50:34 +000088
89using namespace llvm;
90using namespace wholeprogramdevirt;
91
92#define DEBUG_TYPE "wholeprogramdevirt"
93
Peter Collingbourne2b33f652017-02-13 19:26:18 +000094static cl::opt<PassSummaryAction> ClSummaryAction(
95 "wholeprogramdevirt-summary-action",
96 cl::desc("What to do with the summary when running this pass"),
97 cl::values(clEnumValN(PassSummaryAction::None, "none", "Do nothing"),
98 clEnumValN(PassSummaryAction::Import, "import",
99 "Import typeid resolutions from summary and globals"),
100 clEnumValN(PassSummaryAction::Export, "export",
101 "Export typeid resolutions to summary and globals")),
102 cl::Hidden);
103
104static cl::opt<std::string> ClReadSummary(
105 "wholeprogramdevirt-read-summary",
106 cl::desc("Read summary from given YAML file before running pass"),
107 cl::Hidden);
108
109static cl::opt<std::string> ClWriteSummary(
110 "wholeprogramdevirt-write-summary",
111 cl::desc("Write summary to given YAML file after running pass"),
112 cl::Hidden);
113
Vitaly Buka9cb59b92018-04-06 21:41:17 +0000114static cl::opt<unsigned>
115 ClThreshold("wholeprogramdevirt-branch-funnel-threshold", cl::Hidden,
116 cl::init(10), cl::ZeroOrMore,
117 cl::desc("Maximum number of call targets per "
118 "call site to enable branch funnels"));
Vitaly Buka66f53d72018-04-06 21:32:36 +0000119
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000120// Find the minimum offset that we may store a value of size Size bits at. If
121// IsAfter is set, look for an offset before the object, otherwise look for an
122// offset after the object.
123uint64_t
124wholeprogramdevirt::findLowestOffset(ArrayRef<VirtualCallTarget> Targets,
125 bool IsAfter, uint64_t Size) {
126 // Find a minimum offset taking into account only vtable sizes.
127 uint64_t MinByte = 0;
128 for (const VirtualCallTarget &Target : Targets) {
129 if (IsAfter)
130 MinByte = std::max(MinByte, Target.minAfterBytes());
131 else
132 MinByte = std::max(MinByte, Target.minBeforeBytes());
133 }
134
135 // Build a vector of arrays of bytes covering, for each target, a slice of the
136 // used region (see AccumBitVector::BytesUsed in
137 // llvm/Transforms/IPO/WholeProgramDevirt.h) starting at MinByte. Effectively,
138 // this aligns the used regions to start at MinByte.
139 //
140 // In this example, A, B and C are vtables, # is a byte already allocated for
141 // a virtual function pointer, AAAA... (etc.) are the used regions for the
142 // vtables and Offset(X) is the value computed for the Offset variable below
143 // for X.
144 //
145 // Offset(A)
146 // | |
147 // |MinByte
148 // A: ################AAAAAAAA|AAAAAAAA
149 // B: ########BBBBBBBBBBBBBBBB|BBBB
150 // C: ########################|CCCCCCCCCCCCCCCC
151 // | Offset(B) |
152 //
153 // This code produces the slices of A, B and C that appear after the divider
154 // at MinByte.
155 std::vector<ArrayRef<uint8_t>> Used;
156 for (const VirtualCallTarget &Target : Targets) {
Peter Collingbourne7efd7502016-06-24 21:21:32 +0000157 ArrayRef<uint8_t> VTUsed = IsAfter ? Target.TM->Bits->After.BytesUsed
158 : Target.TM->Bits->Before.BytesUsed;
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000159 uint64_t Offset = IsAfter ? MinByte - Target.minAfterBytes()
160 : MinByte - Target.minBeforeBytes();
161
162 // Disregard used regions that are smaller than Offset. These are
163 // effectively all-free regions that do not need to be checked.
164 if (VTUsed.size() > Offset)
165 Used.push_back(VTUsed.slice(Offset));
166 }
167
168 if (Size == 1) {
169 // Find a free bit in each member of Used.
170 for (unsigned I = 0;; ++I) {
171 uint8_t BitsUsed = 0;
172 for (auto &&B : Used)
173 if (I < B.size())
174 BitsUsed |= B[I];
175 if (BitsUsed != 0xff)
176 return (MinByte + I) * 8 +
177 countTrailingZeros(uint8_t(~BitsUsed), ZB_Undefined);
178 }
179 } else {
180 // Find a free (Size/8) byte region in each member of Used.
181 // FIXME: see if alignment helps.
182 for (unsigned I = 0;; ++I) {
183 for (auto &&B : Used) {
184 unsigned Byte = 0;
185 while ((I + Byte) < B.size() && Byte < (Size / 8)) {
186 if (B[I + Byte])
187 goto NextI;
188 ++Byte;
189 }
190 }
191 return (MinByte + I) * 8;
192 NextI:;
193 }
194 }
195}
196
197void wholeprogramdevirt::setBeforeReturnValues(
198 MutableArrayRef<VirtualCallTarget> Targets, uint64_t AllocBefore,
199 unsigned BitWidth, int64_t &OffsetByte, uint64_t &OffsetBit) {
200 if (BitWidth == 1)
201 OffsetByte = -(AllocBefore / 8 + 1);
202 else
203 OffsetByte = -((AllocBefore + 7) / 8 + (BitWidth + 7) / 8);
204 OffsetBit = AllocBefore % 8;
205
206 for (VirtualCallTarget &Target : Targets) {
207 if (BitWidth == 1)
208 Target.setBeforeBit(AllocBefore);
209 else
210 Target.setBeforeBytes(AllocBefore, (BitWidth + 7) / 8);
211 }
212}
213
214void wholeprogramdevirt::setAfterReturnValues(
215 MutableArrayRef<VirtualCallTarget> Targets, uint64_t AllocAfter,
216 unsigned BitWidth, int64_t &OffsetByte, uint64_t &OffsetBit) {
217 if (BitWidth == 1)
218 OffsetByte = AllocAfter / 8;
219 else
220 OffsetByte = (AllocAfter + 7) / 8;
221 OffsetBit = AllocAfter % 8;
222
223 for (VirtualCallTarget &Target : Targets) {
224 if (BitWidth == 1)
225 Target.setAfterBit(AllocAfter);
226 else
227 Target.setAfterBytes(AllocAfter, (BitWidth + 7) / 8);
228 }
229}
230
Peter Collingbourne7efd7502016-06-24 21:21:32 +0000231VirtualCallTarget::VirtualCallTarget(Function *Fn, const TypeMemberInfo *TM)
232 : Fn(Fn), TM(TM),
Ivan Krasin89439a72016-08-12 01:40:10 +0000233 IsBigEndian(Fn->getParent()->getDataLayout().isBigEndian()), WasDevirt(false) {}
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000234
235namespace {
236
Peter Collingbourne7efd7502016-06-24 21:21:32 +0000237// A slot in a set of virtual tables. The TypeID identifies the set of virtual
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000238// tables, and the ByteOffset is the offset in bytes from the address point to
239// the virtual function pointer.
240struct VTableSlot {
Peter Collingbourne7efd7502016-06-24 21:21:32 +0000241 Metadata *TypeID;
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000242 uint64_t ByteOffset;
243};
244
Eugene Zelenkocdc71612016-08-11 17:20:18 +0000245} // end anonymous namespace
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000246
Peter Collingbourne9b656522016-02-09 23:01:38 +0000247namespace llvm {
248
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000249template <> struct DenseMapInfo<VTableSlot> {
250 static VTableSlot getEmptyKey() {
251 return {DenseMapInfo<Metadata *>::getEmptyKey(),
252 DenseMapInfo<uint64_t>::getEmptyKey()};
253 }
254 static VTableSlot getTombstoneKey() {
255 return {DenseMapInfo<Metadata *>::getTombstoneKey(),
256 DenseMapInfo<uint64_t>::getTombstoneKey()};
257 }
258 static unsigned getHashValue(const VTableSlot &I) {
Peter Collingbourne7efd7502016-06-24 21:21:32 +0000259 return DenseMapInfo<Metadata *>::getHashValue(I.TypeID) ^
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000260 DenseMapInfo<uint64_t>::getHashValue(I.ByteOffset);
261 }
262 static bool isEqual(const VTableSlot &LHS,
263 const VTableSlot &RHS) {
Peter Collingbourne7efd7502016-06-24 21:21:32 +0000264 return LHS.TypeID == RHS.TypeID && LHS.ByteOffset == RHS.ByteOffset;
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000265 }
266};
267
Eugene Zelenkocdc71612016-08-11 17:20:18 +0000268} // end namespace llvm
Peter Collingbourne9b656522016-02-09 23:01:38 +0000269
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000270namespace {
271
272// A virtual call site. VTable is the loaded virtual table pointer, and CS is
273// the indirect virtual call.
274struct VirtualCallSite {
275 Value *VTable;
276 CallSite CS;
277
Peter Collingbourne0312f612016-06-25 00:23:04 +0000278 // If non-null, this field points to the associated unsafe use count stored in
279 // the DevirtModule::NumUnsafeUsesForTypeTest map below. See the description
280 // of that field for details.
281 unsigned *NumUnsafeUses;
282
Sam Elliotte963c892017-08-21 16:57:21 +0000283 void
284 emitRemark(const StringRef OptName, const StringRef TargetName,
285 function_ref<OptimizationRemarkEmitter &(Function *)> OREGetter) {
Ivan Krasin54746452016-07-12 02:38:37 +0000286 Function *F = CS.getCaller();
Sam Elliotte963c892017-08-21 16:57:21 +0000287 DebugLoc DLoc = CS->getDebugLoc();
288 BasicBlock *Block = CS.getParent();
289
Sam Elliotte963c892017-08-21 16:57:21 +0000290 using namespace ore;
Peter Collingbourne9110cb42018-01-05 00:27:51 +0000291 OREGetter(F).emit(OptimizationRemark(DEBUG_TYPE, OptName, DLoc, Block)
292 << NV("Optimization", OptName)
293 << ": devirtualized a call to "
294 << NV("FunctionName", TargetName));
Ivan Krasin54746452016-07-12 02:38:37 +0000295 }
296
Sam Elliotte963c892017-08-21 16:57:21 +0000297 void replaceAndErase(
298 const StringRef OptName, const StringRef TargetName, bool RemarksEnabled,
299 function_ref<OptimizationRemarkEmitter &(Function *)> OREGetter,
300 Value *New) {
Ivan Krasinf3403fd2016-08-11 19:09:02 +0000301 if (RemarksEnabled)
Sam Elliotte963c892017-08-21 16:57:21 +0000302 emitRemark(OptName, TargetName, OREGetter);
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000303 CS->replaceAllUsesWith(New);
304 if (auto II = dyn_cast<InvokeInst>(CS.getInstruction())) {
305 BranchInst::Create(II->getNormalDest(), CS.getInstruction());
306 II->getUnwindDest()->removePredecessor(II->getParent());
307 }
308 CS->eraseFromParent();
Peter Collingbourne0312f612016-06-25 00:23:04 +0000309 // This use is no longer unsafe.
310 if (NumUnsafeUses)
311 --*NumUnsafeUses;
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000312 }
313};
314
Peter Collingbourne50cbd7c2017-02-15 21:56:51 +0000315// Call site information collected for a specific VTableSlot and possibly a list
316// of constant integer arguments. The grouping by arguments is handled by the
317// VTableSlotInfo class.
318struct CallSiteInfo {
Peter Collingbourneb406baa2017-03-04 01:23:30 +0000319 /// The set of call sites for this slot. Used during regular LTO and the
320 /// import phase of ThinLTO (as well as the export phase of ThinLTO for any
321 /// call sites that appear in the merged module itself); in each of these
322 /// cases we are directly operating on the call sites at the IR level.
Peter Collingbourne50cbd7c2017-02-15 21:56:51 +0000323 std::vector<VirtualCallSite> CallSites;
Peter Collingbourneb406baa2017-03-04 01:23:30 +0000324
Peter Collingbourne29748562018-03-09 19:11:44 +0000325 /// Whether all call sites represented by this CallSiteInfo, including those
326 /// in summaries, have been devirtualized. This starts off as true because a
327 /// default constructed CallSiteInfo represents no call sites.
328 bool AllCallSitesDevirted = true;
329
Peter Collingbourneb406baa2017-03-04 01:23:30 +0000330 // These fields are used during the export phase of ThinLTO and reflect
331 // information collected from function summaries.
332
Peter Collingbourne2325bb32017-03-04 01:31:01 +0000333 /// Whether any function summary contains an llvm.assume(llvm.type.test) for
334 /// this slot.
Peter Collingbourne29748562018-03-09 19:11:44 +0000335 bool SummaryHasTypeTestAssumeUsers = false;
Peter Collingbourne2325bb32017-03-04 01:31:01 +0000336
Peter Collingbourneb406baa2017-03-04 01:23:30 +0000337 /// CFI-specific: a vector containing the list of function summaries that use
338 /// the llvm.type.checked.load intrinsic and therefore will require
339 /// resolutions for llvm.type.test in order to implement CFI checks if
340 /// devirtualization was unsuccessful. If devirtualization was successful, the
Peter Collingbourne59675ba2017-03-10 20:09:11 +0000341 /// pass will clear this vector by calling markDevirt(). If at the end of the
342 /// pass the vector is non-empty, we will need to add a use of llvm.type.test
343 /// to each of the function summaries in the vector.
Peter Collingbourneb406baa2017-03-04 01:23:30 +0000344 std::vector<FunctionSummary *> SummaryTypeCheckedLoadUsers;
Peter Collingbourne2325bb32017-03-04 01:31:01 +0000345
346 bool isExported() const {
347 return SummaryHasTypeTestAssumeUsers ||
348 !SummaryTypeCheckedLoadUsers.empty();
349 }
Peter Collingbourne59675ba2017-03-10 20:09:11 +0000350
Peter Collingbourne29748562018-03-09 19:11:44 +0000351 void markSummaryHasTypeTestAssumeUsers() {
352 SummaryHasTypeTestAssumeUsers = true;
353 AllCallSitesDevirted = false;
354 }
355
356 void addSummaryTypeCheckedLoadUser(FunctionSummary *FS) {
357 SummaryTypeCheckedLoadUsers.push_back(FS);
358 AllCallSitesDevirted = false;
359 }
360
361 void markDevirt() {
362 AllCallSitesDevirted = true;
363
364 // As explained in the comment for SummaryTypeCheckedLoadUsers.
365 SummaryTypeCheckedLoadUsers.clear();
366 }
Peter Collingbourne50cbd7c2017-02-15 21:56:51 +0000367};
368
369// Call site information collected for a specific VTableSlot.
370struct VTableSlotInfo {
371 // The set of call sites which do not have all constant integer arguments
372 // (excluding "this").
373 CallSiteInfo CSInfo;
374
375 // The set of call sites with all constant integer arguments (excluding
376 // "this"), grouped by argument list.
377 std::map<std::vector<uint64_t>, CallSiteInfo> ConstCSInfo;
378
379 void addCallSite(Value *VTable, CallSite CS, unsigned *NumUnsafeUses);
380
381private:
382 CallSiteInfo &findCallSiteInfo(CallSite CS);
383};
384
385CallSiteInfo &VTableSlotInfo::findCallSiteInfo(CallSite CS) {
386 std::vector<uint64_t> Args;
387 auto *CI = dyn_cast<IntegerType>(CS.getType());
388 if (!CI || CI->getBitWidth() > 64 || CS.arg_empty())
389 return CSInfo;
390 for (auto &&Arg : make_range(CS.arg_begin() + 1, CS.arg_end())) {
391 auto *CI = dyn_cast<ConstantInt>(Arg);
392 if (!CI || CI->getBitWidth() > 64)
393 return CSInfo;
394 Args.push_back(CI->getZExtValue());
395 }
396 return ConstCSInfo[Args];
397}
398
399void VTableSlotInfo::addCallSite(Value *VTable, CallSite CS,
400 unsigned *NumUnsafeUses) {
Peter Collingbourne29748562018-03-09 19:11:44 +0000401 auto &CSI = findCallSiteInfo(CS);
402 CSI.AllCallSitesDevirted = false;
403 CSI.CallSites.push_back({VTable, CS, NumUnsafeUses});
Peter Collingbourne50cbd7c2017-02-15 21:56:51 +0000404}
405
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000406struct DevirtModule {
407 Module &M;
Peter Collingbourne37317f12017-02-17 18:17:04 +0000408 function_ref<AAResults &(Function &)> AARGetter;
Teresa Johnsonf24136f2018-09-27 14:55:32 +0000409 function_ref<DominatorTree &(Function &)> LookupDomTree;
Peter Collingbourne2b33f652017-02-13 19:26:18 +0000410
Peter Collingbournef7691d82017-03-22 18:22:59 +0000411 ModuleSummaryIndex *ExportSummary;
412 const ModuleSummaryIndex *ImportSummary;
Peter Collingbourne2b33f652017-02-13 19:26:18 +0000413
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000414 IntegerType *Int8Ty;
415 PointerType *Int8PtrTy;
416 IntegerType *Int32Ty;
Peter Collingbourne50cbd7c2017-02-15 21:56:51 +0000417 IntegerType *Int64Ty;
Peter Collingbourne14dcf022017-03-10 20:13:58 +0000418 IntegerType *IntPtrTy;
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000419
Ivan Krasinf3403fd2016-08-11 19:09:02 +0000420 bool RemarksEnabled;
Sam Elliotte963c892017-08-21 16:57:21 +0000421 function_ref<OptimizationRemarkEmitter &(Function *)> OREGetter;
Ivan Krasinf3403fd2016-08-11 19:09:02 +0000422
Peter Collingbourne50cbd7c2017-02-15 21:56:51 +0000423 MapVector<VTableSlot, VTableSlotInfo> CallSlots;
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000424
Peter Collingbourne0312f612016-06-25 00:23:04 +0000425 // This map keeps track of the number of "unsafe" uses of a loaded function
426 // pointer. The key is the associated llvm.type.test intrinsic call generated
427 // by this pass. An unsafe use is one that calls the loaded function pointer
428 // directly. Every time we eliminate an unsafe use (for example, by
429 // devirtualizing it or by applying virtual constant propagation), we
430 // decrement the value stored in this map. If a value reaches zero, we can
431 // eliminate the type check by RAUWing the associated llvm.type.test call with
432 // true.
433 std::map<CallInst *, unsigned> NumUnsafeUsesForTypeTest;
434
Peter Collingbourne37317f12017-02-17 18:17:04 +0000435 DevirtModule(Module &M, function_ref<AAResults &(Function &)> AARGetter,
Sam Elliotte963c892017-08-21 16:57:21 +0000436 function_ref<OptimizationRemarkEmitter &(Function *)> OREGetter,
Teresa Johnsonf24136f2018-09-27 14:55:32 +0000437 function_ref<DominatorTree &(Function &)> LookupDomTree,
Peter Collingbournef7691d82017-03-22 18:22:59 +0000438 ModuleSummaryIndex *ExportSummary,
439 const ModuleSummaryIndex *ImportSummary)
Teresa Johnsonf24136f2018-09-27 14:55:32 +0000440 : M(M), AARGetter(AARGetter), LookupDomTree(LookupDomTree),
441 ExportSummary(ExportSummary), ImportSummary(ImportSummary),
442 Int8Ty(Type::getInt8Ty(M.getContext())),
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000443 Int8PtrTy(Type::getInt8PtrTy(M.getContext())),
Ivan Krasinf3403fd2016-08-11 19:09:02 +0000444 Int32Ty(Type::getInt32Ty(M.getContext())),
Peter Collingbourne50cbd7c2017-02-15 21:56:51 +0000445 Int64Ty(Type::getInt64Ty(M.getContext())),
Peter Collingbourne14dcf022017-03-10 20:13:58 +0000446 IntPtrTy(M.getDataLayout().getIntPtrType(M.getContext(), 0)),
Sam Elliotte963c892017-08-21 16:57:21 +0000447 RemarksEnabled(areRemarksEnabled()), OREGetter(OREGetter) {
Peter Collingbournef7691d82017-03-22 18:22:59 +0000448 assert(!(ExportSummary && ImportSummary));
449 }
Ivan Krasinf3403fd2016-08-11 19:09:02 +0000450
451 bool areRemarksEnabled();
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000452
Peter Collingbourne0312f612016-06-25 00:23:04 +0000453 void scanTypeTestUsers(Function *TypeTestFunc, Function *AssumeFunc);
454 void scanTypeCheckedLoadUsers(Function *TypeCheckedLoadFunc);
455
Peter Collingbourne7efd7502016-06-24 21:21:32 +0000456 void buildTypeIdentifierMap(
457 std::vector<VTableBits> &Bits,
458 DenseMap<Metadata *, std::set<TypeMemberInfo>> &TypeIdMap);
Peter Collingbourne87867542016-12-09 01:10:11 +0000459 Constant *getPointerAtOffset(Constant *I, uint64_t Offset);
Peter Collingbourne7efd7502016-06-24 21:21:32 +0000460 bool
461 tryFindVirtualCallTargets(std::vector<VirtualCallTarget> &TargetsForSlot,
462 const std::set<TypeMemberInfo> &TypeMemberInfos,
463 uint64_t ByteOffset);
Peter Collingbourne50cbd7c2017-02-15 21:56:51 +0000464
Peter Collingbourne2325bb32017-03-04 01:31:01 +0000465 void applySingleImplDevirt(VTableSlotInfo &SlotInfo, Constant *TheFn,
466 bool &IsExported);
Ivan Krasinf3403fd2016-08-11 19:09:02 +0000467 bool trySingleImplDevirt(MutableArrayRef<VirtualCallTarget> TargetsForSlot,
Peter Collingbourne2325bb32017-03-04 01:31:01 +0000468 VTableSlotInfo &SlotInfo,
469 WholeProgramDevirtResolution *Res);
Peter Collingbourne50cbd7c2017-02-15 21:56:51 +0000470
Peter Collingbourne29748562018-03-09 19:11:44 +0000471 void applyICallBranchFunnel(VTableSlotInfo &SlotInfo, Constant *JT,
472 bool &IsExported);
473 void tryICallBranchFunnel(MutableArrayRef<VirtualCallTarget> TargetsForSlot,
474 VTableSlotInfo &SlotInfo,
475 WholeProgramDevirtResolution *Res, VTableSlot Slot);
476
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000477 bool tryEvaluateFunctionsWithArgs(
478 MutableArrayRef<VirtualCallTarget> TargetsForSlot,
Peter Collingbourne50cbd7c2017-02-15 21:56:51 +0000479 ArrayRef<uint64_t> Args);
480
481 void applyUniformRetValOpt(CallSiteInfo &CSInfo, StringRef FnName,
482 uint64_t TheRetVal);
483 bool tryUniformRetValOpt(MutableArrayRef<VirtualCallTarget> TargetsForSlot,
Peter Collingbourne77a8d562017-03-04 01:34:53 +0000484 CallSiteInfo &CSInfo,
485 WholeProgramDevirtResolution::ByArg *Res);
Peter Collingbourne50cbd7c2017-02-15 21:56:51 +0000486
Peter Collingbourne59675ba2017-03-10 20:09:11 +0000487 // Returns the global symbol name that is used to export information about the
488 // given vtable slot and list of arguments.
489 std::string getGlobalName(VTableSlot Slot, ArrayRef<uint64_t> Args,
490 StringRef Name);
491
Peter Collingbourneb15a35e2017-09-11 22:34:42 +0000492 bool shouldExportConstantsAsAbsoluteSymbols();
493
Peter Collingbourne59675ba2017-03-10 20:09:11 +0000494 // This function is called during the export phase to create a symbol
495 // definition containing information about the given vtable slot and list of
496 // arguments.
497 void exportGlobal(VTableSlot Slot, ArrayRef<uint64_t> Args, StringRef Name,
498 Constant *C);
Peter Collingbourneb15a35e2017-09-11 22:34:42 +0000499 void exportConstant(VTableSlot Slot, ArrayRef<uint64_t> Args, StringRef Name,
500 uint32_t Const, uint32_t &Storage);
Peter Collingbourne59675ba2017-03-10 20:09:11 +0000501
502 // This function is called during the import phase to create a reference to
503 // the symbol definition created during the export phase.
504 Constant *importGlobal(VTableSlot Slot, ArrayRef<uint64_t> Args,
Peter Collingbourneb15a35e2017-09-11 22:34:42 +0000505 StringRef Name);
506 Constant *importConstant(VTableSlot Slot, ArrayRef<uint64_t> Args,
507 StringRef Name, IntegerType *IntTy,
508 uint32_t Storage);
Peter Collingbourne59675ba2017-03-10 20:09:11 +0000509
Peter Collingbourne29748562018-03-09 19:11:44 +0000510 Constant *getMemberAddr(const TypeMemberInfo *M);
511
Peter Collingbourne50cbd7c2017-02-15 21:56:51 +0000512 void applyUniqueRetValOpt(CallSiteInfo &CSInfo, StringRef FnName, bool IsOne,
513 Constant *UniqueMemberAddr);
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000514 bool tryUniqueRetValOpt(unsigned BitWidth,
Ivan Krasinf3403fd2016-08-11 19:09:02 +0000515 MutableArrayRef<VirtualCallTarget> TargetsForSlot,
Peter Collingbourne59675ba2017-03-10 20:09:11 +0000516 CallSiteInfo &CSInfo,
517 WholeProgramDevirtResolution::ByArg *Res,
518 VTableSlot Slot, ArrayRef<uint64_t> Args);
Peter Collingbourne50cbd7c2017-02-15 21:56:51 +0000519
520 void applyVirtualConstProp(CallSiteInfo &CSInfo, StringRef FnName,
521 Constant *Byte, Constant *Bit);
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000522 bool tryVirtualConstProp(MutableArrayRef<VirtualCallTarget> TargetsForSlot,
Peter Collingbourne77a8d562017-03-04 01:34:53 +0000523 VTableSlotInfo &SlotInfo,
Peter Collingbourne59675ba2017-03-10 20:09:11 +0000524 WholeProgramDevirtResolution *Res, VTableSlot Slot);
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000525
526 void rebuildGlobal(VTableBits &B);
527
Peter Collingbourne6d284fa2017-03-09 00:21:25 +0000528 // Apply the summary resolution for Slot to all virtual calls in SlotInfo.
529 void importResolution(VTableSlot Slot, VTableSlotInfo &SlotInfo);
530
531 // If we were able to eliminate all unsafe uses for a type checked load,
532 // eliminate the associated type tests by replacing them with true.
533 void removeRedundantTypeTests();
534
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000535 bool run();
Peter Collingbourne2b33f652017-02-13 19:26:18 +0000536
537 // Lower the module using the action and summary passed as command line
538 // arguments. For testing purposes only.
Teresa Johnsonf24136f2018-09-27 14:55:32 +0000539 static bool
540 runForTesting(Module &M, function_ref<AAResults &(Function &)> AARGetter,
541 function_ref<OptimizationRemarkEmitter &(Function *)> OREGetter,
542 function_ref<DominatorTree &(Function &)> LookupDomTree);
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000543};
544
545struct WholeProgramDevirt : public ModulePass {
546 static char ID;
Eugene Zelenkocdc71612016-08-11 17:20:18 +0000547
Peter Collingbourne2b33f652017-02-13 19:26:18 +0000548 bool UseCommandLine = false;
549
Peter Collingbournef7691d82017-03-22 18:22:59 +0000550 ModuleSummaryIndex *ExportSummary;
551 const ModuleSummaryIndex *ImportSummary;
Peter Collingbourne2b33f652017-02-13 19:26:18 +0000552
553 WholeProgramDevirt() : ModulePass(ID), UseCommandLine(true) {
554 initializeWholeProgramDevirtPass(*PassRegistry::getPassRegistry());
555 }
556
Peter Collingbournef7691d82017-03-22 18:22:59 +0000557 WholeProgramDevirt(ModuleSummaryIndex *ExportSummary,
558 const ModuleSummaryIndex *ImportSummary)
559 : ModulePass(ID), ExportSummary(ExportSummary),
560 ImportSummary(ImportSummary) {
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000561 initializeWholeProgramDevirtPass(*PassRegistry::getPassRegistry());
562 }
Eugene Zelenkocdc71612016-08-11 17:20:18 +0000563
564 bool runOnModule(Module &M) override {
Andrew Kayloraa641a52016-04-22 22:06:11 +0000565 if (skipModule(M))
566 return false;
Sam Elliotte963c892017-08-21 16:57:21 +0000567
Peter Collingbourne9110cb42018-01-05 00:27:51 +0000568 // In the new pass manager, we can request the optimization
569 // remark emitter pass on a per-function-basis, which the
570 // OREGetter will do for us.
571 // In the old pass manager, this is harder, so we just build
572 // an optimization remark emitter on the fly, when we need it.
573 std::unique_ptr<OptimizationRemarkEmitter> ORE;
574 auto OREGetter = [&](Function *F) -> OptimizationRemarkEmitter & {
575 ORE = make_unique<OptimizationRemarkEmitter>(F);
576 return *ORE;
577 };
Sam Elliotte963c892017-08-21 16:57:21 +0000578
Teresa Johnsonf24136f2018-09-27 14:55:32 +0000579 auto LookupDomTree = [this](Function &F) -> DominatorTree & {
580 return this->getAnalysis<DominatorTreeWrapperPass>(F).getDomTree();
581 };
Sam Elliotte963c892017-08-21 16:57:21 +0000582
Teresa Johnsonf24136f2018-09-27 14:55:32 +0000583 if (UseCommandLine)
584 return DevirtModule::runForTesting(M, LegacyAARGetter(*this), OREGetter,
585 LookupDomTree);
586
587 return DevirtModule(M, LegacyAARGetter(*this), OREGetter, LookupDomTree,
588 ExportSummary, ImportSummary)
Peter Collingbournef7691d82017-03-22 18:22:59 +0000589 .run();
Peter Collingbourne37317f12017-02-17 18:17:04 +0000590 }
591
592 void getAnalysisUsage(AnalysisUsage &AU) const override {
593 AU.addRequired<AssumptionCacheTracker>();
594 AU.addRequired<TargetLibraryInfoWrapperPass>();
Teresa Johnsonf24136f2018-09-27 14:55:32 +0000595 AU.addRequired<DominatorTreeWrapperPass>();
Andrew Kayloraa641a52016-04-22 22:06:11 +0000596 }
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000597};
598
Eugene Zelenkocdc71612016-08-11 17:20:18 +0000599} // end anonymous namespace
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000600
Peter Collingbourne37317f12017-02-17 18:17:04 +0000601INITIALIZE_PASS_BEGIN(WholeProgramDevirt, "wholeprogramdevirt",
602 "Whole program devirtualization", false, false)
603INITIALIZE_PASS_DEPENDENCY(AssumptionCacheTracker)
604INITIALIZE_PASS_DEPENDENCY(TargetLibraryInfoWrapperPass)
Teresa Johnsonf24136f2018-09-27 14:55:32 +0000605INITIALIZE_PASS_DEPENDENCY(DominatorTreeWrapperPass)
Peter Collingbourne37317f12017-02-17 18:17:04 +0000606INITIALIZE_PASS_END(WholeProgramDevirt, "wholeprogramdevirt",
607 "Whole program devirtualization", false, false)
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000608char WholeProgramDevirt::ID = 0;
609
Peter Collingbournef7691d82017-03-22 18:22:59 +0000610ModulePass *
611llvm::createWholeProgramDevirtPass(ModuleSummaryIndex *ExportSummary,
612 const ModuleSummaryIndex *ImportSummary) {
613 return new WholeProgramDevirt(ExportSummary, ImportSummary);
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000614}
615
Chandler Carruth164a2aa62016-06-17 00:11:01 +0000616PreservedAnalyses WholeProgramDevirtPass::run(Module &M,
Peter Collingbourne37317f12017-02-17 18:17:04 +0000617 ModuleAnalysisManager &AM) {
618 auto &FAM = AM.getResult<FunctionAnalysisManagerModuleProxy>(M).getManager();
619 auto AARGetter = [&](Function &F) -> AAResults & {
620 return FAM.getResult<AAManager>(F);
621 };
Sam Elliotte963c892017-08-21 16:57:21 +0000622 auto OREGetter = [&](Function *F) -> OptimizationRemarkEmitter & {
623 return FAM.getResult<OptimizationRemarkEmitterAnalysis>(*F);
624 };
Teresa Johnsonf24136f2018-09-27 14:55:32 +0000625 auto LookupDomTree = [&FAM](Function &F) -> DominatorTree & {
626 return FAM.getResult<DominatorTreeAnalysis>(F);
627 };
628 if (!DevirtModule(M, AARGetter, OREGetter, LookupDomTree, ExportSummary,
629 ImportSummary)
Teresa Johnson28023db2018-07-19 14:51:32 +0000630 .run())
Davide Italianod737dd22016-06-14 21:44:19 +0000631 return PreservedAnalyses::all();
632 return PreservedAnalyses::none();
633}
634
Peter Collingbourne37317f12017-02-17 18:17:04 +0000635bool DevirtModule::runForTesting(
Sam Elliotte963c892017-08-21 16:57:21 +0000636 Module &M, function_ref<AAResults &(Function &)> AARGetter,
Teresa Johnsonf24136f2018-09-27 14:55:32 +0000637 function_ref<OptimizationRemarkEmitter &(Function *)> OREGetter,
638 function_ref<DominatorTree &(Function &)> LookupDomTree) {
Teresa Johnson4ffc3e72018-06-06 22:22:01 +0000639 ModuleSummaryIndex Summary(/*HaveGVs=*/false);
Peter Collingbourne2b33f652017-02-13 19:26:18 +0000640
641 // Handle the command-line summary arguments. This code is for testing
642 // purposes only, so we handle errors directly.
643 if (!ClReadSummary.empty()) {
644 ExitOnError ExitOnErr("-wholeprogramdevirt-read-summary: " + ClReadSummary +
645 ": ");
646 auto ReadSummaryFile =
647 ExitOnErr(errorOrToExpected(MemoryBuffer::getFile(ClReadSummary)));
648
649 yaml::Input In(ReadSummaryFile->getBuffer());
650 In >> Summary;
651 ExitOnErr(errorCodeToError(In.error()));
652 }
653
Peter Collingbournef7691d82017-03-22 18:22:59 +0000654 bool Changed =
655 DevirtModule(
Teresa Johnsonf24136f2018-09-27 14:55:32 +0000656 M, AARGetter, OREGetter, LookupDomTree,
Peter Collingbournef7691d82017-03-22 18:22:59 +0000657 ClSummaryAction == PassSummaryAction::Export ? &Summary : nullptr,
658 ClSummaryAction == PassSummaryAction::Import ? &Summary : nullptr)
659 .run();
Peter Collingbourne2b33f652017-02-13 19:26:18 +0000660
661 if (!ClWriteSummary.empty()) {
662 ExitOnError ExitOnErr(
663 "-wholeprogramdevirt-write-summary: " + ClWriteSummary + ": ");
664 std::error_code EC;
665 raw_fd_ostream OS(ClWriteSummary, EC, sys::fs::F_Text);
666 ExitOnErr(errorCodeToError(EC));
667
668 yaml::Output Out(OS);
669 Out << Summary;
670 }
671
672 return Changed;
673}
674
Peter Collingbourne7efd7502016-06-24 21:21:32 +0000675void DevirtModule::buildTypeIdentifierMap(
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000676 std::vector<VTableBits> &Bits,
Peter Collingbourne7efd7502016-06-24 21:21:32 +0000677 DenseMap<Metadata *, std::set<TypeMemberInfo>> &TypeIdMap) {
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000678 DenseMap<GlobalVariable *, VTableBits *> GVToBits;
Peter Collingbourne7efd7502016-06-24 21:21:32 +0000679 Bits.reserve(M.getGlobalList().size());
680 SmallVector<MDNode *, 2> Types;
681 for (GlobalVariable &GV : M.globals()) {
682 Types.clear();
683 GV.getMetadata(LLVMContext::MD_type, Types);
Eugene Leviant2b70d612018-09-23 13:27:47 +0000684 if (GV.isDeclaration() || Types.empty())
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000685 continue;
686
Peter Collingbourne7efd7502016-06-24 21:21:32 +0000687 VTableBits *&BitsPtr = GVToBits[&GV];
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000688 if (!BitsPtr) {
689 Bits.emplace_back();
Peter Collingbourne7efd7502016-06-24 21:21:32 +0000690 Bits.back().GV = &GV;
691 Bits.back().ObjectSize =
692 M.getDataLayout().getTypeAllocSize(GV.getInitializer()->getType());
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000693 BitsPtr = &Bits.back();
694 }
Peter Collingbourne7efd7502016-06-24 21:21:32 +0000695
696 for (MDNode *Type : Types) {
697 auto TypeID = Type->getOperand(1).get();
698
699 uint64_t Offset =
700 cast<ConstantInt>(
701 cast<ConstantAsMetadata>(Type->getOperand(0))->getValue())
702 ->getZExtValue();
703
704 TypeIdMap[TypeID].insert({BitsPtr, Offset});
705 }
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000706 }
707}
708
Peter Collingbourne87867542016-12-09 01:10:11 +0000709Constant *DevirtModule::getPointerAtOffset(Constant *I, uint64_t Offset) {
710 if (I->getType()->isPointerTy()) {
711 if (Offset == 0)
712 return I;
713 return nullptr;
714 }
715
Peter Collingbourne7a1e5bb2016-12-09 00:33:27 +0000716 const DataLayout &DL = M.getDataLayout();
Peter Collingbourne7a1e5bb2016-12-09 00:33:27 +0000717
718 if (auto *C = dyn_cast<ConstantStruct>(I)) {
719 const StructLayout *SL = DL.getStructLayout(C->getType());
Peter Collingbourne7a1e5bb2016-12-09 00:33:27 +0000720 if (Offset >= SL->getSizeInBytes())
721 return nullptr;
722
Peter Collingbourne87867542016-12-09 01:10:11 +0000723 unsigned Op = SL->getElementContainingOffset(Offset);
724 return getPointerAtOffset(cast<Constant>(I->getOperand(Op)),
725 Offset - SL->getElementOffset(Op));
726 }
727 if (auto *C = dyn_cast<ConstantArray>(I)) {
Peter Collingbourne7a1e5bb2016-12-09 00:33:27 +0000728 ArrayType *VTableTy = C->getType();
729 uint64_t ElemSize = DL.getTypeAllocSize(VTableTy->getElementType());
730
Peter Collingbourne87867542016-12-09 01:10:11 +0000731 unsigned Op = Offset / ElemSize;
Peter Collingbourne7a1e5bb2016-12-09 00:33:27 +0000732 if (Op >= C->getNumOperands())
733 return nullptr;
Peter Collingbourne7a1e5bb2016-12-09 00:33:27 +0000734
Peter Collingbourne87867542016-12-09 01:10:11 +0000735 return getPointerAtOffset(cast<Constant>(I->getOperand(Op)),
736 Offset % ElemSize);
737 }
738 return nullptr;
Peter Collingbourne7a1e5bb2016-12-09 00:33:27 +0000739}
740
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000741bool DevirtModule::tryFindVirtualCallTargets(
742 std::vector<VirtualCallTarget> &TargetsForSlot,
Peter Collingbourne7efd7502016-06-24 21:21:32 +0000743 const std::set<TypeMemberInfo> &TypeMemberInfos, uint64_t ByteOffset) {
744 for (const TypeMemberInfo &TM : TypeMemberInfos) {
745 if (!TM.Bits->GV->isConstant())
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000746 return false;
747
Peter Collingbourne87867542016-12-09 01:10:11 +0000748 Constant *Ptr = getPointerAtOffset(TM.Bits->GV->getInitializer(),
749 TM.Offset + ByteOffset);
750 if (!Ptr)
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000751 return false;
752
Peter Collingbourne87867542016-12-09 01:10:11 +0000753 auto Fn = dyn_cast<Function>(Ptr->stripPointerCasts());
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000754 if (!Fn)
755 return false;
756
757 // We can disregard __cxa_pure_virtual as a possible call target, as
758 // calls to pure virtuals are UB.
759 if (Fn->getName() == "__cxa_pure_virtual")
760 continue;
761
Peter Collingbourne7efd7502016-06-24 21:21:32 +0000762 TargetsForSlot.push_back({Fn, &TM});
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000763 }
764
765 // Give up if we couldn't find any targets.
766 return !TargetsForSlot.empty();
767}
768
Peter Collingbourne50cbd7c2017-02-15 21:56:51 +0000769void DevirtModule::applySingleImplDevirt(VTableSlotInfo &SlotInfo,
Peter Collingbourne2325bb32017-03-04 01:31:01 +0000770 Constant *TheFn, bool &IsExported) {
Peter Collingbourne50cbd7c2017-02-15 21:56:51 +0000771 auto Apply = [&](CallSiteInfo &CSInfo) {
772 for (auto &&VCallSite : CSInfo.CallSites) {
773 if (RemarksEnabled)
Teresa Johnsonb0a1d3b2018-08-14 03:00:16 +0000774 VCallSite.emitRemark("single-impl",
775 TheFn->stripPointerCasts()->getName(), OREGetter);
Peter Collingbourne50cbd7c2017-02-15 21:56:51 +0000776 VCallSite.CS.setCalledFunction(ConstantExpr::getBitCast(
777 TheFn, VCallSite.CS.getCalledValue()->getType()));
778 // This use is no longer unsafe.
779 if (VCallSite.NumUnsafeUses)
780 --*VCallSite.NumUnsafeUses;
781 }
Peter Collingbourne29748562018-03-09 19:11:44 +0000782 if (CSInfo.isExported())
Peter Collingbourne2325bb32017-03-04 01:31:01 +0000783 IsExported = true;
Peter Collingbourne29748562018-03-09 19:11:44 +0000784 CSInfo.markDevirt();
Peter Collingbourne50cbd7c2017-02-15 21:56:51 +0000785 };
786 Apply(SlotInfo.CSInfo);
787 for (auto &P : SlotInfo.ConstCSInfo)
788 Apply(P.second);
789}
790
Peter Collingbournee2367412017-02-15 02:13:08 +0000791bool DevirtModule::trySingleImplDevirt(
792 MutableArrayRef<VirtualCallTarget> TargetsForSlot,
Peter Collingbourne2325bb32017-03-04 01:31:01 +0000793 VTableSlotInfo &SlotInfo, WholeProgramDevirtResolution *Res) {
Peter Collingbournee2367412017-02-15 02:13:08 +0000794 // See if the program contains a single implementation of this virtual
795 // function.
796 Function *TheFn = TargetsForSlot[0].Fn;
797 for (auto &&Target : TargetsForSlot)
798 if (TheFn != Target.Fn)
799 return false;
800
Peter Collingbourne50cbd7c2017-02-15 21:56:51 +0000801 // If so, update each call site to call that implementation directly.
Peter Collingbournee2367412017-02-15 02:13:08 +0000802 if (RemarksEnabled)
803 TargetsForSlot[0].WasDevirt = true;
Peter Collingbourne2325bb32017-03-04 01:31:01 +0000804
805 bool IsExported = false;
806 applySingleImplDevirt(SlotInfo, TheFn, IsExported);
807 if (!IsExported)
808 return false;
809
810 // If the only implementation has local linkage, we must promote to external
811 // to make it visible to thin LTO objects. We can only get here during the
812 // ThinLTO export phase.
813 if (TheFn->hasLocalLinkage()) {
Peter Collingbourne88a58cf2017-09-08 00:10:53 +0000814 std::string NewName = (TheFn->getName() + "$merged").str();
815
816 // Since we are renaming the function, any comdats with the same name must
817 // also be renamed. This is required when targeting COFF, as the comdat name
818 // must match one of the names of the symbols in the comdat.
819 if (Comdat *C = TheFn->getComdat()) {
820 if (C->getName() == TheFn->getName()) {
821 Comdat *NewC = M.getOrInsertComdat(NewName);
822 NewC->setSelectionKind(C->getSelectionKind());
823 for (GlobalObject &GO : M.global_objects())
824 if (GO.getComdat() == C)
825 GO.setComdat(NewC);
826 }
827 }
828
Peter Collingbourne2325bb32017-03-04 01:31:01 +0000829 TheFn->setLinkage(GlobalValue::ExternalLinkage);
830 TheFn->setVisibility(GlobalValue::HiddenVisibility);
Peter Collingbourne88a58cf2017-09-08 00:10:53 +0000831 TheFn->setName(NewName);
Peter Collingbourne2325bb32017-03-04 01:31:01 +0000832 }
833
834 Res->TheKind = WholeProgramDevirtResolution::SingleImpl;
835 Res->SingleImplName = TheFn->getName();
836
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000837 return true;
838}
839
Peter Collingbourne29748562018-03-09 19:11:44 +0000840void DevirtModule::tryICallBranchFunnel(
841 MutableArrayRef<VirtualCallTarget> TargetsForSlot, VTableSlotInfo &SlotInfo,
842 WholeProgramDevirtResolution *Res, VTableSlot Slot) {
843 Triple T(M.getTargetTriple());
844 if (T.getArch() != Triple::x86_64)
845 return;
846
Vitaly Buka66f53d72018-04-06 21:32:36 +0000847 if (TargetsForSlot.size() > ClThreshold)
Peter Collingbourne29748562018-03-09 19:11:44 +0000848 return;
849
850 bool HasNonDevirt = !SlotInfo.CSInfo.AllCallSitesDevirted;
851 if (!HasNonDevirt)
852 for (auto &P : SlotInfo.ConstCSInfo)
853 if (!P.second.AllCallSitesDevirted) {
854 HasNonDevirt = true;
855 break;
856 }
857
858 if (!HasNonDevirt)
859 return;
860
861 FunctionType *FT =
862 FunctionType::get(Type::getVoidTy(M.getContext()), {Int8PtrTy}, true);
863 Function *JT;
864 if (isa<MDString>(Slot.TypeID)) {
865 JT = Function::Create(FT, Function::ExternalLinkage,
Dylan McKayf920da02018-12-18 09:52:52 +0000866 M.getDataLayout().getProgramAddressSpace(),
Peter Collingbourne29748562018-03-09 19:11:44 +0000867 getGlobalName(Slot, {}, "branch_funnel"), &M);
868 JT->setVisibility(GlobalValue::HiddenVisibility);
869 } else {
Dylan McKayf920da02018-12-18 09:52:52 +0000870 JT = Function::Create(FT, Function::InternalLinkage,
871 M.getDataLayout().getProgramAddressSpace(),
872 "branch_funnel", &M);
Peter Collingbourne29748562018-03-09 19:11:44 +0000873 }
874 JT->addAttribute(1, Attribute::Nest);
875
876 std::vector<Value *> JTArgs;
877 JTArgs.push_back(JT->arg_begin());
878 for (auto &T : TargetsForSlot) {
879 JTArgs.push_back(getMemberAddr(T.TM));
880 JTArgs.push_back(T.Fn);
881 }
882
883 BasicBlock *BB = BasicBlock::Create(M.getContext(), "", JT, nullptr);
James Y Knight7976eb52019-02-01 20:43:25 +0000884 Function *Intr =
Peter Collingbourne29748562018-03-09 19:11:44 +0000885 Intrinsic::getDeclaration(&M, llvm::Intrinsic::icall_branch_funnel, {});
886
887 auto *CI = CallInst::Create(Intr, JTArgs, "", BB);
888 CI->setTailCallKind(CallInst::TCK_MustTail);
889 ReturnInst::Create(M.getContext(), nullptr, BB);
890
891 bool IsExported = false;
892 applyICallBranchFunnel(SlotInfo, JT, IsExported);
893 if (IsExported)
894 Res->TheKind = WholeProgramDevirtResolution::BranchFunnel;
895}
896
897void DevirtModule::applyICallBranchFunnel(VTableSlotInfo &SlotInfo,
898 Constant *JT, bool &IsExported) {
899 auto Apply = [&](CallSiteInfo &CSInfo) {
900 if (CSInfo.isExported())
901 IsExported = true;
902 if (CSInfo.AllCallSitesDevirted)
903 return;
904 for (auto &&VCallSite : CSInfo.CallSites) {
905 CallSite CS = VCallSite.CS;
906
907 // Jump tables are only profitable if the retpoline mitigation is enabled.
908 Attribute FSAttr = CS.getCaller()->getFnAttribute("target-features");
909 if (FSAttr.hasAttribute(Attribute::None) ||
910 !FSAttr.getValueAsString().contains("+retpoline"))
911 continue;
912
913 if (RemarksEnabled)
Teresa Johnsonb0a1d3b2018-08-14 03:00:16 +0000914 VCallSite.emitRemark("branch-funnel",
915 JT->stripPointerCasts()->getName(), OREGetter);
Peter Collingbourne29748562018-03-09 19:11:44 +0000916
917 // Pass the address of the vtable in the nest register, which is r10 on
918 // x86_64.
919 std::vector<Type *> NewArgs;
920 NewArgs.push_back(Int8PtrTy);
921 for (Type *T : CS.getFunctionType()->params())
922 NewArgs.push_back(T);
James Y Knight7976eb52019-02-01 20:43:25 +0000923 FunctionType *NewFT =
Peter Collingbourne29748562018-03-09 19:11:44 +0000924 FunctionType::get(CS.getFunctionType()->getReturnType(), NewArgs,
James Y Knight7976eb52019-02-01 20:43:25 +0000925 CS.getFunctionType()->isVarArg());
926 PointerType *NewFTPtr = PointerType::getUnqual(NewFT);
Peter Collingbourne29748562018-03-09 19:11:44 +0000927
928 IRBuilder<> IRB(CS.getInstruction());
929 std::vector<Value *> Args;
930 Args.push_back(IRB.CreateBitCast(VCallSite.VTable, Int8PtrTy));
931 for (unsigned I = 0; I != CS.getNumArgOperands(); ++I)
932 Args.push_back(CS.getArgOperand(I));
933
934 CallSite NewCS;
935 if (CS.isCall())
James Y Knight7976eb52019-02-01 20:43:25 +0000936 NewCS = IRB.CreateCall(NewFT, IRB.CreateBitCast(JT, NewFTPtr), Args);
Peter Collingbourne29748562018-03-09 19:11:44 +0000937 else
938 NewCS = IRB.CreateInvoke(
James Y Knight7976eb52019-02-01 20:43:25 +0000939 IRB.CreateBitCast(JT, NewFTPtr),
Peter Collingbourne29748562018-03-09 19:11:44 +0000940 cast<InvokeInst>(CS.getInstruction())->getNormalDest(),
941 cast<InvokeInst>(CS.getInstruction())->getUnwindDest(), Args);
942 NewCS.setCallingConv(CS.getCallingConv());
943
944 AttributeList Attrs = CS.getAttributes();
945 std::vector<AttributeSet> NewArgAttrs;
946 NewArgAttrs.push_back(AttributeSet::get(
947 M.getContext(), ArrayRef<Attribute>{Attribute::get(
948 M.getContext(), Attribute::Nest)}));
949 for (unsigned I = 0; I + 2 < Attrs.getNumAttrSets(); ++I)
950 NewArgAttrs.push_back(Attrs.getParamAttributes(I));
951 NewCS.setAttributes(
952 AttributeList::get(M.getContext(), Attrs.getFnAttributes(),
953 Attrs.getRetAttributes(), NewArgAttrs));
954
955 CS->replaceAllUsesWith(NewCS.getInstruction());
956 CS->eraseFromParent();
957
958 // This use is no longer unsafe.
959 if (VCallSite.NumUnsafeUses)
960 --*VCallSite.NumUnsafeUses;
961 }
962 // Don't mark as devirtualized because there may be callers compiled without
963 // retpoline mitigation, which would mean that they are lowered to
964 // llvm.type.test and therefore require an llvm.type.test resolution for the
965 // type identifier.
966 };
967 Apply(SlotInfo.CSInfo);
968 for (auto &P : SlotInfo.ConstCSInfo)
969 Apply(P.second);
970}
971
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000972bool DevirtModule::tryEvaluateFunctionsWithArgs(
973 MutableArrayRef<VirtualCallTarget> TargetsForSlot,
Peter Collingbourne50cbd7c2017-02-15 21:56:51 +0000974 ArrayRef<uint64_t> Args) {
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000975 // Evaluate each function and store the result in each target's RetVal
976 // field.
977 for (VirtualCallTarget &Target : TargetsForSlot) {
978 if (Target.Fn->arg_size() != Args.size() + 1)
979 return false;
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000980
981 Evaluator Eval(M.getDataLayout(), nullptr);
982 SmallVector<Constant *, 2> EvalArgs;
983 EvalArgs.push_back(
984 Constant::getNullValue(Target.Fn->getFunctionType()->getParamType(0)));
Peter Collingbourne50cbd7c2017-02-15 21:56:51 +0000985 for (unsigned I = 0; I != Args.size(); ++I) {
986 auto *ArgTy = dyn_cast<IntegerType>(
987 Target.Fn->getFunctionType()->getParamType(I + 1));
988 if (!ArgTy)
989 return false;
990 EvalArgs.push_back(ConstantInt::get(ArgTy, Args[I]));
991 }
992
Peter Collingbournedf49d1b2016-02-09 22:50:34 +0000993 Constant *RetVal;
994 if (!Eval.EvaluateFunction(Target.Fn, RetVal, EvalArgs) ||
995 !isa<ConstantInt>(RetVal))
996 return false;
997 Target.RetVal = cast<ConstantInt>(RetVal)->getZExtValue();
998 }
999 return true;
1000}
1001
Peter Collingbourne50cbd7c2017-02-15 21:56:51 +00001002void DevirtModule::applyUniformRetValOpt(CallSiteInfo &CSInfo, StringRef FnName,
1003 uint64_t TheRetVal) {
1004 for (auto Call : CSInfo.CallSites)
1005 Call.replaceAndErase(
Sam Elliotte963c892017-08-21 16:57:21 +00001006 "uniform-ret-val", FnName, RemarksEnabled, OREGetter,
Peter Collingbourne50cbd7c2017-02-15 21:56:51 +00001007 ConstantInt::get(cast<IntegerType>(Call.CS.getType()), TheRetVal));
Peter Collingbourne59675ba2017-03-10 20:09:11 +00001008 CSInfo.markDevirt();
Peter Collingbourne50cbd7c2017-02-15 21:56:51 +00001009}
1010
Peter Collingbournedf49d1b2016-02-09 22:50:34 +00001011bool DevirtModule::tryUniformRetValOpt(
Peter Collingbourne77a8d562017-03-04 01:34:53 +00001012 MutableArrayRef<VirtualCallTarget> TargetsForSlot, CallSiteInfo &CSInfo,
1013 WholeProgramDevirtResolution::ByArg *Res) {
Peter Collingbournedf49d1b2016-02-09 22:50:34 +00001014 // Uniform return value optimization. If all functions return the same
1015 // constant, replace all calls with that constant.
1016 uint64_t TheRetVal = TargetsForSlot[0].RetVal;
1017 for (const VirtualCallTarget &Target : TargetsForSlot)
1018 if (Target.RetVal != TheRetVal)
1019 return false;
1020
Peter Collingbourne77a8d562017-03-04 01:34:53 +00001021 if (CSInfo.isExported()) {
1022 Res->TheKind = WholeProgramDevirtResolution::ByArg::UniformRetVal;
1023 Res->Info = TheRetVal;
1024 }
1025
Peter Collingbourne50cbd7c2017-02-15 21:56:51 +00001026 applyUniformRetValOpt(CSInfo, TargetsForSlot[0].Fn->getName(), TheRetVal);
Ivan Krasinf3403fd2016-08-11 19:09:02 +00001027 if (RemarksEnabled)
1028 for (auto &&Target : TargetsForSlot)
1029 Target.WasDevirt = true;
Peter Collingbournedf49d1b2016-02-09 22:50:34 +00001030 return true;
1031}
1032
Peter Collingbourne59675ba2017-03-10 20:09:11 +00001033std::string DevirtModule::getGlobalName(VTableSlot Slot,
1034 ArrayRef<uint64_t> Args,
1035 StringRef Name) {
1036 std::string FullName = "__typeid_";
1037 raw_string_ostream OS(FullName);
1038 OS << cast<MDString>(Slot.TypeID)->getString() << '_' << Slot.ByteOffset;
1039 for (uint64_t Arg : Args)
1040 OS << '_' << Arg;
1041 OS << '_' << Name;
1042 return OS.str();
1043}
1044
Peter Collingbourneb15a35e2017-09-11 22:34:42 +00001045bool DevirtModule::shouldExportConstantsAsAbsoluteSymbols() {
1046 Triple T(M.getTargetTriple());
1047 return (T.getArch() == Triple::x86 || T.getArch() == Triple::x86_64) &&
1048 T.getObjectFormat() == Triple::ELF;
1049}
1050
Peter Collingbourne59675ba2017-03-10 20:09:11 +00001051void DevirtModule::exportGlobal(VTableSlot Slot, ArrayRef<uint64_t> Args,
1052 StringRef Name, Constant *C) {
1053 GlobalAlias *GA = GlobalAlias::create(Int8Ty, 0, GlobalValue::ExternalLinkage,
1054 getGlobalName(Slot, Args, Name), C, &M);
1055 GA->setVisibility(GlobalValue::HiddenVisibility);
1056}
1057
Peter Collingbourneb15a35e2017-09-11 22:34:42 +00001058void DevirtModule::exportConstant(VTableSlot Slot, ArrayRef<uint64_t> Args,
1059 StringRef Name, uint32_t Const,
1060 uint32_t &Storage) {
1061 if (shouldExportConstantsAsAbsoluteSymbols()) {
1062 exportGlobal(
1063 Slot, Args, Name,
1064 ConstantExpr::getIntToPtr(ConstantInt::get(Int32Ty, Const), Int8PtrTy));
1065 return;
1066 }
1067
1068 Storage = Const;
1069}
1070
Peter Collingbourne59675ba2017-03-10 20:09:11 +00001071Constant *DevirtModule::importGlobal(VTableSlot Slot, ArrayRef<uint64_t> Args,
Peter Collingbourneb15a35e2017-09-11 22:34:42 +00001072 StringRef Name) {
Peter Collingbourne59675ba2017-03-10 20:09:11 +00001073 Constant *C = M.getOrInsertGlobal(getGlobalName(Slot, Args, Name), Int8Ty);
1074 auto *GV = dyn_cast<GlobalVariable>(C);
Peter Collingbourneb15a35e2017-09-11 22:34:42 +00001075 if (GV)
1076 GV->setVisibility(GlobalValue::HiddenVisibility);
1077 return C;
1078}
1079
1080Constant *DevirtModule::importConstant(VTableSlot Slot, ArrayRef<uint64_t> Args,
1081 StringRef Name, IntegerType *IntTy,
1082 uint32_t Storage) {
1083 if (!shouldExportConstantsAsAbsoluteSymbols())
1084 return ConstantInt::get(IntTy, Storage);
1085
1086 Constant *C = importGlobal(Slot, Args, Name);
1087 auto *GV = cast<GlobalVariable>(C->stripPointerCasts());
1088 C = ConstantExpr::getPtrToInt(C, IntTy);
1089
Peter Collingbourne14dcf022017-03-10 20:13:58 +00001090 // We only need to set metadata if the global is newly created, in which
1091 // case it would not have hidden visibility.
Benjamin Kramer0deb9a92018-05-31 13:29:58 +00001092 if (GV->hasMetadata(LLVMContext::MD_absolute_symbol))
Peter Collingbourne59675ba2017-03-10 20:09:11 +00001093 return C;
Peter Collingbourne14dcf022017-03-10 20:13:58 +00001094
Peter Collingbourne14dcf022017-03-10 20:13:58 +00001095 auto SetAbsRange = [&](uint64_t Min, uint64_t Max) {
1096 auto *MinC = ConstantAsMetadata::get(ConstantInt::get(IntPtrTy, Min));
1097 auto *MaxC = ConstantAsMetadata::get(ConstantInt::get(IntPtrTy, Max));
1098 GV->setMetadata(LLVMContext::MD_absolute_symbol,
1099 MDNode::get(M.getContext(), {MinC, MaxC}));
1100 };
Peter Collingbourneb15a35e2017-09-11 22:34:42 +00001101 unsigned AbsWidth = IntTy->getBitWidth();
Peter Collingbourne14dcf022017-03-10 20:13:58 +00001102 if (AbsWidth == IntPtrTy->getBitWidth())
1103 SetAbsRange(~0ull, ~0ull); // Full set.
Peter Collingbourneb15a35e2017-09-11 22:34:42 +00001104 else
Peter Collingbourne14dcf022017-03-10 20:13:58 +00001105 SetAbsRange(0, 1ull << AbsWidth);
Peter Collingbourneb15a35e2017-09-11 22:34:42 +00001106 return C;
Peter Collingbourne59675ba2017-03-10 20:09:11 +00001107}
1108
Peter Collingbourne50cbd7c2017-02-15 21:56:51 +00001109void DevirtModule::applyUniqueRetValOpt(CallSiteInfo &CSInfo, StringRef FnName,
1110 bool IsOne,
1111 Constant *UniqueMemberAddr) {
1112 for (auto &&Call : CSInfo.CallSites) {
1113 IRBuilder<> B(Call.CS.getInstruction());
Peter Collingbourne001052a2017-08-22 21:41:19 +00001114 Value *Cmp =
1115 B.CreateICmp(IsOne ? ICmpInst::ICMP_EQ : ICmpInst::ICMP_NE,
1116 B.CreateBitCast(Call.VTable, Int8PtrTy), UniqueMemberAddr);
Peter Collingbourne50cbd7c2017-02-15 21:56:51 +00001117 Cmp = B.CreateZExt(Cmp, Call.CS->getType());
Sam Elliotte963c892017-08-21 16:57:21 +00001118 Call.replaceAndErase("unique-ret-val", FnName, RemarksEnabled, OREGetter,
1119 Cmp);
Peter Collingbourne50cbd7c2017-02-15 21:56:51 +00001120 }
Peter Collingbourne59675ba2017-03-10 20:09:11 +00001121 CSInfo.markDevirt();
Peter Collingbourne50cbd7c2017-02-15 21:56:51 +00001122}
1123
Peter Collingbourne29748562018-03-09 19:11:44 +00001124Constant *DevirtModule::getMemberAddr(const TypeMemberInfo *M) {
1125 Constant *C = ConstantExpr::getBitCast(M->Bits->GV, Int8PtrTy);
1126 return ConstantExpr::getGetElementPtr(Int8Ty, C,
1127 ConstantInt::get(Int64Ty, M->Offset));
1128}
1129
Peter Collingbournedf49d1b2016-02-09 22:50:34 +00001130bool DevirtModule::tryUniqueRetValOpt(
Ivan Krasinf3403fd2016-08-11 19:09:02 +00001131 unsigned BitWidth, MutableArrayRef<VirtualCallTarget> TargetsForSlot,
Peter Collingbourne59675ba2017-03-10 20:09:11 +00001132 CallSiteInfo &CSInfo, WholeProgramDevirtResolution::ByArg *Res,
1133 VTableSlot Slot, ArrayRef<uint64_t> Args) {
Peter Collingbournedf49d1b2016-02-09 22:50:34 +00001134 // IsOne controls whether we look for a 0 or a 1.
1135 auto tryUniqueRetValOptFor = [&](bool IsOne) {
Eugene Zelenkocdc71612016-08-11 17:20:18 +00001136 const TypeMemberInfo *UniqueMember = nullptr;
Peter Collingbournedf49d1b2016-02-09 22:50:34 +00001137 for (const VirtualCallTarget &Target : TargetsForSlot) {
Peter Collingbourne3866cc52016-03-08 03:50:36 +00001138 if (Target.RetVal == (IsOne ? 1 : 0)) {
Peter Collingbourne7efd7502016-06-24 21:21:32 +00001139 if (UniqueMember)
Peter Collingbournedf49d1b2016-02-09 22:50:34 +00001140 return false;
Peter Collingbourne7efd7502016-06-24 21:21:32 +00001141 UniqueMember = Target.TM;
Peter Collingbournedf49d1b2016-02-09 22:50:34 +00001142 }
1143 }
1144
Peter Collingbourne7efd7502016-06-24 21:21:32 +00001145 // We should have found a unique member or bailed out by now. We already
Peter Collingbournedf49d1b2016-02-09 22:50:34 +00001146 // checked for a uniform return value in tryUniformRetValOpt.
Peter Collingbourne7efd7502016-06-24 21:21:32 +00001147 assert(UniqueMember);
Peter Collingbournedf49d1b2016-02-09 22:50:34 +00001148
Peter Collingbourne29748562018-03-09 19:11:44 +00001149 Constant *UniqueMemberAddr = getMemberAddr(UniqueMember);
Peter Collingbourne59675ba2017-03-10 20:09:11 +00001150 if (CSInfo.isExported()) {
1151 Res->TheKind = WholeProgramDevirtResolution::ByArg::UniqueRetVal;
1152 Res->Info = IsOne;
1153
1154 exportGlobal(Slot, Args, "unique_member", UniqueMemberAddr);
1155 }
1156
1157 // Replace each call with the comparison.
Peter Collingbourne50cbd7c2017-02-15 21:56:51 +00001158 applyUniqueRetValOpt(CSInfo, TargetsForSlot[0].Fn->getName(), IsOne,
1159 UniqueMemberAddr);
1160
Ivan Krasinf3403fd2016-08-11 19:09:02 +00001161 // Update devirtualization statistics for targets.
1162 if (RemarksEnabled)
1163 for (auto &&Target : TargetsForSlot)
1164 Target.WasDevirt = true;
1165
Peter Collingbournedf49d1b2016-02-09 22:50:34 +00001166 return true;
1167 };
1168
1169 if (BitWidth == 1) {
1170 if (tryUniqueRetValOptFor(true))
1171 return true;
1172 if (tryUniqueRetValOptFor(false))
1173 return true;
1174 }
1175 return false;
1176}
1177
Peter Collingbourne50cbd7c2017-02-15 21:56:51 +00001178void DevirtModule::applyVirtualConstProp(CallSiteInfo &CSInfo, StringRef FnName,
1179 Constant *Byte, Constant *Bit) {
1180 for (auto Call : CSInfo.CallSites) {
1181 auto *RetType = cast<IntegerType>(Call.CS.getType());
1182 IRBuilder<> B(Call.CS.getInstruction());
Peter Collingbourne001052a2017-08-22 21:41:19 +00001183 Value *Addr =
1184 B.CreateGEP(Int8Ty, B.CreateBitCast(Call.VTable, Int8PtrTy), Byte);
Peter Collingbourne50cbd7c2017-02-15 21:56:51 +00001185 if (RetType->getBitWidth() == 1) {
1186 Value *Bits = B.CreateLoad(Addr);
1187 Value *BitsAndBit = B.CreateAnd(Bits, Bit);
1188 auto IsBitSet = B.CreateICmpNE(BitsAndBit, ConstantInt::get(Int8Ty, 0));
1189 Call.replaceAndErase("virtual-const-prop-1-bit", FnName, RemarksEnabled,
Sam Elliotte963c892017-08-21 16:57:21 +00001190 OREGetter, IsBitSet);
Peter Collingbourne50cbd7c2017-02-15 21:56:51 +00001191 } else {
1192 Value *ValAddr = B.CreateBitCast(Addr, RetType->getPointerTo());
1193 Value *Val = B.CreateLoad(RetType, ValAddr);
Sam Elliotte963c892017-08-21 16:57:21 +00001194 Call.replaceAndErase("virtual-const-prop", FnName, RemarksEnabled,
1195 OREGetter, Val);
Peter Collingbourne50cbd7c2017-02-15 21:56:51 +00001196 }
1197 }
Peter Collingbourne14dcf022017-03-10 20:13:58 +00001198 CSInfo.markDevirt();
Peter Collingbourne50cbd7c2017-02-15 21:56:51 +00001199}
1200
Peter Collingbournedf49d1b2016-02-09 22:50:34 +00001201bool DevirtModule::tryVirtualConstProp(
Peter Collingbourne59675ba2017-03-10 20:09:11 +00001202 MutableArrayRef<VirtualCallTarget> TargetsForSlot, VTableSlotInfo &SlotInfo,
1203 WholeProgramDevirtResolution *Res, VTableSlot Slot) {
Peter Collingbournedf49d1b2016-02-09 22:50:34 +00001204 // This only works if the function returns an integer.
1205 auto RetType = dyn_cast<IntegerType>(TargetsForSlot[0].Fn->getReturnType());
1206 if (!RetType)
1207 return false;
1208 unsigned BitWidth = RetType->getBitWidth();
1209 if (BitWidth > 64)
1210 return false;
1211
Peter Collingbourne17febdb2017-02-09 23:46:26 +00001212 // Make sure that each function is defined, does not access memory, takes at
1213 // least one argument, does not use its first argument (which we assume is
1214 // 'this'), and has the same return type.
Peter Collingbourne37317f12017-02-17 18:17:04 +00001215 //
1216 // Note that we test whether this copy of the function is readnone, rather
1217 // than testing function attributes, which must hold for any copy of the
1218 // function, even a less optimized version substituted at link time. This is
1219 // sound because the virtual constant propagation optimizations effectively
1220 // inline all implementations of the virtual function into each call site,
1221 // rather than using function attributes to perform local optimization.
Peter Collingbournedf49d1b2016-02-09 22:50:34 +00001222 for (VirtualCallTarget &Target : TargetsForSlot) {
Peter Collingbourne37317f12017-02-17 18:17:04 +00001223 if (Target.Fn->isDeclaration() ||
1224 computeFunctionBodyMemoryAccess(*Target.Fn, AARGetter(*Target.Fn)) !=
1225 MAK_ReadNone ||
Peter Collingbourne17febdb2017-02-09 23:46:26 +00001226 Target.Fn->arg_empty() || !Target.Fn->arg_begin()->use_empty() ||
Peter Collingbournedf49d1b2016-02-09 22:50:34 +00001227 Target.Fn->getReturnType() != RetType)
1228 return false;
1229 }
1230
Peter Collingbourne50cbd7c2017-02-15 21:56:51 +00001231 for (auto &&CSByConstantArg : SlotInfo.ConstCSInfo) {
Peter Collingbournedf49d1b2016-02-09 22:50:34 +00001232 if (!tryEvaluateFunctionsWithArgs(TargetsForSlot, CSByConstantArg.first))
1233 continue;
1234
Peter Collingbourne77a8d562017-03-04 01:34:53 +00001235 WholeProgramDevirtResolution::ByArg *ResByArg = nullptr;
1236 if (Res)
1237 ResByArg = &Res->ResByArg[CSByConstantArg.first];
1238
1239 if (tryUniformRetValOpt(TargetsForSlot, CSByConstantArg.second, ResByArg))
Peter Collingbournedf49d1b2016-02-09 22:50:34 +00001240 continue;
1241
Peter Collingbourne59675ba2017-03-10 20:09:11 +00001242 if (tryUniqueRetValOpt(BitWidth, TargetsForSlot, CSByConstantArg.second,
1243 ResByArg, Slot, CSByConstantArg.first))
Peter Collingbournedf49d1b2016-02-09 22:50:34 +00001244 continue;
1245
Peter Collingbourne7efd7502016-06-24 21:21:32 +00001246 // Find an allocation offset in bits in all vtables associated with the
1247 // type.
Peter Collingbournedf49d1b2016-02-09 22:50:34 +00001248 uint64_t AllocBefore =
1249 findLowestOffset(TargetsForSlot, /*IsAfter=*/false, BitWidth);
1250 uint64_t AllocAfter =
1251 findLowestOffset(TargetsForSlot, /*IsAfter=*/true, BitWidth);
1252
1253 // Calculate the total amount of padding needed to store a value at both
1254 // ends of the object.
1255 uint64_t TotalPaddingBefore = 0, TotalPaddingAfter = 0;
1256 for (auto &&Target : TargetsForSlot) {
1257 TotalPaddingBefore += std::max<int64_t>(
1258 (AllocBefore + 7) / 8 - Target.allocatedBeforeBytes() - 1, 0);
1259 TotalPaddingAfter += std::max<int64_t>(
1260 (AllocAfter + 7) / 8 - Target.allocatedAfterBytes() - 1, 0);
1261 }
1262
1263 // If the amount of padding is too large, give up.
1264 // FIXME: do something smarter here.
1265 if (std::min(TotalPaddingBefore, TotalPaddingAfter) > 128)
1266 continue;
1267
1268 // Calculate the offset to the value as a (possibly negative) byte offset
1269 // and (if applicable) a bit offset, and store the values in the targets.
1270 int64_t OffsetByte;
1271 uint64_t OffsetBit;
1272 if (TotalPaddingBefore <= TotalPaddingAfter)
1273 setBeforeReturnValues(TargetsForSlot, AllocBefore, BitWidth, OffsetByte,
1274 OffsetBit);
1275 else
1276 setAfterReturnValues(TargetsForSlot, AllocAfter, BitWidth, OffsetByte,
1277 OffsetBit);
1278
Ivan Krasinf3403fd2016-08-11 19:09:02 +00001279 if (RemarksEnabled)
1280 for (auto &&Target : TargetsForSlot)
1281 Target.WasDevirt = true;
1282
Peter Collingbourne14dcf022017-03-10 20:13:58 +00001283
1284 if (CSByConstantArg.second.isExported()) {
1285 ResByArg->TheKind = WholeProgramDevirtResolution::ByArg::VirtualConstProp;
Peter Collingbourneb15a35e2017-09-11 22:34:42 +00001286 exportConstant(Slot, CSByConstantArg.first, "byte", OffsetByte,
1287 ResByArg->Byte);
1288 exportConstant(Slot, CSByConstantArg.first, "bit", 1ULL << OffsetBit,
1289 ResByArg->Bit);
Peter Collingbourne14dcf022017-03-10 20:13:58 +00001290 }
1291
1292 // Rewrite each call to a load from OffsetByte/OffsetBit.
Peter Collingbourneb15a35e2017-09-11 22:34:42 +00001293 Constant *ByteConst = ConstantInt::get(Int32Ty, OffsetByte);
1294 Constant *BitConst = ConstantInt::get(Int8Ty, 1ULL << OffsetBit);
Peter Collingbourne50cbd7c2017-02-15 21:56:51 +00001295 applyVirtualConstProp(CSByConstantArg.second,
1296 TargetsForSlot[0].Fn->getName(), ByteConst, BitConst);
Peter Collingbournedf49d1b2016-02-09 22:50:34 +00001297 }
1298 return true;
1299}
1300
1301void DevirtModule::rebuildGlobal(VTableBits &B) {
1302 if (B.Before.Bytes.empty() && B.After.Bytes.empty())
1303 return;
1304
1305 // Align each byte array to pointer width.
1306 unsigned PointerSize = M.getDataLayout().getPointerSize();
1307 B.Before.Bytes.resize(alignTo(B.Before.Bytes.size(), PointerSize));
1308 B.After.Bytes.resize(alignTo(B.After.Bytes.size(), PointerSize));
1309
1310 // Before was stored in reverse order; flip it now.
1311 for (size_t I = 0, Size = B.Before.Bytes.size(); I != Size / 2; ++I)
1312 std::swap(B.Before.Bytes[I], B.Before.Bytes[Size - 1 - I]);
1313
1314 // Build an anonymous global containing the before bytes, followed by the
1315 // original initializer, followed by the after bytes.
1316 auto NewInit = ConstantStruct::getAnon(
1317 {ConstantDataArray::get(M.getContext(), B.Before.Bytes),
1318 B.GV->getInitializer(),
1319 ConstantDataArray::get(M.getContext(), B.After.Bytes)});
1320 auto NewGV =
1321 new GlobalVariable(M, NewInit->getType(), B.GV->isConstant(),
1322 GlobalVariable::PrivateLinkage, NewInit, "", B.GV);
1323 NewGV->setSection(B.GV->getSection());
1324 NewGV->setComdat(B.GV->getComdat());
1325
Peter Collingbourne0312f612016-06-25 00:23:04 +00001326 // Copy the original vtable's metadata to the anonymous global, adjusting
1327 // offsets as required.
1328 NewGV->copyMetadata(B.GV, B.Before.Bytes.size());
1329
Peter Collingbournedf49d1b2016-02-09 22:50:34 +00001330 // Build an alias named after the original global, pointing at the second
1331 // element (the original initializer).
1332 auto Alias = GlobalAlias::create(
1333 B.GV->getInitializer()->getType(), 0, B.GV->getLinkage(), "",
1334 ConstantExpr::getGetElementPtr(
1335 NewInit->getType(), NewGV,
1336 ArrayRef<Constant *>{ConstantInt::get(Int32Ty, 0),
1337 ConstantInt::get(Int32Ty, 1)}),
1338 &M);
1339 Alias->setVisibility(B.GV->getVisibility());
1340 Alias->takeName(B.GV);
1341
1342 B.GV->replaceAllUsesWith(Alias);
1343 B.GV->eraseFromParent();
1344}
1345
Ivan Krasinf3403fd2016-08-11 19:09:02 +00001346bool DevirtModule::areRemarksEnabled() {
1347 const auto &FL = M.getFunctionList();
Teresa Johnson5e1c0e72018-09-18 13:42:24 +00001348 for (const Function &Fn : FL) {
1349 const auto &BBL = Fn.getBasicBlockList();
1350 if (BBL.empty())
1351 continue;
1352 auto DI = OptimizationRemark(DEBUG_TYPE, "", DebugLoc(), &BBL.front());
1353 return DI.isEnabled();
1354 }
1355 return false;
Ivan Krasinf3403fd2016-08-11 19:09:02 +00001356}
1357
Peter Collingbourne0312f612016-06-25 00:23:04 +00001358void DevirtModule::scanTypeTestUsers(Function *TypeTestFunc,
1359 Function *AssumeFunc) {
Peter Collingbournedf49d1b2016-02-09 22:50:34 +00001360 // Find all virtual calls via a virtual table pointer %p under an assumption
Peter Collingbourne7efd7502016-06-24 21:21:32 +00001361 // of the form llvm.assume(llvm.type.test(%p, %md)). This indicates that %p
1362 // points to a member of the type identifier %md. Group calls by (type ID,
1363 // offset) pair (effectively the identity of the virtual function) and store
1364 // to CallSlots.
Teresa Johnsonf24136f2018-09-27 14:55:32 +00001365 DenseSet<CallSite> SeenCallSites;
Peter Collingbourne7efd7502016-06-24 21:21:32 +00001366 for (auto I = TypeTestFunc->use_begin(), E = TypeTestFunc->use_end();
Peter Collingbournedf49d1b2016-02-09 22:50:34 +00001367 I != E;) {
1368 auto CI = dyn_cast<CallInst>(I->getUser());
1369 ++I;
1370 if (!CI)
1371 continue;
1372
Peter Collingbourneccdc2252016-05-10 18:07:21 +00001373 // Search for virtual calls based on %p and add them to DevirtCalls.
1374 SmallVector<DevirtCallSite, 1> DevirtCalls;
Peter Collingbournedf49d1b2016-02-09 22:50:34 +00001375 SmallVector<CallInst *, 1> Assumes;
Teresa Johnsonf24136f2018-09-27 14:55:32 +00001376 auto &DT = LookupDomTree(*CI->getFunction());
1377 findDevirtualizableCallsForTypeTest(DevirtCalls, Assumes, CI, DT);
Peter Collingbournedf49d1b2016-02-09 22:50:34 +00001378
Teresa Johnsonf24136f2018-09-27 14:55:32 +00001379 // If we found any, add them to CallSlots.
Peter Collingbournedf49d1b2016-02-09 22:50:34 +00001380 if (!Assumes.empty()) {
Peter Collingbourne7efd7502016-06-24 21:21:32 +00001381 Metadata *TypeId =
Peter Collingbournedf49d1b2016-02-09 22:50:34 +00001382 cast<MetadataAsValue>(CI->getArgOperand(1))->getMetadata();
1383 Value *Ptr = CI->getArgOperand(0)->stripPointerCasts();
Teresa Johnsonf24136f2018-09-27 14:55:32 +00001384 for (DevirtCallSite Call : DevirtCalls) {
1385 // Only add this CallSite if we haven't seen it before. The vtable
1386 // pointer may have been CSE'd with pointers from other call sites,
1387 // and we don't want to process call sites multiple times. We can't
1388 // just skip the vtable Ptr if it has been seen before, however, since
1389 // it may be shared by type tests that dominate different calls.
1390 if (SeenCallSites.insert(Call.CS).second)
Peter Collingbourne001052a2017-08-22 21:41:19 +00001391 CallSlots[{TypeId, Call.Offset}].addCallSite(Ptr, Call.CS, nullptr);
Peter Collingbourneccdc2252016-05-10 18:07:21 +00001392 }
Peter Collingbournedf49d1b2016-02-09 22:50:34 +00001393 }
1394
Peter Collingbourne7efd7502016-06-24 21:21:32 +00001395 // We no longer need the assumes or the type test.
Peter Collingbournedf49d1b2016-02-09 22:50:34 +00001396 for (auto Assume : Assumes)
1397 Assume->eraseFromParent();
1398 // We can't use RecursivelyDeleteTriviallyDeadInstructions here because we
1399 // may use the vtable argument later.
1400 if (CI->use_empty())
1401 CI->eraseFromParent();
1402 }
Peter Collingbourne0312f612016-06-25 00:23:04 +00001403}
1404
1405void DevirtModule::scanTypeCheckedLoadUsers(Function *TypeCheckedLoadFunc) {
1406 Function *TypeTestFunc = Intrinsic::getDeclaration(&M, Intrinsic::type_test);
1407
1408 for (auto I = TypeCheckedLoadFunc->use_begin(),
1409 E = TypeCheckedLoadFunc->use_end();
1410 I != E;) {
1411 auto CI = dyn_cast<CallInst>(I->getUser());
1412 ++I;
1413 if (!CI)
1414 continue;
1415
1416 Value *Ptr = CI->getArgOperand(0);
1417 Value *Offset = CI->getArgOperand(1);
1418 Value *TypeIdValue = CI->getArgOperand(2);
1419 Metadata *TypeId = cast<MetadataAsValue>(TypeIdValue)->getMetadata();
1420
1421 SmallVector<DevirtCallSite, 1> DevirtCalls;
1422 SmallVector<Instruction *, 1> LoadedPtrs;
1423 SmallVector<Instruction *, 1> Preds;
1424 bool HasNonCallUses = false;
Teresa Johnsonf24136f2018-09-27 14:55:32 +00001425 auto &DT = LookupDomTree(*CI->getFunction());
Peter Collingbourne0312f612016-06-25 00:23:04 +00001426 findDevirtualizableCallsForTypeCheckedLoad(DevirtCalls, LoadedPtrs, Preds,
Teresa Johnsonf24136f2018-09-27 14:55:32 +00001427 HasNonCallUses, CI, DT);
Peter Collingbourne0312f612016-06-25 00:23:04 +00001428
1429 // Start by generating "pessimistic" code that explicitly loads the function
1430 // pointer from the vtable and performs the type check. If possible, we will
1431 // eliminate the load and the type check later.
1432
1433 // If possible, only generate the load at the point where it is used.
1434 // This helps avoid unnecessary spills.
1435 IRBuilder<> LoadB(
1436 (LoadedPtrs.size() == 1 && !HasNonCallUses) ? LoadedPtrs[0] : CI);
1437 Value *GEP = LoadB.CreateGEP(Int8Ty, Ptr, Offset);
1438 Value *GEPPtr = LoadB.CreateBitCast(GEP, PointerType::getUnqual(Int8PtrTy));
1439 Value *LoadedValue = LoadB.CreateLoad(Int8PtrTy, GEPPtr);
1440
1441 for (Instruction *LoadedPtr : LoadedPtrs) {
1442 LoadedPtr->replaceAllUsesWith(LoadedValue);
1443 LoadedPtr->eraseFromParent();
1444 }
1445
1446 // Likewise for the type test.
1447 IRBuilder<> CallB((Preds.size() == 1 && !HasNonCallUses) ? Preds[0] : CI);
1448 CallInst *TypeTestCall = CallB.CreateCall(TypeTestFunc, {Ptr, TypeIdValue});
1449
1450 for (Instruction *Pred : Preds) {
1451 Pred->replaceAllUsesWith(TypeTestCall);
1452 Pred->eraseFromParent();
1453 }
1454
1455 // We have already erased any extractvalue instructions that refer to the
1456 // intrinsic call, but the intrinsic may have other non-extractvalue uses
1457 // (although this is unlikely). In that case, explicitly build a pair and
1458 // RAUW it.
1459 if (!CI->use_empty()) {
1460 Value *Pair = UndefValue::get(CI->getType());
1461 IRBuilder<> B(CI);
1462 Pair = B.CreateInsertValue(Pair, LoadedValue, {0});
1463 Pair = B.CreateInsertValue(Pair, TypeTestCall, {1});
1464 CI->replaceAllUsesWith(Pair);
1465 }
1466
1467 // The number of unsafe uses is initially the number of uses.
1468 auto &NumUnsafeUses = NumUnsafeUsesForTypeTest[TypeTestCall];
1469 NumUnsafeUses = DevirtCalls.size();
1470
1471 // If the function pointer has a non-call user, we cannot eliminate the type
1472 // check, as one of those users may eventually call the pointer. Increment
1473 // the unsafe use count to make sure it cannot reach zero.
1474 if (HasNonCallUses)
1475 ++NumUnsafeUses;
1476 for (DevirtCallSite Call : DevirtCalls) {
Peter Collingbourne50cbd7c2017-02-15 21:56:51 +00001477 CallSlots[{TypeId, Call.Offset}].addCallSite(Ptr, Call.CS,
1478 &NumUnsafeUses);
Peter Collingbourne0312f612016-06-25 00:23:04 +00001479 }
1480
1481 CI->eraseFromParent();
1482 }
1483}
1484
Peter Collingbourne6d284fa2017-03-09 00:21:25 +00001485void DevirtModule::importResolution(VTableSlot Slot, VTableSlotInfo &SlotInfo) {
Peter Collingbourne9a3f9792017-03-22 18:04:39 +00001486 const TypeIdSummary *TidSummary =
Peter Collingbournef7691d82017-03-22 18:22:59 +00001487 ImportSummary->getTypeIdSummary(cast<MDString>(Slot.TypeID)->getString());
Peter Collingbourne9a3f9792017-03-22 18:04:39 +00001488 if (!TidSummary)
1489 return;
1490 auto ResI = TidSummary->WPDRes.find(Slot.ByteOffset);
1491 if (ResI == TidSummary->WPDRes.end())
1492 return;
1493 const WholeProgramDevirtResolution &Res = ResI->second;
Peter Collingbourne6d284fa2017-03-09 00:21:25 +00001494
1495 if (Res.TheKind == WholeProgramDevirtResolution::SingleImpl) {
1496 // The type of the function in the declaration is irrelevant because every
1497 // call site will cast it to the correct type.
James Y Knight13680222019-02-01 02:28:03 +00001498 Constant *SingleImpl =
1499 cast<Constant>(M.getOrInsertFunction(Res.SingleImplName,
1500 Type::getVoidTy(M.getContext()))
1501 .getCallee());
Peter Collingbourne6d284fa2017-03-09 00:21:25 +00001502
1503 // This is the import phase so we should not be exporting anything.
1504 bool IsExported = false;
1505 applySingleImplDevirt(SlotInfo, SingleImpl, IsExported);
1506 assert(!IsExported);
1507 }
Peter Collingbourne0152c812017-03-09 01:11:15 +00001508
1509 for (auto &CSByConstantArg : SlotInfo.ConstCSInfo) {
1510 auto I = Res.ResByArg.find(CSByConstantArg.first);
1511 if (I == Res.ResByArg.end())
1512 continue;
1513 auto &ResByArg = I->second;
1514 // FIXME: We should figure out what to do about the "function name" argument
1515 // to the apply* functions, as the function names are unavailable during the
1516 // importing phase. For now we just pass the empty string. This does not
1517 // impact correctness because the function names are just used for remarks.
1518 switch (ResByArg.TheKind) {
1519 case WholeProgramDevirtResolution::ByArg::UniformRetVal:
1520 applyUniformRetValOpt(CSByConstantArg.second, "", ResByArg.Info);
1521 break;
Peter Collingbourne59675ba2017-03-10 20:09:11 +00001522 case WholeProgramDevirtResolution::ByArg::UniqueRetVal: {
1523 Constant *UniqueMemberAddr =
1524 importGlobal(Slot, CSByConstantArg.first, "unique_member");
1525 applyUniqueRetValOpt(CSByConstantArg.second, "", ResByArg.Info,
1526 UniqueMemberAddr);
1527 break;
1528 }
Peter Collingbourne14dcf022017-03-10 20:13:58 +00001529 case WholeProgramDevirtResolution::ByArg::VirtualConstProp: {
Peter Collingbourneb15a35e2017-09-11 22:34:42 +00001530 Constant *Byte = importConstant(Slot, CSByConstantArg.first, "byte",
1531 Int32Ty, ResByArg.Byte);
1532 Constant *Bit = importConstant(Slot, CSByConstantArg.first, "bit", Int8Ty,
1533 ResByArg.Bit);
Peter Collingbourne14dcf022017-03-10 20:13:58 +00001534 applyVirtualConstProp(CSByConstantArg.second, "", Byte, Bit);
Adrian Prantl0e6694d2017-12-19 22:05:25 +00001535 break;
Peter Collingbourne14dcf022017-03-10 20:13:58 +00001536 }
Peter Collingbourne0152c812017-03-09 01:11:15 +00001537 default:
1538 break;
1539 }
1540 }
Peter Collingbourne29748562018-03-09 19:11:44 +00001541
1542 if (Res.TheKind == WholeProgramDevirtResolution::BranchFunnel) {
James Y Knight13680222019-02-01 02:28:03 +00001543 // The type of the function is irrelevant, because it's bitcast at calls
1544 // anyhow.
1545 Constant *JT = cast<Constant>(
1546 M.getOrInsertFunction(getGlobalName(Slot, {}, "branch_funnel"),
1547 Type::getVoidTy(M.getContext()))
1548 .getCallee());
Peter Collingbourne29748562018-03-09 19:11:44 +00001549 bool IsExported = false;
1550 applyICallBranchFunnel(SlotInfo, JT, IsExported);
1551 assert(!IsExported);
1552 }
Peter Collingbourne6d284fa2017-03-09 00:21:25 +00001553}
1554
1555void DevirtModule::removeRedundantTypeTests() {
1556 auto True = ConstantInt::getTrue(M.getContext());
1557 for (auto &&U : NumUnsafeUsesForTypeTest) {
1558 if (U.second == 0) {
1559 U.first->replaceAllUsesWith(True);
1560 U.first->eraseFromParent();
1561 }
1562 }
1563}
1564
Peter Collingbourne0312f612016-06-25 00:23:04 +00001565bool DevirtModule::run() {
1566 Function *TypeTestFunc =
1567 M.getFunction(Intrinsic::getName(Intrinsic::type_test));
1568 Function *TypeCheckedLoadFunc =
1569 M.getFunction(Intrinsic::getName(Intrinsic::type_checked_load));
1570 Function *AssumeFunc = M.getFunction(Intrinsic::getName(Intrinsic::assume));
1571
Teresa Johnson290a8392019-01-11 18:31:57 +00001572 // If only some of the modules were split, we cannot correctly handle
1573 // code that contains type tests or type checked loads.
1574 if ((ExportSummary && ExportSummary->partiallySplitLTOUnits()) ||
1575 (ImportSummary && ImportSummary->partiallySplitLTOUnits())) {
1576 if ((TypeTestFunc && !TypeTestFunc->use_empty()) ||
1577 (TypeCheckedLoadFunc && !TypeCheckedLoadFunc->use_empty()))
1578 report_fatal_error("inconsistent LTO Unit splitting with llvm.type.test "
1579 "or llvm.type.checked.load");
1580 return false;
1581 }
1582
Peter Collingbourneb406baa2017-03-04 01:23:30 +00001583 // Normally if there are no users of the devirtualization intrinsics in the
1584 // module, this pass has nothing to do. But if we are exporting, we also need
1585 // to handle any users that appear only in the function summaries.
Peter Collingbournef7691d82017-03-22 18:22:59 +00001586 if (!ExportSummary &&
Peter Collingbourneb406baa2017-03-04 01:23:30 +00001587 (!TypeTestFunc || TypeTestFunc->use_empty() || !AssumeFunc ||
Peter Collingbourne0312f612016-06-25 00:23:04 +00001588 AssumeFunc->use_empty()) &&
1589 (!TypeCheckedLoadFunc || TypeCheckedLoadFunc->use_empty()))
1590 return false;
1591
1592 if (TypeTestFunc && AssumeFunc)
1593 scanTypeTestUsers(TypeTestFunc, AssumeFunc);
1594
1595 if (TypeCheckedLoadFunc)
1596 scanTypeCheckedLoadUsers(TypeCheckedLoadFunc);
Peter Collingbournedf49d1b2016-02-09 22:50:34 +00001597
Peter Collingbournef7691d82017-03-22 18:22:59 +00001598 if (ImportSummary) {
Peter Collingbourne6d284fa2017-03-09 00:21:25 +00001599 for (auto &S : CallSlots)
1600 importResolution(S.first, S.second);
1601
1602 removeRedundantTypeTests();
1603
1604 // The rest of the code is only necessary when exporting or during regular
1605 // LTO, so we are done.
1606 return true;
1607 }
1608
Peter Collingbourne7efd7502016-06-24 21:21:32 +00001609 // Rebuild type metadata into a map for easy lookup.
Peter Collingbournedf49d1b2016-02-09 22:50:34 +00001610 std::vector<VTableBits> Bits;
Peter Collingbourne7efd7502016-06-24 21:21:32 +00001611 DenseMap<Metadata *, std::set<TypeMemberInfo>> TypeIdMap;
1612 buildTypeIdentifierMap(Bits, TypeIdMap);
1613 if (TypeIdMap.empty())
Peter Collingbournedf49d1b2016-02-09 22:50:34 +00001614 return true;
1615
Peter Collingbourneb406baa2017-03-04 01:23:30 +00001616 // Collect information from summary about which calls to try to devirtualize.
Peter Collingbournef7691d82017-03-22 18:22:59 +00001617 if (ExportSummary) {
Peter Collingbourneb406baa2017-03-04 01:23:30 +00001618 DenseMap<GlobalValue::GUID, TinyPtrVector<Metadata *>> MetadataByGUID;
1619 for (auto &P : TypeIdMap) {
1620 if (auto *TypeId = dyn_cast<MDString>(P.first))
1621 MetadataByGUID[GlobalValue::getGUID(TypeId->getString())].push_back(
1622 TypeId);
1623 }
1624
Peter Collingbournef7691d82017-03-22 18:22:59 +00001625 for (auto &P : *ExportSummary) {
Peter Collingbourne9667b912017-05-04 18:03:25 +00001626 for (auto &S : P.second.SummaryList) {
Peter Collingbourneb406baa2017-03-04 01:23:30 +00001627 auto *FS = dyn_cast<FunctionSummary>(S.get());
1628 if (!FS)
1629 continue;
1630 // FIXME: Only add live functions.
George Rimar5d8aea12017-03-10 10:31:56 +00001631 for (FunctionSummary::VFuncId VF : FS->type_test_assume_vcalls()) {
1632 for (Metadata *MD : MetadataByGUID[VF.GUID]) {
Peter Collingbourne29748562018-03-09 19:11:44 +00001633 CallSlots[{MD, VF.Offset}]
1634 .CSInfo.markSummaryHasTypeTestAssumeUsers();
George Rimar5d8aea12017-03-10 10:31:56 +00001635 }
1636 }
1637 for (FunctionSummary::VFuncId VF : FS->type_checked_load_vcalls()) {
1638 for (Metadata *MD : MetadataByGUID[VF.GUID]) {
Peter Collingbourne29748562018-03-09 19:11:44 +00001639 CallSlots[{MD, VF.Offset}].CSInfo.addSummaryTypeCheckedLoadUser(FS);
George Rimar5d8aea12017-03-10 10:31:56 +00001640 }
1641 }
Peter Collingbourneb406baa2017-03-04 01:23:30 +00001642 for (const FunctionSummary::ConstVCall &VC :
George Rimar5d8aea12017-03-10 10:31:56 +00001643 FS->type_test_assume_const_vcalls()) {
1644 for (Metadata *MD : MetadataByGUID[VC.VFunc.GUID]) {
Peter Collingbourne2325bb32017-03-04 01:31:01 +00001645 CallSlots[{MD, VC.VFunc.Offset}]
George Rimar5d8aea12017-03-10 10:31:56 +00001646 .ConstCSInfo[VC.Args]
Peter Collingbourne29748562018-03-09 19:11:44 +00001647 .markSummaryHasTypeTestAssumeUsers();
George Rimar5d8aea12017-03-10 10:31:56 +00001648 }
1649 }
Peter Collingbourne2325bb32017-03-04 01:31:01 +00001650 for (const FunctionSummary::ConstVCall &VC :
George Rimar5d8aea12017-03-10 10:31:56 +00001651 FS->type_checked_load_const_vcalls()) {
1652 for (Metadata *MD : MetadataByGUID[VC.VFunc.GUID]) {
Peter Collingbourneb406baa2017-03-04 01:23:30 +00001653 CallSlots[{MD, VC.VFunc.Offset}]
1654 .ConstCSInfo[VC.Args]
Peter Collingbourne29748562018-03-09 19:11:44 +00001655 .addSummaryTypeCheckedLoadUser(FS);
George Rimar5d8aea12017-03-10 10:31:56 +00001656 }
1657 }
Peter Collingbourneb406baa2017-03-04 01:23:30 +00001658 }
1659 }
1660 }
1661
Peter Collingbourne7efd7502016-06-24 21:21:32 +00001662 // For each (type, offset) pair:
Peter Collingbournedf49d1b2016-02-09 22:50:34 +00001663 bool DidVirtualConstProp = false;
Ivan Krasinf3403fd2016-08-11 19:09:02 +00001664 std::map<std::string, Function*> DevirtTargets;
Peter Collingbournedf49d1b2016-02-09 22:50:34 +00001665 for (auto &S : CallSlots) {
Peter Collingbourne7efd7502016-06-24 21:21:32 +00001666 // Search each of the members of the type identifier for the virtual
1667 // function implementation at offset S.first.ByteOffset, and add to
1668 // TargetsForSlot.
Peter Collingbournedf49d1b2016-02-09 22:50:34 +00001669 std::vector<VirtualCallTarget> TargetsForSlot;
Peter Collingbourneb406baa2017-03-04 01:23:30 +00001670 if (tryFindVirtualCallTargets(TargetsForSlot, TypeIdMap[S.first.TypeID],
1671 S.first.ByteOffset)) {
Peter Collingbourne2325bb32017-03-04 01:31:01 +00001672 WholeProgramDevirtResolution *Res = nullptr;
Peter Collingbournef7691d82017-03-22 18:22:59 +00001673 if (ExportSummary && isa<MDString>(S.first.TypeID))
1674 Res = &ExportSummary
Peter Collingbourne9a3f9792017-03-22 18:04:39 +00001675 ->getOrInsertTypeIdSummary(
1676 cast<MDString>(S.first.TypeID)->getString())
1677 .WPDRes[S.first.ByteOffset];
Peter Collingbourne2325bb32017-03-04 01:31:01 +00001678
Peter Collingbourne29748562018-03-09 19:11:44 +00001679 if (!trySingleImplDevirt(TargetsForSlot, S.second, Res)) {
1680 DidVirtualConstProp |=
1681 tryVirtualConstProp(TargetsForSlot, S.second, Res, S.first);
1682
1683 tryICallBranchFunnel(TargetsForSlot, S.second, Res, S.first);
1684 }
Peter Collingbournedf49d1b2016-02-09 22:50:34 +00001685
Peter Collingbourneb406baa2017-03-04 01:23:30 +00001686 // Collect functions devirtualized at least for one call site for stats.
1687 if (RemarksEnabled)
1688 for (const auto &T : TargetsForSlot)
1689 if (T.WasDevirt)
1690 DevirtTargets[T.Fn->getName()] = T.Fn;
1691 }
1692
1693 // CFI-specific: if we are exporting and any llvm.type.checked.load
1694 // intrinsics were *not* devirtualized, we need to add the resulting
1695 // llvm.type.test intrinsics to the function summaries so that the
1696 // LowerTypeTests pass will export them.
Peter Collingbournef7691d82017-03-22 18:22:59 +00001697 if (ExportSummary && isa<MDString>(S.first.TypeID)) {
Peter Collingbourneb406baa2017-03-04 01:23:30 +00001698 auto GUID =
1699 GlobalValue::getGUID(cast<MDString>(S.first.TypeID)->getString());
1700 for (auto FS : S.second.CSInfo.SummaryTypeCheckedLoadUsers)
1701 FS->addTypeTest(GUID);
1702 for (auto &CCS : S.second.ConstCSInfo)
1703 for (auto FS : CCS.second.SummaryTypeCheckedLoadUsers)
1704 FS->addTypeTest(GUID);
1705 }
Ivan Krasinf3403fd2016-08-11 19:09:02 +00001706 }
1707
1708 if (RemarksEnabled) {
1709 // Generate remarks for each devirtualized function.
1710 for (const auto &DT : DevirtTargets) {
1711 Function *F = DT.second;
Sam Elliotte963c892017-08-21 16:57:21 +00001712
Sam Elliotte963c892017-08-21 16:57:21 +00001713 using namespace ore;
Peter Collingbourne9110cb42018-01-05 00:27:51 +00001714 OREGetter(F).emit(OptimizationRemark(DEBUG_TYPE, "Devirtualized", F)
1715 << "devirtualized "
1716 << NV("FunctionName", F->getName()));
Ivan Krasinb05e06e2016-08-05 19:45:16 +00001717 }
Peter Collingbournedf49d1b2016-02-09 22:50:34 +00001718 }
1719
Peter Collingbourne6d284fa2017-03-09 00:21:25 +00001720 removeRedundantTypeTests();
Peter Collingbourne0312f612016-06-25 00:23:04 +00001721
Peter Collingbournedf49d1b2016-02-09 22:50:34 +00001722 // Rebuild each global we touched as part of virtual constant propagation to
1723 // include the before and after bytes.
1724 if (DidVirtualConstProp)
1725 for (VTableBits &B : Bits)
1726 rebuildGlobal(B);
1727
1728 return true;
1729}