| /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-project/clang/lib/Analysis/ |
| D | CallGraph.cpp | 47 CallGraph *G;
51 CGBuilder(CallGraph *g, CallGraphNode *N) : G(g), CallerNode(N) {} in CGBuilder()
140 void CallGraph::addNodesForBlocks(DeclContext *D) { in addNodesForBlocks()
149 CallGraph::CallGraph() { in CallGraph() function in CallGraph
153 CallGraph::~CallGraph() = default;
155 bool CallGraph::includeInGraph(const Decl *D) { in includeInGraph()
163 bool CallGraph::includeCalleeInGraph(const Decl *D) { in includeCalleeInGraph()
178 void CallGraph::addNodeForDecl(Decl* D, bool IsGlobal) { in addNodeForDecl()
197 CallGraphNode *CallGraph::getNode(const Decl *F) const { in getNode()
203 CallGraphNode *CallGraph::getOrInsertNode(Decl *F) { in getOrInsertNode()
[all …]
|
| /external/llvm-project/llvm/include/llvm/Analysis/ |
| D | CallGraph.h | 73 class CallGraph {
98 explicit CallGraph(Module &M);
99 CallGraph(CallGraph &&Arg);
100 ~CallGraph();
192 inline CallGraphNode(CallGraph *CG, Function *F) : CG(CG), F(F) {} in CallGraphNode()
289 friend class CallGraph;
291 CallGraph *CG;
319 using Result = CallGraph;
324 CallGraph run(Module &M, ModuleAnalysisManager &) { return CallGraph(M); } in run()
345 std::unique_ptr<CallGraph> G;
[all …]
|
| D | CallGraphSCCPass.h | 29 class CallGraph; variable
48 virtual bool doInitialization(CallGraph &CG) { in doInitialization()
63 virtual bool doFinalization(CallGraph &CG) { in doFinalization()
88 const CallGraph &CG; // The call graph for this SCC.
93 CallGraphSCC(CallGraph &cg, void *context) : CG(cg), Context(context) {} in CallGraphSCC()
115 const CallGraph &getCallGraph() { return CG; } in getCallGraph()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/ |
| D | CallGraph.h | 73 class CallGraph {
102 explicit CallGraph(Module &M);
103 CallGraph(CallGraph &&Arg);
104 ~CallGraph();
270 friend class CallGraph;
299 using Result = CallGraph;
304 CallGraph run(Module &M, ModuleAnalysisManager &) { return CallGraph(M); } in run()
325 std::unique_ptr<CallGraph> G;
335 const CallGraph &getCallGraph() const { return *G; } in getCallGraph()
336 CallGraph &getCallGraph() { return *G; } in getCallGraph()
[all …]
|
| D | CallGraphSCCPass.h | 29 class CallGraph; variable
48 virtual bool doInitialization(CallGraph &CG) { in doInitialization()
63 virtual bool doFinalization(CallGraph &CG) { in doFinalization()
88 const CallGraph &CG; // The call graph for this SCC.
93 CallGraphSCC(CallGraph &cg, void *context) : CG(cg), Context(context) {} in CallGraphSCC()
111 const CallGraph &getCallGraph() { return CG; } in getCallGraph()
|
| /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()
|
| /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/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-10.0/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 | 31 CallGraph::CallGraph(Module &M) in CallGraph() function in CallGraph
39 CallGraph::CallGraph(CallGraph &&Arg) in CallGraph() function in CallGraph
47 CallGraph::~CallGraph() { in ~CallGraph()
60 void CallGraph::addToCallGraph(Function *F) { in addToCallGraph()
89 void CallGraph::print(raw_ostream &OS) const { in print()
112 LLVM_DUMP_METHOD void CallGraph::dump() const { print(dbgs()); } in dump()
121 Function *CallGraph::removeFunctionFromModule(CallGraphNode *CGN) { in removeFunctionFromModule()
135 void CallGraph::spliceFunction(const Function *From, const Function *To) { in spliceFunction()
148 CallGraphNode *CallGraph::getOrInsertFunction(const Function *F) { in getOrInsertFunction()
273 G.reset(new CallGraph(M)); in runOnModule()
|
| /external/llvm-project/clang/include/clang/Analysis/ |
| D | CallGraph.h | 42 class CallGraph : public RecursiveASTVisitor<CallGraph> {
55 CallGraph();
56 ~CallGraph();
263 template <> struct GraphTraits<clang::CallGraph*>
265 static NodeType *getEntryNode(clang::CallGraph *CGN) {
270 CGGetValue(clang::CallGraph::const_iterator::value_type &P) {
276 mapped_iterator<clang::CallGraph::iterator, decltype(&CGGetValue)>;
278 static nodes_iterator nodes_begin(clang::CallGraph *CG) {
282 static nodes_iterator nodes_end (clang::CallGraph *CG) {
286 static unsigned size(clang::CallGraph *CG) { return CG->size(); }
[all …]
|
| /external/llvm-project/llvm/lib/Analysis/ |
| D | CallGraph.cpp | 33 CallGraph::CallGraph(Module &M) in CallGraph() function in CallGraph
42 CallGraph::CallGraph(CallGraph &&Arg) in CallGraph() function in CallGraph
55 CallGraph::~CallGraph() { in ~CallGraph()
68 bool CallGraph::invalidate(Module &, const PreservedAnalyses &PA, in invalidate()
77 void CallGraph::addToCallGraph(Function *F) { in addToCallGraph()
89 void CallGraph::populateCallGraphNode(CallGraphNode *Node) { in populateCallGraphNode()
118 void CallGraph::print(raw_ostream &OS) const { in print()
141 LLVM_DUMP_METHOD void CallGraph::dump() const { print(dbgs()); } in dump()
144 void CallGraph::ReplaceExternalCallEdge(CallGraphNode *Old, in ReplaceExternalCallEdge()
160 Function *CallGraph::removeFunctionFromModule(CallGraphNode *CGN) { in removeFunctionFromModule()
[all …]
|
| /external/tensorflow/tensorflow/compiler/xla/service/ |
| D | call_graph.cc | 129 CallGraph::CallGraph(const HloModule* module) : module_(module) {} in CallGraph() function in xla::CallGraph
131 const CallGraphNode& CallGraph::GetNode( in GetNode()
138 CallGraphNode& CallGraph::GetNode(const HloComputation* computation) { in GetNode()
144 bool CallGraph::DominatesHelper( in DominatesHelper()
169 bool CallGraph::Dominates(const HloComputation* a, in Dominates()
195 void CallGraph::SetCallContexts() { in SetCallContexts()
243 void CallGraph::SetNodeDepths() { in SetNodeDepths()
279 std::unique_ptr<CallGraph> CallGraph::Build(const HloModule* module) { in Build()
281 auto call_graph = absl::WrapUnique<CallGraph>(new CallGraph(module)); in Build()
320 Status CallGraph::VisitNodesInternal( in VisitNodesInternal()
[all …]
|
| D | call_graph.h | 133 friend class CallGraph;
182 class CallGraph {
187 static std::unique_ptr<CallGraph> Build(const HloModule* module);
257 CallGraph(const HloModule* module);
260 CallGraph(const CallGraph&) = delete;
261 CallGraph& operator=(const CallGraph&) = delete;
|
| D | call_graph_test.cc | 100 std::unique_ptr<CallGraph> call_graph = CallGraph::Build(module.get()); in TEST_F()
123 std::unique_ptr<CallGraph> call_graph = CallGraph::Build(module.get()); in TEST_F()
147 std::unique_ptr<CallGraph> call_graph = CallGraph::Build(module.get()); in TEST_F()
178 std::unique_ptr<CallGraph> call_graph = CallGraph::Build(module.get()); in TEST_F()
219 std::unique_ptr<CallGraph> call_graph = CallGraph::Build(module.get()); in TEST_F()
269 std::unique_ptr<CallGraph> call_graph = CallGraph::Build(module.get()); in TEST_F()
341 std::unique_ptr<CallGraph> call_graph = CallGraph::Build(module.get()); in TEST_F()
476 std::unique_ptr<CallGraph> call_graph = CallGraph::Build(module.get()); in TEST_F()
506 std::unique_ptr<CallGraph> call_graph = CallGraph::Build(module.get()); in TEST_F()
523 std::unique_ptr<CallGraph> call_graph = CallGraph::Build(module.get()); in TEST_F()
[all …]
|
| D | flatten_call_graph_test.cc | 145 std::unique_ptr<CallGraph> flat_call_graph = CallGraph::Build(module.get()); in TEST_F()
180 std::unique_ptr<CallGraph> call_graph = CallGraph::Build(module.get()); in TEST_F()
188 std::unique_ptr<CallGraph> call_graph = CallGraph::Build(module.get()); in TEST_F()
217 std::unique_ptr<CallGraph> call_graph = CallGraph::Build(module.get()); in TEST_F()
249 std::unique_ptr<CallGraph> call_graph = CallGraph::Build(module.get()); in TEST_F()
|
| /external/llvm-project/mlir/lib/Analysis/ |
| D | CallGraph.cpp | 70 static void computeCallGraph(Operation *op, CallGraph &cg, in computeCallGraph()
95 CallGraph::CallGraph(Operation *op) : externalNode(/*callableRegion=*/nullptr) { in CallGraph() function in CallGraph
107 CallGraphNode *CallGraph::getOrAddNode(Region *region, in getOrAddNode()
133 CallGraphNode *CallGraph::lookupNode(Region *region) const { in lookupNode()
141 CallGraph::resolveCallable(CallOpInterface call, in resolveCallable()
153 void CallGraph::eraseNode(CallGraphNode *node) { in eraseNode()
173 void CallGraph::dump() const { print(llvm::errs()); } in dump()
174 void CallGraph::print(raw_ostream &os) const { in print()
|
| /external/llvm-project/mlir/lib/Transforms/ |
| D | Inliner.cpp | 37 Operation *op, CallGraph &cg, SymbolTableCollection &symbolTable, in walkReferencedSymbolNodes()
84 CGUseList(Operation *op, CallGraph &cg, SymbolTableCollection &symbolTable);
88 void dropCallUses(CallGraphNode *userNode, Operation *callOp, CallGraph &cg);
101 void recomputeUses(CallGraphNode *node, CallGraph &cg);
124 CGUseList::CGUseList(Operation *op, CallGraph &cg, in CGUseList()
162 CallGraph &cg) { in dropCallUses()
211 void CGUseList::recomputeUses(CallGraphNode *node, CallGraph &cg) { in recomputeUses()
256 CallGraphSCC(llvm::scc_iterator<const CallGraph *> &parentIterator) in CallGraphSCC()
276 llvm::scc_iterator<const CallGraph *> &parentIterator;
283 runTransformOnCGSCCs(const CallGraph &cg, in runTransformOnCGSCCs()
[all …]
|
| /external/swiftshader/third_party/SPIRV-Tools/source/fuzz/ |
| D | call_graph.cpp | 22 CallGraph::CallGraph(opt::IRContext* context) { in CallGraph() function in spvtools::fuzz::CallGraph
46 void CallGraph::BuildGraphAndGetDepthOfFunctionCalls( in BuildGraphAndGetDepthOfFunctionCalls()
95 void CallGraph::ComputeTopologicalOrderOfFunctions() { in ComputeTopologicalOrderOfFunctions()
136 void CallGraph::ComputeInterproceduralFunctionCallDepths( in ComputeInterproceduralFunctionCallDepths()
158 void CallGraph::PushDirectCallees(uint32_t function_id, in PushDirectCallees()
165 std::set<uint32_t> CallGraph::GetIndirectCallees(uint32_t function_id) const { in GetIndirectCallees()
|
| /external/deqp-deps/SPIRV-Tools/source/fuzz/ |
| D | call_graph.cpp | 22 CallGraph::CallGraph(opt::IRContext* context) { in CallGraph() function in spvtools::fuzz::CallGraph
46 void CallGraph::BuildGraphAndGetDepthOfFunctionCalls( in BuildGraphAndGetDepthOfFunctionCalls()
95 void CallGraph::ComputeTopologicalOrderOfFunctions() { in ComputeTopologicalOrderOfFunctions()
136 void CallGraph::ComputeInterproceduralFunctionCallDepths( in ComputeInterproceduralFunctionCallDepths()
158 void CallGraph::PushDirectCallees(uint32_t function_id, in PushDirectCallees()
165 std::set<uint32_t> CallGraph::GetIndirectCallees(uint32_t function_id) const { in GetIndirectCallees()
|
| /external/llvm-project/mlir/include/mlir/Analysis/ |
| D | CallGraph.h | 147 friend class CallGraph; variable
154 class CallGraph {
176 CallGraph(Operation *op);
244 struct GraphTraits<const mlir::CallGraph *>
247 static NodeRef getEntryNode(const mlir::CallGraph *cg) {
252 using nodes_iterator = mlir::CallGraph::iterator;
253 static nodes_iterator nodes_begin(mlir::CallGraph *cg) { return cg->begin(); }
254 static nodes_iterator nodes_end(mlir::CallGraph *cg) { return cg->end(); }
|