Searched refs:N1Id (Results 1 - 3 of 3) sorted by relevance
/external/llvm/include/llvm/CodeGen/PBQP/ |
H A D | Graph.h | 104 EdgeEntry(NodeId N1Id, NodeId N2Id, MatrixPtr Costs) argument 106 NIds[0] = N1Id; 410 /// @param N1Id First node. 415 EdgeId addEdge(NodeId N1Id, NodeId N2Id, OtherVectorT Costs) { argument 416 assert(getNodeCosts(N1Id).getLength() == Costs.getRows() && 421 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, AllocatedCosts)); 428 /// @param N1Id First node. 440 NodeId addEdgeBypassingCostAllocator(NodeId N1Id, NodeId N2Id, argument 442 assert(getNodeCosts(N1Id).getLength() == Costs->getRows() && 446 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2I 579 findEdge(NodeId N1Id, NodeId N2Id) argument [all...] |
/external/llvm/include/llvm/CodeGen/ |
H A D | RegAllocPBQP.h | 390 NodeId N1Id = G.getEdgeNode1Id(EId); local 392 NodeMetadata& N1Md = G.getNodeMetadata(N1Id); 394 bool Transpose = N1Id != G.getEdgeNode1Id(EId); 409 promote(N1Id, N1Md); 546 bool operator()(NodeId N1Id, NodeId N2Id) { argument 547 PBQPNum N1SC = G.getNodeCosts(N1Id)[0]; 550 return G.getNodeDegree(N1Id) < G.getNodeDegree(N2Id);
|
/external/llvm/lib/CodeGen/ |
H A D | RegAllocPBQP.cpp | 443 PBQPRAGraph::NodeId N1Id = G.getMetadata().getNodeIdForVReg(DstReg); variable 446 &G.getNodeMetadata(N1Id).getAllowedRegs(); 450 PBQPRAGraph::EdgeId EId = G.findEdge(N1Id, N2Id); 455 G.addEdge(N1Id, N2Id, std::move(Costs)); 458 std::swap(N1Id, N2Id); 845 NodeId N1Id = getEdgeNode1Id(EId); local 847 assert(N1Id != N2Id && "PBQP graphs should not have self-edges."); 851 OS << PrintNodeInfo(N1Id, *this) << ' ' << M.getRows() << " rows / ";
|
Completed in 148 milliseconds