Searched defs:EdgeId (Results 1 - 3 of 3) sorted by relevance
/external/llvm/include/llvm/CodeGen/PBQP/ |
H A D | ReductionRules.h | 31 typedef typename GraphT::EdgeId EdgeId; typedef 39 EdgeId EId = *G.adjEdgeIds(NId).begin(); 75 typedef typename GraphT::EdgeId EdgeId; typedef 86 EdgeId YXEId = *AEItr, 128 EdgeId YZEId = G.findEdge(YNId, ZNId);
|
H A D | Graph.h | 31 typedef unsigned EdgeId; typedef in class:llvm::PBQP::GraphBase 39 static EdgeId invalidEdgeId() { 40 return std::numeric_limits<EdgeId>::max(); 66 typedef std::vector<EdgeId> AdjEdgeList; 76 AdjEdgeIdx addAdjEdgeId(EdgeId EId) { 119 void connectToN(Graph &G, EdgeId ThisEdgeId, unsigned NIdx) { 126 void connectTo(Graph &G, EdgeId ThisEdgeId, NodeId NId) { 135 void connect(Graph &G, EdgeId ThisEdgeId) { 187 typedef std::vector<EdgeId> FreeEdgeVector; 202 EdgeEntry& getEdge(EdgeId EI [all...] |
/external/llvm/include/llvm/CodeGen/ |
H A D | RegAllocPBQP.h | 340 typedef GraphBase::EdgeId EdgeId; typedef in class:llvm::PBQP::RegAlloc::RegAllocSolverImpl 367 void handleAddEdge(EdgeId EId) { 372 void handleRemoveEdge(EdgeId EId) { 377 void handleDisconnectEdge(EdgeId EId, NodeId NId) { 384 void handleReconnectEdge(EdgeId EId, NodeId NId) { 390 void handleUpdateCosts(EdgeId EId, const Matrix& NewCosts) {
|
Completed in 224 milliseconds