Searched refs:N2Id (Results 1 – 3 of 3) sorted by relevance
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| D | Graph.h | 105 EdgeEntry(NodeId N1Id, NodeId N2Id, MatrixPtr Costs) in EdgeEntry() argument
108 NIds[1] = N2Id; in EdgeEntry()
416 EdgeId addEdge(NodeId N1Id, NodeId N2Id, OtherVectorT Costs) { in addEdge() argument
418 getNodeCosts(N2Id).getLength() == Costs.getCols() && in addEdge()
422 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, AllocatedCosts)); in addEdge()
441 NodeId addEdgeBypassingCostAllocator(NodeId N1Id, NodeId N2Id, in addEdgeBypassingCostAllocator() argument
444 getNodeCosts(N2Id).getLength() == Costs->getCols() && in addEdgeBypassingCostAllocator()
447 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, Costs)); in addEdgeBypassingCostAllocator()
580 EdgeId findEdge(NodeId N1Id, NodeId N2Id) { in findEdge() argument
582 if ((getEdgeNode1Id(AEId) == N2Id) || in findEdge()
[all …]
|
| /external/llvm/lib/CodeGen/ |
| D | RegAllocPBQP.cpp | 445 PBQPRAGraph::NodeId N2Id = G.getMetadata().getNodeIdForVReg(SrcReg); in apply() local
449 &G.getNodeMetadata(N2Id).getAllowedRegs(); in apply()
451 PBQPRAGraph::EdgeId EId = G.findEdge(N1Id, N2Id); in apply()
456 G.addEdge(N1Id, N2Id, std::move(Costs)); in apply()
458 if (G.getEdgeNode1Id(EId) == N2Id) { in apply()
459 std::swap(N1Id, N2Id); in apply()
831 NodeId N2Id = getEdgeNode2Id(EId); in dump() local
832 assert(N1Id != N2Id && "PBQP graphs should not have self-edges."); in dump()
837 OS << PrintNodeInfo(N2Id, *this) << ' ' << M.getCols() << " cols:\n"; in dump()
|
| /external/llvm/include/llvm/CodeGen/ |
| D | RegAllocPBQP.h | 391 NodeId N2Id = G.getEdgeNode2Id(EId); in handleUpdateCosts() local
393 NodeMetadata& N2Md = G.getNodeMetadata(N2Id); in handleUpdateCosts()
410 promote(N2Id, N2Md); in handleUpdateCosts()
546 bool operator()(NodeId N1Id, NodeId N2Id) { in operator()
548 PBQPNum N2SC = G.getNodeCosts(N2Id)[0]; in operator()
550 return G.getNodeDegree(N1Id) < G.getNodeDegree(N2Id); in operator()
|