Home
last modified time | relevance | path

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

/minix3/external/bsd/llvm/dist/llvm/include/llvm/CodeGen/PBQP/
H A DGraph.h76 AdjEdgeIdx addAdjEdgeId(EdgeId EId) { in addAdjEdgeId() argument
78 AdjEdgeIds.push_back(EId); in addAdjEdgeId()
202 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; } in getEdge() argument
203 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; } in getEdge() argument
221 EdgeId EId = 0; in addConstructedEdge() local
223 EId = FreeEdgeIds.back(); in addConstructedEdge()
225 Edges[EId] = std::move(E); in addConstructedEdge()
227 EId = Edges.size(); in addConstructedEdge()
231 EdgeEntry &NE = getEdge(EId); in addConstructedEdge()
234 NE.connect(*this, EId); in addConstructedEdge()
[all …]
H A DReductionRules.h39 EdgeId EId = *G.adjEdgeIds(NId).begin(); in applyR1() local
40 NodeId MId = G.getEdgeOtherNodeId(EId, NId); in applyR1()
42 const Matrix &ECosts = G.getEdgeCosts(EId); in applyR1()
47 if (NId == G.getEdgeNode1Id(EId)) { in applyR1()
69 G.disconnectEdge(EId, MId); in applyR1()
173 for (auto EId : G.adjEdgeIds(NId)) { in backpropagate() local
174 const Matrix& edgeCosts = G.getEdgeCosts(EId); in backpropagate()
175 if (NId == G.getEdgeNode1Id(EId)) { in backpropagate()
176 NodeId mId = G.getEdgeNode2Id(EId); in backpropagate()
179 NodeId mId = G.getEdgeNode1Id(EId); in backpropagate()
/minix3/external/bsd/llvm/dist/llvm/include/llvm/CodeGen/
H A DRegAllocPBQP.h317 void handleAddEdge(EdgeId EId) { in handleAddEdge() argument
318 handleReconnectEdge(EId, G.getEdgeNode1Id(EId)); in handleAddEdge()
319 handleReconnectEdge(EId, G.getEdgeNode2Id(EId)); in handleAddEdge()
322 void handleRemoveEdge(EdgeId EId) { in handleRemoveEdge() argument
323 handleDisconnectEdge(EId, G.getEdgeNode1Id(EId)); in handleRemoveEdge()
324 handleDisconnectEdge(EId, G.getEdgeNode2Id(EId)); in handleRemoveEdge()
327 void handleDisconnectEdge(EdgeId EId, NodeId NId) { in handleDisconnectEdge() argument
329 const MatrixMetadata& MMd = G.getEdgeCosts(EId).getMetadata(); in handleDisconnectEdge()
330 NMd.handleRemoveEdge(MMd, NId == G.getEdgeNode2Id(EId)); in handleDisconnectEdge()
342 void handleReconnectEdge(EdgeId EId, NodeId NId) { in handleReconnectEdge() argument
[all …]
/minix3/external/bsd/llvm/dist/llvm/lib/CodeGen/
H A DRegAllocPBQP.cpp334 PBQPRAGraph::EdgeId EId = G.addEdge(NId, MId, std::move(M)); in createInterferenceEdge() local
335 C[K] = G.getEdgeCostsPtr(EId); in createInterferenceEdge()
388 PBQPRAGraph::EdgeId EId = G.findEdge(N1Id, N2Id); in apply() local
389 if (EId == G.invalidEdgeId()) { in apply()
395 if (G.getEdgeNode1Id(EId) == N2Id) { in apply()
399 PBQPRAGraph::RawMatrix Costs(G.getEdgeCosts(EId)); in apply()
401 G.setEdgeCosts(EId, std::move(Costs)); in apply()