| /external/swiftshader/third_party/llvm-7.0/llvm/unittests/Analysis/ |
| LazyCallGraphTest.cpp | 1 //===- LazyCallGraphTest.cpp - Unit tests for the lazy CG analysis --------===//
222 LazyCallGraph CG(M, TLI);
223 return CG;
229 LazyCallGraph CG = buildCG(*M);
234 auto I = CG.begin();
259 EXPECT_EQ(CG.end(), I);
319 CG.buildRefSCCs();
320 auto J = CG.postorder_ref_scc_begin();
336 EXPECT_EQ(&D, &*CG.postorder_ref_scc_begin());
352 EXPECT_EQ(&C, &*std::next(CG.postorder_ref_scc_begin()))
[all...] |
| CallGraphTest.cpp | 1 //=======- CallGraphTest.cpp - Unit tests for the CG analysis -------------===//
49 CallGraph CG(M);
51 canSpecializeGraphTraitsIterators(&CG);
57 CallGraph CG(M);
59 canSpecializeGraphTraitsIterators(const_cast<const CallGraph *>(&CG));
|
| /external/llvm/unittests/Analysis/ |
| LazyCallGraphTest.cpp | 1 //===- LazyCallGraphTest.cpp - Unit tests for the lazy CG analysis --------===//
126 LazyCallGraph CG(*M);
131 auto I = CG.begin();
132 LazyCallGraph::Node &A1 = (I++)->getNode(CG);
134 LazyCallGraph::Node &A2 = (I++)->getNode(CG);
136 LazyCallGraph::Node &A3 = (I++)->getNode(CG);
138 LazyCallGraph::Node &B1 = (I++)->getNode(CG);
140 LazyCallGraph::Node &B2 = (I++)->getNode(CG);
142 LazyCallGraph::Node &B3 = (I++)->getNode(CG);
144 LazyCallGraph::Node &C1 = (I++)->getNode(CG);
[all...] |
| CallGraphTest.cpp | 1 //=======- CallGraphTest.cpp - Unit tests for the CG analysis -------------===//
49 CallGraph CG(M);
51 canSpecializeGraphTraitsIterators(&CG);
57 CallGraph CG(M);
59 canSpecializeGraphTraitsIterators(const_cast<const CallGraph *>(&CG));
|
| /external/swiftshader/third_party/LLVM/lib/Transforms/IPO/ |
| InlineAlways.cpp | 56 virtual bool doFinalization(CallGraph &CG) {
57 return removeDeadFunctions(CG, &NeverInline);
59 virtual bool doInitialization(CallGraph &CG);
77 bool AlwaysInliner::doInitialization(CallGraph &CG) {
80 Module &M = CG.getModule();
|
| InlineSimple.cpp | 56 virtual bool doInitialization(CallGraph &CG);
78 bool SimpleInliner::doInitialization(CallGraph &CG) {
81 Module &M = CG.getModule();
|
| /external/llvm/include/llvm/Transforms/IPO/ |
| Internalize.h | 62 /// If the CallGraph \p CG is supplied, it will be updated when
64 bool internalizeModule(Module &TheModule, CallGraph *CG = nullptr);
73 CallGraph *CG = nullptr) {
75 .internalizeModule(TheModule, CG);
|
| InlinerPass.h | 49 bool doFinalization(CallGraph &CG) override;
64 bool removeDeadFunctions(CallGraph &CG, bool AlwaysInlineOnly = false);
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Transforms/IPO/ |
| Internalize.h | 62 /// If the CallGraph \p CG is supplied, it will be updated when
64 bool internalizeModule(Module &TheModule, CallGraph *CG = nullptr);
73 CallGraph *CG = nullptr) {
75 .internalizeModule(TheModule, CG);
|
| ArgumentPromotion.h | 31 LazyCallGraph &CG, CGSCCUpdateResult &UR);
|
| Inliner.h | 40 bool doInitialization(CallGraph &CG) override;
50 bool doFinalization(CallGraph &CG) override;
63 bool removeDeadFunctions(CallGraph &CG, bool AlwaysInlineOnly = false);
105 LazyCallGraph &CG, CGSCCUpdateResult &UR);
|
| FunctionAttrs.h | 52 LazyCallGraph &CG, CGSCCUpdateResult &UR);
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Analysis/ |
| CallGraphSCCPass.cpp | 45 MaxIterations("max-cg-scc-iterations", cl::ReallyHidden, cl::init(4));
69 bool doInitialization(CallGraph &CG);
70 bool doFinalization(CallGraph &CG);
104 bool RunAllPassesOnSCC(CallGraphSCC &CurSCC, CallGraph &CG,
108 CallGraph &CG, bool &CallGraphUpToDate,
110 bool RefreshCallGraph(const CallGraphSCC &CurSCC, CallGraph &CG,
119 CallGraph &CG, bool &CallGraphUpToDate,
123 Module &M = CG.getModule();
128 DevirtualizedCall |= RefreshCallGraph(CurSCC, CG, false);
150 RefreshCallGraph(CurSCC, CG, true)
[all...] |
| /external/llvm/lib/Analysis/ |
| CallGraphSCCPass.cpp | 36 MaxIterations("max-cg-scc-iterations", cl::ReallyHidden, cl::init(4));
60 bool doInitialization(CallGraph &CG);
61 bool doFinalization(CallGraph &CG);
97 bool RunAllPassesOnSCC(CallGraphSCC &CurSCC, CallGraph &CG,
101 CallGraph &CG, bool &CallGraphUpToDate,
103 bool RefreshCallGraph(CallGraphSCC &CurSCC, CallGraph &CG,
113 CallGraph &CG, bool &CallGraphUpToDate,
121 DevirtualizedCall |= RefreshCallGraph(CurSCC, CG, false);
134 RefreshCallGraph(CurSCC, CG, true);
179 CallGraph &CG, bool CheckingMode)
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| CallGraphSCCPass.h | 49 virtual bool doInitialization(CallGraph &CG) {
65 virtual bool doFinalization(CallGraph &CG) {
90 const CallGraph &CG; // The call graph for this SCC.
95 CallGraphSCC(CallGraph &cg, void *context) : CG(cg), Context(context) {}
112 const CallGraph &getCallGraph() { return CG; }
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Analysis/ |
| CallGraphSCCPass.h | 49 virtual bool doInitialization(CallGraph &CG) {
64 virtual bool doFinalization(CallGraph &CG) {
89 const CallGraph &CG; // The call graph for this SCC.
94 CallGraphSCC(CallGraph &cg, void *context) : CG(cg), Context(context) {}
112 const CallGraph &getCallGraph() { return CG; }
|
| /external/swiftshader/third_party/LLVM/lib/Analysis/IPA/ |
| CallGraphSCCPass.cpp | 33 MaxIterations("max-cg-scc-iterations", cl::ReallyHidden, cl::init(4));
54 bool doInitialization(CallGraph &CG);
55 bool doFinalization(CallGraph &CG);
91 bool RunAllPassesOnSCC(CallGraphSCC &CurSCC, CallGraph &CG,
95 CallGraph &CG, bool &CallGraphUpToDate,
97 bool RefreshCallGraph(CallGraphSCC &CurSCC, CallGraph &CG,
107 CallGraph &CG, bool &CallGraphUpToDate,
115 DevirtualizedCall |= RefreshCallGraph(CurSCC, CG, false);
128 RefreshCallGraph(CurSCC, CG, true);
171 CallGraph &CG, bool CheckingMode)
[all...] |
| /external/clang/include/clang/Analysis/ |
| CallGraph.h | 159 void addCallee(CallGraphNode *N, CallGraph *CG) {
210 static nodes_iterator nodes_begin(clang::CallGraph *CG) {
211 return map_iterator(CG->begin(), DerefFun(CGdereference));
213 static nodes_iterator nodes_end (clang::CallGraph *CG) {
214 return map_iterator(CG->end(), DerefFun(CGdereference));
220 static unsigned size(clang::CallGraph *CG) {
221 return CG->size();
236 static nodes_iterator nodes_begin(const clang::CallGraph *CG) {
237 return map_iterator(CG->begin(), DerefFun(CGdereference));
239 static nodes_iterator nodes_end(const clang::CallGraph *CG) {
[all...] |
| /external/llvm/lib/Transforms/IPO/ |
| PruneEH.cpp | 52 static bool SimplifyFunction(Function *F, CallGraph &CG);
53 static void DeleteBasicBlock(BasicBlock *BB, CallGraph &CG);
64 static bool runImpl(CallGraphSCC &SCC, CallGraph &CG) {
77 MadeChange |= SimplifyFunction(F, CG);
132 CallGraphNode *CalleeNode = CG[Callee];
175 MadeChange |= SimplifyFunction(F, CG);
185 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph();
186 return runImpl(SCC, CG);
193 static bool SimplifyFunction(Function *F, CallGraph &CG) {
203 DeleteBasicBlock(UnwindBlock, CG); // Delete the new BB
[all...] |
| Inliner.cpp | 377 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph();
379 PSI = getAnalysis<ProfileSummaryInfoWrapperPass>().getPSI(CG.getModule());
440 InlineFunctionInfo InlineInfo(&CG, ACT);
465 CG[Caller]->removeCallEdgeFor(CS);
535 CG[Callee]->getNumReferences() == 0) {
538 CallGraphNode *CalleeNode = CG[Callee];
544 delete CG.removeFunctionFromModule(CalleeNode);
570 bool Inliner::doFinalization(CallGraph &CG) {
571 return removeDeadFunctions(CG);
575 bool Inliner::removeDeadFunctions(CallGraph &CG, bool AlwaysInlineOnly)
[all...] |
| InlineAlways.cpp | 57 bool doFinalization(CallGraph &CG) override {
58 return removeDeadFunctions(CG, /*AlwaysInlineOnly=*/ true);
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/IPO/ |
| PruneEH.cpp | 51 static bool SimplifyFunction(Function *F, CallGraph &CG);
52 static void DeleteBasicBlock(BasicBlock *BB, CallGraph &CG);
63 static bool runImpl(CallGraphSCC &SCC, CallGraph &CG) {
76 MadeChange |= SimplifyFunction(F, CG);
128 CallGraphNode *CalleeNode = CG[Callee];
171 MadeChange |= SimplifyFunction(F, CG);
181 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph();
182 return runImpl(SCC, CG);
189 static bool SimplifyFunction(Function *F, CallGraph &CG) {
199 DeleteBasicBlock(UnwindBlock, CG); // Delete the new BB
[all...] |
| Inliner.cpp | 452 bool LegacyInlinerBase::doInitialization(CallGraph &CG) {
454 ImportedFunctionsStats.setModuleInfo(CG.getModule());
465 inlineCallsImpl(CallGraphSCC &SCC, CallGraph &CG,
542 InlineFunctionInfo InlineInfo(&CG, &GetAssumptionCache, PSI);
598 CG[Caller]->removeCallEdgeFor(CS);
659 CG[Callee]->getNumReferences() == 0) {
662 CallGraphNode *CalleeNode = CG[Callee];
668 delete CG.removeFunctionFromModule(CalleeNode);
693 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph();
700 return inlineCallsImpl(SCC, CG, GetAssumptionCache, PSI, TLI, InsertLifetime
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/Transforms/IPO/ |
| InlinerPass.h | 47 virtual bool doFinalization(CallGraph &CG);
84 bool removeDeadFunctions(CallGraph &CG,
|
| /external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| CallGraph.h | 350 static nodes_iterator nodes_begin(CallGraph *CG) {
351 return map_iterator(CG->begin(), DerefFun(CGdereference));
353 static nodes_iterator nodes_end (CallGraph *CG) {
354 return map_iterator(CG->end(), DerefFun(CGdereference));
369 static nodes_iterator nodes_begin(const CallGraph *CG) { return CG->begin(); }
370 static nodes_iterator nodes_end (const CallGraph *CG) { return CG->end(); }
|
