Home
last modified time | relevance | path

Searched refs:SCC (Results 1 – 25 of 149) sorted by relevance

123456

/external/swiftshader/third_party/LLVM/lib/Transforms/IPO/
DFunctionAttrs.cpp49 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 …]
DPruneEH.cpp44 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()
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Analysis/
DCGSCCPassManager.cpp40 template class AllAnalysesOn<LazyCallGraph::SCC>;
41 template class AnalysisManager<LazyCallGraph::SCC, LazyCallGraph &>;
42 template class PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager,
46 LazyCallGraph::SCC, LazyCallGraph &>;
53 PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &,
54 CGSCCUpdateResult &>::run(LazyCallGraph::SCC &InitialC, in run()
64 LazyCallGraph::SCC *C = &InitialC; in run()
103 PA.preserveSet<AllAnalysesOn<LazyCallGraph::SCC>>(); in run()
141 PA.allAnalysesInSetPreserved<AllAnalysesOn<LazyCallGraph::SCC>>(); in invalidate()
198 FunctionAnalysisManagerCGSCCProxy::run(LazyCallGraph::SCC &C, in run()
[all …]
DLazyCallGraph.cpp213 LLVM_DUMP_METHOD void LazyCallGraph::SCC::dump() const { in dump()
219 void LazyCallGraph::SCC::verify() { in verify()
237 bool LazyCallGraph::SCC::isParentOf(const SCC &C) const { in isParentOf()
250 bool LazyCallGraph::SCC::isAncestorOf(const SCC &TargetC) const { in isAncestorOf()
257 SmallPtrSet<const SCC *, 16> Visited = {this}; in isAncestorOf()
258 SmallVector<const SCC *, 16> Worklist = {this}; in isAncestorOf()
262 const SCC &C = *Worklist.pop_back_val(); in isAncestorOf()
265 SCC *CalleeC = G.lookupSCC(E.getNode()); in isAncestorOf()
298 SmallPtrSet<SCC *, 4> SCCSet; in verify()
299 for (SCC *C : SCCs) { in verify()
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Analysis/
DCGSCCPassManager.h118 extern template class AllAnalysesOn<LazyCallGraph::SCC>;
120 extern template class AnalysisManager<LazyCallGraph::SCC, LazyCallGraph &>;
129 AnalysisManager<LazyCallGraph::SCC, LazyCallGraph &>;
136 PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &,
137 CGSCCUpdateResult &>::run(LazyCallGraph::SCC &InitialC,
140 extern template class PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager,
149 PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &,
154 struct RequireAnalysisPass<AnalysisT, LazyCallGraph::SCC, CGSCCAnalysisManager,
156 : PassInfoMixin<RequireAnalysisPass<AnalysisT, LazyCallGraph::SCC,
159 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
[all …]
DLazyCallGraph.h116 class SCC; variable
431 class SCC {
439 SCC(RefSCC &OuterRefSCC, NodeRangeT &&Nodes) in SCC() function
454 friend raw_ostream &operator<<(raw_ostream &OS, const SCC &C) {
499 bool isParentOf(const SCC &C) const;
507 bool isAncestorOf(const SCC &C) const;
513 bool isChildOf(const SCC &C) const { return C.isParentOf(*this); } in isChildOf()
519 bool isDescendantOf(const SCC &C) const { return C.isAncestorOf(*this); } in isDescendantOf()
554 SmallVector<SCC *, 4> SCCs;
557 SmallDenseMap<SCC *, int, 4> SCCIndices;
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/test/Analysis/LazyCallGraph/
Dbasic.ll259 ; 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/test/Analysis/LazyCallGraph/
Dbasic.ll259 ; 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/include/llvm/Analysis/
DCGSCCPassManager.h29 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()
DLazyCallGraph.h108 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 …]
/external/llvm/lib/Transforms/IPO/
DPruneEH.cpp48 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()
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/IPO/
DPruneEH.cpp47 bool runOnSCC(CallGraphSCC &SCC) override;
63 static bool runImpl(CallGraphSCC &SCC, CallGraph &CG) { in runImpl() argument
69 for (CallGraphNode *I : SCC) in runImpl()
74 for (CallGraphNode *I : SCC) in runImpl()
86 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); in runImpl()
152 for (CallGraphNode *I : SCC) { in runImpl()
166 for (CallGraphNode *I : SCC) { in runImpl()
178 bool PruneEH::runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument
179 if (skipSCC(SCC)) in runOnSCC()
182 return runImpl(SCC, CG); in runOnSCC()
/external/swiftshader/third_party/LLVM/lib/Analysis/IPA/
DGlobalsModRef.cpp374 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/
DCGSCCPassManager.cpp16 template class PassManager<LazyCallGraph::SCC>;
17 template class AnalysisManager<LazyCallGraph::SCC>;
20 LazyCallGraph::SCC>;
22 LazyCallGraph::SCC>;
DLazyCallGraph.cpp179 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 …]
DGlobalsModRef.cpp453 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 …]
/external/swiftshader/third_party/llvm-7.0/llvm/unittests/Analysis/
DCGSCCPassManagerTest.cpp58 Result run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM, LazyCallGraph &) { in run()
140 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM, in run()
145 std::function<PreservedAnalyses(LazyCallGraph::SCC &, CGSCCAnalysisManager &,
273 LambdaSCCPass([&](LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM, in TEST_F()
350 LambdaSCCPass([&](LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM, in TEST_F()
369 LambdaSCCPass([&](LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM, in TEST_F()
391 LambdaSCCPass([&](LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM, in TEST_F()
507 CGPM1.addPass(RequireAnalysisPass<TestSCCAnalysis, LazyCallGraph::SCC, in TEST_F()
525 CGPM2.addPass(RequireAnalysisPass<TestSCCAnalysis, LazyCallGraph::SCC, in TEST_F()
545 CGPM1.addPass(RequireAnalysisPass<TestSCCAnalysis, LazyCallGraph::SCC, in TEST_F()
[all …]
DLazyCallGraphTest.cpp477 LazyCallGraph::SCC &D = *J++; in TEST()
487 LazyCallGraph::SCC &B = *J++; in TEST()
497 LazyCallGraph::SCC &C = *J++; in TEST()
507 LazyCallGraph::SCC &A = *J++; in TEST()
573 LazyCallGraph::SCC &C = *RC.begin(); in TEST()
614 LazyCallGraph::SCC &AC = *CG.lookupSCC(A); in TEST()
615 LazyCallGraph::SCC &BC = *CG.lookupSCC(B); in TEST()
616 LazyCallGraph::SCC &CC = *CG.lookupSCC(C); in TEST()
617 LazyCallGraph::SCC &DC = *CG.lookupSCC(D); in TEST()
959 LazyCallGraph::SCC &AC = *CG.lookupSCC(A); in TEST()
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/test/ThinLTO/X86/
Dmodule_summary_graph_traits.ll12 ; CHECK: SCC (2 nodes) {
17 ; CHECK: SCC (1 node) {
21 ; CHECK: SCC (1 node) {
25 ; CHECK: SCC (1 node) {
30 ; CHECK: SCC (1 node) {
/external/swiftshader/third_party/llvm-7.0/llvm/test/Other/
Dopt-bisect-legacy-pass-manager.ll63 ; Test an SCC pass.
67 ; CHECK-INLINE: BISECT: running pass ({{[0-9]+}}) Function Integration/Inlining on SCC (<<null func…
68 ; CHECK-INLINE: BISECT: running pass ({{[0-9]+}}) Function Integration/Inlining on SCC (g)
69 ; CHECK-INLINE: BISECT: running pass ({{[0-9]+}}) Function Integration/Inlining on SCC (f1)
70 ; CHECK-INLINE: BISECT: running pass ({{[0-9]+}}) Function Integration/Inlining on SCC (f2)
71 ; CHECK-INLINE: BISECT: running pass ({{[0-9]+}}) Function Integration/Inlining on SCC (f3)
72 ; CHECK-INLINE: BISECT: running pass ({{[0-9]+}}) Function Integration/Inlining on SCC (<<null func…
76 ; CHECK-NOT-INLINE: BISECT: NOT running pass ({{[0-9]+}}) Function Integration/Inlining on SCC (<<n…
77 ; CHECK-NOT-INLINE: BISECT: NOT running pass ({{[0-9]+}}) Function Integration/Inlining on SCC (g)
78 ; CHECK-NOT-INLINE: BISECT: NOT running pass ({{[0-9]+}}) Function Integration/Inlining on SCC (f1)
[all …]
/external/llvm/test/Other/
Dopt-bisect-legacy-pass-manager.ll62 ; 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/
DLazyCallGraphTest.cpp352 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/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/Inline/
Dcgscc-update.ll18 ; call in the inlined body of the function. After that, we form a new SCC and
29 ; This function should have had 'readnone' deduced for its SCC.
38 ; This function should have had 'readnone' deduced for its SCC.
51 ; This too should form a new SCC which can then be reasoned about to compute
61 ; This function should have had 'readnone' deduced for its SCC.
71 ; This function should have had 'readnone' deduced for its SCC.
152 ; form a new SCC and should use that can deduce precise function attrs.
154 ; This function should have had 'readnone' deduced for its SCC.
177 ; This function should have had 'readnone' deduced for its SCC.
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/AMDGPU/
DSOPInstructions.td135 let Uses = [SCC] in {
138 } // End Uses = [SCC]
141 let Defs = [SCC] in {
153 } // End Defs = [SCC]
161 let Defs = [SCC] in {
168 } // End Defs = [SCC]
221 let hasSideEffects = 1, Uses = [EXEC], Defs = [EXEC, SCC] in {
232 } // End hasSideEffects = 1, Uses = [EXEC], Defs = [EXEC, SCC]
246 let Defs = [SCC] in {
248 } // End Defs = [SCC]
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/unittests/IR/
DPassBuilderCallbacksTest.cpp182 struct MockPassHandle<LazyCallGraph::SCC>
183 : MockPassHandleBase<MockPassHandle<LazyCallGraph::SCC>, LazyCallGraph::SCC,
187 PreservedAnalyses(LazyCallGraph::SCC &, CGSCCAnalysisManager &,
232 struct MockAnalysisHandle<LazyCallGraph::SCC>
233 : MockAnalysisHandleBase<MockAnalysisHandle<LazyCallGraph::SCC>,
234 LazyCallGraph::SCC, CGSCCAnalysisManager,
236 MOCK_METHOD3(run, Analysis::Result(LazyCallGraph::SCC &,
239 MOCK_METHOD3(invalidate, bool(LazyCallGraph::SCC &, const PreservedAnalyses &,
242 MockAnalysisHandle<LazyCallGraph::SCC>() { setDefaults(); } in MockAnalysisHandle()

123456