Home
last modified time | relevance | path

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

123

/third_party/skia/third_party/externals/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 …]
DCallGraphSCCPass.h59 virtual bool runOnSCC(CallGraphSCC &SCC) = 0;
83 bool skipSCC(CallGraphSCC &SCC) const;
127 bool runOnSCC(CallGraphSCC &SCC) override { return false; } in runOnSCC() argument
/third_party/skia/third_party/externals/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 …]
DSyntheticCountsUtils.cpp28 const SccTy &SCC, GetProfCountTy GetProfCount, AddCountTy AddCount) { in propagateFromSCC() argument
33 for (auto &Node : SCC) in propagateFromSCC()
99 for (auto &SCC : reverse(SCCs)) in propagate() local
100 propagateFromSCC(SCC, GetProfCount, AddCount); in propagate()
DGlobalsModRef.cpp475 const std::vector<CallGraphNode *> &SCC = *I; in CollectSCCMembership() local
476 assert(!SCC.empty() && "SCC with no functions?"); in CollectSCCMembership()
478 for (auto *CGN : SCC) in CollectSCCMembership()
493 const std::vector<CallGraphNode *> &SCC = *I; in AnalyzeCallGraph() local
494 assert(!SCC.empty() && "SCC with no functions?"); in AnalyzeCallGraph()
496 Function *F = SCC[0]->getFunction(); in AnalyzeCallGraph()
502 for (auto *Node : SCC) in AnalyzeCallGraph()
514 for (unsigned i = 0, e = SCC.size(); i != e && !KnowNothing; ++i) { in AnalyzeCallGraph()
542 for (CallGraphNode::iterator CI = SCC[i]->begin(), E = SCC[i]->end(); in AnalyzeCallGraph()
552 if (!is_contained(SCC, CalleeNode)) in AnalyzeCallGraph()
[all …]
DCallGraphSCCPass.cpp633 bool runOnSCC(CallGraphSCC &SCC) override { in runOnSCC() argument
646 SCC.getCallGraph().getModule().print(OS, nullptr); in runOnSCC()
650 for (CallGraphNode *CGN : SCC) { in runOnSCC()
667 SCC.getCallGraph().getModule().print(OS, nullptr); in runOnSCC()
684 static std::string getDescription(const CallGraphSCC &SCC) { in getDescription() argument
687 for (CallGraphNode *CGN : SCC) { in getDescription()
702 bool CallGraphSCCPass::skipSCC(CallGraphSCC &SCC) const { in skipSCC()
704 SCC.getCallGraph().getModule().getContext().getOptPassGate(); in skipSCC()
705 return Gate.isEnabled() && !Gate.shouldRunPass(this, getDescription(SCC)); in skipSCC()
DDependenceGraphBuilder.cpp111 for (auto &SCC : make_range(scc_begin(&Graph), scc_end(&Graph))) { in createPiBlocks() local
112 if (SCC.size() > 1) in createPiBlocks()
113 ListOfSCCs.emplace_back(SCC.begin(), SCC.end()); in createPiBlocks()
/third_party/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 …]
/third_party/skia/third_party/externals/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()
DInlineSimple.cpp77 bool runOnSCC(CallGraphSCC &SCC) override;
117 bool SimpleInliner::runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument
119 return LegacyInlinerBase::runOnSCC(SCC); in runOnSCC()
DInliner.cpp501 bool LegacyInlinerBase::runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument
502 if (skipSCC(SCC)) in runOnSCC()
504 return inlineCalls(SCC); in runOnSCC()
528 inlineCallsImpl(CallGraphSCC &SCC, CallGraph &CG, in inlineCallsImpl() argument
538 for (CallGraphNode *Node : SCC) { in inlineCallsImpl()
556 for (CallGraphNode *Node : SCC) { in inlineCallsImpl()
742 if (SCC.isSingular()) { in inlineCallsImpl()
758 bool LegacyInlinerBase::inlineCalls(CallGraphSCC &SCC) { in inlineCalls() argument
769 SCC, CG, GetAssumptionCache, PSI, GetTLI, InsertLifetime, in inlineCalls()
873 PreservedAnalyses InlinerPass::run(LazyCallGraph::SCC &InitialC, in run()
[all …]
DAlwaysInliner.cpp115 bool runOnSCC(CallGraphSCC &SCC) override { return inlineCalls(SCC); } in runOnSCC() argument
DFunctionAttrs.cpp1410 PreservedAnalyses PostOrderFunctionAttrsPass::run(LazyCallGraph::SCC &C, in run()
1468 bool runOnSCC(CallGraphSCC &SCC) override;
1493 static bool runImpl(CallGraphSCC &SCC, AARGetterT AARGetter) { in runImpl() argument
1501 for (CallGraphNode *I : SCC) { in runImpl()
1516 bool PostOrderFunctionAttrsLegacyPass::runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument
1517 if (skipSCC(SCC)) in runOnSCC()
1519 return runImpl(SCC, LegacyAARGetter(*this)); in runOnSCC()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Passes/
DStandardInstrumentations.cpp46 if (any_isa<const LazyCallGraph::SCC *>(IR)) { in unwrapModule()
47 const LazyCallGraph::SCC *C = any_cast<const LazyCallGraph::SCC *>(IR); in unwrapModule()
83 void printIR(const LazyCallGraph::SCC *C, StringRef Banner, in printIR()
127 if (any_isa<const LazyCallGraph::SCC *>(IR)) { in unwrapAndPrint()
128 const LazyCallGraph::SCC *C = any_cast<const LazyCallGraph::SCC *>(IR); in unwrapAndPrint()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AMDGPU/
DSOPInstructions.td151 let Uses = [SCC] in {
154 } // End Uses = [SCC]
157 let Defs = [SCC] in {
167 } // End Defs = [SCC]
189 let Defs = [SCC] in {
198 } // End Defs = [SCC]
251 let hasSideEffects = 1, Uses = [EXEC], Defs = [EXEC, SCC] in {
262 } // End hasSideEffects = 1, Uses = [EXEC], Defs = [EXEC, SCC]
279 let Defs = [SCC] in {
281 } // End Defs = [SCC]
[all …]
DAMDGPUInline.cpp74 bool runOnSCC(CallGraphSCC &SCC) override;
99 bool AMDGPUInliner::runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument
101 return LegacyInlinerBase::runOnSCC(SCC); in runOnSCC()
DAMDGPUAnnotateKernelFeatures.cpp60 bool runOnSCC(CallGraphSCC &SCC) override;
343 bool AMDGPUAnnotateKernelFeatures::runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument
346 for (CallGraphNode *I : SCC) { in runOnSCC()
DAMDGPUPerfHintAnalysis.h30 bool runOnSCC(CallGraphSCC &SCC) override;
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Transforms/IPO/
DInliner.h43 bool runOnSCC(CallGraphSCC &SCC) override;
68 bool inlineCalls(CallGraphSCC &SCC);
103 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
DArgumentPromotion.h29 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
/third_party/protobuf/src/google/protobuf/compiler/cpp/
Dcpp_file.h116 void GenerateInitForSCC(const SCC* scc, const CrossFileReferences& refs,
171 const SCC* GetSCC(const Descriptor* d) { return scc_analyzer_.GetSCC(d); } in GetSCC()
182 std::vector<const SCC*> sccs_;
Dcpp_file.cc77 std::string GetSortKey<SCC>(const SCC& val) { in GetSortKey()
147 std::sort(sccs_.begin(), sccs_.end(), CompareSortKeys<SCC>); in FileGenerator()
459 std::unordered_set<const SCC*> strong_sccs;
460 std::unordered_set<const SCC*> weak_sccs;
472 const SCC* scc = GetSCC(msg); in GetCrossFileReferencesForField()
926 void FileGenerator::GenerateInitForSCC(const SCC* scc, in GenerateInitForSCC()
981 std::vector<const SCC*> regular_sccs; in GenerateInitForSCC()
982 std::vector<const SCC*> implicit_weak_sccs; in GenerateInitForSCC()
983 for (const SCC* child : scc->children) { in GenerateInitForSCC()
1000 for (const SCC* child : regular_sccs) { in GenerateInitForSCC()
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Coroutines/
DCoroSplit.cpp1357 static void splitCoroutine(Function &F, CallGraph &CG, CallGraphSCC &SCC) { in splitCoroutine() argument
1390 coro::updateCallGraph(F, Clones, CG, SCC); in splitCoroutine()
1428 static void createDevirtTriggerFunc(CallGraph &CG, CallGraphSCC &SCC) { in createDevirtTriggerFunc() argument
1445 SmallVector<CallGraphNode *, 8> Nodes(SCC.begin(), SCC.end()); in createDevirtTriggerFunc()
1447 SCC.initialize(Nodes); in createDevirtTriggerFunc()
1548 bool runOnSCC(CallGraphSCC &SCC) override { in runOnSCC()
1554 SCC.getCallGraph().getModule().getFunction("llvm.coro.prepare.retcon"); in runOnSCC()
1560 for (CallGraphNode *CGN : SCC) in runOnSCC()
1573 createDevirtTriggerFunc(CG, SCC); in runOnSCC()
1586 splitCoroutine(*F, CG, SCC); in runOnSCC()

123