Lines Matching refs:CallGraph
21 #include "llvm/Analysis/CallGraph.h"
60 bool doInitialization(CallGraph &CG);
61 bool doFinalization(CallGraph &CG);
65 // CGPassManager walks SCC and it needs CallGraph.
71 return "CallGraph Pass Manager";
97 bool RunAllPassesOnSCC(CallGraphSCC &CurSCC, CallGraph &CG,
101 CallGraph &CG, bool &CallGraphUpToDate,
103 bool RefreshCallGraph(CallGraphSCC &CurSCC, CallGraph &CG,
113 CallGraph &CG, bool &CallGraphUpToDate,
131 // RefreshCallGraph to verify that the callgraph was correctly updated.
158 // callgraph.
169 /// callgraph with the call sites found in it. This is used after
170 /// FunctionPasses have potentially munged the callgraph, and can be used after
171 /// CallGraphSCC passes to verify that they correctly updated the callgraph.
179 CallGraph &CG, bool CheckingMode) {
226 "CallGraphSCCPass did not update the CallGraph correctly!");
272 // If this call site already existed in the callgraph, just verify it
287 // the callgraph. If this is a case where we can infer that the
288 // callgraph is less precise than it could be (e.g. an indirect call
296 "CallGraphSCCPass did not update the CallGraph correctly!");
321 "CallGraphSCCPass did not update the CallGraph correctly!");
337 // We scanned the old callgraph node, removing invalidated call sites and
381 bool CGPassManager::RunAllPassesOnSCC(CallGraphSCC &CurSCC, CallGraph &CG,
385 // Keep track of whether the callgraph is known to be up-to-date or not.
388 // random function passes are not CallGraph aware, they may clobber the
391 // the callgraph when we need to run a CGSCCPass again.
432 // If the callgraph was left out of date (because the last pass run was a
442 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph();
445 // Walk the callgraph in bottom-up SCC order.
446 scc_iterator<CallGraph*> CGI = scc_begin(&CG);
492 bool CGPassManager::doInitialization(CallGraph &CG) {
507 bool CGPassManager::doFinalization(CallGraph &CG) {
538 scc_iterator<CallGraph*> *CGI = (scc_iterator<CallGraph*>*)Context;
