| /freebsd-12.1/contrib/llvm/include/llvm/Analysis/ |
| H A D | CGSCCPassManager.h | 120 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;
301 SmallDenseSet<std::pair<LazyCallGraph::Node *, LazyCallGraph::SCC *>, 4>
360 SmallDenseSet<std::pair<LazyCallGraph::Node *, LazyCallGraph::SCC *>, 4>
550 Result run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM, LazyCallGraph &);
[all …]
|
| H A D | LazyCallGraph.h | 112 class LazyCallGraph {
187 friend class LazyCallGraph; variable
328 friend class LazyCallGraph; variable
384 LazyCallGraph *G;
551 LazyCallGraph *G;
561 RefSCC(LazyCallGraph &G);
895 LazyCallGraph *G;
936 LazyCallGraph(LazyCallGraph &&G);
937 LazyCallGraph &operator=(LazyCallGraph &&RHS);
1203 inline LazyCallGraph::Edge::Kind LazyCallGraph::Edge::getKind() const { in getKind()
[all …]
|
| /freebsd-12.1/contrib/llvm/lib/Analysis/ |
| H A D | CGSCCPassManager.cpp | 41 template class AnalysisManager<LazyCallGraph::SCC, LazyCallGraph &>;
46 LazyCallGraph::SCC, LazyCallGraph &>;
53 PassManager<LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &,
69 LazyCallGraph::SCC *C = &InitialC; in run()
360 static LazyCallGraph::SCC *
362 LazyCallGraph::Node &N, LazyCallGraph::SCC *C, in incorporateNewSCCRange()
364 using SCC = LazyCallGraph::SCC; in incorporateNewSCCRange()
422 LazyCallGraph &G, LazyCallGraph::SCC &InitialC, LazyCallGraph::Node &N, in updateCGAndAnalysisManagerForFunctionPass()
424 using Node = LazyCallGraph::Node; in updateCGAndAnalysisManagerForFunctionPass()
425 using Edge = LazyCallGraph::Edge; in updateCGAndAnalysisManagerForFunctionPass()
[all …]
|
| H A D | LazyCallGraph.cpp | 65 LazyCallGraph::Node &N, LazyCallGraph::Edge::Kind EK) { in addEdge()
73 LazyCallGraph::EdgeSequence &LazyCallGraph::Node::populateSlow() { in populateSlow()
123 LazyCallGraph::Edge::Ref); in populateSlow()
154 LazyCallGraph::LazyCallGraph(Module &M, TargetLibraryInfo &TLI) { in LazyCallGraph() function in LazyCallGraph
193 LazyCallGraph::LazyCallGraph(LazyCallGraph &&G) in LazyCallGraph() function in LazyCallGraph
201 LazyCallGraph &LazyCallGraph::operator=(LazyCallGraph &&G) { in operator =()
219 void LazyCallGraph::SCC::verify() { in verify()
254 LazyCallGraph &G = *OuterRefSCC->G; in isAncestorOf()
284 LazyCallGraph::RefSCC::RefSCC(LazyCallGraph &G) : G(&G) {} in RefSCC()
1543 LazyCallGraph::Node &LazyCallGraph::insertInto(Function &F, Node *&MappedN) { in insertInto()
[all …]
|
| /freebsd-12.1/contrib/llvm/lib/Passes/ |
| H A D | StandardInstrumentations.cpp | 47 if (any_isa<const LazyCallGraph::SCC *>(IR)) { in unwrapModule()
48 const LazyCallGraph::SCC *C = any_cast<const LazyCallGraph::SCC *>(IR); in unwrapModule()
49 for (const LazyCallGraph::Node &N : *C) { in unwrapModule()
84 void printIR(const LazyCallGraph::SCC *C, StringRef Banner, in printIR()
87 for (const LazyCallGraph::Node &N : *C) { in printIR()
128 if (any_isa<const LazyCallGraph::SCC *>(IR)) { in unwrapAndPrint()
129 const LazyCallGraph::SCC *C = any_cast<const LazyCallGraph::SCC *>(IR); in unwrapAndPrint()
|
| H A D | PassBuilder.cpp | 252 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &, in run()
253 LazyCallGraph &, CGSCCUpdateResult &UR) { in run()
266 Result run(LazyCallGraph::SCC &, CGSCCAnalysisManager &, LazyCallGraph &G) { in run()
1695 LazyCallGraph::SCC, CGSCCAnalysisManager, LazyCallGraph &, \ in parseCGSCCPass()
|
| /freebsd-12.1/contrib/llvm/include/llvm/Transforms/IPO/ |
| H A D | ArgumentPromotion.h | 30 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
31 LazyCallGraph &CG, CGSCCUpdateResult &UR);
|
| H A D | FunctionAttrs.h | 52 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
53 LazyCallGraph &CG, CGSCCUpdateResult &UR);
|
| H A D | Inliner.h | 104 PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM,
105 LazyCallGraph &CG, CGSCCUpdateResult &UR);
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/IPO/ |
| H A D | Inliner.cpp | 869 PreservedAnalyses InlinerPass::run(LazyCallGraph::SCC &InitialC, in run()
870 CGSCCAnalysisManager &AM, LazyCallGraph &CG, in run()
974 LazyCallGraph::Node &N = *CG.lookup(F); in run()
1147 LazyCallGraph::Node &CalleeN = *CG.lookup(*InlinedCallee); in run()
1148 for (LazyCallGraph::Edge &E : *CalleeN) in run()
1158 LazyCallGraph::SCC *OldC = C; in run()
|
| H A D | ArgumentPromotion.cpp | 982 PreservedAnalyses ArgumentPromotionPass::run(LazyCallGraph::SCC &C, in run()
984 LazyCallGraph &CG, in run()
992 for (LazyCallGraph::Node &N : C) { in run()
|
| H A D | FunctionAttrs.cpp | 1350 PreservedAnalyses PostOrderFunctionAttrsPass::run(LazyCallGraph::SCC &C, in run()
1352 LazyCallGraph &CG, in run()
1368 for (LazyCallGraph::Node &N : C) { in run()
|
| /freebsd-12.1/lib/clang/libllvm/ |
| H A D | Makefile | 73 SRCS_MIN+= Analysis/LazyCallGraph.cpp
|