Home
last modified time | relevance | path

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

/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/PBQP/
H A DGraph.h74 AdjEdgeIdx addAdjEdgeId(EdgeId EId) { in addAdjEdgeId()
189 EdgeEntry& getEdge(EdgeId EId) { return Edges[EId]; } in getEdge()
190 const EdgeEntry& getEdge(EdgeId EId) const { return Edges[EId]; } in getEdge()
208 EdgeId EId = 0; in addConstructedEdge() local
273 EdgeId findNextInUse(EdgeId EId) const { in findNextInUse()
361 for (auto EId : edgeIds()) in setSolver() local
415 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, AllocatedCosts)); in addEdge() local
440 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, Costs)); in addEdgeBypassingCostAllocator() local
508 void updateEdgeCosts(EdgeId EId, OtherMatrixT Costs) { in updateEdgeCosts()
523 const MatrixPtr& getEdgeCostsPtr(EdgeId EId) const { in getEdgeCostsPtr()
[all …]
H A DReductionRules.h40 EdgeId EId = *G.adjEdgeIds(NId).begin(); in applyR1() local
202 for (auto EId : G.adjEdgeIds(NId)) { in backpropagate() local
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
H A DRegAllocPBQP.h309 void handleAddEdge(EdgeId EId) { in handleAddEdge()
314 void handleDisconnectEdge(EdgeId EId, NodeId NId) { in handleDisconnectEdge()
321 void handleReconnectEdge(EdgeId EId, NodeId NId) { in handleReconnectEdge()
327 void handleUpdateCosts(EdgeId EId, const Matrix& NewCosts) { in handleUpdateCosts()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/
H A DRegAllocPBQP.cpp428 PBQPRAGraph::EdgeId EId = G.addEdge(NId, MId, std::move(M)); in createInterferenceEdge() local
481 PBQPRAGraph::EdgeId EId = G.findEdge(N1Id, N2Id); in apply() local
907 for (auto EId : edgeIds()) { in dump() local
934 for (auto EId : edgeIds()) { in printDot() local