Home
last modified time | relevance | path

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

12345678910

/external/llvm-project/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-10.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/llvm-project/llvm/lib/Analysis/
DCGSCCPassManager.cpp48 template class AllAnalysesOn<LazyCallGraph::SCC>;
49 template class AnalysisManager<LazyCallGraph::SCC, LazyCallGraph &>;
50 template class PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager,
54 LazyCallGraph::SCC, LazyCallGraph &>;
61 PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &,
62 CGSCCUpdateResult &>::run(LazyCallGraph::SCC &InitialC, in run()
77 LazyCallGraph::SCC *C = &InitialC; in run()
96 PI.runAfterPassInvalidated<LazyCallGraph::SCC>(*Pass, PassPA); in run()
98 PI.runAfterPass<LazyCallGraph::SCC>(*Pass, *C, PassPA); in run()
143 PA.preserveSet<AllAnalysesOn<LazyCallGraph::SCC>>(); in run()
[all …]
DLazyCallGraph.cpp238 LLVM_DUMP_METHOD void LazyCallGraph::SCC::dump() const { in dump()
244 void LazyCallGraph::SCC::verify() { in verify()
262 bool LazyCallGraph::SCC::isParentOf(const SCC &C) const { in isParentOf()
275 bool LazyCallGraph::SCC::isAncestorOf(const SCC &TargetC) const { in isAncestorOf()
282 SmallPtrSet<const SCC *, 16> Visited = {this}; in isAncestorOf()
283 SmallVector<const SCC *, 16> Worklist = {this}; in isAncestorOf()
287 const SCC &C = *Worklist.pop_back_val(); in isAncestorOf()
290 SCC *CalleeC = G.lookupSCC(E.getNode()); in isAncestorOf()
323 SmallPtrSet<SCC *, 4> SCCSet; in verify()
324 for (SCC *C : SCCs) { in verify()
[all …]
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/
DCGSCCPassManager.cpp39 template class AllAnalysesOn<LazyCallGraph::SCC>;
40 template class AnalysisManager<LazyCallGraph::SCC, LazyCallGraph &>;
41 template class PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager,
45 LazyCallGraph::SCC, LazyCallGraph &>;
52 PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &,
53 CGSCCUpdateResult &>::run(LazyCallGraph::SCC &InitialC, in run()
68 LazyCallGraph::SCC *C = &InitialC; in run()
82 PI.runAfterPassInvalidated<LazyCallGraph::SCC>(*Pass); in run()
84 PI.runAfterPass<LazyCallGraph::SCC>(*Pass, *C); in run()
123 PA.preserveSet<AllAnalysesOn<LazyCallGraph::SCC>>(); in run()
[all …]
DLazyCallGraph.cpp226 LLVM_DUMP_METHOD void LazyCallGraph::SCC::dump() const { in dump()
232 void LazyCallGraph::SCC::verify() { in verify()
250 bool LazyCallGraph::SCC::isParentOf(const SCC &C) const { in isParentOf()
263 bool LazyCallGraph::SCC::isAncestorOf(const SCC &TargetC) const { in isAncestorOf()
270 SmallPtrSet<const SCC *, 16> Visited = {this}; in isAncestorOf()
271 SmallVector<const SCC *, 16> Worklist = {this}; in isAncestorOf()
275 const SCC &C = *Worklist.pop_back_val(); in isAncestorOf()
278 SCC *CalleeC = G.lookupSCC(E.getNode()); in isAncestorOf()
311 SmallPtrSet<SCC *, 4> SCCSet; in verify()
312 for (SCC *C : SCCs) { in verify()
[all …]
/external/llvm-project/llvm/include/llvm/Transforms/Utils/
DCallGraphUpdater.h49 LazyCallGraph::SCC *SCC = nullptr; variable
62 void initialize(CallGraph &CG, CallGraphSCC &SCC) { in initialize() argument
64 this->CGSCC = &SCC; in initialize()
66 void initialize(LazyCallGraph &LCG, LazyCallGraph::SCC &SCC, in initialize() argument
69 this->SCC = &SCC; in initialize()
73 &AM.getResult<FunctionAnalysisManagerCGSCCProxy>(SCC, LCG).getManager(); in initialize()
/external/protobuf/src/google/protobuf/compiler/
Dscc.h49 struct SCC { struct
51 std::vector<const SCC*> children; argument
67 const SCC* GetSCC(const Descriptor* descriptor) { in GetSCC()
74 const SCC* scc; // if null it means its still on the stack
82 std::vector<std::unique_ptr<SCC>> garbage_bin_;
84 SCC* CreateSCC() { in CreateSCC()
85 garbage_bin_.emplace_back(new SCC()); in CreateSCC()
117 SCC* scc = CreateSCC(); in DFS()
140 void AddChildren(SCC* scc) { in AddChildren()
141 std::set<const SCC*> seen; in AddChildren()
[all …]
/external/llvm-project/llvm/test/Transforms/Inline/
Dcgscc-cycle-debug.ll1 ; When an SCC got split due to inlining, we have two mechanisms for reprocessing the updated SCC, f…
2 ; that repeatedly rerun the new, current SCC; second is a worklist for all newly split SCCs. We nee…
3 ; the same SCC when the SCC is set to be processed by both mechanisms back to back. In pathological…
8 ; of the same caller-callee edge, we could end up getting more recursive inlining without SCC mutat…
13 ; CHECK: Running an SCC pass across the RefSCC: [(test1_a, test1_b, test1_c)]
14 ; CHECK: Enqueuing the existing SCC in the worklist:(test1_b)
15 ; CHECK: Enqueuing a newly formed SCC:(test1_c)
19 ; CHECK: Re-running SCC passes after a refinement of the current SCC: (test1_c, test1_a)
20 ; CHECK: Skipping redundant run on SCC: (test1_c, test1_a)
21 ; CHECK: Skipping an SCC that is now part of some other RefSCC...
/external/llvm-project/llvm/unittests/ADT/
DDirectedGraphTest.cpp246 TEST(DirectedGraphTest, SCC) { in TEST() argument
273 for (auto &SCC : make_range(scc_begin(&DG), scc_end(&DG))) in TEST() local
274 ListOfSCCs.push_back(NodeListTy(SCC.begin(), SCC.end())); in TEST()
278 for (auto &SCC : ListOfSCCs) { in TEST() local
279 if (SCC.size() > 1) in TEST()
281 EXPECT_TRUE(SCC.size() == 1); in TEST()
282 EXPECT_TRUE(SCC.count(&N4) == 1); in TEST()
284 for (auto &SCC : ListOfSCCs) { in TEST() local
285 if (SCC.size() <= 1) in TEST()
287 EXPECT_TRUE(SCC.size() == 3); in TEST()
[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/swiftshader/third_party/llvm-10.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/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/llvm-project/llvm/test/Analysis/LazyCallGraph/
Dbasic.ll259 ; CHECK-NEXT: SCC with 1 functions:
263 ; CHECK-NEXT: SCC with 1 functions:
267 ; CHECK-NEXT: SCC with 1 functions:
271 ; CHECK-NEXT: SCC with 1 functions:
275 ; CHECK-NEXT: SCC with 1 functions:
279 ; CHECK-NEXT: SCC with 1 functions:
283 ; CHECK-NEXT: SCC with 1 functions:
287 ; CHECK-NEXT: SCC with 1 functions:
291 ; CHECK-NEXT: SCC with 1 functions:
295 ; 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-project/llvm/test/Other/
Dprint-cfg-sccs.ll4 ; CHECK-NEXT: SCC #1 : %exit,
5 ; CHECK-NEXT: SCC #2 : %0,
6 ; CHECK-NEXT: SCC #3 : %3,
7 ; CHECK-NEXT: SCC #4 : %2, %1,
8 ; CHECK-NEXT: SCC #5 : %entry,
Dopt-bisect-new-pass-manager.ll58 ; CHECK-CGSCC-PASS: BISECT: running pass (1) PostOrderFunctionAttrsPass on SCC (f1)
59 ; CHECK-CGSCC-PASS: BISECT: running pass (2) PostOrderFunctionAttrsPass on SCC (f2)
60 ; CHECK-CGSCC-PASS: BISECT: running pass (3) PostOrderFunctionAttrsPass on SCC (f3)
61 ; CHECK-CGSCC-PASS: BISECT: running pass (4) PostOrderFunctionAttrsPass on SCC (f4)
66 ; CHECK-LIMIT-CGSCC-PASS: BISECT: running pass (1) PostOrderFunctionAttrsPass on SCC (f1)
67 ; CHECK-LIMIT-CGSCC-PASS: BISECT: running pass (2) PostOrderFunctionAttrsPass on SCC (f2)
68 ; CHECK-LIMIT-CGSCC-PASS: BISECT: running pass (3) PostOrderFunctionAttrsPass on SCC (f3)
69 ; CHECK-LIMIT-CGSCC-PASS: BISECT: NOT running pass (4) PostOrderFunctionAttrsPass on SCC (f4)
75 ; CHECK-MULTI-PASS: BISECT: running pass (2) PostOrderFunctionAttrsPass on SCC (f1)
77 ; CHECK-MULTI-PASS: BISECT: running pass (4) PostOrderFunctionAttrsPass on SCC (f2)
[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/llvm-project/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/llvm-project/clang-tools-extra/clang-tidy/misc/
DNoRecursionCheck.cpp160 CallStackTy PathfindSomeCycle(ArrayRef<CallGraphNode *> SCC) { in PathfindSomeCycle() argument
163 const ImmutableSmallSet<CallGraphNode *, SmallSCCSize> SCCElts(SCC); in PathfindSomeCycle()
175 CallGraphNode::CallRecord EntryNode(SCC.front(), /*CallExpr=*/nullptr); in PathfindSomeCycle()
202 void NoRecursionCheck::handleSCC(ArrayRef<CallGraphNode *> SCC) { in handleSCC() argument
203 assert(!SCC.empty() && "Empty SCC does not make sense."); in handleSCC()
206 for (CallGraphNode *N : SCC) { in handleSCC()
215 const CallStackTy EventuallyCyclicCallStack = PathfindSomeCycle(SCC); in handleSCC()

12345678910