/external/llvm/lib/Analysis/ |
D | LazyCallGraph.cpp | 159 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 …]
|
D | GlobalsModRef.cpp | 476 const std::vector<CallGraphNode *> &SCC = *I; in CollectSCCMembership() local 477 assert(!SCC.empty() && "SCC with no functions?"); in CollectSCCMembership() 479 for (auto *CGN : SCC) in CollectSCCMembership() 494 const std::vector<CallGraphNode *> &SCC = *I; in AnalyzeCallGraph() local 495 assert(!SCC.empty() && "SCC with no functions?"); in AnalyzeCallGraph() 497 if (!SCC[0]->getFunction() || SCC[0]->getFunction()->mayBeOverridden()) { in AnalyzeCallGraph() 500 for (auto *Node : SCC) in AnalyzeCallGraph() 505 FunctionInfo &FI = FunctionInfos[SCC[0]->getFunction()]; in AnalyzeCallGraph() 510 for (unsigned i = 0, e = SCC.size(); i != e && !KnowNothing; ++i) { in AnalyzeCallGraph() 511 Function *F = SCC[i]->getFunction(); in AnalyzeCallGraph() [all …]
|
D | CGSCCPassManager.cpp | 48 FunctionAnalysisManagerCGSCCProxy::run(LazyCallGraph::SCC &C) { in run() 60 LazyCallGraph::SCC &C, const PreservedAnalyses &PA) { in invalidate()
|
D | BlockFrequencyInfoImpl.cpp | 617 const std::vector<const IrreducibleGraph::IrrNode *> &SCC, in findIrreducibleHeaders() argument 623 for (const auto *I : SCC) in findIrreducibleHeaders() 684 const std::vector<const IrreducibleGraph::IrrNode *> &SCC) { in createIrreducibleLoop() argument 690 findIrreducibleHeaders(BFI, G, SCC, Headers, Others); in createIrreducibleLoop()
|
/external/llvm/unittests/Analysis/ |
D | LazyCallGraphTest.cpp | 208 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/ |
D | LazyCallGraph.h | 106 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 …]
|
D | CGSCCPassManager.h | 34 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() 305 bool invalidate(LazyCallGraph::SCC &C, const PreservedAnalyses &PA); 339 Result run(LazyCallGraph::SCC &C); 442 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager *AM) { in run()
|
D | CallGraphSCCPass.h | 60 virtual bool runOnSCC(CallGraphSCC &SCC) = 0;
|
D | InlineCost.h | 114 bool runOnSCC(CallGraphSCC &SCC) override;
|
/external/llvm/test/Analysis/LazyCallGraph/ |
D | basic.ll | 130 ; 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/ |
D | PruneEH.cpp | 48 bool runOnSCC(CallGraphSCC &SCC) override; 65 bool PruneEH::runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument 72 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) in runOnSCC() 77 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) in runOnSCC() 89 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); in runOnSCC() 155 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in runOnSCC() 169 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in runOnSCC()
|
D | InlineSimple.cpp | 58 bool runOnSCC(CallGraphSCC &SCC) override; 97 bool SimpleInliner::runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument 99 return Inliner::runOnSCC(SCC); in runOnSCC()
|
D | InlineAlways.cpp | 57 bool runOnSCC(CallGraphSCC &SCC) override; 109 bool AlwaysInliner::runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument 111 return Inliner::runOnSCC(SCC); in runOnSCC()
|
D | Inliner.cpp | 473 bool Inliner::runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument 480 for (CallGraphNode *Node : SCC) { in runOnSCC() 497 for (CallGraphNode *Node : SCC) { in runOnSCC() 648 if (SCC.isSingular()) { in runOnSCC()
|
D | ArgumentPromotion.cpp | 74 bool runOnSCC(CallGraphSCC &SCC) override; 114 bool ArgPromotion::runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument 120 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in runOnSCC() 123 SCC.ReplaceNode(*I, CGN); in runOnSCC()
|
D | FunctionAttrs.cpp | 74 bool runOnSCC(CallGraphSCC &SCC) override; 1805 static bool addNoRecurseAttrs(const CallGraphSCC &SCC, in addNoRecurseAttrs() argument 1810 if (!SCC.isSingular()) in addNoRecurseAttrs() 1813 const CallGraphNode *CGN = *SCC.begin(); in addNoRecurseAttrs() 1912 bool FunctionAttrs::runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument 1933 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) { in runOnSCC() 1961 Changed |= addNoRecurseAttrs(SCC, Revisit); in runOnSCC()
|
/external/mesa3d/src/gallium/drivers/radeon/ |
D | SIInstrInfo.cpp | 46 assert(DestReg != AMDGPU::SCC && SrcReg != AMDGPU::SCC); in copyPhysReg()
|
/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/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()
|
/external/llvm/test/Transforms/InstCombine/ |
D | 2009-02-11-NotInitialized.ll | 3 ; Check that nocapture attributes are added when run after an SCC pass.
|
/external/llvm/include/llvm/Transforms/IPO/ |
D | InlinerPass.h | 43 bool runOnSCC(CallGraphSCC &SCC) override;
|
/external/llvm/lib/Target/AMDGPU/ |
D | SIInstructions.td | 110 let Uses = [SCC] in { 113 } // End Uses = [SCC] 116 let Defs = [SCC] in { 126 } // End Defs = [SCC] 134 let Defs = [SCC] in { 141 } // End Defs = [SCC] 175 let hasSideEffects = 1, Uses = [EXEC], Defs = [EXEC, SCC] in { 186 } // End hasSideEffects = 1, Uses = [EXEC], Defs = [EXEC, SCC] 200 let Defs = [SCC] in { 202 } // End Defs = [SCC] [all …]
|
/external/llvm/lib/Passes/ |
D | PassBuilder.cpp | 64 PreservedAnalyses run(LazyCallGraph::SCC &C) { in run() 73 Result run(LazyCallGraph::SCC &) { return Result(); } in run()
|
/external/llvm/test/Analysis/BlockFrequencyInfo/ |
D | irreducible.ll | 40 ; LoopInfo defines a loop as a non-trivial SCC dominated by a single block, 353 ; An irreducible SCC with a non-header. 381 ; An irreducible SCC with an irreducible sub-SCC. In the current version of
|
/external/llvm/test/Transforms/FunctionAttrs/ |
D | nonnull.ll | 17 ; Given an SCC where one of the functions can not be marked nonnull,
|