Searched refs:EId (Results 1 - 3 of 3) sorted by relevance

/external/llvm/include/llvm/CodeGen/PBQP/
H A DGraph.h74 AdjEdgeIdx addAdjEdgeId(EdgeId EId) { argument
76 AdjEdgeIds.push_back(EId);
193 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; } argument
194 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; }
212 EdgeId EId = 0; local
214 EId = FreeEdgeIds.back();
216 Edges[EId] = std::move(E);
218 EId
377 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, AllocatedCosts)); local
433 setEdgeCosts(EdgeId EId, OtherMatrixT Costs) argument
456 getEdgeNode1Id(EdgeId EId) argument
463 getEdgeNode2Id(EdgeId EId) argument
471 getEdgeOtherNodeId(EdgeId EId, NodeId NId) argument
504 EdgeId EId = *AEItr; local
536 disconnectEdge(EdgeId EId, NodeId NId) argument
555 reconnectEdge(EdgeId EId, NodeId NId) argument
564 removeEdge(EdgeId EId) argument
[all...]
H A DRegAllocSolver.h167 void handleAddEdge(EdgeId EId) { argument
168 handleReconnectEdge(EId, G.getEdgeNode1Id(EId));
169 handleReconnectEdge(EId, G.getEdgeNode2Id(EId));
172 void handleRemoveEdge(EdgeId EId) { argument
173 handleDisconnectEdge(EId, G.getEdgeNode1Id(EId));
174 handleDisconnectEdge(EId, G.getEdgeNode2Id(EId));
177 handleDisconnectEdge(EdgeId EId, NodeId NId) argument
192 handleReconnectEdge(EdgeId EId, NodeId NId) argument
198 handleSetEdgeCosts(EdgeId EId, const Matrix& NewCosts) argument
[all...]
H A DReductionRules.h38 EdgeId EId = *G.adjEdgeIds(NId).begin(); local
39 NodeId MId = G.getEdgeOtherNodeId(EId, NId);
41 const Matrix &ECosts = G.getEdgeCosts(EId);
46 if (NId == G.getEdgeNode1Id(EId)) {
68 G.disconnectEdge(EId, MId);
172 for (auto EId : G.adjEdgeIds(NId)) {
173 const Matrix& edgeCosts = G.getEdgeCosts(EId);
174 if (NId == G.getEdgeNode1Id(EId)) {
175 NodeId mId = G.getEdgeNode2Id(EId);
178 NodeId mId = G.getEdgeNode1Id(EId);
[all...]

Completed in 70 milliseconds