| /external/protobuf/src/google/protobuf/compiler/ |
| D | scc.h | 50 struct SCC { struct
52 std::vector<const SCC*> children; argument
60 // This class is used for analyzing the SCC for each message, to ensure linear argument
|
| /external/cronet/third_party/protobuf/src/google/protobuf/compiler/ |
| D | scc.h | 50 struct SCC { struct
52 std::vector<const SCC*> children; argument
60 // This class is used for analyzing the SCC for each message, to ensure linear argument
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/ |
| D | SyntheticCountsUtils.cpp | 28 const SccTy &SCC, GetProfCountTy GetProfCount, AddCountTy AddCount) { in propagateFromSCC()
99 for (auto &SCC : reverse(SCCs)) in propagate() local
|
| D | CGSCCPassManager.cpp | 369 using SCC = LazyCallGraph::SCC; in incorporateNewSCCRange() typedef
431 using SCC = LazyCallGraph::SCC; in updateCGAndAnalysisManagerForFunctionPass() typedef
|
| D | CallGraphSCCPass.cpp | 633 bool runOnSCC(CallGraphSCC &SCC) override { in runOnSCC()
684 static std::string getDescription(const CallGraphSCC &SCC) { in getDescription()
|
| D | DDG.cpp | 187 for (auto &SCC : make_range(scc_begin(&F), scc_end(&F))) in DataDependenceGraph() local
|
| D | DependenceGraphBuilder.cpp | 111 for (auto &SCC : make_range(scc_begin(&Graph), scc_end(&Graph))) { in createPiBlocks() local
|
| /external/arm-trusted-firmware/docs/ |
| D | license.rst | 90 .. _SCC: http://www.simple-cc.org/ target in Other Projects
|
| /external/llvm/lib/Transforms/IPO/ |
| D | PruneEH.cpp | 64 static bool runImpl(CallGraphSCC &SCC, CallGraph &CG) { in runImpl()
182 bool PruneEH::runOnSCC(CallGraphSCC &SCC) { in runOnSCC()
|
| D | InlineAlways.cpp | 50 bool runOnSCC(CallGraphSCC &SCC) override { return inlineCalls(SCC); } in runOnSCC()
|
| D | InlineSimple.cpp | 99 bool SimpleInliner::runOnSCC(CallGraphSCC &SCC) { in runOnSCC()
|
| D | Inliner.cpp | 370 bool Inliner::runOnSCC(CallGraphSCC &SCC) { in runOnSCC()
376 bool Inliner::inlineCalls(CallGraphSCC &SCC) { in inlineCalls()
|
| D | ArgumentPromotion.cpp | 120 static bool runImpl(CallGraphSCC &SCC, CallGraph &CG, in runImpl()
141 bool ArgPromotion::runOnSCC(CallGraphSCC &SCC) { in runOnSCC()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/IPO/ |
| D | PruneEH.cpp | 63 static bool runImpl(CallGraphSCC &SCC, CallGraph &CG) { in runImpl()
178 bool PruneEH::runOnSCC(CallGraphSCC &SCC) { in runOnSCC()
|
| D | InlineSimple.cpp | 117 bool SimpleInliner::runOnSCC(CallGraphSCC &SCC) { in runOnSCC()
|
| D | AlwaysInliner.cpp | 115 bool runOnSCC(CallGraphSCC &SCC) override { return inlineCalls(SCC); } in runOnSCC()
|
| D | Inliner.cpp | 501 bool LegacyInlinerBase::runOnSCC(CallGraphSCC &SCC) { in runOnSCC()
528 inlineCallsImpl(CallGraphSCC &SCC, CallGraph &CG, in inlineCallsImpl()
758 bool LegacyInlinerBase::inlineCalls(CallGraphSCC &SCC) { in inlineCalls()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/ |
| D | CallGraphSCCPass.h | 127 bool runOnSCC(CallGraphSCC &SCC) override { return false; } in runOnSCC()
|
| D | LazyCallGraph.h | 116 class SCC; variable
439 SCC(RefSCC &OuterRefSCC, NodeRangeT &&Nodes) in SCC() function
|
| /external/llvm/include/llvm/Analysis/ |
| D | CallGraphSCCPass.h | 126 bool runOnSCC(CallGraphSCC &SCC) override { return false; } in runOnSCC()
|
| D | LazyCallGraph.h | 108 class SCC; variable
357 SCC(RefSCC &OuterRefSCC, NodeRangeT &&Nodes) in SCC() function
|
| /external/llvm/lib/IR/ |
| D | OptBisect.cpp | 70 static std::string getDescription(const CallGraphSCC &SCC) { in getDescription()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AMDGPU/ |
| D | AMDGPUInline.cpp | 99 bool AMDGPUInliner::runOnSCC(CallGraphSCC &SCC) { in runOnSCC()
|
| D | AMDGPUAnnotateKernelFeatures.cpp | 343 bool AMDGPUAnnotateKernelFeatures::runOnSCC(CallGraphSCC &SCC) { in runOnSCC()
|
| /external/llvm/lib/Analysis/ |
| D | GlobalsModRef.cpp | 453 const std::vector<CallGraphNode *> &SCC = *I; in CollectSCCMembership() local
471 const std::vector<CallGraphNode *> &SCC = *I; in AnalyzeCallGraph() local
|