Searched refs:N1Id (Results 1 - 2 of 2) sorted by relevance
/external/llvm/include/llvm/CodeGen/PBQP/ |
H A D | RegAllocSolver.h | 201 NodeId N1Id = G.getEdgeNode1Id(EId); local 203 NodeMetadata& N1Md = G.getNodeMetadata(N1Id); 206 N1Md.handleAddEdge(MMd, N1Id != G.getEdgeNode1Id(EId)); 331 bool operator()(NodeId N1Id, NodeId N2Id) { argument 332 PBQPNum N1SC = G.getNodeCosts(N1Id)[0] / G.getNodeDegree(N1Id);
|
H A D | Graph.h | 102 EdgeEntry(NodeId N1Id, NodeId N2Id, MatrixPtr Costs) argument 104 NIds[0] = N1Id; 367 /// @param N1Id First node. 371 EdgeId addEdge(NodeId N1Id, NodeId N2Id, OtherVectorT Costs) { argument 372 assert(getNodeCosts(N1Id).getLength() == Costs.getRows() && 377 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, AllocatedCosts)); 480 /// @param N1Id First node id. 482 /// @return An id for edge (N1Id, N2Id) if such an edge exists, 484 EdgeId findEdge(NodeId N1Id, NodeId N2Id) { argument 485 for (auto AEId : adjEdgeIds(N1Id)) { 598 NodeId N1Id = getEdgeNode1Id(EId); local [all...] |
Completed in 64 milliseconds