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));
82 struct RewriteStatepointsForGC : public ModulePass {
83 static char ID; // Pass identification, replacement for typeid
85 RewriteStatepointsForGC() : ModulePass(ID) {
86 initializeRewriteStatepointsForGCPass(*PassRegistry::getPassRegistry());
88 bool runOnFunction(Function &F);
89 bool runOnModule(Module &M) override {
92 Changed |= runOnFunction(F);
95 // stripDereferenceabilityInfo asserts that shouldRewriteStatepointsIn
96 // returns true for at least one function in the module. Since at least
97 // one function changed, we know that the precondition is satisfied.
98 stripDereferenceabilityInfo(M);
104 void getAnalysisUsage(AnalysisUsage &AU) const override {
105 // We add and rewrite a bunch of instructions, but don't really do much
106 // else. We could in theory preserve a lot more analyses here.
107 AU.addRequired<DominatorTreeWrapperPass>();
108 AU.addRequired<TargetTransformInfoWrapperPass>();
111 /// The IR fed into RewriteStatepointsForGC may have had attributes implying
112 /// dereferenceability that are no longer valid/correct after
113 /// RewriteStatepointsForGC has run. This is because semantically, after
114 /// RewriteStatepointsForGC runs, all calls to gc.statepoint "free" the entire
115 /// heap. stripDereferenceabilityInfo (conservatively) restores correctness
116 /// by erasing all attributes in the module that externally imply
117 /// dereferenceability.
119 void stripDereferenceabilityInfo(Module &M);
121 // Helpers for stripDereferenceabilityInfo
122 void stripDereferenceabilityInfoFromBody(Function &F);
123 void stripDereferenceabilityInfoFromPrototype(Function &F);
127 char RewriteStatepointsForGC::ID = 0;
129 ModulePass *llvm::createRewriteStatepointsForGCPass() {
130 return new RewriteStatepointsForGC();
133 INITIALIZE_PASS_BEGIN(RewriteStatepointsForGC, "rewrite-statepoints-for-gc",
134 "Make relocations explicit at statepoints", false, false)
135 INITIALIZE_PASS_DEPENDENCY(DominatorTreeWrapperPass)
136 INITIALIZE_PASS_END(RewriteStatepointsForGC, "rewrite-statepoints-for-gc",
137 "Make relocations explicit at statepoints", false, false)
140 struct GCPtrLivenessData {
141 /// Values defined in this block.
142 DenseMap<BasicBlock *, DenseSet<Value *>> KillSet;
143 /// Values used in this block (and thus live); does not included values
144 /// killed within this block.
145 DenseMap<BasicBlock *, DenseSet<Value *>> LiveSet;
147 /// Values live into this basic block (i.e. used by any
148 /// instruction in this basic block or ones reachable from here)
149 DenseMap<BasicBlock *, DenseSet<Value *>> LiveIn;
151 /// Values live out of this basic block (i.e. live into
152 /// any successor block)
153 DenseMap<BasicBlock *, DenseSet<Value *>> LiveOut;
156 // The type of the internal cache used inside the findBasePointers family
157 // of functions. From the callers perspective, this is an opaque type and
158 // should not be inspected.
160 // In the actual implementation this caches two relations:
161 // - The base relation itself (i.e. this pointer is based on that one)
162 // - The base defining value relation (i.e. before base_phi insertion)
163 // Generally, after the execution of a full findBasePointer call, only the
164 // base relation will remain. Internally, we add a mixture of the two
165 // types, then update all the second type to the first type
166 typedef DenseMap<Value *, Value *> DefiningValueMapTy;
167 typedef DenseSet<Value *> StatepointLiveSetTy;
168 typedef DenseMap<AssertingVH<Instruction>, AssertingVH<Value>>
169 RematerializedValueMapTy;
171 struct PartiallyConstructedSafepointRecord {
172 /// The set of values known to be live across this safepoint
173 StatepointLiveSetTy LiveSet;
175 /// Mapping from live pointers to a base-defining-value
176 DenseMap<Value *, Value *> PointerToBase;
178 /// The *new* gc.statepoint instruction itself. This produces the token
179 /// that normal path gc.relocates and the gc.result are tied to.
180 Instruction *StatepointToken;
182 /// Instruction to which exceptional gc relocates are attached
183 /// Makes it easier to iterate through them during relocationViaAlloca.
184 Instruction *UnwindToken;
186 /// Record live values we are rematerialized instead of relocating.
187 /// They are not included into 'LiveSet' field.
188 /// Maps rematerialized copy to it's original value.
189 RematerializedValueMapTy RematerializedValues;
193 static ArrayRef<Use> GetDeoptBundleOperands(ImmutableCallSite CS) {
194 assert(UseDeoptBundles && "Should not be called otherwise!");
196 Optional<OperandBundleUse> DeoptBundle = CS.getOperandBundle("deopt");
198 if (!DeoptBundle.hasValue()) {
199 assert(AllowStatepointWithNoDeoptInfo &&
200 "Found non-leaf call without deopt info!");
204 return DeoptBundle.getValue().Inputs;
207 /// Compute the live-in set for every basic block in the function
208 static void computeLiveInValues(DominatorTree &DT, Function &F,
209 GCPtrLivenessData &Data);
211 /// Given results from the dataflow liveness computation, find the set of live
212 /// Values at a particular instruction.
213 static void findLiveSetAtInst(Instruction *inst, GCPtrLivenessData &Data,
214 StatepointLiveSetTy &out);
216 // TODO: Once we can get to the GCStrategy, this becomes
217 // Optional<bool> isGCManagedPointer(const Value *V) const override {
219 static bool isGCPointerType(Type *T) {
220 if (auto *PT = dyn_cast<PointerType>(T))
221 // For the sake of this example GC, we arbitrarily pick addrspace(1) as our
222 // GC managed heap. We know that a pointer into this heap needs to be
223 // updated and that no other pointer does.
224 return (1 == PT->getAddressSpace());
228 // Return true if this type is one which a) is a gc pointer or contains a GC
229 // pointer and b) is of a type this code expects to encounter as a live value.
230 // (The insertion code will assert that a type which matches (a) and not (b)
231 // is not encountered.)
232 static bool isHandledGCPointerType(Type *T) {
233 // We fully support gc pointers
234 if (isGCPointerType(T))
236 // We partially support vectors of gc pointers. The code will assert if it
237 // can't handle something.
238 if (auto VT = dyn_cast<VectorType>(T))
239 if (isGCPointerType(VT->getElementType()))
245 /// Returns true if this type contains a gc pointer whether we know how to
246 /// handle that type or not.
247 static bool containsGCPtrType(Type *Ty) {
248 if (isGCPointerType(Ty))
250 if (VectorType *VT = dyn_cast<VectorType>(Ty))
251 return isGCPointerType(VT->getScalarType());
252 if (ArrayType *AT = dyn_cast<ArrayType>(Ty))
253 return containsGCPtrType(AT->getElementType());
254 if (StructType *ST = dyn_cast<StructType>(Ty))
256 ST->subtypes().begin(), ST->subtypes().end(),
257 [](Type *SubType) { return containsGCPtrType(SubType); });
261 // Returns true if this is a type which a) is a gc pointer or contains a GC
262 // pointer and b) is of a type which the code doesn't expect (i.e. first class
263 // aggregates). Used to trip assertions.
264 static bool isUnhandledGCPointerType(Type *Ty) {
265 return containsGCPtrType(Ty) && !isHandledGCPointerType(Ty);
269 static bool order_by_name(Value *a, Value *b) {
270 if (a->hasName() && b->hasName()) {
271 return -1 == a->getName().compare(b->getName());
272 } else if (a->hasName() && !b->hasName()) {
274 } else if (!a->hasName() && b->hasName()) {
277 // Better than nothing, but not stable
282 // Return the name of the value suffixed with the provided value, or if the
283 // value didn't have a name, the default value specified.
284 static std::string suffixed_name_or(Value *V, StringRef Suffix,
285 StringRef DefaultName) {
286 return V->hasName() ? (V->getName() + Suffix).str() : DefaultName.str();
289 // Conservatively identifies any definitions which might be live at the
290 // given instruction. The analysis is performed immediately before the
291 // given instruction. Values defined by that instruction are not considered
292 // live. Values used by that instruction are considered live.
293 static void analyzeParsePointLiveness(
294 DominatorTree &DT, GCPtrLivenessData &OriginalLivenessData,
295 const CallSite &CS, PartiallyConstructedSafepointRecord &result) {
296 Instruction *inst = CS.getInstruction();
298 StatepointLiveSetTy LiveSet;
299 findLiveSetAtInst(inst, OriginalLivenessData, LiveSet);
302 // Note: This output is used by several of the test cases
303 // The order of elements in a set is not stable, put them in a vec and sort
305 SmallVector<Value *, 64> Temp;
306 Temp.insert(Temp.end(), LiveSet.begin(), LiveSet.end());
307 std::sort(Temp.begin(), Temp.end(), order_by_name);
308 errs() << "Live Variables:\n";
309 for (Value *V : Temp)
310 dbgs() << " " << V->getName() << " " << *V << "\n";
312 if (PrintLiveSetSize) {
313 errs() << "Safepoint For: " << CS.getCalledValue()->getName() << "\n";
314 errs() << "Number live values: " << LiveSet.size() << "\n";
316 result.LiveSet = LiveSet;
319 static bool isKnownBaseResult(Value *V);
321 /// A single base defining value - An immediate base defining value for an
322 /// instruction 'Def' is an input to 'Def' whose base is also a base of 'Def'.
323 /// For instructions which have multiple pointer [vector] inputs or that
324 /// transition between vector and scalar types, there is no immediate base
325 /// defining value. The 'base defining value' for 'Def' is the transitive
326 /// closure of this relation stopping at the first instruction which has no
327 /// immediate base defining value. The b.d.v. might itself be a base pointer,
328 /// but it can also be an arbitrary derived pointer.
329 struct BaseDefiningValueResult {
330 /// Contains the value which is the base defining value.
332 /// True if the base defining value is also known to be an actual base
334 const bool IsKnownBase;
335 BaseDefiningValueResult(Value *BDV, bool IsKnownBase)
336 : BDV(BDV), IsKnownBase(IsKnownBase) {
338 // Check consistency between new and old means of checking whether a BDV is
340 bool MustBeBase = isKnownBaseResult(BDV);
341 assert(!MustBeBase || MustBeBase == IsKnownBase);
347 static BaseDefiningValueResult findBaseDefiningValue(Value *I);
349 /// Return a base defining value for the 'Index' element of the given vector
350 /// instruction 'I'. If Index is null, returns a BDV for the entire vector
351 /// 'I'. As an optimization, this method will try to determine when the
352 /// element is known to already be a base pointer. If this can be established,
353 /// the second value in the returned pair will be true. Note that either a
354 /// vector or a pointer typed value can be returned. For the former, the
355 /// vector returned is a BDV (and possibly a base) of the entire vector 'I'.
356 /// If the later, the return pointer is a BDV (or possibly a base) for the
357 /// particular element in 'I'.
358 static BaseDefiningValueResult
359 findBaseDefiningValueOfVector(Value *I) {
360 assert(I->getType()->isVectorTy() &&
361 cast<VectorType>(I->getType())->getElementType()->isPointerTy() &&
362 "Illegal to ask for the base pointer of a non-pointer type");
364 // Each case parallels findBaseDefiningValue below, see that code for
365 // detailed motivation.
367 if (isa<Argument>(I))
368 // An incoming argument to the function is a base pointer
369 return BaseDefiningValueResult(I, true);
371 // We shouldn't see the address of a global as a vector value?
372 assert(!isa<GlobalVariable>(I) &&
373 "unexpected global variable found in base of vector");
375 // inlining could possibly introduce phi node that contains
376 // undef if callee has multiple returns
377 if (isa<UndefValue>(I))
378 // utterly meaningless, but useful for dealing with partially optimized
380 return BaseDefiningValueResult(I, true);
382 // Due to inheritance, this must be _after_ the global variable and undef
384 if (Constant *Con = dyn_cast<Constant>(I)) {
385 assert(!isa<GlobalVariable>(I) && !isa<UndefValue>(I) &&
386 "order of checks wrong!");
387 assert(Con->isNullValue() && "null is the only case which makes sense");
388 return BaseDefiningValueResult(Con, true);
391 if (isa<LoadInst>(I))
392 return BaseDefiningValueResult(I, true);
394 if (isa<InsertElementInst>(I))
395 // We don't know whether this vector contains entirely base pointers or
396 // not. To be conservatively correct, we treat it as a BDV and will
397 // duplicate code as needed to construct a parallel vector of bases.
398 return BaseDefiningValueResult(I, false);
400 if (isa<ShuffleVectorInst>(I))
401 // We don't know whether this vector contains entirely base pointers or
402 // not. To be conservatively correct, we treat it as a BDV and will
403 // duplicate code as needed to construct a parallel vector of bases.
404 // TODO: There a number of local optimizations which could be applied here
405 // for particular sufflevector patterns.
406 return BaseDefiningValueResult(I, false);
408 // A PHI or Select is a base defining value. The outer findBasePointer
409 // algorithm is responsible for constructing a base value for this BDV.
410 assert((isa<SelectInst>(I) || isa<PHINode>(I)) &&
411 "unknown vector instruction - no base found for vector element");
412 return BaseDefiningValueResult(I, false);
415 /// Helper function for findBasePointer - Will return a value which either a)
416 /// defines the base pointer for the input, b) blocks the simple search
417 /// (i.e. a PHI or Select of two derived pointers), or c) involves a change
418 /// from pointer to vector type or back.
419 static BaseDefiningValueResult findBaseDefiningValue(Value *I) {
420 if (I->getType()->isVectorTy())
421 return findBaseDefiningValueOfVector(I);
423 assert(I->getType()->isPointerTy() &&
424 "Illegal to ask for the base pointer of a non-pointer type");
426 if (isa<Argument>(I))
427 // An incoming argument to the function is a base pointer
428 // We should have never reached here if this argument isn't an gc value
429 return BaseDefiningValueResult(I, true);
431 if (isa<GlobalVariable>(I))
433 return BaseDefiningValueResult(I, true);
435 // inlining could possibly introduce phi node that contains
436 // undef if callee has multiple returns
437 if (isa<UndefValue>(I))
438 // utterly meaningless, but useful for dealing with
439 // partially optimized code.
440 return BaseDefiningValueResult(I, true);
442 // Due to inheritance, this must be _after_ the global variable and undef
444 if (isa<Constant>(I)) {
445 assert(!isa<GlobalVariable>(I) && !isa<UndefValue>(I) &&
446 "order of checks wrong!");
447 // Note: Finding a constant base for something marked for relocation
448 // doesn't really make sense. The most likely case is either a) some
449 // screwed up the address space usage or b) your validating against
450 // compiled C++ code w/o the proper separation. The only real exception
451 // is a null pointer. You could have generic code written to index of
452 // off a potentially null value and have proven it null. We also use
453 // null pointers in dead paths of relocation phis (which we might later
454 // want to find a base pointer for).
455 assert(isa<ConstantPointerNull>(I) &&
456 "null is the only case which makes sense");
457 return BaseDefiningValueResult(I, true);
460 if (CastInst *CI = dyn_cast<CastInst>(I)) {
461 Value *Def = CI->stripPointerCasts();
462 // If we find a cast instruction here, it means we've found a cast which is
463 // not simply a pointer cast (i.e. an inttoptr). We don't know how to
464 // handle int->ptr conversion.
465 assert(!isa<CastInst>(Def) && "shouldn't find another cast here");
466 return findBaseDefiningValue(Def);
469 if (isa<LoadInst>(I))
470 // The value loaded is an gc base itself
471 return BaseDefiningValueResult(I, true);
474 if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(I))
475 // The base of this GEP is the base
476 return findBaseDefiningValue(GEP->getPointerOperand());
478 if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(I)) {
479 switch (II->getIntrinsicID()) {
480 case Intrinsic::experimental_gc_result_ptr:
482 // fall through to general call handling
484 case Intrinsic::experimental_gc_statepoint:
485 case Intrinsic::experimental_gc_result_float:
486 case Intrinsic::experimental_gc_result_int:
487 llvm_unreachable("these don't produce pointers");
488 case Intrinsic::experimental_gc_relocate: {
489 // Rerunning safepoint insertion after safepoints are already
490 // inserted is not supported. It could probably be made to work,
491 // but why are you doing this? There's no good reason.
492 llvm_unreachable("repeat safepoint insertion is not supported");
494 case Intrinsic::gcroot:
495 // Currently, this mechanism hasn't been extended to work with gcroot.
496 // There's no reason it couldn't be, but I haven't thought about the
497 // implications much.
499 "interaction with the gcroot mechanism is not supported");
502 // We assume that functions in the source language only return base
503 // pointers. This should probably be generalized via attributes to support
504 // both source language and internal functions.
505 if (isa<CallInst>(I) || isa<InvokeInst>(I))
506 return BaseDefiningValueResult(I, true);
508 // I have absolutely no idea how to implement this part yet. It's not
509 // necessarily hard, I just haven't really looked at it yet.
510 assert(!isa<LandingPadInst>(I) && "Landing Pad is unimplemented");
512 if (isa<AtomicCmpXchgInst>(I))
513 // A CAS is effectively a atomic store and load combined under a
514 // predicate. From the perspective of base pointers, we just treat it
516 return BaseDefiningValueResult(I, true);
518 assert(!isa<AtomicRMWInst>(I) && "Xchg handled above, all others are "
519 "binary ops which don't apply to pointers");
521 // The aggregate ops. Aggregates can either be in the heap or on the
522 // stack, but in either case, this is simply a field load. As a result,
523 // this is a defining definition of the base just like a load is.
524 if (isa<ExtractValueInst>(I))
525 return BaseDefiningValueResult(I, true);
527 // We should never see an insert vector since that would require we be
528 // tracing back a struct value not a pointer value.
529 assert(!isa<InsertValueInst>(I) &&
530 "Base pointer for a struct is meaningless");
532 // An extractelement produces a base result exactly when it's input does.
533 // We may need to insert a parallel instruction to extract the appropriate
534 // element out of the base vector corresponding to the input. Given this,
535 // it's analogous to the phi and select case even though it's not a merge.
536 if (isa<ExtractElementInst>(I))
537 // Note: There a lot of obvious peephole cases here. This are deliberately
538 // handled after the main base pointer inference algorithm to make writing
539 // test cases to exercise that code easier.
540 return BaseDefiningValueResult(I, false);
542 // The last two cases here don't return a base pointer. Instead, they
543 // return a value which dynamically selects from among several base
544 // derived pointers (each with it's own base potentially). It's the job of
545 // the caller to resolve these.
546 assert((isa<SelectInst>(I) || isa<PHINode>(I)) &&
547 "missing instruction case in findBaseDefiningValing");
548 return BaseDefiningValueResult(I, false);
551 /// Returns the base defining value for this value.
552 static Value *findBaseDefiningValueCached(Value *I, DefiningValueMapTy &Cache) {
553 Value *&Cached = Cache[I];
555 Cached = findBaseDefiningValue(I).BDV;
556 DEBUG(dbgs() << "fBDV-cached: " << I->getName() << " -> "
557 << Cached->getName() << "\n");
559 assert(Cache[I] != nullptr);
563 /// Return a base pointer for this value if known. Otherwise, return it's
564 /// base defining value.
565 static Value *findBaseOrBDV(Value *I, DefiningValueMapTy &Cache) {
566 Value *Def = findBaseDefiningValueCached(I, Cache);
567 auto Found = Cache.find(Def);
568 if (Found != Cache.end()) {
569 // Either a base-of relation, or a self reference. Caller must check.
570 return Found->second;
572 // Only a BDV available
576 /// Given the result of a call to findBaseDefiningValue, or findBaseOrBDV,
577 /// is it known to be a base pointer? Or do we need to continue searching.
578 static bool isKnownBaseResult(Value *V) {
579 if (!isa<PHINode>(V) && !isa<SelectInst>(V) &&
580 !isa<ExtractElementInst>(V) && !isa<InsertElementInst>(V) &&
581 !isa<ShuffleVectorInst>(V)) {
582 // no recursion possible
585 if (isa<Instruction>(V) &&
586 cast<Instruction>(V)->getMetadata("is_base_value")) {
587 // This is a previously inserted base phi or select. We know
588 // that this is a base value.
592 // We need to keep searching
597 /// Models the state of a single base defining value in the findBasePointer
598 /// algorithm for determining where a new instruction is needed to propagate
599 /// the base of this BDV.
602 enum Status { Unknown, Base, Conflict };
604 BDVState(Status s, Value *b = nullptr) : status(s), base(b) {
605 assert(status != Base || b);
607 explicit BDVState(Value *b) : status(Base), base(b) {}
608 BDVState() : status(Unknown), base(nullptr) {}
610 Status getStatus() const { return status; }
611 Value *getBase() const { return base; }
613 bool isBase() const { return getStatus() == Base; }
614 bool isUnknown() const { return getStatus() == Unknown; }
615 bool isConflict() const { return getStatus() == Conflict; }
617 bool operator==(const BDVState &other) const {
618 return base == other.base && status == other.status;
621 bool operator!=(const BDVState &other) const { return !(*this == other); }
624 void dump() const { print(dbgs()); dbgs() << '\n'; }
626 void print(raw_ostream &OS) const {
638 OS << " (" << base << " - "
639 << (base ? base->getName() : "nullptr") << "): ";
644 Value *base; // non null only if status == base
649 static raw_ostream &operator<<(raw_ostream &OS, const BDVState &State) {
656 // Values of type BDVState form a lattice, and this is a helper
657 // class that implementes the meet operation. The meat of the meet
658 // operation is implemented in MeetBDVStates::pureMeet
659 class MeetBDVStates {
661 /// Initializes the currentResult to the TOP state so that if can be met with
662 /// any other state to produce that state.
665 // Destructively meet the current result with the given BDVState
666 void meetWith(BDVState otherState) {
667 currentResult = meet(otherState, currentResult);
670 BDVState getResult() const { return currentResult; }
673 BDVState currentResult;
675 /// Perform a meet operation on two elements of the BDVState lattice.
676 static BDVState meet(BDVState LHS, BDVState RHS) {
677 assert((pureMeet(LHS, RHS) == pureMeet(RHS, LHS)) &&
678 "math is wrong: meet does not commute!");
679 BDVState Result = pureMeet(LHS, RHS);
680 DEBUG(dbgs() << "meet of " << LHS << " with " << RHS
681 << " produced " << Result << "\n");
685 static BDVState pureMeet(const BDVState &stateA, const BDVState &stateB) {
686 switch (stateA.getStatus()) {
687 case BDVState::Unknown:
691 assert(stateA.getBase() && "can't be null");
692 if (stateB.isUnknown())
695 if (stateB.isBase()) {
696 if (stateA.getBase() == stateB.getBase()) {
697 assert(stateA == stateB && "equality broken!");
700 return BDVState(BDVState::Conflict);
702 assert(stateB.isConflict() && "only three states!");
703 return BDVState(BDVState::Conflict);
705 case BDVState::Conflict:
708 llvm_unreachable("only three states!");
714 /// For a given value or instruction, figure out what base ptr it's derived
715 /// from. For gc objects, this is simply itself. On success, returns a value
716 /// which is the base pointer. (This is reliable and can be used for
717 /// relocation.) On failure, returns nullptr.
718 static Value *findBasePointer(Value *I, DefiningValueMapTy &cache) {
719 Value *def = findBaseOrBDV(I, cache);
721 if (isKnownBaseResult(def)) {
725 // Here's the rough algorithm:
726 // - For every SSA value, construct a mapping to either an actual base
727 // pointer or a PHI which obscures the base pointer.
728 // - Construct a mapping from PHI to unknown TOP state. Use an
729 // optimistic algorithm to propagate base pointer information. Lattice
734 // When algorithm terminates, all PHIs will either have a single concrete
735 // base or be in a conflict state.
736 // - For every conflict, insert a dummy PHI node without arguments. Add
737 // these to the base[Instruction] = BasePtr mapping. For every
738 // non-conflict, add the actual base.
739 // - For every conflict, add arguments for the base[a] of each input
742 // Note: A simpler form of this would be to add the conflict form of all
743 // PHIs without running the optimistic algorithm. This would be
744 // analogous to pessimistic data flow and would likely lead to an
745 // overall worse solution.
748 auto isExpectedBDVType = [](Value *BDV) {
749 return isa<PHINode>(BDV) || isa<SelectInst>(BDV) ||
750 isa<ExtractElementInst>(BDV) || isa<InsertElementInst>(BDV);
754 // Once populated, will contain a mapping from each potentially non-base BDV
755 // to a lattice value (described above) which corresponds to that BDV.
756 // We use the order of insertion (DFS over the def/use graph) to provide a
757 // stable deterministic ordering for visiting DenseMaps (which are unordered)
758 // below. This is important for deterministic compilation.
759 MapVector<Value *, BDVState> States;
761 // Recursively fill in all base defining values reachable from the initial
762 // one for which we don't already know a definite base value for
764 SmallVector<Value*, 16> Worklist;
765 Worklist.push_back(def);
766 States.insert(std::make_pair(def, BDVState()));
767 while (!Worklist.empty()) {
768 Value *Current = Worklist.pop_back_val();
769 assert(!isKnownBaseResult(Current) && "why did it get added?");
771 auto visitIncomingValue = [&](Value *InVal) {
772 Value *Base = findBaseOrBDV(InVal, cache);
773 if (isKnownBaseResult(Base))
774 // Known bases won't need new instructions introduced and can be
777 assert(isExpectedBDVType(Base) && "the only non-base values "
778 "we see should be base defining values");
779 if (States.insert(std::make_pair(Base, BDVState())).second)
780 Worklist.push_back(Base);
782 if (PHINode *Phi = dyn_cast<PHINode>(Current)) {
783 for (Value *InVal : Phi->incoming_values())
784 visitIncomingValue(InVal);
785 } else if (SelectInst *Sel = dyn_cast<SelectInst>(Current)) {
786 visitIncomingValue(Sel->getTrueValue());
787 visitIncomingValue(Sel->getFalseValue());
788 } else if (auto *EE = dyn_cast<ExtractElementInst>(Current)) {
789 visitIncomingValue(EE->getVectorOperand());
790 } else if (auto *IE = dyn_cast<InsertElementInst>(Current)) {
791 visitIncomingValue(IE->getOperand(0)); // vector operand
792 visitIncomingValue(IE->getOperand(1)); // scalar operand
794 // There is one known class of instructions we know we don't handle.
795 assert(isa<ShuffleVectorInst>(Current));
796 llvm_unreachable("unimplemented instruction case");
802 DEBUG(dbgs() << "States after initialization:\n");
803 for (auto Pair : States) {
804 DEBUG(dbgs() << " " << Pair.second << " for " << *Pair.first << "\n");
808 // Return a phi state for a base defining value. We'll generate a new
809 // base state for known bases and expect to find a cached state otherwise.
810 auto getStateForBDV = [&](Value *baseValue) {
811 if (isKnownBaseResult(baseValue))
812 return BDVState(baseValue);
813 auto I = States.find(baseValue);
814 assert(I != States.end() && "lookup failed!");
818 bool progress = true;
821 const size_t oldSize = States.size();
824 // We're only changing values in this loop, thus safe to keep iterators.
825 // Since this is computing a fixed point, the order of visit does not
826 // effect the result. TODO: We could use a worklist here and make this run
828 for (auto Pair : States) {
829 Value *BDV = Pair.first;
830 assert(!isKnownBaseResult(BDV) && "why did it get added?");
832 // Given an input value for the current instruction, return a BDVState
833 // instance which represents the BDV of that value.
834 auto getStateForInput = [&](Value *V) mutable {
835 Value *BDV = findBaseOrBDV(V, cache);
836 return getStateForBDV(BDV);
839 MeetBDVStates calculateMeet;
840 if (SelectInst *select = dyn_cast<SelectInst>(BDV)) {
841 calculateMeet.meetWith(getStateForInput(select->getTrueValue()));
842 calculateMeet.meetWith(getStateForInput(select->getFalseValue()));
843 } else if (PHINode *Phi = dyn_cast<PHINode>(BDV)) {
844 for (Value *Val : Phi->incoming_values())
845 calculateMeet.meetWith(getStateForInput(Val));
846 } else if (auto *EE = dyn_cast<ExtractElementInst>(BDV)) {
847 // The 'meet' for an extractelement is slightly trivial, but it's still
848 // useful in that it drives us to conflict if our input is.
849 calculateMeet.meetWith(getStateForInput(EE->getVectorOperand()));
851 // Given there's a inherent type mismatch between the operands, will
852 // *always* produce Conflict.
853 auto *IE = cast<InsertElementInst>(BDV);
854 calculateMeet.meetWith(getStateForInput(IE->getOperand(0)));
855 calculateMeet.meetWith(getStateForInput(IE->getOperand(1)));
858 BDVState oldState = States[BDV];
859 BDVState newState = calculateMeet.getResult();
860 if (oldState != newState) {
862 States[BDV] = newState;
866 assert(oldSize == States.size() &&
867 "fixed point shouldn't be adding any new nodes to state");
871 DEBUG(dbgs() << "States after meet iteration:\n");
872 for (auto Pair : States) {
873 DEBUG(dbgs() << " " << Pair.second << " for " << *Pair.first << "\n");
877 // Insert Phis for all conflicts
878 // TODO: adjust naming patterns to avoid this order of iteration dependency
879 for (auto Pair : States) {
880 Instruction *I = cast<Instruction>(Pair.first);
881 BDVState State = Pair.second;
882 assert(!isKnownBaseResult(I) && "why did it get added?");
883 assert(!State.isUnknown() && "Optimistic algorithm didn't complete!");
885 // extractelement instructions are a bit special in that we may need to
886 // insert an extract even when we know an exact base for the instruction.
887 // The problem is that we need to convert from a vector base to a scalar
888 // base for the particular indice we're interested in.
889 if (State.isBase() && isa<ExtractElementInst>(I) &&
890 isa<VectorType>(State.getBase()->getType())) {
891 auto *EE = cast<ExtractElementInst>(I);
892 // TODO: In many cases, the new instruction is just EE itself. We should
893 // exploit this, but can't do it here since it would break the invariant
894 // about the BDV not being known to be a base.
895 auto *BaseInst = ExtractElementInst::Create(State.getBase(),
896 EE->getIndexOperand(),
898 BaseInst->setMetadata("is_base_value", MDNode::get(I->getContext(), {}));
899 States[I] = BDVState(BDVState::Base, BaseInst);
902 // Since we're joining a vector and scalar base, they can never be the
903 // same. As a result, we should always see insert element having reached
904 // the conflict state.
905 if (isa<InsertElementInst>(I)) {
906 assert(State.isConflict());
909 if (!State.isConflict())
912 /// Create and insert a new instruction which will represent the base of
913 /// the given instruction 'I'.
914 auto MakeBaseInstPlaceholder = [](Instruction *I) -> Instruction* {
915 if (isa<PHINode>(I)) {
916 BasicBlock *BB = I->getParent();
917 int NumPreds = std::distance(pred_begin(BB), pred_end(BB));
918 assert(NumPreds > 0 && "how did we reach here");
919 std::string Name = suffixed_name_or(I, ".base", "base_phi");
920 return PHINode::Create(I->getType(), NumPreds, Name, I);
921 } else if (SelectInst *Sel = dyn_cast<SelectInst>(I)) {
922 // The undef will be replaced later
923 UndefValue *Undef = UndefValue::get(Sel->getType());
924 std::string Name = suffixed_name_or(I, ".base", "base_select");
925 return SelectInst::Create(Sel->getCondition(), Undef,
927 } else if (auto *EE = dyn_cast<ExtractElementInst>(I)) {
928 UndefValue *Undef = UndefValue::get(EE->getVectorOperand()->getType());
929 std::string Name = suffixed_name_or(I, ".base", "base_ee");
930 return ExtractElementInst::Create(Undef, EE->getIndexOperand(), Name,
933 auto *IE = cast<InsertElementInst>(I);
934 UndefValue *VecUndef = UndefValue::get(IE->getOperand(0)->getType());
935 UndefValue *ScalarUndef = UndefValue::get(IE->getOperand(1)->getType());
936 std::string Name = suffixed_name_or(I, ".base", "base_ie");
937 return InsertElementInst::Create(VecUndef, ScalarUndef,
938 IE->getOperand(2), Name, IE);
942 Instruction *BaseInst = MakeBaseInstPlaceholder(I);
943 // Add metadata marking this as a base value
944 BaseInst->setMetadata("is_base_value", MDNode::get(I->getContext(), {}));
945 States[I] = BDVState(BDVState::Conflict, BaseInst);
948 // Returns a instruction which produces the base pointer for a given
949 // instruction. The instruction is assumed to be an input to one of the BDVs
950 // seen in the inference algorithm above. As such, we must either already
951 // know it's base defining value is a base, or have inserted a new
952 // instruction to propagate the base of it's BDV and have entered that newly
953 // introduced instruction into the state table. In either case, we are
954 // assured to be able to determine an instruction which produces it's base
956 auto getBaseForInput = [&](Value *Input, Instruction *InsertPt) {
957 Value *BDV = findBaseOrBDV(Input, cache);
958 Value *Base = nullptr;
959 if (isKnownBaseResult(BDV)) {
962 // Either conflict or base.
963 assert(States.count(BDV));
964 Base = States[BDV].getBase();
966 assert(Base && "can't be null");
967 // The cast is needed since base traversal may strip away bitcasts
968 if (Base->getType() != Input->getType() &&
970 Base = new BitCastInst(Base, Input->getType(), "cast",
976 // Fixup all the inputs of the new PHIs. Visit order needs to be
977 // deterministic and predictable because we're naming newly created
979 for (auto Pair : States) {
980 Instruction *BDV = cast<Instruction>(Pair.first);
981 BDVState State = Pair.second;
983 assert(!isKnownBaseResult(BDV) && "why did it get added?");
984 assert(!State.isUnknown() && "Optimistic algorithm didn't complete!");
985 if (!State.isConflict())
988 if (PHINode *basephi = dyn_cast<PHINode>(State.getBase())) {
989 PHINode *phi = cast<PHINode>(BDV);
990 unsigned NumPHIValues = phi->getNumIncomingValues();
991 for (unsigned i = 0; i < NumPHIValues; i++) {
992 Value *InVal = phi->getIncomingValue(i);
993 BasicBlock *InBB = phi->getIncomingBlock(i);
995 // If we've already seen InBB, add the same incoming value
996 // we added for it earlier. The IR verifier requires phi
997 // nodes with multiple entries from the same basic block
998 // to have the same incoming value for each of those
999 // entries. If we don't do this check here and basephi
1000 // has a different type than base, we'll end up adding two
1001 // bitcasts (and hence two distinct values) as incoming
1002 // values for the same basic block.
1004 int blockIndex = basephi->getBasicBlockIndex(InBB);
1005 if (blockIndex != -1) {
1006 Value *oldBase = basephi->getIncomingValue(blockIndex);
1007 basephi->addIncoming(oldBase, InBB);
1010 Value *Base = getBaseForInput(InVal, nullptr);
1011 // In essence this assert states: the only way two
1012 // values incoming from the same basic block may be
1013 // different is by being different bitcasts of the same
1014 // value. A cleanup that remains TODO is changing
1015 // findBaseOrBDV to return an llvm::Value of the correct
1016 // type (and still remain pure). This will remove the
1017 // need to add bitcasts.
1018 assert(Base->stripPointerCasts() == oldBase->stripPointerCasts() &&
1019 "sanity -- findBaseOrBDV should be pure!");
1024 // Find the instruction which produces the base for each input. We may
1025 // need to insert a bitcast in the incoming block.
1026 // TODO: Need to split critical edges if insertion is needed
1027 Value *Base = getBaseForInput(InVal, InBB->getTerminator());
1028 basephi->addIncoming(Base, InBB);
1030 assert(basephi->getNumIncomingValues() == NumPHIValues);
1031 } else if (SelectInst *BaseSel = dyn_cast<SelectInst>(State.getBase())) {
1032 SelectInst *Sel = cast<SelectInst>(BDV);
1033 // Operand 1 & 2 are true, false path respectively. TODO: refactor to
1034 // something more safe and less hacky.
1035 for (int i = 1; i <= 2; i++) {
1036 Value *InVal = Sel->getOperand(i);
1037 // Find the instruction which produces the base for each input. We may
1038 // need to insert a bitcast.
1039 Value *Base = getBaseForInput(InVal, BaseSel);
1040 BaseSel->setOperand(i, Base);
1042 } else if (auto *BaseEE = dyn_cast<ExtractElementInst>(State.getBase())) {
1043 Value *InVal = cast<ExtractElementInst>(BDV)->getVectorOperand();
1044 // Find the instruction which produces the base for each input. We may
1045 // need to insert a bitcast.
1046 Value *Base = getBaseForInput(InVal, BaseEE);
1047 BaseEE->setOperand(0, Base);
1049 auto *BaseIE = cast<InsertElementInst>(State.getBase());
1050 auto *BdvIE = cast<InsertElementInst>(BDV);
1051 auto UpdateOperand = [&](int OperandIdx) {
1052 Value *InVal = BdvIE->getOperand(OperandIdx);
1053 Value *Base = getBaseForInput(InVal, BaseIE);
1054 BaseIE->setOperand(OperandIdx, Base);
1056 UpdateOperand(0); // vector operand
1057 UpdateOperand(1); // scalar operand
1062 // Now that we're done with the algorithm, see if we can optimize the
1063 // results slightly by reducing the number of new instructions needed.
1064 // Arguably, this should be integrated into the algorithm above, but
1065 // doing as a post process step is easier to reason about for the moment.
1066 DenseMap<Value *, Value *> ReverseMap;
1067 SmallPtrSet<Instruction *, 16> NewInsts;
1068 SmallSetVector<AssertingVH<Instruction>, 16> Worklist;
1069 // Note: We need to visit the states in a deterministic order. We uses the
1070 // Keys we sorted above for this purpose. Note that we are papering over a
1071 // bigger problem with the algorithm above - it's visit order is not
1072 // deterministic. A larger change is needed to fix this.
1073 for (auto Pair : States) {
1074 auto *BDV = Pair.first;
1075 auto State = Pair.second;
1076 Value *Base = State.getBase();
1077 assert(BDV && Base);
1078 assert(!isKnownBaseResult(BDV) && "why did it get added?");
1079 assert(isKnownBaseResult(Base) &&
1080 "must be something we 'know' is a base pointer");
1081 if (!State.isConflict())
1084 ReverseMap[Base] = BDV;
1085 if (auto *BaseI = dyn_cast<Instruction>(Base)) {
1086 NewInsts.insert(BaseI);
1087 Worklist.insert(BaseI);
1090 auto ReplaceBaseInstWith = [&](Value *BDV, Instruction *BaseI,
1091 Value *Replacement) {
1092 // Add users which are new instructions (excluding self references)
1093 for (User *U : BaseI->users())
1094 if (auto *UI = dyn_cast<Instruction>(U))
1095 if (NewInsts.count(UI) && UI != BaseI)
1096 Worklist.insert(UI);
1097 // Then do the actual replacement
1098 NewInsts.erase(BaseI);
1099 ReverseMap.erase(BaseI);
1100 BaseI->replaceAllUsesWith(Replacement);
1101 BaseI->eraseFromParent();
1102 assert(States.count(BDV));
1103 assert(States[BDV].isConflict() && States[BDV].getBase() == BaseI);
1104 States[BDV] = BDVState(BDVState::Conflict, Replacement);
1106 const DataLayout &DL = cast<Instruction>(def)->getModule()->getDataLayout();
1107 while (!Worklist.empty()) {
1108 Instruction *BaseI = Worklist.pop_back_val();
1109 assert(NewInsts.count(BaseI));
1110 Value *Bdv = ReverseMap[BaseI];
1111 if (auto *BdvI = dyn_cast<Instruction>(Bdv))
1112 if (BaseI->isIdenticalTo(BdvI)) {
1113 DEBUG(dbgs() << "Identical Base: " << *BaseI << "\n");
1114 ReplaceBaseInstWith(Bdv, BaseI, Bdv);
1117 if (Value *V = SimplifyInstruction(BaseI, DL)) {
1118 DEBUG(dbgs() << "Base " << *BaseI << " simplified to " << *V << "\n");
1119 ReplaceBaseInstWith(Bdv, BaseI, V);
1124 // Cache all of our results so we can cheaply reuse them
1125 // NOTE: This is actually two caches: one of the base defining value
1126 // relation and one of the base pointer relation! FIXME
1127 for (auto Pair : States) {
1128 auto *BDV = Pair.first;
1129 Value *base = Pair.second.getBase();
1130 assert(BDV && base);
1132 std::string fromstr = cache.count(BDV) ? cache[BDV]->getName() : "none";
1133 DEBUG(dbgs() << "Updating base value cache"
1134 << " for: " << BDV->getName()
1135 << " from: " << fromstr
1136 << " to: " << base->getName() << "\n");
1138 if (cache.count(BDV)) {
1139 // Once we transition from the BDV relation being store in the cache to
1140 // the base relation being stored, it must be stable
1141 assert((!isKnownBaseResult(cache[BDV]) || cache[BDV] == base) &&
1142 "base relation should be stable");
1146 assert(cache.find(def) != cache.end());
1150 // For a set of live pointers (base and/or derived), identify the base
1151 // pointer of the object which they are derived from. This routine will
1152 // mutate the IR graph as needed to make the 'base' pointer live at the
1153 // definition site of 'derived'. This ensures that any use of 'derived' can
1154 // also use 'base'. This may involve the insertion of a number of
1155 // additional PHI nodes.
1157 // preconditions: live is a set of pointer type Values
1159 // side effects: may insert PHI nodes into the existing CFG, will preserve
1160 // CFG, will not remove or mutate any existing nodes
1162 // post condition: PointerToBase contains one (derived, base) pair for every
1163 // pointer in live. Note that derived can be equal to base if the original
1164 // pointer was a base pointer.
1166 findBasePointers(const StatepointLiveSetTy &live,
1167 DenseMap<Value *, Value *> &PointerToBase,
1168 DominatorTree *DT, DefiningValueMapTy &DVCache) {
1169 // For the naming of values inserted to be deterministic - which makes for
1170 // much cleaner and more stable tests - we need to assign an order to the
1171 // live values. DenseSets do not provide a deterministic order across runs.
1172 SmallVector<Value *, 64> Temp;
1173 Temp.insert(Temp.end(), live.begin(), live.end());
1174 std::sort(Temp.begin(), Temp.end(), order_by_name);
1175 for (Value *ptr : Temp) {
1176 Value *base = findBasePointer(ptr, DVCache);
1177 assert(base && "failed to find base pointer");
1178 PointerToBase[ptr] = base;
1179 assert((!isa<Instruction>(base) || !isa<Instruction>(ptr) ||
1180 DT->dominates(cast<Instruction>(base)->getParent(),
1181 cast<Instruction>(ptr)->getParent())) &&
1182 "The base we found better dominate the derived pointer");
1184 // If you see this trip and like to live really dangerously, the code should
1185 // be correct, just with idioms the verifier can't handle. You can try
1186 // disabling the verifier at your own substantial risk.
1187 assert(!isa<ConstantPointerNull>(base) &&
1188 "the relocation code needs adjustment to handle the relocation of "
1189 "a null pointer constant without causing false positives in the "
1190 "safepoint ir verifier.");
1194 /// Find the required based pointers (and adjust the live set) for the given
1196 static void findBasePointers(DominatorTree &DT, DefiningValueMapTy &DVCache,
1198 PartiallyConstructedSafepointRecord &result) {
1199 DenseMap<Value *, Value *> PointerToBase;
1200 findBasePointers(result.LiveSet, PointerToBase, &DT, DVCache);
1202 if (PrintBasePointers) {
1203 // Note: Need to print these in a stable order since this is checked in
1205 errs() << "Base Pairs (w/o Relocation):\n";
1206 SmallVector<Value *, 64> Temp;
1207 Temp.reserve(PointerToBase.size());
1208 for (auto Pair : PointerToBase) {
1209 Temp.push_back(Pair.first);
1211 std::sort(Temp.begin(), Temp.end(), order_by_name);
1212 for (Value *Ptr : Temp) {
1213 Value *Base = PointerToBase[Ptr];
1214 errs() << " derived %" << Ptr->getName() << " base %" << Base->getName()
1219 result.PointerToBase = PointerToBase;
1222 /// Given an updated version of the dataflow liveness results, update the
1223 /// liveset and base pointer maps for the call site CS.
1224 static void recomputeLiveInValues(GCPtrLivenessData &RevisedLivenessData,
1226 PartiallyConstructedSafepointRecord &result);
1228 static void recomputeLiveInValues(
1229 Function &F, DominatorTree &DT, Pass *P, ArrayRef<CallSite> toUpdate,
1230 MutableArrayRef<struct PartiallyConstructedSafepointRecord> records) {
1231 // TODO-PERF: reuse the original liveness, then simply run the dataflow
1232 // again. The old values are still live and will help it stabilize quickly.
1233 GCPtrLivenessData RevisedLivenessData;
1234 computeLiveInValues(DT, F, RevisedLivenessData);
1235 for (size_t i = 0; i < records.size(); i++) {
1236 struct PartiallyConstructedSafepointRecord &info = records[i];
1237 const CallSite &CS = toUpdate[i];
1238 recomputeLiveInValues(RevisedLivenessData, CS, info);
1242 // When inserting gc.relocate calls, we need to ensure there are no uses
1243 // of the original value between the gc.statepoint and the gc.relocate call.
1244 // One case which can arise is a phi node starting one of the successor blocks.
1245 // We also need to be able to insert the gc.relocates only on the path which
1246 // goes through the statepoint. We might need to split an edge to make this
1249 normalizeForInvokeSafepoint(BasicBlock *BB, BasicBlock *InvokeParent,
1250 DominatorTree &DT) {
1251 BasicBlock *Ret = BB;
1252 if (!BB->getUniquePredecessor()) {
1253 Ret = SplitBlockPredecessors(BB, InvokeParent, "", &DT);
1256 // Now that 'ret' has unique predecessor we can safely remove all phi nodes
1258 FoldSingleEntryPHINodes(Ret);
1259 assert(!isa<PHINode>(Ret->begin()));
1261 // At this point, we can safely insert a gc.relocate as the first instruction
1262 // in Ret if needed.
1266 static int find_index(ArrayRef<Value *> livevec, Value *val) {
1267 auto itr = std::find(livevec.begin(), livevec.end(), val);
1268 assert(livevec.end() != itr);
1269 size_t index = std::distance(livevec.begin(), itr);
1270 assert(index < livevec.size());
1274 // Create new attribute set containing only attributes which can be transferred
1275 // from original call to the safepoint.
1276 static AttributeSet legalizeCallAttributes(AttributeSet AS) {
1279 for (unsigned Slot = 0; Slot < AS.getNumSlots(); Slot++) {
1280 unsigned index = AS.getSlotIndex(Slot);
1282 if (index == AttributeSet::ReturnIndex ||
1283 index == AttributeSet::FunctionIndex) {
1285 for (auto it = AS.begin(Slot), it_end = AS.end(Slot); it != it_end;
1287 Attribute attr = *it;
1289 // Do not allow certain attributes - just skip them
1290 // Safepoint can not be read only or read none.
1291 if (attr.hasAttribute(Attribute::ReadNone) ||
1292 attr.hasAttribute(Attribute::ReadOnly))
1295 ret = ret.addAttributes(
1296 AS.getContext(), index,
1297 AttributeSet::get(AS.getContext(), index, AttrBuilder(attr)));
1301 // Just skip parameter attributes for now
1307 /// Helper function to place all gc relocates necessary for the given
1310 /// liveVariables - list of variables to be relocated.
1311 /// liveStart - index of the first live variable.
1312 /// basePtrs - base pointers.
1313 /// statepointToken - statepoint instruction to which relocates should be
1315 /// Builder - Llvm IR builder to be used to construct new calls.
1316 static void CreateGCRelocates(ArrayRef<Value *> LiveVariables,
1317 const int LiveStart,
1318 ArrayRef<Value *> BasePtrs,
1319 Instruction *StatepointToken,
1320 IRBuilder<> Builder) {
1321 if (LiveVariables.empty())
1324 // All gc_relocate are set to i8 addrspace(1)* type. We originally generated
1325 // unique declarations for each pointer type, but this proved problematic
1326 // because the intrinsic mangling code is incomplete and fragile. Since
1327 // we're moving towards a single unified pointer type anyways, we can just
1328 // cast everything to an i8* of the right address space. A bitcast is added
1329 // later to convert gc_relocate to the actual value's type.
1330 Module *M = StatepointToken->getModule();
1331 auto AS = cast<PointerType>(LiveVariables[0]->getType())->getAddressSpace();
1332 Type *Types[] = {Type::getInt8PtrTy(M->getContext(), AS)};
1333 Value *GCRelocateDecl =
1334 Intrinsic::getDeclaration(M, Intrinsic::experimental_gc_relocate, Types);
1336 for (unsigned i = 0; i < LiveVariables.size(); i++) {
1337 // Generate the gc.relocate call and save the result
1339 Builder.getInt32(LiveStart + find_index(LiveVariables, BasePtrs[i]));
1341 Builder.getInt32(LiveStart + find_index(LiveVariables, LiveVariables[i]));
1343 // only specify a debug name if we can give a useful one
1344 CallInst *Reloc = Builder.CreateCall(
1345 GCRelocateDecl, {StatepointToken, BaseIdx, LiveIdx},
1346 suffixed_name_or(LiveVariables[i], ".relocated", ""));
1347 // Trick CodeGen into thinking there are lots of free registers at this
1349 Reloc->setCallingConv(CallingConv::Cold);
1355 /// This struct is used to defer RAUWs and `eraseFromParent` s. Using this
1356 /// avoids having to worry about keeping around dangling pointers to Values.
1357 class DeferredReplacement {
1358 AssertingVH<Instruction> Old;
1359 AssertingVH<Instruction> New;
1362 explicit DeferredReplacement(Instruction *Old, Instruction *New) :
1363 Old(Old), New(New) {
1364 assert(Old != New && "Not allowed!");
1367 /// Does the task represented by this instance.
1368 void doReplacement() {
1369 Instruction *OldI = Old;
1370 Instruction *NewI = New;
1372 assert(OldI != NewI && "Disallowed at construction?!");
1378 OldI->replaceAllUsesWith(NewI);
1379 OldI->eraseFromParent();
1385 makeStatepointExplicitImpl(const CallSite CS, /* to replace */
1386 const SmallVectorImpl<Value *> &BasePtrs,
1387 const SmallVectorImpl<Value *> &LiveVariables,
1388 PartiallyConstructedSafepointRecord &Result,
1389 std::vector<DeferredReplacement> &Replacements) {
1390 assert(BasePtrs.size() == LiveVariables.size());
1391 assert((UseDeoptBundles || isStatepoint(CS)) &&
1392 "This method expects to be rewriting a statepoint");
1394 // Then go ahead and use the builder do actually do the inserts. We insert
1395 // immediately before the previous instruction under the assumption that all
1396 // arguments will be available here. We can't insert afterwards since we may
1397 // be replacing a terminator.
1398 Instruction *InsertBefore = CS.getInstruction();
1399 IRBuilder<> Builder(InsertBefore);
1401 ArrayRef<Value *> GCArgs(LiveVariables);
1402 uint64_t StatepointID = 0xABCDEF00;
1403 uint32_t NumPatchBytes = 0;
1404 uint32_t Flags = uint32_t(StatepointFlags::None);
1406 ArrayRef<Use> CallArgs;
1407 ArrayRef<Use> DeoptArgs;
1408 ArrayRef<Use> TransitionArgs;
1410 Value *CallTarget = nullptr;
1412 if (UseDeoptBundles) {
1413 CallArgs = {CS.arg_begin(), CS.arg_end()};
1414 DeoptArgs = GetDeoptBundleOperands(CS);
1415 // TODO: we don't fill in TransitionArgs or Flags in this branch, but we
1416 // could have an operand bundle for that too.
1417 AttributeSet OriginalAttrs = CS.getAttributes();
1419 Attribute AttrID = OriginalAttrs.getAttribute(AttributeSet::FunctionIndex,
1421 if (AttrID.isStringAttribute())
1422 AttrID.getValueAsString().getAsInteger(10, StatepointID);
1424 Attribute AttrNumPatchBytes = OriginalAttrs.getAttribute(
1425 AttributeSet::FunctionIndex, "statepoint-num-patch-bytes");
1426 if (AttrNumPatchBytes.isStringAttribute())
1427 AttrNumPatchBytes.getValueAsString().getAsInteger(10, NumPatchBytes);
1429 CallTarget = CS.getCalledValue();
1431 // This branch will be gone soon, and we will soon only support the
1432 // UseDeoptBundles == true configuration.
1433 Statepoint OldSP(CS);
1434 StatepointID = OldSP.getID();
1435 NumPatchBytes = OldSP.getNumPatchBytes();
1436 Flags = OldSP.getFlags();
1438 CallArgs = {OldSP.arg_begin(), OldSP.arg_end()};
1439 DeoptArgs = {OldSP.vm_state_begin(), OldSP.vm_state_end()};
1440 TransitionArgs = {OldSP.gc_transition_args_begin(),
1441 OldSP.gc_transition_args_end()};
1442 CallTarget = OldSP.getCalledValue();
1445 // Create the statepoint given all the arguments
1446 Instruction *Token = nullptr;
1447 AttributeSet ReturnAttrs;
1449 CallInst *ToReplace = cast<CallInst>(CS.getInstruction());
1450 CallInst *Call = Builder.CreateGCStatepointCall(
1451 StatepointID, NumPatchBytes, CallTarget, Flags, CallArgs,
1452 TransitionArgs, DeoptArgs, GCArgs, "safepoint_token");
1454 Call->setTailCall(ToReplace->isTailCall());
1455 Call->setCallingConv(ToReplace->getCallingConv());
1457 // Currently we will fail on parameter attributes and on certain
1458 // function attributes.
1459 AttributeSet NewAttrs = legalizeCallAttributes(ToReplace->getAttributes());
1460 // In case if we can handle this set of attributes - set up function attrs
1461 // directly on statepoint and return attrs later for gc_result intrinsic.
1462 Call->setAttributes(NewAttrs.getFnAttributes());
1463 ReturnAttrs = NewAttrs.getRetAttributes();
1467 // Put the following gc_result and gc_relocate calls immediately after the
1468 // the old call (which we're about to delete)
1469 assert(ToReplace->getNextNode() && "Not a terminator, must have next!");
1470 Builder.SetInsertPoint(ToReplace->getNextNode());
1471 Builder.SetCurrentDebugLocation(ToReplace->getNextNode()->getDebugLoc());
1473 InvokeInst *ToReplace = cast<InvokeInst>(CS.getInstruction());
1475 // Insert the new invoke into the old block. We'll remove the old one in a
1476 // moment at which point this will become the new terminator for the
1478 InvokeInst *Invoke = Builder.CreateGCStatepointInvoke(
1479 StatepointID, NumPatchBytes, CallTarget, ToReplace->getNormalDest(),
1480 ToReplace->getUnwindDest(), Flags, CallArgs, TransitionArgs, DeoptArgs,
1481 GCArgs, "statepoint_token");
1483 Invoke->setCallingConv(ToReplace->getCallingConv());
1485 // Currently we will fail on parameter attributes and on certain
1486 // function attributes.
1487 AttributeSet NewAttrs = legalizeCallAttributes(ToReplace->getAttributes());
1488 // In case if we can handle this set of attributes - set up function attrs
1489 // directly on statepoint and return attrs later for gc_result intrinsic.
1490 Invoke->setAttributes(NewAttrs.getFnAttributes());
1491 ReturnAttrs = NewAttrs.getRetAttributes();
1495 // Generate gc relocates in exceptional path
1496 BasicBlock *UnwindBlock = ToReplace->getUnwindDest();
1497 assert(!isa<PHINode>(UnwindBlock->begin()) &&
1498 UnwindBlock->getUniquePredecessor() &&
1499 "can't safely insert in this block!");
1501 Builder.SetInsertPoint(&*UnwindBlock->getFirstInsertionPt());
1502 Builder.SetCurrentDebugLocation(ToReplace->getDebugLoc());
1504 // Extract second element from landingpad return value. We will attach
1505 // exceptional gc relocates to it.
1506 Instruction *ExceptionalToken =
1507 cast<Instruction>(Builder.CreateExtractValue(
1508 UnwindBlock->getLandingPadInst(), 1, "relocate_token"));
1509 Result.UnwindToken = ExceptionalToken;
1511 const unsigned LiveStartIdx = Statepoint(Token).gcArgsStartIdx();
1512 CreateGCRelocates(LiveVariables, LiveStartIdx, BasePtrs, ExceptionalToken,
1515 // Generate gc relocates and returns for normal block
1516 BasicBlock *NormalDest = ToReplace->getNormalDest();
1517 assert(!isa<PHINode>(NormalDest->begin()) &&
1518 NormalDest->getUniquePredecessor() &&
1519 "can't safely insert in this block!");
1521 Builder.SetInsertPoint(&*NormalDest->getFirstInsertionPt());
1523 // gc relocates will be generated later as if it were regular call
1526 assert(Token && "Should be set in one of the above branches!");
1528 if (UseDeoptBundles) {
1529 Token->setName("statepoint_token");
1530 if (!CS.getType()->isVoidTy() && !CS.getInstruction()->use_empty()) {
1532 CS.getInstruction()->hasName() ? CS.getInstruction()->getName() : "";
1533 CallInst *GCResult = Builder.CreateGCResult(Token, CS.getType(), Name);
1534 GCResult->setAttributes(CS.getAttributes().getRetAttributes());
1536 // We cannot RAUW or delete CS.getInstruction() because it could be in the
1537 // live set of some other safepoint, in which case that safepoint's
1538 // PartiallyConstructedSafepointRecord will hold a raw pointer to this
1539 // llvm::Instruction. Instead, we defer the replacement and deletion to
1540 // after the live sets have been made explicit in the IR, and we no longer
1541 // have raw pointers to worry about.
1542 Replacements.emplace_back(CS.getInstruction(), GCResult);
1544 Replacements.emplace_back(CS.getInstruction(), nullptr);
1547 assert(!CS.getInstruction()->hasNUsesOrMore(2) &&
1548 "only valid use before rewrite is gc.result");
1549 assert(!CS.getInstruction()->hasOneUse() ||
1550 isGCResult(cast<Instruction>(*CS.getInstruction()->user_begin())));
1552 // Take the name of the original statepoint token if there was one.
1553 Token->takeName(CS.getInstruction());
1555 // Update the gc.result of the original statepoint (if any) to use the newly
1556 // inserted statepoint. This is safe to do here since the token can't be
1557 // considered a live reference.
1558 CS.getInstruction()->replaceAllUsesWith(Token);
1559 CS.getInstruction()->eraseFromParent();
1562 Result.StatepointToken = Token;
1564 // Second, create a gc.relocate for every live variable
1565 const unsigned LiveStartIdx = Statepoint(Token).gcArgsStartIdx();
1566 CreateGCRelocates(LiveVariables, LiveStartIdx, BasePtrs, Token, Builder);
1570 struct NameOrdering {
1574 bool operator()(NameOrdering const &a, NameOrdering const &b) {
1575 return -1 == a.Derived->getName().compare(b.Derived->getName());
1580 static void StabilizeOrder(SmallVectorImpl<Value *> &BaseVec,
1581 SmallVectorImpl<Value *> &LiveVec) {
1582 assert(BaseVec.size() == LiveVec.size());
1584 SmallVector<NameOrdering, 64> Temp;
1585 for (size_t i = 0; i < BaseVec.size(); i++) {
1587 v.Base = BaseVec[i];
1588 v.Derived = LiveVec[i];
1592 std::sort(Temp.begin(), Temp.end(), NameOrdering());
1593 for (size_t i = 0; i < BaseVec.size(); i++) {
1594 BaseVec[i] = Temp[i].Base;
1595 LiveVec[i] = Temp[i].Derived;
1599 // Replace an existing gc.statepoint with a new one and a set of gc.relocates
1600 // which make the relocations happening at this safepoint explicit.
1602 // WARNING: Does not do any fixup to adjust users of the original live
1603 // values. That's the callers responsibility.
1605 makeStatepointExplicit(DominatorTree &DT, const CallSite &CS,
1606 PartiallyConstructedSafepointRecord &Result,
1607 std::vector<DeferredReplacement> &Replacements) {
1608 const auto &LiveSet = Result.LiveSet;
1609 const auto &PointerToBase = Result.PointerToBase;
1611 // Convert to vector for efficient cross referencing.
1612 SmallVector<Value *, 64> BaseVec, LiveVec;
1613 LiveVec.reserve(LiveSet.size());
1614 BaseVec.reserve(LiveSet.size());
1615 for (Value *L : LiveSet) {
1616 LiveVec.push_back(L);
1617 assert(PointerToBase.count(L));
1618 Value *Base = PointerToBase.find(L)->second;
1619 BaseVec.push_back(Base);
1621 assert(LiveVec.size() == BaseVec.size());
1623 // To make the output IR slightly more stable (for use in diffs), ensure a
1624 // fixed order of the values in the safepoint (by sorting the value name).
1625 // The order is otherwise meaningless.
1626 StabilizeOrder(BaseVec, LiveVec);
1628 // Do the actual rewriting and delete the old statepoint
1629 makeStatepointExplicitImpl(CS, BaseVec, LiveVec, Result, Replacements);
1632 // Helper function for the relocationViaAlloca.
1634 // It receives iterator to the statepoint gc relocates and emits a store to the
1635 // assigned location (via allocaMap) for the each one of them. It adds the
1636 // visited values into the visitedLiveValues set, which we will later use them
1637 // for sanity checking.
1639 insertRelocationStores(iterator_range<Value::user_iterator> GCRelocs,
1640 DenseMap<Value *, Value *> &AllocaMap,
1641 DenseSet<Value *> &VisitedLiveValues) {
1643 for (User *U : GCRelocs) {
1644 if (!isa<IntrinsicInst>(U))
1647 IntrinsicInst *RelocatedValue = cast<IntrinsicInst>(U);
1649 // We only care about relocates
1650 if (RelocatedValue->getIntrinsicID() !=
1651 Intrinsic::experimental_gc_relocate) {
1655 GCRelocateOperands RelocateOperands(RelocatedValue);
1656 Value *OriginalValue =
1657 const_cast<Value *>(RelocateOperands.getDerivedPtr());
1658 assert(AllocaMap.count(OriginalValue));
1659 Value *Alloca = AllocaMap[OriginalValue];
1661 // Emit store into the related alloca
1662 // All gc_relocates are i8 addrspace(1)* typed, and it must be bitcasted to
1663 // the correct type according to alloca.
1664 assert(RelocatedValue->getNextNode() &&
1665 "Should always have one since it's not a terminator");
1666 IRBuilder<> Builder(RelocatedValue->getNextNode());
1667 Value *CastedRelocatedValue =
1668 Builder.CreateBitCast(RelocatedValue,
1669 cast<AllocaInst>(Alloca)->getAllocatedType(),
1670 suffixed_name_or(RelocatedValue, ".casted", ""));
1672 StoreInst *Store = new StoreInst(CastedRelocatedValue, Alloca);
1673 Store->insertAfter(cast<Instruction>(CastedRelocatedValue));
1676 VisitedLiveValues.insert(OriginalValue);
1681 // Helper function for the "relocationViaAlloca". Similar to the
1682 // "insertRelocationStores" but works for rematerialized values.
1684 insertRematerializationStores(
1685 RematerializedValueMapTy RematerializedValues,
1686 DenseMap<Value *, Value *> &AllocaMap,
1687 DenseSet<Value *> &VisitedLiveValues) {
1689 for (auto RematerializedValuePair: RematerializedValues) {
1690 Instruction *RematerializedValue = RematerializedValuePair.first;
1691 Value *OriginalValue = RematerializedValuePair.second;
1693 assert(AllocaMap.count(OriginalValue) &&
1694 "Can not find alloca for rematerialized value");
1695 Value *Alloca = AllocaMap[OriginalValue];
1697 StoreInst *Store = new StoreInst(RematerializedValue, Alloca);
1698 Store->insertAfter(RematerializedValue);
1701 VisitedLiveValues.insert(OriginalValue);
1706 /// Do all the relocation update via allocas and mem2reg
1707 static void relocationViaAlloca(
1708 Function &F, DominatorTree &DT, ArrayRef<Value *> Live,
1709 ArrayRef<PartiallyConstructedSafepointRecord> Records) {
1711 // record initial number of (static) allocas; we'll check we have the same
1712 // number when we get done.
1713 int InitialAllocaNum = 0;
1714 for (auto I = F.getEntryBlock().begin(), E = F.getEntryBlock().end(); I != E;
1716 if (isa<AllocaInst>(*I))
1720 // TODO-PERF: change data structures, reserve
1721 DenseMap<Value *, Value *> AllocaMap;
1722 SmallVector<AllocaInst *, 200> PromotableAllocas;
1723 // Used later to chack that we have enough allocas to store all values
1724 std::size_t NumRematerializedValues = 0;
1725 PromotableAllocas.reserve(Live.size());
1727 // Emit alloca for "LiveValue" and record it in "allocaMap" and
1728 // "PromotableAllocas"
1729 auto emitAllocaFor = [&](Value *LiveValue) {
1730 AllocaInst *Alloca = new AllocaInst(LiveValue->getType(), "",
1731 F.getEntryBlock().getFirstNonPHI());
1732 AllocaMap[LiveValue] = Alloca;
1733 PromotableAllocas.push_back(Alloca);
1736 // Emit alloca for each live gc pointer
1737 for (Value *V : Live)
1740 // Emit allocas for rematerialized values
1741 for (const auto &Info : Records)
1742 for (auto RematerializedValuePair : Info.RematerializedValues) {
1743 Value *OriginalValue = RematerializedValuePair.second;
1744 if (AllocaMap.count(OriginalValue) != 0)
1747 emitAllocaFor(OriginalValue);
1748 ++NumRematerializedValues;
1751 // The next two loops are part of the same conceptual operation. We need to
1752 // insert a store to the alloca after the original def and at each
1753 // redefinition. We need to insert a load before each use. These are split
1754 // into distinct loops for performance reasons.
1756 // Update gc pointer after each statepoint: either store a relocated value or
1757 // null (if no relocated value was found for this gc pointer and it is not a
1758 // gc_result). This must happen before we update the statepoint with load of
1759 // alloca otherwise we lose the link between statepoint and old def.
1760 for (const auto &Info : Records) {
1761 Value *Statepoint = Info.StatepointToken;
1763 // This will be used for consistency check
1764 DenseSet<Value *> VisitedLiveValues;
1766 // Insert stores for normal statepoint gc relocates
1767 insertRelocationStores(Statepoint->users(), AllocaMap, VisitedLiveValues);
1769 // In case if it was invoke statepoint
1770 // we will insert stores for exceptional path gc relocates.
1771 if (isa<InvokeInst>(Statepoint)) {
1772 insertRelocationStores(Info.UnwindToken->users(), AllocaMap,
1776 // Do similar thing with rematerialized values
1777 insertRematerializationStores(Info.RematerializedValues, AllocaMap,
1780 if (ClobberNonLive) {
1781 // As a debugging aid, pretend that an unrelocated pointer becomes null at
1782 // the gc.statepoint. This will turn some subtle GC problems into
1783 // slightly easier to debug SEGVs. Note that on large IR files with
1784 // lots of gc.statepoints this is extremely costly both memory and time
1786 SmallVector<AllocaInst *, 64> ToClobber;
1787 for (auto Pair : AllocaMap) {
1788 Value *Def = Pair.first;
1789 AllocaInst *Alloca = cast<AllocaInst>(Pair.second);
1791 // This value was relocated
1792 if (VisitedLiveValues.count(Def)) {
1795 ToClobber.push_back(Alloca);
1798 auto InsertClobbersAt = [&](Instruction *IP) {
1799 for (auto *AI : ToClobber) {
1800 auto AIType = cast<PointerType>(AI->getType());
1801 auto PT = cast<PointerType>(AIType->getElementType());
1802 Constant *CPN = ConstantPointerNull::get(PT);
1803 StoreInst *Store = new StoreInst(CPN, AI);
1804 Store->insertBefore(IP);
1808 // Insert the clobbering stores. These may get intermixed with the
1809 // gc.results and gc.relocates, but that's fine.
1810 if (auto II = dyn_cast<InvokeInst>(Statepoint)) {
1811 InsertClobbersAt(&*II->getNormalDest()->getFirstInsertionPt());
1812 InsertClobbersAt(&*II->getUnwindDest()->getFirstInsertionPt());
1814 InsertClobbersAt(cast<Instruction>(Statepoint)->getNextNode());
1819 // Update use with load allocas and add store for gc_relocated.
1820 for (auto Pair : AllocaMap) {
1821 Value *Def = Pair.first;
1822 Value *Alloca = Pair.second;
1824 // We pre-record the uses of allocas so that we dont have to worry about
1825 // later update that changes the user information..
1827 SmallVector<Instruction *, 20> Uses;
1828 // PERF: trade a linear scan for repeated reallocation
1829 Uses.reserve(std::distance(Def->user_begin(), Def->user_end()));
1830 for (User *U : Def->users()) {
1831 if (!isa<ConstantExpr>(U)) {
1832 // If the def has a ConstantExpr use, then the def is either a
1833 // ConstantExpr use itself or null. In either case
1834 // (recursively in the first, directly in the second), the oop
1835 // it is ultimately dependent on is null and this particular
1836 // use does not need to be fixed up.
1837 Uses.push_back(cast<Instruction>(U));
1841 std::sort(Uses.begin(), Uses.end());
1842 auto Last = std::unique(Uses.begin(), Uses.end());
1843 Uses.erase(Last, Uses.end());
1845 for (Instruction *Use : Uses) {
1846 if (isa<PHINode>(Use)) {
1847 PHINode *Phi = cast<PHINode>(Use);
1848 for (unsigned i = 0; i < Phi->getNumIncomingValues(); i++) {
1849 if (Def == Phi->getIncomingValue(i)) {
1850 LoadInst *Load = new LoadInst(
1851 Alloca, "", Phi->getIncomingBlock(i)->getTerminator());
1852 Phi->setIncomingValue(i, Load);
1856 LoadInst *Load = new LoadInst(Alloca, "", Use);
1857 Use->replaceUsesOfWith(Def, Load);
1861 // Emit store for the initial gc value. Store must be inserted after load,
1862 // otherwise store will be in alloca's use list and an extra load will be
1863 // inserted before it.
1864 StoreInst *Store = new StoreInst(Def, Alloca);
1865 if (Instruction *Inst = dyn_cast<Instruction>(Def)) {
1866 if (InvokeInst *Invoke = dyn_cast<InvokeInst>(Inst)) {
1867 // InvokeInst is a TerminatorInst so the store need to be inserted
1868 // into its normal destination block.
1869 BasicBlock *NormalDest = Invoke->getNormalDest();
1870 Store->insertBefore(NormalDest->getFirstNonPHI());
1872 assert(!Inst->isTerminator() &&
1873 "The only TerminatorInst that can produce a value is "
1874 "InvokeInst which is handled above.");
1875 Store->insertAfter(Inst);
1878 assert(isa<Argument>(Def));
1879 Store->insertAfter(cast<Instruction>(Alloca));
1883 assert(PromotableAllocas.size() == Live.size() + NumRematerializedValues &&
1884 "we must have the same allocas with lives");
1885 if (!PromotableAllocas.empty()) {
1886 // Apply mem2reg to promote alloca to SSA
1887 PromoteMemToReg(PromotableAllocas, DT);
1891 for (auto &I : F.getEntryBlock())
1892 if (isa<AllocaInst>(I))
1894 assert(InitialAllocaNum == 0 && "We must not introduce any extra allocas");
1898 /// Implement a unique function which doesn't require we sort the input
1899 /// vector. Doing so has the effect of changing the output of a couple of
1900 /// tests in ways which make them less useful in testing fused safepoints.
1901 template <typename T> static void unique_unsorted(SmallVectorImpl<T> &Vec) {
1902 SmallSet<T, 8> Seen;
1903 Vec.erase(std::remove_if(Vec.begin(), Vec.end(), [&](const T &V) {
1904 return !Seen.insert(V).second;
1908 /// Insert holders so that each Value is obviously live through the entire
1909 /// lifetime of the call.
1910 static void insertUseHolderAfter(CallSite &CS, const ArrayRef<Value *> Values,
1911 SmallVectorImpl<CallInst *> &Holders) {
1913 // No values to hold live, might as well not insert the empty holder
1916 Module *M = CS.getInstruction()->getParent()->getParent()->getParent();
1917 // Use a dummy vararg function to actually hold the values live
1918 Function *Func = cast<Function>(M->getOrInsertFunction(
1919 "__tmp_use", FunctionType::get(Type::getVoidTy(M->getContext()), true)));
1921 // For call safepoints insert dummy calls right after safepoint
1922 Holders.push_back(CallInst::Create(Func, Values, "",
1923 &*++CS.getInstruction()->getIterator()));
1926 // For invoke safepooints insert dummy calls both in normal and
1927 // exceptional destination blocks
1928 auto *II = cast<InvokeInst>(CS.getInstruction());
1929 Holders.push_back(CallInst::Create(
1930 Func, Values, "", &*II->getNormalDest()->getFirstInsertionPt()));
1931 Holders.push_back(CallInst::Create(
1932 Func, Values, "", &*II->getUnwindDest()->getFirstInsertionPt()));
1935 static void findLiveReferences(
1936 Function &F, DominatorTree &DT, Pass *P, ArrayRef<CallSite> toUpdate,
1937 MutableArrayRef<struct PartiallyConstructedSafepointRecord> records) {
1938 GCPtrLivenessData OriginalLivenessData;
1939 computeLiveInValues(DT, F, OriginalLivenessData);
1940 for (size_t i = 0; i < records.size(); i++) {
1941 struct PartiallyConstructedSafepointRecord &info = records[i];
1942 const CallSite &CS = toUpdate[i];
1943 analyzeParsePointLiveness(DT, OriginalLivenessData, CS, info);
1947 /// Remove any vector of pointers from the live set by scalarizing them over the
1948 /// statepoint instruction. Adds the scalarized pieces to the live set. It
1949 /// would be preferable to include the vector in the statepoint itself, but
1950 /// the lowering code currently does not handle that. Extending it would be
1951 /// slightly non-trivial since it requires a format change. Given how rare
1952 /// such cases are (for the moment?) scalarizing is an acceptable compromise.
1953 static void splitVectorValues(Instruction *StatepointInst,
1954 StatepointLiveSetTy &LiveSet,
1955 DenseMap<Value *, Value *>& PointerToBase,
1956 DominatorTree &DT) {
1957 SmallVector<Value *, 16> ToSplit;
1958 for (Value *V : LiveSet)
1959 if (isa<VectorType>(V->getType()))
1960 ToSplit.push_back(V);
1962 if (ToSplit.empty())
1965 DenseMap<Value *, SmallVector<Value *, 16>> ElementMapping;
1967 Function &F = *(StatepointInst->getParent()->getParent());
1969 DenseMap<Value *, AllocaInst *> AllocaMap;
1970 // First is normal return, second is exceptional return (invoke only)
1971 DenseMap<Value *, std::pair<Value *, Value *>> Replacements;
1972 for (Value *V : ToSplit) {
1973 AllocaInst *Alloca =
1974 new AllocaInst(V->getType(), "", F.getEntryBlock().getFirstNonPHI());
1975 AllocaMap[V] = Alloca;
1977 VectorType *VT = cast<VectorType>(V->getType());
1978 IRBuilder<> Builder(StatepointInst);
1979 SmallVector<Value *, 16> Elements;
1980 for (unsigned i = 0; i < VT->getNumElements(); i++)
1981 Elements.push_back(Builder.CreateExtractElement(V, Builder.getInt32(i)));
1982 ElementMapping[V] = Elements;
1984 auto InsertVectorReform = [&](Instruction *IP) {
1985 Builder.SetInsertPoint(IP);
1986 Builder.SetCurrentDebugLocation(IP->getDebugLoc());
1987 Value *ResultVec = UndefValue::get(VT);
1988 for (unsigned i = 0; i < VT->getNumElements(); i++)
1989 ResultVec = Builder.CreateInsertElement(ResultVec, Elements[i],
1990 Builder.getInt32(i));
1994 if (isa<CallInst>(StatepointInst)) {
1995 BasicBlock::iterator Next(StatepointInst);
1997 Instruction *IP = &*(Next);
1998 Replacements[V].first = InsertVectorReform(IP);
1999 Replacements[V].second = nullptr;
2001 InvokeInst *Invoke = cast<InvokeInst>(StatepointInst);
2002 // We've already normalized - check that we don't have shared destination
2004 BasicBlock *NormalDest = Invoke->getNormalDest();
2005 assert(!isa<PHINode>(NormalDest->begin()));
2006 BasicBlock *UnwindDest = Invoke->getUnwindDest();
2007 assert(!isa<PHINode>(UnwindDest->begin()));
2008 // Insert insert element sequences in both successors
2009 Instruction *IP = &*(NormalDest->getFirstInsertionPt());
2010 Replacements[V].first = InsertVectorReform(IP);
2011 IP = &*(UnwindDest->getFirstInsertionPt());
2012 Replacements[V].second = InsertVectorReform(IP);
2016 for (Value *V : ToSplit) {
2017 AllocaInst *Alloca = AllocaMap[V];
2019 // Capture all users before we start mutating use lists
2020 SmallVector<Instruction *, 16> Users;
2021 for (User *U : V->users())
2022 Users.push_back(cast<Instruction>(U));
2024 for (Instruction *I : Users) {
2025 if (auto Phi = dyn_cast<PHINode>(I)) {
2026 for (unsigned i = 0; i < Phi->getNumIncomingValues(); i++)
2027 if (V == Phi->getIncomingValue(i)) {
2028 LoadInst *Load = new LoadInst(
2029 Alloca, "", Phi->getIncomingBlock(i)->getTerminator());
2030 Phi->setIncomingValue(i, Load);
2033 LoadInst *Load = new LoadInst(Alloca, "", I);
2034 I->replaceUsesOfWith(V, Load);
2038 // Store the original value and the replacement value into the alloca
2039 StoreInst *Store = new StoreInst(V, Alloca);
2040 if (auto I = dyn_cast<Instruction>(V))
2041 Store->insertAfter(I);
2043 Store->insertAfter(Alloca);
2045 // Normal return for invoke, or call return
2046 Instruction *Replacement = cast<Instruction>(Replacements[V].first);
2047 (new StoreInst(Replacement, Alloca))->insertAfter(Replacement);
2048 // Unwind return for invoke only
2049 Replacement = cast_or_null<Instruction>(Replacements[V].second);
2051 (new StoreInst(Replacement, Alloca))->insertAfter(Replacement);
2054 // apply mem2reg to promote alloca to SSA
2055 SmallVector<AllocaInst *, 16> Allocas;
2056 for (Value *V : ToSplit)
2057 Allocas.push_back(AllocaMap[V]);
2058 PromoteMemToReg(Allocas, DT);
2060 // Update our tracking of live pointers and base mappings to account for the
2061 // changes we just made.
2062 for (Value *V : ToSplit) {
2063 auto &Elements = ElementMapping[V];
2066 LiveSet.insert(Elements.begin(), Elements.end());
2067 // We need to update the base mapping as well.
2068 assert(PointerToBase.count(V));
2069 Value *OldBase = PointerToBase[V];
2070 auto &BaseElements = ElementMapping[OldBase];
2071 PointerToBase.erase(V);
2072 assert(Elements.size() == BaseElements.size());
2073 for (unsigned i = 0; i < Elements.size(); i++) {
2074 Value *Elem = Elements[i];
2075 PointerToBase[Elem] = BaseElements[i];
2080 // Helper function for the "rematerializeLiveValues". It walks use chain
2081 // starting from the "CurrentValue" until it meets "BaseValue". Only "simple"
2082 // values are visited (currently it is GEP's and casts). Returns true if it
2083 // successfully reached "BaseValue" and false otherwise.
2084 // Fills "ChainToBase" array with all visited values. "BaseValue" is not
2086 static bool findRematerializableChainToBasePointer(
2087 SmallVectorImpl<Instruction*> &ChainToBase,
2088 Value *CurrentValue, Value *BaseValue) {
2090 // We have found a base value
2091 if (CurrentValue == BaseValue) {
2095 if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(CurrentValue)) {
2096 ChainToBase.push_back(GEP);
2097 return findRematerializableChainToBasePointer(ChainToBase,
2098 GEP->getPointerOperand(),
2102 if (CastInst *CI = dyn_cast<CastInst>(CurrentValue)) {
2103 Value *Def = CI->stripPointerCasts();
2105 // This two checks are basically similar. First one is here for the
2106 // consistency with findBasePointers logic.
2107 assert(!isa<CastInst>(Def) && "not a pointer cast found");
2108 if (!CI->isNoopCast(CI->getModule()->getDataLayout()))
2111 ChainToBase.push_back(CI);
2112 return findRematerializableChainToBasePointer(ChainToBase, Def, BaseValue);
2115 // Not supported instruction in the chain
2119 // Helper function for the "rematerializeLiveValues". Compute cost of the use
2120 // chain we are going to rematerialize.
2122 chainToBasePointerCost(SmallVectorImpl<Instruction*> &Chain,
2123 TargetTransformInfo &TTI) {
2126 for (Instruction *Instr : Chain) {
2127 if (CastInst *CI = dyn_cast<CastInst>(Instr)) {
2128 assert(CI->isNoopCast(CI->getModule()->getDataLayout()) &&
2129 "non noop cast is found during rematerialization");
2131 Type *SrcTy = CI->getOperand(0)->getType();
2132 Cost += TTI.getCastInstrCost(CI->getOpcode(), CI->getType(), SrcTy);
2134 } else if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(Instr)) {
2135 // Cost of the address calculation
2136 Type *ValTy = GEP->getPointerOperandType()->getPointerElementType();
2137 Cost += TTI.getAddressComputationCost(ValTy);
2139 // And cost of the GEP itself
2140 // TODO: Use TTI->getGEPCost here (it exists, but appears to be not
2141 // allowed for the external usage)
2142 if (!GEP->hasAllConstantIndices())
2146 llvm_unreachable("unsupported instruciton type during rematerialization");
2153 // From the statepoint live set pick values that are cheaper to recompute then
2154 // to relocate. Remove this values from the live set, rematerialize them after
2155 // statepoint and record them in "Info" structure. Note that similar to
2156 // relocated values we don't do any user adjustments here.
2157 static void rematerializeLiveValues(CallSite CS,
2158 PartiallyConstructedSafepointRecord &Info,
2159 TargetTransformInfo &TTI) {
2160 const unsigned int ChainLengthThreshold = 10;
2162 // Record values we are going to delete from this statepoint live set.
2163 // We can not di this in following loop due to iterator invalidation.
2164 SmallVector<Value *, 32> LiveValuesToBeDeleted;
2166 for (Value *LiveValue: Info.LiveSet) {
2167 // For each live pointer find it's defining chain
2168 SmallVector<Instruction *, 3> ChainToBase;
2169 assert(Info.PointerToBase.count(LiveValue));
2171 findRematerializableChainToBasePointer(ChainToBase,
2173 Info.PointerToBase[LiveValue]);
2174 // Nothing to do, or chain is too long
2176 ChainToBase.size() == 0 ||
2177 ChainToBase.size() > ChainLengthThreshold)
2180 // Compute cost of this chain
2181 unsigned Cost = chainToBasePointerCost(ChainToBase, TTI);
2182 // TODO: We can also account for cases when we will be able to remove some
2183 // of the rematerialized values by later optimization passes. I.e if
2184 // we rematerialized several intersecting chains. Or if original values
2185 // don't have any uses besides this statepoint.
2187 // For invokes we need to rematerialize each chain twice - for normal and
2188 // for unwind basic blocks. Model this by multiplying cost by two.
2189 if (CS.isInvoke()) {
2192 // If it's too expensive - skip it
2193 if (Cost >= RematerializationThreshold)
2196 // Remove value from the live set
2197 LiveValuesToBeDeleted.push_back(LiveValue);
2199 // Clone instructions and record them inside "Info" structure
2201 // Walk backwards to visit top-most instructions first
2202 std::reverse(ChainToBase.begin(), ChainToBase.end());
2204 // Utility function which clones all instructions from "ChainToBase"
2205 // and inserts them before "InsertBefore". Returns rematerialized value
2206 // which should be used after statepoint.
2207 auto rematerializeChain = [&ChainToBase](Instruction *InsertBefore) {
2208 Instruction *LastClonedValue = nullptr;
2209 Instruction *LastValue = nullptr;
2210 for (Instruction *Instr: ChainToBase) {
2211 // Only GEP's and casts are suported as we need to be careful to not
2212 // introduce any new uses of pointers not in the liveset.
2213 // Note that it's fine to introduce new uses of pointers which were
2214 // otherwise not used after this statepoint.
2215 assert(isa<GetElementPtrInst>(Instr) || isa<CastInst>(Instr));
2217 Instruction *ClonedValue = Instr->clone();
2218 ClonedValue->insertBefore(InsertBefore);
2219 ClonedValue->setName(Instr->getName() + ".remat");
2221 // If it is not first instruction in the chain then it uses previously
2222 // cloned value. We should update it to use cloned value.
2223 if (LastClonedValue) {
2225 ClonedValue->replaceUsesOfWith(LastValue, LastClonedValue);
2227 // Assert that cloned instruction does not use any instructions from
2228 // this chain other than LastClonedValue
2229 for (auto OpValue : ClonedValue->operand_values()) {
2230 assert(std::find(ChainToBase.begin(), ChainToBase.end(), OpValue) ==
2231 ChainToBase.end() &&
2232 "incorrect use in rematerialization chain");
2237 LastClonedValue = ClonedValue;
2240 assert(LastClonedValue);
2241 return LastClonedValue;
2244 // Different cases for calls and invokes. For invokes we need to clone
2245 // instructions both on normal and unwind path.
2247 Instruction *InsertBefore = CS.getInstruction()->getNextNode();
2248 assert(InsertBefore);
2249 Instruction *RematerializedValue = rematerializeChain(InsertBefore);
2250 Info.RematerializedValues[RematerializedValue] = LiveValue;
2252 InvokeInst *Invoke = cast<InvokeInst>(CS.getInstruction());
2254 Instruction *NormalInsertBefore =
2255 &*Invoke->getNormalDest()->getFirstInsertionPt();
2256 Instruction *UnwindInsertBefore =
2257 &*Invoke->getUnwindDest()->getFirstInsertionPt();
2259 Instruction *NormalRematerializedValue =
2260 rematerializeChain(NormalInsertBefore);
2261 Instruction *UnwindRematerializedValue =
2262 rematerializeChain(UnwindInsertBefore);
2264 Info.RematerializedValues[NormalRematerializedValue] = LiveValue;
2265 Info.RematerializedValues[UnwindRematerializedValue] = LiveValue;
2269 // Remove rematerializaed values from the live set
2270 for (auto LiveValue: LiveValuesToBeDeleted) {
2271 Info.LiveSet.erase(LiveValue);
2275 static bool insertParsePoints(Function &F, DominatorTree &DT, Pass *P,
2276 SmallVectorImpl<CallSite> &ToUpdate) {
2278 // sanity check the input
2279 std::set<CallSite> Uniqued;
2280 Uniqued.insert(ToUpdate.begin(), ToUpdate.end());
2281 assert(Uniqued.size() == ToUpdate.size() && "no duplicates please!");
2283 for (CallSite CS : ToUpdate) {
2284 assert(CS.getInstruction()->getParent()->getParent() == &F);
2285 assert((UseDeoptBundles || isStatepoint(CS)) &&
2286 "expected to already be a deopt statepoint");
2290 // When inserting gc.relocates for invokes, we need to be able to insert at
2291 // the top of the successor blocks. See the comment on
2292 // normalForInvokeSafepoint on exactly what is needed. Note that this step
2293 // may restructure the CFG.
2294 for (CallSite CS : ToUpdate) {
2297 auto *II = cast<InvokeInst>(CS.getInstruction());
2298 normalizeForInvokeSafepoint(II->getNormalDest(), II->getParent(), DT);
2299 normalizeForInvokeSafepoint(II->getUnwindDest(), II->getParent(), DT);
2302 // A list of dummy calls added to the IR to keep various values obviously
2303 // live in the IR. We'll remove all of these when done.
2304 SmallVector<CallInst *, 64> Holders;
2306 // Insert a dummy call with all of the arguments to the vm_state we'll need
2307 // for the actual safepoint insertion. This ensures reference arguments in
2308 // the deopt argument list are considered live through the safepoint (and
2309 // thus makes sure they get relocated.)
2310 for (CallSite CS : ToUpdate) {
2311 SmallVector<Value *, 64> DeoptValues;
2313 iterator_range<const Use *> DeoptStateRange =
2315 ? iterator_range<const Use *>(GetDeoptBundleOperands(CS))
2316 : iterator_range<const Use *>(Statepoint(CS).vm_state_args());
2318 for (Value *Arg : DeoptStateRange) {
2319 assert(!isUnhandledGCPointerType(Arg->getType()) &&
2320 "support for FCA unimplemented");
2321 if (isHandledGCPointerType(Arg->getType()))
2322 DeoptValues.push_back(Arg);
2325 insertUseHolderAfter(CS, DeoptValues, Holders);
2328 SmallVector<PartiallyConstructedSafepointRecord, 64> Records(ToUpdate.size());
2330 // A) Identify all gc pointers which are statically live at the given call
2332 findLiveReferences(F, DT, P, ToUpdate, Records);
2334 // B) Find the base pointers for each live pointer
2335 /* scope for caching */ {
2336 // Cache the 'defining value' relation used in the computation and
2337 // insertion of base phis and selects. This ensures that we don't insert
2338 // large numbers of duplicate base_phis.
2339 DefiningValueMapTy DVCache;
2341 for (size_t i = 0; i < Records.size(); i++) {
2342 PartiallyConstructedSafepointRecord &info = Records[i];
2343 findBasePointers(DT, DVCache, ToUpdate[i], info);
2345 } // end of cache scope
2347 // The base phi insertion logic (for any safepoint) may have inserted new
2348 // instructions which are now live at some safepoint. The simplest such
2351 // phi a <-- will be a new base_phi here
2352 // safepoint 1 <-- that needs to be live here
2356 // We insert some dummy calls after each safepoint to definitely hold live
2357 // the base pointers which were identified for that safepoint. We'll then
2358 // ask liveness for _every_ base inserted to see what is now live. Then we
2359 // remove the dummy calls.
2360 Holders.reserve(Holders.size() + Records.size());
2361 for (size_t i = 0; i < Records.size(); i++) {
2362 PartiallyConstructedSafepointRecord &Info = Records[i];
2364 SmallVector<Value *, 128> Bases;
2365 for (auto Pair : Info.PointerToBase)
2366 Bases.push_back(Pair.second);
2368 insertUseHolderAfter(ToUpdate[i], Bases, Holders);
2371 // By selecting base pointers, we've effectively inserted new uses. Thus, we
2372 // need to rerun liveness. We may *also* have inserted new defs, but that's
2373 // not the key issue.
2374 recomputeLiveInValues(F, DT, P, ToUpdate, Records);
2376 if (PrintBasePointers) {
2377 for (auto &Info : Records) {
2378 errs() << "Base Pairs: (w/Relocation)\n";
2379 for (auto Pair : Info.PointerToBase)
2380 errs() << " derived %" << Pair.first->getName() << " base %"
2381 << Pair.second->getName() << "\n";
2385 for (CallInst *CI : Holders)
2386 CI->eraseFromParent();
2390 // Do a limited scalarization of any live at safepoint vector values which
2391 // contain pointers. This enables this pass to run after vectorization at
2392 // the cost of some possible performance loss. TODO: it would be nice to
2393 // natively support vectors all the way through the backend so we don't need
2394 // to scalarize here.
2395 for (size_t i = 0; i < Records.size(); i++) {
2396 PartiallyConstructedSafepointRecord &Info = Records[i];
2397 Instruction *Statepoint = ToUpdate[i].getInstruction();
2398 splitVectorValues(cast<Instruction>(Statepoint), Info.LiveSet,
2399 Info.PointerToBase, DT);
2402 // In order to reduce live set of statepoint we might choose to rematerialize
2403 // some values instead of relocating them. This is purely an optimization and
2404 // does not influence correctness.
2405 TargetTransformInfo &TTI =
2406 P->getAnalysis<TargetTransformInfoWrapperPass>().getTTI(F);
2408 for (size_t i = 0; i < Records.size(); i++)
2409 rematerializeLiveValues(ToUpdate[i], Records[i], TTI);
2411 // We need this to safely RAUW and delete call or invoke return values that
2412 // may themselves be live over a statepoint. For details, please see usage in
2413 // makeStatepointExplicitImpl.
2414 std::vector<DeferredReplacement> Replacements;
2416 // Now run through and replace the existing statepoints with new ones with
2417 // the live variables listed. We do not yet update uses of the values being
2418 // relocated. We have references to live variables that need to
2419 // survive to the last iteration of this loop. (By construction, the
2420 // previous statepoint can not be a live variable, thus we can and remove
2421 // the old statepoint calls as we go.)
2422 for (size_t i = 0; i < Records.size(); i++)
2423 makeStatepointExplicit(DT, ToUpdate[i], Records[i], Replacements);
2425 ToUpdate.clear(); // prevent accident use of invalid CallSites
2427 for (auto &PR : Replacements)
2430 Replacements.clear();
2432 for (auto &Info : Records) {
2433 // These live sets may contain state Value pointers, since we replaced calls
2434 // with operand bundles with calls wrapped in gc.statepoint, and some of
2435 // those calls may have been def'ing live gc pointers. Clear these out to
2436 // avoid accidentally using them.
2438 // TODO: We should create a separate data structure that does not contain
2439 // these live sets, and migrate to using that data structure from this point
2441 Info.LiveSet.clear();
2442 Info.PointerToBase.clear();
2445 // Do all the fixups of the original live variables to their relocated selves
2446 SmallVector<Value *, 128> Live;
2447 for (size_t i = 0; i < Records.size(); i++) {
2448 PartiallyConstructedSafepointRecord &Info = Records[i];
2450 // We can't simply save the live set from the original insertion. One of
2451 // the live values might be the result of a call which needs a safepoint.
2452 // That Value* no longer exists and we need to use the new gc_result.
2453 // Thankfully, the live set is embedded in the statepoint (and updated), so
2454 // we just grab that.
2455 Statepoint Statepoint(Info.StatepointToken);
2456 Live.insert(Live.end(), Statepoint.gc_args_begin(),
2457 Statepoint.gc_args_end());
2459 // Do some basic sanity checks on our liveness results before performing
2460 // relocation. Relocation can and will turn mistakes in liveness results
2461 // into non-sensical code which is must harder to debug.
2462 // TODO: It would be nice to test consistency as well
2463 assert(DT.isReachableFromEntry(Info.StatepointToken->getParent()) &&
2464 "statepoint must be reachable or liveness is meaningless");
2465 for (Value *V : Statepoint.gc_args()) {
2466 if (!isa<Instruction>(V))
2467 // Non-instruction values trivial dominate all possible uses
2469 auto *LiveInst = cast<Instruction>(V);
2470 assert(DT.isReachableFromEntry(LiveInst->getParent()) &&
2471 "unreachable values should never be live");
2472 assert(DT.dominates(LiveInst, Info.StatepointToken) &&
2473 "basic SSA liveness expectation violated by liveness analysis");
2477 unique_unsorted(Live);
2481 for (auto *Ptr : Live)
2482 assert(isGCPointerType(Ptr->getType()) && "must be a gc pointer type");
2485 relocationViaAlloca(F, DT, Live, Records);
2486 return !Records.empty();
2489 // Handles both return values and arguments for Functions and CallSites.
2490 template <typename AttrHolder>
2491 static void RemoveDerefAttrAtIndex(LLVMContext &Ctx, AttrHolder &AH,
2494 if (AH.getDereferenceableBytes(Index))
2495 R.addAttribute(Attribute::get(Ctx, Attribute::Dereferenceable,
2496 AH.getDereferenceableBytes(Index)));
2497 if (AH.getDereferenceableOrNullBytes(Index))
2498 R.addAttribute(Attribute::get(Ctx, Attribute::DereferenceableOrNull,
2499 AH.getDereferenceableOrNullBytes(Index)));
2502 AH.setAttributes(AH.getAttributes().removeAttributes(
2503 Ctx, Index, AttributeSet::get(Ctx, Index, R)));
2507 RewriteStatepointsForGC::stripDereferenceabilityInfoFromPrototype(Function &F) {
2508 LLVMContext &Ctx = F.getContext();
2510 for (Argument &A : F.args())
2511 if (isa<PointerType>(A.getType()))
2512 RemoveDerefAttrAtIndex(Ctx, F, A.getArgNo() + 1);
2514 if (isa<PointerType>(F.getReturnType()))
2515 RemoveDerefAttrAtIndex(Ctx, F, AttributeSet::ReturnIndex);
2518 void RewriteStatepointsForGC::stripDereferenceabilityInfoFromBody(Function &F) {
2522 LLVMContext &Ctx = F.getContext();
2523 MDBuilder Builder(Ctx);
2525 for (Instruction &I : instructions(F)) {
2526 if (const MDNode *MD = I.getMetadata(LLVMContext::MD_tbaa)) {
2527 assert(MD->getNumOperands() < 5 && "unrecognized metadata shape!");
2528 bool IsImmutableTBAA =
2529 MD->getNumOperands() == 4 &&
2530 mdconst::extract<ConstantInt>(MD->getOperand(3))->getValue() == 1;
2532 if (!IsImmutableTBAA)
2533 continue; // no work to do, MD_tbaa is already marked mutable
2535 MDNode *Base = cast<MDNode>(MD->getOperand(0));
2536 MDNode *Access = cast<MDNode>(MD->getOperand(1));
2538 mdconst::extract<ConstantInt>(MD->getOperand(2))->getZExtValue();
2540 MDNode *MutableTBAA =
2541 Builder.createTBAAStructTagNode(Base, Access, Offset);
2542 I.setMetadata(LLVMContext::MD_tbaa, MutableTBAA);
2545 if (CallSite CS = CallSite(&I)) {
2546 for (int i = 0, e = CS.arg_size(); i != e; i++)
2547 if (isa<PointerType>(CS.getArgument(i)->getType()))
2548 RemoveDerefAttrAtIndex(Ctx, CS, i + 1);
2549 if (isa<PointerType>(CS.getType()))
2550 RemoveDerefAttrAtIndex(Ctx, CS, AttributeSet::ReturnIndex);
2555 /// Returns true if this function should be rewritten by this pass. The main
2556 /// point of this function is as an extension point for custom logic.
2557 static bool shouldRewriteStatepointsIn(Function &F) {
2558 // TODO: This should check the GCStrategy
2560 const char *FunctionGCName = F.getGC();
2561 const StringRef StatepointExampleName("statepoint-example");
2562 const StringRef CoreCLRName("coreclr");
2563 return (StatepointExampleName == FunctionGCName) ||
2564 (CoreCLRName == FunctionGCName);
2569 void RewriteStatepointsForGC::stripDereferenceabilityInfo(Module &M) {
2571 assert(std::any_of(M.begin(), M.end(), shouldRewriteStatepointsIn) &&
2575 for (Function &F : M)
2576 stripDereferenceabilityInfoFromPrototype(F);
2578 for (Function &F : M)
2579 stripDereferenceabilityInfoFromBody(F);
2582 bool RewriteStatepointsForGC::runOnFunction(Function &F) {
2583 // Nothing to do for declarations.
2584 if (F.isDeclaration() || F.empty())
2587 // Policy choice says not to rewrite - the most common reason is that we're
2588 // compiling code without a GCStrategy.
2589 if (!shouldRewriteStatepointsIn(F))
2592 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>(F).getDomTree();
2594 auto NeedsRewrite = [](Instruction &I) {
2595 if (UseDeoptBundles) {
2596 if (ImmutableCallSite CS = ImmutableCallSite(&I))
2597 return !callsGCLeafFunction(CS);
2601 return isStatepoint(I);
2604 // Gather all the statepoints which need rewritten. Be careful to only
2605 // consider those in reachable code since we need to ask dominance queries
2606 // when rewriting. We'll delete the unreachable ones in a moment.
2607 SmallVector<CallSite, 64> ParsePointNeeded;
2608 bool HasUnreachableStatepoint = false;
2609 for (Instruction &I : instructions(F)) {
2610 // TODO: only the ones with the flag set!
2611 if (NeedsRewrite(I)) {
2612 if (DT.isReachableFromEntry(I.getParent()))
2613 ParsePointNeeded.push_back(CallSite(&I));
2615 HasUnreachableStatepoint = true;
2619 bool MadeChange = false;
2621 // Delete any unreachable statepoints so that we don't have unrewritten
2622 // statepoints surviving this pass. This makes testing easier and the
2623 // resulting IR less confusing to human readers. Rather than be fancy, we
2624 // just reuse a utility function which removes the unreachable blocks.
2625 if (HasUnreachableStatepoint)
2626 MadeChange |= removeUnreachableBlocks(F);
2628 // Return early if no work to do.
2629 if (ParsePointNeeded.empty())
2632 // As a prepass, go ahead and aggressively destroy single entry phi nodes.
2633 // These are created by LCSSA. They have the effect of increasing the size
2634 // of liveness sets for no good reason. It may be harder to do this post
2635 // insertion since relocations and base phis can confuse things.
2636 for (BasicBlock &BB : F)
2637 if (BB.getUniquePredecessor()) {
2639 FoldSingleEntryPHINodes(&BB);
2642 // Before we start introducing relocations, we want to tweak the IR a bit to
2643 // avoid unfortunate code generation effects. The main example is that we
2644 // want to try to make sure the comparison feeding a branch is after any
2645 // safepoints. Otherwise, we end up with a comparison of pre-relocation
2646 // values feeding a branch after relocation. This is semantically correct,
2647 // but results in extra register pressure since both the pre-relocation and
2648 // post-relocation copies must be available in registers. For code without
2649 // relocations this is handled elsewhere, but teaching the scheduler to
2650 // reverse the transform we're about to do would be slightly complex.
2651 // Note: This may extend the live range of the inputs to the icmp and thus
2652 // increase the liveset of any statepoint we move over. This is profitable
2653 // as long as all statepoints are in rare blocks. If we had in-register
2654 // lowering for live values this would be a much safer transform.
2655 auto getConditionInst = [](TerminatorInst *TI) -> Instruction* {
2656 if (auto *BI = dyn_cast<BranchInst>(TI))
2657 if (BI->isConditional())
2658 return dyn_cast<Instruction>(BI->getCondition());
2659 // TODO: Extend this to handle switches
2662 for (BasicBlock &BB : F) {
2663 TerminatorInst *TI = BB.getTerminator();
2664 if (auto *Cond = getConditionInst(TI))
2665 // TODO: Handle more than just ICmps here. We should be able to move
2666 // most instructions without side effects or memory access.
2667 if (isa<ICmpInst>(Cond) && Cond->hasOneUse()) {
2669 Cond->moveBefore(TI);
2673 MadeChange |= insertParsePoints(F, DT, this, ParsePointNeeded);
2677 // liveness computation via standard dataflow
2678 // -------------------------------------------------------------------
2680 // TODO: Consider using bitvectors for liveness, the set of potentially
2681 // interesting values should be small and easy to pre-compute.
2683 /// Compute the live-in set for the location rbegin starting from
2684 /// the live-out set of the basic block
2685 static void computeLiveInValues(BasicBlock::reverse_iterator rbegin,
2686 BasicBlock::reverse_iterator rend,
2687 DenseSet<Value *> &LiveTmp) {
2689 for (BasicBlock::reverse_iterator ritr = rbegin; ritr != rend; ritr++) {
2690 Instruction *I = &*ritr;
2692 // KILL/Def - Remove this definition from LiveIn
2695 // Don't consider *uses* in PHI nodes, we handle their contribution to
2696 // predecessor blocks when we seed the LiveOut sets
2697 if (isa<PHINode>(I))
2700 // USE - Add to the LiveIn set for this instruction
2701 for (Value *V : I->operands()) {
2702 assert(!isUnhandledGCPointerType(V->getType()) &&
2703 "support for FCA unimplemented");
2704 if (isHandledGCPointerType(V->getType()) && !isa<Constant>(V)) {
2705 // The choice to exclude all things constant here is slightly subtle.
2706 // There are two independent reasons:
2707 // - We assume that things which are constant (from LLVM's definition)
2708 // do not move at runtime. For example, the address of a global
2709 // variable is fixed, even though it's contents may not be.
2710 // - Second, we can't disallow arbitrary inttoptr constants even
2711 // if the language frontend does. Optimization passes are free to
2712 // locally exploit facts without respect to global reachability. This
2713 // can create sections of code which are dynamically unreachable and
2714 // contain just about anything. (see constants.ll in tests)
2721 static void computeLiveOutSeed(BasicBlock *BB, DenseSet<Value *> &LiveTmp) {
2723 for (BasicBlock *Succ : successors(BB)) {
2724 const BasicBlock::iterator E(Succ->getFirstNonPHI());
2725 for (BasicBlock::iterator I = Succ->begin(); I != E; I++) {
2726 PHINode *Phi = cast<PHINode>(&*I);
2727 Value *V = Phi->getIncomingValueForBlock(BB);
2728 assert(!isUnhandledGCPointerType(V->getType()) &&
2729 "support for FCA unimplemented");
2730 if (isHandledGCPointerType(V->getType()) && !isa<Constant>(V)) {
2737 static DenseSet<Value *> computeKillSet(BasicBlock *BB) {
2738 DenseSet<Value *> KillSet;
2739 for (Instruction &I : *BB)
2740 if (isHandledGCPointerType(I.getType()))
2746 /// Check that the items in 'Live' dominate 'TI'. This is used as a basic
2747 /// sanity check for the liveness computation.
2748 static void checkBasicSSA(DominatorTree &DT, DenseSet<Value *> &Live,
2749 TerminatorInst *TI, bool TermOkay = false) {
2750 for (Value *V : Live) {
2751 if (auto *I = dyn_cast<Instruction>(V)) {
2752 // The terminator can be a member of the LiveOut set. LLVM's definition
2753 // of instruction dominance states that V does not dominate itself. As
2754 // such, we need to special case this to allow it.
2755 if (TermOkay && TI == I)
2757 assert(DT.dominates(I, TI) &&
2758 "basic SSA liveness expectation violated by liveness analysis");
2763 /// Check that all the liveness sets used during the computation of liveness
2764 /// obey basic SSA properties. This is useful for finding cases where we miss
2766 static void checkBasicSSA(DominatorTree &DT, GCPtrLivenessData &Data,
2768 checkBasicSSA(DT, Data.LiveSet[&BB], BB.getTerminator());
2769 checkBasicSSA(DT, Data.LiveOut[&BB], BB.getTerminator(), true);
2770 checkBasicSSA(DT, Data.LiveIn[&BB], BB.getTerminator());
2774 static void computeLiveInValues(DominatorTree &DT, Function &F,
2775 GCPtrLivenessData &Data) {
2777 SmallSetVector<BasicBlock *, 200> Worklist;
2778 auto AddPredsToWorklist = [&](BasicBlock *BB) {
2779 // We use a SetVector so that we don't have duplicates in the worklist.
2780 Worklist.insert(pred_begin(BB), pred_end(BB));
2782 auto NextItem = [&]() {
2783 BasicBlock *BB = Worklist.back();
2784 Worklist.pop_back();
2788 // Seed the liveness for each individual block
2789 for (BasicBlock &BB : F) {
2790 Data.KillSet[&BB] = computeKillSet(&BB);
2791 Data.LiveSet[&BB].clear();
2792 computeLiveInValues(BB.rbegin(), BB.rend(), Data.LiveSet[&BB]);
2795 for (Value *Kill : Data.KillSet[&BB])
2796 assert(!Data.LiveSet[&BB].count(Kill) && "live set contains kill");
2799 Data.LiveOut[&BB] = DenseSet<Value *>();
2800 computeLiveOutSeed(&BB, Data.LiveOut[&BB]);
2801 Data.LiveIn[&BB] = Data.LiveSet[&BB];
2802 set_union(Data.LiveIn[&BB], Data.LiveOut[&BB]);
2803 set_subtract(Data.LiveIn[&BB], Data.KillSet[&BB]);
2804 if (!Data.LiveIn[&BB].empty())
2805 AddPredsToWorklist(&BB);
2808 // Propagate that liveness until stable
2809 while (!Worklist.empty()) {
2810 BasicBlock *BB = NextItem();
2812 // Compute our new liveout set, then exit early if it hasn't changed
2813 // despite the contribution of our successor.
2814 DenseSet<Value *> LiveOut = Data.LiveOut[BB];
2815 const auto OldLiveOutSize = LiveOut.size();
2816 for (BasicBlock *Succ : successors(BB)) {
2817 assert(Data.LiveIn.count(Succ));
2818 set_union(LiveOut, Data.LiveIn[Succ]);
2820 // assert OutLiveOut is a subset of LiveOut
2821 if (OldLiveOutSize == LiveOut.size()) {
2822 // If the sets are the same size, then we didn't actually add anything
2823 // when unioning our successors LiveIn Thus, the LiveIn of this block
2827 Data.LiveOut[BB] = LiveOut;
2829 // Apply the effects of this basic block
2830 DenseSet<Value *> LiveTmp = LiveOut;
2831 set_union(LiveTmp, Data.LiveSet[BB]);
2832 set_subtract(LiveTmp, Data.KillSet[BB]);
2834 assert(Data.LiveIn.count(BB));
2835 const DenseSet<Value *> &OldLiveIn = Data.LiveIn[BB];
2836 // assert: OldLiveIn is a subset of LiveTmp
2837 if (OldLiveIn.size() != LiveTmp.size()) {
2838 Data.LiveIn[BB] = LiveTmp;
2839 AddPredsToWorklist(BB);
2841 } // while( !worklist.empty() )
2844 // Sanity check our output against SSA properties. This helps catch any
2845 // missing kills during the above iteration.
2846 for (BasicBlock &BB : F) {
2847 checkBasicSSA(DT, Data, BB);
2852 static void findLiveSetAtInst(Instruction *Inst, GCPtrLivenessData &Data,
2853 StatepointLiveSetTy &Out) {
2855 BasicBlock *BB = Inst->getParent();
2857 // Note: The copy is intentional and required
2858 assert(Data.LiveOut.count(BB));
2859 DenseSet<Value *> LiveOut = Data.LiveOut[BB];
2861 // We want to handle the statepoint itself oddly. It's
2862 // call result is not live (normal), nor are it's arguments
2863 // (unless they're used again later). This adjustment is
2864 // specifically what we need to relocate
2865 BasicBlock::reverse_iterator rend(Inst->getIterator());
2866 computeLiveInValues(BB->rbegin(), rend, LiveOut);
2867 LiveOut.erase(Inst);
2868 Out.insert(LiveOut.begin(), LiveOut.end());
2871 static void recomputeLiveInValues(GCPtrLivenessData &RevisedLivenessData,
2873 PartiallyConstructedSafepointRecord &Info) {
2874 Instruction *Inst = CS.getInstruction();
2875 StatepointLiveSetTy Updated;
2876 findLiveSetAtInst(Inst, RevisedLivenessData, Updated);
2879 DenseSet<Value *> Bases;
2880 for (auto KVPair : Info.PointerToBase) {
2881 Bases.insert(KVPair.second);
2884 // We may have base pointers which are now live that weren't before. We need
2885 // to update the PointerToBase structure to reflect this.
2886 for (auto V : Updated)
2887 if (!Info.PointerToBase.count(V)) {
2888 assert(Bases.count(V) && "can't find base for unexpected live value");
2889 Info.PointerToBase[V] = V;
2894 for (auto V : Updated) {
2895 assert(Info.PointerToBase.count(V) &&
2896 "must be able to find base for live value");
2900 // Remove any stale base mappings - this can happen since our liveness is
2901 // more precise then the one inherent in the base pointer analysis
2902 DenseSet<Value *> ToErase;
2903 for (auto KVPair : Info.PointerToBase)
2904 if (!Updated.count(KVPair.first))
2905 ToErase.insert(KVPair.first);
2906 for (auto V : ToErase)
2907 Info.PointerToBase.erase(V);
2910 for (auto KVPair : Info.PointerToBase)
2911 assert(Updated.count(KVPair.first) && "record for non-live value");
2914 Info.LiveSet = Updated;