Searched defs:EId (Results 1 – 4 of 4) sorted by relevance
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| D | Graph.h | 76 AdjEdgeIdx addAdjEdgeId(EdgeId EId) { in addAdjEdgeId()
202 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; } in getEdge()
203 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; } in getEdge()
221 EdgeId EId = 0; in addConstructedEdge() local
290 EdgeId findNextInUse(EdgeId EId) const { in findNextInUse()
367 for (auto EId : edgeIds()) in setSolver() local
421 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, AllocatedCosts)); in addEdge() local
446 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, Costs)); in addEdgeBypassingCostAllocator() local
514 void updateEdgeCosts(EdgeId EId, OtherMatrixT Costs) { in updateEdgeCosts()
529 const MatrixPtr& getEdgeCostsPtr(EdgeId EId) const { in getEdgeCostsPtr()
[all …]
|
| D | ReductionRules.h | 39 EdgeId EId = *G.adjEdgeIds(NId).begin(); in applyR1() local
201 for (auto EId : G.adjEdgeIds(NId)) { in backpropagate() local
|
| /external/llvm/include/llvm/CodeGen/ |
| D | RegAllocPBQP.h | 366 void handleAddEdge(EdgeId EId) { in handleAddEdge()
371 void handleRemoveEdge(EdgeId EId) { in handleRemoveEdge()
376 void handleDisconnectEdge(EdgeId EId, NodeId NId) { in handleDisconnectEdge()
383 void handleReconnectEdge(EdgeId EId, NodeId NId) { in handleReconnectEdge()
389 void handleUpdateCosts(EdgeId EId, const Matrix& NewCosts) { in handleUpdateCosts()
|
| /external/llvm/lib/CodeGen/ |
| D | RegAllocPBQP.cpp | 394 PBQPRAGraph::EdgeId EId = G.addEdge(NId, MId, std::move(M)); in createInterferenceEdge() local
450 PBQPRAGraph::EdgeId EId = G.findEdge(N1Id, N2Id); in apply() local
844 for (auto EId : edgeIds()) { in dump() local
868 for (auto EId : edgeIds()) { in printDot() local
|