Home
last modified time | relevance | path

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

12

/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DCGSCCPassManager.h112 extern template class AllAnalysesOn<LazyCallGraph::SCC>;
114 extern template class AnalysisManager<LazyCallGraph::SCC, LazyCallGraph &>;
123 AnalysisManager<LazyCallGraph::SCC, LazyCallGraph &>;
130 PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &,
131 CGSCCUpdateResult &>::run(LazyCallGraph::SCC &InitialC,
133 LazyCallGraph &G, CGSCCUpdateResult &UR);
134 extern template class PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager,
135 LazyCallGraph &, CGSCCUpdateResult &>;
143 PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &,
148 struct RequireAnalysisPass<AnalysisT, LazyCallGraph::SCC, CGSCCAnalysisManager,
[all …]
H A DLazyCallGraph.h110 class LazyCallGraph {
164 friend class LazyCallGraph::EdgeSequence;
165 friend class LazyCallGraph::RefSCC;
183 friend class LazyCallGraph; variable
184 friend class LazyCallGraph::Node;
185 friend class LazyCallGraph::RefSCC;
195 friend class LazyCallGraph; variable
196 friend class LazyCallGraph::Node;
226 friend class LazyCallGraph; variable
227 friend class LazyCallGraph::Node;
[all …]
H A DMLInlineAdvisor.h37 void onPassEntry(LazyCallGraph::SCC *SCC) override;
38 void onPassExit(LazyCallGraph::SCC *SCC) override;
81 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.h14 #include "llvm/Analysis/LazyCallGraph.h"
185 virtual void onPassEntry(LazyCallGraph::SCC *SCC = nullptr) {}
190 virtual void onPassExit(LazyCallGraph::SCC *SCC = nullptr) {}
354 PreservedAnalyses run(LazyCallGraph::SCC &InitialC, CGSCCAnalysisManager &AM,
355 LazyCallGraph &CG, CGSCCUpdateResult &UR);
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DCGSCCPassManager.cpp49 template class AllAnalysesOn<LazyCallGraph::SCC>;
50 template class AnalysisManager<LazyCallGraph::SCC, LazyCallGraph &>;
51 template class PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager,
52 LazyCallGraph &, CGSCCUpdateResult &>;
55 LazyCallGraph::SCC, LazyCallGraph &>;
62 PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &,
63 CGSCCUpdateResult &>::run(LazyCallGraph::SCC &InitialC, in run()
65 LazyCallGraph &G, CGSCCUpdateResult &UR) { in run()
75 LazyCallGraph::SCC *C = &InitialC; in run()
105 PI.runAfterPassInvalidated<LazyCallGraph::SCC>(*Pass, PassPA); in run()
[all …]
H A DLazyCallGraph.cpp40 void LazyCallGraph::EdgeSequence::insertEdgeInternal(Node &TargetN, in insertEdgeInternal()
46 void LazyCallGraph::EdgeSequence::setEdgeKind(Node &TargetN, Edge::Kind EK) { in setEdgeKind()
50 bool LazyCallGraph::EdgeSequence::removeEdgeInternal(Node &TargetN) { in removeEdgeInternal()
60 static void addEdge(SmallVectorImpl<LazyCallGraph::Edge> &Edges, in addEdge()
61 DenseMap<LazyCallGraph::Node *, int> &EdgeIndexMap, in addEdge()
62 LazyCallGraph::Node &N, LazyCallGraph::Edge::Kind EK) { in addEdge()
67 Edges.emplace_back(LazyCallGraph::Edge(N, EK)); in addEdge()
70 LazyCallGraph::EdgeSequence &LazyCallGraph::Node::populateSlow() { in populateSlow()
106 LazyCallGraph::Edge::Call); in populateSlow()
120 LazyCallGraph::Edge::Ref); in populateSlow()
[all …]
H A DMLInlineAdvisor.cpp195 void MLInlineAdvisor::onPassEntry(LazyCallGraph::SCC *CurSCC) { in onPassEntry()
245 void MLInlineAdvisor::onPassExit(LazyCallGraph::SCC *CurSCC) { in onPassExit()
257 for (const LazyCallGraph::Node *N : NodesInLastSCC) { in onPassExit()
H A DInlineAdvisor.cpp640 LazyCallGraph::SCC &InitialC, CGSCCAnalysisManager &AM, LazyCallGraph &CG, in run()
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DCallGraphUpdater.h43 LazyCallGraph *LCG = nullptr;
44 LazyCallGraph::SCC *SCC = nullptr;
57 void initialize(LazyCallGraph &LCG, LazyCallGraph::SCC &SCC, in initialize()
H A DSampleProfileLoaderBaseImpl.h160 buildTopDownFuncOrder(LazyCallGraph &CG,
163 for (LazyCallGraph::RefSCC &RC : CG.postorder_ref_sccs()) {
164 for (LazyCallGraph::SCC &C : RC) {
165 for (LazyCallGraph::Node &N : C) {
/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/IPO/
H A DArgumentPromotion.h29 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
30 LazyCallGraph &CG, CGSCCUpdateResult &UR);
H A DFunctionAttrs.h52 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
53 LazyCallGraph &CG, CGSCCUpdateResult &UR);
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.h42 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
43 LazyCallGraph &CG, CGSCCUpdateResult &UR);
H A DSampleProfileMatcher.h29 LazyCallGraph &CG;
121 Module &M, SampleProfileReader &Reader, LazyCallGraph &CG, in SampleProfileMatcher()
H A DSampleProfileProbe.h63 void runAfterPass(const LazyCallGraph::SCC *C);
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Coroutines/
H A DCoroSplit.h33 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
34 LazyCallGraph &CG, CGSCCUpdateResult &UR);
/freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DInliner.cpp208 PreservedAnalyses InlinerPass::run(LazyCallGraph::SCC &InitialC, in run()
209 CGSCCAnalysisManager &AM, LazyCallGraph &CG, in run()
316 LazyCallGraph::Node &N = *CG.lookup(F); in run()
354 LazyCallGraph::SCC *CalleeSCC = CG.lookupSCC(*CG.lookup(Callee)); in run()
496 LazyCallGraph::SCC *OldC = C; in run()
H A DSampleProfileProbe.cpp104 else if (const auto **C = llvm::any_cast<const LazyCallGraph::SCC *>(&IR)) in runAfterPass()
117 void PseudoProbeVerifier::runAfterPass(const LazyCallGraph::SCC *C) { in runAfterPass()
118 for (const LazyCallGraph::Node &N : *C) in runAfterPass()
H A DFunctionAttrs.cpp1880 PreservedAnalyses PostOrderFunctionAttrsPass::run(LazyCallGraph::SCC &C, in run()
1882 LazyCallGraph &CG, in run()
1889 LazyCallGraph::Node &N = *C.begin(); in run()
1904 for (LazyCallGraph::Node &N : C) { in run()
1990 static bool deduceFunctionAttributeInRPO(Module &M, LazyCallGraph &CG) { in deduceFunctionAttributeInRPO()
2001 for (LazyCallGraph::RefSCC &RC : CG.postorder_ref_sccs()) { in deduceFunctionAttributeInRPO()
2002 for (LazyCallGraph::SCC &SCC : RC) { in deduceFunctionAttributeInRPO()
H A DArgumentPromotion.cpp860 PreservedAnalyses ArgumentPromotionPass::run(LazyCallGraph::SCC &C, in run()
862 LazyCallGraph &CG, in run()
874 for (LazyCallGraph::Node &N : C) { in run()
/freebsd/contrib/llvm-project/llvm/include/llvm/Passes/
H A DPassBuilder.h878 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &, in run()
879 LazyCallGraph &, CGSCCUpdateResult &UR) { in run()
891 Result run(LazyCallGraph::SCC &, CGSCCAnalysisManager &, LazyCallGraph &G) { in run()
/freebsd/contrib/llvm-project/llvm/lib/Passes/
H A DStandardInstrumentations.cpp173 if (const auto *C = unwrapIR<LazyCallGraph::SCC>(IR)) { in unwrapModule()
174 for (const LazyCallGraph::Node &N : *C) { in unwrapModule()
216 void printIR(raw_ostream &OS, const LazyCallGraph::SCC *C) { in printIR()
217 for (const LazyCallGraph::Node &N : *C) { in printIR()
245 if (const auto *C = unwrapIR<LazyCallGraph::SCC>(IR)) in getIRName()
266 bool sccContainsFilterPrintFunc(const LazyCallGraph::SCC &C) { in sccContainsFilterPrintFunc()
268 [](const LazyCallGraph::Node &N) { in sccContainsFilterPrintFunc()
281 if (const auto *C = unwrapIR<LazyCallGraph::SCC>(IR)) in shouldPrintIR()
315 if (const auto *C = unwrapIR<LazyCallGraph::SCC>(IR)) { in unwrapAndPrint()
360 if (const auto *C = unwrapIR<LazyCallGraph::SCC>(IR)) in getModuleForComparison()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Coroutines/
H A DCoroSplit.cpp1989 LazyCallGraph::Node &N, const coro::Shape &Shape, in updateCallGraphAfterCoroutineSplit()
1990 const SmallVectorImpl<Function *> &Clones, LazyCallGraph::SCC &C, in updateCallGraphAfterCoroutineSplit()
1991 LazyCallGraph &CG, CGSCCAnalysisManager &AM, CGSCCUpdateResult &UR, in updateCallGraphAfterCoroutineSplit()
2023 static void replacePrepare(CallInst *Prepare, LazyCallGraph &CG, in replacePrepare()
2024 LazyCallGraph::SCC &C) { in replacePrepare()
2059 static bool replaceAllPrepares(Function *PrepareFn, LazyCallGraph &CG, in replaceAllPrepares()
2060 LazyCallGraph::SCC &C) { in replaceAllPrepares()
2084 PreservedAnalyses CoroSplitPass::run(LazyCallGraph::SCC &C, in run()
2086 LazyCallGraph &CG, CGSCCUpdateResult &UR) { in run()
2100 SmallVector<LazyCallGraph::Node *> Coroutines; in run()
[all …]

12