LLVM
14.0.0git

A lazily constructed view of the call graph of a module. More...
#include "llvm/Analysis/LazyCallGraph.h"
Classes  
class  Edge 
A class used to represent edges in the call graph. More...  
class  EdgeSequence 
The edge sequence object. More...  
class  Node 
A node in the call graph. More...  
class  postorder_ref_scc_iterator 
A postorder depthfirst RefSCC iterator over the call graph. More...  
class  RefSCC 
A RefSCC of the call graph. More...  
class  SCC 
An SCC of the call graph. More...  
Public Member Functions  
LazyCallGraph (Module &M, function_ref< TargetLibraryInfo &(Function &)> GetTLI)  
Construct a graph for the given module. More...  
LazyCallGraph (LazyCallGraph &&G)  
LazyCallGraph &  operator= (LazyCallGraph &&RHS) 
bool  invalidate (Module &, const PreservedAnalyses &PA, ModuleAnalysisManager::Invalidator &) 
EdgeSequence::iterator  begin () 
EdgeSequence::iterator  end () 
void  buildRefSCCs () 
postorder_ref_scc_iterator  postorder_ref_scc_begin () 
postorder_ref_scc_iterator  postorder_ref_scc_end () 
iterator_range< postorder_ref_scc_iterator >  postorder_ref_sccs () 
Node *  lookup (const Function &F) const 
Lookup a function in the graph which has already been scanned and added. More...  
SCC *  lookupSCC (Node &N) const 
Lookup a function's SCC in the graph. More...  
RefSCC *  lookupRefSCC (Node &N) const 
Lookup a function's RefSCC in the graph. More...  
Node &  get (Function &F) 
Get a graph node for a given function, scanning it to populate the graph data as necessary. More...  
ArrayRef< Function * >  getLibFunctions () const 
Get the sequence of known and defined library functions. More...  
bool  isLibFunction (Function &F) const 
Test whether a function is a known and defined library function tracked by the call graph. More...  
PreSCC Mutation API  
These methods are only valid to call prior to forming any SCCs for this call graph. They can be used to update the core nodegraph during a nodebased inorder traversal that precedes any SCCbased traversal. Once you begin manipulating a call graph's SCCs, most mutation of the graph must be performed via a RefSCC method. There are some exceptions below.  
void  insertEdge (Node &SourceN, Node &TargetN, Edge::Kind EK) 
Update the call graph after inserting a new edge. More...  
void  insertEdge (Function &Source, Function &Target, Edge::Kind EK) 
Update the call graph after inserting a new edge. More...  
void  removeEdge (Node &SourceN, Node &TargetN) 
Update the call graph after deleting an edge. More...  
void  removeEdge (Function &Source, Function &Target) 
Update the call graph after deleting an edge. More...  
General Mutation API  
There are a very limited set of mutations allowed on the graph as a whole once SCCs have started to be formed. These routines have strict contracts but may be called at any point.  
void  removeDeadFunction (Function &F) 
Remove a dead function from the call graph (typically to delete it). More...  
void  addSplitFunction (Function &OriginalFunction, Function &NewFunction) 
Add a new function split/outlined from an existing function. More...  
void  addSplitRefRecursiveFunctions (Function &OriginalFunction, ArrayRef< Function * > NewFunctions) 
Add new refrecursive functions split/outlined from an existing function. More...  
Static Public Member Functions  
Static helpers for code doing updates to the call graph.  
These helpers are used to implement parts of the call graph but are also useful to code doing updates or otherwise wanting to walk the IR in the same patterns as when we build the call graph.  
static void  visitReferences (SmallVectorImpl< Constant * > &Worklist, SmallPtrSetImpl< Constant * > &Visited, function_ref< void(Function &)> Callback) 
Recursively visits the defined functions whose address is reachable from every constant in the Worklist . More...  
A lazily constructed view of the call graph of a module.
With the edges of this graph, the motivating constraint that we are attempting to maintain is that functionlocal optimization, CGSCClocal optimizations, and optimizations transforming a pair of functions connected by an edge in the graph, do not invalidate a bottomup traversal of the SCC DAG. That is, no optimizations will delete, remove, or add an edge such that functions already visited in a bottomup order of the SCC DAG are no longer valid to have visited, or such that functions not yet visited in a bottomup order of the SCC DAG are not required to have already been visited.
Within this constraint, the desire is to minimize the merge points of the SCC DAG. The greater the fanout of the SCC DAG and the fewer merge points in the SCC DAG, the more independence there is in optimizing within it. There is a strong desire to enable parallelization of optimizations over the call graph, and both limited fanout and merge points will (artificially in some cases) limit the scaling of such an effort.
To this end, graph represents both direct and any potential resolution to an indirect call edge. Another way to think about it is that it represents both the direct call edges and any direct call edges that might be formed through static optimizations. Specifically, it considers taking the address of a function to be an edge in the call graph because this might be forwarded to become a direct call by some subsequent functionlocal optimization. The result is that the graph closely follows the usedef edges for functions. Walking "up" the graph can be done by looking at all of the uses of a function.
The roots of the call graph are the external functions and functions escaped into global variables. Those functions can be called from outside of the module or via unknowable means in the IR – we may not be able to form even a potential call edge from a function body which may dynamically load the function and call it.
This analysis still requires updates to remain valid after optimizations which could potentially change the set of potential callees. The constraints it operates under only make the traversal order remain valid.
The entire analysis must be recomputed if full interprocedural optimizations run at any point. For example, globalopt completely invalidates the information in this analysis.
FIXME: This class is named LazyCallGraph in a lame attempt to distinguish it from the existing CallGraph. At some point, it is expected that this will be the only call graph and it will be renamed accordingly.
Definition at line 113 of file LazyCallGraph.h.
LazyCallGraph::LazyCallGraph  (  Module &  M, 
function_ref< TargetLibraryInfo &(Function &)>  GetTLI  
) 
Construct a graph for the given module.
This sets up the graph and computes all of the entry points of the graph. No function definitions are scanned until their nodes in the graph are requested during traversal.
Definition at line 157 of file LazyCallGraph.cpp.
References addEdge(), llvm::dbgs(), F, get(), llvm::SmallPtrSetImpl< PtrType >::insert(), isKnownLibFunction(), LLVM_DEBUG, M, llvm::LazyCallGraph::Edge::Ref, and visitReferences().
Referenced by llvm::LazyCallGraphAnalysis::run().
LazyCallGraph::LazyCallGraph  (  LazyCallGraph &&  G  ) 
Definition at line 210 of file LazyCallGraph.cpp.
Add a new function split/outlined from an existing function.
The new function may only reference other functions that the original function did.
The original function must reference (either directly or indirectly) the new function.
The new function may also reference the original function. It may end up in a parent SCC in the case that the original function's edge to the new function is a ref edge, and the edge back is a call edge.
Definition at line 1611 of file LazyCallGraph.cpp.
References assert(), llvm::MCID::Call, E, get(), getEdgeKind(), I, lookup(), lookupRefSCC(), lookupSCC(), llvm::make_scope_exit(), and llvm::Check::Size.
Referenced by llvm::CallGraphUpdater::registerOutlinedFunction().
void LazyCallGraph::addSplitRefRecursiveFunctions  (  Function &  OriginalFunction, 
ArrayRef< Function * >  NewFunctions  
) 
Add new refrecursive functions split/outlined from an existing function.
The new functions may only reference other functions that the original function did. The new functions may reference (not call) the original function.
The original function must reference (not call) all new functions. All new functions must reference (not call) each other.
Definition at line 1690 of file LazyCallGraph.cpp.
References assert(), E, llvm::ArrayRef< T >::empty(), get(), getEdgeKind(), I, Index, llvm::LazyCallGraph::Edge::isCall(), llvm::LazyCallGraph::EdgeSequence::lookup(), lookup(), lookupRefSCC(), llvm::make_scope_exit(), llvm::Check::Size, and verify.

