Home
last modified time | relevance | path

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

/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/PBQP/
H A DReductionRules.h48 if (NId == G.getEdgeNode1Id(EId)) { in applyR1()
93 bool FlipEdge1 = (G.getEdgeNode1Id(YXEId) == NId), in applyR2()
94 FlipEdge2 = (G.getEdgeNode1Id(ZXEId) == NId); in applyR2()
135 if (YNId == G.getEdgeNode1Id(YZEId)) { in applyR2()
204 if (NId == G.getEdgeNode1Id(EId)) { in backpropagate()
208 NodeId mId = G.getEdgeNode1Id(EId); in backpropagate()
H A DGraph.h545 NodeId getEdgeNode1Id(EdgeId EId) const { in getEdgeNode1Id() function
575 if ((getEdgeNode1Id(AEId) == N2Id) || in findEdge()
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DRegAllocPBQP.h311 handleReconnectEdge(EId, G.getEdgeNode1Id(EId)); in handleAddEdge()
329 NodeId N1Id = G.getEdgeNode1Id(EId); in handleUpdateCosts()
333 bool Transpose = N1Id != G.getEdgeNode1Id(EId); in handleUpdateCosts()
/freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64PBQPRegAlloc.cpp201 if (G.getEdgeNode1Id(edge) == node2) { in addIntraChainConstraint()
278 if (G.getEdgeNode1Id(edge) == node2) { in addInterChainConstraint()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DRegAllocPBQP.cpp488 if (G.getEdgeNode1Id(EId) == N2Id) { in apply()
910 NodeId N1Id = getEdgeNode1Id(EId); in dump()
937 OS << " node" << getEdgeNode1Id(EId) in printDot()