Home
last modified time | relevance | path

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

12

/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DCGSCCPassManager.h114 extern template class AnalysisManager<LazyCallGraph::SCC, LazyCallGraph &>;
123 AnalysisManager<LazyCallGraph::SCC, LazyCallGraph &>;
130 PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &,
143 PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &,
196 LazyCallGraph *G;
210 ModuleAnalysisManager, LazyCallGraph::SCC, LazyCallGraph &>;
283 LazyCallGraph::SCC *UpdatedC;
306 SmallDenseSet<std::pair<LazyCallGraph::Node *, LazyCallGraph::SCC *>, 4>
415 Result run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM, LazyCallGraph &);
436 LazyCallGraph &G, LazyCallGraph::SCC &C, LazyCallGraph::Node &N,
[all …]
H A DLazyCallGraph.h110 class LazyCallGraph {
183 friend class LazyCallGraph; variable
372 LazyCallGraph *G;
548 LazyCallGraph *G;
558 RefSCC(LazyCallGraph &G);
888 LazyCallGraph *G;
940 LazyCallGraph(Module &M,
943 LazyCallGraph(LazyCallGraph &&G);
944 LazyCallGraph &operator=(LazyCallGraph &&RHS);
1218 inline LazyCallGraph::Edge::Kind LazyCallGraph::Edge::getKind() const { in getKind()
[all …]
H A DMLInlineAdvisor.h36 void onPassEntry(LazyCallGraph::SCC *SCC) override;
37 void onPassExit(LazyCallGraph::SCC *SCC) override;
80 LazyCallGraph &CG;
86 std::map<const LazyCallGraph::Node *, unsigned> FunctionLevels;
89 llvm::SmallPtrSet<const LazyCallGraph::Node *, 1> NodesInLastSCC;
90 DenseSet<const LazyCallGraph::Node *> AllNodes;
H A DInlineAdvisor.h185 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-14.2/contrib/llvm-project/llvm/lib/Analysis/
H A DCGSCCPassManager.cpp50 template class AnalysisManager<LazyCallGraph::SCC, LazyCallGraph &>;
55 LazyCallGraph::SCC, LazyCallGraph &>;
62 PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &,
75 LazyCallGraph::SCC *C = &InitialC; in run()
158 SmallDenseSet<std::pair<LazyCallGraph::Node *, LazyCallGraph::SCC *>, 4> in run()
172 for (LazyCallGraph::RefSCC &RC : in run()
806 static LazyCallGraph::SCC *
808 LazyCallGraph::Node &N, LazyCallGraph::SCC *C, in incorporateNewSCCRange()
869 LazyCallGraph &G, LazyCallGraph::SCC &InitialC, LazyCallGraph::Node &N, in updateCGAndAnalysisManagerForPass()
1202 LazyCallGraph &G, LazyCallGraph::SCC &InitialC, LazyCallGraph::Node &N, in updateCGAndAnalysisManagerForFunctionPass()
[all …]
H A DLazyCallGraph.cpp62 LazyCallGraph::Node &N, LazyCallGraph::Edge::Kind EK) { in addEdge()
70 LazyCallGraph::EdgeSequence &LazyCallGraph::Node::populateSlow() { in populateSlow()
120 LazyCallGraph::Edge::Ref); in populateSlow()
154 LazyCallGraph::LazyCallGraph( in LazyCallGraph() function in LazyCallGraph
207 LazyCallGraph::LazyCallGraph(LazyCallGraph &&G) in LazyCallGraph() function in LazyCallGraph
222 LazyCallGraph &LazyCallGraph::operator=(LazyCallGraph &&G) { in operator =()
240 void LazyCallGraph::SCC::verify() { in verify()
323 LazyCallGraph::RefSCC::RefSCC(LazyCallGraph &G) : G(&G) {} in RefSCC()
1772 LazyCallGraph::Node &LazyCallGraph::insertInto(Function &F, Node *&MappedN) { in insertInto()
1786 LazyCallGraph::Node &LazyCallGraph::initNode(Function &F) { in initNode()
[all …]
H A DMLInlineAdvisor.cpp179 void MLInlineAdvisor::onPassEntry(LazyCallGraph::SCC *LastSCC) { in onPassEntry()
231 void MLInlineAdvisor::onPassExit(LazyCallGraph::SCC *LastSCC) { in onPassExit()
H A DInlineAdvisor.cpp639 LazyCallGraph::SCC &InitialC, CGSCCAnalysisManager &AM, LazyCallGraph &CG, in run()
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DCallGraphUpdater.h49 LazyCallGraph *LCG = nullptr;
50 LazyCallGraph::SCC *SCC = nullptr;
67 void initialize(LazyCallGraph &LCG, LazyCallGraph::SCC &SCC, in initialize()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DCallGraphUpdater.cpp58 LazyCallGraph::Node &N = LCG->get(*DeadFn); in finalize()
95 LazyCallGraph::Node &N = LCG->get(Fn); in reanalyzeFunction()
96 LazyCallGraph::SCC *C = LCG->lookupSCC(N); in reanalyzeFunction()
141 LazyCallGraph::Node &OldLCGN = LCG->get(OldFn); in replaceFunctionWith()
/freebsd-14.2/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.h58 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 DSampleProfileProbe.h62 void runAfterPass(const LazyCallGraph::SCC *C);
/freebsd-14.2/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-14.2/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DInliner.cpp200 PreservedAnalyses InlinerPass::run(LazyCallGraph::SCC &InitialC, in run()
201 CGSCCAnalysisManager &AM, LazyCallGraph &CG, in run()
307 LazyCallGraph::Node &N = *CG.lookup(F); in run()
345 LazyCallGraph::SCC *CalleeSCC = CG.lookupSCC(*CG.lookup(Callee)); in run()
489 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()
H A DFunctionAttrs.cpp1859 PreservedAnalyses PostOrderFunctionAttrsPass::run(LazyCallGraph::SCC &C, in run()
1861 LazyCallGraph &CG, in run()
1868 LazyCallGraph::Node &N = *C.begin(); in run()
1883 for (LazyCallGraph::Node &N : C) { in run()
1969 static bool deduceFunctionAttributeInRPO(Module &M, LazyCallGraph &CG) { in deduceFunctionAttributeInRPO()
1980 for (LazyCallGraph::RefSCC &RC : CG.postorder_ref_sccs()) { in deduceFunctionAttributeInRPO()
1981 for (LazyCallGraph::SCC &SCC : RC) { in deduceFunctionAttributeInRPO()
H A DArgumentPromotion.cpp803 PreservedAnalyses ArgumentPromotionPass::run(LazyCallGraph::SCC &C, in run()
805 LazyCallGraph &CG, in run()
817 for (LazyCallGraph::Node &N : C) { in run()
H A DSampleProfile.cpp534 ProfileSummaryInfo *_PSI, LazyCallGraph &CG);
573 std::vector<Function *> buildFunctionOrder(Module &M, LazyCallGraph &CG);
1887 SampleProfileLoader::buildFunctionOrder(Module &M, LazyCallGraph &CG) { in buildFunctionOrder()
1979 for (LazyCallGraph::RefSCC &RC : CG.postorder_ref_sccs()) { in buildFunctionOrder()
1980 for (LazyCallGraph::SCC &C : RC) { in buildFunctionOrder()
1981 for (LazyCallGraph::Node &N : C) { in buildFunctionOrder()
2544 LazyCallGraph &CG) { in runOnModule()
2728 LazyCallGraph &CG = AM.getResult<LazyCallGraphAnalysis>(M); in run()
H A DAttributor.cpp4041 PreservedAnalyses AttributorCGSCCPass::run(LazyCallGraph::SCC &C, in run()
4043 LazyCallGraph &CG, in run()
4050 for (LazyCallGraph::Node &N : C) in run()
4097 PreservedAnalyses AttributorLightCGSCCPass::run(LazyCallGraph::SCC &C, in run()
4099 LazyCallGraph &CG, in run()
4106 for (LazyCallGraph::Node &N : C) in run()
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Passes/
H A DPassBuilder.h804 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &, in run()
805 LazyCallGraph &, CGSCCUpdateResult &UR) { in run()
817 Result run(LazyCallGraph::SCC &, CGSCCAnalysisManager &, LazyCallGraph &G) { in run()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Passes/
H A DStandardInstrumentations.cpp165 if (const auto *C = unwrapIR<LazyCallGraph::SCC>(IR)) { in unwrapModule()
166 for (const LazyCallGraph::Node &N : *C) { in unwrapModule()
202 void printIR(raw_ostream &OS, const LazyCallGraph::SCC *C) { in printIR()
203 for (const LazyCallGraph::Node &N : *C) { in printIR()
225 if (const auto *C = unwrapIR<LazyCallGraph::SCC>(IR)) in getIRName()
245 bool sccContainsFilterPrintFunc(const LazyCallGraph::SCC &C) { in sccContainsFilterPrintFunc()
247 [](const LazyCallGraph::Node &N) { in sccContainsFilterPrintFunc()
260 if (const auto *C = unwrapIR<LazyCallGraph::SCC>(IR)) in shouldPrintIR()
291 if (const auto *C = unwrapIR<LazyCallGraph::SCC>(IR)) { in unwrapAndPrint()
330 if (const auto *C = unwrapIR<LazyCallGraph::SCC>(IR)) in getModuleForComparison()
[all …]
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Coroutines/
H A DCoroSplit.cpp2068 LazyCallGraph::Node &N, const coro::Shape &Shape, in updateCallGraphAfterCoroutineSplit()
2069 const SmallVectorImpl<Function *> &Clones, LazyCallGraph::SCC &C, in updateCallGraphAfterCoroutineSplit()
2070 LazyCallGraph &CG, CGSCCAnalysisManager &AM, CGSCCUpdateResult &UR, in updateCallGraphAfterCoroutineSplit()
2114 static void replacePrepare(CallInst *Prepare, LazyCallGraph &CG, in replacePrepare()
2115 LazyCallGraph::SCC &C) { in replacePrepare()
2150 static bool replaceAllPrepares(Function *PrepareFn, LazyCallGraph &CG, in replaceAllPrepares()
2151 LazyCallGraph::SCC &C) { in replaceAllPrepares()
2175 PreservedAnalyses CoroSplitPass::run(LazyCallGraph::SCC &C, in run()
2191 SmallVector<LazyCallGraph::Node *> Coroutines; in run()
2192 for (LazyCallGraph::Node &N : C) in run()
[all …]

12