Home
last modified time | relevance | path

Searched refs:EId (Results 1 – 4 of 4) sorted by relevance

/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/PBQP/
H A DGraph.h74 AdjEdgeIdx addAdjEdgeId(EdgeId EId) { in addAdjEdgeId() argument
76 AdjEdgeIds.push_back(EId); in addAdjEdgeId()
189 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; } in getEdge() argument
190 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; } in getEdge() argument
208 EdgeId EId = 0; in addConstructedEdge() local
210 EId = FreeEdgeIds.back(); in addConstructedEdge()
212 Edges[EId] = std::move(E); in addConstructedEdge()
214 EId = Edges.size(); in addConstructedEdge()
218 EdgeEntry &NE = getEdge(EId); in addConstructedEdge()
221 NE.connect(*this, EId); in addConstructedEdge()
[all …]
H A DReductionRules.h40 EdgeId EId = *G.adjEdgeIds(NId).begin(); in applyR1() local
41 NodeId MId = G.getEdgeOtherNodeId(EId, NId); in applyR1()
43 const Matrix &ECosts = G.getEdgeCosts(EId); in applyR1()
48 if (NId == G.getEdgeNode1Id(EId)) { in applyR1()
70 G.disconnectEdge(EId, MId); in applyR1()
202 for (auto EId : G.adjEdgeIds(NId)) { in backpropagate() local
203 const Matrix& edgeCosts = G.getEdgeCosts(EId); in backpropagate()
204 if (NId == G.getEdgeNode1Id(EId)) { in backpropagate()
205 NodeId mId = G.getEdgeNode2Id(EId); in backpropagate()
208 NodeId mId = G.getEdgeNode1Id(EId); in backpropagate()
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DRegAllocPBQP.h310 void handleAddEdge(EdgeId EId) { in handleAddEdge() argument
311 handleReconnectEdge(EId, G.getEdgeNode1Id(EId)); in handleAddEdge()
312 handleReconnectEdge(EId, G.getEdgeNode2Id(EId)); in handleAddEdge()
315 void handleDisconnectEdge(EdgeId EId, NodeId NId) { in handleDisconnectEdge() argument
317 const MatrixMetadata& MMd = G.getEdgeCosts(EId).getMetadata(); in handleDisconnectEdge()
318 NMd.handleRemoveEdge(MMd, NId == G.getEdgeNode2Id(EId)); in handleDisconnectEdge()
322 void handleReconnectEdge(EdgeId EId, NodeId NId) { in handleReconnectEdge() argument
324 const MatrixMetadata& MMd = G.getEdgeCosts(EId).getMetadata(); in handleReconnectEdge()
325 NMd.handleAddEdge(MMd, NId == G.getEdgeNode2Id(EId)); in handleReconnectEdge()
328 void handleUpdateCosts(EdgeId EId, const Matrix& NewCosts) { in handleUpdateCosts() argument
[all …]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DRegAllocPBQP.cpp428 PBQPRAGraph::EdgeId EId = G.addEdge(NId, MId, std::move(M)); in createInterferenceEdge() local
429 C[K] = G.getEdgeCostsPtr(EId); in createInterferenceEdge()
481 PBQPRAGraph::EdgeId EId = G.findEdge(N1Id, N2Id); in apply() local
482 if (EId == G.invalidEdgeId()) { in apply()
488 if (G.getEdgeNode1Id(EId) == N2Id) { in apply()
492 PBQPRAGraph::RawMatrix Costs(G.getEdgeCosts(EId)); in apply()
494 G.updateEdgeCosts(EId, std::move(Costs)); in apply()
909 for (auto EId : edgeIds()) { in dump() local
910 NodeId N1Id = getEdgeNode1Id(EId); in dump()
911 NodeId N2Id = getEdgeNode2Id(EId); in dump()
[all …]