Home
last modified time | relevance | path

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

/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DCGSCCPassManager.h120 extern template class AnalysisManager<LazyCallGraph::SCC, LazyCallGraph &>;
129 AnalysisManager<LazyCallGraph::SCC, LazyCallGraph &>;
136 PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &,
149 PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &,
196 LazyCallGraph *G;
210 ModuleAnalysisManager, LazyCallGraph::SCC, LazyCallGraph &>;
293 LazyCallGraph::SCC *UpdatedC;
316 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.h113 class LazyCallGraph {
186 friend class LazyCallGraph; variable
375 LazyCallGraph *G;
542 LazyCallGraph *G;
552 RefSCC(LazyCallGraph &G);
882 LazyCallGraph *G;
921 LazyCallGraph(Module &M,
924 LazyCallGraph(LazyCallGraph &&G);
925 LazyCallGraph &operator=(LazyCallGraph &&RHS);
1219 inline LazyCallGraph::Edge::Kind LazyCallGraph::Edge::getKind() const { in getKind()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Analysis/
H A DCGSCCPassManager.cpp49 template class AnalysisManager<LazyCallGraph::SCC, LazyCallGraph &>;
54 LazyCallGraph::SCC, LazyCallGraph &>;
61 PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &,
74 LazyCallGraph::SCC *C = &InitialC; in run()
168 SmallDenseSet<std::pair<LazyCallGraph::Node *, LazyCallGraph::SCC *>, 4> in run()
829 static LazyCallGraph::SCC *
831 LazyCallGraph::Node &N, LazyCallGraph::SCC *C, in incorporateNewSCCRange()
833 using SCC = LazyCallGraph::SCC; in incorporateNewSCCRange()
892 LazyCallGraph &G, LazyCallGraph::SCC &InitialC, LazyCallGraph::Node &N, in updateCGAndAnalysisManagerForPass()
1227 LazyCallGraph &G, LazyCallGraph::SCC &InitialC, LazyCallGraph::Node &N, in updateCGAndAnalysisManagerForFunctionPass()
[all …]
H A DLazyCallGraph.cpp65 LazyCallGraph::Node &N, LazyCallGraph::Edge::Kind EK) { in addEdge()
73 LazyCallGraph::EdgeSequence &LazyCallGraph::Node::populateSlow() { in populateSlow()
123 LazyCallGraph::Edge::Ref); in populateSlow()
157 LazyCallGraph::LazyCallGraph( in LazyCallGraph() function in LazyCallGraph
210 LazyCallGraph::LazyCallGraph(LazyCallGraph &&G) in LazyCallGraph() function in LazyCallGraph
227 LazyCallGraph &LazyCallGraph::operator=(LazyCallGraph &&G) { in operator =()
245 void LazyCallGraph::SCC::verify() { in verify()
328 LazyCallGraph::RefSCC::RefSCC(LazyCallGraph &G) : G(&G) {} in RefSCC()
1775 LazyCallGraph::Node &LazyCallGraph::insertInto(Function &F, Node *&MappedN) { in insertInto()
1789 LazyCallGraph::Node &LazyCallGraph::initNode(Function &F) { in initNode()
[all …]
/freebsd-13.1/contrib/llvm-project/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()
/freebsd-13.1/contrib/llvm-project/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()
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()
312 if (any_isa<const LazyCallGraph::SCC *>(IR)) { in shouldPrintIR()
313 const LazyCallGraph::SCC *C = any_cast<const LazyCallGraph::SCC *>(IR); in shouldPrintIR()
350 if (any_isa<const LazyCallGraph::SCC *>(IR)) { in unwrapAndPrint()
351 const LazyCallGraph::SCC *C = any_cast<const LazyCallGraph::SCC *>(IR); in unwrapAndPrint()
[all …]
H A DPassBuilder.cpp369 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &, in run()
370 LazyCallGraph &, CGSCCUpdateResult &UR) { in run()
383 Result run(LazyCallGraph::SCC &, CGSCCAnalysisManager &, LazyCallGraph &G) { in run()
2720 LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &, \ in parseCGSCCPass()
/freebsd-13.1/contrib/llvm-project/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()
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Transforms/Coroutines/
H A DCoroSplit.h27 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
28 LazyCallGraph &CG, CGSCCUpdateResult &UR);
/freebsd-13.1/contrib/llvm-project/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.h45 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
46 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.h2739 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
2740 LazyCallGraph &CG, CGSCCUpdateResult &UR);
/freebsd-13.1/contrib/llvm-project/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.cpp824 PreservedAnalyses InlinerPass::run(LazyCallGraph::SCC &InitialC, in run()
825 CGSCCAnalysisManager &AM, LazyCallGraph &CG, in run()
931 LazyCallGraph::Node &N = *CG.lookup(F); in run()
1074 LazyCallGraph::SCC *OldC = C; in run()
H A DArgumentPromotion.cpp1011 PreservedAnalyses ArgumentPromotionPass::run(LazyCallGraph::SCC &C, in run()
1013 LazyCallGraph &CG, in run()
1021 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 DAttributor.cpp2912 PreservedAnalyses AttributorCGSCCPass::run(LazyCallGraph::SCC &C, in run()
2914 LazyCallGraph &CG, in run()
2921 for (LazyCallGraph::Node &N : C) in run()
H A DOpenMPOpt.cpp4249 PreservedAnalyses OpenMPOptCGSCCPass::run(LazyCallGraph::SCC &C, in run()
4251 LazyCallGraph &CG, in run()
4260 for (LazyCallGraph::Node &N : C) { in run()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Coroutines/
H A DCoroSplit.cpp1863 LazyCallGraph::Node &N, const coro::Shape &Shape, in updateCallGraphAfterCoroutineSplit()
1864 const SmallVectorImpl<Function *> &Clones, LazyCallGraph::SCC &C, in updateCallGraphAfterCoroutineSplit()
1865 LazyCallGraph &CG, CGSCCAnalysisManager &AM, CGSCCUpdateResult &UR, in updateCallGraphAfterCoroutineSplit()
1969 static void replacePrepare(CallInst *Prepare, LazyCallGraph &CG, in replacePrepare()
1970 LazyCallGraph::SCC &C) { in replacePrepare()
2059 static bool replaceAllPrepares(Function *PrepareFn, LazyCallGraph &CG, in replaceAllPrepares()
2060 LazyCallGraph::SCC &C) { in replaceAllPrepares()
2105 PreservedAnalyses CoroSplitPass::run(LazyCallGraph::SCC &C, in run()
2124 SmallVector<LazyCallGraph::Node *, 4> Coroutines; in run()
2125 for (LazyCallGraph::Node &N : C) in run()
[all …]
/freebsd-13.1/lib/clang/libllvm/
H A DMakefile94 SRCS_MIN+= Analysis/LazyCallGraph.cpp