Home
last modified time | relevance | path

Searched refs:LazyCallGraph (Results 1 – 25 of 35) sorted by relevance

12

/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DCGSCCPassManager.h112 extern template class LLVM_TEMPLATE_ABI AllAnalysesOn<LazyCallGraph::SCC>;
115 AnalysisManager<LazyCallGraph::SCC, LazyCallGraph &>;
124 AnalysisManager<LazyCallGraph::SCC, LazyCallGraph &>;
131 PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &,
132 CGSCCUpdateResult &>::run(LazyCallGraph::SCC &InitialC,
134 LazyCallGraph &G, CGSCCUpdateResult &UR);
135 extern template class PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager,
136 LazyCallGraph &, CGSCCUpdateResult &>;
144 PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &,
149 struct RequireAnalysisPass<AnalysisT, LazyCallGraph::SCC, CGSCCAnalysisManager,
[all …]
H A DLazyCallGraph.h109 class LazyCallGraph {
162 friend class LazyCallGraph::EdgeSequence;
163 friend class LazyCallGraph::RefSCC;
181 friend class LazyCallGraph; variable
182 friend class LazyCallGraph::Node;
183 friend class LazyCallGraph::RefSCC;
193 friend class LazyCallGraph; variable
194 friend class LazyCallGraph::Node;
224 friend class LazyCallGraph; variable
225 friend class LazyCallGraph::Node;
[all …]
H A DMLInlineAdvisor.h36 void onPassEntry(LazyCallGraph::SCC *SCC) override;
37 void onPassExit(LazyCallGraph::SCC *SCC) override;
80 LazyCallGraph &CG;
87 std::map<const LazyCallGraph::Node *, unsigned> FunctionLevels;
90 llvm::SmallPtrSet<const LazyCallGraph::Node *, 1> NodesInLastSCC;
91 DenseSet<const LazyCallGraph::Node *> AllNodes;
H A DInlineAdvisor.h186 virtual void onPassEntry(LazyCallGraph::SCC *SCC = nullptr) {}
191 virtual void onPassExit(LazyCallGraph::SCC *SCC = nullptr) {}
350 LLVM_ABI PreservedAnalyses run(LazyCallGraph::SCC &InitialC,
351 CGSCCAnalysisManager &AM, LazyCallGraph &CG,
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DCGSCCPassManager.cpp51 template class LLVM_EXPORT_TEMPLATE AllAnalysesOn<LazyCallGraph::SCC>;
53 AnalysisManager<LazyCallGraph::SCC, LazyCallGraph &>;
54 template class PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager,
55 LazyCallGraph &, CGSCCUpdateResult &>;
59 ModuleAnalysisManager, LazyCallGraph::SCC, LazyCallGraph &>;
67 PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &,
68 CGSCCUpdateResult &>::run(LazyCallGraph::SCC &InitialC, in run()
70 LazyCallGraph &G, CGSCCUpdateResult &UR) { in run()
80 LazyCallGraph::SCC *C = &InitialC; in run()
112 PI.runAfterPassInvalidated<LazyCallGraph::SCC>(*Pass, PassPA); in run()
[all …]
H A DLazyCallGraph.cpp40 template struct LLVM_EXPORT_TEMPLATE Any::TypeId<const LazyCallGraph::SCC *>;
42 void LazyCallGraph::EdgeSequence::insertEdgeInternal(Node &TargetN, in insertEdgeInternal()
48 void LazyCallGraph::EdgeSequence::setEdgeKind(Node &TargetN, Edge::Kind EK) { in setEdgeKind()
52 bool LazyCallGraph::EdgeSequence::removeEdgeInternal(Node &TargetN) { in removeEdgeInternal()
62 static void addEdge(SmallVectorImpl<LazyCallGraph::Edge> &Edges, in addEdge()
63 DenseMap<LazyCallGraph::Node *, int> &EdgeIndexMap, in addEdge()
64 LazyCallGraph::Node &N, LazyCallGraph::Edge::Kind EK) { in addEdge()
69 Edges.emplace_back(LazyCallGraph::Edge(N, EK)); in addEdge()
72 LazyCallGraph::EdgeSequence &LazyCallGraph::Node::populateSlow() { in populateSlow()
108 LazyCallGraph::Edge::Call); in populateSlow()
[all …]
H A DMLInlineAdvisor.cpp209 void MLInlineAdvisor::onPassEntry(LazyCallGraph::SCC *CurSCC) { in onPassEntry()
259 void MLInlineAdvisor::onPassExit(LazyCallGraph::SCC *CurSCC) { in onPassExit()
271 for (const LazyCallGraph::Node *N : NodesInLastSCC) { in onPassExit()
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DCallGraphUpdater.h44 LazyCallGraph *LCG = nullptr;
45 LazyCallGraph::SCC *SCC = nullptr;
58 void initialize(LazyCallGraph &LCG, LazyCallGraph::SCC &SCC, in initialize()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DCallGraphUpdater.cpp36 LazyCallGraph::Node &N = LCG->get(*DeadFn); in finalize()
66 LazyCallGraph::Node &N = LCG->get(Fn); in reanalyzeFunction()
67 LazyCallGraph::SCC *C = LCG->lookupSCC(N); in reanalyzeFunction()
95 LazyCallGraph::Node &OldLCGN = LCG->get(OldFn); in replaceFunctionWith()
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Coroutines/
H A DCoroAnnotationElide.h29 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
30 LazyCallGraph &CG, CGSCCUpdateResult &UR);
H A DCoroSplit.h49 LLVM_ABI PreservedAnalyses run(LazyCallGraph::SCC &C,
50 CGSCCAnalysisManager &AM, LazyCallGraph &CG,
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/
H A DArgumentPromotion.h29 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
30 LazyCallGraph &CG, CGSCCUpdateResult &UR);
H A DFunctionAttrs.h54 LLVM_ABI PreservedAnalyses run(LazyCallGraph::SCC &C,
55 CGSCCAnalysisManager &AM, LazyCallGraph &CG,
H A DOpenMPOpt.h13 #include "llvm/Analysis/LazyCallGraph.h"
58 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
59 LazyCallGraph &CG, CGSCCUpdateResult &UR);
H A DInliner.h43 LLVM_ABI PreservedAnalyses run(LazyCallGraph::SCC &C,
44 CGSCCAnalysisManager &AM, LazyCallGraph &CG,
H A DSampleProfileMatcher.h29 LazyCallGraph &CG;
121 Module &M, SampleProfileReader &Reader, LazyCallGraph &CG, in SampleProfileMatcher()
H A DSampleProfileProbe.h64 void runAfterPass(const LazyCallGraph::SCC *C);
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUPerfHintAnalysis.h29 class LazyCallGraph; variable
57 bool run(const GCNTargetMachine &TM, LazyCallGraph &CG);
H A DAMDGPUPerfHintAnalysis.cpp443 LazyCallGraph &CG) { in run()
448 for (LazyCallGraph::RefSCC &RC : CG.postorder_ref_sccs()) { in run()
449 for (LazyCallGraph::SCC &SCC : RC) { in run()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Coroutines/
H A DCoroAnnotationElide.cpp107 PreservedAnalyses CoroAnnotationElidePass::run(LazyCallGraph::SCC &C, in run()
109 LazyCallGraph &CG, in run()
118 for (LazyCallGraph::Node &N : C) { in run()
H A DCoroSplit.cpp2038 static LazyCallGraph::SCC &updateCallGraphAfterCoroutineSplit( in updateCallGraphAfterCoroutineSplit()
2039 LazyCallGraph::Node &N, const coro::Shape &Shape, in updateCallGraphAfterCoroutineSplit()
2040 const SmallVectorImpl<Function *> &Clones, LazyCallGraph::SCC &C, in updateCallGraphAfterCoroutineSplit()
2041 LazyCallGraph &CG, CGSCCAnalysisManager &AM, CGSCCUpdateResult &UR, in updateCallGraphAfterCoroutineSplit()
2077 static void replacePrepare(CallInst *Prepare, LazyCallGraph &CG, in replacePrepare()
2078 LazyCallGraph::SCC &C) { in replacePrepare()
2113 static bool replaceAllPrepares(Function *PrepareFn, LazyCallGraph &CG, in replaceAllPrepares()
2114 LazyCallGraph::SCC &C) { in replaceAllPrepares()
2202 PreservedAnalyses CoroSplitPass::run(LazyCallGraph::SCC &C, in run()
2204 LazyCallGraph &CG, CGSCCUpdateResult &UR) { in run()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DInliner.cpp206 PreservedAnalyses InlinerPass::run(LazyCallGraph::SCC &InitialC, in run()
207 CGSCCAnalysisManager &AM, LazyCallGraph &CG, in run()
314 LazyCallGraph::Node &N = *CG.lookup(F); in run()
352 LazyCallGraph::SCC *CalleeSCC = CG.lookupSCC(*CG.lookup(Callee)); in run()
498 LazyCallGraph::SCC *OldC = C; in run()
H A DSampleProfileProbe.cpp103 else if (const auto **C = llvm::any_cast<const LazyCallGraph::SCC *>(&IR)) in runAfterPass()
116 void PseudoProbeVerifier::runAfterPass(const LazyCallGraph::SCC *C) { in runAfterPass()
117 for (const LazyCallGraph::Node &N : *C) in runAfterPass()
/freebsd/contrib/llvm-project/llvm/include/llvm/Passes/
H A DPassBuilder.h922 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &, in run()
923 LazyCallGraph &, CGSCCUpdateResult &UR) { in run()
935 Result run(LazyCallGraph::SCC &, CGSCCAnalysisManager &, LazyCallGraph &G) { in run()
/freebsd/contrib/llvm-project/llvm/lib/Passes/
H A DStandardInstrumentations.cpp175 if (const auto *C = unwrapIR<LazyCallGraph::SCC>(IR)) { in unwrapModule()
176 for (const LazyCallGraph::Node &N : *C) { in unwrapModule()
218 void printIR(raw_ostream &OS, const LazyCallGraph::SCC *C) { in printIR()
219 for (const LazyCallGraph::Node &N : *C) { in printIR()
247 if (const auto *C = unwrapIR<LazyCallGraph::SCC>(IR)) in getIRName()
268 bool sccContainsFilterPrintFunc(const LazyCallGraph::SCC &C) { in sccContainsFilterPrintFunc()
270 [](const LazyCallGraph::Node &N) { in sccContainsFilterPrintFunc()
283 if (const auto *C = unwrapIR<LazyCallGraph::SCC>(IR)) in shouldPrintIR()
317 if (const auto *C = unwrapIR<LazyCallGraph::SCC>(IR)) { in unwrapAndPrint()
362 if (const auto *C = unwrapIR<LazyCallGraph::SCC>(IR)) in getModuleForComparison()
[all …]

12