Home
last modified time | relevance | path

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

/external/llvm/include/llvm/CodeGen/PBQP/
DReductionRules.h47 if (NId == G.getEdgeNode1Id(EId)) { in applyR1()
92 bool FlipEdge1 = (G.getEdgeNode1Id(YXEId) == NId), in applyR2()
93 FlipEdge2 = (G.getEdgeNode1Id(ZXEId) == NId); in applyR2()
134 if (YNId == G.getEdgeNode1Id(YZEId)) { in applyR2()
203 if (NId == G.getEdgeNode1Id(EId)) { in backpropagate()
207 NodeId mId = G.getEdgeNode1Id(EId); in backpropagate()
DGraph.h551 NodeId getEdgeNode1Id(EdgeId EId) const { in getEdgeNode1Id() function
581 if ((getEdgeNode1Id(AEId) == N2Id) || in findEdge()
/external/llvm/include/llvm/CodeGen/
DRegAllocPBQP.h367 handleReconnectEdge(EId, G.getEdgeNode1Id(EId)); in handleAddEdge()
372 handleDisconnectEdge(EId, G.getEdgeNode1Id(EId)); in handleRemoveEdge()
390 NodeId N1Id = G.getEdgeNode1Id(EId); in handleUpdateCosts()
394 bool Transpose = N1Id != G.getEdgeNode1Id(EId); in handleUpdateCosts()
/external/llvm/lib/Target/AArch64/
DAArch64PBQPRegAlloc.cpp207 if (G.getEdgeNode1Id(edge) == node2) { in addIntraChainConstraint()
284 if (G.getEdgeNode1Id(edge) == node2) { in addInterChainConstraint()
/external/llvm/lib/CodeGen/
DRegAllocPBQP.cpp457 if (G.getEdgeNode1Id(EId) == N2Id) { in apply()
845 NodeId N1Id = getEdgeNode1Id(EId); in dump()
869 OS << " node" << getEdgeNode1Id(EId) in printDot()