Searched refs:CallGraphSCC (Results 1 - 14 of 14) sorted by relevance
/external/llvm/include/llvm/Analysis/ |
H A D | CallGraphSCCPass.h | 32 class CallGraphSCC; 60 virtual bool runOnSCC(CallGraphSCC &SCC) = 0; 82 /// CallGraphSCC - This is a single SCC that a CallGraphSCCPass is run on. 83 class CallGraphSCC { class in namespace:llvm 87 CallGraphSCC(void *context) : Context(context) {} function in class:llvm::CallGraphSCC
|
H A D | InlineCost.h | 112 bool runOnSCC(CallGraphSCC &SCC) override;
|
/external/llvm/tools/opt/ |
H A D | PrintSCC.cpp | 49 struct CallGraphSCC : public ModulePass { struct in namespace:__anon26425 51 CallGraphSCC() : ModulePass(ID) {} function in struct:__anon26425::CallGraphSCC 70 char CallGraphSCC::ID = 0; 71 static RegisterPass<CallGraphSCC> 93 bool CallGraphSCC::runOnModule(Module &M) {
|
H A D | PassPrinters.cpp | 72 bool runOnSCC(CallGraphSCC &SCC) override { 77 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) {
|
/external/llvm/lib/Analysis/IPA/ |
H A D | CallGraphSCCPass.cpp | 96 bool RunAllPassesOnSCC(CallGraphSCC &CurSCC, CallGraph &CG, 99 bool RunPassOnSCC(Pass *P, CallGraphSCC &CurSCC, 102 bool RefreshCallGraph(CallGraphSCC &CurSCC, CallGraph &CG, 111 bool CGPassManager::RunPassOnSCC(Pass *P, CallGraphSCC &CurSCC, 145 for (CallGraphSCC::iterator I = CurSCC.begin(), E = CurSCC.end(); 171 /// CallGraphSCC passes to verify that they correctly updated the callgraph. 178 bool CGPassManager::RefreshCallGraph(CallGraphSCC &CurSCC, 184 for (CallGraphSCC::iterator I = CurSCC.begin(), E = CurSCC.end(); 194 for (CallGraphSCC::iterator SCCIdx = CurSCC.begin(), E = CurSCC.end(); 353 for (CallGraphSCC [all...] |
H A D | InlineCost.cpp | 1235 bool InlineCostAnalysis::runOnSCC(CallGraphSCC &SCC) {
|
/external/llvm/lib/Transforms/IPO/ |
H A D | InlineAlways.cpp | 55 bool runOnSCC(CallGraphSCC &SCC) override; 105 bool AlwaysInliner::runOnSCC(CallGraphSCC &SCC) {
|
H A D | InlineSimple.cpp | 56 bool runOnSCC(CallGraphSCC &SCC) override; 93 bool SimpleInliner::runOnSCC(CallGraphSCC &SCC) {
|
H A D | PruneEH.cpp | 45 bool runOnSCC(CallGraphSCC &SCC) override; 62 bool PruneEH::runOnSCC(CallGraphSCC &SCC) { 69 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) 74 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) 86 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); 140 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { 159 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) {
|
H A D | FunctionAttrs.cpp | 55 bool runOnSCC(CallGraphSCC &SCC) override; 58 bool AddReadAttrs(const CallGraphSCC &SCC); 61 bool AddArgumentAttrs(const CallGraphSCC &SCC); 68 bool AddNoAliasAttrs(const CallGraphSCC &SCC); 122 bool annotateLibraryCalls(const CallGraphSCC &SCC); 150 bool FunctionAttrs::AddReadAttrs(const CallGraphSCC &SCC) { 155 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) 161 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { 264 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { 519 bool FunctionAttrs::AddArgumentAttrs(const CallGraphSCC [all...] |
H A D | Inliner.cpp | 441 bool Inliner::runOnSCC(CallGraphSCC &SCC) { 449 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { 466 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) {
|
H A D | ArgumentPromotion.cpp | 69 bool runOnSCC(CallGraphSCC &SCC) override; 105 bool ArgPromotion::runOnSCC(CallGraphSCC &SCC) { 114 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) {
|
/external/llvm/include/llvm/Transforms/IPO/ |
H A D | InlinerPass.h | 43 bool runOnSCC(CallGraphSCC &SCC) override;
|
/external/llvm/unittests/IR/ |
H A D | LegacyPassManagerTest.cpp | 178 virtual bool runOnSCC(CallGraphSCC &SCMM) {
|
Completed in 1624 milliseconds