Home
last modified time | relevance | path

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

12

/external/llvm/lib/Analysis/
DLazyCallGraph.cpp159 void LazyCallGraph::SCC::insert(Node &N) { in insert()
165 bool LazyCallGraph::SCC::isDescendantOf(const SCC &C) const { in isDescendantOf()
167 SmallVector<const SCC *, 4> AncestorWorklist; in isDescendantOf()
170 const SCC *AncestorC = AncestorWorklist.pop_back_val(); in isDescendantOf()
173 for (const SCC *ParentC : AncestorC->ParentSCCs) in isDescendantOf()
180 void LazyCallGraph::SCC::insertIntraSCCEdge(Node &CallerN, Node &CalleeN) { in insertIntraSCCEdge()
190 void LazyCallGraph::SCC::insertOutgoingEdge(Node &CallerN, Node &CalleeN) { in insertOutgoingEdge()
196 SCC &CalleeC = *G->SCCMap.lookup(&CalleeN); in insertOutgoingEdge()
205 SmallVector<LazyCallGraph::SCC *, 1>
206 LazyCallGraph::SCC::insertIncomingEdge(Node &CallerN, Node &CalleeN) { in insertIncomingEdge()
[all …]
DCGSCCPassManager.cpp48 FunctionAnalysisManagerCGSCCProxy::run(LazyCallGraph::SCC &C) { in run()
60 LazyCallGraph::SCC &C, const PreservedAnalyses &PA) { in invalidate()
DBlockFrequencyInfoImpl.cpp607 const std::vector<const IrreducibleGraph::IrrNode *> &SCC, in findIrreducibleHeaders() argument
613 for (const auto *I : SCC) in findIrreducibleHeaders()
674 const std::vector<const IrreducibleGraph::IrrNode *> &SCC) { in createIrreducibleLoop() argument
680 findIrreducibleHeaders(BFI, G, SCC, Headers, Others); in createIrreducibleLoop()
/external/llvm/unittests/Analysis/
DLazyCallGraphTest.cpp208 LazyCallGraph::SCC &D = *SCCI++; in TEST()
222 LazyCallGraph::SCC &C = *SCCI++; in TEST()
236 LazyCallGraph::SCC &B = *SCCI++; in TEST()
252 LazyCallGraph::SCC &A = *SCCI++; in TEST()
361 LazyCallGraph::SCC &SCC = *SCCI++; in TEST() local
369 EXPECT_EQ(&SCC, CG.lookupSCC(A)); in TEST()
370 EXPECT_EQ(&SCC, CG.lookupSCC(B)); in TEST()
371 EXPECT_EQ(&SCC, CG.lookupSCC(C)); in TEST()
372 EXPECT_EQ(&SCC, CG.lookupSCC(D)); in TEST()
373 EXPECT_EQ(&SCC, CG.lookupSCC(E)); in TEST()
[all …]
/external/llvm/include/llvm/Analysis/
DLazyCallGraph.h106 class SCC; variable
162 friend class LazyCallGraph::SCC;
210 class SCC {
215 SmallPtrSet<SCC *, 1> ParentSCCs;
218 SCC(LazyCallGraph &G) : G(&G) {} in SCC() function
225 SmallVectorImpl<SCC *> &ResultSCCs);
229 typedef pointee_iterator<SmallPtrSet<SCC *, 1>::const_iterator> parent_iterator;
242 bool isParentOf(const SCC &C) const { return C.isChildOf(*this); } in isParentOf()
245 bool isAncestorOf(const SCC &C) const { return C.isDescendantOf(*this); } in isAncestorOf()
248 bool isChildOf(const SCC &C) const { in isChildOf()
[all …]
DCGSCCPassManager.h34 typedef PassManager<LazyCallGraph::SCC> CGSCCPassManager;
42 typedef AnalysisManager<LazyCallGraph::SCC> CGSCCAnalysisManager;
151 bool invalidate(LazyCallGraph::SCC &) { return false; } in invalidate() argument
178 Result run(LazyCallGraph::SCC &) { return Result(*MAM); } in run() argument
229 for (LazyCallGraph::SCC &C : CG.postorder_sccs()) { in run()
306 bool invalidate(LazyCallGraph::SCC &C, const PreservedAnalyses &PA);
340 Result run(LazyCallGraph::SCC &C);
443 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager *AM) { in run()
DCallGraphSCCPass.h60 virtual bool runOnSCC(CallGraphSCC &SCC) = 0;
DInlineCost.h114 bool runOnSCC(CallGraphSCC &SCC) override;
/external/llvm/test/Analysis/LazyCallGraph/
Dbasic.ll130 ; CHECK-LABEL: SCC with 1 functions:
133 ; CHECK-LABEL: SCC with 1 functions:
136 ; CHECK-LABEL: SCC with 1 functions:
139 ; CHECK-LABEL: SCC with 1 functions:
142 ; CHECK-LABEL: SCC with 1 functions:
145 ; CHECK-LABEL: SCC with 1 functions:
148 ; CHECK-LABEL: SCC with 1 functions:
151 ; CHECK-LABEL: SCC with 1 functions:
154 ; CHECK-LABEL: SCC with 1 functions:
157 ; CHECK-LABEL: SCC with 1 functions:
[all …]
/external/llvm/lib/Transforms/IPO/
DPruneEH.cpp47 bool runOnSCC(CallGraphSCC &SCC) override;
64 bool PruneEH::runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument
71 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) in runOnSCC()
76 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) in runOnSCC()
88 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); in runOnSCC()
142 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in runOnSCC()
161 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in runOnSCC()
DFunctionAttrs.cpp55 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) { in AddReadAttrs() argument
155 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) in AddReadAttrs()
161 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in AddReadAttrs()
267 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in AddReadAttrs()
522 bool FunctionAttrs::AddArgumentAttrs(const CallGraphSCC &SCC) { in AddArgumentAttrs() argument
[all …]
DInlineSimple.cpp58 bool runOnSCC(CallGraphSCC &SCC) override;
97 bool SimpleInliner::runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument
99 return Inliner::runOnSCC(SCC); in runOnSCC()
DInlineAlways.cpp57 bool runOnSCC(CallGraphSCC &SCC) override;
109 bool AlwaysInliner::runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument
111 return Inliner::runOnSCC(SCC); in runOnSCC()
DInliner.cpp425 bool Inliner::runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument
434 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in runOnSCC()
451 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in runOnSCC()
603 if (SCC.isSingular()) { in runOnSCC()
DArgumentPromotion.cpp69 bool runOnSCC(CallGraphSCC &SCC) override;
108 bool ArgPromotion::runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument
114 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in runOnSCC()
117 SCC.ReplaceNode(*I, CGN); in runOnSCC()
/external/llvm/lib/Analysis/IPA/
DGlobalsModRef.cpp363 const std::vector<CallGraphNode *> &SCC = *I; in AnalyzeCallGraph() local
364 assert(!SCC.empty() && "SCC with no functions?"); in AnalyzeCallGraph()
366 if (!SCC[0]->getFunction()) { in AnalyzeCallGraph()
369 for (unsigned i = 0, e = SCC.size(); i != e; ++i) in AnalyzeCallGraph()
370 FunctionInfo.erase(SCC[i]->getFunction()); in AnalyzeCallGraph()
374 FunctionRecord &FR = FunctionInfo[SCC[0]->getFunction()]; in AnalyzeCallGraph()
381 for (unsigned i = 0, e = SCC.size(); i != e && !KnowNothing; ++i) { in AnalyzeCallGraph()
382 Function *F = SCC[i]->getFunction(); in AnalyzeCallGraph()
407 for (CallGraphNode::iterator CI = SCC[i]->begin(), E = SCC[i]->end(); in AnalyzeCallGraph()
422 if (std::find(SCC.begin(), SCC.end(), CalleeNode) == SCC.end()) in AnalyzeCallGraph()
[all …]
/external/mesa3d/src/gallium/drivers/radeon/
DSIInstrInfo.cpp46 assert(DestReg != AMDGPU::SCC && SrcReg != AMDGPU::SCC); in copyPhysReg()
/external/llvm/unittests/ADT/
DSCCIteratorTest.cpp278 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/llvm/tools/opt/
DPassPrinters.cpp72 bool runOnSCC(CallGraphSCC &SCC) override { in runOnSCC()
77 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in runOnSCC()
/external/llvm/test/Transforms/InstCombine/
D2009-02-11-NotInitialized.ll3 ; Check that nocapture attributes are added when run after an SCC pass.
/external/llvm/include/llvm/Transforms/IPO/
DInlinerPass.h43 bool runOnSCC(CallGraphSCC &SCC) override;
/external/llvm/lib/Target/R600/
DSIInstructions.td105 let Uses = [SCC] in {
108 } // End Uses = [SCC]
111 let Defs = [SCC] in {
121 } // End Defs = [SCC]
129 let Defs = [SCC] in {
136 } // End Defs = [SCC]
170 let hasSideEffects = 1, Uses = [EXEC], Defs = [EXEC, SCC] in {
181 } // End hasSideEffects = 1, Uses = [EXEC], Defs = [EXEC, SCC]
191 let Defs = [SCC] in {
193 } // End Defs = [SCC]
[all …]
DSIRegisterInfo.td39 def SCC : SIReg<"scc", 253>;
178 def SCCReg : RegisterClass<"AMDGPU", [i32, i1], 32, (add SCC)> {
179 let CopyCost = -1; // Theoretically it is possible to read from SCC,
/external/llvm/lib/Passes/
DPassBuilder.cpp60 PreservedAnalyses run(LazyCallGraph::SCC &C) { in run()
69 Result run(LazyCallGraph::SCC &) { return Result(); } in run()
/external/llvm/test/Analysis/BlockFrequencyInfo/
Dirreducible.ll40 ; LoopInfo defines a loop as a non-trivial SCC dominated by a single block,
356 ; An irreducible SCC with a non-header.
384 ; An irreducible SCC with an irreducible sub-SCC. In the current version of

12