Searched refs:LazyCallGraph (Results 1 - 21 of 21) sorted by relevance

/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Coroutines/
H A DCoroSplit.h19 #include "llvm/Analysis/LazyCallGraph.h"
25 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
26 LazyCallGraph &CG, CGSCCUpdateResult &UR);
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DCGSCCPassManager.h28 /// To satisfy these goals, we use the LazyCallGraph which provides two graphs
97 #include "llvm/Analysis/LazyCallGraph.h"
117 extern template class AllAnalysesOn<LazyCallGraph::SCC>;
119 extern template class AnalysisManager<LazyCallGraph::SCC, LazyCallGraph &>;
128 AnalysisManager<LazyCallGraph::SCC, LazyCallGraph &>;
135 PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &,
136 CGSCCUpdateResult &>::run(LazyCallGraph
[all...]
H A DLazyCallGraph.h1 //===- LazyCallGraph.h - Analysis of a Module's call graph ------*- C++ -*-===//
30 /// see the documentation of the \c LazyCallGraph below.
109 /// FIXME: This class is named LazyCallGraph in a lame attempt to distinguish
112 class LazyCallGraph { class in namespace:llvm
168 friend class LazyCallGraph::EdgeSequence;
169 friend class LazyCallGraph::RefSCC;
187 friend class LazyCallGraph;
188 friend class LazyCallGraph::Node;
189 friend class LazyCallGraph::RefSCC;
199 friend class LazyCallGraph;
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DCGSCCPassManager.cpp17 #include "llvm/Analysis/LazyCallGraph.h"
40 template class AllAnalysesOn<LazyCallGraph::SCC>;
41 template class AnalysisManager<LazyCallGraph::SCC, LazyCallGraph &>;
42 template class PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager,
43 LazyCallGraph &, CGSCCUpdateResult &>;
46 LazyCallGraph::SCC, LazyCallGraph &>;
53 PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph
[all...]
H A DLazyCallGraph.cpp1 //===- LazyCallGraph.cpp - Analysis of a Module's call graph --------------===//
9 #include "llvm/Analysis/LazyCallGraph.h"
42 void LazyCallGraph::EdgeSequence::insertEdgeInternal(Node &TargetN,
48 void LazyCallGraph::EdgeSequence::setEdgeKind(Node &TargetN, Edge::Kind EK) {
52 bool LazyCallGraph::EdgeSequence::removeEdgeInternal(Node &TargetN) {
62 static void addEdge(SmallVectorImpl<LazyCallGraph::Edge> &Edges,
63 DenseMap<LazyCallGraph::Node *, int> &EdgeIndexMap,
64 LazyCallGraph::Node &N, LazyCallGraph::Edge::Kind EK) {
69 Edges.emplace_back(LazyCallGraph
156 LazyCallGraph::LazyCallGraph( function in class:LazyCallGraph
209 LazyCallGraph::LazyCallGraph(LazyCallGraph &&G) function in class:LazyCallGraph
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/
H A DArgumentPromotion.h13 #include "llvm/Analysis/LazyCallGraph.h"
41 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
42 LazyCallGraph &CG, CGSCCUpdateResult &UR);
H A DFunctionAttrs.h19 #include "llvm/Analysis/LazyCallGraph.h"
51 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
52 LazyCallGraph &CG, CGSCCUpdateResult &UR);
H A DOpenMPOpt.h13 #include "llvm/Analysis/LazyCallGraph.h"
60 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
61 LazyCallGraph &CG, CGSCCUpdateResult &UR);
H A DInliner.h16 #include "llvm/Analysis/LazyCallGraph.h"
104 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
105 LazyCallGraph &CG, CGSCCUpdateResult &UR);
H A DAttributor.h109 #include "llvm/Analysis/LazyCallGraph.h"
2120 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
2121 LazyCallGraph &CG, CGSCCUpdateResult &UR);
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DCallGraphUpdater.h11 /// if it is a "old style" CallGraph or an "new style" LazyCallGraph.
21 #include "llvm/Analysis/LazyCallGraph.h"
25 /// Wrapper to unify "old style" CallGraph and "new style" LazyCallGraph. This
48 LazyCallGraph *LCG = nullptr;
49 LazyCallGraph::SCC *SCC = nullptr;
66 void initialize(LazyCallGraph &LCG, LazyCallGraph::SCC &SCC,
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Passes/
H A DStandardInstrumentations.cpp18 #include "llvm/Analysis/LazyCallGraph.h"
46 if (any_isa<const LazyCallGraph::SCC *>(IR)) {
47 const LazyCallGraph::SCC *C = any_cast<const LazyCallGraph::SCC *>(IR);
48 for (const LazyCallGraph::Node &N : *C) {
91 void printIR(const LazyCallGraph::SCC *C, StringRef Banner,
94 for (const LazyCallGraph::Node &N : *C) {
135 if (any_isa<const LazyCallGraph::SCC *>(IR)) {
136 const LazyCallGraph::SCC *C = any_cast<const LazyCallGraph
[all...]
H A DPassBuilder.cpp39 #include "llvm/Analysis/LazyCallGraph.h"
325 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &,
326 LazyCallGraph &, CGSCCUpdateResult &UR) {
339 Result run(LazyCallGraph::SCC &, CGSCCAnalysisManager &, LazyCallGraph &G) {
2289 LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &, \
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DCallGraphUpdater.cpp11 /// if it is a "old style" CallGraph or an "new style" LazyCallGraph.
56 LazyCallGraph::Node &N = LCG->get(*DeadFn);
93 LazyCallGraph::Node &N = LCG->get(Fn);
94 LazyCallGraph::SCC *C = LCG->lookupSCC(N);
136 LazyCallGraph::Node &OldLCGN = LCG->get(OldFn);
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DInliner.cpp35 #include "llvm/Analysis/LazyCallGraph.h"
681 PreservedAnalyses InlinerPass::run(LazyCallGraph::SCC &InitialC,
682 CGSCCAnalysisManager &AM, LazyCallGraph &CG,
791 LazyCallGraph::Node &N = *CG.lookup(F);
938 LazyCallGraph::Node &CalleeN = *CG.lookup(*InlinedCallee);
939 for (LazyCallGraph::Edge &E : *CalleeN)
954 LazyCallGraph::SCC *OldC = C;
H A DArgumentPromotion.cpp46 #include "llvm/Analysis/LazyCallGraph.h"
1018 PreservedAnalyses ArgumentPromotionPass::run(LazyCallGraph::SCC &C,
1020 LazyCallGraph &CG,
1028 for (LazyCallGraph::Node &N : C) {
H A DFunctionAttrs.cpp29 #include "llvm/Analysis/LazyCallGraph.h"
1409 PreservedAnalyses PostOrderFunctionAttrsPass::run(LazyCallGraph::SCC &C,
1411 LazyCallGraph &CG,
1427 for (LazyCallGraph::Node &N : C) {
H A DOpenMPOpt.cpp1332 PreservedAnalyses OpenMPOptPass::run(LazyCallGraph::SCC &C,
1334 LazyCallGraph &CG, CGSCCUpdateResult &UR) {
1342 for (LazyCallGraph::Node &N : C)
H A DAttributor.cpp2108 PreservedAnalyses AttributorCGSCCPass::run(LazyCallGraph::SCC &C,
2110 LazyCallGraph &CG,
2117 for (LazyCallGraph::Node &N : C)
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Coroutines/
H A DCoroSplit.cpp1472 LazyCallGraph::Node &N, const coro::Shape &Shape,
1473 const SmallVectorImpl<Function *> &Clones, LazyCallGraph::SCC &C,
1474 LazyCallGraph &CG, CGSCCAnalysisManager &AM, CGSCCUpdateResult &UR,
1490 // state of the LazyCallGraph.
1496 // edges between 'f' and its funclets are added to it. LazyCallGraph only
1645 PreservedAnalyses CoroSplitPass::run(LazyCallGraph::SCC &C,
1647 LazyCallGraph &CG, CGSCCUpdateResult &UR) {
1648 // NB: One invariant of a valid LazyCallGraph::SCC is that it must contain a
1664 SmallVector<LazyCallGraph::Node *, 4> Coroutines;
1665 for (LazyCallGraph
[all...]
/freebsd-13-stable/lib/clang/libllvm/
H A DMakefile90 SRCS_MIN+= Analysis/LazyCallGraph.cpp

Completed in 224 milliseconds