Home
last modified time | relevance | path

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

/llvm-project-15.0.7/llvm/include/llvm/CodeGen/PBQP/
H A DGraph.h189 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
214 EId = Edges.size(); in addConstructedEdge()
222 return EId; in addConstructedEdge()
274 while (EId < EndEId && is_contained(FreeEdgeIds, EId)) { in findNextInUse()
275 ++EId; in findNextInUse()
277 return EId; in findNextInUse()
418 return EId; in addEdge()
443 return EId; in addEdgeBypassingCostAllocator()
[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()
/llvm-project-15.0.7/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
318 NMd.handleRemoveEdge(MMd, NId == G.getEdgeNode2Id(EId)); in handleDisconnectEdge()
322 void handleReconnectEdge(EdgeId EId, NodeId NId) { in handleReconnectEdge() argument
325 NMd.handleAddEdge(MMd, NId == G.getEdgeNode2Id(EId)); in handleReconnectEdge()
328 void handleUpdateCosts(EdgeId EId, const Matrix& NewCosts) { in handleUpdateCosts() argument
329 NodeId N1Id = G.getEdgeNode1Id(EId); in handleUpdateCosts()
330 NodeId N2Id = G.getEdgeNode2Id(EId); in handleUpdateCosts()
[all …]
/llvm-project-15.0.7/llvm/lib/CodeGen/
H A DRegAllocPBQP.cpp429 C[K] = G.getEdgeCostsPtr(EId); in createInterferenceEdge()
482 if (EId == G.invalidEdgeId()) { in apply()
488 if (G.getEdgeNode1Id(EId) == N2Id) { in apply()
908 for (auto EId : edgeIds()) { in dump() local
909 NodeId N1Id = getEdgeNode1Id(EId); in dump()
910 NodeId N2Id = getEdgeNode2Id(EId); in dump()
912 const Matrix &M = getEdgeCosts(EId); in dump()
935 for (auto EId : edgeIds()) { in printDot() local
936 OS << " node" << getEdgeNode1Id(EId) in printDot()
937 << " -- node" << getEdgeNode2Id(EId) in printDot()
[all …]