inline 
Definition at line 931 of file LazyCallGraph.h.
References llvm::LazyCallGraph::EdgeSequence::begin().
void LazyCallGraph::buildRefSCCs  (  ) 
Definition at line 1926 of file LazyCallGraph.cpp.
References assert(), E, llvm::LazyCallGraph::EdgeSequence::empty(), I, and N.
Referenced by llvm::ModuleToPostOrderCGSCCPassAdaptor::run().

inline 
Definition at line 932 of file LazyCallGraph.h.
References llvm::LazyCallGraph::EdgeSequence::end().
Get a graph node for a given function, scanning it to populate the graph data as necessary.
Definition at line 976 of file LazyCallGraph.h.
Referenced by addSplitFunction(), addSplitRefRecursiveFunctions(), llvm::CallGraphUpdater::finalize(), insertEdge(), LazyCallGraph(), llvm::CallGraphUpdater::reanalyzeFunction(), removeEdge(), llvm::CallGraphUpdater::replaceFunctionWith(), and llvm::CoroSplitPass::run().
Get the sequence of known and defined library functions.
These functions, because they are known to LLVM, can have calls introduced out of thin air from arbitrary IR.
Definition at line 988 of file LazyCallGraph.h.

inline 
Update the call graph after inserting a new edge.
Definition at line 1015 of file LazyCallGraph.h.
References get(), insertEdge(), and llvm::Sched::Source.
void LazyCallGraph::insertEdge  (  Node &  SourceN, 
Node &  TargetN,  
Edge::Kind  EK  
) 
Update the call graph after inserting a new edge.
Definition at line 1487 of file LazyCallGraph.cpp.
References assert().
Referenced by insertEdge().
bool LazyCallGraph::invalidate  (  Module &  , 
const PreservedAnalyses &  PA,  
ModuleAnalysisManager::Invalidator &  
) 
Definition at line 218 of file LazyCallGraph.cpp.
References llvm::PreservedAnalyses::getChecker().

