Home
last modified time | relevance | path

Searched refs:N2Id (Results 1 – 6 of 6) sorted by relevance

/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/PBQP/
DGraph.h104 EdgeEntry(NodeId N1Id, NodeId N2Id, MatrixPtr Costs) in EdgeEntry() argument
107 NIds[1] = N2Id; in EdgeEntry()
410 EdgeId addEdge(NodeId N1Id, NodeId N2Id, OtherVectorT Costs) { in addEdge() argument
412 getNodeCosts(N2Id).getLength() == Costs.getCols() && in addEdge()
416 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, AllocatedCosts)); in addEdge()
435 NodeId addEdgeBypassingCostAllocator(NodeId N1Id, NodeId N2Id, in addEdgeBypassingCostAllocator() argument
438 getNodeCosts(N2Id).getLength() == Costs->getCols() && in addEdgeBypassingCostAllocator()
441 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, Costs)); in addEdgeBypassingCostAllocator()
574 EdgeId findEdge(NodeId N1Id, NodeId N2Id) { in findEdge() argument
576 if ((getEdgeNode1Id(AEId) == N2Id) || in findEdge()
[all …]
/external/llvm/include/llvm/CodeGen/PBQP/
DGraph.h104 EdgeEntry(NodeId N1Id, NodeId N2Id, MatrixPtr Costs) in EdgeEntry() argument
107 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/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/
DRegAllocPBQP.h328 NodeId N2Id = G.getEdgeNode2Id(EId); in handleUpdateCosts() local
330 NodeMetadata& N2Md = G.getNodeMetadata(N2Id); in handleUpdateCosts()
347 promote(N2Id, N2Md); in handleUpdateCosts()
482 bool operator()(NodeId N1Id, NodeId N2Id) { in operator()
484 PBQPNum N2SC = G.getNodeCosts(N2Id)[0]; in operator()
486 return G.getNodeDegree(N1Id) < G.getNodeDegree(N2Id); in operator()
/external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/
DRegAllocPBQP.cpp478 PBQPRAGraph::NodeId N2Id = G.getMetadata().getNodeIdForVReg(SrcReg); in apply() local
482 &G.getNodeMetadata(N2Id).getAllowedRegs(); in apply()
484 PBQPRAGraph::EdgeId EId = G.findEdge(N1Id, N2Id); in apply()
489 G.addEdge(N1Id, N2Id, std::move(Costs)); in apply()
491 if (G.getEdgeNode1Id(EId) == N2Id) { in apply()
492 std::swap(N1Id, N2Id); in apply()
899 NodeId N2Id = getEdgeNode2Id(EId); in dump() local
900 assert(N1Id != N2Id && "PBQP graphs should not have self-edges."); in dump()
905 OS << PrintNodeInfo(N2Id, *this) << ' ' << M.getCols() << " cols:\n"; in dump()
/external/llvm/lib/CodeGen/
DRegAllocPBQP.cpp452 PBQPRAGraph::NodeId N2Id = G.getMetadata().getNodeIdForVReg(SrcReg); in apply() local
456 &G.getNodeMetadata(N2Id).getAllowedRegs(); in apply()
458 PBQPRAGraph::EdgeId EId = G.findEdge(N1Id, N2Id); in apply()
463 G.addEdge(N1Id, N2Id, std::move(Costs)); in apply()
465 if (G.getEdgeNode1Id(EId) == N2Id) { in apply()
466 std::swap(N1Id, N2Id); in apply()
850 NodeId N2Id = getEdgeNode2Id(EId); in dump() local
851 assert(N1Id != N2Id && "PBQP graphs should not have self-edges."); in dump()
856 OS << PrintNodeInfo(N2Id, *this) << ' ' << M.getCols() << " cols:\n"; in dump()
/external/llvm/include/llvm/CodeGen/
DRegAllocPBQP.h392 NodeId N2Id = G.getEdgeNode2Id(EId); in handleUpdateCosts() local
394 NodeMetadata& N2Md = G.getNodeMetadata(N2Id); in handleUpdateCosts()
411 promote(N2Id, N2Md); in handleUpdateCosts()
547 bool operator()(NodeId N1Id, NodeId N2Id) { in operator()
549 PBQPNum N2SC = G.getNodeCosts(N2Id)[0]; in operator()
551 return G.getNodeDegree(N1Id) < G.getNodeDegree(N2Id); in operator()