Searched refs:EdgeId (Results 1 – 5 of 5) sorted by relevance
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| D | Graph.h | 32 typedef unsigned EdgeId; typedef
40 static EdgeId invalidEdgeId() { in invalidEdgeId()
41 return std::numeric_limits<EdgeId>::max(); in invalidEdgeId()
67 typedef std::vector<EdgeId> AdjEdgeList;
77 AdjEdgeIdx addAdjEdgeId(EdgeId EId) { in addAdjEdgeId()
120 void connectToN(Graph &G, EdgeId ThisEdgeId, unsigned NIdx) { in connectToN()
127 void connectTo(Graph &G, EdgeId ThisEdgeId, NodeId NId) { in connectTo()
136 void connect(Graph &G, EdgeId ThisEdgeId) { in connect()
188 typedef std::vector<EdgeId> FreeEdgeVector;
203 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/include/llvm/CodeGen/ |
| D | RegAllocPBQP.h | 339 typedef GraphBase::EdgeId EdgeId; typedef
366 void handleAddEdge(EdgeId EId) { in handleAddEdge()
371 void handleRemoveEdge(EdgeId EId) { in handleRemoveEdge()
376 void handleDisconnectEdge(EdgeId EId, NodeId NId) { in handleDisconnectEdge()
383 void handleReconnectEdge(EdgeId EId, NodeId NId) { in handleReconnectEdge()
389 void handleUpdateCosts(EdgeId EId, const Matrix& NewCosts) { in handleUpdateCosts()
|
| /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/lib/CodeGen/ |
| D | RegAllocPBQP.cpp | 395 PBQPRAGraph::EdgeId EId = G.addEdge(NId, MId, std::move(M)); in createInterferenceEdge()
451 PBQPRAGraph::EdgeId EId = G.findEdge(N1Id, N2Id); in apply()
|