LLVM  10.0.0svn
Macros | Functions | Variables
PlaceSafepoints.cpp File Reference
#include "llvm/Pass.h"
#include "llvm/ADT/SetVector.h"
#include "llvm/ADT/Statistic.h"
#include "llvm/Analysis/CFG.h"
#include "llvm/Analysis/ScalarEvolution.h"
#include "llvm/Analysis/TargetLibraryInfo.h"
#include "llvm/Transforms/Utils/Local.h"
#include "llvm/IR/Dominators.h"
#include "llvm/IR/IntrinsicInst.h"
#include "llvm/IR/LegacyPassManager.h"
#include "llvm/IR/Statepoint.h"
#include "llvm/Support/CommandLine.h"
#include "llvm/Support/Debug.h"
#include "llvm/Transforms/Scalar.h"
#include "llvm/Transforms/Utils/BasicBlockUtils.h"
#include "llvm/Transforms/Utils/Cloning.h"
Include dependency graph for PlaceSafepoints.cpp:

Go to the source code of this file.

Macros

#define DEBUG_TYPE   "safepoint-placement"
 

Functions

 STATISTIC (NumEntrySafepoints, "Number of entry safepoints inserted")
 
 STATISTIC (NumBackedgeSafepoints, "Number of backedge safepoints inserted")
 
 STATISTIC (CallInLoop, "Number of loops without safepoints due to calls in loop")
 
 STATISTIC (FiniteExecution, "Number of loops without safepoints finite execution")
 
static void InsertSafepointPoll (Instruction *InsertBefore, std::vector< CallBase *> &ParsePointsNeeded, const TargetLibraryInfo &TLI)
 
static bool needsStatepoint (CallBase *Call, const TargetLibraryInfo &TLI)
 
static bool containsUnconditionalCallSafepoint (Loop *L, BasicBlock *Header, BasicBlock *Pred, DominatorTree &DT, const TargetLibraryInfo &TLI)
 Returns true if this loop is known to contain a call safepoint which must unconditionally execute on any iteration of the loop which returns to the loop header via an edge from Pred. More...
 
static bool mustBeFiniteCountedLoop (Loop *L, ScalarEvolution *SE, BasicBlock *Pred)
 Returns true if this loop is known to terminate in a finite number of iterations. More...
 
static void scanOneBB (Instruction *Start, Instruction *End, std::vector< CallInst *> &Calls, DenseSet< BasicBlock *> &Seen, std::vector< BasicBlock *> &Worklist)
 
static void scanInlinedCode (Instruction *Start, Instruction *End, std::vector< CallInst *> &Calls, DenseSet< BasicBlock *> &Seen)
 
static bool doesNotRequireEntrySafepointBefore (CallBase *Call)
 Returns true if an entry safepoint is not required before this callsite in the caller function. More...
 
static Instruction * findLocationForEntrySafepoint (Function &F, DominatorTree &DT)
 
static bool isGCSafepointPoll (Function &F)
 
static bool shouldRewriteFunction (Function &F)
 Returns true if this function should be rewritten to include safepoint polls and parseable call sites. More...
 
static bool enableEntrySafepoints (Function &F)
 
static bool enableBackedgeSafepoints (Function &F)
 
