Home
last modified time | relevance | path

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

12

/llvm-project-15.0.7/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;
540 LazyCallGraph *G;
550 RefSCC(LazyCallGraph &G);
880 LazyCallGraph *G;
932 LazyCallGraph(Module &M,
935 LazyCallGraph(LazyCallGraph &&G);
936 LazyCallGraph &operator=(LazyCallGraph &&RHS);
1210 inline LazyCallGraph::Edge::Kind LazyCallGraph::Edge::getKind() const { in getKind()
[all …]
H A DMLInlineAdvisor.h34 void onPassEntry(LazyCallGraph::SCC *SCC) override;
35 void onPassExit(LazyCallGraph::SCC *SCC) override;
74 LazyCallGraph &CG;
80 std::map<const LazyCallGraph::Node *, unsigned> FunctionLevels;
83 llvm::SmallPtrSet<const LazyCallGraph::Node *, 1> NodesInLastSCC;
84 DenseSet<const LazyCallGraph::Node *> AllNodes;
H A DInlineAdvisor.h184 virtual void onPassEntry(LazyCallGraph::SCC *SCC = nullptr) {}
189 virtual void onPassExit(LazyCallGraph::SCC *SCC = nullptr) {}
280 PreservedAnalyses run(LazyCallGraph::SCC &InitialC, CGSCCAnalysisManager &AM,
281 LazyCallGraph &CG, CGSCCUpdateResult &UR);
/llvm-project-15.0.7/llvm/unittests/Analysis/
H A DLazyCallGraphTest.cpp225 LazyCallGraph CG(M, GetTLI); in buildCG()
232 LazyCallGraph CG = buildCG(*M); in TEST()
325 LazyCallGraph::RefSCC &D = *J++; in TEST()
341 LazyCallGraph::RefSCC &B = *J++; in TEST()
420 LazyCallGraph CG = buildCG(*M); in TEST()
458 LazyCallGraph CG = buildCG(*M); in TEST()
480 LazyCallGraph::SCC &D = *J++; in TEST()
490 LazyCallGraph::SCC &B = *J++; in TEST()
500 LazyCallGraph::SCC &C = *J++; in TEST()
510 LazyCallGraph::SCC &A = *J++; in TEST()
[all …]
H A DCGSCCPassManagerTest.cpp76 Result run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM, LazyCallGraph &) { in run() argument
1344 [&](LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM, LazyCallGraph &CG, in TEST_F()
1418 [&](LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM, LazyCallGraph &CG, in TEST_F()
1480 [&](LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM, LazyCallGraph &CG, in TEST_F()
1556 [&](LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM, LazyCallGraph &CG, in TEST_F()
1591 [&](LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM, LazyCallGraph &CG, in TEST_F()
1620 [&](LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM, LazyCallGraph &CG, in TEST_F()
1654 [&](LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM, LazyCallGraph &CG, in TEST_F()
1679 [&](LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM, LazyCallGraph &CG, in TEST_F()
1717 static SmallVector<LazyCallGraph::Node *> SCCNodes(LazyCallGraph::SCC &C) { in SCCNodes()
[all …]
/llvm-project-15.0.7/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()
163 SmallDenseSet<std::pair<LazyCallGraph::Node *, LazyCallGraph::SCC *>, 4> in run()
177 for (LazyCallGraph::RefSCC &RC : in run()
828 static LazyCallGraph::SCC *
830 LazyCallGraph::Node &N, LazyCallGraph::SCC *C, in incorporateNewSCCRange()
891 LazyCallGraph &G, LazyCallGraph::SCC &InitialC, LazyCallGraph::Node &N, in updateCGAndAnalysisManagerForPass()
1224 LazyCallGraph &G, LazyCallGraph::SCC &InitialC, LazyCallGraph::Node &N, in updateCGAndAnalysisManagerForFunctionPass()
[all …]
H A DLazyCallGraph.cpp67 LazyCallGraph::Node &N, LazyCallGraph::Edge::Kind EK) { in addEdge()
75 LazyCallGraph::EdgeSequence &LazyCallGraph::Node::populateSlow() { in populateSlow()
125 LazyCallGraph::Edge::Ref); in populateSlow()
159 LazyCallGraph::LazyCallGraph( in LazyCallGraph() function in LazyCallGraph
212 LazyCallGraph::LazyCallGraph(LazyCallGraph &&G) in LazyCallGraph() function in LazyCallGraph
228 LazyCallGraph &LazyCallGraph::operator=(LazyCallGraph &&G) { in operator =()
246 void LazyCallGraph::SCC::verify() { in verify()
329 LazyCallGraph::RefSCC::RefSCC(LazyCallGraph &G) : G(&G) {} in RefSCC()
1763 LazyCallGraph::Node &LazyCallGraph::insertInto(Function &F, Node *&MappedN) { in insertInto()
1777 LazyCallGraph::Node &LazyCallGraph::initNode(Function &F) { in initNode()
[all …]
H A DCMakeLists.txt83 LazyCallGraph.cpp
/llvm-project-15.0.7/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()
/llvm-project-15.0.7/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()
139 LazyCallGraph::Node &OldLCGN = LCG->get(OldFn); in replaceFunctionWith()
/llvm-project-15.0.7/llvm/include/llvm/Transforms/Coroutines/
H A DCoroSplit.h27 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
28 LazyCallGraph &CG, CGSCCUpdateResult &UR);
/llvm-project-15.0.7/llvm/include/llvm/Transforms/IPO/
H A DArgumentPromotion.h29 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
30 LazyCallGraph &CG, CGSCCUpdateResult &UR);
H A DOpenMPOpt.h45 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
46 LazyCallGraph &CG, CGSCCUpdateResult &UR);
H A DFunctionAttrs.h52 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
53 LazyCallGraph &CG, CGSCCUpdateResult &UR);
H A DInliner.h103 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
104 LazyCallGraph &CG, CGSCCUpdateResult &UR);
H A DSampleProfileProbe.h76 void runAfterPass(const LazyCallGraph::SCC *C);
/llvm-project-15.0.7/llvm/unittests/IR/
H A DPassBuilderCallbacksTest.cpp199 struct MockPassHandle<LazyCallGraph::SCC>
200 : MockPassHandleBase<MockPassHandle<LazyCallGraph::SCC>, LazyCallGraph::SCC,
201 CGSCCAnalysisManager, LazyCallGraph &,
208 LazyCallGraph &, CGSCCUpdateResult &UR) { in invalidateSCC()
254 struct MockAnalysisHandle<LazyCallGraph::SCC>
255 : MockAnalysisHandleBase<MockAnalysisHandle<LazyCallGraph::SCC>,
256 LazyCallGraph::SCC, CGSCCAnalysisManager,
257 LazyCallGraph &> {
258 MOCK_METHOD3(run, Analysis::Result(LazyCallGraph::SCC &,
264 MockAnalysisHandle<LazyCallGraph::SCC>() { setDefaults(); } in MockAnalysisHandle()
[all …]
/llvm-project-15.0.7/llvm/lib/Passes/
H A DStandardInstrumentations.cpp200 if (any_isa<const LazyCallGraph::SCC *>(IR)) { in unwrapModule()
201 const LazyCallGraph::SCC *C = any_cast<const LazyCallGraph::SCC *>(IR); in unwrapModule()
202 for (const LazyCallGraph::Node &N : *C) { in unwrapModule()
240 for (const LazyCallGraph::Node &N : *C) { in printIR()
264 if (any_isa<const LazyCallGraph::SCC *>(IR)) { in getIRName()
265 const LazyCallGraph::SCC *C = any_cast<const LazyCallGraph::SCC *>(IR); in getIRName()
307 if (any_isa<const LazyCallGraph::SCC *>(IR)) { in shouldPrintIR()
308 const LazyCallGraph::SCC *C = any_cast<const LazyCallGraph::SCC *>(IR); in shouldPrintIR()
344 if (any_isa<const LazyCallGraph::SCC *>(IR)) { in unwrapAndPrint()
345 const LazyCallGraph::SCC *C = any_cast<const LazyCallGraph::SCC *>(IR); in unwrapAndPrint()
[all …]
H A DPassBuilder.cpp292 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &, in run()
293 LazyCallGraph &, CGSCCUpdateResult &UR) { in run()
306 Result run(LazyCallGraph::SCC &, CGSCCAnalysisManager &, LazyCallGraph &G) { in run()
1322 LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &, \ in parseCGSCCPass()
/llvm-project-15.0.7/llvm/lib/Transforms/IPO/
H A DSampleProfileProbe.cpp105 else if (any_isa<const LazyCallGraph::SCC *>(IR)) in runAfterPass()
106 runAfterPass(any_cast<const LazyCallGraph::SCC *>(IR)); in runAfterPass()
118 void PseudoProbeVerifier::runAfterPass(const LazyCallGraph::SCC *C) { in runAfterPass()
119 for (const LazyCallGraph::Node &N : *C) in runAfterPass()
H A DInliner.cpp743 PreservedAnalyses InlinerPass::run(LazyCallGraph::SCC &InitialC, in run()
744 CGSCCAnalysisManager &AM, LazyCallGraph &CG, in run()
849 LazyCallGraph::Node &N = *CG.lookup(F); in run()
886 LazyCallGraph::SCC *CalleeSCC = CG.lookupSCC(*CG.lookup(Callee)); in run()
1024 LazyCallGraph::SCC *OldC = C; in run()
H A DArgumentPromotion.cpp804 PreservedAnalyses ArgumentPromotionPass::run(LazyCallGraph::SCC &C, in run()
806 LazyCallGraph &CG, in run()
818 for (LazyCallGraph::Node &N : C) { in run()
/llvm-project-15.0.7/llvm/lib/Transforms/Coroutines/
H A DCoroSplit.cpp1972 LazyCallGraph::Node &N, const coro::Shape &Shape, in updateCallGraphAfterCoroutineSplit()
1973 const SmallVectorImpl<Function *> &Clones, LazyCallGraph::SCC &C, in updateCallGraphAfterCoroutineSplit()
1974 LazyCallGraph &CG, CGSCCAnalysisManager &AM, CGSCCUpdateResult &UR, in updateCallGraphAfterCoroutineSplit()
2018 static void replacePrepare(CallInst *Prepare, LazyCallGraph &CG, in replacePrepare()
2019 LazyCallGraph::SCC &C) { in replacePrepare()
2054 static bool replaceAllPrepares(Function *PrepareFn, LazyCallGraph &CG, in replaceAllPrepares()
2055 LazyCallGraph::SCC &C) { in replaceAllPrepares()
2075 PreservedAnalyses CoroSplitPass::run(LazyCallGraph::SCC &C, in run()
2091 SmallVector<LazyCallGraph::Node *> Coroutines; in run()
2092 for (LazyCallGraph::Node &N : C) in run()
[all …]
/llvm-project-15.0.7/llvm/utils/gn/secondary/llvm/lib/Analysis/
H A DBUILD.gn72 "LazyCallGraph.cpp",

12