Home
last modified time | relevance | path

Searched refs:getNodeCosts (Results 1 – 4 of 4) sorted by relevance

/freebsd-12.1/contrib/llvm/include/llvm/CodeGen/PBQP/
H A DReductionRules.h45 const Vector &XCosts = G.getNodeCosts(NId); in applyR1()
46 RawVector YCosts = G.getNodeCosts(MId); in applyR1()
85 const Vector &XCosts = G.getNodeCosts(NId); in applyR2()
192 RawVector v = G.getNodeCosts(NId); in backpropagate()
H A DGraph.h411 assert(getNodeCosts(N1Id).getLength() == Costs.getRows() && in addEdge()
412 getNodeCosts(N2Id).getLength() == Costs.getCols() && in addEdge()
437 assert(getNodeCosts(N1Id).getLength() == Costs->getRows() && in addEdgeBypassingCostAllocator()
438 getNodeCosts(N2Id).getLength() == Costs->getCols() && in addEdgeBypassingCostAllocator()
489 const Vector& getNodeCosts(NodeId NId) const { in getNodeCosts() function
/freebsd-12.1/contrib/llvm/include/llvm/CodeGen/
H A DRegAllocPBQP.h300 assert(G.getNodeCosts(NId).getLength() > 1 && in handleAddNode()
302 G.getNodeMetadata(NId).setup(G.getNodeCosts(NId)); in handleAddNode()
483 PBQPNum N1SC = G.getNodeCosts(N1Id)[0]; in operator()
484 PBQPNum N2SC = G.getNodeCosts(N2Id)[0]; in operator()
/freebsd-12.1/contrib/llvm/lib/CodeGen/
H A DRegAllocPBQP.cpp208 PBQPRAGraph::RawVector NodeCosts(G.getNodeCosts(NId)); in apply()
472 PBQPRAGraph::RawVector NewCosts(G.getNodeCosts(NId)); in apply()
891 const Vector &Costs = getNodeCosts(NId); in dump()
920 << getNodeCosts(NId) << "\" ]\n"; in printDot()