Go to the documentation of this file.
43 #define DEBUG_TYPE "cgscc-passmgr"
50 STATISTIC(MaxSCCIterations,
"Maximum CGSCCPassMgr iterations on one SCC");
67 bool runOnModule(
Module &M)
override;
79 Info.setPreservesAll();
82 StringRef getPassName()
const override {
return "CallGraph Pass Manager"; }
85 Pass *getAsPass()
override {
return this; }
88 void dumpPassStructure(
unsigned Offset)
override {
92 P->dumpPassStructure(
Offset + 1);
97 Pass *getContainedPass(
unsigned N) {
98 assert(
N < PassVector.size() &&
"Pass number out of range!");
99 return static_cast<Pass *
>(PassVector[
N]);
108 bool &DevirtualizedCall);
112 bool &DevirtualizedCall);
114 bool IsCheckingMode);
123 bool &DevirtualizedCall) {
124 bool Changed =
false;
130 if (!CallGraphUpToDate) {
131 DevirtualizedCall |= RefreshCallGraph(CurSCC, CG,
false);
132 CallGraphUpToDate =
true;
138 bool EmitICRemark =
M.shouldEmitInstrCountChangedRemark();
141 InstrCount = initSizeRemarkInfo(M, FunctionToInstrCount);
146 SCCCount =
M.getInstructionCount();
151 static_cast<int64_t
>(SCCCount) -
static_cast<int64_t
>(
InstrCount);
152 emitInstrCountChangedRemark(
P, M, Delta,
InstrCount,
153 FunctionToInstrCount);
163 RefreshCallGraph(CurSCC, CG,
true);
170 "Invalid CGPassManager member");
181 F->getContext().yield();
187 if (Changed && CallGraphUpToDate) {
188 LLVM_DEBUG(
dbgs() <<
"CGSCCPASSMGR: Pass Dirtied SCC: " <<
P->getPassName()
190 CallGraphUpToDate =
false;
211 : CurSCC) CGN->
dump(););
213 bool MadeChange =
false;
214 bool DevirtualizedCall =
false;
217 unsigned FunctionNo = 0;
219 SCCIdx !=
E; ++SCCIdx, ++FunctionNo) {
222 if (!
F ||
F->isDeclaration())
continue;
229 unsigned NumDirectRemoved = 0, NumIndirectRemoved = 0;
236 bool WasLast =
I + 1 == CGNEnd;
258 if (RemoveAndCheckForDone(
I))
265 auto *
Call = dyn_cast_or_null<CallBase>(*
I->first);
272 "CallGraphSCCPass did not update the CallGraph correctly!");
275 if (!
I->second->getFunction())
276 ++NumIndirectRemoved;
280 if (RemoveAndCheckForDone(
I))
285 assert(!Calls.
count(Call) &&
"Call site occurs in node multiple times");
290 if (!Callee || !(
Callee->isIntrinsic()))
291 Calls.
insert(std::make_pair(Call,
I->second));
298 unsigned NumDirectAdded = 0, NumIndirectAdded = 0;
302 auto *
Call = dyn_cast<CallBase>(&
I);
306 if (Callee &&
Callee->isIntrinsic())
322 if (ExistingIt != Calls.
end()) {
326 Calls.
erase(ExistingIt);
337 if (CheckingMode &&
Call->getCalledFunction() &&
342 "CallGraphSCCPass did not update the CallGraph correctly!");
352 DevirtualizedCall =
true;
354 <<
Callee->getName() <<
"'\n");
367 "CallGraphSCCPass did not update the CallGraph correctly!");
393 if (NumIndirectRemoved > NumIndirectAdded &&
394 NumDirectRemoved < NumDirectAdded)
395 DevirtualizedCall =
true;
401 assert(Calls.
empty() &&
"Dangling pointers found in call sites map");
405 if ((FunctionNo & 15) == 15)
410 dbgs() <<
"CGSCCPASSMGR: Refreshed SCC is now:\n";
413 if (DevirtualizedCall)
414 dbgs() <<
"CGSCCPASSMGR: Refresh devirtualized a call!\n";
416 dbgs() <<
"CGSCCPASSMGR: SCC Refresh didn't change call graph.\n";
420 return DevirtualizedCall;
427 bool &DevirtualizedCall) {
428 bool Changed =
false;
437 bool CallGraphUpToDate =
true;
440 for (
unsigned PassNo = 0,
e = getNumContainedPasses();
441 PassNo !=
e; ++PassNo) {
442 Pass *
P = getContainedPass(PassNo);
446 if (isPassDebuggingExecutionsOrMore()) {
447 std::string Functions;
461 initializeAnalysisImpl(
P);
463 #ifdef EXPENSIVE_CHECKS
469 RunPassOnSCC(
P, CurSCC, CG, CallGraphUpToDate, DevirtualizedCall);
471 Changed |= LocalChanged;
473 #ifdef EXPENSIVE_CHECKS
474 if (!LocalChanged && (RefHash !=
P->structuralHash(CG.
getModule()))) {
475 llvm::errs() <<
"Pass modifies its input and doesn't report it: "
476 <<
P->getPassName() <<
"\n";
484 verifyPreservedAnalysis(
P);
486 removeNotPreservedAnalysis(
P);
487 recordAvailableAnalysis(
P);
493 if (!CallGraphUpToDate)
494 DevirtualizedCall |= RefreshCallGraph(CurSCC, CG,
false);
500 bool CGPassManager::runOnModule(
Module &M) {
501 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph();
502 bool Changed = doInitialization(CG);
511 const std::vector<CallGraphNode *> &NodeVec = *CGI;
512 CurSCC.initialize(NodeVec);
527 unsigned Iteration = 0;
528 bool DevirtualizedCall =
false;
531 <<
" SCCPASSMGR: Re-visiting SCC, iteration #" << Iteration
533 DevirtualizedCall =
false;
534 Changed |= RunAllPassesOnSCC(CurSCC, CG, DevirtualizedCall);
537 if (DevirtualizedCall)
540 <<
" times, due to -max-devirt-iterations\n");
542 MaxSCCIterations.updateMax(Iteration);
544 Changed |= doFinalization(CG);
549 bool CGPassManager::doInitialization(
CallGraph &CG) {
550 bool Changed =
false;
551 for (
unsigned i = 0,
e = getNumContainedPasses();
i !=
e; ++
i) {
552 if (
PMDataManager *PM = getContainedPass(
i)->getAsPMDataManager()) {
554 "Invalid CGPassManager member");
564 bool CGPassManager::doFinalization(
CallGraph &CG) {
565 bool Changed =
false;
566 for (
unsigned i = 0,
e = getNumContainedPasses();
i !=
e; ++
i) {
567 if (
PMDataManager *PM = getContainedPass(
i)->getAsPMDataManager()) {
569 "Invalid CGPassManager member");
585 assert(Old != New &&
"Should not replace node with self");
586 for (
unsigned i = 0; ; ++
i) {
587 assert(
i != Nodes.size() &&
"Node not in SCC");
588 if (Nodes[
i] != Old)
continue;
592 Nodes.erase(Nodes.begin() +
i);
614 while (!PMS.
empty() &&
618 assert(!PMS.
empty() &&
"Unable to handle Call Graph Pass");
622 CGP = (CGPassManager*)PMS.
top();
625 assert(!PMS.
empty() &&
"Unable to create Call Graph Pass Manager");
629 CGP =
new CGPassManager();
670 PrintCallGraphPass(
const std::string &
B,
raw_ostream &OS)
678 bool BannerPrinted =
false;
679 auto PrintBannerOnce = [&]() {
683 BannerPrinted =
true;
690 SCC.getCallGraph().getModule().print(OS,
nullptr);
693 bool FoundFunction =
false;
697 FoundFunction =
true;
705 OS <<
"\nPrinting <null> Function\n";
708 if (NeedModule && FoundFunction) {
711 SCC.getCallGraph().getModule().print(OS,
nullptr);
716 StringRef getPassName()
const override {
return "Print CallGraph IR"; }
724 const std::string &Banner)
const {
725 return new PrintCallGraphPass(Banner, OS);
729 std::string Desc =
"SCC (";
735 Desc +=
F->getName();
737 Desc +=
"<<null function>>";
745 SCC.getCallGraph().getModule().getContext().getOptPassGate();
This is an optimization pass for GlobalISel generic memory operations.
bool runOnFunction(Function &F)
run - Execute all of the passes scheduled for execution.
We currently emits eax Perhaps this is what we really should generate is Is imull three or four cycles eax eax The current instruction priority is based on pattern complexity The former is more complex because it folds a load so the latter will not be emitted Perhaps we should use AddedComplexity to give LEA32r a higher priority We should always try to match LEA first since the LEA matching code does some estimate to determine whether the match is profitable if we care more about code then imull is better It s two bytes shorter than movl leal On a Pentium M
std::vector< CallRecord >::iterator iterator
@ PMT_CallGraphPassManager
CGPassManager.
ModulePass class - This class is used to implement unstructured interprocedural optimizations and ana...
This currently compiles esp xmm0 movsd esp eax eax esp ret We should use not the dag combiner This is because dagcombine2 needs to be able to see through the X86ISD::Wrapper which DAGCombine can t really do The code for turning x load into a single vector load is target independent and should be moved to the dag combiner The code for turning x load into a vector load can only handle a direct load from a global or a direct load from the stack It should be generalized to handle any load from P
void schedulePass(Pass *P)
Schedule pass P for execution.
A raw_ostream that writes to an std::string.
virtual bool isEnabled() const
isEnabled() should return true before calling shouldRunPass().
The basic data container for the call graph of a Module of IR.
bool erase(const KeyT &Val)
PassManagerType
Different types of internal pass managers.
static unsigned InstrCount
size_type count(const_arg_type_t< KeyT > Val) const
Return 1 if the specified key is in the map, 0 otherwise.
void push(PMDataManager *PM)
raw_fd_ostream & errs()
This returns a reference to a raw_ostream for standard error.
void removeCallEdge(iterator I)
void ReplaceNode(NodeRef Old, NodeRef New)
This informs the scc_iterator that the specified Old node has been deleted, and New is to be used in ...
void addCalledFunction(CallBase *Call, CallGraphNode *M)
Adds a function to the list of functions called by this one.
LLVM Basic Block Representation.
raw_ostream & dbgs()
dbgs() - This returns a reference to a raw_ostream for debugging messages.
CallGraphNode * getOrInsertFunction(const Function *F)
Similar to operator[], but this will insert a new CallGraphNode for F if one does not already exist.
PMDataManager provides the common place to manage the analysis data used by pass managers.
CallGraphSCC - This is a single SCC that a CallGraphSCCPass is run on.
The TimeRegion class is used as a helper class to call the startTimer() and stopTimer() methods of th...
static GCRegistry::Add< CoreCLRGC > E("coreclr", "CoreCLR-compatible GC")
void dump() const
Print out this call graph node.
#define INITIALIZE_PASS(passName, arg, name, cfg, analysis)
Extensions to this class implement mechanisms to disable passes and individual optimizations at compi...
Represent the analysis usage information of a pass.
void ReplaceNode(CallGraphNode *Old, CallGraphNode *New)
ReplaceNode - This informs the SCC and the pass manager that the specified Old node has been deleted,...
static GCRegistry::Add< OcamlGC > B("ocaml", "ocaml 3.10-compatible GC")
bool skipSCC(CallGraphSCC &SCC) const
Optional passes call this function to check whether the pass should be skipped.
STATISTIC(NumFunctions, "Total number of functions")
This class implements an extremely fast bulk output stream that can only output to a stream.
A node in the call graph for a module.
Analysis containing CSE Info
PMDataManager * top() const
unsigned ID
LLVM IR allows to use arbitrary numbers as calling convention identifiers.
StringMap - This is an unconventional map that is specialized for handling keys that are "strings",...
scc_iterator< T > scc_begin(const T &G)
Construct the begin iterator for a deduced graph type T.
std::vector< CallGraphNode * >::const_iterator iterator
PMTopLevelManager * getTopLevelManager()
void getAnalysisUsage(AnalysisUsage &Info) const override
getAnalysisUsage - For this class, we declare that we require and preserve the call graph.
void DeleteNode(CallGraphNode *Old)
DeleteNode - This informs the SCC and the pass manager that the specified Old node has been deleted.
Enumerate the SCCs of a directed graph in reverse topological order of the SCC DAG.
The ModulePass which wraps up a CallGraph and the logic to build it.
Pass * createPrinterPass(raw_ostream &OS, const std::string &Banner) const override
createPrinterPass - Get a pass that prints the Module corresponding to a CallGraph.
Timer * getPassTimer(Pass *)
Request the timer for this legacy-pass-manager's pass instance.
initializer< Ty > init(const Ty &Val)
bool isFunctionInPrintList(StringRef FunctionName)
iterator find(const_arg_type_t< KeyT > Val)
assert(ImpDefSCC.getReg()==AMDGPU::SCC &&ImpDefSCC.isDef())
This pass is required by interprocedural register allocation.
A Module instance is used to store all the information related to an LLVM module.
virtual bool doFinalization(Module &)
doFinalization - Virtual method overriden by subclasses to do any necessary clean up after all passes...
virtual bool shouldRunPass(const StringRef PassName, StringRef IRDescription)
IRDescription is a textual description of the IR unit the pass is running over.
virtual bool doInitialization(Module &)
doInitialization - Virtual method overridden by subclasses to do any necessary initialization before ...
StringRef - Represent a constant reference to a string, i.e.
virtual StringRef getPassName() const
getPassName - Return a nice clean name for a pass.
@ PMT_FunctionPassManager
FPPassManager.
#define llvm_unreachable(msg)
Marks that the current location is not supposed to be reachable.
AnalysisUsage & addPreserved()
Add the specified Pass class to the set of analyses preserved by this pass.
virtual PassManagerType getPassManagerType() const
this could be done in SelectionDAGISel along with other special for
std::pair< iterator, bool > insert(const std::pair< KeyT, ValueT > &KV)
amdgpu Simplify well known AMD library false FunctionCallee Callee
Function * getFunction() const
Returns the function that this call graph node represents.
FPPassManager manages BBPassManagers and FunctionPasses.
PMStack - This class implements a stack data structure of PMDataManager pointers.
static std::string getDescription(const CallGraphSCC &SCC)
void setPreservesAll()
Set by analyses that do not transform their input at all.
void forEachCallbackFunction(const CallBase &CB, UnaryFunction Func)
Apply function Func to each CB's callback function.
void assignPassManager(PMStack &PMS, PassManagerType PMT) override
Assign pass manager to manager this pass.
void addIndirectPassManager(PMDataManager *Manager)
Module & getModule() const
Returns the module the call graph corresponds to.
bool isAtEnd() const
Direct loop termination test which is more efficient than comparison with end().
void print(raw_ostream &OS) const
Pass interface - Implemented by all 'passes'.
raw_ostream & indent(unsigned NumSpaces)
indent - Insert 'NumSpaces' spaces.
bool forcePrintModuleIR()
PMTopLevelManager manages LastUser info and collects common APIs used by top level pass managers.
Common register allocation spilling lr str ldr sxth r3 ldr mla r4 can lr mov lr str ldr sxth r3 mla r4 and then merge mul and lr str ldr sxth r3 mla r4 It also increase the likelihood the store may become dead bb27 Successors according to LLVM BB
AnalysisUsage & addRequired()
CallGraphNode * getCallsExternalNode() const
cl::opt< unsigned > MaxDevirtIterations("max-devirt-iterations", cl::ReallyHidden, cl::init(4))
virtual bool runOnSCC(CallGraphSCC &SCC)=0
runOnSCC - This method should be implemented by the subclass to perform whatever action is necessary ...
void replaceCallEdge(CallBase &Call, CallBase &NewCall, CallGraphNode *NewNode)
Replaces the edge in the node for the specified call site with a new one.