Searched refs:EdgeId (Results 1 – 5 of 5) sorted by relevance
| /freebsd-12.1/contrib/llvm/include/llvm/CodeGen/PBQP/ |
| H A D | Graph.h | 30 using EdgeId = unsigned; variable
38 static EdgeId invalidEdgeId() { in invalidEdgeId()
39 return std::numeric_limits<EdgeId>::max(); in invalidEdgeId()
65 using AdjEdgeList = std::vector<EdgeId>;
75 AdjEdgeIdx addAdjEdgeId(EdgeId EId) { in addAdjEdgeId()
206 EdgeId addConstructedEdge(EdgeEntry E) { in addConstructedEdge()
209 EdgeId EId = 0; in addConstructedEdge()
274 EdgeId findNextInUse(EdgeId EId) const { in findNextInUse()
281 EdgeId CurEId, EndEId;
594 EdgeId EId = *AEItr; in removeNode()
[all …]
|
| H A D | ReductionRules.h | 33 using EdgeId = typename GraphT::EdgeId; in applyR1() local
41 EdgeId EId = *G.adjEdgeIds(NId).begin(); in applyR1()
77 using EdgeId = typename GraphT::EdgeId; in applyR2() local
88 EdgeId YXEId = *AEItr, in applyR2()
130 EdgeId YZEId = G.findEdge(YNId, ZNId); in applyR2()
|
| /freebsd-12.1/contrib/llvm/include/llvm/CodeGen/ |
| H A D | RegAllocPBQP.h | 280 using EdgeId = GraphBase::EdgeId; variable
308 void handleAddEdge(EdgeId EId) { in handleAddEdge()
313 void handleDisconnectEdge(EdgeId EId, NodeId NId) { in handleDisconnectEdge()
320 void handleReconnectEdge(EdgeId EId, NodeId NId) { in handleReconnectEdge()
326 void handleUpdateCosts(EdgeId EId, const Matrix& NewCosts) { in handleUpdateCosts()
|
| /freebsd-12.1/contrib/llvm/lib/Target/AArch64/ |
| H A D | AArch64PBQPRegAlloc.cpp | 182 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); in addIntraChainConstraint()
278 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); in addInterChainConstraint()
|
| /freebsd-12.1/contrib/llvm/lib/CodeGen/ |
| H A D | RegAllocPBQP.cpp | 430 PBQPRAGraph::EdgeId EId = G.addEdge(NId, MId, std::move(M)); in createInterferenceEdge()
484 PBQPRAGraph::EdgeId EId = G.findEdge(N1Id, N2Id); in apply()
|