| /external/llvm/include/llvm/CodeGen/PBQP/ |
| D | Graph.h | 31 typedef unsigned EdgeId; typedef
39 static EdgeId invalidEdgeId() { in invalidEdgeId()
40 return std::numeric_limits<EdgeId>::max(); in invalidEdgeId()
66 typedef std::vector<EdgeId> AdjEdgeList;
76 AdjEdgeIdx addAdjEdgeId(EdgeId EId) { in addAdjEdgeId()
119 void connectToN(Graph &G, EdgeId ThisEdgeId, unsigned NIdx) { in connectToN()
126 void connectTo(Graph &G, EdgeId ThisEdgeId, NodeId NId) { in connectTo()
135 void connect(Graph &G, EdgeId ThisEdgeId) { in connect()
187 typedef std::vector<EdgeId> FreeEdgeVector;
202 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; } in getEdge()
[all …]
|
| D | ReductionRules.h | 31 typedef typename GraphT::EdgeId EdgeId; in applyR1() typedef
39 EdgeId EId = *G.adjEdgeIds(NId).begin(); in applyR1()
75 typedef typename GraphT::EdgeId EdgeId; in applyR2() typedef
86 EdgeId YXEId = *AEItr, in applyR2()
128 EdgeId YZEId = G.findEdge(YNId, ZNId); in applyR2()
|
| /external/llvm-project/llvm/include/llvm/CodeGen/PBQP/ |
| D | Graph.h | 29 using EdgeId = unsigned; variable
37 static EdgeId invalidEdgeId() { in invalidEdgeId()
38 return std::numeric_limits<EdgeId>::max(); in invalidEdgeId()
64 using AdjEdgeList = std::vector<EdgeId>;
74 AdjEdgeIdx addAdjEdgeId(EdgeId EId) { in addAdjEdgeId()
111 void connectToN(Graph &G, EdgeId ThisEdgeId, unsigned NIdx) { in connectToN()
118 void connect(Graph &G, EdgeId ThisEdgeId) { in connect()
172 using FreeEdgeVector = std::vector<EdgeId>;
189 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; } in getEdge()
190 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; } in getEdge()
[all …]
|
| D | ReductionRules.h | 32 using EdgeId = typename GraphT::EdgeId; in applyR1() local
40 EdgeId EId = *G.adjEdgeIds(NId).begin(); in applyR1()
76 using EdgeId = typename GraphT::EdgeId; in applyR2() local
87 EdgeId YXEId = *AEItr, in applyR2()
129 EdgeId YZEId = G.findEdge(YNId, ZNId); in applyR2()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/PBQP/ |
| D | Graph.h | 29 using EdgeId = unsigned; variable
37 static EdgeId invalidEdgeId() { in invalidEdgeId()
38 return std::numeric_limits<EdgeId>::max(); in invalidEdgeId()
64 using AdjEdgeList = std::vector<EdgeId>;
74 AdjEdgeIdx addAdjEdgeId(EdgeId EId) { in addAdjEdgeId()
111 void connectToN(Graph &G, EdgeId ThisEdgeId, unsigned NIdx) { in connectToN()
118 void connect(Graph &G, EdgeId ThisEdgeId) { in connect()
172 using FreeEdgeVector = std::vector<EdgeId>;
189 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; } in getEdge()
190 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; } in getEdge()
[all …]
|
| D | ReductionRules.h | 32 using EdgeId = typename GraphT::EdgeId; in applyR1() local
40 EdgeId EId = *G.adjEdgeIds(NId).begin(); in applyR1()
76 using EdgeId = typename GraphT::EdgeId; in applyR2() local
87 EdgeId YXEId = *AEItr, in applyR2()
129 EdgeId YZEId = G.findEdge(YNId, ZNId); in applyR2()
|
| /external/tensorflow/tensorflow/core/common_runtime/ |
| D | mkl_tfconversion_pass_test.cc | 61 static string EdgeId(const Node* n, int index) { in EdgeId() function in tensorflow::__anonf07957f40111::MklToTfConversionPass
81 edges.push_back(strings::StrCat(EdgeId(e->src(), e->src_output()), "->", in CanonicalGraphString()
82 EdgeId(e->dst(), e->dst_input()))); in CanonicalGraphString()
|
| D | mkl_layout_pass_test.cc | 82 static string EdgeId(const Node* n, int index) { in EdgeId() function in tensorflow::__anonc71d68320111::MklLayoutPassTest
102 edges.push_back(strings::StrCat(EdgeId(e->src(), e->src_output()), "->", in CanonicalGraphString()
103 EdgeId(e->dst(), e->dst_input()))); in CanonicalGraphString()
|
| /external/llvm/include/llvm/CodeGen/ |
| D | RegAllocPBQP.h | 340 typedef GraphBase::EdgeId EdgeId; typedef
367 void handleAddEdge(EdgeId EId) { in handleAddEdge()
372 void handleRemoveEdge(EdgeId EId) { in handleRemoveEdge()
377 void handleDisconnectEdge(EdgeId EId, NodeId NId) { in handleDisconnectEdge()
384 void handleReconnectEdge(EdgeId EId, NodeId NId) { in handleReconnectEdge()
390 void handleUpdateCosts(EdgeId EId, const Matrix& NewCosts) { in handleUpdateCosts()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/ |
| D | RegAllocPBQP.h | 279 using EdgeId = GraphBase::EdgeId; variable
307 void handleAddEdge(EdgeId EId) { in handleAddEdge()
312 void handleDisconnectEdge(EdgeId EId, NodeId NId) { in handleDisconnectEdge()
319 void handleReconnectEdge(EdgeId EId, NodeId NId) { in handleReconnectEdge()
325 void handleUpdateCosts(EdgeId EId, const Matrix& NewCosts) { in handleUpdateCosts()
|
| /external/llvm-project/llvm/include/llvm/CodeGen/ |
| D | RegAllocPBQP.h | 281 using EdgeId = GraphBase::EdgeId; variable
309 void handleAddEdge(EdgeId EId) { in handleAddEdge()
314 void handleDisconnectEdge(EdgeId EId, NodeId NId) { in handleDisconnectEdge()
321 void handleReconnectEdge(EdgeId EId, NodeId NId) { in handleReconnectEdge()
327 void handleUpdateCosts(EdgeId EId, const Matrix& NewCosts) { in handleUpdateCosts()
|
| /external/tensorflow/tensorflow/core/graph/ |
| D | optimizer_cse_test.cc | 59 static string EdgeId(const Node* n, int index) { in EdgeId() function in tensorflow::__anonbaccd05e0111::OptimizerCSETest
79 edges.push_back(strings::StrCat(EdgeId(e->src(), e->src_output()), "->", in CanonicalGraphString()
80 EdgeId(e->dst(), e->dst_input()))); in CanonicalGraphString()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AArch64/ |
| D | AArch64PBQPRegAlloc.cpp | 181 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); in addIntraChainConstraint()
277 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); in addInterChainConstraint()
|
| /external/llvm/lib/Target/AArch64/ |
| D | AArch64PBQPRegAlloc.cpp | 182 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); in addIntraChainConstraint()
278 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); in addInterChainConstraint()
|
| /external/llvm-project/llvm/lib/Target/AArch64/ |
| D | AArch64PBQPRegAlloc.cpp | 181 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); in addIntraChainConstraint()
277 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); in addInterChainConstraint()
|
| /external/llvm/lib/CodeGen/ |
| D | RegAllocPBQP.cpp | 402 PBQPRAGraph::EdgeId EId = G.addEdge(NId, MId, std::move(M)); in createInterferenceEdge()
458 PBQPRAGraph::EdgeId EId = G.findEdge(N1Id, N2Id); in apply()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
| D | RegAllocPBQP.cpp | 429 PBQPRAGraph::EdgeId EId = G.addEdge(NId, MId, std::move(M)); in createInterferenceEdge()
483 PBQPRAGraph::EdgeId EId = G.findEdge(N1Id, N2Id); in apply()
|
| /external/llvm-project/llvm/lib/CodeGen/ |
| D | RegAllocPBQP.cpp | 428 PBQPRAGraph::EdgeId EId = G.addEdge(NId, MId, std::move(M)); in createInterferenceEdge()
481 PBQPRAGraph::EdgeId EId = G.findEdge(N1Id, N2Id); in apply()
|