static bool enableCallSafepoints (Function &F)
 
 INITIALIZE_PASS_BEGIN (PlaceBackedgeSafepointsImpl, "place-backedge-safepoints-impl", "Place Backedge Safepoints", false, false) INITIALIZE_PASS_END(PlaceBackedgeSafepointsImpl
 
place backedge safepoints Place Backedge false INITIALIZE_PASS_BEGIN (PlaceSafepoints, "place-safepoints", "Place Safepoints", false, false) INITIALIZE_PASS_END(PlaceSafepoints
 

Variables

static cl::opt< bool > AllBackedges ("spp-all-backedges", cl::Hidden, cl::init(false))
 
static cl::opt< int > CountedLoopTripWidth ("spp-counted-loop-trip-width", cl::Hidden, cl::init(32))
 How narrow does the trip count of a loop have to be to have to be considered "counted"? Counted loops do not get safepoints at backedges. More...
 
static cl::opt< bool > SplitBackedge ("spp-split-backedge", cl::Hidden, cl::init(false))
 
static cl::opt< bool > NoEntry ("spp-no-entry", cl::Hidden, cl::init(false))
 
static cl::opt< bool > NoCall ("spp-no-call", cl::Hidden, cl::init(false))
 
static cl::opt< bool > NoBackedge ("spp-no-backedge", cl::Hidden, cl::init(false))
 
static const char *const GCSafepointPollName = "gc.safepoint_poll"
 
place backedge safepoints impl
 
place backedge safepoints Place Backedge Safepoints
 
place backedge safepoints Place Backedge false
 
place backedge safepoints Place Backedge false place safepoints
 

Macro Definition Documentation

◆ DEBUG_TYPE

#define DEBUG_TYPE   "safepoint-placement"

Definition at line 68 of file PlaceSafepoints.cpp.

Function Documentation

◆ containsUnconditionalCallSafepoint()

static bool containsUnconditionalCallSafepoint ( Loop *  L,
BasicBlock *  Header,
BasicBlock *  Pred,
DominatorTree &  DT,
const TargetLibraryInfo &  TLI 
)
static

Returns true if this loop is known to contain a call safepoint which must unconditionally execute on any iteration of the loop which returns to the loop header via an edge from Pred.

Returns a conservative correct answer; i.e. false is always valid.

Definition at line 198 of file PlaceSafepoints.cpp.

References assert(), llvm::DominatorTree::dominates(), llvm::DomTreeNodeBase< NodeT >::getBlock(), llvm::DomTreeNodeBase< NodeT >::getIDom(), llvm::DominatorTreeBase< NodeT, IsPostDom >::getNode(), I, and needsStatepoint().

◆ doesNotRequireEntrySafepointBefore()

static bool doesNotRequireEntrySafepointBefore ( CallBase *  Call)
static

Returns true if an entry safepoint is not required before this callsite in the caller function.

Definition at line 360 of file PlaceSafepoints.cpp.

Referenced by findLocationForEntrySafepoint().

◆ enableBackedgeSafepoints()

static bool enableBackedgeSafepoints ( Function &  F)
static

Definition at line 460 of file PlaceSafepoints.cpp.

References NoBackedge.

Referenced by enableCallSafepoints().

◆ enableCallSafepoints()

static bool enableCallSafepoints ( Function &  F)
static

Definition at line 461 of file PlaceSafepoints.cpp.

References assert(), llvm::DominatorTree::dominates(), llvm::SetVector< T, Vector, Set >::empty(), llvm::Function::empty(), enableBackedgeSafepoints(), enableEntrySafepoints(), F(), findLocationForEntrySafepoint(), llvm::Value::getName(), llvm::Instruction::getParent(), llvm::BasicBlock::getParent(), llvm::GlobalValue::getParent(), llvm::BasicBlock::getTerminator(), llvm::SetVector< T, Vector, Set >::insert(), InsertSafepointPoll(), llvm::GlobalValue::isDeclaration(), isGCSafepointPoll(), Modified, NoCall, llvm::SmallVectorTemplateBase< T >::push_back(), llvm::DominatorTreeBase< NodeT, IsPostDom >::recalculate(), llvm::removeUnreachableBlocks(), runOnFunction(), shouldRewriteFunction(), llvm::sort(), SplitBackedge, and llvm::SplitEdge().

◆ enableEntrySafepoints()

static bool enableEntrySafepoints ( Function &  F)
static

Definition at line 459 of file PlaceSafepoints.cpp.

References NoEntry.

Referenced by enableCallSafepoints().

◆ findLocationForEntrySafepoint()

static Instruction* findLocationForEntrySafepoint ( Function &  F,
DominatorTree &  DT 
)
static

Definition at line 383 of file PlaceSafepoints.cpp.

References assert(), doesNotRequireEntrySafepointBefore(), llvm::BasicBlock::front(), llvm::Function::getEntryBlock(), llvm::BasicBlock::getUniquePredecessor(), I, and llvm::Instruction::isTerminator().

Referenced by enableCallSafepoints().

◆ INITIALIZE_PASS_BEGIN() [1/2]

INITIALIZE_PASS_BEGIN ( PlaceBackedgeSafepointsImpl  ,
"place-backedge-safepoints-impl"  ,
"Place Backedge Safepoints"  ,
false  ,
false   
)

Referenced by llvm::createPlaceSafepointsPass().

◆ INITIALIZE_PASS_BEGIN() [2/2]

place backedge safepoints Place Backedge false INITIALIZE_PASS_BEGIN ( PlaceSafepoints  ,
"place-safepoints"  ,
"Place Safepoints"  ,
false  ,
false   
)

◆ InsertSafepointPoll()

place backedge safepoints Place Backedge false place Place static false void InsertSafepointPoll ( Instruction *  InsertBefore,
std::vector< CallBase *> &  ParsePointsNeeded,
const TargetLibraryInfo &  TLI 
)
static

Definition at line 620 of file PlaceSafepoints.cpp.

References assert(), llvm::BasicBlock::begin(), llvm::CallInst::Create(), llvm::Function::empty(), llvm::BasicBlock::end(), llvm::FunctionType::get(), llvm::Module::getContext(), llvm::Module::getFunction(), llvm::BasicBlock::getParent(), llvm::GlobalValue::getValueType(), llvm::Type::getVoidTy(), and llvm::InlineFunction().

Referenced by enableCallSafepoints().

◆ isGCSafepointPoll()

static bool isGCSafepointPoll ( Function &  F)
static

Definition at line 438 of file PlaceSafepoints.cpp.

References llvm::StringRef::equals(), and llvm::Value::getName().

Referenced by enableCallSafepoints().

◆ mustBeFiniteCountedLoop()

static bool mustBeFiniteCountedLoop ( Loop *  L,
ScalarEvolution *  SE,
BasicBlock *  Pred 
)
static

Returns true if this loop is known to terminate in a finite number of iterations.

Note that this function may return false for a loop which does actual terminate in a finite constant number of iterations due to conservatism in the analysis.

Definition at line 240 of file PlaceSafepoints.cpp.

References CountedLoopTripWidth, llvm::ScalarEvolution::getConstantMaxBackedgeTakenCount(), llvm::ScalarEvolution::getCouldNotCompute(), llvm::ScalarEvolution::getExitCount(), llvm::ConstantRange::getUnsignedMax(), llvm::ScalarEvolution::getUnsignedRange(), llvm::APInt::isIntN(), and llvm::LoopBase< BlockT, LoopT >::isLoopExiting().

◆ needsStatepoint()

static bool needsStatepoint ( CallBase *  Call,
const TargetLibraryInfo &  TLI 
)
static

Definition at line 183 of file PlaceSafepoints.cpp.

References llvm::callsGCLeafFunction(), llvm::isGCRelocate(), llvm::isGCResult(), and llvm::isStatepoint().

Referenced by containsUnconditionalCallSafepoint().

◆ scanInlinedCode()

static void scanInlinedCode ( Instruction *  Start,
Instruction *  End,
std::vector< CallInst *> &  Calls,
DenseSet< BasicBlock *> &  Seen 
)
static

Definition at line 292 of file PlaceSafepoints.cpp.

◆ scanOneBB()

static void scanOneBB ( Instruction *  Start,
Instruction *  End,
std::vector< CallInst *> &  Calls,
DenseSet< BasicBlock *> &  Seen,
std::vector< BasicBlock *> &  Worklist 
)
static

Definition at line 265 of file PlaceSafepoints.cpp.

◆ shouldRewriteFunction()

static bool shouldRewriteFunction ( Function &  F)
static

Returns true if this function should be rewritten to include safepoint polls and parseable call sites.

The main point of this function is to be an extension point for custom logic.

Definition at line 445 of file PlaceSafepoints.cpp.

References llvm::Function::getGC(), and llvm::Function::hasGC().

Referenced by enableCallSafepoints().

◆ STATISTIC() [1/4]

STATISTIC ( NumEntrySafepoints  ,
"Number of entry safepoints inserted"   
)

◆ STATISTIC() [2/4]

STATISTIC ( NumBackedgeSafepoints  ,
"Number of backedge safepoints inserted"   
)

◆ STATISTIC() [3/4]

STATISTIC ( CallInLoop  ,
"Number of loops without safepoints due to calls in loop"   
)

◆ STATISTIC() [4/4]

STATISTIC ( FiniteExecution  ,
"Number of loops without safepoints finite execution"   
)

Variable Documentation

◆ AllBackedges

cl::opt<bool> AllBackedges("spp-all-backedges", cl::Hidden, cl::init(false))
static

◆ CountedLoopTripWidth

cl::opt<int> CountedLoopTripWidth("spp-counted-loop-trip-width", cl::Hidden, cl::init(32))
static

How narrow does the trip count of a loop have to be to have to be considered "counted"? Counted loops do not get safepoints at backedges.

Referenced by mustBeFiniteCountedLoop().

◆ false

place backedge safepoints Place Backedge false place Place false

Definition at line 611 of file PlaceSafepoints.cpp.

◆ GCSafepointPollName

const char* const GCSafepointPollName = "gc.safepoint_poll"
static

Definition at line 436 of file PlaceSafepoints.cpp.

◆ impl

place backedge safepoints impl

Definition at line 611 of file PlaceSafepoints.cpp.

Referenced by llvm::orc::LLJITBuilderSetters< LLLazyJIT, LLLazyJITBuilder, LLLazyJITBuilderState >::getJITTargetMachineBuilder(), llvm::jitlink::JITLinker< MachOJITLinker_x86_64 >::link(), llvm::orc::LLJITBuilderSetters< LLLazyJIT, LLLazyJITBuilder, LLLazyJITBuilderState >::setCompileFunctionCreator(), llvm::orc::LLLazyJITBuilderSetters< LLLazyJIT, LLLazyJITBuilder, LLLazyJITBuilderState >::setIndirectStubsManagerBuilder(), llvm::orc::LLJITBuilderSetters< LLLazyJIT, LLLazyJITBuilder, LLLazyJITBuilderState >::setJITTargetMachineBuilder(), llvm::orc::LLLazyJITBuilderSetters< LLLazyJIT, LLLazyJITBuilder, LLLazyJITBuilderState >::setLazyCallthroughManager(), llvm::orc::LLLazyJITBuilderSetters< LLLazyJIT, LLLazyJITBuilder, LLLazyJITBuilderState >::setLazyCompileFailureAddr(), llvm::orc::LLJITBuilderSetters< LLLazyJIT, LLLazyJITBuilder, LLLazyJITBuilderState >::setNumCompileThreads(), and llvm::orc::LLJITBuilderSetters< LLLazyJIT, LLLazyJITBuilder, LLLazyJITBuilderState >::setObjectLinkingLayerCreator().

◆ NoBackedge

cl::opt<bool> NoBackedge("spp-no-backedge", cl::Hidden, cl::init(false))
static

Referenced by enableBackedgeSafepoints().

◆ NoCall

cl::opt<bool> NoCall("spp-no-call", cl::Hidden, cl::init(false))
static

Referenced by enableCallSafepoints().

◆ NoEntry

cl::opt<bool> NoEntry("spp-no-entry", cl::Hidden, cl::init(false))
static

Referenced by llvm::DbgValueHistoryMap::dump(), and enableEntrySafepoints().

◆ Safepoints

place backedge safepoints Place Backedge false place Place Safepoints

Definition at line 611 of file PlaceSafepoints.cpp.

◆ safepoints

place backedge safepoints Place Backedge false place safepoints

Definition at line 616 of file PlaceSafepoints.cpp.

◆ SplitBackedge

cl::opt<bool> SplitBackedge("spp-split-backedge", cl::Hidden, cl::init(false))
static

Referenced by enableCallSafepoints().

Generated on Mon Nov 4 2019 00:43:18 for LLVM by   doxygen 1.8.13