Home
last modified time | relevance | path

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

/external/llvm/include/llvm/CodeGen/PBQP/
DReductionRules.h46 if (NId == G.getEdgeNode1Id(EId)) { in applyR1()
91 bool FlipEdge1 = (G.getEdgeNode1Id(YXEId) == NId), in applyR2()
92 FlipEdge2 = (G.getEdgeNode1Id(ZXEId) == NId); in applyR2()
133 if (YNId == G.getEdgeNode1Id(YZEId)) { in applyR2()
174 if (NId == G.getEdgeNode1Id(EId)) { in backpropagate()
178 NodeId mId = G.getEdgeNode1Id(EId); in backpropagate()
DRegAllocSolver.h168 handleReconnectEdge(EId, G.getEdgeNode1Id(EId)); in handleAddEdge()
173 handleDisconnectEdge(EId, G.getEdgeNode1Id(EId)); in handleRemoveEdge()
201 NodeId N1Id = G.getEdgeNode1Id(EId); in handleSetEdgeCosts()
206 N1Md.handleAddEdge(MMd, N1Id != G.getEdgeNode1Id(EId)); in handleSetEdgeCosts()
207 N2Md.handleAddEdge(MMd, N2Id != G.getEdgeNode1Id(EId)); in handleSetEdgeCosts()
DGraph.h456 NodeId getEdgeNode1Id(EdgeId EId) { in getEdgeNode1Id() function
486 if ((getEdgeNode1Id(AEId) == N2Id) || in findEdge()
598 NodeId N1Id = getEdgeNode1Id(EId); in dump()
627 OS << " node" << getEdgeNode1Id(EId) in printDot()
/external/llvm/lib/CodeGen/
DRegAllocPBQP.cpp373 if (g.getEdgeNode1Id(edge) == node2) { in build()