Home
last modified time | relevance | path

Searched refs:CallGraphNode (Results 1 – 25 of 86) sorted by relevance

1234

/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/
DCallGraph.h64 class CallGraphNode; variable
77 std::map<const Function *, std::unique_ptr<CallGraphNode>>;
84 CallGraphNode *ExternalCallingNode;
88 std::unique_ptr<CallGraphNode> CallsExternalNode;
121 inline const CallGraphNode *operator[](const Function *F) const {
128 inline CallGraphNode *operator[](const Function *F) {
136 CallGraphNode *getExternalCallingNode() const { return ExternalCallingNode; } in getExternalCallingNode()
138 CallGraphNode *getCallsExternalNode() const { in getCallsExternalNode()
153 Function *removeFunctionFromModule(CallGraphNode *CGN);
157 CallGraphNode *getOrInsertFunction(const Function *F);
[all …]
DCallGraphSCCPass.h30 class CallGraphNode; variable
90 std::vector<CallGraphNode *> Nodes;
95 void initialize(ArrayRef<CallGraphNode *> NewNodes) { in initialize()
104 void ReplaceNode(CallGraphNode *Old, CallGraphNode *New);
106 using iterator = std::vector<CallGraphNode *>::const_iterator;
/external/llvm/include/llvm/Analysis/
DCallGraph.h69 class CallGraphNode; variable
79 typedef std::map<const Function *, std::unique_ptr<CallGraphNode>>
87 CallGraphNode *Root;
91 CallGraphNode *ExternalCallingNode;
95 std::unique_ptr<CallGraphNode> CallsExternalNode;
128 inline const CallGraphNode *operator[](const Function *F) const {
135 inline CallGraphNode *operator[](const Function *F) {
143 CallGraphNode *getExternalCallingNode() const { return ExternalCallingNode; } in getExternalCallingNode()
145 CallGraphNode *getCallsExternalNode() const { in getCallsExternalNode()
160 Function *removeFunctionFromModule(CallGraphNode *CGN);
[all …]
DCallGraphSCCPass.h30 class CallGraphNode; variable
92 std::vector<CallGraphNode*> Nodes;
97 void initialize(CallGraphNode *const *I, CallGraphNode *const *E) { in initialize()
106 void ReplaceNode(CallGraphNode *Old, CallGraphNode *New);
108 typedef std::vector<CallGraphNode *>::const_iterator iterator;
/external/llvm-project/llvm/include/llvm/Analysis/
DCallGraph.h64 class CallGraphNode; variable
77 std::map<const Function *, std::unique_ptr<CallGraphNode>>;
84 CallGraphNode *ExternalCallingNode;
88 std::unique_ptr<CallGraphNode> CallsExternalNode;
120 inline const CallGraphNode *operator[](const Function *F) const {
127 inline CallGraphNode *operator[](const Function *F) {
135 CallGraphNode *getExternalCallingNode() const { return ExternalCallingNode; } in getExternalCallingNode()
137 CallGraphNode *getCallsExternalNode() const { in getCallsExternalNode()
143 void ReplaceExternalCallEdge(CallGraphNode *Old, CallGraphNode *New);
156 Function *removeFunctionFromModule(CallGraphNode *CGN);
[all …]
DCallGraphSCCPass.h30 class CallGraphNode; variable
90 std::vector<CallGraphNode *> Nodes;
95 void initialize(ArrayRef<CallGraphNode *> NewNodes) { in initialize()
104 void ReplaceNode(CallGraphNode *Old, CallGraphNode *New);
108 void DeleteNode(CallGraphNode *Old);
110 using iterator = std::vector<CallGraphNode *>::const_iterator;
/external/llvm-project/clang/include/clang/Analysis/
DCallGraph.h32 class CallGraphNode; variable
43 friend class CallGraphNode; variable
46 llvm::DenseMap<const Decl *, std::unique_ptr<CallGraphNode>>;
52 CallGraphNode *Root;
75 CallGraphNode *getNode(const Decl *) const;
79 CallGraphNode *getOrInsertNode(Decl *);
96 CallGraphNode *getRoot() const { return Root; } in getRoot()
101 using nodes_iterator = llvm::SetVector<CallGraphNode *>::iterator;
102 using const_nodes_iterator = llvm::SetVector<CallGraphNode *>::const_iterator;
147 class CallGraphNode {
[all …]
/external/llvm-project/mlir/include/mlir/Analysis/
DCallGraph.h40 class CallGraphNode {
73 CallGraphNode *getTarget() const { return targetAndKind.getPointer(); } in getTarget()
80 Edge(CallGraphNode *node, Kind kind) : targetAndKind(node, kind) {} in Edge()
81 explicit Edge(llvm::PointerIntPair<CallGraphNode *, 2, Kind> targetAndKind) in Edge() argument
85 llvm::PointerIntPair<CallGraphNode *, 2, Kind> targetAndKind;
88 friend class CallGraphNode; variable
101 void addAbstractEdge(CallGraphNode *node);
104 void addCallEdge(CallGraphNode *node);
107 void addChildEdge(CallGraphNode *child);
121 DenseMapInfo<llvm::PointerIntPair<CallGraphNode *, 2, Edge::Kind>>;
[all …]
/external/clang/include/clang/Analysis/
DCallGraph.h27 class CallGraphNode; variable
35 friend class CallGraphNode; variable
37 typedef llvm::DenseMap<const Decl *, CallGraphNode *> FunctionMapTy;
43 CallGraphNode *Root;
61 CallGraphNode *getNode(const Decl *) const;
65 CallGraphNode *getOrInsertNode(Decl *);
81 CallGraphNode *getRoot() const { return Root; } in getRoot()
86 typedef llvm::SetVector<CallGraphNode *>::iterator nodes_iterator;
87 typedef llvm::SetVector<CallGraphNode *>::const_iterator const_nodes_iterator;
130 CallGraphNode *allocateNewNode(Decl *);
[all …]
/external/llvm-project/mlir/lib/Transforms/
DInliner.cpp38 DenseMap<Attribute, CallGraphNode *> &resolvedRefs, in walkReferencedSymbolNodes()
39 function_ref<void(CallGraphNode *, Operation *)> callback) { in walkReferencedSymbolNodes() argument
46 CallGraphNode *&node = refIt.first->second; in walkReferencedSymbolNodes()
78 DenseSet<CallGraphNode *> topLevelUses;
81 DenseMap<CallGraphNode *, int> innerUses;
88 void dropCallUses(CallGraphNode *userNode, Operation *callOp, CallGraph &cg);
91 void eraseNode(CallGraphNode *node);
94 bool isDead(CallGraphNode *node) const;
98 bool hasOneUseAndDiscardable(CallGraphNode *node) const;
101 void recomputeUses(CallGraphNode *node, CallGraph &cg);
[all …]
/external/llvm-project/mlir/lib/Analysis/
DCallGraph.cpp28 bool CallGraphNode::isExternal() const { return !callableRegion; } in isExternal()
32 Region *CallGraphNode::getCallableRegion() const { in getCallableRegion()
39 void CallGraphNode::addAbstractEdge(CallGraphNode *node) { in addAbstractEdge()
45 void CallGraphNode::addCallEdge(CallGraphNode *node) { in addCallEdge()
50 void CallGraphNode::addChildEdge(CallGraphNode *child) { in addChildEdge()
55 bool CallGraphNode::hasChildren() const { in hasChildren()
60 void CallGraphNode::addEdge(CallGraphNode *node, Edge::Kind kind) { in addEdge()
72 CallGraphNode *parentNode, bool resolveCalls) { in computeCallGraph()
107 CallGraphNode *CallGraph::getOrAddNode(Region *region, in getOrAddNode()
108 CallGraphNode *parentNode) { in getOrAddNode()
[all …]
/external/llvm-project/llvm/lib/Analysis/
DCallGraph.cpp35 CallsExternalNode(std::make_unique<CallGraphNode>(this, nullptr)) { in CallGraph()
78 CallGraphNode *Node = getOrInsertFunction(F); in addToCallGraph()
89 void CallGraph::populateCallGraphNode(CallGraphNode *Node) { in populateCallGraphNode()
122 SmallVector<CallGraphNode *, 16> Nodes; in print()
128 llvm::sort(Nodes, [](CallGraphNode *LHS, CallGraphNode *RHS) { in print()
136 for (CallGraphNode *CN : Nodes) in print()
144 void CallGraph::ReplaceExternalCallEdge(CallGraphNode *Old, in ReplaceExternalCallEdge()
145 CallGraphNode *New) { in ReplaceExternalCallEdge()
160 Function *CallGraph::removeFunctionFromModule(CallGraphNode *CGN) { in removeFunctionFromModule()
187 CallGraphNode *CallGraph::getOrInsertFunction(const Function *F) { in getOrInsertFunction()
[all …]
DCallPrinter.cpp92 CallGraphNode *Node = I.second.get(); in removeParallelEdges()
112 : public GraphTraits<const CallGraphNode *> {
118 typedef std::pair<const Function *const, std::unique_ptr<CallGraphNode>>
120 static const CallGraphNode *CGGetValuePtr(const PairTy &P) { in CGGetValuePtr()
146 static bool isNodeHidden(const CallGraphNode *Node) { in isNodeHidden()
152 std::string getNodeLabel(const CallGraphNode *Node, in getNodeLabel()
163 static const CallGraphNode *CGGetValuePtr(CallGraphNode::CallRecord P) { in CGGetValuePtr()
168 typedef mapped_iterator<CallGraphNode::const_iterator,
172 std::string getEdgeAttributes(const CallGraphNode *Node, nodes_iterator I, in getEdgeAttributes()
193 std::string getNodeAttributes(const CallGraphNode *Node, in getNodeAttributes()
DCallGraphSCCPass.cpp173 for (CallGraphNode *CGN : CurSCC) { in RunPassOnSCC()
205 DenseMap<Value *, CallGraphNode *> Calls; in RefreshCallGraph()
209 for (CallGraphNode *CGN in RefreshCallGraph()
219 CallGraphNode *CGN = *SCCIdx; in RefreshCallGraph()
230 CallGraphNode::iterator CGNEnd = CGN->end(); in RefreshCallGraph()
232 auto RemoveAndCheckForDone = [&](CallGraphNode::iterator I) { in RefreshCallGraph()
249 for (CallGraphNode::iterator I = CGN->begin(); I != CGNEnd;) { in RefreshCallGraph()
327 DenseMap<Value *, CallGraphNode *>::iterator ExistingIt = in RefreshCallGraph()
330 CallGraphNode *ExistingNode = ExistingIt->second; in RefreshCallGraph()
353 CallGraphNode *CalleeNode; in RefreshCallGraph()
[all …]
/external/tensorflow/tensorflow/compiler/xla/service/
Dcall_graph.cc86 CallGraphNode::CallGraphNode(HloComputation* computation) in CallGraphNode() function in xla::CallGraphNode
89 const CallSite* CallGraphNode::GetCallSite( in GetCallSite()
98 std::string CallGraphNode::ToString() const { return computation_->name(); } in ToString()
100 void CallGraphNode::AddCallerCallSite(const CallSite& caller_callsite) { in AddCallerCallSite()
109 void CallGraphNode::AddCallSiteForInstruction(HloInstruction* instruction) { in AddCallSiteForInstruction()
131 const CallGraphNode& CallGraph::GetNode( in GetNode()
138 CallGraphNode& CallGraph::GetNode(const HloComputation* computation) { in GetNode()
153 const CallGraphNode& b_node = GetNode(b); in DominatesHelper()
196 std::queue<CallGraphNode*> worklist; in SetCallContexts()
201 CallGraphNode& node = GetNode(computation); in SetCallContexts()
[all …]
Dcall_graph.h93 class CallGraphNode {
95 CallGraphNode(HloComputation* computation);
184 using VisitorFunction = std::function<Status(const CallGraphNode&)>;
190 const CallGraphNode& GetNode(const HloComputation* computation) const;
191 CallGraphNode& GetNode(const HloComputation* computation);
194 const std::vector<CallGraphNode>& nodes() const { return nodes_; } in nodes()
274 const VisitorFunction& visitor_func, const CallGraphNode& node,
275 absl::flat_hash_set<const CallGraphNode*>* visited) const;
288 std::vector<CallGraphNode> nodes_;
Dcall_graph_test.cc104 const CallGraphNode& node = call_graph->GetNode(computation); in TEST_F()
126 const CallGraphNode& entry_node = call_graph->GetNode(entry_computation); in TEST_F()
131 const CallGraphNode& unreachable_node = in TEST_F()
150 const CallGraphNode& entry_node = call_graph->GetNode(entry_computation); in TEST_F()
159 const CallGraphNode& map_node = call_graph->GetNode(map_computation); in TEST_F()
185 const CallGraphNode& entry_node = call_graph->GetNode(entry_computation); in TEST_F()
193 const CallGraphNode& called_node = call_graph->GetNode(called_computation); in TEST_F()
224 const CallGraphNode& entry_node = call_graph->GetNode(entry_computation); in TEST_F()
242 const CallGraphNode& sub_node = call_graph->GetNode(subcomputation); in TEST_F()
273 const CallGraphNode& entry_node = call_graph->GetNode(entry_computation); in TEST_F()
[all …]
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/
DCallGraph.cpp33 CallsExternalNode(std::make_unique<CallGraphNode>(nullptr)) { in CallGraph()
61 CallGraphNode *Node = getOrInsertFunction(F); in addToCallGraph()
93 SmallVector<CallGraphNode *, 16> Nodes; in print()
99 llvm::sort(Nodes, [](CallGraphNode *LHS, CallGraphNode *RHS) { in print()
107 for (CallGraphNode *CN : Nodes) in print()
121 Function *CallGraph::removeFunctionFromModule(CallGraphNode *CGN) { in removeFunctionFromModule()
148 CallGraphNode *CallGraph::getOrInsertFunction(const Function *F) { in getOrInsertFunction()
154 CGN = std::make_unique<CallGraphNode>(const_cast<Function *>(F)); in getOrInsertFunction()
162 void CallGraphNode::print(raw_ostream &OS) const { in print()
181 LLVM_DUMP_METHOD void CallGraphNode::dump() const { print(dbgs()); } in dump()
[all …]
DCallGraphSCCPass.cpp171 for (CallGraphNode *CGN : CurSCC) { in RunPassOnSCC()
203 DenseMap<Value *, CallGraphNode *> Calls; in RefreshCallGraph()
207 for (CallGraphNode *CGN in RefreshCallGraph()
217 CallGraphNode *CGN = *SCCIdx; in RefreshCallGraph()
229 for (CallGraphNode::iterator I = CGN->begin(), E = CGN->end(); I != E; ) { in RefreshCallGraph()
297 DenseMap<Value *, CallGraphNode *>::iterator ExistingIt = in RefreshCallGraph()
300 CallGraphNode *ExistingNode = ExistingIt->second; in RefreshCallGraph()
323 CallGraphNode *CalleeNode; in RefreshCallGraph()
347 CallGraphNode *CalleeNode; in RefreshCallGraph()
388 for (CallGraphNode *CGN : CurSCC) in RefreshCallGraph()
[all …]
/external/llvm/lib/Analysis/
DCallGraph.cpp25 CallsExternalNode(llvm::make_unique<CallGraphNode>(nullptr)) { in CallGraph()
58 CallGraphNode *Node = getOrInsertFunction(F); in addToCallGraph()
109 SmallVector<CallGraphNode *, 16> Nodes; in print()
116 [](CallGraphNode *LHS, CallGraphNode *RHS) { in print()
124 for (CallGraphNode *CN : Nodes) in print()
137 Function *CallGraph::removeFunctionFromModule(CallGraphNode *CGN) { in removeFunctionFromModule()
165 CallGraphNode *CallGraph::getOrInsertFunction(const Function *F) { in getOrInsertFunction()
171 CGN = llvm::make_unique<CallGraphNode>(const_cast<Function *>(F)); in getOrInsertFunction()
179 void CallGraphNode::print(raw_ostream &OS) const { in print()
198 void CallGraphNode::dump() const { print(dbgs()); } in dump()
[all …]
/external/clang/lib/Analysis/
DCallGraph.cpp33 CallGraphNode *CallerNode;
36 CGBuilder(CallGraph *g, CallGraphNode *N) in CGBuilder()
57 CallGraphNode *CalleeNode = G->getOrInsertNode(D); in addCalledDecl()
134 CallGraphNode *Node = getOrInsertNode(D); in addNodeForDecl()
142 CallGraphNode *CallGraph::getNode(const Decl *F) const { in getNode()
148 CallGraphNode *CallGraph::getOrInsertNode(Decl *F) { in getOrInsertNode()
152 CallGraphNode *&Node = FunctionMap[F]; in getOrInsertNode()
156 Node = new CallGraphNode(F); in getOrInsertNode()
171 const CallGraphNode *N = *I; in print()
180 for (CallGraphNode::const_iterator CI = N->begin(), in print()
[all …]
/external/llvm-project/clang-tools-extra/clang-move/
DHelperDeclRefGraph.cpp23 const CallGraphNode *N = (I->second).get(); in print()
49 CallGraphNode *CallerNode = getOrInsertNode(const_cast<Decl *>(Caller)); in addEdge()
50 CallGraphNode *CalleeNode = getOrInsertNode(const_cast<Decl *>(Callee)); in addEdge()
56 CallGraphNode *HelperDeclRefGraph::getOrInsertNode(Decl *F) { in getOrInsertNode()
58 std::unique_ptr<CallGraphNode> &Node = DeclMap[F]; in getOrInsertNode()
62 Node = std::make_unique<CallGraphNode>(F); in getOrInsertNode()
66 CallGraphNode *HelperDeclRefGraph::getNode(const Decl *D) const { in getNode()
71 llvm::DenseSet<const CallGraphNode *>
76 llvm::DenseSet<const CallGraphNode *> ConnectedNodes; in getReachableNodes()
77 std::function<void(const CallGraphNode *)> VisitNode = in getReachableNodes()
[all …]
/external/llvm-project/clang-tools-extra/clang-tidy/misc/
DNoRecursionCheck.cpp155 llvm::SmallVector<CallGraphNode::CallRecord, SmallCallStackSize>;
160 CallStackTy PathfindSomeCycle(ArrayRef<CallGraphNode *> SCC) { in PathfindSomeCycle()
163 const ImmutableSmallSet<CallGraphNode *, SmallSCCSize> SCCElts(SCC); in PathfindSomeCycle()
166 auto NodeIsPartOfSCC = [&SCCElts](CallGraphNode *N) { in PathfindSomeCycle()
171 SmartSmallSetVector<CallGraphNode::CallRecord, SmallCallStackSize> in PathfindSomeCycle()
175 CallGraphNode::CallRecord EntryNode(SCC.front(), /*CallExpr=*/nullptr); in PathfindSomeCycle()
178 CallGraphNode::CallRecord *Node = &EntryNode; in PathfindSomeCycle()
202 void NoRecursionCheck::handleSCC(ArrayRef<CallGraphNode *> SCC) { in handleSCC()
206 for (CallGraphNode *N : SCC) { in handleSCC()
222 ArrayRef<CallGraphNode::CallRecord>(EventuallyCyclicCallStack) in handleSCC()
[all …]
/external/llvm-project/clang/lib/Analysis/
DCallGraph.cpp48 CallGraphNode *CallerNode;
51 CGBuilder(CallGraph *g, CallGraphNode *N) : G(g), CallerNode(N) {} in CGBuilder()
71 CallGraphNode *CalleeNode = G->getOrInsertNode(D); in addCalledDecl()
182 CallGraphNode *Node = getOrInsertNode(D); in addNodeForDecl()
197 CallGraphNode *CallGraph::getNode(const Decl *F) const { in getNode()
203 CallGraphNode *CallGraph::getOrInsertNode(Decl *F) { in getOrInsertNode()
207 std::unique_ptr<CallGraphNode> &Node = FunctionMap[F]; in getOrInsertNode()
211 Node = std::make_unique<CallGraphNode>(F); in getOrInsertNode()
226 const CallGraphNode *N = *I; in print()
235 for (CallGraphNode::const_iterator CI = N->begin(), in print()
[all …]
/external/llvm-project/llvm/lib/Transforms/Utils/
DCallGraphUpdater.cpp34 CallGraphNode *DeadCGN = (*CG)[DeadFn]; in finalize()
42 CallGraphNode *DeadCGN = CG->getOrInsertFunction(DeadFn); in finalize()
89 CallGraphNode *OldCGN = CG->getOrInsertFunction(&Fn); in reanalyzeFunction()
114 CallGraphNode *DeadCGN = (*CG)[&DeadFn]; in removeFunction()
125 CallGraphNode *OldCGN = (*CG)[&OldFn]; in replaceFunctionWith()
126 CallGraphNode *NewCGN = CG->getOrInsertFunction(&NewFn); in replaceFunctionWith()
146 CallGraphNode *NewCalleeNode = in replaceCallSite()
148 CallGraphNode *CallerNode = (*CG)[Caller]; in replaceCallSite()
149 if (llvm::none_of(*CallerNode, [&OldCS](const CallGraphNode::CallRecord &CR) { in replaceCallSite()
163 CallGraphNode *CallerNode = (*CG)[Caller]; in removeCallSite()

1234