inline 
Test whether a function is a known and defined library function tracked by the call graph.
Because these functions are known to LLVM they are specially modeled in the call graph and even when all IRlevel references have been removed remain active and reachable.
Definition at line 998 of file LazyCallGraph.h.
References F.
Referenced by removeDeadFunction().
Lookup a function in the graph which has already been scanned and added.
Definition at line 955 of file LazyCallGraph.h.
References F.
Referenced by addSplitFunction(), and addSplitRefRecursiveFunctions().
Lookup a function's RefSCC in the graph.
Definition at line 967 of file LazyCallGraph.h.
References lookupSCC(), and N.
Referenced by addSplitFunction(), and addSplitRefRecursiveFunctions().
Lookup a function's SCC in the graph.
Definition at line 961 of file LazyCallGraph.h.
References N.
Referenced by addSplitFunction(), llvm::CallGraphUpdater::finalize(), lookupRefSCC(), llvm::CallGraphUpdater::reanalyzeFunction(), llvm::CoroSplitPass::run(), and llvm::CGSCCToFunctionPassAdaptor::run().
LazyCallGraph & LazyCallGraph::operator=  (  LazyCallGraph &&  RHS  ) 
Definition at line 226 of file LazyCallGraph.cpp.

inline 
Definition at line 936 of file LazyCallGraph.h.
References assert(), and llvm::LazyCallGraph::EdgeSequence::empty().
Referenced by postorder_ref_sccs(), and llvm::ModuleToPostOrderCGSCCPassAdaptor::run().

inline 
Definition at line 942 of file LazyCallGraph.h.
References assert(), and llvm::LazyCallGraph::EdgeSequence::empty().
Referenced by postorder_ref_sccs(), and llvm::ModuleToPostOrderCGSCCPassAdaptor::run().

inline 
Definition at line 950 of file LazyCallGraph.h.
References llvm::make_range(), postorder_ref_scc_begin(), and postorder_ref_scc_end().
void LazyCallGraph::removeDeadFunction  (  Function &  F  ) 
Remove a dead function from the call graph (typically to delete it).
Note that the function must have an empty use list, and the call graph must be uptodate prior to calling this. That means it is by itself in a maximal SCC which is by itself in a maximal RefSCC, etc. No structural changes result from calling this routine other than potentially removing entry points into the call graph.
If SCC formation has begun, this function must not be part of the current DFS in order to call this safely. Typically, the function will have been fully visited by the DFS prior to calling this routine.
Definition at line 1503 of file LazyCallGraph.cpp.
References assert(), F, i, isLibFunction(), N, llvm::Check::Size, and llvm::LazyCallGraph::RefSCC::size().
Referenced by llvm::CallGraphUpdater::finalize().
Update the call graph after deleting an edge.
Definition at line 1023 of file LazyCallGraph.h.
References get(), removeEdge(), and llvm::Sched::Source.
Update the call graph after deleting an edge.
Definition at line 1494 of file LazyCallGraph.cpp.
References assert().
Referenced by removeEdge().

static 
Recursively visits the defined functions whose address is reachable from every constant in the Worklist
.
Doesn't recurse through any constants already in the Visited
set, and updates that set with every constant visited.
For each defined function, calls Callback
with that function.
Definition at line 1964 of file LazyCallGraph.cpp.
References F, llvm::SmallPtrSetImpl< PtrType >::insert(), and llvm::SmallVectorImpl< T >::pop_back_val().
Referenced by getEdgeKind(), and LazyCallGraph().