Searched refs:N2Id (Results 1 - 2 of 2) sorted by relevance
/external/llvm/include/llvm/CodeGen/PBQP/ |
H A D | RegAllocSolver.h | 202 NodeId N2Id = G.getEdgeNode2Id(EId); local 204 NodeMetadata& N2Md = G.getNodeMetadata(N2Id); 207 N2Md.handleAddEdge(MMd, N2Id != G.getEdgeNode1Id(EId)); 331 bool operator()(NodeId N1Id, NodeId N2Id) { argument 333 PBQPNum N2SC = G.getNodeCosts(N2Id)[0] / G.getNodeDegree(N2Id);
|
H A D | Graph.h | 102 EdgeEntry(NodeId N1Id, NodeId N2Id, MatrixPtr Costs) argument 105 NIds[1] = N2Id; 368 /// @param N2Id Second node. 371 EdgeId addEdge(NodeId N1Id, NodeId N2Id, OtherVectorT Costs) { argument 373 getNodeCosts(N2Id).getLength() == Costs.getCols() && 377 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, AllocatedCosts)); 481 /// @param N2Id Second node id. 482 /// @return An id for edge (N1Id, N2Id) if such an edge exists, 484 EdgeId findEdge(NodeId N1Id, NodeId N2Id) { argument 486 if ((getEdgeNode1Id(AEId) == N2Id) || 599 NodeId N2Id = getEdgeNode2Id(EId); local [all...] |
Completed in 75 milliseconds