Searched defs:N2Id (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 107 NIds[1] = N2Id; 412 /// @param N2Id Second node. 416 EdgeId addEdge(NodeId N1Id, NodeId N2Id, OtherVectorT Costs) { argument 418 getNodeCosts(N2Id).getLength() == Costs.getCols() && 422 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, AllocatedCosts)); 430 /// @param N2Id Second node. 441 NodeId addEdgeBypassingCostAllocator(NodeId N1Id, NodeId N2Id, argument 444 getNodeCosts(N2Id).getLength() == Costs->getCols() && 447 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, Cost 580 findEdge(NodeId N1Id, NodeId N2Id) argument [all...] |
/external/llvm/include/llvm/CodeGen/ |
H A D | RegAllocPBQP.h | 392 NodeId N2Id = G.getEdgeNode2Id(EId); local 394 NodeMetadata& N2Md = G.getNodeMetadata(N2Id); 411 promote(N2Id, N2Md); 547 bool operator()(NodeId N1Id, NodeId N2Id) { argument 549 PBQPNum N2SC = G.getNodeCosts(N2Id)[0]; 551 return G.getNodeDegree(N1Id) < G.getNodeDegree(N2Id);
|
/external/llvm/lib/CodeGen/ |
H A D | RegAllocPBQP.cpp | 452 PBQPRAGraph::NodeId N2Id = G.getMetadata().getNodeIdForVReg(SrcReg); variable 456 &G.getNodeMetadata(N2Id).getAllowedRegs(); 458 PBQPRAGraph::EdgeId EId = G.findEdge(N1Id, N2Id); 463 G.addEdge(N1Id, N2Id, std::move(Costs)); 465 if (G.getEdgeNode1Id(EId) == N2Id) { 466 std::swap(N1Id, N2Id); 850 NodeId N2Id = getEdgeNode2Id(EId); 851 assert(N1Id != N2Id && "PBQP graphs should not have self-edges."); 856 OS << PrintNodeInfo(N2Id, *this) << ' ' << M.getCols() << " cols:\n";
|
Completed in 384 milliseconds