Home
last modified time | relevance | path

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

/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
H A DCGSCCPassManager.h118 extern template class AllAnalysesOn<LazyCallGraph::SCC>;
120 extern template class AnalysisManager<LazyCallGraph::SCC, LazyCallGraph &>;
129 AnalysisManager<LazyCallGraph::SCC, LazyCallGraph &>;
136 PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &,
137 CGSCCUpdateResult &>::run(LazyCallGraph::SCC &InitialC,
139 LazyCallGraph &G, CGSCCUpdateResult &UR);
140 extern template class PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager,
141 LazyCallGraph &, CGSCCUpdateResult &>;
149 PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &,
154 struct RequireAnalysisPass<AnalysisT, LazyCallGraph::SCC, CGSCCAnalysisManager,
[all …]
H A DLazyCallGraph.h112 class LazyCallGraph {
166 friend class LazyCallGraph::EdgeSequence;
167 friend class LazyCallGraph::RefSCC;
185 friend class LazyCallGraph; variable
186 friend class LazyCallGraph::Node;
187 friend class LazyCallGraph::RefSCC;
197 friend class LazyCallGraph; variable
198 friend class LazyCallGraph::Node;
228 friend class LazyCallGraph; variable
229 friend class LazyCallGraph::Node;
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Analysis/
H A DCGSCCPassManager.cpp48 template class AllAnalysesOn<LazyCallGraph::SCC>;
49 template class AnalysisManager<LazyCallGraph::SCC, LazyCallGraph &>;
50 template class PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager,
51 LazyCallGraph &, CGSCCUpdateResult &>;
54 LazyCallGraph::SCC, LazyCallGraph &>;
61 PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &,
62 CGSCCUpdateResult &>::run(LazyCallGraph::SCC &InitialC, in run()
64 LazyCallGraph &G, CGSCCUpdateResult &UR) { in run()
74 LazyCallGraph::SCC *C = &InitialC; in run()
93 PI.runAfterPassInvalidated<LazyCallGraph::SCC>(*Pass, PassPA); in run()
[all …]
H A DLazyCallGraph.cpp43 void LazyCallGraph::EdgeSequence::insertEdgeInternal(Node &TargetN, in insertEdgeInternal()
49 void LazyCallGraph::EdgeSequence::setEdgeKind(Node &TargetN, Edge::Kind EK) { in setEdgeKind()
53 bool LazyCallGraph::EdgeSequence::removeEdgeInternal(Node &TargetN) { in removeEdgeInternal()
63 static void addEdge(SmallVectorImpl<LazyCallGraph::Edge> &Edges, in addEdge()
64 DenseMap<LazyCallGraph::Node *, int> &EdgeIndexMap, in addEdge()
65 LazyCallGraph::Node &N, LazyCallGraph::Edge::Kind EK) { in addEdge()
70 Edges.emplace_back(LazyCallGraph::Edge(N, EK)); in addEdge()
73 LazyCallGraph::EdgeSequence &LazyCallGraph::Node::populateSlow() { in populateSlow()
109 LazyCallGraph::Edge::Call); in populateSlow()
123 LazyCallGraph::Edge::Ref); in populateSlow()
[all …]
H A DCMakeLists.txt77 LazyCallGraph.cpp
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Utils/
H A DCallGraphUpdater.h48 LazyCallGraph *LCG = nullptr;
49 LazyCallGraph::SCC *SCC = nullptr;
66 void initialize(LazyCallGraph &LCG, LazyCallGraph::SCC &SCC, in initialize()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Passes/
H A DStandardInstrumentations.cpp204 if (any_isa<const LazyCallGraph::SCC *>(IR)) { in unwrapModule()
205 const LazyCallGraph::SCC *C = any_cast<const LazyCallGraph::SCC *>(IR); in unwrapModule()
206 for (const LazyCallGraph::Node &N : *C) { in unwrapModule()
244 void printIR(raw_ostream &OS, const LazyCallGraph::SCC *C) { in printIR()
245 for (const LazyCallGraph::Node &N : *C) { in printIR()
269 if (any_isa<const LazyCallGraph::SCC *>(IR)) { in getIRName()
270 const LazyCallGraph::SCC *C = any_cast<const LazyCallGraph::SCC *>(IR); in getIRName()
293 bool sccContainsFilterPrintFunc(const LazyCallGraph::SCC &C) { in sccContainsFilterPrintFunc()
295 [](const LazyCallGraph::Node &N) { in sccContainsFilterPrintFunc()
312 if (any_isa<const LazyCallGraph::SCC *>(IR)) { in shouldPrintIR()
[all …]
H A DPassBuilder.cpp367 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &, in run()
368 LazyCallGraph &, CGSCCUpdateResult &UR) { in run()
381 Result run(LazyCallGraph::SCC &, CGSCCAnalysisManager &, LazyCallGraph &G) { in run()
2717 LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &, \ in parseCGSCCPass()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
H A DCallGraphUpdater.cpp56 LazyCallGraph::Node &N = LCG->get(*DeadFn); in finalize()
93 LazyCallGraph::Node &N = LCG->get(Fn); in reanalyzeFunction()
94 LazyCallGraph::SCC *C = LCG->lookupSCC(N); in reanalyzeFunction()
137 LazyCallGraph::Node &OldLCGN = LCG->get(OldFn); in replaceFunctionWith()
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Coroutines/
H A DCoroSplit.h27 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
28 LazyCallGraph &CG, CGSCCUpdateResult &UR);
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/IPO/
H A DArgumentPromotion.h41 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
42 LazyCallGraph &CG, CGSCCUpdateResult &UR);
H A DFunctionAttrs.h51 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
52 LazyCallGraph &CG, CGSCCUpdateResult &UR);
H A DOpenMPOpt.h78 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
79 LazyCallGraph &CG, CGSCCUpdateResult &UR);
H A DInliner.h103 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
104 LazyCallGraph &CG, CGSCCUpdateResult &UR);
H A DSampleProfileProbe.h74 void runAfterPass(const LazyCallGraph::SCC *C);
H A DAttributor.h2429 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
2430 LazyCallGraph &CG, CGSCCUpdateResult &UR);
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/
H A DSampleProfileProbe.cpp106 else if (any_isa<const LazyCallGraph::SCC *>(IR)) in runAfterPass()
107 runAfterPass(any_cast<const LazyCallGraph::SCC *>(IR)); in runAfterPass()
119 void PseudoProbeVerifier::runAfterPass(const LazyCallGraph::SCC *C) { in runAfterPass()
120 for (const LazyCallGraph::Node &N : *C) in runAfterPass()
H A DInliner.cpp673 PreservedAnalyses InlinerPass::run(LazyCallGraph::SCC &InitialC, in run()
674 CGSCCAnalysisManager &AM, LazyCallGraph &CG, in run()
775 LazyCallGraph::Node &N = *CG.lookup(F); in run()
921 LazyCallGraph::SCC *OldC = C; in run()
H A DArgumentPromotion.cpp1012 PreservedAnalyses ArgumentPromotionPass::run(LazyCallGraph::SCC &C, in run()
1014 LazyCallGraph &CG, in run()
1022 for (LazyCallGraph::Node &N : C) { in run()
H A DFunctionAttrs.cpp1623 PreservedAnalyses PostOrderFunctionAttrsPass::run(LazyCallGraph::SCC &C, in run()
1625 LazyCallGraph &CG, in run()
1637 for (LazyCallGraph::Node &N : C) { in run()
H A DOpenMPOpt.cpp2499 PreservedAnalyses OpenMPOptCGSCCPass::run(LazyCallGraph::SCC &C, in run()
2501 LazyCallGraph &CG, in run()
2512 for (LazyCallGraph::Node &N : C) { in run()
H A DAttributor.cpp2450 PreservedAnalyses AttributorCGSCCPass::run(LazyCallGraph::SCC &C, in run()
2452 LazyCallGraph &CG, in run()
2459 for (LazyCallGraph::Node &N : C) in run()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Coroutines/
H A DCoroSplit.cpp1822 LazyCallGraph::Node &N, const coro::Shape &Shape, in updateCallGraphAfterCoroutineSplit()
1823 const SmallVectorImpl<Function *> &Clones, LazyCallGraph::SCC &C, in updateCallGraphAfterCoroutineSplit()
1824 LazyCallGraph &CG, CGSCCAnalysisManager &AM, CGSCCUpdateResult &UR, in updateCallGraphAfterCoroutineSplit()
1928 static void replacePrepare(CallInst *Prepare, LazyCallGraph &CG, in replacePrepare()
1929 LazyCallGraph::SCC &C) { in replacePrepare()
2018 static bool replaceAllPrepares(Function *PrepareFn, LazyCallGraph &CG, in replaceAllPrepares()
2019 LazyCallGraph::SCC &C) { in replaceAllPrepares()
2064 PreservedAnalyses CoroSplitPass::run(LazyCallGraph::SCC &C, in run()
2066 LazyCallGraph &CG, CGSCCUpdateResult &UR) { in run()
2083 SmallVector<LazyCallGraph::Node *, 4> Coroutines; in run()
[all …]
/netbsd-src/external/apache2/llvm/lib/libLLVMAnalysis/
H A DMakefile65 LazyCallGraph.cpp \
/netbsd-src/external/apache2/llvm/dist/llvm/utils/gn/secondary/llvm/lib/Analysis/
H A DBUILD.gn71 "LazyCallGraph.cpp",