Home
last modified time | relevance | path

Searched refs:CallGraphSCC (Results 1 – 13 of 13) sorted by relevance

/freebsd-9-stable/contrib/llvm/lib/Analysis/IPA/
DCallGraphSCCPass.cpp94 bool RunAllPassesOnSCC(CallGraphSCC &CurSCC, CallGraph &CG,
97 bool RunPassOnSCC(Pass *P, CallGraphSCC &CurSCC,
100 bool RefreshCallGraph(CallGraphSCC &CurSCC, CallGraph &CG,
109 bool CGPassManager::RunPassOnSCC(Pass *P, CallGraphSCC &CurSCC, in RunPassOnSCC()
143 for (CallGraphSCC::iterator I = CurSCC.begin(), E = CurSCC.end(); in RunPassOnSCC()
173 bool CGPassManager::RefreshCallGraph(CallGraphSCC &CurSCC, in RefreshCallGraph()
179 for (CallGraphSCC::iterator I = CurSCC.begin(), E = CurSCC.end(); in RefreshCallGraph()
189 for (CallGraphSCC::iterator SCCIdx = CurSCC.begin(), E = CurSCC.end(); in RefreshCallGraph()
348 for (CallGraphSCC::iterator I = CurSCC.begin(), E = CurSCC.end(); in RefreshCallGraph()
366 bool CGPassManager::RunAllPassesOnSCC(CallGraphSCC &CurSCC, CallGraph &CG, in RunAllPassesOnSCC()
[all …]
DInlineCost.cpp1203 bool InlineCostAnalysis::runOnSCC(CallGraphSCC &SCC) { in runOnSCC()
/freebsd-9-stable/contrib/llvm/tools/opt/
DPrintSCC.cpp49 struct CallGraphSCC : public ModulePass { struct
51 CallGraphSCC() : ModulePass(ID) {} in CallGraphSCC() function
70 char CallGraphSCC::ID = 0;
71 static RegisterPass<CallGraphSCC>
94 bool CallGraphSCC::runOnModule(Module &M) { in runOnModule()
Dopt.cpp190 virtual bool runOnSCC(CallGraphSCC &SCC) { in runOnSCC()
195 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in runOnSCC()
/freebsd-9-stable/contrib/llvm/include/llvm/Analysis/
DCallGraphSCCPass.h32 class CallGraphSCC; variable
59 virtual bool runOnSCC(CallGraphSCC &SCC) = 0;
83 class CallGraphSCC {
87 CallGraphSCC(void *context) : Context(context) {} in CallGraphSCC() function
DInlineCost.h113 bool runOnSCC(CallGraphSCC &SCC);
/freebsd-9-stable/contrib/llvm/lib/Transforms/IPO/
DPruneEH.cpp44 bool runOnSCC(CallGraphSCC &SCC);
61 bool PruneEH::runOnSCC(CallGraphSCC &SCC) { in runOnSCC()
68 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) in runOnSCC()
73 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) in runOnSCC()
85 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); in runOnSCC()
139 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in runOnSCC()
158 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in runOnSCC()
DFunctionAttrs.cpp54 bool runOnSCC(CallGraphSCC &SCC);
57 bool AddReadAttrs(const CallGraphSCC &SCC);
60 bool AddArgumentAttrs(const CallGraphSCC &SCC);
67 bool AddNoAliasAttrs(const CallGraphSCC &SCC);
121 bool annotateLibraryCalls(const CallGraphSCC &SCC);
149 bool FunctionAttrs::AddReadAttrs(const CallGraphSCC &SCC) { in AddReadAttrs()
154 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) in AddReadAttrs()
160 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in AddReadAttrs()
263 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in AddReadAttrs()
501 bool FunctionAttrs::AddArgumentAttrs(const CallGraphSCC &SCC) { in AddArgumentAttrs()
[all …]
DInlineSimple.cpp55 virtual bool runOnSCC(CallGraphSCC &SCC);
75 bool SimpleInliner::runOnSCC(CallGraphSCC &SCC) { in runOnSCC()
DInlineAlways.cpp53 virtual bool runOnSCC(CallGraphSCC &SCC);
104 bool AlwaysInliner::runOnSCC(CallGraphSCC &SCC) { in runOnSCC()
DInliner.cpp397 bool Inliner::runOnSCC(CallGraphSCC &SCC) { in runOnSCC()
404 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in runOnSCC()
421 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in runOnSCC()
DArgumentPromotion.cpp66 virtual bool runOnSCC(CallGraphSCC &SCC);
99 bool ArgPromotion::runOnSCC(CallGraphSCC &SCC) { in runOnSCC()
105 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in runOnSCC()
/freebsd-9-stable/contrib/llvm/include/llvm/Transforms/IPO/
DInlinerPass.h43 virtual bool runOnSCC(CallGraphSCC &SCC);