| /external/swiftshader/third_party/LLVM/lib/Transforms/IPO/ |
| D | FunctionAttrs.cpp | 49 bool runOnSCC(CallGraphSCC &SCC);
52 bool AddReadAttrs(const CallGraphSCC &SCC);
55 bool AddNoCaptureAttrs(const CallGraphSCC &SCC);
62 bool AddNoAliasAttrs(const CallGraphSCC &SCC);
86 bool FunctionAttrs::AddReadAttrs(const CallGraphSCC &SCC) { in AddReadAttrs() argument
91 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) in AddReadAttrs()
97 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in AddReadAttrs()
200 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in AddReadAttrs()
229 bool FunctionAttrs::AddNoCaptureAttrs(const CallGraphSCC &SCC) { in AddNoCaptureAttrs() argument
234 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in AddNoCaptureAttrs()
[all …]
|
| D | PruneEH.cpp | 44 bool runOnSCC(CallGraphSCC &SCC);
61 bool PruneEH::runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument
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()
140 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in runOnSCC()
157 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in runOnSCC()
|
| D | Inliner.cpp | 330 bool Inliner::runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument
336 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in runOnSCC()
353 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in runOnSCC()
493 if (SCC.isSingular()) { in runOnSCC()
|
| /external/llvm/include/llvm/Analysis/ |
| D | CGSCCPassManager.h | 29 extern template class PassManager<LazyCallGraph::SCC>;
35 typedef PassManager<LazyCallGraph::SCC> CGSCCPassManager;
37 extern template class AnalysisManager<LazyCallGraph::SCC>;
44 typedef AnalysisManager<LazyCallGraph::SCC> CGSCCAnalysisManager;
52 LazyCallGraph::SCC>;
54 typedef OuterAnalysisManagerProxy<ModuleAnalysisManager, LazyCallGraph::SCC>
105 for (LazyCallGraph::SCC &C : RC) { in run()
146 LazyCallGraph::SCC>;
148 typedef InnerAnalysisManagerProxy<FunctionAnalysisManager, LazyCallGraph::SCC>
188 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM) { in run()
|
| D | LazyCallGraph.h | 108 class SCC; variable
196 friend class LazyCallGraph::SCC;
349 class SCC {
357 SCC(RefSCC &OuterRefSCC, NodeRangeT &&Nodes) in SCC() function
372 friend raw_ostream &operator<<(raw_ostream &OS, const SCC &C) {
447 SmallVector<SCC *, 4> SCCs;
450 SmallDenseMap<SCC *, int, 4> SCCIndices;
466 for (LazyCallGraph::SCC &C : RC) {
498 typedef pointee_iterator<SmallVectorImpl<SCC *>::const_iterator> iterator;
508 SCC &operator[](int Idx) { return *SCCs[Idx]; }
[all …]
|
| D | CallGraphSCCPass.h | 61 virtual bool runOnSCC(CallGraphSCC &SCC) = 0;
85 bool skipSCC(CallGraphSCC &SCC) const;
126 bool runOnSCC(CallGraphSCC &SCC) override { return false; } in runOnSCC() argument
|
| /external/llvm/test/Analysis/LazyCallGraph/ |
| D | basic.ll | 259 ; CHECK-NEXT: SCC with 3 functions:
265 ; CHECK-NEXT: SCC with 1 functions:
267 ; CHECK-NEXT: SCC with 1 functions:
271 ; CHECK-NEXT: SCC with 2 functions:
274 ; CHECK-NEXT: SCC with 2 functions:
277 ; CHECK-NEXT: SCC with 2 functions:
282 ; CHECK-NEXT: SCC with 1 functions:
286 ; CHECK-NEXT: SCC with 1 functions:
290 ; CHECK-NEXT: SCC with 1 functions:
294 ; CHECK-NEXT: SCC with 1 functions:
[all …]
|
| /external/llvm/lib/Transforms/IPO/ |
| D | PruneEH.cpp | 48 bool runOnSCC(CallGraphSCC &SCC) override;
64 static bool runImpl(CallGraphSCC &SCC, CallGraph &CG) { in runImpl() argument
70 for (CallGraphNode *I : SCC) in runImpl()
75 for (CallGraphNode *I : SCC) in runImpl()
87 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); in runImpl()
156 for (CallGraphNode *I : SCC) { in runImpl()
170 for (CallGraphNode *I : SCC) { in runImpl()
182 bool PruneEH::runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument
183 if (skipSCC(SCC)) in runOnSCC()
186 return runImpl(SCC, CG); in runOnSCC()
|
| D | InlineSimple.cpp | 67 bool runOnSCC(CallGraphSCC &SCC) override;
99 bool SimpleInliner::runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument
101 return Inliner::runOnSCC(SCC); in runOnSCC()
|
| D | Inliner.cpp | 370 bool Inliner::runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument
371 if (skipSCC(SCC)) in runOnSCC()
373 return inlineCalls(SCC); in runOnSCC()
376 bool Inliner::inlineCalls(CallGraphSCC &SCC) { in inlineCalls() argument
384 for (CallGraphNode *Node : SCC) { in inlineCalls()
401 for (CallGraphNode *Node : SCC) { in inlineCalls()
552 if (SCC.isSingular()) { in inlineCalls()
|
| D | InlineAlways.cpp | 50 bool runOnSCC(CallGraphSCC &SCC) override { return inlineCalls(SCC); } in runOnSCC() argument
|
| D | FunctionAttrs.cpp | 987 PreservedAnalyses PostOrderFunctionAttrsPass::run(LazyCallGraph::SCC &C, in run()
1049 bool runOnSCC(CallGraphSCC &SCC) override;
1071 static bool runImpl(CallGraphSCC &SCC, AARGetterT AARGetter) { in runImpl() argument
1080 for (CallGraphNode *I : SCC) { in runImpl()
1107 bool PostOrderFunctionAttrsLegacyPass::runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument
1108 if (skipSCC(SCC)) in runOnSCC()
1122 return runImpl(SCC, AARGetter); in runOnSCC()
|
| /external/swiftshader/third_party/LLVM/lib/Analysis/IPA/ |
| D | GlobalsModRef.cpp | 374 std::vector<CallGraphNode *> &SCC = *I; in AnalyzeCallGraph() local
375 assert(!SCC.empty() && "SCC with no functions?"); in AnalyzeCallGraph()
377 if (!SCC[0]->getFunction()) { in AnalyzeCallGraph()
380 for (unsigned i = 0, e = SCC.size(); i != e; ++i) in AnalyzeCallGraph()
381 FunctionInfo.erase(SCC[i]->getFunction()); in AnalyzeCallGraph()
385 FunctionRecord &FR = FunctionInfo[SCC[0]->getFunction()]; in AnalyzeCallGraph()
392 for (unsigned i = 0, e = SCC.size(); i != e && !KnowNothing; ++i) { in AnalyzeCallGraph()
393 Function *F = SCC[i]->getFunction(); in AnalyzeCallGraph()
418 for (CallGraphNode::iterator CI = SCC[i]->begin(), E = SCC[i]->end(); in AnalyzeCallGraph()
435 if (std::find(SCC.begin(), SCC.end(), CalleeNode) == SCC.end()) in AnalyzeCallGraph()
[all …]
|
| /external/llvm/lib/Analysis/ |
| D | CGSCCPassManager.cpp | 16 template class PassManager<LazyCallGraph::SCC>;
17 template class AnalysisManager<LazyCallGraph::SCC>;
20 LazyCallGraph::SCC>;
22 LazyCallGraph::SCC>;
|
| D | LazyCallGraph.cpp | 179 void LazyCallGraph::SCC::dump() const { in dump()
184 void LazyCallGraph::SCC::verify() { in verify()
214 for (SCC *C : SCCs) { in verify()
223 SCC *C = SCCIndexPair.first; in verify()
231 SCC &SourceSCC = *SCCs[i]; in verify()
236 SCC &TargetSCC = *G->lookupSCC(*E.getNode()); in verify()
264 SmallVector<LazyCallGraph::SCC *, 1>
268 SmallVector<SCC *, 1> DeletedSCCs; in switchInternalEdgeToCall()
270 SCC &SourceSCC = *G->lookupSCC(SourceN); in switchInternalEdgeToCall()
271 SCC &TargetSCC = *G->lookupSCC(TargetN); in switchInternalEdgeToCall()
[all …]
|
| D | GlobalsModRef.cpp | 453 const std::vector<CallGraphNode *> &SCC = *I; in CollectSCCMembership() local
454 assert(!SCC.empty() && "SCC with no functions?"); in CollectSCCMembership()
456 for (auto *CGN : SCC) in CollectSCCMembership()
471 const std::vector<CallGraphNode *> &SCC = *I; in AnalyzeCallGraph() local
472 assert(!SCC.empty() && "SCC with no functions?"); in AnalyzeCallGraph()
474 if (!SCC[0]->getFunction() || !SCC[0]->getFunction()->isDefinitionExact()) { in AnalyzeCallGraph()
478 for (auto *Node : SCC) in AnalyzeCallGraph()
483 FunctionInfo &FI = FunctionInfos[SCC[0]->getFunction()]; in AnalyzeCallGraph()
488 for (unsigned i = 0, e = SCC.size(); i != e && !KnowNothing; ++i) { in AnalyzeCallGraph()
489 Function *F = SCC[i]->getFunction(); in AnalyzeCallGraph()
[all …]
|
| D | CallGraphSCCPass.cpp | 613 bool runOnSCC(CallGraphSCC &SCC) override { in runOnSCC() argument
615 for (CallGraphNode *CGN : SCC) { in runOnSCC()
635 bool CallGraphSCCPass::skipSCC(CallGraphSCC &SCC) const { in skipSCC()
636 return !SCC.getCallGraph().getModule() in skipSCC()
639 .shouldRunPass(this, SCC); in skipSCC()
|
| /external/llvm/test/Other/ |
| D | opt-bisect-legacy-pass-manager.ll | 62 ; Test an SCC pass.
66 ; CHECK-INLINE: BISECT: running pass ({{[0-9]+}}) Function Integration/Inlining on SCC (<<null func…
67 ; CHECK-INLINE: BISECT: running pass ({{[0-9]+}}) Function Integration/Inlining on SCC (g)
68 ; CHECK-INLINE: BISECT: running pass ({{[0-9]+}}) Function Integration/Inlining on SCC (f1)
69 ; CHECK-INLINE: BISECT: running pass ({{[0-9]+}}) Function Integration/Inlining on SCC (f2)
70 ; CHECK-INLINE: BISECT: running pass ({{[0-9]+}}) Function Integration/Inlining on SCC (f3)
71 ; CHECK-INLINE: BISECT: running pass ({{[0-9]+}}) Function Integration/Inlining on SCC (<<null func…
75 ; CHECK-NOT-INLINE: BISECT: NOT running pass ({{[0-9]+}}) Function Integration/Inlining on SCC (<<n…
76 ; CHECK-NOT-INLINE: BISECT: NOT running pass ({{[0-9]+}}) Function Integration/Inlining on SCC (g)
77 ; CHECK-NOT-INLINE: BISECT: NOT running pass ({{[0-9]+}}) Function Integration/Inlining on SCC (f1)
[all …]
|
| /external/llvm/unittests/Analysis/ |
| D | LazyCallGraphTest.cpp | 352 LazyCallGraph::SCC &D = *J++; in TEST()
362 LazyCallGraph::SCC &B = *J++; in TEST()
372 LazyCallGraph::SCC &C = *J++; in TEST()
382 LazyCallGraph::SCC &A = *J++; in TEST()
447 LazyCallGraph::SCC &C = *RC.begin(); in TEST()
487 LazyCallGraph::SCC &AC = *CG.lookupSCC(A); in TEST()
488 LazyCallGraph::SCC &BC = *CG.lookupSCC(B); in TEST()
489 LazyCallGraph::SCC &CC = *CG.lookupSCC(C); in TEST()
490 LazyCallGraph::SCC &DC = *CG.lookupSCC(D); in TEST()
816 LazyCallGraph::SCC &AC = *CG.lookupSCC(A); in TEST()
[all …]
|
| /external/llvm/include/llvm/Transforms/IPO/ |
| D | InlinerPass.h | 44 bool runOnSCC(CallGraphSCC &SCC) override;
70 bool inlineCalls(CallGraphSCC &SCC);
|
| /external/llvm/lib/IR/ |
| D | OptBisect.cpp | 70 static std::string getDescription(const CallGraphSCC &SCC) { in getDescription() argument
73 for (CallGraphNode *CGN : SCC) { in getDescription()
|
| /external/llvm/unittests/ADT/ |
| D | SCCIteratorTest.cpp | 278 const std::vector<GT::NodeType *> &SCC = *I; in TEST() local
282 for (unsigned i = 0, e = SCC.size(); i != e; ++i) in TEST()
283 NodesInThisSCC.AddNode(SCC[i]->first); in TEST()
|
| /external/swiftshader/third_party/LLVM/unittests/ADT/ |
| D | SCCIteratorTest.cpp | 280 std::vector<GT::NodeType*> &SCC = *I; in TEST() local
284 for (unsigned i = 0, e = SCC.size(); i != e; ++i) in TEST()
285 NodesInThisSCC.AddNode(SCC[i]->first); in TEST()
|
| /external/llvm/test/MC/Lanai/ |
| D | conditional_inst.s | 48 ! SCC
51 ! CHECK-NEXT: <MCInst #{{[0-9]+}} SCC{{$}}
|
| /external/llvm/tools/opt/ |
| D | PassPrinters.cpp | 72 bool runOnSCC(CallGraphSCC &SCC) override { in runOnSCC()
77 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in runOnSCC()
|