Home
last modified time | relevance | path

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

/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/PBQP/
DGraph.h103 EdgeEntry(NodeId N1Id, NodeId N2Id, MatrixPtr Costs) in EdgeEntry() argument
106 NIds[1] = N2Id; in EdgeEntry()
409 EdgeId addEdge(NodeId N1Id, NodeId N2Id, OtherVectorT Costs) { in addEdge() argument
411 getNodeCosts(N2Id).getLength() == Costs.getCols() && in addEdge()
415 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, AllocatedCosts)); in addEdge()
434 NodeId addEdgeBypassingCostAllocator(NodeId N1Id, NodeId N2Id, in addEdgeBypassingCostAllocator() argument
437 getNodeCosts(N2Id).getLength() == Costs->getCols() && in addEdgeBypassingCostAllocator()
440 EdgeId EId = addConstructedEdge(EdgeEntry(N1Id, N2Id, Costs)); in addEdgeBypassingCostAllocator()
573 EdgeId findEdge(NodeId N1Id, NodeId N2Id) { in findEdge() argument
575 if ((getEdgeNode1Id(AEId) == N2Id) || in findEdge()
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/
DRegAllocPBQP.h327 NodeId N2Id = G.getEdgeNode2Id(EId); in handleUpdateCosts() local
329 NodeMetadata& N2Md = G.getNodeMetadata(N2Id); in handleUpdateCosts()
346 promote(N2Id, N2Md); in handleUpdateCosts()
481 bool operator()(NodeId N1Id, NodeId N2Id) { in operator()
483 PBQPNum N2SC = G.getNodeCosts(N2Id)[0]; in operator()
485 return G.getNodeDegree(N1Id) < G.getNodeDegree(N2Id); in operator()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
DRegAllocPBQP.cpp477 PBQPRAGraph::NodeId N2Id = G.getMetadata().getNodeIdForVReg(SrcReg); in apply() local
481 &G.getNodeMetadata(N2Id).getAllowedRegs(); in apply()
483 PBQPRAGraph::EdgeId EId = G.findEdge(N1Id, N2Id); in apply()
488 G.addEdge(N1Id, N2Id, std::move(Costs)); in apply()
490 if (G.getEdgeNode1Id(EId) == N2Id) { in apply()
491 std::swap(N1Id, N2Id); in apply()
898 NodeId N2Id = getEdgeNode2Id(EId); in dump() local
899 assert(N1Id != N2Id && "PBQP graphs should not have self-edges."); in dump()
904 OS << PrintNodeInfo(N2Id, *this) << ' ' << M.getCols() << " cols:\n"; in dump()