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

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

Completed in 98 milliseconds