Searched refs:CallGraphSCC (Results 1 - 13 of 13) sorted by relevance
/freebsd-10.2-release/contrib/llvm/include/llvm/Analysis/ |
H A D | CallGraphSCCPass.h | 32 class CallGraphSCC; 59 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 | 113 bool runOnSCC(CallGraphSCC &SCC);
|
/freebsd-10.2-release/contrib/llvm/tools/opt/ |
H A D | PrintSCC.cpp | 49 struct CallGraphSCC : public ModulePass { struct in namespace:__anon3844 51 CallGraphSCC() : ModulePass(ID) {} function in struct:__anon3844::CallGraphSCC 70 char CallGraphSCC::ID = 0; 71 static RegisterPass<CallGraphSCC> 94 bool CallGraphSCC::runOnModule(Module &M) {
|
H A D | opt.cpp | 190 virtual bool runOnSCC(CallGraphSCC &SCC) { 195 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) {
|
/freebsd-10.2-release/contrib/llvm/lib/Transforms/IPO/ |
H A D | InlineSimple.cpp | 55 virtual bool runOnSCC(CallGraphSCC &SCC); 75 bool SimpleInliner::runOnSCC(CallGraphSCC &SCC) {
|
H A D | InlineAlways.cpp | 53 virtual bool runOnSCC(CallGraphSCC &SCC); 104 bool AlwaysInliner::runOnSCC(CallGraphSCC &SCC) {
|
H A D | PruneEH.cpp | 44 bool runOnSCC(CallGraphSCC &SCC); 61 bool PruneEH::runOnSCC(CallGraphSCC &SCC) { 68 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) 73 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) 85 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); 139 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { 158 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) {
|
H A D | FunctionAttrs.cpp | 54 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) { 154 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) 160 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { 263 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { 501 bool FunctionAttrs::AddArgumentAttrs(const CallGraphSCC [all...] |
H A D | Inliner.cpp | 397 bool Inliner::runOnSCC(CallGraphSCC &SCC) { 404 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { 421 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) {
|
H A D | ArgumentPromotion.cpp | 66 virtual bool runOnSCC(CallGraphSCC &SCC); 99 bool ArgPromotion::runOnSCC(CallGraphSCC &SCC) { 105 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) {
|
/freebsd-10.2-release/contrib/llvm/lib/Analysis/IPA/ |
H A D | CallGraphSCCPass.cpp | 94 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, 143 for (CallGraphSCC::iterator I = CurSCC.begin(), E = CurSCC.end(); 166 /// CallGraphSCC passes to verify that they correctly updated the callgraph. 173 bool CGPassManager::RefreshCallGraph(CallGraphSCC &CurSCC, 179 for (CallGraphSCC::iterator I = CurSCC.begin(), E = CurSCC.end(); 189 for (CallGraphSCC::iterator SCCIdx = CurSCC.begin(), E = CurSCC.end(); 348 for (CallGraphSCC [all...] |
H A D | InlineCost.cpp | 1203 bool InlineCostAnalysis::runOnSCC(CallGraphSCC &SCC) {
|
/freebsd-10.2-release/contrib/llvm/include/llvm/Transforms/IPO/ |
H A D | InlinerPass.h | 43 virtual bool runOnSCC(CallGraphSCC &SCC);
|
Completed in 101 milliseconds