/freebsd-src/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/ |
H A D | CallGraphUpdater.h | 50 LazyCallGraph::SCC *SCC = nullptr; global() variable 63 initialize(CallGraph & CG,CallGraphSCC & SCC) initialize() argument 67 initialize(LazyCallGraph & LCG,LazyCallGraph::SCC & SCC,CGSCCAnalysisManager & AM,CGSCCUpdateResult & UR) initialize() argument
|
/freebsd-src/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | SyntheticCountsUtils.cpp | 24 const SccTy &SCC, GetProfCountTy GetProfCount, AddCountTy AddCount) { in propagateFromSCC() 95 for (auto &SCC : reverse(SCCs)) in propagate() local
|
H A D | CallGraphSCCPass.cpp | 678 runOnSCC(CallGraphSCC & SCC) runOnSCC() argument 729 getDescription(const CallGraphSCC & SCC) getDescription() argument [all...] |
H A D | DDG.cpp | 191 for (const auto &SCC : make_range(scc_begin(&F), scc_end(&F))) in DataDependenceGraph() local
|
H A D | DependenceGraphBuilder.cpp | 113 for (auto &SCC : make_range(scc_begin(&Graph), scc_end(&Graph))) { in createPiBlocks() local
|
H A D | GlobalsModRef.cpp | 473 const std::vector<CallGraphNode *> &SCC = *I; CollectSCCMembership() local 491 const std::vector<CallGraphNode *> &SCC = *I; AnalyzeCallGraph() local [all...] |
H A D | CGSCCPassManager.cpp | 810 using SCC = LazyCallGraph::SCC; incorporateNewSCCRange() typedef 874 using SCC = LazyCallGraph::SCC; updateCGAndAnalysisManagerForPass() typedef [all...] |
H A D | BlockFrequencyInfoImpl.cpp | 707 findIrreducibleHeaders(const BlockFrequencyInfoImplBase & BFI,const IrreducibleGraph & G,const std::vector<const IrreducibleGraph::IrrNode * > & SCC,LoopData::NodeList & Headers,LoopData::NodeList & Others) findIrreducibleHeaders() argument 776 createIrreducibleLoop(BlockFrequencyInfoImplBase & BFI,const IrreducibleGraph & G,LoopData * OuterLoop,std::list<LoopData>::iterator Insert,const std::vector<const IrreducibleGraph::IrrNode * > & SCC) createIrreducibleLoop() argument
|
/freebsd-src/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPUAnnotateKernelFeatures.cpp | 112 bool AMDGPUAnnotateKernelFeatures::runOnSCC(CallGraphSCC &SCC) { in runOnSCC()
|
H A D | AMDGPUPerfHintAnalysis.cpp | 393 bool AMDGPUPerfHintAnalysis::runOnSCC(CallGraphSCC &SCC) { in runOnSCC() argument
|
H A D | SIDefines.h | 361 SCC = 16, global() enumerator
|
/freebsd-src/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | CallGraphSCCPass.h | 131 bool runOnSCC(CallGraphSCC &SCC) override { return false; } in runOnSCC()
|
H A D | LazyCallGraph.h | 114 class SCC; variable 427 SCC(RefSCC &OuterRefSCC, NodeRangeT &&Nodes) SCC() function [all...] |
/freebsd-src/contrib/llvm-project/llvm/include/llvm/Passes/ |
H A D | PassBuilder.h | 817 run(LazyCallGraph::SCC &,CGSCCAnalysisManager &,LazyCallGraph & G) run() argument
|
/freebsd-src/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | StructurizeCFG.cpp | 397 auto &SCC = *SCCI; in INITIALIZE_PASS_DEPENDENCY() local
|
H A D | NewGVN.cpp | 1709 auto &SCC = SCCFinder.getComponentFor(I); isCycleFree() local [all...] |
/freebsd-src/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
H A D | FunctionAttrs.cpp | 1928 runImpl(CallGraphSCC & SCC,AARGetterT AARGetter) runImpl() argument [all...] |
H A D | OpenMPOpt.cpp | 2029 SmallVectorImpl<Function *> &SCC; global() member 5767 SmallVector<Function *, 16> SCC; run() local 5835 SmallVector<Function *, 16> SCC; run() local [all...] |
/freebsd-src/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
H A D | DAGCombiner.cpp | 12459 if (SDValue SCC = SimplifySetCC(getSetCCResultType(N0.getValueType()), N0, N1, visitSELECT_CC() local 13352 if (SDValue SCC = SimplifySelectCC(DL, N00, N01, ExtTrueVal, Zero, CC, true)) foldSextSetcc() local 13868 if (SDValue SCC = SimplifySelectCC( visitZERO_EXTEND() local 14070 if (SDValue SCC = SimplifySelectCC( visitANY_EXTEND() local 26821 SDValue SCC = SimplifySelectCC(DL, N0.getOperand(0), N0.getOperand(1), N1, N2, SimplifySelect() local 27281 if (SDValue SCC = DAG.FoldSetCC(CmpResVT, N0, N1, CC, DL)) { SimplifySelectCC() local 27348 SDValue Temp, SCC; SimplifySelectCC() local [all...] |