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