| /external/clang/lib/Analysis/ |
| D | CallGraph.cpp | 32 CallGraph *G;
36 CGBuilder(CallGraph *g, CallGraphNode *N) in CGBuilder()
94 void CallGraph::addNodesForBlocks(DeclContext *D) { in addNodesForBlocks()
103 CallGraph::CallGraph() { in CallGraph() function in CallGraph
107 CallGraph::~CallGraph() { in ~CallGraph()
111 bool CallGraph::includeInGraph(const Decl *D) { in includeInGraph()
130 void CallGraph::addNodeForDecl(Decl* D, bool IsGlobal) { in addNodeForDecl()
142 CallGraphNode *CallGraph::getNode(const Decl *F) const { in getNode()
148 CallGraphNode *CallGraph::getOrInsertNode(Decl *F) { in getOrInsertNode()
163 void CallGraph::print(raw_ostream &OS) const { in print()
[all …]
|
| /external/llvm/include/llvm/Analysis/ |
| D | CallGraph.h | 76 class CallGraph {
109 explicit CallGraph(Module &M);
110 CallGraph(CallGraph &&Arg);
111 ~CallGraph();
273 friend class CallGraph;
304 typedef CallGraph Result;
309 CallGraph run(Module &M, ModuleAnalysisManager &) { return CallGraph(M); } in run()
329 std::unique_ptr<CallGraph> G;
339 const CallGraph &getCallGraph() const { return *G; } in getCallGraph()
340 CallGraph &getCallGraph() { return *G; } in getCallGraph()
[all …]
|
| D | CallGraphSCCPass.h | 31 class CallGraph; variable
49 virtual bool doInitialization(CallGraph &CG) { in doInitialization()
65 virtual bool doFinalization(CallGraph &CG) { in doFinalization()
90 const CallGraph &CG; // The call graph for this SCC.
95 CallGraphSCC(CallGraph &cg, void *context) : CG(cg), Context(context) {} in CallGraphSCC()
112 const CallGraph &getCallGraph() { return CG; } in getCallGraph()
|
| D | GlobalsModRef.h | 83 CallGraph &CG);
107 void AnalyzeCallGraph(CallGraph &CG, Module &M);
113 void CollectSCCMembership(CallGraph &CG);
|
| /external/clang/include/clang/Analysis/ |
| D | CallGraph.h | 34 class CallGraph : public RecursiveASTVisitor<CallGraph> {
46 CallGraph();
47 ~CallGraph();
159 void addCallee(CallGraphNode *N, CallGraph *CG) { in addCallee()
199 template <> struct GraphTraits<clang::CallGraph*>
202 static NodeType *getEntryNode(clang::CallGraph *CGN) {
208 typedef mapped_iterator<clang::CallGraph::iterator, DerefFun> nodes_iterator;
210 static nodes_iterator nodes_begin(clang::CallGraph *CG) {
213 static nodes_iterator nodes_end (clang::CallGraph *CG) {
220 static unsigned size(clang::CallGraph *CG) {
[all …]
|
| /external/swiftshader/third_party/LLVM/lib/Analysis/IPA/ |
| D | CallGraph.cpp | 29 class BasicCallGraph : public ModulePass, public CallGraph {
52 CallGraph::initialize(M); in runOnModule()
80 CallGraph::print(OS, 0); in print()
92 if (PI == &CallGraph::ID) in getAdjustedAnalysisPointer()
93 return (CallGraph*)this; in getAdjustedAnalysisPointer()
170 CallGraph::destroy(); in destroy()
176 INITIALIZE_ANALYSIS_GROUP(CallGraph, "Call Graph", BasicCallGraph)
177 INITIALIZE_AG_PASS(BasicCallGraph, CallGraph, "basiccg",
180 char CallGraph::ID = 0;
183 void CallGraph::initialize(Module &M) { in initialize()
[all …]
|
| D | CallGraphSCCPass.cpp | 54 bool doInitialization(CallGraph &CG);
55 bool doFinalization(CallGraph &CG);
60 Info.addRequired<CallGraph>(); in getAnalysisUsage()
91 bool RunAllPassesOnSCC(CallGraphSCC &CurSCC, CallGraph &CG,
95 CallGraph &CG, bool &CallGraphUpToDate,
97 bool RefreshCallGraph(CallGraphSCC &CurSCC, CallGraph &CG,
107 CallGraph &CG, bool &CallGraphUpToDate, in RunPassOnSCC()
171 CallGraph &CG, bool CheckingMode) { in RefreshCallGraph()
361 bool CGPassManager::RunAllPassesOnSCC(CallGraphSCC &CurSCC, CallGraph &CG, in RunAllPassesOnSCC()
422 CallGraph &CG = getAnalysis<CallGraph>(); in runOnModule()
[all …]
|
| /external/llvm/lib/Analysis/ |
| D | CallPrinter.cpp | 25 template <> struct DOTGraphTraits<CallGraph *> : public DefaultDOTGraphTraits {
28 static std::string getGraphName(CallGraph *Graph) { return "Call graph"; } in getGraphName()
30 std::string getNodeLabel(CallGraphNode *Node, CallGraph *Graph) { in getNodeLabel()
39 static CallGraph *getGraph(CallGraphWrapperPass *P) { in getGraph()
49 : public DOTGraphTraitsModuleViewer<CallGraphWrapperPass, true, CallGraph *,
54 : DOTGraphTraitsModuleViewer<CallGraphWrapperPass, true, CallGraph *, in CallGraphViewer()
62 CallGraphWrapperPass, true, CallGraph *,
67 : DOTGraphTraitsModulePrinter<CallGraphWrapperPass, true, CallGraph *, in CallGraphDOTPrinter()
|
| D | CallGraph.cpp | 23 CallGraph::CallGraph(Module &M) in CallGraph() function in CallGraph
35 CallGraph::CallGraph(CallGraph &&Arg) in CallGraph() function in CallGraph
44 CallGraph::~CallGraph() { in ~CallGraph()
57 void CallGraph::addToCallGraph(Function *F) { in addToCallGraph()
98 void CallGraph::print(raw_ostream &OS) const { in print()
129 void CallGraph::dump() const { print(dbgs()); } in dump()
137 Function *CallGraph::removeFunctionFromModule(CallGraphNode *CGN) { in removeFunctionFromModule()
152 void CallGraph::spliceFunction(const Function *From, const Function *To) { in spliceFunction()
165 CallGraphNode *CallGraph::getOrInsertFunction(const Function *F) { in getOrInsertFunction()
289 G.reset(new CallGraph(M)); in runOnModule()
|
| D | CallGraphSCCPass.cpp | 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, in RunPassOnSCC()
179 CallGraph &CG, bool CheckingMode) { in RefreshCallGraph()
381 bool CGPassManager::RunAllPassesOnSCC(CallGraphSCC &CurSCC, CallGraph &CG, in RunAllPassesOnSCC()
442 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph(); in runOnModule()
446 scc_iterator<CallGraph*> CGI = scc_begin(&CG); in runOnModule()
[all …]
|
| /external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| D | CallGraph.h | 72 class CallGraph {
152 CallGraph() {} in CallGraph() function
155 virtual ~CallGraph() { destroy(); } in ~CallGraph()
173 friend class CallGraph; variable
341 template<> struct GraphTraits<CallGraph*> : public GraphTraits<CallGraphNode*> {
342 static NodeType *getEntryNode(CallGraph *CGN) {
349 typedef mapped_iterator<CallGraph::iterator, DerefFun> nodes_iterator;
350 static nodes_iterator nodes_begin(CallGraph *CG) {
353 static nodes_iterator nodes_end (CallGraph *CG) {
362 template<> struct GraphTraits<const CallGraph*> :
[all …]
|
| /external/swiftshader/third_party/LLVM/tools/opt/ |
| D | GraphPrinters.cpp | 53 struct DOTGraphTraits<CallGraph*> : public DefaultDOTGraphTraits {
57 static std::string getGraphName(CallGraph *F) { in getGraphName()
61 static std::string getNodeLabel(CallGraphNode *Node, CallGraph *Graph) { in getNodeLabel()
76 WriteGraphToFile(llvm::errs(), "callgraph", &getAnalysis<CallGraph>()); in runOnModule()
83 AU.addRequired<CallGraph>(); in getAnalysisUsage()
|
| D | AnalysisWrappers.cpp | 83 AU.addRequiredTransitive<CallGraph>(); in getAnalysisUsage()
86 getAnalysis<CallGraph>().print(errs(), &M); in runOnModule()
|
| /external/swiftshader/third_party/LLVM/lib/Transforms/IPO/ |
| D | InlineAlways.cpp | 56 virtual bool doFinalization(CallGraph &CG) { in doFinalization()
59 virtual bool doInitialization(CallGraph &CG);
69 INITIALIZE_AG_DEPENDENCY(CallGraph) in INITIALIZE_AG_DEPENDENCY() argument
77 bool AlwaysInliner::doInitialization(CallGraph &CG) { in doInitialization()
|
| D | InlineSimple.cpp | 56 virtual bool doInitialization(CallGraph &CG);
66 INITIALIZE_AG_DEPENDENCY(CallGraph) in INITIALIZE_AG_DEPENDENCY() argument
78 bool SimpleInliner::doInitialization(CallGraph &CG) { in doInitialization()
|
| D | PruneEH.cpp | 54 INITIALIZE_AG_DEPENDENCY(CallGraph) in INITIALIZE_AG_DEPENDENCY() argument
63 CallGraph &CG = getAnalysis<CallGraph>(); in runOnSCC()
236 CallGraph &CG = getAnalysis<CallGraph>(); in DeleteBasicBlock()
|
| /external/llvm/lib/Transforms/IPO/ |
| D | 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) { in runImpl()
185 CallGraph &CG = getAnalysis<CallGraphWrapperPass>().getCallGraph(); in runOnSCC()
193 static bool SimplifyFunction(Function *F, CallGraph &CG) { in SimplifyFunction()
235 static void DeleteBasicBlock(BasicBlock *BB, CallGraph &CG) { in DeleteBasicBlock()
|
| /external/llvm/include/llvm/Transforms/IPO/ |
| D | Internalize.h | 33 class CallGraph; variable
64 bool internalizeModule(Module &TheModule, CallGraph *CG = nullptr);
73 CallGraph *CG = nullptr) {
|
| D | InlinerPass.h | 49 bool doFinalization(CallGraph &CG) override;
64 bool removeDeadFunctions(CallGraph &CG, bool AlwaysInlineOnly = false);
|
| /external/swiftshader/third_party/LLVM/include/llvm/ |
| D | CallGraphSCCPass.h | 30 class CallGraph; variable
44 virtual bool doInitialization(CallGraph &CG) { in doInitialization()
60 virtual bool doFinalization(CallGraph &CG) { in doFinalization()
|
| /external/llvm/unittests/Analysis/ |
| D | CallGraphTest.cpp | 49 CallGraph CG(M); in TEST()
57 CallGraph CG(M); in TEST()
59 canSpecializeGraphTraitsIterators(const_cast<const CallGraph *>(&CG)); in TEST()
|
| /external/swiftshader/third_party/LLVM/include/llvm/Transforms/Utils/ |
| D | Cloning.h | 41 class CallGraph; variable
175 explicit InlineFunctionInfo(CallGraph *cg = 0, const TargetData *td = 0)
180 CallGraph *CG;
|
| /external/r8/src/main/java/com/android/tools/r8/ir/conversion/ |
| D | CallGraph.java | 46 public class CallGraph { class
146 public static CallGraph build(DexApplication application, AppInfoWithSubtyping appInfo, in build()
148 CallGraph graph = new CallGraph(); in build()
208 private static boolean allMethodsExists(DexApplication application, CallGraph graph) { in allMethodsExists()
339 CallGraph graph;
342 CallGraph graph) { in InvokeExtractor()
|
| /external/swiftshader/third_party/LLVM/include/llvm/Transforms/IPO/ |
| D | InlinerPass.h | 47 virtual bool doFinalization(CallGraph &CG);
84 bool removeDeadFunctions(CallGraph &CG,
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| D | Cloning.h | 43 class CallGraph; variable
178 explicit InlineFunctionInfo(CallGraph *cg = nullptr,
184 CallGraph *CG;
|