1 //===- RewriteStatepointsForGC.cpp - Make GC relocations explicit ---------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // Rewrite an existing set of gc.statepoints such that they make potential
11 // relocations performed by the garbage collector explicit in the IR.
13 //===----------------------------------------------------------------------===//
15 #include "llvm/Pass.h"
16 #include "llvm/Analysis/CFG.h"
17 #include "llvm/Analysis/InstructionSimplify.h"
18 #include "llvm/Analysis/TargetTransformInfo.h"
19 #include "llvm/ADT/SetOperations.h"
20 #include "llvm/ADT/Statistic.h"
21 #include "llvm/ADT/DenseSet.h"
22 #include "llvm/ADT/SetVector.h"
23 #include "llvm/ADT/StringRef.h"
24 #include "llvm/ADT/MapVector.h"
25 #include "llvm/IR/BasicBlock.h"
26 #include "llvm/IR/CallSite.h"
27 #include "llvm/IR/Dominators.h"
28 #include "llvm/IR/Function.h"
29 #include "llvm/IR/IRBuilder.h"
30 #include "llvm/IR/InstIterator.h"
31 #include "llvm/IR/Instructions.h"
32 #include "llvm/IR/Intrinsics.h"
33 #include "llvm/IR/IntrinsicInst.h"
34 #include "llvm/IR/Module.h"
35 #include "llvm/IR/MDBuilder.h"
36 #include "llvm/IR/Statepoint.h"
37 #include "llvm/IR/Value.h"
38 #include "llvm/IR/Verifier.h"
39 #include "llvm/Support/Debug.h"
40 #include "llvm/Support/CommandLine.h"
41 #include "llvm/Transforms/Scalar.h"
42 #include "llvm/Transforms/Utils/BasicBlockUtils.h"
43 #include "llvm/Transforms/Utils/Cloning.h"
44 #include "llvm/Transforms/Utils/Local.h"
45 #include "llvm/Transforms/Utils/PromoteMemToReg.h"
47 #define DEBUG_TYPE "rewrite-statepoints-for-gc"
51 // Print the liveset found at the insert location
52 static cl::opt<bool> PrintLiveSet("spp-print-liveset", cl::Hidden,
54 static cl::opt<bool> PrintLiveSetSize("spp-print-liveset-size", cl::Hidden,
56 // Print out the base pointers for debugging
57 static cl::opt<bool> PrintBasePointers("spp-print-base-pointers", cl::Hidden,
60 // Cost threshold measuring when it is profitable to rematerialize value instead
62 static cl::opt<unsigned>
63 RematerializationThreshold("spp-rematerialization-threshold", cl::Hidden,
67 static bool ClobberNonLive = true;
69 static bool ClobberNonLive = false;
71 static cl::opt<bool, true> ClobberNonLiveOverride("rs4gc-clobber-non-live",
72 cl::location(ClobberNonLive),
75 static cl::opt<bool> UseDeoptBundles("rs4gc-use-deopt-bundles", cl::Hidden,
78 AllowStatepointWithNoDeoptInfo("rs4gc-allow-statepoint-with-no-deopt-info",
79 cl::Hidden, cl::init(true));
81 /// Should we split vectors of pointers into their individual elements? This
82 /// is known to be buggy, but the alternate implementation isn't yet ready.
83 /// This is purely to provide a debugging and dianostic hook until the vector
84 /// split is replaced with vector relocations.
85 static cl::opt<bool> UseVectorSplit("rs4gc-split-vector-values", cl::Hidden,
89 struct RewriteStatepointsForGC : public ModulePass {
90 static char ID; // Pass identification, replacement for typeid
92 RewriteStatepointsForGC() : ModulePass(ID) {
93 initializeRewriteStatepointsForGCPass(*PassRegistry::getPassRegistry());
95 bool runOnFunction(Function &F);
96 bool runOnModule(Module &M) override {
99 Changed |= runOnFunction(F);
102 // stripNonValidAttributes asserts that shouldRewriteStatepointsIn
103 // returns true for at least one function in the module. Since at least
104 // one function changed, we know that the precondition is satisfied.
105 stripNonValidAttributes(M);
111 void getAnalysisUsage(AnalysisUsage &AU) const override {
112 // We add and rewrite a bunch of instructions, but don't really do much
113 // else. We could in theory preserve a lot more analyses here.
114 AU.addRequired<DominatorTreeWrapperPass>();
115 AU.addRequired<TargetTransformInfoWrapperPass>();
118 /// The IR fed into RewriteStatepointsForGC may have had attributes implying
119 /// dereferenceability that are no longer valid/correct after
120 /// RewriteStatepointsForGC has run. This is because semantically, after
121 /// RewriteStatepointsForGC runs, all calls to gc.statepoint "free" the entire
122 /// heap. stripNonValidAttributes (conservatively) restores correctness
123 /// by erasing all attributes in the module that externally imply
124 /// dereferenceability.
125 /// Similar reasoning also applies to the noalias attributes. gc.statepoint
126 /// can touch the entire heap including noalias objects.
127 void stripNonValidAttributes(Module &M);
129 // Helpers for stripNonValidAttributes
130 void stripNonValidAttributesFromBody(Function &F);
131 void stripNonValidAttributesFromPrototype(Function &F);
135 char RewriteStatepointsForGC::ID = 0;
137 ModulePass *llvm::createRewriteStatepointsForGCPass() {
138 return new RewriteStatepointsForGC();
141 INITIALIZE_PASS_BEGIN(RewriteStatepointsForGC, "rewrite-statepoints-for-gc",
142 "Make relocations explicit at statepoints", false, false)
143 INITIALIZE_PASS_DEPENDENCY(DominatorTreeWrapperPass)
144 INITIALIZE_PASS_END(RewriteStatepointsForGC, "rewrite-statepoints-for-gc",
145 "Make relocations explicit at statepoints", false, false)
148 struct GCPtrLivenessData {
149 /// Values defined in this block.
150 DenseMap<BasicBlock *, DenseSet<Value *>> KillSet;
151 /// Values used in this block (and thus live); does not included values
152 /// killed within this block.
153 DenseMap<BasicBlock *, DenseSet<Value *>> LiveSet;
155 /// Values live into this basic block (i.e. used by any
156 /// instruction in this basic block or ones reachable from here)
157 DenseMap<BasicBlock *, DenseSet<Value *>> LiveIn;
159 /// Values live out of this basic block (i.e. live into
160 /// any successor block)
161 DenseMap<BasicBlock *, DenseSet<Value *>> LiveOut;
164 // The type of the internal cache used inside the findBasePointers family
165 // of functions. From the callers perspective, this is an opaque type and
166 // should not be inspected.
168 // In the actual implementation this caches two relations:
169 // - The base relation itself (i.e. this pointer is based on that one)
170 // - The base defining value relation (i.e. before base_phi insertion)
171 // Generally, after the execution of a full findBasePointer call, only the
172 // base relation will remain. Internally, we add a mixture of the two
173 // types, then update all the second type to the first type
174 typedef DenseMap<Value *, Value *> DefiningValueMapTy;
175 typedef DenseSet<Value *> StatepointLiveSetTy;
176 typedef DenseMap<AssertingVH<Instruction>, AssertingVH<Value>>
177 RematerializedValueMapTy;
179 struct PartiallyConstructedSafepointRecord {
180 /// The set of values known to be live across this safepoint
181 StatepointLiveSetTy LiveSet;
183 /// Mapping from live pointers to a base-defining-value
184 DenseMap<Value *, Value *> PointerToBase;
186 /// The *new* gc.statepoint instruction itself. This produces the token
187 /// that normal path gc.relocates and the gc.result are tied to.
188 Instruction *StatepointToken;
190 /// Instruction to which exceptional gc relocates are attached
191 /// Makes it easier to iterate through them during relocationViaAlloca.
192 Instruction *UnwindToken;
194 /// Record live values we are rematerialized instead of relocating.
195 /// They are not included into 'LiveSet' field.
196 /// Maps rematerialized copy to it's original value.
197 RematerializedValueMapTy RematerializedValues;
201 static ArrayRef<Use> GetDeoptBundleOperands(ImmutableCallSite CS) {
202 assert(UseDeoptBundles && "Should not be called otherwise!");
204 Optional<OperandBundleUse> DeoptBundle = CS.getOperandBundle("deopt");
206 if (!DeoptBundle.hasValue()) {
207 assert(AllowStatepointWithNoDeoptInfo &&
208 "Found non-leaf call without deopt info!");
212 return DeoptBundle.getValue().Inputs;
215 /// Compute the live-in set for every basic block in the function
216 static void computeLiveInValues(DominatorTree &DT, Function &F,
217 GCPtrLivenessData &Data);
219 /// Given results from the dataflow liveness computation, find the set of live
220 /// Values at a particular instruction.
221 static void findLiveSetAtInst(Instruction *inst, GCPtrLivenessData &Data,
222 StatepointLiveSetTy &out);
224 // TODO: Once we can get to the GCStrategy, this becomes
225 // Optional<bool> isGCManagedPointer(const Type *Ty) const override {
227 static bool isGCPointerType(Type *T) {
228 if (auto *PT = dyn_cast<PointerType>(T))
229 // For the sake of this example GC, we arbitrarily pick addrspace(1) as our
230 // GC managed heap. We know that a pointer into this heap needs to be
231 // updated and that no other pointer does.
232 return (1 == PT->getAddressSpace());
236 // Return true if this type is one which a) is a gc pointer or contains a GC
237 // pointer and b) is of a type this code expects to encounter as a live value.
238 // (The insertion code will assert that a type which matches (a) and not (b)
239 // is not encountered.)
240 static bool isHandledGCPointerType(Type *T) {
241 // We fully support gc pointers
242 if (isGCPointerType(T))
244 // We partially support vectors of gc pointers. The code will assert if it
245 // can't handle something.
246 if (auto VT = dyn_cast<VectorType>(T))
247 if (isGCPointerType(VT->getElementType()))
253 /// Returns true if this type contains a gc pointer whether we know how to
254 /// handle that type or not.
255 static bool containsGCPtrType(Type *Ty) {
256 if (isGCPointerType(Ty))
258 if (VectorType *VT = dyn_cast<VectorType>(Ty))
259 return isGCPointerType(VT->getScalarType());
260 if (ArrayType *AT = dyn_cast<ArrayType>(Ty))
261 return containsGCPtrType(AT->getElementType());
262 if (StructType *ST = dyn_cast<StructType>(Ty))
263 return std::any_of(ST->subtypes().begin(), ST->subtypes().end(),
268 // Returns true if this is a type which a) is a gc pointer or contains a GC
269 // pointer and b) is of a type which the code doesn't expect (i.e. first class
270 // aggregates). Used to trip assertions.
271 static bool isUnhandledGCPointerType(Type *Ty) {
272 return containsGCPtrType(Ty) && !isHandledGCPointerType(Ty);
276 static bool order_by_name(Value *a, Value *b) {
277 if (a->hasName() && b->hasName()) {
278 return -1 == a->getName().compare(b->getName());
279 } else if (a->hasName() && !b->hasName()) {
281 } else if (!a->hasName() && b->hasName()) {
284 // Better than nothing, but not stable
289 // Return the name of the value suffixed with the provided value, or if the
290 // value didn't have a name, the default value specified.
291 static std::string suffixed_name_or(Value *V, StringRef Suffix,
292 StringRef DefaultName) {
293 return V->hasName() ? (V->getName() + Suffix).str() : DefaultName.str();
296 // Conservatively identifies any definitions which might be live at the
297 // given instruction. The analysis is performed immediately before the
298 // given instruction. Values defined by that instruction are not considered
299 // live. Values used by that instruction are considered live.
300 static void analyzeParsePointLiveness(
301 DominatorTree &DT, GCPtrLivenessData &OriginalLivenessData,
302 const CallSite &CS, PartiallyConstructedSafepointRecord &result) {
303 Instruction *inst = CS.getInstruction();
305 StatepointLiveSetTy LiveSet;
306 findLiveSetAtInst(inst, OriginalLivenessData, LiveSet);
309 // Note: This output is used by several of the test cases
310 // The order of elements in a set is not stable, put them in a vec and sort
312 SmallVector<Value *, 64> Temp;
313 Temp.insert(Temp.end(), LiveSet.begin(), LiveSet.end());
314 std::sort(Temp.begin(), Temp.end(), order_by_name);
315 errs() << "Live Variables:\n";
316 for (Value *V : Temp)
317 dbgs() << " " << V->getName() << " " << *V << "\n";
319 if (PrintLiveSetSize) {
320 errs() << "Safepoint For: " << CS.getCalledValue()->getName() << "\n";
321 errs() << "Number live values: " << LiveSet.size() << "\n";
323 result.LiveSet = LiveSet;
326 static bool isKnownBaseResult(Value *V);
328 /// A single base defining value - An immediate base defining value for an
329 /// instruction 'Def' is an input to 'Def' whose base is also a base of 'Def'.
330 /// For instructions which have multiple pointer [vector] inputs or that
331 /// transition between vector and scalar types, there is no immediate base
332 /// defining value. The 'base defining value' for 'Def' is the transitive
333 /// closure of this relation stopping at the first instruction which has no
334 /// immediate base defining value. The b.d.v. might itself be a base pointer,
335 /// but it can also be an arbitrary derived pointer.
336 struct BaseDefiningValueResult {
337 /// Contains the value which is the base defining value.
339 /// True if the base defining value is also known to be an actual base
341 const bool IsKnownBase;
342 BaseDefiningValueResult(Value *BDV, bool IsKnownBase)
343 : BDV(BDV), IsKnownBase(IsKnownBase) {
345 // Check consistency between new and old means of checking whether a BDV is
347 bool MustBeBase = isKnownBaseResult(BDV);
348 assert(!MustBeBase || MustBeBase == IsKnownBase);
354 static BaseDefiningValueResult findBaseDefiningValue(Value *I);
356 /// Return a base defining value for the 'Index' element of the given vector
357 /// instruction 'I'. If Index is null, returns a BDV for the entire vector
358 /// 'I'. As an optimization, this method will try to determine when the
359 /// element is known to already be a base pointer. If this can be established,
360 /// the second value in the returned pair will be true. Note that either a
361 /// vector or a pointer typed value can be returned. For the former, the
362 /// vector returned is a BDV (and possibly a base) of the entire vector 'I'.
363 /// If the later, the return pointer is a BDV (or possibly a base) for the
364 /// particular element in 'I'.
365 static BaseDefiningValueResult
366 findBaseDefiningValueOfVector(Value *I) {
367 assert(I->getType()->isVectorTy() &&
368 cast<VectorType>(I->getType())->getElementType()->isPointerTy() &&
369 "Illegal to ask for the base pointer of a non-pointer type");
371 // Each case parallels findBaseDefiningValue below, see that code for
372 // detailed motivation.
374 if (isa<Argument>(I))
375 // An incoming argument to the function is a base pointer
376 return BaseDefiningValueResult(I, true);
378 // We shouldn't see the address of a global as a vector value?
379 assert(!isa<GlobalVariable>(I) &&
380 "unexpected global variable found in base of vector");
382 // inlining could possibly introduce phi node that contains
383 // undef if callee has multiple returns
384 if (isa<UndefValue>(I))
385 // utterly meaningless, but useful for dealing with partially optimized
387 return BaseDefiningValueResult(I, true);
389 // Due to inheritance, this must be _after_ the global variable and undef
391 if (Constant *Con = dyn_cast<Constant>(I)) {
392 assert(!isa<GlobalVariable>(I) && !isa<UndefValue>(I) &&
393 "order of checks wrong!");
394 assert(Con->isNullValue() && "null is the only case which makes sense");
395 return BaseDefiningValueResult(Con, true);
398 if (isa<LoadInst>(I))
399 return BaseDefiningValueResult(I, true);
401 if (isa<InsertElementInst>(I))
402 // We don't know whether this vector contains entirely base pointers or
403 // not. To be conservatively correct, we treat it as a BDV and will
404 // duplicate code as needed to construct a parallel vector of bases.
405 return BaseDefiningValueResult(I, false);
407 if (isa<ShuffleVectorInst>(I))
408 // We don't know whether this vector contains entirely base pointers or
409 // not. To be conservatively correct, we treat it as a BDV and will
410 // duplicate code as needed to construct a parallel vector of bases.
411 // TODO: There a number of local optimizations which could be applied here
412 // for particular sufflevector patterns.
413 return BaseDefiningValueResult(I, false);
415 // A PHI or Select is a base defining value. The outer findBasePointer
416 // algorithm is responsible for constructing a base value for this BDV.
417 assert((isa<SelectInst>(I) || isa<PHINode>(I)) &&
418 "unknown vector instruction - no base found for vector element");
419 return BaseDefiningValueResult(I, false);
422 /// Helper function for findBasePointer - Will return a value which either a)
423 /// defines the base pointer for the input, b) blocks the simple search
424 /// (i.e. a PHI or Select of two derived pointers), or c) involves a change
425 /// from pointer to vector type or back.
426 static BaseDefiningValueResult findBaseDefiningValue(Value *I) {
427 if (I->getType()->isVectorTy())
428 return findBaseDefiningValueOfVector(I);
430 assert(I->getType()->isPointerTy() &&
431 "Illegal to ask for the base pointer of a non-pointer type");
433 if (isa<Argument>(I))
434 // An incoming argument to the function is a base pointer
435 // We should have never reached here if this argument isn't an gc value
436 return BaseDefiningValueResult(I, true);
438 if (isa<Constant>(I))
439 // We assume that objects with a constant base (e.g. a global) can't move
440 // and don't need to be reported to the collector because they are always
441 // live. All constants have constant bases. Besides global references, all
442 // kinds of constants (e.g. undef, constant expressions, null pointers) can
443 // be introduced by the inliner or the optimizer, especially on dynamically
444 // dead paths. See e.g. test4 in constants.ll.
445 return BaseDefiningValueResult(I, true);
447 if (CastInst *CI = dyn_cast<CastInst>(I)) {
448 Value *Def = CI->stripPointerCasts();
449 // If stripping pointer casts changes the address space there is an
450 // addrspacecast in between.
451 assert(cast<PointerType>(Def->getType())->getAddressSpace() ==
452 cast<PointerType>(CI->getType())->getAddressSpace() &&
453 "unsupported addrspacecast");
454 // If we find a cast instruction here, it means we've found a cast which is
455 // not simply a pointer cast (i.e. an inttoptr). We don't know how to
456 // handle int->ptr conversion.
457 assert(!isa<CastInst>(Def) && "shouldn't find another cast here");
458 return findBaseDefiningValue(Def);
461 if (isa<LoadInst>(I))
462 // The value loaded is an gc base itself
463 return BaseDefiningValueResult(I, true);
466 if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(I))
467 // The base of this GEP is the base
468 return findBaseDefiningValue(GEP->getPointerOperand());
470 if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(I)) {
471 switch (II->getIntrinsicID()) {
473 // fall through to general call handling
475 case Intrinsic::experimental_gc_statepoint:
476 llvm_unreachable("statepoints don't produce pointers");
477 case Intrinsic::experimental_gc_relocate: {
478 // Rerunning safepoint insertion after safepoints are already
479 // inserted is not supported. It could probably be made to work,
480 // but why are you doing this? There's no good reason.
481 llvm_unreachable("repeat safepoint insertion is not supported");
483 case Intrinsic::gcroot:
484 // Currently, this mechanism hasn't been extended to work with gcroot.
485 // There's no reason it couldn't be, but I haven't thought about the
486 // implications much.
488 "interaction with the gcroot mechanism is not supported");
491 // We assume that functions in the source language only return base
492 // pointers. This should probably be generalized via attributes to support
493 // both source language and internal functions.
494 if (isa<CallInst>(I) || isa<InvokeInst>(I))
495 return BaseDefiningValueResult(I, true);
497 // I have absolutely no idea how to implement this part yet. It's not
498 // necessarily hard, I just haven't really looked at it yet.
499 assert(!isa<LandingPadInst>(I) && "Landing Pad is unimplemented");
501 if (isa<AtomicCmpXchgInst>(I))
502 // A CAS is effectively a atomic store and load combined under a
503 // predicate. From the perspective of base pointers, we just treat it
505 return BaseDefiningValueResult(I, true);
507 assert(!isa<AtomicRMWInst>(I) && "Xchg handled above, all others are "
508 "binary ops which don't apply to pointers");
510 // The aggregate ops. Aggregates can either be in the heap or on the
511 // stack, but in either case, this is simply a field load. As a result,
512 // this is a defining definition of the base just like a load is.
513 if (isa<ExtractValueInst>(I))
514 return BaseDefiningValueResult(I, true);
516 // We should never see an insert vector since that would require we be
517 // tracing back a struct value not a pointer value.
518 assert(!isa<InsertValueInst>(I) &&
519 "Base pointer for a struct is meaningless");
521 // An extractelement produces a base result exactly when it's input does.
522 // We may need to insert a parallel instruction to extract the appropriate
523 // element out of the base vector corresponding to the input. Given this,
524 // it's analogous to the phi and select case even though it's not a merge.
525 if (isa<ExtractElementInst>(I))
526 // Note: There a lot of obvious peephole cases here. This are deliberately
527 // handled after the main base pointer inference algorithm to make writing
528 // test cases to exercise that code easier.
529 return BaseDefiningValueResult(I, false);
531 // The last two cases here don't return a base pointer. Instead, they
532 // return a value which dynamically selects from among several base
533 // derived pointers (each with it's own base potentially). It's the job of
534 // the caller to resolve these.
535 assert((isa<SelectInst>(I) || isa<PHINode>(I)) &&
536 "missing instruction case in findBaseDefiningValing");
537 return BaseDefiningValueResult(I, false);
540 /// Returns the base defining value for this value.
541 static Value *findBaseDefiningValueCached(Value *I, DefiningValueMapTy &Cache) {
542 Value *&Cached = Cache[I];
544 Cached = findBaseDefiningValue(I).BDV;
545 DEBUG(dbgs() << "fBDV-cached: " << I->getName() << " -> "
546 << Cached->getName() << "\n");
548 assert(Cache[I] != nullptr);
552 /// Return a base pointer for this value if known. Otherwise, return it's
553 /// base defining value.
554 static Value *findBaseOrBDV(Value *I, DefiningValueMapTy &Cache) {
555 Value *Def = findBaseDefiningValueCached(I, Cache);
556 auto Found = Cache.find(Def);
557 if (Found != Cache.end()) {
558 // Either a base-of relation, or a self reference. Caller must check.
559 return Found->second;
561 // Only a BDV available
565 /// Given the result of a call to findBaseDefiningValue, or findBaseOrBDV,
566 /// is it known to be a base pointer? Or do we need to continue searching.
567 static bool isKnownBaseResult(Value *V) {
568 if (!isa<PHINode>(V) && !isa<SelectInst>(V) &&
569 !isa<ExtractElementInst>(V) && !isa<InsertElementInst>(V) &&
570 !isa<ShuffleVectorInst>(V)) {
571 // no recursion possible
574 if (isa<Instruction>(V) &&
575 cast<Instruction>(V)->getMetadata("is_base_value")) {
576 // This is a previously inserted base phi or select. We know
577 // that this is a base value.
581 // We need to keep searching
586 /// Models the state of a single base defining value in the findBasePointer
587 /// algorithm for determining where a new instruction is needed to propagate
588 /// the base of this BDV.
591 enum Status { Unknown, Base, Conflict };
593 BDVState(Status s, Value *b = nullptr) : status(s), base(b) {
594 assert(status != Base || b);
596 explicit BDVState(Value *b) : status(Base), base(b) {}
597 BDVState() : status(Unknown), base(nullptr) {}
599 Status getStatus() const { return status; }
600 Value *getBase() const { return base; }
602 bool isBase() const { return getStatus() == Base; }
603 bool isUnknown() const { return getStatus() == Unknown; }
604 bool isConflict() const { return getStatus() == Conflict; }
606 bool operator==(const BDVState &other) const {
607 return base == other.base && status == other.status;
610 bool operator!=(const BDVState &other) const { return !(*this == other); }
613 void dump() const { print(dbgs()); dbgs() << '\n'; }
615 void print(raw_ostream &OS) const {
627 OS << " (" << base << " - "
628 << (base ? base->getName() : "nullptr") << "): ";
633 AssertingVH<Value> base; // non null only if status == base
638 static raw_ostream &operator<<(raw_ostream &OS, const BDVState &State) {
645 // Values of type BDVState form a lattice, and this is a helper
646 // class that implementes the meet operation. The meat of the meet
647 // operation is implemented in MeetBDVStates::pureMeet
648 class MeetBDVStates {
650 /// Initializes the currentResult to the TOP state so that if can be met with
651 /// any other state to produce that state.
654 // Destructively meet the current result with the given BDVState
655 void meetWith(BDVState otherState) {
656 currentResult = meet(otherState, currentResult);
659 BDVState getResult() const { return currentResult; }
662 BDVState currentResult;
664 /// Perform a meet operation on two elements of the BDVState lattice.
665 static BDVState meet(BDVState LHS, BDVState RHS) {
666 assert((pureMeet(LHS, RHS) == pureMeet(RHS, LHS)) &&
667 "math is wrong: meet does not commute!");
668 BDVState Result = pureMeet(LHS, RHS);
669 DEBUG(dbgs() << "meet of " << LHS << " with " << RHS
670 << " produced " << Result << "\n");
674 static BDVState pureMeet(const BDVState &stateA, const BDVState &stateB) {
675 switch (stateA.getStatus()) {
676 case BDVState::Unknown:
680 assert(stateA.getBase() && "can't be null");
681 if (stateB.isUnknown())
684 if (stateB.isBase()) {
685 if (stateA.getBase() == stateB.getBase()) {
686 assert(stateA == stateB && "equality broken!");
689 return BDVState(BDVState::Conflict);
691 assert(stateB.isConflict() && "only three states!");
692 return BDVState(BDVState::Conflict);
694 case BDVState::Conflict:
697 llvm_unreachable("only three states!");
703 /// For a given value or instruction, figure out what base ptr it's derived
704 /// from. For gc objects, this is simply itself. On success, returns a value
705 /// which is the base pointer. (This is reliable and can be used for
706 /// relocation.) On failure, returns nullptr.
707 static Value *findBasePointer(Value *I, DefiningValueMapTy &cache) {
708 Value *def = findBaseOrBDV(I, cache);
710 if (isKnownBaseResult(def)) {
714 // Here's the rough algorithm:
715 // - For every SSA value, construct a mapping to either an actual base
716 // pointer or a PHI which obscures the base pointer.
717 // - Construct a mapping from PHI to unknown TOP state. Use an
718 // optimistic algorithm to propagate base pointer information. Lattice
723 // When algorithm terminates, all PHIs will either have a single concrete
724 // base or be in a conflict state.
725 // - For every conflict, insert a dummy PHI node without arguments. Add
726 // these to the base[Instruction] = BasePtr mapping. For every
727 // non-conflict, add the actual base.
728 // - For every conflict, add arguments for the base[a] of each input
731 // Note: A simpler form of this would be to add the conflict form of all
732 // PHIs without running the optimistic algorithm. This would be
733 // analogous to pessimistic data flow and would likely lead to an
734 // overall worse solution.
737 auto isExpectedBDVType = [](Value *BDV) {
738 return isa<PHINode>(BDV) || isa<SelectInst>(BDV) ||
739 isa<ExtractElementInst>(BDV) || isa<InsertElementInst>(BDV);
743 // Once populated, will contain a mapping from each potentially non-base BDV
744 // to a lattice value (described above) which corresponds to that BDV.
745 // We use the order of insertion (DFS over the def/use graph) to provide a
746 // stable deterministic ordering for visiting DenseMaps (which are unordered)
747 // below. This is important for deterministic compilation.
748 MapVector<Value *, BDVState> States;
750 // Recursively fill in all base defining values reachable from the initial
751 // one for which we don't already know a definite base value for
753 SmallVector<Value*, 16> Worklist;
754 Worklist.push_back(def);
755 States.insert(std::make_pair(def, BDVState()));
756 while (!Worklist.empty()) {
757 Value *Current = Worklist.pop_back_val();
758 assert(!isKnownBaseResult(Current) && "why did it get added?");
760 auto visitIncomingValue = [&](Value *InVal) {
761 Value *Base = findBaseOrBDV(InVal, cache);
762 if (isKnownBaseResult(Base))
763 // Known bases won't need new instructions introduced and can be
766 assert(isExpectedBDVType(Base) && "the only non-base values "
767 "we see should be base defining values");
768 if (States.insert(std::make_pair(Base, BDVState())).second)
769 Worklist.push_back(Base);
771 if (PHINode *Phi = dyn_cast<PHINode>(Current)) {
772 for (Value *InVal : Phi->incoming_values())
773 visitIncomingValue(InVal);
774 } else if (SelectInst *Sel = dyn_cast<SelectInst>(Current)) {
775 visitIncomingValue(Sel->getTrueValue());
776 visitIncomingValue(Sel->getFalseValue());
777 } else if (auto *EE = dyn_cast<ExtractElementInst>(Current)) {
778 visitIncomingValue(EE->getVectorOperand());
779 } else if (auto *IE = dyn_cast<InsertElementInst>(Current)) {
780 visitIncomingValue(IE->getOperand(0)); // vector operand
781 visitIncomingValue(IE->getOperand(1)); // scalar operand
783 // There is one known class of instructions we know we don't handle.
784 assert(isa<ShuffleVectorInst>(Current));
785 llvm_unreachable("unimplemented instruction case");
791 DEBUG(dbgs() << "States after initialization:\n");
792 for (auto Pair : States) {
793 DEBUG(dbgs() << " " << Pair.second << " for " << *Pair.first << "\n");
797 // Return a phi state for a base defining value. We'll generate a new
798 // base state for known bases and expect to find a cached state otherwise.
799 auto getStateForBDV = [&](Value *baseValue) {
800 if (isKnownBaseResult(baseValue))
801 return BDVState(baseValue);
802 auto I = States.find(baseValue);
803 assert(I != States.end() && "lookup failed!");
807 bool progress = true;
810 const size_t oldSize = States.size();
813 // We're only changing values in this loop, thus safe to keep iterators.
814 // Since this is computing a fixed point, the order of visit does not
815 // effect the result. TODO: We could use a worklist here and make this run
817 for (auto Pair : States) {
818 Value *BDV = Pair.first;
819 assert(!isKnownBaseResult(BDV) && "why did it get added?");
821 // Given an input value for the current instruction, return a BDVState
822 // instance which represents the BDV of that value.
823 auto getStateForInput = [&](Value *V) mutable {
824 Value *BDV = findBaseOrBDV(V, cache);
825 return getStateForBDV(BDV);
828 MeetBDVStates calculateMeet;
829 if (SelectInst *select = dyn_cast<SelectInst>(BDV)) {
830 calculateMeet.meetWith(getStateForInput(select->getTrueValue()));
831 calculateMeet.meetWith(getStateForInput(select->getFalseValue()));
832 } else if (PHINode *Phi = dyn_cast<PHINode>(BDV)) {
833 for (Value *Val : Phi->incoming_values())
834 calculateMeet.meetWith(getStateForInput(Val));
835 } else if (auto *EE = dyn_cast<ExtractElementInst>(BDV)) {
836 // The 'meet' for an extractelement is slightly trivial, but it's still
837 // useful in that it drives us to conflict if our input is.
838 calculateMeet.meetWith(getStateForInput(EE->getVectorOperand()));
840 // Given there's a inherent type mismatch between the operands, will
841 // *always* produce Conflict.
842 auto *IE = cast<InsertElementInst>(BDV);
843 calculateMeet.meetWith(getStateForInput(IE->getOperand(0)));
844 calculateMeet.meetWith(getStateForInput(IE->getOperand(1)));
847 BDVState oldState = States[BDV];
848 BDVState newState = calculateMeet.getResult();
849 if (oldState != newState) {
851 States[BDV] = newState;
855 assert(oldSize == States.size() &&
856 "fixed point shouldn't be adding any new nodes to state");
860 DEBUG(dbgs() << "States after meet iteration:\n");
861 for (auto Pair : States) {
862 DEBUG(dbgs() << " " << Pair.second << " for " << *Pair.first << "\n");
866 // Insert Phis for all conflicts
867 // TODO: adjust naming patterns to avoid this order of iteration dependency
868 for (auto Pair : States) {
869 Instruction *I = cast<Instruction>(Pair.first);
870 BDVState State = Pair.second;
871 assert(!isKnownBaseResult(I) && "why did it get added?");
872 assert(!State.isUnknown() && "Optimistic algorithm didn't complete!");
874 // extractelement instructions are a bit special in that we may need to
875 // insert an extract even when we know an exact base for the instruction.
876 // The problem is that we need to convert from a vector base to a scalar
877 // base for the particular indice we're interested in.
878 if (State.isBase() && isa<ExtractElementInst>(I) &&
879 isa<VectorType>(State.getBase()->getType())) {
880 auto *EE = cast<ExtractElementInst>(I);
881 // TODO: In many cases, the new instruction is just EE itself. We should
882 // exploit this, but can't do it here since it would break the invariant
883 // about the BDV not being known to be a base.
884 auto *BaseInst = ExtractElementInst::Create(State.getBase(),
885 EE->getIndexOperand(),
887 BaseInst->setMetadata("is_base_value", MDNode::get(I->getContext(), {}));
888 States[I] = BDVState(BDVState::Base, BaseInst);
891 // Since we're joining a vector and scalar base, they can never be the
892 // same. As a result, we should always see insert element having reached
893 // the conflict state.
894 if (isa<InsertElementInst>(I)) {
895 assert(State.isConflict());
898 if (!State.isConflict())
901 /// Create and insert a new instruction which will represent the base of
902 /// the given instruction 'I'.
903 auto MakeBaseInstPlaceholder = [](Instruction *I) -> Instruction* {
904 if (isa<PHINode>(I)) {
905 BasicBlock *BB = I->getParent();
906 int NumPreds = std::distance(pred_begin(BB), pred_end(BB));
907 assert(NumPreds > 0 && "how did we reach here");
908 std::string Name = suffixed_name_or(I, ".base", "base_phi");
909 return PHINode::Create(I->getType(), NumPreds, Name, I);
910 } else if (SelectInst *Sel = dyn_cast<SelectInst>(I)) {
911 // The undef will be replaced later
912 UndefValue *Undef = UndefValue::get(Sel->getType());
913 std::string Name = suffixed_name_or(I, ".base", "base_select");
914 return SelectInst::Create(Sel->getCondition(), Undef,
916 } else if (auto *EE = dyn_cast<ExtractElementInst>(I)) {
917 UndefValue *Undef = UndefValue::get(EE->getVectorOperand()->getType());
918 std::string Name = suffixed_name_or(I, ".base", "base_ee");
919 return ExtractElementInst::Create(Undef, EE->getIndexOperand(), Name,
922 auto *IE = cast<InsertElementInst>(I);
923 UndefValue *VecUndef = UndefValue::get(IE->getOperand(0)->getType());
924 UndefValue *ScalarUndef = UndefValue::get(IE->getOperand(1)->getType());
925 std::string Name = suffixed_name_or(I, ".base", "base_ie");
926 return InsertElementInst::Create(VecUndef, ScalarUndef,
927 IE->getOperand(2), Name, IE);
931 Instruction *BaseInst = MakeBaseInstPlaceholder(I);
932 // Add metadata marking this as a base value
933 BaseInst->setMetadata("is_base_value", MDNode::get(I->getContext(), {}));
934 States[I] = BDVState(BDVState::Conflict, BaseInst);
937 // Returns a instruction which produces the base pointer for a given
938 // instruction. The instruction is assumed to be an input to one of the BDVs
939 // seen in the inference algorithm above. As such, we must either already
940 // know it's base defining value is a base, or have inserted a new
941 // instruction to propagate the base of it's BDV and have entered that newly
942 // introduced instruction into the state table. In either case, we are
943 // assured to be able to determine an instruction which produces it's base
945 auto getBaseForInput = [&](Value *Input, Instruction *InsertPt) {
946 Value *BDV = findBaseOrBDV(Input, cache);
947 Value *Base = nullptr;
948 if (isKnownBaseResult(BDV)) {
951 // Either conflict or base.
952 assert(States.count(BDV));
953 Base = States[BDV].getBase();
955 assert(Base && "can't be null");
956 // The cast is needed since base traversal may strip away bitcasts
957 if (Base->getType() != Input->getType() &&
959 Base = new BitCastInst(Base, Input->getType(), "cast",
965 // Fixup all the inputs of the new PHIs. Visit order needs to be
966 // deterministic and predictable because we're naming newly created
968 for (auto Pair : States) {
969 Instruction *BDV = cast<Instruction>(Pair.first);
970 BDVState State = Pair.second;
972 assert(!isKnownBaseResult(BDV) && "why did it get added?");
973 assert(!State.isUnknown() && "Optimistic algorithm didn't complete!");
974 if (!State.isConflict())
977 if (PHINode *basephi = dyn_cast<PHINode>(State.getBase())) {
978 PHINode *phi = cast<PHINode>(BDV);
979 unsigned NumPHIValues = phi->getNumIncomingValues();
980 for (unsigned i = 0; i < NumPHIValues; i++) {
981 Value *InVal = phi->getIncomingValue(i);
982 BasicBlock *InBB = phi->getIncomingBlock(i);
984 // If we've already seen InBB, add the same incoming value
985 // we added for it earlier. The IR verifier requires phi
986 // nodes with multiple entries from the same basic block
987 // to have the same incoming value for each of those
988 // entries. If we don't do this check here and basephi
989 // has a different type than base, we'll end up adding two
990 // bitcasts (and hence two distinct values) as incoming
991 // values for the same basic block.
993 int blockIndex = basephi->getBasicBlockIndex(InBB);
994 if (blockIndex != -1) {
995 Value *oldBase = basephi->getIncomingValue(blockIndex);
996 basephi->addIncoming(oldBase, InBB);
999 Value *Base = getBaseForInput(InVal, nullptr);
1000 // In essence this assert states: the only way two
1001 // values incoming from the same basic block may be
1002 // different is by being different bitcasts of the same
1003 // value. A cleanup that remains TODO is changing
1004 // findBaseOrBDV to return an llvm::Value of the correct
1005 // type (and still remain pure). This will remove the
1006 // need to add bitcasts.
1007 assert(Base->stripPointerCasts() == oldBase->stripPointerCasts() &&
1008 "sanity -- findBaseOrBDV should be pure!");
1013 // Find the instruction which produces the base for each input. We may
1014 // need to insert a bitcast in the incoming block.
1015 // TODO: Need to split critical edges if insertion is needed
1016 Value *Base = getBaseForInput(InVal, InBB->getTerminator());
1017 basephi->addIncoming(Base, InBB);
1019 assert(basephi->getNumIncomingValues() == NumPHIValues);
1020 } else if (SelectInst *BaseSel = dyn_cast<SelectInst>(State.getBase())) {
1021 SelectInst *Sel = cast<SelectInst>(BDV);
1022 // Operand 1 & 2 are true, false path respectively. TODO: refactor to
1023 // something more safe and less hacky.
1024 for (int i = 1; i <= 2; i++) {
1025 Value *InVal = Sel->getOperand(i);
1026 // Find the instruction which produces the base for each input. We may
1027 // need to insert a bitcast.
1028 Value *Base = getBaseForInput(InVal, BaseSel);
1029 BaseSel->setOperand(i, Base);
1031 } else if (auto *BaseEE = dyn_cast<ExtractElementInst>(State.getBase())) {
1032 Value *InVal = cast<ExtractElementInst>(BDV)->getVectorOperand();
1033 // Find the instruction which produces the base for each input. We may
1034 // need to insert a bitcast.
1035 Value *Base = getBaseForInput(InVal, BaseEE);
1036 BaseEE->setOperand(0, Base);
1038 auto *BaseIE = cast<InsertElementInst>(State.getBase());
1039 auto *BdvIE = cast<InsertElementInst>(BDV);
1040 auto UpdateOperand = [&](int OperandIdx) {
1041 Value *InVal = BdvIE->getOperand(OperandIdx);
1042 Value *Base = getBaseForInput(InVal, BaseIE);
1043 BaseIE->setOperand(OperandIdx, Base);
1045 UpdateOperand(0); // vector operand
1046 UpdateOperand(1); // scalar operand
1051 // Now that we're done with the algorithm, see if we can optimize the
1052 // results slightly by reducing the number of new instructions needed.
1053 // Arguably, this should be integrated into the algorithm above, but
1054 // doing as a post process step is easier to reason about for the moment.
1055 DenseMap<Value *, Value *> ReverseMap;
1056 SmallPtrSet<Instruction *, 16> NewInsts;
1057 SmallSetVector<AssertingVH<Instruction>, 16> Worklist;
1058 // Note: We need to visit the states in a deterministic order. We uses the
1059 // Keys we sorted above for this purpose. Note that we are papering over a
1060 // bigger problem with the algorithm above - it's visit order is not
1061 // deterministic. A larger change is needed to fix this.
1062 for (auto Pair : States) {
1063 auto *BDV = Pair.first;
1064 auto State = Pair.second;
1065 Value *Base = State.getBase();
1066 assert(BDV && Base);
1067 assert(!isKnownBaseResult(BDV) && "why did it get added?");
1068 assert(isKnownBaseResult(Base) &&
1069 "must be something we 'know' is a base pointer");
1070 if (!State.isConflict())
1073 ReverseMap[Base] = BDV;
1074 if (auto *BaseI = dyn_cast<Instruction>(Base)) {
1075 NewInsts.insert(BaseI);
1076 Worklist.insert(BaseI);
1079 auto ReplaceBaseInstWith = [&](Value *BDV, Instruction *BaseI,
1080 Value *Replacement) {
1081 // Add users which are new instructions (excluding self references)
1082 for (User *U : BaseI->users())
1083 if (auto *UI = dyn_cast<Instruction>(U))
1084 if (NewInsts.count(UI) && UI != BaseI)
1085 Worklist.insert(UI);
1086 // Then do the actual replacement
1087 NewInsts.erase(BaseI);
1088 ReverseMap.erase(BaseI);
1089 BaseI->replaceAllUsesWith(Replacement);
1090 assert(States.count(BDV));
1091 assert(States[BDV].isConflict() && States[BDV].getBase() == BaseI);
1092 States[BDV] = BDVState(BDVState::Conflict, Replacement);
1093 BaseI->eraseFromParent();
1095 const DataLayout &DL = cast<Instruction>(def)->getModule()->getDataLayout();
1096 while (!Worklist.empty()) {
1097 Instruction *BaseI = Worklist.pop_back_val();
1098 assert(NewInsts.count(BaseI));
1099 Value *Bdv = ReverseMap[BaseI];
1100 if (auto *BdvI = dyn_cast<Instruction>(Bdv))
1101 if (BaseI->isIdenticalTo(BdvI)) {
1102 DEBUG(dbgs() << "Identical Base: " << *BaseI << "\n");
1103 ReplaceBaseInstWith(Bdv, BaseI, Bdv);
1106 if (Value *V = SimplifyInstruction(BaseI, DL)) {
1107 DEBUG(dbgs() << "Base " << *BaseI << " simplified to " << *V << "\n");
1108 ReplaceBaseInstWith(Bdv, BaseI, V);
1113 // Cache all of our results so we can cheaply reuse them
1114 // NOTE: This is actually two caches: one of the base defining value
1115 // relation and one of the base pointer relation! FIXME
1116 for (auto Pair : States) {
1117 auto *BDV = Pair.first;
1118 Value *base = Pair.second.getBase();
1119 assert(BDV && base);
1121 std::string fromstr = cache.count(BDV) ? cache[BDV]->getName() : "none";
1122 DEBUG(dbgs() << "Updating base value cache"
1123 << " for: " << BDV->getName()
1124 << " from: " << fromstr
1125 << " to: " << base->getName() << "\n");
1127 if (cache.count(BDV)) {
1128 // Once we transition from the BDV relation being store in the cache to
1129 // the base relation being stored, it must be stable
1130 assert((!isKnownBaseResult(cache[BDV]) || cache[BDV] == base) &&
1131 "base relation should be stable");
1135 assert(cache.count(def));
1139 // For a set of live pointers (base and/or derived), identify the base
1140 // pointer of the object which they are derived from. This routine will
1141 // mutate the IR graph as needed to make the 'base' pointer live at the
1142 // definition site of 'derived'. This ensures that any use of 'derived' can
1143 // also use 'base'. This may involve the insertion of a number of
1144 // additional PHI nodes.
1146 // preconditions: live is a set of pointer type Values
1148 // side effects: may insert PHI nodes into the existing CFG, will preserve
1149 // CFG, will not remove or mutate any existing nodes
1151 // post condition: PointerToBase contains one (derived, base) pair for every
1152 // pointer in live. Note that derived can be equal to base if the original
1153 // pointer was a base pointer.
1155 findBasePointers(const StatepointLiveSetTy &live,
1156 DenseMap<Value *, Value *> &PointerToBase,
1157 DominatorTree *DT, DefiningValueMapTy &DVCache) {
1158 // For the naming of values inserted to be deterministic - which makes for
1159 // much cleaner and more stable tests - we need to assign an order to the
1160 // live values. DenseSets do not provide a deterministic order across runs.
1161 SmallVector<Value *, 64> Temp;
1162 Temp.insert(Temp.end(), live.begin(), live.end());
1163 std::sort(Temp.begin(), Temp.end(), order_by_name);
1164 for (Value *ptr : Temp) {
1165 Value *base = findBasePointer(ptr, DVCache);
1166 assert(base && "failed to find base pointer");
1167 PointerToBase[ptr] = base;
1168 assert((!isa<Instruction>(base) || !isa<Instruction>(ptr) ||
1169 DT->dominates(cast<Instruction>(base)->getParent(),
1170 cast<Instruction>(ptr)->getParent())) &&
1171 "The base we found better dominate the derived pointer");
1173 // If you see this trip and like to live really dangerously, the code should
1174 // be correct, just with idioms the verifier can't handle. You can try
1175 // disabling the verifier at your own substantial risk.
1176 assert(!isa<ConstantPointerNull>(base) &&
1177 "the relocation code needs adjustment to handle the relocation of "
1178 "a null pointer constant without causing false positives in the "
1179 "safepoint ir verifier.");
1183 /// Find the required based pointers (and adjust the live set) for the given
1185 static void findBasePointers(DominatorTree &DT, DefiningValueMapTy &DVCache,
1187 PartiallyConstructedSafepointRecord &result) {
1188 DenseMap<Value *, Value *> PointerToBase;
1189 findBasePointers(result.LiveSet, PointerToBase, &DT, DVCache);
1191 if (PrintBasePointers) {
1192 // Note: Need to print these in a stable order since this is checked in
1194 errs() << "Base Pairs (w/o Relocation):\n";
1195 SmallVector<Value *, 64> Temp;
1196 Temp.reserve(PointerToBase.size());
1197 for (auto Pair : PointerToBase) {
1198 Temp.push_back(Pair.first);
1200 std::sort(Temp.begin(), Temp.end(), order_by_name);
1201 for (Value *Ptr : Temp) {
1202 Value *Base = PointerToBase[Ptr];
1203 errs() << " derived ";
1204 Ptr->printAsOperand(errs(), false);
1206 Base->printAsOperand(errs(), false);
1211 result.PointerToBase = PointerToBase;
1214 /// Given an updated version of the dataflow liveness results, update the
1215 /// liveset and base pointer maps for the call site CS.
1216 static void recomputeLiveInValues(GCPtrLivenessData &RevisedLivenessData,
1218 PartiallyConstructedSafepointRecord &result);
1220 static void recomputeLiveInValues(
1221 Function &F, DominatorTree &DT, ArrayRef<CallSite> toUpdate,
1222 MutableArrayRef<struct PartiallyConstructedSafepointRecord> records) {
1223 // TODO-PERF: reuse the original liveness, then simply run the dataflow
1224 // again. The old values are still live and will help it stabilize quickly.
1225 GCPtrLivenessData RevisedLivenessData;
1226 computeLiveInValues(DT, F, RevisedLivenessData);
1227 for (size_t i = 0; i < records.size(); i++) {
1228 struct PartiallyConstructedSafepointRecord &info = records[i];
1229 const CallSite &CS = toUpdate[i];
1230 recomputeLiveInValues(RevisedLivenessData, CS, info);
1234 // When inserting gc.relocate and gc.result calls, we need to ensure there are
1235 // no uses of the original value / return value between the gc.statepoint and
1236 // the gc.relocate / gc.result call. One case which can arise is a phi node
1237 // starting one of the successor blocks. We also need to be able to insert the
1238 // gc.relocates only on the path which goes through the statepoint. We might
1239 // need to split an edge to make this possible.
1241 normalizeForInvokeSafepoint(BasicBlock *BB, BasicBlock *InvokeParent,
1242 DominatorTree &DT) {
1243 BasicBlock *Ret = BB;
1244 if (!BB->getUniquePredecessor())
1245 Ret = SplitBlockPredecessors(BB, InvokeParent, "", &DT);
1247 // Now that 'Ret' has unique predecessor we can safely remove all phi nodes
1249 FoldSingleEntryPHINodes(Ret);
1250 assert(!isa<PHINode>(Ret->begin()) &&
1251 "All PHI nodes should have been removed!");
1253 // At this point, we can safely insert a gc.relocate or gc.result as the first
1254 // instruction in Ret if needed.
1258 // Create new attribute set containing only attributes which can be transferred
1259 // from original call to the safepoint.
1260 static AttributeSet legalizeCallAttributes(AttributeSet AS) {
1263 for (unsigned Slot = 0; Slot < AS.getNumSlots(); Slot++) {
1264 unsigned Index = AS.getSlotIndex(Slot);
1266 if (Index == AttributeSet::ReturnIndex ||
1267 Index == AttributeSet::FunctionIndex) {
1269 for (Attribute Attr : make_range(AS.begin(Slot), AS.end(Slot))) {
1271 // Do not allow certain attributes - just skip them
1272 // Safepoint can not be read only or read none.
1273 if (Attr.hasAttribute(Attribute::ReadNone) ||
1274 Attr.hasAttribute(Attribute::ReadOnly))
1277 // These attributes control the generation of the gc.statepoint call /
1278 // invoke itself; and once the gc.statepoint is in place, they're of no
1280 if (Attr.hasAttribute("statepoint-num-patch-bytes") ||
1281 Attr.hasAttribute("statepoint-id"))
1284 Ret = Ret.addAttributes(
1285 AS.getContext(), Index,
1286 AttributeSet::get(AS.getContext(), Index, AttrBuilder(Attr)));
1290 // Just skip parameter attributes for now
1296 /// Helper function to place all gc relocates necessary for the given
1299 /// liveVariables - list of variables to be relocated.
1300 /// liveStart - index of the first live variable.
1301 /// basePtrs - base pointers.
1302 /// statepointToken - statepoint instruction to which relocates should be
1304 /// Builder - Llvm IR builder to be used to construct new calls.
1305 static void CreateGCRelocates(ArrayRef<Value *> LiveVariables,
1306 const int LiveStart,
1307 ArrayRef<Value *> BasePtrs,
1308 Instruction *StatepointToken,
1309 IRBuilder<> Builder) {
1310 if (LiveVariables.empty())
1313 auto FindIndex = [](ArrayRef<Value *> LiveVec, Value *Val) {
1314 auto ValIt = std::find(LiveVec.begin(), LiveVec.end(), Val);
1315 assert(ValIt != LiveVec.end() && "Val not found in LiveVec!");
1316 size_t Index = std::distance(LiveVec.begin(), ValIt);
1317 assert(Index < LiveVec.size() && "Bug in std::find?");
1321 // All gc_relocate are set to i8 addrspace(1)* type. We originally generated
1322 // unique declarations for each pointer type, but this proved problematic
1323 // because the intrinsic mangling code is incomplete and fragile. Since
1324 // we're moving towards a single unified pointer type anyways, we can just
1325 // cast everything to an i8* of the right address space. A bitcast is added
1326 // later to convert gc_relocate to the actual value's type.
1327 Module *M = StatepointToken->getModule();
1328 auto AS = cast<PointerType>(LiveVariables[0]->getType())->getAddressSpace();
1329 Type *Types[] = {Type::getInt8PtrTy(M->getContext(), AS)};
1330 Value *GCRelocateDecl =
1331 Intrinsic::getDeclaration(M, Intrinsic::experimental_gc_relocate, Types);
1333 for (unsigned i = 0; i < LiveVariables.size(); i++) {
1334 // Generate the gc.relocate call and save the result
1336 Builder.getInt32(LiveStart + FindIndex(LiveVariables, BasePtrs[i]));
1337 Value *LiveIdx = Builder.getInt32(LiveStart + i);
1339 // only specify a debug name if we can give a useful one
1340 CallInst *Reloc = Builder.CreateCall(
1341 GCRelocateDecl, {StatepointToken, BaseIdx, LiveIdx},
1342 suffixed_name_or(LiveVariables[i], ".relocated", ""));
1343 // Trick CodeGen into thinking there are lots of free registers at this
1345 Reloc->setCallingConv(CallingConv::Cold);
1351 /// This struct is used to defer RAUWs and `eraseFromParent` s. Using this
1352 /// avoids having to worry about keeping around dangling pointers to Values.
1353 class DeferredReplacement {
1354 AssertingVH<Instruction> Old;
1355 AssertingVH<Instruction> New;
1358 explicit DeferredReplacement(Instruction *Old, Instruction *New) :
1359 Old(Old), New(New) {
1360 assert(Old != New && "Not allowed!");
1363 /// Does the task represented by this instance.
1364 void doReplacement() {
1365 Instruction *OldI = Old;
1366 Instruction *NewI = New;
1368 assert(OldI != NewI && "Disallowed at construction?!");
1374 OldI->replaceAllUsesWith(NewI);
1375 OldI->eraseFromParent();
1381 makeStatepointExplicitImpl(const CallSite CS, /* to replace */
1382 const SmallVectorImpl<Value *> &BasePtrs,
1383 const SmallVectorImpl<Value *> &LiveVariables,
1384 PartiallyConstructedSafepointRecord &Result,
1385 std::vector<DeferredReplacement> &Replacements) {
1386 assert(BasePtrs.size() == LiveVariables.size());
1387 assert((UseDeoptBundles || isStatepoint(CS)) &&
1388 "This method expects to be rewriting a statepoint");
1390 // Then go ahead and use the builder do actually do the inserts. We insert
1391 // immediately before the previous instruction under the assumption that all
1392 // arguments will be available here. We can't insert afterwards since we may
1393 // be replacing a terminator.
1394 Instruction *InsertBefore = CS.getInstruction();
1395 IRBuilder<> Builder(InsertBefore);
1397 ArrayRef<Value *> GCArgs(LiveVariables);
1398 uint64_t StatepointID = 0xABCDEF00;
1399 uint32_t NumPatchBytes = 0;
1400 uint32_t Flags = uint32_t(StatepointFlags::None);
1402 ArrayRef<Use> CallArgs;
1403 ArrayRef<Use> DeoptArgs;
1404 ArrayRef<Use> TransitionArgs;
1406 Value *CallTarget = nullptr;
1408 if (UseDeoptBundles) {
1409 CallArgs = {CS.arg_begin(), CS.arg_end()};
1410 DeoptArgs = GetDeoptBundleOperands(CS);
1411 // TODO: we don't fill in TransitionArgs or Flags in this branch, but we
1412 // could have an operand bundle for that too.
1413 AttributeSet OriginalAttrs = CS.getAttributes();
1415 Attribute AttrID = OriginalAttrs.getAttribute(AttributeSet::FunctionIndex,
1417 if (AttrID.isStringAttribute())
1418 AttrID.getValueAsString().getAsInteger(10, StatepointID);
1420 Attribute AttrNumPatchBytes = OriginalAttrs.getAttribute(
1421 AttributeSet::FunctionIndex, "statepoint-num-patch-bytes");
1422 if (AttrNumPatchBytes.isStringAttribute())
1423 AttrNumPatchBytes.getValueAsString().getAsInteger(10, NumPatchBytes);
1425 CallTarget = CS.getCalledValue();
1427 // This branch will be gone soon, and we will soon only support the
1428 // UseDeoptBundles == true configuration.
1429 Statepoint OldSP(CS);
1430 StatepointID = OldSP.getID();
1431 NumPatchBytes = OldSP.getNumPatchBytes();
1432 Flags = OldSP.getFlags();
1434 CallArgs = {OldSP.arg_begin(), OldSP.arg_end()};
1435 DeoptArgs = {OldSP.vm_state_begin(), OldSP.vm_state_end()};
1436 TransitionArgs = {OldSP.gc_transition_args_begin(),
1437 OldSP.gc_transition_args_end()};
1438 CallTarget = OldSP.getCalledValue();
1441 // Create the statepoint given all the arguments
1442 Instruction *Token = nullptr;
1443 AttributeSet ReturnAttrs;
1445 CallInst *ToReplace = cast<CallInst>(CS.getInstruction());
1446 CallInst *Call = Builder.CreateGCStatepointCall(
1447 StatepointID, NumPatchBytes, CallTarget, Flags, CallArgs,
1448 TransitionArgs, DeoptArgs, GCArgs, "safepoint_token");
1450 Call->setTailCall(ToReplace->isTailCall());
1451 Call->setCallingConv(ToReplace->getCallingConv());
1453 // Currently we will fail on parameter attributes and on certain
1454 // function attributes.
1455 AttributeSet NewAttrs = legalizeCallAttributes(ToReplace->getAttributes());
1456 // In case if we can handle this set of attributes - set up function attrs
1457 // directly on statepoint and return attrs later for gc_result intrinsic.
1458 Call->setAttributes(NewAttrs.getFnAttributes());
1459 ReturnAttrs = NewAttrs.getRetAttributes();
1463 // Put the following gc_result and gc_relocate calls immediately after the
1464 // the old call (which we're about to delete)
1465 assert(ToReplace->getNextNode() && "Not a terminator, must have next!");
1466 Builder.SetInsertPoint(ToReplace->getNextNode());
1467 Builder.SetCurrentDebugLocation(ToReplace->getNextNode()->getDebugLoc());
1469 InvokeInst *ToReplace = cast<InvokeInst>(CS.getInstruction());
1471 // Insert the new invoke into the old block. We'll remove the old one in a
1472 // moment at which point this will become the new terminator for the
1474 InvokeInst *Invoke = Builder.CreateGCStatepointInvoke(
1475 StatepointID, NumPatchBytes, CallTarget, ToReplace->getNormalDest(),
1476 ToReplace->getUnwindDest(), Flags, CallArgs, TransitionArgs, DeoptArgs,
1477 GCArgs, "statepoint_token");
1479 Invoke->setCallingConv(ToReplace->getCallingConv());
1481 // Currently we will fail on parameter attributes and on certain
1482 // function attributes.
1483 AttributeSet NewAttrs = legalizeCallAttributes(ToReplace->getAttributes());
1484 // In case if we can handle this set of attributes - set up function attrs
1485 // directly on statepoint and return attrs later for gc_result intrinsic.
1486 Invoke->setAttributes(NewAttrs.getFnAttributes());
1487 ReturnAttrs = NewAttrs.getRetAttributes();
1491 // Generate gc relocates in exceptional path
1492 BasicBlock *UnwindBlock = ToReplace->getUnwindDest();
1493 assert(!isa<PHINode>(UnwindBlock->begin()) &&
1494 UnwindBlock->getUniquePredecessor() &&
1495 "can't safely insert in this block!");
1497 Builder.SetInsertPoint(&*UnwindBlock->getFirstInsertionPt());
1498 Builder.SetCurrentDebugLocation(ToReplace->getDebugLoc());
1500 // Attach exceptional gc relocates to the landingpad.
1501 Instruction *ExceptionalToken = UnwindBlock->getLandingPadInst();
1502 Result.UnwindToken = ExceptionalToken;
1504 const unsigned LiveStartIdx = Statepoint(Token).gcArgsStartIdx();
1505 CreateGCRelocates(LiveVariables, LiveStartIdx, BasePtrs, ExceptionalToken,
1508 // Generate gc relocates and returns for normal block
1509 BasicBlock *NormalDest = ToReplace->getNormalDest();
1510 assert(!isa<PHINode>(NormalDest->begin()) &&
1511 NormalDest->getUniquePredecessor() &&
1512 "can't safely insert in this block!");
1514 Builder.SetInsertPoint(&*NormalDest->getFirstInsertionPt());
1516 // gc relocates will be generated later as if it were regular call
1519 assert(Token && "Should be set in one of the above branches!");
1521 if (UseDeoptBundles) {
1522 Token->setName("statepoint_token");
1523 if (!CS.getType()->isVoidTy() && !CS.getInstruction()->use_empty()) {
1525 CS.getInstruction()->hasName() ? CS.getInstruction()->getName() : "";
1526 CallInst *GCResult = Builder.CreateGCResult(Token, CS.getType(), Name);
1527 GCResult->setAttributes(CS.getAttributes().getRetAttributes());
1529 // We cannot RAUW or delete CS.getInstruction() because it could be in the
1530 // live set of some other safepoint, in which case that safepoint's
1531 // PartiallyConstructedSafepointRecord will hold a raw pointer to this
1532 // llvm::Instruction. Instead, we defer the replacement and deletion to
1533 // after the live sets have been made explicit in the IR, and we no longer
1534 // have raw pointers to worry about.
1535 Replacements.emplace_back(CS.getInstruction(), GCResult);
1537 Replacements.emplace_back(CS.getInstruction(), nullptr);
1540 assert(!CS.getInstruction()->hasNUsesOrMore(2) &&
1541 "only valid use before rewrite is gc.result");
1542 assert(!CS.getInstruction()->hasOneUse() ||
1543 isGCResult(cast<Instruction>(*CS.getInstruction()->user_begin())));
1545 // Take the name of the original statepoint token if there was one.
1546 Token->takeName(CS.getInstruction());
1548 // Update the gc.result of the original statepoint (if any) to use the newly
1549 // inserted statepoint. This is safe to do here since the token can't be
1550 // considered a live reference.
1551 CS.getInstruction()->replaceAllUsesWith(Token);
1552 CS.getInstruction()->eraseFromParent();
1555 Result.StatepointToken = Token;
1557 // Second, create a gc.relocate for every live variable
1558 const unsigned LiveStartIdx = Statepoint(Token).gcArgsStartIdx();
1559 CreateGCRelocates(LiveVariables, LiveStartIdx, BasePtrs, Token, Builder);
1563 struct NameOrdering {
1567 bool operator()(NameOrdering const &a, NameOrdering const &b) {
1568 return -1 == a.Derived->getName().compare(b.Derived->getName());
1573 static void StabilizeOrder(SmallVectorImpl<Value *> &BaseVec,
1574 SmallVectorImpl<Value *> &LiveVec) {
1575 assert(BaseVec.size() == LiveVec.size());
1577 SmallVector<NameOrdering, 64> Temp;
1578 for (size_t i = 0; i < BaseVec.size(); i++) {
1580 v.Base = BaseVec[i];
1581 v.Derived = LiveVec[i];
1585 std::sort(Temp.begin(), Temp.end(), NameOrdering());
1586 for (size_t i = 0; i < BaseVec.size(); i++) {
1587 BaseVec[i] = Temp[i].Base;
1588 LiveVec[i] = Temp[i].Derived;
1592 // Replace an existing gc.statepoint with a new one and a set of gc.relocates
1593 // which make the relocations happening at this safepoint explicit.
1595 // WARNING: Does not do any fixup to adjust users of the original live
1596 // values. That's the callers responsibility.
1598 makeStatepointExplicit(DominatorTree &DT, const CallSite &CS,
1599 PartiallyConstructedSafepointRecord &Result,
1600 std::vector<DeferredReplacement> &Replacements) {
1601 const auto &LiveSet = Result.LiveSet;
1602 const auto &PointerToBase = Result.PointerToBase;
1604 // Convert to vector for efficient cross referencing.
1605 SmallVector<Value *, 64> BaseVec, LiveVec;
1606 LiveVec.reserve(LiveSet.size());
1607 BaseVec.reserve(LiveSet.size());
1608 for (Value *L : LiveSet) {
1609 LiveVec.push_back(L);
1610 assert(PointerToBase.count(L));
1611 Value *Base = PointerToBase.find(L)->second;
1612 BaseVec.push_back(Base);
1614 assert(LiveVec.size() == BaseVec.size());
1616 // To make the output IR slightly more stable (for use in diffs), ensure a
1617 // fixed order of the values in the safepoint (by sorting the value name).
1618 // The order is otherwise meaningless.
1619 StabilizeOrder(BaseVec, LiveVec);
1621 // Do the actual rewriting and delete the old statepoint
1622 makeStatepointExplicitImpl(CS, BaseVec, LiveVec, Result, Replacements);
1625 // Helper function for the relocationViaAlloca.
1627 // It receives iterator to the statepoint gc relocates and emits a store to the
1628 // assigned location (via allocaMap) for the each one of them. It adds the
1629 // visited values into the visitedLiveValues set, which we will later use them
1630 // for sanity checking.
1632 insertRelocationStores(iterator_range<Value::user_iterator> GCRelocs,
1633 DenseMap<Value *, Value *> &AllocaMap,
1634 DenseSet<Value *> &VisitedLiveValues) {
1636 for (User *U : GCRelocs) {
1637 GCRelocateInst *Relocate = dyn_cast<GCRelocateInst>(U);
1641 Value *OriginalValue = const_cast<Value *>(Relocate->getDerivedPtr());
1642 assert(AllocaMap.count(OriginalValue));
1643 Value *Alloca = AllocaMap[OriginalValue];
1645 // Emit store into the related alloca
1646 // All gc_relocates are i8 addrspace(1)* typed, and it must be bitcasted to
1647 // the correct type according to alloca.
1648 assert(Relocate->getNextNode() &&
1649 "Should always have one since it's not a terminator");
1650 IRBuilder<> Builder(Relocate->getNextNode());
1651 Value *CastedRelocatedValue =
1652 Builder.CreateBitCast(Relocate,
1653 cast<AllocaInst>(Alloca)->getAllocatedType(),
1654 suffixed_name_or(Relocate, ".casted", ""));
1656 StoreInst *Store = new StoreInst(CastedRelocatedValue, Alloca);
1657 Store->insertAfter(cast<Instruction>(CastedRelocatedValue));
1660 VisitedLiveValues.insert(OriginalValue);
1665 // Helper function for the "relocationViaAlloca". Similar to the
1666 // "insertRelocationStores" but works for rematerialized values.
1668 insertRematerializationStores(
1669 RematerializedValueMapTy RematerializedValues,
1670 DenseMap<Value *, Value *> &AllocaMap,
1671 DenseSet<Value *> &VisitedLiveValues) {
1673 for (auto RematerializedValuePair: RematerializedValues) {
1674 Instruction *RematerializedValue = RematerializedValuePair.first;
1675 Value *OriginalValue = RematerializedValuePair.second;
1677 assert(AllocaMap.count(OriginalValue) &&
1678 "Can not find alloca for rematerialized value");
1679 Value *Alloca = AllocaMap[OriginalValue];
1681 StoreInst *Store = new StoreInst(RematerializedValue, Alloca);
1682 Store->insertAfter(RematerializedValue);
1685 VisitedLiveValues.insert(OriginalValue);
1690 /// Do all the relocation update via allocas and mem2reg
1691 static void relocationViaAlloca(
1692 Function &F, DominatorTree &DT, ArrayRef<Value *> Live,
1693 ArrayRef<PartiallyConstructedSafepointRecord> Records) {
1695 // record initial number of (static) allocas; we'll check we have the same
1696 // number when we get done.
1697 int InitialAllocaNum = 0;
1698 for (auto I = F.getEntryBlock().begin(), E = F.getEntryBlock().end(); I != E;
1700 if (isa<AllocaInst>(*I))
1704 // TODO-PERF: change data structures, reserve
1705 DenseMap<Value *, Value *> AllocaMap;
1706 SmallVector<AllocaInst *, 200> PromotableAllocas;
1707 // Used later to chack that we have enough allocas to store all values
1708 std::size_t NumRematerializedValues = 0;
1709 PromotableAllocas.reserve(Live.size());
1711 // Emit alloca for "LiveValue" and record it in "allocaMap" and
1712 // "PromotableAllocas"
1713 auto emitAllocaFor = [&](Value *LiveValue) {
1714 AllocaInst *Alloca = new AllocaInst(LiveValue->getType(), "",
1715 F.getEntryBlock().getFirstNonPHI());
1716 AllocaMap[LiveValue] = Alloca;
1717 PromotableAllocas.push_back(Alloca);
1720 // Emit alloca for each live gc pointer
1721 for (Value *V : Live)
1724 // Emit allocas for rematerialized values
1725 for (const auto &Info : Records)
1726 for (auto RematerializedValuePair : Info.RematerializedValues) {
1727 Value *OriginalValue = RematerializedValuePair.second;
1728 if (AllocaMap.count(OriginalValue) != 0)
1731 emitAllocaFor(OriginalValue);
1732 ++NumRematerializedValues;
1735 // The next two loops are part of the same conceptual operation. We need to
1736 // insert a store to the alloca after the original def and at each
1737 // redefinition. We need to insert a load before each use. These are split
1738 // into distinct loops for performance reasons.
1740 // Update gc pointer after each statepoint: either store a relocated value or
1741 // null (if no relocated value was found for this gc pointer and it is not a
1742 // gc_result). This must happen before we update the statepoint with load of
1743 // alloca otherwise we lose the link between statepoint and old def.
1744 for (const auto &Info : Records) {
1745 Value *Statepoint = Info.StatepointToken;
1747 // This will be used for consistency check
1748 DenseSet<Value *> VisitedLiveValues;
1750 // Insert stores for normal statepoint gc relocates
1751 insertRelocationStores(Statepoint->users(), AllocaMap, VisitedLiveValues);
1753 // In case if it was invoke statepoint
1754 // we will insert stores for exceptional path gc relocates.
1755 if (isa<InvokeInst>(Statepoint)) {
1756 insertRelocationStores(Info.UnwindToken->users(), AllocaMap,
1760 // Do similar thing with rematerialized values
1761 insertRematerializationStores(Info.RematerializedValues, AllocaMap,
1764 if (ClobberNonLive) {
1765 // As a debugging aid, pretend that an unrelocated pointer becomes null at
1766 // the gc.statepoint. This will turn some subtle GC problems into
1767 // slightly easier to debug SEGVs. Note that on large IR files with
1768 // lots of gc.statepoints this is extremely costly both memory and time
1770 SmallVector<AllocaInst *, 64> ToClobber;
1771 for (auto Pair : AllocaMap) {
1772 Value *Def = Pair.first;
1773 AllocaInst *Alloca = cast<AllocaInst>(Pair.second);
1775 // This value was relocated
1776 if (VisitedLiveValues.count(Def)) {
1779 ToClobber.push_back(Alloca);
1782 auto InsertClobbersAt = [&](Instruction *IP) {
1783 for (auto *AI : ToClobber) {
1784 auto AIType = cast<PointerType>(AI->getType());
1785 auto PT = cast<PointerType>(AIType->getElementType());
1786 Constant *CPN = ConstantPointerNull::get(PT);
1787 StoreInst *Store = new StoreInst(CPN, AI);
1788 Store->insertBefore(IP);
1792 // Insert the clobbering stores. These may get intermixed with the
1793 // gc.results and gc.relocates, but that's fine.
1794 if (auto II = dyn_cast<InvokeInst>(Statepoint)) {
1795 InsertClobbersAt(&*II->getNormalDest()->getFirstInsertionPt());
1796 InsertClobbersAt(&*II->getUnwindDest()->getFirstInsertionPt());
1798 InsertClobbersAt(cast<Instruction>(Statepoint)->getNextNode());
1803 // Update use with load allocas and add store for gc_relocated.
1804 for (auto Pair : AllocaMap) {
1805 Value *Def = Pair.first;
1806 Value *Alloca = Pair.second;
1808 // We pre-record the uses of allocas so that we dont have to worry about
1809 // later update that changes the user information..
1811 SmallVector<Instruction *, 20> Uses;
1812 // PERF: trade a linear scan for repeated reallocation
1813 Uses.reserve(std::distance(Def->user_begin(), Def->user_end()));
1814 for (User *U : Def->users()) {
1815 if (!isa<ConstantExpr>(U)) {
1816 // If the def has a ConstantExpr use, then the def is either a
1817 // ConstantExpr use itself or null. In either case
1818 // (recursively in the first, directly in the second), the oop
1819 // it is ultimately dependent on is null and this particular
1820 // use does not need to be fixed up.
1821 Uses.push_back(cast<Instruction>(U));
1825 std::sort(Uses.begin(), Uses.end());
1826 auto Last = std::unique(Uses.begin(), Uses.end());
1827 Uses.erase(Last, Uses.end());
1829 for (Instruction *Use : Uses) {
1830 if (isa<PHINode>(Use)) {
1831 PHINode *Phi = cast<PHINode>(Use);
1832 for (unsigned i = 0; i < Phi->getNumIncomingValues(); i++) {
1833 if (Def == Phi->getIncomingValue(i)) {
1834 LoadInst *Load = new LoadInst(
1835 Alloca, "", Phi->getIncomingBlock(i)->getTerminator());
1836 Phi->setIncomingValue(i, Load);
1840 LoadInst *Load = new LoadInst(Alloca, "", Use);
1841 Use->replaceUsesOfWith(Def, Load);
1845 // Emit store for the initial gc value. Store must be inserted after load,
1846 // otherwise store will be in alloca's use list and an extra load will be
1847 // inserted before it.
1848 StoreInst *Store = new StoreInst(Def, Alloca);
1849 if (Instruction *Inst = dyn_cast<Instruction>(Def)) {
1850 if (InvokeInst *Invoke = dyn_cast<InvokeInst>(Inst)) {
1851 // InvokeInst is a TerminatorInst so the store need to be inserted
1852 // into its normal destination block.
1853 BasicBlock *NormalDest = Invoke->getNormalDest();
1854 Store->insertBefore(NormalDest->getFirstNonPHI());
1856 assert(!Inst->isTerminator() &&
1857 "The only TerminatorInst that can produce a value is "
1858 "InvokeInst which is handled above.");
1859 Store->insertAfter(Inst);
1862 assert(isa<Argument>(Def));
1863 Store->insertAfter(cast<Instruction>(Alloca));
1867 assert(PromotableAllocas.size() == Live.size() + NumRematerializedValues &&
1868 "we must have the same allocas with lives");
1869 if (!PromotableAllocas.empty()) {
1870 // Apply mem2reg to promote alloca to SSA
1871 PromoteMemToReg(PromotableAllocas, DT);
1875 for (auto &I : F.getEntryBlock())
1876 if (isa<AllocaInst>(I))
1878 assert(InitialAllocaNum == 0 && "We must not introduce any extra allocas");
1882 /// Implement a unique function which doesn't require we sort the input
1883 /// vector. Doing so has the effect of changing the output of a couple of
1884 /// tests in ways which make them less useful in testing fused safepoints.
1885 template <typename T> static void unique_unsorted(SmallVectorImpl<T> &Vec) {
1886 SmallSet<T, 8> Seen;
1887 Vec.erase(std::remove_if(Vec.begin(), Vec.end(), [&](const T &V) {
1888 return !Seen.insert(V).second;
1892 /// Insert holders so that each Value is obviously live through the entire
1893 /// lifetime of the call.
1894 static void insertUseHolderAfter(CallSite &CS, const ArrayRef<Value *> Values,
1895 SmallVectorImpl<CallInst *> &Holders) {
1897 // No values to hold live, might as well not insert the empty holder
1900 Module *M = CS.getInstruction()->getModule();
1901 // Use a dummy vararg function to actually hold the values live
1902 Function *Func = cast<Function>(M->getOrInsertFunction(
1903 "__tmp_use", FunctionType::get(Type::getVoidTy(M->getContext()), true)));
1905 // For call safepoints insert dummy calls right after safepoint
1906 Holders.push_back(CallInst::Create(Func, Values, "",
1907 &*++CS.getInstruction()->getIterator()));
1910 // For invoke safepooints insert dummy calls both in normal and
1911 // exceptional destination blocks
1912 auto *II = cast<InvokeInst>(CS.getInstruction());
1913 Holders.push_back(CallInst::Create(
1914 Func, Values, "", &*II->getNormalDest()->getFirstInsertionPt()));
1915 Holders.push_back(CallInst::Create(
1916 Func, Values, "", &*II->getUnwindDest()->getFirstInsertionPt()));
1919 static void findLiveReferences(
1920 Function &F, DominatorTree &DT, ArrayRef<CallSite> toUpdate,
1921 MutableArrayRef<struct PartiallyConstructedSafepointRecord> records) {
1922 GCPtrLivenessData OriginalLivenessData;
1923 computeLiveInValues(DT, F, OriginalLivenessData);
1924 for (size_t i = 0; i < records.size(); i++) {
1925 struct PartiallyConstructedSafepointRecord &info = records[i];
1926 const CallSite &CS = toUpdate[i];
1927 analyzeParsePointLiveness(DT, OriginalLivenessData, CS, info);
1931 /// Remove any vector of pointers from the live set by scalarizing them over the
1932 /// statepoint instruction. Adds the scalarized pieces to the live set. It
1933 /// would be preferable to include the vector in the statepoint itself, but
1934 /// the lowering code currently does not handle that. Extending it would be
1935 /// slightly non-trivial since it requires a format change. Given how rare
1936 /// such cases are (for the moment?) scalarizing is an acceptable compromise.
1937 static void splitVectorValues(Instruction *StatepointInst,
1938 StatepointLiveSetTy &LiveSet,
1939 DenseMap<Value *, Value *>& PointerToBase,
1940 DominatorTree &DT) {
1941 SmallVector<Value *, 16> ToSplit;
1942 for (Value *V : LiveSet)
1943 if (isa<VectorType>(V->getType()))
1944 ToSplit.push_back(V);
1946 if (ToSplit.empty())
1949 DenseMap<Value *, SmallVector<Value *, 16>> ElementMapping;
1951 Function &F = *(StatepointInst->getParent()->getParent());
1953 DenseMap<Value *, AllocaInst *> AllocaMap;
1954 // First is normal return, second is exceptional return (invoke only)
1955 DenseMap<Value *, std::pair<Value *, Value *>> Replacements;
1956 for (Value *V : ToSplit) {
1957 AllocaInst *Alloca =
1958 new AllocaInst(V->getType(), "", F.getEntryBlock().getFirstNonPHI());
1959 AllocaMap[V] = Alloca;
1961 VectorType *VT = cast<VectorType>(V->getType());
1962 IRBuilder<> Builder(StatepointInst);
1963 SmallVector<Value *, 16> Elements;
1964 for (unsigned i = 0; i < VT->getNumElements(); i++)
1965 Elements.push_back(Builder.CreateExtractElement(V, Builder.getInt32(i)));
1966 ElementMapping[V] = Elements;
1968 auto InsertVectorReform = [&](Instruction *IP) {
1969 Builder.SetInsertPoint(IP);
1970 Builder.SetCurrentDebugLocation(IP->getDebugLoc());
1971 Value *ResultVec = UndefValue::get(VT);
1972 for (unsigned i = 0; i < VT->getNumElements(); i++)
1973 ResultVec = Builder.CreateInsertElement(ResultVec, Elements[i],
1974 Builder.getInt32(i));
1978 if (isa<CallInst>(StatepointInst)) {
1979 BasicBlock::iterator Next(StatepointInst);
1981 Instruction *IP = &*(Next);
1982 Replacements[V].first = InsertVectorReform(IP);
1983 Replacements[V].second = nullptr;
1985 InvokeInst *Invoke = cast<InvokeInst>(StatepointInst);
1986 // We've already normalized - check that we don't have shared destination
1988 BasicBlock *NormalDest = Invoke->getNormalDest();
1989 assert(!isa<PHINode>(NormalDest->begin()));
1990 BasicBlock *UnwindDest = Invoke->getUnwindDest();
1991 assert(!isa<PHINode>(UnwindDest->begin()));
1992 // Insert insert element sequences in both successors
1993 Instruction *IP = &*(NormalDest->getFirstInsertionPt());
1994 Replacements[V].first = InsertVectorReform(IP);
1995 IP = &*(UnwindDest->getFirstInsertionPt());
1996 Replacements[V].second = InsertVectorReform(IP);
2000 for (Value *V : ToSplit) {
2001 AllocaInst *Alloca = AllocaMap[V];
2003 // Capture all users before we start mutating use lists
2004 SmallVector<Instruction *, 16> Users;
2005 for (User *U : V->users())
2006 Users.push_back(cast<Instruction>(U));
2008 for (Instruction *I : Users) {
2009 if (auto Phi = dyn_cast<PHINode>(I)) {
2010 for (unsigned i = 0; i < Phi->getNumIncomingValues(); i++)
2011 if (V == Phi->getIncomingValue(i)) {
2012 LoadInst *Load = new LoadInst(
2013 Alloca, "", Phi->getIncomingBlock(i)->getTerminator());
2014 Phi->setIncomingValue(i, Load);
2017 LoadInst *Load = new LoadInst(Alloca, "", I);
2018 I->replaceUsesOfWith(V, Load);
2022 // Store the original value and the replacement value into the alloca
2023 StoreInst *Store = new StoreInst(V, Alloca);
2024 if (auto I = dyn_cast<Instruction>(V))
2025 Store->insertAfter(I);
2027 Store->insertAfter(Alloca);
2029 // Normal return for invoke, or call return
2030 Instruction *Replacement = cast<Instruction>(Replacements[V].first);
2031 (new StoreInst(Replacement, Alloca))->insertAfter(Replacement);
2032 // Unwind return for invoke only
2033 Replacement = cast_or_null<Instruction>(Replacements[V].second);
2035 (new StoreInst(Replacement, Alloca))->insertAfter(Replacement);
2038 // apply mem2reg to promote alloca to SSA
2039 SmallVector<AllocaInst *, 16> Allocas;
2040 for (Value *V : ToSplit)
2041 Allocas.push_back(AllocaMap[V]);
2042 PromoteMemToReg(Allocas, DT);
2044 // Update our tracking of live pointers and base mappings to account for the
2045 // changes we just made.
2046 for (Value *V : ToSplit) {
2047 auto &Elements = ElementMapping[V];
2050 LiveSet.insert(Elements.begin(), Elements.end());
2051 // We need to update the base mapping as well.
2052 assert(PointerToBase.count(V));
2053 Value *OldBase = PointerToBase[V];
2054 auto &BaseElements = ElementMapping[OldBase];
2055 PointerToBase.erase(V);
2056 assert(Elements.size() == BaseElements.size());
2057 for (unsigned i = 0; i < Elements.size(); i++) {
2058 Value *Elem = Elements[i];
2059 PointerToBase[Elem] = BaseElements[i];
2064 // Helper function for the "rematerializeLiveValues". It walks use chain
2065 // starting from the "CurrentValue" until it meets "BaseValue". Only "simple"
2066 // values are visited (currently it is GEP's and casts). Returns true if it
2067 // successfully reached "BaseValue" and false otherwise.
2068 // Fills "ChainToBase" array with all visited values. "BaseValue" is not
2070 static bool findRematerializableChainToBasePointer(
2071 SmallVectorImpl<Instruction*> &ChainToBase,
2072 Value *CurrentValue, Value *BaseValue) {
2074 // We have found a base value
2075 if (CurrentValue == BaseValue) {
2079 if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(CurrentValue)) {
2080 ChainToBase.push_back(GEP);
2081 return findRematerializableChainToBasePointer(ChainToBase,
2082 GEP->getPointerOperand(),
2086 if (CastInst *CI = dyn_cast<CastInst>(CurrentValue)) {
2087 if (!CI->isNoopCast(CI->getModule()->getDataLayout()))
2090 ChainToBase.push_back(CI);
2091 return findRematerializableChainToBasePointer(ChainToBase,
2092 CI->getOperand(0), BaseValue);
2095 // Not supported instruction in the chain
2099 // Helper function for the "rematerializeLiveValues". Compute cost of the use
2100 // chain we are going to rematerialize.
2102 chainToBasePointerCost(SmallVectorImpl<Instruction*> &Chain,
2103 TargetTransformInfo &TTI) {
2106 for (Instruction *Instr : Chain) {
2107 if (CastInst *CI = dyn_cast<CastInst>(Instr)) {
2108 assert(CI->isNoopCast(CI->getModule()->getDataLayout()) &&
2109 "non noop cast is found during rematerialization");
2111 Type *SrcTy = CI->getOperand(0)->getType();
2112 Cost += TTI.getCastInstrCost(CI->getOpcode(), CI->getType(), SrcTy);
2114 } else if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(Instr)) {
2115 // Cost of the address calculation
2116 Type *ValTy = GEP->getPointerOperandType()->getPointerElementType();
2117 Cost += TTI.getAddressComputationCost(ValTy);
2119 // And cost of the GEP itself
2120 // TODO: Use TTI->getGEPCost here (it exists, but appears to be not
2121 // allowed for the external usage)
2122 if (!GEP->hasAllConstantIndices())
2126 llvm_unreachable("unsupported instruciton type during rematerialization");
2133 // From the statepoint live set pick values that are cheaper to recompute then
2134 // to relocate. Remove this values from the live set, rematerialize them after
2135 // statepoint and record them in "Info" structure. Note that similar to
2136 // relocated values we don't do any user adjustments here.
2137 static void rematerializeLiveValues(CallSite CS,
2138 PartiallyConstructedSafepointRecord &Info,
2139 TargetTransformInfo &TTI) {
2140 const unsigned int ChainLengthThreshold = 10;
2142 // Record values we are going to delete from this statepoint live set.
2143 // We can not di this in following loop due to iterator invalidation.
2144 SmallVector<Value *, 32> LiveValuesToBeDeleted;
2146 for (Value *LiveValue: Info.LiveSet) {
2147 // For each live pointer find it's defining chain
2148 SmallVector<Instruction *, 3> ChainToBase;
2149 assert(Info.PointerToBase.count(LiveValue));
2151 findRematerializableChainToBasePointer(ChainToBase,
2153 Info.PointerToBase[LiveValue]);
2154 // Nothing to do, or chain is too long
2156 ChainToBase.size() == 0 ||
2157 ChainToBase.size() > ChainLengthThreshold)
2160 // Compute cost of this chain
2161 unsigned Cost = chainToBasePointerCost(ChainToBase, TTI);
2162 // TODO: We can also account for cases when we will be able to remove some
2163 // of the rematerialized values by later optimization passes. I.e if
2164 // we rematerialized several intersecting chains. Or if original values
2165 // don't have any uses besides this statepoint.
2167 // For invokes we need to rematerialize each chain twice - for normal and
2168 // for unwind basic blocks. Model this by multiplying cost by two.
2169 if (CS.isInvoke()) {
2172 // If it's too expensive - skip it
2173 if (Cost >= RematerializationThreshold)
2176 // Remove value from the live set
2177 LiveValuesToBeDeleted.push_back(LiveValue);
2179 // Clone instructions and record them inside "Info" structure
2181 // Walk backwards to visit top-most instructions first
2182 std::reverse(ChainToBase.begin(), ChainToBase.end());
2184 // Utility function which clones all instructions from "ChainToBase"
2185 // and inserts them before "InsertBefore". Returns rematerialized value
2186 // which should be used after statepoint.
2187 auto rematerializeChain = [&ChainToBase](Instruction *InsertBefore) {
2188 Instruction *LastClonedValue = nullptr;
2189 Instruction *LastValue = nullptr;
2190 for (Instruction *Instr: ChainToBase) {
2191 // Only GEP's and casts are suported as we need to be careful to not
2192 // introduce any new uses of pointers not in the liveset.
2193 // Note that it's fine to introduce new uses of pointers which were
2194 // otherwise not used after this statepoint.
2195 assert(isa<GetElementPtrInst>(Instr) || isa<CastInst>(Instr));
2197 Instruction *ClonedValue = Instr->clone();
2198 ClonedValue->insertBefore(InsertBefore);
2199 ClonedValue->setName(Instr->getName() + ".remat");
2201 // If it is not first instruction in the chain then it uses previously
2202 // cloned value. We should update it to use cloned value.
2203 if (LastClonedValue) {
2205 ClonedValue->replaceUsesOfWith(LastValue, LastClonedValue);
2207 // Assert that cloned instruction does not use any instructions from
2208 // this chain other than LastClonedValue
2209 for (auto OpValue : ClonedValue->operand_values()) {
2210 assert(std::find(ChainToBase.begin(), ChainToBase.end(), OpValue) ==
2211 ChainToBase.end() &&
2212 "incorrect use in rematerialization chain");
2217 LastClonedValue = ClonedValue;
2220 assert(LastClonedValue);
2221 return LastClonedValue;
2224 // Different cases for calls and invokes. For invokes we need to clone
2225 // instructions both on normal and unwind path.
2227 Instruction *InsertBefore = CS.getInstruction()->getNextNode();
2228 assert(InsertBefore);
2229 Instruction *RematerializedValue = rematerializeChain(InsertBefore);
2230 Info.RematerializedValues[RematerializedValue] = LiveValue;
2232 InvokeInst *Invoke = cast<InvokeInst>(CS.getInstruction());
2234 Instruction *NormalInsertBefore =
2235 &*Invoke->getNormalDest()->getFirstInsertionPt();
2236 Instruction *UnwindInsertBefore =
2237 &*Invoke->getUnwindDest()->getFirstInsertionPt();
2239 Instruction *NormalRematerializedValue =
2240 rematerializeChain(NormalInsertBefore);
2241 Instruction *UnwindRematerializedValue =
2242 rematerializeChain(UnwindInsertBefore);
2244 Info.RematerializedValues[NormalRematerializedValue] = LiveValue;
2245 Info.RematerializedValues[UnwindRematerializedValue] = LiveValue;
2249 // Remove rematerializaed values from the live set
2250 for (auto LiveValue: LiveValuesToBeDeleted) {
2251 Info.LiveSet.erase(LiveValue);
2255 static bool insertParsePoints(Function &F, DominatorTree &DT,
2256 TargetTransformInfo &TTI,
2257 SmallVectorImpl<CallSite> &ToUpdate) {
2259 // sanity check the input
2260 std::set<CallSite> Uniqued;
2261 Uniqued.insert(ToUpdate.begin(), ToUpdate.end());
2262 assert(Uniqued.size() == ToUpdate.size() && "no duplicates please!");
2264 for (CallSite CS : ToUpdate) {
2265 assert(CS.getInstruction()->getParent()->getParent() == &F);
2266 assert((UseDeoptBundles || isStatepoint(CS)) &&
2267 "expected to already be a deopt statepoint");
2271 // When inserting gc.relocates for invokes, we need to be able to insert at
2272 // the top of the successor blocks. See the comment on
2273 // normalForInvokeSafepoint on exactly what is needed. Note that this step
2274 // may restructure the CFG.
2275 for (CallSite CS : ToUpdate) {
2278 auto *II = cast<InvokeInst>(CS.getInstruction());
2279 normalizeForInvokeSafepoint(II->getNormalDest(), II->getParent(), DT);
2280 normalizeForInvokeSafepoint(II->getUnwindDest(), II->getParent(), DT);
2283 // A list of dummy calls added to the IR to keep various values obviously
2284 // live in the IR. We'll remove all of these when done.
2285 SmallVector<CallInst *, 64> Holders;
2287 // Insert a dummy call with all of the arguments to the vm_state we'll need
2288 // for the actual safepoint insertion. This ensures reference arguments in
2289 // the deopt argument list are considered live through the safepoint (and
2290 // thus makes sure they get relocated.)
2291 for (CallSite CS : ToUpdate) {
2292 SmallVector<Value *, 64> DeoptValues;
2294 iterator_range<const Use *> DeoptStateRange =
2296 ? iterator_range<const Use *>(GetDeoptBundleOperands(CS))
2297 : iterator_range<const Use *>(Statepoint(CS).vm_state_args());
2299 for (Value *Arg : DeoptStateRange) {
2300 assert(!isUnhandledGCPointerType(Arg->getType()) &&
2301 "support for FCA unimplemented");
2302 if (isHandledGCPointerType(Arg->getType()))
2303 DeoptValues.push_back(Arg);
2306 insertUseHolderAfter(CS, DeoptValues, Holders);
2309 SmallVector<PartiallyConstructedSafepointRecord, 64> Records(ToUpdate.size());
2311 // A) Identify all gc pointers which are statically live at the given call
2313 findLiveReferences(F, DT, ToUpdate, Records);
2315 // B) Find the base pointers for each live pointer
2316 /* scope for caching */ {
2317 // Cache the 'defining value' relation used in the computation and
2318 // insertion of base phis and selects. This ensures that we don't insert
2319 // large numbers of duplicate base_phis.
2320 DefiningValueMapTy DVCache;
2322 for (size_t i = 0; i < Records.size(); i++) {
2323 PartiallyConstructedSafepointRecord &info = Records[i];
2324 findBasePointers(DT, DVCache, ToUpdate[i], info);
2326 } // end of cache scope
2328 // The base phi insertion logic (for any safepoint) may have inserted new
2329 // instructions which are now live at some safepoint. The simplest such
2332 // phi a <-- will be a new base_phi here
2333 // safepoint 1 <-- that needs to be live here
2337 // We insert some dummy calls after each safepoint to definitely hold live
2338 // the base pointers which were identified for that safepoint. We'll then
2339 // ask liveness for _every_ base inserted to see what is now live. Then we
2340 // remove the dummy calls.
2341 Holders.reserve(Holders.size() + Records.size());
2342 for (size_t i = 0; i < Records.size(); i++) {
2343 PartiallyConstructedSafepointRecord &Info = Records[i];
2345 SmallVector<Value *, 128> Bases;
2346 for (auto Pair : Info.PointerToBase)
2347 Bases.push_back(Pair.second);
2349 insertUseHolderAfter(ToUpdate[i], Bases, Holders);
2352 // By selecting base pointers, we've effectively inserted new uses. Thus, we
2353 // need to rerun liveness. We may *also* have inserted new defs, but that's
2354 // not the key issue.
2355 recomputeLiveInValues(F, DT, ToUpdate, Records);
2357 if (PrintBasePointers) {
2358 for (auto &Info : Records) {
2359 errs() << "Base Pairs: (w/Relocation)\n";
2360 for (auto Pair : Info.PointerToBase) {
2361 errs() << " derived ";
2362 Pair.first->printAsOperand(errs(), false);
2364 Pair.second->printAsOperand(errs(), false);
2370 // It is possible that non-constant live variables have a constant base. For
2371 // example, a GEP with a variable offset from a global. In this case we can
2372 // remove it from the liveset. We already don't add constants to the liveset
2373 // because we assume they won't move at runtime and the GC doesn't need to be
2374 // informed about them. The same reasoning applies if the base is constant.
2375 // Note that the relocation placement code relies on this filtering for
2376 // correctness as it expects the base to be in the liveset, which isn't true
2377 // if the base is constant.
2378 for (auto &Info : Records)
2379 for (auto &BasePair : Info.PointerToBase)
2380 if (isa<Constant>(BasePair.second))
2381 Info.LiveSet.erase(BasePair.first);
2383 for (CallInst *CI : Holders)
2384 CI->eraseFromParent();
2388 // Do a limited scalarization of any live at safepoint vector values which
2389 // contain pointers. This enables this pass to run after vectorization at
2390 // the cost of some possible performance loss. Note: This is known to not
2391 // handle updating of the side tables correctly which can lead to relocation
2392 // bugs when the same vector is live at multiple statepoints. We're in the
2393 // process of implementing the alternate lowering - relocating the
2394 // vector-of-pointers as first class item and updating the backend to
2395 // understand that - but that's not yet complete.
2397 for (size_t i = 0; i < Records.size(); i++) {
2398 PartiallyConstructedSafepointRecord &Info = Records[i];
2399 Instruction *Statepoint = ToUpdate[i].getInstruction();
2400 splitVectorValues(cast<Instruction>(Statepoint), Info.LiveSet,
2401 Info.PointerToBase, DT);
2404 // In order to reduce live set of statepoint we might choose to rematerialize
2405 // some values instead of relocating them. This is purely an optimization and
2406 // does not influence correctness.
2407 for (size_t i = 0; i < Records.size(); i++)
2408 rematerializeLiveValues(ToUpdate[i], Records[i], TTI);
2410 // We need this to safely RAUW and delete call or invoke return values that
2411 // may themselves be live over a statepoint. For details, please see usage in
2412 // makeStatepointExplicitImpl.
2413 std::vector<DeferredReplacement> Replacements;
2415 // Now run through and replace the existing statepoints with new ones with
2416 // the live variables listed. We do not yet update uses of the values being
2417 // relocated. We have references to live variables that need to
2418 // survive to the last iteration of this loop. (By construction, the
2419 // previous statepoint can not be a live variable, thus we can and remove
2420 // the old statepoint calls as we go.)
2421 for (size_t i = 0; i < Records.size(); i++)
2422 makeStatepointExplicit(DT, ToUpdate[i], Records[i], Replacements);
2424 ToUpdate.clear(); // prevent accident use of invalid CallSites
2426 for (auto &PR : Replacements)
2429 Replacements.clear();
2431 for (auto &Info : Records) {
2432 // These live sets may contain state Value pointers, since we replaced calls
2433 // with operand bundles with calls wrapped in gc.statepoint, and some of
2434 // those calls may have been def'ing live gc pointers. Clear these out to
2435 // avoid accidentally using them.
2437 // TODO: We should create a separate data structure that does not contain
2438 // these live sets, and migrate to using that data structure from this point
2440 Info.LiveSet.clear();
2441 Info.PointerToBase.clear();
2444 // Do all the fixups of the original live variables to their relocated selves
2445 SmallVector<Value *, 128> Live;
2446 for (size_t i = 0; i < Records.size(); i++) {
2447 PartiallyConstructedSafepointRecord &Info = Records[i];
2449 // We can't simply save the live set from the original insertion. One of
2450 // the live values might be the result of a call which needs a safepoint.
2451 // That Value* no longer exists and we need to use the new gc_result.
2452 // Thankfully, the live set is embedded in the statepoint (and updated), so
2453 // we just grab that.
2454 Statepoint Statepoint(Info.StatepointToken);
2455 Live.insert(Live.end(), Statepoint.gc_args_begin(),
2456 Statepoint.gc_args_end());
2458 // Do some basic sanity checks on our liveness results before performing
2459 // relocation. Relocation can and will turn mistakes in liveness results
2460 // into non-sensical code which is must harder to debug.
2461 // TODO: It would be nice to test consistency as well
2462 assert(DT.isReachableFromEntry(Info.StatepointToken->getParent()) &&
2463 "statepoint must be reachable or liveness is meaningless");
2464 for (Value *V : Statepoint.gc_args()) {
2465 if (!isa<Instruction>(V))
2466 // Non-instruction values trivial dominate all possible uses
2468 auto *LiveInst = cast<Instruction>(V);
2469 assert(DT.isReachableFromEntry(LiveInst->getParent()) &&
2470 "unreachable values should never be live");
2471 assert(DT.dominates(LiveInst, Info.StatepointToken) &&
2472 "basic SSA liveness expectation violated by liveness analysis");
2476 unique_unsorted(Live);
2480 for (auto *Ptr : Live)
2481 assert(isGCPointerType(Ptr->getType()) && "must be a gc pointer type");
2484 relocationViaAlloca(F, DT, Live, Records);
2485 return !Records.empty();
2488 // Handles both return values and arguments for Functions and CallSites.
2489 template <typename AttrHolder>
2490 static void RemoveNonValidAttrAtIndex(LLVMContext &Ctx, AttrHolder &AH,
2493 if (AH.getDereferenceableBytes(Index))
2494 R.addAttribute(Attribute::get(Ctx, Attribute::Dereferenceable,
2495 AH.getDereferenceableBytes(Index)));
2496 if (AH.getDereferenceableOrNullBytes(Index))
2497 R.addAttribute(Attribute::get(Ctx, Attribute::DereferenceableOrNull,
2498 AH.getDereferenceableOrNullBytes(Index)));
2499 if (AH.doesNotAlias(Index))
2500 R.addAttribute(Attribute::NoAlias);
2503 AH.setAttributes(AH.getAttributes().removeAttributes(
2504 Ctx, Index, AttributeSet::get(Ctx, Index, R)));
2508 RewriteStatepointsForGC::stripNonValidAttributesFromPrototype(Function &F) {
2509 LLVMContext &Ctx = F.getContext();
2511 for (Argument &A : F.args())
2512 if (isa<PointerType>(A.getType()))
2513 RemoveNonValidAttrAtIndex(Ctx, F, A.getArgNo() + 1);
2515 if (isa<PointerType>(F.getReturnType()))
2516 RemoveNonValidAttrAtIndex(Ctx, F, AttributeSet::ReturnIndex);
2519 void RewriteStatepointsForGC::stripNonValidAttributesFromBody(Function &F) {
2523 LLVMContext &Ctx = F.getContext();
2524 MDBuilder Builder(Ctx);
2526 for (Instruction &I : instructions(F)) {
2527 if (const MDNode *MD = I.getMetadata(LLVMContext::MD_tbaa)) {
2528 assert(MD->getNumOperands() < 5 && "unrecognized metadata shape!");
2529 bool IsImmutableTBAA =
2530 MD->getNumOperands() == 4 &&
2531 mdconst::extract<ConstantInt>(MD->getOperand(3))->getValue() == 1;
2533 if (!IsImmutableTBAA)
2534 continue; // no work to do, MD_tbaa is already marked mutable
2536 MDNode *Base = cast<MDNode>(MD->getOperand(0));
2537 MDNode *Access = cast<MDNode>(MD->getOperand(1));
2539 mdconst::extract<ConstantInt>(MD->getOperand(2))->getZExtValue();
2541 MDNode *MutableTBAA =
2542 Builder.createTBAAStructTagNode(Base, Access, Offset);
2543 I.setMetadata(LLVMContext::MD_tbaa, MutableTBAA);
2546 if (CallSite CS = CallSite(&I)) {
2547 for (int i = 0, e = CS.arg_size(); i != e; i++)
2548 if (isa<PointerType>(CS.getArgument(i)->getType()))
2549 RemoveNonValidAttrAtIndex(Ctx, CS, i + 1);
2550 if (isa<PointerType>(CS.getType()))
2551 RemoveNonValidAttrAtIndex(Ctx, CS, AttributeSet::ReturnIndex);
2556 /// Returns true if this function should be rewritten by this pass. The main
2557 /// point of this function is as an extension point for custom logic.
2558 static bool shouldRewriteStatepointsIn(Function &F) {
2559 // TODO: This should check the GCStrategy
2561 const auto &FunctionGCName = F.getGC();
2562 const StringRef StatepointExampleName("statepoint-example");
2563 const StringRef CoreCLRName("coreclr");
2564 return (StatepointExampleName == FunctionGCName) ||
2565 (CoreCLRName == FunctionGCName);
2570 void RewriteStatepointsForGC::stripNonValidAttributes(Module &M) {
2572 assert(std::any_of(M.begin(), M.end(), shouldRewriteStatepointsIn) &&
2576 for (Function &F : M)
2577 stripNonValidAttributesFromPrototype(F);
2579 for (Function &F : M)
2580 stripNonValidAttributesFromBody(F);
2583 bool RewriteStatepointsForGC::runOnFunction(Function &F) {
2584 // Nothing to do for declarations.
2585 if (F.isDeclaration() || F.empty())
2588 // Policy choice says not to rewrite - the most common reason is that we're
2589 // compiling code without a GCStrategy.
2590 if (!shouldRewriteStatepointsIn(F))
2593 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>(F).getDomTree();
2594 TargetTransformInfo &TTI =
2595 getAnalysis<TargetTransformInfoWrapperPass>().getTTI(F);
2597 auto NeedsRewrite = [](Instruction &I) {
2598 if (UseDeoptBundles) {
2599 if (ImmutableCallSite CS = ImmutableCallSite(&I))
2600 return !callsGCLeafFunction(CS);
2604 return isStatepoint(I);
2607 // Gather all the statepoints which need rewritten. Be careful to only
2608 // consider those in reachable code since we need to ask dominance queries
2609 // when rewriting. We'll delete the unreachable ones in a moment.
2610 SmallVector<CallSite, 64> ParsePointNeeded;
2611 bool HasUnreachableStatepoint = false;
2612 for (Instruction &I : instructions(F)) {
2613 // TODO: only the ones with the flag set!
2614 if (NeedsRewrite(I)) {
2615 if (DT.isReachableFromEntry(I.getParent()))
2616 ParsePointNeeded.push_back(CallSite(&I));
2618 HasUnreachableStatepoint = true;
2622 bool MadeChange = false;
2624 // Delete any unreachable statepoints so that we don't have unrewritten
2625 // statepoints surviving this pass. This makes testing easier and the
2626 // resulting IR less confusing to human readers. Rather than be fancy, we
2627 // just reuse a utility function which removes the unreachable blocks.
2628 if (HasUnreachableStatepoint)
2629 MadeChange |= removeUnreachableBlocks(F);
2631 // Return early if no work to do.
2632 if (ParsePointNeeded.empty())
2635 // As a prepass, go ahead and aggressively destroy single entry phi nodes.
2636 // These are created by LCSSA. They have the effect of increasing the size
2637 // of liveness sets for no good reason. It may be harder to do this post
2638 // insertion since relocations and base phis can confuse things.
2639 for (BasicBlock &BB : F)
2640 if (BB.getUniquePredecessor()) {
2642 FoldSingleEntryPHINodes(&BB);
2645 // Before we start introducing relocations, we want to tweak the IR a bit to
2646 // avoid unfortunate code generation effects. The main example is that we
2647 // want to try to make sure the comparison feeding a branch is after any
2648 // safepoints. Otherwise, we end up with a comparison of pre-relocation
2649 // values feeding a branch after relocation. This is semantically correct,
2650 // but results in extra register pressure since both the pre-relocation and
2651 // post-relocation copies must be available in registers. For code without
2652 // relocations this is handled elsewhere, but teaching the scheduler to
2653 // reverse the transform we're about to do would be slightly complex.
2654 // Note: This may extend the live range of the inputs to the icmp and thus
2655 // increase the liveset of any statepoint we move over. This is profitable
2656 // as long as all statepoints are in rare blocks. If we had in-register
2657 // lowering for live values this would be a much safer transform.
2658 auto getConditionInst = [](TerminatorInst *TI) -> Instruction* {
2659 if (auto *BI = dyn_cast<BranchInst>(TI))
2660 if (BI->isConditional())
2661 return dyn_cast<Instruction>(BI->getCondition());
2662 // TODO: Extend this to handle switches
2665 for (BasicBlock &BB : F) {
2666 TerminatorInst *TI = BB.getTerminator();
2667 if (auto *Cond = getConditionInst(TI))
2668 // TODO: Handle more than just ICmps here. We should be able to move
2669 // most instructions without side effects or memory access.
2670 if (isa<ICmpInst>(Cond) && Cond->hasOneUse()) {
2672 Cond->moveBefore(TI);
2676 MadeChange |= insertParsePoints(F, DT, TTI, ParsePointNeeded);
2680 // liveness computation via standard dataflow
2681 // -------------------------------------------------------------------
2683 // TODO: Consider using bitvectors for liveness, the set of potentially
2684 // interesting values should be small and easy to pre-compute.
2686 /// Compute the live-in set for the location rbegin starting from
2687 /// the live-out set of the basic block
2688 static void computeLiveInValues(BasicBlock::reverse_iterator rbegin,
2689 BasicBlock::reverse_iterator rend,
2690 DenseSet<Value *> &LiveTmp) {
2692 for (BasicBlock::reverse_iterator ritr = rbegin; ritr != rend; ritr++) {
2693 Instruction *I = &*ritr;
2695 // KILL/Def - Remove this definition from LiveIn
2698 // Don't consider *uses* in PHI nodes, we handle their contribution to
2699 // predecessor blocks when we seed the LiveOut sets
2700 if (isa<PHINode>(I))
2703 // USE - Add to the LiveIn set for this instruction
2704 for (Value *V : I->operands()) {
2705 assert(!isUnhandledGCPointerType(V->getType()) &&
2706 "support for FCA unimplemented");
2707 if (isHandledGCPointerType(V->getType()) && !isa<Constant>(V)) {
2708 // The choice to exclude all things constant here is slightly subtle.
2709 // There are two independent reasons:
2710 // - We assume that things which are constant (from LLVM's definition)
2711 // do not move at runtime. For example, the address of a global
2712 // variable is fixed, even though it's contents may not be.
2713 // - Second, we can't disallow arbitrary inttoptr constants even
2714 // if the language frontend does. Optimization passes are free to
2715 // locally exploit facts without respect to global reachability. This
2716 // can create sections of code which are dynamically unreachable and
2717 // contain just about anything. (see constants.ll in tests)
2724 static void computeLiveOutSeed(BasicBlock *BB, DenseSet<Value *> &LiveTmp) {
2726 for (BasicBlock *Succ : successors(BB)) {
2727 const BasicBlock::iterator E(Succ->getFirstNonPHI());
2728 for (BasicBlock::iterator I = Succ->begin(); I != E; I++) {
2729 PHINode *Phi = cast<PHINode>(&*I);
2730 Value *V = Phi->getIncomingValueForBlock(BB);
2731 assert(!isUnhandledGCPointerType(V->getType()) &&
2732 "support for FCA unimplemented");
2733 if (isHandledGCPointerType(V->getType()) && !isa<Constant>(V)) {
2740 static DenseSet<Value *> computeKillSet(BasicBlock *BB) {
2741 DenseSet<Value *> KillSet;
2742 for (Instruction &I : *BB)
2743 if (isHandledGCPointerType(I.getType()))
2749 /// Check that the items in 'Live' dominate 'TI'. This is used as a basic
2750 /// sanity check for the liveness computation.
2751 static void checkBasicSSA(DominatorTree &DT, DenseSet<Value *> &Live,
2752 TerminatorInst *TI, bool TermOkay = false) {
2753 for (Value *V : Live) {
2754 if (auto *I = dyn_cast<Instruction>(V)) {
2755 // The terminator can be a member of the LiveOut set. LLVM's definition
2756 // of instruction dominance states that V does not dominate itself. As
2757 // such, we need to special case this to allow it.
2758 if (TermOkay && TI == I)
2760 assert(DT.dominates(I, TI) &&
2761 "basic SSA liveness expectation violated by liveness analysis");
2766 /// Check that all the liveness sets used during the computation of liveness
2767 /// obey basic SSA properties. This is useful for finding cases where we miss
2769 static void checkBasicSSA(DominatorTree &DT, GCPtrLivenessData &Data,
2771 checkBasicSSA(DT, Data.LiveSet[&BB], BB.getTerminator());
2772 checkBasicSSA(DT, Data.LiveOut[&BB], BB.getTerminator(), true);
2773 checkBasicSSA(DT, Data.LiveIn[&BB], BB.getTerminator());
2777 static void computeLiveInValues(DominatorTree &DT, Function &F,
2778 GCPtrLivenessData &Data) {
2780 SmallSetVector<BasicBlock *, 200> Worklist;
2781 auto AddPredsToWorklist = [&](BasicBlock *BB) {
2782 // We use a SetVector so that we don't have duplicates in the worklist.
2783 Worklist.insert(pred_begin(BB), pred_end(BB));
2785 auto NextItem = [&]() {
2786 BasicBlock *BB = Worklist.back();
2787 Worklist.pop_back();
2791 // Seed the liveness for each individual block
2792 for (BasicBlock &BB : F) {
2793 Data.KillSet[&BB] = computeKillSet(&BB);
2794 Data.LiveSet[&BB].clear();
2795 computeLiveInValues(BB.rbegin(), BB.rend(), Data.LiveSet[&BB]);
2798 for (Value *Kill : Data.KillSet[&BB])
2799 assert(!Data.LiveSet[&BB].count(Kill) && "live set contains kill");
2802 Data.LiveOut[&BB] = DenseSet<Value *>();
2803 computeLiveOutSeed(&BB, Data.LiveOut[&BB]);
2804 Data.LiveIn[&BB] = Data.LiveSet[&BB];
2805 set_union(Data.LiveIn[&BB], Data.LiveOut[&BB]);
2806 set_subtract(Data.LiveIn[&BB], Data.KillSet[&BB]);
2807 if (!Data.LiveIn[&BB].empty())
2808 AddPredsToWorklist(&BB);
2811 // Propagate that liveness until stable
2812 while (!Worklist.empty()) {
2813 BasicBlock *BB = NextItem();
2815 // Compute our new liveout set, then exit early if it hasn't changed
2816 // despite the contribution of our successor.
2817 DenseSet<Value *> LiveOut = Data.LiveOut[BB];
2818 const auto OldLiveOutSize = LiveOut.size();
2819 for (BasicBlock *Succ : successors(BB)) {
2820 assert(Data.LiveIn.count(Succ));
2821 set_union(LiveOut, Data.LiveIn[Succ]);
2823 // assert OutLiveOut is a subset of LiveOut
2824 if (OldLiveOutSize == LiveOut.size()) {
2825 // If the sets are the same size, then we didn't actually add anything
2826 // when unioning our successors LiveIn Thus, the LiveIn of this block
2830 Data.LiveOut[BB] = LiveOut;
2832 // Apply the effects of this basic block
2833 DenseSet<Value *> LiveTmp = LiveOut;
2834 set_union(LiveTmp, Data.LiveSet[BB]);
2835 set_subtract(LiveTmp, Data.KillSet[BB]);
2837 assert(Data.LiveIn.count(BB));
2838 const DenseSet<Value *> &OldLiveIn = Data.LiveIn[BB];
2839 // assert: OldLiveIn is a subset of LiveTmp
2840 if (OldLiveIn.size() != LiveTmp.size()) {
2841 Data.LiveIn[BB] = LiveTmp;
2842 AddPredsToWorklist(BB);
2844 } // while( !worklist.empty() )
2847 // Sanity check our output against SSA properties. This helps catch any
2848 // missing kills during the above iteration.
2849 for (BasicBlock &BB : F) {
2850 checkBasicSSA(DT, Data, BB);
2855 static void findLiveSetAtInst(Instruction *Inst, GCPtrLivenessData &Data,
2856 StatepointLiveSetTy &Out) {
2858 BasicBlock *BB = Inst->getParent();
2860 // Note: The copy is intentional and required
2861 assert(Data.LiveOut.count(BB));
2862 DenseSet<Value *> LiveOut = Data.LiveOut[BB];
2864 // We want to handle the statepoint itself oddly. It's
2865 // call result is not live (normal), nor are it's arguments
2866 // (unless they're used again later). This adjustment is
2867 // specifically what we need to relocate
2868 BasicBlock::reverse_iterator rend(Inst->getIterator());
2869 computeLiveInValues(BB->rbegin(), rend, LiveOut);
2870 LiveOut.erase(Inst);
2871 Out.insert(LiveOut.begin(), LiveOut.end());
2874 static void recomputeLiveInValues(GCPtrLivenessData &RevisedLivenessData,
2876 PartiallyConstructedSafepointRecord &Info) {
2877 Instruction *Inst = CS.getInstruction();
2878 StatepointLiveSetTy Updated;
2879 findLiveSetAtInst(Inst, RevisedLivenessData, Updated);
2882 DenseSet<Value *> Bases;
2883 for (auto KVPair : Info.PointerToBase) {
2884 Bases.insert(KVPair.second);
2887 // We may have base pointers which are now live that weren't before. We need
2888 // to update the PointerToBase structure to reflect this.
2889 for (auto V : Updated)
2890 if (!Info.PointerToBase.count(V)) {
2891 assert(Bases.count(V) && "can't find base for unexpected live value");
2892 Info.PointerToBase[V] = V;
2897 for (auto V : Updated) {
2898 assert(Info.PointerToBase.count(V) &&
2899 "must be able to find base for live value");
2903 // Remove any stale base mappings - this can happen since our liveness is
2904 // more precise then the one inherent in the base pointer analysis
2905 DenseSet<Value *> ToErase;
2906 for (auto KVPair : Info.PointerToBase)
2907 if (!Updated.count(KVPair.first))
2908 ToErase.insert(KVPair.first);
2909 for (auto V : ToErase)
2910 Info.PointerToBase.erase(V);
2913 for (auto KVPair : Info.PointerToBase)
2914 assert(Updated.count(KVPair.first) && "record for non-live value");
2917 Info.LiveSet = Updated;